| 18 Feb 1954 |
John Travolta born, Englewood NJ. He is the youngest of six children of Salvatore and Helen Travolta. |
| 1970 |
Drops out of school. |
| 1975 |
Joins the Church of Scientology. Stern |
| 9 Sep 1975 |
Becomes Sweathog Vinnie Barbarino. |
| 16 Dec 1977 |
Presided over the era of disco: Saturday Night Fever. |
| 7 Jul 1978 |
Stars in Grease. |
| 1981 |
Hasty Pudding Club names Travolta Man of the Year. |
| Apr 1990 |
The National Enquirer publishes an interview with gay pornstar Paul Barresi, who alleges he had a relationship with Travolta for several years in the 1980's. For this, he was paid $100K by the magazine, but he later retracted the claim. |
| 6 May 1991 |
In a cover story "Scientology: A Thriving Cult of Greed and Power", Time magazine alleges private rumors of Travolta's promiscuous homosexuality. |
| 5 Sep 1991 |
A Scientology minister marries Kelly Preston and John Travolta. This marriage is declared illegal. |
| 12 Sep 1991 |
Marries actress Kelly Preston, for real this time, in Daytona Beach, Florida. |
| 14 Oct 1994 |
Travolta stars in Pulp Fiction. |
| 1996 |
Estimated income: $61M. Forbes. |
| 1996 |
Accepting a Golden Globe for his role in Get Shorty, Travolta gives thanks to "a great man, L. Ron Hubbard." |
| Jan 1997 |
In an interview published in Good Housekeeping, John Travolta declares: "The only reason I didn't end up like Elvis or Marilyn is because of Scientology." |
| Mar 1998 |
"The next day, I met with Clinton. He told me: 'Your program sounds great. More than that, I'd really love to help you with your issue over in Germany with Scientology.' I was waiting for the seduction that I had heard so much about. I thought, 'Well, how could he ever seduce me? And after we talked, I thought, 'Bingo!' He did it. Scientology is the one issue that really matters to me." George magazine. |
| 21 May 1998 |
Scientology and John Travolta sued by gay artist Michael Pattison, alleging racketeering, fraud, etc., and an inability to fix the artist's gayness. |
| 20 Mar 1998 |
Plays Bill Clinton in Primary Colors. |
| 17 Jun 1999 |
During his acceptance speech for Blockbuster's World Artist Award, John Travolta thanks "my good friend LRH, and mostly, most importantly I want to thank all of you." |
| 12 May 2000 |
The Warner Bros. sci-fi spectacular Battlefield Earth is released in theaters. The $80 million adaptation of a phenomenally-crappy L. Ron Hubbard novel rakes in a grand total of $21,471,685. |


Whimsy is a site where a set of unnecessary yet highly useful applications are deployed at Apache.
The Apache Whimsy PMC manages this server, and maintains the tools here. Our focus is on providing organizational information about the ASF and our projects in easy to consume ways, and helping to automate corporate processes at the ASF to make the paperwork behind the scenes easier for our many volunteers. Please see the Code, Questions, or Issues links above to learn more about the project.


This building has no readings available. Configure a Bridge and Sensors under "Configuration" "Data Collection".


Urban Meyer Criticizes SEC Teams For Scheduling Cupcakes This Week
by Matt LombardiWhile there are some solid matchups in college football on Saturday, most of them aren’t involving SEC teams. It’s the annual “cupcake” weekend for the Southeastern Conference ahead of rivalry games next week.
Former Ohio State head coach Urban Meyer, now part of FOX’s Big Noon Kickoff, is not a fan. During multiple segments on the show, Meyer said the matchups are “not good for college football.”
Some examples – Alabama vs. Western Carolina, Auburn vs. Samford, Kentucky vs. UT Martin, Mississippi State vs. Abilene Christian.
Meyer also advocated for what he calls “uniform scheduling” – nine conference games and one other Power-5 matchup for every Power 5 team in the country.
Of course, Meyer once coached Florida, and the Gators basically did the same thing during his tenure. Ahead of their matchup with Florida State, the Gators would play lower-level opponents.
Meyer has clearly changed his tune on the idea.
While it would be nice to have better matchups this Saturday, don’t expect SEC teams to change what they’re doing unless they’re forced to. The College Football Playoff committee has not punished the league’s teams for these kinds of late-season matchups so far.


