|
| template<typename Point1 , typename Point2 > |
| void | add_point (Point1 &p1, Point2 const &p2) |
| | Adds a point to another. More...
|
| |
| template<typename Point > |
| void | add_value (Point &p, typename detail::param< Point >::type value) |
| | Adds the same value to each coordinate of a point. More...
|
| |
| template<typename Geometry , typename RangeOrPoint > |
| void | append (Geometry &geometry, RangeOrPoint const &range_or_point, int ring_index=-1, int multi_index=0) |
| | Appends one or more points to a linestring, ring, polygon, multi-geometry. More...
|
| |
| template<typename Geometry > |
default_area_result< Geometry >
::type | area (Geometry const &geometry) |
| | Calculates the area of a geometry. More...
|
| |
| template<typename Geometry , typename Strategy > |
| Strategy::return_type | area (Geometry const &geometry, Strategy const &strategy) |
| | Calculates the area of a geometry using the specified strategy. More...
|
| |
| template<typename Geometry , int Dimensions> |
| void | assert_dimension () |
| | assert_dimension, enables compile-time checking if coordinate dimensions are as expected More...
|
| |
| template<typename G1 , typename G2 > |
| void | assert_dimension_equal () |
| | assert_dimension_equal, enables compile-time checking if coordinate dimensions of two geometries are equal More...
|
| |
| template<typename Geometry , int Dimensions> |
| void | assert_dimension_greater_equal () |
| |
| template<typename Geometry , int Dimensions> |
| void | assert_dimension_less_equal () |
| | assert_dimension, enables compile-time checking if coordinate dimensions are as expected More...
|
| |
| template<typename Geometry1 , typename Geometry2 > |
| void | assign (Geometry1 &geometry1, Geometry2 const &geometry2) |
| | Assigns one geometry to another geometry. More...
|
| |
| template<typename Geometry > |
| void | assign_inverse (Geometry &geometry) |
| | assign to a box inverse infinite More...
|
| |
| template<typename Point1 , typename Point2 > |
| void | assign_point (Point1 &p1, Point2 const &p2) |
| | Assign a point with another. More...
|
| |
| template<typename Geometry , typename Range > |
| void | assign_points (Geometry &geometry, Range const &range) |
| | Assign a range of points to a linestring, ring or polygon. More...
|
| |
| template<typename Point > |
| void | assign_value (Point &p, typename detail::param< Point >::type value) |
| | Assign each coordinate of a point the same value. More...
|
| |
| template<typename Geometry , typename Type > |
| void | assign_values (Geometry &geometry, Type const &c1, Type const &c2) |
| | Assign two coordinates to a geometry (usually a 2D point) More...
|
| |
| template<typename Geometry , typename Type > |
| void | assign_values (Geometry &geometry, Type const &c1, Type const &c2, Type const &c3) |
| | Assign three values to a geometry (usually a 3D point) More...
|
| |
| template<typename Geometry , typename Type > |
| void | assign_values (Geometry &geometry, Type const &c1, Type const &c2, Type const &c3, Type const &c4) |
| | Assign four values to a geometry (usually a box or segment) More...
|
| |
| template<typename Geometry > |
| void | assign_zero (Geometry &geometry) |
| | assign zero values to a box, point More...
|
| |
| template<typename Input , typename Output , typename Distance > |
| void | buffer (Input const &geometry_in, Output &geometry_out, Distance const &distance, Distance const &chord_length=-1) |
| | Calculates the buffer of a geometry. More...
|
| |
| template<typename GeometryIn , typename MultiPolygon , typename DistanceStrategy , typename SideStrategy , typename JoinStrategy , typename EndStrategy , typename PointStrategy > |
| void | buffer (GeometryIn const &geometry_in, MultiPolygon &geometry_out, DistanceStrategy const &distance_strategy, SideStrategy const &side_strategy, JoinStrategy const &join_strategy, EndStrategy const &end_strategy, PointStrategy const &point_strategy) |
| | Calculates the buffer of a geometry. More...
|
| |
| template<typename Geometry , typename Point , typename Strategy > |
| void | centroid (Geometry const &geometry, Point &c, Strategy const &strategy) |
| | Calculates the centroid of a geometry using the specified strategy. More...
|
| |
| template<typename Geometry , typename Point > |
| void | centroid (Geometry const &geometry, Point &c) |
| | Calculates the centroid of a geometry. More...
|
| |
| template<typename Geometry > |
| void | clear (Geometry &geometry) |
| | Clears a linestring, ring or polygon (exterior+interiors) or multi*. More...
|
| |
| template<typename Collection , typename Geometry > |
| void | collect_vectors (Collection &collection, Geometry const &geometry) |
| |
| template<typename Geometry1 , typename Geometry2 , typename Strategy > |
comparable_distance_result
< Geometry1, Geometry2,
Strategy >::type | comparable_distance (Geometry1 const &geometry1, Geometry2 const &geometry2, Strategy const &strategy) |
| | Calculate the comparable distance measurement of two geometries using the specified strategy. More...
|
| |
| template<typename Geometry1 , typename Geometry2 > |
default_comparable_distance_result
< Geometry1, Geometry2 >::type | comparable_distance (Geometry1 const &geometry1, Geometry2 const &geometry2) |
| | Calculate the comparable distance measurement of two geometries. More...
|
| |
| template<typename Geometry1 , typename Geometry2 > |
| void | convert (Geometry1 const &geometry1, Geometry2 &geometry2) |
| | Converts one geometry to another geometry. More...
|
| |
| template<typename Geometry , typename OutputGeometry , typename Strategy > |
| void | convex_hull (Geometry const &geometry, OutputGeometry &out, Strategy const &strategy) |
| |
| template<typename Geometry , typename OutputGeometry > |
| void | convex_hull (Geometry const &geometry, OutputGeometry &hull) |
| | Calculates the convex hull of a geometry. More...
|
| |
| template<bool Reverse, typename Geometry , typename SegmentIdentifier , typename PointOut > |
| bool | copy_segment_point (Geometry const &geometry, SegmentIdentifier const &seg_id, int offset, PointOut &point_out) |
| | Helper function, copies a point from a segment. More...
|
| |
| template<bool Reverse1, bool Reverse2, typename Geometry1 , typename Geometry2 , typename SegmentIdentifier , typename PointOut > |
| bool | copy_segment_point (Geometry1 const &geometry1, Geometry2 const &geometry2, SegmentIdentifier const &seg_id, int offset, PointOut &point_out) |
| | Helper function, to avoid the same construct several times, copies a point, based on a source-index and two geometries. More...
|
| |
| template<bool Reverse1, bool Reverse2, typename Geometry1 , typename Geometry2 , typename SegmentIdentifier , typename PointOut > |
| bool | copy_segment_points (Geometry1 const &geometry1, Geometry2 const &geometry2, SegmentIdentifier const &seg_id, PointOut &point1, PointOut &point2) |
| | Helper function, to avoid the same construct several times, copies a point, based on a source-index and two geometries. More...
|
| |
| template<bool Reverse1, bool Reverse2, typename Geometry1 , typename Geometry2 , typename SegmentIdentifier , typename PointOut > |
| bool | copy_segment_points (Geometry1 const &geometry1, Geometry2 const &geometry2, SegmentIdentifier const &seg_id, PointOut &point1, PointOut &point2, PointOut &point3) |
| | Helper function, copies three points: two from the specified segment (from, to) and the next one. More...
|
| |
| template<bool Reverse, typename Geometry , typename SegmentIdentifier , typename RobustPolicy , typename RangeOut > |
| void | copy_segments (Geometry const &geometry, SegmentIdentifier const &seg_id, signed_size_type to_index, RobustPolicy const &robust_policy, RangeOut &range_out) |
| | Copy segments from a geometry, starting with the specified segment (seg_id) until the specified index (to_index) More...
|
| |
| template<typename Geometry > |
| void | correct (Geometry &geometry) |
| | Corrects a geometry. More...
|
| |
| template<typename Geometry1 , typename Geometry2 > |
| bool | covered_by (Geometry1 const &geometry1, Geometry2 const &geometry2) |
| | Checks if the first geometry is inside or on border the second geometry. More...
|
| |
| template<typename Geometry1 , typename Geometry2 , typename Strategy > |
| bool | covered_by (Geometry1 const &geometry1, Geometry2 const &geometry2, Strategy const &strategy) |
| | Checks if the first geometry is inside or on border the second geometry using the specified strategy. More...
|
| |
| template<typename ResultP , typename P1 , typename P2 > |
| ResultP | cross_product (P1 const &p1, P2 const &p2) |
| | Computes the cross product of two vectors. More...
|
| |
| template<typename P > |
| P | cross_product (P const &p1, P const &p2) |
| | Computes the cross product of two vectors. More...
|
| |
| template<typename Geometry1 , typename Geometry2 > |
| bool | crosses (Geometry1 const &geometry1, Geometry2 const &geometry2) |
| | Checks if two geometries crosses. More...
|
| |
| template<typename Geometry1 , typename Geometry2 , typename Collection > |
| void | difference (Geometry1 const &geometry1, Geometry2 const &geometry2, Collection &output_collection) |
| |
| template<typename Geometry1 , typename Geometry2 > |
| bool | disjoint (Geometry1 const &geometry1, Geometry2 const &geometry2) |
| | Checks if two geometries are disjoint. More...
|
| |
| template<typename Geometry1 , typename Geometry2 , typename Strategy > |
distance_result< Geometry1,
Geometry2, Strategy >::type | distance (Geometry1 const &geometry1, Geometry2 const &geometry2, Strategy const &strategy) |
| | Calculate the distance of two geometries using the specified strategy. More...
|
| |
| template<typename Geometry1 , typename Geometry2 > |
default_distance_result
< Geometry1, Geometry2 >::type | distance (Geometry1 const &geometry1, Geometry2 const &geometry2) |
| | Calculate the distance of two geometries. More...
|
| |
| template<typename Point1 , typename Point2 > |
| void | divide_point (Point1 &p1, Point2 const &p2) |
| | Divides a point by another. More...
|
| |
| template<typename Point > |
| void | divide_value (Point &p, typename detail::param< Point >::type value) |
| | Divides each coordinate of the same point by a value. More...
|
| |
| template<typename Point1 , typename Point2 > |
select_coordinate_type< Point1,
Point2 >::type | dot_product (Point1 const &p1, Point2 const &p2) |
| | Computes the dot product (or scalar product) of 2 vectors (points). More...
|
| |
| template<bool Reverse1, bool Reverse2, overlay_type OverlayType, typename Turns , typename Clusters , typename Geometry1 , typename Geometry2 , typename RobustPolicy , typename Strategy > |
| void | enrich_intersection_points (Turns &turns, Clusters &clusters, Geometry1 const &geometry1, Geometry2 const &geometry2, RobustPolicy const &robust_policy, Strategy const &strategy) |
| | All intersection points are enriched with successor information. More...
|
| |
| template<typename Geometry , typename Box > |
| void | envelope (Geometry const &geometry, Box &mbr) |
| | Calculates the envelope of a geometry. More...
|
| |
| template<typename Geometry1 , typename Geometry2 > |
| bool | equals (Geometry1 const &geometry1, Geometry2 const &geometry2) |
| | Checks if a geometry are spatially equal. More...
|
| |
| template<typename Box , typename Geometry > |
| void | expand (Box &box, Geometry const &geometry) |
| | Expands a box using the bounding box (envelope) of another geometry (box, point) More...
|
| |
| template<typename Polygon > |
| ring_return_type< Polygon >::type | exterior_ring (Polygon &polygon) |
| | Function to get the exterior_ring ring of a polygon. More...
|
| |
| template<typename Polygon > |
ring_return_type< Polygon
const >::type | exterior_ring (Polygon const &polygon) |
| | Function to get the exterior ring of a polygon (const version) More...
|
| |
| template<std::size_t Edge, typename Geometry , typename Extremes , typename Intruders > |
| bool | extreme_points (Geometry const &geometry, Extremes &extremes, Intruders &intruders) |
| | Returns extreme points (for Edge=1 in dimension 1, so the top, for Edge=0 in dimension 0, the right side) More...
|
| |
| template<typename Point , typename Op > |
| void | for_each_coordinate (Point &point, Op operation) |
| |
| template<typename Point , typename Op > |
| Op | for_each_coordinate (Point const &point, Op operation) |
| |
| template<typename Geometry , typename Functor > |
| Functor | for_each_point (Geometry &geometry, Functor f) |
| | Applies function [*f] to each point. More...
|
| |
| template<typename Geometry , typename Functor > |
| Functor | for_each_segment (Geometry &geometry, Functor f) |
| | Applies function [*f] to each segment. More...
|
| |
| template<std::size_t Dimension, typename Geometry > |
| coordinate_type< Geometry >::type | get (Geometry const &geometry) |
| | Get coordinate value of a geometry (usually a point) More...
|
| |
| template<std::size_t Index, std::size_t Dimension, typename Geometry > |
| coordinate_type< Geometry >::type | get (Geometry const &geometry) |
| | get coordinate value of a Box or Segment More...
|
| |
| template<std::size_t Dimension, typename Geometry > |
fp_coordinate_type< Geometry >
::type | get_as_radian (Geometry const &geometry) |
| | get coordinate value of a point, result is in Radian More...
|
| |
| template<typename Geometry1 , typename Geometry2 , typename RobustPolicy , typename Turns > |
| void | get_intersection_points (Geometry1 const &geometry1, Geometry2 const &geometry2, RobustPolicy const &robust_policy, Turns &turns) |
| |
| template<std::size_t I, typename Geometry > |
| radius_type< Geometry >::type | get_radius (Geometry const &geometry) |
| | Function to get radius of a circle / sphere / ellipse / etc. More...
|
| |
| template<bool Reverse1, bool Reverse2, typename AssignPolicy , typename Geometry1 , typename Geometry2 , typename RobustPolicy , typename Turns , typename InterruptPolicy > |
| void | get_turns (Geometry1 const &geometry1, Geometry2 const &geometry2, RobustPolicy const &robust_policy, Turns &turns, InterruptPolicy &interrupt_policy) |
| | Calculate the turn points of two geometries. More...
|
| |
| template<typename Point > |
| bool | has_infinite_coordinate (Point const &point) |
| |
| template<typename Point > |
| bool | has_nan_coordinate (Point const &point) |
| |
| template<typename Point > |
| bool | has_non_finite_coordinate (Point const &point) |
| |
| template<typename Iterator > |
| bool | has_one_element (Iterator first, Iterator beyond) |
| |
| template<typename Polygon > |
interior_return_type< Polygon >
::type | interior_rings (Polygon &polygon) |
| | Function to get the interior rings of a polygon (non const version) More...
|
| |
| template<typename Polygon > |
interior_return_type< Polygon
const >::type | interior_rings (Polygon const &polygon) |
| | Function to get the interior rings of a polygon (const version) More...
|
| |
| template<typename Geometry1 , typename Geometry2 , typename GeometryOut > |
| bool | intersection (Geometry1 const &geometry1, Geometry2 const &geometry2, GeometryOut &geometry_out) |
| | Calculate the intersection of two geometries. More...
|
| |
| template<typename Geometry > |
| bool | intersects (Geometry const &geometry) |
| | Checks if a geometry has at least one intersection (crossing or self-tangency) More...
|
| |
| template<typename Geometry1 , typename Geometry2 > |
| bool | intersects (Geometry1 const &geometry1, Geometry2 const &geometry2) |
| | Checks if two geometries have at least one intersection. More...
|
| |
| template<typename Geometry > |
| bool | is_convex (Geometry const &geometry) |
| |
| template<typename Geometry > |
| bool | is_empty (Geometry const &geometry) |
| | Checks if a geometry is the empty set. More...
|
| |
| template<typename Geometry > |
| bool | is_simple (Geometry const &geometry) |
| | Checks if a geometry is simple. More...
|
| |
| template<typename Geometry , typename VisitPolicy > |
| bool | is_valid (Geometry const &geometry, VisitPolicy &visitor) |
| |
| template<typename Geometry > |
| bool | is_valid (Geometry const &geometry) |
| | Checks if a geometry is valid (in the OGC sense) More...
|
| |
| template<typename Geometry > |
| bool | is_valid (Geometry const &geometry, validity_failure_type &failure) |
| | Checks if a geometry is valid (in the OGC sense) More...
|
| |
| template<typename Geometry > |
| bool | is_valid (Geometry const &geometry, std::string &message) |
| | Checks if a geometry is valid (in the OGC sense) More...
|
| |
| template<typename Geometry > |
default_length_result
< Geometry >::type | length (Geometry const &geometry) |
| | Calculates the length of a geometry. More...
|
| |
| template<typename Geometry , typename Strategy > |
default_length_result
< Geometry >::type | length (Geometry const &geometry, Strategy const &strategy) |
| | Calculates the length of a geometry using the specified strategy. More...
|
| |
| template<typename Geometry , typename Type > |
| Geometry | make (Type const &c1, Type const &c2) |
| | Construct a geometry. More...
|
| |
| template<typename Geometry , typename Type > |
| Geometry | make (Type const &c1, Type const &c2, Type const &c3) |
| | Construct a geometry. More...
|
| |
| template<typename Geometry , typename Type > |
| Geometry | make (Type const &c1, Type const &c2, Type const &c3, Type const &c4) |
| |
| template<typename Geometry > |
| Geometry | make_inverse () |
| | Construct a box with inverse infinite coordinates. More...
|
| |
| template<typename Geometry > |
| Geometry | make_zero () |
| | Construct a geometry with its coordinates initialized to zero. More...
|
| |
| template<typename RangeOfIntervals , typename T > |
boost::range_value
< RangeOfIntervals >
::type::difference_type | maximum_gap (RangeOfIntervals const &range_of_intervals, T &max_gap_left, T &max_gap_right) |
| |
| template<typename RangeOfIntervals > |
boost::range_value
< RangeOfIntervals >
::type::difference_type | maximum_gap (RangeOfIntervals const &range_of_intervals) |
| |
| char | method_char (detail::overlay::method_type const &method) |
| |
| template<typename Point1 , typename Point2 > |
| void | multiply_point (Point1 &p1, Point2 const &p2) |
| | Multiplies a point by another. More...
|
| |
| template<typename Point > |
| void | multiply_value (Point &p, typename detail::param< Point >::type value) |
| | Multiplies each coordinate of a point by the same value. More...
|
| |
| template<typename Geometry > |
| std::size_t | num_geometries (Geometry const &geometry) |
| | Calculates the number of geometries of a geometry. More...
|
| |
| template<typename Geometry > |
| std::size_t | num_interior_rings (Geometry const &geometry) |
| | Calculates the number of interior rings of a geometry. More...
|
| |
| template<typename Geometry > |
| std::size_t | num_points (Geometry const &geometry, bool add_for_open=false) |
| | Calculates the number of points of a geometry. More...
|
| |
| template<typename Geometry > |
| std::size_t | num_segments (Geometry const &geometry) |
| | Calculates the number of segments of a geometry. More...
|
| |
| char | operation_char (detail::overlay::operation_type const &operation) |
| |
| template<typename Geometry1 , typename Geometry2 > |
| bool | overlaps (Geometry1 const &geometry1, Geometry2 const &geometry2) |
| | Checks if two geometries overlap. More...
|
| |
| template<typename Geometry > |
default_length_result
< Geometry >::type | perimeter (Geometry const &geometry) |
| | Calculates the perimeter of a geometry. More...
|
| |
| template<typename Geometry , typename Strategy > |
default_length_result
< Geometry >::type | perimeter (Geometry const &geometry, Strategy const &strategy) |
| | Calculates the perimeter of a geometry using the specified strategy. More...
|
| |
| template<typename Point , typename Geometry > |
| bool | point_on_border (Point &point, Geometry const &geometry, bool midpoint=false) |
| | Take point on a border. More...
|
| |
| template<typename Geometry , typename Point > |
| void | point_on_surface (Geometry const &geometry, Point &point) |
| | Assigns a Point guaranteed to lie on the surface of the Geometry. More...
|
| |
| template<typename Geometry > |
| point_iterator< Geometry > | points_begin (Geometry &geometry) |
| |
| template<typename Geometry > |
| point_iterator< Geometry > | points_end (Geometry &geometry) |
| |
| template<typename Geometry > |
| point_reverse_iterator< Geometry > | points_rbegin (Geometry &geometry) |
| |
| template<typename Geometry > |
| point_reverse_iterator< Geometry > | points_rend (Geometry &geometry) |
| |
| template<typename Geometry , typename Section > |
ring_return_type< Geometry
const >::type | range_by_section (Geometry const &geometry, Section const §ion) |
| | Get full ring (exterior, one of interiors, one from multi) indicated by the specified section. More...
|
| |
| template<typename Geometry > |
| void | read_wkt (std::string const &wkt, Geometry &geometry) |
| | Parses OGC Well-Known Text (WKT (Well-Known Text)) into a geometry (any geometry) More...
|
| |
| template<typename Geometry1 , typename Geometry2 , typename Strategy > |
| void | recalculate (Geometry1 &geometry1, Geometry2 const &geometry2, Strategy const &strategy) |
| |
| template<typename Geometry1 , typename Geometry2 , typename Mask > |
| bool | relate (Geometry1 const &geometry1, Geometry2 const &geometry2, Mask const &mask) |
| | Checks relation between a pair of geometries defined by a mask. More...
|
| |
| template<typename Geometry1 , typename Geometry2 > |
| de9im::matrix | relation (Geometry1 const &geometry1, Geometry2 const &geometry2) |
| | Calculates the relation between a pair of geometries as defined in DE-9IM. More...
|
| |
| template<typename Geometry > |
| void | remove_spikes (Geometry &geometry) |
| |
| template<typename Output , typename Input , typename Distance > |
| Output | return_buffer (Input const &geometry, Distance const &distance, Distance const &chord_length=-1) |
| | Calculates the buffer of a geometry. More...
|
| |
| template<typename Point , typename Geometry > |
| Point | return_centroid (Geometry const &geometry) |
| | Calculates the centroid of a geometry. More...
|
| |
| template<typename Point , typename Geometry , typename Strategy > |
| Point | return_centroid (Geometry const &geometry, Strategy const &strategy) |
| | Calculates the centroid of a geometry using the specified strategy. More...
|
| |
| template<typename Box , typename Geometry > |
| Box | return_envelope (Geometry const &geometry) |
| | Calculates the envelope of a geometry. More...
|
| |
| template<typename Geometry > |
geometry::point_type< Geometry >
::type | return_point_on_surface (Geometry const &geometry) |
| | Returns point guaranteed to lie on the surface of the Geometry. More...
|
| |
| template<typename Geometry > |
| void | reverse (Geometry &geometry) |
| | Reverses the points within a geometry. More...
|
| |
| template<bool Reverse, typename DimensionVector , typename Geometry , typename Sections , typename RobustPolicy > |
| void | sectionalize (Geometry const &geometry, RobustPolicy const &robust_policy, Sections §ions, int source_index=0, std::size_t max_count=10) |
| | Split a geometry into monotonic sections. More...
|
| |
| template<typename Geometry > |
| segment_iterator< Geometry const > | segments_begin (Geometry const &geometry) |
| |
| template<typename Geometry > |
| segment_iterator< Geometry const > | segments_end (Geometry const &geometry) |
| |
| template<typename AssignPolicy , typename Geometry , typename RobustPolicy , typename Turns , typename InterruptPolicy > |
| void | self_turns (Geometry const &geometry, RobustPolicy const &robust_policy, Turns &turns, InterruptPolicy &interrupt_policy) |
| | Calculate self intersections of a geometry. More...
|
| |
| template<std::size_t Dimension, typename Geometry > |
| void | set (Geometry &geometry, typename coordinate_type< Geometry >::type const &value) |
| | Set coordinate value of a geometry (usually a point) More...
|
| |
| template<std::size_t Index, std::size_t Dimension, typename Geometry > |
| void | set (Geometry &geometry, typename coordinate_type< Geometry >::type const &value) |
| | set coordinate value of a Box / Segment More...
|
| |
| template<std::size_t Dimension, typename Geometry > |
| void | set_from_radian (Geometry &geometry, typename fp_coordinate_type< Geometry >::type const &radians) |
| | set coordinate value (in radian) to a point More...
|
| |
| template<std::size_t I, typename Geometry > |
| void | set_radius (Geometry &geometry, typename radius_type< Geometry >::type const &radius) |
| | Function to set the radius of a circle / sphere / ellipse / etc. More...
|
| |
| template<typename Geometry , typename Distance , typename Strategy > |
| void | simplify (Geometry const &geometry, Geometry &out, Distance const &max_distance, Strategy const &strategy) |
| | Simplify a geometry using a specified strategy. More...
|
| |
| template<typename Geometry , typename Distance > |
| void | simplify (Geometry const &geometry, Geometry &out, Distance const &max_distance) |
| | Simplify a geometry. More...
|
| |
| template<typename Point1 , typename Point2 > |
| void | subtract_point (Point1 &p1, Point2 const &p2) |
| | Subtracts a point to another. More...
|
| |
| template<typename Point > |
| void | subtract_value (Point &p, typename detail::param< Point >::type value) |
| | Subtracts the same value to each coordinate of a point. More...
|
| |
| template<typename Geometry > |
| svg_manipulator< Geometry > | svg (Geometry const &geometry, std::string const &style, double size=-1.0) |
| | Manipulator to stream geometries as SVG. More...
|
| |
| template<typename SvgPoint , typename Geometry , typename TransformStrategy > |
| void | svg_map (std::ostream &stream, std::string const &style, double size, Geometry const &geometry, TransformStrategy const &strategy) |
| |
| template<typename Range , typename PriorityQueue , typename InitializationVisitor , typename EventVisitor , typename InterruptPolicy > |
| void | sweep (Range const &range, PriorityQueue &queue, InitializationVisitor &initialization_visitor, EventVisitor &event_visitor, InterruptPolicy const &interrupt_policy) |
| |
| template<typename Range , typename PriorityQueue , typename InitializationVisitor , typename EventVisitor > |
| void | sweep (Range const &range, PriorityQueue &queue, InitializationVisitor &initialization_visitor, EventVisitor &event_visitor) |
| |
| template<typename Geometry1 , typename Geometry2 , typename Collection > |
| void | sym_difference (Geometry1 const &geometry1, Geometry2 const &geometry2, Collection &output_collection) |
| | Calculate the symmetric difference of two geometries. More...
|
| |
| template<typename Geometry > |
| bool | touches (Geometry const &geometry) |
| | Checks if a geometry has at least one touching point (self-tangency) More...
|
| |
| template<typename Geometry1 , typename Geometry2 > |
| bool | touches (Geometry1 const &geometry1, Geometry2 const &geometry2) |
| | Checks if two geometries have at least one touching point (tangent - non overlapping) More...
|
| |
| template<typename Geometry1 , typename Geometry2 , typename Strategy > |
| bool | transform (Geometry1 const &geometry1, Geometry2 &geometry2, Strategy const &strategy) |
| | Transforms from one geometry to another geometry using the specified strategy. More...
|
| |
| template<typename Geometry1 , typename Geometry2 > |
| bool | transform (Geometry1 const &geometry1, Geometry2 &geometry2) |
| | Transforms from one geometry to another geometry using a strategy. More...
|
| |
| template<typename Geometry1 , typename Geometry2 , typename Collection > |
| void | union_ (Geometry1 const &geometry1, Geometry2 const &geometry2, Collection &output_collection) |
| | Combines two geometries which each other. More...
|
| |
| template<typename Geometry > |
| void | unique (Geometry &geometry) |
| | Calculates the minimal set of a geometry. More...
|
| |
| char | visited_char (detail::overlay::visit_info const &v) |
| |
| template<typename Geometry1 , typename Geometry2 > |
| bool | within (Geometry1 const &geometry1, Geometry2 const &geometry2) |
| | Checks if the first geometry is completely inside the second geometry. More...
|
| |
| template<typename Geometry1 , typename Geometry2 , typename Strategy > |
| bool | within (Geometry1 const &geometry1, Geometry2 const &geometry2, Strategy const &strategy) |
| | Checks if the first geometry is completely inside the second geometry using the specified strategy. More...
|
| |
| template<typename Geometry > |
| wkt_manipulator< Geometry > | wkt (Geometry const &geometry) |
| | Main WKT-streaming function. More...
|
| |


