text:
Parts of ExRam.Gremlinq use 3rd party software. This file reproduces the projects' respective
copyright notices and license agreements.

----------------------------------------------------------------------------------------
FluentAssertions

Apache License
Version 2.0, January 2004
http://www.apache.org/licenses/

TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION

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

APPENDIX: How to apply the Apache License to your work

To apply the Apache License to your work, attach the following boilerplate
notice, with the fields enclosed by brackets "[]" replaced with your own
identifying information. (Don't include the brackets!) The text should be
enclosed in the appropriate comment syntax for the file format. We also
recommend that a file or class name and description of purpose be included on
the same "printed page" as the copyright notice for easier identification within
third-party archives.

   Copyright [yyyy] [name of copyright owner]

   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.
----------------------------------------------------------------------------------------
Fody

The MIT License

Copyright (c) Simon Cropp and contributors

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.
----------------------------------------------------------------------------------------
Gremlin.NET

                                Apache License
                           Version 2.0, January 2004
                        http://www.apache.org/licenses/

   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION

   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:

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

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

      (c) 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

      (d) 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

   APPENDIX: How to apply the Apache License to your work.

      To apply the Apache License to your work, attach the following
      boilerplate notice, with the fields enclosed by brackets "[]"
      replaced with your own identifying information. (Don't include
      the brackets!)  The text should be enclosed in the appropriate
      comment syntax for the file format. We also recommend that a
      file or class name and description of purpose be included on the
      same "printed page" as the copyright notice for easier
      identification within third-party archives.

   Copyright [yyyy] [name of copyright owner]

   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.
----------------------------------------------------------------------------------------
Language-ext

The MIT License (MIT)

Copyright (c) 2014-2019 Paul Louth

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.
----------------------------------------------------------------------------------------
Moq

MIT License

Copyright (c) 2017 Daniel Cazzulino and Contributors

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.
----------------------------------------------------------------------------------------
Newtonsoft.Json

The MIT License (MIT)

Copyright (c) 2007 James Newton-King

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.
----------------------------------------------------------------------------------------
NullGuard.Fody

The MIT License

Copyright (c) 2012 Simon Cropp and contributors

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.
----------------------------------------------------------------------------------------
xUnit / xunit.runner.visualstudio

Unless otherwise noted, the source code here is covered by the following license:

    Copyright (c) .NET Foundation and Contributors
    All Rights Reserved

    Licensed under the Apache License, Version 2.0 (the "License");
    you may not use this file except in compliance with the License.
    You may obtain a copy of the License at

        http://www.apache.org/licenses/LICENSE-2.0

    Unless required by applicable law or agreed to in writing, software
    distributed under the License is distributed on an "AS IS" BASIS,
    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
    See the License for the specific language governing permissions and
    limitations under the License.

-----------------------

The code in src/common/AssemblyResolution/Microsoft.DotNet.PlatformAbstractions was imported from:
    https://github.com/dotnet/core-setup/tree/v2.0.1/src/managed/Microsoft.DotNet.PlatformAbstractions

The code in src/common/AssemblyResolution/Microsoft.DotNet.PlatformAbstractions was imported from:
    https://github.com/dotnet/core-setup/tree/v2.0.1/src/managed/Microsoft.Extensions.DependencyModel

Both sets of code are covered by the following license:

    The MIT License (MIT)

    Copyright (c) 2015 .NET Foundation

    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.
----------------------------------------------------------------------------------------
PublicApiGenerator

The MIT License (MIT)

Copyright (c) 2015-2019 Jake Ginnivan

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.
----------------------------------------------------------------------------------------
Verify / Verify.Xunit

MIT License

Copyright (c) 2018 Simon Cropp

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.
----------------------------------------------------------------------------------------
.NET Standard library / System.Collections.Immutable / System.Interactive.Async

The MIT License (MIT)

Copyright (c) .NET Foundation and Contributors

All rights reserved.

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.


text:
namespace blink {

class Element;
class FrameHost;
class ViewportScrollCallback;

// This class manages the root scroller associated with the top-level document.
// The root scroller causes top controls movement, overscroll effects and
// prevents chaining up further in the DOM. It can be set using
// document.setRootScroller. By default, the rootScroller is the
// documentElement.
//
// Not all elements can be set as the root scroller. A valid element must be
// in the top-level document and must have a LayoutObject that is at least a
// LayoutBlockFlow or LayoutIFrame. In addition, only the top-level document can
// set a non-default root scroller.
class CORE_EXPORT RootScroller : public GarbageCollected<RootScroller> {
public:
    static RootScroller* create(FrameHost& frameHost)
    {
        return new RootScroller(frameHost);
    }

    // This method returns true if the element was set as the root scroller. If
    // the element isn't eligible to be the root scroller or we're in some bad
    // state, the method returns false without changing the current root
    // scroller.
    bool set(Element&);

    // Returns the element currently set as the root scroller.
    Element* get() const;

    // This class needs to be informed of changes in layout so that it can
    // determine if the current scroller is still valid or if it must be
    // replaced by the defualt root scroller.
    void didUpdateTopDocumentLayout();

    DECLARE_TRACE();

private:
    RootScroller(FrameHost&);

    bool isValid(Element&) const;
    void resetToDefault();
    void createApplyScrollIfNeeded();

    WeakMember<FrameHost> m_frameHost;
    Member<ViewportScrollCallback> m_viewportApplyScroll;

    WeakMember<Element> m_rootScroller;
};

} // namespace blink

#endif // RootScroller_h

redpajama_set_name: RedPajamaGithub


text:
<?php
/**
 * Sniff to suppress the use of:
 * Fail: if ( $a = 0 )
 * Fail: if ( $a *= foo() )
 * Fail: if ( $a += foo() )
 * Fail: while ( $a = foo() )
 * Pass: if ( $a == 0 )
 * Pass: if ( $a === 0 )
 * Pass: if ( $a === array( 1 => 0 ) )
 * Pass: while ( $a < 0 )
 */
// @codingStandardsIgnoreStart
class MediaWiki_Sniffs_ControlStructures_AssignmentInControlStructuresSniff
	implements PHP_CodeSniffer_Sniff {
	// @codingStandardsIgnoreEnd
	public function register() {
		return [
			T_IF,
			T_WHILE,
			T_ELSEIF,
		];
	}
	public function process( PHP_CodeSniffer_File $phpcsFile, $stackPtr ) {
		$tokens = $phpcsFile->getTokens();
		$token  = $tokens[$stackPtr];

		$next = $token['parenthesis_opener'] + 1;
		$end  = $token['parenthesis_closer'];
		while ( $next < $end ) {
			$code = $tokens[$next]['code'];
			// Check if any assignment operator was used. Allow T_DOUBLE_ARROW as that can
			// be used in an array like `if ( $foo === array( 'foo' => 'bar' ) )`
			if ( in_array( $code, PHP_CodeSniffer_Tokens::$assignmentTokens, true )
				&& $code !== T_DOUBLE_ARROW ) {
				$error = 'Assignment expression not allowed within "%s".';
				$phpcsFile->addError(
					$error,
					$stackPtr,
					'AssignmentInControlStructures',
					$token['content']
				);
				break;
			}
			$next++;
		}
	}
}


text:
//https://code.google.com/p/nya-engine/

#include "log/log.h"
#include "log/plain_file_log.h"
#include "system/app.h"
#include "system/system.h"
#include "render/render.h"

#include "render/platform_specific_gl.h"
#include "resources/resources.h"
#include "resources/file_resources_provider.h"
#include "resources/composite_resources_provider.h"
#include "config.h"
#include "pl2_resources_provider.h"
#include "attributes.h"
#include "scene.h"
#include "ui.h"

#include "stdio.h"

#ifdef __APPLE__
    #include "TargetConditionals.h"
#endif

class npl2: public nya_system::app
{
private:
	bool on_splash()
	{
	    nya_log::log()<<"on_splash\n";
	    nya_render::set_clear_color(0,0.6,0.7,1);
	    nya_render::clear(true,false);
        return true;
    }

	void on_init()
	{
	    nya_log::log()<<"on_init\n";

        init_resource_system();

        /*
        nya_resources::resource_data *outline_cfg=nya_resources::get_resources_provider().access("outline_ignore_list.txt");
        if(outline_cfg)
        {
            get_outline_ignore().load(outline_cfg);
            outline_cfg->release();
        }
        */

const unsigned long time_start=nya_system::get_time();

        get_scene().init();

nya_log::log()<<"Scene init time: "<<nya_system::get_time()-time_start<<"\n";

	    m_ui.init();
	}

	void on_frame(unsigned int dt)
	{
        get_scene().process(dt);
        get_scene().draw();

	    m_ui.process(dt);
        m_ui.draw();

	    static unsigned int fps_counter=0;
	    static unsigned int fps_update_timer=0;

	    ++fps_counter;

	    fps_update_timer+=dt;
	    if(fps_update_timer>1000)
	    {
            char name[255];
            sprintf(name,"npl2 %d fps",fps_counter);
            set_title(name);

            //nya_log::log()<<name<<"\n";

            fps_update_timer%=1000;
            fps_counter=0;
	    }
	}

    void on_mouse_move(int x,int y)
    {
        //nya_log::log()<<"mmove "<<x<<" "<<y<<"\n";

        if(m_mouse_drag.left)
        {
            get_scene().get_camera().add_rot(((x-m_mouse_drag.last_x)*180.0f)/200.0f,
                                             -((y-m_mouse_drag.last_y)*180.0f)/200.0f);
        }
        else if(m_mouse_drag.right)
        {
            get_scene().get_camera().add_pos((x-m_mouse_drag.last_x)/20.0f,(y-m_mouse_drag.last_y)/20.0f);
        }
        else
            m_ui.mouse_move(x,y);

        m_mouse_drag.last_x=x;
        m_mouse_drag.last_y=y;
    }

    void on_mouse_scroll(int dx,int dy)
    {
        if(!m_ui.mouse_scroll(dx,dy))
            get_scene().get_camera().add_scale(dy*0.03f);
    }

    void on_mouse_button(nya_system::mouse_button button,bool pressed)
    {
        if(button==nya_system::mouse_left)
        {
            if(!m_ui.mouse_button(nya_ui::left_button,pressed) || !pressed)
                m_mouse_drag.left=pressed;
        }
        else if(button==nya_system::mouse_right)
            m_mouse_drag.right=pressed;
    }

    void on_resize(unsigned int w,unsigned int h)
    {
        //nya_log::log()<<"on_resize "<<w<<" "<<h<<"\n";

        if(!w || !h)
            return;

        nya_math::mat4 proj;
        proj.perspective(25,float(w)/h,5,1500);
        nya_render::set_projection_matrix(proj);

        m_ui.resize(w,h);
    }

	void on_free()
    {
        nya_log::log()<<"on_free\n";

        get_scene().release();
        m_ui.release();
    }

private:
    void init_resource_system()
    {
        static bool init=false;
        if(init)
            return;

        init=true;

#if TARGET_OS_IPHONE || TARGET_IPHONE_SIMULATOR
        const std::string path=std::string(nya_system::get_app_path())+"../Documents/";
#else
        const std::string path=std::string(nya_system::get_app_path())+"add-ons/";
#endif

        static nya_resources::composite_resources_provider cprov;
        cprov.enable_cache();
        cprov.set_ignore_case(true);

        static nya_resources::file_resources_provider fprov;
        fprov.set_folder(path.c_str());

        const unsigned long time_start=nya_system::get_time();
        unsigned int arch_count=0;
        unsigned long arch_open_time=0;
        unsigned long arch_add_time=0;
        unsigned long attrib_time=0;

        static nya_memory::pool<nya_resources::pl2_resources_provider,32> pl2_providers;
        for(int i=0;i<fprov.get_resources_count();++i)
        {
            const char *name=fprov.get_resource_name(i);
            if(!nya_resources::check_extension(name,".pl2"))
                continue;

            nya_resources::pl2_resources_provider *prov=pl2_providers.allocate();

            unsigned long t0=nya_system::get_time();

            //nya_log::log()<<arch_name.c_str()<<"\n";
            prov->open_archieve(fprov.access(name));

            unsigned long t1=nya_system::get_time();

            cprov.add_provider(prov);

            unsigned long t2=nya_system::get_time();

            nya_resources::resource_data *attrib=prov->access_attribute();
            if(attrib)
            {
                get_attribute_manager().load(attrib);
                attrib->release();
            }

            unsigned long t3=nya_system::get_time();

            //nya_resources::log()<<arch_name.c_str()<<"\n";

            arch_open_time+=t1-t0;
            arch_add_time+=t2-t1;
            attrib_time+=t3-t2;
            ++arch_count;

            /*
            static unsigned long last_name_update_time=t3;
            static unsigned int name_update_timer=0;

            unsigned long dt=t3-last_name_update_time;
            last_name_update_time=t3;

            name_update_timer+=dt;
            if(name_update_timer>1000)
            {
                char name[255];
                sprintf(name,"npl2 %d archieves opened",arch_count);
                set_title(name);

                name_update_timer%=1000;
            }
            */
        }

        nya_log::log()<<"Archieves ("<<arch_count<<")"<<"and attribs load time: "<<nya_system::get_time()-time_start<<"\n";

        cprov.add_provider(&fprov);

        static nya_resources::file_resources_provider fprov2;
        fprov2.set_folder(nya_system::get_app_path(),false);

        cprov.add_provider(&fprov2);

        nya_resources::set_resources_provider(&cprov);

        nya_log::log()<<"Total res system init time: "<<nya_system::get_time()-time_start<<"\n";
        if(arch_count>0)
        {
            nya_log::log()<<"Average open archieve time: "<<float(arch_open_time)/arch_count<<"\n";
            nya_log::log()<<"Average add archieve time: "<<float(arch_add_time)/arch_count<<"\n";
            nya_log::log()<<"Average attrib time: "<<float(attrib_time)/arch_count<<"\n";
        }
    }

private:
    ui m_ui;

    struct mouse_drag
    {
        bool left;
        bool right;
        int last_x;
        int last_y;

        mouse_drag():left(false),right(false)
                    ,last_x(0),last_y(0) {}
    } m_mouse_drag;
};

#include "memory/tmp_buffer.h"

void debug_write_data(nya_resources::resource_data *data,const char *name)
{
    if(!data)
        return;

    FILE *out=fopen(name,"wb+");
    if(!out)
        return;

    nya_memory::tmp_buffer_scoped buf(data->get_size());
    data->read_all(buf.get_data());
    fwrite(buf.get_data(),data->get_size(),1,out);
    data->release();
    fclose(out);
}

void debug_extract_pl2(const char *name)
{
    if(!name)
        return;

    const std::string path=std::string(nya_system::get_app_path())+"add-ons/";

    nya_resources::file_resources_provider fprov;
    fprov.set_folder(path.c_str());
    nya_resources::resource_data *arch_data=fprov.access(name);
    if(!arch_data)
        return;

    nya_resources::pl2_resources_provider arch;
    arch.open_archieve(arch_data);
    for(int i=0;i<arch.get_resources_count();++i)
    {
        const char *res_name=arch.get_resource_name(i);
        if(!res_name)
            continue;

        const std::string n=std::string("pl2_out/")+name+"_"+res_name;
        debug_write_data(arch.access(res_name),n.c_str());
    }

    const std::string n=std::string("pl2_out/")+name+"_"+"attribute.txt";
    debug_write_data(arch.access_attribute(),n.c_str());

    arch.close_archieve();
}

int main(int argc, char **argv)
{
    //debug_extract_pl2("sc01.pl2");
    //debug_extract_pl2("sc01_res.pl2");
    //debug_extract_pl2("sc02_res.pl2");
    //debug_extract_pl2("sounds.pl2");
    //debug_extract_pl2("sc01sm.pl2");
    //return 0;

    const std::string log_file_name=std::string(nya_system::get_app_path())+"log.txt";
    nya_log::plain_file_log log;
    log.open(log_file_name.c_str());

    //nya_log::set_log(&log);

    nya_log::log()<<"npl2 started from path "<<nya_system::get_app_path()<<"\n";

    const std::string config_path=std::string(nya_system::get_app_path())+"npl2.cfg";
    nya_resources::resource_data *cfg=
    nya_resources::get_resources_provider().access(config_path.c_str());
    if(cfg)
    {
        get_config().load(cfg);
        cfg->release();
        nya_log::log()<<"config loaded, starting\n";
    }
    else
        nya_log::log()<<"unable to load config\n";

    npl2 app;
    app.set_title("Loading, please wait...");
    app.start_windowed(100,100,640,480,get_config().antialiasing);

    log.close();

    return 0;
}


text:
package com.gechen.keepwalking.kw.common.constants;

/**
 * Created by G-chen on 2015-5-13.
 */
public class BdColorType {
    public static final String GC_COLOR = "gcj02 ";
    public static final String BD_COLOR = "bd09";
    public static final String BD_11_COLOR = "bd09ll";
}


text:
package com.intellij.remoteServer.util;

import com.intellij.execution.process.ProcessHandler;
import com.intellij.remoteServer.agent.util.CloudAgentLoggingHandler;
import com.intellij.remoteServer.agent.util.log.LogListener;
import com.intellij.remoteServer.runtime.deployment.DeploymentLogManager;
import com.intellij.remoteServer.runtime.log.LoggingHandler;
import org.jetbrains.annotations.Nullable;

import java.io.OutputStream;
import java.util.HashMap;

/**
 * @author michael.golubev
 */
public class CloudLoggingHandlerImpl implements CloudAgentLoggingHandler {

  private final HashMap<String, LogListener> myPipeName2LogListener;

  private final LoggingHandler myMainLoggingHandler;

  private final DeploymentLogManager myLogManager;

  public CloudLoggingHandlerImpl(DeploymentLogManager logManager) {
    myMainLoggingHandler = logManager.getMainLoggingHandler();
    myPipeName2LogListener = new HashMap<String, LogListener>();
    myLogManager = logManager;
  }

  @Override
  public void println(String message) {
    myMainLoggingHandler.print(message + "\n");
  }

  @Override
  public LogListener getOrCreateLogListener(String pipeName) {
    LogListener logListener = myPipeName2LogListener.get(pipeName);
    if (logListener == null) {
      final LoggingHandler loggingHandler = myLogManager.addAdditionalLog(pipeName);
      logListener = new LogListenerImpl(loggingHandler);
      myPipeName2LogListener.put(pipeName, logListener);
    }
    return logListener;
  }

  @Override
  public LogListener getOrCreateEmptyLogListener(String pipeName) {
    LogListenerImpl result = (LogListenerImpl)getOrCreateLogListener(pipeName);
    result.clear();
    return result;
  }

  @Override
  public LogListener createConsole(String pipeName, final OutputStream consoleInput) {
    final LoggingHandler loggingHandler = myLogManager.addAdditionalLog(pipeName);
    loggingHandler.attachToProcess(new ProcessHandler() {

      @Override
      protected void destroyProcessImpl() {

      }

      @Override
      protected void detachProcessImpl() {

      }

      @Override
      public boolean detachIsDefault() {
        return false;
      }

      @Nullable
      @Override
      public OutputStream getProcessInput() {
        return consoleInput;
      }
    });

    return new LogListener() {

      @Override
      public void lineLogged(String line) {
        loggingHandler.print(line);
      }
    };
  }

  private static class LogListenerImpl implements LogListener {

    private final LoggingHandler myLoggingHandler;

    public LogListenerImpl(LoggingHandler loggingHandler) {
      myLoggingHandler = loggingHandler;
    }

    @Override
    public void lineLogged(String line) {
      myLoggingHandler.print(line + "\n");
    }

    public void clear() {
      myLoggingHandler.clear();
    }
  }
}


text:
// The MIT License (MIT)
//
// Copyright (c) 2015 Xamarin
//
// 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.
using Xamarin.Forms;
using XamarinCRM.ViewModels.Sales;
using XamarinCRM.Pages.Base;
using XamarinCRM.Statics;
using Xamarin;

namespace XamarinCRM.Pages.Sales
{
    public class LeadContactDetailPage : ModelBoundContentPage<LeadDetailViewModel>
    {
        // NOTE: the ViewModel is contained in the base class

        public LeadContactDetailPage()
        {
            #region roleEntry
            EntryCell roleEntryCell = new EntryCell()
            {
                Label = TextResources.Leads_LeadContactDetail_Role,
                    LabelColor = Palette._007,
                    Keyboard = Keyboard.Text
            };
            roleEntryCell.SetBinding(EntryCell.TextProperty, "Lead.JobTitle", BindingMode.TwoWay);
            #endregion

            #region firstNameEntry
            EntryCell firstNameEntryCell = new EntryCell()
            {
                    Label = TextResources.Leads_LeadContactDetail_FirstName,
                    Keyboard = Keyboard.Text
            };
            firstNameEntryCell.SetBinding(EntryCell.TextProperty, "Lead.FirstName", BindingMode.TwoWay);
            #endregion

            #region lastNameEntry
            EntryCell lastNameEntryCell = new EntryCell()
            {
                    Label = TextResources.Leads_LeadContactDetail_LastName,
                    Keyboard = Keyboard.Text
            };
            lastNameEntryCell.SetBinding(EntryCell.TextProperty, "Lead.LastName", BindingMode.TwoWay);
            #endregion

            #region phoneEntry
            EntryCell phoneEntryCell = new EntryCell()
            {
                Label = TextResources.Leads_LeadContactDetail_Phone,
                Keyboard = Keyboard.Telephone
            };
            phoneEntryCell.SetBinding(EntryCell.TextProperty, "Lead.Phone", BindingMode.TwoWay);
            #endregion

            #region emailEntry
            EntryCell emailEntryCell = new EntryCell()
            {
                Label = TextResources.Leads_LeadContactDetail_Email,
                Keyboard = Keyboard.Email
            };
            emailEntryCell.SetBinding(EntryCell.TextProperty, "Lead.Email", BindingMode.TwoWay);
            #endregion

            #region streetEntry
            EntryCell streetEntryCell = new EntryCell()
            {
                    Label = TextResources.Leads_LeadContactDetail_Address,
                    Keyboard = Keyboard.Text
            };
            streetEntryCell.SetBinding(EntryCell.TextProperty, "Lead.Street", BindingMode.TwoWay);
            #endregion

            #region postalCodeEntry
            EntryCell postalCodeEntryCell = new EntryCell()
            {
                Label = TextResources.Leads_LeadContactDetail_PostalCode,
                Keyboard = Keyboard.Numeric
            };
            postalCodeEntryCell.SetBinding(EntryCell.TextProperty, "Lead.PostalCode", BindingMode.TwoWay);
            #endregion

            #region cityEntry
            EntryCell cityEntryCell = new EntryCell()
            {
                    Label = TextResources.Leads_LeadContactDetail_City,
                    Keyboard = Keyboard.Text
            };
            cityEntryCell.SetBinding(EntryCell.TextProperty, "Lead.City", BindingMode.TwoWay);
            #endregion

            #region stateEntry
            EntryCell stateEntryCell = new EntryCell()
            {
                    Label = TextResources.Leads_LeadContactDetail_State,
                    Keyboard = Keyboard.Text
            };
            stateEntryCell.SetBinding(EntryCell.TextProperty, "Lead.State", BindingMode.TwoWay);
            #endregion

            #region countryEntry
            EntryCell countryEntryCell = new EntryCell()
            {
                    Label = TextResources.Leads_LeadContactDetail_Country,
                    Keyboard = Keyboard.Text
            };
            countryEntryCell.SetBinding(EntryCell.TextProperty, "Lead.Country", BindingMode.TwoWay);
            #endregion

            #region compose view hierarchy
            Content = new TableView()
            {
                Intent = TableIntent.Settings,
                Root = new TableRoot()
                {
                    new TableSection()
                    {
                        roleEntryCell,
                        firstNameEntryCell,
                        lastNameEntryCell
                    },
                    new TableSection()
                    {
                        phoneEntryCell,
                        emailEntryCell

                    },
                    new TableSection()
                    {
                        streetEntryCell,
                        postalCodeEntryCell,
                        cityEntryCell,
                        stateEntryCell,
                        countryEntryCell
                    }
                }
            };
            #endregion
        }

        protected override void OnAppearing()
        {
            base.OnAppearing();

            Insights.Track(InsightsReportingConstants.PAGE_LEADCONTACTDETAIL);
        }
    }
}


text:
<?php

namespace Aedart\Model\Contracts\Integers;

/**
 *
Delivered At Aware

 *
 * Component is aware of a int "delivered at" value, which can
 * also be specified.
 *
 * @author Alin Eugen Deac <aedart@gmail.com>
 * @package Aedart\Model\Contracts\Integers
 */
interface DeliveredAtAware
{
    /**
     * Set delivered at
     *
     * @param int|null $date Date of delivery
     *
     * @return self
     */
    public function setDeliveredAt(?int $date);

    /**
     * Get delivered at
     *
     * If no "delivered at" value has been set, this method will
     * set and return a default "delivered at" value,
     * if any such value is available
     *
     * @see getDefaultDeliveredAt()
     *
     * @return int|null delivered at or null if no delivered at has been set
     */
    public function getDeliveredAt() : ?int ;

    /**
     * Check if "delivered at" has been set
     *
     * @return bool True if "delivered at" has been set, false if not
     */
    public function hasDeliveredAt() : bool;

    /**
     * Get a default "delivered at" value, if any is available
     *
     * @return int|null Default "delivered at" value or null if no default value is available
     */
    public function getDefaultDeliveredAt() : ?int;
}


text:
package com.hazelcast.client.test;

import com.hazelcast.core.HazelcastInstance;
import com.hazelcast.core.HazelcastInstanceAware;
import com.hazelcast.core.HazelcastInstanceNotActiveException;
import com.hazelcast.core.Offloadable;
import com.hazelcast.internal.nearcache.impl.invalidation.Invalidator;
import com.hazelcast.internal.nearcache.impl.invalidation.MetaDataGenerator;
import com.hazelcast.internal.partition.InternalPartitionService;
import com.hazelcast.map.EntryProcessor;
import com.hazelcast.map.impl.MapService;
import com.hazelcast.map.impl.MapServiceContext;
import com.hazelcast.map.impl.nearcache.MapNearCacheManager;
import com.hazelcast.nio.ObjectDataInput;
import com.hazelcast.nio.ObjectDataOutput;
import com.hazelcast.nio.serialization.IdentifiedDataSerializable;
import com.hazelcast.spi.impl.NodeEngineImpl;
import com.hazelcast.internal.util.UuidUtil;

import java.io.IOException;
import java.util.Map;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.atomic.AtomicBoolean;

import static com.hazelcast.map.impl.MapService.SERVICE_NAME;
import static com.hazelcast.test.Accessors.getNodeEngineImpl;
import static com.hazelcast.internal.util.RandomPicker.getInt;
import static java.lang.Integer.MAX_VALUE;
import static java.util.concurrent.TimeUnit.MILLISECONDS;
import static java.util.concurrent.TimeUnit.NANOSECONDS;

public class DistortInvalidationMetadataEntryProcessor
        implements EntryProcessor<Integer, Integer, Object>, IdentifiedDataSerializable, HazelcastInstanceAware, Offloadable {

    static final int CLASS_ID = 3;

    private int mapSize;
    private String mapName;
    private int duration;
    private HazelcastInstance instance;

    public DistortInvalidationMetadataEntryProcessor() {
    }

    @Override
    public Object process(Map.Entry<Integer, Integer> entry) {
        final HazelcastInstance instance = this.instance;
        final AtomicBoolean stopTest = new AtomicBoolean();

        Thread distortSequence = new Thread(() -> {
            while (!stopTest.get()) {
                distortRandomPartitionSequence(mapName, instance);
                sleepSeconds(1);
            }
        });

        Thread distortUuid = new Thread(() -> {
            while (!stopTest.get()) {
                distortRandomPartitionUuid(instance);
                sleepSeconds(5);
            }
        });

        Thread put = new Thread(() -> {
            // change some data
            while (!stopTest.get()) {
                try {
                    int key = getInt(mapSize);
                    int value = getInt(Integer.MAX_VALUE);
                    Map<Integer, Integer> map = instance.getMap(mapName);
                    int oldValue = map.put(key, value);
                    sleepAtLeastMillis(100);
                } catch (HazelcastInstanceNotActiveException e) {
                    break;
                }
            }
        });

        put.start();
        distortSequence.start();
        distortUuid.start();

        sleepSeconds(duration);

        // stop threads
        stopTest.set(true);
        try {
            distortUuid.join();
            distortSequence.join();
            put.join();
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        for (int i = 0; i < mapSize; i++) {
            System.out.println(instance.getMap(mapName).get(i));
        }
        return null;
    }

    private void distortRandomPartitionSequence(String mapName, HazelcastInstance member) {
        NodeEngineImpl nodeEngineImpl = getNodeEngineImpl(member);
        MapService mapService = nodeEngineImpl.getService(SERVICE_NAME);
        MapServiceContext mapServiceContext = mapService.getMapServiceContext();
        MapNearCacheManager mapNearCacheManager = mapServiceContext.getMapNearCacheManager();
        Invalidator invalidator = mapNearCacheManager.getInvalidator();
        MetaDataGenerator metaDataGenerator = invalidator.getMetaDataGenerator();
        InternalPartitionService partitionService = nodeEngineImpl.getPartitionService();
        int partitionCount = partitionService.getPartitionCount();
        metaDataGenerator.setCurrentSequence(mapName, getInt(partitionCount), getInt(MAX_VALUE));
    }

    private void distortRandomPartitionUuid(HazelcastInstance member) {
        NodeEngineImpl nodeEngineImpl = getNodeEngineImpl(member);
        int partitionCount = nodeEngineImpl.getPartitionService().getPartitionCount();
        int partitionId = getInt(partitionCount);
        MapService mapService = nodeEngineImpl.getService(SERVICE_NAME);
        MapServiceContext mapServiceContext = mapService.getMapServiceContext();
        MapNearCacheManager mapNearCacheManager = mapServiceContext.getMapNearCacheManager();
        Invalidator invalidator = mapNearCacheManager.getInvalidator();
        MetaDataGenerator metaDataGenerator = invalidator.getMetaDataGenerator();

        metaDataGenerator.setUuid(partitionId, UuidUtil.newUnsecureUUID());
    }

    private void sleepSeconds(int seconds) {
        try {
            TimeUnit.SECONDS.sleep(seconds);
        } catch (InterruptedException e) {
            Thread.currentThread().interrupt();
        }
    }

    private void sleepAtLeastMillis(int sleepFor) {
        boolean interrupted = false;
        try {
            long remainingNanos = MILLISECONDS.toNanos(sleepFor);
            long sleepUntil = System.nanoTime() + remainingNanos;
            while (remainingNanos > 0) {
                try {
                    NANOSECONDS.sleep(remainingNanos);
                } catch (InterruptedException e) {
                    interrupted = true;
                } finally {
                    remainingNanos = sleepUntil - System.nanoTime();
                }
            }
        } finally {
            if (interrupted) {
                Thread.currentThread().interrupt();
            }
        }
    }

    @Override
    public int getFactoryId() {
        return IdentifiedFactory.FACTORY_ID;
    }

    @Override
    public int getClassId() {
        return CLASS_ID;
    }

    @Override
    public void writeData(ObjectDataOutput out) throws IOException {
        out.writeString(mapName);
        out.writeInt(mapSize);
        out.writeInt(duration);
    }

    @Override
    public void readData(ObjectDataInput in) throws IOException {
        mapName = in.readString();
        mapSize = in.readInt();
        duration = in.readInt();
    }

    @Override
    public void setHazelcastInstance(HazelcastInstance hazelcastInstance) {
        this.instance = hazelcastInstance;
    }

    @Override
    public String getExecutorName() {
        return OFFLOADABLE_EXECUTOR;
    }
}


text:
#ifndef _ORF_24_H_
#define _ORF_24_H_

#include <iostream>
#include <string>
#include <cstdio>
#include <wiringPi.h>
#include <wiringPiSPI.h>
#include "nRF24L01.h"

#define 	MOSI_PIN		12
#define 	SLCK_PIN		14

class ORF24
{
private:
	int ce;							/* CE pin number */
	int csn;						/* CSN pin number */
	int spiChannel;					/* Odroid SPI channel */
	int spiSpeed;					/* SPI clock frequency in Hz */
	int payloadSize;				/* nRF24L01 payload size */
	int ackPayloadAvailable;		/* Whether there is an ack payload waiting */
	bool ackPayloadLength;			/* Dynamic size of pending ack payload */
	bool dynamicPayloadAvailable;	/* Whether dynamic payload are enabled */
	bool debug = false;				/* Debug flag */
	unsigned char buffer[32];		/* RX and TX buffer */
	unsigned char *pipe0ReadingAddress;

protected:

	/**
	 * Read one byte from nRF24L01 register
	 *
	 * @param  	reg 	register address
	 * @return     		read register value
	 */
	unsigned char readRegister(unsigned char reg);

	/**
	 * Read multibyte from nRF24L01 register
	 *
	 * @param  	reg 	register address
	 * @param 	buf 	read buffer
	 * @param 	len 	data length to read
	 * @return     		read register value
	 */
	unsigned char readRegister(unsigned char reg, unsigned char *buf, int len);

	/**
	 * Write one byte to nRF24L01 register
	 *
	 * @param  reg   	register address
	 * @param  value 	value to write
	 * @return       	nRF24L01 status
	 */
	unsigned char writeRegister(unsigned char reg, unsigned char value);

	/**
	 * Write multibyte to nRF24L01 register
	 *
	 * @param  reg   	register address
	 * @param  buf 		write buffer
	 * @param  len 		data length to write
	 * @return       	nRF24L01 status
	 */
	unsigned char writeRegister(unsigned char reg, const unsigned char *buf, int len);

	/**
	 * Write payload to send
	 *
	 * @param  data 	data to send
	 * @param  len  	data length in byte
	 * @return      	nRF24L01 status
	 */
	unsigned char writePayload(unsigned char *data, int len);

	/**
	 * Read received payload
	 *
	 * @param  data 	data buffer to read into
	 * @param  len  	data length
	 * @return     		nRF24L01 status
	 */
	unsigned char readPayload(unsigned char *data, int len);

	/**
	 * Flush RX FIFO
	 *
	 * @return  status
	 */
	unsigned char flushRX(void);

	/**
	 * Flush TX FIFO
	 *
	 * @return  status
	 */
	unsigned char flushTX(void);

	/**
	 * Get RF status register
	 *
	 * @return  status register
	 */
	unsigned char getStatus(void);

	/**
	 * Print register value
	 *
	 * @param  name 	register name
	 * @param  reg 		register address
	 */
	void printRegister(std::string name, unsigned char reg);

	/**
	 * Print address register
	 *
	 * @param  name 	register name
	 * @param  reg 		register address
	 */
	void printAddressRegister(std::string name, unsigned char reg);

	/**
	 * Print address register as string
	 *
	 * @param  name 	register name
	 * @param  reg 		register address
	 * @param  str 		print as string
	 */
	void printAddressRegister(std::string name, unsigned char reg, bool str);

	/**
	 * Print all register value
	 */
	void printAllRegister(void);

public:

	/**
	 * ORF24 Constructor
	 */
	ORF24(int _ce);

	/**
	 * ORF24 Constructor with SPI options
	 */
	ORF24(int _ce, int _spiChannel, int spiSpeed);

	/**
	 * nRF24L01 Initialization
	 *
	 * @return  status
	 */
	bool begin(void);

	/**
	 * Write payload to open writing pipe
	 *
	 * @param  data 	data to write
	 * @param  len  	data length
	 * @return      	status
	 */
	bool write(unsigned char *data, int len);

	/**
	 * Start writing payload
	 *
	 * @param data 	data to write
	 * @param len  	data length
	 */
	void startWrite(unsigned char *data, int len);

	/**
	 * Set delay and number of retry for retransmission
	 *
	 * @param delay 	retransmission delay
	 * @param count 	retransmission count
	 */
	void setRetries(int delay, int count);

	/**
	 * Set RF channel
	 *
	 * @param channel 	channel number
	 */
	void setChannel(int channel);

	/**
	 * Set payload size
	 *
	 * @param size 	payload size
	 */
	void setPayloadSize(int size);

	/**
	 * Set power level
	 *
	 * @param level 	power level
	 */
	void setPowerLevel(RFPower level);

	/**
	 * Set air data rate
	 *
	 * @param rate 		data rate
	 */
	void setDataRate(DataRate rate);

	/**
	 * Set CRC length
	 *
	 * @param length 	CRC length
	 */
	void setCRCLength(CRCLength length);

	/**
	 * Set auto acknowledgment
	 *
	 * @param enable 	enable or disable auto acknowledgment
	 */
	void setAutoACK(bool enable);

	/**
	 * Set auto acknowledgment
	 *
	 * @param pipe   	pipe number
	 * @param enable 	enable or disable auto acknowledgment
	 */
	void setAutoACK(int pipe, bool enable);

	/**
	 * Set nRF24L01 to standby mode
	 */
	void powerUp(void);

	/**
	 * Set nRF24L01 to power down mode
	 */
	void powerDown(void);

	/**
	 * Open writing pipe
	 *
	 * @param address 	pipe address
	 */
	void openWritingPipe(const char *address);

	/**
	 * Open reading pipe
	 *
	 * @param number  	pipe number
	 * @param address 	pipe address
	 */
	void openReadingPipe(int pipe, const char *address);

	/**
	 * Enable debugging information
	 */
	void enableDebug(void);

};

#endif


text:
enum
{
  LIST_ITEM = 0,
  N_COLUMNS
};

GtkWidget *list;

static void
append_item(GtkWidget *widget, gpointer entry)
{
  GtkListStore *store;
  GtkTreeIter  iter;

  const char *str = gtk_entry_get_text((GtkEntry*)entry);

  store = GTK_LIST_STORE(gtk_tree_view_get_model(
       GTK_TREE_VIEW(list)));

  gtk_list_store_append(store, &iter);
  gtk_list_store_set(store, &iter, LIST_ITEM, str, -1);
}

static void
remove_item(GtkWidget *widget, gpointer selection)
{
  GtkListStore *store;
  GtkTreeModel *model;
  GtkTreeIter  iter;

  store = GTK_LIST_STORE(gtk_tree_view_get_model(
      GTK_TREE_VIEW (list)));
  model = gtk_tree_view_get_model (GTK_TREE_VIEW (list));

  if (gtk_tree_model_get_iter_first(model, &iter) == FALSE)
      return;

  if (gtk_tree_selection_get_selected(GTK_TREE_SELECTION(selection),
      &model, &iter)) {
    gtk_list_store_remove(store, &iter);
  }
}

static void
remove_all(GtkWidget *widget, gpointer selection)
{
  GtkListStore *store;
  GtkTreeModel *model;
  GtkTreeIter  iter;

  store = GTK_LIST_STORE(gtk_tree_view_get_model(
      GTK_TREE_VIEW (list)));
  model = gtk_tree_view_get_model (GTK_TREE_VIEW (list));

  if (gtk_tree_model_get_iter_first(model, &iter) == FALSE)
      return;
  gtk_list_store_clear(store);
}

static void
init_list(GtkWidget *list)
{

  GtkCellRenderer    *renderer;
  GtkTreeViewColumn  *column;
  GtkListStore       *store;

  renderer = gtk_cell_renderer_text_new();
  column = gtk_tree_view_column_new_with_attributes("List Item",
          renderer, "text", LIST_ITEM, NULL);
  gtk_tree_view_append_column(GTK_TREE_VIEW (list), column);

  store = gtk_list_store_new (N_COLUMNS, G_TYPE_STRING);

  gtk_tree_view_set_model(GTK_TREE_VIEW (list),
      GTK_TREE_MODEL(store));

  g_object_unref(store);
}

int main (int argc, char *argv[])
{

  GtkWidget *window;
  GtkWidget *sw;

  GtkWidget *remove;
  GtkWidget *add;
  GtkWidget *removeAll;
  GtkWidget *entry;

  GtkWidget *vbox;
  GtkWidget *hbox;

  GtkTreeSelection *selection;

  gtk_init(&argc, &argv);

  window = gtk_window_new(GTK_WINDOW_TOPLEVEL);
  sw = gtk_scrolled_window_new(NULL, NULL);
  list = gtk_tree_view_new();

  gtk_window_set_title (GTK_WINDOW (window), "List View");
  gtk_window_set_position(GTK_WINDOW(window), GTK_WIN_POS_CENTER);
  gtk_container_set_border_width (GTK_CONTAINER (window), 10);
  gtk_widget_set_size_request (window, 370, 270);

  gtk_scrolled_window_set_policy (GTK_SCROLLED_WINDOW(sw),
            GTK_POLICY_AUTOMATIC, GTK_POLICY_AUTOMATIC);

  gtk_scrolled_window_set_shadow_type (GTK_SCROLLED_WINDOW(sw),
            GTK_SHADOW_ETCHED_IN);

  gtk_tree_view_set_headers_visible (GTK_TREE_VIEW (list), FALSE);

  vbox = gtk_vbox_new(FALSE, 0);

  gtk_box_pack_start(GTK_BOX(vbox), sw, TRUE, TRUE, 5);

  hbox = gtk_hbox_new(TRUE, 5);

  add = gtk_button_new_with_label("Add");
  remove = gtk_button_new_with_label("Remove");
  removeAll = gtk_button_new_with_label("Remove All");
  entry = gtk_entry_new();

  gtk_box_pack_start(GTK_BOX(hbox), add, FALSE, TRUE, 3);
  gtk_box_pack_start(GTK_BOX(hbox), entry, FALSE, TRUE, 3);
  gtk_box_pack_start(GTK_BOX(hbox), remove, FALSE, TRUE, 3);
  gtk_box_pack_start(GTK_BOX(hbox), removeAll, FALSE, TRUE, 3);

  gtk_box_pack_start(GTK_BOX(vbox), hbox, FALSE, TRUE, 3);

  gtk_container_add(GTK_CONTAINER (sw), list);
  gtk_container_add(GTK_CONTAINER (window), vbox);

  init_list(list);

  selection  = gtk_tree_view_get_selection(GTK_TREE_VIEW(list));

  g_signal_connect(G_OBJECT(add), "clicked",
          G_CALLBACK(append_item), entry);

  g_signal_connect(G_OBJECT(remove), "clicked",
          G_CALLBACK(remove_item), selection);

  g_signal_connect(G_OBJECT(removeAll), "clicked",
          G_CALLBACK(remove_all), selection);

  g_signal_connect (G_OBJECT (window), "destroy",
          G_CALLBACK(gtk_main_quit), NULL);

  gtk_widget_show_all(window);

  gtk_main ();

  return 0;
}


text:
package ca.ualberta.physics.cssdp.file.remote;

import java.util.List;
import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.ConcurrentMap;
import java.util.concurrent.CopyOnWriteArraySet;
import java.util.concurrent.TimeUnit;

import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

import ca.ualberta.physics.cssdp.configuration.InjectorHolder;
import ca.ualberta.physics.cssdp.dao.EntityManagerProvider;
import ca.ualberta.physics.cssdp.domain.file.Host;
import ca.ualberta.physics.cssdp.file.dao.HostEntryDao;
import ca.ualberta.physics.cssdp.file.remote.command.RemoteServerCommand;
import ca.ualberta.physics.cssdp.file.remote.protocol.RemoteConnection;
import ca.ualberta.physics.cssdp.service.ManualTransaction;
import ca.ualberta.physics.cssdp.service.ServiceResponse;

import com.google.common.base.Throwables;
import com.google.inject.Inject;

/**
 * Handles communication
 *
 */
public class RemoteServersImpl implements RemoteServers {

	private static final Logger logger = LoggerFactory
			.getLogger(RemoteServersImpl.class);

	@Inject
	private HostEntryDao hostEntryDao;

	@Inject
	private EntityManagerProvider emp;

	private final ConcurrentMap<String, BlockingQueue<RemoteConnection>> connectionPools = new ConcurrentHashMap<String, BlockingQueue<RemoteConnection>>();

	private final BlockingQueue<RemoteServerCommand<?>> backlog = new ArrayBlockingQueue<RemoteServerCommand<?>>(
			5000);

	private final CopyOnWriteArraySet<RemoteServerCommand<?>> currentRequests = new CopyOnWriteArraySet<RemoteServerCommand<?>>();

	public RemoteServersImpl() {

		InjectorHolder.inject(this);

		ServiceResponse<Void> sr = new ServiceResponse<Void>();
		new ManualTransaction(sr, emp.get()) {

			@Override
			public void doInTransaction() {
				// initialize the existing hosts in this remove server object
				List<Host> hostEntries = hostEntryDao.list();

				for (Host hostEntry : hostEntries) {
					add(hostEntry);
				}

			}

			@Override
			public void onError(Exception e, ServiceResponse<?> sr) {
				sr.error("Failed to initialize remote servers: " + e.getMessage());
			}

		};

		if(!sr.isRequestOk()) {
			logger.error(sr.getMessagesAsStrings());
		}

	}

	@Override
	public void requestOperation(RemoteServerCommand<?> command) {

		if(!currentRequests.contains(command)) {

			currentRequests.add(command);

			// verify the remove servers are configured with the host in the command
			if (connectionPools.containsKey(command.getHostname()) == false) {
				throw new IllegalArgumentException(
						"Remote Servers needs to be configured with "
								+ command.getHostname()
								+ " before this action can be performend.  Add the host and then retry the operation.");
			}

			try {
				this.backlog.offer(command, 30, TimeUnit.SECONDS);

			} catch (InterruptedException e) {
				throw new RuntimeException(
						"File Service is too busy, please try again soon.");
			}
		}

	}

	@Override
	public void run() {

		logger.info("Starting Remote Server Proxy thread");

		try {

			while (true) {

				RemoteServerCommand<?> command = backlog.take();

				BlockingQueue<RemoteConnection> connectionPool = connectionPools
						.get(command.getHostname());

				if (connectionPool == null) {
					command.error("Host has not been configured in RemoteServers yet.  Add and retry.");
					command.setDone(true);
				} else {

					RemoteConnection conn = connectionPool.poll(1,
							TimeUnit.MINUTES);

					if (conn != null) {

						logger.info("Got a connection for "
								+ command.getHostname() + " to run command "
								+ command.getClass().getSimpleName());

						Thread commandRunner = new Thread(new CommandRunner(
								conn, command));
						commandRunner.start();

					} else {
						logger.warn(command.getHostname()
								+ " is too busy, no available "
								+ "connections at this time.  Try again later.");
					}
				}
			}

		} catch (InterruptedException e) {
			Thread.currentThread().interrupt();
			logger.info("I've been interrupted");
		} catch (Exception e) {
			logger.error(Throwables.getStackTraceAsString(Throwables
					.getRootCause(e)));
		}

	}

	private void returnConnection(String hostname, RemoteConnection conn) {
		if (conn == null) {
			throw new IllegalStateException(
					"Can't add a null connection back to the pool!");
		}
		BlockingQueue<RemoteConnection> connectionPool = connectionPools
				.get(hostname);
		connectionPool.offer(conn);
	}

	private class CommandRunner implements Runnable {

		private final RemoteConnection connection;
		private final RemoteServerCommand<?> command;

		public CommandRunner(RemoteConnection connection,
				RemoteServerCommand<?> command) {
			this.connection = connection;
			this.command = command;
		}

		public void run() {
			try {
				logger.info("Starting command " + command.getClass().getSimpleName() + " with " + command.getHostname());
				command.execute(connection);
			} finally {
				currentRequests.remove(command);
				returnConnection(command.getHostname(), connection);
				logger.info("Finished command " + command.getClass().getSimpleName() + " with " + command.getHostname());
			}
		}

	}

	@Override
	public void remove(Host host) {

		ArrayBlockingQueue<RemoteConnection> connectionPool = (ArrayBlockingQueue<RemoteConnection>) connectionPools
				.remove(host.getHostname());
		connectionPool.clear();

	}

	@Override
	public boolean contains(Host hostEntry) {
		return connectionPools.containsKey(hostEntry.getHostname());
	}

	@Override
	public void add(Host hostEntry) {

		ArrayBlockingQueue<RemoteConnection> connectionPool = new ArrayBlockingQueue<RemoteConnection>(
				hostEntry.getMaxConnections());

		logger.info("Initializing connection pool for " + hostEntry
				+ ". Max connections = " + hostEntry.getMaxConnections());

		for (int i = 0; i < hostEntry.getMaxConnections(); i++) {
			connectionPool.add(RemoteConnection.newInstance(hostEntry));
		}
		connectionPools.putIfAbsent(hostEntry.getHostname(), connectionPool);

	}

}


text:
ExpoSE is a dynamic symbolic execution engine for JavaScript, developed at Royal Holloway, University of London by [Blake Loring](https://www.parsed.uk), Duncan Mitchell, and [Johannes Kinder](https://www.unibw.de/patch) (now at [Bundeswehr University Munich](https://www.unibw.de/)).
ExpoSE supports symbolic execution of Node.js programs and JavaScript in the browser. ExpoSE is based on Jalangi2 and the Z3 SMT solver.

### Requirements

Requires `node` version v14.16.1 (other versions may work but are not tested), `npm`, `clang` (with `clang++`), `gnuplot` (for coverage graphs), `make`, `python2` (as python in path). On Ubuntu, since python2 has been removed by default I found that you may need to install python3-distutils.

`mitmproxy` (Depends libxml2-dev, libxslt-dev, libssl-dev) is required for electron analysis.

### Installation

Execute `npm install` inside the ExpoSE directory for a clean installation.

### ExpoSE GUI

In most cases you want to start by running the ExpoSE dashboard. The GUI provides detailed test case information, easy replay, and coverage graphs. Start the ExpoSE dashboard with

```sh
$ npm start
```

### ExpoSE CLI

Alternatively, you can invoke ExpoSE directly via the `expoSE` command line interface.

Example:

```sh
$ expoSE ./tests/numbers/infoflow
```

Valid Options:

* `replay`     - Replay a test case with a specific input.
* `ahg`        - Automatically generate a generic test harness for a specified NPM library.

### ExpoSE Browser Support

There is limited support for symbolic execution of webpages through a custom Electron based web browser. To execute ExpoSE on a website you use the same arguments as the CLI. Note: This also requires python3 and a modern version of mitmproxy to function correctly.

```sh
$ expoSE "https://google.com"
```

### Configuration

ExpoSE is configured via environment variables. All work both with the ExpoSE GUI and ExpoSE CLI. Typically these can be set from a terminal by writing a command such as

```sh
$ EXPOSE_LOG_LEVEL=1 expoSE target/hello.js
```

* `EXPOSE_MAX_TIME`         - The time (in milliseconds) to limit the total execution
* `EXPOSE_TEST_TIMEOUT`     - The time (in milliseconds) a test case can run for before being timed out
* `EXPOSE_PRINT_COVERAGE`   - Print out the files checked by an analysis and show the lines which where explored by the analyzer
* `EXPOSE_PRINT_PATHS`      - Print the output of each test case to stdout
* `EXPOSE_LOG_LEVEL`        - Level from 0 (None) to 3 (High)
* `EXPOSE_MAX_CONCURRENT`   - The maximum number of test cases that can run concurrently
* `RECOMPILE`               - Force ExpoSE to rebuild before executing scripts

NOTE: To improve performance logging instructions are removed from the output at compile time and so will not be updated if `NO_COMPILE` is set.

### Publications

* Blake Loring, Duncan Mitchell, and Johannes Kinder. [Sound Regular Expression Semantics for Dynamic Symbolic Execution of JavaScript](https://www.unibw.de/patch/papers/pldi19-regex.pdf). In _Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation (PLDI)_, pp. 425–438, ACM, 2019.
* Blake Loring, Duncan Mitchell, and Johannes Kinder. [ExpoSE: Practical Symbolic Execution of Standalone JavaScript](https://www.unibw.de/patch/papers/spin17-expose.pdf). In _Proc. Int. SPIN Symp. Model Checking of Software (SPIN)_, pp. 196–199, ACM, 2017.


text:
Setup based on [Ryan Bates dotfiles](https://github.com/ryanb/dotfiles).

## Installation
Run these commands in the terminal.
```terminal
git clone git://github.com/hrother/dotfiles ~/.dotfiles
cd ~/.dotfiles
rake install
```

Vim plugins are managed by [vundle](https://github.com/gmarik/Vundle.vim). Install it!

```terminal
git clone https://github.com/gmarik/vundle.git ~/.vim/bundle/vundle
```
In Vim run

```vim
:PluginInstall
```


text:
  Monpezat est
       un village
       géographiquement positionné dans le département des Pyrénées-Atlantiques en Aquitaine. On dénombrait 87 habitants en 2008.

Le parc d'habitations, à Monpezat, était réparti en 2011 en deux appartements et 43 maisons soit
 un marché plutôt équilibré.

À proximité de Monpezat sont localisées les villes de
Arricau-Bordes située à 5 km, 106 habitants,
Arrosès à 5 km, 149 habitants,
Crouseilles à 2 km, 152 habitants,
Castillon(Canton de Lembeye) localisée à 5 km, 78 habitants,
Séméacq-Blachon localisée à 3 km, 169 habitants,
Bassillon-Vauzé située à 5 km, 73 habitants,
 entre autres. De plus, Monpezat est située à seulement 27 km de Aire-sur-l'Adour.

Si vous pensez emmenager à Monpezat, vous pourrez aisément trouver une maison à vendre.


text:
/*
The Grandest Staircase Of Them All
==================================
With her LAMBCHOP doomsday device finished, Commander Lambda is preparing for her debut on the galactic stage - but in order
to make a grand entrance, she needs a grand staircase! As her personal assistant, you've been tasked with figuring out how
to build the best staircase EVER.

Lambda has given you an overview of the types of bricks available, plus a budget. You can buy different amounts of the
different types of bricks (for example, 3 little pink bricks, or 5 blue lace bricks). Commander Lambda wants to know
how many different types of staircases can be built with each amount of bricks, so she can pick the one with the most options.

Each type of staircase should consist of 2 or more steps.  No two steps are allowed to be at the same height - each step
must be lower than the previous one. All steps must contain at least one brick. A step's height is classified as the total
amount of bricks that make up that step.

For example, when N = 3, you have only 1 choice of how to build the staircase, with the first step having a height of 2 and
the second step having a height of 1: (# indicates a brick)

#
##
21
When N = 4, you still only have 1 staircase choice:
#
#
##
31

But when N = 5, there are two ways you can build a staircase from the given bricks.
The two staircases can have heights (4, 1) or (3, 2), as shown below:
#
#
#
##
41
#
##
##
32
Write a function called answer(n) that takes a positive integer n and returns the number of different staircases that can
be built from exactly n bricks. n will always be at least 3 (so you can have a staircase at all), but no more than 200,
because Commander Lambda's not made of money!

Languages
=========
To provide a Python solution, edit solution.py
To provide a Java solution, edit solution.java
Test cases
==========
Inputs:
    (int) n = 3
Output:
    (int) 1
Inputs:
    (int) n = 200
Output:
    (int) 487067745
Use verify [file] to test your solution and see how it does. When you are finished editing your code, use submit [file] to submit your answer. If your solution passes the test cases, it will be removed from your home folder.
*/