<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">

	<link rel="stylesheet" type="text/css" href="style.css">
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<meta name="viewport" content="width=device-width, initial-scale=1">

Licenses

	Binaries of this product are made available to you by Mozilla under the Mozilla Public License 2.0 (MPL).

	More specifically, most of the source code for this product is available under the Mozilla Public License 2.0 (MPL)
	and Apache License 2.0. Additional software components for this product are available  under one of a variety of
	other free and open source licenses. Those that require reproduction of the license text in the distribution are
	given below. (Note: your copy of this product may not contain code covered by one or more of the licenses listed
	here, depending on the exact product and version you choose.)

Mozilla Public License 2.0

Apache License 2.0

GNU Lesser General Public License 2.1

adjust-android License

Mozilla Public License 2.0

Focus - https://github.com/mozilla-mobile/focus-android

Telemetry - https://github.com/mozilla-mobile/telemetry-android

1. Definitions

1.1. “Contributor”

means each individual or legal entity that creates, contributes to the creation of, or owns Covered Software.

1.2. “Contributor Version”

means the combination of the Contributions of others (if any) used by a Contributor and that particular Contributor’s Contribution.

1.3. “Contribution”

means Covered Software of a particular Contributor.

1.4. “Covered Software”

means Source Code Form to which the initial Contributor has attached the notice in Exhibit A, the Executable Form of such Source Code Form, and Modifications of such Source Code Form, in each case including portions thereof.

1.5. “Incompatible With Secondary Licenses”

means

that the initial Contributor has attached the notice described in Exhibit B to the Covered Software; or

that the Covered Software was made available under the terms of version 1.1 or earlier of the License, but not also under the terms of a Secondary License.

1.6. “Executable Form”

means any form of the work other than Source Code Form.

1.7. “Larger Work”

means a work that combines Covered Software with other material, in a separate file or files, that is not Covered Software.

1.8. “License”

means this document.

1.9. “Licensable”

means having the right to grant, to the maximum extent possible, whether at the time of the initial grant or subsequently, any and all of the rights conveyed by this License.

1.10. “Modifications”

means any of the following:

any file in Source Code Form that results from an addition to, deletion from, or modification of the contents of Covered Software; or

any new file in Source Code Form that contains any Covered Software.

1.11. “Patent Claims” of a Contributor

means any patent claim(s), including without limitation, method, process, and apparatus claims, in any patent Licensable by such Contributor that would be infringed, but for the grant of the License, by the making, using, selling, offering for sale, having made, import, or transfer of either its Contributions or its Contributor Version.

1.12. “Secondary License”

means either the GNU General Public License, Version 2.0, the GNU Lesser General Public License, Version 2.1, the GNU Affero General Public License, Version 3.0, or any later versions of those licenses.

1.13. “Source Code Form”

means the form of the work preferred for making modifications.

1.14. “You” (or “Your”)

means an individual or a legal entity exercising rights under this License. For legal entities, “You” includes any entity that controls, is controlled by, or is under common control with You. For purposes of this definition, “control” means (a) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (b) ownership of more than fifty percent (50%) of the outstanding shares or beneficial ownership of such entity.

2. License Grants and Conditions

2.1. Grants

Each Contributor hereby grants You a world-wide, royalty-free, non-exclusive license:

under intellectual property rights (other than patent or trademark) Licensable by such Contributor to use, reproduce, make available, modify, display, perform, distribute, and otherwise exploit its Contributions, either on an unmodified basis, with Modifications, or as part of a Larger Work; and

under Patent Claims of such Contributor to make, use, sell, offer for sale, have made, import, and otherwise transfer either its Contributions or its Contributor Version.

2.2. Effective Date

The licenses granted in Section 2.1 with respect to any Contribution become effective for each Contribution on the date the Contributor first distributes such Contribution.

2.3. Limitations on Grant Scope

The licenses granted in this Section 2 are the only rights granted under this License. No additional rights or licenses will be implied from the distribution or licensing of Covered Software under this License. Notwithstanding Section 2.1(b) above, no patent license is granted by a Contributor:

for any code that a Contributor has removed from Covered Software; or

for infringements caused by: (i) Your and any other third party’s modifications of Covered Software, or (ii) the combination of its Contributions with other software (except as part of its Contributor Version); or

under Patent Claims infringed by Covered Software in the absence of its Contributions.

This License does not grant any rights in the trademarks, service marks, or logos of any Contributor (except as may be necessary to comply with the notice requirements in Section 3.4).

2.4. Subsequent Licenses

No Contributor makes additional grants as a result of Your choice to distribute the Covered Software under a subsequent version of this License (see Section 10.2) or under the terms of a Secondary License (if permitted under the terms of Section 3.3).

2.5. Representation

Each Contributor represents that the Contributor believes its Contributions are its original creation(s) or it has sufficient rights to grant the rights to its Contributions conveyed by this License.

2.6. Fair Use

This License is not intended to limit any rights You have under applicable copyright doctrines of fair use, fair dealing, or other equivalents.

2.7. Conditions

Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in Section 2.1.

3. Responsibilities

3.1. Distribution of Source Form

All distribution of Covered Software in Source Code Form, including any Modifications that You create or to which You contribute, must be under the terms of this License. You must inform recipients that the Source Code Form of the Covered Software is governed by the terms of this License, and how they can obtain a copy of this License. You may not attempt to alter or restrict the recipients’ rights in the Source Code Form.

3.2. Distribution of Executable Form

If You distribute Covered Software in Executable Form then:

such Covered Software must also be made available in Source Code Form, as described in Section 3.1, and You must inform recipients of the Executable Form how they can obtain a copy of such Source Code Form by reasonable means in a timely manner, at a charge no more than the cost of distribution to the recipient; and

You may distribute such Executable Form under the terms of this License, or sublicense it under different terms, provided that the license for the Executable Form does not attempt to limit or alter the recipients’ rights in the Source Code Form under this License.

3.3. Distribution of a Larger Work

You may create and distribute a Larger Work under terms of Your choice, provided that You also comply with the requirements of this License for the Covered Software. If the Larger Work is a combination of Covered Software with a work governed by one or more Secondary Licenses, and the Covered Software is not Incompatible With Secondary Licenses, this License permits You to additionally distribute such Covered Software under the terms of such Secondary License(s), so that the recipient of the Larger Work may, at their option, further distribute the Covered Software under the terms of either this License or such Secondary License(s).

3.4. Notices

You may not remove or alter the substance of any license notices (including copyright notices, patent notices, disclaimers of warranty, or limitations of liability) contained within the Source Code Form of the Covered Software, except that You may alter any license notices to the extent required to remedy known factual inaccuracies.

3.5. Application of Additional Terms

You may choose to offer, and to charge a fee for, warranty, support, indemnity or liability obligations to one or more recipients of Covered Software. However, You may do so only on Your own behalf, and not on behalf of any Contributor. You must make it absolutely clear that any such warranty, support, indemnity, or liability obligation is offered by You alone, and You hereby agree to indemnify every Contributor for any liability incurred by such Contributor as a result of warranty, support, indemnity or liability terms You offer. You may include additional disclaimers of warranty and limitations of liability specific to any jurisdiction.

4. Inability to Comply Due to Statute or Regulation

If it is impossible for You to comply with any of the terms of this License with respect to some or all of the Covered Software due to statute, judicial order, or regulation then You must: (a) comply with the terms of this License to the maximum extent possible; and (b) describe the limitations and the code they affect. Such description must be placed in a text file included with all distributions of the Covered Software under this License. Except to the extent prohibited by statute or regulation, such description must be sufficiently detailed for a recipient of ordinary skill to be able to understand it.

5. Termination

5.1. The rights granted under this License will terminate automatically if You fail to comply with any of its terms. However, if You become compliant, then the rights granted under this License from a particular Contributor are reinstated (a) provisionally, unless and until such Contributor explicitly and finally terminates Your grants, and (b) on an ongoing basis, if such Contributor fails to notify You of the non-compliance by some reasonable means prior to 60 days after You have come back into compliance. Moreover, Your grants from a particular Contributor are reinstated on an ongoing basis if such Contributor notifies You of the non-compliance by some reasonable means, this is the first time You have received notice of non-compliance with this License from such Contributor, and You become compliant prior to 30 days after Your receipt of the notice.

5.2. If You initiate litigation against any entity by asserting a patent infringement claim (excluding declaratory judgment actions, counter-claims, and cross-claims) alleging that a Contributor Version directly or indirectly infringes any patent, then the rights granted to You by any and all Contributors for the Covered Software under Section 2.1 of this License shall terminate.

5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user license agreements (excluding distributors and resellers) which have been validly granted by You or Your distributors under this License prior to termination shall survive termination.

6. Disclaimer of Warranty

Covered Software is provided under this License on an “as is” basis, without warranty of any kind, either expressed, implied, or statutory, including, without limitation, warranties that the Covered Software is free of defects, merchantable, fit for a particular purpose or non-infringing. The entire risk as to the quality and performance of the Covered Software is with You. Should any Covered Software prove defective in any respect, You (not any Contributor) assume the cost of any necessary servicing, repair, or correction. This disclaimer of warranty constitutes an essential part of this License. No use of any Covered Software is authorized under this License except under this disclaimer.

7. Limitation of Liability

Under no circumstances and under no legal theory, whether tort (including negligence), contract, or otherwise, shall any Contributor, or anyone who distributes Covered Software as permitted above, be liable to You for any direct, indirect, special, incidental, or consequential damages of any character including, without limitation, damages for lost profits, loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses, even if such party shall have been informed of the possibility of such damages. This limitation of liability shall not apply to liability for death or personal injury resulting from such party’s negligence to the extent applicable law prohibits such limitation. Some jurisdictions do not allow the exclusion or limitation of incidental or consequential damages, so this exclusion and limitation may not apply to You.

8. Litigation

Any litigation relating to this License may be brought only in the courts of a jurisdiction where the defendant maintains its principal place of business and such litigation shall be governed by laws of that jurisdiction, without reference to its conflict-of-law provisions. Nothing in this Section shall prevent a party’s ability to bring cross-claims or counter-claims.

9. Miscellaneous

This License represents the complete agreement concerning the subject matter hereof. If any provision of this License is held to be unenforceable, such provision shall be reformed only to the extent necessary to make it enforceable. Any law or regulation which provides that the language of a contract shall be construed against the drafter shall not be used to construe this License against a Contributor.