I am a website designer from Bangladesh. I love to get new experiences and always learn from my surroundings. I've done some projects.
- Education
2019 - now
Computer Science and Engineering, Daffodil International University
Cuurently, I am doing my B.Sc. in Computer Science & Engineering in Daffodil International University.
2017 - 2018
Demra Ideal College
I had successfully completed my Intermediate Science Course from Demra Ideal College with a good result.
2007 - 2016
Titas Gas Adersha High School
It was my High School. I had successfully completed my Primary School Certificate exam, Junior School Certificate exam and Senior School Certificate exam from Titas Gas Adersha High School with a good result.
2019 - now
Computer Science and Engineering, Brac University
Cuurently, I am doing my B.Sc. in Computer Science & Engineering in Brac University.
2017 - 2018
Dhaka City College
I had successfully completed my Intermediate Science Course from Dhaka City College with a good result.
2010 - 2016
Ideal School and College
It was my High School. I had successfully completed my Primary School Certificate exam, Junior School Certificate exam and Senior School Certificate exam from Ideal School and College with a good result.
2004 - 2009
Ispahani Public School and College
It was my Elementary School and I started my education journey from there.
-
<EMAIL_ADDRESS>-
Phone+88 018 2086 XXXX
-
Websitehttps://github.com/nabilAhmedN
-
AddressDemra, Dhaka-1361, Bangladesh


