text:
<?xml version='1.0' encoding='UTF-8' standalone='no'?>
<doxygen xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:noNamespaceSchemaLocation="compound.xsd" version="1.8.6">
  <compounddef id="hull__graham__andrew_8hpp" kind="file">
    <compoundname>hull_graham_andrew.hpp</compoundname>
    <includes local="no">cstddef</includes>
    <includes local="no">algorithm</includes>
    <includes local="no">vector</includes>
    <includes local="no">boost/range.hpp</includes>
    <includes refid="assert_8hpp" local="no">boost/geometry/core/assert.hpp</includes>
    <includes refid="cs_8hpp" local="no">boost/geometry/core/cs.hpp</includes>
    <includes refid="point__type_8hpp" local="no">boost/geometry/core/point_type.hpp</includes>
    <includes refid="strategies_2convex__hull_8hpp" local="no">boost/geometry/strategies/convex_hull.hpp</includes>
    <includes local="no">boost/geometry/views/detail/range_type.hpp</includes>
    <includes refid="policies_2compare_8hpp" local="no">boost/geometry/policies/compare.hpp</includes>
    <includes refid="for__each__range_8hpp" local="no">boost/geometry/algorithms/detail/for_each_range.hpp</includes>
    <includes refid="reversible__view_8hpp" local="no">boost/geometry/views/reversible_view.hpp</includes>
    <includedby refid="strategies_8hpp" local="no">/home/travis/build/boostorg/boost/boost/geometry/strategies/strategies.hpp</includedby>
    <incdepgraph>
      <node id="58477">
        boost/geometry/util/math.hpp
        <link refid="math_8hpp"/>
        <childnode refid="58478" relation="include">
        </childnode>
        <childnode refid="58479" relation="include">
        </childnode>
        <childnode refid="58480" relation="include">
        </childnode>
        <childnode refid="58481" relation="include">
        </childnode>
        <childnode refid="58482" relation="include">
        </childnode>
        <childnode refid="58483" relation="include">
        </childnode>
        <childnode refid="58484" relation="include">
        </childnode>
        <childnode refid="58476" relation="include">
        </childnode>
        <childnode refid="58453" relation="include">
        </childnode>
        <childnode refid="58485" relation="include">
        </childnode>
      </node>
      <node id="58518">
        boost/geometry/core/interior_type.hpp
        <link refid="interior__type_8hpp"/>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58461" relation="include">
        </childnode>
        <childnode refid="58462" relation="include">
        </childnode>
        <childnode refid="58459" relation="include">
        </childnode>
        <childnode refid="58463" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
      </node>
      <node id="58459">
        boost/type_traits/remove_const.hpp
      </node>
      <node id="58502">
        boost/geometry/geometries/concepts/box_concept.hpp
        <link refid="box__concept_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58503" relation="include">
        </childnode>
        <childnode refid="58505" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
      </node>
      <node id="58473">
        functional
      </node>
      <node id="58564">
        boost/version.hpp
      </node>
      <node id="58479">
        limits
      </node>
      <node id="58507">
        boost/geometry/geometries/concepts/linestring_concept.hpp
        <link refid="linestring__concept_8hpp"/>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58508" relation="include">
        </childnode>
        <childnode refid="58459" relation="include">
        </childnode>
        <childnode refid="58503" relation="include">
        </childnode>
        <childnode refid="58509" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
        <childnode refid="58510" relation="include">
        </childnode>
      </node>
      <node id="58536">
        boost/range/empty.hpp
      </node>
      <node id="58481">
        boost/math/constants/constants.hpp
      </node>
      <node id="58531">
        iterator
      </node>
      <node id="58512">
        boost/range/metafunctions.hpp
      </node>
      <node id="58535">
        boost/range/end.hpp
      </node>
      <node id="58560">
        boost/iterator/iterator_facade.hpp
      </node>
      <node id="58495">
        boost/concept_check.hpp
      </node>
      <node id="58550">
        boost/type_traits/is_array.hpp
      </node>
      <node id="58538">
        boost/range/iterator.hpp
      </node>
      <node id="58462">
        boost/type_traits/is_const.hpp
      </node>
      <node id="58552">
        boost/geometry/core/closure.hpp
        <link refid="closure_8hpp"/>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58553" relation="include">
        </childnode>
        <childnode refid="58458" relation="include">
        </childnode>
        <childnode refid="58460" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58466" relation="include">
        </childnode>
      </node>
      <node id="58487">
        boost/geometry/algorithms/detail/for_each_range.hpp
        <link refid="for__each__range_8hpp"/>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58488" relation="include">
        </childnode>
        <childnode refid="58450" relation="include">
        </childnode>
        <childnode refid="58462" relation="include">
        </childnode>
        <childnode refid="58459" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58489" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58491" relation="include">
        </childnode>
        <childnode refid="58492" relation="include">
        </childnode>
      </node>
      <node id="58558">
        boost/geometry/iterators/closing_iterator.hpp
        <link refid="closing__iterator_8hpp"/>
        <childnode refid="58450" relation="include">
        </childnode>
        <childnode refid="58559" relation="include">
        </childnode>
        <childnode refid="58560" relation="include">
        </childnode>
        <childnode refid="58561" relation="include">
        </childnode>
      </node>
      <node id="58503">
        boost/geometry/core/access.hpp
        <link refid="access_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58480" relation="include">
        </childnode>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58504" relation="include">
        </childnode>
        <childnode refid="58467" relation="include">
        </childnode>
        <childnode refid="58474" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58466" relation="include">
        </childnode>
      </node>
      <node id="58451">
        boost/geometry/core/assert.hpp
        <link refid="assert_8hpp"/>
        <childnode refid="58452" relation="include">
        </childnode>
      </node>
      <node id="58549">
        boost/geometry/algorithms/convert.hpp
        <link refid="convert_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58483" relation="include">
        </childnode>
        <childnode refid="58450" relation="include">
        </childnode>
        <childnode refid="58550" relation="include">
        </childnode>
        <childnode refid="58463" relation="include">
        </childnode>
        <childnode refid="58497" relation="include">
        </childnode>
        <childnode refid="58498" relation="include">
        </childnode>
        <childnode refid="58499" relation="include">
        </childnode>
        <childnode refid="58524" relation="include">
        </childnode>
        <childnode refid="58521" relation="include">
        </childnode>
        <childnode refid="58527" relation="include">
        </childnode>
        <childnode refid="58547" relation="include">
        </childnode>
        <childnode refid="58551" relation="include">
        </childnode>
        <childnode refid="58523" relation="include">
        </childnode>
        <childnode refid="58500" relation="include">
        </childnode>
        <childnode refid="58548" relation="include">
        </childnode>
        <childnode refid="58544" relation="include">
        </childnode>
        <childnode refid="58556" relation="include">
        </childnode>
        <childnode refid="58543" relation="include">
        </childnode>
        <childnode refid="58557" relation="include">
        </childnode>
        <childnode refid="58563" relation="include">
        </childnode>
        <childnode refid="58530" relation="include">
        </childnode>
        <childnode refid="58453" relation="include">
        </childnode>
        <childnode refid="58552" relation="include">
        </childnode>
        <childnode refid="58566" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58501" relation="include">
        </childnode>
      </node>
      <node id="58528">
        boost/geometry/algorithms/num_interior_rings.hpp
        <link refid="num__interior__rings_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58450" relation="include">
        </childnode>
        <childnode refid="58497" relation="include">
        </childnode>
        <childnode refid="58498" relation="include">
        </childnode>
        <childnode refid="58499" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58517" relation="include">
        </childnode>
        <childnode refid="58529" relation="include">
        </childnode>
        <childnode refid="58501" relation="include">
        </childnode>
      </node>
      <node id="58499">
        boost/variant/variant_fwd.hpp
      </node>
      <node id="58478">
        cmath
      </node>
      <node id="58534">
        boost/range/begin.hpp
      </node>
      <node id="58461">
        boost/mpl/if.hpp
      </node>
      <node id="58537">
        boost/range/difference_type.hpp
      </node>
      <node id="58506">
        boost/static_assert.hpp
      </node>
      <node id="58530">
        boost/geometry/util/range.hpp
        <link refid="util_2range_8hpp"/>
        <childnode refid="58448" relation="include">
        </childnode>
        <childnode refid="58531" relation="include">
        </childnode>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58532" relation="include">
        </childnode>
        <childnode refid="58533" relation="include">
        </childnode>
        <childnode refid="58508" relation="include">
        </childnode>
        <childnode refid="58534" relation="include">
        </childnode>
        <childnode refid="58535" relation="include">
        </childnode>
        <childnode refid="58536" relation="include">
        </childnode>
        <childnode refid="58537" relation="include">
        </childnode>
        <childnode refid="58538" relation="include">
        </childnode>
        <childnode refid="58539" relation="include">
        </childnode>
        <childnode refid="58540" relation="include">
        </childnode>
        <childnode refid="58541" relation="include">
        </childnode>
        <childnode refid="58458" relation="include">
        </childnode>
        <childnode refid="58542" relation="include">
        </childnode>
        <childnode refid="58451" relation="include">
        </childnode>
        <childnode refid="58509" relation="include">
        </childnode>
      </node>
      <node id="58504">
        boost/type_traits/is_pointer.hpp
      </node>
      <node id="58500">
        boost/geometry/algorithms/detail/assign_box_corners.hpp
        <link refid="assign__box__corners_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58501" relation="include">
        </childnode>
        <childnode refid="58523" relation="include">
        </childnode>
        <childnode refid="58530" relation="include">
        </childnode>
      </node>
      <node id="58482">
        boost/math/special_functions/fpclassify.hpp
      </node>
      <node id="58474">
        boost/geometry/core/coordinate_type.hpp
        <link refid="coordinate__type_8hpp"/>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58466" relation="include">
        </childnode>
        <childnode refid="58475" relation="include">
        </childnode>
      </node>
      <node id="58454">
        boost/mpl/assert.hpp
      </node>
      <node id="58529">
        boost/geometry/algorithms/detail/counting.hpp
        <link refid="counting_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58450" relation="include">
        </childnode>
        <childnode refid="58516" relation="include">
        </childnode>
        <childnode refid="58517" relation="include">
        </childnode>
        <childnode refid="58530" relation="include">
        </childnode>
        <childnode refid="58543" relation="include">
        </childnode>
      </node>
      <node id="58511">
        boost/geometry/geometries/concepts/multi_point_concept.hpp
        <link refid="multi__point__concept_8hpp"/>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58508" relation="include">
        </childnode>
        <childnode refid="58512" relation="include">
        </childnode>
        <childnode refid="58510" relation="include">
        </childnode>
      </node>
      <node id="58554">
        boost/geometry/geometries/segment.hpp
        <link refid="geometries_2segment_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58555" relation="include">
        </childnode>
        <childnode refid="58461" relation="include">
        </childnode>
        <childnode refid="58462" relation="include">
        </childnode>
        <childnode refid="58510" relation="include">
        </childnode>
      </node>
      <node id="58472">
        boost/geometry/strategies/compare.hpp
        <link refid="strategies_2compare_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58473" relation="include">
        </childnode>
        <childnode refid="58461" relation="include">
        </childnode>
        <childnode refid="58453" relation="include">
        </childnode>
        <childnode refid="58474" relation="include">
        </childnode>
        <childnode refid="58469" relation="include">
        </childnode>
      </node>
      <node id="58463">
        boost/type_traits/remove_reference.hpp
      </node>
      <node id="58456">
        boost/geometry/core/coordinate_system.hpp
        <link refid="coordinate__system_8hpp"/>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
        <childnode refid="58466" relation="include">
        </childnode>
      </node>
      <node id="58480">
        boost/core/ignore_unused.hpp
      </node>
      <node id="58475">
        boost/geometry/util/promote_floating_point.hpp
        <link refid="promote__floating__point_8hpp"/>
        <childnode refid="58461" relation="include">
        </childnode>
        <childnode refid="58476" relation="include">
        </childnode>
      </node>
      <node id="58471">
        boost/geometry/policies/compare.hpp
        <link refid="policies_2compare_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58472" relation="include">
        </childnode>
        <childnode refid="58477" relation="include">
        </childnode>
      </node>
      <node id="58465">
        boost/geometry/core/tags.hpp
        <link refid="core_2tags_8hpp"/>
      </node>
      <node id="58470">
        boost/geometry/views/detail/range_type.hpp
      </node>
      <node id="58455">
        boost/type_traits/integral_constant.hpp
      </node>
      <node id="58553">
        boost/mpl/size_t.hpp
      </node>
      <node id="58452">
        boost/assert.hpp
      </node>
      <node id="58508">
        boost/range/concepts.hpp
      </node>
      <node id="58540">
        boost/range/reference.hpp
      </node>
      <node id="58491">
        boost/geometry/util/add_const_if_c.hpp
        <link refid="add__const__if__c_8hpp"/>
        <childnode refid="58461" relation="include">
        </childnode>
      </node>
      <node id="58497">
        boost/variant/apply_visitor.hpp
      </node>
      <node id="58450">
        boost/range.hpp
      </node>
      <node id="58488">
        boost/concept/requires.hpp
      </node>
      <node id="58546">
        boost/mpl/front.hpp
      </node>
      <node id="58556">
        boost/geometry/algorithms/detail/convert_indexed_to_indexed.hpp
        <link refid="convert__indexed__to__indexed_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58483" relation="include">
        </childnode>
        <childnode refid="58503" relation="include">
        </childnode>
        <childnode refid="58505" relation="include">
        </childnode>
        <childnode refid="58474" relation="include">
        </childnode>
      </node>
      <node id="58533">
        boost/core/addressof.hpp
      </node>
      <node id="58543">
        boost/geometry/algorithms/detail/interior_iterator.hpp
        <link refid="interior__iterator_8hpp"/>
        <childnode refid="58538" relation="include">
        </childnode>
        <childnode refid="58458" relation="include">
        </childnode>
        <childnode refid="58518" relation="include">
        </childnode>
      </node>
      <node id="58484">
        boost/type_traits/is_fundamental.hpp
      </node>
      <node id="58446">
        /home/travis/build/boostorg/boost/boost/geometry/strategies/agnostic/hull_graham_andrew.hpp
        <link refid="hull_graham_andrew.hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58448" relation="include">
        </childnode>
        <childnode refid="58449" relation="include">
        </childnode>
        <childnode refid="58450" relation="include">
        </childnode>
        <childnode refid="58451" relation="include">
        </childnode>
        <childnode refid="58453" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
        <childnode refid="58468" relation="include">
        </childnode>
        <childnode refid="58470" relation="include">
        </childnode>
        <childnode refid="58471" relation="include">
        </childnode>
        <childnode refid="58487" relation="include">
        </childnode>
        <childnode refid="58563" relation="include">
        </childnode>
      </node>
      <node id="58468">
        boost/geometry/strategies/convex_hull.hpp
        <link refid="strategies_2convex__hull_8hpp"/>
        <childnode refid="58469" relation="include">
        </childnode>
      </node>
      <node id="58513">
        boost/geometry/geometries/concepts/multi_linestring_concept.hpp
        <link refid="multi__linestring__concept_8hpp"/>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58508" relation="include">
        </childnode>
        <childnode refid="58512" relation="include">
        </childnode>
        <childnode refid="58507" relation="include">
        </childnode>
      </node>
      <node id="58563">
        boost/geometry/views/reversible_view.hpp
        <link refid="reversible__view_8hpp"/>
        <childnode refid="58564" relation="include">
        </childnode>
        <childnode refid="58450" relation="include">
        </childnode>
        <childnode refid="58565" relation="include">
        </childnode>
        <childnode refid="58460" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58562" relation="include">
        </childnode>
      </node>
      <node id="58489">
        boost/geometry/core/tag_cast.hpp
        <link refid="tag__cast_8hpp"/>
        <childnode refid="58461" relation="include">
        </childnode>
        <childnode refid="58490" relation="include">
        </childnode>
      </node>
      <node id="58515">
        boost/geometry/geometries/concepts/polygon_concept.hpp
        <link refid="polygon__concept_8hpp"/>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58508" relation="include">
        </childnode>
        <childnode refid="58503" relation="include">
        </childnode>
        <childnode refid="58516" relation="include">
        </childnode>
        <childnode refid="58517" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
        <childnode refid="58460" relation="include">
        </childnode>
        <childnode refid="58510" relation="include">
        </childnode>
        <childnode refid="58519" relation="include">
        </childnode>
      </node>
      <node id="58493">
        boost/geometry/views/detail/points_view.hpp
      </node>
      <node id="58449">
        vector
      </node>
      <node id="58494">
        boost/geometry/algorithms/assign.hpp
        <link refid="assign_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58488" relation="include">
        </childnode>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58461" relation="include">
        </childnode>
        <childnode refid="58496" relation="include">
        </childnode>
        <childnode refid="58483" relation="include">
        </childnode>
        <childnode refid="58497" relation="include">
        </childnode>
        <childnode refid="58498" relation="include">
        </childnode>
        <childnode refid="58499" relation="include">
        </childnode>
        <childnode refid="58500" relation="include">
        </childnode>
        <childnode refid="58548" relation="include">
        </childnode>
        <childnode refid="58523" relation="include">
        </childnode>
        <childnode refid="58549" relation="include">
        </childnode>
        <childnode refid="58527" relation="include">
        </childnode>
        <childnode refid="58547" relation="include">
        </childnode>
        <childnode refid="58524" relation="include">
        </childnode>
        <childnode refid="58503" relation="include">
        </childnode>
        <childnode refid="58516" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58501" relation="include">
        </childnode>
        <childnode refid="58526" relation="include">
        </childnode>
      </node>
      <node id="58526">
        boost/geometry/util/for_each_coordinate.hpp
        <link refid="for__each__coordinate_8hpp"/>
        <childnode refid="58488" relation="include">
        </childnode>
        <childnode refid="58510" relation="include">
        </childnode>
        <childnode refid="58491" relation="include">
        </childnode>
      </node>
      <node id="58457">
        boost/geometry/core/point_type.hpp
        <link refid="point__type_8hpp"/>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58458" relation="include">
        </childnode>
        <childnode refid="58459" relation="include">
        </childnode>
        <childnode refid="58460" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58466" relation="include">
        </childnode>
      </node>
      <node id="58542">
        boost/type_traits/is_convertible.hpp
      </node>
      <node id="58498">
        boost/variant/static_visitor.hpp
      </node>
      <node id="58514">
        boost/geometry/geometries/concepts/multi_polygon_concept.hpp
        <link refid="multi__polygon__concept_8hpp"/>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58508" relation="include">
        </childnode>
        <childnode refid="58512" relation="include">
        </childnode>
        <childnode refid="58515" relation="include">
        </childnode>
      </node>
      <node id="58522">
        boost/mpl/identity.hpp
      </node>
      <node id="58525">
        boost/call_traits.hpp
      </node>
      <node id="58458">
        boost/range/value_type.hpp
      </node>
      <node id="58505">
        boost/geometry/core/coordinate_dimension.hpp
        <link refid="coordinate__dimension_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58506" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
        <childnode refid="58466" relation="include">
        </childnode>
      </node>
      <node id="58520">
        boost/geometry/geometries/concepts/segment_concept.hpp
        <link refid="segment__concept_8hpp"/>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58510" relation="include">
        </childnode>
        <childnode refid="58503" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
      </node>
      <node id="58561">
        boost/iterator/iterator_categories.hpp
      </node>
      <node id="58559">
        boost/iterator.hpp
      </node>
      <node id="58527">
        boost/geometry/algorithms/append.hpp
        <link refid="append_8hpp"/>
        <childnode refid="58450" relation="include">
        </childnode>
        <childnode refid="58497" relation="include">
        </childnode>
        <childnode refid="58498" relation="include">
        </childnode>
        <childnode refid="58499" relation="include">
        </childnode>
        <childnode refid="58528" relation="include">
        </childnode>
        <childnode refid="58544" relation="include">
        </childnode>
        <childnode refid="58503" relation="include">
        </childnode>
        <childnode refid="58509" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58501" relation="include">
        </childnode>
        <childnode refid="58545" relation="include">
        </childnode>
        <childnode refid="58530" relation="include">
        </childnode>
      </node>
      <node id="58547">
        boost/geometry/algorithms/clear.hpp
        <link refid="clear_8hpp"/>
        <childnode refid="58459" relation="include">
        </childnode>
        <childnode refid="58497" relation="include">
        </childnode>
        <childnode refid="58498" relation="include">
        </childnode>
        <childnode refid="58499" relation="include">
        </childnode>
        <childnode refid="58521" relation="include">
        </childnode>
        <childnode refid="58503" relation="include">
        </childnode>
        <childnode refid="58516" relation="include">
        </childnode>
        <childnode refid="58517" relation="include">
        </childnode>
        <childnode refid="58509" relation="include">
        </childnode>
        <childnode refid="58489" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58501" relation="include">
        </childnode>
      </node>
      <node id="58544">
        boost/geometry/algorithms/detail/convert_point_to_point.hpp
        <link refid="convert__point__to__point_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58483" relation="include">
        </childnode>
        <childnode refid="58503" relation="include">
        </childnode>
        <childnode refid="58505" relation="include">
        </childnode>
        <childnode refid="58474" relation="include">
        </childnode>
      </node>
      <node id="58519">
        boost/geometry/geometries/concepts/ring_concept.hpp
        <link refid="ring__concept_8hpp"/>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58508" relation="include">
        </childnode>
        <childnode refid="58459" relation="include">
        </childnode>
        <childnode refid="58503" relation="include">
        </childnode>
        <childnode refid="58509" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
        <childnode refid="58510" relation="include">
        </childnode>
      </node>
      <node id="58524">
        boost/geometry/arithmetic/arithmetic.hpp
        <link refid="arithmetic_8hpp"/>
        <childnode refid="58473" relation="include">
        </childnode>
        <childnode refid="58525" relation="include">
        </childnode>
        <childnode refid="58488" relation="include">
        </childnode>
        <childnode refid="58474" relation="include">
        </childnode>
        <childnode refid="58510" relation="include">
        </childnode>
        <childnode refid="58526" relation="include">
        </childnode>
        <childnode refid="58485" relation="include">
        </childnode>
      </node>
      <node id="58517">
        boost/geometry/core/interior_rings.hpp
        <link refid="interior__rings_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58458" relation="include">
        </childnode>
        <childnode refid="58459" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58518" relation="include">
        </childnode>
      </node>
      <node id="58447">
        cstddef
      </node>
      <node id="58460">
        boost/geometry/core/ring_type.hpp
        <link refid="ring__type_8hpp"/>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58461" relation="include">
        </childnode>
        <childnode refid="58458" relation="include">
        </childnode>
        <childnode refid="58462" relation="include">
        </childnode>
        <childnode refid="58459" relation="include">
        </childnode>
        <childnode refid="58463" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
      </node>
      <node id="58476">
        boost/type_traits/is_integral.hpp
      </node>
      <node id="58516">
        boost/geometry/core/exterior_ring.hpp
        <link refid="exterior__ring_8hpp"/>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58462" relation="include">
        </childnode>
        <childnode refid="58459" relation="include">
        </childnode>
        <childnode refid="58460" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58491" relation="include">
        </childnode>
      </node>
      <node id="58486">
        boost/type_traits/is_floating_point.hpp
      </node>
      <node id="58496">
        boost/numeric/conversion/bounds.hpp
      </node>
      <node id="58562">
        boost/geometry/views/identity_view.hpp
        <link refid="identity__view_8hpp"/>
        <childnode refid="58450" relation="include">
        </childnode>
      </node>
      <node id="58555">
        boost/concept/assert.hpp
      </node>
      <node id="58532">
        boost/config.hpp
      </node>
      <node id="58523">
        boost/geometry/algorithms/detail/assign_values.hpp
        <link refid="assign__values_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58488" relation="include">
        </childnode>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58461" relation="include">
        </childnode>
        <childnode refid="58496" relation="include">
        </childnode>
        <childnode refid="58483" relation="include">
        </childnode>
        <childnode refid="58524" relation="include">
        </childnode>
        <childnode refid="58527" relation="include">
        </childnode>
        <childnode refid="58547" relation="include">
        </childnode>
        <childnode refid="58503" relation="include">
        </childnode>
        <childnode refid="58516" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58501" relation="include">
        </childnode>
        <childnode refid="58526" relation="include">
        </childnode>
      </node>
      <node id="58492">
        boost/geometry/views/box_view.hpp
        <link refid="box__view_8hpp"/>
        <childnode refid="58450" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
        <childnode refid="58493" relation="include">
        </childnode>
        <childnode refid="58494" relation="include">
        </childnode>
      </node>
      <node id="58509">
        boost/geometry/core/mutable_range.hpp
        <link refid="mutable__range_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58458" relation="include">
        </childnode>
        <childnode refid="58463" relation="include">
        </childnode>
      </node>
      <node id="58501">
        boost/geometry/geometries/concepts/check.hpp
        <link refid="check_8hpp"/>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58488" relation="include">
        </childnode>
        <childnode refid="58462" relation="include">
        </childnode>
        <childnode refid="58499" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58502" relation="include">
        </childnode>
        <childnode refid="58507" relation="include">
        </childnode>
        <childnode refid="58511" relation="include">
        </childnode>
        <childnode refid="58513" relation="include">
        </childnode>
        <childnode refid="58514" relation="include">
        </childnode>
        <childnode refid="58510" relation="include">
        </childnode>
        <childnode refid="58515" relation="include">
        </childnode>
        <childnode refid="58519" relation="include">
        </childnode>
        <childnode refid="58520" relation="include">
        </childnode>
        <childnode refid="58521" relation="include">
        </childnode>
      </node>
      <node id="58548">
        boost/geometry/algorithms/detail/assign_indexed_point.hpp
        <link refid="assign__indexed__point_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58501" relation="include">
        </childnode>
        <childnode refid="58523" relation="include">
        </childnode>
      </node>
      <node id="58490">
        boost/type_traits/is_base_of.hpp
      </node>
      <node id="58565">
        boost/range/adaptor/reversed.hpp
      </node>
      <node id="58464">
        boost/geometry/core/tag.hpp
        <link refid="tag_8hpp"/>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58466" relation="include">
        </childnode>
      </node>
      <node id="58541">
        boost/range/size.hpp
      </node>
      <node id="58453">
        boost/geometry/core/cs.hpp
        <link refid="cs_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58455" relation="include">
        </childnode>
        <childnode refid="58456" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
      </node>
      <node id="58557">
        boost/geometry/views/closeable_view.hpp
        <link refid="closeable__view_8hpp"/>
        <childnode refid="58450" relation="include">
        </childnode>
        <childnode refid="58552" relation="include">
        </childnode>
        <childnode refid="58460" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58558" relation="include">
        </childnode>
        <childnode refid="58562" relation="include">
        </childnode>
      </node>
      <node id="58466">
        boost/geometry/util/bare_type.hpp
        <link refid="bare__type_8hpp"/>
        <childnode refid="58459" relation="include">
        </childnode>
        <childnode refid="58467" relation="include">
        </childnode>
        <childnode refid="58463" relation="include">
        </childnode>
      </node>
      <node id="58545">
        boost/geometry/geometries/variant.hpp
        <link refid="variant_8hpp"/>
        <childnode refid="58499" relation="include">
        </childnode>
        <childnode refid="58546" relation="include">
        </childnode>
      </node>
      <node id="58448">
        algorithm
      </node>
      <node id="58467">
        boost/type_traits/remove_pointer.hpp
      </node>
      <node id="58485">
        boost/geometry/util/select_most_precise.hpp
        <link refid="select__most__precise_8hpp"/>
        <childnode refid="58461" relation="include">
        </childnode>
        <childnode refid="58486" relation="include">
        </childnode>
        <childnode refid="58484" relation="include">
        </childnode>
      </node>
      <node id="58521">
        boost/geometry/algorithms/not_implemented.hpp
        <link refid="not__implemented_8hpp"/>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58522" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
      </node>
      <node id="58539">
        boost/range/rbegin.hpp
      </node>
      <node id="58469">
        boost/geometry/strategies/tags.hpp
        <link refid="strategies_2tags_8hpp"/>
      </node>
      <node id="58510">
        boost/geometry/geometries/concepts/point_concept.hpp
        <link refid="point__concept_8hpp"/>
        <childnode refid="58447" relation="include">
        </childnode>
        <childnode refid="58495" relation="include">
        </childnode>
        <childnode refid="58480" relation="include">
        </childnode>
        <childnode refid="58503" relation="include">
        </childnode>
        <childnode refid="58505" relation="include">
        </childnode>
        <childnode refid="58456" relation="include">
        </childnode>
      </node>
      <node id="58566">
        boost/geometry/core/point_order.hpp
        <link refid="point__order_8hpp"/>
        <childnode refid="58454" relation="include">
        </childnode>
        <childnode refid="58458" relation="include">
        </childnode>
        <childnode refid="58460" relation="include">
        </childnode>
        <childnode refid="58464" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58466" relation="include">
        </childnode>
      </node>
      <node id="58551">
        boost/geometry/algorithms/for_each.hpp
        <link refid="for__each_8hpp"/>
        <childnode refid="58448" relation="include">
        </childnode>
        <childnode refid="58450" relation="include">
        </childnode>
        <childnode refid="58462" relation="include">
        </childnode>
        <childnode refid="58463" relation="include">
        </childnode>
        <childnode refid="58543" relation="include">
        </childnode>
        <childnode refid="58521" relation="include">
        </childnode>
        <childnode refid="58552" relation="include">
        </childnode>
        <childnode refid="58516" relation="include">
        </childnode>
        <childnode refid="58517" relation="include">
        </childnode>
        <childnode refid="58457" relation="include">
        </childnode>
        <childnode refid="58489" relation="include">
        </childnode>
        <childnode refid="58465" relation="include">
        </childnode>
        <childnode refid="58501" relation="include">
        </childnode>
        <childnode refid="58554" relation="include">
        </childnode>
        <childnode refid="58491" relation="include">
        </childnode>
        <childnode refid="58530" relation="include">
        </childnode>
      </node>
      <node id="58483">
        boost/numeric/conversion/cast.hpp
      </node>
    </incdepgraph>
    <invincdepgraph>
      <node id="58568">
        /home/travis/build/boostorg/boost/boost/geometry/strategies/strategies.hpp
        <link refid="strategies_8hpp"/>
      </node>
      <node id="58567">
        /home/travis/build/boostorg/boost/boost/geometry/strategies/agnostic/hull_graham_andrew.hpp
        <link refid="hull_graham_andrew.hpp"/>
        <childnode refid="58568" relation="include">
        </childnode>
      </node>
    </invincdepgraph>
    <innerclass refid="classboost_1_1geometry_1_1strategy_1_1convex__hull_1_1graham__andrew" prot="public">boost::geometry::strategy::convex_hull::graham_andrew</innerclass>
    <innerclass refid="classboost_1_1geometry_1_1strategy_1_1convex__hull_1_1graham__andrew_1_1partitions" prot="private">boost::geometry::strategy::convex_hull::graham_andrew::partitions</innerclass>
    <innernamespace refid="namespaceboost">boost</innernamespace>
    <innernamespace refid="namespaceboost_1_1geometry">boost::geometry</innernamespace>
    <innernamespace refid="namespaceboost_1_1geometry_1_1strategy">boost::geometry::strategy</innernamespace>
    <innernamespace refid="namespaceboost_1_1geometry_1_1strategy_1_1convex__hull">boost::geometry::strategy::convex_hull</innernamespace>
    <briefdescription>
    </briefdescription>
    <detaileddescription>
    </detaileddescription>
    <location file="/home/travis/build/boostorg/boost/boost/geometry/strategies/agnostic/hull_graham_andrew.hpp"/>
  </compounddef>