|
Biomedical Image Analysis Library
The Biomedical Image Analysis Library is a poweful tool for developers, physicians, researchers, engineers, and so on.
|
dimensional matrix handeling. When acessed by (x, y), or (x, y, z) operator, index x corresponds to the index of the column, and index y corresponds to the index of the row. This standard comes from text printing order and image display and storage in most of the computer systems. More...
#include <FileImage.hpp>
Public Member Functions | |
| Matrix () | |
| Basic Constructor. More... | |
| Matrix (const Vector< size_t > &size) | |
| Basic Constructor. More... | |
| Matrix (D *new_data, const Vector< size_t > &new_dim) | |
| Basic Constructor. This constructor works as a wrapper for data already allocated. It will use the same space pointed by new_data to manipulate the matrix. Use this for compatibility with other data structures, in a easy convertion to Matrix class. More... | |
| Matrix (size_t size_0, size_t size_1) | |
| Basic Constructor for 2D matrix. More... | |
| Matrix (size_t size_0, size_t size_1, size_t size_2) | |
| Basic Constructor for 3D matrix. More... | |
| Matrix (const Matrix< D > &mtx) | |
| Copy constructor. More... | |
| Matrix (Matrix< D > &&)=default | |
| Move constructor. More... | |
| template<class D2 > | |
| Matrix (const Matrix< D2 > &mtx) | |
| Copy constructor. More... | |
| Matrix< D > & | operator= (const Matrix< D > &other) |
| Assigns 'other' matrix content to this matrix. More... | |
| Matrix< D > & | operator= (Matrix< D > &&)=default |
| Assigns 'other' matrix content to this matrix, moving the content. More... | |
| template<class D2 > | |
| Matrix< D > & | operator= (const Matrix< D2 > &other) |
| Assigns 'other' matrix content to this matrix. More... | |
| template<class D2 > | |
| bool | operator== (const Matrix< D2 > &other) const |
| The matrices are considered equal if they have the same dimensions and their elements have the same value. More... | |
| Matrix< D > & | operator++ () |
| Increments all elements of this matrix and returns it. More... | |
| Matrix< D > | operator++ (int) |
| Increments all elements of this matrix and returns it. More... | |
| Matrix< D > & | operator-- () |
| Decrements all elements of this matrix and returns it. More... | |
| Matrix< D > | operator-- (int) |
| Decrements all elements of this matrix and returns it. More... | |
| template<class D2 > | |
| Matrix< D > | operator+ (const Matrix< D2 > &other) const |
| Computes the sum of the matrices 'this' and other and returns the resultant matrix. More... | |
| template<class D2 > | |
| Matrix< D > & | operator+= (const Matrix< D2 > &other) |
| Computes the sum of the matrices 'this' and other and assigns the result to this. More... | |
| Matrix< D > | operator- () const |
| Computes the negative matrix of 'this' and returns the resultant matrix. More... | |
| template<class D2 > | |
| Matrix< D > | operator- (const Matrix< D2 > &other) const |
| Computes the difference of the matrices 'this' and other and returns the resultant matrix. More... | |
| template<class D2 > | |
| Matrix< D > & | operator-= (const Matrix< D2 > &other) |
| Computes the difference of the matrices 'this' and other and assigns the result to this. More... | |
| template<class D2 > | |
| Matrix< D > | operator* (const Matrix< D2 > &other) const |
| Computes the product of the matrices 'this' and other and returns the resultant matrix. More... | |
| template<class D2 > | |
| Matrix< D > & | operator*= (const Matrix< D2 > &other) |
| Computes the product of the matrices 'this' and other and assigns the result to this. More... | |
| Matrix< D > | operator+ (double scalar) const |
| Computes the sum of 'this' matrix by the scalar. More... | |
| Matrix< D > & | operator+= (double scalar) |
| Updates 'this' matrix with the sum of 'this' by the input scalar. More... | |
| Matrix< D > | operator- (double scalar) const |
| Computes the difference between 'this' matrix and the scalar. More... | |
| Matrix< D > & | operator-= (double scalar) |
| Updates 'this' matrix with the difference between 'this' and the input scalar. More... | |
| Matrix< D > | operator* (double scalar) const |
| Computes the product of 'this' matrix by the scalar. More... | |
| Matrix< D > & | operator*= (double scalar) |
| Updates 'this' matrix with the product of 'this' by the input scalar. More... | |
| template<class D2 > | |
| Matrix< D > | operator/ (const Matrix< D2 > &other) const |
| Computes the division of the matrices 'this' and other and returns the resultant matrix. More... | |
| template<class D2 > | |
| Matrix< D > & | operator/= (const Matrix< D2 > &other) |
| Computes the division of the matrices 'this' and other and assigns the result to this. More... | |
| Matrix< D > | operator/ (double scalar) const |
| Computes the division of 'this' matrix by the scalar. More... | |
| Matrix< D > & | operator/= (double scalar) |
| Updates 'this' matrix with the division of 'this' by the input scalar. More... | |
| const D & | operator[] (size_t p) const |
| Returns a constant reference of data pointed by index p. It has the same effect as operator data( p ). More... | |
| D & | operator[] (size_t p) |
| Returns the reference for data pointed by index p. It has the same effect as operator data( p ). More... | |
| const D & | operator() (size_t p) const |
| Returns constant reference of data pointed by index p. It has the same effect as operator data[ p ]. More... | |
| D & | operator() (size_t p) |
| Returns the reference for data pointed by index p. It has the same effect as operator data[ p ]. More... | |
| const D & | operator() (size_t p_0, size_t p_1) const |
| Returns constant reference of data pointed by index ( p_0, p_1 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] ]. More... | |
| D & | operator() (size_t p_0, size_t p_1) |
| Returns the reference for data pointed by index ( p_0, p_1 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] ]. More... | |
| const D & | operator() (size_t p_0, size_t p_1, size_t p_2) const |
| Returns constant reference of data pointed by index ( p_0, p_1, p_2 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] ]. More... | |
| D & | operator() (size_t p_0, size_t p_1, size_t p_2) |
| Returns the reference for data pointed by index ( p_0, p_1, p_2 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] ]. More... | |
| const D & | operator() (size_t p_0, size_t p_1, size_t p_2, size_t p_3) const |
| Returns constant reference of data pointed by index ( p_0, p_1, p_2, p_3 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] + p_3 * acc_dim_size[ 2 ] ]. More... | |
| D & | operator() (size_t p_0, size_t p_1, size_t p_2, size_t p_3) |
| Returns the reference for data pointed by index ( p_0, p_1, p_2, p_3 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] + p_3 * acc_dim_size[ 2 ] ]. More... | |
| const D & | operator() (size_t p_0, size_t p_1, size_t p_2, size_t p_3, size_t p_4) const |
| Returns constant reference of data pointed by index ( p_0, p_1, p_2, p_3, p_4 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] + p_3 * acc_dim_size[ 2 ] + p_4 * acc_dim_size[ 3 ] ]. More... | |
| D & | operator() (size_t p_0, size_t p_1, size_t p_2, size_t p_3, size_t p_4) |
| Returns the reference for data pointed by index ( p_0, p_1, p_2, p_3, p_4 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] + p_3 * acc_dim_size[ 2 ] + p_4 * acc_dim_size[ 3 ] ]. More... | |
| const D & | operator() (const Vector< size_t > &p) const |
| Returns constant reference of data pointed by index ( p[ 0 ], p[ 1 ], p[ 2 ], ... ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] ... ]. More... | |
| D & | operator() (const Vector< size_t > &p) |
| Returns the reference of data pointed by index ( p[ 0 ], p[ 1 ], p[ 2 ], ... ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] ... ]. More... | |
| void | Abs () |
| Computes the absolute value of the matrix elements. More... | |
| Matrix< D > | Abs () const |
| Computes the absolute value of the matrix elements. More... | |
| std::vector< D >::iterator | begin () noexcept |
| Returns iterator begin() of data. More... | |
| std::vector< D >::const_iterator | begin () const noexcept |
| Returns const_iterator begin() of data. More... | |
| std::vector< D >::iterator | end () noexcept |
| Returns iterator end() of data. More... | |
| std::vector< D >::const_iterator | end () const noexcept |
| Returns const_iterator end() of data. More... | |
| std::vector< D >::reverse_iterator | rbegin () noexcept |
| Returns the reverse_iterator rbegin() of data Vector. More... | |
| std::vector< D >::const_reverse_iterator | rbegin () const noexcept |
| Returns const_reverse_iterator rbegin() of data Vector. More... | |
| std::vector< D >::reverse_iterator | rend () noexcept |
| Returns reverse_iterator rend() of data Vector. More... | |
| std::vector< D >::const_reverse_iterator | rend () const noexcept |
| Returns const_reverse_iterator rend() of data Vector. More... | |
| std::vector< D >::const_iterator | cbegin () const noexcept |
| Returns the iterator cbegin() of data Vector. More... | |
| std::vector< D >::const_iterator | cend () const noexcept |
| Returns the iterator cend() of data Vector. More... | |
| std::vector< D >::const_reverse_iterator | crbegin () const noexcept |
| Returns the iterator crbegin() of data Vector. More... | |
| std::vector< D >::const_reverse_iterator | crend () const noexcept |
| Returns the iterator crend() of data Vector. More... | |
| const D * | Data () const |
| Returns a reference to data. More... | |
| D * | Data () |
| Returns a reference to data. More... | |
| const D * | data () const |
| Returns a reference to data. More... | |
| D * | data () |
| Returns a reference to data. More... | |
| size_t | Size () const |
| Returns size of data Vector. More... | |
| size_t | size () const |
| Returns size of data Vector. Same as Size( ), just for compatibility with std containers. More... | |
| size_t | Elements () const |
| Returns the number of elements of the matrix. Same as Size( ) method. More... | |
| size_t | Elements (D min, D max) const |
| Returns the number of elements counted inside the interval limited by min and max. More... | |
| size_t | Coordinate (size_t position, size_t dimension) const |
| Returns the coordinate of position in given dimension. More... | |
| Vector< size_t > | Coordinates (size_t position) const |
| Returns the coordinates of the input position in this matrix. More... | |
| size_t | Position (size_t p_0, size_t p_1) const |
| Returns the position corresponding to the input coordinates in this matrix. More... | |
| size_t | Position (size_t p_0, size_t p_1, size_t p_2) const |
| Returns the position corresponding to the input coordinates in this matrix. More... | |
| size_t | Position (size_t p_0, size_t p_1, size_t p_2, size_t p_3) const |
| Returns the position corresponding to the input coordinates in this matrix. More... | |
| size_t | Position (const Vector< size_t > &coordinates) const |
| Returns the position corresponding to the input coordinates in this matrix. More... | |
| size_t | Position (const Vector< int > &coordinates) const |
| Returns the position corresponding to the input coordinates in this matrix. More... | |
| size_t | Position (const Vector< float > &coordinates) const |
| Returns the position corresponding to the input coordinates in this matrix. More... | |
| void | Set (D val) |
| Sets val to each element of the matrix. More... | |
| Vector< size_t > | Dim () const |
| Returns a Vector with all matrix dimensions. More... | |
| size_t | MinDim () const |
| Returns the minimum size among all matrix dimensions. More... | |
| size_t | MaxDim () const |
| Returns the maximum size among all matrix dimensions. More... | |
| size_t | Size (size_t dimension) const |
| Returns matrix required dimension. More... | |
| size_t | size (size_t dimension) const |
| Returns matrix required dimension. Just for symmetry with size( ) and Size( ) functions. More... | |
| size_t | Dims () const |
| Returns the number of dimensions of 'this' matrix. More... | |
| size_t | Displacement (size_t dimension) const |
| Returns the position displacement of one unit in dimension i. More... | |
| const D & | at (size_t p) const |
| Reads the constant reverence of value contained at position p of data Vector. More... | |
| D & | at (size_t p) |
| Reads the value contained at position p of data Vector and returns its reference. More... | |
| const D & | at (size_t p_0, size_t p_1) const |
| Reads the constant reverence of value contained at position p_0, p_1 of data Vector. More... | |
| D & | at (size_t p_0, size_t p_1) |
| Reads the value contained at position p_0, p_1 of data Vector and returns its reference. More... | |
| const D & | at (size_t p_0, size_t p_1, size_t p_2) const |
| Reads the constant reverence of value contained at position p_0, p_1, p_2 of data Vector. More... | |
| D & | at (size_t p_0, size_t p_1, size_t p_2) |
| Reads the value contained at position p_0, p_1, p_2 of data Vector and returns its reference. More... | |
| const D & | at (size_t p_0, size_t p_1, size_t p_2, size_t p_3) const |
| Reads the constant reverence of value contained at position p_0, p_1, p_2, p_3 of data Vector. More... | |
| D & | at (size_t p_0, size_t p_1, size_t p_2, size_t p_3) |
| Reads the value contained at position p_0, p_1, p_2, p_3 of data Vector and returns its reference. More... | |
| const D & | at (size_t p_0, size_t p_1, size_t p_2, size_t p_3, size_t p_4) const |
| Reads the constant reverence of value contained at position p_0, p_1, p_2, p_3, p_4 of data Vector. More... | |
| D & | at (size_t p_0, size_t p_1, size_t p_2, size_t p_3, size_t p_4) |
| Reads the value contained at position p_0, p_1, p_2, p_3, p_4 of data Vector and returns its reference. More... | |
| const D & | at (const Vector< size_t > &p) const |
| Returns constant reference of data pointed by index ( p[ 0 ], p[ 1 ], p[ 2 ], ... ). It has the same effect as operator data[ p_0 + p_1 * acc_dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] ... ]. More... | |
| D & | at (const Vector< size_t > &p) |
| Returns constant reference of data pointed by index ( p[ 0 ], p[ 1 ], p[ 2 ], ... ). It has the same effect as operator data[ p_0 + p_1 * acc_dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] ... ]. More... | |
| bool | ValidElement (const Vector< size_t > &p) const |
| Verifies if element is in matrix domain. More... | |
| void | SetRange (D min, D max) |
| Recalculate the amplitude scale of the matrix by the following formula: mat[ pxl ] = min + ( mat[ pxl ] - mat_min ) * ( max - min ) / ( mat_max - mat_min ) More... | |
| D | Maximum () const |
| Compute and return the maximum value among matrix elements. More... | |
| D | Minimum () const |
| Compute and return the minimum value among matrix elements. More... | |
| template<class O > | |
| O & | Print (O &os) const |
| Prints matrix containts to output stream os. More... | |
| template<class O > | |
| O & | PrintDimensions (O &os) const |
| Prints matrix dimensions to output stream os. More... | |
| template<class D2 > | |
| bool | Equals (const Matrix< D2 > &src, double delta) const |
| Compares src matrix to 'this' matrix. They are considere equal only if they have the same dimensions and data. More... | |
| template<class D2 > | |
| bool | SameDimensions (const Matrix< D2 > &src) const |
| Compares the dimensions of src matrix to the dimensions of 'this' matrix. More... | |
| bool | SameDimensions (const Adjacency &adj) const |
| Compares the dimensions of adj adjacency relation to the dimensions of 'this' matrix. More... | |
Protected Attributes | |
| Vector< D > | _data |
| data vector More... | |
| D * | qk_data |
| Quick access reference for data. More... | |
| size_t | _size |
| data size More... | |
| size_t | dims |
| number of matrix dimensions More... | |
| Vector< size_t > | dim_size |
| size of matrix dimensions. More... | |
| Vector< size_t > | acc_dim_size |
| accumulated size of matrix dimensions. More... | |
Friends | |
| class | Adjacency |
| class | Kernel |
| template<class D2 > | |
| class | Matrix |
| template<class D2 > | |
| class | Image |
dimensional matrix handeling. When acessed by (x, y), or (x, y, z) operator, index x corresponds to the index of the column, and index y corresponds to the index of the row. This standard comes from text printing order and image display and storage in most of the computer systems.
Definition at line 29 of file FileImage.hpp.
| Bial::Matrix< D >::Matrix | ( | ) |
Basic Constructor.
| none. |
Definition at line 1145 of file Matrix.hpp.
| Bial::Matrix< D >::Matrix | ( | const Vector< size_t > & | size | ) |
Basic Constructor.
| size | Vector with matrix dimensions. |
Definition at line 1149 of file Matrix.hpp.
| Bial::Matrix< D >::Matrix | ( | D * | new_data, |
| const Vector< size_t > & | new_dim | ||
| ) |
Basic Constructor. This constructor works as a wrapper for data already allocated. It will use the same space pointed by new_data to manipulate the matrix. Use this for compatibility with other data structures, in a easy convertion to Matrix class.
| new_data | Pointer to data allocated elsewhere. |
| new_dim | Matrix dimensions. |
Definition at line 1185 of file Matrix.hpp.
| Bial::Matrix< D >::Matrix | ( | size_t | size_0, |
| size_t | size_1 | ||
| ) |
Basic Constructor for 2D matrix.
| size_0 | matrix dimension 0. |
| size_1 | matrix dimension 1. |
Definition at line 1211 of file Matrix.hpp.
| Bial::Matrix< D >::Matrix | ( | size_t | size_0, |
| size_t | size_1, | ||
| size_t | size_2 | ||
| ) |
Basic Constructor for 3D matrix.
| size_0 | matrix dimension 0. |
| size_1 | matrix dimension 1. |
| size_2 | matrix dimension 2. |
Definition at line 1247 of file Matrix.hpp.
| Bial::Matrix< D >::Matrix | ( | const Matrix< D > & | mtx | ) |
Copy constructor.
| mtx | Source matrix to be clonned. |
Definition at line 1283 of file Matrix.hpp.
|
default |
Move constructor.
| mtx | Source matrix to be clonned. |
Copy constructor.
| mtx | Source matrix to be clonned. |
Definition at line 1308 of file Matrix.hpp.
| void Bial::Matrix< D >::Abs | ( | ) |
Computes the absolute value of the matrix elements.
| none. |
Definition at line 2106 of file Matrix.hpp.
| Matrix< D > Bial::Matrix< D >::Abs | ( | ) | const |
Computes the absolute value of the matrix elements.
| none. |
Definition at line 2123 of file Matrix.hpp.
| const D & Bial::Matrix< D >::at | ( | size_t | p | ) | const |
Reads the constant reverence of value contained at position p of data Vector.
| p | global index of the data being accessed. |
Definition at line 2391 of file Matrix.hpp.
| D & Bial::Matrix< D >::at | ( | size_t | p | ) |
Reads the value contained at position p of data Vector and returns its reference.
| p | global index of the data being accessed. |
Definition at line 2401 of file Matrix.hpp.
| const D & Bial::Matrix< D >::at | ( | size_t | p_0, |
| size_t | p_1 | ||
| ) | const |
Reads the constant reverence of value contained at position p_0, p_1 of data Vector.
| p_0 | first index of the data being accessed. |
| p_1 | second index of the data being accessed. |
Definition at line 2411 of file Matrix.hpp.
| D & Bial::Matrix< D >::at | ( | size_t | p_0, |
| size_t | p_1 | ||
| ) |
Reads the value contained at position p_0, p_1 of data Vector and returns its reference.
| p_0 | first index of the data being accessed. |
| p_1 | second index of the data being accessed. |
Definition at line 2424 of file Matrix.hpp.
| const D & Bial::Matrix< D >::at | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2 | ||
| ) | const |
Reads the constant reverence of value contained at position p_0, p_1, p_2 of data Vector.
| p_0 | first index of the data being accessed. |
| p_1 | second index of the data being accessed. |
| p_2 | third index of the data being accessed. |
Definition at line 2437 of file Matrix.hpp.
| D & Bial::Matrix< D >::at | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2 | ||
| ) |
Reads the value contained at position p_0, p_1, p_2 of data Vector and returns its reference.
| p_0 | first index of the data being accessed. |
| p_1 | second index of the data being accessed. |
| p_2 | third index of the data being accessed. |
Definition at line 2450 of file Matrix.hpp.
| const D & Bial::Matrix< D >::at | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2, | ||
| size_t | p_3 | ||
| ) | const |
Reads the constant reverence of value contained at position p_0, p_1, p_2, p_3 of data Vector.
| p_0 | first index of the data being accessed. |
| p_1 | second index of the data being accessed. |
| p_2 | third index of the data being accessed. |
| p_3 | fourth index of the data being accessed. |
Definition at line 2463 of file Matrix.hpp.
| D & Bial::Matrix< D >::at | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2, | ||
| size_t | p_3 | ||
| ) |
Reads the value contained at position p_0, p_1, p_2, p_3 of data Vector and returns its reference.
| p_0 | first index of the data being accessed. |
| p_1 | second index of the data being accessed. |
| p_2 | third index of the data being accessed. |
| p_3 | fourth index of the data being accessed. |
Definition at line 2477 of file Matrix.hpp.
| const D & Bial::Matrix< D >::at | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2, | ||
| size_t | p_3, | ||
| size_t | p_4 | ||
| ) | const |
Reads the constant reverence of value contained at position p_0, p_1, p_2, p_3, p_4 of data Vector.
| p_0 | first index of the data being accessed. |
| p_1 | second index of the data being accessed. |
| p_2 | third index of the data being accessed. |
| p_3 | fourth index of the data being accessed. |
| p_4 | fifth index of the data being accessed. |
Definition at line 2491 of file Matrix.hpp.
| D & Bial::Matrix< D >::at | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2, | ||
| size_t | p_3, | ||
| size_t | p_4 | ||
| ) |
Reads the value contained at position p_0, p_1, p_2, p_3, p_4 of data Vector and returns its reference.
| p_0 | first index of the data being accessed. |
| p_1 | second index of the data being accessed. |
| p_2 | third index of the data being accessed. |
| p_3 | fourth index of the data being accessed. |
| p_4 | fifth index of the data being accessed. |
Definition at line 2506 of file Matrix.hpp.
| const D & Bial::Matrix< D >::at | ( | const Vector< size_t > & | p | ) | const |
Returns constant reference of data pointed by index ( p[ 0 ], p[ 1 ], p[ 2 ], ... ). It has the same effect as operator data[ p_0 + p_1 * acc_dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] ... ].
| p | Vector of indexes to be acessed. |
Definition at line 2522 of file Matrix.hpp.
| D & Bial::Matrix< D >::at | ( | const Vector< size_t > & | p | ) |
Returns constant reference of data pointed by index ( p[ 0 ], p[ 1 ], p[ 2 ], ... ). It has the same effect as operator data[ p_0 + p_1 * acc_dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] ... ].
| p | Vector of indexes to be acessed. |
Definition at line 2537 of file Matrix.hpp.
|
noexcept |
Returns iterator begin() of data.
| none. |
Definition at line 2146 of file Matrix.hpp.
|
noexcept |
Returns const_iterator begin() of data.
| none. |
Definition at line 2152 of file Matrix.hpp.
|
noexcept |
|
noexcept |
| size_t Bial::Matrix< D >::Coordinate | ( | size_t | position, |
| size_t | dimension | ||
| ) | const |
Returns the coordinate of position in given dimension.
| position | Dimension index. |
| dimension | A matrix dimension. |
Definition at line 2257 of file Matrix.hpp.
| Vector< size_t > Bial::Matrix< D >::Coordinates | ( | size_t | position | ) | const |
Returns the coordinates of the input position in this matrix.
| index | element position. |
Definition at line 2268 of file Matrix.hpp.
|
noexcept |
|
noexcept |
| const D * Bial::Matrix< D >::Data | ( | ) | const |
Returns a reference to data.
| none. |
Definition at line 2210 of file Matrix.hpp.
| D * Bial::Matrix< D >::Data | ( | ) |
Returns a reference to data.
| none. |
Definition at line 2215 of file Matrix.hpp.
| const D * Bial::Matrix< D >::data | ( | ) | const |
Returns a reference to data.
| none. |
Definition at line 2220 of file Matrix.hpp.
| D * Bial::Matrix< D >::data | ( | ) |
Returns a reference to data.
| none. |
Definition at line 2225 of file Matrix.hpp.
| Vector< size_t > Bial::Matrix< D >::Dim | ( | ) | const |
Returns a Vector with all matrix dimensions.
| none. |
Definition at line 2344 of file Matrix.hpp.
| size_t Bial::Matrix< D >::Dims | ( | ) | const |
Returns the number of dimensions of 'this' matrix.
| none. |
Definition at line 2381 of file Matrix.hpp.
| size_t Bial::Matrix< D >::Displacement | ( | size_t | dimension | ) | const |
Returns the position displacement of one unit in dimension i.
| dimension | The required dimension. |
Definition at line 2386 of file Matrix.hpp.
| size_t Bial::Matrix< D >::Elements | ( | ) | const |
Returns the number of elements of the matrix. Same as Size( ) method.
| none. |
Definition at line 2240 of file Matrix.hpp.
| size_t Bial::Matrix< D >::Elements | ( | D | min, |
| D | max | ||
| ) | const |
Returns the number of elements counted inside the interval limited by min and max.
| min | Minimum value in interval. |
| max | Maximum value in interval. |
Definition at line 2245 of file Matrix.hpp.
|
noexcept |
Returns iterator end() of data.
| none. |
Definition at line 2158 of file Matrix.hpp.
|
noexcept |
Returns const_iterator end() of data.
| none. |
Definition at line 2164 of file Matrix.hpp.
| bool Bial::Matrix< D >::Equals | ( | const Matrix< D2 > & | src, |
| double | delta | ||
| ) | const |
Compares src matrix to 'this' matrix. They are considere equal only if they have the same dimensions and data.
| src | Matrix to compare to. |
| delta | Maximum difference between any element of |
| 'this' | and src. |
Definition at line 2701 of file Matrix.hpp.
| size_t Bial::Matrix< D >::MaxDim | ( | ) | const |
Returns the maximum size among all matrix dimensions.
| none. |
Definition at line 2360 of file Matrix.hpp.
| D Bial::Matrix< D >::Maximum | ( | ) | const |
Compute and return the maximum value among matrix elements.
| none. |
Definition at line 2608 of file Matrix.hpp.
| size_t Bial::Matrix< D >::MinDim | ( | ) | const |
Returns the minimum size among all matrix dimensions.
| none. |
Definition at line 2349 of file Matrix.hpp.
| D Bial::Matrix< D >::Minimum | ( | ) | const |
Compute and return the minimum value among matrix elements.
| none. |
Definition at line 2613 of file Matrix.hpp.
| const D & Bial::Matrix< D >::operator() | ( | size_t | p | ) | const |
Returns constant reference of data pointed by index p. It has the same effect as operator data[ p ].
| p | a global index to be acessed. |
Definition at line 2004 of file Matrix.hpp.
| D & Bial::Matrix< D >::operator() | ( | size_t | p | ) |
Returns the reference for data pointed by index p. It has the same effect as operator data[ p ].
| p | a global index to be acessed. |
Definition at line 2009 of file Matrix.hpp.
| const D & Bial::Matrix< D >::operator() | ( | size_t | p_0, |
| size_t | p_1 | ||
| ) | const |
Returns constant reference of data pointed by index ( p_0, p_1 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] ].
| p_0 | first index to be acessed. |
| p_1 | second index to be acessed. |
Definition at line 2014 of file Matrix.hpp.
| D & Bial::Matrix< D >::operator() | ( | size_t | p_0, |
| size_t | p_1 | ||
| ) |
Returns the reference for data pointed by index ( p_0, p_1 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] ].
| p_0 | first index to be acessed. |
| p_1 | second index to be acessed. |
Definition at line 2019 of file Matrix.hpp.
| const D & Bial::Matrix< D >::operator() | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2 | ||
| ) | const |
Returns constant reference of data pointed by index ( p_0, p_1, p_2 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] ].
| p_0 | first index to be acessed. |
| p_1 | second index to be acessed. |
| p_2 | third index to be acessed. |
Definition at line 2024 of file Matrix.hpp.
| D & Bial::Matrix< D >::operator() | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2 | ||
| ) |
Returns the reference for data pointed by index ( p_0, p_1, p_2 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] ].
| p_0 | first index to be acessed. |
| p_1 | second index to be acessed. |
| p_2 | third index to be acessed. |
Definition at line 2029 of file Matrix.hpp.
| const D & Bial::Matrix< D >::operator() | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2, | ||
| size_t | p_3 | ||
| ) | const |
Returns constant reference of data pointed by index ( p_0, p_1, p_2, p_3 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] + p_3 * acc_dim_size[ 2 ] ].
| p_0 | first index to be acessed. |
| p_1 | second index to be acessed. |
| p_2 | third index to be acessed. |
| p_3 | fourth index to be acessed. |
Definition at line 2034 of file Matrix.hpp.
| D & Bial::Matrix< D >::operator() | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2, | ||
| size_t | p_3 | ||
| ) |
Returns the reference for data pointed by index ( p_0, p_1, p_2, p_3 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] + p_3 * acc_dim_size[ 2 ] ].
| p_0 | first index to be acessed. |
| p_1 | second index to be acessed. |
| p_2 | third index to be acessed. |
| p_3 | fourth index to be acessed. |
Definition at line 2039 of file Matrix.hpp.
| const D & Bial::Matrix< D >::operator() | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2, | ||
| size_t | p_3, | ||
| size_t | p_4 | ||
| ) | const |
Returns constant reference of data pointed by index ( p_0, p_1, p_2, p_3, p_4 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] + p_3 * acc_dim_size[ 2 ] + p_4 * acc_dim_size[ 3 ] ].
| p_0 | first index to be acessed. |
| p_1 | second index to be acessed. |
| p_2 | third index to be acessed. |
| p_3 | fourth index to be acessed. |
| p_4 | fifth index to be acessed. |
Definition at line 2044 of file Matrix.hpp.
| D & Bial::Matrix< D >::operator() | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2, | ||
| size_t | p_3, | ||
| size_t | p_4 | ||
| ) |
Returns the reference for data pointed by index ( p_0, p_1, p_2, p_3, p_4 ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] + p_3 * acc_dim_size[ 2 ] + p_4 * acc_dim_size[ 3 ] ].
| p_0 | first index to be acessed. |
| p_1 | second index to be acessed. |
| p_2 | third index to be acessed. |
| p_3 | fourth index to be acessed. |
| p_4 | fifth index to be acessed. |
Definition at line 2050 of file Matrix.hpp.
| const D & Bial::Matrix< D >::operator() | ( | const Vector< size_t > & | p | ) | const |
Returns constant reference of data pointed by index ( p[ 0 ], p[ 1 ], p[ 2 ], ... ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] ... ].
| p | Vector of indexes to be acessed. |
Definition at line 2056 of file Matrix.hpp.
| D & Bial::Matrix< D >::operator() | ( | const Vector< size_t > & | p | ) |
Returns the reference of data pointed by index ( p[ 0 ], p[ 1 ], p[ 2 ], ... ). It has the same effect as operator data[ p_0 + p_1 * dim_size[ 0 ] + p_2 * acc_dim_size[ 1 ] ... ].
| p | Vector of indexes to be acessed. |
Definition at line 2081 of file Matrix.hpp.
| Matrix< D > Bial::Matrix< D >::operator* | ( | const Matrix< D2 > & | other | ) | const |
Computes the product of the matrices 'this' and other and returns the resultant matrix.
| other | second other. |
Definition at line 1641 of file Matrix.hpp.
| Matrix< D > Bial::Matrix< D >::operator* | ( | double | scalar | ) | const |
Computes the product of 'this' matrix by the scalar.
| scalar | a scalar. |
Definition at line 1883 of file Matrix.hpp.
| Matrix< D > & Bial::Matrix< D >::operator*= | ( | const Matrix< D2 > & | other | ) |
Computes the product of the matrices 'this' and other and assigns the result to this.
| other | second other. |
Definition at line 1684 of file Matrix.hpp.
| Matrix< D > & Bial::Matrix< D >::operator*= | ( | double | scalar | ) |
Updates 'this' matrix with the product of 'this' by the input scalar.
| scalar | a scalar. |
Definition at line 1910 of file Matrix.hpp.
| Matrix< D > Bial::Matrix< D >::operator+ | ( | const Matrix< D2 > & | other | ) | const |
Computes the sum of the matrices 'this' and other and returns the resultant matrix.
| other | second other. |
Definition at line 1500 of file Matrix.hpp.
| Matrix< D > Bial::Matrix< D >::operator+ | ( | double | scalar | ) | const |
Computes the sum of 'this' matrix by the scalar.
| scalar | a scalar. |
Definition at line 1781 of file Matrix.hpp.
| Matrix< D > & Bial::Matrix< D >::operator++ | ( | ) |
Increments all elements of this matrix and returns it.
| none. |
Definition at line 1427 of file Matrix.hpp.
| Matrix< D > Bial::Matrix< D >::operator++ | ( | int | ) |
Increments all elements of this matrix and returns it.
| none. |
Definition at line 1435 of file Matrix.hpp.
| Matrix< D > & Bial::Matrix< D >::operator+= | ( | const Matrix< D2 > & | other | ) |
Computes the sum of the matrices 'this' and other and assigns the result to this.
| other | second other. |
Definition at line 1532 of file Matrix.hpp.
| Matrix< D > & Bial::Matrix< D >::operator+= | ( | double | scalar | ) |
Updates 'this' matrix with the sum of 'this' by the input scalar.
| scalar | a scalar. |
Definition at line 1808 of file Matrix.hpp.
| Matrix< D > Bial::Matrix< D >::operator- | ( | ) | const |
Computes the negative matrix of 'this' and returns the resultant matrix.
| other | second other. |
Definition at line 1556 of file Matrix.hpp.
| Matrix< D > Bial::Matrix< D >::operator- | ( | const Matrix< D2 > & | other | ) | const |
Computes the difference of the matrices 'this' and other and returns the resultant matrix.
| other | second other. |
Definition at line 1584 of file Matrix.hpp.
| Matrix< D > Bial::Matrix< D >::operator- | ( | double | scalar | ) | const |
Computes the difference between 'this' matrix and the scalar.
| scalar | a scalar. |
Definition at line 1832 of file Matrix.hpp.
| Matrix< D > & Bial::Matrix< D >::operator-- | ( | ) |
Decrements all elements of this matrix and returns it.
| none. |
Definition at line 1460 of file Matrix.hpp.
| Matrix< D > Bial::Matrix< D >::operator-- | ( | int | ) |
Decrements all elements of this matrix and returns it.
| none. |
Definition at line 1474 of file Matrix.hpp.
| Matrix< D > & Bial::Matrix< D >::operator-= | ( | const Matrix< D2 > & | other | ) |
Computes the difference of the matrices 'this' and other and assigns the result to this.
| other | second other. |
Definition at line 1616 of file Matrix.hpp.
| Matrix< D > & Bial::Matrix< D >::operator-= | ( | double | scalar | ) |
Updates 'this' matrix with the difference between 'this' and the input scalar.
| scalar | a scalar. |
Definition at line 1859 of file Matrix.hpp.
| Matrix< D > Bial::Matrix< D >::operator/ | ( | const Matrix< D2 > & | other | ) | const |
Computes the division of the matrices 'this' and other and returns the resultant matrix.
| other | second other. |
Definition at line 1709 of file Matrix.hpp.
| Matrix< D > Bial::Matrix< D >::operator/ | ( | double | scalar | ) | const |
Computes the division of 'this' matrix by the scalar.
| scalar | a scalar. |
Definition at line 1934 of file Matrix.hpp.
| Matrix< D > & Bial::Matrix< D >::operator/= | ( | const Matrix< D2 > & | other | ) |
Computes the division of the matrices 'this' and other and assigns the result to this.
| other | second other. |
Definition at line 1757 of file Matrix.hpp.
| Matrix< D > & Bial::Matrix< D >::operator/= | ( | double | scalar | ) |
Updates 'this' matrix with the division of 'this' by the input scalar.
| scalar | a scalar. |
Definition at line 1966 of file Matrix.hpp.
| Matrix< D > & Bial::Matrix< D >::operator= | ( | const Matrix< D > & | other | ) |
Assigns 'other' matrix content to this matrix.
| other | matrix to be assigned. |
Definition at line 1337 of file Matrix.hpp.
|
default |
Assigns 'other' matrix content to this matrix, moving the content.
| other | matrix to be assigned. |
| Matrix< D > & Bial::Matrix< D >::operator= | ( | const Matrix< D2 > & | other | ) |
Assigns 'other' matrix content to this matrix.
| other | matrix to be assigned. |
Definition at line 1370 of file Matrix.hpp.
| bool Bial::Matrix< D >::operator== | ( | const Matrix< D2 > & | other | ) | const |
The matrices are considered equal if they have the same dimensions and their elements have the same value.
| other | matrix to be compared. |
Definition at line 1405 of file Matrix.hpp.
| const D & Bial::Matrix< D >::operator[] | ( | size_t | p | ) | const |
Returns a constant reference of data pointed by index p. It has the same effect as operator data( p ).
| p | a global index to be acessed. |
Definition at line 1993 of file Matrix.hpp.
| D & Bial::Matrix< D >::operator[] | ( | size_t | p | ) |
Returns the reference for data pointed by index p. It has the same effect as operator data( p ).
| p | a global index to be acessed. |
Definition at line 1999 of file Matrix.hpp.
| size_t Bial::Matrix< D >::Position | ( | size_t | p_0, |
| size_t | p_1 | ||
| ) | const |
Returns the position corresponding to the input coordinates in this matrix.
| p_0 | dim 0 coordinate. |
| p_1 | dim 1 coordinate. |
Definition at line 2279 of file Matrix.hpp.
| size_t Bial::Matrix< D >::Position | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2 | ||
| ) | const |
Returns the position corresponding to the input coordinates in this matrix.
| p_0 | dim 0 coordinate. |
| p_1 | dim 1 coordinate. |
| p_2 | dim 2 coordinate. |
Definition at line 2284 of file Matrix.hpp.
| size_t Bial::Matrix< D >::Position | ( | size_t | p_0, |
| size_t | p_1, | ||
| size_t | p_2, | ||
| size_t | p_3 | ||
| ) | const |
Returns the position corresponding to the input coordinates in this matrix.
| p_0 | dim 0 coordinate. |
| p_1 | dim 1 coordinate. |
| p_2 | dim 2 coordinate. |
| p_3 | dim 3 coordinate. |
Definition at line 2289 of file Matrix.hpp.
| size_t Bial::Matrix< D >::Position | ( | const Vector< size_t > & | coordinates | ) | const |
Returns the position corresponding to the input coordinates in this matrix.
| coordinates | element coordinates. |
Definition at line 2294 of file Matrix.hpp.
| size_t Bial::Matrix< D >::Position | ( | const Vector< int > & | coordinates | ) | const |
Returns the position corresponding to the input coordinates in this matrix.
| coordinates | element coordinates. |
Definition at line 2306 of file Matrix.hpp.
| size_t Bial::Matrix< D >::Position | ( | const Vector< float > & | coordinates | ) | const |
Returns the position corresponding to the input coordinates in this matrix.
| coordinates | element coordinates. |
Definition at line 2318 of file Matrix.hpp.
Prints matrix containts to output stream os.
| os | an output stream. |
Definition at line 2619 of file Matrix.hpp.
Prints matrix dimensions to output stream os.
| none. |
Definition at line 2679 of file Matrix.hpp.
|
noexcept |
|
noexcept |
|
noexcept |
|
noexcept |
| bool Bial::Matrix< D >::SameDimensions | ( | const Matrix< D2 > & | src | ) | const |
Compares the dimensions of src matrix to the dimensions of 'this' matrix.
| src | Matrix to compare to. |
Definition at line 2727 of file Matrix.hpp.
| bool Bial::Matrix< D >::SameDimensions | ( | const Adjacency & | adj | ) | const |
Compares the dimensions of adj adjacency relation to the dimensions of 'this' matrix.
| adj | Adjacency relation to compare to. |
Definition at line 2735 of file Matrix.hpp.
| void Bial::Matrix< D >::Set | ( | D | val | ) |
Sets val to each element of the matrix.
| val | value to be set to the entire matrix. |
Definition at line 2330 of file Matrix.hpp.
| void Bial::Matrix< D >::SetRange | ( | D | min, |
| D | max | ||
| ) |
Recalculate the amplitude scale of the matrix by the following formula: mat[ pxl ] = min + ( mat[ pxl ] - mat_min ) * ( max - min ) / ( mat_max - mat_min )
| min | minimum value of the new amplitude scale |
| max | maximum value of the new amplitude scale |
Definition at line 2562 of file Matrix.hpp.
| size_t Bial::Matrix< D >::Size | ( | ) | const |
Returns size of data Vector.
| none. |
Definition at line 2235 of file Matrix.hpp.
| size_t Bial::Matrix< D >::size | ( | ) | const |
Returns size of data Vector. Same as Size( ), just for compatibility with std containers.
| none. |
Definition at line 2230 of file Matrix.hpp.
| size_t Bial::Matrix< D >::Size | ( | size_t | dimension | ) | const |
Returns matrix required dimension.
| i | The required dimension. |
Definition at line 2371 of file Matrix.hpp.
| size_t Bial::Matrix< D >::size | ( | size_t | dimension | ) | const |
Returns matrix required dimension. Just for symmetry with size( ) and Size( ) functions.
| dimension | The required dimension. |
Definition at line 2376 of file Matrix.hpp.
| bool Bial::Matrix< D >::ValidElement | ( | const Vector< size_t > & | p | ) | const |
Verifies if element is in matrix domain.
| p | Vector of indexes to be acessed. |
Definition at line 2552 of file Matrix.hpp.
|
friend |
Definition at line 36 of file Matrix.hpp.
Definition at line 41 of file Matrix.hpp.
|
friend |
Definition at line 37 of file Matrix.hpp.
Definition at line 39 of file Matrix.hpp.
|
protected |
data vector
Definition at line 46 of file Matrix.hpp.
|
protected |
data size
Definition at line 50 of file Matrix.hpp.
|
protected |
accumulated size of matrix dimensions.
Definition at line 56 of file Matrix.hpp.
|
protected |
size of matrix dimensions.
Definition at line 54 of file Matrix.hpp.
|
protected |
number of matrix dimensions
Definition at line 52 of file Matrix.hpp.
|
protected |
Quick access reference for data.
Definition at line 48 of file Matrix.hpp.