10. Versions of the License

10.1. New Versions

Mozilla Foundation is the license steward. Except as provided in Section 10.3, no one other than the license steward has the right to modify or publish new versions of this License. Each version will be given a distinguishing version number.

10.2. Effect of New Versions

You may distribute the Covered Software under the terms of the version of the License under which You originally received the Covered Software, or under the terms of any subsequent version published by the license steward.

10.3. Modified Versions

If you create software not governed by this License, and you want to create a new license for such software, you may create and use a modified version of this License if you rename the license and remove any references to the name of the license steward (except to note that such modified license differs from this License).

10.4. Distributing Source Code Form that is Incompatible With Secondary Licenses

If You choose to distribute Source Code Form that is Incompatible With Secondary Licenses under the terms of this version of the License, the notice described in Exhibit B of this License must be attached.

Exhibit A - Source Code Form License Notice

This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not distributed with this file, You can obtain one at http://mozilla.org/MPL/2.0/.

If it is not possible or desirable to put the notice in a particular file, then You may include the notice in a location (such as a LICENSE file in a relevant directory) where a recipient would be likely to look for such a notice.

You may add additional accurate notices of copyright ownership.

Exhibit B - “Incompatible With Secondary Licenses” Notice

This Source Code Form is “Incompatible With Secondary Licenses”, as defined by the Mozilla Public License, v. 2.0.

Apache License 2.0

com.android.support : animated-vector-drawable

org.jetbrains : annotations

com.android.support : appcompat-v7

com.android.support : cardview-v7

android.arch.lifecycle : common

android.arch.core : common

com.android.support : customtabs

com.android.support : design

android.arch.lifecycle : extensions

org.jetbrains.kotlin : kotlin-stdlib-jre7

org.jetbrains.kotlin : kotlin-stdlib

com.android.support : recyclerview-v7

android.arch.core : runtime

android.arch.lifecycle : runtime

com.android.support : support-annotations

com.android.support : support-compat

com.android.support : support-core-ui

com.android.support : support-core-utils

com.android.support : support-fragment

com.android.support : support-media-compat

com.android.support : support-v4

com.android.support :support-vector-drawable

com.android.support :transition

1. Definitions.

"License" shall mean the terms and conditions for use, reproduction, and
	distribution as defined by Sections 1 through 9 of this document.

"Licensor" shall mean the copyright owner or entity authorized by the
	copyright owner that is granting the License.

"Legal Entity" shall mean the union of the acting entity and all other
	entities that control, are controlled by, or are under common control with
	that entity. For the purposes of this definition, "control" means (i) the
	power, direct or indirect, to cause the direction or management of such
	entity, whether by contract or otherwise, or (ii) ownership of fifty
	percent (50%) or more of the outstanding shares, or (iii) beneficial
	ownership of such entity.

"You" (or "Your") shall mean an individual or Legal Entity exercising
	permissions granted by this License.

"Source" form shall mean the preferred form for making modifications,
	including but not limited to software source code, documentation source,
	and configuration files.

"Object" form shall mean any form resulting from mechanical transformation
	or translation of a Source form, including but not limited to compiled
	object code, generated documentation, and conversions to other media types.

"Work" shall mean the work of authorship, whether in Source or Object form,
	made available under the License, as indicated by a copyright notice that
	is included in or attached to the work (an example is provided in the
	Appendix below).

"Derivative Works" shall mean any work, whether in Source or Object form,
	that is based on (or derived from) the Work and for which the editorial
	revisions, annotations, elaborations, or other modifications represent, as
	a whole, an original work of authorship. For the purposes of this License,
	Derivative Works shall not include works that remain separable from, or
	merely link (or bind by name) to the interfaces of, the Work and Derivative
	Works thereof.

"Contribution" shall mean any work of authorship, including the original
	version of the Work and any modifications or additions to that Work or
	Derivative Works thereof, that is intentionally submitted to Licensor for
	inclusion in the Work by the copyright owner or by an individual or Legal
	Entity authorized to submit on behalf of the copyright owner. For the
	purposes of this definition, "submitted" means any form of electronic,
	verbal, or written communication sent to the Licensor or its
	representatives, including but not limited to communication on electronic
	mailing lists, source code control systems, and issue tracking systems that
	are managed by, or on behalf of, the Licensor for the purpose of discussing
	and improving the Work, but excluding communication that is conspicuously
	marked or otherwise designated in writing by the copyright owner as "Not a
	Contribution."

"Contributor" shall mean Licensor and any individual or Legal Entity on
	behalf of whom a Contribution has been received by Licensor and
	subsequently incorporated within the Work.

2. Grant of Copyright License. Subject to the
	terms and conditions of this License, each Contributor hereby grants to You
	a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable
	copyright license to reproduce, prepare Derivative Works of, publicly
	display, publicly perform, sublicense, and distribute the Work and such
	Derivative Works in Source or Object form.

3. Grant of Patent License. Subject to the terms
	and conditions of this License, each Contributor hereby grants to You a
	perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable
	(except as stated in this section) patent license to make, have made, use,
	offer to sell, sell, import, and otherwise transfer the Work, where such
	license applies only to those patent claims licensable by such Contributor
	that are necessarily infringed by their Contribution(s) alone or by
	combination of their Contribution(s) with the Work to which such
	Contribution(s) was submitted. If You institute patent litigation against
	any entity (including a cross-claim or counterclaim in a lawsuit) alleging
	that the Work or a Contribution incorporated within the Work constitutes
	direct or contributory patent infringement, then any patent licenses
	granted to You under this License for that Work shall terminate as of the
	date such litigation is filed.

4. Redistribution. You may reproduce and
	distribute copies of the Work or Derivative Works thereof in any medium,
	with or without modifications, and in Source or Object form, provided that
	You meet the following conditions:

You must give any other recipients of the Work or Derivative Works a
	copy of this License; and

You must cause any modified files to carry prominent notices stating
	that You changed the files; and

You must retain, in the Source form of any Derivative Works that You
	distribute, all copyright, patent, trademark, and attribution notices from
	the Source form of the Work, excluding those notices that do not pertain to
	any part of the Derivative Works; and

If the Work includes a "NOTICE" text file as part of its distribution,
	then any Derivative Works that You distribute must include a readable copy
	of the attribution notices contained within such NOTICE file, excluding
	those notices that do not pertain to any part of the Derivative Works, in
	at least one of the following places: within a NOTICE text file distributed
	as part of the Derivative Works; within the Source form or documentation,
	if provided along with the Derivative Works; or, within a display generated
	by the Derivative Works, if and wherever such third-party notices normally
	appear. The contents of the NOTICE file are for informational purposes only
	and do not modify the License. You may add Your own attribution notices
	within Derivative Works that You distribute, alongside or as an addendum to
	the NOTICE text from the Work, provided that such additional attribution
	notices cannot be construed as modifying the License.

	You may add Your own copyright statement to Your modifications and may
	provide additional or different license terms and conditions for use,
	reproduction, or distribution of Your modifications, or for any such
	Derivative Works as a whole, provided Your use, reproduction, and
	distribution of the Work otherwise complies with the conditions stated in
	this License.

5. Submission of Contributions. Unless You
	explicitly state otherwise, any Contribution intentionally submitted for
	inclusion in the Work by You to the Licensor shall be under the terms and
	conditions of this License, without any additional terms or conditions.
	Notwithstanding the above, nothing herein shall supersede or modify the
	terms of any separate license agreement you may have executed with Licensor
	regarding such Contributions.

6. Trademarks. This License does not grant
	permission to use the trade names, trademarks, service marks, or product
	names of the Licensor, except as required for reasonable and customary use
	in describing the origin of the Work and reproducing the content of the
	NOTICE file.