</doxygen>


text:
package com.eaglesakura.serialize;

import com.eaglesakura.io.DataInputStream;
import com.eaglesakura.serialize.error.CreateObjectFailedException;
import com.eaglesakura.serialize.error.SerializeException;
import com.eaglesakura.serialize.internal.InternalSerializeUtil;
import com.eaglesakura.serialize.internal.ObjectHeader;
import com.eaglesakura.serialize.internal.SerializeHeader;
import com.eaglesakura.serialize.internal.SerializeTargetField;
import com.eaglesakura.util.ReflectionUtil;

import java.io.ByteArrayInputStream;
import java.lang.reflect.Method;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;

/**
 * エンコードされたオブジェクトをデシリアライズする
 */
public class PublicFieldDeserializer {
    public PublicFieldDeserializer() {
    }

    public <T> T deserialize(Class<T> clazz, byte[] buffer) throws SerializeException {
        DataInputStream stream = new DataInputStream(new ByteArrayInputStream(buffer));

        try {
            SerializeHeader.read(stream);
//            LogUtil.log("Magic(%x) Version(%d)", header.magic, header.version);
            return deserializeObject(null, clazz, stream);
        } catch (SerializeException e) {
            throw e;
        } catch (Exception e) {
            e.printStackTrace();
        }
        return null;
    }