--- layout: default body_class: blogs page_title: Blog | Vowpal Wabbit page_description: Vowpal Wabbit announcements and blog. ---
Get the latest news and announcements for Vowpal Wabbit.
See the latest code, ask QA, or chat with a team of experts and community to get answers to your questions.


Velle
Velle
Connect . Collaborate . Travel
Create
Join
Already Registered?
Login here
Login
Register
Username:
Password:
Stay signed in
Forgot password?
Login
OR
Sign in with Facebook
Sign in with Google
Username:
Password:
Re-Enter Password:
Date Of Birth (dd/mm/yy)
Male
Female
Register
OR
Register with Facebook
Register with Google


1 write to _keyExchanged
System.Management.Automation (1)
engine\remoting\client\clientremotesessionprotocolstatemachine.cs (1)
262
_keyExchanged
= true;
1 reference to _keyExchanged
System.Management.Automation (1)
engine\remoting\client\clientremotesessionprotocolstatemachine.cs (1)
281
Dbg.Assert(!
_keyExchanged
, "Client should do key exchange only once");


Border Conflict Resolution (width) - groove/none
|
|
border-conflict-w-080 |
|
|
Border Conflict Resolution (width) - inset/hidden
|
|
border-conflict-w-081 |
|
|
Border Conflict Resolution (width) - inset/double
|
|
border-conflict-w-082 |
|
|
Border Conflict Resolution (width) - inset/solid
|
|
border-conflict-w-083 |
|
|
Border Conflict Resolution (width) - inset/dashed
|
|
border-conflict-w-084 |
|
|
Border Conflict Resolution (width) - inset/dotted
|
|
border-conflict-w-085 |
|
|
Border Conflict Resolution (width) - inset/ridge
|
|
border-conflict-w-086 |
|
|
Border Conflict Resolution (width) - inset/outset
|
|
border-conflict-w-087 |
|
|
Border Conflict Resolution (width) - inset/groove
|
|
border-conflict-w-088 |
|
|
Border Conflict Resolution (width) - inset/inset
|
|
border-conflict-w-089 |
|
|
Border Conflict Resolution (width) - inset/none
|
|
border-conflict-w-090 |
|
|
Border Conflict Resolution (width) - none/hidden
|
|
border-conflict-w-091 |
|
|
Border Conflict Resolution (width) - none/double
|
|
border-conflict-w-092 |
|
|
Border Conflict Resolution (width) - none/solid
|
|
border-conflict-w-093 |
|
|
Border Conflict Resolution (width) - none/dashed
|
|
border-conflict-w-094 |
|
|
Border Conflict Resolution (width) - none/dotted
|
|
border-conflict-w-095 |
|
|
Border Conflict Resolution (width) - none/ridge
|
|
border-conflict-w-096 |
|
|
Border Conflict Resolution (width) - inset/outset
|
|
border-conflict-w-097 |
|
|
Border Conflict Resolution (width) - none/groove
|
|
border-conflict-w-098 |
|
|
Border Conflict Resolution (width) - none/inset
|
|
border-conflict-w-099 |
|
|
Border Conflict Resolution (width) - none/none
|
|
border-conflict-width-001 |
|
|
Border Conflict Resolution (by border width): 'dashed' vs. 'dashed' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-002 |
|
|
Border Conflict Resolution (by border width): 'dashed' vs. 'dotted' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-003 |
|
|
Border Conflict Resolution (by border width): 'dashed' vs. 'double' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-004 |
|
|
Border Conflict Resolution (by border width): 'dashed' vs. 'groove' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-005 |
|
|
Border Conflict Resolution (by border width): 'dashed' vs. 'hidden' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-006 |
|
|
Border Conflict Resolution (by border width): 'dashed' vs. 'inset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-007 |
|
|
Border Conflict Resolution (by border width): 'dashed' vs. 'none' - a border style of 'none' is never the dominant border
- The widest border is dominant when two , except when border style is 'none'. If border style is 'none' any other non-none border style is dominant border.
|
|
border-conflict-width-008 |
|
|
Border Conflict Resolution (by border width): 'dashed' vs. 'outset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-009 |
|
|
Border Conflict Resolution (by border width): 'dashed' vs. 'ridge' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-010 |
|
|
Border Conflict Resolution (by border width): 'dashed' vs. 'solid' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-011 |
|
|
Border Conflict Resolution (by border width): 'dotted' vs. 'dashed' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-012 |
|
|
Border Conflict Resolution (by border width): 'dotted' vs. 'dotted' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-013 |
|
|
Border Conflict Resolution (by border width): 'dotted' vs. 'double' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-014 |
|
|
Border Conflict Resolution (by border width): 'dotted' vs. 'groove' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-015 |
|
|
Border Conflict Resolution (by border width): 'dotted' vs. 'hidden' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-016 |
|
|
Border Conflict Resolution (by border width): 'dotted' vs. 'inset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-017 |
|
|
Border Conflict Resolution (by border width): 'dotted' vs. 'none' - a border style of 'none' is never the dominant border
- The widest border is dominant when two , except when border style is 'none'. If border style is 'none' any other non-none border style is dominant border.
|
|
border-conflict-width-018 |
|
|
Border Conflict Resolution (by border width): 'dotted' vs. 'outset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-019 |
|
|
Border Conflict Resolution (by border width): 'dotted' vs. 'ridge' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-020 |
|
|
Border Conflict Resolution (by border width): 'dotted' vs. 'solid' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-021 |
|
|
Border Conflict Resolution (by border width): 'double' vs. 'dashed' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-022 |
|
|
Border Conflict Resolution (by border width): 'double' vs. 'dotted' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-023 |
|
|
Border Conflict Resolution (by border width): 'double' vs. 'double' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-024 |
|
|
Border Conflict Resolution (by border width): 'double' vs. 'groove' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-025 |
|
|
Border Conflict Resolution (by border width): 'double' vs. 'hidden' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-026 |
|
|
Border Conflict Resolution (by border width): 'double' vs. 'inset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-027 |
|
|
Border Conflict Resolution (by border width): 'double' vs. 'none' - a border style of 'none' is never the dominant border
- The widest border is dominant when two , except when border style is 'none'. If border style is 'none' any other non-none border style is dominant border.
|
|
border-conflict-width-028 |
|
|
Border Conflict Resolution (by border width): 'double' vs. 'outset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-029 |
|
|
Border Conflict Resolution (by border width): 'double' vs. 'ridge' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-030 |
|
|
Border Conflict Resolution (by border width): 'double' vs. 'solid' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-031 |
|
|
Border Conflict Resolution (by border width): 'groove' vs. 'dashed' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-032 |
|
|
Border Conflict Resolution (by border width): 'groove' vs. 'dotted' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-033 |
|
|
Border Conflict Resolution (by border width): 'groove' vs. 'double' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-034 |
|
|
Border Conflict Resolution (by border width): 'groove' vs. 'groove' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-035 |
|
|
Border Conflict Resolution (by border width): 'groove' vs. 'hidden' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-036 |
|
|
Border Conflict Resolution (by border width): 'groove' vs. 'inset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-037 |
|
|
Border Conflict Resolution (by border width): 'groove' vs. 'none' - a border style of 'none' is never the dominant border
- The widest border is dominant when two , except when border style is 'none'. If border style is 'none' any other non-none border style is dominant border.
|
|
border-conflict-width-038 |
|
|
Border Conflict Resolution (by border width): 'groove' vs. 'outset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-039 |
|
|
Border Conflict Resolution (by border width): 'groove' vs. 'ridge' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-040 |
|
|
Border Conflict Resolution (by border width): 'groove' vs. 'solid' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-041 |
|
|
Border Conflict Resolution (by border width): 'hidden' vs. 'dashed' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-042 |
|
|
Border Conflict Resolution (by border width): 'hidden' vs. 'dotted' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-043 |
|
|
Border Conflict Resolution (by border width): 'hidden' vs. 'double' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-044 |
|
|
Border Conflict Resolution (by border width): 'hidden' vs. 'groove' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-045 |
|
|
Border Conflict Resolution (by border width): 'hidden' vs. 'hidden' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-046 |
|
|
Border Conflict Resolution (by border width): 'hidden' vs. 'inset' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-047 |
|
|
Border Conflict Resolution (by border width): 'hidden' vs. 'none' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-048 |
|
|
Border Conflict Resolution (by border width): 'hidden' vs. 'outset' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-049 |
|
|
Border Conflict Resolution (by border width): 'hidden' vs. 'ridge' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-050 |
|
|
Border Conflict Resolution (by border width): 'hidden' vs. 'solid' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-051 |
|
|
Border Conflict Resolution (by border width): 'inset' vs. 'dashed' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-052 |
|
|
Border Conflict Resolution (by border width): 'inset' vs. 'dotted' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-053 |
|
|
Border Conflict Resolution (by border width): 'inset' vs. 'double' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-054 |
|
|
Border Conflict Resolution (by border width): 'inset' vs. 'groove' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-055 |
|
|
Border Conflict Resolution (by border width): 'inset' vs. 'hidden' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-056 |
|
|
Border Conflict Resolution (by border width): 'inset' vs. 'inset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-057 |
|
|
Border Conflict Resolution (by border width): 'inset' vs. 'none' - a border style of 'none' is never the dominant border
- The widest border is dominant when two , except when border style is 'none'. If border style is 'none' any other non-none border style is dominant border.
|
|
border-conflict-width-058 |
|
|
Border Conflict Resolution (by border width): 'inset' vs. 'outset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-059 |
|
|
Border Conflict Resolution (by border width): 'inset' vs. 'ridge' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-060 |
|
|
Border Conflict Resolution (by border width): 'inset' vs. 'solid' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-061 |
|
|
Border Conflict Resolution (by border width): 'none' vs. 'dashed' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-062 |
|
|
Border Conflict Resolution (by border width): 'none' vs. 'dotted' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-063 |
|
|
Border Conflict Resolution (by border width): 'none' vs. 'double' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-064 |
|
|
Border Conflict Resolution (by border width): 'none' vs. 'groove' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-065 |
|
|
Border Conflict Resolution (by border width): 'none' vs. 'hidden' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-066 |
|
|
Border Conflict Resolution (by border width): 'none' vs. 'inset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-067 |
|
|
Border Conflict Resolution (by border width): 'none' vs. 'none' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-068 |
|
|
Border Conflict Resolution (by border width): 'none' vs. 'outset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-069 |
|
|
Border Conflict Resolution (by border width): 'none' vs. 'ridge' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-070 |
|
|
Border Conflict Resolution (by border width): 'none' vs. 'solid' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-071 |
|
|
Border Conflict Resolution (by border width): 'outset' vs. 'dashed' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-072 |
|
|
Border Conflict Resolution (by border width): 'outset' vs. 'dotted' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-073 |
|
|
Border Conflict Resolution (by border width): 'outset' vs. 'double' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-074 |
|
|
Border Conflict Resolution (by border width): 'outset' vs. 'groove' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-075 |
|
|
Border Conflict Resolution (by border width): 'outset' vs. 'hidden' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-076 |
|
|
Border Conflict Resolution (by border width): 'outset' vs. 'inset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-077 |
|
|
Border Conflict Resolution (by border width): 'outset' vs. 'none' - a border style of 'none' is never the dominant border
- The widest border is dominant when two , except when border style is 'none'. If border style is 'none' any other non-none border style is dominant border.
|
|
border-conflict-width-078 |
|
|
Border Conflict Resolution (by border width): 'outset' vs. 'outset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-079 |
|
|
Border Conflict Resolution (by border width): 'outset' vs. 'ridge' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-080 |
|
|
Border Conflict Resolution (by border width): 'outset' vs. 'solid' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-081 |
|
|
Border Conflict Resolution (by border width): 'ridge' vs. 'dashed' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-082 |
|
|
Border Conflict Resolution (by border width): 'ridge' vs. 'dotted' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-083 |
|
|
Border Conflict Resolution (by border width): 'ridge' vs. 'double' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-084 |
|
|
Border Conflict Resolution (by border width): 'ridge' vs. 'groove' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-085 |
|
|
Border Conflict Resolution (by border width): 'ridge' vs. 'hidden' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-086 |
|
|
Border Conflict Resolution (by border width): 'ridge' vs. 'inset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-087 |
|
|
Border Conflict Resolution (by border width): 'ridge' vs. 'none' - a border style of 'none' is never the dominant border
- The widest border is dominant when two cell borders collapse, except when border style is 'none'. If border style is 'none' any other non-none border style is dominant border.
|
|
border-conflict-width-088 |
|
|
Border Conflict Resolution (by border width): 'ridge' vs. 'outset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-089 |
|
|
Border Conflict Resolution (by border width): 'ridge' vs. 'ridge' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-090 |
|
|
Border Conflict Resolution (by border width): 'ridge' vs. 'solid' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-091 |
|
|
Border Conflict Resolution (by border width): 'solid' vs. 'dashed' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-092 |
|
|
Border Conflict Resolution (by border width): 'solid' vs. 'dotted' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-093 |
|
|
Border Conflict Resolution (by border width): 'solid' vs. 'double' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-094 |
|
|
Border Conflict Resolution (by border width): 'solid' vs. 'groove' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-095 |
|
|
Border Conflict Resolution (by border width): 'solid' vs. 'hidden' - a border style of 'hidden' is always the dominant border
- The 'hidden' border style takes precedence over all style and width definitions.
|
|
border-conflict-width-096 |
|
|
Border Conflict Resolution (by border width): 'solid' vs. 'inset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-097 |
|
|
Border Conflict Resolution (by border width): 'solid' vs. 'none' - a border style of 'none' is never the dominant border
- The widest border is dominant when two , except when border style is 'none'. If border style is 'none' any other non-none border style is dominant border.
|
|
border-conflict-width-098 |
|
|
Border Conflict Resolution (by border width): 'solid' vs. 'outset' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-099 |
|
|
Border Conflict Resolution (by border width): 'solid' vs. 'ridge' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|
|
border-conflict-width-100 |
|
|
Border Conflict Resolution (by border width): 'solid' vs. 'solid' - border style with largest width is the dominant border
- The widest border is dominant when two cell borders collapse.
|