7. Disclaimer of Warranty. Unless required by
	applicable law or agreed to in writing, Licensor provides the Work (and
	each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT
	WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including,
	without limitation, any warranties or conditions of TITLE,
	NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You
	are solely responsible for determining the appropriateness of using or
	redistributing the Work and assume any risks associated with Your exercise
	of permissions under this License.

8. Limitation of Liability. In no event and
	under no legal theory, whether in tort (including negligence), contract, or
	otherwise, unless required by applicable law (such as deliberate and
	grossly negligent acts) or agreed to in writing, shall any Contributor be
	liable to You for damages, including any direct, indirect, special,
	incidental, or consequential damages of any character arising as a result
	of this License or out of the use or inability to use the Work (including
	but not limited to damages for loss of goodwill, work stoppage, computer
	failure or malfunction, or any and all other commercial damages or losses),
	even if such Contributor has been advised of the possibility of such
	damages.

9. Accepting Warranty or Additional Liability.
	While redistributing the Work or Derivative Works thereof, You may choose
	to offer, and charge a fee for, acceptance of support, warranty, indemnity,
	or other liability obligations and/or rights consistent with this License.
	However, in accepting such obligations, You may act only on Your own behalf
	and on Your sole responsibility, not on behalf of any other Contributor,
	and only if You agree to indemnify, defend, and hold each Contributor
	harmless for any liability incurred by, or claims asserted against, such
	Contributor by reason of your accepting any such warranty or additional
	liability.

END OF TERMS AND CONDITIONS

GNU Lesser General Public License 2.1

findbugs annotations (com.google.code.findbugs:annotations)

GNU LESSER GENERAL PUBLIC LICENSE

Version 2.1, February 1999

Copyright (C) 1991, 1999 Free Software Foundation, Inc.

51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA

Everyone is permitted to copy and distribute verbatim copies

of this license document, but changing it is not allowed.

[This is the first released version of the Lesser GPL.  It also counts

 as the successor of the GNU Library Public License, version 2, hence

 the version number 2.1.]

Preamble

  The licenses for most software are designed to take away your
freedom to share and change it.  By contrast, the GNU General Public
Licenses are intended to guarantee your freedom to share and change
free software--to make sure the software is free for all its users.

  This license, the Lesser General Public License, applies to some
specially designated software packages--typically libraries--of the
Free Software Foundation and other authors who decide to use it.  You
can use it too, but we suggest you first think carefully about whether
this license or the ordinary General Public License is the better
strategy to use in any particular case, based on the explanations below.

  When we speak of free software, we are referring to freedom of use,
not price.  Our General Public Licenses are designed to make sure that
you have the freedom to distribute copies of free software (and charge
for this service if you wish); that you receive source code or can get
it if you want it; that you can change the software and use pieces of
it in new free programs; and that you are informed that you can do
these things.

  To protect your rights, we need to make restrictions that forbid
distributors to deny you these rights or to ask you to surrender these
rights.  These restrictions translate to certain responsibilities for
you if you distribute copies of the library or if you modify it.

  For example, if you distribute copies of the library, whether gratis
or for a fee, you must give the recipients all the rights that we gave
you.  You must make sure that they, too, receive or can get the source
code.  If you link other code with the library, you must provide
complete object files to the recipients, so that they can relink them
with the library after making changes to the library and recompiling
it.  And you must show them these terms so they know their rights.

  We protect your rights with a two-step method: (1) we copyright the
library, and (2) we offer you this license, which gives you legal
permission to copy, distribute and/or modify the library.

  To protect each distributor, we want to make it very clear that
there is no warranty for the free library.  Also, if the library is
modified by someone else and passed on, the recipients should know
that what they have is not the original version, so that the original
author's reputation will not be affected by problems that might be
introduced by others.

  Finally, software patents pose a constant threat to the existence of
any free program.  We wish to make sure that a company cannot
effectively restrict the users of a free program by obtaining a
restrictive license from a patent holder.  Therefore, we insist that
any patent license obtained for a version of the library must be
consistent with the full freedom of use specified in this license.

  Most GNU software, including some libraries, is covered by the
ordinary GNU General Public License.  This license, the GNU Lesser
General Public License, applies to certain designated libraries, and
is quite different from the ordinary General Public License.  We use
this license for certain libraries in order to permit linking those
libraries into non-free programs.

  When a program is linked with a library, whether statically or using
a shared library, the combination of the two is legally speaking a
combined work, a derivative of the original library.  The ordinary
General Public License therefore permits such linking only if the
entire combination fits its criteria of freedom.  The Lesser General
Public License permits more lax criteria for linking other code with
the library.

  We call this license the "Lesser" General Public License because it
does Less to protect the user's freedom than the ordinary General
Public License.  It also provides other free software developers Less
of an advantage over competing non-free programs.  These disadvantages
are the reason we use the ordinary General Public License for many
libraries.  However, the Lesser license provides advantages in certain
special circumstances.

  For example, on rare occasions, there may be a special need to
encourage the widest possible use of a certain library, so that it becomes
a de-facto standard.  To achieve this, non-free programs must be
allowed to use the library.  A more frequent case is that a free
library does the same job as widely used non-free libraries.  In this
case, there is little to gain by limiting the free library to free
software only, so we use the Lesser General Public License.

  In other cases, permission to use a particular library in non-free
programs enables a greater number of people to use a large body of
free software.  For example, permission to use the GNU C Library in
non-free programs enables many more people to use the whole GNU
operating system, as well as its variant, the GNU/Linux operating
system.

  Although the Lesser General Public License is Less protective of the
users' freedom, it does ensure that the user of a program that is
linked with the Library has the freedom and the wherewithal to run
that program using a modified version of the Library.

  The precise terms and conditions for copying, distribution and
modification follow.  Pay close attention to the difference between a
"work based on the library" and a "work that uses the library".  The
former contains code derived from the library, whereas the latter must
be combined with the library in order to run.

TERMS AND CONDITIONS FOR COPYING,
DISTRIBUTION AND MODIFICATION

0.
This License Agreement applies to any software library or other
program which contains a notice placed by the copyright holder or
other authorized party saying it may be distributed under the terms of
this Lesser General Public License (also called "this License").
Each licensee is addressed as "you".

  A "library" means a collection of software functions and/or data
prepared so as to be conveniently linked with application programs
(which use some of those functions and data) to form executables.

  The "Library", below, refers to any such software library or work
which has been distributed under these terms.  A "work based on the
Library" means either the Library or any derivative work under
copyright law: that is to say, a work containing the Library or a
portion of it, either verbatim or with modifications and/or translated
straightforwardly into another language.  (Hereinafter, translation is
included without limitation in the term "modification".)

  "Source code" for a work means the preferred form of the work for
making modifications to it.  For a library, complete source code means
all the source code for all modules it contains, plus any associated
interface definition files, plus the scripts used to control compilation
and installation of the library.

  Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope.  The act of
running a program using the Library is not restricted, and output from
such a program is covered only if its contents constitute a work based
on the Library (independent of the use of the Library in a tool for
writing it).  Whether that is true depends on what the Library does
and what the program that uses the Library does.

1.
You may copy and distribute verbatim copies of the Library's
complete source code as you receive it, in any medium, provided that
you conspicuously and appropriately publish on each copy an
appropriate copyright notice and disclaimer of warranty; keep intact
all the notices that refer to this License and to the absence of any
warranty; and distribute a copy of this License along with the
Library.

  You may charge a fee for the physical act of transferring a copy,
and you may at your option offer warranty protection in exchange for a
fee.

2.
You may modify your copy or copies of the Library or any portion
of it, thus forming a work based on the Library, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:

a)
       The modified work must itself be a software library.

b)
       You must cause the files modified to carry prominent notices
       stating that you changed the files and the date of any change.

c)
       You must cause the whole of the work to be licensed at no
       charge to all third parties under the terms of this License.

d)
       If a facility in the modified Library refers to a function or a
       table of data to be supplied by an application program that uses
       the facility, other than as an argument passed when the facility
       is invoked, then you must make a good faith effort to ensure that,
       in the event an application does not supply such function or
       table, the facility still operates, and performs whatever part of
       its purpose remains meaningful.

       (For example, a function in a library to compute square roots has
       a purpose that is entirely well-defined independent of the
       application.  Therefore, Subsection 2d requires that any
       application-supplied function or table used by this function must
       be optional: if the application does not supply it, the square
       root function must still compute square roots.)

These requirements apply to the modified work as a whole.  If identifiable
sections of that work are not derived from the Library, and can be
reasonably considered independent and separate works in themselves, then
this License, and its terms, do not apply to those sections when you
distribute them as separate works.  But when you distribute the same
sections as part of a whole which is a work based on the Library, the
distribution of the whole must be on the terms of this License, whose
permissions for other licensees extend to the entire whole, and thus to
each and every part regardless of who wrote it.

Thus, it is not the intent of this section to claim rights or contest your
rights to work written entirely by you; rather, the intent is to exercise
the right to control the distribution of derivative or collective works
based on the Library.

In addition, mere aggregation of another work not based on the Library with
the Library (or with a work based on the Library) on a volume of a storage
or distribution medium does not bring the other work under the scope of
this License.

3.
You may opt to apply the terms of the ordinary GNU General Public
License instead of this License to a given copy of the Library.  To do
this, you must alter all the notices that refer to this License, so
that they refer to the ordinary GNU General Public License, version 2,
instead of to this License.  (If a newer version than version 2 of the
ordinary GNU General Public License has appeared, then you can specify
that version instead if you wish.)  Do not make any other change in
these notices.

  Once this change is made in a given copy, it is irreversible for
that copy, so the ordinary GNU General Public License applies to all
subsequent copies and derivative works made from that copy.

  This option is useful when you wish to copy part of the code of
the Library into a program that is not a library.

4.
You may copy and distribute the Library (or a portion or
derivative of it, under Section 2) in object code or executable form
under the terms of Sections 1 and 2 above provided that you accompany
it with the complete corresponding machine-readable source code, which
must be distributed under the terms of Sections 1 and 2 above on a
medium customarily used for software interchange.

  If distribution of object code is made by offering access to copy
from a designated place, then offering equivalent access to copy the
source code from the same place satisfies the requirement to
distribute the source code, even though third parties are not
compelled to copy the source along with the object code.

5.
A program that contains no derivative of any portion of the
Library, but is designed to work with the Library by being compiled or
linked with it, is called a "work that uses the Library".  Such a
work, in isolation, is not a derivative work of the Library, and
therefore falls outside the scope of this License.

  However, linking a "work that uses the Library" with the Library
creates an executable that is a derivative of the Library (because it
contains portions of the Library), rather than a "work that uses the
library".  The executable is therefore covered by this License.
Section 6 states terms for distribution of such executables.

  When a "work that uses the Library" uses material from a header file
that is part of the Library, the object code for the work may be a
derivative work of the Library even though the source code is not.
Whether this is true is especially significant if the work can be
linked without the Library, or if the work is itself a library.  The
threshold for this to be true is not precisely defined by law.

  If such an object file uses only numerical parameters, data
structure layouts and accessors, and small macros and small inline
functions (ten lines or less in length), then the use of the object
file is unrestricted, regardless of whether it is legally a derivative
work.  (Executables containing this object code plus portions of the
Library will still fall under Section 6.)

  Otherwise, if the work is a derivative of the Library, you may
distribute the object code for the work under the terms of Section 6.
Any executables containing that work also fall under Section 6,
whether or not they are linked directly with the Library itself.

6.
As an exception to the Sections above, you may also combine or
link a "work that uses the Library" with the Library to produce a
work containing portions of the Library, and distribute that work
under terms of your choice, provided that the terms permit
modification of the work for the customer's own use and reverse
engineering for debugging such modifications.

  You must give prominent notice with each copy of the work that the
Library is used in it and that the Library and its use are covered by
this License.  You must supply a copy of this License.  If the work
during execution displays copyright notices, you must include the
copyright notice for the Library among them, as well as a reference
directing the user to the copy of this License.  Also, you must do one
of these things:

a) Accompany the work with the complete
    corresponding machine-readable source code for the Library
    including whatever changes were used in the work (which must be
    distributed under Sections 1 and 2 above); and, if the work is an
    executable linked with the Library, with the complete
    machine-readable "work that uses the Library", as object code
    and/or source code, so that the user can modify the Library and
    then relink to produce a modified executable containing the
    modified Library.  (It is understood that the user who changes the
    contents of definitions files in the Library will not necessarily
    be able to recompile the application to use the modified
    definitions.)

b) Use a suitable shared library mechanism
    for linking with the Library.  A suitable mechanism is one that
    (1) uses at run time a copy of the library already present on the
    user's computer system, rather than copying library functions into
    the executable, and (2) will operate properly with a modified
    version of the library, if the user installs one, as long as the
    modified version is interface-compatible with the version that the
    work was made with.