    private <T> T deserializeEnum(ObjectHeader header, Class<T> clazz, DataInputStream stream) throws SerializeException {
        try {
            int index = stream.readU16();
            Method valuesMethod = clazz.getMethod("values");
            T[] values = (T[]) valuesMethod.invoke(clazz);
            return values[index];
        } catch (Exception e) {
            throw new CreateObjectFailedException(e);
        }
    }

    private <T> T deserializeObject(ObjectHeader header, Class<T> clazz, DataInputStream stream) throws Exception {
        // Objectを読み込む
        if (header == null) {
            header = ObjectHeader.read(stream);
        }
        if (header.isNull()) {
            // nullオブジェクトなので何もしない
            return null;
        }

        if (clazz.equals(String.class)) {
            // StringはPrimitiveと同等に扱う
            return (T) (new String(stream.readBuffer(header.size), ObjectHeader.STRING_CHARSET));
        } else if (clazz.isEnum()) {
            return deserializeEnum(header, clazz, stream);
        }

        T instance = newInstance(clazz);
        if (instance == null) {
            throw new CreateObjectFailedException("Failed :: " + clazz.getName());
        }

        Map<Short, SerializeTargetField> fields = InternalSerializeUtil.listSerializeFields(instance);

        for (int i = 0; i < header.size; ++i) {
            ObjectHeader valueHeader = ObjectHeader.read(stream);
            SerializeTargetField field = fields.get(valueHeader.id);
            if (field != null) {
                // 書き込み対象がある
                if (valueHeader.isNull()) {
                    // nullを書き込む
                    field.set(null);
                    continue;
                } else if (valueHeader.isArray()) {
                    // 配列を読み込む
                    List array = new ArrayList();
                    for (int k = 0; k < valueHeader.size; ++k) {
                        Object vInstance = deserializeObject(null, ReflectionUtil.getListGenericClass(field.field), stream);
                        array.add(vInstance);
                    }
                    field.set(array);
                } else if (valueHeader.isObject()) {
                    // 再帰的に生成させる
                    Object fInstance = deserializeObject(valueHeader, field.type, stream);
                    field.set(fInstance);
                } else if (field.type.isEnum()) {
                    // enumは独自に扱う
                    Object enumValue = deserializeEnum(header, field.type, stream);
                    field.set(enumValue);
                } else {
                    // プリミティブとして処理
                    Object newValue = field.read(valueHeader, stream);
                    field.set(newValue);
                }
            } else {
                // 書き込み対象が無いならスキップする
                stream.readBuffer(valueHeader.size);
            }
        }

        return instance;

    }