See my exchanges
Invite a Steemian to exchange upvotes
Enter the name of a Steemit.com account that you wish to exchange upvotes.
This is the percentage of your upvote that you'd like to exchange. Exchanges are always negotiated using the inviter's upvote. The person you invite will have the opportunity to barter with you before they accept. It will always be the percentage of your (inviter's) upvote that is being bartered on.
This is the ratio between your upvote and the person's upvote that you are inviting. This allows whales and minnows to exchange unequal upvotes! Unlike the percentage, it's
their
upvote that is being adjusted. You can adjust the ratio from 0.001:1 (the invitee's upvote is one thousand times bigger than the inviter's upvote) all the way to 1000:1 (the invitee's upvote is one thousandth 1/1000 the size of the inviter's upvote).
1 week
2 weeks
4 weeks
2 months
6 months
1 year
Invite to exchange
Powered by
Artolabs


Social
Facebook
Google+
Gmail
News
New York Times
Boing Boing
Reddit
Programming
Hacker News
Lobste.rs
Github
Dwarf Fortress Development Log
2016-06-20: DF 0.43.04 Released
Wolfire Games Blog
Overgrowth's new game plan
SpyParty – A Spy Game About Subtle Behavior
Finally Revealing the new SpyParty UI Tuesday the 21st, 7pm US Pacific!
Rock, Paper, Shotgun - PC Game Reviews, Previews, Subjectivity
Drone-Mapped Action-RPG ReRoll Is Cancelled
jwz
Megalodon
Evan Dahm
mobydickillustrated: THE CANDLES. “Look aloft!” cried Starbuck....
Dinosaur Comics!
as a person who definitely experiences emotions, i agree! nothin' better than feelin' an emotion, am i right, fellow humans?? i just love to feel *consults list* "powerlessness".
Penny Arcade
News Post: View To A Kill
Saturday Morning Breakfast Cereal
Saturday Morning Breakfast Cereal - Explosives
xkcd.com
AI Research
Cucumber Quest
page 734
Paranatural
Paranatural - Chapter 5 Page 127
Updated 2016-06-21 15:15:34 -0400


Package de.gmxhome.conrad.jpos.jpos_base.electronicvaluerw
package de.gmxhome.conrad.jpos.jpos_base.electronicvaluerw
-
ClassDescriptionOutput request executor for ElectronicValueRW method AccessDailyLog.Output request executor for ElectronicValueRW method AccessData.Output request executor for ElectronicValueRW method AccessLog.Output request executor for ElectronicValueRW method ActivateEVService.Output request executor for ElectronicValueRW method ActivateService.Output request executor for ElectronicValueRW method AddValue.Output request executor for ElectronicValueRW method AuthorizeCompletion.Output request executor for ElectronicValueRW method AuthorizePreSales.Output request executor for ElectronicValueRW method AuthorizeRefund.Output request executor for ElectronicValueRW method AuthorizeSales.Output request executor for ElectronicValueRW method AuthorizeVoid.Output request executor for ElectronicValueRW method AuthorizeVoidPreSales.Output request executor for ElectronicValueRW method CancelValue.Output request executor for ElectronicValueRW method CashDeposit.Output request executor for ElectronicValueRW method CheckCard.Output request executor for ElectronicValueRW method CheckServiceRegistrationToMedium.Output request executor for ElectronicValueRW method CloseDailyEVService.Base output request class for methods with int[] data and Object[] obj as parameters.Output request executor for ElectronicValueRW method DeactivateEVService.Interface for methods that implement property setter and method calls for the ElectronicValueRW device category.Class containing the electronic value reader / writer specific properties, their default values and default implementations of ElectronicValueRWInterface.ElectronicValueRW service implementation.Status update event implementation for ElectronicValueRW devices.Transition event implementation for ElectronicValueRW devices.General part of ElectronicValueRW factory for JPOS devices using this framework.Output request executor for ElectronicValueRW method LockTerminal.Base output request class for methods with int sequenceNumber and int timeout as parameters.Output request executor for ElectronicValueRW method OpenDailyEVService.Base output request class for ElectronicValueRW devices.Output request executor for ElectronicValueRW method QueryLastSuccessfulTransactionResult.Output request executor for ElectronicValueRW method ReadValue.Output request executor for ElectronicValueRW method RegisterServiceToMedium.Output request executor for ElectronicValueRW method SubtractValue.Output request executor for ElectronicValueRW method TransactionAccess.Implementation of a type-safe map of strings using a string key.Output request executor for ElectronicValueRW method UnlockTerminal.Output request executor for ElectronicValueRW method UnregisterServiceToMedium.Output request executor for ElectronicValueRW method UpdateData.Output request executor for ElectronicValueRW method UpdateKey.Output request executor for ElectronicValueRW method WriteValue.


After several years of reading about Amanitas, I thought it was time to give a very low dose a try.
T+0 : 500mg of dried A. muscaria collected on the Mendocino coast of northern California 12 months prior, stored as very dry crisps in a glass jar. Boiling water poured over the chopped wafer of mushrooms and a small amount of lime added to acidify. Let steep for 10 mins, drank liquid.
T + 30: Not surprisingly, no effects felt. My partner decides to try to smoke some of the material so I join her. Betweeen the two of us, over the next 40 minutes, we smoke 350mg of the mushroom through a dry bong. The mushroom materials smokes profusely but the smoke is not as harsh as an equivalent amount of smoke from cannabis or psilocybe mushrooms we've
tried.
T+ 45: Initially there seems like there might be some sort of buzz beginning, but it quickly faded and it was clear that it was just the effect of smoking and not any real Amanita effect.
I stayed awake until about T+3 hours and found myself with just an extremely slight feeling of alteration, but one that is attributeable to smoking anything and being tired.
I suspect my next experiment will be with 2-4gram dose of tea to seek the threshold.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


1/7/2021
7:00AM -> 7:30AM = 30 Minutes studying
7:30AM -> 7:40AM = 10 Minutes pause
7:40AM -> 8:10AM = 30 Minutes studying
8:10AM -> 8:20AM = 10 Minutes pause
8:20AM -> 8:50AM = 30 Minutes studying
8:50AM -> 9:00AM = 10 Minutes pause
9:00AM -> 9:30AM = 30 Minutes studying
9:30AM -> 9:40AM = 10 Minutes pause
9:40AM -> 10:10AM = 30 Minutes studying
10:10AM -> 10:20AM = 10 Minutes pause
10:20AM -> 10:50AM = 30 Minutes studying
10:50AM -> 11:00AM = 10 Minutes pause
11:00AM -> 11:30AM = 30 Minutes studying
11:30AM -> 11:40AM = 10 Minutes pause
11:40AM -> 12:10PM = 30 Minutes studying
12:10PM -> 12:20AM = 10 Minutes pause


The following defines must be included in a
conf_explorer.h header file :
#define LIB_MEM <string.h>
#define LIB_CTRLACCESS "ctrl_access.h"
#define FS_FAT_12 ENABLED
#define FS_FAT_16 ENABLED
#define FS_FAT_32 ENABLED
#define FS_ASCII DISABLED
#define FS_UNICODE ENABLED
#define FS_MULTI_PARTITION DISABLED
#define FS_LEVEL_FEATURES (FSFEATURE_READ | FSFEATURE_WRITE_COMPLET)
#define FS_NB_CACHE_CLUSLIST 3
#define FS_NB_NAVIGATOR 3
#define FS_NAV_ID_COPYFILE 2 // Must be different of current ID used when the paste routine is called.
- FAT System
- It is the module low level, this one decodes the FAT structure.
All routines of the module are private and can't be called by a user. See fat.c,fat_unusual.c
- Navigation
- This module provides the routines :
- to select an ID navigator
- to move in directory tree
- to modify directory tree
- to get information about disk/dir/file
The complete user interface is the public routine provided in the navigation.c C files.
- File
- This module provides the file I/O control.
The routines file_getc() and file_putc() are too slow to transfer many data.
The file_read_buf() and file_write_buf() are developed to transfer many data between the RAM and a file on a memory.
- Note:
- These routines optimize the transfer and if a DMA exists between RAM and memory then it is used.
The
file_read() and
file_write() are developed to transfer many data between a file and another memory or a specific interface.
- Note:
- These routines don't transfer data, but provide an information on the disk segment corresponding to the file.
Overside, it is not necessary to transfer data in the RAM and the chip can use a DMA between two disks to save time.
The complete user interface is the public routine provided in the file.c C files.
- Memory interface
- The interfaces with the memory are :


EVENT DESCRIPTION:
Photowalk is a photography event of the most awaited techno-cultural fest “MERAZ’19”. Capture your surroundings; pour out your imagination into your photographs along with a caption allowing the photograph to be the best photograph of the event.
DURATION OF THE EVENT:
90 minutes
LOCATION:
Campus of IIT BHILAI.
THEME OF THE EVENT:
This is an open theme contest.
RULES AND REGULATIONS OF PHOTOWALK:
1.)Advanced registration is required for entry into the competition. Only the photographers who mails as mentioned below(EMAIL FORMAT) will be permitted to participate.The DEADLINE for mailing is *********
2.)Only ONE Photo can be submitted for the competition.
3.)Participants should bring their own cameras . Cameras will not be provided .Usage of tripod is allowed.
4.)The photos must be submitted via email to the email address<EMAIL_ADDRESS>with the subject PHOTOWALK and the body should contain participant’s name and contact details.
5.)Submissions will not be accepted once the deadline lapses..
6.)IIT BHILAI campus area is restricted for the photowalk.
7.)Submitted photo should contain captured time and the device name with which photo is captured.
8.)Photos should be sent in JPG/JPEG format.
9.)Participants can capture the photo using different filters but
NO EDITING is allowed on the submitted photo.
10.)Photos that portray or otherwise include inappropriate and/or offensive content, including provocative nudity, violence, human rights and/or environmental violation, and/or any other contents deemed to be contrary to the law, religious, cultural & moral traditions and practices of India, are strictly prohibited and will be immediately discarded.
11.)Participants disobeying the above mentioned rules will be disqualified.
12.) In case of any dispute, the decision of the organizing team shall be final.
If you have any queries please feel free to contact any of the Event CoOrdinators.
REGISTRATION DETAILS:
Entry Fee : Rs 100/-
You can transfer the fee through Bhim, GPay, Bank Transfer, Net banking, etc. to the following account:
//write account details here//
EMAIL FORMAT:
Subject: PHOTOWALK
Body:
Name of participant
College Name
Mobile Number
Email Id
Proof of transaction(Transaction ID, Screenshot of payment)
Entry(in given format).
SUBMISSION DEADLINE: 90min after commencement of the event.
JUDGING CRITERIA :
Technical excellence : 30%
Composition : 20%
Creativity & originality : 30%
Visual impact : 20%
EVENT COORDINATORS :
Siram Nikhil<PHONE_NUMBER>
Ankith Masa<PHONE_NUMBER>
Prince Pansari<PHONE_NUMBER>