c) Accompany the work with a written offer,
    valid for at least three years, to give the same user the
    materials specified in Subsection 6a, above, for a charge no more
    than the cost of performing this distribution.

d) If distribution of the work is made by
    offering access to copy from a designated place, offer equivalent
    access to copy the above specified materials from the same
    place.

e) Verify that the user has already received
    a copy of these materials or that you have already sent this user
    a copy.

  For an executable, the required form of the "work that uses the
Library" must include any data and utility programs needed for
reproducing the executable from it.  However, as a special exception,
the materials to be distributed need not include anything that is
normally distributed (in either source or binary form) with the major
components (compiler, kernel, and so on) of the operating system on
which the executable runs, unless that component itself accompanies
the executable.

  It may happen that this requirement contradicts the license
restrictions of other proprietary libraries that do not normally
accompany the operating system.  Such a contradiction means you cannot
use both them and the Library together in an executable that you
distribute.

7. You may place library facilities that are a work
based on the Library side-by-side in a single library together with
other library facilities not covered by this License, and distribute
such a combined library, provided that the separate distribution of
the work based on the Library and of the other library facilities is
otherwise permitted, and provided that you do these two things:

a) Accompany the combined library with a copy
    of the same work based on the Library, uncombined with any other
    library facilities.  This must be distributed under the terms of
    the Sections above.

b) Give prominent notice with the combined
    library of the fact that part of it is a work based on the
    Library, and explaining where to find the accompanying uncombined
    form of the same work.

8. You may not copy, modify, sublicense, link with,
or distribute the Library except as expressly provided under this
License.  Any attempt otherwise to copy, modify, sublicense, link
with, or distribute the Library is void, and will automatically
terminate your rights under this License.  However, parties who have
received copies, or rights, from you under this License will not have
their licenses terminated so long as such parties remain in full
compliance.

9.
You are not required to accept this License, since you have not
signed it.  However, nothing else grants you permission to modify or
distribute the Library or its derivative works.  These actions are
prohibited by law if you do not accept this License.  Therefore, by
modifying or distributing the Library (or any work based on the
Library), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Library or works based on it.

10.
Each time you redistribute the Library (or any work based on the
Library), the recipient automatically receives a license from the
original licensor to copy, distribute, link with or modify the Library
subject to these terms and conditions.  You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties with
this License.

11.
If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License.  If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Library at all.  For example, if a patent
license would not permit royalty-free redistribution of the Library by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Library.

If any portion of this section is held invalid or unenforceable under any
particular circumstance, the balance of the section is intended to apply,
and the section as a whole is intended to apply in other circumstances.

It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system which is
implemented by public license practices.  Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.

This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.

12.
If the distribution and/or use of the Library is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Library under this License may add
an explicit geographical distribution limitation excluding those countries,
so that distribution is permitted only in or among countries not thus
excluded.  In such case, this License incorporates the limitation as if
written in the body of this License.

13.
The Free Software Foundation may publish revised and/or new
versions of the Lesser General Public License from time to time.
Such new versions will be similar in spirit to the present version,
but may differ in detail to address new problems or concerns.

Each version is given a distinguishing version number.  If the Library
specifies a version number of this License which applies to it and
"any later version", you have the option of following the terms and
conditions either of that version or of any later version published by
the Free Software Foundation.  If the Library does not specify a
license version number, you may choose any version ever published by
the Free Software Foundation.

14.
If you wish to incorporate parts of the Library into other free
programs whose distribution conditions are incompatible with these,
write to the author to ask for permission.  For software which is
copyrighted by the Free Software Foundation, write to the Free
Software Foundation; we sometimes make exceptions for this.  Our
decision will be guided by the two goals of preserving the free status
of all derivatives of our free software and of promoting the sharing
and reuse of software generally.

NO WARRANTY

15.
BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.

16.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
DAMAGES.

END OF TERMS AND CONDITIONS

adjust-android License

Copyright (c) 2012-2017 adjust GmbH,

	http://www.adjust.com

Permission is hereby granted, free of charge, to any person obtaining
	a copy of this software and associated documentation files (the
	"Software"), to deal in the Software without restriction, including
	without limitation the rights to use, copy, modify, merge, publish,
	distribute, sublicense, and/or sell copies of the Software, and to
	permit persons to whom the Software is furnished to do so, subject to
	the following conditions:

The above copyright notice and this permission notice shall be
	included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
	EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
	MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
	NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
	LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
	OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
	WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.


/*
 * Copyright (c) 2010-2011, Fabian Greif
 * Copyright (c) 2012-2013, 2018, Niklas Hauser
 *
 * This file is part of the modm project.
 *
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
 */
// ----------------------------------------------------------------------------

#include "slave_test.hpp"

namespace
{
	class TestingObject : public modm::sab::Callable
	{
	public:
		TestingObject() :
			calledFunction(NONE), returnValue(0x12345678), receivedParameter(0)
		{
		}

		void
		reset()
		{
			receivedParameter = 0;
			calledFunction = NONE;
		}

		void
		emptyFunction(modm::sab::Response& /*response*/)
		{
			calledFunction = EMPTY;
		}

		void
		responseFunction(modm::sab::Response& response)
		{
			calledFunction = RESPONSE;

			uint16_t value = 0xabcd;
			response.send(value);
		}

		void
		errorFunction(modm::sab::Response& response)
		{
			calledFunction = ERROR;

			response.error();
		}

		void
		parameterFunction(modm::sab::Response& response, const uint16_t* parameter)
		{
			calledFunction = PARAMETER;

			receivedParameter = *parameter;
			response.send(returnValue);
		}

		enum FunctionCode
		{
			NONE,
			EMPTY,
			RESPONSE,
			ERROR,
			PARAMETER,
		};

		FunctionCode calledFunction;
		const uint32_t returnValue;
		uint16_t receivedParameter;
	};

	TestingObject testingObject;

	// FIXME: Use FLASH_STORAGE
	const modm::sab::Action actionList[] =
	{
		SAB_ACTION(0x01, testingObject, TestingObject::emptyFunction, 0),
		SAB_ACTION(0x02, testingObject, TestingObject::responseFunction, 0),
		SAB_ACTION(0x03, testingObject, TestingObject::errorFunction, 0),
		SAB_ACTION(0x04, testingObject, TestingObject::parameterFunction, 2),
	};
}

using FakeIODevice = modm_test::FakeIODevice;
// ----------------------------------------------------------------------------
void
SlaveTest::setUp()
{
	FakeIODevice::reset();
	testingObject.reset();

	slave = new TestingSlave(0x3f,
					modm::accessor::asFlash(actionList),
					sizeof(actionList) / sizeof(modm::sab::Action));
}

void
SlaveTest::tearDown()
{
	delete slave;
}

// ----------------------------------------------------------------------------
void
SlaveTest::testEmptyMethod()
{
	TestingInterface::sendMessage(0x3f, modm::sab::REQUEST, 0x01);
	FakeIODevice::moveSendToReceiveBuffer();

	slave->update();
	TEST_ASSERT_EQUALS(testingObject.calledFunction, TestingObject::EMPTY);

	// receive message send by slave
	FakeIODevice::moveSendToReceiveBuffer();
	TestingInterface::update();

	TEST_ASSERT_TRUE(TestingInterface::isMessageAvailable());
	TEST_ASSERT_TRUE(TestingInterface::isResponse());
	TEST_ASSERT_FALSE(TestingInterface::isAcknowledge());
	TEST_ASSERT_EQUALS(TestingInterface::getAddress(), 0x3f);
	TEST_ASSERT_EQUALS(TestingInterface::getCommand(), 0x01);
	TEST_ASSERT_EQUALS(TestingInterface::getPayloadLength(), 1);
}

void
SlaveTest::testResponseMethod()
{
	TestingInterface::sendMessage(0x3f, modm::sab::REQUEST, 0x02);
	FakeIODevice::moveSendToReceiveBuffer();

	slave->update();

	TEST_ASSERT_EQUALS(testingObject.calledFunction, TestingObject::RESPONSE);

	// receive message send by slave
	FakeIODevice::moveSendToReceiveBuffer();
	TestingInterface::update();

	TEST_ASSERT_TRUE(TestingInterface::isMessageAvailable());
	TEST_ASSERT_TRUE(TestingInterface::isResponse());
	TEST_ASSERT_TRUE(TestingInterface::isAcknowledge());
	TEST_ASSERT_EQUALS(TestingInterface::getAddress(), 0x3f);
	TEST_ASSERT_EQUALS(TestingInterface::getCommand(), 0x02);
	TEST_ASSERT_EQUALS(TestingInterface::getPayloadLength(), 2);

	const uint16_t value = 0xabcd;
	TEST_ASSERT_EQUALS_ARRAY(TestingInterface::getPayload(),
			reinterpret_cast<const uint8_t *>(&value), 2);
}

void
SlaveTest::testErrorResponse()
{
	TestingInterface::sendMessage(0x3f, modm::sab::REQUEST, 0x03);
	FakeIODevice::moveSendToReceiveBuffer();

	slave->update();

	TEST_ASSERT_EQUALS(testingObject.calledFunction, TestingObject::ERROR);

	// receive message send by slave
	FakeIODevice::moveSendToReceiveBuffer();
	TestingInterface::update();

	TEST_ASSERT_TRUE(TestingInterface::isMessageAvailable());
	TEST_ASSERT_TRUE(TestingInterface::isResponse());
	TEST_ASSERT_FALSE(TestingInterface::isAcknowledge());
	TEST_ASSERT_EQUALS(TestingInterface::getAddress(), 0x3f);
	TEST_ASSERT_EQUALS(TestingInterface::getCommand(), 0x03);
	TEST_ASSERT_EQUALS(TestingInterface::getPayloadLength(), 1);
}

