Freestyle Types (freestyle.types)¶
This module contains core classes of the Freestyle Python API, including data types of view map components (0D and 1D elements), base classes for user-defined line stylization rules (predicates, functions, chaining iterators, and stroke shaders), and operators.
Class hierarchy:
BBox
BinaryPredicate0D
BinaryPredicate1D
Id
Interface0D
Interface1D
Iterator
Material
Noise
Operators
SShape
StrokeAttribute
StrokeShader
UnaryFunction0D
UnaryFunction1D
UnaryPredicate0D
UnaryPredicate1D
ViewMap
ViewShape
IntegrationType
MediumType
Nature
-
class
freestyle.types.
AdjacencyIterator
¶ Class hierarchy:
Iterator
>AdjacencyIterator
Class for representing adjacency iterators used in the chaining process. An AdjacencyIterator is created in the increment() and decrement() methods of a
ChainingIterator
and passed to the traverse() method of the ChainingIterator.-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( AdjacencyIterator
) – An AdjacencyIterator object.
-
__init__
(vertex, restrict_to_selection=True, restrict_to_unvisited=True) Builds a AdjacencyIterator object.
Parameters: - vertex (
ViewVertex
) – The vertex which is the next crossing. - restrict_to_selection (bool) – Indicates whether to force the chaining to stay within the set of selected ViewEdges or not.
- restrict_to_unvisited (bool) – Indicates whether a ViewEdge that has already been chained must be ignored ot not.
- vertex (
-
is_incoming
¶ True if the current ViewEdge is coming towards the iteration vertex, and False otherwise.
Type: bool
-
-
class
freestyle.types.
BinaryPredicate0D
¶ Base class for binary predicates working on
Interface0D
objects. A BinaryPredicate0D is typically an ordering relation between two Interface0D objects. The predicate evaluates a relation between the two Interface0D instances and returns a boolean value (true or false). It is used by invoking the __call__() method.-
__init__
()¶ Default constructor.
-
__call__
(inter1, inter2)¶ Must be overload by inherited classes. It evaluates a relation between two Interface0D objects.
Parameters: - inter1 (
Interface0D
) – The first Interface0D object. - inter2 (
Interface0D
) – The second Interface0D object.
Returns: True or false.
Return type: bool
- inter1 (
-
name
¶ The name of the binary 0D predicate.
Type: str
-
-
class
freestyle.types.
BinaryPredicate1D
¶ Base class for binary predicates working on
Interface1D
objects. A BinaryPredicate1D is typically an ordering relation between two Interface1D objects. The predicate evaluates a relation between the two Interface1D instances and returns a boolean value (true or false). It is used by invoking the __call__() method.-
__init__
()¶ Default constructor.
-
__call__
(inter1, inter2)¶ Must be overload by inherited classes. It evaluates a relation between two Interface1D objects.
Parameters: - inter1 (
Interface1D
) – The first Interface1D object. - inter2 (
Interface1D
) – The second Interface1D object.
Returns: True or false.
Return type: bool
- inter1 (
-
name
¶ The name of the binary 1D predicate.
Type: str
-
-
class
freestyle.types.
Chain
¶ Class hierarchy:
Interface1D
>Curve
>Chain
Class to represent a 1D elements issued from the chaining process. A Chain is the last step before the
Stroke
and is used in the Splitting and Creation processes.-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( Chain
) – A Chain object.
-
__init__
(id) Builds a chain from its Id.
Parameters: id ( Id
) – An Id object.
-
-
class
freestyle.types.
ChainingIterator
¶ Class hierarchy:
Iterator
>ViewEdgeIterator
>ChainingIterator
Base class for chaining iterators. This class is designed to be overloaded in order to describe chaining rules. It makes the description of chaining rules easier. The two main methods that need to overloaded are traverse() and init(). traverse() tells which
ViewEdge
to follow, among the adjacent ones. If you specify restriction rules (such as “Chain only ViewEdges of the selection”), they will be included in the adjacency iterator (i.e, the adjacent iterator will only stop on “valid” edges).-
__init__
(restrict_to_selection=True, restrict_to_unvisited=True, begin=None, orientation=True)¶ Builds a Chaining Iterator from the first ViewEdge used for iteration and its orientation.
Parameters: - restrict_to_selection (bool) – Indicates whether to force the chaining to stay within the set of selected ViewEdges or not.
- restrict_to_unvisited (bool) – Indicates whether a ViewEdge that has already been chained must be ignored ot not.
- begin (
ViewEdge
or None) – The ViewEdge from which to start the chain. - orientation (bool) – The direction to follow to explore the graph. If true, the direction indicated by the first ViewEdge is used.
-
__init__
(brother) Copy constructor.
Parameters: brother (ChainingIterator) –
-
init
()¶ Initializes the iterator context. This method is called each time a new chain is started. It can be used to reset some history information that you might want to keep.
-
traverse
(it)¶ This method iterates over the potential next ViewEdges and returns the one that will be followed next. Returns the next ViewEdge to follow or None when the end of the chain is reached.
Parameters: it ( AdjacencyIterator
) – The iterator over the ViewEdges adjacent to the end vertex of the current ViewEdge. The adjacency iterator reflects the restriction rules by only iterating over the valid ViewEdges.Returns: Returns the next ViewEdge to follow, or None if chaining ends. Return type: ViewEdge
or None
-
is_incrementing
¶ True if the current iteration is an incrementation.
Type: bool
-
next_vertex
¶ The ViewVertex that is the next crossing.
Type: ViewVertex
-
-
class
freestyle.types.
Curve
¶ Class hierarchy:
Interface1D
>Curve
Base class for curves made of CurvePoints.
SVertex
is the type of the initial curve vertices. AChain
is a specialization of a Curve.-
__init__
()¶ Default Constructor.
-
__init__
(brother) Copy Constructor.
Parameters: brother ( Curve
) – A Curve object.
-
__init__
(id) Builds a Curve from its Id.
Parameters: id ( Id
) – An Id object.
-
push_vertex_back
(vertex)¶ Adds a single vertex at the end of the Curve.
Parameters: vertex ( SVertex
orCurvePoint
) – A vertex object.
-
push_vertex_front
(vertex)¶ Adds a single vertex at the front of the Curve.
Parameters: vertex ( SVertex
orCurvePoint
) – A vertex object.
-
is_empty
¶ True if the Curve doesn’t have any Vertex yet.
Type: bool
-
segments_size
¶ The number of segments in the polyline constituting the Curve.
Type: int
-
-
class
freestyle.types.
CurvePoint
¶ Class hierarchy:
Interface0D
>CurvePoint
Class to represent a point of a curve. A CurvePoint can be any point of a 1D curve (it doesn’t have to be a vertex of the curve). Any
Interface1D
is built upon ViewEdges, themselves built upon FEdges. Therefore, a curve is basically a polyline made of a list ofSVertex
objects. Thus, a CurvePoint is built by linearly interpolating twoSVertex
instances. CurvePoint can be used as virtual points while querying 0D information along a curve at a given resolution.-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( CurvePoint
) – A CurvePoint object.
-
__init__
(first_vertex, second_vertex, t2d) Builds a CurvePoint from two SVertex objects and an interpolation parameter.
Parameters:
-
__init__
(first_point, second_point, t2d) Builds a CurvePoint from two CurvePoint objects and an interpolation parameter.
Parameters: - first_point (
CurvePoint
) – The first CurvePoint. - second_point (
CurvePoint
) – The second CurvePoint. - t2d (float) – The 2D interpolation parameter used to linearly interpolate first_point and second_point.
- first_point (
-
fedge
¶ Gets the FEdge for the two SVertices that given CurvePoints consists out of. A shortcut for CurvePoint.first_svertex.get_fedge(CurvePoint.second_svertex).
Type: FEdge
-
t2d
¶ The 2D interpolation parameter.
Type: float
-
-
class
freestyle.types.
CurvePointIterator
¶ Class hierarchy:
Iterator
>CurvePointIterator
Class representing an iterator on a curve. Allows an iterating outside initial vertices. A CurvePoint is instantiated and returned through the .object attribute.
-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( CurvePointIterator
) – A CurvePointIterator object.
-
__init__
(step=0.0) Builds a CurvePointIterator object.
Parameters: step (float) – A resampling resolution with which the curve is resampled. If zero, no resampling is done (i.e., the iterator iterates over initial vertices).
-
object
¶ The CurvePoint object currently pointed by this iterator.
Type: CurvePoint
-
t
¶ The curvilinear abscissa of the current point.
Type: float
-
u
¶ The point parameter at the current point in the stroke (0 <= u <= 1).
Type: float
-
-
class
freestyle.types.
FEdge
¶ Class hierarchy:
Interface1D
>FEdge
Base Class for feature edges. This FEdge can represent a silhouette, a crease, a ridge/valley, a border or a suggestive contour. For silhouettes, the FEdge is oriented so that the visible face lies on the left of the edge. For borders, the FEdge is oriented so that the face lies on the left of the edge. An FEdge can represent an initial edge of the mesh or runs across a face of the initial mesh depending on the smoothness or sharpness of the mesh. This class is specialized into a smooth and a sharp version since their properties slightly vary from one to the other.
-
FEdge
()¶ Default constructor.
-
FEdge
(brother) Copy constructor.
Parameters: brother ( FEdge
) – An FEdge object.
-
FEdge
(first_vertex, second_vertex) Builds an FEdge going from the first vertex to the second.
Parameters:
-
is_smooth
¶ True if this FEdge is a smooth FEdge.
Type: bool
-
next_fedge
¶ The FEdge following this one in the ViewEdge. The value is None if this FEdge is the last of the ViewEdge.
Type: FEdge
-
-
class
freestyle.types.
FEdgeSharp
¶ Class hierarchy:
Interface1D
>FEdge
>FEdgeSharp
Class defining a sharp FEdge. A Sharp FEdge corresponds to an initial edge of the input mesh. It can be a silhouette, a crease or a border. If it is a crease edge, then it is borded by two faces of the mesh. Face a lies on its right whereas Face b lies on its left. If it is a border edge, then it doesn’t have any face on its right, and thus Face a is None.
-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( FEdgeSharp
) – An FEdgeSharp object.
-
__init__
(first_vertex, second_vertex) Builds an FEdgeSharp going from the first vertex to the second.
Parameters:
-
face_mark_left
¶ The face mark of the face lying on the left of the FEdge.
Type: bool
-
face_mark_right
¶ The face mark of the face lying on the right of the FEdge. If this FEdge is a border, it has no face on the right and thus this property is set to false.
Type: bool
-
material_index_left
¶ The index of the material of the face lying on the left of the FEdge.
Type: int
-
material_index_right
¶ The index of the material of the face lying on the right of the FEdge. If this FEdge is a border, it has no Face on its right and therefore no material.
Type: int
-
material_right
¶ The material of the face lying on the right of the FEdge. If this FEdge is a border, it has no Face on its right and therefore no material.
Type: Material
-
normal_left
¶ The normal to the face lying on the left of the FEdge.
Type: mathutils.Vector
-
normal_right
¶ The normal to the face lying on the right of the FEdge. If this FEdge is a border, it has no Face on its right and therefore no normal.
Type: mathutils.Vector
-
-
class
freestyle.types.
FEdgeSmooth
¶ Class hierarchy:
Interface1D
>FEdge
>FEdgeSmooth
Class defining a smooth edge. This kind of edge typically runs across a face of the input mesh. It can be a silhouette, a ridge or valley, a suggestive contour.
-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( FEdgeSmooth
) – An FEdgeSmooth object.
-
__init__
(first_vertex, second_vertex) Builds an FEdgeSmooth going from the first to the second.
Parameters:
-
face_mark
¶ The face mark of the face that this FEdge is running across.
Type: bool
-
material_index
¶ The index of the material of the face that this FEdge is running across.
Type: int
-
normal
¶ The normal of the face that this FEdge is running across.
Type: mathutils.Vector
-
-
class
freestyle.types.
Id
¶ Class for representing an object Id.
-
__init__
(first=0, second=0)¶ Build the Id from two numbers.
Parameters: - first (int) – The first number.
- second (int) – The second number.
-
__init__
(brother) Copy constructor.
Parameters: brother ( Id
) – An Id object.
-
first
¶ The first number constituting the Id.
Type: int
-
second
¶ The second number constituting the Id.
Type: int
-
-
class
freestyle.types.
IntegrationType
¶ Class hierarchy: int >
IntegrationType
Different integration methods that can be invoked to integrate into a single value the set of values obtained from each 0D element of an 1D element:
- IntegrationType.MEAN: The value computed for the 1D element is the mean of the values obtained for the 0D elements.
- IntegrationType.MIN: The value computed for the 1D element is the minimum of the values obtained for the 0D elements.
- IntegrationType.MAX: The value computed for the 1D element is the maximum of the values obtained for the 0D elements.
- IntegrationType.FIRST: The value computed for the 1D element is the first of the values obtained for the 0D elements.
- IntegrationType.LAST: The value computed for the 1D element is the last of the values obtained for the 0D elements.
-
class
freestyle.types.
Interface0D
¶ Base class for any 0D element.
-
__init__
()¶ Default constructor.
-
get_fedge
(inter)¶ Returns the FEdge that lies between this 0D element and the 0D element given as the argument.
Parameters: inter ( Interface0D
) – A 0D element.Returns: The FEdge lying between the two 0D elements. Return type: FEdge
-
name
¶ The string of the name of this 0D element.
Type: str
-
point_2d
¶ The 2D point of this 0D element.
Type: mathutils.Vector
-
point_3d
¶ The 3D point of this 0D element.
Type: mathutils.Vector
-
projected_x
¶ The X coordinate of the projected 3D point of this 0D element.
Type: float
-
projected_y
¶ The Y coordinate of the projected 3D point of this 0D element.
Type: float
-
projected_z
¶ The Z coordinate of the projected 3D point of this 0D element.
Type: float
-
-
class
freestyle.types.
Interface0DIterator
¶ Class hierarchy:
Iterator
>Interface0DIterator
Class defining an iterator over Interface0D elements. An instance of this iterator is always obtained from a 1D element.
-
__init__
(brother)¶ Copy constructor.
Parameters: brother ( Interface0DIterator
) – An Interface0DIterator object.
-
__init__
(it) Construct a nested Interface0DIterator that can be the argument of a Function0D.
Parameters: it ( SVertexIterator
,CurvePointIterator
, orStrokeVertexIterator
) – An iterator object to be nested.
-
at_last
¶ True if the iterator points to the last valid element. For its counterpart (pointing to the first valid element), use it.is_begin.
Type: bool
-
object
¶ The 0D object currently pointed to by this iterator. Note that the object may be an instance of an Interface0D subclass. For example if the iterator has been created from the vertices_begin() method of the
Stroke
class, the .object property refers to aStrokeVertex
object.Type: Interface0D
or one of its subclasses.
-
t
¶ The curvilinear abscissa of the current point.
Type: float
-
u
¶ The point parameter at the current point in the 1D element (0 <= u <= 1).
Type: float
-
-
class
freestyle.types.
Interface1D
¶ Base class for any 1D element.
-
__init__
()¶ Default constructor.
-
points_begin
(t=0.0)¶ Returns an iterator over the Interface1D points, pointing to the first point. The difference with vertices_begin() is that here we can iterate over points of the 1D element at a any given sampling. Indeed, for each iteration, a virtual point is created.
Parameters: t (float) – A sampling with which we want to iterate over points of this 1D element. Returns: An Interface0DIterator pointing to the first point. Return type: Interface0DIterator
-
points_end
(t=0.0)¶ Returns an iterator over the Interface1D points, pointing after the last point. The difference with vertices_end() is that here we can iterate over points of the 1D element at a given sampling. Indeed, for each iteration, a virtual point is created.
Parameters: t (float) – A sampling with which we want to iterate over points of this 1D element. Returns: An Interface0DIterator pointing after the last point. Return type: Interface0DIterator
-
vertices_begin
()¶ Returns an iterator over the Interface1D vertices, pointing to the first vertex.
Returns: An Interface0DIterator pointing to the first vertex. Return type: Interface0DIterator
-
vertices_end
()¶ Returns an iterator over the Interface1D vertices, pointing after the last vertex.
Returns: An Interface0DIterator pointing after the last vertex. Return type: Interface0DIterator
-
length_2d
¶ The 2D length of this Interface1D.
Type: float
-
name
¶ The string of the name of the 1D element.
Type: str
-
time_stamp
¶ The time stamp of the 1D element, mainly used for selection.
Type: int
-
-
class
freestyle.types.
Iterator
¶ Base class to define iterators.
-
__init__
()¶ Default constructor.
-
decrement
()¶ Makes the iterator point the previous element.
-
increment
()¶ Makes the iterator point the next element.
-
is_begin
¶ True if the iterator points to the first element.
Type: bool
-
is_end
¶ True if the iterator points to the last element.
Type: bool
-
name
¶ The string of the name of this iterator.
Type: str
-
-
class
freestyle.types.
Material
¶ Class defining a material.
-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( Material
) – A Material object.
-
__init__
(line, diffuse, ambient, specular, emission, shininess, priority) Builds a Material from its line, diffuse, ambient, specular, emissive colors, a shininess coefficient and line color priority.
Parameters: - line (
mathutils.Vector
, list or tuple of 4 float values) – The line color. - diffuse (
mathutils.Vector
, list or tuple of 4 float values) – The diffuse color. - ambient (
mathutils.Vector
, list or tuple of 4 float values) – The ambient color. - specular (
mathutils.Vector
, list or tuple of 4 float values) – The specular color. - emission (
mathutils.Vector
, list or tuple of 4 float values) – The emissive color. - shininess (float) – The shininess coefficient.
- priority (int) – The line color priority.
- line (
-
ambient
¶ RGBA components of the ambient color of the material.
Type: mathutils.Color
-
diffuse
¶ RGBA components of the diffuse color of the material.
Type: mathutils.Vector
-
emission
¶ RGBA components of the emissive color of the material.
Type: mathutils.Color
-
line
¶ RGBA components of the line color of the material.
Type: mathutils.Vector
-
priority
¶ Line color priority of the material.
Type: int
-
shininess
¶ Shininess coefficient of the material.
Type: float
-
specular
¶ RGBA components of the specular color of the material.
Type: mathutils.Vector
-
-
class
freestyle.types.
MediumType
¶ Class hierarchy: int >
MediumType
The different blending modes available to similate the interaction media-medium:
- Stroke.DRY_MEDIUM: To simulate a dry medium such as Pencil or Charcoal.
- Stroke.HUMID_MEDIUM: To simulate ink painting (color subtraction blending).
- Stroke.OPAQUE_MEDIUM: To simulate an opaque medium (oil, spray…).
-
class
freestyle.types.
Nature
¶ Class hierarchy: int >
Nature
Different possible natures of 0D and 1D elements of the ViewMap.
Vertex natures:
- Nature.POINT: True for any 0D element.
- Nature.S_VERTEX: True for SVertex.
- Nature.VIEW_VERTEX: True for ViewVertex.
- Nature.NON_T_VERTEX: True for NonTVertex.
- Nature.T_VERTEX: True for TVertex.
- Nature.CUSP: True for CUSP.
Edge natures:
- Nature.NO_FEATURE: True for non feature edges (always false for 1D elements of the ViewMap).
- Nature.SILHOUETTE: True for silhouettes.
- Nature.BORDER: True for borders.
- Nature.CREASE: True for creases.
- Nature.RIDGE: True for ridges.
- Nature.VALLEY: True for valleys.
- Nature.SUGGESTIVE_CONTOUR: True for suggestive contours.
- Nature.MATERIAL_BOUNDARY: True for edges at material boundaries.
- Nature.EDGE_MARK: True for edges having user-defined edge marks.
-
class
freestyle.types.
Noise
¶ Class to provide Perlin noise functionalities.
-
__init__
(seed = -1)¶ Builds a Noise object. Seed is an optional argument. The seed value is used as a seed for random number generation if it is equal to or greater than zero; otherwise, time is used as a seed.
Parameters: seed (int) – Seed for random number generation.
Undocumented contribute <https://developer.blender.org/T51061>
-
smoothNoise1
(v)¶ Returns a smooth noise value for a 1D element.
Parameters: v (float) – One-dimensional sample point. Returns: A smooth noise value. Return type: float
-
smoothNoise2
(v)¶ Returns a smooth noise value for a 2D element.
Parameters: v ( mathutils.Vector
, list or tuple of 2 real numbers) – Two-dimensional sample point.Returns: A smooth noise value. Return type: float
-
smoothNoise3
(v)¶ Returns a smooth noise value for a 3D element.
Parameters: v ( mathutils.Vector
, list or tuple of 3 real numbers) – Three-dimensional sample point.Returns: A smooth noise value. Return type: float
-
turbulence1
(v, freq, amp, oct=4)¶ Returns a noise value for a 1D element.
Parameters: - v (float) – One-dimensional sample point.
- freq (float) – Noise frequency.
- amp (float) – Amplitude.
- oct (int) – Number of octaves.
Returns: A noise value.
Return type: float
-
turbulence2
(v, freq, amp, oct=4)¶ Returns a noise value for a 2D element.
Parameters: - v (
mathutils.Vector
, list or tuple of 2 real numbers) – Two-dimensional sample point. - freq (float) – Noise frequency.
- amp (float) – Amplitude.
- oct (int) – Number of octaves.
Returns: A noise value.
Return type: float
- v (
-
turbulence3
(v, freq, amp, oct=4)¶ Returns a noise value for a 3D element.
Parameters: - v (
mathutils.Vector
, list or tuple of 3 real numbers) – Three-dimensional sample point. - freq (float) – Noise frequency.
- amp (float) – Amplitude.
- oct (int) – Number of octaves.
Returns: A noise value.
Return type: float
- v (
Undocumented contribute <https://developer.blender.org/T51061>
-
-
class
freestyle.types.
NonTVertex
¶ Class hierarchy:
Interface0D
>ViewVertex
>NonTVertex
View vertex for corners, cusps, etc. associated to a single SVertex. Can be associated to 2 or more view edges.
-
__init__
()¶ Default constructor.
-
__init__
(svertex) Build a NonTVertex from a SVertex.
Parameters: svertex ( SVertex
) – An SVertex object.
-
-
class
freestyle.types.
Operators
¶ Class defining the operators used in a style module. There are five types of operators: Selection, chaining, splitting, sorting and creation. All these operators are user controlled through functors, predicates and shaders that are taken as arguments.
-
static
bidirectional_chain
(it, pred)¶ Builds a set of chains from the current set of ViewEdges. Each ViewEdge of the current list potentially starts a new chain. The chaining operator then iterates over the ViewEdges of the ViewMap using the user specified iterator. This operator iterates both using the increment and decrement operators and is therefore bidirectional. This operator works with a ChainingIterator which contains the chaining rules. It is this last one which can be told to chain only edges that belong to the selection or not to process twice a ViewEdge during the chaining. Each time a ViewEdge is added to a chain, its chaining time stamp is incremented. This allows you to keep track of the number of chains to which a ViewEdge belongs to.
Parameters: - it (
ChainingIterator
) – The ChainingIterator on the ViewEdges of the ViewMap. It contains the chaining rule. - pred (
UnaryPredicate1D
) – The predicate on the ViewEdge that expresses the stopping condition.
- it (
-
static
bidirectional_chain
(it) The only difference with the above bidirectional chaining algorithm is that we don’t need to pass a stopping criterion. This might be desirable when the stopping criterion is already contained in the iterator definition. Builds a set of chains from the current set of ViewEdges. Each ViewEdge of the current list potentially starts a new chain. The chaining operator then iterates over the ViewEdges of the ViewMap using the user specified iterator. This operator iterates both using the increment and decrement operators and is therefore bidirectional. This operator works with a ChainingIterator which contains the chaining rules. It is this last one which can be told to chain only edges that belong to the selection or not to process twice a ViewEdge during the chaining. Each time a ViewEdge is added to a chain, its chaining time stamp is incremented. This allows you to keep track of the number of chains to which a ViewEdge belongs to.
Parameters: it ( ChainingIterator
) – The ChainingIterator on the ViewEdges of the ViewMap. It contains the chaining rule.
-
static
chain
(it, pred, modifier)¶ Builds a set of chains from the current set of ViewEdges. Each ViewEdge of the current list starts a new chain. The chaining operator then iterates over the ViewEdges of the ViewMap using the user specified iterator. This operator only iterates using the increment operator and is therefore unidirectional.
Parameters: - it (
ViewEdgeIterator
) – The iterator on the ViewEdges of the ViewMap. It contains the chaining rule. - pred (
UnaryPredicate1D
) – The predicate on the ViewEdge that expresses the stopping condition. - modifier (
UnaryFunction1DVoid
) – A function that takes a ViewEdge as argument and that is used to modify the processed ViewEdge state (the timestamp incrementation is a typical illustration of such a modifier).
- it (
-
static
chain
(it, pred) Builds a set of chains from the current set of ViewEdges. Each ViewEdge of the current list starts a new chain. The chaining operator then iterates over the ViewEdges of the ViewMap using the user specified iterator. This operator only iterates using the increment operator and is therefore unidirectional. This chaining operator is different from the previous one because it doesn’t take any modifier as argument. Indeed, the time stamp (insuring that a ViewEdge is processed one time) is automatically managed in this case.
Parameters: - it (
ViewEdgeIterator
) – The iterator on the ViewEdges of the ViewMap. It contains the chaining rule. - pred (
UnaryPredicate1D
) – The predicate on the ViewEdge that expresses the stopping condition.
- it (
-
static
create
(pred, shaders)¶ Creates and shades the strokes from the current set of chains. A predicate can be specified to make a selection pass on the chains.
Parameters: - pred (
UnaryPredicate1D
) – The predicate that a chain must verify in order to be transform as a stroke. - shaders (list of
StrokeShader
objects) – The list of shaders used to shade the strokes.
- pred (
-
static
get_chain_from_index
(i)¶ Returns the Chain at the index in the current set of Chains.
Parameters: i (int) – index (0 <= i < Operators.get_chains_size()). Returns: The Chain object. Return type: Chain
-
static
get_chains_size
()¶ Returns the number of Chains.
Returns: The number of Chains. Return type: int
-
static
get_stroke_from_index
(i)¶ Returns the Stroke at the index in the current set of Strokes.
Parameters: i (int) – index (0 <= i < Operators.get_strokes_size()). Returns: The Stroke object. Return type: Stroke
-
static
get_strokes_size
()¶ Returns the number of Strokes.
Returns: The number of Strokes. Return type: int
-
static
get_view_edges_size
()¶ Returns the number of ViewEdges.
Returns: The number of ViewEdges. Return type: int
-
static
get_viewedge_from_index
(i)¶ Returns the ViewEdge at the index in the current set of ViewEdges.
Parameters: i (int) – index (0 <= i < Operators.get_view_edges_size()). Returns: The ViewEdge object. Return type: ViewEdge
-
static
recursive_split
(func, pred_1d, sampling=0.0)¶ Splits the current set of chains in a recursive way. We process the points of each chain (with a specified sampling) to find the point minimizing a specified function. The chain is split in two at this point and the two new chains are processed in the same way. The recursivity level is controlled through a predicate 1D that expresses a stopping condition on the chain that is about to be processed.
Parameters: - func (
UnaryFunction0DDouble
) – The Unary Function evaluated at each point of the chain. The splitting point is the point minimizing this function. - pred_1d (
UnaryPredicate1D
) – The Unary Predicate expressing the recursivity stopping condition. This predicate is evaluated for each curve before it actually gets split. If pred_1d(chain) is true, the curve won’t be split anymore. - sampling (float) – The resolution used to sample the chain for the predicates evaluation. (The chain is not actually resampled, a virtual point only progresses along the curve using this resolution.)
- func (
-
static
recursive_split
(func, pred_0d, pred_1d, sampling=0.0) Splits the current set of chains in a recursive way. We process the points of each chain (with a specified sampling) to find the point minimizing a specified function. The chain is split in two at this point and the two new chains are processed in the same way. The user can specify a 0D predicate to make a first selection on the points that can potentially be split. A point that doesn’t verify the 0D predicate won’t be candidate in realizing the min. The recursivity level is controlled through a predicate 1D that expresses a stopping condition on the chain that is about to be processed.
Parameters: - func (
UnaryFunction0DDouble
) – The Unary Function evaluated at each point of the chain. The splitting point is the point minimizing this function. - pred_0d (
UnaryPredicate0D
) – The Unary Predicate 0D used to select the candidate points where the split can occur. For example, it is very likely that would rather have your chain splitting around its middle point than around one of its extremities. A 0D predicate working on the curvilinear abscissa allows to add this kind of constraints. - pred_1d (
UnaryPredicate1D
) – The Unary Predicate expressing the recursivity stopping condition. This predicate is evaluated for each curve before it actually gets split. If pred_1d(chain) is true, the curve won’t be split anymore. - sampling (float) – The resolution used to sample the chain for the predicates evaluation. (The chain is not actually resampled; a virtual point only progresses along the curve using this resolution.)
- func (
-
static
reset
(delete_strokes=True)¶ Resets the line stylization process to the initial state. The results of stroke creation are accumulated if delete_strokes is set to False.
Parameters: delete_strokes (bool) – Delete the strokes that are currently stored.
-
static
select
(pred)¶ Selects the ViewEdges of the ViewMap verifying a specified condition.
Parameters: pred ( UnaryPredicate1D
) – The predicate expressing this condition.
-
static
sequential_split
(starting_pred, stopping_pred, sampling=0.0)¶ Splits each chain of the current set of chains in a sequential way. The points of each chain are processed (with a specified sampling) sequentially. Each time a user specified starting condition is verified, a new chain begins and ends as soon as a user-defined stopping predicate is verified. This allows chains overlapping rather than chains partitioning. The first point of the initial chain is the first point of one of the resulting chains. The splitting ends when no more chain can start.
Parameters: - starting_pred (
UnaryPredicate0D
) – The predicate on a point that expresses the starting condition. - stopping_pred (
UnaryPredicate0D
) – The predicate on a point that expresses the stopping condition. - sampling (float) – The resolution used to sample the chain for the predicates evaluation. (The chain is not actually resampled; a virtual point only progresses along the curve using this resolution.)
- starting_pred (
-
static
sequential_split
(pred, sampling=0.0) Splits each chain of the current set of chains in a sequential way. The points of each chain are processed (with a specified sampling) sequentially and each time a user specified condition is verified, the chain is split into two chains. The resulting set of chains is a partition of the initial chain
Parameters: - pred (
UnaryPredicate0D
) – The predicate on a point that expresses the splitting condition. - sampling (float) – The resolution used to sample the chain for the predicate evaluation. (The chain is not actually resampled; a virtual point only progresses along the curve using this resolution.)
- pred (
-
static
sort
(pred)¶ Sorts the current set of chains (or viewedges) according to the comparison predicate given as argument.
Parameters: pred ( BinaryPredicate1D
) – The binary predicate used for the comparison.
-
static
-
class
freestyle.types.
SShape
¶ Class to define a feature shape. It is the gathering of feature elements from an identified input shape.
-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( SShape
) – An SShape object.
-
add_vertex
(vertex)¶ Adds an SVertex to the list of SVertex of this Shape. The SShape attribute of the SVertex is also set to this SShape.
Parameters: vertex ( SVertex
) – An SVertex object.
-
compute_bbox
()¶ Compute the bbox of the SShape.
-
name
¶ The name of the SShape.
Type: str
-
-
class
freestyle.types.
SVertex
¶ Class hierarchy:
Interface0D
>SVertex
Class to define a vertex of the embedding.
-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( SVertex
) – A SVertex object.
-
__init__
(point_3d, id) Builds a SVertex from 3D coordinates and an Id.
Parameters: - point_3d (
mathutils.Vector
) – A three-dimensional vector. - id (
Id
) – An Id object.
- point_3d (
-
add_fedge
(fedge)¶ Add an FEdge to the list of edges emanating from this SVertex.
Parameters: fedge ( FEdge
) – An FEdge.
-
add_normal
(normal)¶ Adds a normal to the SVertex’s set of normals. If the same normal is already in the set, nothing changes.
Parameters: normal ( mathutils.Vector
, list or tuple of 3 real numbers) – A three-dimensional vector.
-
curvatures
¶ Curvature information expressed in the form of a seven-element tuple (K1, e1, K2, e2, Kr, er, dKr), where K1 and K2 are scalar values representing the first (maximum) and second (minimum) principal curvatures at this SVertex, respectively; e1 and e2 are three-dimensional vectors representing the first and second principal directions, i.e. the directions of the normal plane where the curvature takes its maximum and minimum values, respectively; and Kr, er and dKr are the radial curvature, radial direction, and the derivative of the radial curvature at this SVertex, respectively.
Type: tuple
-
normals
¶ The normals for this Vertex as a list. In a sharp surface, an SVertex has exactly one normal. In a smooth surface, an SVertex can have any number of normals.
Type: list of mathutils.Vector
objects
-
normals_size
¶ The number of different normals for this SVertex.
Type: int
-
point_2d
¶ The projected 3D coordinates of the SVertex.
Type: mathutils.Vector
-
point_3d
¶ The 3D coordinates of the SVertex.
Type: mathutils.Vector
-
viewvertex
¶ If this SVertex is also a ViewVertex, this property refers to the ViewVertex, and None otherwise.
Type: ViewVertex
-
-
class
freestyle.types.
SVertexIterator
¶ Class hierarchy:
Iterator
>SVertexIterator
Class representing an iterator over
SVertex
of aViewEdge
. An instance of an SVertexIterator can be obtained from a ViewEdge by calling verticesBegin() or verticesEnd().-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( SVertexIterator
) – An SVertexIterator object.
-
__init__
(vertex, begin, previous_edge, next_edge, t) Build an SVertexIterator that starts iteration from an SVertex object v.
Parameters:
-
t
¶ The curvilinear abscissa of the current point.
Type: float
-
u
¶ The point parameter at the current point in the 1D element (0 <= u <= 1).
Type: float
-
-
class
freestyle.types.
Stroke
¶ Class hierarchy:
Interface1D
>Stroke
Class to define a stroke. A stroke is made of a set of 2D vertices (
StrokeVertex
), regularly spaced out. This set of vertices defines the stroke’s backbone geometry. Each of these stroke vertices defines the stroke’s shape and appearance at this vertex position.-
Stroke
()¶ Default constructor
-
Stroke
(brother) Copy constructor
-
compute_sampling
(n)¶ Compute the sampling needed to get N vertices. If the specified number of vertices is less than the actual number of vertices, the actual sampling value is returned. (To remove Vertices, use the RemoveVertex() method of this class.)
Parameters: n (int) – The number of stroke vertices we eventually want in our Stroke. Returns: The sampling that must be used in the Resample(float) method. Return type: float
-
insert_vertex
(vertex, next)¶ Inserts the StrokeVertex given as argument into the Stroke before the point specified by next. The length and curvilinear abscissa are updated consequently.
Parameters: - vertex (
StrokeVertex
) – The StrokeVertex to insert in the Stroke. - next (
StrokeVertexIterator
) – A StrokeVertexIterator pointing to the StrokeVertex before which vertex must be inserted.
- vertex (
-
remove_all_vertices
()¶ Removes all vertices from the Stroke.
-
remove_vertex
(vertex)¶ Removes the StrokeVertex given as argument from the Stroke. The length and curvilinear abscissa are updated consequently.
Parameters: vertex ( StrokeVertex
) – the StrokeVertex to remove from the Stroke.
-
resample
(n)¶ Resamples the stroke so that it eventually has N points. That means it is going to add N-vertices_size, where vertices_size is the number of points we already have. If vertices_size >= N, no resampling is done.
Parameters: n (int) – The number of vertices we eventually want in our stroke.
-
resample
(sampling) Resamples the stroke with a given sampling. If the sampling is smaller than the actual sampling value, no resampling is done.
Parameters: sampling (float) – The new sampling value.
-
stroke_vertices_begin
(t=0.0)¶ Returns a StrokeVertexIterator pointing on the first StrokeVertex of the Stroke. One can specify a sampling value to resample the Stroke on the fly if needed.
Parameters: t (float) – The resampling value with which we want our Stroke to be resampled. If 0 is specified, no resampling is done. Returns: A StrokeVertexIterator pointing on the first StrokeVertex. Return type: StrokeVertexIterator
-
stroke_vertices_end
()¶ Returns a StrokeVertexIterator pointing after the last StrokeVertex of the Stroke.
Returns: A StrokeVertexIterator pointing after the last StrokeVertex. Return type: StrokeVertexIterator
-
stroke_vertices_size
()¶ Returns the number of StrokeVertex constituting the Stroke.
Returns: The number of stroke vertices. Return type: int
-
update_length
()¶ Updates the 2D length of the Stroke.
-
length_2d
¶ The 2D length of the Stroke.
Type: float
-
medium_type
¶ The MediumType used for this Stroke.
Type: MediumType
-
texture_id
¶ The ID of the texture used to simulate th marks system for this Stroke.
Type: int
-
tips
¶ True if this Stroke uses a texture with tips, and false otherwise.
Type: bool
-
-
class
freestyle.types.
StrokeAttribute
¶ Class to define a set of attributes associated with a
StrokeVertex
. The attribute set stores the color, alpha and thickness values for a Stroke Vertex.-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( StrokeAttribute
) – A StrokeAttribute object.
-
__init__
(red, green, blue, alpha, thickness_right, thickness_left) Build a stroke vertex attribute from a set of parameters.
Parameters: - red (float) – Red component of a stroke color.
- green (float) – Green component of a stroke color.
- blue (float) – Blue component of a stroke color.
- alpha (float) – Alpha component of a stroke color.
- thickness_right (float) – Stroke thickness on the right.
- thickness_left (float) – Stroke thickness on the left.
-
__init__
(attribute1, attribute2, t) Interpolation constructor. Build a StrokeAttribute from two StrokeAttribute objects and an interpolation parameter.
Parameters: - attribute1 (
StrokeAttribute
) – The first StrokeAttribute object. - attribute2 (
StrokeAttribute
) – The second StrokeAttribute object. - t (float) – The interpolation parameter (0 <= t <= 1).
- attribute1 (
-
get_attribute_real
(name)¶ Returns an attribute of float type.
Parameters: name (str) – The name of the attribute. Returns: The attribute value. Return type: float
-
get_attribute_vec2
(name)¶ Returns an attribute of two-dimensional vector type.
Parameters: name (str) – The name of the attribute. Returns: The attribute value. Return type: mathutils.Vector
-
get_attribute_vec3
(name)¶ Returns an attribute of three-dimensional vector type.
Parameters: name (str) – The name of the attribute. Returns: The attribute value. Return type: mathutils.Vector
-
has_attribute_real
(name)¶ Checks whether the attribute name of float type is available.
Parameters: name (str) – The name of the attribute. Returns: True if the attribute is available. Return type: bool
-
has_attribute_vec2
(name)¶ Checks whether the attribute name of two-dimensional vector type is available.
Parameters: name (str) – The name of the attribute. Returns: True if the attribute is available. Return type: bool
-
has_attribute_vec3
(name)¶ Checks whether the attribute name of three-dimensional vector type is available.
Parameters: name (str) – The name of the attribute. Returns: True if the attribute is available. Return type: bool
-
set_attribute_real
(name, value)¶ Adds a user-defined attribute of float type. If there is no attribute of the given name, it is added. Otherwise, the new value replaces the old one.
Parameters: - name (str) – The name of the attribute.
- value (float) – The attribute value.
-
set_attribute_vec2
(name, value)¶ Adds a user-defined attribute of two-dimensional vector type. If there is no attribute of the given name, it is added. Otherwise, the new value replaces the old one.
Parameters: - name (str) – The name of the attribute.
- value (
mathutils.Vector
, list or tuple of 2 real numbers) – The attribute value.
-
set_attribute_vec3
(name, value)¶ Adds a user-defined attribute of three-dimensional vector type. If there is no attribute of the given name, it is added. Otherwise, the new value replaces the old one.
Parameters: - name (str) – The name of the attribute.
- value (
mathutils.Vector
, list or tuple of 3 real numbers) – The attribute value.
-
alpha
¶ Alpha component of the stroke color.
Type: float
-
color
¶ RGB components of the stroke color.
Type: mathutils.Color
-
thickness
¶ Right and left components of the stroke thickness. The right (left) component is the thickness on the right (left) of the vertex when following the stroke.
Type: mathutils.Vector
-
visible
¶ The visibility flag. True if the StrokeVertex is visible.
Type: bool
-
-
class
freestyle.types.
StrokeShader
¶ Base class for stroke shaders. Any stroke shader must inherit from this class and overload the shade() method. A StrokeShader is designed to modify stroke attributes such as thickness, color, geometry, texture, blending mode, and so on. The basic way for this operation is to iterate over the stroke vertices of the
Stroke
and to modify theStrokeAttribute
of each vertex. Here is a code example of such an iteration:it = ioStroke.strokeVerticesBegin() while not it.is_end: att = it.object.attribute ## perform here any attribute modification it.increment()
-
__init__
()¶ Default constructor.
-
shade
(stroke)¶ The shading method. Must be overloaded by inherited classes.
Parameters: stroke ( Stroke
) – A Stroke object.
-
name
¶ The name of the stroke shader.
Type: str
-
-
class
freestyle.types.
StrokeVertex
¶ Class hierarchy:
Interface0D
>CurvePoint
>StrokeVertex
Class to define a stroke vertex.
-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( StrokeVertex
) – A StrokeVertex object.
-
__init__
(first_vertex, second_vertex, t3d) Build a stroke vertex from 2 stroke vertices and an interpolation parameter.
Parameters: - first_vertex (
StrokeVertex
) – The first StrokeVertex. - second_vertex (
StrokeVertex
) – The second StrokeVertex. - t3d (float) – An interpolation parameter.
- first_vertex (
-
__init__
(point) Build a stroke vertex from a CurvePoint
Parameters: point ( CurvePoint
) – A CurvePoint object.
-
__init__
(svertex) Build a stroke vertex from a SVertex
Parameters: svertex ( SVertex
) – An SVertex object.
-
__init__
(svertex, attribute) Build a stroke vertex from an SVertex and a StrokeAttribute object.
Parameters: - svertex (
SVertex
) – An SVertex object. - attribute (
StrokeAttribute
) – A StrokeAttribute object.
- svertex (
-
attribute
¶ StrokeAttribute for this StrokeVertex.
Type: StrokeAttribute
-
curvilinear_abscissa
¶ Curvilinear abscissa of this StrokeVertex in the Stroke.
Type: float
-
point
¶ 2D point coordinates.
Type: mathutils.Vector
-
stroke_length
¶ Stroke length (it is only a value retained by the StrokeVertex, and it won’t change the real stroke length).
Type: float
-
u
¶ Curvilinear abscissa of this StrokeVertex in the Stroke.
Type: float
-
-
class
freestyle.types.
StrokeVertexIterator
¶ Class hierarchy:
Iterator
>StrokeVertexIterator
Class defining an iterator designed to iterate over the
StrokeVertex
of aStroke
. An instance of a StrokeVertexIterator can be obtained from a Stroke by calling iter(), stroke_vertices_begin() or stroke_vertices_begin(). It is iterating over the same vertices as anInterface0DIterator
. The difference resides in the object access: an Interface0DIterator only allows access to an Interface0D while one might need to access the specialized StrokeVertex type. In this case, one should use a StrokeVertexIterator. To call functions of the UnaryFuntion0D type, a StrokeVertexIterator can be converted to an Interface0DIterator by by calling Interface0DIterator(it).-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( StrokeVertexIterator
) – A StrokeVertexIterator object.
-
decremented
()¶ Returns a copy of a decremented StrokeVertexIterator.
Returns: A StrokeVertexIterator pointing the previous StrokeVertex. Return type: StrokeVertexIterator
-
incremented
()¶ Returns a copy of an incremented StrokeVertexIterator.
Returns: A StrokeVertexIterator pointing the next StrokeVertex. Return type: StrokeVertexIterator
-
reversed
()¶ Returns a StrokeVertexIterator that traverses stroke vertices in the reversed order.
Returns: A StrokeVertexIterator traversing stroke vertices backward. Return type: StrokeVertexIterator
-
at_last
¶ True if the iterator points to the last valid element. For its counterpart (pointing to the first valid element), use it.is_begin.
Type: bool
-
object
¶ The StrokeVertex object currently pointed to by this iterator.
Type: StrokeVertex
-
t
¶ The curvilinear abscissa of the current point.
Type: float
-
u
¶ The point parameter at the current point in the stroke (0 <= u <= 1).
Type: float
-
-
class
freestyle.types.
TVertex
¶ Class hierarchy:
Interface0D
>ViewVertex
>TVertex
Class to define a T vertex, i.e. an intersection between two edges. It points towards two SVertex and four ViewEdges. Among the ViewEdges, two are front and the other two are back. Basically a front edge hides part of a back edge. So, among the back edges, one is of invisibility N and the other of invisibility N+1.
-
__init__
()¶ Default constructor.
-
get_mate
(viewedge)¶ Returns the mate edge of the ViewEdge given as argument. If the ViewEdge is frontEdgeA, frontEdgeB is returned. If the ViewEdge is frontEdgeB, frontEdgeA is returned. Same for back edges.
Parameters: viewedge ( ViewEdge
) – A ViewEdge object.Returns: The mate edge of the given ViewEdge. Return type: ViewEdge
-
-
class
freestyle.types.
UnaryFunction0D
¶ Base class for Unary Functions (functors) working on
Interface0DIterator
. A unary function will be used by invoking __call__() on an Interface0DIterator. In Python, several different subclasses of UnaryFunction0D are used depending on the types of functors’ return values. For example, you would inherit from aUnaryFunction0DDouble
if you wish to define a function that returns a double value. Available UnaryFunction0D subclasses are:UnaryFunction0DDouble
UnaryFunction0DEdgeNature
UnaryFunction0DFloat
UnaryFunction0DId
UnaryFunction0DMaterial
UnaryFunction0DUnsigned
UnaryFunction0DVec2f
UnaryFunction0DVec3f
UnaryFunction0DVectorViewShape
UnaryFunction0DViewShape
-
name
¶ The name of the unary 0D function.
Type: str
-
class
freestyle.types.
UnaryFunction0DDouble
¶ Class hierarchy:
UnaryFunction0D
>UnaryFunction0DDouble
Base class for unary functions (functors) that work on
Interface0DIterator
and return a float value.-
__init__
()¶ Default constructor.
-
-
class
freestyle.types.
UnaryFunction0DEdgeNature
¶ Class hierarchy:
UnaryFunction0D
>UnaryFunction0DEdgeNature
Base class for unary functions (functors) that work on
Interface0DIterator
and return aNature
object.-
__init__
()¶ Default constructor.
-
-
class
freestyle.types.
UnaryFunction0DFloat
¶ Class hierarchy:
UnaryFunction0D
>UnaryFunction0DFloat
Base class for unary functions (functors) that work on
Interface0DIterator
and return a float value.-
__init__
()¶ Default constructor.
-
-
class
freestyle.types.
UnaryFunction0DId
¶ Class hierarchy:
UnaryFunction0D
>UnaryFunction0DId
Base class for unary functions (functors) that work on
Interface0DIterator
and return anId
object.-
__init__
()¶ Default constructor.
-
-
class
freestyle.types.
UnaryFunction0DMaterial
¶ Class hierarchy:
UnaryFunction0D
>UnaryFunction0DMaterial
Base class for unary functions (functors) that work on
Interface0DIterator
and return aMaterial
object.-
__init__
()¶ Default constructor.
-
-
class
freestyle.types.
UnaryFunction0DUnsigned
¶ Class hierarchy:
UnaryFunction0D
>UnaryFunction0DUnsigned
Base class for unary functions (functors) that work on
Interface0DIterator
and return an int value.-
__init__
()¶ Default constructor.
-
-
class
freestyle.types.
UnaryFunction0DVec2f
¶ Class hierarchy:
UnaryFunction0D
>UnaryFunction0DVec2f
Base class for unary functions (functors) that work on
Interface0DIterator
and return a 2D vector.-
__init__
()¶ Default constructor.
-
-
class
freestyle.types.
UnaryFunction0DVec3f
¶ Class hierarchy:
UnaryFunction0D
>UnaryFunction0DVec3f
Base class for unary functions (functors) that work on
Interface0DIterator
and return a 3D vector.-
__init__
()¶ Default constructor.
-
-
class
freestyle.types.
UnaryFunction0DVectorViewShape
¶ Class hierarchy:
UnaryFunction0D
>UnaryFunction0DVectorViewShape
Base class for unary functions (functors) that work on
Interface0DIterator
and return a list ofViewShape
objects.-
__init__
()¶ Default constructor.
-
-
class
freestyle.types.
UnaryFunction0DViewShape
¶ Class hierarchy:
UnaryFunction0D
>UnaryFunction0DViewShape
Base class for unary functions (functors) that work on
Interface0DIterator
and return aViewShape
object.-
__init__
()¶ Default constructor.
-
-
class
freestyle.types.
UnaryFunction1D
¶ Base class for Unary Functions (functors) working on
Interface1D
. A unary function will be used by invoking __call__() on an Interface1D. In Python, several different subclasses of UnaryFunction1D are used depending on the types of functors’ return values. For example, you would inherit from aUnaryFunction1DDouble
if you wish to define a function that returns a double value. Available UnaryFunction1D subclasses are:UnaryFunction1DDouble
UnaryFunction1DEdgeNature
UnaryFunction1DFloat
UnaryFunction1DUnsigned
UnaryFunction1DVec2f
UnaryFunction1DVec3f
UnaryFunction1DVectorViewShape
UnaryFunction1DVoid
-
name
¶ The name of the unary 1D function.
Type: str
-
class
freestyle.types.
UnaryFunction1DDouble
¶ Class hierarchy:
UnaryFunction1D
>UnaryFunction1DDouble
Base class for unary functions (functors) that work on
Interface1D
and return a float value.-
__init__
()¶ Default constructor.
-
__init__
(integration_type) Builds a unary 1D function using the integration method given as argument.
Parameters: integration_type ( IntegrationType
) – An integration method.
-
integration_type
¶ The integration method.
Type: IntegrationType
-
-
class
freestyle.types.
UnaryFunction1DEdgeNature
¶ Class hierarchy:
UnaryFunction1D
>UnaryFunction1DEdgeNature
Base class for unary functions (functors) that work on
Interface1D
and return aNature
object.-
__init__
()¶ Default constructor.
-
__init__
(integration_type) Builds a unary 1D function using the integration method given as argument.
Parameters: integration_type ( IntegrationType
) – An integration method.
-
integration_type
¶ The integration method.
Type: IntegrationType
-
-
class
freestyle.types.
UnaryFunction1DFloat
¶ Class hierarchy:
UnaryFunction1D
>UnaryFunction1DFloat
Base class for unary functions (functors) that work on
Interface1D
and return a float value.-
__init__
()¶ Default constructor.
-
__init__
(integration_type) Builds a unary 1D function using the integration method given as argument.
Parameters: integration_type ( IntegrationType
) – An integration method.
-
integration_type
¶ The integration method.
Type: IntegrationType
-
-
class
freestyle.types.
UnaryFunction1DUnsigned
¶ Class hierarchy:
UnaryFunction1D
>UnaryFunction1DUnsigned
Base class for unary functions (functors) that work on
Interface1D
and return an int value.-
__init__
()¶ Default constructor.
-
__init__
(integration_type) Builds a unary 1D function using the integration method given as argument.
Parameters: integration_type ( IntegrationType
) – An integration method.
-
integration_type
¶ The integration method.
Type: IntegrationType
-
-
class
freestyle.types.
UnaryFunction1DVec2f
¶ Class hierarchy:
UnaryFunction1D
>UnaryFunction1DVec2f
Base class for unary functions (functors) that work on
Interface1D
and return a 2D vector.-
__init__
()¶ Default constructor.
-
__init__
(integration_type) Builds a unary 1D function using the integration method given as argument.
Parameters: integration_type ( IntegrationType
) – An integration method.
-
integration_type
¶ The integration method.
Type: IntegrationType
-
-
class
freestyle.types.
UnaryFunction1DVec3f
¶ Class hierarchy:
UnaryFunction1D
>UnaryFunction1DVec3f
Base class for unary functions (functors) that work on
Interface1D
and return a 3D vector.-
__init__
()¶ Default constructor.
-
__init__
(integration_type) Builds a unary 1D function using the integration method given as argument.
Parameters: integration_type ( IntegrationType
) – An integration method.
-
integration_type
¶ The integration method.
Type: IntegrationType
-
-
class
freestyle.types.
UnaryFunction1DVectorViewShape
¶ Class hierarchy:
UnaryFunction1D
>UnaryFunction1DVectorViewShape
Base class for unary functions (functors) that work on
Interface1D
and return a list ofViewShape
objects.-
__init__
()¶ Default constructor.
-
__init__
(integration_type) Builds a unary 1D function using the integration method given as argument.
Parameters: integration_type ( IntegrationType
) – An integration method.
-
integration_type
¶ The integration method.
Type: IntegrationType
-
-
class
freestyle.types.
UnaryFunction1DVoid
¶ Class hierarchy:
UnaryFunction1D
>UnaryFunction1DVoid
Base class for unary functions (functors) working on
Interface1D
.-
__init__
()¶ Default constructor.
-
__init__
(integration_type) Builds a unary 1D function using the integration method given as argument.
Parameters: integration_type ( IntegrationType
) – An integration method.
-
integration_type
¶ The integration method.
Type: IntegrationType
-
-
class
freestyle.types.
UnaryPredicate0D
¶ Base class for unary predicates that work on
Interface0DIterator
. A UnaryPredicate0D is a functor that evaluates a condition on an Interface0DIterator and returns true or false depending on whether this condition is satisfied or not. The UnaryPredicate0D is used by invoking its __call__() method. Any inherited class must overload the __call__() method.-
__init__
()¶ Default constructor.
-
__call__
(it)¶ Must be overload by inherited classes.
Parameters: it ( Interface0DIterator
) – The Interface0DIterator pointing onto the Interface0D at which we wish to evaluate the predicate.Returns: True if the condition is satisfied, false otherwise. Return type: bool
-
name
¶ The name of the unary 0D predicate.
Type: str
-
-
class
freestyle.types.
UnaryPredicate1D
¶ Base class for unary predicates that work on
Interface1D
. A UnaryPredicate1D is a functor that evaluates a condition on a Interface1D and returns true or false depending on whether this condition is satisfied or not. The UnaryPredicate1D is used by invoking its __call__() method. Any inherited class must overload the __call__() method.-
__init__
()¶ Default constructor.
-
__call__
(inter)¶ Must be overload by inherited classes.
Parameters: inter ( Interface1D
) – The Interface1D on which we wish to evaluate the predicate.Returns: True if the condition is satisfied, false otherwise. Return type: bool
-
name
¶ The name of the unary 1D predicate.
Type: str
-
-
class
freestyle.types.
ViewEdge
¶ Class hierarchy:
Interface1D
>ViewEdge
Class defining a ViewEdge. A ViewEdge in an edge of the image graph. it connects two
ViewVertex
objects. It is made by connecting a set of FEdges.-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( ViewEdge
) – A ViewEdge object.
-
update_fedges
()¶ Sets Viewedge to this for all embedded fedges.
-
chaining_time_stamp
¶ The time stamp of this ViewEdge.
Type: int
-
first_viewvertex
¶ The first ViewVertex.
Type: ViewVertex
-
is_closed
¶ True if this ViewEdge forms a closed loop.
Type: bool
-
last_viewvertex
¶ The second ViewVertex.
Type: ViewVertex
-
occludee
¶ The shape that is occluded by the ViewShape to which this ViewEdge belongs to. If no object is occluded, this property is set to None.
Type: ViewShape
-
qi
¶ The quantitative invisibility.
Type: int
-
-
class
freestyle.types.
ViewEdgeIterator
¶ Class hierarchy:
Iterator
>ViewEdgeIterator
Base class for iterators over ViewEdges of the
ViewMap
Graph. Basically the increment() operator of this class should be able to take the decision of “where” (on which ViewEdge) to go when pointing on a given ViewEdge.-
__init__
(begin=None, orientation=True)¶ Builds a ViewEdgeIterator from a starting ViewEdge and its orientation.
Parameters: - begin (
ViewEdge
or None) – The ViewEdge from where to start the iteration. - orientation (bool) – If true, we’ll look for the next ViewEdge among the ViewEdges that surround the ending ViewVertex of begin. If false, we’ll search over the ViewEdges surrounding the ending ViewVertex of begin.
- begin (
-
__init__
(brother) Copy constructor.
Parameters: brother ( ViewEdgeIterator
) – A ViewEdgeIterator object.
-
change_orientation
()¶ Changes the current orientation.
-
orientation
¶ The orientation of the pointed ViewEdge in the iteration. If true, the iterator looks for the next ViewEdge among those ViewEdges that surround the ending ViewVertex of the “begin” ViewEdge. If false, the iterator searches over the ViewEdges surrounding the ending ViewVertex of the “begin” ViewEdge.
Type: bool
-
-
class
freestyle.types.
ViewMap
¶ Class defining the ViewMap.
-
__init__
()¶ Default constructor.
-
get_closest_fedge
(x, y)¶ Gets the FEdge nearest to the 2D point specified as arguments.
Parameters: - x (float) – X coordinate of a 2D point.
- y (float) – Y coordinate of a 2D point.
Returns: The FEdge nearest to the specified 2D point.
Return type:
-
get_closest_viewedge
(x, y)¶ Gets the ViewEdge nearest to the 2D point specified as arguments.
Parameters: - x (float) – X coordinate of a 2D point.
- y (float) – Y coordinate of a 2D point.
Returns: The ViewEdge nearest to the specified 2D point.
Return type:
-
-
class
freestyle.types.
ViewShape
¶ Class gathering the elements of the ViewMap (i.e.,
ViewVertex
andViewEdge
) that are issued from the same input shape.-
__init__
()¶ Default constructor.
-
__init__
(brother) Copy constructor.
Parameters: brother ( ViewShape
) – A ViewShape object.
-
__init__
(sshape) Builds a ViewShape from an SShape.
Parameters: sshape ( SShape
) – An SShape object.
-
add_edge
(edge)¶ Adds a ViewEdge to the list of ViewEdge objects.
Parameters: edge ( ViewEdge
) – A ViewEdge object.
-
add_vertex
(vertex)¶ Adds a ViewVertex to the list of the ViewVertex objects.
Parameters: vertex ( ViewVertex
) – A ViewVertex object.
-
library_path
¶ The library path of the ViewShape.
Type: str, or None if the ViewShape is not part of a library
-
name
¶ The name of the ViewShape.
Type: str
-
vertices
¶ The list of ViewVertex objects contained in this ViewShape.
Type: List of ViewVertex
objects
-
-
class
freestyle.types.
ViewVertex
¶ Class hierarchy:
Interface0D
>ViewVertex
Class to define a view vertex. A view vertex is a feature vertex corresponding to a point of the image graph, where the characteristics of an edge (e.g., nature and visibility) might change. A
ViewVertex
can be of two kinds: ATVertex
when it corresponds to the intersection between two ViewEdges or aNonTVertex
when it corresponds to a vertex of the initial input mesh (it is the case for vertices such as corners for example). Thus, this class can be specialized into two classes, theTVertex
class and theNonTVertex
class.-
edges_begin
()¶ Returns an iterator over the ViewEdges that goes to or comes from this ViewVertex pointing to the first ViewEdge of the list. The orientedViewEdgeIterator allows to iterate in CCW order over these ViewEdges and to get the orientation for each ViewEdge (incoming/outgoing).
Returns: An orientedViewEdgeIterator pointing to the first ViewEdge. Return type: orientedViewEdgeIterator
-
edges_end
()¶ Returns an orientedViewEdgeIterator over the ViewEdges around this ViewVertex, pointing after the last ViewEdge.
Returns: An orientedViewEdgeIterator pointing after the last ViewEdge. Return type: orientedViewEdgeIterator
-
edges_iterator
(edge)¶ Returns an orientedViewEdgeIterator pointing to the ViewEdge given as argument.
Parameters: edge ( ViewEdge
) – A ViewEdge object.Returns: An orientedViewEdgeIterator pointing to the given ViewEdge. Return type: orientedViewEdgeIterator
-
-
class
freestyle.types.
orientedViewEdgeIterator
¶ Class hierarchy:
Iterator
>orientedViewEdgeIterator
Class representing an iterator over oriented ViewEdges around a
ViewVertex
. This iterator allows a CCW iteration (in the image plane). An instance of an orientedViewEdgeIterator can only be obtained from a ViewVertex by calling edges_begin() or edges_end().-
__init__
()¶ Default constructor.
-
__init__
(iBrother) Copy constructor.
Parameters: iBrother ( orientedViewEdgeIterator
) – An orientedViewEdgeIterator object.
-


1 July 2005
On 24 June 2005, the Ministry of Health of Angola reported a polio case. Angola has not had a case of polio since 2001. A 17-month old girl with a previous history of oral polio vaccine (OPV) developed fever and paralysis in both legs on 25 April, in the metropolitan area of the capital, Luanda.
Genetic sequencing of the type-1 wild poliovirus shows that it originated in India. Virological and epidemiological evidence suggest a recent importation. The affected child and her family have no travel history. An investigation did not detect spread beyond the community.
Outreach from routine immunization services has been stepped up in advance of the campaign. The national routine immunization coverage of children against polio is estimated to be 45%.
A nationwide polio vaccination campaign is planned 29-31 July. Authorities are considering the use of a combination of monovalent oral polio vaccine (mOPV) in the immediate area of the case and trivalent oral polio vaccine in the rest of the country for maximum impact. This will be followed by another round in August.
Health authorities have immediately intensified Acute Flaccid Paralysis (AFP) surveillance in the infected district and surrounding areas and WHO/African Region has notified neighbouring countries.
Briefings with all community and religious leaders, non-governmental organizations and traditional healers are taking place in all municipalities of Luanda.


--- title: ISR keywords: fastai sidebar: home_sidebar summary: "ISR functions and classes for db110 and ms110 systems" description: "ISR functions and classes for db110 and ms110 systems" nb_path: "index.ipynb" ---
This structure is an investigation of using nbdev tools to create, test and document tools for lab use.
pip install isr
Test the readDB110() function call from db110.py
getFieldNames(log) will read the field names from a datalog collected from GTS
fn = getFieldNames('test.log')
print(fn)
readMS110()


| OLD line(s): 95
| NEW line(s): 96
<xsd:include schemaLocation="../../IndividualIncomeTax/Common/IRS8949/IRS8949.xsd" /> |
| OLD line(s): 265
| NEW line(s): 267
<xsd:include schemaLocation="../../CorporateIncomeTax/Common/IRS4255/RecaptureQualifyingTherapeuticDiscoveryProjectCreditStmt.xsd" /> |
| OLD line(s): 354
| NEW line(s): 357
<xsd:include schemaLocation="../../CorporateIncomeTax/Common/IRS8621/GainOrLossMarketToMarketElectionStatement.xsd" /> |
| OLD line(s): 482
| NEW line(s): 486,488
<!-- Includes for Form 8949 (supporting info, schedules, computations, and such) --> <xsd:include schemaLocation="../../IndividualIncomeTax/Common/IRS8949/BasisOtherThanActualCostOfPropertyStatement.xsd" /> |
| OLD line(s): 1036
| NEW line(s): 1043,1049
<!-- Form 8949 --> <xsd:element ref="IRS8949" minOccurs="0" maxOccurs="unbounded"> <xsd:annotation> <xsd:documentation>IRS Form 8949 - Sales and Other Dispositions of Capital Assets</xsd:documentation> </xsd:annotation> </xsd:element> |
| OLD line(s): 1862
| NEW line(s): 1876,1882
<!-- Form 4255 statement --> <xsd:element ref="QlfyThrputicDiscvProjectCrStmt" minOccurs="0" maxOccurs="unbounded"> <xsd:annotation> <xsd:documentation>Recapture Qualifying Therapeutic Discovery Project Credit Statement</xsd:documentation> </xsd:annotation> </xsd:element> |
| OLD line(s): 2303
| NEW line(s): 2324,2330
<xsd:element ref="GainOrLossMrktToMrktElectStmt" minOccurs="0" maxOccurs="unbounded"> <xsd:annotation> <xsd:documentation>Gain Or Loss Market To Market Election Statement</xsd:documentation> </xsd:annotation> </xsd:element> <!-- Form 8621 statement --> |
| OLD line(s): 3155
| NEW line(s): 3183,3189
<!-- Form 8949 statement --> <xsd:element ref="BasisOthThanActlCostPropStmt" minOccurs="0" maxOccurs="unbounded"> <xsd:annotation> <xsd:documentation>Basis Other Than Actual Cost of Property Statement</xsd:documentation> </xsd:annotation> </xsd:element> |


Algorithmic Thinking¶
What is Algorithms?¶
An algorithm is a sequence combination of finite steps to solve a particular problem.
“Algorithmic thinking is likely to cause the most disruptive paradigm shift in the sciences since quantum mechanics.”
—Bernard Chazelle
For example: Multiple two numbers
Step-1: Take two inputs(a,b)
Step-2: Multiply
a
andb
and store insum
Step-3: Print
sum
Importance of algorithms¶
To improve the efficiency of a computer program
Proper utilization of resources
Algorithmic Thinking: The Ultimate Steps¶
Step-1: Understabd the problem
Step-2: Formulate it
Step-3: Design an algorithm
Step-4: Implement it
Step-5: Run the code and solve the original problem
Understanding the Problem¶
Understabd the description of the problem
What are the input/output?
Do a few examples by hand
Think about special cases
Formulate the Problem¶
Think about the data and the best way to represent them(graph, strings, etc)
What mathematical criterion corresponds to the desired output?
Design an Algorithm¶
Is the formulated problem amenable to certain algorithm design technique (greedy, divide-and-conquer etc.)
What data structures match
Examples¶
\begin{example} Write a Python Program to Add Two Integers \end{example}
Start
Inputs A, B(INT)
SUM = A + B
PRINT SUM
End
A = int(input())
B = int(input())
SUM = A+B
print(SUM)
10
36
46
\begin{example}
Write a Python Program to Compute the Average of Two Integers
\end{example}
Start
INPUT A, B(INT)
AVG = A+B/2
PRINT AVG
End
X = int(input())
Y = int(input())
AVG = (X+Y)/2
print(AVG)
10
36
23.0
What is Flow Chart?¶
A flowchart is a type of diagram that represents a workflow or process. A flowchart can also be defined as a diagrammatic representation of an algorithm, a step-by-step approach to solving a task. The flowchart shows the steps as boxes of various kinds, and their order by connecting the boxes with arrows. Sources: wikipedia
Decision Making¶
Step-1: Start
Step-2: Input Marks
Step-3: Calculate Grade and Store in a Variable(Grade = M1+M2+M3+M4)
Step-4: Grade < 60?
Step-4.1: Yes, then print
FAIL
Step-4.2: False, then print
PASS
Step-5: End
What is Pseudocode?¶
Pseudocode is an informal high-level description of the operating principle of a computer program or other algorithm. It uses the structural conventions of a normal programming language, but is intended for human reading rather than machine reading.
Source: wikipedia
Pseudocode Example¶
Input M1
Input M2
Input M3
Input M4
Grade = (M1+M2+M3+M4)/4
if grade < 60
Print FAIL
else
Print Pass


| HYTOOL Function Reference |
Internal function used to create the html demo files
mkdemo(name) name is the name of demo file without the html extension. Warning: do not use unless you are one of the hytool developpers!
mkhelp Published output in the Help browser showdemo mkdemo
| Hytool |
© 1998-2017 Philppe Renard and Co. Terms of Use Acknowledgments


On this page you can add and remove permissions for namespaces and pages in your wiki.
The left pane displays all available namespaces and pages.
The form above allows you to see and modify the permissions of a selected user or group.
In the table below all currently set access control rules are shown. You can use it to quickly delete or change multiple rules.
Reading the official documentation on ACL might help you to fully understand how access control works in DokuWiki.


| Platform | Since |
|---|---|
| iPhone | 0.8 |
| iPad | 0.8 |
Adds a child to this view's hierarchy.
The child view is added as the last child in this view's hierarchy.
Although all views inherit from Titanium.UI.View
, not all views are capable of
containing other views. In particular:
The following views are not intended to act as containers that can hold other views:
Adding children to the these views may be supported on some platforms, but is not guaranteed to work across platforms. Where it is supported, it may not work as expected.
For maximum portability, these views should be treated as if they do not support children.
Instead of adding children to these views, applications can positon other views as
siblings. For example, instead of adding a button as a child of a WebView
, you can add
the button to the web view's parent such that it appears on top of the web view.
A few view objects act as special-purpose containers--that is, they only manage
certain types of children, and many of them support a special means of adding
these children, instead of the general add
method. These containers include:
ButtonBar and TabbedBar are designed
to hold their own internally-created buttons, assigned by adding strings to the "labels" array.
Views added using the add
method are displayed on top of these buttons.
Picker. Can only hold PickerRows
and PickerColumns
, which
are added using the add
method. Adding other types of views to a Picker
is not
supported.
TableView is a specialized container for
TableViewSection
and TableViewRow
objects. These objects must be
added using the properties and methods that TableView
provides
for adding and removing sectons and rows.
On some platforms, it is possible to add arbitrary child views to a table view
using the add
method. However, this is not guaranteed to work on all platforms,
and in general, should be avoided.
TableViewSection is a specialized container
for TableViewRow
objects, which are added using the add
method. The add
method
on TableViewSection
can only be used to add TableViewRow
objects.
Toolbar is designed to hold buttons and certain
other controls, added to its items
array. Views added using the add
method are
displayed on top of the controls in the items
array.
The Tab
, TabGroup
, NavigationGroup
and SplitWindow
objects are
special containers that manage windows. These are discussed in the
"Top-Level Containers" section.
There are certain top-level containers that are not intended to be added as the children of other views. These top-level containers include Window, SplitWindow, and TabGroup. Other types of views must be added to a top-level container in order to be displayed on screen.
The special containers NavigationGroup,
SplitWindow, Tab, and
TabGroup
manage windows. These managed windows may be referred to as children of the
container, but they are not added using the add
method.
Note that although a NavigationGroup
manages windows, it is not itself top-level container. It must be added to a
Window
in order to be displayed.
Tab
is another kind of special container: it is not itself a top-level container,
but can only be used within a TabGroup
. You cannot add
a Tab
to an arbitrary
container.
| Name | Type | Summary |
|---|---|---|
| view | Titanium.UI.View | View to add to this view's hierarchy. |


CyanogenMod 6.0 Released (Still No Galaxy S Support)
Just a couple of days ago, the good folk ‘Cyanogen’ released version 6.0 of their much acclaimed CyanogenMod. To my (and many other peopleR...
Just a couple of days ago, the good folk ‘Cyanogen’ released version 6.0 of their much acclaimed CyanogenMod. To my (and many other peopleR...
In case you were not aware yet, there are Froyo builds available out there RIGHT NOW for the Samsung Galaxy S. You just have to be aware that these builds...
True to the proverbial “feather in the cap”, I have been promoted to committer with the project I have been participating on during the last f...
[Updated – Jump to the end of the post for a detailed walkthrough]
I went into an O2 store today. I was merely looking to handle the new iPhone 4, to see how it looked like in person, to see how it felt in my hand andR...
Alright so I know everyone has been talking about this and it has been debated and criticized ad nauseum but this latest press conference was nothing shor...
Everyone who follows the technology world would know the name Gray Powell. This is the name of the lad who lost his prototype iPhone 4G at a German beer b...
So! It’s been a while and I come back with nothing but sad and unhappy stories.
The so much awaited Apple Tablet has finally been announced by good ole Steve Jobs. My first impression? Meh. Put it this way, I was very very excited abo...
Oh oh! No, not Santa, this is actually a juicy story. Mark Wilson at Gizmodo brings us an issue with the latest Apple’s iMacs. According to said per...
Yeah, it is serious 🙂 I have 10 Google Wave invites to distribute to the first ten visitors to leave me a comment on this post. This is NOT a contest, I w...
The New Year is at the gates and so I thought it would be a splendid occasion to change the looks of my blog. Therefore, avast ye landlubbers! The new theme ...
Well, for some weird reason, Apple refuses to give in and have Adobe port Flash over to the iPhone. It would be a massive advantage if we could see an iPh...
 It seems that T-Mobile has actually managed to recover most of the da...
Well, truth to be told this had to happen at some point. According to the good folks at Engadget, T-Mobile has most probably lost the data of their custom...
Having recently tried Mac OS X and all of it Exposé and Spaces goodness, I couldn’t help but to notice that Aero Peek feels like a complete rip off ...
Soooo… apparently Mac’s can’t catch viruses but the iPhone certainly can. There is a flaw in the iPhone’s software that allows any...
The good silly folks over at AppleInsider are reporting on a flaw that might open the iPhone OS 3.0 to mass spam. While there is some truth to their claim...
Yes, that’s correct. Windows 7 was officially released to manufacturing and this version should be available over the course of the next few days.


Manages providers.
More...
#include <Host.hpp>
List of all members.
Classes |
| struct | ProviderInfo |
| | Structure with information about a provider type.
|
Public Member Functions |
| bool | add (Provider *provider) |
| | Add provider.
|
Friends |
|
class | PluginManager |
|
class | Provider |
Detailed Description
Manages providers.
Definition at line 44 of file Host.hpp.
Member Function Documentation
| bool pluma::Host::add |
( |
Provider * |
provider | ) |
|
Add provider.
Provider type and version are checked. Only known and valid provider types are accepted.
- Parameters:
-
- Returns:
- True if the provider is accepted.
The documentation for this class was generated from the following file:


Last night I took a pill that I knew to be 'real' ecstacy (i. e. MDMA, MDA, or MDE) at a party. This experience was noticeably different in many ways from all of my previous ecstacy experiences, and I suspect that this may have actually been my first experience with MDA.
---Setting
I went to the party in a happy, energetic mood and had been doing lots of dancing and eagerly awaiting the D+B that I crave. Earlier in the day, I had taken 30 mg. of Adderall (Dexedrine and Benzedrine) to do some homework, and it had probably worn off but been replaced by the party energy I was working up.
---12:30 (T+0 hrs.)
 It is a white, hard, roll, about the size of a double-stack, marked 'XTC'. It is slightly speckled, and has the definite bitter taste of ecstacy. I had gotten the pill for free by going out and buying some for some girls at my school, who had told me that this was one of the 'best pills they had ever taken', so I was awaiting a great roll.
---T+1 hrs.
 My typical experience with XTC is that from 30 to 45 minutes after taking the pill, I am feeling nothing, and then the entire effect of it descends on me over a 5-minute span (blowing up). However, at this point I am feeling nothing.
---T+1 1/2 hrs.
I start yawning noticeably and taking deep breaths. I am expecting to blow up, but instead I feel the effects of the roll creep up on me over the next 30 minutes; there is no rush, but rather a steady increase in effect. It is at this point that I start to feel 'smacky'; i. e. it is hard to keep my eyes open at times, the nystagmus (eye fluttering) is insane, and I want to lie down; I leave for the chill room and almost fall asleep.
---T+2 hrs.
I am definitely 'rolling' at this point, but it is different from every other time I have rolled. First of all, my energy has completely disappeared, and I spend the next one and a half hours with my eyes closed propped up against a wall. At several times, I try to dance, but usually find that I am not 'feeling' it and don't have the energy, and end up sitting down shortly. The empathogenic/entactogenic feelings that I associate with MDMA are also missing, and I feel more 'fucked up' with an intense body buzz and psychedelic head-trip than rolly/lovey, but I am definitely rolling.
It is at this point that I notice the psychedelic effects of this pill; I am getting minor acid-style visuals (flowing surfaces, visual noise in the forms of dots and lines and flashes, slightly 'digitized' appearance to surfaces) and also the afterburn effect that I associate with E (i. e. I close my eyes and the image slowly fades over a few seconds). Also, I start to notice that although I can not dance to the D+B, I am feeling it in almost the identical way that I do while on LSD, i. e. I am breaking the individual beats and basslines down in my head, literally dissecting the music and becoming utterly entranced in it, although all I can do is sit back and bob my head rhythmically.
---T+3 1/2 hrs.
The smacky feelings have disappeared, to be replaced by a sudden rush of amphetamine effect. The visuals and psychedelic activity are still going strong, and I begin to notice the happy vibes I normally associate with E that had been missing over the last two hours. I spend the next hour getting back into the vibe of the party and doing some dancing. When I speak of happy vibes, I mean not the empathogenic qualities (still missing), but that I am feeling vibrant and social, laughing and smiling quite a bit.
---T+4 1/2 hrs.
This is quite interesting. We leave the party early (against my wishes) because my friend has contracted 'raver disease' (runny nose, headache, etc.) and can not stand staying in the venue any longer. While driving back to the city, I notice that I am feeling much like the giddy come-on to acid. When I look back on everything, it was all a logical progression, but at this point I am very speedy (talking fast, etc.) and quite giddy, cracking lots of jokes and laughing hysterically, and just generally having a good time. The minor visuals and a minor body buzz are still here; the general effect = happy + tweaking.
---T+5 1/2 hrs.
Once in the city, we stop for coffee. My appetite is practically nonexistent, but I am downing coffee and cigarettes like a madman. I am still cracking lots of jokes, and really getting along with these two people who had accompanied us whom I hadn't known before. I also have the rolly eyes I sometimes see on ravers, i. e. dilated and wide open, almost like a staring zombie, accompanied by a giddy smile.
---T+6 hrs.
I get home, and I am basically feeling a warm amphetamine effect with the same minor visuals. I still don't feel 'cracked out', but rather that most of the effects have simply gone away. As a precaution, I take several 5-HTP pills to help cushion the impact of the pill, and take a large amount of kava-kava to get to sleep.
---T+14 hrs.
I wake up, and I spend the rest of the day somewhat drained, but certainly not depressed... more surreal insomnia-style with mild giddiness, and I can still call up visuals on certain surfaces if I stare for long enough.
---My conclusions:
I inferred that the pill I had taken was MDA. Several of the things that I had noticed have been identical to things I have read in MDA trip reports and abstracts; initial smackiness and powerful nystagmus, lack of empathogenic qualities, followed by amphetamine effects, and all of this combined with minor acid-like visual and mind effects. If anyone has ever taken any of these pills or has some input, I would appreciate it.
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.


Estimate hazard ratios, survival curves and attributable risks for cohorts with missing covariates, using Cox models or Kaplan-Meier estimated for strata. This handles studies nested within cohorts, such as case-cohort studies with stratified sampling. See http://www.r-project.org/doc/Rnews/Rnews_2008-1.pdf
| Version: | 1.1-3 |
| Depends: | R (≥ 2.15.2), survival, MASS |
| Published: | 2013-02-07 |
| Author: | Hormuzd A. Katki |
| Maintainer: | Hormuzd A. Katki <katkih at mail.nih.gov> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: | http://dceg.cancer.gov/about/staff-bios/katki-hormuzd |
| NeedsCompilation: | no |
| Citation: | NestedCohort citation info |
| Materials: | README |
| In views: | Survival |
| CRAN checks: | NestedCohort results |
| Reference manual: | NestedCohort.pdf |
| Vignettes: |
NestedCohort Tutorial |
| Package source: | NestedCohort_1.1-3.tar.gz |
| Windows binaries: | r-devel: NestedCohort_1.1-3.zip, r-release: NestedCohort_1.1-3.zip, r-oldrel: NestedCohort_1.1-3.zip |
| OS X binaries: | r-release: NestedCohort_1.1-3.tgz, r-oldrel: NestedCohort_1.1-3.tgz |
| Old sources: | NestedCohort archive |
Please use the canonical form https://CRAN.R-project.org/package=NestedCohort to link to this page.


{% include head.html %}
{% include starter-template/admin/header.html %}
{{ content }}
{% include back-to-top.html %} {% include scripts.html %}


NCC Music Festivals
Home
Festivals
Register
About
New Activities
Book Online
Accommodation
Book online
Enter your account name:
Enter your password:
Choose the music festival to register:
Festival in Love Family Park, Germany
Festival in Millennium Park, Chicago
Choose your ticket:
VIP
Normal
Multi-day pass
One-day pass
Enter the phone number we can contact you:
Enter the departure date:
January
February
March
April
May
June
July
August
September
October
November
December
Enter the return date:
January
February
March
April
May
June
July
August
September
October
November
December


Rode212.github.io
OMRON V7-IP65 QUICK START MANUAL Pdf Download. View and Download OMRON V7-IP65 quick start manual online. Compact Sensorless Vector Inverter. V7-IP65 Inverter pdf manual download. Also for: Varispeed v7 ip65 cimr-v7tz. OMRON V7 QUICK MANUAL Pdf Download. View and Download OMRON V7 quick manual online. Compact Sensorless Vector Inverter. V7 Inverter pdf manual download. Also for: Varispeed v7 cimr-v7az.


WESLEY UNITED METHODIST CHURCH
At venue2 on date2 time2
Do you really want to register on these event?
registerCancel


Inherits
Example.
List of all members.
Detailed Description
Example:
Golf tournament
Schedule a golf tournament. This is problem 010 from csplib.
Definition at line 74 of file golf.cc.
Member Enumeration Documentation
Model variants.
- Enumerator:
-
| MODEL_PLAIN |
A simple model. |
| MODEL_SYMMETRY |
Model with symmetry breaking. |
Definition at line 77 of file golf.cc.
- Enumerator:
-
| PROP_PLAIN |
Propagation using intersection propagators. |
| PROP_DECOMPOSE |
Propagation using union and complement propagators. |
Definition at line 81 of file golf.cc.
Constructor & Destructor Documentation
Actual model.
Definition at line 99 of file golf.cc.
| Golf::Golf |
( |
bool |
share, |
|
|
Golf & |
s | |
|
) |
| | [inline] |
Constructor for copying s.
Definition at line 254 of file golf.cc.
Member Function Documentation
| SetVar& Golf::group |
( |
int |
w, |
|
|
int |
g | |
|
) |
| | [inline] |
Return group number g in week w.
Definition at line 94 of file golf.cc.
| virtual void Golf::print |
( |
std::ostream & |
os |
) |
[inline, virtual] |
| virtual Space* Golf::copy |
( |
bool |
share |
) |
[inline, virtual] |
Make variables available for visualisation.
Reimplemented from Gecode::Space.
Definition at line 267 of file golf.cc.
Friends And Related Function Documentation
Initial value:
{ {8,4,9},
{5,3,7},
{4,3,2}
}
Tournaments.
Definition at line 57 of file golf.cc.
Number of tournaments.
Definition at line 63 of file golf.cc.
Member Data Documentation
Number of groups in a week.
Definition at line 85 of file golf.cc.
Number of players in a group.
Definition at line 86 of file golf.cc.
Number of weeks.
Definition at line 87 of file golf.cc.
Overall number of players.
Definition at line 88 of file golf.cc.
The sets representing the groups.
Definition at line 91 of file golf.cc.
The documentation for this class was generated from the following file:


--- tags: - energy author: display_name: JP email<EMAIL_ADDRESS>date: 2011-11-18 15:43:48 -0700 categories: [] PowerPlants: hub: name: Utah Power Plants CO2 item_id: 0fd6aa168ea2463c8adce143a06812ce updates: - July 2008 --- {% include abstract.html name="Power Plants (C02)" abstract="This dataset contains Power Plant locations from the CO2 project for the State of Utah." %}
This dataset contains the ORIS Code, name, type, CO2 Annual Tons and fuel code for the plants. There are no constraints or warranties with regard to the use of this dataset.
{% include contact.html subject=page.title contact=site.data.contacts.agrc %}


/var/www/GeraAta
/
library
/
Zend
/
Gdata
/
Health
(Dashboard)
Class Coverage Distribution
Class Complexity
Top Project Risks
Zend_Gdata_Health_Query
(1122)
Zend_Gdata_Health_Extension_Ccr
(132)
Zend_Gdata_Health_ProfileEntry
(90)
Zend_Gdata_Health_ProfileFeed
(12)
Least Tested Methods
Zend_Gdata_Health_Query::setGrouped
(0%)
Zend_Gdata_Health_Query::getGrouped
(0%)
Zend_Gdata_Health_Query::getCategory
(0%)
Zend_Gdata_Health_Query::setCategory
(0%)
Zend_Gdata_Health_Query::setDigest
(0%)
Zend_Gdata_Health_Query::getDigest
(0%)
Zend_Gdata_Health_Query::setMaxResultsGroup
(0%)
Zend_Gdata_Health_Query::getMaxResultsGroup
(0%)
Zend_Gdata_Health_Query::setStartIndexInGroup
(0%)
Zend_Gdata_Health_Query::getStartIndexInGroup
(0%)


“The First Reader was mostly in words of one syllable. In this book we find the story of the lame dog that, when cured, brought another lame dog to be doctored; of the kind boy who freed his caged bird; of the cruel boy who drowned the cat and pulled wings and legs from flies;… of the chimney sweep who was tempted to steal a gold watch but put it back and was thereafter educated by its owner; of the whisky boy; and of the mischievous boy who played ghost and made another boy insane. Nearly every lesson has a moral clearly stated in formal didactic words at its close.” — Henry H Vail, A History Of The McGuffey Readers


|
Figure 1
|
Conductivity profile at the detonation of cyclotrimethylene- ... |
|
Figure 2
|
Influence of the grain size on the conductivity at the deton ... |
|
Figure 3
|
( a) Maximum value of conductivity σ max vs. the duration τ ... |
|
Figure 4
|
Photographs of RDX grains. Left is the fine-grained powder w ... |


An implementation of protein descriptors in R. These descriptors combine the advantages of being fixed length and including partial sequential effect: Various length of protein sequences are described with fixed length vectors that are suitable for machine learning algorithms, and still includes partial sequential effect.
| Version: | 0.1.0 |
| Suggests: | testthat |
| Published: | 2016-03-03 |
| Author: | Berat Kurar [aut, cre], Sami Abu Sneineh [aut], Yaqoub Ashhab [aut] |
| Maintainer: | Berat Kurar <beratkurar at gmail.com> |
| License: | BSD 3-clause License + file LICENSE |
| NeedsCompilation: | no |
| CRAN checks: | ProteinDescriptors results |
| Reference manual: | ProteinDescriptors.pdf |
| Package source: | ProteinDescriptors_0.1.0.tar.gz |
| Windows binaries: | r-devel: ProteinDescriptors_0.1.0.zip, r-release: ProteinDescriptors_0.1.0.zip, r-oldrel: ProteinDescriptors_0.1.0.zip |
| OS X binaries: | r-release: ProteinDescriptors_0.1.0.tgz, r-oldrel: ProteinDescriptors_0.1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=ProteinDescriptors to link to this page.


/
67.48%
Statements
110/163
59.05%
Branches
62/105
82.14%
Functions
23/28
62.14%
Lines
87/140
3 statements, 1 function, 10 branches
Ignored
File
Statements
Branches
Functions
Lines
lib/
63.83%
30/47
31.25%
5/16
66.67%
4/6
63.83%
30/47
lib/uka/
54.17%
39/72
58.9%
43/73
85.71%
6/7
52.86%
37/70
lib/wma/
93.18%
41/44
87.5%
14/16
86.67%
13/15
86.96%
20/23


HIGH FIDELITY
Review by John Beachem
* * * *
Directed by: Stephen Frears Written by: Nick Hornby (novel), D.V. DeVincentis
Thinking back over all the horrible relationships you've had, could you rank them in order of how painful they were? Rob Gordon, wonderfully played by John Cusack ("Grosse Point Blank", "Being John Malkovich"), is capable of ranking not only his worst relationships, but everything else for that matter. Rob ranks his favorite songs, albums, movies, performers, and anything else he can think of. Rob then proceeds to explain to the camera and the audience why he has ranked things in such a way. I've always felt that John Cusack was one of the more underappreciated comic actors of our time, and he has only recently begun to be recognized by audiences and critics. I was pleased to find that "High Fidelity" gives him the oppurtunity to really display his comic talents.
Rob Gordon runs a record store called Champion Vinyl with his two employees, the obnoxious Barry (Jack Black) and the meek Dick (Todd Louiso). Rob has just been dumped by the light of his life, Laura (Iben Hjejle), and he isn't handling it particularly well. He now spends his time relating his past miserable experiences to the camera and trying to determine just where he went wrong. The thing really driving Rob nuts is that Laura left him for a guy named Ian (Tim Robbins), or Roy - he's never quite sure which name the guy goes by. His sister, Liz (Joan Cusack), is first sympethetic to Rob's problems, but eventually gives up on him. Rob decides to revisit his five worst breakups to determine where exactly he went wrong in each relationship.
There's something about "High Fidelity" which is strangely endearing. It may be Cusack's performance as a man almost everyone can relate to in some way; or it might be the interesting narrative style used throughout the film. However, I'm sure it has more to do with Cusack's Rob being such a sympathetic character, despite the way he acts at times. Certainly one of the film's greatest features is the wonderful soundtrack (what do you expect in a movie about a record store). Stephen Frears ("Mary Reilly") manages to use music of just about every type, each song chosen to perfectly accompany the scene in which it is used. Speaking of music, Jack Black ("The Jackal", "Enemy of the State") is given a musical number near the end of the film that makes me believe the man maybe in the wrong line of work.
If you're going into "High Fidelity" expecting a laugh-out-loud movie like "There's Something About Mary", you're in for a disappointment. While there are one or two truly hilarious scenes (the confrontation between Ian and Rob, for example), the majority of the film is one you can't help but chuckle at all the way through. The characters are all eccentric and at least mildly amusing, except for Jack Black's character, Barry, who is an absolute riot. I'm not sure why Black has been hiding out in minor roles for the past seven years, but someone has to hand that man a leading role in something. As for the rest of the cast, Joan Cusack and Tim Robbins are both sadly underused, though newcomer Iben Hjejle is given plenty of screen time in which to shine. Catherine Zeta-Jones, Lili Taylor, and even Bruce Springsteen all show up in what amount to cameos.
"High Fidelity" is certainly a fun movie, but it's far from perfect. The romantic elements are sometimes a bit overused, which leaves the film humorless at times. The movie also runs a bit too long at 113 minutes, with the last fifteen being almost unnecessary (except Black's musical number). If you're a fan of John Cusack, I would certainly recommend this movie. If you're one of those rare individuals who doesn't care for him, "High Fidelity" just might make you a fan of his. I'm not sure if the soundtrack is out yet, but if it is I'd recommend picking it up. One last thing I wanted to note, I'm not sure what Frears believes Chicago is like, but I could have sworn there were more people living there than we see here. I'd recommend "High Fidelity" to just about anyone (unless you dislike comedies, of course) and give it four out of five stars.
Comments? Feel free to e-mail them to<EMAIL_ADDRESS>For past reviews, movie news, and other fun stuff, visit: http://www.dependentfilms.net
* * * * * - One of the greatest movies ever made, see it now. * * * * - Great flick. Try and catch this one. * * * - Okay movie, hits and misses. * * - Pretty bad. See it if you have nothing better to do. * - One of the worst movies ever. See it only if you enjoy pain.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


{{ .Title }}
{{ .Content }}Want to get the latest articles and news? Subscribe to the newsletter here 👇
{{ partial "newsletter.html" . }}And for other articles, check the rest of the blog! Blog - Gonçalo Palma
{{ define "main" }} {{ if .Params.thumbnail }}
Want to get the latest articles and news? Subscribe to the newsletter here 👇
{{ partial "newsletter.html" . }}And for other articles, check the rest of the blog! Blog - Gonçalo Palma


BESDDFFS Simulator
Home Page
View All Transactions
View Message Details
View Network Transactions
View Cloud Transactions
View Verified Cloud Transactions
View Drone Details
View Blockchain Details


I develop websites, apps, and more for the cheapest prices around!
The video production service of MicahIncorporated, most known for the YouTube channel D&M Productions.
Internet not working? Computer slow? I'm here to help with all your technology woes.
Don't want to be that one person who never decorates? Call me! I'll set up your holiday decorations.


Toggle navigation
HOME
PROFILE
EVENTS
ADD EVENTS
SHOP
ADD Product
Logout
Home
Event Details
40 Dt
53313557
40 places
27-10-2018
Participate
Participant List


Winds 96-110 mph (83-95 kt)
Some damage to building roofs, doors and windows.
Considerable damage to mobile homes. Flooding damages piers
and small craft in unprotected moorings may break their moorings.
Some trees blown down. Examples: Bonnie 1998 Gloria 1985


Before Change
transpose_1 = nodes[1]
transpose_1.children = []
shape = reshape_1.attrs["shape"]
channels = shape[1]
scale = shape[2]
height = shape[4]
After Change
shape_name_second_reshape = self.get_unique_edge_name(graph, reshape_output_name)
output_name_second_reshape = self.get_unique_edge_name(graph, reshape_output_name)
reshape_2 = Node(
reshape_output_name,
"Reshape",
{},
[transpose_1.outputs[0], shape_name_second_reshape],
[output_name_second_reshape]
)
reshape_2.input_tensors[shape_name_second_reshape] = np.asarray([channels * height, scale, scale, width])
transpose_1.add_child(reshape_2)
transpose_2 = Node(