--- date: 2023-01-24 lastmod: 2023-08-02 title: "Rigging and animating a bulkhead door in Blender" description: "Excited to learn about rigging and animation in Blender, it feels like it took forever to come here. But a journey well worth taking for sure." image: "/assets/blog/bulkhead-door-part3/title-card.png" imageAlt: "A screenshot of Blender, showing a part of the bulkhead door with an armature rendered in front of it. The armature is selected and the Drivers panel is open." linkTitle: "On the long journey learning Blender, I will dive into rigging and animation." banner: "/assets/blog/bulkhead-door-part3/banner" bannerAlt: "A screenshot of Blender, showing a part of the bulkhead door with a selected armature rendered in front of it." summary: "
After having the bulkhead door modeled and textured, all I have so far are a few static images. It's time for rigging and animating the door, finally adding life to it.
" hasImageCompare: true tags: ["post", "3d", "bulkhead"] series: { name: bulkhead, part: 3 } ---Move it! By rigging and animating the door, or at least learning how to do it first. After part one, creating the mesh; and part two, texturing the bulkhead door; I was ready to finally animate the door in Blender. Looking at what I've got so far, I've … wait a second, I did the main door wrong.
On closer inspection of Ron Cobb's sketch, my wife pointed out that the shadows on the door, which I thought were extruded parts, are actually insets.
Does that mean I have to redo parts of the door? I didn't think so at first, but the ever-growing whisper of doubt crept into my ear. I cannot unsee it; I will always know the mistake I made. In the first part of this article series I wrote:
And this is indeed what I will set out to do.
Looking at the drawing again, I found another oversight — a small inset running around the edge of the main frame of the door. With the extrusions on the door that are actually insets, this makes two mistakes I have to correct.
Taking this as an opportunity and applying all I learned throughout last year, I wanted to recreate the main door and change the frame. While on it, I will also rework parts of my topology and fully redo my, as I know now, horrible UVs*.
Adding the inset around the main door frame edge was quickly done. The actual door I rebuilt from scratch, this time with inset parts on the surface of the door, similar to the inner barrier doors. I also reduced the segment count on all bevels, decreasing the overall poly count, as I want to use the door in a game engine.
Here is the final version, both with the extracted barrier doors and the main door closed.
Happy, knowing I did what I could to finally recreate Ron Cobb's drawing as close as possible, I was able to move on, as I already did twice in the previous articles of this series.
While texturing the door, even though I was happy with the workflow provided by Fluent: Materializer, there was one thing that kept me worried: my render times. Every single render I did from the door took roughly 15 to 25 minutes on my machine, an Apple MacBook Air with the M1 chip. This was due to the procedural materials and limitations of my system, so I assumed.
A reasonable fix would be to bake the procedural materials into static textures. Even though Fluent: Materializer comes with baking support, this never really worked for me. The main issue was that I was only able to bake one material at a time. In the end, I wanted to have one texture for everything.
One way I could solve that is by baking every material one at a time and, with some image processing software, combining those images into one texture. Thinking about an efficient workflow, this did not strike me as a scalable approach.
The Blender add-on SimpleBake got my back — no affiliation, just a happy user. To use it, I had to prepare some things. For one, I needed to ensure that my UVs do not have any overlapping islands; after my last rework, this was easy enough and already done.
Second and last, I needed to configure SimpleBake: give it a list of objects to bake, what textures to create, texture resolution, how to export, and if a copy of the objects with the applied textures should be created inside the project.
After having this set up once for the project, I can bake and re-bake textures with one click. The results were amazing — my render times went from extremes like 25 minutes to 1 minute max with the static textures applied.
Being now able to quickly render the door, my worries baked away, I could continue with rigging.
Before I found the Drivers Master Class for Blender video series from Level Pixel Level, I thought armatures and drivers were pure magic. Now that I have gone through that playlist, getting myself familiar with drivers, it still feels like magic, but right at my fingertips. Applying what I've learned, I threw some bones, or armatures, at my door.
The plan then was to "drive" those bones through a controller, keeping everything together with a set of constrains. Starting off by right-clicking on the bone's y-location to add a driver.
In the Drivers panel, I defined the "scripted expression", connected it to my controller, and added limits to the movement of the bone to drive.
For the controller, I created an arrow out of a plane to which all bones are connected by their respective drivers. The arrow also gets an object constraint to limit the movement, just for my own convenience.
Moving the arrow on the y-axis will move all the bones of the door, as defined by the driver's expression.
All in all, drivers felt somewhat natural — with functions and properties resembling programming to a degree, giving me a kind of familiarity.
With the door rig ready, I used the controller to drive the animation of the door. I know there are many ways to do this, but this way felt like a solid choice for me at the time.
Watching my animation too many times left me feeling somewhat unsatisfied. I looked at a lot of reference doors, tried to tweak the animation timing, and made parts of the door animate at different times, all to get a more natural feel of the door moving.
I'm not quite there yet, but I will continue nonetheless. Maybe future me has some good ideas for improving the animation further.
Door rigged, animation set up, time to hit export. For this, I exported an image sequence, which I then combined into a movie through Blender's Video Editing view.
I took the final movie of the animation into DaVinci Resolve 18, using it to make some slight color corrections.
And this is it; here is my final render of the bulkhead door animation.
After having the basics of rigging, animation, and drivers covered, I want to deepen that knowledge — getting more modeling experience can't hurt either. Therefore, my next step will be to model a hallway incorporating the door, add some slight VFX, and animate a camera moving through the environment.
But that will be in part 4 of the project. Until then 👋🏻