Cloud Functions for Firebase with Stripe Payments
Loading …
Sign out
Payment Methods
Add new
Use any of the
Stripe test cards
for this demo!
Cardholder name
Save Card
Card:
Amount:
Currency:
USD
EUR
GBP
JPY
Charge selected card
Payments


I am 21 years and I live in Memphis, Tennessee where I am currently attending
CodeCrew Code School. Since the start of my program I have
been participating in various code events such as Game Jams, family code days, and Code-Op networking events
giving me opportunities to build
my experience. It is such a joy for me to work with all of these awesome teams of incredible people, and a
true honor to be able
to learn so much from them. I got the chance to create apps, video games, even teach code, and my love for
development is only growing more
everyday. The closer I get to my graduation in June, the more hungry I am for opportunity to contribute to
this ever growing tech field.
I am looking for an entry-level position at a company that will value my love for teamwork and attention to
detail along with my fresh knowledge
of coding. If you also happen to be looking for a new developer eager to contribute please feel free to
explore this site further for more details
and contact information.
Skills
HTML
|
CSS
|
JavaScript
|
Python
|
Frontend Development
|
Linux/Windows
|
Creative Writing
|
Graphic Design
Education
Highschool- Tennessee Online Public School Graduated 2016
Secondary- CodeCrew Code school Graduate June 21 2019