    static <T> T newInstance(Class<T> clazz) {
        try {
            return clazz.newInstance();
        } catch (Exception e) {
            return null;
        }
    }
}

redpajama_set_name: RedPajamaGithub


text:
<?php
namespace Modules\Stations\Controllers;

use \Entity\Station;
use \Entity\Convention;
use \Entity\ShortUrl;

class UrlsController extends BaseController
{
    public function indexAction()
    {
        $urls = $this->em->createQuery('SELECT su FROM Entity\ShortUrl su WHERE su.station_id = :station_id ORDER BY su.timestamp ASC')
            ->setParameter('station_id', $this->station->id)
            ->execute();

        $this->view->urls = $urls;

        // Auto-Generated Station URLs.
        $station_details = Station::getShortNameLookup();
        $station_categories = Station::getCategories();
        $station_urls = array();

        foreach($station_details as $short_name => $station)
        {
            $station['url'] = ShortUrl::getFullUrl($short_name);
            $station['icon'] = $station_categories[$station['category']]['icon'];

            $station_urls[$short_name] = $station;
        }

        $this->view->station_urls = $station_urls;

        // Auto-Generated Convention Archive URLs
        $convention_details = Convention::getShortNameLookup();
        $convention_urls = array();

        foreach($convention_details as $short_name => $convention)
        {
            $convention['url'] = ShortUrl::getFullUrl($short_name);
            $convention_urls[$short_name] = $convention;
        }

        $this->view->convention_urls = $convention_urls;
    }

    public function editAction()
    {
        $form = new \DF\Form($this->current_module_config->forms->url);

        if ($this->hasParam('id'))
        {
            $record = ShortUrl::getRepository()->findOneBy(array(
                'id' => $this->getParam('id'),
                'station_id' => $this->station->id
            ));
            $form->setDefaults($record->toArray());
        }

        if(!empty($_POST) && $form->isValid($_POST))
        {
            $data = $form->getValues();

            if (!($record instanceof ShortUrl))
                $record = new ShortUrl;

            $record->station = $this->station;
            $record->fromArray($data);

            if (!$record->checkUrl())
                throw new \DF\Exception\DisplayOnly('This URL is already taken! Please go back and try another.');

            $record->save();

            $this->alert('Record updated.', 'green');
            $this->redirectFromHere(array('action' => 'index', 'id' => NULL));
            return;
        }

        $this->renderForm($form, 'edit', ($this->hasParam('id')) ? 'Edit Short URL' : 'Add Short URL');
    }

    public function deleteAction()
    {
        $id = (int)$this->getParam('id');
        $record = ShortUrl::getRepository()->findOneBy(array(
            'id' => $id,
            'station_id' => $this->station->id
        ));

        if ($record instanceof ShortUrl)
            $record->delete();

        $this->alert('<b>Record deleted.</b>', 'green');
        $this->redirectFromHere(array('action' => 'index', 'id' => NULL));
    }
}


text:
<!DOCTYPE html>

  <title>N-K-D | Fully accessible flyout mobile menu</title>
  <meta charset="UTF-8">

  <link rel="stylesheet" type="text/css" media="screen" href="css/bootstrap.min.css" />
  <link rel="stylesheet" type="text/css" media="screen" href="css/main-screen-styles.css" />
  <link rel="stylesheet" type="text/css" media="screen" href="css/mobile-menu-styles.css" />
  <link rel="stylesheet" type="text/css" media="screen" href="css/mega-menu-styles.css" />

  <link href='http://fonts.googleapis.com/css?family=Open+Sans:400,300,600' rel='stylesheet' type='text/css'>

Skip to main content

    <button class="sidebar-button" value="Mobile navigation menu collapsed" aria-expanded="false">
      Mobile navigation menu

    </button>

Home

Menu item 1

                        Section one

First child of section one

Second child of section one

Third child of section one

Forth child of section one

                        Section two

First child of section two

Second child of section two

Third child of section two

Forth child of section two

Menu item 2

Menu item 3

Menu item 4

Menu item 5

              <form role="search" method="get" id="searchform-mobile" action="http://www.n-k-d.co.uk/">
                Search site
                <input class="search" type="text" placeholder="Search site" name="q-mobile" id="q-mobile">
                <input class="btn mr20" type="submit" id="searchsubmit-mobile" value="Search">
              </form>

Start of the main content

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Curabitur sollicitudin, turpis at feugiat dapibus, lectus eros malesuada magna, non vehicula nulla odio euismod lacus. In dictum finibus ex et tempor. Here's the first link in the main content Vivamus blandit commodo malesuada. Suspendisse sed lectus quis tellus imperdiet vulputate. Duis ut metus sapien. In lacinia tortor nisi, molestie mattis nibh auctor id. Integer accumsan vestibulum purus. Morbi luctus, ligula ut vestibulum vulputate, lacus eros aliquam ligula, et laoreet ligula elit vitae mi.