We proposed a package for classification task which uses Negative Binomial distribution within Linear Discriminant Analysis (NBLDA). It is basically an extension of 'PoiClaClu' package to Negative Binomial distribution. The classification algorithms are based on the papers Dong et al. (2016, ISSN: 1471-2105) and Witten, DM (2011, ISSN: 1932-6157) for NBLDA and PLDA respectively. Although PLDA is a sparse algorithm and can be used for variable selection, the algorithm proposed by Dong et. al. is not sparse, hence, it uses all variables in the classifier. Here, we extent Dong et. al.'s algorithm to sparse case by shrinking overdispersion towards 0 (Yu et. al., 2013, ISSN: 1367-4803) and offset parameter towards 1 (as proposed by Witten DM, 2011). We support only the classification task with this version. However, the clustering task will be included with the following versions.
| Version: | 0.99.0 |
| Depends: | ggplot2 |
| Imports: | methods, stats, graphics, sSeq |
| Suggests: | knitr |
| Published: | 2018-07-01 |
| Author: | Dincer Goksuluk [aut, cre], Gokmen Zararsiz [aut], Selcuk Korkmaz [aut], Ahmet Ergun Karaagaoglu [ths, aut] |
| Maintainer: | Dincer Goksuluk <dincer.goksuluk at hacettepe.edu.tr> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| CRAN checks: | NBLDA results |
| Reference manual: | NBLDA.pdf |
| Package source: | NBLDA_0.99.0.tar.gz |
| Windows binaries: | r-devel: NBLDA_0.99.0.zip, r-release: NBLDA_0.99.0.zip, r-oldrel: NBLDA_0.99.0.zip |
| OS X binaries: | r-release: not available, r-oldrel: not available |
Please use the canonical form https://CRAN.R-project.org/package=NBLDA to link to this page.


The beauty of cannabis is that all it is doing is supplementing the body’s natural cannabis system called the endocannabinoid system. Humans, as well as many other animals, have this natural system throughout the body. The system, in the brain for example, has an effect on memory, control of movement, modulation of pain, development of nerve growth and plasticity, and the adaptability of the nervous system. It has an influence on sleep, appetite, anxiety and social behaviour to name but a few important functions.
Cannetics' main mission is to satisfy the medical need for cannabis and to be teamed up with global leaders of cannabis R&D, being able to provide only the absolute cleanest, high-potent and alamodic products to our clients.
Cannetics is dedicated to providing you with friendly service, and above all else, excellent products of the highest quality. If you are looking for specific profiles, please let us know and we will do whatever we can to adjust to your needs!