void
SlaveTest::testParameterMethod()
{
	uint16_t value = 0x9876;

	TestingInterface::sendMessage(0x3f, modm::sab::REQUEST, 0x04, value);
	FakeIODevice::moveSendToReceiveBuffer();

	slave->update();

	TEST_ASSERT_EQUALS(testingObject.calledFunction, TestingObject::PARAMETER);
	TEST_ASSERT_EQUALS(testingObject.receivedParameter, value);

	// receive message send by slave
	FakeIODevice::moveSendToReceiveBuffer();
	TestingInterface::update();

	TEST_ASSERT_TRUE(TestingInterface::isMessageAvailable());
	TEST_ASSERT_TRUE(TestingInterface::isResponse());
	TEST_ASSERT_TRUE(TestingInterface::isAcknowledge());
	TEST_ASSERT_EQUALS(TestingInterface::getAddress(), 0x3f);
	TEST_ASSERT_EQUALS(TestingInterface::getCommand(), 0x04);
	TEST_ASSERT_EQUALS(TestingInterface::getPayloadLength(), 4);

	TEST_ASSERT_EQUALS_ARRAY(TestingInterface::getPayload(),
			reinterpret_cast<const uint8_t *>(&testingObject.returnValue), 4);
}

void
SlaveTest::testWrongParameterSize()
{
	uint32_t value = 0xbaab;

	TestingInterface::sendMessage(0x3f, modm::sab::REQUEST, 0x04, value);
	FakeIODevice::moveSendToReceiveBuffer();

	slave->update();

	TEST_ASSERT_EQUALS(testingObject.calledFunction, TestingObject::NONE);

	// receive message send by slave
	FakeIODevice::moveSendToReceiveBuffer();
	TestingInterface::update();

	TEST_ASSERT_TRUE(TestingInterface::isMessageAvailable());
	TEST_ASSERT_TRUE(TestingInterface::isResponse());
	TEST_ASSERT_FALSE(TestingInterface::isAcknowledge());
	TEST_ASSERT_EQUALS(TestingInterface::getAddress(), 0x3f);
	TEST_ASSERT_EQUALS(TestingInterface::getCommand(), 0x04);
	TEST_ASSERT_EQUALS(TestingInterface::getPayloadLength(), 1);
}

void
SlaveTest::testNoMethod()
{
	TestingInterface::sendMessage(0x3f, modm::sab::REQUEST, 0x05);
	FakeIODevice::moveSendToReceiveBuffer();

	slave->update();

	TEST_ASSERT_EQUALS(testingObject.calledFunction, TestingObject::NONE);

	// receive message send by slave
	FakeIODevice::moveSendToReceiveBuffer();
	TestingInterface::update();

	TEST_ASSERT_TRUE(TestingInterface::isMessageAvailable());

	TEST_ASSERT_TRUE(TestingInterface::isResponse());
	TEST_ASSERT_FALSE(TestingInterface::isAcknowledge());
	TEST_ASSERT_EQUALS(TestingInterface::getAddress(), 0x3f);
	TEST_ASSERT_EQUALS(TestingInterface::getCommand(), 0x05);
	TEST_ASSERT_EQUALS(TestingInterface::getPayloadLength(), 1);
}


#!/usr/bin/env ruby

begin
  require 'rubygems'
  gem 'session'
  require 'session'
rescue LoadError
  puts "UNABLE TO RUN FUNCTIONAL TESTS"
  puts "No Session Found (gem install session)"
end

if defined?(Session)
  puts "RUNNING WITH SESSIONS"
  require 'test/session_functional'
end


<Project Sdk="Microsoft.NET.Sdk">

  <PropertyGroup>
    <TargetFramework>netcoreapp2.1</TargetFramework>
    <TargetFrameworkIdentifier>.NETCoreApp</TargetFrameworkIdentifier>
    <TargetFrameworkVersion>v2.1</TargetFrameworkVersion>
  </PropertyGroup>

  <PropertyGroup>
    <UniversalCRTSdkDir Condition="'$(UniversalCRTSdkDir)' == ''">$(registry:HKEY_LOCAL_MACHINE\SOFTWARE\Microsoft\Windows Kits\Installed Roots@KitsRoot10)</UniversalCRTSdkDir>
    <UniversalCRTSdkDir Condition="'$(UniversalCRTSdkDir)' == ''">$(MSBuildProgramFiles32)\Windows Kits\10\</UniversalCRTSdkDir>
    <TargetPlatformVersion>10.0.18362.0</TargetPlatformVersion>
    <WindowsMetadataPath>$(UniversalCRTSdkDir)UnionMetadata\$(TargetPlatformVersion)</WindowsMetadataPath>
    <GeneratePackageOnBuild>true</GeneratePackageOnBuild>
    <Version>0.0.4</Version>
  </PropertyGroup>

  <ItemGroup>
    <Reference Include="Windows.winmd">
      <HintPath>$(WindowsMetadataPath)\windows.winmd</HintPath>
      <IsWinMDFile>true</IsWinMDFile>
    </Reference>
  </ItemGroup>

  <ItemGroup>
    <PackageReference Include="MSTest.TestFramework" Version="2.1.2" />
    <PackageReference Include="Microsoft.Windows.Apps.Test" Version="1.0.181205002" />
    <PackageReference Include="Microsoft.Win32.Registry" Version="4.5.0" />
  </ItemGroup>

  <Import Project="..\MUXTestInfra.Shared.projitems" />
</Project>


import { Vido } from '../../../../gstc';
export default function ChartTimelineGrid(vido: Vido, props: any): () => any;
//# sourceMappingURL=grid.d.ts.map


/**
 * External dependencies
 */
import React from 'react';
import { localize } from 'i18n-calypso';
import { noop } from 'lodash';

/**
 * Internal dependencies
 */
import { Card, Button } from '@automattic/components';
import { getSelectedDomain } from 'lib/domains';
import {
	cancelTransferRequest,
	fetchWapiDomainInfo,
	requestTransferCode,
} from 'lib/domains/wapi-domain-info/actions';
import notices from 'notices';
import { displayRequestTransferCodeResponseNotice } from './shared';
import { CALYPSO_CONTACT, TRANSFER_DOMAIN_REGISTRATION_WITH_NEW_REGISTRAR } from 'lib/url/support';

class Unlocked extends React.Component {
	state = {
		submitting: false,
		sent: ! this.isDomainAlwaysTransferrable(),
	};

	componentWillUnmount() {
		this.setStateIfMounted = noop;
	}

	setStateIfMounted( ...args ) {
		/**
		 * Wrap setState calls that might occur after unmounting.
		 *
		 * When we cancel a transfer, that might update locking or privacy,
		 * but errors mean we can't know in time - the store gets the information
		 * before we do.
		 *
		 * The recommended solution is cancellable promises, but we don't want to
		 * cancel these requests if we navigate away, so that won't work for us here.
		 */
		this.setState( ...args );
	}

	handleCancelTransferClick = () => {
		const { translate } = this.props;
		const { privateDomain, pendingTransfer, domainLockingAvailable } = getSelectedDomain(
			this.props
		);

		this.setState( { submitting: true } );

		const enablePrivacy = ! privateDomain;
		const lockDomain = domainLockingAvailable;

		cancelTransferRequest(
			{
				domainName: this.props.selectedDomainName,
				declineTransfer: pendingTransfer,
				siteId: this.props.selectedSite.ID,
				enablePrivacy,
				lockDomain,
			},
			( error ) => {
				this.setStateIfMounted( { submitting: false } );

				if ( error ) {
					const contactLink = (

					);
					let errorMessage;

					switch ( error.error ) {
						case 'enable_private_reg_failed':
							errorMessage = translate(
								'We were unable to enable Privacy Protection for your domain. ' +
									'Please try again or {{contactLink}}Contact Support{{/contactLink}} if you continue to have trouble.',
								{ components: { contactLink } }
							);
							break;
						case 'decline_transfer_failed':
							errorMessage = translate(
								'We were unable to stop the transfer for your domain. ' +
									'Please try again or {{contactLink}}Contact Support{{/contactLink}} if you continue to have trouble.',
								{ components: { contactLink } }
							);
							break;
						case 'lock_domain_failed':
							errorMessage = translate(
								'We were unable to lock your domain. ' +
									'Please try again or {{contactLink}}Contact Support{{/contactLink}} if you continue to have trouble.',
								{ components: { contactLink } }
							);
							break;
						default:
							errorMessage = translate(
								'Oops! Something went wrong and your request could not be ' +
									'processed. Please try again or {{contactLink}}Contact Support{{/contactLink}} if ' +
									'you continue to have trouble.',
								{ components: { contactLink } }
							);
							break;
					}
					notices.error( errorMessage );
				} else {
					// Success.
					this.setStateIfMounted( { sent: false } );

					let successMessage;
					if ( enablePrivacy && lockDomain ) {
						successMessage = translate(
							"We've canceled your domain transfer. Your domain is now re-locked and " +
								'Privacy Protection has been enabled.'
						);
					} else if ( enablePrivacy ) {
						successMessage = translate(
							"We've canceled your domain transfer and " + 'Privacy Protection has been re-enabled.'
						);
					} else if ( lockDomain ) {
						successMessage = translate(
							"We've canceled your domain transfer and " + 're-locked your domain.'
						);
					} else {
						successMessage = translate( "We've canceled your domain transfer. " );
					}

					notices.success( successMessage );
				}
			}
		);
	};

	isDomainAlwaysTransferrable() {
		const { domainLockingAvailable, privateDomain } = getSelectedDomain( this.props );
		return ! domainLockingAvailable && ! privateDomain;
	}

	renderCancelButton( domain ) {
		const { pendingTransfer } = domain;

		const showCancelButton = pendingTransfer || ! this.isDomainAlwaysTransferrable();
		if ( ! showCancelButton ) {
			return null;
		}

		return (
			<Button
				className="transfer-out__action-button"
				onClick={ this.handleCancelTransferClick }
				disabled={ this.state.submitting || ! this.state.sent }
			>
				{ this.props.translate( 'Cancel Transfer' ) }
			</Button>
		);
	}

	renderSendButton( domain ) {
		const { translate } = this.props;
		const { manualTransferRequired } = domain;

		if ( manualTransferRequired && this.state.sent ) {
			return null;
		}

		return (
			<Button
				className="transfer-out__action-button"
				onClick={ this.handleSendConfirmationCodeClick }
				disabled={ this.state.submitting }
				primary
			>
				{ this.state.sent
					? translate( 'Resend Transfer Code' )
					: translate( 'Send Transfer Code' ) }
			</Button>
		);
	}

	handleSendConfirmationCodeClick = () => {
		const options = {
			siteId: this.props.selectedSite.ID,
			domainName: this.props.selectedDomainName,
			unlock: false,
			disablePrivacy: false,
		};

		this.setState( { submitting: true } );

		requestTransferCode( options, ( error ) => {
			this.setState( { submitting: false } );
			if ( ! error ) {
				this.setState( { sent: true } );
			}
			displayRequestTransferCodeResponseNotice( error, getSelectedDomain( this.props ) );
			fetchWapiDomainInfo( this.props.selectedDomainName );
		} );
	};