Home
|
Galleries
|
Statistics
Video Gallery
Anonamous User
Funny Cat
05/01/2021
Dancing Cat
04/22/2021


{% extends "../base.html" %} {% block content_block %}
We need your details to process your request.
You can tell us if you do not want to be contacted.
Do you want us to contact you?


Canadian Entertainment Portal Picks World's Most Attractive Female MMA Fighter
Ripped bodies, discipline, a winner mentality and outstanding fighting skills – these mixed martial artists have it all. It's almost as exciting to scroll through their social media accounts and photo-shoots as it is to watch them facing their rivals in the octagon.
Jinh Yu Frey has been named the most attractive MMA fighter by Canadian entertainment platform Thethings.com. The 34-year-old athlete, who shot to fame at an Invicta FC promotion, has 8 victories and four defeats behind her back. Apart from keeping up her fantastic shape to fight rivals in the ring, she has continued her education, going to school for an MBA degree.
The first runner-up in the list of the strong and beautiful is Paige VanZant, who jumped into the octagon of the Ultimate Fighting Championship from the runway, as she used to model, dance and appear in commercials.
The second runner-up is Michelle Waterson, nicknamed "The Karate Hottie".
American Brooke Mayo, who stopped one step from the podium, switched to the ring from the soccer field, attending St. Mary’s College on a soccer scholarship.
Fighting was not the first choice for number five on this list, 27-year-old Kaytlin Neil from the Legacy Fighting Alliance, who used to be a cheerleader before turning to MMA.
The list would not be full without the notorious MMA star Ronda Rousey, currently number 17 on the list. The 31-year-old athlete earned the reputation of being the most dangerous woman in the MMA, with a 12-2 record. She ditched UFC for WWE in January and later became the first woman to make it to the UFC Hall of Fame. Reports have suggested that she will not remain long in the WWE.