Fusce sit amet odio dictum, bibendum ex vitae, tristique tortor. Proin rutrum sem id fermentum finibus. Nullam faucibus dignissim sem, a dictum elit egestas id. In commodo sollicitudin tempus. Etiam mattis, tellus at dictum pellentesque, eros risus porta sem, id varius quam odio a quam. Phasellus sed consectetur leo, sed luctus velit. Morbi eu diam ex. Curabitur at nunc eleifend, tempor neque vitae, tempus sapien. Curabitur tincidunt odio odio, here's the second link in the main content quis blandit augue facilisis eget. Duis consequat euismod risus id tincidunt. Sed elementum molestie lorem. Vivamus vulputate sollicitudin leo, id eleifend mi dignissim a. Suspendisse accumsan diam in semper bibendum.

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Curabitur sollicitudin, turpis at feugiat dapibus, lectus eros malesuada magna, non vehicula nulla odio euismod lacus. In dictum finibus ex et tempor. Vivamus blandit commodo malesuada. Suspendisse sed lectus quis tellus imperdiet vulputate. Duis ut metus sapien. In lacinia tortor nisi, molestie mattis nibh auctor id. Integer accumsan vestibulum purus. Morbi luctus, ligula ut vestibulum vulputate, lacus eros aliquam ligula, et laoreet ligula elit vitae mi.

Fusce sit amet odio dictum, bibendum ex vitae, tristique tortor. Here's the third link in the main content proin rutrum sem id fermentum finibus. Nullam faucibus dignissim sem, a dictum elit egestas id. In commodo sollicitudin tempus. Etiam mattis, tellus at dictum pellentesque, eros risus porta sem, id varius quam odio a quam. Phasellus sed consectetur leo, sed luctus velit. Morbi eu diam ex. Curabitur at nunc eleifend, tempor neque vitae, tempus sapien. Curabitur tincidunt odio odio, quis blandit augue facilisis eget. Duis consequat euismod risus id tincidunt. Sed elementum molestie lorem. Vivamus vulputate sollicitudin leo, id eleifend mi dignissim a. Suspendisse accumsan diam in semper bibendum.

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Curabitur sollicitudin, turpis at feugiat dapibus, lectus eros malesuada magna, non vehicula nulla odio euismod lacus. In dictum finibus ex et tempor. Vivamus blandit commodo malesuada. Suspendisse sed lectus quis tellus imperdiet vulputate. Duis ut metus sapien. In lacinia tortor nisi, molestie mattis nibh auctor id. Integer accumsan vestibulum purus. Morbi luctus, ligula ut vestibulum vulputate, lacus eros aliquam ligula, et laoreet ligula elit vitae mi.

Fusce sit amet odio dictum, bibendum ex vitae, tristique tortor. Proin rutrum sem id fermentum finibus. Nullam faucibus dignissim sem, a dictum elit egestas id. In commodo sollicitudin tempus. Etiam mattis, tellus at dictum pellentesque, eros risus porta sem, id varius quam odio a quam. Phasellus sed consectetur leo, sed luctus velit. Morbi eu diam ex. Curabitur at nunc eleifend, tempor neque vitae, tempus sapien. Curabitur tincidunt odio odio, quis blandit augue facilisis eget. Duis consequat euismod risus id tincidunt. Sed elementum molestie lorem. Vivamus vulputate sollicitudin leo, id eleifend mi dignissim a. Suspendisse accumsan diam in semper bibendum.

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Curabitur sollicitudin, turpis at feugiat dapibus, lectus eros malesuada magna, non vehicula nulla odio euismod lacus. In dictum finibus ex et tempor. Vivamus blandit commodo malesuada. Suspendisse sed lectus quis tellus imperdiet vulputate. Duis ut metus sapien. In lacinia tortor nisi, molestie mattis nibh auctor id. Integer accumsan vestibulum purus. Morbi luctus, ligula ut vestibulum vulputate, lacus eros aliquam ligula, et laoreet ligula elit vitae mi.

Fusce sit amet odio dictum, bibendum ex vitae, tristique tortor. Proin rutrum sem id fermentum finibus. Nullam faucibus dignissim sem, a dictum elit egestas id. In commodo sollicitudin tempus. Etiam mattis, tellus at dictum pellentesque, eros risus porta sem, id varius quam odio a quam. Phasellus sed consectetur leo, sed luctus velit. Morbi eu diam ex. Curabitur at nunc eleifend, tempor neque vitae, tempus sapien. Curabitur tincidunt odio odio, quis blandit augue facilisis eget. Duis consequat euismod risus id tincidunt. Sed elementum molestie lorem. Vivamus vulputate sollicitudin leo, id eleifend mi dignissim a. Suspendisse accumsan diam in semper bibendum.

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Curabitur sollicitudin, turpis at feugiat dapibus, lectus eros malesuada magna, non vehicula nulla odio euismod lacus. In dictum finibus ex et tempor. Vivamus blandit commodo malesuada. Suspendisse sed lectus quis tellus imperdiet vulputate. Duis ut metus sapien. In lacinia tortor nisi, molestie mattis nibh auctor id. Integer accumsan vestibulum purus. Morbi luctus, ligula ut vestibulum vulputate, lacus eros aliquam ligula, et laoreet ligula elit vitae mi.


text:
from telemetry.core.backends.webdriver import webdriver_tab_backend

class WebDriverTabListBackend(object):
  def __init__(self, browser_backend):
    self._browser_backend = browser_backend
    # Stores the window handles.
    self._tab_list = []
    self._UpdateTabList()

  def New(self, timeout=None):
    # Webdriver API doesn't support tab controlling.
    raise NotImplementedError()

  def __iter__(self):
    self._UpdateTabList()
    return self._tab_list.__iter__()

  def __len__(self):
    self._UpdateTabList()
    return len(self._tab_list)

  def __getitem__(self, index):
    self._UpdateTabList()
    if len(self._tab_list) <= index:
      raise IndexError('list index out of range')
    return self._tab_list[index]

  def _UpdateTabList(self):
    window_handles = self._browser_backend.driver.window_handles
    old_tab_list = self._tab_list
    self._tab_list = []
    for window_handle in window_handles:
      tab = None
      for old_tab in old_tab_list:
        if old_tab.window_handle == window_handle:
          tab = old_tab
          break
      else:
        tab = webdriver_tab_backend.WebDriverTabBackend(
            self._browser_backend, window_handle)
      self._tab_list.append(tab)


text:
require "google/cloud/api_keys/v2"

##
# Example demonstrating basic usage of
# Google::Cloud::ApiKeys::V2::ApiKeys::Client#list_keys
#
def list_keys
  # Create a client object. The client can be reused for multiple calls.
  client = Google::Cloud::ApiKeys::V2::ApiKeys::Client.new

  # Create a request. To set request fields, pass in keyword arguments.
  request = Google::Cloud::ApiKeys::V2::ListKeysRequest.new

  # Call the list_keys method.
  result = client.list_keys request

  # The returned object is of type Gapic::PagedEnumerable. You can
  # iterate over all elements by calling #each, and the enumerable
  # will lazily make API calls to fetch subsequent pages. Other
  # methods are also available for managing paging directly.
  result.each do |response|
    # Each element is of type ::Google::Cloud::ApiKeys::V2::Key.
    p response
  end
end
# [END apikeys_v2_generated_ApiKeys_ListKeys_sync]


text:
package com.opengamma.livedata.server;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.Timer;
import java.util.TimerTask;
import java.util.concurrent.CountDownLatch;

import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import org.springframework.context.Lifecycle;

import com.google.common.collect.Lists;
import com.google.common.collect.Sets;
import com.google.common.collect.Sets.SetView;
import com.opengamma.livedata.LiveDataSpecification;
import com.opengamma.livedata.msg.LiveDataSubscriptionResponse;
import com.opengamma.livedata.msg.LiveDataSubscriptionResult;
import com.opengamma.livedata.server.distribution.MarketDataDistributor;
import com.opengamma.util.ArgumentChecker;
import com.opengamma.util.monitor.OperationTimer;

/**
 * Stores persistent subscriptions in persistent storage so they're not lost if
 * the server crashes.
 *

 * If you modify the list of persistent subscriptions in persistent storage by
 * editing the persistent storage (DB/file/whatever) using external tools while
 * the server is down, these changes will be reflected on the server the next
 * time it starts.
 *

 * This beans depends-on the Live Data Server, and any Spring configuration must reflect
 * this. See http://jira.springframework.org/browse/SPR-2325.
 *
 */
public abstract class AbstractPersistentSubscriptionManager implements Lifecycle {

  private static final Logger LOGGER = LoggerFactory
      .getLogger(AbstractPersistentSubscriptionManager.class);

  /**
   * Default how often to save the persistent subscriptions to the database, milliseconds.
   */
  public static final long DEFAULT_SAVE_PERIOD = 60000L;

  private final StandardLiveDataServer _server;
  private final Timer _timer;
  private final long _savePeriod;
  private volatile SaveTask _saveTask;

  private Set<PersistentSubscription> _previousSavedState;
  private final Set<PersistentSubscription> _persistentSubscriptions = new HashSet<>();

  public AbstractPersistentSubscriptionManager(final StandardLiveDataServer server) {
    this(server, new Timer("PersistentSubscriptionManager Timer"),
        DEFAULT_SAVE_PERIOD);
  }

  public AbstractPersistentSubscriptionManager(final StandardLiveDataServer server,
      final Timer timer, final long savePeriod) {
    ArgumentChecker.notNull(server, "Live Data Server");
    ArgumentChecker.notNull(timer, "Timer");
    if (savePeriod <= 0) {
      throw new IllegalArgumentException("Please give positive save period");
    }

    _server = server;
    _timer = timer;
    _savePeriod = savePeriod;
  }

  private class SaveTask extends TimerTask {
    @Override
    public void run() {
      try {
        save();
      } catch (final RuntimeException e) {
        LOGGER.error("Saving persistent subscriptions to storage failed", e);
      }
    }
  }

  @Override
  public boolean isRunning() {
    return _saveTask != null;
  }

  @Override
  public void start() {
    refreshAsync(); //PLAT-1632
    //Safe after refresh queued to avoid empty save
    _saveTask = new SaveTask();
    _timer.schedule(_saveTask, _savePeriod, _savePeriod);
  }