	renderPendingTransferBody() {
		const { translate } = this.props;
		return (

{ translate( 'Your domain is pending transfer.' ) }

		);
	}

	renderManualTransferBody() {
		const { translate } = this.props;
		const { sent } = this.state;

		return (

				{ translate( 'The registry for your domain requires a special process for transfers. ' ) }{ ' ' }
				{ sent
					? translate(
							'Our Happiness Engineers have been notified about ' +
								'your transfer request and will be in touch shortly to help ' +
								'you complete the process.'
					  )
					: translate(
							'Please request an authorization code to notify our ' +
								'Happiness Engineers of your intention.'
					  ) }

		);
	}

	renderAuthorizationCodeBody() {
		const { translate } = this.props;
		const { submitting, sent } = this.state;

		const sentStatement =
			sent &&
			translate(
				'We have sent the transfer authorization code to the ' +
					"domain registrant's email address."
			) + ' ';
		return (

				{ ! ( submitting || sent ) && (

						{ translate( 'Please press the button to request a transfer authorization code.' ) }

				) }

					{ sentStatement }
					{ translate(
						'You must provide your new registrar with your ' +
							'domain name and transfer code to complete the transfer process.'
					) }

		);
	}

	render() {
		const { translate } = this.props;
		const { submitting } = this.state;
		const domain = getSelectedDomain( this.props );
		const { privateDomain, domainLockingAvailable } = domain;
		const privacyDisabled = ! privateDomain;

		let domainStateMessage;
		if ( domainLockingAvailable && privacyDisabled ) {
			domainStateMessage = translate(
				'Your domain is unlocked and ' +
					'Privacy Protection has been disabled to prepare for transfer.'
			);
		} else if ( privacyDisabled ) {
			domainStateMessage = translate(
				'Privacy Protection for your ' + 'domain has been disabled to prepare for transfer.'
			);
		} else if ( domainLockingAvailable ) {
			domainStateMessage = translate( 'Your domain is unlocked to prepare for transfer.' );
		}

		return (

				<Card className="transfer-out__card">

						{ submitting &&
{ translate( 'Sending request…' ) }
 }
						{ domainStateMessage &&
{ domainStateMessage }
 }
						{ this.renderBody( domain ) }

							{ translate( 'Learn More.' ) }

					{ this.renderSendButton( domain ) }
					{ this.renderCancelButton( domain ) }
				</Card>

		);
	}

	renderBody( domain ) {
		const { manualTransferRequired, pendingTransfer } = domain;

		if ( pendingTransfer ) {
			return this.renderPendingTransferBody();
		}

		if ( manualTransferRequired ) {
			return this.renderManualTransferBody();
		}

		return this.renderAuthorizationCodeBody();
	}
}

export default localize( Unlocked );


//
//     Generated by class-dump 3.5 (64 bit).
//
//     class-dump is Copyright (C) 1997-1998, 2000-2001, 2004-2013 by Steve Nygard.
//

#import <ShareKit/SHKWindowController.h>

#import "NSTextViewDelegate.h"
#import "SHKCompletionPopUpControllerDelegate.h"

@class NSButton, NSPopUpButton, NSProgressIndicator, NSString, NSTextField, NSTextView, NSView, SHKCompletionPopUpController, SHKShareLocationController, SHKShareWindowBackgroundView;

@interface SHKShareWindowController : SHKWindowController <NSTextViewDelegate, SHKCompletionPopUpControllerDelegate>
{
    SHKShareWindowBackgroundView *_backgroundView;
    NSTextView *_messageTextView;
    NSTextField *_characterCountTextField;
    NSView *_locationContainerView;
    NSButton *_cancelButton;
    NSButton *_sendButton;
    NSProgressIndicator *_progressIndicator;
    NSTextField *_titleTextField;
    NSTextField *_errorTextField;
    NSTextField *_accountsFromTextField;
    NSPopUpButton *_accountsPopUpButton;
    NSTextField *_fromTextField;
    NSTextField *_audienceTextField;
    NSPopUpButton *_audiencePopUpButton;
    BOOL _showCompletionPopUpInMessage;
    SHKCompletionPopUpController *_completionPopUpController;
    SHKShareLocationController *_locationController;
}

@property(readonly) SHKShareLocationController *locationController; // @synthesize locationController=_locationController;
@property(readonly) NSTextView *messageTextView; // @synthesize messageTextView=_messageTextView;
@property(readonly) NSPopUpButton *audiencePopUpButton; // @synthesize audiencePopUpButton=_audiencePopUpButton;
@property(readonly) NSPopUpButton *accountsPopUpButton; // @synthesize accountsPopUpButton=_accountsPopUpButton;
@property(readonly) NSButton *sendButton; // @synthesize sendButton=_sendButton;
@property(readonly) NSButton *cancelButton; // @synthesize cancelButton=_cancelButton;
@property BOOL showCompletionPopUpInMessage; // @synthesize showCompletionPopUpInMessage=_showCompletionPopUpInMessage;
- (void)setCompletions:(id)arg1 forText:(id)arg2;
- (void)completionPopUpController:(id)arg1 didSelectCompletionItem:(id)arg2;
- (BOOL)textView:(id)arg1 doCommandBySelector:(SEL)arg2;
- (void)_insertCompletion:(id)arg1;
- (void)_validateCompletionPopUpInMessage;
- (id)textView:(id)arg1 willShowSharingServicePicker:(id)arg2 forItems:(id)arg3;
- (void)textViewDidChangeSelection:(id)arg1;
- (void)contentDidChange;
- (void)windowDidClose;
- (void)startAccountSetupAndClose:(id)arg1;
- (void)send:(id)arg1;
- (void)cancel:(id)arg1;
- (double)paperClipVerticalOffset;
- (void)setWindowFrame:(struct CGRect)arg1 level:(unsigned long long)arg2;
- (struct CGRect)windowFrame;
- (void)setImage:(id)arg1 decorationHint:(int)arg2 contentRect:(struct CGRect)arg3;
- (void)adjustAudiencePopUpFrame;
- (void)adjustAccountsPopUpFrame;
- (void)adjustTextFrame;
- (struct CGRect)_imageFrame;
@property BOOL showAudiencePopUp;
@property BOOL showAccountsPopUp;
@property BOOL showProgressIndicator;
- (void)displayErrorString:(id)arg1;
- (void)makeUIBusy:(BOOL)arg1;
@property BOOL showLocationPin;
- (void)audiencePopUpChanged:(id)arg1;
- (void)accountsPopUpChanged:(id)arg1;
- (void)_setupUI;
- (void)_validateUI;
- (void)_updateCharactersCountField;
- (void)_validateSendButton;
@property BOOL showRemainingCharactersCounter;
- (void)setDisplayState:(id)arg1;
- (id)displayState;
@property(retain) NSString *message;
- (void)windowWillClose;
- (void)windowWillShow;
- (void)messageTextViewDidScroll:(id)arg1;
- (void)windowDidLoad;
@property int textureStyle; // @dynamic textureStyle;
- (id)shareWindowService;
- (void)dealloc;
- (id)windowNibName;

@end


D prog-intro.sgml


// Copyright 2018 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#ifndef V8_CODEGEN_CONSTANTS_ARCH_H_
#define V8_CODEGEN_CONSTANTS_ARCH_H_

#if V8_TARGET_ARCH_ARM
#include "src/codegen/arm/constants-arm.h"  // NOLINT
#elif V8_TARGET_ARCH_ARM64
#include "src/codegen/arm64/constants-arm64.h"  // NOLINT
#elif V8_TARGET_ARCH_IA32
#include "src/codegen/ia32/constants-ia32.h"  // NOLINT
#elif V8_TARGET_ARCH_MIPS
#include "src/codegen/mips/constants-mips.h"  // NOLINT
#elif V8_TARGET_ARCH_MIPS64
#include "src/codegen/mips64/constants-mips64.h"  // NOLINT
#elif V8_TARGET_ARCH_PPC || V8_TARGET_ARCH_PPC64
#include "src/codegen/ppc/constants-ppc.h"  // NOLINT
#elif V8_TARGET_ARCH_S390
#include "src/codegen/s390/constants-s390.h"  // NOLINT
#elif V8_TARGET_ARCH_X64
#include "src/codegen/x64/constants-x64.h"  // NOLINT
#else
#error Unsupported target architecture.
#endif

#endif  // V8_CODEGEN_CONSTANTS_ARCH_H_


package testclient

import (
	ktestclient "k8s.io/kubernetes/pkg/client/unversioned/testclient"

	authorizationapi "github.com/openshift/origin/pkg/authorization/api"
)

type FakeSelfSubjectRulesReviews struct {
	Fake      *Fake
	Namespace string
}

func (c *FakeSelfSubjectRulesReviews) Create(inObj *authorizationapi.SelfSubjectRulesReview) (*authorizationapi.SelfSubjectRulesReview, error) {
	obj, err := c.Fake.Invokes(ktestclient.NewCreateAction("selfsubjectrulesreviews", c.Namespace, inObj), &authorizationapi.SelfSubjectRulesReview{})
	if cast, ok := obj.(*authorizationapi.SelfSubjectRulesReview); ok {
		return cast, err
	}
	return nil, err
}