Legacy applications may require file protocol access to NooBaa storage.
In such case, commercial products like SME or Avere are valid solutions.
Another valid option is the open source s3fs-fuse.
File System in Userspace (FUSE), is a software interface for Linux systems, which allows users to create their own file system structure in user space while letting the FUSE module to handle communication with the Kernel.
By combining NooBaa with S3FS-FUSE, Unix-based systems are able to access S3 buckets via a local filesystem path (e.g. /mnt/noobaa/demo-bucket) using common system calls, allowing FUSE to address the translation.
Installation
1. Follow the installation in this link https://github.com/s3fs-fuse/s3fs-fuse#installation
2. If a binary is not available, the following instructions will quickly build it for you https://github.com/s3fs-fuse/s3fs-fuse#compilation
Mounting NooBaa Buckets using S3FS-FUSE
1. Create S3FS-FUSE’s password file. Use NooBaa's Access and Secret key from connecting appliaction. Run the commands:
echo <AccessKey>:<SecretKey> > /etc/fuse.noobaa.credentials
chmod 600 /etc/fuse.noobaa.credentials
2. Create the mount point by running the following comands, replace <noobaa_endpoint> with your actual endpoint:
mkdir /mnt/noobaa/files_bucket
Mount the bucket to the mount-point
/usr/local/bin/s3fs first.bucket /mnt/noobaa/files_bucket -o passwd_file=/etc/fuse.noobaa.credentials -o use_path_request_style -o url=http://<noobaa_endpoint>/ -o sigv2 -o parallel_count=8
Congratulations! You are now able to access first.bucket at /mnt/noobaa/files_bucket


SETTINGS
brightness
0
contrast
0
saturation
0
vibrance
0
exposure
0
hue
0
sepia
0
gamma
0
noise
0
clip
0
sharpen
0
stackBlur
0


Module: Utils::Service
- Defined in:
- utils/service.rb
Overview
Helpers for brew services
related code.
Class Method Summary collapse
-
.installed?(formula) ⇒ Boolean
Check if a service file is installed in the expected location.
-
.launchctl ⇒ Pathname?
Path to launchctl binary.
-
.launchctl? ⇒ Boolean
-
.running?(formula) ⇒ Boolean
Check if a service is running for a specified formula.
-
.systemctl ⇒ Pathname?
Path to systemctl binary.
-
.systemctl? ⇒ Boolean
Class Method Details
.installed?(formula) ⇒ Boolean
Check if a service file is installed in the expected location.
19 20 21 22 |
# File 'utils/service.rb', line 19 def self.installed?(formula) (launchctl? && formula.launchd_service_path.exist?) || (systemctl? && formula.systemd_service_path.exist?) end |
.launchctl ⇒ Pathname?
Path to launchctl binary.
26 27 28 29 30 |
# File 'utils/service.rb', line 26 def self.launchctl return @launchctl if defined? @launchctl @launchctl = which("launchctl") end |
.launchctl? ⇒ Boolean
41 42 43 |
# File 'utils/service.rb', line 41 def self.launchctl? !launchctl.nil? end |
.running?(formula) ⇒ Boolean
Check if a service is running for a specified formula.
9 10 11 12 13 14 15 |
# File 'utils/service.rb', line 9 def self.running?(formula) if launchctl? quiet_system(launchctl, "list", formula.plist_name) elsif systemctl? quiet_system(systemctl, "is-active", "--quiet", formula.service_name) end end |
.systemctl ⇒ Pathname?
Path to systemctl binary.
34 35 36 37 38 |
# File 'utils/service.rb', line 34 def self.systemctl return @systemctl if defined? @systemctl @systemctl = which("systemctl") end |
.systemctl? ⇒ Boolean
46 47 48 |
# File 'utils/service.rb', line 46 def self.systemctl? !systemctl.nil? end |


Manager Main Menu
Options
View All Reimbursement Requests
Update Reimbursement Status
Filter Requests By Status
Logout


--- layout: page title: "About" description: "A little self-introduction" header-img: "img/about-bg.jpg" ---
I am passionate with artificial intelligence and neural network. Hoping to make contributions to the humankinds.


Openstack
Edit (pull request)The open source cloudify 4 orchestrator plugin allows you to deploy applications on openstack.
Configuration
The configuration of the location is done while configuring the orchestrator, before or after activation.
if you didn’t patched the iaas credentials described here. You must set some of the locations properties.
In addition to the base configuration that are DSL and imports you’ll need to provide some informations such as:
- management network: The name of the network to which the manager is linked to.
- security group name: The default security group name to add to the agent’s machines.
- agentConfig/agent key path: The path to the agent ssh key.
- openstackConfig: Properties to connect to Openstack’s API.
Note that you must store your openstack password inside Cloudify’s vault. To do so, you can connect to the Cloudify’s webui or use the cloudify cli.
For instance:
cfy secrets create -s myvalue mykey
The property password secret key
in Alien4Cloud’s openstack location configuration must contain the key name of the Cloudify’s vault.
For more details about cloudify’s secret
You also need to add the iaas-property-modifier at post-node-match phase.
Tosca mapped / location exposed types
The Openstack location exposes some types to help you configure a deployment and map the native Tosca types. Theses nodes are exposed as on demand resources
on the location management view.
Compute
The tosca type tosca.nodes.Compute
is mapped to the openstack nodes:
alien.nodes.openstack.Compute
for a linux compute,alien.nodes.openstack.WindowsCompute
for a windows compute.
To help you generate those, configuration resources alien.nodes.openstack.Image
and alien.nodes.openstack.Flavor
can be created, and then used to auto generate Computes nodes.
Network
The tosca type tosca.nodes.Network
can be mapped as two types of network:
Public Network
Exposed as the location type a public network alien.nodes.openstack.PublicNetwork
, which will result to the attribution of a floating ip to the linked resource (compute).
Make sure to fill in the required property floatingip
, by providing the name of an existing network name on which the linked resources will be connected.
Private Network
The tosca type tosca.nodes.Network
can also be mapped as a private network using a location node of type alien.nodes.openstack.PrivateNetwork
.
Volumes
The tosca type tosca.nodes.BlockStorage
can be mapped as two types of volumes:
Deletable volumes
Exposed as the location type alien.cloudify.openstack.nodes.DeletableVolume
, this is a volume that will ALWAYS be DELETED when undeploying the application, leading therefore to the lost of all data stored on it.
Reusable volumes
Exposed as the location type alien.cloudify.openstack.nodes.Volume
, this is a volume that will not be deleted at the end of the application life-cycle. It can therefore, between two deployment of the same application on the same environment and location, be re-used and attached to a compute, rending accessible the data previously stored on it.
Scaling
Scaling is now fully supported. Means we can scale a single Compute
, or a Compute + Storage + IP-Address
association.
Availability zone
You can add a alien.cloudify.openstack.nodes.AvailabilityZone
with the value of your availability zone on OpenStack. To use the non affitinity placement policy, at least two zones are necessery. After that, you can add your node (on the topology view) to the a same group, Alien will try to put this server on different zones during the deployment. When you redeploy an application with volume, Alien try to put all volumes attached to a server on the same zone, and, if a volume has already a zone, on the zone of this volume. The algorithm of placement policy equitably distributed the server on eatch zones.


|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |
| Packages that use DisplaySurface | |
|---|---|
| uchicago.src.sim.engine | |
| uchicago.src.sim.gui |
| Uses of DisplaySurface in uchicago.src.sim.engine |
|---|
| Methods in uchicago.src.sim.engine with parameters of type DisplaySurface | |
|---|---|
void |
SimModelImpl.registerDisplaySurface(java.lang.String name,
DisplaySurface surface)
Registers a DisplaySurface with this model and associates it with a particular name. |
| Uses of DisplaySurface in uchicago.src.sim.gui |
|---|
| Fields in uchicago.src.sim.gui declared as DisplaySurface | |
|---|---|
protected DisplaySurface |
LayoutWithDisplay.display
|
protected DisplaySurface |
Painter.surface
|
| Methods in uchicago.src.sim.gui with parameters of type DisplaySurface | |
|---|---|
void |
Painter.init(DisplaySurface s,
int w,
int h)
Associates this Painter with the specified DisplaySurface and initializes the width and height. |
void |
LayoutWithDisplay.setDisplay(DisplaySurface surface)
Setting the display surface (or passing it with the constructor) allows the graph layout to update the display to show the algorithm's convergence within the current tick. |
void |
SimGraphics.setDisplaySurface(DisplaySurface surface)
Sets the display surface associated with this SimGraphics instance. |
| Constructors in uchicago.src.sim.gui with parameters of type DisplaySurface | |
|---|---|
DummyPainter(DisplaySurface surface)
Creates a DummyPainter |
|
FruchGraphLayout(java.util.List nodes,
int width,
int height,
DisplaySurface surface,
int updateEveryN)
Constructs new FruchGraphLayout. |
|
KamadaGraphLayout(java.util.List nodes,
int width,
int height,
DisplaySurface surface,
int updateEveryN)
If the KamadaGraphLayout is passed a display, and a value for updateEveryN, it will call the display's updateDisplay() method on every Nth pass during the layout to provide visual feedback. |
|
LayoutWithDisplay(java.util.List nodes,
int width,
int height,
DisplaySurface surface)
Constructs new LayoutWithDisplay. |
|
LocalPainter(DisplaySurface s,
int w,
int h)
Creates a LocalPainter using the specified displaySurface, and with the specified width and height. |
|
Painter(DisplaySurface s,
int w,
int h)
Creates a Painter using the specified displaySurface, and with the specified width and height. |
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |


This function allows to add new recived spares to the inventory list.
This functions provides a the total spares and owned by the users.
This function allows to manage the users tho who uses the spares.
View the codebase and allows to extend the functions.
Created by Arun


Preet Jassi /<EMAIL_ADDRESS>You can view the code on github https://github.com/erudianart/ealunchandlearns/angular
Angular is a JavaScript framework that is designed to ease the creation of highly dynamic websites.
<input type="text" id="input" value="" name="name">

Hello

plnkr
<input type="text" ng-model="name" >

Hello {{name}}

plnkr
Angular JS is much more than just a framework that provides some DOM niceties, it is a framework that helps to construct rich web applications.
A controller allows you to manipulate the state and data associated with the view without having any of the overhead of DOM manipulation.
// you need at least a reference to your application
// or the module in your applicaiton that you are working on
angular.module('ea')
// to add a controller you then use the .controller method
// the .controller method takes the controller name as the first
// parameter, and then the callback, or the function that defines
// the controller as the second
.controller('ControllerNameCtrl', function($scope) {
// we are not going to go into detail about dependency injection
// here, or scope, we will get into that later
});
Todo list plnkr
$scope's inherit from one another, using prototypical inheritence!
Directives allow for code reuse in a very convienient way.
angular.module('ea')
// to add a directive you then use the .directive method
// the .directive method takes the directive name as the first
// parameter, and then a function that returns the directive definition
// Directive names are normalized
.directive('ToDoList', function() {
return {
restrict: 'AEC',
scope: {},
controller: 'ToDoListCtrl',
link: function(scope, elem, attrs) {},
template: 'hello'
};
});
lets angular know how this directive can be used
You can choose to have the inherit values from its parent, or have an isolated scope.
scope: {
// this binds the value of the attribute
// text binding to the scope variable textBinding
textBinding: '@textbinding',
// this binds the variable referenced by
// the attribute oneway to the scope variable
// oneWay, but, as the name says, it only goes
// one way
oneWay: '&oneway',
// like oneWay, this binds the variable referenced
// by the attribute twoway to twoWay, but there is
// two way data binding
twoWay: '=twoway'
}
A link function gets executed after the element has been compiled. Notice that you get a reference to a scope, the element, and the attributes.
Lets look at the plnk again
Transclusion is the ability to nest directives to create a heirarchy of components.
When you transclude directives, a transcluded scope is created. This scope inherits from its parent, and applies to the transcluded elements of the directive.
However, if the directive has an isolated scope, then the directive itself will have an isolated scope, but not its transcluded children (they have the transcluded scope)


Nexta App Store
The exclusive online platform for the techno enthusiast across the globe in a single portal open for all with love by Nexta!
A Nexta Group Of CompaniesThe exclusive online platform for the techno enthusiast across the globe in a single portal open for all with love by Nexta!
A Nexta Group Of CompaniesThis is a exclusive store for the Android users across the globe
One of excellent Android OCR App . This app allows you to to recognize texts,letter & sentences with the help of AI.
An android app helps you recognize your emotions with the help of AI.
An android app which help you detect your face with help of AI.


What is Sputnik?
Sputnik is a JavaScript conformance test suite containing over 5000
tests. It tests how well a JavaScript implementation adheres to
the ECMA-262
specification version 5, looking only at those features
that were also present in the previous version, version 3, and not the new
features added in version 5.
What is this site?
This site allows you to run the sputnik tests and to compare the
most popular browsers' test results.
Run
On the run page you can run the full test
suite in your browser and browse the failing tests. Note that
running the tests is a fairly strenuous exercise for a browser
and will cause some browsers, particularly older ones, to
crash or stall. If this happens you can close and reopen your
browser and continue running where you left off.
Compare
The compare page shows an experimental plot
illustrating how popular browsers perform compared to each
other. The distance to the center shows how close the browser is to
passing all tests; the further the browser is from the center the
more tests it fails. The distance between browsers shows how
different they are; the more similar two browsers are – the
more test failures they have in common – the closer they will
be.
Version {{test_suite_version}}?
This is version {{test_suite_version}} of the Sputnik tests. We
will be making revisions from time to time as we add more tests or
fix bugs. Note that test results are not compatible unless both
results are run with the same revision of the test suite.
Version 2 fixes a bug that caused later versions of Internet
Explorer to emulate version 7.


Introducing Pome
December 31, 2015
I'm excited to announce that I just released the first version of Pome (version 0.1.0). Pome stands for PostgreSQL Metrics. Pome is a PostgreSQL Metrics Dashboard to keep track of the health of your database.
PostgreSQL is incredibly stable, especially with small databases. There are a lot PostgreSQL databases in the wild without a DBA to take care of them. In some cases, this could mean things are slowly getting worse. Luckily, a lot of things can be analyzed within postgres to get a health status, but it seemed to miss simple tool to run, which takes no time to install or without dependencies.
Goals
This project follows 3 principles: Simplicity, Opinionated, Batteries included.
Simplicity, the project aims to be easy to deploy and run. This is why Pome can run as a binary. The project also aimed to feel like the psql
command and use common arguments.
Opinionated, Pome has the goal to be pre-configured and analyse commonly useful metrics. We want the project to have sensible defaults. In the future, the tool will allow some level of configuration but without compromising Simplicity.
Batteries Included, Pome is built to be accessed via a web interface. The web app is shipped within the binary and Pome takes care of serving the assets (HTML, js, CSS). Pome is not built to be a public facing tool so performance into delivering assets was not a concern. It should be possible to run the frontend individually if it is of concern to you. Pome tries to not to rely on any dependency which cannot be shipped with the binary, and this is one of the reasons why Pome is stateless right now.
Motivations
Aside from the goals described above I wanted to start this project for few personal reasons:
- PostgreSQL needs better and easier tooling. People may disagree but tooling is an important part of the success of any technology. Looking around I didn't find a tool sharing the same goals. A tool doesn't need to be perfect to start being useful but they need to be easy and enjoyable to use.
- Learning more about Go. I went with Go because it was suited to ship the tool as a binary. This project gave me a chance to dabble in Go for the first time and have a project to keep improving using this language.
- Improving my experience using React. I used React a while ago but I always mainly work in the backend world. I wanted a project to bring me up to date on the topic.
- Experimenting with D3. I had a few others project for which I was planning to use D3, so it felt best that I iron my skills out on a smaller project first.
License
Pome is licensed under Apache V2 license, the full license text can be found here
What's next
There are a few features that I would like to add to make Pome more useful:
- Allow to configure when the metrics are collected
- Add few others metrics
One of the big things that I will start to work on soon is a new UI mock up, to ensure that tool stay user friendly. You can read more about the future of Pome in the README or within the opened Issues.
This project is at a very early stage, and there are a lot of missing features, but I'm using PostgreSQL a lot so I should be able to keep improving the project based on my own need at the start. I'm also hoping that few people will get excited about having a project with these goals, will try it and/or start contributing.


Hand-Crafted Styles
Aloha Apparel Co. sells the finest ready-to-travel clothing. Browse our current selection of products or sign up for updates below.
mens
trends
glasses
sale
bags
womens
Most-Loved Products
Dresses
Stretch Knit Dress
$169.00
Shirts
Cotton Blue Shirt
$89.00
Dresses
Checked Stretch Dress
$129.00
Bags
Blue Hipster Backpack
$69.00
Dresses
Blue Silk Dress
$99.00
Shirts
Cotton Yellow T-shirt
$29.00
Trends
Denim Overall Shorts
$79.00
Dresses
Pink Dotted Dress
$79.00
Sign Up for Updates
Stay updated on our latest product releases, be first to find out about upcoming sales, and get free style tips from our blog. Unsubscribe at any time.


BECS Direct Debit
Note: BECS Direct Debit requires a Stripe account with an aud
bank account.
Test account details
BSB:000-000
Account: 000123456
Note: BECS Direct Debit requires a Stripe account with an aud
bank account.
000-000
Account: 000123456