  @Override
  public void stop() {
    _saveTask.cancel();
    _saveTask = null;
    waitForIdleTimer();
  }

  private void waitForIdleTimer() {
    final CountDownLatch countDownLatch = new CountDownLatch(1);;
    LOGGER.info("Waiting for timer to be idle");
    try {
      _timer.schedule(new TimerTask() {
        @Override
        public void run() {
          countDownLatch.countDown();
        }
      }, 0);
      countDownLatch.await();
      LOGGER.info("Timer idle");
    } catch (final Exception ex) {
      LOGGER.error("Couldn't waiting for timer to be idle", ex);
    }
  }

  /**
   * This should mean that all the subscriptions become persistent eventually,
   *  and (importantly) none of them expire in the mean time.
   * Because of the implementation of updateServer.
   */
  private synchronized void refreshAsync() {
    refreshState();

    _timer.schedule(new TimerTask() {
      @Override
      public void run() {
        //We release the lock before here, so someone could sneak in and change things
        updateServer(true);
      }
    }, 0);
  }

  public synchronized void refresh() {
    refreshState();

    updateServer(true);
  }

  /**
   * Reads from all sources to our private state
   */
  private synchronized void refreshState() {
    LOGGER.debug("Refreshing persistent subscriptions from storage");

    clear();
    readFromStorage();
    readFromServer();

    LOGGER.info("Refreshed persistent subscriptions from storage. There are currently "
        + _persistentSubscriptions.size() + " persistent subscriptions.");
  }

  /**
   * Creates a persistent subscription on the server for any persistent
   * subscriptions which are not yet there.
   */
  private synchronized void updateServer(final boolean catchExceptions) {
    final Collection<LiveDataSpecification> specs = getSpecs(_persistentSubscriptions);
    final Set<LiveDataSpecification> persistentSubscriptionsToMake = new HashSet<>(specs);

    final OperationTimer operationTimer = new OperationTimer(LOGGER, "Updating server's persistent subscriptions {}", persistentSubscriptionsToMake.size());

    final int partitionSize = 50; //Aim is to make sure we can convert subscriptions quickly enough that nothing expires,
    // and to leave the server responsive, and make retrys not take too long

    final List<List<LiveDataSpecification>> partitions = Lists.partition(Lists.newArrayList(persistentSubscriptionsToMake), partitionSize);
    for (final List<LiveDataSpecification> partition : partitions) {

      final Map<LiveDataSpecification, MarketDataDistributor> marketDataDistributors = _server.getMarketDataDistributors(persistentSubscriptionsToMake);
      for (final Entry<LiveDataSpecification, MarketDataDistributor> distrEntry : marketDataDistributors.entrySet()) {
        if (distrEntry.getValue() != null) {
          //Upgrade or no/op should be fast, lets do it to avoid expiry
          createPersistentSubscription(catchExceptions, distrEntry.getKey());
          persistentSubscriptionsToMake.remove(distrEntry.getKey());
        }
      }

      final SetView<LiveDataSpecification> toMake = Sets.intersection(new HashSet<>(partition), persistentSubscriptionsToMake);
      if (!toMake.isEmpty()) {
        createPersistentSubscription(catchExceptions, toMake); //PLAT-1632
        persistentSubscriptionsToMake.removeAll(toMake);
      }
    }
    operationTimer.finished();
    LOGGER.info("Server updated");
  }

  private void createPersistentSubscription(final boolean catchExceptions, final LiveDataSpecification sub) {
    createPersistentSubscription(catchExceptions, Collections.singleton(sub));
  }

  private void createPersistentSubscription(final boolean catchExceptions, final Set<LiveDataSpecification> specs) {
    if (specs.isEmpty()) {
      return;
    }
    LOGGER.info("Creating {}", specs);
    try {
      final Collection<LiveDataSubscriptionResponse> results = _server.subscribe(specs, true);
      for (final LiveDataSubscriptionResponse liveDataSubscriptionResponse : results) {
        if (liveDataSubscriptionResponse.getSubscriptionResult() != LiveDataSubscriptionResult.SUCCESS) {
          LOGGER.warn("Failed to create persistent subscription {}", liveDataSubscriptionResponse);
        }
      }
    } catch (final RuntimeException e) {
      if (catchExceptions) {
        //This should be rare
        LOGGER.error("Creating a persistent subscription failed for " + specs, e);
        if (specs.size() > 1) {
          //  NOTE: have to retry here since _all_ of the subs will have failed
          for (final LiveDataSpecification spec : specs) {
            createPersistentSubscription(catchExceptions, spec);
          }
        }
      } else {
        throw e;
      }
    }
  }

  private static Collection<LiveDataSpecification> getSpecs(final Set<PersistentSubscription> subs) {
    final Collection<LiveDataSpecification> specs = new ArrayList<>();
    for (final PersistentSubscription sub : subs) {
      specs.add(sub.getFullyQualifiedSpec());
    }
    return specs;
  }

  public synchronized void save() {
    LOGGER.debug("Dumping persistent subscriptions to storage");

    clear();
    readFromServer();

    // Only save if changed
    if (_previousSavedState == null || !_previousSavedState.equals(_persistentSubscriptions)) {

      LOGGER.info("A change to persistent subscriptions detected, saving "
          + _persistentSubscriptions.size() + " subscriptions to storage.");
      saveToStorage(_persistentSubscriptions);
      _previousSavedState = new HashSet<>(_persistentSubscriptions);

    } else {
      LOGGER.debug("No changes to persistent subscriptions detected.");
    }

    LOGGER.debug("Dumped persistent subscriptions to storage");
  }

  public synchronized long getApproximateNumberOfPersistentSubscriptions() {
    return _persistentSubscriptions.size();
  }
  public synchronized Set<String> getPersistentSubscriptions() {
    clear();
    readFromServer();

    final HashSet<String> returnValue = new HashSet<>();
    for (final PersistentSubscription ps : _persistentSubscriptions) {
      returnValue.add(ps.getFullyQualifiedSpec().toString());
    }

    return returnValue;
  }

  public synchronized void addPersistentSubscription(final String securityUniqueId) {
    final LiveDataSpecification spec = getFullyQualifiedLiveDataSpec(securityUniqueId);
    addPersistentSubscription(new PersistentSubscription(spec));
    updateServer(false);
  }

  public synchronized boolean removePersistentSubscription(
      final String securityUniqueId) {
    final Subscription sub = _server.getSubscription(securityUniqueId);
    if (sub == null) {
      return false;
    }

    boolean removed = false;
    for (final MarketDataDistributor distributor : sub.getDistributors()) {
      removed = true;
      distributor.setPersistent(false);
    }

    save();
    return removed;
  }

  public LiveDataSpecification getFullyQualifiedLiveDataSpec(final String securityUniqueId) {
    return _server.getLiveDataSpecification(securityUniqueId);
  }

  private void clear() {
    _persistentSubscriptions.clear();
  }

  protected void addPersistentSubscription(final PersistentSubscription sub) {
    _persistentSubscriptions.add(sub);
  }

  /**
   * Refreshes persistent subscriptions from the latest status on the server.
   */
  private void readFromServer() {
    for (final Subscription sub : _server.getSubscriptions()) {
      for (final MarketDataDistributor distributor : sub.getDistributors()) {
        if (distributor.isPersistent()) {
          final PersistentSubscription ps = new PersistentSubscription(
              distributor.getFullyQualifiedLiveDataSpecification());
          addPersistentSubscription(ps);
        }
      }
    }
  }

  /**
   * Reads entries from persistent storage (DB, flat file, ...) and calls
   * {@link #addPersistentSubscription(PersistentSubscription)} for each one.
   */
  protected abstract void readFromStorage();

  /**
   * Saves entries to persistent storage (DB, flat file, ...).
   *
   * @param newState Entries to be saved
   */
  public abstract void saveToStorage(Set<PersistentSubscription> newState);

}


text:
package mockerfile

import (
	"encoding/json"
	"strings"
)

// Base on JSON but accept comment which has prefix '#'
func Unmarshal(data []byte, v interface{}) error {
	edited := []byte{}
	for _, s := range strings.Split(string(data), "\n") {
		if trimmed := strings.TrimLeft(s, " "); !strings.HasPrefix(trimmed, "#") && !strings.HasPrefix(trimmed, "//") {
			edited = append(edited, []byte(trimmed)...)
		}
	}
	return json.Unmarshal(edited, v)
}


text:
package com.yjz.microweb.util;

import java.lang.reflect.Array;
import java.util.Arrays;

public class ArrayUtils
{
 // Reworked the java.util.Arrays's binarySearch
    public static int binarySearch(final int[] a, final int fromIndex, final int toIndex,
                     final int key) {
    int low = fromIndex;
    int high = toIndex - 1;

    while (low <= high) {
        int mid = (low + high) >>> 1;
        int midVal = a[mid];

        if (midVal < key)
        low = mid + 1;
        else if (midVal > key)
        high = mid - 1;
        else
        return mid; // key found
    }
    return low;  // key not found.
    }

    /**
     * Add unique element to the array.
     * @param <T> type of the array element
     * @param array array
     * @param element element to add
     *
     * @return array, which will contain the new element. Either new array instance, if
     * passed array didn't contain the element, or the same array instance, if the element
     * is already present in the array.
     */
    public static <T> T[] addUnique(T[] array, T element) {
        return addUnique(array, element, true);
    }

    /**
     * Add unique element to the array.
     * @param <T> type of the array element
     * @param array array
     * @param element element to add
     * @param replaceElementIfEquals if passed element is equal to some element
     *              in the array then depending on this parameter it will be
     *              replaced or not with the passed element.
     *
     * @return array, which will contain the new element. Either new array instance, if
     * passed array didn't contain the element, or the same array instance, if the element
     * is already present in the array.
     */
    public static <T> T[] addUnique(final T[] array, final T element,
            final boolean replaceElementIfEquals) {

        final int idx = indexOf(array, element);
        if (idx == -1) {
            final int length = array.length;
            final T[] newArray = Arrays.copyOf(array, length + 1);
            newArray[length] = element;
            return newArray;
        }

        if (replaceElementIfEquals) {
            array[idx] = element;
        }

        return array;
    }