defmodule Monkey.Parser do
  alias Monkey.Ast.{
    ArrayLiteral,
    BlockStatement,
    BooleanLiteral,
    CallExpression,
    ExpressionStatement,
    FunctionLiteral,
    HashLiteral,
    Identifier,
    IfExpression,
    IndexExpression,
    InfixExpression,
    IntegerLiteral,
    LetStatement,
    PrefixExpression,
    Program,
    ReturnStatement,
    StringLiteral
  }

  alias Monkey.Parser
  alias Monkey.Token

  @enforce_keys [:curr, :peek, :tokens, :errors]
  defstruct [:curr, :peek, :tokens, :errors]

  @precedence_levels %{
    lowest: 0,
    equals: 1,
    less_greater: 2,
    sum: 3,
    product: 4,
    prefix: 5,
    call: 6,
    index: 7
  }

  @precedences %{
    eq: @precedence_levels.equals,
    not_eq: @precedence_levels.equals,
    lt: @precedence_levels.less_greater,
    gt: @precedence_levels.less_greater,
    plus: @precedence_levels.sum,
    minus: @precedence_levels.sum,
    slash: @precedence_levels.product,
    asterisk: @precedence_levels.product,
    lparen: @precedence_levels.call,
    lbracket: @precedence_levels.index
  }

  def from_tokens(tokens) do
    [curr | [peek | rest]] = tokens
    %Parser{curr: curr, peek: peek, tokens: rest, errors: []}
  end

  def parse_program(p, statements \\ []), do: do_parse_program(p, statements)

  defp do_parse_program(%Parser{curr: %Token{type: :eof}} = p, statements) do
    statements = Enum.reverse(statements)
    program = %Program{statements: statements}
    {p, program}
  end

  defp do_parse_program(%Parser{} = p, statements) do
    {p, statement} = parse_statement(p)

    statements =
      case statement do
        nil -> statements
        statement -> [statement | statements]
      end

    p = next_token(p)

    do_parse_program(p, statements)
  end

  defp next_token(%Parser{tokens: []} = p) do
    %{p | curr: p.peek, peek: nil}
  end

  defp next_token(%Parser{} = p) do
    [next_peek | rest] = p.tokens
    %{p | curr: p.peek, peek: next_peek, tokens: rest}
  end

  defp parse_statement(p) do
    case p.curr.type do
      :let -> parse_let_statement(p)
      :return -> parse_return_statement(p)
      _ -> parse_expression_statement(p)
    end
  end

  defp parse_let_statement(p) do
    let_token = p.curr

    with {:ok, p, ident_token} <- expect_peek(p, :ident),
         {:ok, p, _assign_token} <- expect_peek(p, :assign),
         p <- next_token(p),
         {:ok, p, value} <- parse_expression(p, @precedence_levels.lowest) do
      identifier = %Identifier{token: ident_token, value: ident_token.literal}
      statement = %LetStatement{token: let_token, name: identifier, value: value}
      p = skip_semicolon(p)
      {p, statement}
    else
      _ -> {p, nil}
    end
  end

  defp parse_return_statement(p) do
    return_token = p.curr
    p = next_token(p)
    {_, p, return_value} = parse_expression(p, @precedence_levels.lowest)
    p = skip_semicolon(p)
    statement = %ReturnStatement{token: return_token, return_value: return_value}
    {p, statement}
  end

  defp parse_expression_statement(p) do
    token = p.curr
    {_, p, expression} = parse_expression(p, @precedence_levels.lowest)
    statement = %ExpressionStatement{token: token, expression: expression}
    p = skip_semicolon(p)
    {p, statement}
  end

  defp parse_expression(p, precedence) do
    case prefix_parse_fns(p.curr.type, p) do
      {p, nil} ->
        {:error, p, nil}

      {p, expression} ->
        {p, expression} = check_infix(p, expression, precedence)
        {:ok, p, expression}
    end
  end

  defp check_infix(p, left, precedence) do
    allowed = p.peek.type != :semicolon && precedence < peek_precedence(p)

    with true <- allowed,
         infix_fn <- infix_parse_fns(p.peek.type),
         true <- infix_fn != nil do
      p = next_token(p)
      {p, infix} = infix_fn.(p, left)
      check_infix(p, infix, precedence)
    else
      _ -> {p, left}
    end
  end

  defp prefix_parse_fns(:ident, p), do: parse_identifier(p)
  defp prefix_parse_fns(:int, p), do: parse_integer_literal(p)
  defp prefix_parse_fns(:bang, p), do: parse_prefix_expression(p)
  defp prefix_parse_fns(:minus, p), do: parse_prefix_expression(p)
  defp prefix_parse_fns(true, p), do: parse_boolean(p)
  defp prefix_parse_fns(false, p), do: parse_boolean(p)
  defp prefix_parse_fns(:lparen, p), do: parse_grouped_expression(p)
  defp prefix_parse_fns(:if, p), do: parse_if_expression(p)
  defp prefix_parse_fns(:function, p), do: parse_function_literal(p)
  defp prefix_parse_fns(:string, p), do: parse_string_literal(p)
  defp prefix_parse_fns(:lbracket, p), do: parse_array_literal(p)
  defp prefix_parse_fns(:lbrace, p), do: parse_hash_literal(p)

  defp prefix_parse_fns(_, p) do
    error = "No prefix function found for #{p.curr.type}"
    p = add_error(p, error)
    {p, nil}
  end

  defp parse_identifier(p) do
    identifier = %Identifier{token: p.curr, value: p.curr.literal}
    {p, identifier}
  end

  defp parse_integer_literal(p) do
    int = Integer.parse(p.curr.literal)

    case int do
      :error ->
        error = "Could not parse #{p.curr.literal} as integer"
        p = add_error(p, error)
        {p, nil}

      {val, _} ->
        expression = %IntegerLiteral{token: p.curr, value: val}
        {p, expression}
    end
  end

  defp parse_prefix_expression(p) do
    token = p.curr
    operator = p.curr.literal

    p = next_token(p)
    {_, p, right} = parse_expression(p, @precedence_levels.prefix)
    prefix = %PrefixExpression{token: token, operator: operator, right: right}

    {p, prefix}
  end

  defp parse_boolean(p) do
    boolean = %BooleanLiteral{token: p.curr, value: p.curr.type == true}
    {p, boolean}
  end

  defp parse_grouped_expression(p) do
    p = next_token(p)
    {_, p, expression} = parse_expression(p, @precedence_levels.lowest)

    case expect_peek(p, :rparen) do
      {:error, p, nil} -> {p, nil}
      {:ok, p, _} -> {p, expression}
    end
  end

  defp parse_if_expression(p) do
    token = p.curr

    with {:ok, p, _peek} <- expect_peek(p, :lparen),
         p <- next_token(p),
         {:ok, p, condition} <- parse_expression(p, @precedence_levels.lowest),
         {:ok, p, _peek} <- expect_peek(p, :rparen),
         {:ok, p, _peek} <- expect_peek(p, :lbrace) do
      {p, consequence} = parse_block_statement(p)
      {p, alternative} = parse_if_alternative(p)

      expression = %IfExpression{
        token: token,
        condition: condition,
        consequence: consequence,
        alternative: alternative
      }

      {p, expression}
    else
      {:error, p, _} -> {p, nil}
    end
  end

  defp parse_if_alternative(%Parser{peek: %Token{type: :else}} = p) do
    p = next_token(p)

    case expect_peek(p, :lbrace) do
      {:error, p, _} -> {p, nil}
      {:ok, p, _} -> parse_block_statement(p)
    end
  end

  defp parse_if_alternative(p), do: {p, nil}

  defp parse_function_literal(p) do
    token = p.curr

    with {:ok, p, _peek} <- expect_peek(p, :lparen),
         {p, parameters} <- parse_function_parameters(p),
         {:ok, p, _peek} <- expect_peek(p, :lbrace) do
      {p, body} = parse_block_statement(p)
      expression = %FunctionLiteral{token: token, parameters: parameters, body: body}
      {p, expression}
    else
      {:error, p, _} -> {p, nil}
    end
  end

  defp parse_function_parameters(p, identifiers \\ []) do
    do_parse_function_parameters(p, identifiers)
  end

  defp do_parse_function_parameters(%Parser{peek: %Token{type: :rparen}} = p, [] = identifiers) do
    p = next_token(p)
    {p, identifiers}
  end

  defp do_parse_function_parameters(p, identifiers) do
    p = next_token(p)
    identifiers = identifiers ++ [%Identifier{token: p.curr, value: p.curr.literal}]

    case p.peek.type do
      :comma ->
        p = next_token(p)
        do_parse_function_parameters(p, identifiers)

      _ ->
        # TODO: no nested case please!
        case expect_peek(p, :rparen) do
          {:ok, p, _peek} -> {p, identifiers}
          {:error, p, nil} -> {p, nil}
        end
    end
  end

  defp parse_block_statement(p, statements \\ []) do
    token = p.curr
    p = next_token(p)
    do_parse_block_statement(p, token, statements)
  end

  defp do_parse_block_statement(%Parser{curr: %Token{type: :rbrace}} = p, token, statements) do
    statements = Enum.reverse(statements)
    block = %BlockStatement{token: token, statements: statements}
    {p, block}
  end

  defp do_parse_block_statement(%Parser{} = p, token, statements) do
    {p, statement} = parse_statement(p)

    statements =
      case statement do
        nil -> statements
        statement -> [statement | statements]
      end

    p = next_token(p)
    do_parse_block_statement(p, token, statements)
  end

  defp parse_string_literal(p) do
    expression = %StringLiteral{token: p.curr, value: p.curr.literal}
    {p, expression}
  end

  defp parse_array_literal(p) do
    token = p.curr
    {p, elements} = parse_expression_list(p, :rbracket)
    array = %ArrayLiteral{token: token, elements: elements}
    {p, array}
  end

  defp parse_hash_literal(p) do
    token = p.curr
    do_parse_hash_literal(p, token, %{})
  end

  defp do_parse_hash_literal(%Parser{peek: %Token{type: :rbrace}} = p, token, %{} = pairs) do
    p = next_token(p)
    hash = %HashLiteral{token: token, pairs: pairs}
    {p, hash}
  end

  defp do_parse_hash_literal(p, token, pairs) do
    p = next_token(p)

    with {:ok, p, key} <- parse_expression(p, @precedence_levels.lowest),
         {:ok, p, _peek} <- expect_peek(p, :colon),
         p <- next_token(p),
         {:ok, p, value} <- parse_expression(p, @precedence_levels.lowest) do
      pairs = Map.put(pairs, key, value)

      if p.peek.type == :rbrace do
        p = next_token(p)
        hash = %HashLiteral{token: token, pairs: pairs}
        {p, hash}
      else
        # TODO: no nested conditions
        case expect_peek(p, :comma) do
          {:ok, p, _peek} -> do_parse_hash_literal(p, token, pairs)
          {:error, p, _peek} -> {p, nil}
        end
      end
    else
      {:error, p, _} -> {p, nil}
    end
  end

  defp infix_parse_fns(:plus), do: &parse_infix_expression(&1, &2)
  defp infix_parse_fns(:minus), do: &parse_infix_expression(&1, &2)
  defp infix_parse_fns(:slash), do: &parse_infix_expression(&1, &2)
  defp infix_parse_fns(:asterisk), do: &parse_infix_expression(&1, &2)
  defp infix_parse_fns(:eq), do: &parse_infix_expression(&1, &2)
  defp infix_parse_fns(:not_eq), do: &parse_infix_expression(&1, &2)
  defp infix_parse_fns(:lt), do: &parse_infix_expression(&1, &2)
  defp infix_parse_fns(:gt), do: &parse_infix_expression(&1, &2)
  defp infix_parse_fns(:lparen), do: &parse_call_expression(&1, &2)
  defp infix_parse_fns(:lbracket), do: &parse_index_expression(&1, &2)
  defp infix_parse_fns(_), do: nil

  defp parse_infix_expression(p, left) do
    token = p.curr
    operator = p.curr.literal

    precedence = curr_precedence(p)
    p = next_token(p)
    {_, p, right} = parse_expression(p, precedence)
    infix = %InfixExpression{token: token, left: left, operator: operator, right: right}

    {p, infix}
  end

  defp parse_call_expression(p, function) do
    token = p.curr
    {p, arguments} = parse_expression_list(p, :rparen)
    expression = %CallExpression{token: token, function: function, arguments: arguments}
    {p, expression}
  end

  def parse_index_expression(p, left) do
    token = p.curr
    p = next_token(p)
    {_, p, index} = parse_expression(p, @precedence_levels.lowest)
    expression = %IndexExpression{token: token, left: left, index: index}

    case expect_peek(p, :rbracket) do
      {:ok, p, _peek} -> {p, expression}
      {:error, p, nil} -> {p, nil}
    end
  end

  defp parse_expression_list(p, end_token, arguments \\ []) do
    do_parse_expression_list(p, end_token, arguments)
  end

  defp do_parse_expression_list(
         %Parser{peek: %Token{type: end_token}} = p,
         end_token,
         [] = arguments
       ) do
    p = next_token(p)
    {p, arguments}
  end

  defp do_parse_expression_list(p, end_token, arguments) do
    p = next_token(p)
    {_, p, argument} = parse_expression(p, @precedence_levels.lowest)
    arguments = arguments ++ [argument]

    case p.peek.type do
      :comma ->
        p = next_token(p)
        do_parse_expression_list(p, end_token, arguments)

      _ ->
        # TODO: no nested case please!
        case expect_peek(p, end_token) do
          {:ok, p, _peek} -> {p, arguments}
          {:error, p, nil} -> {p, nil}
        end
    end
  end

  defp skip_semicolon(p) do
    if p.peek.type == :semicolon, do: next_token(p), else: p
  end

  defp curr_precedence(p), do: Map.get(@precedences, p.curr.type, @precedence_levels.lowest)

  defp peek_precedence(p), do: Map.get(@precedences, p.peek.type, @precedence_levels.lowest)

  defp expect_peek(%Parser{peek: peek} = p, expected_type) do
    if peek.type == expected_type do
      p = next_token(p)
      {:ok, p, peek}
    else
      error = "Expected next token to be :#{expected_type}, got :#{peek.type} instead"
      p = add_error(p, error)
      {:error, p, nil}
    end
  end

  defp add_error(p, msg), do: %{p | errors: p.errors ++ [msg]}
