text
stringlengths 2
100k
| meta
dict |
|---|---|
/*
* Copyright (c) 1997, 2019, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code 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
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package java.security.spec;
import java.security.GeneralSecurityException;
/**
* This is the exception for invalid parameter specifications.
*
* @author Jan Luehe
*
*
* @see java.security.AlgorithmParameters
* @see AlgorithmParameterSpec
* @see DSAParameterSpec
*
* @since 1.2
*/
public class InvalidParameterSpecException extends GeneralSecurityException {
@java.io.Serial
private static final long serialVersionUID = -970468769593399342L;
/**
* Constructs an InvalidParameterSpecException with no detail message. A
* detail message is a String that describes this particular
* exception.
*/
public InvalidParameterSpecException() {
super();
}
/**
* Constructs an InvalidParameterSpecException with the specified detail
* message. A detail message is a String that describes this
* particular exception.
*
* @param msg the detail message.
*/
public InvalidParameterSpecException(String msg) {
super(msg);
}
}
| {
"pile_set_name": "Github"
} |
# [1573. Number of Ways to Split a String](https://leetcode.com/problems/number-of-ways-to-split-a-string)
[中文文档](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md)
## Description
<p>Given a binary string <code>s</code> (a string consisting only of '0's and '1's), we can split <code>s</code> into 3 <strong>non-empty</strong> strings s1, s2, s3 (s1+ s2+ s3 = s).</p>
<p>Return the number of ways <code>s</code> can be split such that the number of characters '1' is the same in s1, s2, and s3.</p>
<p>Since the answer may be too large, return it modulo 10^9 + 7.</p>
<p> </p>
<p><strong>Example 1:</strong></p>
<pre>
<strong>Input:</strong> s = "10101"
<strong>Output:</strong> 4
<strong>Explanation:</strong> There are four ways to split s in 3 parts where each part contain the same number of letters '1'.
"1|010|1"
"1|01|01"
"10|10|1"
"10|1|01"
</pre>
<p><strong>Example 2:</strong></p>
<pre>
<strong>Input:</strong> s = "1001"
<strong>Output:</strong> 0
</pre>
<p><strong>Example 3:</strong></p>
<pre>
<strong>Input:</strong> s = "0000"
<strong>Output:</strong> 3
<strong>Explanation:</strong> There are three ways to split s in 3 parts.
"0|0|00"
"0|00|0"
"00|0|0"
</pre>
<p><strong>Example 4:</strong></p>
<pre>
<strong>Input:</strong> s = "100100010100110"
<strong>Output:</strong> 12
</pre>
<p> </p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>3 <= s.length <= 10^5</code></li>
<li><code>s[i]</code> is <code>'0'</code> or <code>'1'</code>.</li>
</ul>
## Solutions
<!-- tabs:start -->
### **Python3**
```python
```
### **Java**
```java
```
### **...**
```
```
<!-- tabs:end -->
| {
"pile_set_name": "Github"
} |
<!--
Copyright (c) 2005, 2018 Oracle and/or its affiliates. All rights reserved.
This program and the accompanying materials are made available under the
terms of the Eclipse Public License v. 2.0, which is available at
http://www.eclipse.org/legal/epl-2.0.
This Source Code may also be made available under the following Secondary
Licenses when the conditions for such availability set forth in the
Eclipse Public License v. 2.0 are satisfied: GNU General Public License,
version 2 with the GNU Classpath Exception, which is available at
https://www.gnu.org/software/classpath/license.html.
SPDX-License-Identifier: EPL-2.0 OR GPL-2.0 WITH Classpath-exception-2.0
-->
<p><a id="ref-realms" name="ref-realms"></a><a id="GHCOM00097" name="GHCOM00097"></a></p>
<h4><a id="sthref197" name="sthref197"></a>Realms</h4>
<a name="BEGIN" id="BEGIN"></a>
<p>The GlassFish Server comes preconfigured with three realms: <code>file</code>, <code>certificate</code>, and <code>admin-realm</code>. It is also possible to create <code>ldap</code>, <code>JDBC</code>, <code>solaris</code>, and custom realms. Generally, you will have one realm of each type on a server, but on the GlassFish Server there are two file realms: <code>file</code> and <code>admin-realm</code>. These are two realms of the same type used for two different purposes. It is also possible to have a different certificate database for each virtual server on your system.</p>
<p>Use the Realms page to configure realms.</p>
<p>For each realm, the following information is provided.</p>
<dl>
<dt>Name</dt>
<dd>
<p>The name of the realm.</p>
</dd>
<dt>Class Name</dt>
<dd>
<p>The class name for the realm.</p>
</dd>
</dl>
<p>The Realms table also contains the following options.</p>
<dl>
<dt>New</dt>
<dd>
<p>Button to create a new realm.</p>
</dd>
<dt>Delete</dt>
<dd>
<p>Button to delete one or more selected realms.</p>
</dd>
</dl>
<a id="GHCOM429" name="GHCOM429"></a>
<h5>Related Tasks</h5>
<ul>
<li>
<p><a href="task-realmnew.html">To Create a Realm</a></p>
</li>
<li>
<p><a href="task-realmedit.html">To Edit a Realm</a></p>
</li>
<li>
<p><a href="task-todeleterealm.html">To Delete a Realm</a></p>
</li>
<li>
<p><a href="task-createcustomrealm.html">To Create a Custom Realm</a></p>
</li>
</ul>
<a id="GHCOM430" name="GHCOM430"></a>
<h5>Related asadmin Commands</h5>
<ul>
<li>
<p><a href="http://www.oracle.com/pls/topic/lookup?ctx=E26576_01&id=GSRFM00015"><code>create-auth-realm</code>(1)</a></p>
</li>
<li>
<p><a href="http://www.oracle.com/pls/topic/lookup?ctx=E26576_01&id=GSRFM00066"><code>delete-auth-realm</code>(1)</a></p>
</li>
<li>
<p><a href="http://www.oracle.com/pls/topic/lookup?ctx=E26576_01&id=GSRFM00150"><code>list-auth-realms</code>(1)</a></p>
</li>
</ul>
<small>Copyright © 2005, 2017, Oracle and/or its affiliates. All rights reserved. <a href="docinfo.html">Legal Notices</a></small>
| {
"pile_set_name": "Github"
} |
#define PROGRAM toascii
#define MODULE_LIST toascii.f
#define MAIN_LANG_FORTRAN
#define R3LIB
#define USES_FORTRAN
#define LIB_RTL
#define LIB_TAE
#define LIB_P2SUB
#define LIB_P3SUB
| {
"pile_set_name": "Github"
} |
-----BEGIN RSA PRIVATE KEY-----
MIIEowIBAAKCAQEAjamvEMqBJVKlMkjk7r5N7A9sHU1/HcGTiczIdXpk5Xa6PJtd
UZ9E/IEerfm85lfnsKUWxGx8vrSk0QC7376Dqa9MGRf74mOgjCYhLAMb2DDDxiLb
mHySjXYgLi+n/Il9g5RpxDbbg4P2Un2FJXxxWTruhFQvB1N+nsTyDxmtA6SL5T/h
tbSwTdQzC7Cvk2D8EArnOBYZrjpsMIXtGa6FrvZ7odXo6DMQ4FM0WNGsK1GnuiYt
adUq3i36o1knlx1K6YLhQmJDec8YH2uSUUOUsmmdgV9yEoDkm4yNvy6oesrHoXah
ftFI0vVTkwBAf6X446HsIOZMB8iv7ILDUu1aawIDAQABAoIBAHe/JZLF+uD3uViG
Ma52Axw19SfX6EnY5cQn7JMRgNROxiKRGhLy1Le01aAuaLU1PU4eXt5u7guuW1uo
iScaveTjnynfEjZODNorKQMxJYpbvkFwGbwOITuezJj+A7v+5LAi9jy8OlYzaDZW
kAQd6xqILDKDjrVcqL3AsPR+ubdHUFxMG3k9lSU483Zl5OK9yO4idzZS2AwP8jgO
UqDMxXWyjnaisKFd078eZctgDmW9lzE96mu/2CUYuIsDmwCw9biFOvCrR609Y8+D
CUqEDqTiTI2ydoThPpd3f2Pj4S+3d2gG+KQn0ySG5BbwiM53l61rx9z2q5w3QjPu
q2MRUmECgYEAv6Y7aonufdjMI9SBL0fjtkoOzBlgzsRjereP9OSNuQrbwq4aj7wM
uN6zFvhUH1Een5lwRjmBCV3/mbmh3b6/lmv8tRNC14V3AUefjM3kdcicpkw3njIK
kvQ6l45ocfzGCRi8UeQmThgpmelHhJHPO+qxcsvSJjAOXfkG5mJoe5MCgYEAvTq3
uCDV9mgjXfP170p4N/TmqsI9VhVE0DgRmcGVs/GU7nV/EvMrYCmwlITxQSZ8DzQW
G1gYvavWXd0/XuXG0vR+pIcBgyZne13HAjAjpErivi7nNIHVEDTKT06HP/xiXzZX
SWzXxTmSMIvbbjdGjL3rzPrrINRN3r3PbyvG3MkCgYBscEiKPcVeG79WPrVh5VFp
IXpB7dIi7GhFVXv02yV9oDE8dHq+/W5NZGT9CEHA/otPTuiCM6NZg4BOoQR/jaCm
Ii/43Q8jF3eAl+AlMZKlOn+4cMO/lRz6jYphmshqRtZe60oTI/6wjWdsmNxInKAf
jOoexEkCJorajT9kOCZaVQKBgBZ9XQpwNJ3FgLaQ4SDge+tCmwuebEXH31bT4xug
C1fIlYfFxSWOaxBRxB/SsQ2qMkJoUVxMmxwnySF8wyRXMMsvrcGGHiLlNJVP7vAO
op3LHKm3z1jJOXZkn8rPLXnoWBSy06rxWa+iCQLmDF1MCoF9rQG+rKVJNjwL2RSA
YnEpAoGBALS58kBL72zM0dsQr+tc/fNqI+vDl+t7OXuf83iepP9AjSHGA9/IUKDJ
5MjqUDhuhmu7wP9M97A0kPhc0lhBIMSEuLhyRuWpAeGtnTm2oiBTW0kmDxL3YRRm
KS7RyJ9He/vRMwIR/oJ7sQzV7LYZFPeENlER0p2Ui6MDTfyoLj3I
-----END RSA PRIVATE KEY-----
| {
"pile_set_name": "Github"
} |
# created by tools/tclZIC.tcl - do not edit
set TZData(:America/Monterrey) {
{-9223372036854775808 -24076 0 LMT}
{-1514743200 -21600 0 CST}
{568015200 -21600 0 CST}
{576057600 -18000 1 CDT}
{594198000 -21600 0 CST}
{599637600 -21600 0 CST}
{828864000 -18000 1 CDT}
{846399600 -21600 0 CST}
{860313600 -18000 1 CDT}
{877849200 -21600 0 CST}
{891763200 -18000 1 CDT}
{909298800 -21600 0 CST}
{923212800 -18000 1 CDT}
{941353200 -21600 0 CST}
{954662400 -18000 1 CDT}
{972802800 -21600 0 CST}
{989136000 -18000 1 CDT}
{1001833200 -21600 0 CST}
{1018166400 -18000 1 CDT}
{1035702000 -21600 0 CST}
{1049616000 -18000 1 CDT}
{1067151600 -21600 0 CST}
{1081065600 -18000 1 CDT}
{1099206000 -21600 0 CST}
{1112515200 -18000 1 CDT}
{1130655600 -21600 0 CST}
{1143964800 -18000 1 CDT}
{1162105200 -21600 0 CST}
{1175414400 -18000 1 CDT}
{1193554800 -21600 0 CST}
{1207468800 -18000 1 CDT}
{1225004400 -21600 0 CST}
{1238918400 -18000 1 CDT}
{1256454000 -21600 0 CST}
{1270368000 -18000 1 CDT}
{1288508400 -21600 0 CST}
{1301817600 -18000 1 CDT}
{1319958000 -21600 0 CST}
{1333267200 -18000 1 CDT}
{1351407600 -21600 0 CST}
{1365321600 -18000 1 CDT}
{1382857200 -21600 0 CST}
{1396771200 -18000 1 CDT}
{1414306800 -21600 0 CST}
{1428220800 -18000 1 CDT}
{1445756400 -21600 0 CST}
{1459670400 -18000 1 CDT}
{1477810800 -21600 0 CST}
{1491120000 -18000 1 CDT}
{1509260400 -21600 0 CST}
{1522569600 -18000 1 CDT}
{1540710000 -21600 0 CST}
{1554624000 -18000 1 CDT}
{1572159600 -21600 0 CST}
{1586073600 -18000 1 CDT}
{1603609200 -21600 0 CST}
{1617523200 -18000 1 CDT}
{1635663600 -21600 0 CST}
{1648972800 -18000 1 CDT}
{1667113200 -21600 0 CST}
{1680422400 -18000 1 CDT}
{1698562800 -21600 0 CST}
{1712476800 -18000 1 CDT}
{1730012400 -21600 0 CST}
{1743926400 -18000 1 CDT}
{1761462000 -21600 0 CST}
{1775376000 -18000 1 CDT}
{1792911600 -21600 0 CST}
{1806825600 -18000 1 CDT}
{1824966000 -21600 0 CST}
{1838275200 -18000 1 CDT}
{1856415600 -21600 0 CST}
{1869724800 -18000 1 CDT}
{1887865200 -21600 0 CST}
{1901779200 -18000 1 CDT}
{1919314800 -21600 0 CST}
{1933228800 -18000 1 CDT}
{1950764400 -21600 0 CST}
{1964678400 -18000 1 CDT}
{1982818800 -21600 0 CST}
{1996128000 -18000 1 CDT}
{2014268400 -21600 0 CST}
{2027577600 -18000 1 CDT}
{2045718000 -21600 0 CST}
{2059027200 -18000 1 CDT}
{2077167600 -21600 0 CST}
{2091081600 -18000 1 CDT}
{2108617200 -21600 0 CST}
{2122531200 -18000 1 CDT}
{2140066800 -21600 0 CST}
{2153980800 -18000 1 CDT}
{2172121200 -21600 0 CST}
{2185430400 -18000 1 CDT}
{2203570800 -21600 0 CST}
{2216880000 -18000 1 CDT}
{2235020400 -21600 0 CST}
{2248934400 -18000 1 CDT}
{2266470000 -21600 0 CST}
{2280384000 -18000 1 CDT}
{2297919600 -21600 0 CST}
{2311833600 -18000 1 CDT}
{2329369200 -21600 0 CST}
{2343283200 -18000 1 CDT}
{2361423600 -21600 0 CST}
{2374732800 -18000 1 CDT}
{2392873200 -21600 0 CST}
{2406182400 -18000 1 CDT}
{2424322800 -21600 0 CST}
{2438236800 -18000 1 CDT}
{2455772400 -21600 0 CST}
{2469686400 -18000 1 CDT}
{2487222000 -21600 0 CST}
{2501136000 -18000 1 CDT}
{2519276400 -21600 0 CST}
{2532585600 -18000 1 CDT}
{2550726000 -21600 0 CST}
{2564035200 -18000 1 CDT}
{2582175600 -21600 0 CST}
{2596089600 -18000 1 CDT}
{2613625200 -21600 0 CST}
{2627539200 -18000 1 CDT}
{2645074800 -21600 0 CST}
{2658988800 -18000 1 CDT}
{2676524400 -21600 0 CST}
{2690438400 -18000 1 CDT}
{2708578800 -21600 0 CST}
{2721888000 -18000 1 CDT}
{2740028400 -21600 0 CST}
{2753337600 -18000 1 CDT}
{2771478000 -21600 0 CST}
{2785392000 -18000 1 CDT}
{2802927600 -21600 0 CST}
{2816841600 -18000 1 CDT}
{2834377200 -21600 0 CST}
{2848291200 -18000 1 CDT}
{2866431600 -21600 0 CST}
{2879740800 -18000 1 CDT}
{2897881200 -21600 0 CST}
{2911190400 -18000 1 CDT}
{2929330800 -21600 0 CST}
{2942640000 -18000 1 CDT}
{2960780400 -21600 0 CST}
{2974694400 -18000 1 CDT}
{2992230000 -21600 0 CST}
{3006144000 -18000 1 CDT}
{3023679600 -21600 0 CST}
{3037593600 -18000 1 CDT}
{3055734000 -21600 0 CST}
{3069043200 -18000 1 CDT}
{3087183600 -21600 0 CST}
{3100492800 -18000 1 CDT}
{3118633200 -21600 0 CST}
{3132547200 -18000 1 CDT}
{3150082800 -21600 0 CST}
{3163996800 -18000 1 CDT}
{3181532400 -21600 0 CST}
{3195446400 -18000 1 CDT}
{3212982000 -21600 0 CST}
{3226896000 -18000 1 CDT}
{3245036400 -21600 0 CST}
{3258345600 -18000 1 CDT}
{3276486000 -21600 0 CST}
{3289795200 -18000 1 CDT}
{3307935600 -21600 0 CST}
{3321849600 -18000 1 CDT}
{3339385200 -21600 0 CST}
{3353299200 -18000 1 CDT}
{3370834800 -21600 0 CST}
{3384748800 -18000 1 CDT}
{3402889200 -21600 0 CST}
{3416198400 -18000 1 CDT}
{3434338800 -21600 0 CST}
{3447648000 -18000 1 CDT}
{3465788400 -21600 0 CST}
{3479702400 -18000 1 CDT}
{3497238000 -21600 0 CST}
{3511152000 -18000 1 CDT}
{3528687600 -21600 0 CST}
{3542601600 -18000 1 CDT}
{3560137200 -21600 0 CST}
{3574051200 -18000 1 CDT}
{3592191600 -21600 0 CST}
{3605500800 -18000 1 CDT}
{3623641200 -21600 0 CST}
{3636950400 -18000 1 CDT}
{3655090800 -21600 0 CST}
{3669004800 -18000 1 CDT}
{3686540400 -21600 0 CST}
{3700454400 -18000 1 CDT}
{3717990000 -21600 0 CST}
{3731904000 -18000 1 CDT}
{3750044400 -21600 0 CST}
{3763353600 -18000 1 CDT}
{3781494000 -21600 0 CST}
{3794803200 -18000 1 CDT}
{3812943600 -21600 0 CST}
{3826252800 -18000 1 CDT}
{3844393200 -21600 0 CST}
{3858307200 -18000 1 CDT}
{3875842800 -21600 0 CST}
{3889756800 -18000 1 CDT}
{3907292400 -21600 0 CST}
{3921206400 -18000 1 CDT}
{3939346800 -21600 0 CST}
{3952656000 -18000 1 CDT}
{3970796400 -21600 0 CST}
{3984105600 -18000 1 CDT}
{4002246000 -21600 0 CST}
{4016160000 -18000 1 CDT}
{4033695600 -21600 0 CST}
{4047609600 -18000 1 CDT}
{4065145200 -21600 0 CST}
{4079059200 -18000 1 CDT}
{4096594800 -21600 0 CST}
}
| {
"pile_set_name": "Github"
} |
.. index::
single: Installing and Setting up Symfony
Installing & Setting up the Symfony Framework
=============================================
.. admonition:: Screencast
:class: screencast
Do you prefer video tutorials? Check out the `Stellar Development with Symfony`_
screencast series.
.. _symfony-tech-requirements:
Technical Requirements
----------------------
Before creating your first Symfony application you must:
* Install PHP 7.2.5 or higher and these PHP extensions (which are installed and
enabled by default in most PHP 7 installations): `Ctype`_, `iconv`_, `JSON`_,
`PCRE`_, `Session`_, `SimpleXML`_, and `Tokenizer`_;
* `Install Composer`_, which is used to install PHP packages.
Optionally, you can also `install Symfony CLI`_. This creates a binary called
``symfony`` that provides all the tools you need to develop and run your
Symfony application locally.
The ``symfony`` binary also provides a tool to check if your computer meets all
requirements. Open your console terminal and run this command:
.. code-block:: terminal
$ symfony check:requirements
.. note::
The Symfony binary is developed internally at Symfony. If you want to
report a bug or suggest a new feature, please create an issue on
`symfony/cli`_.
.. _creating-symfony-applications:
Creating Symfony Applications
-----------------------------
Open your console terminal and run any of these commands to create a new Symfony
application:
.. code-block:: terminal
# run this if you are building a traditional web application
$ symfony new my_project_name --version=next --full
# run this if you are building a microservice, console application or API
$ symfony new my_project_name --version=next
The only difference between these two commands is the number of packages
installed by default. The ``--full`` option installs all the packages that you
usually need to build web applications, so the installation size will be bigger.
If you're not using the Symfony binary, run these commands to create the new
Symfony application using Composer:
.. code-block:: terminal
# run this if you are building a traditional web application
$ composer create-project symfony/website-skeleton:"5.2.x@dev" my_project_name
# run this if you are building a microservice, console application or API
$ composer create-project symfony/skeleton:"5.2.x@dev" my_project_name
No matter which command you run to create the Symfony application. All of them
will create a new ``my_project_name/`` directory, download some dependencies
into it and even generate the basic directories and files you'll need to get
started. In other words, your new application is ready!
.. note::
The project's cache and logs directory (by default, ``<project>/var/cache/``
and ``<project>/var/log/``) must be writable by the web server. If you have
any issue, read how to :doc:`set up permissions for Symfony applications </setup/file_permissions>`.
Running Symfony Applications
----------------------------
In production, you should install a webserver like Nginx or Apache and
:doc:`configure it to run Symfony </setup/web_server_configuration>`. This
method can also be used if you're not using the Symfony local web server for
development.
However for local development, the most convenient way of running Symfony is by
using the :doc:`local web server </setup/symfony_server>` provided by the
``symfony`` binary. This local server provides among other things support for
HTTP/2, concurrent requests, TLS/SSL and automatic generation of security
certificates.
Open your console terminal, move into your new project directory and start the
local web server as follows:
.. code-block:: terminal
$ cd my-project/
$ symfony server:start
Open your browser and navigate to ``http://localhost:8000/``. If everything is
working, you'll see a welcome page. Later, when you are finished working, stop
the server by pressing ``Ctrl+C`` from your terminal.
.. tip::
The web server works with any PHP application, not only Symfony projects,
so it's a very useful generic development tool.
.. _install-existing-app:
Setting up an Existing Symfony Project
--------------------------------------
In addition to creating new Symfony projects, you will also work on projects
already created by other developers. In that case, you only need to get the
project code and install the dependencies with Composer. Assuming your team uses
Git, setup your project with the following commands:
.. code-block:: terminal
# clone the project to download its contents
$ cd projects/
$ git clone ...
# make Composer install the project's dependencies into vendor/
$ cd my-project/
$ composer install
You'll probably also need to customize your :ref:`.env file <config-dot-env>`
and do a few other project-specific tasks (e.g. creating a database). When
working on a existing Symfony application for the first time, it may be useful
to run this command which displays information about the project:
.. code-block:: terminal
$ php bin/console about
.. _symfony-flex:
Installing Packages
-------------------
A common practice when developing Symfony applications is to install packages
(Symfony calls them :doc:`bundles </bundles>`) that provide ready-to-use
features. Packages usually require some setup before using them (editing some
file to enable the bundle, creating some file to add some initial config, etc.)
Most of the time this setup can be automated and that's why Symfony includes
`Symfony Flex`_, a tool to simplify the installation/removal of packages in
Symfony applications. Technically speaking, Symfony Flex is a Composer plugin
that is installed by default when creating a new Symfony application and which
**automates the most common tasks of Symfony applications**.
.. tip::
You can also :doc:`add Symfony Flex to an existing project </setup/flex>`.
Symfony Flex modifies the behavior of the ``require``, ``update``, and
``remove`` Composer commands to provide advanced features. Consider the
following example:
.. code-block:: terminal
$ cd my-project/
$ composer require logger
If you run that command in a Symfony application which doesn't use Flex, you'll
see a Composer error explaining that ``logger`` is not a valid package name.
However, if the application has Symfony Flex installed, that command installs
and enables all the packages needed to use the official Symfony logger.
.. _recipes-description:
This is possible because lots of Symfony packages/bundles define **"recipes"**,
which are a set of automated instructions to install and enable packages into
Symfony applications. Flex keeps tracks of the recipes it installed in a
``symfony.lock`` file, which must be committed to your code repository.
Symfony Flex recipes are contributed by the community and they are stored in
two public repositories:
* `Main recipe repository`_, is a curated list of recipes for high quality and
maintained packages. Symfony Flex only looks in this repository by default.
* `Contrib recipe repository`_, contains all the recipes created by the
community. All of them are guaranteed to work, but their associated packages
could be unmaintained. Symfony Flex will ask your permission before installing
any of these recipes.
Read the `Symfony Recipes documentation`_ to learn everything about how to
create recipes for your own packages.
.. _symfony-packs:
Symfony Packs
~~~~~~~~~~~~~
Sometimes a single feature requires installing several packages and bundles.
Instead of installing them individually, Symfony provides **packs**, which are
Composer metapackages that include several dependencies.
For example, to add debugging features in your application, you can run the
``composer require --dev debug`` command. This installs the ``symfony/debug-pack``,
which in turn installs several packages like ``symfony/debug-bundle``,
``symfony/monolog-bundle``, ``symfony/var-dumper``, etc.
By default, when installing Symfony packs, your ``composer.json`` file shows the
pack dependency (e.g. ``"symfony/debug-pack": "^1.0"``) instead of the actual
packages installed. To show the packages, add the ``--unpack`` option when
installing a pack (e.g. ``composer require debug --dev --unpack``) or run this
command to unpack the already installed packs: ``composer unpack PACK_NAME``
(e.g. ``composer unpack debug``).
.. _security-checker:
Checking Security Vulnerabilities
---------------------------------
The ``symfony`` binary created when you `install Symfony CLI`_ provides a command to
check whether your project's dependencies contain any known security
vulnerability:
.. code-block:: terminal
$ symfony check:security
A good security practice is to execute this command regularly to be able to
update or replace compromised dependencies as soon as possible. The security
check is done locally by fetching the public `PHP security advisories database`_,
so your ``composer.lock`` file is not sent on the network.
.. tip::
The ``check:security`` command terminates with a non-zero exit code if
any of your dependencies is affected by a known security vulnerability.
This way you can add it to your project build process and your continuous
integration workflows to make them fail when there are vulnerabilities.
Symfony LTS Versions
--------------------
According to the :doc:`Symfony release process </contributing/community/releases>`,
"long-term support" (or LTS for short) versions are published every two years.
Check out the `Symfony releases`_ to know which is the latest LTS version.
By default, the command that creates new Symfony applications uses the latest
stable version. If you want to use an LTS version, add the ``--version`` option:
.. code-block:: terminal
# use the most recent LTS version
$ symfony new my_project_name --version=lts
# use the 'next' Symfony version to be released (still in development)
$ symfony new my_project_name --version=next
# you can also select an exact specific Symfony version
$ symfony new my_project_name --version=4.4
The ``lts`` and ``next`` shortcuts are only available when using Symfony to
create new projects. If you use Composer, you need to tell the exact version:
.. code-block:: terminal
$ composer create-project symfony/website-skeleton:"^4.4" my_project_name
The Symfony Demo application
----------------------------
`The Symfony Demo Application`_ is a fully-functional application that shows the
recommended way to develop Symfony applications. It's a great learning tool for
Symfony newcomers and its code contains tons of comments and helpful notes.
Run this command to create a new project based on the Symfony Demo application:
.. code-block:: terminal
$ symfony new my_project_name --demo
Start Coding!
-------------
With setup behind you, it's time to :doc:`Create your first page in Symfony </page_creation>`.
Learn More
----------
.. toctree::
:hidden:
page_creation
.. toctree::
:maxdepth: 1
:glob:
setup/homestead
setup/web_server_configuration
setup/*
.. _`Stellar Development with Symfony`: https://symfonycasts.com/screencast/symfony
.. _`Install Composer`: https://getcomposer.org/download/
.. _`install Symfony CLI`: https://symfony.com/download
.. _`symfony/cli`: https://github.com/symfony/cli
.. _`The Symfony Demo Application`: https://github.com/symfony/demo
.. _`Symfony Flex`: https://github.com/symfony/flex
.. _`PHP security advisories database`: https://github.com/FriendsOfPHP/security-advisories
.. _`Symfony releases`: https://symfony.com/releases
.. _`Main recipe repository`: https://github.com/symfony/recipes
.. _`Contrib recipe repository`: https://github.com/symfony/recipes-contrib
.. _`Symfony Recipes documentation`: https://github.com/symfony/recipes/blob/master/README.rst
.. _`iconv`: https://www.php.net/book.iconv
.. _`JSON`: https://www.php.net/book.json
.. _`Session`: https://www.php.net/book.session
.. _`Ctype`: https://www.php.net/book.ctype
.. _`Tokenizer`: https://www.php.net/book.tokenizer
.. _`SimpleXML`: https://www.php.net/book.simplexml
.. _`PCRE`: https://www.php.net/book.pcre
| {
"pile_set_name": "Github"
} |
FROM nvidia/cuda:8.0-cudnn6-devel-ubuntu14.04
MAINTAINER Jan Prach <[email protected]>
# In the Ubuntu 14.04 images, cudnn is placed in system paths. Move them to
# /usr/local/cuda
RUN cp -P /usr/include/cudnn.h /usr/local/cuda/include
RUN cp -P /usr/lib/x86_64-linux-gnu/libcudnn* /usr/local/cuda/lib64
# Copy and run the install scripts.
COPY install/*.sh /install/
ARG DEBIAN_FRONTEND=noninteractive
RUN /install/install_bootstrap_deb_packages.sh
RUN add-apt-repository -y ppa:openjdk-r/ppa && \
add-apt-repository -y ppa:george-edison55/cmake-3.x
RUN /install/install_deb_packages.sh
RUN /install/install_pip_packages.sh
RUN /install/install_bazel.sh
RUN /install/install_golang.sh
# Set up the master bazelrc configuration file.
COPY install/.bazelrc /etc/bazel.bazelrc
ENV LD_LIBRARY_PATH /usr/local/cuda/extras/CUPTI/lib64:$LD_LIBRARY_PATH
# Configure the build for our CUDA configuration.
ENV TF_NEED_CUDA 1
ENV TF_CUDA_COMPUTE_CAPABILITIES 3.0
| {
"pile_set_name": "Github"
} |
// Copyright 2009,2010 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// OpenBSD system calls.
// This file is compiled as ordinary Go code,
// but it is also input to mksyscall,
// which parses the //sys lines and generates system call stubs.
// Note that sometimes we use a lowercase //sys name and wrap
// it in our own nicer implementation, either here or in
// syscall_bsd.go or syscall_unix.go.
package unix
import (
"sort"
"syscall"
"unsafe"
)
// SockaddrDatalink implements the Sockaddr interface for AF_LINK type sockets.
type SockaddrDatalink struct {
Len uint8
Family uint8
Index uint16
Type uint8
Nlen uint8
Alen uint8
Slen uint8
Data [24]int8
raw RawSockaddrDatalink
}
func Syscall9(trap, a1, a2, a3, a4, a5, a6, a7, a8, a9 uintptr) (r1, r2 uintptr, err syscall.Errno)
func nametomib(name string) (mib []_C_int, err error) {
i := sort.Search(len(sysctlMib), func(i int) bool {
return sysctlMib[i].ctlname >= name
})
if i < len(sysctlMib) && sysctlMib[i].ctlname == name {
return sysctlMib[i].ctloid, nil
}
return nil, EINVAL
}
func SysctlClockinfo(name string) (*Clockinfo, error) {
mib, err := sysctlmib(name)
if err != nil {
return nil, err
}
n := uintptr(SizeofClockinfo)
var ci Clockinfo
if err := sysctl(mib, (*byte)(unsafe.Pointer(&ci)), &n, nil, 0); err != nil {
return nil, err
}
if n != SizeofClockinfo {
return nil, EIO
}
return &ci, nil
}
func SysctlUvmexp(name string) (*Uvmexp, error) {
mib, err := sysctlmib(name)
if err != nil {
return nil, err
}
n := uintptr(SizeofUvmexp)
var u Uvmexp
if err := sysctl(mib, (*byte)(unsafe.Pointer(&u)), &n, nil, 0); err != nil {
return nil, err
}
if n != SizeofUvmexp {
return nil, EIO
}
return &u, nil
}
//sysnb pipe(p *[2]_C_int) (err error)
func Pipe(p []int) (err error) {
if len(p) != 2 {
return EINVAL
}
var pp [2]_C_int
err = pipe(&pp)
p[0] = int(pp[0])
p[1] = int(pp[1])
return
}
//sys getdents(fd int, buf []byte) (n int, err error)
func Getdirentries(fd int, buf []byte, basep *uintptr) (n int, err error) {
return getdents(fd, buf)
}
const ImplementsGetwd = true
//sys Getcwd(buf []byte) (n int, err error) = SYS___GETCWD
func Getwd() (string, error) {
var buf [PathMax]byte
_, err := Getcwd(buf[0:])
if err != nil {
return "", err
}
n := clen(buf[:])
if n < 1 {
return "", EINVAL
}
return string(buf[:n]), nil
}
func Sendfile(outfd int, infd int, offset *int64, count int) (written int, err error) {
if raceenabled {
raceReleaseMerge(unsafe.Pointer(&ioSync))
}
return sendfile(outfd, infd, offset, count)
}
// TODO
func sendfile(outfd int, infd int, offset *int64, count int) (written int, err error) {
return -1, ENOSYS
}
func Getfsstat(buf []Statfs_t, flags int) (n int, err error) {
var _p0 unsafe.Pointer
var bufsize uintptr
if len(buf) > 0 {
_p0 = unsafe.Pointer(&buf[0])
bufsize = unsafe.Sizeof(Statfs_t{}) * uintptr(len(buf))
}
r0, _, e1 := Syscall(SYS_GETFSSTAT, uintptr(_p0), bufsize, uintptr(flags))
n = int(r0)
if e1 != 0 {
err = e1
}
return
}
func setattrlistTimes(path string, times []Timespec, flags int) error {
// used on Darwin for UtimesNano
return ENOSYS
}
//sys ioctl(fd int, req uint, arg uintptr) (err error)
// ioctl itself should not be exposed directly, but additional get/set
// functions for specific types are permissible.
// IoctlSetInt performs an ioctl operation which sets an integer value
// on fd, using the specified request number.
func IoctlSetInt(fd int, req uint, value int) error {
return ioctl(fd, req, uintptr(value))
}
func ioctlSetWinsize(fd int, req uint, value *Winsize) error {
return ioctl(fd, req, uintptr(unsafe.Pointer(value)))
}
func ioctlSetTermios(fd int, req uint, value *Termios) error {
return ioctl(fd, req, uintptr(unsafe.Pointer(value)))
}
// IoctlGetInt performs an ioctl operation which gets an integer value
// from fd, using the specified request number.
func IoctlGetInt(fd int, req uint) (int, error) {
var value int
err := ioctl(fd, req, uintptr(unsafe.Pointer(&value)))
return value, err
}
func IoctlGetWinsize(fd int, req uint) (*Winsize, error) {
var value Winsize
err := ioctl(fd, req, uintptr(unsafe.Pointer(&value)))
return &value, err
}
func IoctlGetTermios(fd int, req uint) (*Termios, error) {
var value Termios
err := ioctl(fd, req, uintptr(unsafe.Pointer(&value)))
return &value, err
}
//sys ppoll(fds *PollFd, nfds int, timeout *Timespec, sigmask *Sigset_t) (n int, err error)
func Ppoll(fds []PollFd, timeout *Timespec, sigmask *Sigset_t) (n int, err error) {
if len(fds) == 0 {
return ppoll(nil, 0, timeout, sigmask)
}
return ppoll(&fds[0], len(fds), timeout, sigmask)
}
func Uname(uname *Utsname) error {
mib := []_C_int{CTL_KERN, KERN_OSTYPE}
n := unsafe.Sizeof(uname.Sysname)
if err := sysctl(mib, &uname.Sysname[0], &n, nil, 0); err != nil {
return err
}
mib = []_C_int{CTL_KERN, KERN_HOSTNAME}
n = unsafe.Sizeof(uname.Nodename)
if err := sysctl(mib, &uname.Nodename[0], &n, nil, 0); err != nil {
return err
}
mib = []_C_int{CTL_KERN, KERN_OSRELEASE}
n = unsafe.Sizeof(uname.Release)
if err := sysctl(mib, &uname.Release[0], &n, nil, 0); err != nil {
return err
}
mib = []_C_int{CTL_KERN, KERN_VERSION}
n = unsafe.Sizeof(uname.Version)
if err := sysctl(mib, &uname.Version[0], &n, nil, 0); err != nil {
return err
}
// The version might have newlines or tabs in it, convert them to
// spaces.
for i, b := range uname.Version {
if b == '\n' || b == '\t' {
if i == len(uname.Version)-1 {
uname.Version[i] = 0
} else {
uname.Version[i] = ' '
}
}
}
mib = []_C_int{CTL_HW, HW_MACHINE}
n = unsafe.Sizeof(uname.Machine)
if err := sysctl(mib, &uname.Machine[0], &n, nil, 0); err != nil {
return err
}
return nil
}
/*
* Exposed directly
*/
//sys Access(path string, mode uint32) (err error)
//sys Adjtime(delta *Timeval, olddelta *Timeval) (err error)
//sys Chdir(path string) (err error)
//sys Chflags(path string, flags int) (err error)
//sys Chmod(path string, mode uint32) (err error)
//sys Chown(path string, uid int, gid int) (err error)
//sys Chroot(path string) (err error)
//sys Close(fd int) (err error)
//sys Dup(fd int) (nfd int, err error)
//sys Dup2(from int, to int) (err error)
//sys Exit(code int)
//sys Faccessat(dirfd int, path string, mode uint32, flags int) (err error)
//sys Fchdir(fd int) (err error)
//sys Fchflags(fd int, flags int) (err error)
//sys Fchmod(fd int, mode uint32) (err error)
//sys Fchmodat(dirfd int, path string, mode uint32, flags int) (err error)
//sys Fchown(fd int, uid int, gid int) (err error)
//sys Fchownat(dirfd int, path string, uid int, gid int, flags int) (err error)
//sys Flock(fd int, how int) (err error)
//sys Fpathconf(fd int, name int) (val int, err error)
//sys Fstat(fd int, stat *Stat_t) (err error)
//sys Fstatat(fd int, path string, stat *Stat_t, flags int) (err error)
//sys Fstatfs(fd int, stat *Statfs_t) (err error)
//sys Fsync(fd int) (err error)
//sys Ftruncate(fd int, length int64) (err error)
//sysnb Getegid() (egid int)
//sysnb Geteuid() (uid int)
//sysnb Getgid() (gid int)
//sysnb Getpgid(pid int) (pgid int, err error)
//sysnb Getpgrp() (pgrp int)
//sysnb Getpid() (pid int)
//sysnb Getppid() (ppid int)
//sys Getpriority(which int, who int) (prio int, err error)
//sysnb Getrlimit(which int, lim *Rlimit) (err error)
//sysnb Getrtable() (rtable int, err error)
//sysnb Getrusage(who int, rusage *Rusage) (err error)
//sysnb Getsid(pid int) (sid int, err error)
//sysnb Gettimeofday(tv *Timeval) (err error)
//sysnb Getuid() (uid int)
//sys Issetugid() (tainted bool)
//sys Kill(pid int, signum syscall.Signal) (err error)
//sys Kqueue() (fd int, err error)
//sys Lchown(path string, uid int, gid int) (err error)
//sys Link(path string, link string) (err error)
//sys Linkat(pathfd int, path string, linkfd int, link string, flags int) (err error)
//sys Listen(s int, backlog int) (err error)
//sys Lstat(path string, stat *Stat_t) (err error)
//sys Mkdir(path string, mode uint32) (err error)
//sys Mkdirat(dirfd int, path string, mode uint32) (err error)
//sys Mkfifo(path string, mode uint32) (err error)
//sys Mkfifoat(dirfd int, path string, mode uint32) (err error)
//sys Mknod(path string, mode uint32, dev int) (err error)
//sys Mknodat(dirfd int, path string, mode uint32, dev int) (err error)
//sys Nanosleep(time *Timespec, leftover *Timespec) (err error)
//sys Open(path string, mode int, perm uint32) (fd int, err error)
//sys Openat(dirfd int, path string, mode int, perm uint32) (fd int, err error)
//sys Pathconf(path string, name int) (val int, err error)
//sys Pread(fd int, p []byte, offset int64) (n int, err error)
//sys Pwrite(fd int, p []byte, offset int64) (n int, err error)
//sys read(fd int, p []byte) (n int, err error)
//sys Readlink(path string, buf []byte) (n int, err error)
//sys Readlinkat(dirfd int, path string, buf []byte) (n int, err error)
//sys Rename(from string, to string) (err error)
//sys Renameat(fromfd int, from string, tofd int, to string) (err error)
//sys Revoke(path string) (err error)
//sys Rmdir(path string) (err error)
//sys Seek(fd int, offset int64, whence int) (newoffset int64, err error) = SYS_LSEEK
//sys Select(n int, r *FdSet, w *FdSet, e *FdSet, timeout *Timeval) (err error)
//sysnb Setegid(egid int) (err error)
//sysnb Seteuid(euid int) (err error)
//sysnb Setgid(gid int) (err error)
//sys Setlogin(name string) (err error)
//sysnb Setpgid(pid int, pgid int) (err error)
//sys Setpriority(which int, who int, prio int) (err error)
//sysnb Setregid(rgid int, egid int) (err error)
//sysnb Setreuid(ruid int, euid int) (err error)
//sysnb Setresgid(rgid int, egid int, sgid int) (err error)
//sysnb Setresuid(ruid int, euid int, suid int) (err error)
//sysnb Setrlimit(which int, lim *Rlimit) (err error)
//sysnb Setrtable(rtable int) (err error)
//sysnb Setsid() (pid int, err error)
//sysnb Settimeofday(tp *Timeval) (err error)
//sysnb Setuid(uid int) (err error)
//sys Stat(path string, stat *Stat_t) (err error)
//sys Statfs(path string, stat *Statfs_t) (err error)
//sys Symlink(path string, link string) (err error)
//sys Symlinkat(oldpath string, newdirfd int, newpath string) (err error)
//sys Sync() (err error)
//sys Truncate(path string, length int64) (err error)
//sys Umask(newmask int) (oldmask int)
//sys Unlink(path string) (err error)
//sys Unlinkat(dirfd int, path string, flags int) (err error)
//sys Unmount(path string, flags int) (err error)
//sys write(fd int, p []byte) (n int, err error)
//sys mmap(addr uintptr, length uintptr, prot int, flag int, fd int, pos int64) (ret uintptr, err error)
//sys munmap(addr uintptr, length uintptr) (err error)
//sys readlen(fd int, buf *byte, nbuf int) (n int, err error) = SYS_READ
//sys writelen(fd int, buf *byte, nbuf int) (n int, err error) = SYS_WRITE
//sys utimensat(dirfd int, path string, times *[2]Timespec, flags int) (err error)
/*
* Unimplemented
*/
// __getcwd
// __semctl
// __syscall
// __sysctl
// adjfreq
// break
// clock_getres
// clock_gettime
// clock_settime
// closefrom
// execve
// fcntl
// fhopen
// fhstat
// fhstatfs
// fork
// futimens
// getfh
// getgid
// getitimer
// getlogin
// getresgid
// getresuid
// getthrid
// ktrace
// lfs_bmapv
// lfs_markv
// lfs_segclean
// lfs_segwait
// mincore
// minherit
// mount
// mquery
// msgctl
// msgget
// msgrcv
// msgsnd
// nfssvc
// nnpfspioctl
// preadv
// profil
// pwritev
// quotactl
// readv
// reboot
// renameat
// rfork
// sched_yield
// semget
// semop
// setgroups
// setitimer
// setsockopt
// shmat
// shmctl
// shmdt
// shmget
// sigaction
// sigaltstack
// sigpending
// sigprocmask
// sigreturn
// sigsuspend
// sysarch
// syscall
// threxit
// thrsigdivert
// thrsleep
// thrwakeup
// vfork
// writev
| {
"pile_set_name": "Github"
} |
// ------------------------------------------------------------
// Copyright (c) Microsoft Corporation. All rights reserved.
// Licensed under the MIT License (MIT). See License.txt in the repo root for license information.
// ------------------------------------------------------------
#pragma once
namespace ServiceModel
{
// <ApplicationInstance>/<Diagnostics>/<FolderSource>
struct DiagnosticsDescription;
struct FolderSourceDescription
{
public:
FolderSourceDescription();
FolderSourceDescription(FolderSourceDescription const & other);
FolderSourceDescription(FolderSourceDescription && other);
FolderSourceDescription const & operator = (FolderSourceDescription const & other);
FolderSourceDescription const & operator = (FolderSourceDescription && other);
bool operator == (FolderSourceDescription const & other) const;
bool operator != (FolderSourceDescription const & other) const;
void WriteTo(Common::TextWriter & w, Common::FormatOptions const &) const;
void clear();
public:
std::wstring IsEnabled;
std::wstring RelativeFolderPath;
std::wstring DataDeletionAgeInDays;
FolderSourceDestinationsDescription Destinations;
ParametersDescription Parameters;
private:
friend struct DiagnosticsDescription;
void ReadFromXml(Common::XmlReaderUPtr const &);
Common::ErrorCode WriteToXml(Common::XmlWriterUPtr const & xmlWriter);
};
}
| {
"pile_set_name": "Github"
} |
---
title: "List groupLifecyclePolicies"
description: "Retrieves a list of groupLifecyclePolicy objects to which a group belongs."
author: "yyuank"
localization_priority: Normal
ms.prod: "groups"
doc_type: apiPageType
---
# List groupLifecyclePolicies
Namespace: microsoft.graph
[!INCLUDE [beta-disclaimer](../../includes/beta-disclaimer.md)]
Retrieves a list of [groupLifecyclePolicy](../resources/grouplifecyclepolicy.md) objects to which a group belongs.
## Permissions
One of the following permissions is required to call this API. To learn more, including how to choose permissions, see [Permissions](/graph/permissions-reference).
|Permission type | Permissions (from least to most privileged) |
|:--------------------|:---------------------------------------------------------|
|Delegated (work or school account) | Directory.Read.All, Directory.ReadWrite.All |
|Delegated (personal Microsoft account) | Not supported. |
|Application | Directory.Read.All, Directory.ReadWrite.All|
## HTTP request
<!-- { "blockType": "ignored" } -->
```http
GET /groups/{id}/groupLifecyclePolicies
```
## Optional query parameters
This method supports the [OData Query Parameters](https://developer.microsoft.com/graph/docs/concepts/query_parameters) to help customize the response.
## Request headers
| Name | Description |
|:----------|:----------|
| Authorization | Bearer {token}. Required. |
## Request body
Do not supply a request body for this method.
## Response
If successful, this method returns a `200 OK` response code and collection of [groupLifecyclePolicy](../resources/grouplifecyclepolicy.md) objects in the response body.
## Example
##### Request
# [HTTP](#tab/http)
<!-- {
"blockType": "request",
"name": "get_grouplifecyclepolicies"
}-->
```msgraph-interactive
GET https://graph.microsoft.com/beta/groups/{id}/groupLifecyclePolicies
```
# [C#](#tab/csharp)
[!INCLUDE [sample-code](../includes/snippets/csharp/get-grouplifecyclepolicies-csharp-snippets.md)]
[!INCLUDE [sdk-documentation](../includes/snippets/snippets-sdk-documentation-link.md)]
# [JavaScript](#tab/javascript)
[!INCLUDE [sample-code](../includes/snippets/javascript/get-grouplifecyclepolicies-javascript-snippets.md)]
[!INCLUDE [sdk-documentation](../includes/snippets/snippets-sdk-documentation-link.md)]
# [Objective-C](#tab/objc)
[!INCLUDE [sample-code](../includes/snippets/objc/get-grouplifecyclepolicies-objc-snippets.md)]
[!INCLUDE [sdk-documentation](../includes/snippets/snippets-sdk-documentation-link.md)]
---
##### Response
Note: The response object shown here may be truncated for brevity. All of the properties will be returned from an actual call.
<!-- {
"blockType": "response",
"truncated": true,
"@odata.type": "microsoft.graph.groupLifecyclePolicy",
"isCollection": true
} -->
```http
HTTP/1.1 200 OK
Content-type: application/json
Content-length: 227
{
"value": [
{
"id": "ffffffff-ffff-ffff-ffff-ffffffffffff",
"groupLifetimeInDays": 90,
"managedGroupTypes": "Selected",
"alternateNotificationEmails": "[email protected]"
}
]
}
```
<!-- uuid: 8fcb5dbc-d5aa-4681-8e31-b001d5168d79
2015-10-25 14:57:30 UTC -->
<!--
{
"type": "#page.annotation",
"description": "List groupLifecyclePolicies",
"keywords": "",
"section": "documentation",
"tocPath": "",
"suppressions": [
]
}
-->
| {
"pile_set_name": "Github"
} |
/* origin: FreeBSD /usr/src/lib/msun/src/k_cosf.c */
/*
* Conversion to float by Ian Lance Taylor, Cygnus Support, [email protected].
* Debugged and optimized by Bruce D. Evans.
*/
/*
* ====================================================
* Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
*
* Developed at SunPro, a Sun Microsystems, Inc. business.
* Permission to use, copy, modify, and distribute this
* software is freely granted, provided that this notice
* is preserved.
* ====================================================
*/
#include <math.h>
#include "libm.h"
/* |cos(x) - c(x)| < 2**-34.1 (~[-5.37e-11, 5.295e-11]). */
static const double
C0 = -0x1ffffffd0c5e81.0p-54, /* -0.499999997251031003120 */
C1 = 0x155553e1053a42.0p-57, /* 0.0416666233237390631894 */
C2 = -0x16c087e80f1e27.0p-62, /* -0.00138867637746099294692 */
C3 = 0x199342e0ee5069.0p-68; /* 0.0000243904487962774090654 */
float __cosdf(double x)
{
double r, w, z;
/* Try to optimize for parallel evaluation as in __tandf.c. */
z = x*x;
w = z*z;
r = C2+z*C3;
return ((1.0+z*C0) + w*C1) + (w*z)*r;
}
| {
"pile_set_name": "Github"
} |
(ns playphraseme.api.route-functions.user.modify-user
(:require [playphraseme.api.queries.user.registered-user :as users]
[buddy.hashers :as hashers]
[ring.util.http-response :as respond]))
(defn modify-user
"Update user info (`:email`/`:name`/`:password`)"
[current-user-info name password email]
(let [new-email (if (empty? email) (str (:email current-user-info)) email)
new-name (if (empty? name) (str (:name current-user-info)) name)
new-password (if (empty? password) (:password current-user-info) (hashers/encrypt password))
new-user-info (users/update-registered-user! (:id current-user-info)
{:email new-email
:name new-name
:password new-password
:refresh_token (:refresh_token current-user-info)})]
(respond/ok {:id (:id current-user-info) :email new-email :name new-name})))
(defn modify-user-response
"User is allowed to update attributes for a user if the requester is
modifying attributes associated with its own id or has admin permissions."
[request id name password email]
(let [auth (get-in request [:identity :permissions])
current-user-info (users/get-registered-user-by-id id)
admin? (.contains auth "admin")
modifying-self? (= (str id) (get-in request [:identity :id]))
admin-or-self? (or admin? modifying-self?)
modify? (and admin-or-self? (not-empty current-user-info))]
(cond
modify? (modify-user current-user-info name password email)
(not admin?) (respond/unauthorized {:error "Not authorized"})
(empty? current-user-info) (respond/not-found {:error "Userid does not exist"}))))
| {
"pile_set_name": "Github"
} |
/*
* This is the source code of Telegram for Android v. 5.x.x
* It is licensed under GNU GPL v. 2 or later.
* You should have received a copy of the license in this archive (see LICENSE).
*
* Copyright Nikolai Kudashov, 2013-2018.
*/
package org.telegram.ui.Cells;
import android.content.Context;
import android.text.TextUtils;
import android.util.TypedValue;
import android.view.Gravity;
import android.widget.LinearLayout;
import android.widget.TextView;
import org.telegram.messenger.AndroidUtilities;
import org.telegram.messenger.MediaDataController;
import org.telegram.messenger.Emoji;
import org.telegram.messenger.ImageLocation;
import org.telegram.messenger.UserObject;
import org.telegram.tgnet.TLRPC;
import org.telegram.ui.ActionBar.Theme;
import org.telegram.ui.Components.AvatarDrawable;
import org.telegram.ui.Components.BackupImageView;
import org.telegram.ui.Components.LayoutHelper;
public class MentionCell extends LinearLayout {
private BackupImageView imageView;
private TextView nameTextView;
private TextView usernameTextView;
private AvatarDrawable avatarDrawable;
public MentionCell(Context context) {
super(context);
setOrientation(HORIZONTAL);
avatarDrawable = new AvatarDrawable();
avatarDrawable.setTextSize(AndroidUtilities.dp(12));
imageView = new BackupImageView(context);
imageView.setRoundRadius(AndroidUtilities.dp(14));
addView(imageView, LayoutHelper.createLinear(28, 28, 12, 4, 0, 0));
nameTextView = new TextView(context);
nameTextView.setTextColor(Theme.getColor(Theme.key_windowBackgroundWhiteBlackText));
nameTextView.setTextSize(TypedValue.COMPLEX_UNIT_DIP, 15);
nameTextView.setSingleLine(true);
nameTextView.setGravity(Gravity.LEFT);
nameTextView.setEllipsize(TextUtils.TruncateAt.END);
addView(nameTextView, LayoutHelper.createLinear(LayoutHelper.WRAP_CONTENT, LayoutHelper.WRAP_CONTENT, Gravity.CENTER_VERTICAL, 12, 0, 0, 0));
usernameTextView = new TextView(context);
usernameTextView.setTextColor(Theme.getColor(Theme.key_windowBackgroundWhiteGrayText3));
usernameTextView.setTextSize(TypedValue.COMPLEX_UNIT_DIP, 15);
usernameTextView.setSingleLine(true);
usernameTextView.setGravity(Gravity.LEFT);
usernameTextView.setEllipsize(TextUtils.TruncateAt.END);
addView(usernameTextView, LayoutHelper.createLinear(LayoutHelper.WRAP_CONTENT, LayoutHelper.WRAP_CONTENT, Gravity.CENTER_VERTICAL, 12, 0, 8, 0));
}
@Override
protected void onMeasure(int widthMeasureSpec, int heightMeasureSpec) {
super.onMeasure(MeasureSpec.makeMeasureSpec(MeasureSpec.getSize(widthMeasureSpec), MeasureSpec.EXACTLY), MeasureSpec.makeMeasureSpec(AndroidUtilities.dp(36), MeasureSpec.EXACTLY));
}
public void setUser(TLRPC.User user) {
if (user == null) {
nameTextView.setText("");
usernameTextView.setText("");
imageView.setImageDrawable(null);
return;
}
avatarDrawable.setInfo(user);
if (user.photo != null && user.photo.photo_small != null) {
imageView.setImage(ImageLocation.getForUser(user, false), "50_50", avatarDrawable, user);
} else {
imageView.setImageDrawable(avatarDrawable);
}
nameTextView.setText(UserObject.getUserName(user));
if (user.username != null) {
usernameTextView.setText("@" + user.username);
} else {
usernameTextView.setText("");
}
imageView.setVisibility(VISIBLE);
usernameTextView.setVisibility(VISIBLE);
}
public void setText(String text) {
imageView.setVisibility(INVISIBLE);
usernameTextView.setVisibility(INVISIBLE);
nameTextView.setText(text);
}
@Override
public void invalidate() {
super.invalidate();
nameTextView.invalidate();
}
public void setEmojiSuggestion(MediaDataController.KeywordResult suggestion) {
imageView.setVisibility(INVISIBLE);
usernameTextView.setVisibility(INVISIBLE);
StringBuilder stringBuilder = new StringBuilder(suggestion.emoji.length() + suggestion.keyword.length() + 4);
stringBuilder.append(suggestion.emoji);
stringBuilder.append(" :");
stringBuilder.append(suggestion.keyword);
nameTextView.setText(Emoji.replaceEmoji(stringBuilder, nameTextView.getPaint().getFontMetricsInt(), AndroidUtilities.dp(20), false));
}
public void setBotCommand(String command, String help, TLRPC.User user) {
if (user != null) {
imageView.setVisibility(VISIBLE);
avatarDrawable.setInfo(user);
if (user.photo != null && user.photo.photo_small != null) {
imageView.setImage(ImageLocation.getForUser(user, false), "50_50", avatarDrawable, user);
} else {
imageView.setImageDrawable(avatarDrawable);
}
} else {
imageView.setVisibility(INVISIBLE);
}
usernameTextView.setVisibility(VISIBLE);
nameTextView.setText(command);
usernameTextView.setText(Emoji.replaceEmoji(help, usernameTextView.getPaint().getFontMetricsInt(), AndroidUtilities.dp(20), false));
}
public void setIsDarkTheme(boolean isDarkTheme) {
if (isDarkTheme) {
nameTextView.setTextColor(0xffffffff);
usernameTextView.setTextColor(0xffbbbbbb);
} else {
nameTextView.setTextColor(Theme.getColor(Theme.key_windowBackgroundWhiteBlackText));
usernameTextView.setTextColor(Theme.getColor(Theme.key_windowBackgroundWhiteGrayText3));
}
}
}
| {
"pile_set_name": "Github"
} |
namespace Blog.Data.Models
{
using System.Collections.Generic;
using Microsoft.AspNetCore.Identity;
public class User : IdentityUser
{
public List<Article> Articles { get; set; } = new List<Article>();
}
}
| {
"pile_set_name": "Github"
} |
<?php
namespace Hamcrest\Core;
/*
Copyright (c) 2009 hamcrest.org
*/
use Hamcrest\BaseMatcher;
use Hamcrest\Description;
use Hamcrest\Matcher;
/**
* Provides a custom description to another matcher.
*/
class DescribedAs extends BaseMatcher
{
private $_descriptionTemplate;
private $_matcher;
private $_values;
const ARG_PATTERN = '/%([0-9]+)/';
public function __construct($descriptionTemplate, Matcher $matcher, array $values)
{
$this->_descriptionTemplate = $descriptionTemplate;
$this->_matcher = $matcher;
$this->_values = $values;
}
public function matches($item)
{
return $this->_matcher->matches($item);
}
public function describeTo(Description $description)
{
$textStart = 0;
while (preg_match(self::ARG_PATTERN, $this->_descriptionTemplate, $matches, PREG_OFFSET_CAPTURE, $textStart)) {
$text = $matches[0][0];
$index = $matches[1][0];
$offset = $matches[0][1];
$description->appendText(substr($this->_descriptionTemplate, $textStart, $offset - $textStart));
$description->appendValue($this->_values[$index]);
$textStart = $offset + strlen($text);
}
if ($textStart < strlen($this->_descriptionTemplate)) {
$description->appendText(substr($this->_descriptionTemplate, $textStart));
}
}
/**
* Wraps an existing matcher and overrides the description when it fails.
*
* @factory ...
*/
public static function describedAs(/* $description, Hamcrest\Matcher $matcher, $values... */)
{
$args = func_get_args();
$description = array_shift($args);
$matcher = array_shift($args);
$values = $args;
return new self($description, $matcher, $values);
}
}
| {
"pile_set_name": "Github"
} |
<!--
Copyright (c) 1998, Oracle and/or its affiliates. All rights reserved.
DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
This code is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License version 2 only, as
published by the Free Software Foundation. Oracle designates this
particular file as subject to the "Classpath" exception as provided
by Oracle in the LICENSE file that accompanied this code.
This code 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
version 2 for more details (a copy is included in the LICENSE file that
accompanied this code).
You should have received a copy of the GNU General Public License version
2 along with this work; if not, write to the Free Software Foundation,
Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
or visit www.oracle.com if you need additional information or have any
questions.
-->
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
<html>
<body bgcolor="white">
Provides interfaces and classes for transferring data
between and within applications. It defines the notion of a
"transferable" object, which is an object capable of being
transferred between or within applications. An object identifies
itself as being transferable by implementing the Transferable
interface.
<p>
It also provides a clipboard mechanism, which is an object that
temporarily holds a transferable object that can be transferred
between or within an application. The clipboard is typically used
for copy and paste operations. Although it is possible to create
a clipboard to use within an application, most applications will
use the system clipboard to ensure the data can be transferred
across applications running on the platform.
<!--
<h2>Package Specification</h2>
##### FILL IN ANY SPECS NEEDED BY JAVA COMPATIBILITY KIT #####
<ul>
<li><a href="">##### REFER TO ANY FRAMEMAKER SPECIFICATION HERE #####</a>
</ul>
<h2>Related Documentation</h2>
For overviews, tutorials, examples, guides, and tool documentation, please see:
<ul>
<li><a href="">##### REFER TO NON-SPEC DOCUMENTATION HERE #####</a>
</ul>
-->
@since JDK1.1
</body>
</html>
| {
"pile_set_name": "Github"
} |
/*
* Copyright 2011-2015 the original author or authors.
*
* 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
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* 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.
*/
package org.glowroot.agent.tests.app;
public class LevelTwo {
private final RuntimeException exception;
public LevelTwo() {
this(null);
}
LevelTwo(RuntimeException e) {
exception = e;
}
// this method corresponds to LevelTwoAspect
public void call(String arg1, String arg2) {
new LevelThree(exception).call(arg1 + "y", arg2 + "y");
}
}
| {
"pile_set_name": "Github"
} |
e8b6ecb5d15c4c4018a62b52aabc13e41b17df8f
| {
"pile_set_name": "Github"
} |
/* Copyright 2019 The TensorFlow Authors. All Rights Reserved.
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
http://www.apache.org/licenses/LICENSE-2.0
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.
==============================================================================*/
#ifdef INTEL_MKL
#include "tensorflow/core/framework/fake_input.h"
#include "tensorflow/core/framework/node_def_builder.h"
#include "tensorflow/core/framework/tensor.h"
#include "tensorflow/core/kernels/ops_testutil.h"
#include "tensorflow/core/kernels/ops_util.h"
#include "tensorflow/core/lib/core/status_test_util.h"
#include "tensorflow/core/platform/test.h"
#include "tensorflow/core/platform/test_benchmark.h"
#include "tensorflow/core/util/mkl_util.h"
namespace tensorflow {
class MklDequantizeOpTest : public OpsTestBase {};
static const uint8 dummy_tensor[] = {0, 0, 0, 0, 0, 0, 0, 0};
static const TensorShape dummy_shape({8});
TEST_F(MklDequantizeOpTest, small) {
TF_ASSERT_OK(NodeDefBuilder("dequantize_op", "_MklDequantize")
.Input(FakeInput(DT_QUINT8))
.Input(FakeInput(DT_FLOAT))
.Input(FakeInput(DT_FLOAT))
.Input(FakeInput(DT_UINT8)) // MKL second tensor
.Input(FakeInput(DT_UINT8)) // MKL second tensor
.Input(FakeInput(DT_UINT8)) // MKL second tensor
.Attr("T", DataTypeToEnum<quint8>::v())
.Attr("mode", "SCALED")
.Attr("_kernel", "QuantizedMklOp")
.Finalize(node_def()));
TF_ASSERT_OK(InitOp());
AddInputFromArray<quint8>(TensorShape({1, 2, 2, 2}),
{0, 10, 50, 40, 25, 115, 190, 255});
// min_range = 0
AddInputFromArray<float>(TensorShape({1}), {0});
// max_range = 200
AddInputFromArray<float>(TensorShape({1}), {200.0f});
AddInputFromArray<uint8>(dummy_shape, dummy_tensor);
AddInputFromArray<uint8>(dummy_shape, dummy_tensor);
AddInputFromArray<uint8>(dummy_shape, dummy_tensor);
TF_ASSERT_OK(RunOpKernel());
Tensor expected(allocator(), DT_FLOAT, TensorShape({1, 2, 2, 2}));
test::FillValues<float>(&expected,
{0.0, 7.84, 39.21, 31.37, 19.6, 90.2, 149.0, 200});
const Tensor& output = *GetOutput(0);
test::ExpectTensorNear<float>(expected, output, 0.1);
}
template <typename T>
class CommonTestUtilities : public OpsTestBase {
public:
void MklToTF(const Tensor& tensor, const Tensor& mkl_meta_tensor,
Tensor* output) {
// Create an MKL to TF conversion node and execute it
TF_ASSERT_OK(NodeDefBuilder("mkl_to_tf_op", "_MklToTf")
.Input(FakeInput(DataTypeToEnum<T>::v()))
.Input(FakeInput(DT_UINT8)) // MKL second tensor
.Attr("T", DataTypeToEnum<T>::v())
.Attr("_kernel", "MklLayoutDependentOp")
.Finalize(node_def()));
TF_ASSERT_OK(InitOp());
AddInputFromArray<T>(tensor.shape(), tensor.flat<T>());
AddInputFromArray<uint8>(mkl_meta_tensor.shape(),
mkl_meta_tensor.flat<uint8>());
TF_ASSERT_OK(RunOpKernel());
*output = *GetOutput(0);
}
void ConvertAndCompare(const Tensor& tensor, const Tensor& mkl_meta_tensor,
const Tensor& expected) {
Tensor output;
MklToTF(tensor, mkl_meta_tensor, &output);
test::ExpectTensorNear<T>(expected, output, 0.1);
}
void TestBody() {}
};
TEST_F(MklDequantizeOpTest, MKLInput) {
TF_ASSERT_OK(NodeDefBuilder("dequantize_op", "_MklDequantize")
.Input(FakeInput(DT_QUINT8))
.Input(FakeInput(DT_FLOAT))
.Input(FakeInput(DT_FLOAT))
.Input(FakeInput(DT_UINT8)) // MKL second tensor
.Input(FakeInput(DT_UINT8)) // MKL second tensor
.Input(FakeInput(DT_UINT8)) // MKL second tensor
.Attr("T", DataTypeToEnum<quint8>::v())
.Attr("mode", "SCALED")
.Attr("_kernel", "QuantizedMklOp")
.Finalize(node_def()));
TF_ASSERT_OK(InitOp());
AddInputFromArray<quint8>(TensorShape({1, 2, 2, 2}),
{0, 10, 50, 40, 25, 115, 190, 255});
// min_range = 0
AddInputFromArray<float>(TensorShape({1}), {0});
// max_range = 200
AddInputFromArray<float>(TensorShape({1}), {200.0f});
AddInputFromArray<uint8>(dummy_shape, dummy_tensor);
AddInputFromArray<uint8>(dummy_shape, dummy_tensor);
AddInputFromArray<uint8>(dummy_shape, dummy_tensor);
TF_ASSERT_OK(RunOpKernel());
Tensor expected(allocator(), DT_FLOAT, TensorShape({1, 2, 2, 2}));
test::FillValues<float>(&expected,
{0.0, 7.84, 39.21, 31.37, 19.6, 90.2, 149.0, 200});
CommonTestUtilities<float> test_util;
test_util.ConvertAndCompare(*GetOutput(0), *GetOutput(1), expected);
}
} // namespace tensorflow
#endif // INTEL_MKL
| {
"pile_set_name": "Github"
} |
Many lines of numbers and words
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
0000 foo 1111 foo 0000 bar 2222 foo bar 0000 foo 1111 foo 0000 bar 2222 foo bar
foo 2444 foo blah 1234 2444 111 1111 bar foo 2444 foo blah 1234 2444 111 1111 bar
| {
"pile_set_name": "Github"
} |
{
"CVE_data_meta": {
"ASSIGNER": "[email protected]",
"ID": "CVE-2008-4559",
"STATE": "PUBLIC"
},
"affects": {
"vendor": {
"vendor_data": [
{
"product": {
"product_data": [
{
"product_name": "n/a",
"version": {
"version_data": [
{
"version_value": "n/a"
}
]
}
}
]
},
"vendor_name": "n/a"
}
]
}
},
"data_format": "MITRE",
"data_type": "CVE",
"data_version": "4.0",
"description": {
"description_data": [
{
"lang": "eng",
"value": "HP OpenView Network Node Manager (OV NNM) 7.01, 7.51, and 7.53 allows remote attackers to execute arbitrary code via shell metacharacters in argument fields to the (1) webappmon.exe or (2) OpenView5.exe CGI program. NOTE: this issue may be partially covered by CVE-2009-0205."
}
]
},
"problemtype": {
"problemtype_data": [
{
"description": [
{
"lang": "eng",
"value": "n/a"
}
]
}
]
},
"references": {
"reference_data": [
{
"name": "SSRT080100",
"refsource": "HP",
"url": "http://h20000.www2.hp.com/bizsupport/TechSupport/Document.jsp?objectID=c01661610"
},
{
"name": "20090206 HP Network Node Manager Multiple Command Injection Vulnerabilities",
"refsource": "IDEFENSE",
"url": "http://labs.idefense.com/intelligence/vulnerabilities/display.php?id=770"
},
{
"name": "HPSBMA02406",
"refsource": "HP",
"url": "http://h20000.www2.hp.com/bizsupport/TechSupport/Document.jsp?objectID=c01661610"
}
]
}
} | {
"pile_set_name": "Github"
} |
#import <Foundation/Foundation.h>
#import "DDLog.h"
/**
* Welcome to Cocoa Lumberjack!
*
* The project page has a wealth of documentation if you have any questions.
* https://github.com/CocoaLumberjack/CocoaLumberjack
*
* If you're new to the project you may wish to read the "Getting Started" page.
* https://github.com/CocoaLumberjack/CocoaLumberjack/wiki/GettingStarted
*
*
* This formatter can be used to chain different formatters together.
* The log message will processed in the order of the formatters added.
**/
@interface DDMultiFormatter : NSObject <DDLogFormatter>
/**
* Array of chained formatters
*/
@property (readonly) NSArray *formatters;
- (void)addFormatter:(id<DDLogFormatter>)formatter;
- (void)removeFormatter:(id<DDLogFormatter>)formatter;
- (void)removeAllFormatters;
- (BOOL)isFormattingWithFormatter:(id<DDLogFormatter>)formatter;
@end
| {
"pile_set_name": "Github"
} |
// Copyright 2015 Canonical Ltd.
// Licensed under the AGPLv3, see LICENCE file for details.
package vsphere_test
import (
"context"
"fmt"
"io/ioutil"
"net/url"
"path"
"time"
"github.com/golang/mock/gomock"
"github.com/juju/errors"
"github.com/juju/names/v4"
"github.com/juju/testing"
jc "github.com/juju/testing/checkers"
"github.com/juju/utils/v2/arch"
"github.com/juju/version"
"github.com/vmware/govmomi/object"
"github.com/vmware/govmomi/vim25/soap"
"github.com/vmware/govmomi/vim25/types"
gc "gopkg.in/check.v1"
"github.com/juju/juju/api"
"github.com/juju/juju/cloudconfig/instancecfg"
"github.com/juju/juju/core/constraints"
"github.com/juju/juju/core/instance"
"github.com/juju/juju/core/status"
"github.com/juju/juju/environs"
"github.com/juju/juju/environs/config"
callcontext "github.com/juju/juju/environs/context"
"github.com/juju/juju/provider/common"
"github.com/juju/juju/provider/vsphere"
"github.com/juju/juju/provider/vsphere/internal/ovatest"
"github.com/juju/juju/provider/vsphere/internal/vsphereclient"
"github.com/juju/juju/provider/vsphere/mocks"
coretesting "github.com/juju/juju/testing"
coretools "github.com/juju/juju/tools"
)
type legacyEnvironBrokerSuite struct {
EnvironFixture
statusCallbackStub testing.Stub
}
var _ = gc.Suite(&legacyEnvironBrokerSuite{})
func (s *legacyEnvironBrokerSuite) SetUpTest(c *gc.C) {
s.EnvironFixture.SetUpTest(c)
s.statusCallbackStub.ResetCalls()
s.client.folders = makeFolders("/DC/host")
s.client.computeResources = []vsphereclient.ComputeResource{
{Resource: newComputeResource("z1"), Path: "/DC/host/z1"},
{Resource: newComputeResource("z2"), Path: "/DC/host/z2"},
}
s.client.resourcePools = map[string][]*object.ResourcePool{
"/DC/host/z1/...": {makeResourcePool("pool-1", "/DC/host/z1/Resources")},
"/DC/host/z2/...": {makeResourcePool("pool-2", "/DC/host/z2/Resources")},
}
s.client.createdVirtualMachine = buildVM("new-vm").vm()
}
func (s *legacyEnvironBrokerSuite) createStartInstanceArgs(c *gc.C) environs.StartInstanceParams {
var cons constraints.Value
instanceConfig, err := instancecfg.NewBootstrapInstanceConfig(
coretesting.FakeControllerConfig(), cons, cons, "trusty", "", nil,
)
c.Assert(err, jc.ErrorIsNil)
setInstanceConfigAuthorizedKeys(c, instanceConfig)
tools := setInstanceConfigTools(c, instanceConfig)
return environs.StartInstanceParams{
AvailabilityZone: "z1",
ControllerUUID: instanceConfig.Controller.Config.ControllerUUID(),
InstanceConfig: instanceConfig,
Tools: tools,
Constraints: cons,
StatusCallback: func(status status.Status, info string, data map[string]interface{}) error {
s.statusCallbackStub.AddCall("StatusCallback", status, info, data)
return s.statusCallbackStub.NextErr()
},
}
}
func setInstanceConfigTools(c *gc.C, instanceConfig *instancecfg.InstanceConfig) coretools.List {
tools := []*coretools.Tools{{
Version: version.Binary{
Number: version.MustParse("1.2.3"),
Arch: arch.AMD64,
Series: "trusty",
},
URL: "https://example.org",
}}
err := instanceConfig.SetTools(tools[:1])
c.Assert(err, jc.ErrorIsNil)
return tools
}
func setInstanceConfigAuthorizedKeys(c *gc.C, instanceConfig *instancecfg.InstanceConfig) {
config := fakeConfig(c)
instanceConfig.AuthorizedKeys = config.AuthorizedKeys()
}
func (s *legacyEnvironBrokerSuite) TestStartInstance(c *gc.C) {
startInstArgs := s.createStartInstanceArgs(c)
startInstArgs.InstanceConfig.Tags = map[string]string{
"k0": "v0",
"k1": "v1",
}
result, err := s.env.StartInstance(s.callCtx, startInstArgs)
c.Assert(err, jc.ErrorIsNil)
c.Assert(result, gc.NotNil)
c.Assert(result.Instance, gc.NotNil)
c.Assert(result.Instance.Id(), gc.Equals, instance.Id("new-vm"))
s.client.CheckCallNames(c, "Folders", "ComputeResources", "ResourcePools", "ResourcePools", "CreateVirtualMachine", "Close")
call := s.client.Calls()[4]
c.Assert(call.Args, gc.HasLen, 2)
c.Assert(call.Args[0], gc.Implements, new(context.Context))
c.Assert(call.Args[1], gc.FitsTypeOf, vsphereclient.CreateVirtualMachineParams{})
createVMArgs := call.Args[1].(vsphereclient.CreateVirtualMachineParams)
c.Assert(createVMArgs.UserData, gc.Not(gc.Equals), "")
c.Assert(createVMArgs.ReadOVA, gc.NotNil)
readOVA := createVMArgs.ReadOVA
createVMArgs.UserData = ""
createVMArgs.Constraints = constraints.Value{}
createVMArgs.UpdateProgress = nil
createVMArgs.Clock = nil
createVMArgs.ReadOVA = nil
createVMArgs.NetworkDevices = []vsphereclient.NetworkDevice{}
c.Assert(createVMArgs, jc.DeepEquals, vsphereclient.CreateVirtualMachineParams{
Name: "juju-f75cba-0",
Folder: `Juju Controller (deadbeef-1bad-500d-9000-4b1d0d06f00d)/Model "testmodel" (2d02eeac-9dbb-11e4-89d3-123b93f75cba)`,
VMDKDirectory: "Juju Controller (deadbeef-1bad-500d-9000-4b1d0d06f00d)/templates",
Series: startInstArgs.Tools.OneSeries(),
OVASHA256: ovatest.FakeOVASHA256(),
Metadata: startInstArgs.InstanceConfig.Tags,
ComputeResource: s.client.computeResources[0].Resource,
ResourcePool: types.ManagedObjectReference{
Type: "ResourcePool",
Value: "pool-1",
},
UpdateProgressInterval: 5 * time.Second,
EnableDiskUUID: true,
IsBootstrap: true,
})
ovaLocation, ovaReadCloser, err := readOVA()
c.Assert(err, jc.ErrorIsNil)
defer ovaReadCloser.Close()
c.Assert(
ovaLocation, gc.Equals,
s.imageServer.URL+"/server/releases/trusty/release-20150305/ubuntu-14.04-server-cloudimg-amd64.ova",
)
ovaBody, err := ioutil.ReadAll(ovaReadCloser)
c.Assert(err, jc.ErrorIsNil)
c.Assert(ovaBody, jc.DeepEquals, ovatest.FakeOVAContents())
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceNetwork(c *gc.C) {
env, err := s.provider.Open(environs.OpenParams{
Cloud: fakeCloudSpec(),
Config: fakeConfig(c, coretesting.Attrs{
"primary-network": "foo",
"external-network": "bar",
"image-metadata-url": s.imageServer.URL,
}),
})
c.Assert(err, jc.ErrorIsNil)
result, err := env.StartInstance(s.callCtx, s.createStartInstanceArgs(c))
c.Assert(err, jc.ErrorIsNil)
c.Assert(result, gc.NotNil)
call := s.client.Calls()[4]
createVMArgs := call.Args[1].(vsphereclient.CreateVirtualMachineParams)
c.Assert(createVMArgs.NetworkDevices, gc.HasLen, 2)
c.Assert(createVMArgs.NetworkDevices[0].Network, gc.Equals, "foo")
c.Assert(createVMArgs.NetworkDevices[1].Network, gc.Equals, "bar")
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceLongModelName(c *gc.C) {
env, err := s.provider.Open(environs.OpenParams{
Cloud: fakeCloudSpec(),
Config: fakeConfig(c, coretesting.Attrs{
"name": "supercalifragilisticexpialidocious",
"image-metadata-url": s.imageServer.URL,
}),
})
c.Assert(err, jc.ErrorIsNil)
startInstArgs := s.createStartInstanceArgs(c)
_, err = env.StartInstance(s.callCtx, startInstArgs)
c.Assert(err, jc.ErrorIsNil)
call := s.client.Calls()[4]
createVMArgs := call.Args[1].(vsphereclient.CreateVirtualMachineParams)
// The model name in the folder name should be truncated
// so that the final part of the model name is 80 characters.
c.Assert(path.Base(createVMArgs.Folder), gc.HasLen, 80)
c.Assert(createVMArgs.Folder, gc.Equals,
`Juju Controller (deadbeef-1bad-500d-9000-4b1d0d06f00d)/Model "supercalifragilisticexpialidociou" (2d02eeac-9dbb-11e4-89d3-123b93f75cba)`,
)
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceDiskUUIDDisabled(c *gc.C) {
env, err := s.provider.Open(environs.OpenParams{
Cloud: fakeCloudSpec(),
Config: fakeConfig(c, coretesting.Attrs{
"enable-disk-uuid": false,
"image-metadata-url": s.imageServer.URL,
}),
})
c.Assert(err, jc.ErrorIsNil)
result, err := env.StartInstance(s.callCtx, s.createStartInstanceArgs(c))
c.Assert(err, jc.ErrorIsNil)
c.Assert(result, gc.NotNil)
call := s.client.Calls()[4]
createVMArgs := call.Args[1].(vsphereclient.CreateVirtualMachineParams)
c.Assert(createVMArgs.EnableDiskUUID, gc.Equals, false)
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceWithUnsupportedConstraints(c *gc.C) {
startInstArgs := s.createStartInstanceArgs(c)
startInstArgs.Tools[0].Version.Arch = "someArch"
_, err := s.env.StartInstance(s.callCtx, startInstArgs)
c.Assert(err, gc.ErrorMatches, "no matching images found for given constraints: .*")
c.Assert(err, jc.Satisfies, environs.IsAvailabilityZoneIndependent)
}
// if tools for multiple architectures are available, provider should filter tools by arch of the selected image
func (s *legacyEnvironBrokerSuite) TestStartInstanceFilterToolByArch(c *gc.C) {
startInstArgs := s.createStartInstanceArgs(c)
tools := []*coretools.Tools{{
Version: version.Binary{Arch: arch.I386, Series: "trusty"},
URL: "https://example.org",
}, {
Version: version.Binary{Arch: arch.AMD64, Series: "trusty"},
URL: "https://example.org",
}}
// Setting tools to I386, but provider should update them to AMD64,
// because our fake simplestream server returns only an AMD64 image.
startInstArgs.Tools = tools
err := startInstArgs.InstanceConfig.SetTools(coretools.List{
tools[0],
})
c.Assert(err, jc.ErrorIsNil)
res, err := s.env.StartInstance(s.callCtx, startInstArgs)
c.Assert(err, jc.ErrorIsNil)
c.Assert(*res.Hardware.Arch, gc.Equals, arch.AMD64)
c.Assert(startInstArgs.InstanceConfig.AgentVersion().Arch, gc.Equals, arch.AMD64)
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceDefaultConstraintsApplied(c *gc.C) {
cfg := s.env.Config()
cfg, err := cfg.Apply(map[string]interface{}{
"datastore": "datastore0",
})
c.Assert(err, jc.ErrorIsNil)
err = s.env.SetConfig(cfg)
c.Assert(err, jc.ErrorIsNil)
startInstArgs := s.createStartInstanceArgs(c)
res, err := s.env.StartInstance(s.callCtx, startInstArgs)
c.Assert(err, jc.ErrorIsNil)
var (
arch = "amd64"
rootDisk = common.MinRootDiskSizeGiB("trusty") * 1024
datastore = "datastore0"
)
c.Assert(res.Hardware, jc.DeepEquals, &instance.HardwareCharacteristics{
Arch: &arch,
RootDisk: &rootDisk,
RootDiskSource: &datastore,
})
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceCustomConstraintsApplied(c *gc.C) {
var (
cpuCores uint64 = 4
cpuPower uint64 = 2001
mem uint64 = 2002
rootDisk uint64 = 10003
source = "datastore1"
)
startInstArgs := s.createStartInstanceArgs(c)
startInstArgs.Constraints.CpuCores = &cpuCores
startInstArgs.Constraints.CpuPower = &cpuPower
startInstArgs.Constraints.Mem = &mem
startInstArgs.Constraints.RootDisk = &rootDisk
startInstArgs.Constraints.RootDiskSource = &source
res, err := s.env.StartInstance(s.callCtx, startInstArgs)
c.Assert(err, jc.ErrorIsNil)
arch := "amd64"
c.Assert(res.Hardware, jc.DeepEquals, &instance.HardwareCharacteristics{
Arch: &arch,
CpuCores: &cpuCores,
CpuPower: &cpuPower,
Mem: &mem,
RootDisk: &rootDisk,
RootDiskSource: &source,
})
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceCallsFinishMachineConfig(c *gc.C) {
startInstArgs := s.createStartInstanceArgs(c)
s.PatchValue(&vsphere.FinishInstanceConfig, func(mcfg *instancecfg.InstanceConfig, cfg *config.Config) (err error) {
return errors.New("FinishMachineConfig called")
})
_, err := s.env.StartInstance(s.callCtx, startInstArgs)
c.Assert(err, gc.ErrorMatches, "FinishMachineConfig called")
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceDefaultDiskSizeIsUsedForSmallConstraintValue(c *gc.C) {
startInstArgs := s.createStartInstanceArgs(c)
rootDisk := uint64(1000)
startInstArgs.Constraints.RootDisk = &rootDisk
res, err := s.env.StartInstance(s.callCtx, startInstArgs)
c.Assert(err, jc.ErrorIsNil)
c.Assert(*res.Hardware.RootDisk, gc.Equals, common.MinRootDiskSizeGiB("trusty")*uint64(1024))
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceSelectZone(c *gc.C) {
startInstArgs := s.createStartInstanceArgs(c)
startInstArgs.AvailabilityZone = "z2"
_, err := s.env.StartInstance(s.callCtx, startInstArgs)
c.Assert(err, jc.ErrorIsNil)
s.client.CheckCallNames(c, "Folders", "ComputeResources", "ResourcePools", "ResourcePools", "CreateVirtualMachine", "Close")
call := s.client.Calls()[4]
c.Assert(call.Args, gc.HasLen, 2)
c.Assert(call.Args[0], gc.Implements, new(context.Context))
c.Assert(call.Args[1], gc.FitsTypeOf, vsphereclient.CreateVirtualMachineParams{})
createVMArgs := call.Args[1].(vsphereclient.CreateVirtualMachineParams)
c.Assert(createVMArgs.ComputeResource, jc.DeepEquals, s.client.computeResources[1].Resource)
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceFailsWithAvailabilityZone(c *gc.C) {
s.client.SetErrors(nil, nil, nil, nil, errors.New("nope"))
startInstArgs := s.createStartInstanceArgs(c)
_, err := s.env.StartInstance(s.callCtx, startInstArgs)
c.Assert(err, gc.Not(jc.Satisfies), environs.IsAvailabilityZoneIndependent)
s.client.CheckCallNames(c, "Folders", "ComputeResources", "ResourcePools", "ResourcePools", "CreateVirtualMachine", "FindFolder", "Close")
createVMCall1 := s.client.Calls()[4]
createVMArgs1 := createVMCall1.Args[1].(vsphereclient.CreateVirtualMachineParams)
c.Assert(createVMArgs1.ComputeResource, jc.DeepEquals, s.client.computeResources[0].Resource)
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceDatastoreDefault(c *gc.C) {
cfg := s.env.Config()
cfg, err := cfg.Apply(map[string]interface{}{
"datastore": "datastore0",
})
c.Assert(err, jc.ErrorIsNil)
err = s.env.SetConfig(cfg)
c.Assert(err, jc.ErrorIsNil)
_, err = s.env.StartInstance(s.callCtx, s.createStartInstanceArgs(c))
c.Assert(err, jc.ErrorIsNil)
call := s.client.Calls()[4]
createVMArgs := call.Args[1].(vsphereclient.CreateVirtualMachineParams)
c.Assert(*createVMArgs.Constraints.RootDiskSource, gc.Equals, "datastore0")
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceRootDiskSource(c *gc.C) {
cfg := s.env.Config()
cfg, err := cfg.Apply(map[string]interface{}{
"datastore": "datastore0",
})
c.Assert(err, jc.ErrorIsNil)
err = s.env.SetConfig(cfg)
c.Assert(err, jc.ErrorIsNil)
args := s.createStartInstanceArgs(c)
datastore := "zebras"
args.Constraints.RootDiskSource = &datastore
result, err := s.env.StartInstance(s.callCtx, args)
c.Assert(err, jc.ErrorIsNil)
c.Assert(*result.Hardware.RootDiskSource, gc.Equals, "zebras")
call := s.client.Calls()[4]
createVMArgs := call.Args[1].(vsphereclient.CreateVirtualMachineParams)
c.Assert(*createVMArgs.Constraints.RootDiskSource, gc.Equals, "zebras")
}
type environBrokerSuite struct {
coretesting.BaseSuite
mockClient *mocks.MockClient
provider environs.CloudEnvironProvider
callCtx callcontext.ProviderCallContext
env environs.Environ
imageServerURL string
}
var _ = gc.Suite(&environBrokerSuite{})
func (s *environBrokerSuite) setUpClient(c *gc.C) *gomock.Controller {
ctrl := gomock.NewController(c)
s.callCtx = callcontext.NewCloudCallContext()
s.mockClient = mocks.NewMockClient(ctrl)
s.provider = vsphere.NewEnvironProvider(vsphere.EnvironProviderConfig{
Dial: func(_ context.Context, _ *url.URL, _ string) (vsphere.Client, error) {
return s.mockClient, nil
},
})
env, err := s.provider.Open(environs.OpenParams{
Cloud: fakeCloudSpec(),
Config: fakeConfig(c, coretesting.Attrs{
"image-metadata-url": s.imageServerURL,
}),
})
c.Assert(err, jc.ErrorIsNil)
s.env = env
return ctrl
}
func (s *environBrokerSuite) TestStopInstances(c *gc.C) {
ctrl := s.setUpClient(c)
defer ctrl.Finish()
s.mockClient.EXPECT().
RemoveVirtualMachines(gomock.Any(), `Juju Controller (*)/Model "testmodel" (2d02eeac-9dbb-11e4-89d3-123b93f75cba)/vm-0`).
Return(nil)
s.mockClient.EXPECT().
RemoveVirtualMachines(gomock.Any(), `Juju Controller (*)/Model "testmodel" (2d02eeac-9dbb-11e4-89d3-123b93f75cba)/vm-1`).
Return(nil)
s.mockClient.EXPECT().Close(gomock.Any()).Return(nil)
err := s.env.StopInstances(s.callCtx, "vm-0", "vm-1")
c.Assert(err, jc.ErrorIsNil)
}
func (s *environBrokerSuite) TestStopInstancesOneFailure(c *gc.C) {
ctrl := s.setUpClient(c)
defer ctrl.Finish()
failedRemoveVM := s.mockClient.EXPECT().
RemoveVirtualMachines(gomock.Any(), `Juju Controller (*)/Model "testmodel" (2d02eeac-9dbb-11e4-89d3-123b93f75cba)/vm-0`).
Return(errors.New("bah"))
s.mockClient.EXPECT().
RemoveVirtualMachines(gomock.Any(), `Juju Controller (*)/Model "testmodel" (2d02eeac-9dbb-11e4-89d3-123b93f75cba)/vm-1`).
Return(nil)
s.mockClient.EXPECT().
FindFolder(gomock.Any(), "").
After(failedRemoveVM).Return(nil, nil) // only do find folder check if the RemoveVirtualMachines failed.
s.mockClient.EXPECT().Close(gomock.Any()).Return(nil)
err := s.env.StopInstances(s.callCtx, "vm-0", "vm-1")
c.Assert(err, gc.ErrorMatches, fmt.Sprintf("failed to stop instance %s: bah", "vm-0"))
}
func (s *environBrokerSuite) TestStopInstancesMultipleFailures(c *gc.C) {
ctrl := s.setUpClient(c)
defer ctrl.Finish()
err1 := errors.New("bah")
err2 := errors.New("bleh")
failedRemoveVM1 := s.mockClient.EXPECT().
RemoveVirtualMachines(gomock.Any(), `Juju Controller (*)/Model "testmodel" (2d02eeac-9dbb-11e4-89d3-123b93f75cba)/vm-0`).
Return(err1)
failedRemoveVM2 := s.mockClient.EXPECT().
RemoveVirtualMachines(gomock.Any(), `Juju Controller (*)/Model "testmodel" (2d02eeac-9dbb-11e4-89d3-123b93f75cba)/vm-1`).
Return(err2)
s.mockClient.EXPECT().
FindFolder(gomock.Any(), "").
After(failedRemoveVM1).Return(nil, nil)
s.mockClient.EXPECT().
FindFolder(gomock.Any(), "").
After(failedRemoveVM2).Return(nil, nil)
s.mockClient.EXPECT().Close(gomock.Any()).Return(nil)
err := s.env.StopInstances(s.callCtx, "vm-0", "vm-1")
c.Assert(err, gc.ErrorMatches, fmt.Sprintf(
`failed to stop instances \[vm-0 vm-1\]: \[%s %s\]`,
err1, err2,
))
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceLoginErrorInvalidatesCreds(c *gc.C) {
s.dialStub.SetErrors(soap.WrapSoapFault(&soap.Fault{
Code: "ServerFaultCode",
String: "You passed an incorrect user name or password, bucko.",
}))
var passedReason string
ctx := &callcontext.CloudCallContext{
InvalidateCredentialFunc: func(reason string) error {
passedReason = reason
return nil
},
}
_, err := s.env.StartInstance(ctx, s.createStartInstanceArgs(c))
c.Assert(err, gc.ErrorMatches, "dialing client: ServerFaultCode: You passed an incorrect user name or password, bucko.")
c.Assert(passedReason, gc.Equals, "cloud denied access")
}
func (s *legacyEnvironBrokerSuite) TestStartInstancePermissionError(c *gc.C) {
AssertInvalidatesCredential(c, s.client, func(ctx callcontext.ProviderCallContext) error {
_, err := s.env.StartInstance(ctx, s.createStartInstanceArgs(c))
return err
})
}
func (s *legacyEnvironBrokerSuite) TestStopInstancesPermissionError(c *gc.C) {
AssertInvalidatesCredential(c, s.client, func(ctx callcontext.ProviderCallContext) error {
return s.env.StopInstances(ctx, "vm-0")
})
}
func (s *legacyEnvironBrokerSuite) TestStartInstanceNoDatastoreSetting(c *gc.C) {
startInstArgs := s.createStartInstanceArgs(c)
res, err := s.env.StartInstance(s.callCtx, startInstArgs)
c.Assert(err, jc.ErrorIsNil)
s.client.CheckCallNames(c, "Folders", "ComputeResources", "ResourcePools", "ResourcePools", "CreateVirtualMachine", "Close")
call := s.client.Calls()[4]
c.Assert(call.Args, gc.HasLen, 2)
c.Assert(call.Args[0], gc.Implements, new(context.Context))
c.Assert(call.Args[1], gc.FitsTypeOf, vsphereclient.CreateVirtualMachineParams{})
createVMArgs := call.Args[1].(vsphereclient.CreateVirtualMachineParams)
var expected *string
c.Assert(createVMArgs.Constraints.RootDiskSource, gc.Equals, expected)
var (
arch = "amd64"
rootDisk = common.MinRootDiskSizeGiB("trusty") * 1024
)
c.Assert(res.Hardware, jc.DeepEquals, &instance.HardwareCharacteristics{
Arch: &arch,
RootDisk: &rootDisk,
RootDiskSource: nil,
})
}
func (s *legacyEnvironBrokerSuite) TestNotBootstrapping(c *gc.C) {
startInstArgs := s.createStartInstanceArgs(c)
nonBootstrapInstance, err := instancecfg.NewInstanceConfig(
names.NewControllerTag(coretesting.FakeControllerConfig().ControllerUUID()),
"0",
"nonce",
"",
"xenial",
&api.Info{
Tag: names.NewMachineTag("0"),
ModelTag: coretesting.ModelTag,
CACert: "supersecret",
Addrs: []string{"hey:123"},
Password: "mypassword1!",
},
)
c.Assert(err, jc.ErrorIsNil)
startInstArgs.InstanceConfig = nonBootstrapInstance
result, err := s.env.StartInstance(s.callCtx, startInstArgs)
c.Assert(err, jc.ErrorIsNil)
c.Assert(result, gc.NotNil)
c.Assert(result.Instance, gc.NotNil)
c.Assert(result.Instance.Id(), gc.Equals, instance.Id("new-vm"))
s.client.CheckCallNames(c, "Folders", "ComputeResources", "ResourcePools", "ResourcePools", "CreateVirtualMachine", "Close")
call := s.client.Calls()[4]
c.Assert(call.Args, gc.HasLen, 2)
c.Assert(call.Args[0], gc.Implements, new(context.Context))
c.Assert(call.Args[1], gc.FitsTypeOf, vsphereclient.CreateVirtualMachineParams{})
createVMArgs := call.Args[1].(vsphereclient.CreateVirtualMachineParams)
c.Assert(createVMArgs.IsBootstrap, gc.Equals, false)
}
| {
"pile_set_name": "Github"
} |
import state from './state'
import * as type from './type.js'
import { MessageBox } from 'mint-ui';
import axios from 'axios'
const matutaions={
[type.SET_XZADDRESS](state,data){
state.xzAddess.push(data)
// localStorage.setItem("xzAddess",JSON.stringify(state.xzAddess));
},
//数量加
add(state,cart){
cart.sum++
},
//数量减
reduce(state,cart){
cart.sum==1? cart.sum=1: cart.sum--
},
settlement:(state,data)=>{
state.carts=[];
localStorage.setItem("carts",JSON.stringify(state.carts));
},
}
export default matutaions | {
"pile_set_name": "Github"
} |
<%= component_fields_for @record do |f| %>
<div class="label">
<%= f.label field %>
<div class="field_error">
<%= @record.errors[field.name.to_sym].first %>
</div>
</div>
<%= f.text_area field, field.input_options %>
<% end %>
| {
"pile_set_name": "Github"
} |
/*
* $Id: amijoy.c,v 1.13 2002/01/22 20:26:32 vojtech Exp $
*
* Copyright (c) 1998-2001 Vojtech Pavlik
*/
/*
* Driver for Amiga joysticks for Linux/m68k
*/
/*
* 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 2 of the License, or
* (at your option) any later version.
*
* 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.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Should you need to contact me, the author, you can do so either by
* e-mail - mail your message to <[email protected]>, or by paper mail:
* Vojtech Pavlik, Simunkova 1594, Prague 8, 182 00 Czech Republic
*/
#include <linux/types.h>
#include <linux/errno.h>
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/moduleparam.h>
#include <linux/init.h>
#include <linux/input.h>
#include <linux/interrupt.h>
#include <linux/mutex.h>
#include <asm/system.h>
#include <asm/amigahw.h>
#include <asm/amigaints.h>
MODULE_AUTHOR("Vojtech Pavlik <[email protected]>");
MODULE_DESCRIPTION("Driver for Amiga joysticks");
MODULE_LICENSE("GPL");
static int amijoy[2] = { 0, 1 };
module_param_array_named(map, amijoy, uint, NULL, 0);
MODULE_PARM_DESC(map, "Map of attached joysticks in form of <a>,<b> (default is 0,1)");
static int amijoy_used;
static DEFINE_MUTEX(amijoy_mutex);
static struct input_dev *amijoy_dev[2];
static char *amijoy_phys[2] = { "amijoy/input0", "amijoy/input1" };
static irqreturn_t amijoy_interrupt(int irq, void *dummy)
{
int i, data = 0, button = 0;
for (i = 0; i < 2; i++)
if (amijoy[i]) {
switch (i) {
case 0: data = ~amiga_custom.joy0dat; button = (~ciaa.pra >> 6) & 1; break;
case 1: data = ~amiga_custom.joy1dat; button = (~ciaa.pra >> 7) & 1; break;
}
input_report_key(amijoy_dev[i], BTN_TRIGGER, button);
input_report_abs(amijoy_dev[i], ABS_X, ((data >> 1) & 1) - ((data >> 9) & 1));
data = ~(data ^ (data << 1));
input_report_abs(amijoy_dev[i], ABS_Y, ((data >> 1) & 1) - ((data >> 9) & 1));
input_sync(amijoy_dev[i]);
}
return IRQ_HANDLED;
}
static int amijoy_open(struct input_dev *dev)
{
int err;
err = mutex_lock_interruptible(&amijoy_mutex);
if (err)
return err;
if (!amijoy_used && request_irq(IRQ_AMIGA_VERTB, amijoy_interrupt, 0, "amijoy", amijoy_interrupt)) {
printk(KERN_ERR "amijoy.c: Can't allocate irq %d\n", IRQ_AMIGA_VERTB);
err = -EBUSY;
goto out;
}
amijoy_used++;
out:
mutex_unlock(&amijoy_mutex);
return err;
}
static void amijoy_close(struct input_dev *dev)
{
mutex_lock(&amijoy_mutex);
if (!--amijoy_used)
free_irq(IRQ_AMIGA_VERTB, amijoy_interrupt);
mutex_unlock(&amijoy_mutex);
}
static int __init amijoy_init(void)
{
int i, j;
int err;
for (i = 0; i < 2; i++) {
if (!amijoy[i])
continue;
amijoy_dev[i] = input_allocate_device();
if (!amijoy_dev[i]) {
err = -ENOMEM;
goto fail;
}
if (!request_mem_region(CUSTOM_PHYSADDR + 10 + i * 2, 2, "amijoy [Denise]")) {
input_free_device(amijoy_dev[i]);
err = -EBUSY;
goto fail;
}
amijoy_dev[i]->name = "Amiga joystick";
amijoy_dev[i]->phys = amijoy_phys[i];
amijoy_dev[i]->id.bustype = BUS_AMIGA;
amijoy_dev[i]->id.vendor = 0x0001;
amijoy_dev[i]->id.product = 0x0003;
amijoy_dev[i]->id.version = 0x0100;
amijoy_dev[i]->open = amijoy_open;
amijoy_dev[i]->close = amijoy_close;
amijoy_dev[i]->evbit[0] = BIT(EV_KEY) | BIT(EV_ABS);
amijoy_dev[i]->absbit[0] = BIT(ABS_X) | BIT(ABS_Y);
amijoy_dev[i]->keybit[LONG(BTN_LEFT)] = BIT(BTN_LEFT) | BIT(BTN_MIDDLE) | BIT(BTN_RIGHT);
for (j = 0; j < 2; j++) {
amijoy_dev[i]->absmin[ABS_X + j] = -1;
amijoy_dev[i]->absmax[ABS_X + j] = 1;
}
err = input_register_device(amijoy_dev[i]);
if (err) {
input_free_device(amijoy_dev[i]);
goto fail;
}
}
return 0;
fail: while (--i >= 0)
if (amijoy[i]) {
input_unregister_device(amijoy_dev[i]);
release_mem_region(CUSTOM_PHYSADDR + 10 + i * 2, 2);
}
return err;
}
static void __exit amijoy_exit(void)
{
int i;
for (i = 0; i < 2; i++)
if (amijoy[i]) {
input_unregister_device(amijoy_dev[i]);
release_mem_region(CUSTOM_PHYSADDR + 10 + i * 2, 2);
}
}
module_init(amijoy_init);
module_exit(amijoy_exit);
| {
"pile_set_name": "Github"
} |
ATTRIBUTE_TYPE ( 1.3.6.1.4.1.4203.666.1.7
NAME 'entryCSN'
DESC change sequence number of the entry
EQUALITY csnMatch
ORDERING csnOrderingMatch
SYNTAX 1.3.6.1.4.1.4203.666.11.2.1
SINGLE-VALUE
NO-USER-MODIFICATION
USAGE directoryOperation
)
| {
"pile_set_name": "Github"
} |
<!DOCTYPE html>
<html>
<head>
<title>cannon.js - pile demo</title>
<meta charset="utf-8">
<link rel="stylesheet" href="css/style.css" type="text/css"/>
<meta name="viewport" content="width=device-width, user-scalable=no, minimum-scale=1.0, maximum-scale=1.0">
</head>
<body>
<script src="../build/cannon.js"></script>
<script src="../build/cannon.demo.js"></script>
<script src="../libs/dat.gui.js"></script>
<script src="../libs/Three.js"></script>
<script src="../libs/TrackballControls.js"></script>
<script src="../libs/Detector.js"></script>
<script src="../libs/Stats.js"></script>
<script src="../libs/smoothie.js"></script>
<script>
var demo = new CANNON.Demo();
var size = 1;
var interval;
// Spheres
demo.addScene("Pile",function(){
if(interval) clearInterval(interval);
var world = demo.getWorld();
world.gravity.set(0,0,-50);
world.broadphase = new CANNON.NaiveBroadphase();
world.solver.iterations = 5;
world.defaultContactMaterial.contactEquationStiffness = 5e6;
world.defaultContactMaterial.contactEquationRelaxation = 10;
// Since we have many bodies and they don't move very much, we can use the less accurate quaternion normalization
world.quatNormalizeFast = true;
world.quatNormalizeSkip = 3; // ...and we do not have to normalize every step.
// ground plane
var groundShape = new CANNON.Plane(new CANNON.Vec3(0,0,1));
var groundBody = new CANNON.Body({ mass: 0 });
groundBody.addShape(groundShape);
groundBody.position.set(0,0,0);
world.addBody(groundBody);
demo.addVisual(groundBody);
// plane -x
var planeShapeXmin = new CANNON.Plane();
var planeXmin = new CANNON.Body({ mass: 0 });
planeXmin.addShape(planeShapeXmin);
planeXmin.quaternion.setFromAxisAngle(new CANNON.Vec3(0,1,0),Math.PI/2);
planeXmin.position.set(-5,0,0);
world.addBody(planeXmin);
// Plane +x
var planeShapeXmax = new CANNON.Plane();
var planeXmax = new CANNON.Body({ mass: 0 });
planeXmax.addShape(planeShapeXmax);
planeXmax.quaternion.setFromAxisAngle(new CANNON.Vec3(0,1,0),-Math.PI/2);
planeXmax.position.set(5,0,0);
world.addBody(planeXmax);
// Plane -y
var planeShapeYmin = new CANNON.Plane();
var planeYmin = new CANNON.Body({ mass: 0 });
planeYmin.addShape(planeShapeYmin);
planeYmin.quaternion.setFromAxisAngle(new CANNON.Vec3(1,0,0),-Math.PI/2);
planeYmin.position.set(0,-5,0);
world.addBody(planeYmin);
// Plane +y
var planeShapeYmax = new CANNON.Plane();
var planeYmax = new CANNON.Body({ mass: 0 });
planeYmax.addShape(planeShapeYmax);
planeYmax.quaternion.setFromAxisAngle(new CANNON.Vec3(1,0,0),Math.PI/2);
planeYmax.position.set(0,5,0);
world.addBody(planeYmax);
var bodies = [];
var i = 0;
interval = setInterval(function(){
// Sphere
i++;
var sphereShape = new CANNON.Sphere(size);
var b1 = new CANNON.Body({
mass: 5,
position: new CANNON.Vec3(
2*size*Math.sin(i),
2*size*Math.cos(i),
7*2*size
)
});
b1.addShape(sphereShape);
world.addBody(b1);
demo.addVisual(b1);
bodies.push(b1);
if(bodies.length>80){
var b = bodies.shift();
demo.removeVisual(b);
world.remove(b);
}
},100);
});
demo.start();
</script>
</body>
</html>
| {
"pile_set_name": "Github"
} |
/*--------------------------------------------------------*\
| |
| hprose |
| |
| Official WebSite: https://hprose.com |
| |
| ExceptionDeserializer.cs |
| |
| ExceptionDeserializer class for C#. |
| |
| LastModified: Jun 30, 2020 |
| Author: Ma Bingyao <[email protected]> |
| |
\*________________________________________________________*/
using System;
namespace Hprose.IO.Deserializers {
using System.Reflection;
using static Tags;
internal class ExceptionDeserializer<T> : Deserializer<T> where T : Exception {
public override T Read(Reader reader, int tag) => tag switch
{
#if !NET35_CF
TagError => (T)Activator.CreateInstance(typeof(T), new object[] { reader.Deserialize<string>() }),
#else
TagError => (T)typeof(T).GetConstructor(new Type[] { typeof(string) }).Invoke(new object[] { reader.Deserialize<string>() }),
#endif
_ => base.Read(reader, tag),
};
}
}
| {
"pile_set_name": "Github"
} |
'use strict';
require('../common');
// Verify connection with explicitly created client SecureContext.
const fixtures = require('../common/fixtures');
const {
assert, connect, keys, tls
} = require(fixtures.path('tls-connect'));
connect({
client: {
servername: 'agent1',
secureContext: tls.createSecureContext({
ca: keys.agent1.ca,
}),
},
server: {
cert: keys.agent1.cert,
key: keys.agent1.key,
},
}, function(err, pair, cleanup) {
assert.ifError(err);
return cleanup();
});
| {
"pile_set_name": "Github"
} |
// Copyright 2013 Matt T. Proud
//
// 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
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// 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.
// Package pbutil provides record length-delimited Protocol Buffer streaming.
package pbutil
| {
"pile_set_name": "Github"
} |
# pyOCD debugger
# Copyright (c) 2017 NXP
# Copyright (c) 2018 Arm Limited
# SPDX-License-Identifier: Apache-2.0
#
# 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
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# 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.
from ...flash.flash import Flash
from ...coresight.coresight_target import CoreSightTarget
from ...core.memory_map import (FlashRegion, RomRegion, RamRegion, MemoryMap)
from ...debug.svd.loader import SVDFile
from ..family.target_imxrt import IMXRT
FLASH_ALGO_QUADSPI = {
'load_address' : 0x20200000,
# Flash algorithm as a hex string
'instructions': [
0xE00ABE00, 0x062D780D, 0x24084068, 0xD3000040, 0x1E644058, 0x1C49D1FA, 0x2A001E52, 0x4770D1F2,
0x4605b570, 0x4616460c, 0xcc0fe002, 0x3e10c50f, 0xd2fa2e10, 0xd3022e08, 0xc503cc03, 0x2e043e08,
0xcc01d307, 0x1f36c501, 0x7821e003, 0x1c647029, 0x1e761c6d, 0xbd70d2f9, 0x4770ba40, 0x4770ba40,
0x4770ba40, 0x4770ba40, 0x4770ba40, 0x4770ba40, 0x4770ba40, 0x4770bac0, 0x4770bac0, 0x4770bac0,
0x4770bac0, 0x4770bac0, 0x4770bac0, 0x4770bac0, 0x4874b510, 0x08408900, 0x49720040, 0x48728108,
0x08408900, 0x49700040, 0x486e8108, 0x21048800, 0x28004008, 0x486bd004, 0x43888800, 0x80084969,
0x88004869, 0x40082104, 0xd0042800, 0x88004866, 0x49654388, 0x48658008, 0x21806800, 0x28004008,
0x4863d00c, 0x60484961, 0x60884862, 0x68004608, 0x43882180, 0x43082120, 0x6008495c, 0x6900485e,
0x0fc007c0, 0xd0052800, 0x6900485b, 0x00400840, 0x61084959, 0x69404859, 0x04092101, 0x42884008,
0xbf00d14a, 0x4c552300, 0x60633480, 0xbf00bf00, 0xbf00bf00, 0x8f4ff3bf, 0xbf00bf00, 0x4b4fbf00,
0x4604695b, 0x4c4d43a3, 0xbf006163, 0xbf00bf00, 0x8f4ff3bf, 0xbf00bf00, 0x4b48bf00, 0x68183380,
0x40034b47, 0xbf000b59, 0x40034b46, 0xbf0008da, 0x4c45014b, 0x07944023, 0x07a40fa4, 0x4c434323,
0xbf006363, 0x4613bf00, 0x2b001e52, 0x460bd1f0, 0x2b001e49, 0xbf00d1e8, 0xbf00bf00, 0x8f4ff3bf,
0xbf00bf00, 0xbf00bf00, 0xbf00bf00, 0x8f6ff3bf, 0xbf00bf00, 0xbf00bf00, 0xb5febd10, 0x460e4605,
0xf7ff4617, 0x4832ff65, 0x466a9000, 0x44494931, 0xf0032000, 0x4604fa6c, 0xd0012c00, 0xbdfe2001,
0x4449492c, 0xf0002000, 0x2800ff93, 0x2001d001, 0x2000e7f5, 0x4601e7f3, 0x47702000, 0x4925b510,
0x20004449, 0xf962f001, 0xd0012800, 0xbd102001, 0xe7fc2000, 0x4604b510, 0x07402003, 0x23011a24,
0x4622031b, 0x4449491b, 0xf0032000, 0x2800faad, 0x2001d001, 0x2000bd10, 0xb570e7fc, 0x460e4604,
0x20034615, 0x1a240740, 0x4622462b, 0x44494911, 0xf0012000, 0x2800f8c9, 0x2001d001, 0x2000bd70,
0x0000e7fc, 0x400b8000, 0x400d0000, 0x400bc000, 0xd928c520, 0x0000ffff, 0xe000e000, 0xe000ed00,
0x0fffe000, 0x00001ff8, 0x00003fe0, 0xe000ef40, 0xc0000406, 0x00000004, 0x48cbb510, 0x444949cb,
0xbf006008, 0x6b0048ca, 0x03092101, 0x49c84388, 0xbf006308, 0x6b0048c6, 0x07c00fc0, 0xd0f92800,
0x680048c4, 0x400849c4, 0x49c43018, 0x49c14308, 0x20036008, 0x49be0300, 0xbf006108, 0x690048bc,
0x07c00fc0, 0xd0f92800, 0x690048b9, 0x04092101, 0x49b74388, 0x48b76108, 0x6b003840, 0x400849b6,
0x49b73023, 0x49b34308, 0x63083940, 0x49b648b5, 0x60084449, 0xe0002401, 0x46211c64, 0x444848b2,
0xf0046800, 0x49b1fd40, 0xd8f54288, 0x694048b0, 0x0209211f, 0x1e614388, 0x22030209, 0x40110212,
0x49ab4308, 0x46086148, 0x0a006a40, 0x1cc00200, 0x46086248, 0x02916980, 0x18404388, 0x618849a4,
0x69804608, 0x400849a3, 0x06892105, 0x49a04308, 0x46086188, 0x49a069c0, 0x05514008, 0x21071840,
0x430805c9, 0x499a1c40, 0x489161c8, 0x21016b00, 0x43880409, 0x6308498e, 0x69004608, 0x04092101,
0x498b4388, 0xbd106108, 0x31804991, 0x22036809, 0x43110292, 0x32804a8e, 0x47706011, 0x3180498c,
0x22036809, 0x43910292, 0x32804a89, 0x47706011, 0xb08cb5f7, 0x4615460c, 0x27002600, 0x900b2000,
0x2214900a, 0x44794985, 0xf7ffa805, 0x2214fe19, 0x44794982, 0x46683108, 0xfe12f7ff, 0x2d00bf00,
0x2d01d002, 0xe048d000, 0x38404872, 0x09866b00, 0x487701b6, 0x210769c0, 0x438805c9, 0x23004607,
0xd1012d00, 0xe000ab05, 0x2c01466b, 0x2c09db34, 0x2401dd00, 0x5c180060, 0x0060900b, 0x784018c0,
0x980b900a, 0x0e800680, 0x980a4306, 0x05c01e40, 0x05c92107, 0x43074008, 0x68004869, 0x43082102,
0x60084967, 0xf7ff980c, 0x485affa9, 0x6b003840, 0xd00242b0, 0x38404857, 0x485d6306, 0x42b869c0,
0x485bd001, 0x980c61c7, 0xff8ef7ff, 0x6800485c, 0x43882102, 0x6008495a, 0xbf00bf00, 0xbdf0b00f,
0xb085b5f0, 0x4616460d, 0x20002400, 0x484e9004, 0x68004448, 0x2d009002, 0x2d01d004, 0x2d02d006,
0xe010d12e, 0x44484848, 0xe02c6804, 0x69404848, 0x02092103, 0x0a004008, 0x46391c47, 0xf0049802,
0x4604fc62, 0x4842e01f, 0x483a69c0, 0x6b003840, 0x0e800680, 0x48439001, 0xf0049901, 0x2112fc54,
0x90004348, 0x69c0483a, 0x05c92107, 0x0dc04008, 0x90031c40, 0x98009903, 0xfc45f004, 0xe0024604,
0x90042004, 0xbf00bf00, 0x98046034, 0xbdf0b005, 0x4603b510, 0xbf002004, 0xd1012b00, 0xd1002900,
0x2a01e008, 0x4c30d102, 0xe001600c, 0x600c4c2e, 0xbf002000, 0xbd10bf00, 0x44484823, 0x47706800,
0x4823b510, 0x21036940, 0x40080209, 0x1c440a00, 0x481d4621, 0x68004448, 0xfc15f004, 0xb5f8bd10,
0x460d4604, 0xffe8f7ff, 0x49204606, 0xfc0bf004, 0xe00c4607, 0x46382103, 0xfc05f004, 0xe0009000,
0x9800bf00, 0x91001e41, 0xd1f92800, 0x4629bf00, 0x462a4620, 0x1e642300, 0x4615419a, 0x40594058,
0xd1e74308, 0x0000bdf8, 0x016e3600, 0x00000204, 0x400d8000, 0x400d8100, 0xc0c0c0c0, 0x18131800,
0x0f1a2300, 0x1f78a400, 0x0000020c, 0x08954400, 0x400fc000, 0xc3ffffcf, 0x9c7fff80, 0x00004c22,
0x400a0000, 0x1c9c3800, 0x09e4f580, 0x000f4240, 0x460cb5f8, 0x486526f1, 0x27f19000, 0x462025f1,
0xf991f003, 0xd0042800, 0x6ee06e26, 0x6e679000, 0x6d206ea5, 0xd1022800, 0x28006d60, 0x6d60d060,
0xd0052800, 0x485a2100, 0x48596701, 0x660630c0, 0x28006d20, 0x2100d005, 0x66c14855, 0x30c04854,
0x211065c6, 0x65c14852, 0x30c04851, 0x210064c7, 0x6601484f, 0x30c0484e, 0x484d6505, 0x484c6681,
0x658530c0, 0x6641484a, 0x30c04849, 0x48486545, 0x48476581, 0x648530c0, 0x5d002045, 0xd1142808,
0x67814843, 0x30c04842, 0x48416685, 0x67013010, 0x30c0483f, 0x483e6705, 0x483d67c1, 0x66c530c0,
0x6741483b, 0x30c0483a, 0x7b206645, 0xd0022803, 0x28017b20, 0x2110d109, 0x65414835, 0x31c04934,
0x64489800, 0x48332101, 0x46206241, 0xf935f003, 0xd0052800, 0x482e2100, 0x482e65c1, 0x64c738b0,
0x28006da0, 0x6de0d102, 0xd0262800, 0x28006da0, 0x2100d006, 0x30104826, 0x48266741, 0x674638b0,
0x48232110, 0x48236501, 0x640738b0, 0x48202100, 0x48206781, 0x668538b0, 0x3010481d, 0x481d6701,
0x670538b0, 0x67c1481a, 0x38b0481a, 0x481866c5, 0x48186741, 0x664538b0, 0xbdf8bf00, 0x20044601,
0x2900bf00, 0xe014d100, 0x2a037b0a, 0x2340d10f, 0x401a6c0a, 0xd0032a00, 0x2278230f, 0xe0065453,
0x5c522279, 0xda022a01, 0x2278231e, 0x20005453, 0xbf00bf00, 0x46014770, 0x62814807, 0x47702000,
0x48054601, 0x60086a80, 0x47702000, 0x000130f1, 0x401f8000, 0x401f8170, 0x400f8000, 0x4607b5bf,
0x463849f8, 0x01019102, 0x99020d0a, 0x68091851, 0x0edb06c3, 0x409a2201, 0x29004011, 0x2101d001,
0x2100e000, 0xd1022900, 0xb0042000, 0x48edbdb0, 0x90019702, 0x01389f02, 0x98010d01, 0x68001808,
0x03892103, 0x0b804008, 0xd1022800, 0xfc6bf000, 0x2000e000, 0x48e34604, 0x0d090139, 0x68091809,
0x04122201, 0x0c094011, 0xd0012900, 0xe7dc4620, 0x183848dd, 0xd0292800, 0x05492101, 0xd0071a40,
0x1a400049, 0x49d9d02d, 0x28001840, 0xe068d16b, 0x304048d4, 0x90026a00, 0x49d24620, 0x69093140,
0xfbaef004, 0x90009101, 0x9a022300, 0xf98ef004, 0x48cc4605, 0x07c06b00, 0x28000fc0, 0x2016d002,
0xe0014344, 0x43442014, 0xe04e1964, 0x690048c5, 0x40082102, 0xd0012800, 0xe0002016, 0x43442014,
0x48c0e043, 0x6b003040, 0x0e400640, 0x48bd9003, 0x69003080, 0x46209002, 0x318049ba, 0xf0046809,
0x9101fb7f, 0x23009000, 0xf0049a02, 0x4605f95f, 0x98034621, 0x194c4341, 0x304048b2, 0x21036b00,
0x400804c9, 0xd0042800, 0x04c92101, 0xd1041a40, 0x08a4e001, 0x0864e002, 0xbf00e000, 0x48acbf00,
0x49ac6b00, 0x21014008, 0x1a4003c9, 0x0209d004, 0xd1031a40, 0xe00208a4, 0xe0000864, 0xbf00bf00,
0x4ca5e003, 0x2400e001, 0xbf00bf00, 0xe75c4620, 0x4604b570, 0xf7ff48a1, 0x4605ff41, 0xd0062c00,
0xd00e2c01, 0xd0182c02, 0xd12e2c03, 0x4898e021, 0x68003840, 0x0e890681, 0xf0044628, 0x4605fa24,
0x4893e025, 0x68003840, 0x0212223f, 0x0a014010, 0xf0044628, 0x4605fa18, 0x488de019, 0x68003840,
0x0412223f, 0x0c014010, 0xf0044628, 0x4605fa0c, 0x4887e00d, 0x68003840, 0x0612223f, 0x0e014010,
0xf0044628, 0x4605fa00, 0x2500e001, 0xbf00bf00, 0x43452012, 0xbd704628, 0x4604b570, 0x4240487a,
0xfefcf7ff, 0x2c004605, 0x2c01d006, 0x2c02d00e, 0x2c03d018, 0xe021d12e, 0x38804875, 0x06816b00,
0x46280e89, 0xf9dff004, 0xe0254605, 0x38804870, 0x223f6b00, 0x40100212, 0x46280a01, 0xf9d3f004,
0xe0194605, 0x3880486a, 0x223f6b00, 0x40100412, 0x46280c01, 0xf9c7f004, 0xe00d4605, 0x38804864,
0x223f6b00, 0x40100612, 0x46280e01, 0xf9bbf004, 0xe0014605, 0xbf002500, 0x2012bf00, 0x46284345,
0xb510bd70, 0x6940485e, 0x06492101, 0x28004008, 0x485bd022, 0x21036980, 0x40080309, 0xd0082800,
0x03092101, 0xd00a1a40, 0xd00c1a40, 0xd10f1a40, 0x484de00f, 0xf7ff4240, 0x4604fea1, 0xf000e00b,
0x4604fb32, 0x484de007, 0xfe98f7ff, 0xe0024604, 0x2400bf00, 0xe023bf00, 0x69804849, 0x04892103,
0x28004008, 0x2101d008, 0x1a400489, 0x1a40d009, 0x1a40d00c, 0xe00ed111, 0xf7ff4840, 0x4604fe7f,
0x2003e00d, 0xff78f7ff, 0xe0084604, 0xf7ff2003, 0x4604ff2f, 0x4c38e003, 0x2400e001, 0xbf00bf00,
0xbd104620, 0x4604b510, 0xd1002c00, 0x2297e004, 0xa041a134, 0xf8ccf004, 0x07802001, 0x6188492c,
0x4841bf00, 0x21016b00, 0x40080409, 0xd0f82800, 0x49274608, 0xbf006148, 0x69004825, 0x03c92101,
0x28004008, 0x0048d0f8, 0x61884921, 0x2001bd10, 0x491f0780, 0x47706148, 0xd1032800, 0x4a322110,
0xe0026351, 0x4a302110, 0x47706391, 0x6b00482e, 0x43082101, 0x6308492c, 0x482b4770, 0x08406b00,
0x49290040, 0x47706308, 0xf7ffb510, 0x4604ff6a, 0x69404813, 0x02922207, 0x0a804010, 0x46201c41,
0xf911f004, 0xb510bd10, 0xffeef7ff, 0x480c4604, 0x22036940, 0x40100212, 0x1c410a00, 0xf0044620,
0xbd10f902, 0x400d8000, 0xffeffff3, 0xff8ffff7, 0x400d8140, 0x00808000, 0x1dcd6500, 0x0030000d,
0x400fc000, 0x2e5c2e2e, 0x2e2e5c2e, 0x5c2e2e5c, 0x69766564, 0x5c736563, 0x584d494d, 0x30315452,
0x645c3131, 0x65766972, 0x665c7372, 0x635f6c73, 0x6b636f6c, 0x0000632e, 0x70796221, 0x58737361,
0x4f6c6174, 0x00006373, 0x400d8240, 0x4605b570, 0xf004002b, 0x0a12f9ed, 0x17130f0b, 0x2a25201b,
0x3e39342f, 0x524d4843, 0xbf005c57, 0xff9cf7ff, 0xe04e4604, 0xffa7f7ff, 0xe04a4604, 0xf84cf000,
0xe0464604, 0xfa4ff000, 0xe0424604, 0x2401bf00, 0xbf0003e4, 0x48fee03d, 0xfdb0f7ff, 0xe0384604,
0xf7ff2000, 0x4604fea9, 0x2001e033, 0xfea4f7ff, 0xe02e4604, 0xf7ff2002, 0x4604fe9f, 0x2003e029,
0xfe9af7ff, 0xe0244604, 0xf7ff48f2, 0x4604fd97, 0x2000e01f, 0xfe4cf7ff, 0xe01a4604, 0xf7ff2001,
0x4604fe47, 0x2002e015, 0xfe42f7ff, 0xe0104604, 0xf7ff2003, 0x4604fe3d, 0x48e7e00b, 0xfd7ef7ff,
0xe0064604, 0xf7ff48e5, 0x4604fd79, 0x2400e001, 0xbf00bf00, 0xbd704620, 0x48e1b510, 0x214069c0,
0x28004008, 0xf000d003, 0x4604f9fe, 0x2002e003, 0xff8cf7ff, 0x48da4604, 0x068069c0, 0x1c410e80,
0xf0044620, 0x4604f850, 0xbd104620, 0x4602b508, 0x308048d3, 0x23036800, 0x4bd14318, 0x60183380,
0x680048d0, 0x43182302, 0x60184bce, 0x90002000, 0xbf00e003, 0x1c409800, 0x4bcb9000, 0x42989800,
0x48cad3f7, 0x231f6a00, 0x4398021b, 0x43184bc8, 0x62184bc6, 0xbd082001, 0x690949c6, 0x03922203,
0x22014391, 0x43110412, 0x03927842, 0x039b2303, 0x4311401a, 0x61114abf, 0x69094611, 0x43912202,
0x019222c1, 0x78024311, 0x23020052, 0x4311401a, 0x61114ab8, 0x49b7bf00, 0x0fc96909, 0x290007c9,
0x49b4d0f9, 0x22016909, 0x43910412, 0x61114ab1, 0xb5384770, 0x460d4604, 0x90002000, 0x690048ad,
0x03492101, 0x28004008, 0x48aad006, 0x21406900, 0x49a84308, 0xe0026108, 0xf7ff4668, 0x48a6ffbd,
0x00406b00, 0x49a40840, 0x46086308, 0x04896b00, 0x49a14388, 0x20006308, 0x46086008, 0x21636b00,
0x43080389, 0x6308499c, 0xbd382001, 0x69004899, 0x43882140, 0x61084997, 0x6b004897, 0x07892101,
0x49954308, 0x47706308, 0x6b094992, 0x03922203, 0x22014391, 0x43110412, 0x03927b02, 0x039b2303,
0x4311401a, 0x63114a8b, 0x6b094611, 0x40114a8b, 0x03522201, 0x78024311, 0x0fd207d2, 0x4a854311,
0x68416311, 0x08890089, 0x32404a82, 0x68816111, 0x08890089, 0x8a416211, 0x0c490449, 0x03d27c02,
0x03db2301, 0x4311401a, 0x041289c2, 0x04120c12, 0x4a784311, 0x60113240, 0x4976bf00, 0x0fc96b09,
0x290007c9, 0x4973d0f9, 0x22016b09, 0x43910412, 0x63114a70, 0x20014770, 0x496e0300, 0x47706308,
0x496c2000, 0x47706108, 0x4601b530, 0x4b692200, 0x6b1b3340, 0x03a42403, 0x240143a3, 0x43230424,
0x03a47b0c, 0x03ad2503, 0x4323402c, 0x34404c61, 0x684b6323, 0x089b009b, 0x3c804c5c, 0x688b6023,
0x089b009b, 0x4b5b6123, 0x6b1b3340, 0x3c7e4c5b, 0x24014023, 0x43230364, 0x0664780c, 0x43230e64,
0x784b4618, 0xd0122b02, 0xd00b2b04, 0xd0042b08, 0xd1102b10, 0x4a52bf00, 0x2301e011, 0x431804db,
0xe00c4a4f, 0x051b2301, 0x4a4d4318, 0x2301e007, 0x431804db, 0x2301e003, 0x4318051b, 0xbf00bf00,
0x33404b42, 0x4c466b1b, 0x402343e4, 0x4c3f4313, 0x63233440, 0x33404b3f, 0xbf006318, 0x33404b3d,
0x0fdb6b1b, 0x2b0007db, 0x4b3ad0f8, 0x6b1b3340, 0x04242401, 0x4c3743a3, 0x63233440, 0x2001bd30,
0x49340300, 0x63083140, 0xb5104770, 0x4a2f2100, 0x6a123a40, 0x039b2303, 0x2301439a, 0x431a041b,
0x039b7903, 0x03a42403, 0x431a4023, 0x3b404b27, 0x7842621a, 0xd0022a00, 0x05922201, 0x4a234311,
0x6a123a40, 0x031b2301, 0x430a439a, 0x3b404b1f, 0xbf00621a, 0x3a404a1d, 0x0fd26a12, 0x2a0007d2,
0x4a1ad0f8, 0x6a123a40, 0x041b2301, 0x4b17439a, 0x621a3b40, 0x2001bd10, 0x49140300, 0x62083940,
0xb5704770, 0x4601460a, 0x68244c10, 0x25bf00ce, 0x43ac40b5, 0x00cd4623, 0x40ac2480, 0x4d0b431c,
0x0694602c, 0x00cd0ea4, 0x431c40ac, 0xe0194d07, 0x0010000d, 0x0030000d, 0x00e00016, 0x0070000d,
0x400fc000, 0x400e4140, 0x00061a80, 0x400d8100, 0x00001701, 0x400d8000, 0x400d9000, 0xffffeffe,
0x00808000, 0xbd70602c, 0x6809491d, 0x228000c3, 0x4311409a, 0x60114a1a, 0xb5704770, 0x4601460a,
0x3c404c17, 0x00ce6b24, 0x40b525bf, 0x462343ac, 0x248000cd, 0x431c40ac, 0x3d404d11, 0x0694632c,
0x00cd0ea4, 0x431c40ac, 0x3d404d0d, 0xbd70632c, 0x3940490b, 0x00c36b09, 0x409a2280, 0x4a084311,
0x63113a40, 0x48074770, 0x21106b00, 0x28004008, 0x4805d001, 0x48054770, 0x68004448, 0x0000e7fa,
0x400d8100, 0x400d8240, 0x016e3600, 0x00000204, 0x4606b570, 0x2504460c, 0x4621bf00, 0xf0034630,
0x4605fa88, 0xd0002d00, 0x2301e00c, 0x32804622, 0x46302100, 0xffdcf002, 0x28017c60, 0x2000d101,
0xbf007420, 0x4628bf00, 0xb5f0bd70, 0x4607b089, 0x4615460c, 0x2100461e, 0x70014668, 0x9002200f,
0x90032001, 0x74054668, 0x98029601, 0x46210100, 0x18423180, 0x46382101, 0xf0029b03, 0x2001ffb9,
0x46699002, 0xf0024638, 0xb009fe7a, 0xb5ffbdf0, 0x4606b085, 0x2504460c, 0x2c00bf00, 0xe03dd100,
0x30ce20ff, 0x28005d00, 0x4621d009, 0x9b084630, 0xf7ff9a07, 0x4605ffca, 0xd0002d00, 0x20ffe02e,
0x5d0030cd, 0xd1132802, 0x30804620, 0x6b426b83, 0x6bc06b01, 0xc70eaf01, 0x46209004, 0x46013080,
0x6c4b6c8f, 0x6cc96c0a, 0x63436387, 0x63c16302, 0x46304621, 0x9a079b08, 0xffc1f002, 0x20ff4605,
0x5d0030cd, 0xd1052802, 0x30804620, 0xc98ea901, 0xc08e3030, 0xd0002d00, 0xbf00e000, 0x4628bf00,
0xbdf0b009, 0xb089b5ff, 0x4615460c, 0x2704461e, 0x4633bf00, 0x4621462a, 0xf7ff9809, 0x4607ffa8,
0xd0002f00, 0x2100e01b, 0x70014668, 0x9002200e, 0x90032001, 0x74054668, 0x98029601, 0x46210100,
0x18423180, 0x9b032101, 0xf0029809, 0x2001ff41, 0x46699002, 0xf0029809, 0x4607fe02, 0xbf00bf00,
0xb00d4638, 0xb5ffbdf0, 0x4606b085, 0x2504460c, 0x2c00bf00, 0xe023d100, 0x30cd20ff, 0x28025d00,
0x4620d113, 0x69833080, 0x69016942, 0xaf0169c0, 0x9004c70e, 0x30804620, 0x6a8f4601, 0x6a0a6a4b,
0x61876ac9, 0x61026143, 0x462161c1, 0x9b084630, 0xf0029a07, 0x4605ffbb, 0xd0002d00, 0xbf00e000,
0x2c00bf00, 0x20ffd00a, 0x5d0030cd, 0xd1052802, 0x30804620, 0xc98ea901, 0xc08e3010, 0xb0094628,
0xb5f7bdf0, 0x460cb084, 0xbf004615, 0xd0012c00, 0xd9002d01, 0x20ffe065, 0x5d0030c9, 0xdd012800,
0xe0002001, 0x90032000, 0x28009803, 0xe058d100, 0x6c202140, 0x09864008, 0xf0039804, 0x2d00fa42,
0x20ffd119, 0x5d0030c9, 0xd00a2800, 0x30c920ff, 0x46325d01, 0xf7ff9804, 0x4621f83b, 0xf0029804,
0x20fffb2d, 0x5d0030cf, 0xd01c2800, 0x98042101, 0xfa4bf003, 0x20ffe017, 0x5d0030c9, 0xd0092800,
0x5d012046, 0x98044632, 0xf822f7ff, 0x98044621, 0xfb14f002, 0x30cf20ff, 0x28005d00, 0x2100d003,
0xf0039804, 0xaa02fa32, 0x98042102, 0xf878f7ff, 0xd0022e00, 0x08409802, 0xaa019002, 0x98042100,
0xf86ef7ff, 0x98019902, 0xfcedf003, 0x210a1c40, 0x08874348, 0xbf00e000, 0x1e7f4638, 0xd1fa2800,
0xbf00bf00, 0xbdf0b007, 0xb08bb5ff, 0x4617460c, 0x46304626, 0xfa9df002, 0x22009001, 0x980b4621,
0xff7ff7ff, 0x463bbf00, 0x9a014621, 0xf7ff980b, 0x4605febe, 0xd0002d00, 0x2002e04c, 0x72084669,
0x90052001, 0x90042009, 0x5d802047, 0xd00c2800, 0x309120ff, 0x28005d80, 0x20ffd007, 0x5d803092,
0x20ff9004, 0x5d803091, 0x97039005, 0x98014669, 0x980e7608, 0x20ff9007, 0x590030c1, 0x98049008,
0x46210100, 0x18423180, 0x9b052101, 0xf002980b, 0x2001fe3f, 0xa9029004, 0xf002980b, 0x4605fd00,
0xd0002d00, 0x463be016, 0x9a014621, 0xf7ff980b, 0x4605fefa, 0xd0002d00, 0x20ffe00c, 0x5d0030d0,
0xd0062800, 0x4621463b, 0x980b9a01, 0xfebaf7ff, 0xbf004605, 0x980bbf00, 0xf997f003, 0x46212201,
0xf7ff980b, 0x4628ff1e, 0xbdf0b00f, 0xb08db5f3, 0x2700460e, 0x900c2000, 0x900a900b, 0x46352400,
0x46682100, 0x20017101, 0x200b9004, 0x46689003, 0x20477501, 0x28005d40, 0x20ffd00c, 0x5d403095,
0xd0072800, 0x309620ff, 0x90035d40, 0x309520ff, 0x90045d40, 0x46312200, 0xf7ff980d, 0x2000fef2,
0x462f900b, 0x900a3750, 0xcf01e02b, 0x980c900c, 0xd01f2800, 0x46312200, 0x980d9b0b, 0xfe27f7ff,
0x2c004604, 0xe01fd000, 0x9002980b, 0x01009803, 0x31804631, 0x21011842, 0x980d9b04, 0xfdc8f002,
0x90032001, 0x980da901, 0xfc89f002, 0x2c004604, 0xe009d000, 0x980b990c, 0x900b1840, 0x1c40980a,
0x980a900a, 0xd3d02804, 0x2c00bf00, 0x2000d12e, 0x462f900b, 0x900a3750, 0xcf01e024, 0x980c900c,
0xd0182800, 0x46312200, 0x980d9b0b, 0xfe6bf7ff, 0x2c004604, 0xe018d000, 0x30d020ff, 0x28005d80,
0x2200d009, 0x9b0b4631, 0xf7ff980d, 0x4604fe2b, 0xd0002c00, 0x990ce009, 0x1840980b, 0x980a900b,
0x900a1c40, 0x2804980a, 0xbf00d3d7, 0xf003980d, 0x2201f8fc, 0x980d4631, 0xfe83f7ff, 0xb00f4620,
0xb5f7bdf0, 0x460eb08a, 0x46354617, 0xf0024628, 0x9000f990, 0x46312200, 0xf7ff980a, 0xbf00fe72,
0x4631463b, 0x980a9a00, 0xfdb1f7ff, 0x2c004604, 0xe048d000, 0x20009702, 0x71084669, 0x90042001,
0x90032005, 0x75089800, 0x5d402047, 0xd00c2800, 0x308d20ff, 0x28005d40, 0x20ffd007, 0x5d40308e,
0x20ff9003, 0x5d40308d, 0x98039004, 0x46310100, 0x18423180, 0x9b042101, 0xf002980a, 0x2001fd39,
0xa9019003, 0xf002980a, 0x4604fbfa, 0xd0002c00, 0x463be019, 0x9a004631, 0xf7ff980a, 0x4604fdf4,
0xd0002c00, 0x20ffe00f, 0x5d8030d0, 0xd0092800, 0x4631463b, 0x980a9a00, 0xfdb4f7ff, 0x2c004604,
0xe000d000, 0xbf00bf00, 0xf003980a, 0x2201f88e, 0x980a4631, 0xfe15f7ff, 0xb00d4620, 0xb5f7bdf0,
0x460eb08a, 0x46354617, 0xf0024628, 0x9000f922, 0x46312200, 0xf7ff980a, 0xbf00fe04, 0x4631463b,
0x980a9a00, 0xfd43f7ff, 0x2c004604, 0xe048d000, 0x20009702, 0x71084669, 0x90042001, 0x90032008,
0x75089800, 0x5d402047, 0xd00c2800, 0x309d20ff, 0x28005d40, 0x20ffd007, 0x5d40309e, 0x20ff9003,
0x5d40309d, 0x98039004, 0x46310100, 0x18423180, 0x9b042101, 0xf002980a, 0x2001fccb, 0xa9019003,
0xf002980a, 0x4604fb8c, 0xd0002c00, 0x463be019, 0x9a004631, 0xf7ff980a, 0x4604fd86, 0xd0002c00,
0x20ffe00f, 0x5d8030d0, 0xd0092800, 0x4631463b, 0x980a9a00, 0xfd46f7ff, 0x2c004604, 0xe000d000,
0xbf00bf00, 0xf003980a, 0x2201f820, 0x980a4631, 0xfda7f7ff, 0xb00d4620, 0xb5f0bdf0, 0x4607b08b,
0x4614460d, 0x2004461e, 0xbf009001, 0xd1002c00, 0x2124e012, 0xf003a802, 0x2003fae4, 0x72084669,
0x90042001, 0x94099005, 0x9503960a, 0x4638a902, 0xfb45f002, 0xbf009001, 0x9801bf00, 0xbdf0b00b,
0xb08fb5ff, 0x4616460c, 0x2004461d, 0xbf00900e, 0x20002700, 0x900b900a, 0x900d900c, 0x28056830,
0x6870d202, 0xd31b2840, 0x74202001, 0x02406c30, 0x00030f40, 0xfbdcf003, 0x0b050f07, 0x0907060d,
0xbf00000f, 0x2702bf00, 0x2704e009, 0x2701e007, 0x2703e005, 0x2700e003, 0x74202000, 0xe002bf00,
0x05008828, 0x2f000f07, 0x2000d070, 0x90029000, 0x46682100, 0x21037501, 0x90087101, 0x90092001,
0x90049003, 0xd00a2f01, 0xd0042f02, 0xd00a2f03, 0xd10c2f04, 0xbf00e000, 0x900a48fd, 0x48fce008,
0x900a3830, 0x48fae004, 0x900a300a, 0xbf00e000, 0x2301bf00, 0x4619aa0a, 0xf002980f, 0xa901fc19,
0xf002980f, 0x900efadc, 0x2800980e, 0xe071d000, 0x01006828, 0x28000f00, 0x88a8d008, 0x0e000400,
0xd0032800, 0x040088a8, 0x90000e00, 0x74202000, 0xd0062f01, 0xd0172f02, 0xd0382f03, 0xd1462f04,
0x2140e025, 0x40089800, 0xd10c2800, 0x20c049e1, 0x21c35101, 0x40089800, 0x21409000, 0x43089800,
0x20019000, 0xe0357420, 0x98002102, 0x28004008, 0x49d9d10b, 0x510120c0, 0x98002102, 0x90004308,
0x02009800, 0x20019000, 0xe0237420, 0x2102e02f, 0x40089800, 0xd1092800, 0x313049ce, 0x510120c0,
0x98002102, 0x90004308, 0x74202001, 0x2180e012, 0x40089800, 0xd1092800, 0x313d49c7, 0x510120c0,
0x98002180, 0x90004308, 0x74202001, 0x2000e002, 0xbf007420, 0x7c20bf00, 0xd0072800, 0x75202001,
0x75612104, 0x61a09800, 0x74602001, 0x2000bf00, 0xbf00900e, 0x980ebf00, 0xbdf0b013, 0xb08fb5f0,
0x460c4606, 0x25044617, 0x2000bf00, 0x900b9001, 0x900d900c, 0x9003900e, 0x46682100, 0x21037601,
0xa8017201, 0x20019009, 0x9004900a, 0x48a89005, 0x900b3050, 0xaa0b2301, 0x46304619, 0xfb78f002,
0x4630a902, 0xfa3bf002, 0x2d004605, 0xe01fd000, 0x980121f7, 0x90014008, 0x74202001, 0x04009801,
0x040921ff, 0x499d4008, 0x06894308, 0x20ff1841, 0x51013061, 0x75202001, 0x7561210e, 0x61a09801,
0x74602004, 0x20ff2101, 0x550130d0, 0xbf002500, 0x4628bf00, 0xbdf0b00f, 0xb098b5f7, 0x2504460c,
0x01e82700, 0x20009010, 0x7308a910, 0x20019011, 0xbf009012, 0xd1002c00, 0x4889e0ec, 0x46014478,
0x68c0c90e, 0xc60eae07, 0x2003900a, 0x7708a908, 0x9016a803, 0x90172010, 0x01009811, 0x31804621,
0x21011842, 0x98189b12, 0xfb22f002, 0x90112001, 0x9818a90f, 0xf9e3f002, 0x2d004605, 0xe0c9d000,
0x90022001, 0x1c409803, 0xd10b2800, 0x1c409804, 0xd1072800, 0x1c409805, 0xd1032800, 0x1c409806,
0xd00a2800, 0xa9032210, 0xf003a807, 0x2800f90f, 0x4d6cd001, 0x2000e0ae, 0x98029002, 0xd04a2800,
0x461a2300, 0x98184621, 0xfb41f7ff, 0x2d004605, 0xe09fd000, 0x90112009, 0xa9082002, 0xa8077708,
0x20109014, 0x98119015, 0x46210100, 0x18423180, 0x9b122101, 0xf0029818, 0x2001fadb, 0xa90f9011,
0xf0029818, 0x4605f99c, 0xd0002d00, 0x2300e082, 0x4621461a, 0xf0029818, 0x4605fb79, 0xd0002d00,
0x2000e078, 0x20039011, 0x7708a908, 0x9016a803, 0x90172010, 0x9818a90f, 0xf981f002, 0x2d004605,
0xe067d000, 0xa9032210, 0xf003a807, 0x2800f8bf, 0x4d44d001, 0x2032e05e, 0x20009001, 0x26029000,
0x6c202140, 0x64204308, 0x5d012046, 0x98182201, 0xfc0ef7fe, 0x2000e03f, 0x900c900b, 0x900e900d,
0x06092101, 0x42886d20, 0x4837d902, 0xe001900b, 0x900b4836, 0x30ffb2f0, 0x300230ff, 0x0309210b,
0x21011840, 0x18400489, 0x184001c9, 0x06892129, 0x900c4308, 0xaa0b2301, 0x98182100, 0xfa78f002,
0x90112000, 0xa9082003, 0xa8037708, 0x20109016, 0xa90f9017, 0xf0029818, 0x4605f932, 0xd0002d00,
0x2210e011, 0xa807a903, 0xf870f003, 0xd1012800, 0xe0082701, 0x2f001c76, 0x9800d105, 0x90001c40,
0x42889901, 0xbf00d3b7, 0xd0022f00, 0x6006981a, 0xbf00e000, 0x2f00bf00, 0x4d12d100, 0xb01b4628,
0xb5ffbdf0, 0x4604b088, 0x4629460d, 0x46283108, 0x9007305c, 0x900568e8, 0x0fc09805, 0x280007c0,
0x9805d016, 0x20011ec3, 0x90064098, 0x0000e014, 0x24010435, 0x20010401, 0x20020401, 0x00000481,
0x000035b4, 0x00004e2a, 0x8a2004ee, 0x8a1804ed, 0x1c409805, 0x900608c0, 0x65209806, 0x28406868,
0x23ffd205, 0x20ff3301, 0x510330c1, 0x8d08e010, 0x0f030600, 0x40982001, 0x23019004, 0x980403db,
0xd1014298, 0xe00011c3, 0x20ff9b04, 0x510330c1, 0x900348fc, 0x90022000, 0xe01cbf00, 0x460b0046,
0x5d9b331c, 0xd0152b00, 0x460f0046, 0x5dbf371c, 0x40be2601, 0x9e034633, 0xd20142b3, 0x90009303,
0x42b39e02, 0x2601d905, 0x42b30536, 0x9302d201, 0xbf009001, 0x28041c40, 0x23ffd3e0, 0x980333c5,
0x23ff5118, 0x980233d1, 0x9b025118, 0x42989803, 0x2301d104, 0x30ca20ff, 0xe0035503, 0x20ff2300,
0x550330ca, 0x061b2301, 0x42986d20, 0x2058d935, 0x28005d40, 0x9807d00b, 0x9b001d00, 0x60105cc0,
0x1d009807, 0x5cc39b01, 0x6003980b, 0x9800e034, 0x46080043, 0x1818301c, 0x28207840, 0x28d8d002,
0xe002d106, 0x60102021, 0x20dce002, 0xbf006010, 0x9801bf00, 0x46080043, 0x1818301c, 0x28207840,
0x28d8d002, 0xe003d108, 0x980b2321, 0xe0036003, 0x980b23dc, 0xbf006003, 0x9800e00e, 0x46080043,
0x1818301c, 0x60107840, 0x00439801, 0x301c4608, 0x78431818, 0x6003980b, 0xb00c2000, 0xb5ffbdf0,
0x460cb08d, 0x2004461f, 0xbf00900c, 0x4605980f, 0x980f3508, 0x900b305c, 0x900a2000, 0x02006838,
0x28010f00, 0x6828d107, 0x0fc00300, 0x980a900a, 0xd1002800, 0x2000e288, 0x78387320, 0x0f090701,
0x55012046, 0x90092000, 0x20189008, 0x20009005, 0xab069004, 0x4620aa07, 0xf7ff990f, 0x2101ff02,
0x6d200609, 0xd9014288, 0x90052020, 0x04008838, 0x90030f00, 0x28009803, 0x463bd165, 0x9a0f4621,
0xf7ff980d, 0x900cfcbd, 0x2800980c, 0xe25bd000, 0x02806828, 0x28000fc0, 0x2002d00a, 0x7a289004,
0x0f400600, 0x7a289008, 0x0ec006c0, 0xe00c9009, 0x02406828, 0x28000fc0, 0x68a8d007, 0x0f400200,
0x68a89008, 0x0ec002c0, 0x98059009, 0xd1322820, 0x3040980f, 0x28007e00, 0x980bd024, 0x05c08800,
0x28000fc0, 0x4980d007, 0x301120ff, 0x497f5101, 0x51011d00, 0x980be028, 0x06007800, 0x28000fc0,
0x497bd007, 0x301120ff, 0x49785101, 0x51011d00, 0x4977e01a, 0x20ff3922, 0x51013011, 0x1d004975,
0xe0115101, 0x39224972, 0x301120ff, 0x49715101, 0x51011d00, 0x4970e008, 0x301120ff, 0x496d5101,
0x51011d00, 0xe1ffe000, 0x73202001, 0x20b0496b, 0x496b5101, 0x51012090, 0xb2c09807, 0x02892101,
0x99051840, 0x22ff0409, 0x40110412, 0x21014308, 0x184106c9, 0x510120d0, 0xb2c09806, 0x02892101,
0x99051840, 0x40110409, 0x21014308, 0x184106c9, 0x300120ff, 0x21235101, 0x20ff0149, 0x51013031,
0x01006838, 0x28000f00, 0x7938d00d, 0xd00a2800, 0x90082000, 0x90097938, 0x2800980a, 0x9809d02a,
0x90090040, 0x980ae026, 0xd0232800, 0x01006838, 0x28010f00, 0x9805da1e, 0xd1062820, 0x39214944,
0x51012080, 0x20844947, 0x46215101, 0xf7ff980d, 0x900cf88f, 0x2800980c, 0xe1a5d000, 0x4621aa09,
0xf7ff980d, 0x900cfd29, 0x2800980c, 0xe19bd000, 0x90082000, 0x28189805, 0x980ad11a, 0xd0012800,
0xe04526ed, 0x02806828, 0x28000fc0, 0x8928d003, 0x0e060400, 0x6828e03c, 0x0fc00240, 0xd0022800,
0x0e0668a8, 0x2603e034, 0x90092000, 0xe02f9008, 0x90042002, 0x2800980a, 0x26eed001, 0x980fe028,
0x7e003040, 0xd0112800, 0x7800980b, 0x0fc00680, 0xd0012800, 0xe01b26ec, 0x7800980b, 0x0fc006c0,
0xd0152800, 0x2000266c, 0xe0119004, 0x02806828, 0x28000fc0, 0x26ecd001, 0x6828e00a, 0x0fc00240,
0xd0012800, 0xe003266c, 0x20002613, 0x90089009, 0x2800980a, 0x2140d028, 0x43086c20, 0xb2f06420,
0x18400109, 0x04099905, 0x041222ff, 0x43084011, 0x06492101, 0x21111840, 0x184106c9, 0x51012080,
0x0000e027, 0x00ffffff, 0x0a20043e, 0x00002204, 0x08200434, 0x00002004, 0x08180402, 0x00000406,
0x24040405, 0x00012404, 0x2101b2f0, 0x18400289, 0x04099905, 0x041222ff, 0x43084011, 0x06099904,
0x06122203, 0x43084011, 0x06c92101, 0x20801841, 0x20005101, 0x78389002, 0x0f000600, 0xd1062800,
0x98089909, 0x90091808, 0x90082000, 0x7838e06e, 0x0f000600, 0xd1682801, 0x6840980f, 0xd3042840,
0x05808f28, 0x28000fc0, 0x9909d106, 0x18089808, 0x20009009, 0xe0599008, 0x03006ba8, 0x90010f00,
0x07c09801, 0x28000fc0, 0x2104d104, 0x40089801, 0xd0022800, 0x900220a5, 0x2102e011, 0x40089801,
0xd00c2800, 0x4621463b, 0x980d9a0f, 0xfc06f7ff, 0x980c900c, 0xd0002800, 0x2001e0c6, 0x8f289002,
0x0e800400, 0x21029000, 0x40089800, 0xd1042800, 0x98002108, 0x28004008, 0x49f7d00d, 0x307120ff,
0x1d005101, 0x98055101, 0xd1192820, 0x20ff1409, 0x51013079, 0x9800e014, 0x0fc007c0, 0xd1042800,
0x98002110, 0x28004008, 0x49ecd009, 0x307120ff, 0x1d005101, 0x49ea5101, 0x51011d00, 0xe093e000,
0x20ff2101, 0x550130ce, 0xe08de000, 0x28009808, 0x9809d12f, 0xd0282800, 0x2800980a, 0x9809d012,
0x30ffb2c0, 0x300230ff, 0x0309210b, 0x21011840, 0x18400489, 0x184001c9, 0x06892129, 0x21844308,
0xe0635108, 0xb2c09809, 0x30ff30ff, 0x21033002, 0x18400309, 0x04892101, 0x01c91840, 0x21091840,
0x43080689, 0x51082184, 0x49cee050, 0x51012084, 0x990ae04c, 0xd0242900, 0x29019908, 0x2026d104,
0x09099902, 0xe0009102, 0x99022027, 0x31ffb2c9, 0x310231ff, 0x233f0282, 0x401a029b, 0x9a094311,
0x23ff0412, 0x401a041b, 0x22014311, 0x18890652, 0x0712220b, 0x2184188a, 0x4abb510a, 0x510a2188,
0x9908e023, 0xd1042901, 0x99022006, 0x91020909, 0x2007e000, 0xb2c99902, 0x31ff31ff, 0x02823102,
0x029b233f, 0x4311401a, 0x04129a09, 0x041b23ff, 0x4311401a, 0x06522201, 0x22031889, 0x188a0712,
0x510a2184, 0x21884aa9, 0xbf00510a, 0x2800980a, 0x2101d007, 0x30cf20ff, 0x21405501, 0x43086c20,
0x20006420, 0xbf00900c, 0x980cbf00, 0xbdf0b011, 0xb09ab5f7, 0x4f9e460c, 0x2c00bf00, 0x2704d101,
0x2308e08e, 0x2100aa18, 0xf7ff981a, 0x4607fa26, 0xd0002f00, 0x4997e084, 0x42889818, 0x4f94d001,
0xa818e07e, 0x60207900, 0x7980a818, 0x90171c40, 0x280a9817, 0x200ad901, 0x9817e000, 0x25089002,
0x2800981c, 0x022dd000, 0x00c39802, 0x4629aa03, 0xf7ff981a, 0x4607fa02, 0xd0002f00, 0x2164e060,
0xf0024620, 0x2600fcee, 0x00f0e055, 0x5c08a903, 0xaa0300f1, 0x79c91889, 0x18400209, 0x21ff9001,
0x98010209, 0xd0034288, 0x9801497b, 0xd1414288, 0x20022500, 0x022de007, 0xaa0300f1, 0x1d091889,
0x430d5c09, 0x28001e40, 0x00f1daf5, 0x1808a803, 0x008078c0, 0x981c9000, 0xd0002800, 0x21ff022d,
0x98010209, 0xd1124288, 0x28509800, 0x2050d901, 0x46229000, 0x46293208, 0x981a9b00, 0xf9bdf7ff,
0x2f004607, 0xe019d000, 0x60609800, 0x4962e011, 0x42889801, 0x4622d10d, 0x4629325c, 0x981a9b00,
0xf9abf7ff, 0x2f004607, 0xe007d000, 0x20582101, 0xbf005501, 0x98021c76, 0xd3a64286, 0xbf00bf00,
0x4638bf00, 0xbdf0b01d, 0xb0a9b5f0, 0x460c4607, 0x26044615, 0x90252000, 0x90279026, 0x22309028,
0x4479494e, 0xf7fda819, 0xbf00fdbb, 0x03006828, 0x28000f00, 0xe044d000, 0x20452104, 0x49485501,
0x51012080, 0x20844947, 0x46215101, 0xf7fe4638, 0x4606fe1f, 0xd0002e00, 0x7828e033, 0x0f000600,
0xd1122801, 0x20ff4934, 0x51013071, 0x51011d00, 0x1d001409, 0x23005101, 0x4621461a, 0xf7fe4638,
0x4606fe24, 0xd0002e00, 0x6828e01b, 0x0f000300, 0xa9190100, 0x23011842, 0x46384619, 0xfde8f001,
0x46692200, 0xf7ff4638, 0x4606ff13, 0xd0002e00, 0x462be007, 0x4621466a, 0xf7ff4638, 0x4606fc60,
0xbf00bf00, 0xb0294630, 0xb5f0bdf0, 0x4607b08b, 0x4615460c, 0x2103461e, 0x72014668, 0x90042000,
0x90052001, 0x90030060, 0x46682100, 0x95097601, 0xa902960a, 0xf0014638, 0x9001fc82, 0xb00b9801,
0xb5f0bdf0, 0x4607b08b, 0x4615460c, 0x2102461e, 0x72014668, 0x90042001, 0x00609005, 0x21009003,
0x76014668, 0x96089507, 0x4638a902, 0xfc67f001, 0x98019001, 0xbdf0b00b, 0x06ff06ff, 0x06000600,
0x32101e00, 0x00002404, 0x7c01a604, 0x7c012604, 0x00004e27, 0x50444653, 0x0000ff84, 0x00002b9e,
0x08180403, 0x00012404, 0xb087b5f0, 0x460c4607, 0x4dfe4616, 0x2003bf00, 0x210873e0, 0x55012045,
0x64202058, 0x73202003, 0xd0032e00, 0x6c202101, 0x64204308, 0x20472101, 0x210f5501, 0x5301207c,
0x207e2101, 0x02495301, 0x30c120ff, 0x02495101, 0x51011d00, 0x20ff5901, 0x510130d1, 0x1fc02101,
0x46215501, 0xf7fe4638, 0x4605fd63, 0xd0002d00, 0x2000e13e, 0x90049003, 0x90069005, 0x900348e4,
0x900448e4, 0xaa032301, 0x46384619, 0xfd40f001, 0x90032000, 0x90059004, 0x48dd9006, 0x90033080,
0x900448dd, 0xaa032301, 0x46382100, 0xfd30f001, 0x02c02013, 0x23029002, 0x49d8aa02, 0xf7ff4638,
0x4605ff70, 0xd0002d00, 0x2308e112, 0x2110466a, 0xf7ff4638, 0x4605ff4a, 0xd0002d00, 0x9801e108,
0x9001b280, 0x980049ce, 0xd1044288, 0x02092159, 0x42889801, 0x4dc5d001, 0x2308e0fa, 0x2127466a,
0xf7ff4638, 0x4605ff32, 0xd0002d00, 0x9800e0f0, 0x9000b280, 0x0a009800, 0x98009000, 0xd3072817,
0x28209800, 0x2001d804, 0x40889900, 0xe0016520, 0xe0dd4db6, 0x0300200f, 0x23029002, 0x2100aa02,
0xf7ff4638, 0x4605ff2e, 0xd0002d00, 0x49b0e0d0, 0x20803180, 0x49b35101, 0x51012084, 0x208849b2,
0x49b25101, 0x51012090, 0x209449b1, 0x49b15101, 0x51012098, 0x209c49b0, 0x49a55101, 0x20a03180,
0x49ae5101, 0x510120a4, 0x20a849a7, 0x49a75101, 0x510120b0, 0x20b449a6, 0x49a65101, 0x510120b8,
0x20bc49a3, 0x49a15101, 0x510120c0, 0x20c449a4, 0x49a45101, 0x510120c8, 0x20cc49a1, 0x499b5101,
0x301120ff, 0x499a5101, 0x51011d00, 0x1d004999, 0x499d5101, 0x51011d00, 0x3920498d, 0x51011d00,
0x1d00499a, 0x49915101, 0x510120d0, 0x20d44990, 0x49905101, 0x510120d8, 0x20dc4995, 0x498b5101,
0x510120e0, 0x20e4498a, 0x498a5101, 0x510120e8, 0x20ec4987, 0x49855101, 0x510120f0, 0x20f44988,
0x49885101, 0x510120f8, 0x20fc4985, 0x49785101, 0x1d003920, 0x49875101, 0x51011d00, 0x1d004986,
0x497a5101, 0x303120ff, 0x49795101, 0x51011d00, 0x1d004978, 0x497e5101, 0x51011d00, 0x1d004973,
0x49735101, 0x51011d00, 0x1d004972, 0x49705101, 0x51011d00, 0x1d00496d, 0x49715101, 0x51011d00,
0x1d004970, 0x496e5101, 0x51011d00, 0x1d004967, 0x49675101, 0x51011d00, 0x1d004966, 0x496f5101,
0x51011d00, 0x20ff2102, 0x55013089, 0x1c402103, 0x21025501, 0x55011f40, 0x1c402101, 0x21025501,
0x309120ff, 0x21095501, 0x55011c40, 0x1f402104, 0x21055501, 0x55011c40, 0x1dc02104, 0x210b5501,
0x55011c40, 0x20ff2101, 0x550130cd, 0xbf002500, 0x4628bf00, 0xbdf0b007, 0xb094b5f7, 0x4615460c,
0x90132004, 0x2d00bf00, 0xe0fbd100, 0x78297868, 0xd1024288, 0x90132000, 0x2603e0f4, 0x21082701,
0x55012045, 0x28427868, 0x7868d002, 0xd1032841, 0x21042602, 0x55012045, 0x28827868, 0x7868d002,
0xd1002842, 0x20002721, 0x2100900b, 0x7601a808, 0x20017201, 0x2120900c, 0xf002a802, 0x78e8fa32,
0xd01a2806, 0xd02f2807, 0xd1792808, 0x21030230, 0x40080209, 0x43082106, 0x02892101, 0x90021840,
0x21030230, 0x40080209, 0x430821ff, 0x02892101, 0x90061840, 0x900d2002, 0x0230e07d, 0x02092103,
0x21664008, 0x21014308, 0x18400289, 0x02309002, 0x02092103, 0x21994008, 0x21014308, 0x18400289,
0x20029006, 0xe066900d, 0x21030230, 0x40080209, 0x43082166, 0x223f02b9, 0x40110292, 0x21994308,
0x18400409, 0x22030631, 0x40110612, 0x06b94308, 0x06890e89, 0x90024308, 0x14110230, 0x21994008,
0x02b94308, 0x0292223f, 0xe02a4011, 0x00004e29, 0x8b188720, 0xa3028f10, 0xa7048f10, 0x00000555,
0x52005100, 0xb3068f10, 0x0000a704, 0x87008700, 0x87aa8700, 0x87058700, 0x87708700, 0xb70b8f10,
0x87558700, 0x87028700, 0x87a08700, 0xa3808f10, 0x87808700, 0x87008f10, 0x00008730, 0x87108700,
0x4308e016, 0x04492133, 0x06311840, 0x06122203, 0x43084011, 0x0e8906b9, 0x43080689, 0x2f219006,
0x2140d103, 0x43086c20, 0x20026420, 0xe002900d, 0x900d2001, 0xbf00bf00, 0x20462101, 0x06085501,
0x48fe6520, 0x48fe6020, 0x20036060, 0x73a07360, 0x30c920ff, 0x200a5501, 0x46216760, 0xf7fe9814,
0x9013fb37, 0x28009813, 0xe01bd000, 0x2101aa02, 0x98149b0d, 0xfb1cf001, 0x9814a90a, 0xf9dff001,
0x217d9013, 0x48ef00c9, 0x68004448, 0xf96bf002, 0xe0039001, 0x9801bf00, 0x90011e40, 0x28009801,
0xbf00d1f8, 0x9813bf00, 0xbdf0b017, 0xb09eb5f7, 0x48e5460c, 0x9820901d, 0x02006800, 0x28050f00,
0x2001d101, 0x2000e000, 0x22309011, 0x447949df, 0xf7fda805, 0xbf00fa85, 0x88009820, 0x0f070400,
0x68009820, 0x0f050300, 0xd0042f00, 0xd0022f03, 0x901d2004, 0x2d00e267, 0x2d03d004, 0x2004d002,
0xe260901d, 0xd1042d03, 0xd1022f00, 0x901d2004, 0x2d00e259, 0xa802d11a, 0xfe22f7fd, 0x2000901d,
0xfe19f7fd, 0x2800981d, 0xaa02d109, 0x981e4621, 0xfeb2f7ff, 0x981d901d, 0xd0002800, 0x2000e243,
0x20107320, 0x20036420, 0xe011901c, 0xd10f2d03, 0x73202003, 0x64202010, 0x68009820, 0x0f000200,
0xd1032804, 0x6c202140, 0x64204308, 0x901c2006, 0xd1032f00, 0xd1012d00, 0x90112001, 0xd1032f03,
0x20452108, 0xe0025501, 0x20452101, 0x46215501, 0xf7fe981e, 0x901dfa9d, 0x2800981d, 0xe212d000,
0x90042000, 0xd1012d00, 0xe0079004, 0x28009811, 0x2001d002, 0xe0019004, 0x90042002, 0x01009804,
0x1842a905, 0x46192301, 0xf001981e, 0x2000fa71, 0x21009015, 0x7001a818, 0xa8102103, 0x20017401,
0x90179016, 0x901ba812, 0x981ea914, 0xf927f001, 0x981d901d, 0xd0002800, 0xa812e1e5, 0x98039003,
0x28c27800, 0xe1ded000, 0xd1072d00, 0x78819803, 0x20013930, 0x40880400, 0xe0066520, 0x79409803,
0x21013830, 0x40810409, 0x21016521, 0x20ff0309, 0x510130c5, 0x1f001109, 0x02095101, 0x30d120ff,
0x20035101, 0x20107320, 0x21016420, 0x40489811, 0x2d004606, 0x2f03d156, 0x2001d154, 0x20027420,
0x20017460, 0x21068260, 0x75207561, 0x46682100, 0x21077201, 0x2e0072c1, 0x2082d01e, 0x72484669,
0x61a02002, 0x20e04972, 0x49715101, 0x20e43972, 0x49705101, 0x510120e8, 0x78009820, 0x0f000600,
0xd1042803, 0x20ff2101, 0x550130cb, 0x2100e026, 0x30cb20ff, 0xe0215501, 0x46692081, 0x20027248,
0x496361a0, 0x510120e0, 0x20e44963, 0x49615101, 0x510120e8, 0x77202001, 0x20212107, 0x21015501,
0x55012020, 0x63202001, 0x20f04959, 0x49585101, 0x20f43972, 0x49575101, 0x510120f8, 0xf7fd9802,
0xbf00fd2a, 0x20b04955, 0x49555101, 0x51012090, 0xd11e2f00, 0x73202001, 0x20804952, 0x49525101,
0x51012084, 0x1d89494f, 0x301120ff, 0x494f5101, 0x51011d00, 0x3115494b, 0x510120d0, 0x31d04949,
0x300120ff, 0x21235101, 0x20ff0149, 0x51013031, 0x2e00e138, 0x2221d001, 0x2201e000, 0x2e004610,
0x2222d001, 0x2202e000, 0x2e004611, 0x222cd001, 0x220ce000, 0x2e009202, 0x2229d001, 0x2209e000,
0x2e009201, 0x2228d001, 0x2208e000, 0x02829200, 0x029b233f, 0x4b31401a, 0x431a3b18, 0x041b2311,
0x230318d2, 0x18d2061b, 0x0e9b0683, 0x431a069b, 0x511a2380, 0x233f028a, 0x401a029b, 0x015b2319,
0x2303431a, 0x18d2045b, 0x18d201db, 0x069b9b02, 0x069b0e9b, 0x2384431a, 0x9a01511a, 0x233f0292,
0x401a029b, 0x009b23c1, 0x2388431a, 0x0282511a, 0x029b233f, 0x4b1e401a, 0x23f9431a, 0x18d2041b,
0x061b2303, 0x0683431a, 0x069b0e9b, 0x23c0431a, 0x0282511a, 0x029b233f, 0x4b15401a, 0x431a1e5b,
0x045b237d, 0x230318d2, 0x431a061b, 0x0e9b0683, 0x431a069b, 0x511a23a0, 0xe01b0282, 0x42464346,
0x56010400, 0x0000020c, 0x00004e29, 0x00002562, 0x04000472, 0x20010400, 0x04020400, 0x00000406,
0x24040405, 0x0820040c, 0x24043308, 0x00002004, 0x00000306, 0x029b233f, 0x2303401a, 0x431a021b,
0x18d2041b, 0x0e9b0683, 0x431a069b, 0x511a23a4, 0x233f0282, 0x401a029b, 0x021b2303, 0x041b431a,
0x068318d2, 0x069b0e9b, 0x23a8431a, 0x9a01511a, 0x233f0292, 0x401a029b, 0x009b23c1, 0x23ac431a,
0x0282511a, 0x029b233f, 0x4bfa401a, 0x23ed431a, 0x18d2041b, 0x061b2303, 0x0683431a, 0x069b0e9b,
0x22ff4313, 0x51133211, 0x233f028a, 0x401a029b, 0x015b2319, 0x2301431a, 0x18d2049b, 0x061b2303,
0x9a0018d3, 0x0e920692, 0x43130692, 0x321522ff, 0x02825113, 0x029b233f, 0x4be6401a, 0x431a330f,
0x045b236f, 0x230318d2, 0x431a061b, 0x0e9b0683, 0x431a069b, 0x511a23d0, 0x233f028a, 0x401a029b,
0x015b2319, 0x23d4431a, 0x0282511a, 0x029b233f, 0x23f7401a, 0x431a009b, 0x041b2323, 0x230318d2,
0x18d3061b, 0x0e920682, 0x43130692, 0x320122ff, 0x028a5113, 0x029b233f, 0x2319401a, 0x431a015b,
0x330523ff, 0x0282511a, 0x029b233f, 0x231b401a, 0x431a015b, 0x041b239f, 0x230318d2, 0x431a061b,
0x0e9b0683, 0x4313069b, 0x323122ff, 0x2e005113, 0x2340d003, 0x431a6c22, 0x22026422, 0x33cd23ff,
0xbf00551a, 0xbf00bf00, 0xb021981d, 0xb5f7bdf0, 0x460cb0a6, 0x4eb84615, 0x49b82220, 0xa81e4479,
0xfffef7fc, 0x02006828, 0x28070f00, 0x2001d101, 0x2000e000, 0xbf00901d, 0x03006828, 0x28000f00,
0x4668d116, 0xfbacf7fd, 0x20004606, 0xfba3f7fd, 0xd1082e00, 0x4621466a, 0xf7ff9826, 0x4606fc3d,
0xd0002e00, 0x2000e104, 0x20107320, 0xe0036420, 0x73202003, 0x64202050, 0x20452108, 0x46215501,
0xf7fe9826, 0x4606f845, 0xd0002e00, 0x6828e0f0, 0x0f000300, 0xd1062800, 0xaa1e2301, 0x98264619,
0xf826f001, 0x6828e00c, 0x0f000300, 0xd1062803, 0xaa222301, 0x98264619, 0xf81af001, 0xe0d7e000,
0x20452108, 0x22005501, 0x9826a904, 0xf940f7ff, 0x2e004606, 0xe0cbd000, 0xaa03ab02, 0x4620a904,
0xfdbff7fe, 0x2800981d, 0x2050d103, 0x20036420, 0x49807320, 0x20b031f4, 0x49815101, 0x51012090,
0x90012000, 0x03006828, 0x28030f00, 0x8828d004, 0x0f000400, 0xd1012803, 0x90012001, 0x28009801,
0x8828d15a, 0x0f000400, 0xd1542800, 0x061b2301, 0x429a6d22, 0x2020d302, 0xe001218e, 0x21c22018,
0xb2d29a03, 0x029b2301, 0x040318d2, 0x043f27ff, 0x431a403b, 0x06db2301, 0x22d018d3, 0x9a025113,
0x2301b2d2, 0x18d2029b, 0x403b0403, 0x2301431a, 0x18d306db, 0x320122ff, 0xb2ca5113, 0x029b2301,
0x040318d2, 0x431a403b, 0x061b2303, 0x230118d2, 0x18d306db, 0x321122ff, 0x23475113, 0x1d1201db,
0x9a1d5113, 0xd1062a00, 0x22804b56, 0x4b565113, 0x51132284, 0x4b55e005, 0x51132280, 0x22844b54,
0x23235113, 0x22ff015b, 0x51133231, 0x22ff2301, 0x551332cf, 0xe04be04b, 0x20a0494e, 0x494e5101,
0x51012080, 0x20844948, 0x494c5101, 0x510120c0, 0x39dc4949, 0x510120d0, 0x39214947, 0x300120ff,
0x213b5101, 0x20ff0149, 0x51013031, 0x39eb4942, 0x301120ff, 0x49425101, 0x51011d00, 0x03006828,
0x28000f00, 0x2100d11f, 0x70014668, 0x70c12106, 0x70412182, 0xf7fd9800, 0x2001faae, 0x20027420,
0x20e77460, 0x210661a0, 0x20017561, 0x82607520, 0x20e04934, 0x49335101, 0x20e43981, 0x49325101,
0x510120e8, 0x2102bf00, 0x30cd20ff, 0xbf005501, 0x4630bf00, 0xbdf0b029, 0xb0bcb5f7, 0x481e460c,
0x983e903b, 0x02006800, 0x28090f00, 0x2001d101, 0x2000e000, 0x22504606, 0x44794924, 0xf7fca827,
0xbf00febf, 0x90262000, 0x20452104, 0x983e5501, 0x03006800, 0x90250f00, 0x8800983e, 0x0f050400,
0x64202010, 0x28009825, 0x4668d138, 0xfa68f7fd, 0x2000903b, 0xfa5ff7fd, 0x2800983b, 0x466ad128,
0x983c4621, 0xfaf8f7ff, 0x983b903b, 0xd01f2800, 0x0000e1d9, 0x00000312, 0x00004e29, 0x00002084,
0x24040405, 0x8b2004fd, 0xa704b306, 0x0b2004fc, 0x27043306, 0xa7040705, 0x8b2007fd, 0x00000706,
0x0000a304, 0x04000481, 0x00002001, 0x00001e26, 0x20452101, 0x20005501, 0xe0157320, 0x28029825,
0x2104d105, 0x55012045, 0x73202003, 0x9825e00c, 0xd1082803, 0x21087320, 0x55012045, 0xd1032e00,
0x90262001, 0xe19ee000, 0xd0042d00, 0xd0022d02, 0xd0002d03, 0x9825e197, 0xd1022800, 0xd1002d00,
0x2d022601, 0x2104d102, 0x55012045, 0xd1022d03, 0x20452108, 0x2e005501, 0x2140d004, 0x43886c20,
0xe0036420, 0x6c202140, 0x64204308, 0x983c4621, 0xfeaef7fd, 0x983b903b, 0xd0002800, 0x2000e173,
0x2e009024, 0x9825d00f, 0xd0022802, 0xd1062803, 0x2001e002, 0xe0059024, 0x90242002, 0x2000e002,
0xbf009024, 0x9825e00f, 0xd0022802, 0xd1062803, 0x2003e002, 0xe0059024, 0x90242004, 0x2000e002,
0xbf009024, 0x9824bf00, 0xa9270100, 0x23011842, 0x983c4619, 0xfe6cf000, 0x9a26a90b, 0xf7fe983c,
0x903bff97, 0x2800983b, 0xe13cd000, 0xaa0aab09, 0x4620a90b, 0xfc15f7fe, 0x73202003, 0x20b049fd,
0x49fd5101, 0x51012090, 0x9508462f, 0x95069507, 0xd0012e00, 0xe0002002, 0x90052022, 0xd0012e00,
0xe000200c, 0x9004202c, 0xd0012e00, 0xe0002009, 0x90032029, 0xd0012e00, 0xe0002108, 0x91022128,
0x21030228, 0x40080209, 0x4308210b, 0x02892101, 0x02c91840, 0x06391840, 0x06122203, 0x43084011,
0x06899905, 0x06890e89, 0x21804308, 0x98085108, 0x14110200, 0x21044008, 0x99044308, 0x223f0289,
0x40110292, 0x21014308, 0x18400489, 0x06099906, 0x06122203, 0x43084011, 0x06899903, 0x06890e89,
0x21844308, 0x02285108, 0x40081411, 0x43082120, 0x18400149, 0x184102c9, 0x40100638, 0x99054308,
0x0e890689, 0x43080689, 0x510821d0, 0x14110228, 0x21d84008, 0x21014308, 0x18400289, 0x184002c9,
0x40110639, 0x99054308, 0x0e890689, 0x43010689, 0x300120ff, 0x02285101, 0x40081411, 0x43082102,
0x18400249, 0x184002c9, 0x40110639, 0x99054308, 0x0e890689, 0x43010689, 0x301120ff, 0x98075101,
0x14110200, 0x21804008, 0x99024308, 0x223f0289, 0x40110292, 0x21ff4308, 0x51083115, 0x21030228,
0x40080209, 0x43082160, 0x02892101, 0x21ff1840, 0x51083131, 0xd0012d02, 0xd1252d03, 0x21030228,
0x40080209, 0x43082105, 0x02892101, 0x02091840, 0x99061840, 0x22030609, 0x40110612, 0x99034308,
0x0e890689, 0x43080689, 0x510821a0, 0x14110228, 0x21064008, 0x21014308, 0x18400289, 0x510821c0,
0x20ff2102, 0x550130cd, 0x61a02000, 0xd1042d02, 0x69a00469, 0x61a04308, 0x2d03e006, 0x2101d104,
0x69a004c9, 0x61a04308, 0xd1052e00, 0x05c92101, 0x430869a0, 0xe00661a0, 0x6c202180, 0x64204308,
0x20792101, 0x49855501, 0x510120e0, 0x20e44984, 0x20015101, 0x2d007420, 0x2002d002, 0xe0017460,
0x74602000, 0x75612106, 0x75202001, 0x20008260, 0x71084669, 0xd00e2e00, 0xd1022d02, 0x71482041,
0x2d03e018, 0x2081d103, 0x71484669, 0x2000e012, 0x71484669, 0x2d02e00e, 0x2042d103, 0x71484669,
0x2d03e008, 0x2082d103, 0x71484669, 0x2000e002, 0x71484669, 0x46692008, 0x980171c8, 0xf87bf7fd,
0x903b2000, 0xbf00bf00, 0xb03f983b, 0xb5f8bdf0, 0x460c4607, 0x26044615, 0x2c00bf00, 0x2d00d001,
0xe05ed100, 0x02492101, 0xf0014620, 0x2101fb6a, 0x55012046, 0x65200608, 0x6020485a, 0x6060485a,
0x73602003, 0x20ff73a0, 0x550130c9, 0x02006828, 0x00030f00, 0xfc7cf001, 0x0e07060a, 0x241d1c15,
0x342d2c25, 0x462abf00, 0x46384621, 0xfebcf7fe, 0xe0274606, 0x46212201, 0xf7fe4638, 0x4606ff65,
0x2200e020, 0x46384621, 0xff5ef7fe, 0xe0194606, 0x462abf00, 0x46384621, 0xf9d8f7ff, 0xe0114606,
0x462abf00, 0x46384621, 0xfc61f7ff, 0xe0094606, 0x462abf00, 0x46384621, 0xfd8ef7ff, 0xe0014606,
0xbf002604, 0x2e00bf00, 0x4620d107, 0xfff6f7fc, 0x07017828, 0x20460f09, 0x21015501, 0x55012044,
0xbf00bf00, 0xbdf84630, 0xb083b5ff, 0x2704460c, 0x2c00bf00, 0xe070d100, 0x30c520ff, 0x42455900,
0x400d9905, 0x98059906, 0x42401840, 0x31c521ff, 0x42495909, 0x42464008, 0x30ca20ff, 0x28005d00,
0x20ffd104, 0x590030d1, 0xd1122800, 0x462ae00e, 0x98034621, 0xff15f7fd, 0x2f004607, 0x4638d002,
0xbdf0b007, 0x30c520ff, 0x19455900, 0xd3ee42b5, 0xe03fe042, 0x30d120ff, 0x46285901, 0x28004388,
0x2001d101, 0x2000e000, 0x1b709002, 0x98029001, 0xd0202800, 0x30d120ff, 0x98015901, 0xd81a4281,
0x4621462a, 0xf7fd9803, 0x4607ff5a, 0xd00d2f00, 0xe7d54638, 0x00000406, 0x24040405, 0x04000471,
0x00002003, 0x42464346, 0x56010400, 0x30d120ff, 0x19455900, 0x462ae00d, 0x98034621, 0xfed1f7fd,
0x2f004607, 0x4638d001, 0x20ffe7ba, 0x590030c5, 0xbf001945, 0xd3bd42b5, 0xbf00bf00, 0xe7af4638,
0xb08db5ff, 0x4614460f, 0x20049d16, 0xbf00900c, 0xd0032f00, 0xd0012c00, 0xd1002d00, 0x9701e02d,
0xf0009801, 0x9002f846, 0x46692003, 0x20017308, 0x20009006, 0x98029005, 0xe01a7708, 0x42854811,
0xe000d900, 0x46064628, 0x90049810, 0x960b940a, 0x980da903, 0xfad3f000, 0x980c900c, 0xd0002800,
0x1bade009, 0x19809810, 0x08b09010, 0x19040080, 0x2d00bf00, 0xbf00d1e2, 0xbf00bf00, 0xb011980c,
0x0000bdf0, 0x0000ffff, 0x22016801, 0x60014311, 0x6801bf00, 0x0fc907c9, 0xd1fa2900, 0x49fe4770,
0x21026181, 0x477061c1, 0x618149fb, 0x61c12101, 0x46014770, 0x6c082204, 0x28004010, 0x2001d001,
0x20004770, 0x4601e7fc, 0x6c082220, 0x28004010, 0x2001d001, 0x20004770, 0x4601e7fc, 0x07c06c08,
0x28000fc0, 0x2001d001, 0x20004770, 0x4601e7fc, 0x6c082208, 0x28004010, 0x2001d001, 0x20004770,
0x4601e7fc, 0x6c082202, 0x28004010, 0x2001d001, 0x20004770, 0x4601e7fc, 0x6c082240, 0x28004010,
0x2001d001, 0x20004770, 0x4601e7fc, 0x29002000, 0x008ad103, 0x447b4bd9, 0x47705898, 0xb08db5f3,
0x2004460c, 0xbf00900c, 0xf7ff980d, 0x4605ffee, 0x900a2001, 0xd0042d00, 0xd0022c00, 0x28037b20,
0xe0cfdd00, 0x28007b20, 0x2801d006, 0x2802d005, 0x2803d004, 0xe004d110, 0xbf00bf00, 0x900a2001,
0x4620e00b, 0xffbdf7ff, 0xd0022800, 0x900a2001, 0x2000e001, 0xe000900a, 0xbf00bf00, 0x2800980a,
0x20ffd004, 0x90073001, 0xe07e9008, 0x2102aa09, 0xf7fc980d, 0x2000fd35, 0x49b99006, 0x42889809,
0x2180d306, 0x40086c20, 0xd1012800, 0x90062001, 0x28009806, 0x2079d003, 0x90089007, 0x2000e064,
0xe05e9005, 0x00419805, 0x30784620, 0x78401808, 0x98059004, 0x46200041, 0x5c403078, 0x98049003,
0xd13b2800, 0x00419805, 0x30784620, 0x21645c47, 0x2f00434f, 0x4620d127, 0xff7df7ff, 0xa9029001,
0x980d9a01, 0xfd44f7fc, 0x28009801, 0x489dd10d, 0xf0019902, 0x0840f978, 0x00c9217d, 0x214b4348,
0xf0019000, 0x1c46f970, 0x4896e00c, 0xf0019902, 0x0880f96a, 0x00c9217d, 0x214b4348, 0xf0019000,
0x1c46f962, 0x214be00b, 0xf0014638, 0x4606f95c, 0x4370204b, 0xd20242b8, 0xe0001c76, 0x273f9e04,
0xd90042be, 0x0270463e, 0x0249213f, 0x21ff4008, 0x43083101, 0x00899905, 0x5050aa07, 0x1c409805,
0x98059005, 0xd39d2802, 0x6828bf00, 0x40082102, 0xd0022800, 0x900b2000, 0x2001e001, 0x980b900b,
0xd0032800, 0x21026828, 0x60284308, 0x28006d20, 0x6d60d102, 0xd0022800, 0x990720c0, 0x6da05141,
0xd1022800, 0x28006de0, 0x20c4d002, 0x51419908, 0x2800980b, 0x6828d003, 0x43882102, 0x20006028,
0xbf00900c, 0x980cbf00, 0xbdf0b00f, 0xb083b5ff, 0x460f4606, 0x2004461d, 0xbf009002, 0xd0042e00,
0x28009805, 0x2d00d001, 0xe017d100, 0x9905485d, 0xf8f9f001, 0x98019001, 0x46014368, 0xf0014638,
0x4604f8f2, 0x1c64e000, 0x99014620, 0x43684348, 0xd3f842b8, 0x20006034, 0xbf009002, 0x9802bf00,
0xbdf0b007, 0x4606b57f, 0x484f460c, 0x90029003, 0xf7ff4630, 0x4605feda, 0xd0012d00, 0xd1022c00,
0xb0042004, 0xaa01bd70, 0x46302102, 0xfc48f7fc, 0x2101466a, 0xf7fc4630, 0x2301fc43, 0x4943029b,
0x9a01a803, 0xffb2f7ff, 0x029b2301, 0xa802493f, 0xf7ff9a00, 0x493cffab, 0x42889803, 0x4608d901,
0x49399003, 0x42889802, 0x4608d901, 0x98039002, 0x0c000400, 0x99020400, 0x4308b289, 0x20006068,
0x21bce7cf, 0x22015809, 0x22bc4311, 0xbf005011, 0x580921bc, 0x0fc907c9, 0xd1f92900, 0x21b84770,
0x22015809, 0x22b84311, 0xbf005011, 0x580921b8, 0x0fc907c9, 0xd1f92900, 0xbf004770, 0x580921e0,
0x0fc907c9, 0xd0f92900, 0x21e0bf00, 0x22025809, 0x29024011, 0x4770d1f9, 0x221e6941, 0x61414311,
0xb5f34770, 0x460cb085, 0x90042004, 0x2000bf00, 0x98059001, 0xfe69f7ff, 0x2f004607, 0x2c00d001,
0xe078d100, 0x30504620, 0x26009000, 0x9800e06e, 0x90036800, 0x1d009800, 0x98039000, 0x00b20a81,
0x30604638, 0x7ba05081, 0x0ec006c0, 0x01497b61, 0x0152221f, 0xe00b4011, 0x5af05af0, 0x0000175a,
0x05f5e100, 0x3b9aca00, 0x0000ffff, 0x1dcd6500, 0x7be14308, 0x220f02c9, 0x401102d2, 0x46054308,
0xf7ff4620, 0x2800fe14, 0x2001d002, 0x43050280, 0x28006f60, 0xaa02d00f, 0x98052102, 0xfba0f7fc,
0x6f612301, 0x9a02a801, 0xff10f7ff, 0x04009801, 0x04000c00, 0x00b14305, 0x30704638, 0x25005045,
0x5d002047, 0xd0192800, 0x309120ff, 0x01405d00, 0x400821e0, 0xd0112800, 0x309220ff, 0x02005d00,
0x0209210f, 0x43054008, 0x309120ff, 0x1e405d00, 0x21070340, 0x40080349, 0xe0024305, 0x02002009,
0x00b14305, 0x30804638, 0x1c765045, 0xd38e2e04, 0x90042000, 0xbf00bf00, 0xb0079804, 0xb5f0bdf0,
0x460d4603, 0xbf002704, 0xd0012b00, 0xd1002d00, 0x2044e025, 0x28015d40, 0x68d8d10c, 0x00760846,
0x43062040, 0xf7ff4628, 0x2800fd94, 0x2001d001, 0x60de4306, 0x212068d8, 0x60d84308, 0xe00a2400,
0x461800a1, 0x58403020, 0x400849fd, 0x461a00a1, 0x50503220, 0x2c031c64, 0x2700d3f2, 0xbf00bf00,
0xbdf04638, 0x4606b570, 0x4630bf00, 0xfdadf7ff, 0x2d004605, 0xe010d100, 0xe00b2400, 0x462800a1,
0x58403080, 0x07c92101, 0x00a24308, 0x31804629, 0x1c645088, 0xd3f12c04, 0xbf00bf00, 0xb5f3bd70,
0x460db089, 0x90082004, 0xf7ff9809, 0x4604fd8e, 0x2c00bf00, 0x2d00d004, 0x7828d002, 0xdd002803,
0x2000e122, 0x7c289007, 0x46209006, 0xfef5f7ff, 0xf7ff9809, 0x4620ffc7, 0xfefef7ff, 0x686920a0,
0x78285101, 0xd1022802, 0xb2808b28, 0x78289007, 0xd1022803, 0xb2808c28, 0x89289007, 0x210f0400,
0x40080409, 0x1e497b29, 0x22070609, 0x40110612, 0x99064308, 0x0fc907c9, 0x430807c9, 0x43089907,
0x21a49007, 0x51089807, 0x28037828, 0x6a2ed167, 0x403869ef, 0xd0002800, 0x2080e0e6, 0x98059005,
0x90040900, 0x08409805, 0x98049003, 0x00801e40, 0x4008213c, 0x510821b8, 0xf7ff4620, 0x20b0fea0,
0x21015900, 0x21b04308, 0xe0445108, 0x30f91de0, 0x428e9903, 0x9a03d314, 0x69620891, 0x401a2320,
0xd00c2a00, 0xc804e001, 0x460ac704, 0x2a001e49, 0x9a03d1f9, 0x69621ab6, 0x431a2320, 0xe0236162,
0x590921f0, 0x0d490609, 0xd31d42b1, 0xc802e002, 0x1f36c702, 0xd2fa2e04, 0xd0142e00, 0x91026801,
0x9101a902, 0x21009700, 0x9a01e00a, 0x9a007813, 0x9a017013, 0x92011c52, 0x1c529a00, 0x1c499200,
0xd3f242b1, 0x2600bf00, 0x22086961, 0x29004011, 0xe002d000, 0x2e00bf00, 0xbf00d1b8, 0x7828bf00,
0xd0022802, 0x28017828, 0x69aed15a, 0x07b8696f, 0x28000f80, 0xe077d000, 0x90052080, 0x09009805,
0x98059004, 0x90030840, 0x1e409804, 0x213c0080, 0x21bc4008, 0x46205108, 0xfe23f7ff, 0x90022000,
0x4620e03a, 0x308130ff, 0x22406961, 0x29004011, 0x9a03d02b, 0x9a030891, 0xd3094296, 0xcf04e001,
0x460ac004, 0x2a001e49, 0x9a03d1f9, 0xe00c1ab6, 0x2e00e007, 0x1f36dd03, 0xc004cf04, 0x2200e001,
0x460ac004, 0x2a001e49, 0x9a02d1f3, 0xd1072a00, 0x591222b0, 0x431a2301, 0x511a23b0, 0x92022201,
0x23406962, 0x6162431a, 0x6961bf00, 0x40112208, 0xd0002900, 0xbf00e002, 0xdcc22e00, 0xbf00bf00,
0x28007828, 0x20b0d105, 0x21015900, 0x21b04308, 0x46205108, 0xfdf1f7ff, 0x21086960, 0x28004008,
0x20e4d00f, 0x210f5900, 0x40080609, 0x280e0e00, 0x4854d002, 0xe0039008, 0x1e404852, 0xbf009008,
0x2000e001, 0xbf009008, 0x9808bf00, 0xbdf0b00b, 0xb085b5ff, 0x4616460c, 0x2004461d, 0xbf009004,
0xf7ff9805, 0x4607fc52, 0xd0092f00, 0xd0072e00, 0x19622000, 0x23104140, 0x1a9a2100, 0xd2004181,
0x4638e029, 0xfdb9f7ff, 0x90032000, 0x46389002, 0xfbf5f7ff, 0x900300a0, 0x00801960, 0x98039002,
0x1df80081, 0x30fa30ff, 0x90011808, 0x6831e009, 0x60019801, 0x1c409803, 0x98019003, 0x90011d00,
0x99021d36, 0x42889803, 0x4638d3f1, 0xfbdcf7ff, 0x90042000, 0xbf00bf00, 0xb0099804, 0xb5f0bdf0,
0x4607b08b, 0x4615460c, 0x2004461e, 0xbf00900a, 0xd1002c00, 0x2100e02c, 0x71014668, 0x90042001,
0x90032003, 0x75054668, 0x20479602, 0x28005d00, 0x20ffd00c, 0x5d003089, 0xd0072800, 0x308a20ff,
0x90035d00, 0x308920ff, 0x90045d00, 0x01009803, 0x31804621, 0x21011842, 0x9b044638, 0xff88f7ff,
0x90032001, 0x4638a901, 0xfe49f7ff, 0xbf00900a, 0x980abf00, 0xbdf0b00b, 0x4604b5f8, 0x90002004,
0x4625bf00, 0x4610460e, 0xd0072b00, 0x0fff07df, 0xd1032f00, 0xd0012c00, 0xd1052900, 0x0000e013,
0xfcf0ff00, 0x00001b59, 0x7807e008, 0x1c40702f, 0x78071c6d, 0x1c407037, 0x1e9b1c76, 0xd1f42b00,
0x97002700, 0xbf00bf00, 0xbdf89800, 0xb093b5ff, 0x2004460c, 0xbf009012, 0xd1002c00, 0x2000e0a6,
0x207c900e, 0x27015b01, 0x207e408f, 0x900f5b00, 0x90049816, 0x46692003, 0x20017308, 0x90059006,
0x900aa810, 0x28009815, 0x2008d001, 0x2004e000, 0x4669900b, 0x77089815, 0x5d002047, 0xd00c2800,
0x308520ff, 0x28005d00, 0x20ffd007, 0x5d003086, 0x20ff9005, 0x5d003085, 0x98059006, 0x46210100,
0x18423180, 0x98059b06, 0x90014601, 0xf7ff9813, 0x6f20ff0f, 0xd0012800, 0xe0002001, 0x90022000,
0x6f252600, 0xa903bf00, 0xf7ff9813, 0x9012fdc8, 0x28009812, 0xe057d000, 0x28009815, 0x2308d022,
0xa90caa10, 0xf7ffa80d, 0x980fff77, 0xd00d2800, 0x990d4638, 0x46394388, 0x43919a0c, 0x28004308,
0x2001d001, 0x2000e000, 0xe020900e, 0x4038980d, 0x4039990c, 0x28004308, 0x2001d001, 0x2000e000,
0xe014900e, 0x2800980f, 0x4638d009, 0x43889910, 0xd0012800, 0xe0002001, 0x900e2000, 0x9810e007,
0x28004038, 0x2001d001, 0x2000e000, 0x980e900e, 0xd0162800, 0x28009802, 0x2100d013, 0x40694608,
0x43014070, 0x207dd00a, 0x210000c0, 0xf8f7f7fc, 0x21004630, 0x41881e6d, 0xe0024606, 0x901248fe,
0x980ee002, 0xd19e2800, 0xbf00bf00, 0x9812bf00, 0xbdf0b017, 0xb08ab5f7, 0x4615460c, 0xbf002604,
0xf7ff980a, 0x4607faf2, 0xd0012f00, 0xd1002c00, 0x2001e050, 0x59c00240, 0x0f800580, 0x98099009,
0xd0042800, 0x28027c60, 0x2600d101, 0x2101e042, 0x70014668, 0x7d609501, 0x7d209002, 0x21009003,
0x74014668, 0x30184620, 0x20049005, 0x462b9006, 0x46212200, 0xf7ff980a, 0x9802feb2, 0x46210100,
0x18423180, 0x9b032101, 0xf7ff980a, 0x2001fe61, 0x46699002, 0xf7ff980a, 0x4606fd22, 0xd0002e00,
0x8a60e018, 0xd10d2800, 0x28027c60, 0x7c60d00a, 0xd0072803, 0x2200462b, 0x980a4621, 0xfef6f7ff,
0xe0064606, 0x21648a60, 0x46024348, 0xf7fc2100, 0xbf00f886, 0x4630bf00, 0xbdf0b00d, 0xb083b5f3,
0x2004460c, 0xbf009002, 0xd1002c00, 0x2500e01a, 0x30504620, 0x26009001, 0x9801e010, 0x9001c880,
0xd00a2f00, 0x4621462a, 0xf7ff9803, 0x9002ff83, 0x28009802, 0xe003d000, 0x1c7619ed, 0xd3ec2e04,
0xbf00bf00, 0x9802bf00, 0xbdf0b005, 0xb08cb5f7, 0x4617460c, 0xbf002604, 0xf7ff980c, 0x900bfa66,
0x2800980b, 0x2c00d001, 0xe077d100, 0x46682101, 0x97037201, 0x76012100, 0x90082004, 0xe06a2500,
0x462000a9, 0x18083020, 0x28007840, 0x980bdd61, 0x30ff30ff, 0x68003002, 0x0f800580, 0x98019001,
0xd0052800, 0x301d4620, 0x28025d40, 0xe051d100, 0x462000a9, 0x18083020, 0x90047840, 0x462000a9,
0x5c403020, 0x00a99005, 0x30304620, 0x90071808, 0x2200463b, 0x980c4621, 0xfe11f7ff, 0x2e004606,
0x4630d002, 0xbdf0b00f, 0x01009804, 0x31804621, 0x21011842, 0x980c9b05, 0xfdbaf7ff, 0x90042001,
0x980ca902, 0xfc7bf7ff, 0x2e004606, 0x4630d001, 0x8a60e7e8, 0xd1142800, 0x301d4620, 0x28025d40,
0x4620d00f, 0x5d40301d, 0xd00a2803, 0x2200463b, 0x980c4621, 0xfe4af7ff, 0x2e004606, 0x4630d008,
0x8a60e7d0, 0x43482164, 0x21004602, 0xffd7f7fb, 0xbf00bf00, 0x2d031c6d, 0xbf00d392, 0x4630bf00,
0xb5f3e7c0, 0x460cb083, 0x90022004, 0x2c00bf00, 0xe01ad100, 0x46202500, 0x90013050, 0xe0102600,
0xc8809801, 0x2f009001, 0x462ad00a, 0x98034621, 0xff5cf7ff, 0x98029002, 0xd0002800, 0x19ede003,
0x2e041c76, 0xbf00d3ec, 0xbf00bf00, 0xb0059802, 0xb5f3bdf0, 0x460db083, 0xbf002704, 0xf7ff9803,
0x4604f9b4, 0xd0012c00, 0xd1002d00, 0x7c28e0b5, 0xd1022800, 0x28007f28, 0x2110d00b, 0x40086c28,
0xd1042800, 0xf7ff4628, 0x2800f996, 0x2001d001, 0x2000e000, 0x49499002, 0x42886828, 0xe09cd000,
0xf7fb9803, 0x4629fe9b, 0xf7fb9803, 0x9802ffc1, 0xd0052800, 0x21012200, 0xf7fb9803, 0xe009fe99,
0xf7ff4628, 0x9001f978, 0x5d412046, 0x98039a01, 0xfe8ef7fb, 0xf7fb9803, 0x6820fe77, 0x43882102,
0x46206020, 0xf920f7ff, 0x21026820, 0x60204308, 0x49336826, 0x2045400e, 0x28085d40, 0x0280d101,
0x48304306, 0x7b284306, 0x21300100, 0x43064008, 0x46296026, 0xf7ff9803, 0x68a0fa75, 0x03c92101,
0x60a04388, 0xf7ff4628, 0x2800f928, 0x68a0d004, 0x04c92101, 0x60a04308, 0x46204629, 0xfb5ff7ff,
0x98034629, 0xfacdf7ff, 0x98034629, 0xf946f7ff, 0x21026820, 0x60204388, 0xf7ff4620, 0x7c28f8e5,
0xd0072800, 0x98034629, 0xfe98f7ff, 0x2f004607, 0xe032d000, 0x28007f28, 0x4629d007, 0xf7ff9803,
0x4607ff40, 0xd0002f00, 0x9802e027, 0xd0222800, 0x21026820, 0x60204308, 0xf7ff4628, 0x9001f90c,
0x5d412046, 0x98039a01, 0xfe22f7fb, 0x98034629, 0xfa28f7ff, 0xe0074629, 0x00001b5a, 0x42464346,
0x0000df0f, 0xffff0000, 0xf7ff9803, 0x6820f907, 0x43882102, 0x27006020, 0xbf00bf00, 0xb0054638,
0xb570bdf0, 0xbf004605, 0xf7ff4628, 0x4604f8ee, 0xd1002c00, 0xbf00e007, 0x590020e0, 0x40082102,
0xd0f92800, 0xbf00bf00, 0xb570bd70, 0xbf004605, 0xf7ff4628, 0x4604f8da, 0xd1002c00, 0x4620e003,
0xf882f7ff, 0xbf00bf00, 0xb570bd70, 0x460d4606, 0x4630bf00, 0xf8c9f7ff, 0x2c004604, 0xe010d100,
0xf7ff4620, 0x2d00fa3a, 0x6820d005, 0x02c92101, 0x60204308, 0x6820e004, 0x02c92101, 0x60204388,
0xbf00bf00, 0x0000bd70, 0xb5104770, 0x890048be, 0x00400840, 0x810849bc, 0x890048bc, 0x00400840,
0x810849ba, 0x880048b8, 0x40082104, 0xd0042800, 0x880048b5, 0x49b44388, 0x48b48008, 0x21048800,
0x28004008, 0x48b1d004, 0x43888800, 0x800849af, 0x49b048af, 0x48b06048, 0x46086088, 0x21806800,
0x21204388, 0x49ab4308, 0x48ac6008, 0x07c06900, 0x28000fc0, 0x48a9d005, 0x08406900, 0x49a70040,
0x48a76108, 0x21016940, 0x40080449, 0xd0424288, 0x48a3bf00, 0x40086940, 0xd0002800, 0xbf00e03a,
0xbf00bf00, 0x8f4ff3bf, 0xbf00bf00, 0xbf00bf00, 0xbf00bf00, 0x8f6ff3bf, 0xbf00bf00, 0x2000bf00,
0x61084998, 0xbf00bf00, 0xf3bfbf00, 0xbf008f4f, 0xbf00bf00, 0xbf00bf00, 0xf3bfbf00, 0xbf008f6f,
0xbf00bf00, 0x6940488e, 0x04492101, 0x498c4308, 0xbf006148, 0xbf00bf00, 0x8f4ff3bf, 0xbf00bf00,
0xbf00bf00, 0xbf00bf00, 0x8f6ff3bf, 0xbf00bf00, 0xbf00bf00, 0x4882bf00, 0x21016940, 0x40080409,
0xd0514288, 0x4b7ebf00, 0x460c695b, 0x2b004023, 0xe048d000, 0x4c7a2300, 0x60633480, 0xbf00bf00,
0xf3bfbf00, 0xbf008f4f, 0xbf00bf00, 0x68184623, 0x40034b75, 0xbf000b59, 0x40034b74, 0xbf0008da,
0x4c73014b, 0x07944023, 0x07a40fa4, 0x4c6d4323, 0xbf006223, 0x4613bf00, 0x2b001e52, 0x460bd1f0,
0x2b001e49, 0xbf00d1e8, 0xbf00bf00, 0x8f4ff3bf, 0xbf00bf00, 0x4b62bf00, 0x2401695b, 0x43230424,
0x61634c5f, 0xbf00bf00, 0xf3bfbf00, 0xbf008f4f, 0xbf00bf00, 0xbf00bf00, 0xf3bfbf00, 0xbf008f6f,
0xbf00bf00, 0xbf00bf00, 0xff1ef7ff, 0xb5febd10, 0x6b004858, 0x04092101, 0x28004008, 0x4d56d001,
0x4854e00b, 0x07c06b00, 0x28000fc0, 0x2016d001, 0x2014e000, 0x46054950, 0x484e434d, 0x6a073040,
0x494c484d, 0x69093140, 0xfabaf000, 0x2300463a, 0x90009101, 0xf89af000, 0x48461945, 0x21016900,
0x40080409, 0xd0012800, 0xe00b4e43, 0x69004841, 0x40082102, 0xd0012800, 0xe0002016, 0x493e2014,
0x434e4606, 0x6940483d, 0x06492101, 0x28004008, 0x483ad019, 0x21036980, 0x40080309, 0xd0082800,
0x03092101, 0xd0061a40, 0xd0061a40, 0xd1061a40, 0x4634e006, 0x4c30e006, 0x4c2fe004, 0xbf00e002,
0xbf002400, 0x482de031, 0x21036980, 0x40080489, 0xd0082800, 0x04892101, 0xd0061a40, 0xd0121a40,
0xd11f1a40, 0x462ce01c, 0x4822e01e, 0x6b0030c0, 0x0612223f, 0x0e014010, 0xf0004630, 0x2112f954,
0x46044348, 0x481ee010, 0x223f6800, 0x40100612, 0x46280e01, 0xf947f000, 0x43482112, 0xe0034604,
0xe0014c18, 0xbf002400, 0x4814bf00, 0x22076940, 0x40100292, 0x1c410a80, 0xf0004620, 0x4912f934,
0x60084449, 0x0000bdfe, 0x400b8000, 0x400d0000, 0xd928c520, 0x400bc000, 0x0000ffff, 0xe000e000,
0xe000ed00, 0xe000ef40, 0x0fffe000, 0x00001ff8, 0x00003fe0, 0x400d8000, 0x016e3600, 0x400fc000,
0x400d8100, 0x1dcd6500, 0x0000020c, 0x4605b5fe, 0x460c4610, 0xd0734318, 0x468c46ae, 0x1aad2000,
0x419c4601, 0x4666d367, 0x24012700, 0x1ab6463d, 0xd302419d, 0x463a4613, 0x46652421, 0x042f4676,
0x433e0c36, 0x1ab60c2d, 0xd304419d, 0x041b0c15, 0x0412432b, 0x46653410, 0x062f4676, 0x433e0a36,
0x1ab60a2d, 0xd304419d, 0x021b0e15, 0x0212432b, 0x46653408, 0x072f4676, 0x433e0936, 0x1ab6092d,
0xd304419d, 0x011b0f15, 0x0112432b, 0x46651d24, 0x07af4676, 0x433e08b6, 0x1ab608ad, 0xd304419d,
0x009b0f95, 0x0092432b, 0x46651ca4, 0x07ef4676, 0x433e0876, 0x1ab6086d, 0xd31a419d, 0x415b1892,
0xe0161c64, 0x46761800, 0x41494665, 0x419d1ab7, 0x90009101, 0x4660d309, 0x41981ab1, 0x4684468e,
0x99019800, 0x1c402500, 0x07dd4169, 0x432a0852, 0x1e64085b, 0x4672d5e6, 0xb0034663, 0xe7ffbdf0,
0x46012000, 0x46c046c0, 0x4623462a, 0x0000e7f5, 0x4604b50e, 0x460e4615, 0xf000a012, 0x4620f93b,
0xf938f000, 0xf000a015, 0x4630f935, 0xf932f000, 0xf000a014, 0x466cf92f, 0x72e02000, 0x72a0200a,
0xe007340a, 0x4628210a, 0xf877f000, 0x46053130, 0x70211e64, 0xdcf52d00, 0xf0004620, 0xf000f91b,
0x0000f90f, 0x202a2a2a, 0x65737361, 0x6f697472, 0x6166206e, 0x64656c69, 0x0000203a, 0x6966202c,
0x0020656c, 0x696c202c, 0x0020656e, 0xb5104603, 0x079b430b, 0x2a04d10f, 0xc808d30d, 0x1f12c910,
0xd0f842a3, 0xba21ba18, 0xd9014288, 0xbd102001, 0x43c02000, 0x2a00bd10, 0x07d3d003, 0x1c52d003,
0x2000e007, 0x7803bd10, 0x1c40780c, 0x1b1b1c49, 0x7803d107, 0x1c40780c, 0x1b1b1c49, 0x1e92d101,
0x4618d1f1, 0xe001bd10, 0x1f09c004, 0xd2fb2904, 0xd501078b, 0x1c808002, 0xd00007c9, 0x47707002,
0xd00b2900, 0xd00207c3, 0x1c407002, 0x29021e49, 0x0783d304, 0x8002d502, 0x1e891c80, 0x2200e7e3,
0x2200e7ee, 0x2200e7df, 0x428b0903, 0x0a03d32c, 0xd311428b, 0x469c2300, 0x4603e04e, 0xd43c430b,
0x08432200, 0xd331428b, 0x428b0903, 0x0a03d31c, 0xd301428b, 0xe03f4694, 0x428b09c3, 0x01cbd301,
0x41521ac0, 0x428b0983, 0x018bd301, 0x41521ac0, 0x428b0943, 0x014bd301, 0x41521ac0, 0x428b0903,
0x010bd301, 0x41521ac0, 0x428b08c3, 0x00cbd301, 0x41521ac0, 0x428b0883, 0x008bd301, 0x41521ac0,
0x428b0843, 0x004bd301, 0x41521ac0, 0xd2001a41, 0x41524601, 0x47704610, 0x0fcae05d, 0x4249d000,
0xd3001003, 0x40534240, 0x469c2200, 0x428b0903, 0x0a03d32d, 0xd312428b, 0x018922fc, 0x0a03ba12,
0xd30c428b, 0x11920189, 0xd308428b, 0x11920189, 0xd304428b, 0xd03a0189, 0xe0001192, 0x09c30989,
0xd301428b, 0x1ac001cb, 0x09834152, 0xd301428b, 0x1ac0018b, 0x09434152, 0xd301428b, 0x1ac0014b,
0x09034152, 0xd301428b, 0x1ac0010b, 0x08c34152, 0xd301428b, 0x1ac000cb, 0x08834152, 0xd301428b,
0x1ac0008b, 0xd2d94152, 0x428b0843, 0x004bd301, 0x41521ac0, 0xd2001a41, 0x46634601, 0x105b4152,
0xd3014610, 0x2b004240, 0x4249d500, 0x46634770, 0xd300105b, 0xb5014240, 0x46c02000, 0xbd0246c0,
0x2000b510, 0xf81cf000, 0x46c046c0, 0xf0002001, 0xbd10f811, 0x4604b510, 0x1c64e002, 0xf804f000,
0x28007820, 0xbd10d1f9, 0x4669b508, 0x20037008, 0xbd08beab, 0x20184901, 0xe7febeab, 0x00020026,
0xf000b510, 0xf000f80b, 0xbd10f802, 0xb5104770, 0xd0012800, 0xffeef7ff, 0x0000bd10, 0x2100b510,
0xf000a002, 0x2001f813, 0x0000bd10, 0x41474953, 0x3a545242, 0x6e624120, 0x616d726f, 0x6574206c,
0x6e696d72, 0x6f697461, 0x0000006e, 0x4605b570, 0x200a460c, 0x1c6de000, 0xffc6f7ff, 0xd0062d00,
0x28007828, 0xe002d1f7, 0xf7ff1c64, 0x2c00ffbd, 0x7820d002, 0xd1f72800, 0xf7ff200a, 0xbd70ffb5,
0xb282b5f8, 0x0c04b28b, 0x46100c0d, 0x21004358, 0x435e4626, 0x04360c37, 0x41791980, 0x436e4616,
0x04360c37, 0x41791980, 0x436e4626, 0xbdf81989, 0x4674b430, 0x78251e64, 0x42ab1c64, 0x5d63d304,
0x18e3005b, 0x4718bc30, 0xe7f8461d, 0x08220000, 0x06180816, 0x0612041e, 0x0411060e, 0x0216060c,
0x06180000, 0x060c0416, 0x0312021e, 0x01210216, 0x0116011a, 0x33221100, 0x77665544, 0xbbaa9988,
0xffeeddcc, 0x0818045a, 0x24ff3008, 0x00000000, 0x00000000, 0x0918055a, 0x25ff3108, 0x00000000,
0x00000000, 0x0a18065a, 0x26ff3208, 0x00000000, 0x00000000, 0x2403049f, 0x00000000, 0x00000000,
0x00000000, 0x0760079f, 0x27040b20, 0x00000000, 0x00000000, 0x8760879f, 0xa7048b20, 0x00000000,
0x00000000, 0x0818045a, 0x24ff3008, 0x00000000, 0x00000000, 0x8b20075a, 0x0000a7ff, 0x00000000,
0x00000000, 0x0818045a, 0x24ff3008, 0x00000000, 0x00000000, 0x0a18065a, 0x000026ff, 0x00000000,
0x00000000, 0x0b18075a, 0x000027ff, 0x00000000, 0x00000000, 0x8a18065a, 0x0000a6ff, 0x00000000,
0x00000000, 0x8b20075a, 0x0000a7ff, 0x00000000, 0x00000000, 0x400a0000, 0x00000000, 0x00000001,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000, 0x00000000,
0x00000000, 0x11b3dc40
],
# Relative function addresses
'pc_init': 0x202001bb,
'pc_unInit': 0x202001f7,
'pc_program_page': 0x2020023b,
'pc_erase_sector': 0x20200215,
'pc_eraseAll': 0x202001fd,
'static_base' : 0x20205118,
'begin_stack' : 0x20004000,
'begin_data' : 0x20005000,
'page_size' : 0x00000100,
'analyzer_supported' : False,
'analyzer_address' : 0x00000000,
'page_buffers' : [0x20005000, 0x20005100], # Enable double buffering
'min_program_length' : 0x00000100,
}
class MIMXRT1011xxxxx(IMXRT):
VENDOR = "NXP"
# Note: itcm, dtcm, and ocram share a single 128 KB block of RAM that can be configurably
# divided between those regions (this is called FlexRAM). Thus, the memory map regions for
# each of these RAMs allocate the maximum possible of 128 KB, but that is the maximum and
# will not actually be available in all regions simultaneously.
MEMORY_MAP = MemoryMap(
RamRegion(name="itcm", start=0x00000000, length=0x8000), # 32 KB
RomRegion(name="romcp", start=0x00200000, length=0x18000), # 96 KB
RamRegion(name="dtcm", start=0x20000000, length=0x8000), # 32 KB
RamRegion(name="ocram", start=0x20200000, length=0x10000), # 64 KB
FlashRegion(name="flexspi", start=0x60000000, end=0x60ffffff, blocksize=0x1000, is_boot_memory=True,
algo=FLASH_ALGO_QUADSPI, page_size=0x100),
)
def __init__(self, session):
super(MIMXRT1011xxxxx, self).__init__(session, self.MEMORY_MAP)
self._svd_location = SVDFile.from_builtin("MIMXRT1011.xml")
| {
"pile_set_name": "Github"
} |
const { assert, skip, test, module: describe, only } = require('qunit');
const { GPU } = require('../../src');
describe('feature: bitwise operators');
function testBooleanFromExpression(mode) {
const gpu = new GPU({ mode });
const kernel = gpu.createKernel(function() {
const result = 1 === 1 && 2 === 2;
return result ? 1 : 0;
}, { output: [1] });
assert.equal(kernel()[0], 1);
gpu.destroy();
}
test('auto', () => {
testBooleanFromExpression();
});
test('gpu', () => {
testBooleanFromExpression('gpu');
});
(GPU.isWebGLSupported ? test : skip)('webgl', () => {
testBooleanFromExpression('webgl');
});
(GPU.isWebGL2Supported ? test : skip)('webgl2', () => {
testBooleanFromExpression('webgl2');
});
(GPU.isHeadlessGLSupported ? test : skip)('headlessgl', () => {
testBooleanFromExpression('headlessgl');
});
test('cpu', () => {
testBooleanFromExpression('cpu');
}); | {
"pile_set_name": "Github"
} |
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++98, c++03, c++11, c++14
// <unordered_map>
// class unordered_multimap
// iterator insert(const_iterator hint, node_type&&);
#include <unordered_map>
#include "test_macros.h"
#include "min_allocator.h"
template <class Container>
typename Container::node_type
node_factory(typename Container::key_type const& key,
typename Container::mapped_type const& mapped)
{
static Container c;
auto it = c.insert({key, mapped});
return c.extract(it);
}
template <class Container>
void test(Container& c)
{
auto* nf = &node_factory<Container>;
for (int i = 0; i != 10; ++i)
{
typename Container::node_type node = nf(i, i + 1);
assert(!node.empty());
size_t prev = c.size();
auto it = c.insert(c.end(), std::move(node));
assert(node.empty());
assert(prev + 1 == c.size());
assert(it->first == i);
assert(it->second == i + 1);
}
assert(c.size() == 10);
for (int i = 0; i != 10; ++i)
{
assert(c.count(i) == 1);
assert(c.find(i)->second == i + 1);
}
}
int main(int, char**)
{
std::unordered_multimap<int, int> m;
test(m);
std::unordered_multimap<int, int, std::hash<int>, std::equal_to<int>, min_allocator<std::pair<const int, int>>> m2;
test(m2);
return 0;
}
| {
"pile_set_name": "Github"
} |
/**
* Copyright 2006 StartNet s.r.o.
*
* Distributed under MIT license
*/
package cz.startnet.utils.pgdiff.parsers;
import cz.startnet.utils.pgdiff.Resources;
import cz.startnet.utils.pgdiff.schema.PgColumn;
import cz.startnet.utils.pgdiff.schema.PgDatabase;
import cz.startnet.utils.pgdiff.schema.PgSchema;
import cz.startnet.utils.pgdiff.schema.PgType;
import java.text.MessageFormat;
import javax.xml.parsers.ParserConfigurationException;
/**
* Parses CREATE TABLE statements.
*
* @author fordfrog
*/
public class CreateTypeParser {
/**
* Parses CREATE TYPE statement.
*
* @param database database
* @param statement CREATE TYPE statement
*/
public static void parse(final PgDatabase database,
final String statement) {
final Parser parser = new Parser(statement);
parser.expect("CREATE", "TYPE");
final String typeName = parser.parseIdentifier();
final PgType type = new PgType(ParserUtils.getObjectName(typeName));
final String schemaName
= ParserUtils.getSchemaName(typeName, database);
final PgSchema schema = database.getSchema(schemaName);
if (schema == null) {
throw new RuntimeException(MessageFormat.format(
Resources.getString("CannotFindSchema"), schemaName,
statement));
}
schema.addType(type);
parser.expect("AS");
if (parser.expectOptional("ENUM")) {
type.setIsEnum(true);
}
parser.expect("(");
while (!parser.expectOptional(")")) {
if (type.getIsEnum()) {
String name = parser.getExpression();
type.addEnumValue(name);
if (parser.expectOptional(")")) {
break;
} else {
parser.expect(",");
}
} else {
parseColumn(parser, type);
if (parser.expectOptional(")")) {
break;
} else {
parser.expect(",");
}
}
}
while (!parser.expectOptional(";")) {
}
}
/**
* Parses column definition.
*
* @param parser parser
* @param type type
*/
private static void parseColumn(final Parser parser, final PgType type) {
final PgColumn column = new PgColumn(
ParserUtils.getObjectName(parser.parseIdentifier()));
type.addColumn(column);
column.parseDefinition(parser.getExpression());
}
/**
* Creates a new instance of CreateTableParser.
*/
private CreateTypeParser() {
}
}
| {
"pile_set_name": "Github"
} |
/* -------------------------------------------------------------- */
/* (C)Copyright 2006,2008, */
/* International Business Machines Corporation */
/* All Rights Reserved. */
/* */
/* Redistribution and use in source and binary forms, with or */
/* without modification, are permitted provided that the */
/* following conditions are met: */
/* */
/* - Redistributions of source code must retain the above copyright*/
/* notice, this list of conditions and the following disclaimer. */
/* */
/* - Redistributions in binary form must reproduce the above */
/* copyright notice, this list of conditions and the following */
/* disclaimer in the documentation and/or other materials */
/* provided with the distribution. */
/* */
/* - Neither the name of IBM Corporation nor the names of its */
/* contributors may be used to endorse or promote products */
/* derived from this software without specific prior written */
/* permission. */
/* */
/* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND */
/* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, */
/* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF */
/* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */
/* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR */
/* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, */
/* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT */
/* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; */
/* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) */
/* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN */
/* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR */
/* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, */
/* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */
/* -------------------------------------------------------------- */
/* PROLOG END TAG zYx */
#ifndef __SIMD_MATH_H__
#define __SIMD_MATH_H__ 1
#ifdef __cplusplus
extern "C" {
#endif
#if !defined(__SPU__) && !defined(__ALTIVEC__)
#error Bad platform
#else
#define SM_E 2.7182818284590452354 /* e */
#define SM_LOG2E 1.4426950408889634074 /* log_2 e */
#define SM_LOG10E 0.43429448190325182765 /* log_10 e */
#define SM_LN2 0.69314718055994530942 /* log_e 2 */
#define SM_LN10 2.30258509299404568402 /* log_e 10 */
#define SM_PI 3.14159265358979323846 /* pi */
#define SM_PI_2 1.57079632679489661923 /* pi/2 */
#define SM_PI_4 0.78539816339744830962 /* pi/4 */
#define SM_1_PI 0.31830988618379067154 /* 1/pi */
#define SM_2_PI 0.63661977236758134308 /* 2/pi */
#define SM_2_SQRTPI 1.12837916709551257390 /* 2/sqrt(pi) */
#define SM_SQRT2 1.41421356237309504880 /* sqrt(2) */
#define SM_SQRT1_2 0.70710678118654752440 /* 1/sqrt(2) */
/* Typedefs common to both SPU and PPU */
typedef struct divi4_s {
vector signed int quot;
vector signed int rem;
} divi4_t;
typedef struct divu4_s {
vector unsigned int quot;
vector unsigned int rem;
} divu4_t;
/* Functions common to both SPU and PPU */
vector signed int absi4(vector signed int x);
vector float acosf4(vector float x);
vector float acoshf4(vector float x);
vector float asinf4(vector float x);
vector float asinhf4(vector float x);
vector float atanf4(vector float x);
vector float atanhf4(vector float x);
vector float atan2f4(vector float y, vector float x);
vector float cbrtf4(vector float x);
vector float ceilf4(vector float x);
vector float copysignf4(vector float x, vector float y);
vector float cosf4(vector float x);
vector float coshf4(vector float x);
vector float divf4(vector float x, vector float y);
vector float divf4_fast(vector float x, vector float y);
divi4_t divi4(vector signed int dividend, vector signed int divisor);
divu4_t divu4(vector unsigned int dividend, vector unsigned int divisor);
vector float erff4(vector float x);
vector float erfcf4(vector float x);
vector float exp2f4(vector float x);
vector float expf4(vector float x);
vector float expm1f4(vector float x);
vector float fabsf4(vector float value);
vector float fdimf4(vector float x, vector float y);
vector float floorf4(vector float value);
vector float fmaf4(vector float x, vector float y, vector float z);
vector float fmaxf4(vector float x, vector float y);
vector float fminf4(vector float x, vector float y);
vector float fmodf4(vector float x, vector float y);
vector signed int fpclassifyf4(vector float x);
vector float frexpf4(vector float x, vector signed int *pexp);
vector float hypotf4(vector float x, vector float y);
vector signed int ilogbf4(vector float x);
vector signed int irintf4(vector float x);
vector signed int iroundf4(vector float x);
vector unsigned int is0denormf4(vector float x);
vector unsigned int isequalf4(vector float x, vector float y);
vector unsigned int isfinitef4(vector float x);
vector unsigned int isgreaterf4(vector float x, vector float y);
vector unsigned int isgreaterequalf4(vector float x, vector float y);
vector unsigned int isinff4(vector float x);
vector unsigned int islessf4(vector float x, vector float y);
vector unsigned int islessequalf4(vector float x, vector float y);
vector unsigned int islessgreaterf4(vector float x, vector float y);
vector unsigned int isnanf4(vector float x);
vector unsigned int isnormalf4(vector float x);
vector unsigned int isunorderedf4(vector float x, vector float y);
vector float ldexpf4(vector float x, vector signed int exp);
vector float lgammaf4(vector float x);
vector float log10f4(vector float x);
vector float log1pf4(vector float x);
vector float log2f4(vector float x);
vector float logbf4(vector float x);
vector float logf4(vector float x);
vector float modff4(vector float x, vector float *pint);
vector float nearbyintf4(vector float x);
vector float negatef4(vector float x);
vector signed int negatei4(vector signed int x);
vector float nextafterf4(vector float x, vector float y);
vector float powf4(vector float x, vector float y);
vector float recipf4(vector float a);
vector float remainderf4(vector float x, vector float y);
vector float remquof4(vector float x, vector float y, vector signed int *quo);
vector float rintf4(vector float x);
vector float roundf4(vector float x);
vector float rsqrtf4(vector float value);
vector float scalbnf4(vector float x, vector signed int exp);
vector unsigned int signbitf4(vector float x);
void sincosf4(vector float x, vector float *sx, vector float *cx);
vector float sinf4(vector float x);
vector float sinhf4(vector float x);
vector float sqrtf4(vector float in);
vector float tanf4(vector float angle);
vector float tanhf4(vector float x);
vector float tgammaf4(vector float x);
vector float truncf4(vector float x);
#ifdef __SPU__
/* Typedefs specific to SPU */
typedef struct llroundf4_s {
vector signed long long vll[2];
} llroundf4_t;
typedef struct lldivi2_s {
vector signed long long quot;
vector signed long long rem;
} lldivi2_t;
typedef struct lldivu2_s {
vector unsigned long long quot;
vector unsigned long long rem;
} lldivu2_t;
/* Functions specific to SPU */
llroundf4_t llrintf4(vector float in);
llroundf4_t llroundf4 (vector float x);
vector double acosd2(vector double x);
vector double acoshd2(vector double x);
vector double asind2(vector double x);
vector double asinhd2(vector double x);
vector double atan2d2(vector double y, vector double x);
vector double atand2(vector double x);
vector double atanhd2(vector double x);
vector double cbrtd2(vector double x);
vector double ceild2(vector double x);
vector float ceilf4_fast(vector float x);
vector double copysignd2(vector double x, vector double y);
vector double cosd2(vector double x);
vector double coshd2(vector double x);
vector double divd2(vector double a, vector double b);
vector double erfcd2(vector double x);
vector double erfd2(vector double x);
vector double exp2d2(vector double x);
vector double expd2(vector double x);
vector double expm1d2(vector double x);
vector double fabsd2(vector double x);
vector double fdimd2(vector double x, vector double y);
vector double floord2(vector double x);
vector float floorf4_fast(vector float value);
vector double fmad2(vector double x, vector double y, vector double z);
vector double fmaxd2(vector double x, vector double y);
vector double fmind2(vector double x, vector double y);
vector double fmodd2(vector double x, vector double y);
vector float fmodf4_fast(vector float x, vector float y);
vector signed long long fpclassifyd2(vector double x);
vector double frexpd2(vector double x, vector signed long long *pexp);
vector double hypotd2(vector double x, vector double y);
vector signed long long ilogbd2(vector double x);
vector unsigned long long is0denormd2(vector double x);
vector unsigned long long isequald2(vector double x, vector double y);
vector unsigned long long isfinited2(vector double x);
vector unsigned long long isgreaterd2(vector double x, vector double y);
vector unsigned long long isgreaterequald2(vector double x, vector double y);
vector unsigned long long isinfd2(vector double x);
vector unsigned long long islessd2(vector double x, vector double y);
vector unsigned long long islessequald2(vector double x, vector double y);
vector unsigned long long islessgreaterd2(vector double x, vector double y);
vector unsigned long long isnand2(vector double x);
vector unsigned long long isnormald2(vector double x);
vector unsigned long long isunorderedd2(vector double x, vector double y);
vector double ldexpd2(vector double x, vector signed long long exp);
vector signed long long llabsi2(vector signed long long x);
lldivi2_t lldivi2(vector signed long long x, vector signed long long y);
lldivu2_t lldivu2(vector unsigned long long x, vector unsigned long long y);
vector double lgammad2(vector double x);
vector signed long long llrintd2(vector double in);
vector signed long long llroundd2(vector double x);
vector double log10d2(vector double x);
vector double log1pd2(vector double x);
vector double log2d2(vector double x);
vector double logbd2(vector double x);
vector double logd2(vector double x);
vector double modfd2(vector double x, vector double* pint);
vector double nearbyintd2(vector double x);
vector double negated2(vector double x);
vector double nextafterd2(vector double x, vector double y);
vector signed long long negatell2(vector signed long long x);
vector double powd2(vector double x, vector double y);
vector double recipd2(vector double value_d);
vector float recipf4_fast(vector float a);
vector double remainderd2(vector double x, vector double y);
vector double remquod2(vector double x, vector double y, vector signed long long *quo);
vector double rintd2(vector double x);
vector double roundd2(vector double x);
vector double rsqrtd2(vector double x);
vector double scalbllnd2(vector double x, vector signed long long n);
vector unsigned long long signbitd2(vector double x);
void sincosd2(vector double x, vector double *sx, vector double *cx);
vector double sind2(vector double x);
vector double sinhd2(vector double x);
vector double sqrtd2(vector double x);
vector float sqrtf4_fast(vector float in);
vector double tand2(vector double x);
vector double tanhd2(vector double x);
vector double tgammad2(vector double x);
vector double truncd2(vector double x);
#endif /* __SPU__ */
/* Functions specific to PPU */
#ifdef __ALTIVEC__
#endif
#endif /* __SPU__ || __ALTIVEC__ */
#ifdef __cplusplus
}
#endif
#endif /* __SIMD_MATH_H__ */
| {
"pile_set_name": "Github"
} |
Lets sing!
♫♪♬♩
Eat food
🍅🍕
| {
"pile_set_name": "Github"
} |
# New Rules
ESLint is all about rules. For most of the project's lifetime, we've had over 200 rules, and that list continues to grow. However, we can't just accept any proposed rule because all rules need to work cohesively together. As such, we have some guidelines around which rules can be part of the ESLint core and which are better off as custom rules and plugins.
**Note:** As of 2020, we only accept rules related to new ECMAScript features. We prefer that new rules be implemented in plugins.
## Core Rule Guidelines
In general, ESLint core rules must be:
1. **Widely applicable.** The rules we distribute need to be of importance to a large number of developers. Individual preferences for uncommon patterns are not supported.
1. **Generic.** Rules cannot be so specific that users will have trouble understanding when to use them. A rule is typically too specific if describing what it does requires more than two "and"s (if a and b and c and d, then this rule warns).
1. **Atomic.** Rules must function completely on their own. Rules are expressly forbidden from knowing about the state or presence of other rules.
1. **Unique.** No two rules can produce the same warning. Overlapping rules confuse end users and there is an expectation that core ESLint rules do not overlap.
1. **Library agnostic.** Rules must be based solely on JavaScript runtime environments and not on specific libraries or frameworks. For example, core rules shouldn't only apply if you're using jQuery but we may have some rules that apply only if you're using Node.js (a runtime).
1. **No conflicts.** No rule must directly conflict with another rule. For example, if we have a rule requiring semicolons, we cannot also have a rule disallowing semicolons (which is why we have one rule, `semi`, that does both).
Even though these are the formal criteria for inclusion, each rule is evaluated on its own basis.
## Proposing a Rule
If you want to propose a new rule, please see how to [create a pull request](/docs/developer-guide/contributing/pull-requests) or submit an issue by filling out a [new rule template](https://github.com/eslint/eslint/issues/new?template=NEW_RULE.md).
We need all of this information in order to determine whether or not the rule is a good core rule candidate.
## Accepting a Rule
In order for a rule to be accepted in the ESLint core, it must:
1. Fulfill all the criteria listed in the "Core Rule Guidelines" section
1. Have an ESLint team member champion inclusion of the rule
1. Be related to an ECMAScript feature that has reached stage 4 in the preceding 12 months
Keep in mind that we have over 200 rules, and that is daunting both for end users and the ESLint team (who has to maintain them). As such, any new rules must be deemed of high importance to be considered for inclusion in ESLint.
## Implementation is Your Responsibility
The ESLint team doesn't implement new rules that are suggested by users because we have a limited number of people and need to focus on the overall roadmap. Once a rule is accepted, you are responsible for implementing and documenting the rule. You may, alternately, recruit another person to help you implement the rule. The ESLint team member who championed the rule is your resource to help guide you through the rest of this process.
## Alternative: Creating Your Own Rules
Remember that ESLint is completely pluggable, which means you can create your own rules and distribute them using plugins. We did this on purpose because we don't want to be the gatekeepers for all possible rules. Even if we don't accept a rule into the core, that doesn't mean you can't have the exact rule that you want. See the [working with rules](../working-with-rules.md) and [working with plugins](../working-with-plugins.md) documentation for more information.
| {
"pile_set_name": "Github"
} |
/*
* linux/mm/oom_kill.c
*
* Copyright (C) 1998,2000 Rik van Riel
* Thanks go out to Claus Fischer for some serious inspiration and
* for goading me into coding this file...
* Copyright (C) 2010 Google, Inc.
* Rewritten by David Rientjes
*
* The routines in this file are used to kill a process when
* we're seriously out of memory. This gets called from __alloc_pages()
* in mm/page_alloc.c when we really run out of memory.
*
* Since we won't call these routines often (on a well-configured
* machine) this file will double as a 'coding guide' and a signpost
* for newbie kernel hackers. It features several pointers to major
* kernel subsystems and hints as to where to find out what things do.
*/
#include <linux/oom.h>
#include <linux/mm.h>
#include <linux/err.h>
#include <linux/gfp.h>
#include <linux/sched.h>
#include <linux/swap.h>
#include <linux/timex.h>
#include <linux/jiffies.h>
#include <linux/cpuset.h>
#include <linux/export.h>
#include <linux/notifier.h>
#include <linux/memcontrol.h>
#include <linux/mempolicy.h>
#include <linux/security.h>
#include <linux/ptrace.h>
#include <linux/freezer.h>
#include <linux/ftrace.h>
#include <linux/ratelimit.h>
#define CREATE_TRACE_POINTS
#include <trace/events/oom.h>
int sysctl_panic_on_oom;
int sysctl_oom_kill_allocating_task;
int sysctl_oom_dump_tasks = 1;
static DEFINE_SPINLOCK(zone_scan_lock);
#ifdef CONFIG_NUMA
/**
* has_intersects_mems_allowed() - check task eligiblity for kill
* @start: task struct of which task to consider
* @mask: nodemask passed to page allocator for mempolicy ooms
*
* Task eligibility is determined by whether or not a candidate task, @tsk,
* shares the same mempolicy nodes as current if it is bound by such a policy
* and whether or not it has the same set of allowed cpuset nodes.
*/
static bool has_intersects_mems_allowed(struct task_struct *start,
const nodemask_t *mask)
{
struct task_struct *tsk;
bool ret = false;
rcu_read_lock();
for_each_thread(start, tsk) {
if (mask) {
/*
* If this is a mempolicy constrained oom, tsk's
* cpuset is irrelevant. Only return true if its
* mempolicy intersects current, otherwise it may be
* needlessly killed.
*/
ret = mempolicy_nodemask_intersects(tsk, mask);
} else {
/*
* This is not a mempolicy constrained oom, so only
* check the mems of tsk's cpuset.
*/
ret = cpuset_mems_allowed_intersects(current, tsk);
}
if (ret)
break;
}
rcu_read_unlock();
return ret;
}
#else
static bool has_intersects_mems_allowed(struct task_struct *tsk,
const nodemask_t *mask)
{
return true;
}
#endif /* CONFIG_NUMA */
/*
* The process p may have detached its own ->mm while exiting or through
* use_mm(), but one or more of its subthreads may still have a valid
* pointer. Return p, or any of its subthreads with a valid ->mm, with
* task_lock() held.
*/
struct task_struct *find_lock_task_mm(struct task_struct *p)
{
struct task_struct *t;
rcu_read_lock();
for_each_thread(p, t) {
task_lock(t);
if (likely(t->mm))
goto found;
task_unlock(t);
}
t = NULL;
found:
rcu_read_unlock();
return t;
}
/* return true if the task is not adequate as candidate victim task. */
static bool oom_unkillable_task(struct task_struct *p,
const struct mem_cgroup *memcg, const nodemask_t *nodemask)
{
if (is_global_init(p))
return true;
if (p->flags & PF_KTHREAD)
return true;
/* When mem_cgroup_out_of_memory() and p is not member of the group */
if (memcg && !task_in_mem_cgroup(p, memcg))
return true;
/* p may not have freeable memory in nodemask */
if (!has_intersects_mems_allowed(p, nodemask))
return true;
return false;
}
/**
* oom_badness - heuristic function to determine which candidate task to kill
* @p: task struct of which task we should calculate
* @totalpages: total present RAM allowed for page allocation
*
* The heuristic for determining which task to kill is made to be as simple and
* predictable as possible. The goal is to return the highest value for the
* task consuming the most memory to avoid subsequent oom failures.
*/
unsigned long oom_badness(struct task_struct *p, struct mem_cgroup *memcg,
const nodemask_t *nodemask, unsigned long totalpages)
{
long points;
long adj;
if (oom_unkillable_task(p, memcg, nodemask))
return 0;
p = find_lock_task_mm(p);
if (!p)
return 0;
adj = (long)p->signal->oom_score_adj;
if (adj == OOM_SCORE_ADJ_MIN) {
task_unlock(p);
return 0;
}
/*
* The baseline for the badness score is the proportion of RAM that each
* task's rss, pagetable and swap space use.
*/
points = get_mm_rss(p->mm) + p->mm->nr_ptes +
get_mm_counter(p->mm, MM_SWAPENTS);
task_unlock(p);
/*
* Root processes get 3% bonus, just like the __vm_enough_memory()
* implementation used by LSMs.
*/
if (has_capability_noaudit(p, CAP_SYS_ADMIN))
points -= (points * 3) / 100;
/* Normalize to oom_score_adj units */
adj *= totalpages / 1000;
points += adj;
/*
* Never return 0 for an eligible task regardless of the root bonus and
* oom_score_adj (oom_score_adj can't be OOM_SCORE_ADJ_MIN here).
*/
return points > 0 ? points : 1;
}
/*
* Determine the type of allocation constraint.
*/
#ifdef CONFIG_NUMA
static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
gfp_t gfp_mask, nodemask_t *nodemask,
unsigned long *totalpages)
{
struct zone *zone;
struct zoneref *z;
enum zone_type high_zoneidx = gfp_zone(gfp_mask);
bool cpuset_limited = false;
int nid;
/* Default to all available memory */
*totalpages = totalram_pages + total_swap_pages;
if (!zonelist)
return CONSTRAINT_NONE;
/*
* Reach here only when __GFP_NOFAIL is used. So, we should avoid
* to kill current.We have to random task kill in this case.
* Hopefully, CONSTRAINT_THISNODE...but no way to handle it, now.
*/
if (gfp_mask & __GFP_THISNODE)
return CONSTRAINT_NONE;
/*
* This is not a __GFP_THISNODE allocation, so a truncated nodemask in
* the page allocator means a mempolicy is in effect. Cpuset policy
* is enforced in get_page_from_freelist().
*/
if (nodemask && !nodes_subset(node_states[N_MEMORY], *nodemask)) {
*totalpages = total_swap_pages;
for_each_node_mask(nid, *nodemask)
*totalpages += node_spanned_pages(nid);
return CONSTRAINT_MEMORY_POLICY;
}
/* Check this allocation failure is caused by cpuset's wall function */
for_each_zone_zonelist_nodemask(zone, z, zonelist,
high_zoneidx, nodemask)
if (!cpuset_zone_allowed_softwall(zone, gfp_mask))
cpuset_limited = true;
if (cpuset_limited) {
*totalpages = total_swap_pages;
for_each_node_mask(nid, cpuset_current_mems_allowed)
*totalpages += node_spanned_pages(nid);
return CONSTRAINT_CPUSET;
}
return CONSTRAINT_NONE;
}
#else
static enum oom_constraint constrained_alloc(struct zonelist *zonelist,
gfp_t gfp_mask, nodemask_t *nodemask,
unsigned long *totalpages)
{
*totalpages = totalram_pages + total_swap_pages;
return CONSTRAINT_NONE;
}
#endif
enum oom_scan_t oom_scan_process_thread(struct task_struct *task,
unsigned long totalpages, const nodemask_t *nodemask,
bool force_kill)
{
if (task->exit_state)
return OOM_SCAN_CONTINUE;
if (oom_unkillable_task(task, NULL, nodemask))
return OOM_SCAN_CONTINUE;
/*
* This task already has access to memory reserves and is being killed.
* Don't allow any other task to have access to the reserves.
*/
if (test_tsk_thread_flag(task, TIF_MEMDIE)) {
if (unlikely(frozen(task)))
__thaw_task(task);
if (!force_kill)
return OOM_SCAN_ABORT;
}
if (!task->mm)
return OOM_SCAN_CONTINUE;
/*
* If task is allocating a lot of memory and has been marked to be
* killed first if it triggers an oom, then select it.
*/
if (oom_task_origin(task))
return OOM_SCAN_SELECT;
if (task->flags & PF_EXITING && !force_kill) {
/*
* If this task is not being ptraced on exit, then wait for it
* to finish before killing some other task unnecessarily.
*/
if (!(task->group_leader->ptrace & PT_TRACE_EXIT))
return OOM_SCAN_ABORT;
}
return OOM_SCAN_OK;
}
/*
* Simple selection loop. We chose the process with the highest
* number of 'points'.
*
* (not docbooked, we don't want this one cluttering up the manual)
*/
static struct task_struct *select_bad_process(unsigned int *ppoints,
unsigned long totalpages, const nodemask_t *nodemask,
bool force_kill)
{
struct task_struct *g, *p;
struct task_struct *chosen = NULL;
unsigned long chosen_points = 0;
rcu_read_lock();
for_each_process_thread(g, p) {
unsigned int points;
switch (oom_scan_process_thread(p, totalpages, nodemask,
force_kill)) {
case OOM_SCAN_SELECT:
chosen = p;
chosen_points = ULONG_MAX;
/* fall through */
case OOM_SCAN_CONTINUE:
continue;
case OOM_SCAN_ABORT:
rcu_read_unlock();
return ERR_PTR(-1UL);
case OOM_SCAN_OK:
break;
};
points = oom_badness(p, NULL, nodemask, totalpages);
if (points > chosen_points) {
chosen = p;
chosen_points = points;
}
}
if (chosen)
get_task_struct(chosen);
rcu_read_unlock();
*ppoints = chosen_points * 1000 / totalpages;
return chosen;
}
/**
* dump_tasks - dump current memory state of all system tasks
* @memcg: current's memory controller, if constrained
* @nodemask: nodemask passed to page allocator for mempolicy ooms
*
* Dumps the current memory state of all eligible tasks. Tasks not in the same
* memcg, not in the same cpuset, or bound to a disjoint set of mempolicy nodes
* are not shown.
* State information includes task's pid, uid, tgid, vm size, rss, nr_ptes,
* swapents, oom_score_adj value, and name.
*/
static void dump_tasks(const struct mem_cgroup *memcg, const nodemask_t *nodemask)
{
struct task_struct *p;
struct task_struct *task;
pr_info("[ pid ] uid tgid total_vm rss nr_ptes swapents oom_score_adj name\n");
rcu_read_lock();
for_each_process(p) {
if (oom_unkillable_task(p, memcg, nodemask))
continue;
task = find_lock_task_mm(p);
if (!task) {
/*
* This is a kthread or all of p's threads have already
* detached their mm's. There's no need to report
* them; they can't be oom killed anyway.
*/
continue;
}
pr_info("[%5d] %5d %5d %8lu %8lu %7lu %8lu %5hd %s\n",
task->pid, from_kuid(&init_user_ns, task_uid(task)),
task->tgid, task->mm->total_vm, get_mm_rss(task->mm),
task->mm->nr_ptes,
get_mm_counter(task->mm, MM_SWAPENTS),
task->signal->oom_score_adj, task->comm);
task_unlock(task);
}
rcu_read_unlock();
}
static void dump_header(struct task_struct *p, gfp_t gfp_mask, int order,
struct mem_cgroup *memcg, const nodemask_t *nodemask)
{
task_lock(current);
pr_warning("%s invoked oom-killer: gfp_mask=0x%x, order=%d, "
"oom_score_adj=%hd\n",
current->comm, gfp_mask, order,
current->signal->oom_score_adj);
cpuset_print_task_mems_allowed(current);
task_unlock(current);
dump_stack();
if (memcg)
mem_cgroup_print_oom_info(memcg, p);
else
show_mem(SHOW_MEM_FILTER_NODES);
if (sysctl_oom_dump_tasks)
dump_tasks(memcg, nodemask);
}
/*
* Number of OOM killer invocations (including memcg OOM killer).
* Primarily used by PM freezer to check for potential races with
* OOM killed frozen task.
*/
static atomic_t oom_kills = ATOMIC_INIT(0);
int oom_kills_count(void)
{
return atomic_read(&oom_kills);
}
void note_oom_kill(void)
{
atomic_inc(&oom_kills);
}
#define K(x) ((x) << (PAGE_SHIFT-10))
/*
* Must be called while holding a reference to p, which will be released upon
* returning.
*/
void oom_kill_process(struct task_struct *p, gfp_t gfp_mask, int order,
unsigned int points, unsigned long totalpages,
struct mem_cgroup *memcg, nodemask_t *nodemask,
const char *message)
{
struct task_struct *victim = p;
struct task_struct *child;
struct task_struct *t;
struct mm_struct *mm;
unsigned int victim_points = 0;
static DEFINE_RATELIMIT_STATE(oom_rs, DEFAULT_RATELIMIT_INTERVAL,
DEFAULT_RATELIMIT_BURST);
/*
* If the task is already exiting, don't alarm the sysadmin or kill
* its children or threads, just set TIF_MEMDIE so it can die quickly
*/
if (p->flags & PF_EXITING) {
set_tsk_thread_flag(p, TIF_MEMDIE);
put_task_struct(p);
return;
}
if (__ratelimit(&oom_rs))
dump_header(p, gfp_mask, order, memcg, nodemask);
task_lock(p);
pr_err("%s: Kill process %d (%s) score %d or sacrifice child\n",
message, task_pid_nr(p), p->comm, points);
task_unlock(p);
/*
* If any of p's children has a different mm and is eligible for kill,
* the one with the highest oom_badness() score is sacrificed for its
* parent. This attempts to lose the minimal amount of work done while
* still freeing memory.
*/
read_lock(&tasklist_lock);
for_each_thread(p, t) {
list_for_each_entry(child, &t->children, sibling) {
unsigned int child_points;
if (child->mm == p->mm)
continue;
/*
* oom_badness() returns 0 if the thread is unkillable
*/
child_points = oom_badness(child, memcg, nodemask,
totalpages);
if (child_points > victim_points) {
put_task_struct(victim);
victim = child;
victim_points = child_points;
get_task_struct(victim);
}
}
}
read_unlock(&tasklist_lock);
p = find_lock_task_mm(victim);
if (!p) {
put_task_struct(victim);
return;
} else if (victim != p) {
get_task_struct(p);
put_task_struct(victim);
victim = p;
}
/* mm cannot safely be dereferenced after task_unlock(victim) */
mm = victim->mm;
pr_err("Killed process %d (%s) total-vm:%lukB, anon-rss:%lukB, file-rss:%lukB\n",
task_pid_nr(victim), victim->comm, K(victim->mm->total_vm),
K(get_mm_counter(victim->mm, MM_ANONPAGES)),
K(get_mm_counter(victim->mm, MM_FILEPAGES)));
task_unlock(victim);
/*
* Kill all user processes sharing victim->mm in other thread groups, if
* any. They don't get access to memory reserves, though, to avoid
* depletion of all memory. This prevents mm->mmap_sem livelock when an
* oom killed thread cannot exit because it requires the semaphore and
* its contended by another thread trying to allocate memory itself.
* That thread will now get access to memory reserves since it has a
* pending fatal signal.
*/
rcu_read_lock();
for_each_process(p)
if (p->mm == mm && !same_thread_group(p, victim) &&
!(p->flags & PF_KTHREAD)) {
if (p->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)
continue;
task_lock(p); /* Protect ->comm from prctl() */
pr_err("Kill process %d (%s) sharing same memory\n",
task_pid_nr(p), p->comm);
task_unlock(p);
do_send_sig_info(SIGKILL, SEND_SIG_FORCED, p, true);
}
rcu_read_unlock();
set_tsk_thread_flag(victim, TIF_MEMDIE);
do_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, true);
put_task_struct(victim);
}
#undef K
/*
* Determines whether the kernel must panic because of the panic_on_oom sysctl.
*/
void check_panic_on_oom(enum oom_constraint constraint, gfp_t gfp_mask,
int order, const nodemask_t *nodemask)
{
if (likely(!sysctl_panic_on_oom))
return;
if (sysctl_panic_on_oom != 2) {
/*
* panic_on_oom == 1 only affects CONSTRAINT_NONE, the kernel
* does not panic for cpuset, mempolicy, or memcg allocation
* failures.
*/
if (constraint != CONSTRAINT_NONE)
return;
}
dump_header(NULL, gfp_mask, order, NULL, nodemask);
panic("Out of memory: %s panic_on_oom is enabled\n",
sysctl_panic_on_oom == 2 ? "compulsory" : "system-wide");
}
static BLOCKING_NOTIFIER_HEAD(oom_notify_list);
int register_oom_notifier(struct notifier_block *nb)
{
return blocking_notifier_chain_register(&oom_notify_list, nb);
}
EXPORT_SYMBOL_GPL(register_oom_notifier);
int unregister_oom_notifier(struct notifier_block *nb)
{
return blocking_notifier_chain_unregister(&oom_notify_list, nb);
}
EXPORT_SYMBOL_GPL(unregister_oom_notifier);
/*
* Try to acquire the OOM killer lock for the zones in zonelist. Returns zero
* if a parallel OOM killing is already taking place that includes a zone in
* the zonelist. Otherwise, locks all zones in the zonelist and returns 1.
*/
int try_set_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask)
{
struct zoneref *z;
struct zone *zone;
int ret = 1;
spin_lock(&zone_scan_lock);
for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
if (zone_is_oom_locked(zone)) {
ret = 0;
goto out;
}
}
for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
/*
* Lock each zone in the zonelist under zone_scan_lock so a
* parallel invocation of try_set_zonelist_oom() doesn't succeed
* when it shouldn't.
*/
zone_set_flag(zone, ZONE_OOM_LOCKED);
}
out:
spin_unlock(&zone_scan_lock);
return ret;
}
/*
* Clears the ZONE_OOM_LOCKED flag for all zones in the zonelist so that failed
* allocation attempts with zonelists containing them may now recall the OOM
* killer, if necessary.
*/
void clear_zonelist_oom(struct zonelist *zonelist, gfp_t gfp_mask)
{
struct zoneref *z;
struct zone *zone;
spin_lock(&zone_scan_lock);
for_each_zone_zonelist(zone, z, zonelist, gfp_zone(gfp_mask)) {
zone_clear_flag(zone, ZONE_OOM_LOCKED);
}
spin_unlock(&zone_scan_lock);
}
/**
* out_of_memory - kill the "best" process when we run out of memory
* @zonelist: zonelist pointer
* @gfp_mask: memory allocation flags
* @order: amount of memory being requested as a power of 2
* @nodemask: nodemask passed to page allocator
* @force_kill: true if a task must be killed, even if others are exiting
*
* If we run out of memory, we have the choice between either
* killing a random task (bad), letting the system crash (worse)
* OR try to be smart about which process to kill. Note that we
* don't have to be perfect here, we just have to be good.
*/
void out_of_memory(struct zonelist *zonelist, gfp_t gfp_mask,
int order, nodemask_t *nodemask, bool force_kill)
{
const nodemask_t *mpol_mask;
struct task_struct *p;
unsigned long totalpages;
unsigned long freed = 0;
unsigned int uninitialized_var(points);
enum oom_constraint constraint = CONSTRAINT_NONE;
int killed = 0;
blocking_notifier_call_chain(&oom_notify_list, 0, &freed);
if (freed > 0)
/* Got some memory back in the last second. */
return;
/*
* If current has a pending SIGKILL or is exiting, then automatically
* select it. The goal is to allow it to allocate so that it may
* quickly exit and free its memory.
*/
if (fatal_signal_pending(current) || current->flags & PF_EXITING) {
set_thread_flag(TIF_MEMDIE);
return;
}
/*
* Check if there were limitations on the allocation (only relevant for
* NUMA) that may require different handling.
*/
constraint = constrained_alloc(zonelist, gfp_mask, nodemask,
&totalpages);
mpol_mask = (constraint == CONSTRAINT_MEMORY_POLICY) ? nodemask : NULL;
check_panic_on_oom(constraint, gfp_mask, order, mpol_mask);
if (sysctl_oom_kill_allocating_task && current->mm &&
!oom_unkillable_task(current, NULL, nodemask) &&
current->signal->oom_score_adj != OOM_SCORE_ADJ_MIN) {
get_task_struct(current);
oom_kill_process(current, gfp_mask, order, 0, totalpages, NULL,
nodemask,
"Out of memory (oom_kill_allocating_task)");
goto out;
}
p = select_bad_process(&points, totalpages, mpol_mask, force_kill);
/* Found nothing?!?! Either we hang forever, or we panic. */
if (!p) {
dump_header(NULL, gfp_mask, order, NULL, mpol_mask);
panic("Out of memory and no killable processes...\n");
}
if (PTR_ERR(p) != -1UL) {
oom_kill_process(p, gfp_mask, order, points, totalpages, NULL,
nodemask, "Out of memory");
killed = 1;
}
out:
/*
* Give the killed threads a good chance of exiting before trying to
* allocate memory again.
*/
if (killed)
schedule_timeout_killable(1);
}
/*
* The pagefault handler calls here because it is out of memory, so kill a
* memory-hogging task. If any populated zone has ZONE_OOM_LOCKED set, a
* parallel oom killing is already in progress so do nothing.
*/
void pagefault_out_of_memory(void)
{
struct zonelist *zonelist;
if (mem_cgroup_oom_synchronize(true))
return;
zonelist = node_zonelist(first_online_node, GFP_KERNEL);
if (try_set_zonelist_oom(zonelist, GFP_KERNEL)) {
out_of_memory(NULL, 0, 0, NULL, false);
clear_zonelist_oom(zonelist, GFP_KERNEL);
}
}
| {
"pile_set_name": "Github"
} |
//
// Generated by class-dump 3.5 (64 bit) (Debug version compiled Sep 17 2017 16:24:48).
//
// class-dump is Copyright (C) 1997-1998, 2000-2001, 2004-2015 by Steve Nygard.
//
#import <objc/NSObject.h>
@interface QBWupEncrypt : NSObject
{
}
+ (id)sharedInstance;
- (id)encryptAESKeyWithRSA1024:(id)arg1;
- (id)generateAESKey;
- (void)removeWupTokenInfo;
- (id)getWupTokenInfo;
- (void)saveWupToken:(id)arg1;
- (id)keyAppendToWupRequestUrl:(id)arg1;
- (id)generateEncryptKey:(_Bool)arg1;
@end
| {
"pile_set_name": "Github"
} |
var class_reddit_1_1_inputs_1_1_users_1_1_users_set_permissions_input =
[
[ "UsersSetPermissionsInput", "class_reddit_1_1_inputs_1_1_users_1_1_users_set_permissions_input.html#a1a93894f8e43a6b49dadc13dc2928411", null ],
[ "name", "class_reddit_1_1_inputs_1_1_users_1_1_users_set_permissions_input.html#af0fd48aa8c65f5e70e42735d6ea0d24e", null ],
[ "permissions", "class_reddit_1_1_inputs_1_1_users_1_1_users_set_permissions_input.html#a5d55fe0e01a3ad2411749cd5b3c5e5b0", null ],
[ "type", "class_reddit_1_1_inputs_1_1_users_1_1_users_set_permissions_input.html#ad8d3fe99c3d9fe789d74d1a8743d4f69", null ]
]; | {
"pile_set_name": "Github"
} |
var searchData=
[
['activesessionexists',['activeSessionExists',['../interface_flurry.html#a90a2dfc96d12fb3b7990e2ff1c6e0da6',1,'Flurry']]],
['add_3avalue_3a',['add:value:',['../interface_flurry_user_properties.html#a55829d6bb6782243677e6b3c003fef70',1,'FlurryUserProperties']]],
['add_3avalues_3a',['add:values:',['../interface_flurry_user_properties.html#a29968d89acac7cfdf482733cbc471c27',1,'FlurryUserProperties']]],
['addorigin_3awithversion_3a',['addOrigin:withVersion:',['../interface_flurry.html#a0f2942ac8a44a396632e6956fec8c156',1,'Flurry']]],
['addorigin_3awithversion_3awithparameters_3a',['addOrigin:withVersion:withParameters:',['../interface_flurry.html#accd44339c7290a25142caedfc56434e1',1,'Flurry']]],
['addsessionorigin_3a',['addSessionOrigin:',['../interface_flurry.html#aad2620b597022056601cce6e801b78be',1,'Flurry']]],
['addsessionorigin_3awithdeeplink_3a',['addSessionOrigin:withDeepLink:',['../interface_flurry.html#ab876cee5600f1a276c493dd6d4a7ba4b',1,'Flurry']]]
];
| {
"pile_set_name": "Github"
} |
var result = "";
o = { valueOf:function(){ throw "cow" } };
try {
String.fromCharCode(o);
} catch (e) {
result = e.toString();
}
assertEq(result, "cow");
| {
"pile_set_name": "Github"
} |
//
// NSString+RACSequenceAdditions.h
// ReactiveCocoa
//
// Created by Justin Spahr-Summers on 2012-10-29.
// Copyright (c) 2012 GitHub. All rights reserved.
//
#import <Foundation/Foundation.h>
@class RACSequence;
@interface NSString (RACSequenceAdditions)
/// Creates and returns a sequence containing strings corresponding to each
/// composed character sequence in the receiver.
///
/// Mutating the receiver will not affect the sequence after it's been created.
@property (nonatomic, copy, readonly) RACSequence *rac_sequence;
@end
| {
"pile_set_name": "Github"
} |
const fs = require('fs');
const path = require('path');
const validate = require('./helpers/validate');
const onHeadersListener = require('./helpers/on-headers-listener');
const socketIoInit = require('./helpers/socket-io-init');
// hapi.js plugin register function
const middlewareWrapper = (server, options) => {
const opts = validate(options);
// Setup Socket.IO
server.events.on('start', () => {
socketIoInit(server.listener, opts.spans);
});
server.route({
method: 'GET',
path: opts.path,
handler: () => {
const renderedHtml =
fs.readFileSync(path.join(__dirname, '/public/index.html'))
.toString()
.replace(/{{title}}/g, opts.title)
.replace(/{{script}}/g, fs.readFileSync(path.join(__dirname, '/public/javascripts/app.js')))
.replace(/{{style}}/g, fs.readFileSync(path.join(__dirname, '/public/stylesheets/style.css')));
return renderedHtml;
},
config: opts.routeConfig,
});
// Hook into the middle of processing
server.ext('onPreResponse', (request, h) => {
if (request.response.isBoom || request.path === opts.path) {
return h.continue;
}
const startTime = process.hrtime();
const resp = request.response;
resp.events.once('finish', () => {
onHeadersListener(resp.statusCode, startTime, opts.spans);
});
// Continue Processing
return h.continue;
});
};
module.exports = middlewareWrapper;
| {
"pile_set_name": "Github"
} |
from glob import glob
import os
pkgs = os.path.join(os.environ["ROOT"], "pkgs")
pkg_dir = glob(os.path.join(pkgs, "conda-build-test-ignore-prefix-files-1.0-0"))[0]
info_dir = os.path.join(pkg_dir, 'info')
assert os.path.isdir(info_dir)
assert not os.path.isfile(os.path.join(info_dir, "has_prefix"))
| {
"pile_set_name": "Github"
} |
#############################################################################
# Tables adapted from the Xotl FACTION ASSIGNMENT & RARITY TABLES #
# Original tables can be found here: #
# http://www.classicbattletech.com/forums/index.php/topic,1219.0.html #
# As noted in the original files, these are fan works and should not be #
# taken as official in any way. #
# #
# Adaptation performed by Deric Page (aka Netzilla on #
# http://www.classicbattletech.com/forums/) #
# If any discrepancies are found between these files and the original #
# Xotl tables, please contact me by PM on the forums or via email: #
# [email protected]. #
# #
# Notes on adaptation: #
# * The original Xotl tables use a d1,000 to randomly determine the unit. #
# For the adaptation I simply use the frequency of the entry as the #
# MegaMek RAT Weight value. So, a unit that appears on rolls 101-200 #
# receives a base Weight of 100. #
#############################################################################
Davion 3028 Medium Vehicles C
@Kurita 3028 Medium Vehicles C,25
@Liao 3028 Medium Vehicles C,25
Vedette Medium Tank (AC2),50
Vedette Medium Tank (Standard),450
Hetzer Wheeled Assault Gun (Laser),6
Goblin Medium Tank (MG),40
Goblin Medium Tank (Standard),120
Hetzer Wheeled Assault Gun (Standard),52
Condor Heavy Hover Tank (Davion),50
Hetzer Wheeled Assault Gun (SRM),6
Condor Heavy Hover Tank (Standard),20
Goblin Medium Tank (LRM),40
Hetzer Wheeled Assault Gun (LRM),6
Maxim Heavy Hover Transport (SRM4),8
Prowler Multi-Terrain Vehicle (Succession Wars),40
Maxim Heavy Hover Transport (SRM2),8
Maxim Heavy Hover Transport (Standard),54 | {
"pile_set_name": "Github"
} |
package metro
import "encoding/binary"
func rotate_right(v uint64, k uint) uint64 {
return (v >> k) | (v << (64 - k))
}
func Hash128(buffer []byte, seed uint64) (uint64, uint64) {
const (
k0 = 0xC83A91E1
k1 = 0x8648DBDB
k2 = 0x7BDEC03B
k3 = 0x2F5870A5
)
ptr := buffer
var v [4]uint64
v[0] = (seed - k0) * k3
v[1] = (seed + k1) * k2
if len(ptr) >= 32 {
v[2] = (seed + k0) * k2
v[3] = (seed - k1) * k3
for len(ptr) >= 32 {
v[0] += binary.LittleEndian.Uint64(ptr) * k0
ptr = ptr[8:]
v[0] = rotate_right(v[0], 29) + v[2]
v[1] += binary.LittleEndian.Uint64(ptr) * k1
ptr = ptr[8:]
v[1] = rotate_right(v[1], 29) + v[3]
v[2] += binary.LittleEndian.Uint64(ptr) * k2
ptr = ptr[8:]
v[2] = rotate_right(v[2], 29) + v[0]
v[3] += binary.LittleEndian.Uint64(ptr) * k3
ptr = ptr[8:]
v[3] = rotate_right(v[3], 29) + v[1]
}
v[2] ^= rotate_right(((v[0]+v[3])*k0)+v[1], 21) * k1
v[3] ^= rotate_right(((v[1]+v[2])*k1)+v[0], 21) * k0
v[0] ^= rotate_right(((v[0]+v[2])*k0)+v[3], 21) * k1
v[1] ^= rotate_right(((v[1]+v[3])*k1)+v[2], 21) * k0
}
if len(ptr) >= 16 {
v[0] += binary.LittleEndian.Uint64(ptr) * k2
ptr = ptr[8:]
v[0] = rotate_right(v[0], 33) * k3
v[1] += binary.LittleEndian.Uint64(ptr) * k2
ptr = ptr[8:]
v[1] = rotate_right(v[1], 33) * k3
v[0] ^= rotate_right((v[0]*k2)+v[1], 45) * k1
v[1] ^= rotate_right((v[1]*k3)+v[0], 45) * k0
}
if len(ptr) >= 8 {
v[0] += binary.LittleEndian.Uint64(ptr) * k2
ptr = ptr[8:]
v[0] = rotate_right(v[0], 33) * k3
v[0] ^= rotate_right((v[0]*k2)+v[1], 27) * k1
}
if len(ptr) >= 4 {
v[1] += uint64(binary.LittleEndian.Uint32(ptr)) * k2
ptr = ptr[4:]
v[1] = rotate_right(v[1], 33) * k3
v[1] ^= rotate_right((v[1]*k3)+v[0], 46) * k0
}
if len(ptr) >= 2 {
v[0] += uint64(binary.LittleEndian.Uint16(ptr)) * k2
ptr = ptr[2:]
v[0] = rotate_right(v[0], 33) * k3
v[0] ^= rotate_right((v[0]*k2)+v[1], 22) * k1
}
if len(ptr) >= 1 {
v[1] += uint64(ptr[0]) * k2
v[1] = rotate_right(v[1], 33) * k3
v[1] ^= rotate_right((v[1]*k3)+v[0], 58) * k0
}
v[0] += rotate_right((v[0]*k0)+v[1], 13)
v[1] += rotate_right((v[1]*k1)+v[0], 37)
v[0] += rotate_right((v[0]*k2)+v[1], 13)
v[1] += rotate_right((v[1]*k3)+v[0], 37)
return v[0], v[1]
}
| {
"pile_set_name": "Github"
} |
package mapstructure
import (
"errors"
"reflect"
"strconv"
"strings"
"time"
)
// typedDecodeHook takes a raw DecodeHookFunc (an interface{}) and turns
// it into the proper DecodeHookFunc type, such as DecodeHookFuncType.
func typedDecodeHook(h DecodeHookFunc) DecodeHookFunc {
// Create variables here so we can reference them with the reflect pkg
var f1 DecodeHookFuncType
var f2 DecodeHookFuncKind
// Fill in the variables into this interface and the rest is done
// automatically using the reflect package.
potential := []interface{}{f1, f2}
v := reflect.ValueOf(h)
vt := v.Type()
for _, raw := range potential {
pt := reflect.ValueOf(raw).Type()
if vt.ConvertibleTo(pt) {
return v.Convert(pt).Interface()
}
}
return nil
}
// DecodeHookExec executes the given decode hook. This should be used
// since it'll naturally degrade to the older backwards compatible DecodeHookFunc
// that took reflect.Kind instead of reflect.Type.
func DecodeHookExec(
raw DecodeHookFunc,
from reflect.Type, to reflect.Type,
data interface{}) (interface{}, error) {
// Build our arguments that reflect expects
argVals := make([]reflect.Value, 3)
argVals[0] = reflect.ValueOf(from)
argVals[1] = reflect.ValueOf(to)
argVals[2] = reflect.ValueOf(data)
switch f := typedDecodeHook(raw).(type) {
case DecodeHookFuncType:
return f(from, to, data)
case DecodeHookFuncKind:
return f(from.Kind(), to.Kind(), data)
default:
return nil, errors.New("invalid decode hook signature")
}
}
// ComposeDecodeHookFunc creates a single DecodeHookFunc that
// automatically composes multiple DecodeHookFuncs.
//
// The composed funcs are called in order, with the result of the
// previous transformation.
func ComposeDecodeHookFunc(fs ...DecodeHookFunc) DecodeHookFunc {
return func(
f reflect.Type,
t reflect.Type,
data interface{}) (interface{}, error) {
var err error
for _, f1 := range fs {
data, err = DecodeHookExec(f1, f, t, data)
if err != nil {
return nil, err
}
// Modify the from kind to be correct with the new data
f = nil
if val := reflect.ValueOf(data); val.IsValid() {
f = val.Type()
}
}
return data, nil
}
}
// StringToSliceHookFunc returns a DecodeHookFunc that converts
// string to []string by splitting on the given sep.
func StringToSliceHookFunc(sep string) DecodeHookFunc {
return func(
f reflect.Kind,
t reflect.Kind,
data interface{}) (interface{}, error) {
if f != reflect.String || t != reflect.Slice {
return data, nil
}
raw := data.(string)
if raw == "" {
return []string{}, nil
}
return strings.Split(raw, sep), nil
}
}
// StringToTimeDurationHookFunc returns a DecodeHookFunc that converts
// strings to time.Duration.
func StringToTimeDurationHookFunc() DecodeHookFunc {
return func(
f reflect.Type,
t reflect.Type,
data interface{}) (interface{}, error) {
if f.Kind() != reflect.String {
return data, nil
}
if t != reflect.TypeOf(time.Duration(5)) {
return data, nil
}
// Convert it by parsing
return time.ParseDuration(data.(string))
}
}
// WeaklyTypedHook is a DecodeHookFunc which adds support for weak typing to
// the decoder.
//
// Note that this is significantly different from the WeaklyTypedInput option
// of the DecoderConfig.
func WeaklyTypedHook(
f reflect.Kind,
t reflect.Kind,
data interface{}) (interface{}, error) {
dataVal := reflect.ValueOf(data)
switch t {
case reflect.String:
switch f {
case reflect.Bool:
if dataVal.Bool() {
return "1", nil
}
return "0", nil
case reflect.Float32:
return strconv.FormatFloat(dataVal.Float(), 'f', -1, 64), nil
case reflect.Int:
return strconv.FormatInt(dataVal.Int(), 10), nil
case reflect.Slice:
dataType := dataVal.Type()
elemKind := dataType.Elem().Kind()
if elemKind == reflect.Uint8 {
return string(dataVal.Interface().([]uint8)), nil
}
case reflect.Uint:
return strconv.FormatUint(dataVal.Uint(), 10), nil
}
}
return data, nil
}
| {
"pile_set_name": "Github"
} |
// TrafficMonitorDlg.h : 头文件
//
#pragma once
#pragma comment (lib, "iphlpapi.lib")
#include "NetworkInfoDlg.h"
#include "afxwin.h"
#include "StaticEx.h"
#include "Common.h"
#include "TaskBarDlg.h"
#include "SkinDlg.h"
#include "HistoryTrafficDlg.h"
#include "OptionsDlg.h"
#include "PictureStatic.h"
#include "IconSelectDlg.h"
#include "DrawCommon.h"
#include "IniHelper.h"
#include "LinkStatic.h"
#include "AdapterCommon.h"
#include "AboutDlg.h"
#include "CPUUsage.h"
#include "HistoryTrafficFile.h"
// CTrafficMonitorDlg 对话框
class CTrafficMonitorDlg : public CDialogEx
{
// 构造
public:
CTrafficMonitorDlg(CWnd* pParent = NULL); // 标准构造函数
~CTrafficMonitorDlg();
// 对话框数据
#ifdef AFX_DESIGN_TIME
enum { IDD = IDD_TRAFFICMONITOR_DIALOG };
#endif
protected:
virtual void DoDataExchange(CDataExchange* pDX); // DDX/DDV 支持
// 实现
protected:
HICON m_hIcon;
NOTIFYICONDATA m_ntIcon; //通知区域图标
CTaskBarDlg* m_tBarDlg; //任务栏窗口的指针
vector<NetWorkConection> m_connections; //保存获取到的要显示到“选择网卡”菜单项中的所有网络连接
MIB_IFTABLE* m_pIfTable;
DWORD m_dwSize{}; //m_pIfTable的大小
int m_connection_selected{ 0 }; //要显示流量的连接的序号
unsigned __int64 m_in_bytes; //当前已接收的字节数
unsigned __int64 m_out_bytes; //当前已发送的字节数
unsigned __int64 m_last_in_bytes{}; //上次已接收的字节数
unsigned __int64 m_last_out_bytes{}; //上次已发送的字节数
CCPUUsage m_cpu_usage;
bool m_first_start{ true }; //初始时为true，在定时器第一次启动后置为flase
CRect m_screen_rect; //屏幕的范围（不包含任务栏）
CSize m_screen_size; //屏幕的大小（包含任务栏）
LayoutData m_layout_data;
CImage m_back_img; //背景图片
CStaticEx m_disp_up; //显示上传的文本控件
CStaticEx m_disp_down; //显示下载的文本控件
CStaticEx m_disp_cpu; //显示CPU利用率的文本控件
CStaticEx m_disp_memory; //显示内存利用率的文本控件
CFont m_font; //字体
int m_restart_cnt{ -1 }; //重新初始化次数
unsigned int m_timer_cnt{}; //定时器触发次数（自程序启动以来的秒数）
unsigned int m_monitor_time_cnt{};
int m_zero_speed_cnt{}; //如果检测不到网速，该变量就会自加
int m_insert_to_taskbar_cnt{}; //用来统计尝试嵌入任务栏的次数
int m_cannot_intsert_to_task_bar_warning{ true }; //指示是否会在无法嵌入任务栏时弹出提示框
static unsigned int m_WM_TASKBARCREATED; //任务栏重启消息
vector<wstring> m_skins; //储存皮肤文件的路径
int m_skin_selected{}; //选择的皮肤序号
SYSTEMTIME m_start_time; //程序启动时的时间
CHistoryTrafficFile m_history_traffic{ theApp.m_history_traffic_path }; //储存历史流量
CToolTipCtrl m_tool_tips;
bool m_connection_change_flag{ false }; //如果执行过IniConnection()函数，该flag会置为true
bool m_is_foreground_fullscreen{ false }; //指示前台窗口是否正在全局显示
bool m_menu_popuped{ false }; //指示当前是否有菜单处于弹出状态
HDC m_desktop_dc;
void ShowInfo(); //将上传下载速度信息显示到窗口中
CString GetMouseTipsInfo(); //获取鼠标提示信息
void SetTransparency(); //根据m_transparency的值设置窗口透明度
void SetTransparency(int transparency);
void SetAlwaysOnTop(); //根据m_always_on_top的值设置窗口置顶
void SetMousePenetrate(); //根据m_mouse_penetrate的值设置是否鼠标穿透
void CheckWindowPos(); //测试窗口的位置，如窗口的位置在屏幕外，则移动窗口使其全部都在屏幕内，并返回新位置
void GetScreenSize(); //获取屏幕的大小
void AutoSelect(); //自动选择连接
void IniConnection(); //初始化连接
void IniConnectionMenu(CMenu* pMenu); //初始化“选择网络连接”菜单
void IniTaskBarConnectionMenu(); //初始化任务栏窗口的“选择网络连接”菜单
void SetConnectionMenuState(CMenu* pMenu); //设置“选择网络连接”菜单中选中的项目
void CloseTaskBarWnd(); //关闭任务栏窗口
void OpenTaskBarWnd(); //打开任务栏窗口
void AddNotifyIcon(); //添加通知区图标
void DeleteNotifyIcon();
void ShowNotifyTip(const wchar_t* title, const wchar_t* message); //显示通知区提示
void UpdateNotifyIconTip(); //更新通知区图标的鼠标提示
void SaveHistoryTraffic();
void LoadHistoryTraffic();
void BackupHistoryTrafficFile();
void _OnOptions(int tab); //打开“选项”对话框的处理，参数为打开时切换的标签
void SetItemPosition(); //设置显示的4个项目的位置
void GetSkinLayout(); //从当前皮肤获取布局数据
void LoadBackGroundImage();
void SetTextColor();
void SetTextFont();
bool IsTaskbarWndValid() const;
public:
void ApplySettings();
protected:
// 生成的消息映射函数
virtual BOOL OnInitDialog();
// afx_msg void OnPaint();
afx_msg HCURSOR OnQueryDragIcon();
DECLARE_MESSAGE_MAP()
public:
// afx_msg LRESULT OnNcHitTest(CPoint point);
afx_msg void OnTimer(UINT_PTR nIDEvent);
// afx_msg void OnRButtonDown(UINT nFlags, CPoint point);
afx_msg void OnRButtonUp(UINT nFlags, CPoint point);
afx_msg void OnLButtonDown(UINT nFlags, CPoint point);
afx_msg void OnNetworkInfo();
afx_msg void OnAlwaysOnTop();
afx_msg void OnUpdateAlwaysOnTop(CCmdUI *pCmdUI);
afx_msg void OnInitMenuPopup(CMenu* pPopupMenu, UINT nIndex, BOOL bSysMenu);
afx_msg void OnTransparency100();
afx_msg void OnTransparency80();
afx_msg void OnTransparency60();
afx_msg void OnTransparency40();
afx_msg void OnClose();
virtual BOOL OnCommand(WPARAM wParam, LPARAM lParam);
afx_msg void OnInitMenu(CMenu* pMenu);
virtual BOOL PreTranslateMessage(MSG* pMsg);
afx_msg void OnLockWindowPos();
afx_msg void OnUpdateLockWindowPos(CCmdUI *pCmdUI);
afx_msg void OnMove(int x, int y);
protected:
afx_msg LRESULT OnNotifyIcon(WPARAM wParam, LPARAM lParam);
public:
afx_msg void OnShowNotifyIcon();
afx_msg void OnUpdateShowNotifyIcon(CCmdUI *pCmdUI);
afx_msg void OnDestroy();
afx_msg void OnShowCpuMemory();
afx_msg void OnUpdateShowCpuMemory(CCmdUI *pCmdUI);
afx_msg void OnMousePenetrate();
afx_msg void OnUpdateMousePenetrate(CCmdUI *pCmdUI);
//afx_msg void OnTextColor();
afx_msg void OnShowTaskBarWnd();
afx_msg void OnUpdateShowTaskBarWnd(CCmdUI *pCmdUI);
afx_msg void OnAppAbout();
afx_msg void OnShowCpuMemory2();
// afx_msg void OnAutoRunWhenStart();
afx_msg void OnShowMainWnd();
afx_msg void OnUpdateShowMainWnd(CCmdUI *pCmdUI);
afx_msg void OnChangeSkin();
// afx_msg void OnUpdateAutoRunWhenStart(CCmdUI *pCmdUI);
afx_msg LRESULT OnTaskBarCreated(WPARAM wParam, LPARAM lParam);
//afx_msg void OnSetFont();
afx_msg void OnTrafficHistory();
afx_msg void OnMouseMove(UINT nFlags, CPoint point);
afx_msg void OnLButtonDblClk(UINT nFlags, CPoint point);
afx_msg void OnOptions();
afx_msg void OnOptions2();
protected:
afx_msg LRESULT OnExitmenuloop(WPARAM wParam, LPARAM lParam);
public:
afx_msg void OnChangeNotifyIcon();
afx_msg void OnAlowOutOfBorder();
afx_msg void OnUpdateAlowOutOfBorder(CCmdUI *pCmdUI);
afx_msg void OnCheckUpdate();
protected:
afx_msg LRESULT OnTaskbarMenuPopedUp(WPARAM wParam, LPARAM lParam);
public:
afx_msg void OnShowNetSpeed();
afx_msg BOOL OnQueryEndSession();
};
| {
"pile_set_name": "Github"
} |
# Copyright 2019 Google LLC
#
# 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
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# 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.
# NOTE: This file is auto generated by the elixir code generator program.
# Do not edit this file manually.
defmodule GoogleApi.AndroidEnterprise.V1.Model.TokenPagination do
@moduledoc """
Pagination information returned by a List operation when token pagination is enabled. List operations that supports paging return only one "page" of results. This protocol buffer message describes the page that has been returned. When using token pagination, clients should use the next/previous token to get another page of the result. The presence or absence of next/previous token indicates whether a next/previous page is available and provides a mean of accessing this page. ListRequest.page_token should be set to either next_page_token or previous_page_token to access another page.
## Attributes
* `nextPageToken` (*type:* `String.t`, *default:* `nil`) - Tokens to pass to the standard list field 'page_token'. Whenever available, tokens are preferred over manipulating start_index.
* `previousPageToken` (*type:* `String.t`, *default:* `nil`) -
"""
use GoogleApi.Gax.ModelBase
@type t :: %__MODULE__{
:nextPageToken => String.t(),
:previousPageToken => String.t()
}
field(:nextPageToken)
field(:previousPageToken)
end
defimpl Poison.Decoder, for: GoogleApi.AndroidEnterprise.V1.Model.TokenPagination do
def decode(value, options) do
GoogleApi.AndroidEnterprise.V1.Model.TokenPagination.decode(value, options)
end
end
defimpl Poison.Encoder, for: GoogleApi.AndroidEnterprise.V1.Model.TokenPagination do
def encode(value, options) do
GoogleApi.Gax.ModelBase.encode(value, options)
end
end
| {
"pile_set_name": "Github"
} |
// RUN: %clang_cc1 -triple=x86_64-apple-darwin10 -emit-llvm %s -o - |FileCheck %s
struct A {
A();
~A();
};
A a;
A as[2];
struct B {
B();
~B();
int f();
};
int i = B().f();
// CHECK: "__TEXT,__StaticInit,regular,pure_instructions" {
// CHECK: "__TEXT,__StaticInit,regular,pure_instructions" {
// CHECK: "__TEXT,__StaticInit,regular,pure_instructions" {
// CHECK: "__TEXT,__StaticInit,regular,pure_instructions" {
// CHECK: "__TEXT,__StaticInit,regular,pure_instructions" {
| {
"pile_set_name": "Github"
} |
#pragma once
#include <iostream>
// #include "fmt/format.h"
class Object {
public:
///width of the object
int width;
/// heigh of the object
int heigh;
/// depth of the object
int depth;
private:
int surface;
int volume;
public:
void setSurface( int a, int b );
void setVolume( int a, int b, int c );
int getSurface();
int getVolume();
};
| {
"pile_set_name": "Github"
} |
// Copyright Aleksey Gurtovoy 2000-2004
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// Preprocessed version of "boost/mpl/not_equal_to.hpp" header
// -- DO NOT modify by hand!
namespace boost { namespace mpl {
template<
typename Tag1
, typename Tag2
, BOOST_MPL_AUX_NTTP_DECL(int, tag1_) = BOOST_MPL_AUX_MSVC_VALUE_WKND(Tag1)::value
, BOOST_MPL_AUX_NTTP_DECL(int, tag2_) = BOOST_MPL_AUX_MSVC_VALUE_WKND(Tag2)::value
>
struct not_equal_to_impl
: if_c<
( tag1_ > tag2_ )
, aux::cast2nd_impl< not_equal_to_impl< Tag1,Tag1 >,Tag1, Tag2 >
, aux::cast1st_impl< not_equal_to_impl< Tag2,Tag2 >,Tag1, Tag2 >
>::type
{
};
/// for Digital Mars C++/compilers with no CTPS/TTP support
template<> struct not_equal_to_impl< na,na >
{
template< typename U1, typename U2 > struct apply
{
typedef apply type;
BOOST_STATIC_CONSTANT(int, value = 0);
};
};
template<> struct not_equal_to_impl< na,integral_c_tag >
{
template< typename U1, typename U2 > struct apply
{
typedef apply type;
BOOST_STATIC_CONSTANT(int, value = 0);
};
};
template<> struct not_equal_to_impl< integral_c_tag,na >
{
template< typename U1, typename U2 > struct apply
{
typedef apply type;
BOOST_STATIC_CONSTANT(int, value = 0);
};
};
template< typename T > struct not_equal_to_tag
{
typedef typename T::tag type;
};
template<
typename BOOST_MPL_AUX_NA_PARAM(N1)
, typename BOOST_MPL_AUX_NA_PARAM(N2)
>
struct not_equal_to
: aux::msvc_eti_base< typename apply_wrap2<
not_equal_to_impl<
typename not_equal_to_tag<N1>::type
, typename not_equal_to_tag<N2>::type
>
, N1
, N2
>::type >::type
{
BOOST_MPL_AUX_LAMBDA_SUPPORT(2, not_equal_to, (N1, N2))
};
BOOST_MPL_AUX_NA_SPEC2(2, 2, not_equal_to)
}}
namespace boost { namespace mpl {
template<>
struct not_equal_to_impl< integral_c_tag,integral_c_tag >
{
template< typename N1, typename N2 > struct apply
{
BOOST_STATIC_CONSTANT(bool, value =
( BOOST_MPL_AUX_VALUE_WKND(N1)::value !=
BOOST_MPL_AUX_VALUE_WKND(N2)::value )
);
typedef bool_<value> type;
};
};
}}
| {
"pile_set_name": "Github"
} |
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#import <Cocoa/Cocoa.h>
#include "apps/app_window_registry.h"
#include "base/command_line.h"
#include "base/mac/scoped_nsobject.h"
#include "base/prefs/pref_service.h"
#include "chrome/app/chrome_command_ids.h"
#import "chrome/browser/app_controller_mac.h"
#include "chrome/browser/apps/app_browsertest_util.h"
#include "chrome/browser/browser_process.h"
#include "chrome/browser/extensions/extension_test_message_listener.h"
#include "chrome/browser/profiles/profile_manager.h"
#include "chrome/browser/ui/browser.h"
#include "chrome/browser/ui/browser_list.h"
#include "chrome/browser/ui/browser_window.h"
#import "chrome/browser/ui/cocoa/user_manager_mac.h"
#include "chrome/browser/ui/host_desktop.h"
#include "chrome/browser/ui/tabs/tab_strip_model.h"
#include "chrome/common/chrome_constants.h"
#include "chrome/common/chrome_switches.h"
#include "chrome/common/pref_names.h"
#include "chrome/test/base/in_process_browser_test.h"
#include "chrome/test/base/ui_test_utils.h"
#include "content/public/browser/web_contents.h"
#include "extensions/common/extension.h"
namespace {
class AppControllerPlatformAppBrowserTest
: public extensions::PlatformAppBrowserTest {
protected:
AppControllerPlatformAppBrowserTest()
: active_browser_list_(BrowserList::GetInstance(
chrome::GetActiveDesktop())) {
}
virtual void SetUpCommandLine(CommandLine* command_line) OVERRIDE {
PlatformAppBrowserTest::SetUpCommandLine(command_line);
command_line->AppendSwitchASCII(switches::kAppId,
"1234");
}
const BrowserList* active_browser_list_;
};
// Test that if only a platform app window is open and no browser windows are
// open then a reopen event does nothing.
IN_PROC_BROWSER_TEST_F(AppControllerPlatformAppBrowserTest,
PlatformAppReopenWithWindows) {
base::scoped_nsobject<AppController> ac([[AppController alloc] init]);
NSUInteger old_window_count = [[NSApp windows] count];
EXPECT_EQ(1u, active_browser_list_->size());
[ac applicationShouldHandleReopen:NSApp hasVisibleWindows:YES];
// We do not EXPECT_TRUE the result here because the method
// deminiaturizes windows manually rather than return YES and have
// AppKit do it.
EXPECT_EQ(old_window_count, [[NSApp windows] count]);
EXPECT_EQ(1u, active_browser_list_->size());
}
IN_PROC_BROWSER_TEST_F(AppControllerPlatformAppBrowserTest,
ActivationFocusesBrowserWindow) {
base::scoped_nsobject<AppController> app_controller(
[[AppController alloc] init]);
ExtensionTestMessageListener listener("Launched", false);
const extensions::Extension* app =
InstallAndLaunchPlatformApp("minimal");
ASSERT_TRUE(listener.WaitUntilSatisfied());
NSWindow* app_window = apps::AppWindowRegistry::Get(profile())
->GetAppWindowsForApp(app->id())
.front()
->GetNativeWindow();
NSWindow* browser_window = browser()->window()->GetNativeWindow();
EXPECT_LE([[NSApp orderedWindows] indexOfObject:app_window],
[[NSApp orderedWindows] indexOfObject:browser_window]);
[app_controller applicationShouldHandleReopen:NSApp
hasVisibleWindows:YES];
EXPECT_LE([[NSApp orderedWindows] indexOfObject:browser_window],
[[NSApp orderedWindows] indexOfObject:app_window]);
}
class AppControllerWebAppBrowserTest : public InProcessBrowserTest {
protected:
AppControllerWebAppBrowserTest()
: active_browser_list_(BrowserList::GetInstance(
chrome::GetActiveDesktop())) {
}
virtual void SetUpCommandLine(CommandLine* command_line) OVERRIDE {
command_line->AppendSwitchASCII(switches::kApp, GetAppURL());
}
std::string GetAppURL() const {
return "http://example.com/";
}
const BrowserList* active_browser_list_;
};
// Test that in web app mode a reopen event opens the app URL.
IN_PROC_BROWSER_TEST_F(AppControllerWebAppBrowserTest,
WebAppReopenWithNoWindows) {
base::scoped_nsobject<AppController> ac([[AppController alloc] init]);
EXPECT_EQ(1u, active_browser_list_->size());
BOOL result = [ac applicationShouldHandleReopen:NSApp hasVisibleWindows:NO];
EXPECT_FALSE(result);
EXPECT_EQ(2u, active_browser_list_->size());
Browser* browser = active_browser_list_->get(0);
GURL current_url =
browser->tab_strip_model()->GetActiveWebContents()->GetURL();
EXPECT_EQ(GetAppURL(), current_url.spec());
}
// Called when the ProfileManager has created a profile.
void CreateProfileCallback(const base::Closure& quit_closure,
Profile* profile,
Profile::CreateStatus status) {
EXPECT_TRUE(profile);
EXPECT_NE(Profile::CREATE_STATUS_LOCAL_FAIL, status);
EXPECT_NE(Profile::CREATE_STATUS_REMOTE_FAIL, status);
// This will be called multiple times. Wait until the profile is initialized
// fully to quit the loop.
if (status == Profile::CREATE_STATUS_INITIALIZED)
quit_closure.Run();
}
void CreateAndWaitForGuestProfile() {
ProfileManager::CreateCallback create_callback =
base::Bind(&CreateProfileCallback,
base::MessageLoop::current()->QuitClosure());
g_browser_process->profile_manager()->CreateProfileAsync(
ProfileManager::GetGuestProfilePath(),
create_callback,
base::string16(),
base::string16(),
std::string());
base::RunLoop().Run();
}
class AppControllerNewProfileManagementBrowserTest
: public InProcessBrowserTest {
protected:
AppControllerNewProfileManagementBrowserTest()
: active_browser_list_(BrowserList::GetInstance(
chrome::GetActiveDesktop())) {
}
virtual void SetUpCommandLine(CommandLine* command_line) OVERRIDE {
command_line->AppendSwitch(switches::kNewProfileManagement);
}
const BrowserList* active_browser_list_;
};
// Test that for a regular last profile, a reopen event opens a browser.
IN_PROC_BROWSER_TEST_F(AppControllerNewProfileManagementBrowserTest,
RegularProfileReopenWithNoWindows) {
base::scoped_nsobject<AppController> ac([[AppController alloc] init]);
EXPECT_EQ(1u, active_browser_list_->size());
BOOL result = [ac applicationShouldHandleReopen:NSApp hasVisibleWindows:NO];
EXPECT_FALSE(result);
EXPECT_EQ(2u, active_browser_list_->size());
EXPECT_FALSE(UserManagerMac::IsShowing());
}
// Test that for a locked last profile, a reopen event opens the User Manager.
IN_PROC_BROWSER_TEST_F(AppControllerNewProfileManagementBrowserTest,
LockedProfileReopenWithNoWindows) {
// The User Manager uses the guest profile as its underlying profile. To
// minimize flakiness due to the scheduling/descheduling of tasks on the
// different threads, pre-initialize the guest profile before it is needed.
CreateAndWaitForGuestProfile();
base::scoped_nsobject<AppController> ac([[AppController alloc] init]);
// Lock the active profile.
Profile* profile = [ac lastProfile];
ProfileInfoCache& cache =
g_browser_process->profile_manager()->GetProfileInfoCache();
size_t profile_index = cache.GetIndexOfProfileWithPath(profile->GetPath());
cache.SetProfileSigninRequiredAtIndex(profile_index, true);
EXPECT_TRUE(cache.ProfileIsSigninRequiredAtIndex(profile_index));
EXPECT_EQ(1u, active_browser_list_->size());
BOOL result = [ac applicationShouldHandleReopen:NSApp hasVisibleWindows:NO];
EXPECT_FALSE(result);
base::RunLoop().RunUntilIdle();
EXPECT_EQ(1u, active_browser_list_->size());
EXPECT_TRUE(UserManagerMac::IsShowing());
UserManagerMac::Hide();
}
// Test that for a guest last profile, a reopen event opens the User Manager.
IN_PROC_BROWSER_TEST_F(AppControllerNewProfileManagementBrowserTest,
GuestProfileReopenWithNoWindows) {
// Create the guest profile, and set it as the last used profile so the
// app controller can use it on init.
CreateAndWaitForGuestProfile();
PrefService* local_state = g_browser_process->local_state();
local_state->SetString(prefs::kProfileLastUsed, chrome::kGuestProfileDir);
base::scoped_nsobject<AppController> ac([[AppController alloc] init]);
Profile* profile = [ac lastProfile];
EXPECT_EQ(ProfileManager::GetGuestProfilePath(), profile->GetPath());
EXPECT_TRUE(profile->IsGuestSession());
EXPECT_EQ(1u, active_browser_list_->size());
BOOL result = [ac applicationShouldHandleReopen:NSApp hasVisibleWindows:NO];
EXPECT_FALSE(result);
base::RunLoop().RunUntilIdle();
EXPECT_EQ(1u, active_browser_list_->size());
EXPECT_TRUE(UserManagerMac::IsShowing());
UserManagerMac::Hide();
}
} // namespace
| {
"pile_set_name": "Github"
} |
enum GFLoaderType {
android,
ios,
square,
circle,
custom,
}
| {
"pile_set_name": "Github"
} |
// Copyright (C) 2017 Google Inc.
//
// 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
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// 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.
package resolve
import (
"context"
"fmt"
"reflect"
"sync"
"github.com/google/gapid/core/data/dictionary"
"github.com/google/gapid/core/data/id"
"github.com/google/gapid/core/math/u64"
"github.com/google/gapid/gapis/api"
"github.com/google/gapid/gapis/database"
"github.com/google/gapid/gapis/memory"
"github.com/google/gapid/gapis/service"
"github.com/google/gapid/gapis/service/box"
"github.com/google/gapid/gapis/service/path"
)
// StateTree resolves the specified state tree path.
func StateTree(ctx context.Context, c *path.StateTree, r *path.ResolveConfig) (*service.StateTree, error) {
id, err := database.Store(ctx, &StateTreeResolvable{
Path: c.State,
ArrayGroupSize: c.ArrayGroupSize,
Config: r,
})
if err != nil {
return nil, err
}
return &service.StateTree{
Root: &path.StateTreeNode{Tree: path.NewID(id)},
}, nil
}
type stateTree struct {
globalState *api.GlobalState
state interface{}
root *stn
api *path.API
groupLimit uint64
}
// needsSubgrouping returns true if the child count exceeds the group limit and
// grouping is desired (groupLimit > 0).
func needsSubgrouping(groupLimit, childCount uint64) bool {
return groupLimit > 0 && childCount > groupLimit
}
// subgroupSize returns the maximum number of entries in each subgroup.
func subgroupSize(groupLimit, childCount uint64) uint64 {
if !needsSubgrouping(groupLimit, childCount) {
return 1
}
groupSize := uint64(1)
for (childCount+groupSize-1)/groupSize > groupLimit {
groupSize *= groupLimit
}
return groupSize
}
// subgroupCount returns the number of immediate children for a given group,
// taking into consideration group limits.
func subgroupCount(groupLimit, childCount uint64) uint64 {
groupSize := subgroupSize(groupLimit, childCount)
return (childCount + groupSize - 1) / groupSize
}
// subgroupRange returns the start and end indices (s, e) for the i'th immediate
// child for the given group. e is one greater than the last index in the
// subgroup.
func subgroupRange(groupLimit, childCount, i uint64) (s, e uint64) {
groupSize := subgroupSize(groupLimit, childCount)
s = i * groupSize
e = u64.Min(s+groupSize, childCount)
return s, e
}
func deref(v reflect.Value) reflect.Value {
for (v.Kind() == reflect.Ptr || v.Kind() == reflect.Interface) && !v.IsNil() {
v = v.Elem()
}
return v
}
// StateTreeNode resolves the specified command tree node path.
func StateTreeNode(ctx context.Context, p *path.StateTreeNode, r *path.ResolveConfig) (*service.StateTreeNode, error) {
boxed, err := database.Resolve(ctx, p.Tree.ID())
if err != nil {
return nil, err
}
return stateTreeNode(ctx, boxed.(*stateTree), p)
}
// StateTreeNodeForPath returns the path to the StateTreeNode representing the
// path p.
func StateTreeNodeForPath(ctx context.Context, p *path.StateTreeNodeForPath, r *path.ResolveConfig) (*path.StateTreeNode, error) {
boxed, err := database.Resolve(ctx, p.Tree.ID())
if err != nil {
return nil, err
}
indices, err := stateTreeNodePath(ctx, boxed.(*stateTree), p.Member.Node())
if err != nil {
return nil, err
}
return &path.StateTreeNode{
Tree: p.Tree,
Indices: indices,
}, nil
}
func stateTreeNode(ctx context.Context, tree *stateTree, p *path.StateTreeNode) (*service.StateTreeNode, error) {
node := tree.root
for i, idx64 := range p.Indices {
var err error
node, err = node.index(ctx, idx64, tree)
switch err := err.(type) {
case nil:
case errIndexOOB:
at := &path.StateTreeNode{Tree: p.Tree, Indices: p.Indices[:i+1]}
return nil, errPathOOB(err.idx, "Index", 0, err.count-1, at)
default:
return nil, err
}
}
return node.service(ctx, tree), nil
}
func stateTreeNodePath(ctx context.Context, tree *stateTree, p path.Node) ([]uint64, error) {
n := tree.root
indices := []uint64{}
for {
ci := n.findByPath(ctx, p, tree)
if ci == nil {
break
}
for _, i := range ci {
n, indices = n.children[i], append(indices, i)
}
}
return indices, nil
}
type errIndexOOB struct {
idx, count uint64
}
func (e errIndexOOB) Error() string { return fmt.Sprintf("index %d out of bounds", e.idx) }
type stn struct {
mutex sync.Mutex
name string
value reflect.Value
path path.Node
consts *path.ConstantSet
children []*stn
isSubgroup bool
subgroupOffset uint64
}
func (n *stn) index(ctx context.Context, i uint64, tree *stateTree) (*stn, error) {
n.buildChildren(ctx, tree)
if count := uint64(len(n.children)); i >= count {
return nil, errIndexOOB{i, count}
}
return n.children[i], nil
}
func (n *stn) findByPath(ctx context.Context, p path.Node, tree *stateTree) []uint64 {
n.buildChildren(ctx, tree)
for i, c := range n.children {
if path.HasRoot(p, c.path) {
return []uint64{uint64(i)}
}
}
for i, c := range n.children {
if c.isSubgroup {
if ci := c.findByPath(ctx, p, tree); ci != nil {
return append([]uint64{uint64(i)}, ci...)
}
}
}
return nil
}
func (n *stn) buildChildren(ctx context.Context, tree *stateTree) {
n.mutex.Lock()
defer n.mutex.Unlock()
if n.children != nil {
return
}
v, t, children := n.value, n.value.Type(), []*stn{}
dict := dictionary.From(v.Interface())
switch {
case dict != nil:
for _, key := range dict.Keys() {
children = append(children, &stn{
name: fmt.Sprint(key),
value: deref(reflect.ValueOf(dict.Get(key))),
path: path.NewMapIndex(key, n.path),
})
}
case box.IsMemorySlice(t):
slice := box.AsMemorySlice(v)
count := slice.Count()
if needsSubgrouping(tree.groupLimit, count) {
for i, c := uint64(0), subgroupCount(tree.groupLimit, count); i < c; i++ {
s, e := subgroupRange(tree.groupLimit, count, i)
children = append(children, &stn{
name: fmt.Sprintf("[%d - %d]", n.subgroupOffset+s, n.subgroupOffset+e-1),
value: reflect.ValueOf(slice.ISlice(s, e)),
path: path.NewSlice(s, e-1, n.path),
isSubgroup: true,
subgroupOffset: n.subgroupOffset + s,
})
}
} else {
slice := slice.ISlice(0, count)
els, err := memory.LoadSlice(ctx, slice, tree.globalState.Memory, tree.globalState.MemoryLayout)
if err != nil {
panic(err)
}
arr := reflect.ValueOf(els)
for i := uint64(0); i < count; i++ {
el := arr.Index(int(i))
children = append(children, &stn{
name: fmt.Sprint(n.subgroupOffset + i),
value: el,
path: path.NewArrayIndex(i, n.path),
})
}
}
default:
switch v.Kind() {
case reflect.Slice, reflect.Array:
size := uint64(v.Len())
if needsSubgrouping(tree.groupLimit, size) {
for i, c := uint64(0), subgroupCount(tree.groupLimit, size); i < c; i++ {
s, e := subgroupRange(tree.groupLimit, size, i)
children = append(children, &stn{
name: fmt.Sprintf("[%d - %d]", n.subgroupOffset+s, n.subgroupOffset+e-1),
value: v.Slice(int(s), int(e)),
path: path.NewSlice(s, e-1, n.path),
isSubgroup: true,
subgroupOffset: n.subgroupOffset + s,
})
}
} else {
for i := uint64(0); i < size; i++ {
children = append(children, &stn{
name: fmt.Sprint(n.subgroupOffset + i),
value: deref(v.Index(int(i))),
path: path.NewArrayIndex(i, n.path),
})
}
}
default:
if isNil(v) {
break
}
pp, ok := v.Interface().(api.PropertyProvider)
if !ok {
break
}
for _, p := range pp.Properties() {
var consts *path.ConstantSet
if p.Constants >= 0 {
consts = tree.api.ConstantSet(p.Constants)
}
children = append(children, &stn{
name: p.Name,
value: deref(reflect.ValueOf(p.Get())),
path: path.NewField(p.Name, n.path),
consts: consts,
})
}
}
}
n.children = children
}
// isNil returns true if v is a nil pointer or interface, or is a type that
// implements the method:
// IsNil() bool
// which returns true when called.
func isNil(v reflect.Value) bool {
if (v.Kind() == reflect.Ptr || v.Kind() == reflect.Interface) && v.IsNil() {
return true
}
if i, ok := v.Interface().(interface {
IsNil() bool
}); ok {
return i.IsNil()
}
return false
}
func (n *stn) service(ctx context.Context, tree *stateTree) *service.StateTreeNode {
n.buildChildren(ctx, tree)
preview, previewIsValue := stateValuePreview(n.value)
return &service.StateTreeNode{
NumChildren: uint64(len(n.children)),
Name: n.name,
ValuePath: n.path.Path(),
Preview: preview,
PreviewIsValue: previewIsValue,
Constants: n.consts,
}
}
func isFieldVisible(f reflect.StructField) bool {
return f.PkgPath == "" && f.Tag.Get("hidden") != "true"
}
func stateValuePreview(v reflect.Value) (*box.Value, bool) {
t := v.Type()
switch {
case box.IsMemoryPointer(t), box.IsMemorySlice(t):
return box.NewValue(v.Interface()), true
}
switch v.Kind() {
case reflect.Bool,
reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64,
reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64,
reflect.Float32, reflect.Float64:
return box.NewValue(v.Interface()), true
case reflect.Array, reflect.Slice:
const maxLen = 4
if v.Len() > maxLen {
return box.NewValue(v.Slice(0, maxLen).Interface()), false
}
return box.NewValue(v.Interface()), true
case reflect.String:
const maxLen = 64
runes := []rune(v.Interface().(string))
if len(runes) > maxLen {
return box.NewValue(string(append(runes[:maxLen-1], '…'))), false
}
return box.NewValue(v.Interface()), true
case reflect.Interface, reflect.Ptr:
if isNil(v) {
return box.NewValue(v.Interface()), true
}
return stateValuePreview(v.Elem())
default:
return nil, false
}
}
// Resolve builds and returns a *StateTree for the path.StateTreeNode.
// Resolve implements the database.Resolver interface.
func (r *StateTreeResolvable) Resolve(ctx context.Context) (interface{}, error) {
globalState, err := GlobalState(ctx, r.Path.After.GlobalStateAfter(), r.Config)
if err != nil {
return nil, err
}
rootObj, rootPath, apiID, err := state(ctx, r.Path, r.Config)
if err != nil {
return nil, err
}
apiPath := &path.API{ID: path.NewID(id.ID(apiID))}
root := &stn{
name: "root",
value: deref(reflect.ValueOf(rootObj)),
path: rootPath,
}
return &stateTree{globalState, rootObj, root, apiPath, uint64(r.ArrayGroupSize)}, nil
}
| {
"pile_set_name": "Github"
} |
package com.direwolf20.buildinggadgets.common.containers;
import net.minecraft.entity.player.PlayerInventory;
import net.minecraft.inventory.container.Container;
import net.minecraft.inventory.container.ContainerType;
import net.minecraft.inventory.container.Slot;
import javax.annotation.Nullable;
public abstract class BaseContainer extends Container {
public BaseContainer(@Nullable ContainerType<?> p_i50105_1_, int p_i50105_2_) {
super(p_i50105_1_, p_i50105_2_);
}
protected void addPlayerSlots(PlayerInventory playerInventory, int inX, int inY) {
// Slots for the hotbar
for (int row = 0; row < 9; ++ row) {
int x = inX + row * 18;
int y = inY + 86;
addSlot(new Slot(playerInventory, row, x, y));
}
// Slots for the main inventory
for (int row = 1; row < 4; ++ row) {
for (int col = 0; col < 9; ++ col) {
int x = inX + col * 18;
int y = row * 18 + (inY + 10);
addSlot(new Slot(playerInventory, col + row * 9, x, y));
}
}
}
protected void addPlayerSlots(PlayerInventory playerInventory) {
addPlayerSlots(playerInventory, 8, 56);
}
}
| {
"pile_set_name": "Github"
} |
/* $Id: ClpHelperFunctions.cpp 1753 2011-06-19 16:27:26Z stefan $ */
// Copyright (C) 2003, International Business Machines
// Corporation and others. All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
/*
Note (JJF) I have added some operations on arrays even though they may
duplicate CoinDenseVector. I think the use of templates was a mistake
as I don't think inline generic code can take as much advantage of
parallelism or machine architectures or memory hierarchies.
*/
#include <cfloat>
#include <cstdlib>
#include <cmath>
#include "CoinHelperFunctions.hpp"
#include "CoinTypes.hpp"
double
maximumAbsElement(const double * region, int size)
{
int i;
double maxValue = 0.0;
for (i = 0; i < size; i++)
maxValue = CoinMax(maxValue, fabs(region[i]));
return maxValue;
}
void
setElements(double * region, int size, double value)
{
int i;
for (i = 0; i < size; i++)
region[i] = value;
}
void
multiplyAdd(const double * region1, int size, double multiplier1,
double * region2, double multiplier2)
{
int i;
if (multiplier1 == 1.0) {
if (multiplier2 == 1.0) {
for (i = 0; i < size; i++)
region2[i] = region1[i] + region2[i];
} else if (multiplier2 == -1.0) {
for (i = 0; i < size; i++)
region2[i] = region1[i] - region2[i];
} else if (multiplier2 == 0.0) {
for (i = 0; i < size; i++)
region2[i] = region1[i] ;
} else {
for (i = 0; i < size; i++)
region2[i] = region1[i] + multiplier2 * region2[i];
}
} else if (multiplier1 == -1.0) {
if (multiplier2 == 1.0) {
for (i = 0; i < size; i++)
region2[i] = -region1[i] + region2[i];
} else if (multiplier2 == -1.0) {
for (i = 0; i < size; i++)
region2[i] = -region1[i] - region2[i];
} else if (multiplier2 == 0.0) {
for (i = 0; i < size; i++)
region2[i] = -region1[i] ;
} else {
for (i = 0; i < size; i++)
region2[i] = -region1[i] + multiplier2 * region2[i];
}
} else if (multiplier1 == 0.0) {
if (multiplier2 == 1.0) {
// nothing to do
} else if (multiplier2 == -1.0) {
for (i = 0; i < size; i++)
region2[i] = -region2[i];
} else if (multiplier2 == 0.0) {
for (i = 0; i < size; i++)
region2[i] = 0.0;
} else {
for (i = 0; i < size; i++)
region2[i] = multiplier2 * region2[i];
}
} else {
if (multiplier2 == 1.0) {
for (i = 0; i < size; i++)
region2[i] = multiplier1 * region1[i] + region2[i];
} else if (multiplier2 == -1.0) {
for (i = 0; i < size; i++)
region2[i] = multiplier1 * region1[i] - region2[i];
} else if (multiplier2 == 0.0) {
for (i = 0; i < size; i++)
region2[i] = multiplier1 * region1[i] ;
} else {
for (i = 0; i < size; i++)
region2[i] = multiplier1 * region1[i] + multiplier2 * region2[i];
}
}
}
double
innerProduct(const double * region1, int size, const double * region2)
{
int i;
double value = 0.0;
for (i = 0; i < size; i++)
value += region1[i] * region2[i];
return value;
}
void
getNorms(const double * region, int size, double & norm1, double & norm2)
{
norm1 = 0.0;
norm2 = 0.0;
int i;
for (i = 0; i < size; i++) {
norm2 += region[i] * region[i];
norm1 = CoinMax(norm1, fabs(region[i]));
}
}
#if COIN_LONG_WORK
// For long double versions
CoinWorkDouble
maximumAbsElement(const CoinWorkDouble * region, int size)
{
int i;
CoinWorkDouble maxValue = 0.0;
for (i = 0; i < size; i++)
maxValue = CoinMax(maxValue, CoinAbs(region[i]));
return maxValue;
}
void
setElements(CoinWorkDouble * region, int size, CoinWorkDouble value)
{
int i;
for (i = 0; i < size; i++)
region[i] = value;
}
void
multiplyAdd(const CoinWorkDouble * region1, int size, CoinWorkDouble multiplier1,
CoinWorkDouble * region2, CoinWorkDouble multiplier2)
{
int i;
if (multiplier1 == 1.0) {
if (multiplier2 == 1.0) {
for (i = 0; i < size; i++)
region2[i] = region1[i] + region2[i];
} else if (multiplier2 == -1.0) {
for (i = 0; i < size; i++)
region2[i] = region1[i] - region2[i];
} else if (multiplier2 == 0.0) {
for (i = 0; i < size; i++)
region2[i] = region1[i] ;
} else {
for (i = 0; i < size; i++)
region2[i] = region1[i] + multiplier2 * region2[i];
}
} else if (multiplier1 == -1.0) {
if (multiplier2 == 1.0) {
for (i = 0; i < size; i++)
region2[i] = -region1[i] + region2[i];
} else if (multiplier2 == -1.0) {
for (i = 0; i < size; i++)
region2[i] = -region1[i] - region2[i];
} else if (multiplier2 == 0.0) {
for (i = 0; i < size; i++)
region2[i] = -region1[i] ;
} else {
for (i = 0; i < size; i++)
region2[i] = -region1[i] + multiplier2 * region2[i];
}
} else if (multiplier1 == 0.0) {
if (multiplier2 == 1.0) {
// nothing to do
} else if (multiplier2 == -1.0) {
for (i = 0; i < size; i++)
region2[i] = -region2[i];
} else if (multiplier2 == 0.0) {
for (i = 0; i < size; i++)
region2[i] = 0.0;
} else {
for (i = 0; i < size; i++)
region2[i] = multiplier2 * region2[i];
}
} else {
if (multiplier2 == 1.0) {
for (i = 0; i < size; i++)
region2[i] = multiplier1 * region1[i] + region2[i];
} else if (multiplier2 == -1.0) {
for (i = 0; i < size; i++)
region2[i] = multiplier1 * region1[i] - region2[i];
} else if (multiplier2 == 0.0) {
for (i = 0; i < size; i++)
region2[i] = multiplier1 * region1[i] ;
} else {
for (i = 0; i < size; i++)
region2[i] = multiplier1 * region1[i] + multiplier2 * region2[i];
}
}
}
CoinWorkDouble
innerProduct(const CoinWorkDouble * region1, int size, const CoinWorkDouble * region2)
{
int i;
CoinWorkDouble value = 0.0;
for (i = 0; i < size; i++)
value += region1[i] * region2[i];
return value;
}
void
getNorms(const CoinWorkDouble * region, int size, CoinWorkDouble & norm1, CoinWorkDouble & norm2)
{
norm1 = 0.0;
norm2 = 0.0;
int i;
for (i = 0; i < size; i++) {
norm2 += region[i] * region[i];
norm1 = CoinMax(norm1, CoinAbs(region[i]));
}
}
#endif
#ifdef DEBUG_MEMORY
#include <malloc.h>
#include <stdio.h>
#include <stdlib.h>
typedef void (*NEW_HANDLER)();
static NEW_HANDLER new_handler; // function to call if `new' fails (cf. ARM p. 281)
// Allocate storage.
void *
operator new(size_t size)
{
void * p;
for (;;) {
p = malloc(size);
if (p) break; // success
else if (new_handler) new_handler(); // failure - try again (allow user to release some storage first)
else break; // failure - no retry
}
if (size > 1000000)
printf("Allocating memory of size %d\n", size);
return p;
}
// Deallocate storage.
void
operator delete(void *p)
{
free(p);
return;
}
void
operator delete [] (void *p)
{
free(p);
return;
}
#endif
| {
"pile_set_name": "Github"
} |
<?xml version="1.0" encoding="utf-8"?>
<selector xmlns:android="http://schemas.android.com/apk/res/android">
<item android:drawable="@drawable/wallet_base_button_bg_hover" android:state_enabled="true" android:state_pressed="true"/>
<item android:drawable="@drawable/wallet_base_button_bg_normal" android:state_enabled="true" android:state_pressed="false"/>
<item android:drawable="@drawable/wallet_base_button_bg_normal" android:state_enabled="false" android:state_pressed="true"/>
<item android:drawable="@drawable/wallet_base_button_bg_normal" android:state_enabled="false" android:state_pressed="false"/>
<item android:drawable="@drawable/wallet_base_button_bg_normal"/>
</selector> | {
"pile_set_name": "Github"
} |
---- boxboxSeparate ----
---- boxboxPenetration ----
| {
"pile_set_name": "Github"
} |
Source: #PACKAGE#
Section: editors
Priority: optional
Maintainer: #USERNAME# <#EMAIL#>
Build-Depends: #BUILD_DEPS#, python (>= 2.6), python-support
Standards-Version: #POLICY#
Homepage: http://github.com/mickael-menu/TikZ-Editor
Package: #PACKAGE#
Architecture: all
Depends: ${python:Depends}, ${misc:Depends}, python-qt5, python-qscintilla2, imagemagick
Description: TikZ (LaTeX) code editor
TikZ code editor providing real-time previewing of TikZ source. | {
"pile_set_name": "Github"
} |
/*=============================================================================
Copyright (c) 2001-2011 Joel de Guzman
Copyright (c) 2001-2011 Hartmut Kaiser
http://spirit.sourceforge.net/
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
=============================================================================*/
#ifndef BOOST_SPIRIT_INCLUDE_KARMA_GENERATE_AUTO
#define BOOST_SPIRIT_INCLUDE_KARMA_GENERATE_AUTO
#if defined(_MSC_VER)
#pragma once
#endif
#include <boost/spirit/home/karma/generate.hpp>
#include <boost/spirit/home/karma/detail/generate_auto.hpp>
#endif
| {
"pile_set_name": "Github"
} |
import { addCallback } from '../../lib/vulcan-lib';
import { Tags, tagDescriptionEditableOptions } from '../../lib/collections/tags/collection';
import { TagRels } from '../../lib/collections/tagRels/collection';
import { Posts } from '../../lib/collections/posts/collection';
import { addEditableCallbacks } from '../editor/make_editable_callbacks'
import Users from '../../lib/collections/users/collection';
import { performVoteServer } from '../voteServer';
function isValidTagName(name: string) {
return true;
}
function normalizeTagName(name: string) {
// If the name starts with a hash, strip it off
if (name.startsWith("#"))
return name.substr(1);
else
return name;
}
export async function updatePostDenormalizedTags(postId: string) {
const tagRels: Array<DbTagRel> = await TagRels.find({postId: postId, deleted:false}).fetch();
const tagRelDict: Partial<Record<string,number>> = {};
for (let tagRel of tagRels) {
if (tagRel.baseScore > 0)
tagRelDict[tagRel.tagId] = tagRel.baseScore;
}
await Posts.update({_id:postId}, {$set: {tagRelevance: tagRelDict}});
}
addCallback("tag.create.validate", (validationErrors: Array<any>, {document: tag}: {document: DbTag}) => {
if (!isValidTagName(tag.name))
throw new Error("Invalid tag name (use only letters, digits and dash)");
// If the name starts with a hash, strip it off
const normalizedName = normalizeTagName(tag.name);
if (tag.name !== normalizedName) {
tag = {
...tag,
name: normalizedName,
};
}
// Name must be unique
const existing = Tags.find({name: normalizedName, deleted:false}).fetch();
if (existing.length > 0)
throw new Error("A tag by that name already exists");
return tag;
});
addCallback("tag.update.validate", (validationErrors: Array<any>, {oldDocument, newDocument}: {oldDocument: DbTag, newDocument: DbTag}) => {
const newName = normalizeTagName(newDocument.name);
if (oldDocument.name !== newName) { // Tag renamed?
if (!isValidTagName(newDocument.name))
throw new Error("Invalid tag name");
const existing = Tags.find({name: newName, deleted:false}).fetch();
if (existing.length > 0)
throw new Error("A tag by that name already exists");
}
if (newDocument.name !== newName) {
newDocument = {
...newDocument, name: newName
}
}
return newDocument;
});
addCallback("tag.update.after", async (newDoc: DbTag, {oldDocument}: {oldDocument: DbTag}) => {
// If this is soft deleting a tag, then cascade to also soft delete any
// tagRels that go with it.
if (newDoc.deleted && !oldDocument.deleted) {
TagRels.update({ tagId: newDoc._id }, { $set: { deleted: true } }, { multi: true });
}
return newDoc;
});
addCallback("tagRels.new.after", async (tagRel: DbTagRel) => {
// When you add a tag, vote for it as relevant
var tagCreator = Users.findOne(tagRel.userId);
const votedTagRel = tagCreator && await performVoteServer({ document: tagRel, voteType: 'smallUpvote', collection: TagRels, user: tagCreator })
await updatePostDenormalizedTags(tagRel.postId);
return {...tagRel, ...votedTagRel};
});
function voteUpdatePostDenormalizedTags({newDocument: tagRel, vote}: {
newDocument: DbTagRel,
vote: DbVote
}) {
void updatePostDenormalizedTags(tagRel.postId);
}
addCallback("votes.cancel.sync", voteUpdatePostDenormalizedTags);
addCallback("votes.smallUpvote.async", voteUpdatePostDenormalizedTags);
addCallback("votes.bigUpvote.async", voteUpdatePostDenormalizedTags);
addCallback("votes.smallDownvote.async", voteUpdatePostDenormalizedTags);
addCallback("votes.bigDownvote.async", voteUpdatePostDenormalizedTags);
addEditableCallbacks({
collection: Tags,
options: tagDescriptionEditableOptions,
});
| {
"pile_set_name": "Github"
} |
{
"component": true,
"usingComponents": {
"detail-navi-card": "/components/detail-navi-card/index",
"navi-title": "/components/navi-title/index"
}
} | {
"pile_set_name": "Github"
} |
// SPDX-License-Identifier: GPL-2.0
#include <linux/module.h>
#include <linux/i2c.h>
#include <linux/of.h>
#include <linux/regulator/driver.h>
#include <linux/regmap.h>
static const struct regulator_ops pg86x_ops = {
.set_voltage_sel = regulator_set_voltage_sel_regmap,
.get_voltage_sel = regulator_get_voltage_sel_regmap,
.list_voltage = regulator_list_voltage_linear_range,
};
static const struct linear_range pg86x_buck1_ranges[] = {
REGULATOR_LINEAR_RANGE( 0, 0, 10, 0),
REGULATOR_LINEAR_RANGE(1000000, 11, 34, 25000),
REGULATOR_LINEAR_RANGE(1600000, 35, 47, 50000),
};
static const struct linear_range pg86x_buck2_ranges[] = {
REGULATOR_LINEAR_RANGE( 0, 0, 15, 0),
REGULATOR_LINEAR_RANGE(1000000, 16, 39, 25000),
REGULATOR_LINEAR_RANGE(1600000, 40, 52, 50000),
};
static const struct regulator_desc pg86x_regulators[] = {
{
.id = 0,
.type = REGULATOR_VOLTAGE,
.name = "buck1",
.of_match = of_match_ptr("buck1"),
.n_voltages = 11 + 24 + 13,
.linear_ranges = pg86x_buck1_ranges,
.n_linear_ranges = 3,
.vsel_reg = 0x24,
.vsel_mask = 0xff,
.ops = &pg86x_ops,
.owner = THIS_MODULE
},
{
.id = 1,
.type = REGULATOR_VOLTAGE,
.name = "buck2",
.of_match = of_match_ptr("buck2"),
.n_voltages = 16 + 24 + 13,
.linear_ranges = pg86x_buck2_ranges,
.n_linear_ranges = 3,
.vsel_reg = 0x13,
.vsel_mask = 0xff,
.ops = &pg86x_ops,
.owner = THIS_MODULE
},
};
static const struct regmap_config pg86x_regmap = {
.reg_bits = 8,
.val_bits = 8,
};
static int pg86x_i2c_probe(struct i2c_client *i2c)
{
int id, ret;
struct regulator_config config = {.dev = &i2c->dev};
struct regmap *regmap = devm_regmap_init_i2c(i2c, &pg86x_regmap);
if (IS_ERR(regmap)) {
ret = PTR_ERR(regmap);
dev_err(&i2c->dev, "regmap init failed: %d\n", ret);
return ret;
}
for (id = 0; id < ARRAY_SIZE(pg86x_regulators); id++) {
struct regulator_dev *rdev;
rdev = devm_regulator_register(&i2c->dev,
&pg86x_regulators[id],
&config);
if (IS_ERR(rdev)) {
ret = PTR_ERR(rdev);
dev_err(&i2c->dev, "failed to register %s: %d\n",
pg86x_regulators[id].name, ret);
return ret;
}
}
return 0;
}
static const struct of_device_id pg86x_dt_ids [] = {
{ .compatible = "marvell,88pg867" },
{ .compatible = "marvell,88pg868" },
{ }
};
MODULE_DEVICE_TABLE(of, pg86x_dt_ids);
static const struct i2c_device_id pg86x_i2c_id[] = {
{ "88pg867", },
{ "88pg868", },
{ }
};
MODULE_DEVICE_TABLE(i2c, pg86x_i2c_id);
static struct i2c_driver pg86x_regulator_driver = {
.driver = {
.name = "88pg86x",
.of_match_table = of_match_ptr(pg86x_dt_ids),
},
.probe_new = pg86x_i2c_probe,
.id_table = pg86x_i2c_id,
};
module_i2c_driver(pg86x_regulator_driver);
MODULE_DESCRIPTION("Marvell 88PG86X voltage regulator");
MODULE_AUTHOR("Alexander Monakov <[email protected]>");
MODULE_LICENSE("GPL");
| {
"pile_set_name": "Github"
} |
package user_service
import (
"errors"
"fmt"
"github.com/casbin/casbin"
"go-admin/models"
"go-admin/pkg/util"
)
type User struct {
ID int
Username string
Password string
Role int
CreatedBy string
ModifiedBy string
PageNum int
PageSize int
Enforcer *casbin.Enforcer `inject:""`
}
func (a *User) Check() (bool, error) {
return models.CheckUser(a.Username, util.EncodeMD5(a.Password))
}
func (a *User) Add() (id int, err error) {
menu := map[string]interface{}{
"username": a.Username,
"password": util.EncodeMD5(a.Password),
"role_id": a.Role,
}
username, _ := models.CheckUserUsername(a.Username)
if username {
return 0, errors.New("username 名字重复,请更改！")
}
if id, err := models.AddUser(menu); err == nil {
return id, err
} else {
return 0, err
}
}
func (a *User) Edit() error {
data := map[string]interface{}{
"username": a.Username,
"password": a.Password,
"role_id": a.Role,
}
username, _ := models.CheckUserUsernameId(a.Username, a.ID)
if username {
return errors.New("username 名字重复,请更改！")
}
err := models.EditUser(a.ID, data)
if err != nil {
return err
}
return nil
}
func (a *User) Get() (*models.User, error) {
user, err := models.GetUser(a.Username)
if err != nil {
return nil, err
}
return user, nil
}
func (a *User) GetAll() ([]*models.User, error) {
if a.ID != 0 {
maps := make(map[string]interface{})
maps["deleted_on"] = 0
maps["id"] = a.ID
user, err := models.GetUsers(a.PageNum, a.PageSize, maps)
if err != nil {
return nil, err
}
return user, nil
} else {
user, err := models.GetUsers(a.PageNum, a.PageSize, a.getMaps())
if err != nil {
return nil, err
}
return user, nil
}
}
func (a *User) Delete() error {
err := models.DeleteUser(a.ID)
if err != nil {
return err
}
return nil
}
func (a *User) ExistByID() (bool, error) {
return models.ExistUserByID(a.ID)
}
func (a *User) Count() (int, error) {
return models.GetUserTotal(a.getMaps())
}
func (a *User) getMaps() map[string]interface{} {
maps := make(map[string]interface{})
maps["deleted_on"] = 0
return maps
}
// LoadAllPolicy 加载所有的用户策略
func (a *User) LoadAllPolicy() error {
users, err := models.GetUsersAll()
if err != nil {
return err
}
for _, user := range users {
if len(user.Role) != 0 {
err = a.LoadPolicy(user.ID)
if err != nil {
return err
}
}
}
fmt.Println("角色权限关系", a.Enforcer.GetGroupingPolicy())
return nil
}
// LoadPolicy 加载用户权限策略
func (a *User) LoadPolicy(id int) error {
user, err := models.GetUserId(id)
if err != nil {
return err
}
a.Enforcer.DeleteRolesForUser(user.Username)
for _, ro := range user.Role {
a.Enforcer.AddRoleForUser(user.Username, ro.Name)
}
fmt.Println("更新角色权限关系", a.Enforcer.GetGroupingPolicy())
return nil
}
| {
"pile_set_name": "Github"
} |
/*
* Copyright (c) 2018-2020 "Graph Foundation"
* Graph Foundation, Inc. [https://graphfoundation.org]
*
* Copyright (c) 2002-2020 "Neo4j,"
* Neo4j Sweden AB [http://neo4j.com]
*
* This file is part of ONgDB.
*
* ONgDB 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.
*
* 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.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package org.neo4j.bolt.v3.runtime;
import java.time.Clock;
import java.time.Duration;
import org.neo4j.bolt.BoltChannel;
import org.neo4j.bolt.runtime.BoltResult;
import org.neo4j.bolt.runtime.BoltResultHandle;
import org.neo4j.bolt.v1.runtime.TransactionStateMachineV1SPI;
import org.neo4j.cypher.internal.javacompat.QueryResultProvider;
import org.neo4j.kernel.impl.query.TransactionalContext;
import org.neo4j.kernel.internal.GraphDatabaseAPI;
import org.neo4j.values.virtual.MapValue;
public class TransactionStateMachineV3SPI extends TransactionStateMachineV1SPI
{
public TransactionStateMachineV3SPI( GraphDatabaseAPI db, BoltChannel boltChannel, Duration txAwaitDuration, Clock clock )
{
super( db, boltChannel, txAwaitDuration, clock );
}
@Override
protected BoltResultHandle newBoltResultHandle( String statement, MapValue params, TransactionalContext transactionalContext )
{
return new BoltResultHandleV3( statement, params, transactionalContext );
}
private class BoltResultHandleV3 extends BoltResultHandleV1
{
BoltResultHandleV3( String statement, MapValue params, TransactionalContext transactionalContext )
{
super( statement, params, transactionalContext );
}
@Override
protected BoltResult newBoltResult( QueryResultProvider result, Clock clock )
{
return new CypherAdapterStreamV3( result.queryResult(), clock );
}
}
}
| {
"pile_set_name": "Github"
} |
[
new EntersBattlefieldTrigger() {
@Override
public MagicEvent executeTrigger(final MagicGame game, final MagicPermanent permanent, final MagicPayedCost payedCost) {
if (payedCost.isKicked() == false) {
game.doAction(new AddTriggerAction(permanent, AtEndOfTurnTrigger.Sacrifice));
}
return MagicEvent.NONE;
}
}
]
| {
"pile_set_name": "Github"
} |
compiler: ghcjs
| {
"pile_set_name": "Github"
} |
#!/usr/bin/env python
import subprocess
import feedparser
import string
rss = feedparser.parse('https://www.reddit.com/r/Futurology/.rss')
print(rss['feed']['title'])
subprocess.call("echo reading futurology news... | $VOICE", shell=True)
for post in rss.entries:
headline = post.title
exclude = set(string.punctuation)
headline = ''.join(ch for ch in headline if ch not in exclude)
subprocess.call("echo \"" + headline + "\n\" | tee /dev/tty | $VOICE", shell=True)
| {
"pile_set_name": "Github"
} |
<?php
/*
* Copyright 2016 Google Inc.
*
* 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
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* 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.
*/
class Google_Service_Customsearch_ContextFacets extends Google_Model
{
protected $internal_gapi_mappings = array(
"labelWithOp" => "label_with_op",
);
public $anchor;
public $label;
public $labelWithOp;
public function setAnchor($anchor)
{
$this->anchor = $anchor;
}
public function getAnchor()
{
return $this->anchor;
}
public function setLabel($label)
{
$this->label = $label;
}
public function getLabel()
{
return $this->label;
}
public function setLabelWithOp($labelWithOp)
{
$this->labelWithOp = $labelWithOp;
}
public function getLabelWithOp()
{
return $this->labelWithOp;
}
}
| {
"pile_set_name": "Github"
} |
//
// RKLumberjackLogger.m
// Pods
//
// Created by C_Lindberg,Carl on 10/31/14.
//
//
#if __has_include("DDLog.h")
#import "RKLumberjackLogger.h"
#import "DDLog.h"
@implementation RKLumberjackLogger
+ (int)ddLogLevelFromRKLogLevel:(_RKlcl_level_t)rkLevel
{
switch (rkLevel)
{
case RKLogLevelOff: return LOG_LEVEL_OFF;
case RKLogLevelCritical: return LOG_LEVEL_ERROR;
case RKLogLevelError: return LOG_LEVEL_ERROR;
case RKLogLevelWarning: return LOG_LEVEL_WARN;
case RKLogLevelInfo: return LOG_LEVEL_INFO;
case RKLogLevelDebug: return LOG_LEVEL_DEBUG;
case RKLogLevelTrace: return LOG_LEVEL_VERBOSE;
}
return LOG_LEVEL_DEBUG;
}
+ (int)ddLogFlagFromRKLogLevel:(_RKlcl_level_t)rkLevel
{
switch (rkLevel)
{
case RKLogLevelOff: return 0;
case RKLogLevelCritical: return LOG_FLAG_ERROR;
case RKLogLevelError: return LOG_FLAG_ERROR;
case RKLogLevelWarning: return LOG_FLAG_WARN;
case RKLogLevelInfo: return LOG_FLAG_INFO;
case RKLogLevelDebug: return LOG_FLAG_DEBUG;
case RKLogLevelTrace: return LOG_FLAG_VERBOSE;
}
return LOG_FLAG_DEBUG;
}
+ (_RKlcl_level_t)rkLogLevelFromDDLogLevel:(int)ddLogLevel
{
if (ddLogLevel & LOG_FLAG_VERBOSE) return RKLogLevelTrace;
if (ddLogLevel & LOG_FLAG_DEBUG) return RKLogLevelDebug;
if (ddLogLevel & LOG_FLAG_INFO) return RKLogLevelInfo;
if (ddLogLevel & LOG_FLAG_WARN) return RKLogLevelWarning;
if (ddLogLevel & LOG_FLAG_ERROR) return RKLogLevelError;
return RKLogLevelOff;
}
#pragma mark RKLogging
+ (void)logWithComponent:(_RKlcl_component_t)component
level:(_RKlcl_level_t)level
path:(const char *)path
line:(uint32_t)line
function:(const char *)function
format:(NSString *)format, ...
{
va_list args;
va_start(args, format);
int flag = [self ddLogFlagFromRKLogLevel:level];
int componentLevel = [self ddLogLevelFromRKLogLevel:_RKlcl_component_level[component]];
BOOL async = LOG_ASYNC_ENABLED && ((flag & LOG_FLAG_ERROR) == 0);
[DDLog log:async
level:componentLevel
flag:flag
context:0x524B5F00 + component
file:path function:function line:line
tag:nil
format:format args:args];
va_end(args);
}
@end
/* Create a DDRegisteredDynamicLogging class for each RestKit component */
#import "lcl_config_components_RK.h"
#undef _RKlcl_component
#define _RKlcl_component(_identifier, _header, _name) \
@interface RKLumberjackLog##_identifier : NSObject <DDRegisteredDynamicLogging> \
@end \
@implementation RKLumberjackLog##_identifier \
+ (int)ddLogLevel { \
_RKlcl_level_t level = _RKlcl_component_level[RKlcl_c##_identifier]; \
return [RKLumberjackLogger ddLogLevelFromRKLogLevel:level]; \
} \
+ (void)ddSetLogLevel:(int)logLevel { \
RKLogConfigureByName(_name, [RKLumberjackLogger rkLogLevelFromDDLogLevel:logLevel]); \
} \
@end
RKLCLComponentDefinitions
#undef _RKlcl_component
#endif
| {
"pile_set_name": "Github"
} |
{% extends 'base.html' %}
{% load i18n %}
{% block title %}{% trans "Host Aggregates" %}{% endblock %}
{% block main %}
<div id="host-aggregates">
{{ host_aggregates_table.render }}
</div>
<div id="availability-zones">
{{ availability_zones_table.render }}
</div>
{% endblock %}
| {
"pile_set_name": "Github"
} |
/*
* Copyright 2014 - 2020 Blazebit.
*
* 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
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* 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.
*/
package com.blazebit.persistence.examples.itsm.model.article.repository;
import java.util.List;
import java.util.Locale;
import java.util.Optional;
import org.springframework.data.jpa.domain.Specification;
import org.springframework.data.jpa.repository.JpaRepository;
import org.springframework.data.jpa.repository.Query;
import com.blazebit.persistence.spring.data.annotation.OptionalParam;
import com.blazebit.persistence.spring.data.repository.EntityViewSpecificationExecutor;
import com.blazebit.persistence.examples.itsm.model.article.entity.Article;
import com.blazebit.persistence.examples.itsm.model.article.view.ArticleLocalized;
/**
* @author Giovanni Lovato
* @since 1.4.0
*/
public interface ArticleRepository extends JpaRepository<Article, Long>,
EntityViewSpecificationExecutor<ArticleLocalized, Article> {
boolean existsByAuthorName(String name);
long countByAuthorName(String name);
@Query("select a from Article a")
List<Article> foo();
List<ArticleLocalized> findAll(Specification<Article> specification,
@OptionalParam("locale") Locale locale,
@OptionalParam("defaultLocale") Locale defaultLocale);
Optional<ArticleLocalized> findOne(Specification<Article> specification,
@OptionalParam("locale") Locale locale,
@OptionalParam("defaultLocale") Locale defaultLocale);
}
| {
"pile_set_name": "Github"
} |
<?xml version="1.0" encoding="UTF-8"?>
<!--
/*
* Copyright (C) 2008 The Android Open Source Project
*
* 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
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* 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.
*/
-->
<resources xmlns:android="http://schemas.android.com/apk/res/android"
xmlns:xliff="urn:oasis:names:tc:xliff:document:1.2">
<string name="app_name" msgid="649227358658669779">Universal Launcher</string>
<string name="folder_name" msgid="7371454440695724752"></string>
<string name="work_folder_name" msgid="3753320833950115786">"Trabajo"</string>
<string name="activity_not_found" msgid="8071924732094499514">"La aplicación no está instalada."</string>
<string name="activity_not_available" msgid="7456344436509528827">"La aplicación no está disponible"</string>
<string name="safemode_shortcut_error" msgid="9160126848219158407">"Aplicación descargada inhabilitada en modo seguro"</string>
<string name="safemode_widget_error" msgid="4863470563535682004">"Widgets inhabilitados en modo seguro"</string>
<string name="shortcut_not_available" msgid="2536503539825726397">"Acceso directo no disponible"</string>
<string name="long_press_widget_to_add" msgid="7699152356777458215">"Mantén pulsado el widget que quieras seleccionar."</string>
<string name="long_accessible_way_to_add" msgid="4289502106628154155">"Toca dos veces y mantén pulsado el widget que quieras seleccionar o utiliza acciones personalizadas."</string>
<string name="widget_dims_format" msgid="2370757736025621599">"%1$d × %2$d"</string>
<string name="widget_accessible_dims_format" msgid="3640149169885301790">"%1$d de ancho por %2$d de alto"</string>
<string name="all_apps_search_bar_hint" msgid="7084713969757597256">"Busca aplicaciones"</string>
<string name="all_apps_loading_message" msgid="7557140873644765180">"Cargando aplicaciones…"</string>
<string name="all_apps_no_search_results" msgid="6332185285860416787">"No se han encontrado aplicaciones que contengan \"<xliff:g id="QUERY">%1$s</xliff:g>\""</string>
<string name="all_apps_search_market_message" msgid="1366263386197059176">"Buscar más aplicaciones"</string>
<string name="out_of_space" msgid="4691004494942118364">"No queda espacio en la pantalla de inicio."</string>
<string name="hotseat_out_of_space" msgid="7448809638125333693">"La bandeja de favoritos está completa"</string>
<string name="all_apps_button_label" msgid="8130441508702294465">"Lista de aplicaciones"</string>
<string name="all_apps_home_button_label" msgid="252062713717058851">"Inicio"</string>
<string name="remove_drop_target_label" msgid="7812859488053230776">"Quitar"</string>
<string name="uninstall_drop_target_label" msgid="4722034217958379417">"Desinstalar"</string>
<string name="app_info_drop_target_label" msgid="692894985365717661">"Datos de aplicación"</string>
<string name="permlab_install_shortcut" msgid="5632423390354674437">"instalar accesos directos"</string>
<string name="permdesc_install_shortcut" msgid="923466509822011139">"Permite que una aplicación añada accesos directos sin intervención del usuario."</string>
<string name="permlab_read_settings" msgid="1941457408239617576">"leer información de accesos directos y de ajustes de la pantalla de inicio"</string>
<string name="permdesc_read_settings" msgid="5833423719057558387">"Permite que la aplicación consulte los ajustes y los accesos directos de la pantalla de inicio."</string>
<string name="permlab_write_settings" msgid="3574213698004620587">"escribir información de accesos directos y de ajustes de la pantalla de inicio"</string>
<string name="permdesc_write_settings" msgid="5440712911516509985">"Permite que las aplicaciones cambien los ajustes y los accesos directos de la pantalla de inicio."</string>
<string name="msg_no_phone_permission" msgid="9208659281529857371">"<xliff:g id="APP_NAME">%1$s</xliff:g> no puede hacer llamadas"</string>
<string name="gadget_error_text" msgid="6081085226050792095">"Problema al cargar el widget"</string>
<string name="gadget_setup_text" msgid="8274003207686040488">"Configuración"</string>
<string name="uninstall_system_app_text" msgid="4172046090762920660">"Esta aplicación es del sistema y no se puede desinstalar."</string>
<string name="folder_hint_text" msgid="6617836969016293992">"Carpeta sin nombre"</string>
<string name="disabled_app_label" msgid="6673129024321402780">"Se ha inhabilitado <xliff:g id="APP_NAME">%1$s</xliff:g>"</string>
<string name="default_scroll_format" msgid="7475544710230993317">"Página %1$d de %2$d"</string>
<string name="workspace_scroll_format" msgid="8458889198184077399">"Pantalla de inicio %1$d de %2$d"</string>
<string name="workspace_new_page" msgid="257366611030256142">"Nueva página de pantalla de inicio"</string>
<string name="folder_opened" msgid="94695026776264709">"Carpeta abierta, <xliff:g id="WIDTH">%1$d</xliff:g> por <xliff:g id="HEIGHT">%2$d</xliff:g>"</string>
<string name="folder_tap_to_close" msgid="4625795376335528256">"Toca para cerrar la carpeta"</string>
<string name="folder_tap_to_rename" msgid="4017685068016979677">"Toca para guardar el nuevo nombre"</string>
<string name="folder_closed" msgid="4100806530910930934">"Carpeta cerrada"</string>
<string name="folder_renamed" msgid="1794088362165669656">"Se ha cambiado el nombre de la carpeta a <xliff:g id="NAME">%1$s</xliff:g>"</string>
<string name="folder_name_format" msgid="6629239338071103179">"Carpeta: <xliff:g id="NAME">%1$s</xliff:g>"</string>
<string name="widget_button_text" msgid="2880537293434387943">"Widgets"</string>
<string name="wallpaper_button_text" msgid="8404103075899945851">"Fondos de pantalla"</string>
<string name="settings_button_text" msgid="8119458837558863227">"Ajustes"</string>
<string name="msg_disabled_by_admin" msgid="6898038085516271325">"Inhabilitada por el administrador"</string>
<string name="accessibility_action_overview" msgid="6257665857640347026">"Visión general"</string>
<string name="allow_rotation_title" msgid="7728578836261442095">"Permitir rotación de la pantalla de inicio"</string>
<string name="allow_rotation_desc" msgid="8662546029078692509">"Al girar el teléfono"</string>
<string name="allow_rotation_blocked_desc" msgid="3212602545192996253">"La configuración de pantalla actual no permite girar la pantalla"</string>
<string name="package_state_unknown" msgid="7592128424511031410">"Desconocido"</string>
<string name="abandoned_clean_this" msgid="7610119707847920412">"Quitar"</string>
<string name="abandoned_search" msgid="891119232568284442">"Buscar"</string>
<string name="abandoned_promises_title" msgid="7096178467971716750">"Esta aplicación no está instalada"</string>
<string name="abandoned_promise_explanation" msgid="3990027586878167529">"La aplicación de este icono no está instalada. Puedes quitar el icono o buscar la aplicación e instalarla manualmente."</string>
<string name="app_downloading_title" msgid="8336702962104482644">"Descargando <xliff:g id="NAME">%1$s</xliff:g> (<xliff:g id="PROGRESS">%2$s</xliff:g> completado)"</string>
<string name="app_waiting_download_title" msgid="7053938513995617849">"Esperando para instalar <xliff:g id="NAME">%1$s</xliff:g>"</string>
<string name="action_add_to_workspace" msgid="8902165848117513641">"Añadir a la pantalla de inicio"</string>
<string name="action_move_here" msgid="2170188780612570250">"Mover elemento aquí"</string>
<string name="item_added_to_workspace" msgid="4211073925752213539">"Elemento añadido a la pantalla de inicio"</string>
<string name="item_removed" msgid="851119963877842327">"Elemento eliminado"</string>
<string name="action_move" msgid="4339390619886385032">"Mover elemento"</string>
<string name="move_to_empty_cell" msgid="2833711483015685619">"Mover a la fila <xliff:g id="NUMBER_0">%1$s</xliff:g>, columna <xliff:g id="NUMBER_1">%2$s</xliff:g>"</string>
<string name="move_to_position" msgid="6750008980455459790">"Mover a la posición número <xliff:g id="NUMBER">%1$s</xliff:g>"</string>
<string name="move_to_hotseat_position" msgid="6295412897075147808">"Mover a la posición número <xliff:g id="NUMBER">%1$s</xliff:g> de favoritos"</string>
<string name="item_moved" msgid="4606538322571412879">"Elemento movido"</string>
<string name="add_to_folder" msgid="9040534766770853243">"Añadir a carpeta: <xliff:g id="NAME">%1$s</xliff:g>"</string>
<string name="add_to_folder_with_app" msgid="4534929978967147231">"Añadir a la carpeta con <xliff:g id="NAME">%1$s</xliff:g>"</string>
<string name="added_to_folder" msgid="4793259502305558003">"Elemento añadido a carpeta"</string>
<string name="create_folder_with" msgid="4050141361160214248">"Crear carpeta con: <xliff:g id="NAME">%1$s</xliff:g>"</string>
<string name="folder_created" msgid="6409794597405184510">"Carpeta creada"</string>
<string name="action_move_to_workspace" msgid="1603837886334246317">"Mover a la pantalla de inicio"</string>
<string name="action_move_screen_left" msgid="8854216831569401665">"Mover pantalla a la izquierda"</string>
<string name="action_move_screen_right" msgid="329334910274311123">"Mover pantalla a la derecha"</string>
<string name="screen_moved" msgid="266230079505650577">"Pantalla movida"</string>
<string name="action_resize" msgid="1802976324781771067">"Modificar tamaño"</string>
<string name="action_increase_width" msgid="8773715375078513326">"Aumentar ancho"</string>
<string name="action_increase_height" msgid="459390020612501122">"Aumentar altura"</string>
<string name="action_decrease_width" msgid="1374549771083094654">"Reducir ancho"</string>
<string name="action_decrease_height" msgid="282377193880900022">"Reducir altura"</string>
<string name="widget_resized" msgid="9130327887929620">"Se ha modificado el tamaño del widget a <xliff:g id="NUMBER_0">%1$s</xliff:g> de ancho y <xliff:g id="NUMBER_1">%2$s</xliff:g> de alto"</string>
<string name="action_deep_shortcut" msgid="2864038805849372848">"Accesos directos"</string>
<string name="shortcuts_menu_description" msgid="406159963824238648">"<xliff:g id="NUMBER_OF_SHORTCUTS">%1$d</xliff:g> accesos directos de <xliff:g id="APP_NAME">%2$s</xliff:g>"</string>
</resources>
| {
"pile_set_name": "Github"
} |
# TomEE Server Composer
Intended soley as a means to improve integration testing by enabling a more expressive way
to build a running server process, including ability to read log output. | {
"pile_set_name": "Github"
} |
import { prefs } from '../core/preferences';
import { fileFetcher } from '../core/file_fetcher';
import { t } from '../core/localizer';
import { uiIntro } from './intro';
import { uiModal } from './modal';
export function uiSplash(context) {
return (selection) => {
// Exception - if there are restorable changes, skip this splash screen.
// This is because we currently only support one `uiModal` at a time
// and we need to show them `uiRestore`` instead of this one.
if (context.history().hasRestorableChanges()) return;
// If user has not seen this version of the privacy policy, show the splash again.
let updateMessage = '';
const sawPrivacyVersion = prefs('sawPrivacyVersion');
let showSplash = !prefs('sawSplash');
if (sawPrivacyVersion !== context.privacyVersion) {
updateMessage = t('splash.privacy_update');
showSplash = true;
}
if (!showSplash) return;
prefs('sawSplash', true);
prefs('sawPrivacyVersion', context.privacyVersion);
// fetch intro graph data now, while user is looking at the splash screen
fileFetcher.get('intro_graph');
let modalSelection = uiModal(selection);
modalSelection.select('.modal')
.attr('class', 'modal-splash modal');
let introModal = modalSelection.select('.content')
.append('div')
.attr('class', 'fillL');
introModal
.append('div')
.attr('class','modal-section')
.append('h3')
.html(t.html('splash.welcome'));
let modalSection = introModal
.append('div')
.attr('class','modal-section');
modalSection
.append('p')
.html(t.html('splash.text', {
version: context.version,
website: '<a target="_blank" href="http://ideditor.blog/">ideditor.blog</a>',
github: '<a target="_blank" href="https://github.com/openstreetmap/iD">github.com</a>'
}));
modalSection
.append('p')
.html(t.html('splash.privacy', {
updateMessage: updateMessage,
privacyLink: '<a target="_blank" href="https://github.com/openstreetmap/iD/blob/release/PRIVACY.md">' +
t('splash.privacy_policy') + '</a>'
}));
let buttonWrap = introModal
.append('div')
.attr('class', 'modal-actions');
let walkthrough = buttonWrap
.append('button')
.attr('class', 'walkthrough')
.on('click', () => {
context.container().call(uiIntro(context));
modalSelection.close();
});
walkthrough
.append('svg')
.attr('class', 'logo logo-walkthrough')
.append('use')
.attr('xlink:href', '#iD-logo-walkthrough');
walkthrough
.append('div')
.html(t.html('splash.walkthrough'));
let startEditing = buttonWrap
.append('button')
.attr('class', 'start-editing')
.on('click', modalSelection.close);
startEditing
.append('svg')
.attr('class', 'logo logo-features')
.append('use')
.attr('xlink:href', '#iD-logo-features');
startEditing
.append('div')
.html(t.html('splash.start'));
modalSelection.select('button.close')
.attr('class','hide');
};
}
| {
"pile_set_name": "Github"
} |
<?xml version="1.0" encoding="utf-8" ?>
<chapter id="mock-objects">
<title>モックオブジェクト</title>
<caution>
<para>
このドキュメントは、すでにサポートが終了したバージョンの PHPUnit に関するものです。
</para>
<para>
最新版の PHPUnit のドキュメントは
<ulink url="../../current/ja/index.html">こちら</ulink>にあります。
</para>
</caution>
<para>
オブジェクトに対するコールが正しく行われたかどうかを調べたいこともあるでしょう。
その方法をここで説明します。ここでは、別のオブジェクトを観察している
あるオブジェクトの特定のメソッド (この例では <literal>update()</literal>)
が正しくコールされたかどうかを調べるものとします。
</para>
<para>
<xref linkend="mock-objects.examples.ObserverTest.php" /> では、まず
<literal>PHPUnit_Framework_TestCase</literal> クラスの
<literal>getMock()</literal> メソッド (<xref
linkend="api.testcase.tables.api" /> を参照ください)
を使用して <literal>Observer</literal> のモックオブジェクトを作成します。
<literal>getMock()</literal> メソッドの二番目の (オプションの)
パラメータに配列を指定しているので、<literal>Observer</literal>
クラスの中の <literal>update()</literal> メソッドについてのみモック実装が作成されます。
</para>
<para>
次に、PHPUnit が提供する、いわゆる
<ulink url="http://martinfowler.com/bliki/FluentInterface.html">Fluent Interface</ulink>
(<ulink url="http://capsctrl.que.jp/kdmsnr/wiki/bliki/?FluentInterface">流れるようなインターフェイス</ulink>)
を用いてモックの振る舞いや期待する動作を指定します。簡単に言うと、
いくつもの一時オブジェクト (例えば「<literal>update()</literal>
がコールされることを期待するオブジェクト」と「パラメータに
○○が指定されることを期待するオブジェクト」) を作成して、
期待値を設定したあとにそれらを連結するといった操作は必要ないということです。
その代わりに、例にあるようにメソッドの呼び出しを連結します。
このほうが、より読みやすく "流れるような" コードとなります。
</para>
<example id="mock-objects.examples.ObserverTest.php">
<title>あるメソッドが、指定したパラメータで一度だけコールされることを確かめるテスト</title>
<programlisting><![CDATA[<?php
require_once 'PHPUnit/Framework.php';
class ObserverTest extends PHPUnit_Framework_TestCase
{
public function testUpdateIsCalledOnce()
{
// Observer クラスのモックオブジェクトを作成します。
// 対象とするのは update() メソッドのみです。
$observer = $this->getMock('Observer', array('update'));
// update() メソッドが一度だけコールされ、その際の
// パラメータは文字列 'something' となる、
// ということを期待しています。
$observer->expects($this->once())
->method('update')
->with($this->equalTo('something'));
// Subject オブジェクトを作成し、Observer オブジェクトの
// モックをアタッチします。
$subject = new Subject;
$subject->attach($observer);
// $subject オブジェクトの doSomething() メソッドをコールします。
// これは、Observer オブジェクトのモックの update() メソッドを、
// 文字列 'something' を引数としてコールすることを期待されています。
$subject->doSomething();
}
}
?>]]></programlisting>
</example>
<para>
<xref linkend="mock-objects.tables.matchers" />
は、モックメソッドの予定実行回数を表すために使用できる matcher の一覧です。
</para>
<table id="mock-objects.tables.matchers">
<title>Matchers</title>
<tgroup cols="2" align="left" colsep="1" rowsep="1">
<thead>
<row>
<entry>Matcher</entry>
<entry>意味</entry>
</row>
</thead>
<tbody>
<row>
<entry><literal>PHPUnit_Framework_MockObject_Matcher_AnyInvokedCount any()</literal></entry>
<entry>評価対象のメソッドがゼロ回以上実行された際にマッチするオブジェクトを返します。</entry>
</row>
<row>
<entry><literal>PHPUnit_Framework_MockObject_Matcher_InvokedCount never()</literal></entry>
<entry>評価対象のメソッドが実行されなかった際にマッチするオブジェクトを返します。</entry>
</row>
<row>
<entry><literal>PHPUnit_Framework_MockObject_Matcher_InvokedAtLeastOnce atLeastOnce()</literal></entry>
<entry>評価対象のメソッドが最低一回以上実行された際にマッチするオブジェクトを返します。</entry>
</row>
<row>
<entry><literal>PHPUnit_Framework_MockObject_Matcher_InvokedCount once()</literal></entry>
<entry>評価対象のメソッドが一度だけ実行された際にマッチするオブジェクトを返します。</entry>
</row>
<row>
<entry><literal>PHPUnit_Framework_MockObject_Matcher_InvokedCount exactly(int $count)</literal></entry>
<entry>評価対象のメソッドが指定した回数だけ実行された際にマッチするオブジェクトを返します。</entry>
</row>
<row>
<entry><literal>PHPUnit_Framework_MockObject_Matcher_InvokedAtIndex at(int $index)</literal></entry>
<entry>評価対象のメソッドが <literal>$index</literal> 回目に実行された際にマッチするオブジェクトを返します。</entry>
</row>
</tbody>
</tgroup>
</table>
<para>
これらの matcher とともに使用する制約については、
<xref linkend="api.assert.tables.constraints" />
で説明しています。
</para>
<section id="mock-objects.self-shunting">
<title>自己シャント</title>
<para>
<indexterm><primary>Self Shunt Pattern (自己シャントパターン)</primary></indexterm>
あるいは、<literal>Subject</literal> の実装をテストする際に
モックオブジェクトを使用せずに <emphasis>自己シャント (Self Shunt) パターン</emphasis>
を適用する方法もあります。
これは、テストケース自身をスタブとして使用します。
自己シャントというのは医学用語で、薬を注入する場所を確保するため、
チューブを挿入して動脈からとった血液を静脈にもどすことを意味します。
</para>
<para>
まず、<literal>Observer</literal> を実装したテストケースクラスを作成します。
<literal>Observer</literal> は、<literal>Subject</literal>
を観察したいオブジェクトが実装しなければならないインターフェイスです。
<programlisting>class ObserverTest extends PHPUnit_Framework_TestCase implements Observer
{
}</programlisting>
</para>
<para>
次に、<literal>Observer</literal> のメソッドである <literal>update()</literal>
を実装します。そして、観察対象のオブジェクトである <literal>Subject</literal>
の状態が変化した場合にそのメソッドが正しくコールされるかどうかを調べます。
<programlisting>public $wasCalled = FALSE;
public function update(Subject $subject)
{
$this->wasCalled = TRUE;
}</programlisting>
</para>
<para>
さあ、それではテストを書いてみましょう。まず新しい <literal>Subject</literal>
オブジェクトを作成し、テストオブジェクトをオブザーバとしてアタッチします。
<literal>Subject</literal> の状態が変化すると (例えば <literal>doSomething()</literal>
メソッドがコールされるなど)、<literal>Subject</literal>
オブジェクトは全オブザーバの <literal>update()</literal>
メソッドをコールしなければなりません。ここではインスタンス変数
<literal>$wasCalled</literal> を使用し、<literal>update()</literal>
の中でその値を設定します。これにより、<literal>Subject</literal>
オブジェクトが期待通りの動作をしているかどうかを確かめます。
<programlisting>public function testUpdate()
{
$subject = new Subject;
$subject->attach($this);
$subject->doSomething();
$this->assertTrue($this->wasCalled);
}</programlisting>
</para>
<para>
グローバルなインスタンスではなく、新しい <literal>Subject</literal>
オブジェクトを作成したことに注意してください。スタブを利用する際には、
このような設計をお勧めします。こうすると、
オブジェクト間の結合度が緩やかになり、再利用性が高まります。
</para>
<para>
自己シャントパターンになじみのない方には、このテストはわかりにくいかもしれません。
いったいここで何が起こっているんだ? テストケース自身がオブザーバになるだって?
でも、お決まりのパターンをいったん身につけてしまえば、
これらのテストは簡単に理解できるようになります。
テストの内容をつかむために必要なことは、
すべてひとつのクラスの中に含まれているのですから。
</para>
</section>
<section id="mock-objects.stubs">
<title>スタブ</title>
<para>
いろいろな要因で失敗する可能性があるテストよりも、
単一の事項のみをテストするテストのほうが情報を得やすくなります。では、
できるだけ外部からの影響を受けないようなテストを作成するには
どうすればいいのでしょうか? 単純なことです。
高価で面倒で頼りなくて遅くて複雑なリソースを、
テスト用に自動で生成されたスタブに置き換えればいいのです。たとえば、
複雑な計算結果を単に定数に置き換えたものを、テスト用に作成すればいいのです。
</para>
<para>
<indexterm><primary>PHPUnit_Extensions_TestSetup</primary></indexterm>
スタブを使用すると、高価な外部リソースを使用することによる問題を解決できます。
たとえばデータベース接続のようなリソースをテスト間で共有するには
<literal>PHPUnit_Extensions_TestSetup</literal> デコレータを使用すればいいのですが、
テストの目的を考えると、データベースを使用せずにすむのならばそのほうがずっとよいでしょう。
</para>
<para>
<xref linkend="mock-objects.stubs.examples.StubTest.php" />
に、スタブメソッドの作成と返り値の設定の方法を示します。
</para>
<example id="mock-objects.stubs.examples.StubTest.php">
<title>メソッド呼び出しのスタブの作成</title>
<programlisting><![CDATA[<?php
require_once 'PHPUnit/Framework.php';
class StubTest extends PHPUnit_Framework_TestCase
{
public function testStub()
{
$stub = $this->getMock('SomeClass');
$stub->expects($this->any())
->method('doSomething')
->will($this->returnValue('foo'));
// $stub->doSomething() をコールすると、'foo' を返します。
}
}
?>]]></programlisting>
</example>
<para>
<xref linkend="mock-objects.stubs.tables.api" />
は、スタブメソッドの返り値を設定する際に使用できるメソッドの一覧です。
</para>
<table id="mock-objects.stubs.tables.api">
<title>スタブの API</title>
<tgroup cols="2" align="left" colsep="1" rowsep="1">
<thead>
<row>
<entry>メソッド</entry>
<entry>意味</entry>
</row>
</thead>
<tbody>
<row>
<entry><literal>PHPUnit_Framework_MockObject_Stub_Return returnValue(mixed $value)</literal></entry>
<entry>メソッドが実行された場合の返り値を <literal>$value</literal> に設定します。</entry>
</row>
<row>
<entry><literal>PHPUnit_Framework_MockObject_Stub_ConsecutiveCalls onConsecutiveCalls(mixed $value, ...)</literal></entry>
<entry>メソッドが続けて実行された場合に返す値を設定します。</entry>
</row>
</tbody>
</tgroup>
</table>
<para>
また、スタブを使用することで、よりよい設計を行うことができるようにもなります。
あちこちで使用されているリソースを単一の窓口 (façade : ファサード)
経由でアクセスするようにすることで、
それを簡単にスタブに置き換えられるようになります。例えば、
データベースへのアクセスのコードをそこらじゅうにちりばめるのではなく、
その代わりに <literal>IDatabase</literal> インターフェイスを実装した単一の
<literal>Database</literal> オブジェクトを使用するようにします。すると、
<literal>IDatabase</literal> を実装したスタブを作成することで、
それをテストに使用できるようになるのです。同時に、
テストを行う際にスタブデータベースを使用するか
本物のデータベースを使用するかを選択できるようになります。
つまり開発時にはローカル環境でテストし、
統合テスト時には実際のデータベースでテストするといったことができるようになるのです。
</para>
<para>
スタブ化しなければならない機能は、たいてい同一オブジェクト内で密結合しています。
この機能ををひとつの結合したインターフェイスにまとめることで、
システムのそれ以外の部分との結合を緩やかにすることができます。
</para>
</section>
</chapter>
| {
"pile_set_name": "Github"
} |
<?php
class SQL
{
/**
* 解析一个SQL语句
*
* @param $sql
* @return array|bool
*/
public static function parseSql($sql)
{
# 单表join SELECT * FROM t1 LEFT JOIN t2 ON t2.a=t1.a
# 多表join SELECT * FROM t1 LEFT JOIN (t2, t3, t4) ON (t2.a=t1.a AND t3.b=t1.b AND t4.c=t1.c)
$tpl = "[a-z0-9_'`\"]+";
$preg = "#^select[ ]+(?<select>.+)[ ]+";
$preg .= "from (?:(?<app>$tpl)\.)?(?<table>$tpl)(?:[ ]+as[ ]+(?<tableAs>$tpl))?";
$preg .= "(?:[ ]+for[ ]+(?<for>[a-z0-9_,`'\"]+))?";
$preg .= "(?:[ ]+";
$preg .= "(?<leftJoin>left[ ]+)?join[ ]+(?<join>[a-z0-9,_` \)\(]+)";
$preg .= "[ ]+on (?<on>(?:(?! where | group[ ]+time | group[ ]+by | save[ ]+as ).)+)";
$preg .= ")?";
$preg .= "(?:[ ]+where (?<where>(?:(?! group[ ]+time | group[ ]+by | save[ ]+as ).)+))?";
$preg .= "(?:[ ]+group[ ]+by[ ]+(?<groupBy>[a-z0-9_\.,`]+))?";
$preg .= "(?:[ ]+group[ ]+time[ ]+(?<groupTime>(?:(?! save[ ]+as).)+))?";
$preg .= "(?:[ ]+save[ ]+as (?<saveAs>[a-z0-9_%,\.`]+))?$#i";
if (preg_match($preg, preg_replace('#[ ]*,[ ]+#', ',', str_replace(["\r\n", "\r", "\n"], ' ', $sql)), $m))
{
if (IS_DEBUG)
{
echo "Match: ";
print_r($m);
}
if (isset($m['join']) && $m['join'])
{
# join 模式
$joinOption = self::parseJoin($m);
if (false === $joinOption)
{
warn("sql join option error: join = {$m['join']}, on = {$m['join']}");
return false;
}
}
else
{
$joinOption = null;
}
$app = self::deQuoteValue($m['app']);
$table = self::deQuoteValue($m['table']);
$tableAs = self::deQuoteValue($m['tableAs']) ?: $table;
$select = trim($m['select']);
$for = trim($m['for']);
$where = trim($m['where']);
$groupBy = trim($m['groupBy']);
$groupTime = trim($m['groupTime']);
$saveAs = self::deQuoteValue(str_replace('`', '', $m['saveAs'])) ?: $table;
$option = [
'key' => substr(md5($sql .'_'. microtime(1)), 8, 16), //任务的key
'name' => "from {$table} to {$saveAs}",
'use' => true, //是否开启
'createTime' => time(),
'editTime' => 0,
'deleteTime' => 0,
'seriesKey' => null, //序列的key, 生成好完整的option后再赋值
'sql' => '', //SQL语句
'table' => $table,
'tableAs' => $tableAs,
'for' => [],
'saveAs' => [], //保存的设置
'start' => 0, //开启时间
'end' => 0, //结束时间
'allField' => false,
'fields' => [], //导出的字段设置
'where' => $where ? self::parseWhere($where, $joinOption) : [], //where条件
'groupTime' => [], //时间分组设置
'groupBy' => [], //字段分组设置
'function' => [], //所有使用到的方法列表
];
if ($joinOption)
{
$option['join'] =& $joinOption;
}
# 解析SELECT部分
if (!self::parseSelect($select, $option))
{
return false;
}
if ($app)
{
$option['for'][$app] = $app;
}
if ($for)
{
foreach (explode(',', $for) as $item)
{
$item = self::deQuoteValue($item);
$option['for'][$item] = $item;
}
ksort($option['for']);
}
if ($groupBy)
{
foreach(explode(',', $groupBy) as $item)
{
if (strpos($item, '.'))
{
list($space, $tmpItem) = explode('.', $item, 2);
$space = self::deQuoteValue($space);
$item = self::deQuoteValue($tmpItem);
if (isset($joinOption['join'][$space]))
{
$joinOption['fields'][$joinOption['join'][$space]][] = $item;
$item = $joinOption['join'][$space] . '.' . $item;
}
}
else
{
$item = self::deQuoteValue($item);
}
if ($item)
{
$option['groupBy'][] = $item;
}
}
if ($option['groupBy'])
{
# 重新排序
sort($option['groupBy']);
}
}
if ($joinOption)
{
# 对join中用到的字段去重并重新排序
foreach ($joinOption['fields'] as $k => &$v)
{
$v = array_unique($v);
sort($v);
}
unset($v);
}
$groupTimeSet = [];
if ($groupTime)
{
foreach (explode(',', trim($groupTime)) as $item)
{
$item = self::deQuoteValue($item);
if ($item === 'none')
{
$groupTimeSet['-'] = [0, '-'];
}
elseif (preg_match('#^(\d+)([a-z]+)$#i', $item, $m))
{
if ($m[2] !== 'M')$m[2] = strtolower($m[2]);
switch ($m[2])
{
case 'year':
case 'y':
$m[2] = 'y';
break;
case 'month':
case 'm':
$m[2] = 'm';
break;
case 'week':
case 'w':
$m[2] = 'w';
break;
case 'day':
case 'd':
$m[2] = 'd';
break;
case 'hour':
case 'h':
$m[2] = 'h';
break;
case 'minutes':
case 'M':
case 'i':
$m[2] = 'i';
break;
case 'seconds':
case 's':
$m[2] = 's';
break;
default:
debug("error group time: $item, exp: 3M, 1d, 1h, 30s");
continue 2;
}
$set = [
$m[1] >= 1 ? (int)$m[1] : ($m[2] == 's' ? 30 : 1),
$m[2],
];
$groupTimeSet[$set[0].$set[1]] = $set;
}
else
{
debug("error group time: $groupTime, exp: 3M, 1d, 1h, 30s");
}
}
}
# 设定时间分组
$option['groupTime'] = $groupTimeSet ?: ['1i' => [1, 'i', 60]];
# 根据时间分组设置输出表设置
$saveAsArr = explode(',', str_replace(' ', '', $saveAs));
$current = $saveAsArr[0];
$i = 0;
foreach ($option['groupTime'] as $k => $v)
{
if (isset($saveAsArr[$i]) && $saveAsArr[$i])
{
$current = $saveAsArr[$i];
if (strpos($current, '%') !== false && preg_match_all('#%([a-z])#i', $current, $m))
{
# 得到所有 % 开头的变量
$current = [
$current, // 当前设置
'date', // 处理类型, 方便以后扩展功能
array_values(array_unique($m[0])), // 所有需要替换的字符串
implode(',', array_unique($m[1])), // 对应的要替换的时间字符串
];
}
}
$option['saveAs'][$k] = $current;
$i++;
}
$option['sql'] = self::getSqlByOption($option);
$option['seriesKey'] = self::getSeriesKeyByOption($option);
return $option;
}
else
{
warn("error sql: $sql");
return false;
}
}
/**
* 根据配置序列的key
*
* @param $option
* @return string
*/
public static function getSeriesKeyByOption($option)
{
$key = "table:{$option['table']}";
if (isset($option['where']) && $option['where'])
{
$key .= '|where:' . $option['where']['$sql'];
}
if (isset($option['groupBy']) && $option['groupBy'])
{
$key .= '|group:' . implode(',', $option['groupBy']);
}
$key = substr(md5($key), 8, 16);
return $key;
}
/**
* 根据配置生成格式化后的SQL语句
*
* @param $option
* @param null $table
* @return bool|string
*/
public static function getSqlByOption($option)
{
$select = [];
if ($option['allField'])
{
$select[] = '*';
}
if (isset($option['join']) && $option['join'])
{
$joinMap = array_flip($option['join']['join']);
}
else
{
$joinMap = [];
}
$saveOption = $option['fields'];
foreach ($saveOption as $as => $opt)
{
$field = $opt['field'];
if ($opt['type'] === 'dist' && strpos($field, ','))
{
# 多字段
$tmp2 = explode(',', $field);
foreach ($tmp2 as & $tt)
{
if (strpos($tt, '.'))
{
$tmp = explode('.', $tt, 2);
if (isset($joinMap[$tmp[0]]))
{
$tt = "`{$joinMap[$tmp[0]]}`.`{$tmp[1]}`";
}
else
{
$tt = "`{$tmp[1]}`";
}
}
else
{
$tt = "`$tt`";
}
}
unset($tt);
$field = implode(', ', $tmp2);
}
elseif (strpos($field, '.'))
{
$tmp = explode('.', $field, 2);
if (isset($joinMap[$tmp[0]]))
{
$field = "`{$joinMap[$tmp[0]]}`.`{$tmp[1]}`";
}
else
{
$field = "`{$tmp[1]}`";
}
}
elseif ($field !== '*')
{
$field = "`$field`";
}
if ($opt['type'] === 'value')
{
$tmp = $field;
}
else
{
$tmp = strtoupper($opt['type']) . "({$field})";
}
if ($opt['field'] !== $as)
{
$tmp .= " AS `{$as}`";
}
$select[] = $tmp;
}
$sql = 'SELECT '. implode(', ', $select) . " FROM `{$option['table']}`";
if ($option['tableAs'] != $option['table'])
{
$sql .= " AS `{$option['tableAs']}`";
}
if (isset($option['for']) && $option['for'])
{
$sql .= " FOR ". implode(',', array_map(function($v){return "`$v`";}, $option['for']));
}
if (isset($option['join']) && $option['join'])
{
$sql .= ' ' . $option['join']['$sql'];
}
if (isset($option['where']) && $option['where'])
{
$sql .= " WHERE {$option['where']['$sql']}";
}
if (isset($option['groupBy']) && $option['groupBy'])
{
$groupBy = $option['groupBy'];
foreach ($groupBy as & $item)
{
if (strpos($item, '.'))
{
$tmp = explode('.', $item, 2);
if ($joinMap && isset($joinMap[$tmp[0]]))
{
$item = "`{$joinMap[$tmp[0]]}`.`{$tmp[1]}`";
}
else
{
$item = "`{$tmp[1]}`";
}
}
else
{
$item = "`{$item}`";
}
}
$sql .= " GROUP BY ". implode(', ', $groupBy);
}
$sql .= " GROUP TIME '". implode("', '", array_keys($option['groupTime'])) ."'";
if ($option['save'][0] !== $option['table'] || count($option['save']) > 1)
{
$saveAs = $option['saveAs'];
foreach ($saveAs as $k => &$v)
{
if (is_array($v))
{
$v = $v[0];
}
$v = "`$v`";
}
$sql .= " SAVE AS ". implode(', ', $saveAs);
}
return $sql;
}
public static function mergeOption($opt1, $opt2)
{
foreach ($opt2 as $key => $item)
{
if (is_array($item))
{
$opt1[$key] = self::mergeOption($opt1[$key], $item);
}
else
{
$opt1[$key] = $item;
}
}
return $opt1;
}
protected static function parseSelect($select, & $option)
{
if ($select === '*')
{
$option['allField'] = true;
}
else
{
$tpl = "[a-z0-9_'`\"]+";
$nextStep = '';
$joinOption =& $option['join'] ?: [];
foreach (explode(',', $select) as $s)
{
if ($nextStep)
{
if (preg_match('#[a-z0-9\._\'`"]+\)(?:[ ]+as[ ]+'. $tpl .')?#i', trim($s)))
{
$s = $nextStep .','. $s;
$nextStep = '';
}
else
{
$nextStep .= ','. $s;
continue;
}
}
elseif (preg_match('#^[a-z0-9\._\'"` ]+\([^\)]+$#i', $s, $m))
{
# 如果没有遇到封闭函数, 则可能是 select dist(a,b),c 这样被, 分开了
$nextStep = $s;
continue;
}
$s = trim($s);
if ($s === '*')
{
$option['allField'] = true;
}
elseif (preg_match("#^(?:(?<space>$tpl)\\.)?(?<field>$tpl)(?:[ ]+as[ ]+(?<as>$tpl))?(?:[ ]+)?$#i", $s, $mSelect))
{
# 匹配 select abc, abc as def
$field = self::deQuoteValue($mSelect['field']);
$as = self::deQuoteValue($mSelect['as'] ?: $field);
# 处理 select a.abc 的情形
if (isset($mSelect['space']))
{
$space = self::deQuoteValue($mSelect['space']);
if ($space)
{
if (isset($joinOption['join'][$space]))
{
$joinOption['fields'][$joinOption['join'][$space]][] = $field;
$field = "{$joinOption['join'][$space]}.$field";
}
elseif ($space !== $option['tableAs'])
{
warn("select error #1: $s, can not found table space $space");
return false;
}
}
}
else
{
$space = false;
}
$option['fields'][$as] = [
'type' => 'value',
'field' => $field,
];
if ($space)
{
$option['fields'][$as]['space'] = 'join';
}
$option['function']['value'][$field] = true;
}
elseif (preg_match("#^(?<type>[a-z0-9_]+)[ ]*\\((?<field>[a-z0-9_\\., \\*\"'`]+)\\)(?:[ ]+as[ ]+(?<as>$tpl))?$#i", $s, $mSelect))
{
# count|sum|max|min|avg|first|last|dist|exclude|listcount|list|value
# 匹配 select sum(abc), sum(abc) as def
$field = trim($mSelect['field'], " ,");
$type = strtolower(trim($mSelect['type']));
$as = str_replace(',', '_', self::deQuoteValue($mSelect['as'] ?: ($field === '*' ? $type : "`{$type}_{$field}`")));
if ($field === '*' && $type !== 'count')
{
# 只支持 count(*)
continue;
}
if ($type === 'dist' && false !== strpos($field, ','))
{
# Dist支持多字段模式
$fields = explode(',', $field);
foreach ($fields as & $item)
{
if (strpos($item, '.'))
{
list($space, $item) = explode('.', $item);
$space = self::deQuoteValue($space);
$item = self::deQuoteValue($item);
if (isset($joinOption['join'][$space]))
{
$joinOption['fields'][$joinOption['join'][$space]][] = $item;
$item = "{$joinOption['join'][$space]}.$item";
}
elseif ($space !== $option['tableAs'])
{
warn("select error #2: $field, can not found table space $space");
return false;
}
}
else
{
$item = self::deQuoteValue($item);
}
}
unset($item);
sort($fields);
$field = implode(',', $fields);
}
else
{
$fields = true;
if (preg_match("#^($tpl)\\.($tpl)$#i", $field, $m2))
{
$space = self::deQuoteValue($m2[1]);
$field = self::deQuoteValue($m2[2]);
if (isset($joinOption['join'][$space]))
{
$joinOption['fields'][$joinOption['join'][$space]][] = $field;
$field = $joinOption['join'][$space] . '.' . $field;
}
elseif ($space !== $option['tableAs'])
{
warn("select error #3: $field, can not found table space $m2[1]");
return false;
}
}
else
{
$field = self::deQuoteValue($field);
}
}
$option['fields'][$as] = [
'type' => $type,
'field' => $field,
];
switch ($type)
{
case 'avg':
$option['function']['sum'][$field] = true;
$option['function']['count']['*'] = true;
break;
case 'dist':
$option['function']['dist'][$field] = $fields;
break;
case 'list':
case 'listcount':
$option['function']['dist'][$field] = true;
break;
case 'count':
$option['fields'][$as] = [
'type' => $type,
'field' => strpos($field, '.') ? $field : '*',
];
$option['function']['count']['*'] = true;
break;
default:
$option['function'][$type][$field] = true;
break;
}
}
else
{
warn("select error #4, unknown select: $s");
return false;
}
}
}
return true;
}
/**
* 解析 JOIN ON 语句
*
* @param $m
* @return array|bool
*/
protected static function parseJoin($m)
{
if (!isset($m['on']))return false;
$join = trim($m['join'], ' )(');
$on = trim($m['on'], ' )(');
if (!$on)return false;
$tmpJoin = [];
foreach (explode(',', $join) as $item)
{
if (preg_match('#^([a-z0-9_`]+)[ ]+as[ ]+([a-z0-9_`]+)$#i', trim($item), $m1))
{
$f1 = self::deQuoteValue($m1[1]);
$f2 = self::deQuoteValue($m1[2]);
}
else
{
$f1 = self::deQuoteValue($item);
$f2 = $f1;
}
$tmpJoin[$f2] = $f1;
}
$join = $tmpJoin;
unset($tmpJoin);
$table = self::deQuoteValue($m['table']);
$tableAs = null;
if (isset($m['tableAs']))
{
$tableAs = self::deQuoteValue($m['tableAs']);
}
if (!$tableAs)
{
$tableAs = $table;
}
$joinOption = [
'table' => $table,
'tableAs' => $tableAs,
'leftJoin' => isset($m['leftJoin']) && $m['leftJoin'] ? true : false,
'join' => $join,
'on' => [],
'fields' => [],
'$sql' => '',
];
$onWhere = self::parseWhere($on, $joinOption, true);
# 拼接出SQL语句
$sql = ($joinOption['leftJoin'] ? 'LEFT ' : '') . 'JOIN ';
if (count($joinOption['join']) > 1)
{
$sql .= '(';
foreach ($joinOption['join'] as $k => $v)
{
$sql .= "`$v`" . ($k === $v ? '' : " AS `$k`") .", ";
}
$sql = substr($sql, 0, -2) . ")";
}
else
{
$k = key($joinOption['join']);
$v = current($joinOption['join']);
$sql .= "`$v`" . ($k === $v ? '' : " AS `$k`");
}
foreach ($onWhere['$item'] as $item)
{
$k = [$item['field'], $item['value']];
sort($k);
$joinOption['on'][] = $k;
}
if (count($onWhere['$item']) > 1)
{
$sql .= " ON ({$onWhere['$sql']})";
}
else
{
$sql .= " ON {$onWhere['$sql']}";
}
$joinOption['$sql'] = $sql;
return $joinOption;
}
/**
* 解析一个where字符串为一个多维结构数组
*
* 例如:
*
* ((a < 1 and b % 3 = 2 and (aa=1 or bb=2 or (cc=3 and dd=4))) or ccc = 3) and (aaaa=1 or bbbb=2)
*
* @param $where
* @param $joinOption
* @return array
*/
protected static function parseWhere($where, & $joinOption, $joinWhere = false)
{
$funHash = [];
$parseWhere = function($where) use (& $funHash, & $joinOption, $joinWhere)
{
if (preg_match('#^(?:(?<space>[a-z0-9_`]+)\.)?(?<field>[a-z0-9_`]+)(?:(?:[ ]+)?(?<typeM>%|>>|<<|mod|in|\-|\+|x|\*|/)(?:[ ]+)?(?<mValue>[0-9\.]+))?(?:[ ]+)?(?<type>=|\!=|\<\>|\>|\<)(?:[ ]+)?(?<value>.*)$#i', $where, $mWhere))
{
$space = self::deQuoteValue($mWhere['space']);
$field = self::deQuoteValue($mWhere['field']);
$type = $mWhere['type'] === '<>' ? '!=' : $mWhere['type'];
$typeM = $mWhere['typeM'];
$mValue = $mWhere['mValue'];
$valueString = trim($mWhere['value']);
if ($joinWhere || preg_match('#^`(.*)`$#', $mWhere['value']))
{
# 字段 = 字段模式
# where `field1` = `field2`
$value = $mWhere['value'];
$fMode = true;
if (strpos($value, '.'))
{
$tmp = array_map('self::deQuoteValue', explode('.', $value, 2));
$valueString = "`{$tmp[0]}`.`{$tmp[1]}`";
if ($tmp[0] === $joinOption['tableAs'])
{
$value = "{$joinOption['table']}.{$tmp[1]}";
}
elseif (isset($joinOption['join'][$tmp[0]]))
{
$tmpTable = $joinOption['join'][$tmp[0]];
$value = "$tmpTable.{$tmp[1]}";
$joinOption['fields'][$tmpTable][] = $tmp[1];
}
else
{
$value = implode('.', $tmp);
}
}
else
{
$value = self::deQuoteValue($value);
$valueString = "`{$value}`";
}
}
else
{
$value = self::deQuoteValue($mWhere['value']);
$fMode = false;
}
if ($space === '__fun__')
{
# time_format(a, '%Y%m') = 201601
if (isset($funHash[$field]))
{
$opt = $funHash[$field];
$field = $opt['field'];
$space = $opt['space'];
}
else
{
return false;
}
$typeM = 'func';
}
elseif ($typeM === 'in')
{
if (isset($funHash[$field]))
{
$opt = $funHash[$field];
$field = $opt['field'];
$space = $opt['space'];
}
else
{
return false;
}
$typeM = 'func';
}
if ($space)
{
$fieldString = "`$space`.`$field`";
if ($space === $joinOption['tableAs'])
{
$field = "{$joinOption['table']}.{$field}";
}
elseif (isset($joinOption['join'][$space]))
{
$joinOption['fields'][$joinOption['join'][$space]][] = $field;
$field = "{$joinOption['join'][$space]}.{$field}";
}
}
else
{
$fieldString = "`$field`";
}
$option = [
'$sql' => $fieldString .($typeM ? " $typeM ". $mValue:'') . " $type " . $valueString,
'field' => $field,
'fMode' => $fMode,
'type' => $type,
'value' => $value,
'typeM' => $typeM,
'mValue'=> $mValue,
];
if ($typeM === 'func' && isset($opt))
{
$option['arg'] = $opt['arg'];
$option['fun'] = $opt['fun'];
$arg = $opt['argString'];
if ($opt['fieldArg'])
{
$option['field'] = $opt['fieldArg'];
}
if ($opt['fun'] === 'in')
{
$option['$sql'] = "$fieldString IN($arg)";
}
elseif ($opt['fun'] === 'not_in')
{
$option['$sql'] = "$fieldString NOT IN($arg)";
}
else
{
$option['$sql'] = "{$opt['fun']}({$arg}) {$type} {$valueString}";
}
}
return $option;
}
return false;
};
$parseFun = function($space, $field, $arg, $fun) use (& $joinOption)
{
$space = self::deQuoteValue($space);
$field = self::deQuoteValue($field);
$fieldArg = [];
$argString = [];
if ($space && $field && isset($joinOption['join'][$space]))
{
# 这个是被join的表的字段
$joinOption['fields'][$joinOption['join'][$space]][] = $field;
}
foreach ($arg as $i => & $tmp)
{
if (preg_match('#^`(.*)`$#', $tmp))
{
# 字段模式
if (strpos($tmp, '.'))
{
list($space2, $field2) = explode('.', $tmp, 2);
$space2 = self::deQuoteValue($space2);
$field2 = self::deQuoteValue($field2);
$argString[] = "`$space2`.`$field2`";
if (isset($joinOption['join'][$space2]))
{
$joinOption['fields'][$joinOption['join'][$space2]][] = $field2;
$space2 = $joinOption['join'][$space2];
}
$tmp = "$space2.$field2";
}
else
{
$tmp = self::deQuoteValue($tmp);
$argString[] = "`$tmp`";
}
$fieldArg[$i] = $tmp;
}
else
{
$tmp = self::deQuoteValue($tmp);
if (!is_numeric($tmp))
{
$argString[] = "'$tmp'";
}
else
{
$argString[] = $tmp;
}
}
}
unset($tmp);
$argString = implode(', ', $argString);
return [
'fun' => $fun,
'space' => $space,
'field' => $field,
'arg' => $arg,
'argString' => $argString,
'fieldArg' => $fieldArg,
];
};
$where = preg_replace('# and #i', ' && ', preg_replace('# or #i', ' || ', $where));
# 解析in, not in
if (preg_match_all('#(?:(?<space>[a-z0-9_`]+)\.)?(?<field>[a-z0-9`]+)[ ]+(?<notIn>not[ ]+)?in[ ]*\((?<arg>.+)\)#Ui', $where, $m))
{
foreach ($m[0] as $k => $v)
{
$hash = md5($v);
$arg = array_map('self::deQuoteValue', explode(',', $m['arg'][$k]));
$arg = array_unique($arg);
sort($arg);
$funHash[$hash] = $parseFun($m['space'][$k], $m['field'][$k], $arg, $m['notIn'][$k] ? 'not_in' : 'in');
$where = str_replace($v, "{$hash} in 0 = 0", $where);
}
}
# 预处理函数
# Exp: from_unixtime(time, "%H") = 2016
$match = '#(?<fun>[a-z_0-9]+)\((?<arg>[^\)]+)\)#Ui';
if (preg_match_all($match, $where, $m))
{
foreach ($m[0] as $k => $v)
{
$hash = md5($v);
$funHash[$hash] = $parseFun('', '', explode(',', $m['arg'][$k]), strtolower($m['fun'][$k]));
if ('time_format' === $funHash[$hash]['fun'])
{
$funHash[$hash]['fun'] = 'from_unixtime';
}
# 格式化成PHP的时间参数
if ($funHash[$hash]['fun'] === 'from_unixtime')
{
$caracs = [
'%d' => 'd',
'%a' => 'D',
'%e' => 'j',
'%A' => 'l',
'%u' => 'N',
'%w' => 'w',
'%j' => 'z',
'%V' => 'W',
'%B' => 'F',
'%m' => 'm',
'%b' => 'M',
'%G' => 'o',
'%Y' => 'Y',
'%y' => 'y',
'%P' => 'a',
'%p' => 'A',
'%l' => 'g',
'%I' => 'h',
'%H' => 'H',
'%M' => 'i',
'%S' => 's',
'%z' => 'O',
'%Z' => 'T',
'%s' => 'U',
];
$funHash[$hash]['arg'][0] = strtr($funHash[$hash]['arg'][0], $caracs);
}
$where = str_replace($v, "__fun__.{$hash}", $where);
}
}
$len = strlen($where);
$groupLevel = 0;
$tmpWhere = '';
$whereArr = [];
$whereGroup = '&&';
$nextGroup = null;
for ($i = 0; $i < $len; $i++)
{
$subStr = $where[$i];
$tmpGroupLevel = $groupLevel;
if ($nextGroup)
{
$whereGroup = $nextGroup;
$nextGroup = null;
}
if (in_array($subPot = substr($where, $i, 4), [' && ', ' || ']))
{
$nextGroup = trim($subPot);
}
else
{
$nextGroup = null;
}
if ($nextGroup)
{
$whereStr = $tmpWhere;
$tmpWhere = '';
}
elseif ($subStr === '(')
{
$groupLevel++;
$whereStr = $tmpWhere;
$tmpWhere = '';
}
elseif ($subStr === ')')
{
$groupLevel--;
$whereStr = $tmpWhere;
$tmpWhere = '';
}
elseif ($i + 1 === $len)
{
$tmpWhere .= $subStr;
$whereStr = $tmpWhere;
}
else
{
$whereStr = '';
$tmpWhere .= $subStr;
}
if ($whereStr)
{
$whereStr = trim($whereStr);
if (preg_match('#^(&&|\|\|) (.*)$#', $whereStr, $m))
{
$whereArr[] = [
'level' => $tmpGroupLevel,
'type' => $nextGroup ?: $whereGroup,
'query' => $m[1],
];
$whereStr = trim($m[2]);
}
$whereArr[] = [
'level' => $tmpGroupLevel,
'type' => $nextGroup ?: $whereGroup,
'query' => $whereStr,
];
}
}
$tmpLevel = 0;
$tmpArr = [
'$type' => '&&',
'$level' => 0,
'$sql' => '',
'$item' => [],
];
$tmpArrList = [];
$whereOption =& $tmpArr;
$tmpType = '&&';
foreach ($whereArr as $item)
{
if ($item['level'] < $tmpLevel)
{
# 上一级
for ($j = 0; $j < $tmpLevel - $item['level']; $j++)
{
end($tmpArrList);
$key = key($tmpArrList);
unset($parentArr);
$parentArr =& $tmpArrList[$key];
unset($tmpArrList[$key]);
}
$tmpArr =& $parentArr;
}
elseif ($item['level'] > $tmpLevel)
{
# 下一级
for ($j = 0; $j < $item['level'] - $tmpLevel; $j++)
{
unset($tmpArrOld);
$tmpArrOld =& $tmpArr;
unset($tmpArr);
$tmpArr = [
'$type' => $item['type'],
'$level' => $item['level'],
'$sql' => '',
'$item' => [],
];
$tmpArrOld['$item'][] =& $tmpArr;
if (isset($tmpArrOld['$item'][0]))
{
$tmpArrList[] =& $tmpArrOld;
}
}
}
elseif ($tmpType !== $item['type'])
{
# 类型不相同
unset($tmpArrOld);
$tmpArrOld =& $tmpArr;
unset($tmpArr);
$tmpArr = [
'$type' => $item['type'],
'$level' => $item['level'],
'$sql' => '',
'$item' => [],
];
if (isset($tmpArrOld['$item'][0]))
{
$tmpArr['$item'][] =& $tmpArrOld;
}
}
if ($item['query'] === '&&' || $item['query'] === '||')
{
if ($tmpArr['$type'] !== $item['query'])
{
# 和前面分组不一样
if (isset($tmpArr['$item'][1]))
{
# 已经有了2个, 需要新建一个分组
unset($tmpArrOld);
$tmpArrOld =& $tmpArr;
unset($tmpArr);
$tmpArr = [
'$type' => $item['query'],
'$level' => $item['level'],
'$sql' => '',
'$item' => [],
];
if (isset($tmpArrOld['$item'][0]))
{
$tmpArr['$item'][] =& $tmpArrOld;
}
}
else
{
$tmpArr['$type'] = $item['query'];
}
}
}
else
{
if ($tmpOpt = $parseWhere($item['query']))
{
$tmpArr['$item'][] = $tmpOpt;
}
}
$tmpLevel = $item['level'];
$tmpType = $item['type'];
}
if (count($tmpArrList) === 0)
{
unset($whereOption);
$whereOption = $tmpArr;
}
$whereOption = self::whereOptionFormat($whereOption);
return $whereOption;
}
protected static function whereOptionFormat($option)
{
# 处理排序
$sort = function($a, $b)
{
$arr = [$a['$sql'], $b['$sql']];
sort($arr);
return $a['$sql'] === $arr[0] ? -1 : 1;
};
if ($option['$type'] !== 'where' && $option['$item'])
{
foreach ($option['$item'] as $k => & $item)
{
if (isset($item['$type']))
{
$item = self::whereOptionFormat($item);
if (count($item['$item']) === 0)
{
# 移除空的数据
unset($option['$item'][$k]);
}
}
}
unset($item);
usort($option['$item'], $sort);
$sql = [];
foreach ($option['$item'] as $tmp)
{
$sql[] = isset($tmp['$type']) ? '('.$tmp['$sql'].')' : $tmp['$sql'];
}
$option['$sql'] = implode(" {$option['$type']} ", $sql);
}
return $option;
}
public static function deQuoteValue($value)
{
return preg_replace('#^`(.*)`$#', '$1', preg_replace('#^"(.*)"$#', '$1', preg_replace("#^'(.*)'$#", '$1', trim($value))));
}
} | {
"pile_set_name": "Github"
} |
#pragma once
#include <Register/Utility.hpp>
namespace Kvasir {
//Crossbar Switch
namespace XbarSel0{ ///<Crossbar Select Register 0
using Addr = Register::Address<0x40055000,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel0{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel1{};
}
namespace XbarSel1{ ///<Crossbar Select Register 1
using Addr = Register::Address<0x40055002,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel2{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel3{};
}
namespace XbarSel2{ ///<Crossbar Select Register 2
using Addr = Register::Address<0x40055004,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel4{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel5{};
}
namespace XbarSel3{ ///<Crossbar Select Register 3
using Addr = Register::Address<0x40055006,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel6{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel7{};
}
namespace XbarSel4{ ///<Crossbar Select Register 4
using Addr = Register::Address<0x40055008,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel8{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel9{};
}
namespace XbarSel5{ ///<Crossbar Select Register 5
using Addr = Register::Address<0x4005500a,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel10{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel11{};
}
namespace XbarSel6{ ///<Crossbar Select Register 6
using Addr = Register::Address<0x4005500c,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel12{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel13{};
}
namespace XbarSel7{ ///<Crossbar Select Register 7
using Addr = Register::Address<0x4005500e,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel14{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel15{};
}
namespace XbarSel8{ ///<Crossbar Select Register 8
using Addr = Register::Address<0x40055010,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel16{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel17{};
}
namespace XbarSel9{ ///<Crossbar Select Register 9
using Addr = Register::Address<0x40055012,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel18{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel19{};
}
namespace XbarSel10{ ///<Crossbar Select Register 10
using Addr = Register::Address<0x40055014,0xffffe0e0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(4,0),Register::ReadWriteAccess,unsigned> sel20{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(12,8),Register::ReadWriteAccess,unsigned> sel21{};
}
namespace XbarSel11{ ///<Crossbar Select Register 11
using Addr = Register::Address<0x40055016,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel22{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel23{};
}
namespace XbarSel12{ ///<Crossbar Select Register 12
using Addr = Register::Address<0x40055018,0xffffe0e0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(4,0),Register::ReadWriteAccess,unsigned> sel24{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(12,8),Register::ReadWriteAccess,unsigned> sel25{};
}
namespace XbarSel13{ ///<Crossbar Select Register 13
using Addr = Register::Address<0x4005501a,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel26{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel27{};
}
namespace XbarSel14{ ///<Crossbar Select Register 14
using Addr = Register::Address<0x4005501c,0xffffc0c0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel28{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(13,8),Register::ReadWriteAccess,unsigned> sel29{};
}
namespace XbarSel15{ ///<Crossbar Select Register 15
using Addr = Register::Address<0x4005501e,0xffffe0e0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(4,0),Register::ReadWriteAccess,unsigned> sel30{};
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(12,8),Register::ReadWriteAccess,unsigned> sel31{};
}
namespace XbarSel16{ ///<Crossbar Select Register 16
using Addr = Register::Address<0x40055020,0xffffffc0,0x00000000,unsigned>;
///no description available
constexpr Register::FieldLocation<Addr,Register::maskFromRange(5,0),Register::ReadWriteAccess,unsigned> sel32{};
}
namespace XbarCtrl0{ ///<Crossbar Control Register 0
using Addr = Register::Address<0x40055022,0xffffffe0,0x00000000,unsigned>;
///DMA Enable for XBAR_OUT0
enum class Den0Val {
v0=0x00000000, ///<DMA disabled
v1=0x00000001, ///<DMA enabled
};
constexpr Register::FieldLocation<Addr,Register::maskFromRange(0,0),Register::ReadWriteAccess,Den0Val> den0{};
namespace Den0ValC{
constexpr Register::FieldValue<decltype(den0)::Type,Den0Val::v0> v0{};
constexpr Register::FieldValue<decltype(den0)::Type,Den0Val::v1> v1{};
}
///Interrupt Enable for XBAR_OUT0
enum class Ien0Val {
v0=0x00000000, ///<Interrupt disabled
v1=0x00000001, ///<Interrupt enabled
};
constexpr Register::FieldLocation<Addr,Register::maskFromRange(1,1),Register::ReadWriteAccess,Ien0Val> ien0{};
namespace Ien0ValC{
constexpr Register::FieldValue<decltype(ien0)::Type,Ien0Val::v0> v0{};
constexpr Register::FieldValue<decltype(ien0)::Type,Ien0Val::v1> v1{};
}
///Active edge for edge detection on XBAR_OUT0
enum class Edge0Val {
v00=0x00000000, ///<STS0 never asserts
v01=0x00000001, ///<STS0 asserts on rising edges of XBAR_OUT0
v10=0x00000002, ///<STS0 asserts on falling edges of XBAR_OUT0
v11=0x00000003, ///<STS0 asserts on rising and falling edges of XBAR_OUT0
};
constexpr Register::FieldLocation<Addr,Register::maskFromRange(3,2),Register::ReadWriteAccess,Edge0Val> edge0{};
namespace Edge0ValC{
constexpr Register::FieldValue<decltype(edge0)::Type,Edge0Val::v00> v00{};
constexpr Register::FieldValue<decltype(edge0)::Type,Edge0Val::v01> v01{};
constexpr Register::FieldValue<decltype(edge0)::Type,Edge0Val::v10> v10{};
constexpr Register::FieldValue<decltype(edge0)::Type,Edge0Val::v11> v11{};
}
///Edge detection status for XBAR_OUT0
enum class Sts0Val {
v0=0x00000000, ///<Active edge not yet detected on XBAR_OUT0
v1=0x00000001, ///<Active edge detected on XBAR_OUT0
};
constexpr Register::FieldLocation<Addr,Register::maskFromRange(4,4),Register::ReadWriteAccess,Sts0Val> sts0{};
namespace Sts0ValC{
constexpr Register::FieldValue<decltype(sts0)::Type,Sts0Val::v0> v0{};
constexpr Register::FieldValue<decltype(sts0)::Type,Sts0Val::v1> v1{};
}
}
}
| {
"pile_set_name": "Github"
} |
#
# test directory makefile
#
FNAME := Her2k
SRC_PATH := ../..
OBJ_PATH := .
INST_PATH := $(HOME)/flame
LIB_PATH := $(INST_PATH)/lib
INC_PATH := $(INST_PATH)/include
FLAME_LIB := $(LIB_PATH)/libflame.a
BLAS_LIB := $(LIB_PATH)/libgoto.a
#BLAS_LIB := -L/opt/intel/mkl/10.0.3.020/lib/em64t -lmkl -lguide -lpthread
CC := gcc
FC := gfortran
LINKER := $(CC)
CFLAGS := -I$(SRC_PATH) -I$(INC_PATH) -g -O3 -Wall
FFLAGS := $(CFLAGS)
#LDFLAGS := -L/usr/lib/gcc/x86_64-pc-linux-gnu/4.2.3 -L/usr/lib/gcc/x86_64-pc-linux-gnu/4.2.3/../../../../lib64 -L/lib/../lib64 -L/usr/lib/../lib64 -L/usr/lib/gcc/x86_64-pc-linux-gnu/4.2.3/../../../../x86_64-pc-linux-gnu/lib -L/usr/lib/gcc/x86_64-pc-linux-gnu/4.2.3/../../.. -lgfortranbegin -lgfortran -lm -lpthread
LDFLAGS := -L/lusr/opt/gcc-4.2.2/lib/gcc/i686-pc-linux-gnu/4.2.2 -L/lusr/opt/gcc-4.2.2/lib/gcc/i686-pc-linux-gnu/4.2.2/../../.. -lgfortranbegin -lgfortran -lm -lpthread
TEST_OBJS := $(patsubst $(SRC_PATH)/%.c, $(OBJ_PATH)/%.o, $(wildcard $(SRC_PATH)/*.c))
TEST_OBJS += test_$(FNAME).o \
time_$(FNAME).o \
REF_$(FNAME).o
TEST_BIN := test_$(FNAME).x
$(OBJ_PATH)/%.o: $(SRC_PATH)/%.c
$(CC) $(CFLAGS) -c $< -o $@
%.o: %.c
$(CC) $(CFLAGS) -c $< -o $@
test_$(FNAME): $(TEST_OBJS)
$(LINKER) $(TEST_OBJS) $(LDFLAGS) $(FLAME_LIB) $(BLAS_LIB) -o $(TEST_BIN)
clean:
rm -f *.o $(OBJ_PATH)/*.o *~ core *.x
| {
"pile_set_name": "Github"
} |
#include <stdexcept>
#include <string>
#include "OnlineDB/Oracle/interface/Oracle.h"
#include "OnlineDB/EcalCondDB/interface/FEConfigFgrEETowerDat.h"
#include "OnlineDB/EcalCondDB/interface/FEConfigFgrInfo.h"
using namespace std;
using namespace oracle::occi;
FEConfigFgrEETowerDat::FEConfigFgrEETowerDat() {
m_env = nullptr;
m_conn = nullptr;
m_writeStmt = nullptr;
m_readStmt = nullptr;
m_lut = 0;
}
FEConfigFgrEETowerDat::~FEConfigFgrEETowerDat() {}
void FEConfigFgrEETowerDat::prepareWrite() noexcept(false) {
this->checkConnection();
try {
m_writeStmt = m_conn->createStatement();
m_writeStmt->setSQL("INSERT INTO " + getTable() +
" (fgr_conf_id, logic_id, "
"lut_value ) "
"VALUES (:fgr_conf_id, :logic_id, "
":lut_value )");
} catch (SQLException& e) {
throw(std::runtime_error("FEConfigFgrEETowerDat::prepareWrite(): " + e.getMessage()));
}
}
void FEConfigFgrEETowerDat::writeDB(const EcalLogicID* ecid,
const FEConfigFgrEETowerDat* item,
FEConfigFgrInfo* iconf) noexcept(false) {
this->checkConnection();
this->checkPrepare();
int iconfID = iconf->fetchID();
if (!iconfID) {
throw(std::runtime_error("FEConfigFgrEETowerDat::writeDB: ICONF not in DB"));
}
int logicID = ecid->getLogicID();
if (!logicID) {
throw(std::runtime_error("FEConfigFgrEETowerDat::writeDB: Bad EcalLogicID"));
}
try {
m_writeStmt->setInt(1, iconfID);
m_writeStmt->setInt(2, logicID);
m_writeStmt->setInt(3, item->getLutValue());
m_writeStmt->executeUpdate();
} catch (SQLException& e) {
throw(std::runtime_error("FEConfigFgrEETowerDat::writeDB(): " + e.getMessage()));
}
}
void FEConfigFgrEETowerDat::fetchData(map<EcalLogicID, FEConfigFgrEETowerDat>* fillMap,
FEConfigFgrInfo* iconf) noexcept(false) {
this->checkConnection();
fillMap->clear();
iconf->setConnection(m_env, m_conn);
int iconfID = iconf->fetchID();
if (!iconfID) {
// throw(std::runtime_error("FEConfigFgrEETowerDat::writeDB: ICONF not in DB"));
return;
}
try {
m_readStmt->setSQL(
"SELECT cv.name, cv.logic_id, cv.id1, cv.id2, cv.id3, cv.maps_to, "
"d.lut_value "
"FROM channelview cv JOIN " +
getTable() +
" d "
"ON cv.logic_id = d.logic_id AND cv.name = cv.maps_to "
"WHERE fgr_conf_id = :fgr_conf_id");
m_readStmt->setInt(1, iconfID);
ResultSet* rset = m_readStmt->executeQuery();
std::pair<EcalLogicID, FEConfigFgrEETowerDat> p;
FEConfigFgrEETowerDat dat;
while (rset->next()) {
p.first = EcalLogicID(rset->getString(1), // name
rset->getInt(2), // logic_id
rset->getInt(3), // id1
rset->getInt(4), // id2
rset->getInt(5), // id3
rset->getString(6)); // maps_to
dat.setLutValue(rset->getInt(7));
p.second = dat;
fillMap->insert(p);
}
} catch (SQLException& e) {
throw(std::runtime_error("FEConfigFgrEETowerDat::fetchData: " + e.getMessage()));
}
}
void FEConfigFgrEETowerDat::writeArrayDB(const std::map<EcalLogicID, FEConfigFgrEETowerDat>* data,
FEConfigFgrInfo* iconf) noexcept(false) {
this->checkConnection();
this->checkPrepare();
int iconfID = iconf->fetchID();
if (!iconfID) {
throw(std::runtime_error("FEConfigFgrEETowerDat::writeArrayDB: ICONF not in DB"));
}
int nrows = data->size();
int* ids = new int[nrows];
int* iconfid_vec = new int[nrows];
int* xx = new int[nrows];
ub2* ids_len = new ub2[nrows];
ub2* iconf_len = new ub2[nrows];
ub2* x_len = new ub2[nrows];
const EcalLogicID* channel;
const FEConfigFgrEETowerDat* dataitem;
int count = 0;
typedef map<EcalLogicID, FEConfigFgrEETowerDat>::const_iterator CI;
for (CI p = data->begin(); p != data->end(); ++p) {
channel = &(p->first);
int logicID = channel->getLogicID();
if (!logicID) {
throw(std::runtime_error("FEConfigFgrEETowerDat::writeArrayDB: Bad EcalLogicID"));
}
ids[count] = logicID;
iconfid_vec[count] = iconfID;
dataitem = &(p->second);
// dataIface.writeDB( channel, dataitem, iconf);
int x = dataitem->getLutValue();
xx[count] = x;
ids_len[count] = sizeof(ids[count]);
iconf_len[count] = sizeof(iconfid_vec[count]);
x_len[count] = sizeof(xx[count]);
count++;
}
try {
m_writeStmt->setDataBuffer(1, (dvoid*)iconfid_vec, OCCIINT, sizeof(iconfid_vec[0]), iconf_len);
m_writeStmt->setDataBuffer(2, (dvoid*)ids, OCCIINT, sizeof(ids[0]), ids_len);
m_writeStmt->setDataBuffer(3, (dvoid*)xx, OCCIINT, sizeof(xx[0]), x_len);
m_writeStmt->executeArrayUpdate(nrows);
delete[] ids;
delete[] iconfid_vec;
delete[] xx;
delete[] ids_len;
delete[] iconf_len;
delete[] x_len;
} catch (SQLException& e) {
throw(std::runtime_error("FEConfigFgrEETowerDat::writeArrayDB(): " + e.getMessage()));
}
}
| {
"pile_set_name": "Github"
} |
import re
__product__ = "Radware (AppWall WAF)"
def detect(content, **kwargs):
content = str(content)
detection_schema = (
re.compile(r".\bcloudwebsec.radware.com\b.", re.I),
re.compile(r".>unauthorized.activity.has.been.detected<.", re.I),
re.compile(r"with.the.following.case.number.in.its.subject:.\d+.", re.I)
)
for detection in detection_schema:
if detection.search(content) is not None:
return True
| {
"pile_set_name": "Github"
} |
<html>
<!--#config errmsg="" -->
<!--#include virtual="/zinc/required/tn1_head.html" -->
<!--#include virtual="/zinc/required/tn2_mirror_options.html" -->
<!--#include virtual="/zinc/required/tn3_gradient.html" -->
<!--#include virtual="/zinc/required/tn4_topnav.html" -->
<!--#include virtual="/zinc/required/tn5_gradient2.html" -->
<!-- // End: Top Area // -->
<!--#include virtual="/zinc/required/container_top.html" -->
<!-- // Start: Main Content Area // -->
<span class="sect"> <b>Section: </b> <a href="/">..</a> / 0711-exploits /</span><br /><br />
<center>
<table border=0 align=center width=90%>
<tr><td>
</td></tr></table>
</center>
<p>
<table border="0" cellpadding="2" cellspacing="1" width="90%" align="center"><tr><td valign="top" nowrap width="50%">Page 3 of 8</td><td></td></tr><tr><td valign="top" nowrap>
<a href="indexsize2.html"><<</a> <a href="indexsize.html">1</a> <a href="indexsize2.html">2</a> <b>3</b> <a href="indexsize4.html">4</a> <a href="indexsize5.html">5</a> <a href="indexsize6.html">6</a> <a href="indexsize7.html">7</a> <a href="indexsize8.html">8</a> <a href="indexsize4.html">>></a> </td><td align="right">Files 50 - 75 of 177</td></tr>
<tr><td>Currently sorted by: File Size</td><td align="right">Sort By: <a href="/0711-exploits/index.html">File Name</a>, <a href="/0711-exploits/indexdate.html">Last Modified</a> </td></tr></table>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/PR07-29.txt>PR07-29.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
Two cross site scripting vulnerabilities have been discovered in the Blue coat ProxySG Management Console. Versions below 4.2.6.1 and 5.2.2.5 are susceptible.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:adrian.pastor[at]procheckup.com">Adrian Pastor</a></td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.procheckup.com/">http://www.procheckup.com/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2423</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 1 19:28:34 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>4300508a909c96cafc2e2f84ee679c17</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/guppy-rfilfi.txt>guppy-rfilfi.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
GuppY version 4.6.3 suffers from remote and local file inclusion vulnerabilities.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:irk4z[at]yahoo.pl">irk4z</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2410</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 5 10:48:44 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>701311e946dcca83d2cc2837b8c8cd67</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/bitdefenderoscan-activex.txt>bitdefenderoscan-activex.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
BitDefender Online Scanner 8 ActiveX heap overflow exploit that makes use of OScan8.ocx and OScan81.ocx.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:nphinity[at]gmail.com">Nphinity</a></td></tr><tr class="finfo"><td><b>Related File:</b></td><td><a href="/0711-advisories/EEYE-bitdefender.txt">EEYE-bitdefender.txt</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2367</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 27 22:52:15 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>dad0a96eb5485519621d9f97946244b3</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/eggblog-xss.txt>eggblog-xss.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
Eggblog version 3.1.0 is susceptible to cross site scripting vulnerabilities.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:mesut[at]h-labs.org">Mesut Timur</a></td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.h-labs.org/">http://www.h-labs.org/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2273</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 12 22:44:01 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>fb2bc0b01041daf3e29e60d0c593348c</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/real-overflow.txt>real-overflow.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
It appears that RealNetworks RealPlayer suffers from more stack overflow vulnerabilities in ierpplug.dll.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:elazarb[at]earthlink.net">Elazar Broad</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2247</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 26 22:13:40 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>fc4a3f5f53f505cbdae2277078a65d3c</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/PR07-02.txt>PR07-02.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
The Liferay Portal login page is vulnerable to a cross site scripting vulnerability within the "login" field processed by the "/c/portal/login" server-side script.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:adrian.pastor[at]procheckup.com">Adrian Pastor</a></td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.procheckup.com/">http://www.procheckup.com/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2218</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 16 02:54:37 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>7b9abfad8585fd2146ccbb87c11f4500</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/projectalumni-sqlxss.txt>projectalumni-sqlxss.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
Project Alumni versions 1.0.9, 1.0.8, and possibly prior releases suffer from cross site scripting and SQL injection vulnerabilities.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:tomplixsee[at]yahoo.co.id ">tomplixsee</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2212</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 26 16:00:26 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>4cf7c7514232e5aecf2ea8f832899041</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/PR07-15.txt>PR07-15.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
The F5 FirePass 4100 SSL VPN is susceptible to cross site scripting vulnerabilities in my.logon.php3.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td>Richard Brain</td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.procheckup.com/">http://www.procheckup.com/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2208</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Dec 2 15:39:06 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>d2712a2796254f18fd7453d88ff3e8ba</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/aquick-seh.txt>aquick-seh.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
Apple QuickTime versions 7.2 and 7.3 RTSP response remote SEH overwrite proof of concept exploit.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:h07[at]interia.pl">h07</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2188</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 26 21:31:24 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>c2038dcdccec92fa74e06320fb96f136</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/netfinity-sql.txt>netfinity-sql.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
net-finity suffers from a SQL injection vulnerability in links.php.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:secret[at]security.com.sa">VerY-SecReT</a></td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.sniper-sa.com/">http://www.sniper-sa.com/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2178</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 26 16:05:01 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>8d106df36c3ed4b42ccf9275e67bebf1</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/PR07-14.txt>PR07-14.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
The F5 FirePass 4100 SSL VPN is susceptible to cross site scripting vulnerabilities in my.activation.php3.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:adrian.pastor[at]procheckup.com">Adrian Pastor</a>, Jan Fry</td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.procheckup.com/">http://www.procheckup.com/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2177</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Dec 2 15:37:49 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>a5c5e3277bf1f9ac5dd422520c6fb014</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/skalinks-csrf.txt>skalinks-csrf.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
Skalinks versions 1.5 and below cross site request forgery add administrator exploit.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:djvincy[at]hotmail.it">Vincy</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2032</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 5 11:10:47 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>117885697b5f9ee74219b1fb3cbc6b85</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/tildecms-sql.txt>tildecms-sql.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
Tilde CMS versions 4.x and below suffer from a SQL injection vulnerability.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td>KiNgOfThEwOrLd</td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.inj3ct-it.org/">http://www.inj3ct-it.org/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>2009</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 26 22:48:35 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>7e70684c3673ed557eabfc800e77eeb6</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/dxmsft-overflow.txt>dxmsft-overflow.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
Multiple stack overflows exist in dxmsft.dll version 6.3.2900.3199 (Image DirectX Transforms). Proof of concept included.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:elazarb[at]earthlink.net">Elazar Broad</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>1980</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 26 17:23:30 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>5bd751ada3c01c561e54dbe81e6f971f</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/mcs-rfi.txt>mcs-rfi.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
MySpace Clone Script suffers from a remote file inclusion vulnerability in index.php.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:secret[at]security.com.sa">VerY-SecReT</a></td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.sniper-sa.com/">http://www.sniper-sa.com/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>1969</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 26 16:03:02 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>c9610154d92b2e53293abf2eb30ad14d</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/scribe-exec.txt>scribe-exec.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
Scribe versions 0.2 and below suffer from a remote PHP code execution vulnerability.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td>KiNgOfThEwOrLd</td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.inj3ct-it.org/">http://www.inj3ct-it.org/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>1950</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 2 11:50:21 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>69a127ea3eb22cfc0652d108b8c472fc</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/softbiz4-sql.txt>softbiz4-sql.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
Softbiz Links Directory Script suffers from a remote SQL injection vulnerability.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:irancrash[at]gmail.com">IRCRASH</a></td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://ircrash.com/">http://ircrash.com/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>1930</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 12 19:48:01 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>bc9b1760bfc2fb84755162832cef02ee</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/softbiz1-sql.txt>softbiz1-sql.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
Softbiz Auctions suffers from a remote SQL injection vulnerability in product_desc.php.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:irancrash[at]gmail.com">IRCRASH</a></td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://ircrash.com/">http://ircrash.com/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>1899</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 12 19:45:53 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>cb1f6585f8372b55721a7784e561a0f9</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/ftpadmin-multi.txt>ftpadmin-multi.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
FTP Admin version 0.1.0 suffers from bypass, local file inclusion, and cross site scripting vulnerabilities.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:omnipresent[at]email.it">omnipresent</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>1847</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 30 00:54:37 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>1e741f922fd81e1ff0a42de723906a5f</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/gwextranet-multi.txt>gwextranet-multi.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
GWExtranet version 3.0 suffers from privilege escalation, cross site scripting, and remote file inclusion vulnerabilities.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:DoZ[at]HackersCenter.com">Doz</a></td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.hackerscenter.com/">http://www.hackerscenter.com/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>1829</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 26 22:20:36 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>8505ac430be163d75649eb8d4448beb1</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/phpnuketopsites-inject.txt>phpnuketopsites-inject.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
The PHP-Nuke add-on MS TopSites suffers from a HTML injection vulnerability.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:Guns[at]0x90.com.ar">Guns</a></td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.0x90.com.ar/">http://www.0x90.com.ar/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>1799</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 6 23:16:32 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>26da11a98b86df7366bcd7db6184301f</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/siteminder-xss.txt>siteminder-xss.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
SiteMinder Agent suffers from cross site scripting vulnerabilities.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:overet[at]securitydate.it">Giuseppe Gottardi</a></td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://overet.securitydate.it/">http://overet.securitydate.it/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>1798</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 7 15:21:06 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>5eb1ae53f1d3d45d32335dede1b2a78f</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/eurologon-sql.txt>eurologon-sql.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
Eurologon CMS suffers from multiple SQL injection vulnerabilities.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td>KiNgOfThEwOrLd</td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.inj3ct-it.org/">http://www.inj3ct-it.org/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>1781</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 27 22:38:44 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>d5d5b5cfe4219bfb4f02ca65321d6676</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/phpnukensn-disclose.txt>phpnukensn-disclose.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
PHP-Nuke NSN Script Depository module versions 1.0.0 and below suffer from a remote source disclosure vulnerability.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td>KiNgOfThEwOrLd</td></tr><tr class="finfo"><td><b>Homepage:</b></td><td><a target="_blank" href="http://www.inj3ct-it.org/">http://www.inj3ct-it.org/</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>1758</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 26 22:50:32 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>c1b31b6050529af2d3f35a56e8151a33</td></tr>
</table>
</td></tr></table></div></center>
</p>
<p>
<center><div class="fbox1"><table border="0" cellpadding="0" cellspacing="0" class="fbox2" width="100%"><tr><td>
<table border="0" cellpadding="2" cellspacing="1" width="100%" align="center">
<tr class="fname">
<td valign="top" nowrap width="100"> <span class="grip">///</span> <b>File Name:</b></td>
<td nowrap><a class="fname" href=/0711-exploits/meBiblio-xss.txt>meBiblio-xss.txt</a></td></tr>
<tr class="finfo"><td valign="top"><b>Description:</b><br /></td><td valign="top">
meBiblio version 0.4.5 suffers from cross site scripting vulnerabilities.
</td></tr><tr class="finfo"><td><b>Author:</b></td><td><a href="mailto:shay6ooon[at]msn.com">ShAy6oOoN</a></td></tr><tr class="finfo"><td nowrap><b>File Size:</b></td><td>1715</td></tr><tr class="finfo"><td nowrap><b>Last Modified:</b></td><td nowrap>Nov 26 15:51:59 2007</td></tr>
<tr class="finfo"><td nowrap><b>MD5 Checksum:</b></td><td>40d8e1f4044e8e5be3c097e6de705f58</td></tr>
</table>
</td></tr></table></div></center>
</p>
<!-- // End: Main Content Area // -->
<!--#include virtual="/zinc/required/container_right.html" -->
<!-- // Start: Side Bar Area // -->
<!--#include virtual="/zinc/sidebar/sb_spacer.html" -->
<!--#include virtual="/zinc/sidebar/sb_last10.html" -->
<!--#include virtual="/zinc/sidebar/sb_advisories10.html" -->
<!--#include virtual="/zinc/sidebar/sb_exploits10.html" -->
<!--#include virtual="/zinc/sidebar/sb_tools10.html" -->
<!--#include virtual="/zinc/sidebar/sb_misc10.html" -->
<!-- // End: Side Bar Area // -->
<!--#include virtual="/zinc/required/footer.html" -->
</html>
| {
"pile_set_name": "Github"
} |
/**
* @file BinaryDescriptor_.cpp
* @brief mex interface for cv::line_descriptor::BinaryDescriptor
* @ingroup line_descriptor
* @author Amro
* @date 2016
*/
#include "mexopencv.hpp"
#include "opencv2/line_descriptor.hpp"
using namespace std;
using namespace cv;
using namespace cv::line_descriptor;
// Persistent objects
namespace {
/// Last object id to allocate
int last_id = 0;
/// Object container
map<int,Ptr<BinaryDescriptor> > obj_;
/** Convert keylines to struct array
* @param keylines vector of keylines
* @return struct-array MxArray object
*/
MxArray toStruct(const vector<KeyLine>& keylines)
{
const char *fields[] = {"angle", "class_id", "octave", "pt", "response",
"size", "startPoint", "endPoint", "startPointInOctave",
"endPointInOctave", "lineLength", "numOfPixels"};
MxArray s = MxArray::Struct(fields, 12, 1, keylines.size());
for (mwIndex i = 0; i < keylines.size(); ++i) {
s.set("angle", keylines[i].angle, i);
s.set("class_id", keylines[i].class_id, i);
s.set("octave", keylines[i].octave, i);
s.set("pt", keylines[i].pt, i);
s.set("response", keylines[i].response, i);
s.set("size", keylines[i].size, i);
s.set("startPoint", keylines[i].getStartPoint(), i);
s.set("endPoint", keylines[i].getEndPoint(), i);
s.set("startPointInOctave", keylines[i].getStartPointInOctave(), i);
s.set("endPointInOctave", keylines[i].getEndPointInOctave(), i);
s.set("lineLength", keylines[i].lineLength, i);
s.set("numOfPixels", keylines[i].numOfPixels, i);
}
return s;
}
/** Convert set of keylines to cell-array of struct-arrays
* @param keylines vector of vector of keylines
* @return cell-array of struct-arrays MxArray object
*/
MxArray toCellOfStruct(const vector<vector<KeyLine> >& keylines)
{
MxArray c = MxArray::Cell(1, keylines.size());
for (mwIndex i = 0; i < keylines.size(); ++i)
c.set(i, toStruct(keylines[i]));
return c;
}
/** Convert an MxArray to cv::line_descriptor::KeyLine
* @param arr struct-array MxArray object
* @param idx linear index of the struct array element
* @return keyline object
*/
KeyLine MxArrayToKeyLine(const MxArray& arr, mwIndex idx = 0)
{
KeyLine keyline;
keyline.angle = arr.at("angle", idx).toFloat();
keyline.class_id = arr.at("class_id", idx).toInt();
keyline.octave = arr.at("octave", idx).toInt();
keyline.pt = arr.at("pt", idx).toPoint2f();
keyline.response = arr.at("response", idx).toFloat();
keyline.size = arr.at("size", idx).toFloat();
keyline.startPointX = arr.at("startPoint", idx).toPoint2f().x;
keyline.startPointY = arr.at("startPoint", idx).toPoint2f().y;
keyline.endPointX = arr.at("endPoint", idx).toPoint2f().x;
keyline.endPointY = arr.at("endPoint", idx).toPoint2f().y;
keyline.sPointInOctaveX = arr.at("startPointInOctave", idx).toPoint2f().x;
keyline.sPointInOctaveY = arr.at("startPointInOctave", idx).toPoint2f().y;
keyline.ePointInOctaveX = arr.at("endPointInOctave", idx).toPoint2f().x;
keyline.ePointInOctaveY = arr.at("endPointInOctave", idx).toPoint2f().y;
keyline.lineLength = arr.at("lineLength", idx).toFloat();
keyline.numOfPixels = arr.at("numOfPixels", idx).toInt();
return keyline;
}
/** Convert an MxArray to std::vector<cv::line_descriptor::KeyLine>
* @param arr struct-array MxArray object
* @return vector of keyline objects
*/
vector<KeyLine> MxArrayToVectorKeyLine(const MxArray& arr)
{
const mwSize n = arr.numel();
vector<KeyLine> vk;
vk.reserve(n);
if (arr.isCell())
for (mwIndex i = 0; i < n; ++i)
vk.push_back(MxArrayToKeyLine(arr.at<MxArray>(i)));
else if (arr.isStruct())
for (mwIndex i = 0; i < n; ++i)
vk.push_back(MxArrayToKeyLine(arr,i));
else
mexErrMsgIdAndTxt("mexopencv:error",
"MxArray unable to convert to std::vector<cv::line_descriptor::KeyLine>");
return vk;
}
/** Convert an MxArray to std::vector<std::vector<cv::line_descriptor::KeyLine>>
* @param arr cell-array of struct-arrays MxArray object
* @return vector of vector of keyline objects
*/
vector<vector<KeyLine> > MxArrayToVectorVectorKeyLine(const MxArray& arr)
{
vector<MxArray> va(arr.toVector<MxArray>());
vector<vector<KeyLine> > vvk;
vvk.reserve(va.size());
for (vector<MxArray>::const_iterator it = va.begin(); it != va.end(); ++it)
vvk.push_back(MxArrayToVectorKeyLine(*it));
return vvk;
}
}
/**
* Main entry called from Matlab
* @param nlhs number of left-hand-side arguments
* @param plhs pointers to mxArrays in the left-hand-side
* @param nrhs number of right-hand-side arguments
* @param prhs pointers to mxArrays in the right-hand-side
*/
void mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[])
{
// Check the number of arguments
nargchk(nrhs>=2 && nlhs<=2);
// Argument vector
vector<MxArray> rhs(prhs, prhs+nrhs);
int id = rhs[0].toInt();
string method(rhs[1].toString());
// Constructor is called. Create a new object from argument
if (method == "new") {
nargchk(nrhs>=2 && (nrhs%2)==0 && nlhs<=1);
BinaryDescriptor::Params parameters;
for (int i=2; i<nrhs; i+=2) {
string key(rhs[i].toString());
if (key == "KSize")
parameters.ksize_ = rhs[i+1].toInt();
else if (key == "NumOfOctave")
parameters.numOfOctave_ = rhs[i+1].toInt();
else if (key == "ReductionRatio")
parameters.reductionRatio = rhs[i+1].toInt();
else if (key == "WidthOfBand")
parameters.widthOfBand_ = rhs[i+1].toInt();
else
mexErrMsgIdAndTxt("mexopencv:error",
"Unrecognized option %s", key.c_str());
}
obj_[++last_id] = BinaryDescriptor::createBinaryDescriptor(parameters);
plhs[0] = MxArray(last_id);
mexLock();
return;
}
// Big operation switch
Ptr<BinaryDescriptor> obj = obj_[id];
if (obj.empty())
mexErrMsgIdAndTxt("mexopencv:error", "Object not found id=%d", id);
if (method == "delete") {
nargchk(nrhs==2 && nlhs==0);
obj_.erase(id);
mexUnlock();
}
else if (method == "clear") {
nargchk(nrhs==2 && nlhs==0);
obj->clear();
}
else if (method == "load") {
nargchk(nrhs>=3 && (nrhs%2)==1 && nlhs==0);
string objname;
bool loadFromString = false;
for (int i=3; i<nrhs; i+=2) {
string key(rhs[i].toString());
if (key == "ObjName")
objname = rhs[i+1].toString();
else if (key == "FromString")
loadFromString = rhs[i+1].toBool();
else
mexErrMsgIdAndTxt("mexopencv:error",
"Unrecognized option %s", key.c_str());
}
/*
obj_[id] = (loadFromString ?
Algorithm::loadFromString<BinaryDescriptor>(rhs[2].toString(), objname) :
Algorithm::load<BinaryDescriptor>(rhs[2].toString(), objname));
*/
///*
// HACK: workaround for missing BinaryDescriptor::create()
FileStorage fs(rhs[2].toString(), FileStorage::READ +
(loadFromString ? FileStorage::MEMORY : 0));
if (!fs.isOpened())
mexErrMsgIdAndTxt("mexopencv:error", "Failed to open file");
FileNode fn(objname.empty() ? fs.getFirstTopLevelNode() : fs[objname]);
if (fn.empty())
mexErrMsgIdAndTxt("mexopencv:error", "Failed to get node");
obj->read(fn);
//*/
}
else if (method == "save") {
nargchk(nrhs==3 && nlhs==0);
obj->save(rhs[2].toString());
}
else if (method == "empty") {
nargchk(nrhs==2 && nlhs<=1);
plhs[0] = MxArray(obj->empty());
}
else if (method == "getDefaultName") {
nargchk(nrhs==2 && nlhs<=1);
plhs[0] = MxArray(obj->getDefaultName());
}
else if (method == "defaultNorm") {
nargchk(nrhs==2 && nlhs<=1);
plhs[0] = MxArray(NormTypeInv[obj->defaultNorm()]);
}
else if (method == "descriptorSize") {
nargchk(nrhs==2 && nlhs<=1);
plhs[0] = MxArray(obj->descriptorSize());
}
else if (method == "descriptorType") {
nargchk(nrhs==2 && nlhs<=1);
plhs[0] = MxArray(ClassNameInvMap[obj->descriptorType()]);
}
else if (method == "detect") {
nargchk(nrhs>=3 && (nrhs%2)==1 && nlhs<=1);
if (rhs[2].isNumeric()) { // first variant that accepts an image
Mat mask;
for (int i=3; i<nrhs; i+=2) {
string key(rhs[i].toString());
if (key == "Mask")
mask = rhs[i+1].toMat(CV_8U);
else
mexErrMsgIdAndTxt("mexopencv:error",
"Unrecognized option %s", key.c_str());
}
Mat image(rhs[2].toMat(CV_8U));
vector<KeyLine> keylines;
obj->detect(image, keylines, mask);
plhs[0] = toStruct(keylines);
}
else if (rhs[2].isCell()) { // second variant that accepts an image set
vector<Mat> masks;
for (int i=3; i<nrhs; i+=2) {
string key(rhs[i].toString());
if (key == "Mask") {
//masks = rhs[i+1].toVector<Mat>();
vector<MxArray> arr(rhs[i+1].toVector<MxArray>());
masks.clear();
masks.reserve(arr.size());
for (vector<MxArray>::const_iterator it = arr.begin(); it != arr.end(); ++it)
masks.push_back(it->toMat(CV_8U));
}
else
mexErrMsgIdAndTxt("mexopencv:error",
"Unrecognized option %s", key.c_str());
}
//vector<Mat> images(rhs[2].toVector<Mat>());
vector<Mat> images;
{
vector<MxArray> arr(rhs[2].toVector<MxArray>());
images.reserve(arr.size());
for (vector<MxArray>::const_iterator it = arr.begin(); it != arr.end(); ++it)
images.push_back(it->toMat(CV_8U));
}
//HACK: detect method does not like an empty masks vector!
if (masks.empty())
masks.assign(images.size(), Mat());
vector<vector<KeyLine> > keylines;
//HACK: detect method does not take care of allocating outer vector!
keylines.resize(images.size());
obj->detect(images, keylines, masks);
plhs[0] = toCellOfStruct(keylines);
}
else
mexErrMsgIdAndTxt("mexopencv:error", "Invalid arguments");
}
else if (method == "compute") {
nargchk(nrhs>=4 && (nrhs%2)==0 && nlhs<=2);
bool returnFloatDescr = false;
for (int i=4; i<nrhs; i+=2) {
string key(rhs[i].toString());
if (key == "ReturnFloatDescr")
returnFloatDescr = rhs[i+1].toBool();
else
mexErrMsgIdAndTxt("mexopencv:error",
"Unrecognized option %s", key.c_str());
}
if (rhs[2].isNumeric()) { // first variant that accepts an image
Mat image(rhs[2].toMat(CV_8U)), descriptors;
vector<KeyLine> keylines(MxArrayToVectorKeyLine(rhs[3]));
obj->compute(image, keylines, descriptors, returnFloatDescr);
plhs[0] = MxArray(descriptors);
if (nlhs > 1)
plhs[1] = toStruct(keylines);
}
else if (rhs[2].isCell()) { // second variant that accepts an image set
//vector<Mat> images(rhs[2].toVector<Mat>());
vector<Mat> images, descriptors;
{
vector<MxArray> arr(rhs[2].toVector<MxArray>());
images.reserve(arr.size());
for (vector<MxArray>::const_iterator it = arr.begin(); it != arr.end(); ++it)
images.push_back(it->toMat(CV_8U));
}
vector<vector<KeyLine> > keylines(MxArrayToVectorVectorKeyLine(rhs[3]));
//HACK: compute method does not check correct sizes, so we do it
if (keylines.size() != images.size())
mexErrMsgIdAndTxt("mexopencv:error", "Incorrect keylines size");
//HACK: compute method does not take care of allocating output vector!
descriptors.resize(images.size());
obj->compute(images, keylines, descriptors, returnFloatDescr);
plhs[0] = MxArray(descriptors);
if (nlhs > 1)
plhs[1] = toCellOfStruct(keylines);
}
else
mexErrMsgIdAndTxt("mexopencv:error", "Invalid arguments");
}
else if (method == "detectAndCompute") {
nargchk(nrhs>=3 && (nrhs%2)==1 && nlhs<=2);
Mat mask;
vector<KeyLine> keylines;
bool useProvidedKeyLines = false;
bool returnFloatDescr = false;
for (int i=3; i<nrhs; i+=2) {
string key(rhs[i].toString());
if (key == "Mask")
mask = rhs[i+1].toMat(CV_8U);
else if (key == "KeyLines") {
keylines = MxArrayToVectorKeyLine(rhs[i+1]);
useProvidedKeyLines = true;
}
else if (key == "ReturnFloatDescr")
returnFloatDescr = rhs[i+1].toBool();
else
mexErrMsgIdAndTxt("mexopencv:error",
"Unrecognized option %s", key.c_str());
}
Mat image(rhs[2].toMat(CV_8U)), descriptors;
obj->operator()(image, mask, keylines, descriptors,
useProvidedKeyLines, returnFloatDescr);
plhs[0] = toStruct(keylines);
if (nlhs > 1)
plhs[1] = MxArray(descriptors);
}
else if (method == "get") {
nargchk(nrhs==3 && nlhs<=1);
string prop(rhs[2].toString());
if (prop == "NumOfOctaves")
plhs[0] = MxArray(obj->getNumOfOctaves());
else if (prop == "ReductionRatio")
plhs[0] = MxArray(obj->getReductionRatio());
else if (prop == "WidthOfBand")
plhs[0] = MxArray(obj->getWidthOfBand());
else
mexErrMsgIdAndTxt("mexopencv:error",
"Unrecognized property %s", prop.c_str());
}
else if (method == "set") {
nargchk(nrhs==4 && nlhs==0);
string prop(rhs[2].toString());
if (prop == "NumOfOctaves")
obj->setNumOfOctaves(rhs[3].toInt());
else if (prop == "ReductionRatio")
obj->setReductionRatio(rhs[3].toInt());
else if (prop == "WidthOfBand")
obj->setWidthOfBand(rhs[3].toInt());
else
mexErrMsgIdAndTxt("mexopencv:error",
"Unrecognized property %s", prop.c_str());
}
else
mexErrMsgIdAndTxt("mexopencv:error",
"Unrecognized operation %s",method.c_str());
}
| {
"pile_set_name": "Github"
} |
# This file is part of the Sylius package.
# (c) Paweł Jędrzejewski
sylius:
form:
channel:
color: Farbe
description: Beschreibung
enabled: Aktiviert
name: Name
url: URL
| {
"pile_set_name": "Github"
} |
// Copyright (c) 2011, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// ----
// Author: [email protected] (Bill Clarke)
#include "config_for_unittests.h"
#include <assert.h>
#include <stdio.h>
#ifdef HAVE_MMAP
#include <sys/mman.h>
#endif
#ifdef HAVE_UNISTD_H
#include <unistd.h> // for sleep()
#endif
#include <algorithm>
#include <string>
#include <vector>
#include <gperftools/malloc_hook.h>
#include "malloc_hook-inl.h"
#include "base/logging.h"
#include "base/simple_mutex.h"
#include "base/sysinfo.h"
#include "tests/testutil.h"
// On systems (like freebsd) that don't define MAP_ANONYMOUS, use the old
// form of the name instead.
#ifndef MAP_ANONYMOUS
# define MAP_ANONYMOUS MAP_ANON
#endif
namespace {
using std::string;
using std::vector;
vector<void (*)()> g_testlist; // the tests to run
#define TEST(a, b) \
struct Test_##a##_##b { \
Test_##a##_##b() { g_testlist.push_back(&Run); } \
static void Run(); \
}; \
static Test_##a##_##b g_test_##a##_##b; \
void Test_##a##_##b::Run()
static int RUN_ALL_TESTS() {
vector<void (*)()>::const_iterator it;
for (it = g_testlist.begin(); it != g_testlist.end(); ++it) {
(*it)(); // The test will error-exit if there's a problem.
}
fprintf(stderr, "\nPassed %d tests\n\nPASS\n",
static_cast<int>(g_testlist.size()));
return 0;
}
void Sleep(int seconds) {
#ifdef _MSC_VER
_sleep(seconds * 1000); // Windows's _sleep takes milliseconds argument
#else
sleep(seconds);
#endif
}
using std::min;
using base::internal::kHookListMaxValues;
// Since HookList is a template and is defined in malloc_hook.cc, we can only
// use an instantiation of it from malloc_hook.cc. We then reinterpret those
// values as integers for testing.
typedef base::internal::HookList<MallocHook::NewHook> TestHookList;
int TestHookList_Traverse(const TestHookList& list, uintptr_t* output_array, int n) {
MallocHook::NewHook values_as_hooks[kHookListMaxValues];
int result = list.Traverse(values_as_hooks, min(n, kHookListMaxValues));
for (int i = 0; i < result; ++i) {
output_array[i] = reinterpret_cast<const uintptr_t>(*values_as_hooks[i]);
}
return result;
}
bool TestHookList_Add(TestHookList* list, int val) {
return list->Add(reinterpret_cast<MallocHook::NewHook>(val));
}
bool TestHookList_Remove(TestHookList* list, int val) {
return list->Remove(reinterpret_cast<MallocHook::NewHook>(val));
}
// Note that this is almost the same as INIT_HOOK_LIST in malloc_hook.cc without
// the cast.
#define INIT_HOOK_LIST(initial_value) { 1, { initial_value } }
TEST(HookListTest, InitialValueExists) {
TestHookList list = INIT_HOOK_LIST(69);
uintptr_t values[2] = { 0, 0 };
EXPECT_EQ(1, TestHookList_Traverse(list, values, 2));
EXPECT_EQ(69, values[0]);
EXPECT_EQ(1, list.priv_end);
}
TEST(HookListTest, CanRemoveInitialValue) {
TestHookList list = INIT_HOOK_LIST(69);
ASSERT_TRUE(TestHookList_Remove(&list, 69));
EXPECT_EQ(0, list.priv_end);
uintptr_t values[2] = { 0, 0 };
EXPECT_EQ(0, TestHookList_Traverse(list, values, 2));
}
TEST(HookListTest, AddAppends) {
TestHookList list = INIT_HOOK_LIST(69);
ASSERT_TRUE(TestHookList_Add(&list, 42));
EXPECT_EQ(2, list.priv_end);
uintptr_t values[2] = { 0, 0 };
EXPECT_EQ(2, TestHookList_Traverse(list, values, 2));
EXPECT_EQ(69, values[0]);
EXPECT_EQ(42, values[1]);
}
TEST(HookListTest, RemoveWorksAndWillClearSize) {
TestHookList list = INIT_HOOK_LIST(69);
ASSERT_TRUE(TestHookList_Add(&list, 42));
ASSERT_TRUE(TestHookList_Remove(&list, 69));
EXPECT_EQ(2, list.priv_end);
uintptr_t values[2] = { 0, 0 };
EXPECT_EQ(1, TestHookList_Traverse(list, values, 2));
EXPECT_EQ(42, values[0]);
ASSERT_TRUE(TestHookList_Remove(&list, 42));
EXPECT_EQ(0, list.priv_end);
EXPECT_EQ(0, TestHookList_Traverse(list, values, 2));
}
TEST(HookListTest, AddPrependsAfterRemove) {
TestHookList list = INIT_HOOK_LIST(69);
ASSERT_TRUE(TestHookList_Add(&list, 42));
ASSERT_TRUE(TestHookList_Remove(&list, 69));
EXPECT_EQ(2, list.priv_end);
ASSERT_TRUE(TestHookList_Add(&list, 7));
EXPECT_EQ(2, list.priv_end);
uintptr_t values[2] = { 0, 0 };
EXPECT_EQ(2, TestHookList_Traverse(list, values, 2));
EXPECT_EQ(7, values[0]);
EXPECT_EQ(42, values[1]);
}
TEST(HookListTest, InvalidAddRejected) {
TestHookList list = INIT_HOOK_LIST(69);
EXPECT_FALSE(TestHookList_Add(&list, 0));
uintptr_t values[2] = { 0, 0 };
EXPECT_EQ(1, TestHookList_Traverse(list, values, 2));
EXPECT_EQ(69, values[0]);
EXPECT_EQ(1, list.priv_end);
}
TEST(HookListTest, FillUpTheList) {
TestHookList list = INIT_HOOK_LIST(69);
int num_inserts = 0;
while (TestHookList_Add(&list, ++num_inserts))
;
EXPECT_EQ(kHookListMaxValues, num_inserts);
EXPECT_EQ(kHookListMaxValues, list.priv_end);
uintptr_t values[kHookListMaxValues + 1];
EXPECT_EQ(kHookListMaxValues, TestHookList_Traverse(list, values,
kHookListMaxValues));
EXPECT_EQ(69, values[0]);
for (int i = 1; i < kHookListMaxValues; ++i) {
EXPECT_EQ(i, values[i]);
}
}
void MultithreadedTestThread(TestHookList* list, int shift,
int thread_num) {
string message;
char buf[64];
for (int i = 1; i < 1000; ++i) {
// In each loop, we insert a unique value, check it exists, remove it, and
// check it doesn't exist. We also record some stats to log at the end of
// each thread. Each insertion location and the length of the list is
// non-deterministic (except for the very first one, over all threads, and
// after the very last one the list should be empty).
int value = (i << shift) + thread_num;
EXPECT_TRUE(TestHookList_Add(list, value));
sched_yield(); // Ensure some more interleaving.
uintptr_t values[kHookListMaxValues + 1];
int num_values = TestHookList_Traverse(*list, values, kHookListMaxValues);
EXPECT_LT(0, num_values);
int value_index;
for (value_index = 0;
value_index < num_values && values[value_index] != value;
++value_index)
;
EXPECT_LT(value_index, num_values); // Should have found value.
snprintf(buf, sizeof(buf), "[%d/%d; ", value_index, num_values);
message += buf;
sched_yield();
EXPECT_TRUE(TestHookList_Remove(list, value));
sched_yield();
num_values = TestHookList_Traverse(*list, values, kHookListMaxValues);
for (value_index = 0;
value_index < num_values && values[value_index] != value;
++value_index)
;
EXPECT_EQ(value_index, num_values); // Should not have found value.
snprintf(buf, sizeof(buf), "%d]", num_values);
message += buf;
sched_yield();
}
fprintf(stderr, "thread %d: %s\n", thread_num, message.c_str());
}
static volatile int num_threads_remaining;
static TestHookList list = INIT_HOOK_LIST(69);
static Mutex threadcount_lock;
void MultithreadedTestThreadRunner(int thread_num) {
// Wait for all threads to start running.
{
MutexLock ml(&threadcount_lock);
assert(num_threads_remaining > 0);
--num_threads_remaining;
// We should use condvars and the like, but for this test, we'll
// go simple and busy-wait.
while (num_threads_remaining > 0) {
threadcount_lock.Unlock();
Sleep(1);
threadcount_lock.Lock();
}
}
// shift is the smallest number such that (1<<shift) > kHookListMaxValues
int shift = 0;
for (int i = kHookListMaxValues; i > 0; i >>= 1)
shift += 1;
MultithreadedTestThread(&list, shift, thread_num);
}
TEST(HookListTest, MultithreadedTest) {
ASSERT_TRUE(TestHookList_Remove(&list, 69));
ASSERT_EQ(0, list.priv_end);
// Run kHookListMaxValues thread, each running MultithreadedTestThread.
// First, we need to set up the rest of the globals.
num_threads_remaining = kHookListMaxValues; // a global var
RunManyThreadsWithId(&MultithreadedTestThreadRunner, num_threads_remaining,
1 << 15);
uintptr_t values[kHookListMaxValues + 1];
EXPECT_EQ(0, TestHookList_Traverse(list, values, kHookListMaxValues));
EXPECT_EQ(0, list.priv_end);
}
// We only do mmap-hooking on (some) linux systems.
#if defined(HAVE_MMAP) && defined(__linux) && \
(defined(__i386__) || defined(__x86_64__) || defined(__PPC__))
int mmap_calls = 0;
int mmap_matching_calls = 0;
int munmap_calls = 0;
int munmap_matching_calls = 0;
const int kMmapMagicFd = 1;
void* const kMmapMagicPointer = reinterpret_cast<void*>(1);
int MmapReplacement(const void* start,
size_t size,
int protection,
int flags,
int fd,
off_t offset,
void** result) {
++mmap_calls;
if (fd == kMmapMagicFd) {
++mmap_matching_calls;
*result = kMmapMagicPointer;
return true;
}
return false;
}
int MunmapReplacement(const void* ptr, size_t size, int* result) {
++munmap_calls;
if (ptr == kMmapMagicPointer) {
++munmap_matching_calls;
*result = 0;
return true;
}
return false;
}
TEST(MallocMookTest, MmapReplacements) {
mmap_calls = mmap_matching_calls = munmap_calls = munmap_matching_calls = 0;
MallocHook::SetMmapReplacement(&MmapReplacement);
MallocHook::SetMunmapReplacement(&MunmapReplacement);
EXPECT_EQ(kMmapMagicPointer, mmap(NULL, 1, PROT_READ, MAP_PRIVATE,
kMmapMagicFd, 0));
EXPECT_EQ(1, mmap_matching_calls);
char* ptr = reinterpret_cast<char*>(
mmap(NULL, 1, PROT_READ | PROT_WRITE,
MAP_PRIVATE | MAP_ANONYMOUS, -1, 0));
EXPECT_EQ(2, mmap_calls);
EXPECT_EQ(1, mmap_matching_calls);
ASSERT_NE(MAP_FAILED, ptr);
*ptr = 'a';
EXPECT_EQ(0, munmap(kMmapMagicPointer, 1));
EXPECT_EQ(1, munmap_calls);
EXPECT_EQ(1, munmap_matching_calls);
EXPECT_EQ(0, munmap(ptr, 1));
EXPECT_EQ(2, munmap_calls);
EXPECT_EQ(1, munmap_matching_calls);
// The DEATH test below is flaky, because we've just munmapped the memory,
// making it available for mmap()ing again. There is no guarantee that it
// will stay unmapped, and in fact it gets reused ~10% of the time.
// It the area is reused, then not only we don't die, but we also corrupt
// whoever owns that memory now.
// EXPECT_DEATH(*ptr = 'a', "SIGSEGV");
}
#endif // #ifdef HAVE_MMAP && linux && ...
} // namespace
int main(int argc, char** argv) {
return RUN_ALL_TESTS();
}
| {
"pile_set_name": "Github"
} |
/* TEMPLATE GENERATED TESTCASE FILE
Filename: CWE121_Stack_Based_Buffer_Overflow__CWE129_connect_socket_82_goodG2B.cpp
Label Definition File: CWE121_Stack_Based_Buffer_Overflow__CWE129.label.xml
Template File: sources-sinks-82_goodG2B.tmpl.cpp
*/
/*
* @description
* CWE: 121 Stack Based Buffer Overflow
* BadSource: connect_socket Read data using a connect socket (client side)
* GoodSource: Larger than zero but less than 10
* Sinks:
* GoodSink: Ensure the array index is valid
* BadSink : Improperly check the array index by not checking the upper bound
* Flow Variant: 82 Data flow: data passed in a parameter to an virtual method called via a pointer
*
* */
#ifndef OMITGOOD
#include "std_testcase.h"
#include "CWE121_Stack_Based_Buffer_Overflow__CWE129_connect_socket_82.h"
namespace CWE121_Stack_Based_Buffer_Overflow__CWE129_connect_socket_82
{
void CWE121_Stack_Based_Buffer_Overflow__CWE129_connect_socket_82_goodG2B::action(int data)
{
{
int i;
int buffer[10] = { 0 };
/* POTENTIAL FLAW: Attempt to write to an index of the array that is above the upper bound
* This code does check to see if the array index is negative */
if (data >= 0)
{
buffer[data] = 1;
/* Print the array values */
for(i = 0; i < 10; i++)
{
printIntLine(buffer[i]);
}
}
else
{
printLine("ERROR: Array index is negative.");
}
}
}
}
#endif /* OMITGOOD */
| {
"pile_set_name": "Github"
} |
using System;
using System.Security;
using System.Security.Permissions;
#if RESTRICT
// this ensure we don't have FullTrust
[assembly: SecurityPermission (SecurityAction.RequestRefuse, SkipVerification = true)]
#endif
public class Program {
static int Main ()
{
try {
// mscorlib is strongnamed and has [AllowPartiallyTrustedCallers]
// so this call will work even if this assembly isn't strongnamed
Console.WriteLine ("*0* Hellp World");
return 0;
}
catch (SecurityException se) {
Console.WriteLine ("*1* Expected SecurityException\n{0}", se);
return 1;
}
catch (Exception e) {
Console.WriteLine ("*2* Unexpected exception\n{0}", e);
return 2;
}
}
}
| {
"pile_set_name": "Github"
} |
<section class="avatar">
<% if can? :update, @profile %>
<header>
<%= render partial: 'edit_icon' %>
<h4>
<%= t('avatar.profile_change') %>
</h4>
</header>
<div class="update">
<%= render partial: 'avatars/form',
object: @profile.actor,
as: :avatarable %>
</div>
<% end %>
</section>
| {
"pile_set_name": "Github"
} |
#!/usr/bin/perl -w
###########################################################################
# #
# SIGHAN #
# Copyright (c) 2003,2005 #
# All Rights Reserved. #
# #
# Permission is hereby granted, free of charge, to use and distribute #
# this software and its documentation without restriction, including #
# without limitation the rights to use, copy, modify, merge, publish, #
# distribute, sublicense, and/or sell copies of this work, and to #
# permit persons to whom this work is furnished to do so, subject to #
# the following conditions: #
# 1. The code must retain the above copyright notice, this list of #
# conditions and the following disclaimer. #
# 2. Any modifications must be clearly marked as such. #
# 3. Original authors' names are not deleted. #
# 4. The authors' names are not used to endorse or promote products #
# derived from this software without specific prior written #
# permission. #
# #
# SIGHAN AND THE CONTRIBUTORS TO THIS WORK DISCLAIM ALL WARRANTIES #
# WITH REGARD TO THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF #
# MERCHANTABILITY AND FITNESS, IN NO EVENT SHALL SIGHAN NOR THE #
# CONTRIBUTORS BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL #
# DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA #
# OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER #
# TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR #
# PERFORMANCE OF THIS SOFTWARE. #
# #
###########################################################################
# #
# Author: Richard Sproat ([email protected]) #
# Tom Emerson ([email protected]) #
# #
###########################################################################
## This code depends upon a version of diff (e.g. GNU diffutils 2.7.2)
## that supports the -y flag:
##
## -y Use the side by side output format.
##
## change the following per your installation:
$diff = "/usr/bin/diff";
$USAGE = "Usage:\t$0 dictionary truth test\n\t";
if (@ARGV != 3) {print "$USAGE\n"; exit;}
$tmp1 = "/tmp/comp01$$";
$tmp2 = "/tmp/comp02$$";
%dict = ();
open (S, $ARGV[0]) or die "$ARGV[0]: $!\n";
while (<S>) {
chop;
s/^\s*//;
s/\s*$//;
$dict{$_} = 1;
}
close(S);
open (TRUTH, $ARGV[1]) or die "$ARGV[1]: $!\n";
open (TEST, $ARGV[2]) or die "$ARGV[2]: $!\n";
$Tot = $Del = $Ins = $Subst = $Truecount = $Testcount = 0;
$RawRecall = $RawPrecision = 0;
$linenum = 0;
$IVMISSED = $OOVMISSED = $OOV = $IV = 0;
$file1 = $ARGV[1];
$file2 = $ARGV[2];
$file1 =~ s=^/.*/==;
$file2 =~ s=^/.*/==;
while (defined($truth = <TRUTH>) && defined($test = <TEST>)) {
$truth =~ s/^\s*//;
$test =~ s/^\s*//;
$truth =~ s/\s*$//;
$test =~ s/\s*$//;
$truth =~ s/(\xe3\x80\x80)|(\xa1\x40)/ /g;
$test =~ s/(\xe3\x80\x80)|(\xa1\x40)/ /g;
$truth =~ s/
//g;
$test =~ s/
//g;
@truthwords = split /\s+/, $truth;
@testwords = split /\s+/, $test;
$truecount = scalar(@truthwords);
$testcount = scalar(@testwords);
++$linenum;
if ($truecount == 0) {
if ($testcount > 0) {
print STDERR "Warning: training is 0 but test is nonzero, possible misalignment at line $linenum.\n";
}
next;
}
if ($testcount == 0) {
print STDERR "Warning: No output in test data where there is in training data, line $linenum\n";
}
open (T1, ">$tmp1") or die "Can't open $tmp1";
open (T2, ">$tmp2") or die "Can't open $tmp2";
foreach my $w (@truthwords) { print T1 "$w\n"; }
foreach my $w (@testwords) {print T2 "$w\n";}
close (T1);
close (T2);
open (P, "$diff -y $tmp1 $tmp2 |")
or die "Can't open pipe.\n";
print "--$file1-------$file2----$linenum\n";
my $del = 0;
my $ins = 0;
my $subst = 0;
my $rawrecall = 0;
my $rawprecision = 0;
while (<P>) {
my $err = 0;
if (/\s\|\s/) {$subst++ ; $err++; }
elsif (/\s\>\s/) {$ins++ ; $err++; }
elsif (/\s\<\s/) {$del++ ; $err++; }
if (/^([^\s]+)\s/) {
my $w = $1;
if (!$dict{$w}) {++$OOV;}
else {++$IV;}
if (/^[^\s]+\s.*\s[\|\>\<]\s/) {
if (!$dict{$w}) {++$OOVMISSED;}
else {++$IVMISSED;}
++$rawrecall;
}
}
if (/\s[\|\>\<]\s.*[^\s]$/) { ++$rawprecision; }
print "$_";
}
close (P);
my $tot = $del + $ins + $subst;
$Tot += $tot;
$Del += $del;
$Ins += $ins;
$Subst += $subst;
$Truecount += $truecount;
$Testcount += $testcount;
$rawrecall = $truecount - $rawrecall;
$rawprecision = $testcount - $rawprecision;
$RawRecall += $rawrecall;
$RawPrecision += $rawprecision;
$rawrecall = sprintf("%2.3f", $rawrecall/$truecount);
$rawprecision = sprintf("%2.3f", $rawprecision/$testcount);
print "INSERTIONS:\t$ins\n";
print "DELETIONS:\t$del\n";
print "SUBSTITUTIONS:\t$subst\n";
print "NCHANGE:\t$tot\n";
print "NTRUTH:\t$truecount\n";
print "NTEST:\t$testcount\n";
print "TRUE WORDS RECALL:\t$rawrecall\n";
print "TEST WORDS PRECISION:\t$rawprecision\n";
}
close(TRUTH);
close(TEST);
unlink($tmp1);
unlink($tmp2);
print "=== SUMMARY:\n";
print "=== TOTAL INSERTIONS:\t$Ins\n";
print "=== TOTAL DELETIONS:\t$Del\n";
print "=== TOTAL SUBSTITUTIONS:\t$Subst\n";
print "=== TOTAL NCHANGE:\t$Tot\n";
print "=== TOTAL TRUE WORD COUNT:\t$Truecount\n";
print "=== TOTAL TEST WORD COUNT:\t$Testcount\n";
$RawRecall = $RawRecall/$Truecount;
$RawPrecision = $RawPrecision/$Testcount;
$beta = 1;
$R = $RawRecall;
$P = $RawPrecision;
$F = (1 + $beta)*$P*$R/($beta * $P + $R);
$F = sprintf("%2.3f", $F);
$RawRecall = sprintf("%2.3f", $RawRecall);
$RawPrecision = sprintf("%2.3f", $RawPrecision);
print "=== TOTAL TRUE WORDS RECALL:\t$RawRecall\n";
print "=== TOTAL TEST WORDS PRECISION:\t$RawPrecision\n";
print "=== F MEASURE:\t$F\n";
if ($OOV > 0) {
$OOVMISSED = sprintf("%2.3f", 1 - $OOVMISSED / $OOV);
}
else {
$OOVMISSED = "--";
}
$OOV = sprintf("%2.3f", $OOV / $Truecount);
if ($IV > 0) {
$IVMISSED = sprintf("%2.3f", 1 - $IVMISSED / $IV);
}
else {
$IVMISSED = "--";
}
print "=== OOV Rate:\t$OOV\n";
print "=== OOV Recall Rate:\t$OOVMISSED\n";
print "=== IV Recall Rate:\t$IVMISSED\n";
print "###\t$file2\t$Ins\t$Del\t$Subst\t$Tot\t$Truecount\t$Testcount\t$RawRecall\t$RawPrecision\t$F\t$OOV\t$OOVMISSED\t$IVMISSED\n";
exit(0);
| {
"pile_set_name": "Github"
} |
/* SPDX-License-Identifier: GPL-2.0+ */
/*
* logicore_dp_tx_regif.h
*
* Register interface definition for XILINX LogiCore DisplayPort v6.1 TX
* (Source) based on Xilinx dp_v3_1 driver sources
*
* (C) Copyright 2016
* Dirk Eibach, Guntermann & Drunck GmbH, [email protected]
*/
#ifndef __GDSYS_LOGICORE_DP_TX_REGIF_H__
#define __GDSYS_LOGICORE_DP_TX_REGIF_H__
enum {
/* link configuration field */
REG_LINK_BW_SET = 0x000,
REG_LANE_COUNT_SET = 0x004,
REG_ENHANCED_FRAME_EN = 0x008,
REG_TRAINING_PATTERN_SET = 0x00C,
REG_LINK_QUAL_PATTERN_SET = 0x010,
REG_SCRAMBLING_DISABLE = 0x014,
REG_DOWNSPREAD_CTRL = 0x018,
REG_SOFT_RESET = 0x01C,
};
enum {
/* core enables */
REG_ENABLE = 0x080,
REG_ENABLE_MAIN_STREAM = 0x084,
REG_ENABLE_SEC_STREAM = 0x088,
REG_FORCE_SCRAMBLER_RESET = 0x0C0,
REG_MST_CONFIG = 0x0D0,
REG_LINE_RESET_DISABLE = 0x0F0,
};
enum {
/* core ID */
REG_VERSION = 0x0F8,
REG_CORE_ID = 0x0FC,
};
enum {
/* AUX channel interface */
REG_AUX_CMD = 0x100,
REG_AUX_WRITE_FIFO = 0x104,
REG_AUX_ADDRESS = 0x108,
REG_AUX_CLK_DIVIDER = 0x10C,
REG_USER_FIFO_OVERFLOW = 0x110,
REG_INTERRUPT_SIG_STATE = 0x130,
REG_AUX_REPLY_DATA = 0x134,
REG_AUX_REPLY_CODE = 0x138,
REG_AUX_REPLY_COUNT = 0x13C,
REG_INTERRUPT_STATUS = 0x140,
REG_INTERRUPT_MASK = 0x144,
REG_REPLY_DATA_COUNT = 0x148,
REG_REPLY_STATUS = 0x14C,
REG_HPD_DURATION = 0x150,
};
enum {
/* main stream attributes for SST / MST STREAM1 */
REG_STREAM1_MSA_START = 0x180,
REG_MAIN_STREAM_HTOTAL = 0x180,
REG_MAIN_STREAM_VTOTAL = 0x184,
REG_MAIN_STREAM_POLARITY = 0x188,
REG_MAIN_STREAM_HSWIDTH = 0x18C,
REG_MAIN_STREAM_VSWIDTH = 0x190,
REG_MAIN_STREAM_HRES = 0x194,
REG_MAIN_STREAM_VRES = 0x198,
REG_MAIN_STREAM_HSTART = 0x19C,
REG_MAIN_STREAM_VSTART = 0x1A0,
REG_MAIN_STREAM_MISC0 = 0x1A4,
REG_MAIN_STREAM_MISC1 = 0x1A8,
REG_M_VID = 0x1AC,
REG_TU_SIZE = 0x1B0,
REG_N_VID = 0x1B4,
REG_USER_PIXEL_WIDTH = 0x1B8,
REG_USER_DATA_COUNT_PER_LANE = 0x1BC,
REG_MAIN_STREAM_INTERLACED = 0x1C0,
REG_MIN_BYTES_PER_TU = 0x1C4,
REG_FRAC_BYTES_PER_TU = 0x1C8,
REG_INIT_WAIT = 0x1CC,
REG_STREAM1 = 0x1D0,
REG_STREAM2 = 0x1D4,
REG_STREAM3 = 0x1D8,
REG_STREAM4 = 0x1DC,
};
enum {
/* PHY configuration status */
REG_PHY_CONFIG = 0x200,
REG_PHY_VOLTAGE_DIFF_LANE_0 = 0x220,
REG_PHY_VOLTAGE_DIFF_LANE_1 = 0x224,
REG_PHY_VOLTAGE_DIFF_LANE_2 = 0x228,
REG_PHY_VOLTAGE_DIFF_LANE_3 = 0x22C,
REG_PHY_TRANSMIT_PRBS7 = 0x230,
REG_PHY_CLOCK_SELECT = 0x234,
REG_PHY_POWER_DOWN = 0x238,
REG_PHY_PRECURSOR_LANE_0 = 0x23C,
REG_PHY_PRECURSOR_LANE_1 = 0x240,
REG_PHY_PRECURSOR_LANE_2 = 0x244,
REG_PHY_PRECURSOR_LANE_3 = 0x248,
REG_PHY_POSTCURSOR_LANE_0 = 0x24C,
REG_PHY_POSTCURSOR_LANE_1 = 0x250,
REG_PHY_POSTCURSOR_LANE_2 = 0x254,
REG_PHY_POSTCURSOR_LANE_3 = 0x258,
REG_PHY_STATUS = 0x280,
REG_GT_DRP_COMMAND = 0x2A0,
REG_GT_DRP_READ_DATA = 0x2A4,
REG_GT_DRP_CHANNEL_STATUS = 0x2A8,
};
enum {
/* DisplayPort audio */
REG_AUDIO_CONTROL = 0x300,
REG_AUDIO_CHANNELS = 0x304,
REG_AUDIO_INFO_DATA = 0x308,
REG_AUDIO_MAUD = 0x328,
REG_AUDIO_NAUD = 0x32C,
REG_AUDIO_EXT_DATA = 0x330,
};
enum {
/* HDCP */
REG_HDCP_ENABLE = 0x400,
};
enum {
/* main stream attributes for MST STREAM2, 3, and 4 */
REG_STREAM2_MSA_START = 0x500,
REG_STREAM3_MSA_START = 0x550,
REG_STREAM4_MSA_START = 0x5A0,
REG_VC_PAYLOAD_BUFFER_ADDR = 0x800,
};
enum {
LINK_BW_SET_162GBPS = 0x06,
LINK_BW_SET_270GBPS = 0x0A,
LINK_BW_SET_540GBPS = 0x14,
};
enum {
LANE_COUNT_SET_1 = 0x1,
LANE_COUNT_SET_2 = 0x2,
LANE_COUNT_SET_4 = 0x4,
};
enum {
TRAINING_PATTERN_SET_OFF = 0x0,
/* training pattern 1 used for clock recovery */
TRAINING_PATTERN_SET_TP1 = 0x1,
/* training pattern 2 used for channel equalization */
TRAINING_PATTERN_SET_TP2 = 0x2,
/*
* training pattern 3 used for channel equalization for cores with DP
* v1.2
*/
TRAINING_PATTERN_SET_TP3 = 0x3,
};
enum {
LINK_QUAL_PATTERN_SET_OFF = 0x0,
/* D10.2 unscrambled test pattern transmitted */
LINK_QUAL_PATTERN_SET_D102_TEST = 0x1,
/* symbol error rate measurement pattern transmitted */
LINK_QUAL_PATTERN_SET_SER_MES = 0x2,
/* pseudo random bit sequence 7 transmitted */
LINK_QUAL_PATTERN_SET_PRBS7 = 0x3,
};
enum {
SOFT_RESET_VIDEO_STREAM1_MASK = 0x00000001,
SOFT_RESET_VIDEO_STREAM2_MASK = 0x00000002,
SOFT_RESET_VIDEO_STREAM3_MASK = 0x00000004,
SOFT_RESET_VIDEO_STREAM4_MASK = 0x00000008,
SOFT_RESET_AUX_MASK = 0x00000080,
SOFT_RESET_VIDEO_STREAM_ALL_MASK = 0x0000000F,
};
enum {
MST_CONFIG_MST_EN_MASK = 0x00000001,
};
enum {
LINE_RESET_DISABLE_MASK = 0x1,
};
#define AUX_CMD_NBYTES_TRANSFER_MASK 0x0000000F
#define AUX_CMD_SHIFT 8
#define AUX_CMD_MASK 0x00000F00
enum {
AUX_CMD_I2C_WRITE = 0x0,
AUX_CMD_I2C_READ = 0x1,
AUX_CMD_I2C_WRITE_STATUS = 0x2,
AUX_CMD_I2C_WRITE_MOT = 0x4,
AUX_CMD_I2C_READ_MOT = 0x5,
AUX_CMD_I2C_WRITE_STATUS_MOT = 0x6,
AUX_CMD_WRITE = 0x8,
AUX_CMD_READ = 0x9,
};
#define AUX_CLK_DIVIDER_VAL_MASK 0x00FF
#define AUX_CLK_DIVIDER_AUX_SIG_WIDTH_FILT_SHIFT 8
#define AUX_CLK_DIVIDER_AUX_SIG_WIDTH_FILT_MASK 0xFF00
enum {
INTERRUPT_SIG_STATE_HPD_STATE_MASK = 0x00000001,
INTERRUPT_SIG_STATE_REQUEST_STATE_MASK = 0x00000002,
INTERRUPT_SIG_STATE_REPLY_STATE_MASK = 0x00000004,
INTERRUPT_SIG_STATE_REPLY_TIMEOUT_MASK = 0x00000008,
};
enum {
AUX_REPLY_CODE_ACK = 0x0,
AUX_REPLY_CODE_I2C_ACK = 0x0,
AUX_REPLY_CODE_NACK = 0x1,
AUX_REPLY_CODE_DEFER = 0x2,
AUX_REPLY_CODE_I2C_NACK = 0x4,
AUX_REPLY_CODE_I2C_DEFER = 0x8,
};
enum {
INTERRUPT_STATUS_HPD_IRQ_MASK = 0x00000001,
INTERRUPT_STATUS_HPD_EVENT_MASK = 0x00000002,
INTERRUPT_STATUS_REPLY_RECEIVED_MASK = 0x00000004,
INTERRUPT_STATUS_REPLY_TIMEOUT_MASK = 0x00000008,
INTERRUPT_STATUS_HPD_PULSE_DETECTED_MASK = 0x00000010,
INTERRUPT_STATUS_EXT_PKT_TXD_MASK = 0x00000020,
};
enum {
INTERRUPT_MASK_HPD_IRQ_MASK = 0x00000001,
INTERRUPT_MASK_HPD_EVENT_MASK = 0x00000002,
INTERRUPT_MASK_REPLY_RECEIVED_MASK = 0x00000004,
INTERRUPT_MASK_REPLY_TIMEOUT_MASK = 0x00000008,
INTERRUPT_MASK_HPD_PULSE_DETECTED_MASK = 0x00000010,
INTERRUPT_MASK_EXT_PKT_TXD_MASK = 0x00000020,
};
#define REPLY_STATUS_REPLY_STATUS_STATE_SHIFT 4
#define REPLY_STATUS_REPLY_STATUS_STATE_MASK 0x00000FF0
enum {
REPLY_STATUS_REPLY_RECEIVED_MASK = 0x00000001,
REPLY_STATUS_REPLY_IN_PROGRESS_MASK = 0x00000002,
REPLY_STATUS_REQUEST_IN_PROGRESS_MASK = 0x00000004,
REPLY_STATUS_REPLY_ERROR_MASK = 0x00000008,
};
#define MAIN_STREAMX_POLARITY_VSYNC_POL_SHIFT 1
enum {
MAIN_STREAMX_POLARITY_HSYNC_POL_MASK = 0x00000001,
MAIN_STREAMX_POLARITY_VSYNC_POL_MASK = 0x00000002,
};
enum {
MAIN_STREAMX_MISC0_SYNC_CLK_MASK = 0x00000001,
};
#define MAIN_STREAMX_MISC0_COMPONENT_FORMAT_SHIFT 1
#define MAIN_STREAMX_MISC0_COMPONENT_FORMAT_MASK 0x00000006
enum {
MAIN_STREAMX_MISC0_COMPONENT_FORMAT_RGB = 0x0,
MAIN_STREAMX_MISC0_COMPONENT_FORMAT_YCBCR422 = 0x1,
MAIN_STREAMX_MISC0_COMPONENT_FORMAT_YCBCR444 = 0x2,
};
#define MAIN_STREAMX_MISC0_DYNAMIC_RANGE_SHIFT 3
#define MAIN_STREAMX_MISC0_DYNAMIC_RANGE_MASK 0x00000008
#define MAIN_STREAMX_MISC0_YCBCR_COLORIMETRY_SHIFT 4
#define MAIN_STREAMX_MISC0_YCBCR_COLORIMETRY_MASK 0x00000010
#define MAIN_STREAMX_MISC0_BDC_SHIFT 5
#define MAIN_STREAMX_MISC0_BDC_MASK 0x000000E0
enum {
MAIN_STREAMX_MISC0_BDC_6BPC = 0x0,
MAIN_STREAMX_MISC0_BDC_8BPC = 0x1,
MAIN_STREAMX_MISC0_BDC_10BPC = 0x2,
MAIN_STREAMX_MISC0_BDC_12BPC = 0x3,
MAIN_STREAMX_MISC0_BDC_16BPC = 0x4,
};
enum {
PHY_CONFIG_PHY_RESET_ENABLE_MASK = 0x0000000,
PHY_CONFIG_PHY_RESET_MASK = 0x0000001,
PHY_CONFIG_GTTX_RESET_MASK = 0x0000002,
PHY_CONFIG_GT_ALL_RESET_MASK = 0x0000003,
PHY_CONFIG_TX_PHY_PMA_RESET_MASK = 0x0000100,
PHY_CONFIG_TX_PHY_PCS_RESET_MASK = 0x0000200,
PHY_CONFIG_TX_PHY_POLARITY_MASK = 0x0000800,
PHY_CONFIG_TX_PHY_PRBSFORCEERR_MASK = 0x0001000,
PHY_CONFIG_TX_PHY_POLARITY_IND_LANE_MASK = 0x0010000,
PHY_CONFIG_TX_PHY_POLARITY_LANE0_MASK = 0x0020000,
PHY_CONFIG_TX_PHY_POLARITY_LANE1_MASK = 0x0040000,
PHY_CONFIG_TX_PHY_POLARITY_LANE2_MASK = 0x0080000,
PHY_CONFIG_TX_PHY_POLARITY_LANE3_MASK = 0x0100000,
PHY_CONFIG_TX_PHY_8B10BEN_MASK = 0x0200000,
};
#define PHY_CONFIG_TX_PHY_LOOPBACK_SHIFT 13
#define PHY_CONFIG_TX_PHY_LOOPBACK_MASK 0x000E000
enum {
PHY_CLOCK_SELECT_162GBPS = 0x1,
PHY_CLOCK_SELECT_270GBPS = 0x3,
PHY_CLOCK_SELECT_540GBPS = 0x5,
};
enum {
VS_LEVEL_0 = 0x2,
VS_LEVEL_1 = 0x5,
VS_LEVEL_2 = 0x8,
VS_LEVEL_3 = 0xF,
VS_LEVEL_OFFSET = 0x4,
};
enum {
PE_LEVEL_0 = 0x00,
PE_LEVEL_1 = 0x0E,
PE_LEVEL_2 = 0x14,
PE_LEVEL_3 = 0x1B,
};
enum {
PHY_STATUS_RESET_LANE_2_3_DONE_SHIFT = 2,
PHY_STATUS_TX_ERROR_LANE_0_SHIFT = 18,
PHY_STATUS_TX_BUFFER_STATUS_LANE_1_SHIFT = 20,
PHY_STATUS_TX_ERROR_LANE_1_SHIFT = 22,
PHY_STATUS_TX_BUFFER_STATUS_LANE_0_SHIFT = 16,
PHY_STATUS_TX_BUFFER_STATUS_LANE_2_SHIFT = 24,
PHY_STATUS_TX_ERROR_LANE_2_SHIFT = 26,
PHY_STATUS_TX_BUFFER_STATUS_LANE_3_SHIFT = 28,
PHY_STATUS_TX_ERROR_LANE_3_SHIFT = 30,
};
enum {
PHY_STATUS_RESET_LANE_0_DONE_MASK = 0x00000001,
PHY_STATUS_RESET_LANE_1_DONE_MASK = 0x00000002,
PHY_STATUS_RESET_LANE_2_3_DONE_MASK = 0x0000000C,
PHY_STATUS_PLL_LANE0_1_LOCK_MASK = 0x00000010,
PHY_STATUS_PLL_LANE2_3_LOCK_MASK = 0x00000020,
PHY_STATUS_PLL_FABRIC_LOCK_MASK = 0x00000040,
PHY_STATUS_TX_BUFFER_STATUS_LANE_0_MASK = 0x00030000,
PHY_STATUS_TX_ERROR_LANE_0_MASK = 0x000C0000,
PHY_STATUS_TX_BUFFER_STATUS_LANE_1_MASK = 0x00300000,
PHY_STATUS_TX_ERROR_LANE_1_MASK = 0x00C00000,
PHY_STATUS_TX_BUFFER_STATUS_LANE_2_MASK = 0x03000000,
PHY_STATUS_TX_ERROR_LANE_2_MASK = 0x0C000000,
PHY_STATUS_TX_BUFFER_STATUS_LANE_3_MASK = 0x30000000,
PHY_STATUS_TX_ERROR_LANE_3_MASK = 0xC0000000,
};
#define PHY_STATUS_LANE_0_READY_MASK \
(PHY_STATUS_RESET_LANE_0_DONE_MASK | \
PHY_STATUS_PLL_LANE0_1_LOCK_MASK)
#define PHY_STATUS_LANES_0_1_READY_MASK \
(PHY_STATUS_LANE_0_READY_MASK | \
PHY_STATUS_RESET_LANE_1_DONE_MASK)
/*
* PHY_STATUS_ALL_LANES_READY_MASK seems to be missing lanes 0 and 1 in
* Xilinx dp_v3_0 implementation
*/
#define PHY_STATUS_ALL_LANES_READY_MASK \
(PHY_STATUS_LANES_0_1_READY_MASK | \
PHY_STATUS_RESET_LANE_2_3_DONE_MASK | \
PHY_STATUS_PLL_LANE2_3_LOCK_MASK)
/**
* phy_status_lanes_ready_mask() - Generate phy status ready mask
* @lane_count: Number of lanes for which to generate a mask
*
* Return: The generated phy status ready mask
*/
static inline u32 phy_status_lanes_ready_mask(u8 lane_count)
{
if (lane_count > 2)
return PHY_STATUS_ALL_LANES_READY_MASK;
if (lane_count == 2)
return PHY_STATUS_LANES_0_1_READY_MASK;
return PHY_STATUS_LANE_0_READY_MASK;
}
#define GT_DRP_COMMAND_DRP_ADDR_MASK 0x000F
#define GT_DRP_COMMAND_DRP_RW_CMD_MASK 0x0080
#define GT_DRP_COMMAND_DRP_W_DATA_SHIFT 16
#define GT_DRP_COMMAND_DRP_W_DATA_MASK 0xFF00
#define HDCP_ENABLE_BYPASS_DISABLE_MASK 0x0001
#endif /* __GDSYS_LOGICORE_DP_TX_REGIF_H__ */
| {
"pile_set_name": "Github"
} |
//
// Copyright 2011-2014 NimbusKit
//
// Forked from Three20 June 10, 2011 - Copyright 2009-2011 Facebook
//
// 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
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// 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.
//
#import "NILauncherView.h"
#import "NILauncherPageView.h"
#import "NimbusPagingScrollView.h"
#import "NIPagingScrollView+Subclassing.h"
#import "NimbusCore.h"
#if !defined(__has_feature) || !__has_feature(objc_arc)
#error "Nimbus requires ARC support."
#endif
static NSString* const kPageReuseIdentifier = @"page";
const NSInteger NILauncherViewGridBasedOnButtonSize = -1;
static const CGFloat kDefaultButtonDimensions = 80;
static const CGFloat kDefaultPadding = 10;
@interface NILauncherView() <NIPagingScrollViewDataSource, NIPagingScrollViewDelegate>
@property (nonatomic, strong) NIPagingScrollView* pagingScrollView;
@property (nonatomic, strong) UIPageControl* pager;
@property (nonatomic, assign) NSInteger numberOfPages;
@property (nonatomic, strong) NIViewRecycler* viewRecycler;
- (void)updateLayoutForPage:(NILauncherPageView *)page;
@end
@implementation NILauncherView
- (void)_configureDefaults {
// We handle autoresizing ourselves.
[self setAutoresizesSubviews:NO];
_viewRecycler = [[NIViewRecycler alloc] init];
_buttonSize = CGSizeMake(kDefaultButtonDimensions, kDefaultButtonDimensions);
_numberOfColumns = NILauncherViewGridBasedOnButtonSize;
_numberOfRows = NILauncherViewGridBasedOnButtonSize;
_maxNumberOfButtonsPerPage = NSIntegerMax;
_contentInsetForPages = UIEdgeInsetsMake(kDefaultPadding, kDefaultPadding, kDefaultPadding, kDefaultPadding);
// The paging scroll view.
_pagingScrollView = [[NIPagingScrollView alloc] initWithFrame:self.bounds];
_pagingScrollView.dataSource = self;
_pagingScrollView.delegate = self;
[self addSubview:_pagingScrollView];
// The pager displayed below the paging scroll view.
_pager = [[UIPageControl alloc] init];
_pager.hidesForSinglePage = YES;
// So, this is weird. Apparently if you don't set a background color on the pager control
// then taps won't be handled anywhere but within the dot area. If you do set a background
// color, however, then taps outside of the dot area DO change the selected page.
// \(o.o)/
_pager.backgroundColor = [UIColor blackColor];
// Similarly for the scroll view anywhere there isn't a subview.
// We update these background colors when the launcher view's own background color is set.
_pagingScrollView.backgroundColor = [UIColor blackColor];
// Don't update the pager when the user taps until we've animated to the new page.
// This allows us to reset the page index forcefully if necessary without flickering the
// pager's current selection.
_pager.defersCurrentPageDisplay = YES;
// When the user taps the pager control it fires a UIControlEventValueChanged notification.
[_pager addTarget:self action:@selector(pagerDidChangePage:) forControlEvents:UIControlEventValueChanged];
[self addSubview:_pager];
}
- (id)initWithFrame:(CGRect)frame {
if ((self = [super initWithFrame:frame])) {
[self _configureDefaults];
}
return self;
}
- (id)initWithCoder:(NSCoder *)aDecoder {
if ((self = [super initWithCoder:aDecoder])) {
[self _configureDefaults];
}
return self;
}
- (void)layoutSubviews {
[super layoutSubviews];
[_pager sizeToFit];
_pagingScrollView.frame = NIRectContract(self.bounds, 0, _pager.frame.size.height);
_pager.frame = NIRectShift(self.bounds, 0, _pagingScrollView.frame.size.height);
for (NILauncherPageView* pageView in self.pagingScrollView.visiblePages) {
[self updateLayoutForPage:pageView];
}
}
- (void)setBackgroundColor:(UIColor *)backgroundColor {
[super setBackgroundColor:backgroundColor];
self.pagingScrollView.backgroundColor = backgroundColor;
self.pager.backgroundColor = backgroundColor;
}
- (void)calculateLayoutForFrame:(CGRect)frame
buttonDimensions:(CGSize *)pButtonDimensions
numberOfRows:(NSInteger *)pNumberOfRows
numberOfColumns:(NSInteger *)pNumberOfColumns
buttonMargins:(CGSize *)pButtonMargins {
NIDASSERT(nil != pButtonDimensions);
NIDASSERT(nil != pNumberOfRows);
NIDASSERT(nil != pNumberOfColumns);
NIDASSERT(nil != pButtonMargins);
if (nil == pButtonDimensions
|| nil == pNumberOfRows
|| nil == pNumberOfColumns
|| nil == pButtonMargins) {
return;
}
CGFloat pageWidth = frame.size.width - self.contentInsetForPages.left - self.contentInsetForPages.right;
CGFloat pageHeight = frame.size.height - self.contentInsetForPages.top - self.contentInsetForPages.bottom;
CGSize buttonDimensions = self.buttonSize;
NSInteger numberOfColumns = self.numberOfColumns;
NSInteger numberOfRows = self.numberOfRows;
// Override point
if ([self.dataSource respondsToSelector:@selector(numberOfRowsPerPageInLauncherView:)]) {
numberOfRows = [self.dataSource numberOfRowsPerPageInLauncherView:self];
}
if ([self.dataSource respondsToSelector:@selector(numberOfColumnsPerPageInLauncherView:)]) {
numberOfColumns = [self.dataSource numberOfColumnsPerPageInLauncherView:self];
}
if (NILauncherViewGridBasedOnButtonSize == numberOfColumns) {
numberOfColumns = floorf(pageWidth / buttonDimensions.width);
}
if (NILauncherViewGridBasedOnButtonSize == numberOfRows) {
numberOfRows = floorf(pageHeight / buttonDimensions.height);
}
NIDASSERT(numberOfRows > 0);
NIDASSERT(numberOfColumns > 0);
numberOfRows = MAX(1, numberOfRows);
numberOfColumns = MAX(1, numberOfColumns);
CGFloat totalButtonWidth = numberOfColumns * buttonDimensions.width;
CGFloat buttonHorizontalSpacing = 0;
if (numberOfColumns > 1) {
buttonHorizontalSpacing = floorf((pageWidth - totalButtonWidth) / (numberOfColumns - 1));
}
CGFloat totalButtonHeight = numberOfRows * buttonDimensions.height;
CGFloat buttonVerticalSpacing = 0;
if (numberOfRows > 1) {
buttonVerticalSpacing = floorf((pageHeight - totalButtonHeight) / (numberOfRows - 1));
}
*pButtonDimensions = buttonDimensions;
*pNumberOfRows = numberOfRows;
*pNumberOfColumns = numberOfColumns;
pButtonMargins->width = buttonHorizontalSpacing;
pButtonMargins->height = buttonVerticalSpacing;
}
- (void)updateLayoutForPage:(NILauncherPageView *)page {
CGSize buttonDimensions = CGSizeZero;
NSInteger numberOfRows = 0;
NSInteger numberOfColumns = 0;
CGSize buttonMargins = CGSizeZero;
[self calculateLayoutForFrame:self.pagingScrollView.frame
buttonDimensions:&buttonDimensions
numberOfRows:&numberOfRows
numberOfColumns:&numberOfColumns
buttonMargins:&buttonMargins];
page.contentInset = self.contentInsetForPages;
page.viewSize = buttonDimensions;
page.viewMargins = buttonMargins;
}
#pragma mark - UIPageControl Change Notifications
- (void)pagerDidChangePage:(UIPageControl*)pager {
if ([self.pagingScrollView moveToPageAtIndex:pager.currentPage animated:YES]) {
// Once we've handled the page change notification, notify the pager that it's ok to update
// the page display.
[self.pager updateCurrentPageDisplay];
}
}
#pragma mark - Actions
/**
* Find a button in the pages and retrieve its page and index.
*
* @param[in] searchButton The button you are looking for.
* @param[out] pPage The resulting page, if found.
* @param[out] pIndex The resulting index, if found.
* @returns YES if the button was found. NO otherwise.
*/
- (BOOL)pageAndIndexOfButton:(UIButton *)searchButton page:(NSInteger *)pPage index:(NSInteger *)pIndex {
NIDASSERT(nil != pPage);
NIDASSERT(nil != pIndex);
if (nil == pPage
|| nil == pIndex) {
return NO;
}
for (NILauncherPageView* pageView in self.pagingScrollView.visiblePages) {
for (NSInteger buttonIndex = 0; buttonIndex < pageView.recyclableViews.count; ++buttonIndex) {
UIView<NILauncherButtonView>* buttonView = [pageView.recyclableViews objectAtIndex:buttonIndex];
if (buttonView.button == searchButton) {
*pPage = pageView.pageIndex;
*pIndex = buttonIndex;
return YES;
}
}
}
return NO;
}
- (void)didTapButton:(UIButton *)tappedButton {
NSInteger page = -1;
NSInteger buttonIndex = 0;
if ([self pageAndIndexOfButton:tappedButton
page:&page
index:&buttonIndex]) {
if ([self.delegate respondsToSelector:@selector(launcherView:didSelectItemOnPage:atIndex:)]) {
[self.delegate launcherView:self didSelectItemOnPage:page atIndex:buttonIndex];
}
} else {
// How exactly did we tap a button that wasn't a part of the launcher view?
NIDASSERT(NO);
}
}
#pragma mark - NIPagingScrollViewDataSource
- (NSInteger)numberOfPagesInPagingScrollView:(NIPagingScrollView *)pagingScrollView {
return self.numberOfPages;
}
- (UIView<NIPagingScrollViewPage> *)pagingScrollView:(NIPagingScrollView *)pagingScrollView pageViewForIndex:(NSInteger)pageIndex {
NILauncherPageView* page = (NILauncherPageView *)[self.pagingScrollView dequeueReusablePageWithIdentifier:kPageReuseIdentifier];
if (nil == page) {
page = [[NILauncherPageView alloc] initWithReuseIdentifier:kPageReuseIdentifier];
page.viewRecycler = self.viewRecycler;
}
[self updateLayoutForPage:page];
NSInteger numberOfButtons = [self.dataSource launcherView:self numberOfButtonsInPage:pageIndex];
numberOfButtons = MIN(numberOfButtons, self.maxNumberOfButtonsPerPage);
for (NSInteger buttonIndex = 0 ; buttonIndex < numberOfButtons; ++buttonIndex) {
UIView<NILauncherButtonView>* buttonView = [self.dataSource launcherView:self buttonViewForPage:pageIndex atIndex:buttonIndex];
NSAssert(nil != buttonView, @"A non-nil UIView must be returned.");
[buttonView.button addTarget:self action:@selector(didTapButton:) forControlEvents:UIControlEventTouchUpInside];
[page addRecyclableView:(UIView<NIRecyclableView> *)buttonView];
}
return page;
}
#pragma mark - NIPagingScrollViewDelegate
- (void)pagingScrollViewDidChangePages:(NIPagingScrollView *)pagingScrollView {
self.pager.currentPage = pagingScrollView.centerPageIndex;
}
#pragma mark - Public
- (void)reloadData {
if ([self.dataSource respondsToSelector:@selector(numberOfPagesInLauncherView:)]) {
_numberOfPages = [self.dataSource numberOfPagesInLauncherView:self];
} else {
_numberOfPages = 1;
}
self.pager.numberOfPages = _numberOfPages;
[self.pagingScrollView reloadData];
[self setNeedsLayout];
}
- (UIView<NILauncherButtonView> *)dequeueReusableViewWithIdentifier:(NSString *)identifier {
NIDASSERT(nil != identifier);
if (nil == identifier) {
return nil;
}
return (UIView<NILauncherButtonView> *)[self.viewRecycler dequeueReusableViewWithIdentifier:identifier];
}
- (void)setcontentInsetForPages:(UIEdgeInsets)contentInsetForPages {
_contentInsetForPages = contentInsetForPages;
for (NILauncherPageView* pageView in self.pagingScrollView.visiblePages) {
pageView.contentInset = contentInsetForPages;
}
}
- (void)setButtonSize:(CGSize)buttonSize {
_buttonSize = buttonSize;
for (NILauncherPageView* pageView in self.pagingScrollView.visiblePages) {
pageView.viewSize = buttonSize;
}
}
- (void)willRotateToInterfaceOrientation:(UIInterfaceOrientation)toInterfaceOrientation duration:(NSTimeInterval)duration {
[self.pagingScrollView willRotateToInterfaceOrientation:toInterfaceOrientation duration:duration];
}
- (void)willAnimateRotationToInterfaceOrientation:(UIInterfaceOrientation)toInterfaceOrientation duration:(NSTimeInterval)duration {
[self.pagingScrollView willAnimateRotationToInterfaceOrientation:toInterfaceOrientation duration:duration];
}
@end
| {
"pile_set_name": "Github"
} |
package com.journaldev.customfonts;
import android.graphics.Typeface;
import android.support.v7.app.AppCompatActivity;
import android.os.Bundle;
import android.widget.Button;
import android.widget.TextView;
public class MainActivity extends AppCompatActivity {
//TextView ambleBold, ambleLight, ambleRegular, openSansItalic, openSansRegular;
Button btn;
/*private String A_BOLD= "Amble-Bold.ttf";
private String A_LIGHT="Amble-Light.ttf";
private String A_REGULAR= "Amble-Regular.ttf";
private String O_ITALIC= "OpenSans-Italic.ttf";
private String O_REGULAR="OpenSans-Regular.ttf";*/
private String P_REGULAR="Pacifico.ttf";
@Override
protected void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.activity_custom_fonts);
/*ambleBold=(TextView)findViewById(R.id.ambleBold);
ambleLight=(TextView)findViewById(R.id.ambleLight);
ambleRegular=(TextView)findViewById(R.id.ambleRegular);
openSansRegular=(TextView)findViewById(R.id.opRegular);
openSansItalic=(TextView)findViewById(R.id.opItalic);*/
btn=(Button)findViewById(R.id.pacifico);
/*ambleBold.setTypeface(Typeface.createFromAsset(getAssets(), A_BOLD));
ambleLight.setTypeface(Typeface.createFromAsset(getAssets(), A_LIGHT));
ambleRegular.setTypeface(Typeface.createFromAsset(getAssets(), A_REGULAR));
openSansRegular.setTypeface(Typeface.createFromAsset(getAssets(), O_REGULAR));
openSansItalic.setTypeface(Typeface.createFromAsset(getAssets(), O_ITALIC));*/
btn.setTypeface(Typeface.createFromAsset(getAssets(), P_REGULAR));
}
}
| {
"pile_set_name": "Github"
} |
/*
*******************************************************************************
*
* Copyright (C) 2002-2014, International Business Machines
* Corporation and others. All Rights Reserved.
*
*******************************************************************************
* file name: uprops.cpp
* encoding: US-ASCII
* tab size: 8 (not used)
* indentation:4
*
* created on: 2002feb24
* created by: Markus W. Scherer
*
* Implementations for mostly non-core Unicode character properties
* stored in uprops.icu.
*
* With the APIs implemented here, almost all properties files and
* their associated implementation files are used from this file,
* including those for normalization and case mappings.
*/
#include "unicode/utypes.h"
#include "unicode/uchar.h"
#include "unicode/unorm2.h"
#include "unicode/uscript.h"
#include "unicode/ustring.h"
#include "cstring.h"
#include "normalizer2impl.h"
#include "umutex.h"
#include "ubidi_props.h"
#include "uprops.h"
#include "ucase.h"
#include "ustr_imp.h"
U_NAMESPACE_USE
#define GET_BIDI_PROPS() ubidi_getSingleton()
/* general properties API functions ----------------------------------------- */
struct BinaryProperty;
typedef UBool BinaryPropertyContains(const BinaryProperty &prop, UChar32 c, UProperty which);
struct BinaryProperty {
int32_t column; // SRC_PROPSVEC column, or "source" if mask==0
uint32_t mask;
BinaryPropertyContains *contains;
};
static UBool defaultContains(const BinaryProperty &prop, UChar32 c, UProperty /*which*/) {
/* systematic, directly stored properties */
return (u_getUnicodeProperties(c, prop.column)&prop.mask)!=0;
}
static UBool caseBinaryPropertyContains(const BinaryProperty &/*prop*/, UChar32 c, UProperty which) {
return ucase_hasBinaryProperty(c, which);
}
static UBool isBidiControl(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return ubidi_isBidiControl(GET_BIDI_PROPS(), c);
}
static UBool isMirrored(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return ubidi_isMirrored(GET_BIDI_PROPS(), c);
}
static UBool isJoinControl(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return ubidi_isJoinControl(GET_BIDI_PROPS(), c);
}
#if UCONFIG_NO_NORMALIZATION
static UBool hasFullCompositionExclusion(const BinaryProperty &, UChar32, UProperty) {
return FALSE;
}
#else
static UBool hasFullCompositionExclusion(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
// By definition, Full_Composition_Exclusion is the same as NFC_QC=No.
UErrorCode errorCode=U_ZERO_ERROR;
const Normalizer2Impl *impl=Normalizer2Factory::getNFCImpl(errorCode);
return U_SUCCESS(errorCode) && impl->isCompNo(impl->getNorm16(c));
}
#endif
// UCHAR_NF*_INERT properties
#if UCONFIG_NO_NORMALIZATION
static UBool isNormInert(const BinaryProperty &, UChar32, UProperty) {
return FALSE;
}
#else
static UBool isNormInert(const BinaryProperty &/*prop*/, UChar32 c, UProperty which) {
UErrorCode errorCode=U_ZERO_ERROR;
const Normalizer2 *norm2=Normalizer2Factory::getInstance(
(UNormalizationMode)(which-UCHAR_NFD_INERT+UNORM_NFD), errorCode);
return U_SUCCESS(errorCode) && norm2->isInert(c);
}
#endif
#if UCONFIG_NO_NORMALIZATION
static UBool changesWhenCasefolded(const BinaryProperty &, UChar32, UProperty) {
return FALSE;
}
#else
static UBool changesWhenCasefolded(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
UnicodeString nfd;
UErrorCode errorCode=U_ZERO_ERROR;
const Normalizer2 *nfcNorm2=Normalizer2::getNFCInstance(errorCode);
if(U_FAILURE(errorCode)) {
return FALSE;
}
if(nfcNorm2->getDecomposition(c, nfd)) {
/* c has a decomposition */
if(nfd.length()==1) {
c=nfd[0]; /* single BMP code point */
} else if(nfd.length()<=U16_MAX_LENGTH &&
nfd.length()==U16_LENGTH(c=nfd.char32At(0))
) {
/* single supplementary code point */
} else {
c=U_SENTINEL;
}
} else if(c<0) {
return FALSE; /* protect against bad input */
}
if(c>=0) {
/* single code point */
const UCaseProps *csp=ucase_getSingleton();
const UChar *resultString;
return (UBool)(ucase_toFullFolding(csp, c, &resultString, U_FOLD_CASE_DEFAULT)>=0);
} else {
/* guess some large but stack-friendly capacity */
UChar dest[2*UCASE_MAX_STRING_LENGTH];
int32_t destLength;
destLength=u_strFoldCase(dest, UPRV_LENGTHOF(dest),
nfd.getBuffer(), nfd.length(),
U_FOLD_CASE_DEFAULT, &errorCode);
return (UBool)(U_SUCCESS(errorCode) &&
0!=u_strCompare(nfd.getBuffer(), nfd.length(),
dest, destLength, FALSE));
}
}
#endif
#if UCONFIG_NO_NORMALIZATION
static UBool changesWhenNFKC_Casefolded(const BinaryProperty &, UChar32, UProperty) {
return FALSE;
}
#else
static UBool changesWhenNFKC_Casefolded(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
UErrorCode errorCode=U_ZERO_ERROR;
const Normalizer2Impl *kcf=Normalizer2Factory::getNFKC_CFImpl(errorCode);
if(U_FAILURE(errorCode)) {
return FALSE;
}
UnicodeString src(c);
UnicodeString dest;
{
// The ReorderingBuffer must be in a block because its destructor
// needs to release dest's buffer before we look at its contents.
ReorderingBuffer buffer(*kcf, dest);
// Small destCapacity for NFKC_CF(c).
if(buffer.init(5, errorCode)) {
const UChar *srcArray=src.getBuffer();
kcf->compose(srcArray, srcArray+src.length(), FALSE,
TRUE, buffer, errorCode);
}
}
return U_SUCCESS(errorCode) && dest!=src;
}
#endif
#if UCONFIG_NO_NORMALIZATION
static UBool isCanonSegmentStarter(const BinaryProperty &, UChar32, UProperty) {
return FALSE;
}
#else
static UBool isCanonSegmentStarter(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
UErrorCode errorCode=U_ZERO_ERROR;
const Normalizer2Impl *impl=Normalizer2Factory::getNFCImpl(errorCode);
return
U_SUCCESS(errorCode) && impl->ensureCanonIterData(errorCode) &&
impl->isCanonSegmentStarter(c);
}
#endif
static UBool isPOSIX_alnum(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return u_isalnumPOSIX(c);
}
static UBool isPOSIX_blank(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return u_isblank(c);
}
static UBool isPOSIX_graph(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return u_isgraphPOSIX(c);
}
static UBool isPOSIX_print(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return u_isprintPOSIX(c);
}
static UBool isPOSIX_xdigit(const BinaryProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return u_isxdigit(c);
}
static const BinaryProperty binProps[UCHAR_BINARY_LIMIT]={
/*
* column and mask values for binary properties from u_getUnicodeProperties().
* Must be in order of corresponding UProperty,
* and there must be exactly one entry per binary UProperty.
*
* Properties with mask==0 are handled in code.
* For them, column is the UPropertySource value.
*/
{ 1, U_MASK(UPROPS_ALPHABETIC), defaultContains },
{ 1, U_MASK(UPROPS_ASCII_HEX_DIGIT), defaultContains },
{ UPROPS_SRC_BIDI, 0, isBidiControl },
{ UPROPS_SRC_BIDI, 0, isMirrored },
{ 1, U_MASK(UPROPS_DASH), defaultContains },
{ 1, U_MASK(UPROPS_DEFAULT_IGNORABLE_CODE_POINT), defaultContains },
{ 1, U_MASK(UPROPS_DEPRECATED), defaultContains },
{ 1, U_MASK(UPROPS_DIACRITIC), defaultContains },
{ 1, U_MASK(UPROPS_EXTENDER), defaultContains },
{ UPROPS_SRC_NFC, 0, hasFullCompositionExclusion },
{ 1, U_MASK(UPROPS_GRAPHEME_BASE), defaultContains },
{ 1, U_MASK(UPROPS_GRAPHEME_EXTEND), defaultContains },
{ 1, U_MASK(UPROPS_GRAPHEME_LINK), defaultContains },
{ 1, U_MASK(UPROPS_HEX_DIGIT), defaultContains },
{ 1, U_MASK(UPROPS_HYPHEN), defaultContains },
{ 1, U_MASK(UPROPS_ID_CONTINUE), defaultContains },
{ 1, U_MASK(UPROPS_ID_START), defaultContains },
{ 1, U_MASK(UPROPS_IDEOGRAPHIC), defaultContains },
{ 1, U_MASK(UPROPS_IDS_BINARY_OPERATOR), defaultContains },
{ 1, U_MASK(UPROPS_IDS_TRINARY_OPERATOR), defaultContains },
{ UPROPS_SRC_BIDI, 0, isJoinControl },
{ 1, U_MASK(UPROPS_LOGICAL_ORDER_EXCEPTION), defaultContains },
{ UPROPS_SRC_CASE, 0, caseBinaryPropertyContains }, // UCHAR_LOWERCASE
{ 1, U_MASK(UPROPS_MATH), defaultContains },
{ 1, U_MASK(UPROPS_NONCHARACTER_CODE_POINT), defaultContains },
{ 1, U_MASK(UPROPS_QUOTATION_MARK), defaultContains },
{ 1, U_MASK(UPROPS_RADICAL), defaultContains },
{ UPROPS_SRC_CASE, 0, caseBinaryPropertyContains }, // UCHAR_SOFT_DOTTED
{ 1, U_MASK(UPROPS_TERMINAL_PUNCTUATION), defaultContains },
{ 1, U_MASK(UPROPS_UNIFIED_IDEOGRAPH), defaultContains },
{ UPROPS_SRC_CASE, 0, caseBinaryPropertyContains }, // UCHAR_UPPERCASE
{ 1, U_MASK(UPROPS_WHITE_SPACE), defaultContains },
{ 1, U_MASK(UPROPS_XID_CONTINUE), defaultContains },
{ 1, U_MASK(UPROPS_XID_START), defaultContains },
{ UPROPS_SRC_CASE, 0, caseBinaryPropertyContains }, // UCHAR_CASE_SENSITIVE
{ 1, U_MASK(UPROPS_S_TERM), defaultContains },
{ 1, U_MASK(UPROPS_VARIATION_SELECTOR), defaultContains },
{ UPROPS_SRC_NFC, 0, isNormInert }, // UCHAR_NFD_INERT
{ UPROPS_SRC_NFKC, 0, isNormInert }, // UCHAR_NFKD_INERT
{ UPROPS_SRC_NFC, 0, isNormInert }, // UCHAR_NFC_INERT
{ UPROPS_SRC_NFKC, 0, isNormInert }, // UCHAR_NFKC_INERT
{ UPROPS_SRC_NFC_CANON_ITER, 0, isCanonSegmentStarter },
{ 1, U_MASK(UPROPS_PATTERN_SYNTAX), defaultContains },
{ 1, U_MASK(UPROPS_PATTERN_WHITE_SPACE), defaultContains },
{ UPROPS_SRC_CHAR_AND_PROPSVEC, 0, isPOSIX_alnum },
{ UPROPS_SRC_CHAR, 0, isPOSIX_blank },
{ UPROPS_SRC_CHAR, 0, isPOSIX_graph },
{ UPROPS_SRC_CHAR, 0, isPOSIX_print },
{ UPROPS_SRC_CHAR, 0, isPOSIX_xdigit },
{ UPROPS_SRC_CASE, 0, caseBinaryPropertyContains }, // UCHAR_CASED
{ UPROPS_SRC_CASE, 0, caseBinaryPropertyContains }, // UCHAR_CASE_IGNORABLE
{ UPROPS_SRC_CASE, 0, caseBinaryPropertyContains }, // UCHAR_CHANGES_WHEN_LOWERCASED
{ UPROPS_SRC_CASE, 0, caseBinaryPropertyContains }, // UCHAR_CHANGES_WHEN_UPPERCASED
{ UPROPS_SRC_CASE, 0, caseBinaryPropertyContains }, // UCHAR_CHANGES_WHEN_TITLECASED
{ UPROPS_SRC_CASE_AND_NORM, 0, changesWhenCasefolded },
{ UPROPS_SRC_CASE, 0, caseBinaryPropertyContains }, // UCHAR_CHANGES_WHEN_CASEMAPPED
{ UPROPS_SRC_NFKC_CF, 0, changesWhenNFKC_Casefolded }
};
U_CAPI UBool U_EXPORT2
u_hasBinaryProperty(UChar32 c, UProperty which) {
/* c is range-checked in the functions that are called from here */
if(which<UCHAR_BINARY_START || UCHAR_BINARY_LIMIT<=which) {
/* not a known binary property */
return FALSE;
} else {
const BinaryProperty &prop=binProps[which];
return prop.contains(prop, c, which);
}
}
struct IntProperty;
typedef int32_t IntPropertyGetValue(const IntProperty &prop, UChar32 c, UProperty which);
typedef int32_t IntPropertyGetMaxValue(const IntProperty &prop, UProperty which);
struct IntProperty {
int32_t column; // SRC_PROPSVEC column, or "source" if mask==0
uint32_t mask;
int32_t shift; // =maxValue if getMaxValueFromShift() is used
IntPropertyGetValue *getValue;
IntPropertyGetMaxValue *getMaxValue;
};
static int32_t defaultGetValue(const IntProperty &prop, UChar32 c, UProperty /*which*/) {
/* systematic, directly stored properties */
return (int32_t)(u_getUnicodeProperties(c, prop.column)&prop.mask)>>prop.shift;
}
static int32_t defaultGetMaxValue(const IntProperty &prop, UProperty /*which*/) {
return (uprv_getMaxValues(prop.column)&prop.mask)>>prop.shift;
}
static int32_t getMaxValueFromShift(const IntProperty &prop, UProperty /*which*/) {
return prop.shift;
}
static int32_t getBiDiClass(const IntProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return (int32_t)u_charDirection(c);
}
static int32_t getBiDiPairedBracketType(const IntProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return (int32_t)ubidi_getPairedBracketType(GET_BIDI_PROPS(), c);
}
static int32_t biDiGetMaxValue(const IntProperty &/*prop*/, UProperty which) {
return ubidi_getMaxValue(GET_BIDI_PROPS(), which);
}
#if UCONFIG_NO_NORMALIZATION
static int32_t getCombiningClass(const IntProperty &, UChar32, UProperty) {
return 0;
}
#else
static int32_t getCombiningClass(const IntProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return u_getCombiningClass(c);
}
#endif
static int32_t getGeneralCategory(const IntProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return (int32_t)u_charType(c);
}
static int32_t getJoiningGroup(const IntProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return ubidi_getJoiningGroup(GET_BIDI_PROPS(), c);
}
static int32_t getJoiningType(const IntProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return ubidi_getJoiningType(GET_BIDI_PROPS(), c);
}
static int32_t getNumericType(const IntProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
int32_t ntv=(int32_t)GET_NUMERIC_TYPE_VALUE(u_getMainProperties(c));
return UPROPS_NTV_GET_TYPE(ntv);
}
static int32_t getScript(const IntProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
UErrorCode errorCode=U_ZERO_ERROR;
return (int32_t)uscript_getScript(c, &errorCode);
}
/*
* Map some of the Grapheme Cluster Break values to Hangul Syllable Types.
* Hangul_Syllable_Type is fully redundant with a subset of Grapheme_Cluster_Break.
*/
static const UHangulSyllableType gcbToHst[]={
U_HST_NOT_APPLICABLE, /* U_GCB_OTHER */
U_HST_NOT_APPLICABLE, /* U_GCB_CONTROL */
U_HST_NOT_APPLICABLE, /* U_GCB_CR */
U_HST_NOT_APPLICABLE, /* U_GCB_EXTEND */
U_HST_LEADING_JAMO, /* U_GCB_L */
U_HST_NOT_APPLICABLE, /* U_GCB_LF */
U_HST_LV_SYLLABLE, /* U_GCB_LV */
U_HST_LVT_SYLLABLE, /* U_GCB_LVT */
U_HST_TRAILING_JAMO, /* U_GCB_T */
U_HST_VOWEL_JAMO /* U_GCB_V */
/*
* Omit GCB values beyond what we need for hst.
* The code below checks for the array length.
*/
};
static int32_t getHangulSyllableType(const IntProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
/* see comments on gcbToHst[] above */
int32_t gcb=(int32_t)(u_getUnicodeProperties(c, 2)&UPROPS_GCB_MASK)>>UPROPS_GCB_SHIFT;
if(gcb<UPRV_LENGTHOF(gcbToHst)) {
return gcbToHst[gcb];
} else {
return U_HST_NOT_APPLICABLE;
}
}
#if UCONFIG_NO_NORMALIZATION
static int32_t getNormQuickCheck(const IntProperty &, UChar32, UProperty) {
return 0;
}
#else
static int32_t getNormQuickCheck(const IntProperty &/*prop*/, UChar32 c, UProperty which) {
return (int32_t)unorm_getQuickCheck(c, (UNormalizationMode)(which-UCHAR_NFD_QUICK_CHECK+UNORM_NFD));
}
#endif
#if UCONFIG_NO_NORMALIZATION
static int32_t getLeadCombiningClass(const IntProperty &, UChar32, UProperty) {
return 0;
}
#else
static int32_t getLeadCombiningClass(const IntProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return unorm_getFCD16(c)>>8;
}
#endif
#if UCONFIG_NO_NORMALIZATION
static int32_t getTrailCombiningClass(const IntProperty &, UChar32, UProperty) {
return 0;
}
#else
static int32_t getTrailCombiningClass(const IntProperty &/*prop*/, UChar32 c, UProperty /*which*/) {
return unorm_getFCD16(c)&0xff;
}
#endif
static const IntProperty intProps[UCHAR_INT_LIMIT-UCHAR_INT_START]={
/*
* column, mask and shift values for int-value properties from u_getUnicodeProperties().
* Must be in order of corresponding UProperty,
* and there must be exactly one entry per int UProperty.
*
* Properties with mask==0 are handled in code.
* For them, column is the UPropertySource value.
*/
{ UPROPS_SRC_BIDI, 0, 0, getBiDiClass, biDiGetMaxValue },
{ 0, UPROPS_BLOCK_MASK, UPROPS_BLOCK_SHIFT, defaultGetValue, defaultGetMaxValue },
{ UPROPS_SRC_NFC, 0, 0xff, getCombiningClass, getMaxValueFromShift },
{ 2, UPROPS_DT_MASK, 0, defaultGetValue, defaultGetMaxValue },
{ 0, UPROPS_EA_MASK, UPROPS_EA_SHIFT, defaultGetValue, defaultGetMaxValue },
{ UPROPS_SRC_CHAR, 0, (int32_t)U_CHAR_CATEGORY_COUNT-1,getGeneralCategory, getMaxValueFromShift },
{ UPROPS_SRC_BIDI, 0, 0, getJoiningGroup, biDiGetMaxValue },
{ UPROPS_SRC_BIDI, 0, 0, getJoiningType, biDiGetMaxValue },
{ 2, UPROPS_LB_MASK, UPROPS_LB_SHIFT, defaultGetValue, defaultGetMaxValue },
{ UPROPS_SRC_CHAR, 0, (int32_t)U_NT_COUNT-1, getNumericType, getMaxValueFromShift },
{ 0, UPROPS_SCRIPT_MASK, 0, getScript, defaultGetMaxValue },
{ UPROPS_SRC_PROPSVEC, 0, (int32_t)U_HST_COUNT-1, getHangulSyllableType, getMaxValueFromShift },
// UCHAR_NFD_QUICK_CHECK: max=1=YES -- never "maybe", only "no" or "yes"
{ UPROPS_SRC_NFC, 0, (int32_t)UNORM_YES, getNormQuickCheck, getMaxValueFromShift },
// UCHAR_NFKD_QUICK_CHECK: max=1=YES -- never "maybe", only "no" or "yes"
{ UPROPS_SRC_NFKC, 0, (int32_t)UNORM_YES, getNormQuickCheck, getMaxValueFromShift },
// UCHAR_NFC_QUICK_CHECK: max=2=MAYBE
{ UPROPS_SRC_NFC, 0, (int32_t)UNORM_MAYBE, getNormQuickCheck, getMaxValueFromShift },
// UCHAR_NFKC_QUICK_CHECK: max=2=MAYBE
{ UPROPS_SRC_NFKC, 0, (int32_t)UNORM_MAYBE, getNormQuickCheck, getMaxValueFromShift },
{ UPROPS_SRC_NFC, 0, 0xff, getLeadCombiningClass, getMaxValueFromShift },
{ UPROPS_SRC_NFC, 0, 0xff, getTrailCombiningClass, getMaxValueFromShift },
{ 2, UPROPS_GCB_MASK, UPROPS_GCB_SHIFT, defaultGetValue, defaultGetMaxValue },
{ 2, UPROPS_SB_MASK, UPROPS_SB_SHIFT, defaultGetValue, defaultGetMaxValue },
{ 2, UPROPS_WB_MASK, UPROPS_WB_SHIFT, defaultGetValue, defaultGetMaxValue },
{ UPROPS_SRC_BIDI, 0, 0, getBiDiPairedBracketType, biDiGetMaxValue },
};
U_CAPI int32_t U_EXPORT2
u_getIntPropertyValue(UChar32 c, UProperty which) {
if(which<UCHAR_INT_START) {
if(UCHAR_BINARY_START<=which && which<UCHAR_BINARY_LIMIT) {
const BinaryProperty &prop=binProps[which];
return prop.contains(prop, c, which);
}
} else if(which<UCHAR_INT_LIMIT) {
const IntProperty &prop=intProps[which-UCHAR_INT_START];
return prop.getValue(prop, c, which);
} else if(which==UCHAR_GENERAL_CATEGORY_MASK) {
return U_MASK(u_charType(c));
}
return 0; // undefined
}
U_CAPI int32_t U_EXPORT2
u_getIntPropertyMinValue(UProperty /*which*/) {
return 0; /* all binary/enum/int properties have a minimum value of 0 */
}
U_CAPI int32_t U_EXPORT2
u_getIntPropertyMaxValue(UProperty which) {
if(which<UCHAR_INT_START) {
if(UCHAR_BINARY_START<=which && which<UCHAR_BINARY_LIMIT) {
return 1; // maximum TRUE for all binary properties
}
} else if(which<UCHAR_INT_LIMIT) {
const IntProperty &prop=intProps[which-UCHAR_INT_START];
return prop.getMaxValue(prop, which);
}
return -1; // undefined
}
U_CFUNC UPropertySource U_EXPORT2
uprops_getSource(UProperty which) {
if(which<UCHAR_BINARY_START) {
return UPROPS_SRC_NONE; /* undefined */
} else if(which<UCHAR_BINARY_LIMIT) {
const BinaryProperty &prop=binProps[which];
if(prop.mask!=0) {
return UPROPS_SRC_PROPSVEC;
} else {
return (UPropertySource)prop.column;
}
} else if(which<UCHAR_INT_START) {
return UPROPS_SRC_NONE; /* undefined */
} else if(which<UCHAR_INT_LIMIT) {
const IntProperty &prop=intProps[which-UCHAR_INT_START];
if(prop.mask!=0) {
return UPROPS_SRC_PROPSVEC;
} else {
return (UPropertySource)prop.column;
}
} else if(which<UCHAR_STRING_START) {
switch(which) {
case UCHAR_GENERAL_CATEGORY_MASK:
case UCHAR_NUMERIC_VALUE:
return UPROPS_SRC_CHAR;
default:
return UPROPS_SRC_NONE;
}
} else if(which<UCHAR_STRING_LIMIT) {
switch(which) {
case UCHAR_AGE:
return UPROPS_SRC_PROPSVEC;
case UCHAR_BIDI_MIRRORING_GLYPH:
return UPROPS_SRC_BIDI;
case UCHAR_CASE_FOLDING:
case UCHAR_LOWERCASE_MAPPING:
case UCHAR_SIMPLE_CASE_FOLDING:
case UCHAR_SIMPLE_LOWERCASE_MAPPING:
case UCHAR_SIMPLE_TITLECASE_MAPPING:
case UCHAR_SIMPLE_UPPERCASE_MAPPING:
case UCHAR_TITLECASE_MAPPING:
case UCHAR_UPPERCASE_MAPPING:
return UPROPS_SRC_CASE;
case UCHAR_ISO_COMMENT:
case UCHAR_NAME:
case UCHAR_UNICODE_1_NAME:
return UPROPS_SRC_NAMES;
default:
return UPROPS_SRC_NONE;
}
} else {
switch(which) {
case UCHAR_SCRIPT_EXTENSIONS:
return UPROPS_SRC_PROPSVEC;
default:
return UPROPS_SRC_NONE; /* undefined */
}
}
}
#if !UCONFIG_NO_NORMALIZATION
U_CAPI int32_t U_EXPORT2
u_getFC_NFKC_Closure(UChar32 c, UChar *dest, int32_t destCapacity, UErrorCode *pErrorCode) {
if(pErrorCode==NULL || U_FAILURE(*pErrorCode)) {
return 0;
}
if(destCapacity<0 || (dest==NULL && destCapacity>0)) {
*pErrorCode=U_ILLEGAL_ARGUMENT_ERROR;
return 0;
}
// Compute the FC_NFKC_Closure on the fly:
// We have the API for complete coverage of Unicode properties, although
// this value by itself is not useful via API.
// (What could be useful is a custom normalization table that combines
// case folding and NFKC.)
// For the derivation, see Unicode's DerivedNormalizationProps.txt.
const Normalizer2 *nfkc=Normalizer2::getNFKCInstance(*pErrorCode);
const UCaseProps *csp=ucase_getSingleton();
if(U_FAILURE(*pErrorCode)) {
return 0;
}
// first: b = NFKC(Fold(a))
UnicodeString folded1String;
const UChar *folded1;
int32_t folded1Length=ucase_toFullFolding(csp, c, &folded1, U_FOLD_CASE_DEFAULT);
if(folded1Length<0) {
const Normalizer2Impl *nfkcImpl=Normalizer2Factory::getImpl(nfkc);
if(nfkcImpl->getCompQuickCheck(nfkcImpl->getNorm16(c))!=UNORM_NO) {
return u_terminateUChars(dest, destCapacity, 0, pErrorCode); // c does not change at all under CaseFolding+NFKC
}
folded1String.setTo(c);
} else {
if(folded1Length>UCASE_MAX_STRING_LENGTH) {
folded1String.setTo(folded1Length);
} else {
folded1String.setTo(FALSE, folded1, folded1Length);
}
}
UnicodeString kc1=nfkc->normalize(folded1String, *pErrorCode);
// second: c = NFKC(Fold(b))
UnicodeString folded2String(kc1);
UnicodeString kc2=nfkc->normalize(folded2String.foldCase(), *pErrorCode);
// if (c != b) add the mapping from a to c
if(U_FAILURE(*pErrorCode) || kc1==kc2) {
return u_terminateUChars(dest, destCapacity, 0, pErrorCode);
} else {
return kc2.extract(dest, destCapacity, *pErrorCode);
}
}
#endif
| {
"pile_set_name": "Github"
} |
page_title: Installation from Binaries
page_description: Instructions for installing Docker as a binary. Mostly meant for hackers who want to try out Docker on a variety of environments.
page_keywords: binaries, installation, docker, documentation, linux
# Binaries
**This instruction set is meant for hackers who want to try out Docker
on a variety of environments.**
Before following these directions, you should really check if a packaged
version of Docker is already available for your distribution. We have
packages for many distributions, and more keep showing up all the time!
## Check runtime dependencies
To run properly, docker needs the following software to be installed at
runtime:
- iptables version 1.4 or later
- Git version 1.7 or later
- procps (or similar provider of a "ps" executable)
- XZ Utils 4.9 or later
- a [properly mounted](
https://github.com/tianon/cgroupfs-mount/blob/master/cgroupfs-mount)
cgroupfs hierarchy (having a single, all-encompassing "cgroup" mount
point [is](https://github.com/docker/docker/issues/2683)
[not](https://github.com/docker/docker/issues/3485)
[sufficient](https://github.com/docker/docker/issues/4568))
## Check kernel dependencies
Docker in daemon mode has specific kernel requirements. For details,
check your distribution in [*Installation*](../#installation-list).
A 3.10 Linux kernel is the minimum requirement for Docker.
Kernels older than 3.10 lack some of the features required to run Docker
containers. These older versions are known to have bugs which cause data loss
and frequently panic under certain conditions.
The latest minor version (3.x.y) of the 3.10 (or a newer maintained version)
Linux kernel is recommended. Keeping the kernel up to date with the latest
minor version will ensure critical kernel bugs get fixed.
> **Warning**:
> Installing custom kernels and kernel packages is probably not
> supported by your Linux distribution's vendor. Please make sure to
> ask your vendor about Docker support first before attempting to
> install custom kernels on your distribution.
> **Warning**:
> Installing a newer kernel might not be enough for some distributions
> which provide packages which are too old or incompatible with
> newer kernels.
Note that Docker also has a client mode, which can run on virtually any
Linux kernel (it even builds on OS X!).
## Enable AppArmor and SELinux when possible
Please use AppArmor or SELinux if your Linux distribution supports
either of the two. This helps improve security and blocks certain
types of exploits. Your distribution's documentation should provide
detailed steps on how to enable the recommended security mechanism.
Some Linux distributions enable AppArmor or SELinux by default and
they run a kernel which doesn't meet the minimum requirements (3.10
or newer). Updating the kernel to 3.10 or newer on such a system
might not be enough to start Docker and run containers.
Incompatibilities between the version of AppArmor/SELinux user
space utilities provided by the system and the kernel could prevent
Docker from running, from starting containers or, cause containers to
exhibit unexpected behaviour.
> **Warning**:
> If either of the security mechanisms is enabled, it should not be
> disabled to make Docker or its containers run. This will reduce
> security in that environment, lose support from the distribution's
> vendor for the system, and might break regulations and security
> policies in heavily regulated environments.
## Get the docker binary:
$ wget https://get.docker.com/builds/Linux/x86_64/docker-latest -O docker
$ chmod +x docker
> **Note**:
> If you have trouble downloading the binary, you can also get the smaller
> compressed release file:
> [https://get.docker.com/builds/Linux/x86_64/docker-latest.tgz](
> https://get.docker.com/builds/Linux/x86_64/docker-latest.tgz)
## Run the docker daemon
# start the docker in daemon mode from the directory you unpacked
$ sudo ./docker -d &
## Giving non-root access
The `docker` daemon always runs as the root user, and the `docker`
daemon binds to a Unix socket instead of a TCP port. By default that
Unix socket is owned by the user *root*, and so, by default, you can
access it with `sudo`.
If you (or your Docker installer) create a Unix group called *docker*
and add users to it, then the `docker` daemon will make the ownership of
the Unix socket read/writable by the *docker* group when the daemon
starts. The `docker` daemon must always run as the root user, but if you
run the `docker` client as a user in the *docker* group then you don't
need to add `sudo` to all the client commands.
> **Warning**:
> The *docker* group (or the group specified with `-G`) is root-equivalent;
> see [*Docker Daemon Attack Surface*](
> /articles/security/#docker-daemon-attack-surface) details.
## Upgrades
To upgrade your manual installation of Docker, first kill the docker
daemon:
$ killall docker
Then follow the regular installation steps.
## Run your first container!
# check your docker version
$ sudo ./docker version
# run a container and open an interactive shell in the container
$ sudo ./docker run -i -t ubuntu /bin/bash
Continue with the [User Guide](/userguide/).
| {
"pile_set_name": "Github"
} |
---
- name: test revello_app module
hosts: localhost
gather_facts: no
tasks:
- debug:
var: rev_username
- debug:
var: rev_password
- name: create revello app without a blueprint
local_action:
module: ravello_app
username: "{{ rev_username }}"
password: "{{ rev_password }}"
name: 'ansible-revello_app'
description: 'a test revello app using ansible'
publish_optimization: cost
#cloud: AMAZON
#region: Oregon
state: present
blueprint_id: 0
| {
"pile_set_name": "Github"
} |
#include <iostream>
int main()
{
std::cout << "Hello World!" << std::endl;
} | {
"pile_set_name": "Github"
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.