    /**
     * Removes the element from the array.
     * @param <T> type of the array element
     * @param array array
     * @param element the element to remove
     *
     * @return array, which won't contain the element. Either new array instance, if
     * passed array contains the element, or the same array instance, if the element
     * wasn't present in the array. <tt>null</tt> will be returned if the last
     * element was removed from the passed array.
     */
    @SuppressWarnings("unchecked")
    public static <T> T[] remove(T[] array, Object element) {
        final int idx = indexOf(array, element);
        if (idx != -1) {
            final int length = array.length;

            if (length == 1) {
                return null;
            }

            final T[] newArray = (T[]) Array.newInstance(
                    array.getClass().getComponentType(), length - 1);

            if (idx > 0) {
                System.arraycopy(array, 0, newArray, 0, idx);
            }

            if (idx < length - 1) {
                System.arraycopy(array, idx + 1, newArray, idx, length - idx - 1);
            }

            return newArray;
        }

        return array;
    }

    /**
     * Return the element index in the array.
     * @param <T> type of the array element
     * @param array array
     * @param element the element to look for.
     *
     * @return element's index, or <tt>-1</tt> if element wasn't found.
     */
    public static <T> int indexOf(T[] array, Object element) {
        for (int i = 0; i < array.length; i++) {
            if (element.equals(array[i])) {
                return i;
            }
        }

        return -1;
    }
}


text:
import React, { Component } from 'react';
import { View } from 'react-native';
import { AdMobBanner } from 'react-native-admob';

export default class AdvertisementBanner extends Component {
  constructor(props) {
    super(props);
    this.state = {
      hide: false
    }
  }

  bannerErrorHandler = (e) => {
    console.log(e);
  };

  componentDidMount() {
    setTimeout(() => {
      this.setState(() => ({
        hide: true
      }));
    }, 20000);
  }

  render() {
    if (this.props.hide && this.state.hide) return null;
    return (
      <View>
        <AdMobBanner
          adSize="fullBanner"
          adUnitID={this.props.adUnitID}
          onAdFailedToLoad={this.bannerErrorHandler}
        />
      </View>
    );
  }
}


text:
// Copyright (c) 2015 Uber Technologies, Inc.
//
// 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.

'use strict';

var console = require('console');

var TimeSeriesCluster = require('../lib/time-series-cluster.js');

// 14 is a magic number for zero errors + >25 rate limits.
var OVERLOADED_WORKER_RATELIMIT = 14;

/* End to end test to ensure that retries on Busy work as expected.

    The semantics we want is that when a single Hyperbahn worker
    is busy an edge client will use retries to "maneouver" around
    that worker and get 100% success rate.

    We create a TimeSeriesCluster with:

     - 10 hyperbahn worker nodes
     - rate limiting set to 200 per worker.
     - We split the test run into 4 buckets
     - We want one client to have deterministic peer selection
     - We want 250 req/s split between 10 workers
     - We manually set the first bucket to 100 req/s to warm
        up the entire cluster

    Once our test finishes we expect:

     - All requests to succeed
     - To get at least 2% of requests to be rate limited

*/
TimeSeriesCluster.test('testing worker with low rate limit', {
    clusterOptions: {
        size: 10,
        remoteConfig: {
            'rateLimiting.enabled': true,
            'rateLimiting.totalRpsLimit': 200,
            'rateLimiting.rpsLimitForServiceName': {
                'time-series-server': 800
            }
        }
    },
    buckets: [
        25, 25, 25, 25
    ],
    clientTimeout: 500,
    endpointToRequest: 'echo-endpoint',
    requestBody: TimeSeriesCluster.buildString(10),

    clientInstances: 1,
    clientBatchDelay: 100,
    numBatchesInBucket: 10,
    clientRequestsPerBatch: 25,
    clientRequestsPerBatchForFirstBucket: 10
}, function t(cluster, assert) {
    cluster.logger.whitelist('info', 'error for timed out outgoing response');
    cluster.logger.whitelist('info', 'forwarding expected error frame');
    cluster.logger.whitelist('info', 'expected error while forwarding');
    cluster.logger.whitelist('info', 'OutResponse.send() after inreq timed out');
    cluster.logger.whitelist('warn', 'forwarding error frame');
    cluster.logger.whitelist('warn', 'mismatched conn.onReqDone');
    cluster.logger.whitelist('info', 'ignoring outresponse.send on a closed connection');
    cluster.logger.whitelist('info', 'ignoring outresponse.sendError on a closed connection');
    cluster.logger.whitelist('info', 'popOutReq received for unknown or lost id');
    cluster.logger.whitelist('info', 'hyperbahn node is rate-limited by the total rps limit');

    var apps = cluster._cluster.getExitNodes('time-series-server');

    // Set rate on a single Hyperbahn worker
    apps[0].clients .serviceProxy
        .rateLimiter.updateTotalLimit(OVERLOADED_WORKER_RATELIMIT);

    // cluster.printBatches();
    cluster.sendRequests(onResults);

    function onResults(err, results) {
        assert.ifError(err);

        // Ignore first bucket as it's the warmup bucket
        // which is a statistical outlier for this test.
        for (var i = 1; i < cluster.buckets.length; i++) {
            cluster.assertRange(assert, {
                value: results[i].errorCount,
                min: 0,
                max: 0,
                description: ' error rate ',
                index: i
            });

            if (results[i].errorCount > 0) {
                /* eslint no-console: 0 */
                console.log('# results', results[i]);
            }
        }

        var logLines = cluster.logger.items();

        // We made 250 req/s for 4 seconds. We expect at least
        // 1 requests out of a 1000 to be rate limited by
        // worker[4]
        var rateLimits = logLines.filter(isRateLimit);
        assert.ok(rateLimits.length >= 1,
            'expect at least 1 attempts to be rate limited ' +
            'but is: ' + rateLimits.length);

        assert.ok(rateLimits.every(function checkLog(r) {
            if (r.meta.rpsLimit !== OVERLOADED_WORKER_RATELIMIT) {
                console.log('wat', r.meta);
            }

            return r.meta.rpsLimit === OVERLOADED_WORKER_RATELIMIT;
        }), 'rate limit should be ' + OVERLOADED_WORKER_RATELIMIT);

        assert.end();
    }
});

function isRateLimit(logRecord) {
    return logRecord.msg === 'hyperbahn node is rate-limited by the total rps limit';
}


text:
FOUNDATION_EXPORT double Pods_srcVersionNumber;
FOUNDATION_EXPORT const unsigned char Pods_srcVersionString[];


text:
from datetime import datetime as dt
from delorean import Delorean

def date_to_delorean(year, month, day):
    """ Converts date arguments to a Delorean instance in UTC

    Args:
        year: int between 1 and 9999.
        month: int between 1 and 12.
        day: int between 1 and 31.

    Returns:
        Delorean instance in UTC of date.
    """
    return Delorean(datetime=dt(year, month, day), timezone='UTC')

def date_to_epoch(year, month, day):
    """ Converts a date to epoch in UTC

    Args:
        year: int between 1 and 9999.
        month: int between 1 and 12.
        day: int between 1 and 31.

    Returns:
        Int epoch in UTC from date.
    """
    return int(date_to_delorean(year, month, day).epoch)

def now_delorean():
    """ Returns the current time as a Delorean instance in UTC """
    return Delorean(timezone='UTC')

def shift_epoch(delorean, direction, unit, count):
    """ Gets the resulting epoch after a time shift of a Delorean

    Args:
        delorean: Delorean datetime instance to shift from.
        direction: String to shift time forwards or backwards.
            Valid values: 'last', 'next'.
        unit: String of time period unit for count argument.
            What unit in direction should be shifted?
            Valid values: 'hour', 'day', 'week', 'month', 'year'.
        count: Int of units.
            How many units to shift in direction?

    Returns:
        Int epoch in UTC from a shifted Delorean
    """
    return int(delorean._shift_date(direction, unit, count).epoch)

def generate_epochs(delorean, direction, unit, count):
    """ Generates epochs from a shifted Delorean instance

    Args:
        delorean: Delorean datetime instance to shift from.
        direction: String to shift time forwards or backwards.
            Valid values: 'last', 'next'.
        unit: String of time period unit for count argument.
            What unit in direction should be shifted?
            Valid values: 'hour', 'day', 'week', 'month', 'year'.
        count: Int of units.
            How many units to shift in direction?

    Returns:
        Generator of count int epochs in UTC from a shifted Delorean
    """
    for shift in range(count):
        yield int(delorean._shift_date(direction, unit, shift).epoch)

def get_end_start_epochs(year, month, day, direction, unit, count):
    """ Gets epoch from a start date and epoch from a shifted date

    Args:
        year: Int between 1 and 9999.
        month: Int between 1 and 12.
        day: Int between 1 and 31.
        direction: String to shift time forwards or backwards.
            Valid values: 'last', 'next'.
        unit: String of time period unit for count argument.
            How far back to check historical market data.
            Valid values: 'hour', 'day', 'week', 'month', 'year'.
        count: Int of units.
            How far back to check historical market data?

    Returns:
        Dict of int epochs in UTC with keys 'initial' and 'shifted'
    """
    if year or month or day: # Date is specified
        if not year:
            year = 2017
        if not month:
            month = 1
        if not day:
            day = 1
        initial_delorean = date_to_delorean(year, month, day)
    else: # Date is not specified, get current date
        count += 1 # Get another date because market is still open
        initial_delorean = now_delorean()

    initial_epoch = int(initial_delorean.epoch)
    shifted_epoch = shift_epoch(initial_delorean, direction, unit, count)
    return { 'initial': initial_epoch, 'shifted': shifted_epoch }


text:
import { expect } from "chai";
import { convertInvoker } from "../../src/common/encoding";