end


/*
 * Copyright 2019 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.
 */
package androidx.compose.ui.demos.keyinput

import androidx.compose.foundation.Text
import androidx.compose.foundation.layout.Arrangement
import androidx.compose.foundation.layout.Column
import androidx.compose.foundation.layout.Row
import androidx.compose.foundation.layout.RowScope
import androidx.compose.foundation.layout.fillMaxWidth
import androidx.compose.runtime.Composable
import androidx.compose.runtime.MutableState
import androidx.compose.runtime.getValue
import androidx.compose.runtime.mutableStateOf
import androidx.compose.runtime.remember
import androidx.compose.runtime.setValue
import androidx.compose.ui.Modifier
import androidx.compose.ui.focus
import androidx.compose.ui.focus.ExperimentalFocus
import androidx.compose.ui.focus.FocusRequester
import androidx.compose.ui.focus.isFocused
import androidx.compose.ui.focusObserver
import androidx.compose.ui.focusRequester
import androidx.compose.ui.gesture.tapGestureFilter
import androidx.compose.ui.graphics.Color
import androidx.compose.ui.input.key.ExperimentalKeyInput
import androidx.compose.ui.input.key.KeyEventType.KeyDown
import androidx.compose.ui.input.key.keyInputFilter

@Composable
fun KeyInputDemo() {
    Column(
        verticalArrangement = Arrangement.SpaceEvenly
    ) {
        CenteredRow {
            Text(
                "Click on any item to bring it into focus. \nThen type using a hardware keyboard."
            )
        }
        CenteredRow {
            FocusableText(remember { mutableStateOf("Enter Text Here") })
        }
        CenteredRow {
            FocusableText(remember { mutableStateOf("Enter Text Here") })
        }
        CenteredRow {
            FocusableText(remember { mutableStateOf("Enter Text Here") })
        }
    }
}

@Composable
@OptIn(
    ExperimentalFocus::class,
    ExperimentalKeyInput::class
)
private fun FocusableText(text: MutableState<String>) {
    var color by remember { mutableStateOf(Color.Black) }
    val focusRequester = FocusRequester()
    Text(
        modifier = Modifier
            .focusRequester(focusRequester)
            .focusObserver { color = if (it.isFocused) Color.Green else Color.Black }
            .focus()
            .tapGestureFilter { focusRequester.requestFocus() }
            .keyInputFilter {
                if (it.type == KeyDown) {
                    text.value = StringBuilder(text.value)
                        .appendCodePoint(it.utf16CodePoint)
                        .toString()
                    true
                } else {
                    false
                }
            },
        text = text.value,
        color = color
    )
}

@Composable
private fun CenteredRow(children: @Composable RowScope.() -> Unit) {
    Row(
        modifier = Modifier.fillMaxWidth(),
        horizontalArrangement = Arrangement.Center,
        children = children
    )
}


# After modifying, run ./mkscr

if test -n ${distro_bootpart}; then setenv bootpart ${distro_bootpart}; else setenv bootpart 1; fi
part uuid ${devtype} ${devnum}:${bootpart} uuid

setenv bootargs console=${console} root=PARTUUID=${uuid} rw rootwait

if load ${devtype} ${devnum}:${bootpart} ${kernel_addr_r} /boot/zImage; then
  if load ${devtype} ${devnum}:${bootpart} ${fdt_addr_r} /boot/dtbs/${fdtfile}; then
    if load ${devtype} ${devnum}:${bootpart} ${ramdisk_addr_r} /boot/initramfs-linux.img; then
      bootz ${kernel_addr_r} ${ramdisk_addr_r}:${filesize} ${fdt_addr_r};
    else
      bootz ${kernel_addr_r} - ${fdt_addr_r};
    fi;
  fi;
fi


/*********************************************************************
 *
 * Copyright (C) 1999-2010,  Karlsruhe University
 * Copyright (C) 2008-2009,  Volkmar Uhlig, Jan Stoess, IBM Corporation
 *
 * File path:     bench/pingpong/ia32.h
 * Description:
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. 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.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
 *
 * $Id$
 *
 ********************************************************************/
#include <l4/arch.h>

#define HAVE_HANDLE_ARCH_PAGEFAULT
#define HAVE_READ_CYCLES
#define HAVE_ARCH_IPC

#define L4_REQUEST_MASK		( ~((~0UL) >> ((sizeof (L4_Word_t) * 8) - 20)))

#define UTCB_ADDRESS	(0x00800000UL)
#define KIP_ADDRESS	(0x00C00000UL)

#define L4_IO_PAGEFAULT		(-8UL << 20)
#define L4_IO_PORT_START	(0)
#define L4_IO_PORT_END		(1<<16)

extern L4_Word_t __L4_syscalls_start;
extern L4_Word_t __L4_syscalls_end;
extern "C" void __L4_copy_syscalls_in (L4_Word_t dest);

char syscall_stubs[4096] __attribute__ ((aligned (4096)));

L4_Fpage_t handle_arch_pagefault (L4_MsgTag_t tag, L4_Word_t faddr, L4_Word_t fip, L4_Word_t log2size)
{
    // If pagefault is in the syscall stubs, create a copy of the
    // original stubs and map in this copy.
    if (faddr >= (L4_Word_t) &__L4_syscalls_start &&
	faddr <  (L4_Word_t) &__L4_syscalls_end)
    {
	__L4_copy_syscalls_in ((L4_Word_t) syscall_stubs);
	return L4_FpageLog2 ( (L4_Word_t) syscall_stubs, log2size);
    }

    // If pagefault is an IO-Page, return that IO Fpage
    L4_Fpage_t fp;
    fp.raw = faddr;
    if ((tag.raw & L4_REQUEST_MASK) == L4_IO_PAGEFAULT && L4_IsIoFpage(fp))
    {
	return fp;
    }

    return L4_FpageLog2 (faddr, log2size);
}

L4_INLINE L4_Word64_t read_cycles(void)
{
    L4_Word32_t eax, edx;

    __asm__ __volatile__ (
            "rdtsc"
            : "=a"(eax), "=d"(edx));

    return (((L4_Word64_t)edx) << 32) | (L4_Word64_t)eax;
}

L4_INLINE L4_Word_t pingpong_ipc (L4_ThreadId_t dest, L4_Word_t untyped)
{
    L4_Word_t dummy;
    __asm__ __volatile__ (
	"/* pingpong_arch_ipc() */\n"
	"pushl	%%ebp		\n"
	"xorl	%%ecx, %%ecx	\n"
	"movl	%%esi, (%%edi)	\n"
#if 1
	"call	__L4_Ipc	\n"	/* jump via KIP */
#else
	"leal	1f, %%ebx	\n"	/* enter kernel directly */
	"movl	%%esp, %%ebp	\n"
	"sysenter		\n"
	"1:			\n"
#endif
	"popl	%%ebp		\n"
	: "=d" (dummy), "=S"(untyped)
	: "a" (dest), "d" (dest), "S"(untyped), "D"(__L4_X86_Utcb())
	: "ebx", "ecx" );
    return untyped;
}


class Organization < ActiveRecord::Base
    has_many :users

end