{# Import the theme's layout. #} {% extends "!layout.html" %} {# Include our new CSS file into existing ones. #} {% set css_files = css_files + ['_static/my-styles.css']%} {# Add some extra stuff before and use existing with 'super()' call. #} {% block content %}


June 3, 2019
Haunted House (EP)
AUGUST 18 & 19, 2018
Hot 100
Music Festival
NORTHWELL HEALTH AT JONES BEACH THEATER LONG ISLAND, NY
Powered by
The Party
Peaked at #54
on 11.22.2019
May 03
Full Moon Melbourne
May 2019
$18.41 – $29.96
APR 24
AVENUE:
R-Rated Party
R-Rated Themed Party with Melbourne's hottest RNB DJ's at LUX Nightclub. RNB, Hip Hop, Latin sounds in the heart of Chapel Street


List the MA : curl http://perfsonar-smallnodes.geant.org/esmond/perfsonar/archive/ Find a measurement of interest and select a base-uri for event-type packet-trace "base-uri" : "/esmond/perfsonar/archive/003972f9432a4a4a827ef83778600541/packet-trace/base", "event-type" : "packet-trace" use in uri above


TreeView¶
Description¶
A hierarchical list whose items can contain child items.
The?ListItem?children of this control (in the?items?array) can be of type node, which means that they can contain child items. An item with child items can expanded, so that the child items are displayed, or collapsed, so that the child items are hidden Individual items can be selected at any level of the tree.
Properties¶
| active readonly | True if this element is active. |
| alignment readonly | The alignment style for this element. If defined, this value overrides the alignChildren setting for the parent container. |
| bounds readonly | The boundaries of the element, in parent-relative coordinates. |
| children readonly | An array of child elements. |
| enabled readonly | True if this element is enabled. |
| graphics readonly | The graphics object that can be used to customize the element’s appearance, in response to the?onDraw()?event. |
| helpTip readonly | The help text that is displayed when the mouse hovers over the element. |
| indent readonly | The number of pixels to indent the element during automatic layout. |
| itemSize readonly | The width and height in pixels of each item in the list. |
| items readonly | The array of top-level items displayed in the list. |
| location readonly | The upper left corner of this element relative to its parent. |
| maximumSize readonly | The maximum height and width to which the element can be resized. |
| minimumSize readonly | The minimum height and width to which the element can be resized. |
| parent readonly | The parent element. |
| preferredSize readonly | The preferred size, used by layout managers to determine the best size for each element. |
| properties readonly | An object that contains one or more creation properties of the control (properties used only when the element is created). |
| selection readonly | The currently selected list item. |
| shortcutKey readonly | The key sequence that invokes the?onShortcutKey()?callback for this element (in Windows only). |
| size readonly | The current dimensions of this element. |
| type readonly | The element type, “treeview”. |
| visible readonly | True if this element is shown, false if it is hidden. |
| window readonly | The window that this element belongs to. |
| windowBounds readonly | The bounds of this element relative to the top-level parent window. |
Methods¶
| add readonly | Adds an item to the top-level choices in this list. |
| addEventListener readonly | Registers an event handler for a particular type of event occuring in this element. |
| dispatchEvent readonly | Simulates the occurrence of an event in this target. |
| find readonly | Retrieves an item object from the list that has a given text label. |
| hide readonly | Hides this element. |
| notify readonly | Sends a notification message, simulating the specified user interaction event. |
| remove readonly | Removes a child item from the list. |
| removeAll readonly | Removes all child items from the list. |
| removeEventListener readonly | Unregisters an event handler for a particular type of event occuring in this element. |
| show readonly | Shows this element. |
Events¶
| onActivate readonly | An event-handler callback function, called when the element acquires the keyboard focus. |
| onChange readonly | An event-handler callback function, called when the content of the element has been changed |
| onCollapse readonly | An event-handler callback function, called when the user collapses (closes) an expanded node in the treeview. |
| onDeactivate readonly | An event-handler callback function, called when the element loses the keyboard focus. |
| onDraw readonly | An event-handler callback function, called when the window is about to be drawn. |
| onExpand readonly | An event-handler callback function, called when the user expands (opens) a collapsed node in the treeview. |
| onShortcutKey readonly | An event-handler callback function, called when the element’s?shortcutKey?sequence is typed in the active window. |


OpenGL Fonts provided with the GLUT library. More...
#include <CFont.h>
Public Member Functions | |
| cGLUTBitmapFont () | |
| Constructor of cGLUTBitmapFont. | |
| virtual | ~cGLUTBitmapFont () |
| Destructor of cGLUTBitmapFont. | |
| virtual int | getCharacterWidth (const unsigned char &a_char) |
| Get the width of a particular character. | |
| virtual int | renderString (const char *a_str) |
Protected Member Functions | |
| int | getBestFontMatch () |
| Return the index of the current Font in the table of font names. |
OpenGL Fonts provided with the GLUT library.
| int cGLUTBitmapFont::getBestFontMatch | ( | ) | [protected] |
Return the index of the current Font in the table of font names.
Return the index of the current font in the table of font name.
| int cGLUTBitmapFont::getCharacterWidth | ( | const unsigned char & | a_char | ) | [virtual] |
Get the width of a particular character.
Get the width of a particular character.
| a_char | The character (e.g. 'a') to look up. Characters less than 32 ('A') will generate errors. |
Reimplemented from cFont.
| int cGLUTBitmapFont::renderString | ( | const char * | a_str | ) | [virtual] |
Renders a string, should not contain any newlines.
Returns 0 for success, -1 for error.
Renders an actual string of text, initializing the font if necessary.
| a_str | The string to render; should not include newlines |
Implements cFont.


Conference Call example
This example show how to set up manual video switching in a Conference using ConferenceSwitcher.Click one of the videos below to make that user the "active speaker".
Click one of the videos below to make that user the "active speaker".


| 1 | /* | |
| 2 | * Copyright 2010 Mozilla Foundation | |
| 3 | * | |
| 4 | * Licensed to the Apache Software Foundation (ASF) under one | |
| 5 | * or more contributor license agreements. See the NOTICE file | |
| 6 | * distributed with this work for additional information | |
| 7 | * regarding copyright ownership. The ASF licenses this file | |
| 8 | * to you under the Apache License, Version 2.0 (the | |
| 9 | * "License"); you may not use this file except in compliance | |
| 10 | * with the License. You may obtain a copy of the License at | |
| 11 | * | |
| 12 | * http://www.apache.org/licenses/LICENSE-2.0 | |
| 13 | * | |
| 14 | * Unless required by applicable law or agreed to in writing, software | |
| 15 | * distributed under the License is distributed on an "AS IS" BASIS, | |
| 16 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| 17 | * See the License for the specific language governing permissions and | |
| 18 | * limitations under the License. | |
| 19 | */ | |
| 20 | ||
| 21 | package com.mozilla.pig.eval.date; | |
| 22 | ||
| 23 | import java.io.IOException; | |
| 24 | import java.text.ParseException; | |
| 25 | import java.text.SimpleDateFormat; | |
| 26 | import java.util.Date; | |
| 27 | ||
| 28 | import org.apache.pig.EvalFunc; | |
| 29 | import org.apache.pig.data.Tuple; | |
| 30 | ||
| 31 | public class ParseDate extends EvalFunc<Long> { | |
| 32 | ||
| 33 | public static enum ERRORS { DateParseError }; | |
| 34 | | |
| 35 | private SimpleDateFormat sdf; | |
| 36 | | |
| 37 | public ParseDate(String dateFormat) { | |
| 38 | sdf = new SimpleDateFormat(dateFormat); | |
| 39 | } | |
| 40 | | |
| 41 | @Override | |
| 42 | public Long exec(Tuple input) throws IOException { | |
| 43 |
2
1. exec : negated conditional → KILLED 2. exec : negated conditional → KILLED |
if (input == null || input.size() == 0) { |
| 44 |
1
1. exec : mutated return of Object value for com/mozilla/pig/eval/date/ParseDate::exec to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return null; |
| 45 | } | |
| 46 | | |
| 47 | Long t = null; | |
| 48 | try { | |
| 49 | Date d = sdf.parse((String)input.get(0)); | |
| 50 | t = d.getTime(); | |
| 51 | } catch (ParseException e) { | |
| 52 |
1
1. exec : removed call to org/apache/pig/backend/hadoop/executionengine/physicalLayer/PigLogger::warn → NO_COVERAGE |
pigLogger.warn(this, "Date parsing error", ERRORS.DateParseError); |
| 53 | } | |
| 54 | | |
| 55 |
1
1. exec : mutated return of Object value for com/mozilla/pig/eval/date/ParseDate::exec to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return t; |
| 56 | } | |
| 57 | | |
| 58 | } | |
Mutations | ||
| 43 |
1.1 2.2 |
|
| 44 |
1.1 |
|
| 52 |
1.1 |
|
| 55 |
1.1 |


Nigel Farage Gifts Election to Tories By Pulling Brexit Party Candidates Out of 317 Seats
Prime Minister Boris Johnson, who was chosen by Conservative Party members in July, is seeking a mandate from the people on 12 December. Now it seems the Brexit Party have given him a leg up.
The Brexit Party leader Nigel Farage announced on Monday, 11 November, he would not be fielding candidates in 317 seats where the Conservatives are the favourites to win.
Instead Farage will target Labour MPs especially in seats in Wales, the Midlands and the North of England.
Political analysts were quick to seize on the significance of the announcement, saying Farage had effectively gifted the election to the Conservatives.
The announcement is a big blow to Jeremy Corbyn and Labour but could also hit the Liberal Democrats’ chances of picking up seats from Tory MPs who faced losing votes to the Brexit Party.
Conservative Party chairman James Cleverly welcomed the move, saying the Brexit Party had recognised they risked creating another hung Parliament which would prevent a “stable majority government".
Labour Party chairman Ian Lavery said it now meant there was effectively a "Nigel Farage and Boris Johnson alliance with Donald Trump to sell out our country."
Mr Lavery said: "We urge voters to reject this Thatcherite 1980s tribute act, which would lead to more savage Tory attacks on working class communities. Our NHS is not for sale.”
Last month Farage had urged Johnson to agree an electoral pact but the prime minister refused to do so.
There has been no word about whether the Tories and the Brexit Party have made a formal pact.
Farage had initially promised to field 600 candidates but he claimed his reason for changing his position was because Boris Johnson had committed to signing a trade deal with the EU which would be without "regulatory alignment" and would be similar to the deal Canada has with Brussels.
Farage said this was a "huge change" in the Conservatives' approach to Brexit.


Installation
Install gfortran compilar
pymoog
use gfortran, a free Fortran compiler as a part of GCC.
Although it is possible to use other Fortran compiler to compile MOOG, using gfortran is (to my experience) the mose easy one and thus pymoog requires gcc to be installed before installation.
First, we check whether gfortran is installed in your computer.
Type gfortran
in the terminal; if you get:
gfortran: fatal error: no input files
compilation terminated.
then gfortran is already installed and please go to next section.
If you get:
command not found: gfortran
then you need to install gfortran:
Linux:
sudo apt install gcc
Windows: please use Windows Subsystem for Linux and follow the instruction for Linux.
Mac: please refer to this post; the main point is using
brew
to install (brew install gcc
). I have no experience on using Mac so, finger crossed.
Install pymoog
Using pypi (recommended)
pip install pymoog
From github
clone
this repository andcd
into the corresponding folder;pip install .
Note that pymoog
requires some large files (atmosphere models and line lists, stored in here) to run , and they will be downloaded during pip install
.
Thus the installation may takes 10 or 20 minutes without anything prompting in the command line.
When upgrading pymoog
, the program check if there is any newer version of the large files.
If the local files are up-to-date, then the download will be skipped to speed up the installation process.
Uninstall pymoog
Uninstall in pip:
pip uninstall pymoog
.Remove all the files in pymoog running folder:
rm -r ~/.pymoog


Name
cmdkey — new in WS2003
Synopsis
Manages stored usernames and passwords.
Syntax
cmdkey /add:TargetName /user:UserName /pass:Password
cmdkey /add:TargetName /smartcard
cmdkey /generic:TargetName /user:UserName /pass:Password
cmdkey /delete{:TargetName | /ras}]
cmdkey /list[:TargetName]
Options
/add:TargetName /user:UserName /pass:Password
Adds the specified username and password for the specified computer or domain to the stored credentials list
/add:TargetName /smartcard
Retrieves credentials from a smart card and adds them to the stored credentials list
/generic:TargetName /user:UserName /pass:Password
Adds the specified generic credentials (not associated with a specific computer or domain) to the stored credentials list
/delete{:TargetName | /ras}
Deletes the specified username and password or remote access entry from the stored credentials list
/list:TargetName
Lists the stored credentials for the specified computer or domain (if TargetName is omitted, all stored credentials are listed)
Examples
Add credentials for Bob Smith to the stored credentials list in the mtit.local domain:
cmdkey /add:mtit.local<EMAIL_ADDRESS>/pass:password
CMDKEY: Credential added successfully.