describe("convertInvoker", () => {
  it("should raise an error on empty array", () => {
    expect(() => convertInvoker([])).to.throw;
  });

  it("should raise an error on empty string", () => {
    expect(() => convertInvoker("")).to.throw;
  });

  it("should raise an error on empty string with service accounts", () => {
    expect(() => convertInvoker(["service-account@", ""])).to.throw;
  });

  it("should raise an error on mixing public and service accounts", () => {
    expect(() => convertInvoker(["public", "service-account@"])).to.throw;
  });

  it("should raise an error on mixing private and service accounts", () => {
    expect(() => convertInvoker(["private", "service-account@"])).to.throw;
  });

  it("should return the correct public invoker", () => {
    const invoker = convertInvoker("public");

    expect(invoker).to.deep.equal(["public"]);
  });

  it("should return the correct private invoker", () => {
    const invoker = convertInvoker("private");

    expect(invoker).to.deep.equal(["private"]);
  });

  it("should return the correct scalar invoker", () => {
    const invoker = convertInvoker("service-account@");

    expect(invoker).to.deep.equal(["service-account@"]);
  });

  it("should return the correct array invoker", () => {
    const invoker = convertInvoker(["service-account1@", "service-account2@"]);

    expect(invoker).to.deep.equal(["service-account1@", "service-account2@"]);
  });
});


text:
package hu.fordprog.regx;

import com.beust.jcommander.JCommander;
import com.beust.jcommander.Parameter;

import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import hu.fordprog.regx.input.ConstantInputReader;
import hu.fordprog.regx.input.FileInputReader;
import hu.fordprog.regx.input.InputReader;
import hu.fordprog.regx.input.StdinInputReader;
import hu.fordprog.regx.interpreter.Interpreter;

public class App {
  /*
   * Remove in release
   */
  private static final boolean DEBUG = true;

  public static void main(String[] args) {
    Arguments arguments = new Arguments();

    JCommander jCommander = new JCommander(arguments, args);

    try {
      startInterpreter(arguments);
    } catch (FileNotFoundException e) {
      System.out.println("Could not open output file: " + e.toString());

      System.out.println("Aborting");
    }
  }

  private static void startInterpreter(Arguments arguments) throws FileNotFoundException{
    Interpreter interpreter =
        Interpreter.builder()
                   .inputReader(getInput(arguments))
                   .outputWriter(getOutput(arguments))
                   .verbose(arguments.verbose)
                   .build();

    interpreter.interpret();
  }

  private static PrintWriter getOutput(Arguments arguments) throws FileNotFoundException {
    if (arguments.outputPath == null) {
      return new PrintWriter(System.out, true);
    }

    return new PrintWriter(arguments.outputPath);
  }

  private static InputReader getInput(Arguments arguments) {
    /*
     * Remove in release
     */
    /*
    if (DEBUG) {
      String str =
      "function void main() { regex asd = /((ab+c*)d*)*/;"
          + " regex b = simplify(asd); print(asText(b));}";

      return new ConstantInputReader(str);
    }
    */
    if (arguments.files.isEmpty()) {
      return new StdinInputReader();
    }

    return FileInputReader.fromPath(arguments.files.get(0));
  }

  private static final class Arguments {
    @Parameter(description = "Files to be interpreted")
    private List<String> files = new ArrayList<>();

    @Parameter(names = { "--verbose", "-v" }, description = "Verbose output")
    private boolean verbose;

    @Parameter(names = { "--output", "-o" }, description = "Output file path")
    private String outputPath;
  }
}


text:
import signal

from sqlalchemy import Column, Integer, String, Unicode, ForeignKey, Text
from sqlalchemy import DateTime
from sqlalchemy.orm import relationship, backref
from sqlalchemy.orm.session import object_session
from sqlalchemy.ext.declarative import declarative_base
from sqlalchemy.schema import UniqueConstraint
from structlog import get_logger
from dateutil.parser import parse
from dateutil import tz
from datetime import datetime

from deployer import registry, database as db
from deployer.utils import get_container_ip
from deployer.hosts.models import Host

logger = get_logger()
Base = declarative_base()

class InstanceStateFilterMixin(object):
    @property
    def active_instances(self):
        return self.instances.filter(Instance.stopped == None)

    @property
    def inactive_instances(self):
        return self.instances.filter(Instance.stopped != None).order_by(
            Instance.stopped.desc())

class Application(InstanceStateFilterMixin, Base):
    __tablename__ = 'application'

    id = Column(Integer(), primary_key=True)
    key = Column(String(20), nullable=False, unique=True)
    name = Column(Unicode(120), nullable=False)
    description = Column(Text(), nullable=True)
    registry = Column(String(120), nullable=False)
    repository = Column(String(120), nullable=False)

    @property
    def full_repository(self):
        return '{}/{}'.format(self.registry, self.repository)

    def update_builds(self, session=None):
        log = logger.bind(
            app=self.key,
            registry=self.registry,
            repository=self.repository,
        )

        log.info('apps.update_started')

        remote_registry = registry.Registry(self.registry)
        tags = remote_registry.tags(self.repository)

        log.debug('apps.tags_fetched', count=len(tags))

        for tag, image in tags.iteritems():
            build = self.builds.filter(Build.tag == tag).first()
            needs_update = False
            if build:
                if build.image != image:
                    needs_update = True
                    log.info('apps.tag_changed', tag=tag,
                             old_image=build.image, new_image=image)
            else:
                build = Build(tag=tag)
                self.builds.append(build)
                needs_update = True
                log.info('apps.tag_added', image=image, tag=tag)

            if needs_update:
                spec = remote_registry.image_info(image)
                created = (parse(spec['created'])
                           .astimezone(tz.tzutc())
                           .replace(tzinfo=None))
                build.image = image
                build.created = created
                build.spec = spec

        log.info('apps.update_done')

    def get_instances(self, session):
        return (session.query(Instance)
                .join(Build)
                .filter(Build.application == self))

    @property
    def instances(self):
        return self.get_instances(object_session(self))

class Build(InstanceStateFilterMixin, Base):
    __tablename__ = 'build'

    id = Column(Integer(), primary_key=True)
    tag = Column(String(64), nullable=False)
    image = Column(String(64), nullable=False)
    created = Column(DateTime(), nullable=False)
    spec = Column(db.JSON(), nullable=False)
    application_id = Column(Integer(), ForeignKey('application.id'),
                            nullable=False)
    application = relationship(
        Application,
        backref=backref('builds', lazy='dynamic', order_by=created.desc())
    )

    __table_args__ = (
        UniqueConstraint('application_id', 'tag', name='build_id'),
    )

    @property
    def full_image(self):
        return '{}:{}'.format(self.application.full_repository, self.tag)

    def deploy(self, host, config):
        client = host.get_client()

        ports = {'{0[port]}/{0[type]}'.format(p): {} for p in config['ports']}
        volumes = {v: {} for v in config['shared-folders']}
        binds = {v: k for k, v in config['shared-folders'].iteritems()}

        port_bindings = (
            p for p in config['ports']
            if 'host_ip' in p or 'host_port' in p
        )
        port_bindings = {
            '{0[type]}/{0[port]}'.format(p): [{
                'HostIp': p.get('host_ip', ''),
                'HostPort': p.get('host_port', ''),
            }]
            for p in port_bindings
        }

        links = {v[1:]: k for k, v in config['links'].iteritems()}

        client.pull(
            self.application.full_repository,
            self.tag
        )

        container = client.create_container(
            self.full_image,
            command=['django-admin.py', 'runuwsgi'],
            #stdin_open=True, tty=True,
            ports=ports,
            volumes=volumes,
            environment=config['environment']
        )

        client.start(
            container,
            binds=binds,
            port_bindings=port_bindings,
            links=links
        )

        return Instance(
            started=datetime.now(),
            build=self,
            host=host,
            config=config,
            container=container['Id'],
        )

class DeploymentTemplate(Base):
    __tablename__ = 'deployment_template'

    id = Column(Integer(), primary_key=True)
    name = Column(Unicode(120), nullable=False)
    description = Column(Text(), nullable=True)
    application_id = Column(
        Integer(),
        ForeignKey('application.id'),
        nullable=False
    )
    application = relationship(
        Application,
        backref=backref('templates', lazy='dynamic')
    )
    template = Column(db.JSON(), nullable=False)

    __table_args__ = (
        UniqueConstraint('application_id', 'name', name='template_id'),
    )

class Instance(Base):
    __tablename__ = 'instance'

    id = Column(Integer(), primary_key=True)
    started = Column(DateTime(), nullable=False)
    stopped = Column(DateTime(), nullable=True)

    build_id = Column(Integer(), ForeignKey('build.id'), nullable=False)
    build = relationship(
        Build,
        backref=backref('instances', lazy='dynamic', order_by=started.desc())
    )

    host_id = Column(Integer(), ForeignKey(Host.id), nullable=False)
    host = relationship(
        Host,
        backref=backref('instances', lazy='dynamic', order_by=started.desc())
    )

    config = Column(db.JSON(), nullable=False)
    container = Column(String(64), nullable=False)

    def get_logs(self):
        # TODO: Override version until
        # https://github.com/dotcloud/docker-py/pull/105
        # isn't merged and released.
        client = self.host.get_client(version='1.5')
        return client.logs(self.container)

    def get_ip(self):
        client = self.host.get_client()
        return get_container_ip(client, self.container)

    def stop(self):
        client = self.host.get_client()
        client.kill(self.container, signal=signal.SIGINT)
        client.wait(self.container)
        self.stopped = datetime.now()


text:
package org.jnbt;

import java.util.Collections;
import java.util.Map;

/**
 * The TAG_Compound tag.
 * @author Graham Edgecombe
 *
 */
public final class CompoundTag extends Tag {

	/**
	 * The value.
	 */
	private final Map<String, Tag> value;

	/**
	 * Creates the tag.
	 * @param name The name.
	 * @param value The value.
	 */
	public CompoundTag(String name, Map<String, Tag> value) {
		super(name);
		this.value = Collections.unmodifiableMap(value);
	}

	@Override
	public Map<String, Tag> getValue() {
		return value;
	}

	@Override
	public String toString() {
		String name = getName();
		String append = "";
		if(name != null && !name.equals("")) {
			append = "(\"" + this.getName() + "\")";
		}
		StringBuilder bldr = new StringBuilder();
		bldr.append("TAG_Compound" + append + ": " + value.size() + " entries\r\n{\r\n");
		for(Map.Entry<String, Tag> entry : value.entrySet()) {
			bldr.append("   " + entry.getValue().toString().replaceAll("\r\n", "\r\n   ") + "\r\n");
		}
		bldr.append("}");
		return bldr.toString();
	}

}