§664-11 Costs. The costs in each case shall be borne by the petitioner or respondent, or shall be apportioned between them, as equity and justice may require, in the judgment of the commissioner of boundaries, subject to appeal as in this part provided. [L 1894-5, c 14, §13; RL 1925, §563; RL 1935, §3670; RL 1945, §10211; RL 1955, §234-11; HRS §664-11]


Before learning how to prepare for a family camping trip, make sure that you prepare the following equipment thoroughly:
First aid kit: This is essential to cure injuries from bug bites, scrapes, and cuts. What’s more, you also need to bring insect repellent and sunscreen to protect yourself away from ticks, mosquitos, and sunlight.Note: As a
bonus, you can make a mixture of water and tea tree oil to keep your body away from tick bites. Furthermore, heat a spoon then apply it to the mosquito bite can stop the itching.
Tent: It should be attached to rain fly and ground cloth. You also need to prepare extra blankets, camping mattresses, cots, or foam pads for the tent floor. Moreover, the sleeping bag must suit with the temperature
of your body.
Clothes for all kinds of weather: Bring usual clothes for warm climate in the daytime and layered ones to use at night when the weather is cooler. Obviously, you have to prepare clothes for your kids also.
Bring rain gear like light-weight ponchos in anticipation of rainy days.
Flashlights and extra batteries or camping lantern and fuel: at night, these are the indispensable items to light.
Camping cooking utensils: They include camping stove and fuel, camping cooler, and water carriers, frying pan, pot, plates, bowls, forks, spoons, knives, cutting board and so on.
Storage bins: If they are strong enough, you can use them as chairs to sit.
This suits with those who don’t love camping alongside a trail.However, for this form, you must make it early.
Many people take reservation up a year. While you can reserve room of established campgrounds on the Internet, the forms of both online and telephone reservations are applied for national parks and state
parks through ReserveAmerica.


loading...
E. X. P.
By 2K inc.
Enter or Click to play
Loading...
Loading...
Loading...
⚙
E. X. P. by 2K inc.
Developers
Ken Zhou
Kavin Velmurugan
Dmitry Kornilov
Euan Chase
Designers
Ken Zhou
Kavin Velmurugan
github.com/2kinc
/exp-game
<
>
Credits
OPTIONS
Effects:
ON
Close
⎵
@


All Output is in the Browser Console.
Please open the browser console(using the F12 key)
Access PromiViz


Change history: A simple charfield
| Date/time | User | Action |
|---|---|---|
| Jan. 5, 2013, 7:30 a.m. | coordt | |
| Jan. 11, 2013, 10:04 a.m. | coordt | |
| Feb. 23, 2013, 6:57 a.m. | coordt | Changed text_field. |
| Date/time | User | Action |
|---|---|---|
| Jan. 5, 2013, 7:30 a.m. | coordt | |
| Jan. 11, 2013, 10:04 a.m. | coordt | |
| Feb. 23, 2013, 6:57 a.m. | coordt | Changed text_field. |


Software Hub
Home
(current)
Stock ROM
Flash Tools
Drivers
Other Tools
Request a software
Report a problem
Contact us
About us
Contact us
About us
IMEI Writing Tools
SN Write Tool
For MediaTek Devices
It allows you to flash IMEI on your MTK Devices
Download
Write IMEI Tool
For SpreadTrum Devices
Allows you to flash IMEI on your SpreadTrum Devices.
Download


a batch dispenser, used for ASR training
More...
|
| def | __init__ (self, feature_reader, target_coder, size, target_path) |
| | batchDispenser constructor More...
|
| |
| def | split (self, num_utt) |
| | take a number of utterances from the batchdispenser to make a new one More...
|
| |
|
def | get_pair (self) |
| | get the next input-target pai
|
| |
|
def | num_utt (self) |
| | The number of utterances in the given data.
|
| |
|
def | num_labels (self) |
| | the number of output labels
|
| |
|
def | max_input_length (self) |
| | the maximal sequence length of the features
|
| |
|
def | max_target_length (self) |
| | the maximal length of the targets
|
| |
|
def | pos (self) |
| | the current position in the data
|
| |
|
def | pos (self, pos) |
| | setter for the current position in the data
|
| |
| def | __init__ (self, size) |
| | batchDispenser constructor More...
|
| |
| def | get_batch (self, pos=None) |
| | Get a batch of features and targets. More...
|
| |
| def | split (self, num_utt) |
| | take a number of utterances from the batchdispenser to make a new one More...
|
| |
|
def | get_pair (self) |
| | get the next input-target pai
|
| |
| def | num_batches (self) |
| | The number of batches in the given data. More...
|
| |
|
def | num_utt (self) |
| | The number of utterances in the given data.
|
| |
|
def | num_labels (self) |
| | the number of output labels
|
| |
|
def | max_input_length (self) |
| | the maximal sequence length of the features
|
| |
|
def | max_target_length (self) |
| | the maximal length of the targets
|
| |
|
def | pos (self) |
| | the current position in the data
|
| |
|
def | pos (self, pos) |
| | setter for the current position in the data
|
| |
|
|
| feature_reader |
| |
|
| target_coder |
| |
|
| target_dict |
| |
|
| size |
| |
|
| pos |
| |
a batch dispenser, used for ASR training
§ __init__()
| def nabu.processing.batchdispenser.AsrBatchDispenser.__init__ |
( |
|
self, |
|
|
|
feature_reader, |
|
|
|
target_coder, |
|
|
|
size, |
|
|
|
target_path |
|
) |
| |
batchDispenser constructor
- Parameters
-
| feature_reader | Kaldi ark-file feature reader instance. |
| target_coder | a TargetCoder object to encode and decode the target |
| sequences | |
| size | Specifies how many utterances should be contained in each batch. |
| target_path | path to the file containing the targets |
§ split()
| def nabu.processing.batchdispenser.AsrBatchDispenser.split |
( |
|
self, |
|
|
|
num_utt |
|
) |
| |
take a number of utterances from the batchdispenser to make a new one
- Parameters
-
| num_utt | the number of utterances in the new batchdispenser |
- Returns
- a batch dispenser with the requested number of utterances
The documentation for this class was generated from the following file:


I pay my cable bill, that's how. (my sense of humor is lame)
Browser on my computer connects to the Internet (if I paid my cable bill) by typing the URL of a website, which in turn connects to a server using HTTP protocol. Server finds the appropriate HTML doc and sends it back to my computer.
HTML stands for hypertext markup language. Markups are tags. E.g., "b" tag makes text bold, and "em" is for italics. Void tags are tags that don't require a closing tag (that's the one with a "/" at the end of a piece of text that you want to apply your tag to).
Two types of tags are inline and block tags. Unlike inline tags, block tags (e.g. "p" tag I'm using for this very paragraph) actually create a box around the text they are applied to.
 It won't understand you if you made a syntax error.
Always check your work! (if you are still not sure, ask a human for help)
HTML represents the structure of a webpage, JavaScript is for interactive components, and CSS adds styles.
DOM is a tree-like stucture of a page, where every tag is an element in a tree.
It's useful to start looking at every webpage from the perspective of "seeing boxes". E.g., every header on this very page is a box, every text paragraph is a a box, etc. If I had pasted an image here, it would be its' own box, too.
Actually, let me do it.
CSS stands for Cascading Style Sheets. The most important rule we should remember is inheritance rule: the most specific rule is applied to every element.
Here is a link if you need to reference any CSS property.
Avoiding repetition is one of the most important ideas in programming. CSS is very helpful with that.
If you repeat yourself while writing code, you are:
So think about different classes you can organize the elements on your page into, and then apply a certain style (when needed) to the whole class, instead of each element separately.
Every box consists of the following elements:
Also, I just accidentally learned how to make lists: you need a "ul" ("ol" for numbers) tag and an "li" (void) tag for every bullet/number. I'm happy I know how to do it now - I basically think in bullet points! Here is a link for more details/options: how to make lists.
If you would like to make a box flexible (for better alignment of elements on a page), you need to add "display: flex" in the CSS code. For example, I used flexbox for my table of contents to make it look slightly more interesting (took a while...).
A useful guide for all things flex can be found here.
This is a routine we all should follow while designing a page:
And here are links you can go to when you need to validate your code:
HTML Validator
CSS Validator


WITNESS LIST Business & Commerce Committee March 27, 2001 - 9:00A SB 192 Registering, but not testifying: On: Luedecke, Alvin (TxDot), Austin, TX SB 195 Registering, but not testifying: For: Gutierrez, Hector (City of El Paso), Austin, TX On: Luedecke, Alvin (TxDot), Austin, TX SB 317 ON: Pettijohn, Leslie (Consumer Credit Commissioner), Austin, TX Registering, but not testifying: For: Balch, Mandy (Texas Independent Automobile Dealers Association), Austin, TX Kelley, Sam (Texas Consumer Finance Association), Austin, TX Schneider, Rob (Consumers Union), Austin, TX On: Davis, Lorri (Texans for Financial Freedom and Imperial Leasing), Coppell, TX Grey, Rex (APLE Corp.), Houston, TX Mody, Neil (M.G. Capital Investment Corp), Houston, TX Nunez, Johnny (Xpress Cash), Stafford, TX Sheehan, J. Scott (Personal Rental Corporation and Clients of the Firm), Houston, TX Varnell, Andrea (Sunset Advisory Commission), Austin, TX SB 393 Registering, but not testifying: For: Glenn, Eric (Humana), Austin, TX On: Heskett, Michael (Texas State Library and Archives Commission), Austin, TX SB 465 Registering, but not testifying: On: Luedecke, Alvin (TxDot), Austin, TX SB 544 Registering, but not testifying: On: Brudersen, Blake O. (Texas Department of Insurance), Austin, TX SB 623 FOR: Birdwell, Randy (Texas Association of Builders and Emeral Builders), The Woodlands, TX Bush, Robert L. (TAB and Dallas HBA), Arlington, TX Paxson, Stephen (Self), Houston, TX AGAINST: Ahmad, Janet (Home Owners for Better Building), San Antonio, TX Cobarruvias, John R. (Home Owners for Better Building), Houston, TX McQuality, Mark S. (Self), Dallas, TX Stark, Anne P. (Homeowners), Dallas, TX Turner, Cheryl C. (Self), Dallas, TX Registering, but not testifying: For: Stout, Bob (The Woodlands Operating Co. L.P.), The Woodlands, TX Wood, Toy (Greater Houston Builders Association), Houston, TX Against: Eberwine, Mark (Texas Association of Real Estate Inspectors), San Antonio, TX Longley, Joe (Self), Austin, TX SB 770 Registering, but not testifying: For: McGiffert, Lisa (Consumers Union), Austin, TX SB 842 FOR: Abitua, Angel (Texas Citizens for a Sound Economy), Round Rock, TX Pickle, G. Edward (Texas Civil Justice League; Shell Oil Co.; Civil Justice Reform Group), Houston, TX Ratliff, Shannon (Texas Civil Justice League), Austin, TX Summers, Bill (Self), Alamo, TX AGAINST: Caldwell, Wade (Self), San Antonio, TX Dunayer, Margaret (Self), Round Rock, TX Hanon, Beverly A. (Self), Longview, TX Hile, Richard (Texas Trial Lawyers Association), Austin, TX James, Reggie (Consumers Union), Austin, TX Oliver, Lillian A. (Self), Marshall, TX Registering, but not testifying: For: Allday, Marty (El Paso Corp.), Houston, TX Bruno, Tina (San Antonians Against Lawsuit Abuse), San Antonio, TX Castle, Allison (Citizens Against Lawsuit Abuse), Austin, TX Clements, Jerry K. (Texas Civil Justice League), Dallas, TX Gutierrez, Hugo (Marathon Oil Company and Marathon Ashland Petro), Houston, TX McFarland, Bob (American Insurance Association), Austin, TX Miller, Neal (The Chevron Companies), Austin, TX Wall, Matthew T. (Texas Hospital Association), Austin, TX Wayne, Ralph (Texas Civil Justice League), Austin, TX White, Michael (The Greater Houston Partnership), Austin, TX Woods, Joe (Alliance of American Insurers), Austin, TX Yarnell, William (Halliburton), Dallas, TX Against: Lambe, Dan (Texas Watch), Austin, TX SB 1127 Registering, but not testifying: For: Howard, Jay (Distilled Spirits Council of the U.S. (DISCUS)), Austin, TX Newton, Chris (Guinness/United Distillers and Vintners), Austin, TX Warner, Freddy (Guinness/United Distillers and Vintners), Wimberley, TX On: Gray, Alan (Licensed Beverage Distributors), Austin, TX SB 1143 Registering, but not testifying: For: Gagen, Joe (Texas 5.01 (a) Alliance), Austin, TX Glenn, Eric (Humana), Austin, TX Keel, Lara Laneri (Texas Association of Business and Chambers of Commerce), Austin, TX Kloster, Jeff (Humana), Austin, TX Oates, John (Aetna), Austin, TX Rummel, Leah (Texas Association of Health Plans), Austin, TX On: Brodersen, Blake O. (Texas Department of Insurance), Austin, TX SB 1284 FOR: Bogard, Ramona (Digestive Health Association of Texas, P.A.), Dallas, TX Bonnen, M.D., Greg (Self), Houston, TX Brownwall, Jeff (Memorial Hermann Hospital System and THA), Houston, TX Cason, Frances R. (The Medical Clinic of North Texas, P.A.), Ft. Worth, TX Delgado, Bernice (Dr. Jesse Moss, Jr./BCMS), San Antonio, TX Freeman, M.D., John W. (Self), Ft. Worth, TX Garcia, M.D., Joe Ray (Small Districts Caucus of the T.M.A.), Elgin, TX Gonzales, David A. (Texas Pharmacy Association), Austin, TX Gude M.D., David (Texas Med Clinic), San Antonio, TX Gunby, M.D., Robert (Dallas Co. Medical Society and Texas Medical Association), Dallas, TX Johnston, Thomas (Cardiothoracic and Vascular Surgeons, P.A.), Austin, TX Kanter, Anne Magers (Methodist Health Care System of San Antonio, LTD, HCA, and THA), San Antonio, TX Kottman, M.D., Robert (Bexas County Medical Society), San Antonio, TX Meadows, Connie (Texas Medical Association Insurance Trust), Round Rock, TX Neff, Charles (Pinnacle Anesthesia Consultants, P.A.), Dallas, TX Perryman, Kevin (Primary Pediatric Medical Association), Seguin, TX Phillips, M.D., Serena L. (Bexar County Medical Society), San Antonio, TX Shepherd, Karol (Austin Cardiovascular Association), Austin, TX Silverstein, M.D., Russell (Dallas Nephrology Association), Dallas, TX Thompson, Matthew (Capital Pediatric Group), Round Rock, TX Walker, J. Patrick (Self), Crockett, TX Woodard, Debbie (T.H.A., Texas Health Resources), Arlington, TX AGAINST: Collins, M.D., Shala Owens (Community Health Choice, Inc), Houston, TX Glenn, Eric (Humana), Austin, TX Keeling, Dan (Pacificare of Texas), San Antonio, TX Kloster, Jeff (Humana, Health Insurance Association of America), Austin, TX Smith, Terral (Unicare), Austin, TX Taylor, William J. (Aetna), Austin, TX Thomas, M.D., Milton M. (CIGNA Health Care of Texas Inc.), Missouri City, TX Underwood, Rene (CIGNA), Houston, TX ON: Brudersen, Blake O. (Texas Department of Insurance), Austin, TX Registering, but not testifying: For: Barron, Connie (Texas Medical Association), Austin, TX Bartos, M.D., Justin (Texas Academy of Family Physicians), Austin, TX Bresnen, Steve (Texas Society of Psychiatric Physicians), Austin, TX Denison, Barbara (George W. Childress, M.D.), McKinney, TX Garza, Genevieve (Austin Cardiovascular Association), Austin, TX Green, John R. (North Texas Heart Center), Dallas, TX Hendricks, Margarethe (Austin Ear, Nose, and Throat Clinic), Austin, TX Hendrix, Harry (Capitol Anesthesiology Association), Austin, TX Herndon, Paul (Texas Childer's Pediatric Association), Houston, TX Lang, Layton (Dallas Surgical Group), Dallas, TX Lopez, Joseph (TMA), San Antonio, TX Lutz, Ronald (Genesis Physician Group), Dallas, TX Miller, Fred (Self), Austin, TX Perkins, Vicki (CHRISTUS Santa Rosa Health Care), San Antonio, TX Phipps, Candie (Texas Pediatric Society), Austin, TX Pruden, Shellie (Dallas County Medical Society), Dallas, TX Reagan, Karen (Texas Retailers Association/Texas Federation of Drug Stores), Austin, TX Rogers, M.D., David E. (Collin-Fannin Co. Medical Society), McKinney, TX Shaw, Paulette (Nueces Co. Medical Society), Corpus Christi, TX Speight, Susan (Texas Association for Marriage and Family Therapy), Dickinson, TX Thomas, Marjorie (Dr. David Rogers), Allen, TX Tolleson, Alan (Texas Medical Association), Austin, TX Van Winkle, M.D., Lloyd (TAFP Texas Academy of Family Physicians), Castroville, TX Against: Keel, Lara Laneri (Texas Association of Business and Chambers of Commerce), Austin, TX McCarty, Tom (Texas Association of Preferred Provider Organizations), Austin, TX McKirdy, Lynne D. (Aetna), Dripping Springs, TX Nelson, Jim (Golden Rule Ins. Co.), Austin, TX Oates, John (Aetna), Austin, TX Pollard, Mike (Texas Association of Life and Health Insurers), Austin, TX Rummel, Leah (Texas Association of Health Plans), Austin, TX Simonton, Kay (Blue Cross Blue Shield of Texas), Austin, TX SB 1306 FOR: Ginger, David (Title Insurance Company of America), Austin, TX Shaw, Bickford (Title Insurance Co. of America), Austin, TX AGAINST: Becker, Doug (Self), San Antonio, TX Fair, Walt (Home Abstract and Title Co.), Waco, TX Rothermel, John (Stewart Title), San Antonio, TX Stablein, George (First American Title Co.), Houston, TX Registering, but not testifying: Against: Carr, Mindy (Texas Apartment Association), Austin, TX Lee, Randy (Stewart Title), Austin, TX Newton, Will (Texas Restaurant Association), Austin, TX Reagan, Karen (Texas Retailers Association), Austin, TX Schneider, Rob (Consumers Union), Austin, TX SB 1318 Registering, but not testifying: On: Joyner, Guy (Secretary of State), Austin, TX SB 1391 ON: Nesenholtz, Lynda (Texas Department of Insurance), Austin, TX SB 1637 ON: Martin, Jim (Texas Pharmacy Association), Austin, TX Registering, but not testifying: For: Reagan, Karen (Texas Retailers Association/Texas Federation of Drug Stores), Austin, TX SB 1659 FOR: Jones, Tom A. (Sprint), Austin, TX Wyatt, Mark (Texas Telephone Association), Austin, TX Registering, but not testifying: For: Aldredge, Vaughn (AT&T), Austin, TX Atkins, Winn (Texas Coalition of Competitive Local Exchange Companies), Austin, TX Comacho, Jose (Valor Telecom), Austin, TX Grover, Jim (Sprint Communications), Austin, TX Hughes, Cammie (Texas Statewide Telephone Cooperative), Austin, TX Kellar, Danny (ETEX Tel. Coop.), Ceilmer, TX Lawson, Richard (Verizon Telecommunications), Austin, TX Leahy, Tim (Southwestern Bell), Austin, TX Luby, Jamie (MCI WorldCom), Austin, TX SB 1661 FOR: Biggerstaff, Michael (Verizon Telecommunications), San Angelo, TX Radel, William (Sprint), Gardner, KS Wyatt, Mark (Texas Telephone Association), Austin, TX AGAINST: Cupero, Kelly M. (Entergy Gulf States, Inc), Beaumont, TX Registering, but not testifying: For: Brown, David (Southwestern Bell), Austin, TX Comacho, Jose (Valor Telecom), Austin, TX Hughes, Cammie (Texas Statewide Telephone Cooperative), Austin, TX Kellar, Danny (ETEX Tel. Coop.), Ceilmer, TX Against: Fainter, John (Association of Electric Companies of Texas), Austin, TX SCR 7 Registering, but not testifying: For: Gutierrez, Hector (City of El Paso), Austin, TX SCR 8 Registering, but not testifying: For: Gutierrez, Hector (City of El Paso), Austin, TX