@() @views.html.base.master{ @services.base.HtmlUtils.misc().addHeadOnce{ }
You have not sign up your TOMTOP Affiliate, please sign up first!
If you do not have a TOMTOP account yet.
Click here to get one
If you have a TOMTOP account already.
Click here to go to the application form and sign up now!
After submitting your application form, a TOMTOP affiliate ID and URL will be given to you so you can start earning commission immediately. Commission collected will show up in your regular TOMTOP account.
3 Simple steps to start your affiliate program
Welcome to TOMTOP Affiliate Program page! TOMTOP has a ripe experience in Affiliate marketing. We have our own Affiliate Program System, and TOMTOP is available on ShareASale.com. We offer all the affiliates attractive tiered rates of commission. Besides, we constantly provide our affiliates with non-expiring exclusive coupon codes, most popular deals, coolest banners, regularly updated datafeed, etc.
It's completely free for you to join us and start the business! We will pay commission to you for every valid transaction via your business or non-business channels. 6%---10% commission per sale. Want to make money with TOMTOP? Join our affiliate program today!
| @Messages("level.tomtop") | @Messages("rate") | @Messages("to.reach.this.level.monthly.sales.amount") |
| @Messages("level") 1 | 6% | $0-$999 |
| @Messages("level") 2 | 7% | $1000-$4999 |
| @Messages("level") 3 | 8% | $5000-$9999 |
| @Messages("level") 4 | 10% | $10000-$19999 |
| @Messages("level") 5 | 12% | @Messages("more.than.20000") |


Preparation time
30 mins to 1 hour
Cooking time
less than 10 mins
Serves
Serves 4
Dietary
These beautiful filled pasta half moons can be made ahead and kept in the refrigerator for up to two days.
For the pasta, place the flour and eggs and egg yolks into a food processor and process for one minute until the dough comes together.
Cover in cling film and place in the fridge to rest for 30 minutes. When chilled, divide the dough in half and keep one portion for another meal.
Roll the remaining half of the dough through a pasta machine, gradually reducing the thickness, until the pasta is rolled as thin as possible. Dust with the semolina and set aside in the fridge until needed.
For the pansotti filling, beat the ricotta and chopped fennel together in a bowl and season to taste with salt and freshly ground black pepper.
Take the pasta from the fridge and lay out on the work surface. Working 2cm/1in from the edge of the longest side, place heaped teaspoons of the filling at intervals along the length of the pasta with a 3cm/1¼in gap between each one.
Brush between each portion of filling with a pastry brush dipped in water, then fold the unfilled half of the pasta sheet over to cover.
Using your two little fingers, push the pasta down round each portion of filling to seal. Make sure that there is no trapped air inside or the pasta will burst during cooking.
Using a round pastry cutter, cut around the filling to create half-moon shapes. Pick them up individually to make sure each one is airtight. They will keep in a fridge on a floured tray for up to two days, or you can cook them immediately.
For the walnut sauce, crush the garlic with a pinch of sea salt in a pestle and mortar, then add the walnuts. Pound until smooth, then mix in the lemon juice, parmesan, milk, olive oil and parsley.
Whisk until the sauce emulsifies, then season, to taste, with salt and freshly ground black pepper.
Cook the pansotti in a large pan of salted boiling water for 3-4mins. The water should be at a fast, rolling boil.
Meanwhile, melt the butter in a large frying pan. Drain the pasta, add to the frying pan and mix to coat in the butter.
Add a generous spoonful of the walnut sauce and stir the pasta to coat. Add a good grinding of black pepper and serve, with extra walnut sauce if desired.
You need JavaScript to view this clip.
Rolling pasta using a pasta machine


Write Access to RegexD Source
Here. I've had a bunch of requests for write access to the RegexD source. I provide read-only access to the RegexD source via a .zip file in the RegexD GotDotNet workspace. If you want write access, add your code to the snapshot of code in the workspace and send it to me for review. If it passes muster, I'll add you as a read/write member of the workspace.
This helps me to ensure that only good code makes it into RegexD. Thanks!


I'm just sitting there, staring at the pipe I just used, as the realization dawned on me that it was very special... and that it would bring me somewhere that has always existed. All of a sudden, about a half-minute after blowing out my hit, I realize that time (all of time) goes according to my heartbeat. It's the tick that keeps the world going on around me.
I slowly start to get unsynchronized with it... that 'tick' is slowly losing it's power to keep me in the moment, and I'm falling backwards through time. I'm not actually falling 'through' time, but I'm being left behind as time just went on without me. That's when I met the 'regulators.' My friends and I coined this term, because that's exactly what they seem to be. They are there to make sure that nothing like this happens, and that everything keeps progressing through time.
They were all confused... they didn't understand how I could be doing this. I shouldn't be there, outside of time, because I should naturally be able to keep with it by myself. I would say at this point that I could 'see' time ahead of me. All the 'ticks' of time that I should have already gone through was what I was looking at in front of me. Imagine what it would look like if the whole three-dimensional universe was compressed into a sheet.... then this 5th-dimensional place I now found myself in was made of layers of these as far back and forward as I could see.... stretched on to infinity.
I could see what was going to happen before it did... but I had no power to change it. I couldn't change it because I couldn't interact with just a thin 'slice' of space, I could only move around in these new three spatial dimensions. I only had a brief glimpse of this though, because right when I got there I realized that I wasn't alone. There was other beings there in that place... and it was their 'job' to physically push things that stopped moving through the 4th dimension into each of the slices. Think of a car that stalls, and you have to push it to jump-start it... I was that car that kept jumping forward, but never got moving on it's own. I lost the 'momentum' I had that kept me moving through.
So they kept pushing me... and like I said, I hadn't stopped moving for very long before they started pushing me. It took like four of them... because pushing someone through the 4th-D is an involved process, as they had to concentrate on all the directions of the dimensions below (the three spatial ones). They had to guide all my limbs, and even my thoughts for every 'tick' I traveled through. I'm sure that some of you are familiar with how it feels to have an OBE... well the pushes they were giving me felt just like that disorientating feeling of floating I get as I leave my body.
It's also strange, because when I was out of time, I could see the whole universe of three dimensions at once... just like we right now can see what is drawn on a piece of paper in it's entirety. This was strange, because the thoughts of people exist in time, so I could see them as well. I was with around four of my friends, and I could see that in the slices of time without me in it that they were very worried and scared for me. They were scared because I wasn't 'all there.'
I tried to speak... to reassure them that I was fine, that I was still 'somewhere,' but my voice didn't in itself penetrate the slices of time... so they didn't hear me. At this point, I had those beings that were pushing me, and I could perceive my friend's fear for me as well. I broke down... I thought, 'All is lost, they can't hear me, and I can't bear this perception of seeing all of their worry.' It was too intense... I'm pretty sure that anyone who could read a person's entire mind would feel this overwhelmed.
Well, their fear became my own... and I broke down crying in this other place. The beings there were trying to comfort me... to tell me it was all right, but they thought that I was just crying because I didn't know what was going on. The thing is... I knew what was happening because, since I've experienced this before, I remembered what it was like. Their comfort was intense... it's as if just by saying 'all is going to be fine' made it so, and I felt better.
I gradually began gaining momentum again and they had to push less and less... until I was finally almost back up to the speed of the 'ticks' of time. This state felt the most like when you are trying to OBE, and you get the sleep paralysis... I could move my body, but still felt disconnected from it. It was as if I was just a tiny bit away from being fully integrated into the current timeslice. This lasted for awhile... until I gained the perfect amount of momentum to sustain the right amount of time travel to become 'one' with the right moment.
When I came back though, I was still afraid that I hadn't been pushed back into the right one... and everyone had to assure me that they were all who I thought they were. The beings had put me back into the right place yet again.
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.


{% include "includes/demographic_metrics.html" with stat=stat state=state district=district district_name=district_name only %}
{% include "includes/academic_metrics.html" with stat=stat state=state district=district district_name=district_name %}
{% if campus.is_secondary_school or include_postsecondary %}
{% include "includes/postsecondary_readiness_metrics.html" with stat=stat state=state district=district district_name=district_name only %}
{% endif %}
{% include "includes/staff_metrics.html" with stat=stat state=state district=district district_name=district_name only %}


Bashed is an easy level machine based on Linux, the initial approach requires a basic enumeration to identify the webshell
application.
The privilege escalation process can be exploited in two ways: the first one exploits the kernel
and spawn to us a root shell and the second one can be exploited by escalating the privileges through two Linux accounts: from www-data
to scriptmanager
and from scriptmanager
to root
.
Recon
There’s a web application named phpbase
on port 80, the author describe it as a webshell
:
After the web enumeration using the gobuster tool, we got the following output:
Exploiting - Injecting system commands through phpbash’s webshell
The phpbash
program is located under /dev
web directory. We can execute system commands as www-data
user.
To get a reverse shell connection we send a Python stager containing our reverse shell:
Post Exploitation - Escalating privileges through a kernel exploit (1st method)
Doing a basic enumeration, we noticed that the server’s kernel version is vulnerable, this vulnerability has the CVE 2017-6074
.
Linux Kernel 4.4.0 (Ubuntu) - DCCP Double-Free Privilege Escalation
After compile the exploit locally, send it to the machine through Python SimpleHTTPServer and execute, we easily got a root shell!
! THIS EXPLOIT WILL CRASH THE SERVER !
Post Exploitation - Escalating privileges through multiple users (2nd method)
In this method, we need to escalate our privileges through multiple users. The www-data
is able to run any command as scriptmanager
:
It’s possible to spawn an elevated shell as scriptmanager
user with the following command:
Now we have elevated our privileges to scriptmanager
user, it’s time to escalate to root. There’s a directory named scripts
located at the root path.
Inside this directory we found two interesting files, test.py
and test.txt
, after a basic code review we noticed that the test.py
timestamp is updated every minute, probably from a cronjob being executed as root.
All we need to do is add a reverse shell stager to the test.py
script:
After that, we set up a netcat on listening mode and wait for a root shell!


Domestic tourism, foreign tourism, self-help tourism, self driving tourism, tanker visa, theme tourism and other hot tourism recommendations


"Thank you!" to the creators and contributors of these amazing libraries. Our projects are easier to maintain because of you! — Assemble Team
The JavaScript Task Runner
Assemble wouldn't exist without Grunt.js.
The advantage of building Assemble on top of Grunt, is that the Grunt ecosystem is already well established, popular, and includes hundreds if not thousands of plugins to choose from. So if you use Assemble for generating sites, components, or other templates-overview, you can use any other Grunt.js plugin to automate virtually any other part of your build with very little effort.
Not to mention, if there isn't already a plugin that does what you need, it's really easy to create and publish your own!
Handlebars provides the power necessary to let you build semantic templates effectively with no frustration.
Handlebars is the default template engine that ships with Assemble. In their own words:
Handlebars.js is an extension to the Mustache templating language created by Chris Wanstrath. Handlebars.js and Mustache are both logicless templating languages that keep the view and the code separated like we all know they should be.
More than 110 Handlebars helpers from handlebars-helpers are included by default, so they are all available for use anywhere in your templates-overview. Most of the helpers in handlebars-helpers can be used with any Handlebars project, but some of them were created specifically for use with Assemble.
Here are just a few examples:
{{filename "docs/toc.md"}}
would return: toc.md
.{{basename "docs/toc.md"}}
would return: toc
{{relative "file/a" "file/b"}}
. This can also be used with the page
and pages
variables.{{#markdown}}{{/markdown}}
{{md 'file/to/include.md'}}
{{embed 'path/to/file.js'}}
or {{embed 'path/to/file.hbs' 'html'}}
{{embed}}
but for GitHub Gists.Go to handlebars-helpers for a comprehensive list, or Helpers to learn about Assemble-specific helpers →
A low-level utility library delivering consistency, customization, performance, and extra features.
The Lo-Dash library, exposed by Grunt.js, offers a number of powerful object, array, function, and collections utility methods (and more). Visit the Grunt.js docs to learn more about using Lo-Dash templates with Grunt.js.
String manipulation extensions for Underscore.js javascript library.
Underscore.string offers dozens of really useful string utility methods. From the Grunt.js docs: "Note that Underscore.string is mixed into grunt.util. but is also available as grunt.util..str for methods that conflict with existing Lo-Dash methods." Please visit the Grunt.js documentation to learn more.
Here is a preview of the methods available from Underscore.string:
<%= _.capitalize(title) %>
<%= _.humanize(title) %>
<%= _.numberFormat(123456789.123, 5, '.', ',') %>
=> "123,456,789.12300"<%= _.clean(' foo bar ') %>
=> "foo bar"<%= _.unescapeHTML('
Blah blah blah
') %>
=> "
Blah blah blah\

"Visit Underscore.string to learn more →
A full-featured markdown parser and compiler, written in javascript. Built for speed.
Assemble uses Marked.js for processing markdown.
Marked Copyright (c) 2011-2013, Christopher Jeffrey. (MIT License). See Marked LICENSE and repo for more info.
JavaScript YAML parser and dumper. Very fast.
See the template for this page →
Find an error? Let us know →