This is the Array Operations Reference Manual.
| • Systems | The systems documentation | |
| • Files | The files documentation | |
| • Packages | The packages documentation | |
| • Definitions | The symbols documentation | |
| • Indexes | Concepts, functions, variables and data types |
The main system appears first, followed by any subsystem dependency.
Next: The array-operations/all system, Previous: Systems, Up: Systems [Contents][Index]
Ben Dudson <http://github.com/bendudson>
Tamas K. Papp<EMAIL_ADDRESS>MIT
Simple array operations library for Common Lisp.
array-operations.asd (file)
Next: The array-operations/reducing system, Previous: The array-operations system, Up: Systems [Contents][Index]
Ben Dudson <http://github.com/bendudson>
Tamas K. Papp<EMAIL_ADDRESS>MIT
array-operations.asd (file)
file-type.lisp (file)
Next: The array-operations/matrices system, Previous: The array-operations/all system, Up: Systems [Contents][Index]
Ben Dudson <http://github.com/bendudson>
Tamas K. Papp<EMAIL_ADDRESS>MIT
array-operations.asd (file)
file-type.lisp (file)
Next: The array-operations/creating system, Previous: The array-operations/reducing system, Up: Systems [Contents][Index]
Ben Dudson <http://github.com/bendudson>
Tamas K. Papp<EMAIL_ADDRESS>MIT
array-operations.asd (file)
file-type.lisp (file)
Next: The array-operations/indexing system, Previous: The array-operations/matrices system, Up: Systems [Contents][Index]
Ben Dudson <http://github.com/bendudson>
Tamas K. Papp<EMAIL_ADDRESS>MIT
array-operations.asd (file)
file-type.lisp (file)
Next: The array-operations/stacking system, Previous: The array-operations/creating system, Up: Systems [Contents][Index]
Ben Dudson <http://github.com/bendudson>
Tamas K. Papp<EMAIL_ADDRESS>MIT
array-operations.asd (file)
file-type.lisp (file)
Next: The array-operations/transforming system, Previous: The array-operations/indexing system, Up: Systems [Contents][Index]
Ben Dudson <http://github.com/bendudson>
Tamas K. Papp<EMAIL_ADDRESS>MIT
array-operations.asd (file)
file-type.lisp (file)
Next: The array-operations/displacing system, Previous: The array-operations/stacking system, Up: Systems [Contents][Index]
Ben Dudson <http://github.com/bendudson>
Tamas K. Papp<EMAIL_ADDRESS>MIT
array-operations.asd (file)
file-type.lisp (file)
Next: The array-operations/utilities system, Previous: The array-operations/transforming system, Up: Systems [Contents][Index]
Ben Dudson <http://github.com/bendudson>
Tamas K. Papp<EMAIL_ADDRESS>MIT
array-operations.asd (file)
file-type.lisp (file)
Next: The array-operations/generic system, Previous: The array-operations/displacing system, Up: Systems [Contents][Index]
Ben Dudson <http://github.com/bendudson>
Tamas K. Papp<EMAIL_ADDRESS>MIT
array-operations.asd (file)
file-type.lisp (file)
Previous: The array-operations/utilities system, Up: Systems [Contents][Index]
Ben Dudson <http://github.com/bendudson>
Tamas K. Papp<EMAIL_ADDRESS>MIT
let-plus
array-operations.asd (file)
file-type.lisp (file)
Files are sorted by type and then listed depth-first from the systems components trees.
| • Lisp files |
Next: The array-operations/all/file-type․lisp file, Previous: Lisp files, Up: Lisp files [Contents][Index]
Next: The array-operations/reducing/file-type․lisp file, Previous: The array-operations․asd file, Up: Lisp files [Contents][Index]
array-operations/all (system)
Next: The array-operations/matrices/file-type․lisp file, Previous: The array-operations/all/file-type․lisp file, Up: Lisp files [Contents][Index]
array-operations/reducing (system)
Next: The array-operations/creating/file-type․lisp file, Previous: The array-operations/reducing/file-type․lisp file, Up: Lisp files [Contents][Index]
array-operations/matrices (system)
Next: The array-operations/indexing/file-type․lisp file, Previous: The array-operations/matrices/file-type․lisp file, Up: Lisp files [Contents][Index]
array-operations/creating (system)
Next: The array-operations/stacking/file-type․lisp file, Previous: The array-operations/creating/file-type․lisp file, Up: Lisp files [Contents][Index]
array-operations/indexing (system)
Next: The array-operations/transforming/file-type․lisp file, Previous: The array-operations/indexing/file-type․lisp file, Up: Lisp files [Contents][Index]
array-operations/stacking (system)
stack*0 (function)
Next: The array-operations/displacing/file-type․lisp file, Previous: The array-operations/stacking/file-type․lisp file, Up: Lisp files [Contents][Index]
array-operations/transforming (system)
Next: The array-operations/utilities/file-type․lisp file, Previous: The array-operations/transforming/file-type․lisp file, Up: Lisp files [Contents][Index]
array-operations/displacing (system)
sub-location% (function)
Next: The array-operations/generic/file-type․lisp file, Previous: The array-operations/displacing/file-type․lisp file, Up: Lisp files [Contents][Index]
array-operations/utilities (system)
Previous: The array-operations/utilities/file-type․lisp file, Up: Lisp files [Contents][Index]
array-operations/generic (system)
Next: Definitions, Previous: Files, Up: Top [Contents][Index]
Packages are listed by definition order.
Next: The array-operations/reducing package, Previous: Packages, Up: Packages [Contents][Index]
file-type.lisp (file)
lisp-stat
Next: The array-operations/matrices package, Previous: The array-operations/all package, Up: Packages [Contents][Index]
file-type.lisp (file)
common-lisp
Next: The array-operations/creating package, Previous: The array-operations/reducing package, Up: Packages [Contents][Index]
file-type.lisp (file)
Next: The array-operations/indexing package, Previous: The array-operations/matrices package, Up: Packages [Contents][Index]
file-type.lisp (file)
Next: The array-operations/stacking package, Previous: The array-operations/creating package, Up: Packages [Contents][Index]
file-type.lisp (file)
Next: The array-operations/transforming package, Previous: The array-operations/indexing package, Up: Packages [Contents][Index]
file-type.lisp (file)
stack*0 (function)
Next: The array-operations/displacing package, Previous: The array-operations/stacking package, Up: Packages [Contents][Index]
file-type.lisp (file)
Next: The array-operations/utilities package, Previous: The array-operations/transforming package, Up: Packages [Contents][Index]
file-type.lisp (file)
sub-location% (function)
Next: The array-operations/generic package, Previous: The array-operations/displacing package, Up: Packages [Contents][Index]
file-type.lisp (file)
Previous: The array-operations/utilities package, Up: Packages [Contents][Index]
file-type.lisp (file)
Definitions are sorted by export status, category, package, and then by lexicographic order.
| • Exported definitions | ||
| • Internal definitions |
Next: Internal definitions, Previous: Definitions, Up: Definitions [Contents][Index]
| • Exported macros | ||
| • Exported functions | ||
| • Exported generic functions | ||
| • Exported conditions | ||
| • Exported types |
Next: Exported functions, Previous: Exported definitions, Up: Exported definitions [Contents][Index]
Dimensions of array-like object.
file-type.lisp (file)
Given one or more symbols INDEX, walks the BODY expression
to determine the index ranges by looking for
AREF and ROW-MAJOR-AREF calls.
Transpose of 2D array A
(each-index (i j)
(aref A j i))
Diagonal of a square 2D array
(each-index i (aref A i i))
Turn a 2D array into an array of arrays
(each-index i
(each-index j
(aref A i j)))
Matrix-vector product:
(each-index i
(sum-index j
(* (aref A i j) (aref x j))))
file-type.lisp (file)
Sets elements of the given ARRAY to values of the BODY,
evaluated at array indices INDEX
Note: This has the same semantics as each-index and each-index*,
but the INDEX ranges are taken from the ARRAY dimensions, not
a code walker.
file-type.lisp (file)
Given one or more symbols INDEX, creates an array
with ELEMENT-TYPE, then iterates over the index ranges
with the innermost loop using the last index.
Each iteration evaluates BODY, and sets the array element.
To find the range of the indices, walks the BODY expression
to determine the index ranges by looking for
AREF and ROW-MAJOR-AREF calls.
Transpose of 2D array A
(each-index* t (i j)
(aref A j i))
Diagonal of a square 2D array
(each-index* t i (aref A i i))
Turn a 2D array into an array of arrays
(each-index* t i
(each-index* t j
(aref A i j)))
Outer product of two 1D arrays to create a 2D array
(each-index* t (i j)
(* (aref x i) (aref y j)))
Matrix-vector product:
(each-index* t i
(sum-index j
(* (aref A i j) (aref x j))))
file-type.lisp (file)
Multiply by the arguments
file-type.lisp (file)
Iterates over a multidimensional range of indices.
SYMS must be a list of symbols, with the first symbol
corresponding to the outermost loop.
DIMENSIONS will be evaluated, and must be a list of
dimension sizes, of the same length as SYMS.
Example:
(nested-loop (i j) ’(10 20) (format t ’~a ~a~%’ i j))
expands to:
; Check dimensions
(destructuring-bind (g1 g2) ’(10 20)
(loop for i from 0 below g1 do
(loop for j from 0 below g2 do
(format t ’~a ~a~%’ i j))))
with some additional type and dimension checks.
file-type.lisp (file)
Reduction over one or more INDEX symbols in an array expression.
The range of these symbols is determined by walking the tree
for AREF and ROW-MAJOR-AREF calls.
Example:
(defparameter A #2A((1 2) (3 4)))
(reduce-index #’+ i (row-major-aref A i)) ; Sum all elements (sum-index)
=> 10
(reduce-index #’* (i j) (aref A i j)) ; Multiply all elements
=> 24
(reduce-index #’max i (row-major-aref A i)) ; Maxmum value
=> 4
file-type.lisp (file)
Sums over one or more INDEX symbols in an array expression.
The range of these symbols is determined by walking the tree
for AREF and ROW-MAJOR-AREF calls.
Example:
(defparameter A #2A((1 2) (3 4)))
(sum-index i (row-major-aref A i)) ; Sum all elements
=> 10
(sum-index (i j) (aref A i j)) ; Sum all elements
=> 10
(sum-index i (aref A i i)) ; Trace of array
=> 5
file-type.lisp (file)
Makes a new array of type ELEMENT-TYPE, containing the result of an array expression. All input and outputs have the same shape, and BODY is evaluated for each index
VARIABLES must be a list of symbols bound to arrays.
Each array must have the same dimensions. These are
checked at compile and run-time respectively.
(let ((a #2A((1 2) (3 4))))
(vectorize (a) (+ a 1)))
-> #2A((2 3) (4 5))
(let ((a #(1 2 3))
(b #(4 5 6)))
(vectorize (a b) (+ a (* b 2))))
-> #(9 12 15)
file-type.lisp (file)
Fills an array RESULT with the result of an array expression. All input and outputs have the same shape, and BODY is evaluated for each index
VARIABLES must be a list of symbols bound to arrays. Each array must have the same dimensions. These are checked at compile and run-time respectively.
(let ((a #2A((1 2) (3 4)))
(b (make-array ’(2 2))))
(vectorize! b (a) (+ a 1)))
-> #2A((2 3) (4 5))
(let ((a #(1 2 3))
(b #(4 5 6)))
(vectorize! b (a b) (+ a (* b 2))))
-> #(9 12 15)
file-type.lisp (file)
Makes a new array of type ELEMENT-TYPE, containing the result of an array expression. All input and outputs have the same shape, and BODY is evaluated for each index
VARIABLES must be a list of symbols bound to arrays.
Each array must have the same dimensions. These are
checked at compile and run-time respectively.
(let ((a #2A((1 2) (3 4))))
(vectorize* t (a) (+ a 1)))
-> #2A((2 3) (4 5))
(let ((a #(1 2 3))
(b #(4 5 6)))
(vectorize* t (a b) (+ a (* b 2))))
-> #(9 12 15)
file-type.lisp (file)
Performs a reduction using FN over all elements in a vectorized expression
on array VARIABLES.
VARIABLES must be a list of symbols bound to arrays.
Each array must have the same dimensions. These are
checked at compile and run-time respectively.
Example: Maximum value in an array A
(vectorize-reduce #’max (a) a)
Example: Maximum absolute difference between two arrays A and B
(vectorize-reduce #’max (a b) (abs (- a b)))
file-type.lisp (file)
Iterate over the subscripts of an array with given DIMENSIONS. SUBSCRIPTS contains the current subscripts as a vector of fixnums, POSITION has the row-major index. Consequences are undefined if either POSITION or SUBSCRIPTS is modified.
file-type.lisp (file)
Like WALK-SUBSCRIPTS, but SUBSCRIPTS is a newly created list for each position that does not share structure and can be freely used/modified/kept etc.
file-type.lisp (file)
Next: Exported generic functions, Previous: Exported macros, Up: Exported definitions [Contents][Index]
Find the row-major-aref in ARRAY with the maximum value Returns both the index and the value of ARRAY at that index
file-type.lisp (file)
Find the row-major-aref in ARRAY with the minimum value Returns both the index and the value of ARRAY at that index
file-type.lisp (file)
FN must accept two inputs and return true/false. This function is applied
to elements of ARRAY, to find the ’best’. The row-major-aref index is returned.
Example: The index of the maximum is
* (best #’> #(1 2 3 4))
3 ; row-major index
4 ; value
This function was adapted from P.Graham’s On Lisp
file-type.lisp (file)
Return a function composed of a univariate function that coerces to ELEMENT-TYPE and function. When FUNCTION is not given, return a closure that coerces to ELEMENT-TYPE.
file-type.lisp (file)
The opposite of SUBARRAYS. If ELEMENT-TYPE is not given, it is inferred from the first element of array, which also determines the dimensions. If that element is not an array, the original ARRAY is returned as it is.
file-type.lisp (file)
Return a list of increasing indices that complement PERMUTATION, i.e. form a permutation when appended. Atoms are accepted and treated as lists of a single element.
file-type.lisp (file)
Return a completed version of permutation, appending it to its complement.
file-type.lisp (file)
Copy SOURCE into TARGET, for array arguments of compatible dimensions (checked). Return TARGET, making the implementation of the semantics of SETF easy.
file-type.lisp (file)
Copy elements with row major indexes between the given start and end from SOURCE to DESTINATION, respectively. Elements are coerced to ELEMENT-TYPE when necessary. Return no values.
This function should be used to implement copying of contiguous row-major blocks of elements, most optimizations should happen here.
file-type.lisp (file)
Shorthand function for displacing an array.
file-type.lisp (file)
Like EACH*, with ELEMENT-TYPE T.
file-type.lisp (file)
Apply function to the array arguments elementwise, and return the result as an array with the given ELEMENT-TYPE. Arguments are checked for dimension compatibility.
file-type.lisp (file)
Return a list of dimensions corresponding to OBJECT. Positive integers are
treated as dimensions of rank 1, lists are returned as they are, and arrays
are queried for their dimensions.
OBJECTS accepted by this function as valid dimensions are called ‘dimension specifications’ in this library.
file-type.lisp (file)
Fills a given ARRAY with VALUE, coerced to the same element type as ARRAY
file-type.lisp (file)
If one of the dimensions is missing (indicated with T), replace it with a dimension so that the total product equals SIZE. If that’s not possible, signal an error. If there are no missing dimensions, just check that the product equals size. Also accepts other dimension specifications (integer, array).
file-type.lisp (file)
Return ARRAY flattened to a vector. Will share structure.
file-type.lisp (file)
Like GENERATE*, with ELEMENT-TYPE T.
file-type.lisp (file)
Return an array with given DIMENSIONS and ELEMENT-TYPE, with elements
generated by calling FUNCTION with
- no arguments, when ARGUMENTS is nil
- the position (= row major index), when ARGUMENTS is :POSITION
- a list of subscripts, when ARGUMENTS is :SUBSCRIPTS
- both when ARGUMENTS is :POSITION-AND-SUBSCRIPTS
The traversal order is unspecified and may be nonlinear.
file-type.lisp (file)
Test if PERMUTATION is the identity permutation, i.e. a sequence of consecutive integers starting at 0. Note that permutation is otherwise not checked, i.e. it may not be a permutation.
file-type.lisp (file)
Test if PERMUTATION is the identity permutation, i.e. a sequence of consecutive integers starting at 0. Note that permutation is otherwise not checked, i.e. it may not be a permutation.
file-type.lisp (file)
Invert a permutation.
file-type.lisp (file)
Make a vector of N elements and type T, containing evenly spaced numbers over an interval.
The first element is equal to START and last element STOP,
with constant difference between consecutive elements.
(linspace 0 4 5) -> #(0 1 2 3 4)
(linspace 1 3 5) -> #(0 1/2 1 3/2 2)
(linspace 0 4d0 3) -> #(0.0d0 2.0d0 4.0d0)
file-type.lisp (file)
Fill an array with evenly spaced numbers over an interval.
The first element is equal to START and last element STOP,
with constant difference between consecutive elements in ROW-MAJOR-INDEX.
file-type.lisp (file)
Make a vector of N elements and type ELEMENT-TYPE, containing evenly spaced numbers over an interval.
The first element is equal to START and last element STOP,
with constant difference between consecutive elements.
file-type.lisp (file)
Returns new array with the same properties as ARRAY.
Keyword arguments will override properties of ARRAY.
If INITIAL-ELEMENT is specified, it is coerced to ELEMENT-TYPE.
file-type.lisp (file)
Like MARGIN*, with ELEMENT-TYPE T.
file-type.lisp (file)
PERMUTE ARRAY with ‘(,@OUTER ,@INNER), split the inner subarrays, apply FUNCTION to each, return the results in an array of dimensions OUTER, with the given ELEMENT-TYPE.
file-type.lisp (file)
Test if MATRIX has rank 2.
file-type.lisp (file)
Test if MATRIX has rank 2.
file-type.lisp (file)
Finds the element of ARRAY which maximises FN applied to the array value.
Returns the row-major-aref index, and the winning value.
Example: The maximum of an array is
(most #’identity #(1 2 3))
-> 2 (row-major index)
3 (value)
Minimum of an array is
(most #’- #(1 2 3))
0
-1
This function was adapted from P.Graham’s On Lisp
file-type.lisp (file)
Makes an array of shape DIMENSIONS and type T, filled with ones
file-type.lisp (file)
Fills the given ARRAY with 1’s, coerced to the element type. Returns ARRAY.
file-type.lisp (file)
Makes an array of shape DIMENSIONS and type ELEMENT-TYPE, filled with ones coerced to the specified type ELEMENT-TYPE.
file-type.lisp (file)
Like OUTER, with ELEMENT-TYPE t.
file-type.lisp (file)
Generalized outer product of ARRAYS with FUNCTION. The resulting array has the concatenated dimensions of ARRAYS, and the given ELEMENT-TYPE.
file-type.lisp (file)
Return a subset of the array, on the first indexes between START and END.
file-type.lisp (file)
(setf partition) (function)
file-type.lisp (file)
partition (function)
Return ARRAY with the axes permuted by PERMUTATION, which is a sequence of indexes. Specifically, an array A is transformed to B, where
B[b_1,...,b_n] = A[a_1,...,a_n] with b_i=a_{P[i]}
P is the permutation.
Array element type is preserved.
file-type.lisp (file)
Product of elements in the argument. NOT EXPORTED.
file-type.lisp (file)
Makes an array of shape DIMENSIONS and type T, filled with random numbers
uniformly distributed between 0 and 1.
Uses the built-in RANDOM function.
(rand 3) -> #(0.39319038 0.69693553 0.5021677)
(rand ’(2 2)) -> #2A((0.91003513 0.23208928) (0.5577954 0.94657767))
NOTE: If it’s important that these numbers are really random
(e.g. cryptographic applications), then you should probably
not use this function.
file-type.lisp (file)
Fills a given ARRAY with random numbers, uniformly distributed between 0 and 1. Uses the built-in RANDOM function. Returns ARRAY.
file-type.lisp (file)
Makes an array of shape DIMENSIONS and type ELEMENT-TYPE, filled with random numbers
uniformly distributed between 0 and 1.
Uses the built-in RANDOM function.
(rand 3) -> #(0.39319038 0.69693553 0.5021677)
(rand ’(2 2)) -> #2A((0.91003513 0.23208928) (0.5577954 0.94657767))
NOTE: If it’s important that these numbers are really random
(e.g. cryptographic applications), then you should probably
not use this function.
file-type.lisp (file)
Creates an array of shape DIMENSIONS and type T,
and fills with normally distributed numbers
with a mean of zero and standard deviation of 1
Uses the Box-Muller algorithm and built-in random number generator.
(rand 3) -> #(-0.82067037 -0.60068226 -0.21494178)
(randn ’(2 2)) -> #2A((1.6905352 -2.5379088) (0.8461403 -1.505984))
NOTE: If it’s important that these numbers are really random
(e.g. cryptographic applications), then you should probably
not use this function.
file-type.lisp (file)
Fills ARRAY with normally distributed numbers
with a mean of zero and standard deviation of 1
Uses the Box-Muller algorithm and built-in random number generator.
NOTE: If it’s important that these numbers are really random
(e.g. cryptographic applications), then you should probably
not use this function.
file-type.lisp (file)
Creates an array of shape DIMENSIONS and type ELEMENT-TYPE,
and fills with normally distributed numbers
with a mean of zero and standard deviation of 1
Uses the Box-Muller algorithm and built-in random number generator.
(rand 3) -> #(-0.82067037 -0.60068226 -0.21494178)
(randn ’(2 2)) -> #2A((1.6905352 -2.5379088) (0.8461403 -1.505984))
NOTE: If it’s important that these numbers are really random
(e.g. cryptographic applications), then you should probably
not use this function.
file-type.lisp (file)
Recycle elements of OBJECT, extending the dimensions by outer (repeating OBJECT) and inner (repeating each element of OBJECT). When both INNER and OUTER are nil, the OBJECT is returned as is. Non-array OBJECTs are interpreted as rank 0 arrays, following the usual semantics.
file-type.lisp (file)
Reshape ARRAY using DIMENSIONS (which can also be dimension specifications). If DIMENSIONS is a list, it may contain a single element T which will be calculated to match the total size of the resulting array.
file-type.lisp (file)
Array reshaped as an Nx1 matrix.
file-type.lisp (file)
Array reshaped as an 1xN matrix.
file-type.lisp (file)
Test if arguments have the same dimensions. NOT EXPORTED.
file-type.lisp (file)
Returns new array with the same properties as ARRAY.
Keyword arguments will override properties of ARRAY.
If INITIAL-ELEMENT is specified, it is coerced to ELEMENT-TYPE.
file-type.lisp (file)
Return an array of subarrays, split off at RANK. All subarrays are displaced and share structure.
file-type.lisp (file)
Test if MATRIX has two dimensions and that they are equal.
file-type.lisp (file)
Test if MATRIX has two dimensions and that they are equal.
file-type.lisp (file)
Like STACK*, with element-type T.
file-type.lisp (file)
Stack array arguments along AXIS. ELEMENT-TYPE determines the element-type of the result.
file-type.lisp (file)
Like STACK-COLS*, with ELEMENT-TYPE T.
file-type.lisp (file)
Stack OBJECTS column-wise into an array of the given ELEMENT-TYPE, coercing if necessary. Always return a simple array of rank 2.
How objects are used depends on their dimensions, queried by DIMS:
- when the object has 0 dimensions, fill a column with the element.
- when the object has 1 dimension, use it as a column.
- when the object has 2 dimensions, use it as a matrix.
When applicable, compatibility of dimensions is checked, and the result is used to determine the number of rows. When all objects have 0 dimensions, the result has one row.
file-type.lisp (file)
Like STACK-ROWS*, with ELEMENT-TYPE T.
file-type.lisp (file)
Stack OBJECTS row-wise into an array of the given ELEMENT-TYPE, coercing if necessary. Always return a simple array of rank 2.
How objects are used depends on their dimensions, queried by DIMS:
- when the object has 0 dimensions, fill a row with the element.
- when the object has 1 dimension, use it as a row.
- when the object has 2 dimensions, use it as a matrix.
When applicable, compatibility of dimensions is checked, and the result is used to determine the number of columns. When all objects have 0 dimensions, the result has one column.
file-type.lisp (file)
Given a partial list of subscripts, return the subarray that starts there, with all the other subscripts set to 0, dimensions inferred from the original. If no subscripts are given, the original array is returned. Implemented by displacing, may share structure.
file-type.lisp (file)
(setf sub) (function)
file-type.lisp (file)
sub (function)
Displaced vector between START and END.
file-type.lisp (file)
(setf subvec) (function)
file-type.lisp (file)
subvec (function)
Makes an array of shape DIMENSIONS and type T, filled with zeros
file-type.lisp (file)
Fills the given ARRAY with zero values, coerced to the element type. Returns ARRAY.
file-type.lisp (file)
Makes an array of shape DIMENSIONS and type ELEMENT-TYPE, filled with zeros coerced to the specified type ELEMENT-TYPE.
file-type.lisp (file)
Next: Exported conditions, Previous: Exported functions, Up: Exported definitions [Contents][Index]
Return the contents of OBJECT as an array. Exact semantics depends on OBJECT, but generally objects which contain elements in a rectilinear coordinate system should have a natural mapping to arrays.
When the second value is T, the array itself does not share structure with OBJECT, but its elements may. Otherwise, it is indeterminate whether the two objects share structure, and consequences of modifying the result are not defined. Methods are encouraged but not required to return a second value.
file-type.lisp (file)
Return specificed dimension of ARRAY.
file-type.lisp (file)
Return a list of dimensions.
For non-array objects, SIZE, DIM, NROW and NCOL use this method by default, so it is enough to define it (unless efficiency is a concern).
When DIMS is not defined for an object, it falls back to as-array, which may be very inefficient for objects which need to be consed. It is always advisable to define DIMS.
file-type.lisp (file)
Return TYPE such that
1. all elements of ARRAY are guaranteed to be a subtype of TYPE,
2. if applicable, elements of ARRAY can be set to values which are of a type that is a subtype of TYPE.
file-type.lisp (file)
Number of columns. Will signal an error if ARRAY is not a matrix.
file-type.lisp (file)
Number of rows. Will signal an error if ARRAY is not a matrix.
file-type.lisp (file)
Return the rank of ARRAY.
file-type.lisp (file)
Return the total number of elements in array.
file-type.lisp (file)
Method used to implement the copying of objects in STACK-COL*, by copying the elements of SOURCE to DESTINATION, starting with the column index START-COL in the latter. Elements are coerced to ELEMENT-TYPE.
This method is only called when (DIMS SOURCE) was non-nil. It is assumed that it only changes elements in DESTINATION which are supposed to be copies of SOURCE. DESTINATION is always a matrix with element-type upgraded from ELEMENT-TYPE, and its NROW should match the relevant dimension of SOURCE.
All objects have a fallback method, defined using AS-ARRAY. The only reason for defining a method is efficiency.
file-type.lisp (file)
Method used to implement the copying of objects in STACK-ROW*, by copying the elements of SOURCE to DESTINATION, starting with the row index START-ROW in the latter. Elements are coerced to ELEMENT-TYPE.
This method is only called when (DIMS SOURCE) was non-nil. It is assumed that it only changes elements in DESTINATION which are supposed to be copies of SOURCE. DESTINATION is always a matrix with element-type upgraded from ELEMENT-TYPE, and its NCOL should match the relevant dimension of SOURCE.
All objects have a fallback method, defined using AS-ARRAY. The only reason for defining a method is efficiency.
file-type.lisp (file)
Next: Exported types, Previous: Exported generic functions, Up: Exported definitions [Contents][Index]
file-type.lisp (file)
error (condition)
file-type.lisp (file)
error (condition)
:index
file-type.lisp (file)
error (condition)
:index
Previous: Exported conditions, Up: Exported definitions [Contents][Index]
A rank-2 array.
file-type.lisp (file)
Previous: Exported definitions, Up: Definitions [Contents][Index]
| • Internal macros | ||
| • Internal functions |
Next: Internal functions, Previous: Internal definitions, Up: Internal definitions [Contents][Index]
Examples:
Matrix-matrix multiply
(foreach :index (i j) :sum k
:value (* (aref A i k) (aref B k j)))
Sum over vector
(foreach :sum i :value (aref A i))
file-type.lisp (file)
Previous: Internal macros, Up: Internal definitions [Contents][Index]
Check if PERMUTATION is a valid permutation (of the given RANK), and signal an error if necessary.
file-type.lisp (file)
Walks an expression tree EXPR, finds AREF and ROW-MAJOR-AREF, SVREF or ELT calls.
Returns a list of (symbol, expr) where EXPR is an expression which
evaluates to the array dimension size for SYMBOL.
Example:
(find-array-dimensions ’(+ (aref a i) (* 2 (aref b j k))))
-> ((I ARRAY-DIMENSION A 0) (K ARRAY-DIMENSION B 1) (J ARRAY-DIMENSION B 0))
file-type.lisp (file)
Make a bit vector of flags with indexes from PERMUTATION, signaling errors for invalid and repeated indices. NOT EXPORTED.
file-type.lisp (file)
Stack arrays along the 0 axis, returning an array with given ELEMENT-TYPE.
file-type.lisp (file)
Return (values OFFSET REMAINING-DIMENSIONS) that can be used to displace a row-major subarray starting at SUBSCRIPTS in an array with the given DIMENSIONS. NOT EXPORTED.
file-type.lisp (file)
Previous: Definitions, Up: Top [Contents][Index]
| • Concept index | ||
| • Function index | ||
| • Variable index | ||
| • Data type index |
Next: Function index, Previous: Indexes, Up: Indexes [Contents][Index]
| Jump to: | A F L |
|---|
| Jump to: | A F L |
|---|
Next: Variable index, Previous: Concept index, Up: Indexes [Contents][Index]
| Jump to: | &
(
A B C D E F G I L M N O P R S V W Z |
|---|
| Jump to: | &
(
A B C D E F G I L M N O P R S V W Z |
|---|
Next: Data type index, Previous: Function index, Up: Indexes [Contents][Index]
| Jump to: | I S |
|---|
| Index Entry | Section | ||
|---|---|---|---|
| | |||
| I | |||
index : | Exported conditions | ||
index : | Exported conditions | ||
| | |||
| S | |||
Slot, index : | Exported conditions | ||
Slot, index : | Exported conditions | ||
| |
| Jump to: | I S |
|---|
Previous: Variable index, Up: Indexes [Contents][Index]
| Jump to: | A C P S T |
|---|
| Jump to: | A C P S T |
|---|


| Package | Description |
|---|---|
| edu.iit.sat.itmd4515.vflores3.fp.domain | |
| edu.iit.sat.itmd4515.vflores3.fp.service | |
| edu.iit.sat.itmd4515.vflores3.fp.web |
| Modifier and Type | Method and Description |
|---|---|
Customer |
Project.getCustomer()
Get the value of customer
|
| Modifier and Type | Method and Description |
|---|---|
void |
Project.addCustomerToProject(Customer customer)
Helper method that sets a customer to the project and the project to the
customer
|
void |
Project.setCustomer(Customer customer)
Set the value of customer
|
| Modifier and Type | Method and Description |
|---|---|
Customer |
CustomerService.findByUsername(String username)
Method to find an exact user by their username
|
Customer |
CustomerService.findExactCompany(String companyName,
String custRepresentative)
Method to find an exact company by the company name and the company
representatives first and last name
|
| Modifier and Type | Method and Description |
|---|---|
List<Customer> |
CustomerService.findAll()
Method to find all customers from database
|
List<Customer> |
CustomerService.findByCompanyName(String companyName)
Method to find a company or list of companies by the company name
|
| Modifier and Type | Method and Description |
|---|---|
void |
CustomerService.create(Customer customer)
Create a new customer
|
void |
ProjectService.create(Project project,
Customer customer) |
void |
CustomerService.delete(Customer customer)
Delete an existing customer and remove from a customer
|
void |
CustomerService.update(Customer newCustomer) |
| Modifier and Type | Method and Description |
|---|---|
Customer |
UserController.getCustomer()
Get the value of customer
|
Customer |
ProjectController.getCustomer()
Get the value of customer
|
Customer |
CustomerController.getCustomer()
Get the value of customer
|
| Modifier and Type | Method and Description |
|---|---|
List<Customer> |
CustomerController.getCustomers()
Get the value of customers
|
| Modifier and Type | Method and Description |
|---|---|
String |
CustomerController.doDeleteCustomer(Customer customer)
Prepare the selected customer for deletion, and call the delete
|
String |
CustomerController.doUpdateCustomer(Customer customer)
Prepare the selected customer to be updated
|
String |
CustomerController.doViewCustomer(Customer customer)
Prepare the selected customer to be displayed in more detail
|
void |
UserController.setCustomer(Customer customer)
Set the value of customer
|
void |
ProjectController.setCustomer(Customer customer)
Set the value of customer
|
void |
CustomerController.setCustomer(Customer customer)
Set the value of customer
|
| Modifier and Type | Method and Description |
|---|---|
void |
CustomerController.setCustomers(List<Customer> customers)
Set the value of customers
|
Copyright © 2015. All rights reserved.


1020
Aging in T/S port
Staying at T/S port more than 7 days.
750
Aging in POD
Staying at POD more than 7 days.
110
POD Arrival Delay
Arrival is expected to be delayed more than 7 days.
26
POL Depature Delay
Departuer is expected to be Delayed more than 7 days.
84
POD ETA change
Arrival schedule is changed more than 3 from the previous one.
1020
aging in T/S port
Departure schedule is changed more than 3 days from the previous one.
Fri. Apr 02 2021
08:20 am
Le Havre, France
TGBU8030389
2021-07-18 (FDEST ETA)
Source: Manual
12:50 am
Le Havre, France
2021-06-22 (TS)
Port Congestion
Source: Irregularity
Irre No: EXCT202107220009
Sat. Apr 03 2021
02:10 am
Hong Kong
2021-06-30 17:10
Typhoon, Storm
Projected path for Tropical Cyclo ..
Source: GDACS
read more
08:20 am
Le Havre, France
TGBU8030389
2021-07-18 (FDEST ETA)
Source: Manual
08:20 am
Le Havre, France
TGBU8030389
2021-07-18 (FDEST ETA)
Source: Manual
08:20 am
Le Havre, France
TGBU8030389
2021-07-18 (FDEST ETA)
Source: Manual
| POL | Today | + 1~3day | + 4~6day |
|---|---|---|---|
| Busan | 150 | 150 | 150 |
| Shanghai | 32 | 32 | 32 |
| Hong Kong | 102 | 102 | 102 |
| Spain | 188 | 188 | 188 |
| Tokyo | 188 | 188 | 188 |
| Vladivostok | 150 | 150 | 150 |
| Incheon | 32 | 32 | 32 |
| Taipei | 102 | 102 | 102 |
| Southampoton | 188 | 188 | 188 |
| Singapore | 97 | 97 | 97 |
| Busan | 150 | 150 | 150 |
| Shanghai | 32 | 32 | 32 |
| Hong Kong | 102 | 102 | 102 |
| Spain | 188 | 188 | 188 |
| Tokyo | 188 | 188 | 188 |
| Vladivostok | 150 | 150 | 150 |
| Incheon | 32 | 32 | 32 |
| Taipei | 102 | 102 | 102 |
| Southampoton | 188 | 188 | 188 |
| Singapore | 97 | 97 | 97 |
| T/S Port | Week1 | Week2 | Week3 | Week1 | Avg(μ) | Std(σ) | |
|---|---|---|---|---|---|---|---|
| 1 |
CHINA
KRPUS |
150 | 20 | 32 | 150 | 5 | 4.2 |
| 2 |
CHINA
KRPUS |
150 | 20 | 32 | 150 | 5 | 4.2 |
| 3 |
CHINA
KRPUS |
150 | 20 | 32 | 150 | 5 | 4.2 |
| 4 |
KOREA
KRPUS |
150 | 20 | 32 | 150 | 5 | 4.2 |
| 5 |
MOROCO
KRPUS |
150 | 20 | 32 | 150 | 5 | 4.2 |
| 6 |
SINGAPORE
KRPUS |
150 | 20 | 32 | 150 | 5 | 4.2 |
| 7 |
TURKEY
KRPUS |
150 | 20 | 32 | 150 | 5 | 4.2 |
| 8 |
CHINA
KRPUS |
150 | 20 | 32 | 150 | 5 | 4.2 |
| 9 |
EGYPT
KRPUS |
150 | 20 | 32 | 150 | 5 | 4.2 |
| 10 |
CHINA
KRPUS |
150 | 20 | 32 | 150 | 5 | 4.2 |


This website is a work in progress, please come back later
I am working torwards my Bachelors at Iowa State University.
Interests
Computer Hardware
Credits: Typeface: https://manropefont.com/ CSS Modules: https://purecss.io/ Header: https://chenhuijing.com/blog/the-one-in-black-and-orange/#%F0%9F%8E%99 Inspirations: https://jgthms.com/web-design-in-4-minutes/ https://perfectmotherfuckingwebsite.com/ https://casual-effects.com/markdeep/#getstarted https://dev.to/chaoocharles/i-created-a-responsive-portfolio-website-using-pure-htm-css-and-javascript-4d7n


We recommend the new description list component instead of the definition list because it improves the responsiveness and accessibility of the lists. We will deprecate the definition list component in the next major version of SKY UX.
Definition list heading
{{item.label}}
{{item.value}}


{% pjaxr_extends "partials/auth_modal.html" "Site" %} {% load i18n %} {% block title %}{% trans "Account" %}{% endblock %} {% block notifications %}{% include 'partials/notifications.html' %}{% endblock %} {% block content %}
{% trans 'Warning:'%} {% trans "You currently do not have any email address set up. You should really add an email address so you can receive notifications, reset your password, etc." %}
{% endif %}


Unlocked Dynamic Bible
☰
Old Testament
Genesis
Exodus
Leviticus
Numbers
Deuteronomy
Joshua
Judges
Ruth
Samuel
Samuel
Kings
Kings
Chronicles
Chronicles
Ezra
Nehemiah
Esther
Job
Psalms
Proverbs
Ecclesiastes
Song of Songs
Isaiah
Jeremiah
Lamentations
Ezekiel
Daniel
Hosea
Joel
Obadiah
Jonah
Micah
Nahum
Habakkuk
Zephaniah
Haggai
Zechariah
Malachi
New Testament
Matthew
Mark
Luke
John
Romans
Corinthians
Corinthians
Galatians
Ephesians
Philippians
Colossians
Thessalonians
Thessalonians
Timothy
Titus
Philemon
Hebrews
James
Peter
Peter
John
John
Revelation


If you can't remember your password or need to create one, fill in the form below, and an email will be sent allowing you to reset your password. Your current password will not be sent over email.
${forms.ltext(renderer, 'email')} <%forms:actions> %forms:actions> ${renderer.end()}


A fake blog post title
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
Webalar
id="download-button" type="button" class="home__button button button--default">WebalarWebalar
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
In this section you show all the path you follow to be where you are now, your graduations and professional experiences goes here.
Tell here how was your experience by learning this subject, what were your main challenges and how did you overcame them.
Developed skills
Tell here how was your experience by learning this subject, what were your main challenges and how did you overcame them.
Developed skills
Tell here what were your responsibilities by occupying this role, what kind of skills have you developed during this experience?
Developed skills
Tell here what were your responsibilities by occupying this role, what kind of skills have you developed during this experience?
Developed skills
What kind of services do you offer? Photography? Design? Web development? Specify all of them here.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
Social proof will help you to get new clients, show here who are your clients and what they are saying.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
Maintain a blog is a good strategy to generate authority in your professional area, show your most read articles.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
This is a fake text, it is used to fill some text area that doesn't have any content written yet. It simulates how the paragraph will look like. Remember to edit this content before publishing your project.
Are you open to talk about new jobs opportunities? Show all the ways people can contact you.


Great Forest [am28], forest, in Mandoria, peasants: 149
Last updated Turn #134
Great Forest [am28], forest, in Mandoria, peasants: 149
------------------------------------------------------------------------
19: Stack of cyclops [jq5y], cyclops, number: 5, arrived from the east.
21: Stack of cyclops [jq5y], cyclops, number: 5, went west.
30: The population grows by one peasant.
Routes leaving Great Forest:
North, forest, to Great Forest [al28], 8 days
East, forest, to Great Forest [am29], 8 days
South, forest, to Great Forest [an28], 8 days
Garrison [gu6n], garrison, uncontrolled, with four peasants
West, forest, to Great Forest [am27], 8 days
It is raining.
Seen here:
Stack of cyclops [dg1o], cyclops, number: 8


About my works this is one of them, this page is my first in life project even though I have never done or start one.


I have listed on this page my personal experiences with different drug combinations. If your curious about a certain combo but arent sure if it's dangerous or not, then it might help to see that i didn't die from it and what someone else thought of it.
please be advised - i am an undergrad psychobiology student, not a doctor. all of the information on this page is for informational purposes only. remember that even though i survived all of these interactions with only temporary after-effects, not everyone will react the same. (i have had an exceptionally good track record of health my entire life) recreational drug use is still very dangerous and is not for everybody!!!!
the purpose of this page is to share some of the knowledge that i have gained in the last five years of drug experimentation. there seems to be very few web pages offering information on radical drug combinations and if i can save someone out there grief and/or money by sharing my experiences and mistakes, then i'd rather do so.
LSD and Ketamine
k while tripping is an excelent way to boost your trip and take it to another level. bumps are good, but be careful to not overdo it. id say two lines maximum. you do not want to go into a hole! a k hole tripping is not the same as one normally. a normal k hole can be an enjoyable, profound expirience when done in a safe setting. you are much more concious and have a hieghtened sensory awareness while in a hole on lsd. on new years 2001 i was on two geltabs (equal to about 2 1/2-3 paper hits of lsd) and did four lines of k during my peak. it felt like a half hour long whip it that i just wanted to end. it felt really cool at first but after it didn't stop i began to really dislike it and went on a bad one. after the k wore off i was so sick of tripping i took a couple of xantax's to pass out. i didnt trip for about a month afterward.
LSD and Mushrooms
works great for me, you get the best of both worlds in your trip. but this has the tendency to make people (with weak stomachs) sick. drop the acid first then eat the shrooms slowly over a period of a half hour or vomitaing may follow.
LSD and Cocaine
not really an enjoyable combination. the coke pull you out of the trip but at the same time doesnt really feel like coke. you get the downside of coke but not the good. in my opinion, its a waste of coke. however, smoking a coke laced bowl of weed while tripping isnt bad. then again, when isnt it fun to smoke a laced bowl?

LSD and Alcohol
not really fun to do at the same time. drinking while tripping can make you sick. drinking before trpping is okay, but i wouldnt have more than two drinks after dropping the acid.

Cocaine and Ecstasy
good if your rolls are dirty. if your rolls are pure than the coke can make you come down from the roll and not offer anything in return. see above on lacing bowls ;)
Cocaine and Alcohol
in my opinion, the perfect club combo. just do them in equal amounts. one line = 1 1/2 to 2 drinks.
Cocaine and Mushrooms
see coke and lsd
Ecstasy and Ketamine
really fun, especially on clean rolls. dont overdo the k unless your in a safe environment.
Ecstasy and Alcohol
if you want to havbe the best roll of your life get pissdrunk before you roll. but be careful cause you will be a mess. dont drink after dropping the roll cause you will most likely feel sick/ vomit.
Alcohol and Ketamine
its oay, but nothing special. i have better uses for k.
GHB and Cannabis
just like drinking and smoking.
GHB and Alcohol
DON'T ASK!!!!!!
paxil,prozac, and serzone are not like any of the illegal drugs posted here. you cannot take one and expect to feel anything. these drugs take a week and sometimes more to affect the body. the information below is only for those who have been prescribed these medications by a docotor and are curious about what might happen if they try other drugs while on the medication.
Paxil/Prozac/Serzone and Ecstasy
dont do it unless you enjoy wasting your money on rolls. you will feel it for about a half hour then come down and get really tired and sleepy. taking rolls is not what you really should be doing anyway if your on these medications. if your on them its cause your trying to get better, depleting your serotonin reserves when trying to get better is the opposite of what you're trying to do.

Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


THIS WEBSITE USES COOKIES. We use cookies to personalize content and ads, to provide social media features, and to analyze our traffic. We also share your use of our website to our social media, advertising, and analytis partners.


Usage
With this
tag you can
Create Solr or Verity collections.
Administer Solr or Verity collections created by this tag
or the ColdFusion Administrator.
Administer Verity collections that were created by a Verity
application.
The following table shows the dependence
relationships among this tag’s attribute values:
This attribute is required, optional, or unnecessary
(blank):
|
For this action attribute value:
|
| |
list
|
create
|
map
|
optimize
|
repair
|
delete
|
category list
|
collection
|
|
Required
|
Required
|
Required
|
Required
|
Required
|
Required
|
path
|
|
Required
|
Required
|
|
|
|
|
language
|
|
Optional
|
Optional
|
|
|
|
|
name
|
Required
|
|
|
|
|
|
Required
|
categories
|
|
|
|
|
|
|
|
The following examples show the structures
returned by the categorylist action:
CATEGORIES
|
blue
|
10
|
green
|
3
|
magenta
|
3
|
purple
|
2
|
CATEGORYTREES
|
a/
|
10
|
a/b
|
10
|
a/b/c
|
10
|
a/b/c/subdir
|
3
|
The list action returns
the following information in a result set that contains one row
per collection:
Column
|
Contents
|
CATEGORIES
|
|
CHARSET
|
The character set of the collection.
|
CREATED
|
The date and time that the collection was
created.
|
td valign="top" width="NaN%" headers="d17e16826 ">DOCCOUNT
The number of documents in this collection.
|
EXTERNAL
|
yes: the collection
is external.
no: the collection is not external.
not found: the collection is registered
but is not available in the defined path.
|
LANGUAGE
|
The locale setting of the collection.
This
information is not available for K2Server collections.
|
LASTMODIFIED
|
The date and time that the collection was
last changed.
|
MAPPED
|
Obsolete.
|
NAME
|
The name of the collection.
|
ONLINE
|
Obsolete.
|
PATH
|
Absolute path to the collection.
|
REGISTERED
|
Obsolete.
|
SIZE
|
The size of the collection, expressed in
kilobytes.
|
You can also specify uni to
enable support for multiple languages.
If the Verity Server
is not running when the list action is executed
on a Verity collection, the tag throws an error.
To determine
whether a collection exists, use code, such as the following, to execute
a query of queries:
<cfcollection action="list" name="myCollections" >
<cfquery name="qoq" dbtype="query">
SELECT * from myCollections
WHERE myCollections.name = 'myCollectionName'
</cfquery>
<cfif qoq.recordcount GT 0>
<!--- Collection exists --->
<cfdump var = #qoq#>
</cfif>
The code determines whether a Verity
collection exists as Verity is the default engine. You may also
specify engine="verity" in the code.
To determine
whether a Solr collection exists, you must specifically add the attribute engine and
provide the value as solr. For example,
<cfcollection action="list" name="myCollections" engine="solr">
To
get a result set with values for all the collections that are registered
with the search server, use code such as the following:
<cfcollection action="list" name="myCollections">
<cfoutput query="myCollections">
#name#<br>
</cfoutput>
To add content to a collection,
use cfindex. To search a collection,
use cfsearch.
You
cannot delete Verity collections on Windows if they are created
outside of the ColdFusion collections directory or on a drive other
than C:, D: or E:. To use a different drive letter, edit the cf_dir/verity/common/verity.cfg
file and replace an entry with the directory you wish to use as
follows:
alias11=path6
mapping11=F:\
dirmode11=rw
Restart the ColdFusion Search Service
for this change to take effect.
For Solr collections, the language attribute
of this tag supports the following options:
Brazilian
|
cjk (Chinese, Japanese, Korean)
|
French
|
Russian
|
Czech
|
Dutch
|
German
|
Thai
|
Chinese
|
English
|
Greek
|
|
For Verity collections, the language attribute
of this tag supports the following options:
Asian Language Pack
|
Japanese
|
Korean
|
Chinese
|
Traditional Chinese
|
Multilanguage Language Pac
|
Unicode
|
|
|
|
Western European Language Pack
|
Bokmal
|
Finnish
|
Italian
|
Spanish
|
Danish
|
French
|
Nynorsk
|
Swedish
|
Dutch
|
German
|
Portuguese
|
|
Eastern European/Middle Eastern Language Pack
|
Arabic
|
Greek
|
Polish
|
Turkish
|
Bulgarian
|
Hebrew
|
Russian
|
|
Czech
|
Hungarian
|
Russian2
|
|
The default location for all collections
is as follows:


Please create your Spread Sheets on ahead. Your Spread Sheet URL is like below, Spread Sheets ID is [spreadSheetId] part. https://docs.google.com/spreadsheets/d/[speadSheetId]/edit#gid=0
a. 記録先Google Spread Sheets IDの入力(必須)
Enter Google Spread Sheets ID for record (nessesary)


jl777c
26-Dec-19 05:44 AM
i have trained several devs to make CC, not just to code them, but to be able to design them. the reason we dont have a lot more is simple: budget
if we can hire 100 devs, we can have 100 CC devs
but devs dont work for free and this is where the 100s of millions raised in ICO makes a difference, they can and do hire hundreds of devs
with CC, it is harder to make than an ETH smart contract, but easier to do than a ETH smart contract to invoke an existing CC. and this using of the existing CC is far more what is the level of the less serious developer
from command line arguments, you will be able to create a pegged and backed chain using any crypto and pegged to anything that has a price API
think of it as writing bash scripts
not anything hardcore, yet a lot has been created with bash scripts.
as it is the handful of CC devs are making enough new tech to keep the marketing side saturated. if we had 100 CC devs... there would be way too much tech and the 1/tech effect will kill the price
saying that KMD is a closed system because it is open source but not using the most trendy languages is silly
you can write anything in one language that you can in another, i was just an simple C programmer, yet i seem to have been able to write a lot of relevant blockchain code.
there is a reason almost all the core cryptographic code is written in C
having the CC being based on C (C++) is not any disadvantage in the difficulty to create full featured CC, and nothing stops bindings in other languages to be made.
we have experience of making language bindings in many different languages with supernet_api, hardly anybody used these other languages. but nothing stops anybody from doing the same for the CC
tl:dr to have inexperienced weekend coders be able to create a CC in a weekend is not realistic (nor anything that should be desired), but in a weekend you can do "shell scripts" that invoke existing CC and that is 10x to 100x the programmers that can do things at that level


Ocean [av53], ocean, in The Inner Sea
Last updated Turn #138
Ocean [av53], ocean, in The Inner Sea
------------------------------------------------------------------------
13: Pleasure Sloop [v5n], ship, 30 hulls, 1 rowing port, 90 sails, arrived
13: from Brine City [ae4b], owner:
13: Dorothy [v1b], Pen, with one worker, 94 sailors
13: Apollo [b5e], Imperial Empire, with 11 workers, 63 lt. xbowmen,
13: six sailors, accompanied by:
13: Lutra [a4w], Imperial Empire, with 13 paladins, 29 pikemen
13: Hera [g3f], Imperial Empire, with seven soldiers, 42 pikemen
13: Thor [r4g], Imperial Empire, with 43 pikemen
13: Eos [a2t], Imperial Empire, with ten workers, 48 lt. xbowmen
13: Khaki Blazer [w4j], Imperial Empire, with 13 soldiers,
13: six pikemen, 32 lt. foot
13: Banian [e7n], Imperial Empire, duke, the High Priest of the
13: Church of Eres [151], with four soldiers, ten angels
13: Winstin [o7y], Mandor Confederacy, prisoner
13: Merbit [e2m], Mandor Confederacy, prisoner
13: Trokad [m3d], Mandor Confederacy, prisoner
13: White Blazer [f2n], Mandor Confederacy, prisoner
14: Pleasure Sloop [v5n], ship, 30 hulls, 1 rowing port, 90 sails,
14: departed for Ocean [au53].
30: It is no longer windy.
Routes leaving Ocean:
North, to Ocean [au53], 6 days
East, city, to Brine City [ae4b], Imperia, 1 day
East, plain, to Buffalo Plains [av54], Imperia, impassable
South, to Ocean [aw53], 6 days
West, to Ocean [av52], 6 days


WITNESS LIST Elections Committee September 22, 2003-12:00A HB 39 For: Fields, Randall (TASB, Northside ISD) Ogden, Rick (Texas Assoc. of School Boards, Aldine ISD) Winkler, Sarah (Self and TASB, Alief ISD) Against: Lewis, Fred (Campaigns for People) Woodford, Suzy (Common Cause Texas) HB 52 For: Carr, Snapper (Texas Municipal League) Against: Woodford, Suzy (Common Cause Texas) Registering, but not testifying: Against: Lewis, Fred (Campaigns for People)


Mental health is important throughout your entire life. It includes emotional, psychological, and social well-being. It affects the way we think, feel, and act. It also helps determine how we handle stress, relate to others, and make choices. Some factors that contribute to mental health problems are: biological factors, life experience, and family history of mental health problems.  Though we cannot see mental illnesses, that does not mean that they do not exist. Nearly 60% of adults with a mental illness did not recieve mental health services in the previous year. That is a statistic that needs to change, and the first step is becoming educated. Fear of mental illnesses stems from the fear of not knowing. Nothing is more powerful than knowing, and becoming educated will enable you to no longer fear the unknown of mental illness.
Fast Facts About Mental Health
1 in 5 adults has a mental condition.  Suicide is the tenth leading cause of death in the US.
Suicide is the third leading cause of death in youth ages 10-24.
50% of all lifetime cases of mental illness begin by age 14 and 75% by age 24.
What Can I Do?
If You Are Suffering from a Mental Illness:
Seek help.
Recognize that it is not your fault.
Surround yourself with good relationships.
If You Are Supporting Someone with a Mental Illness:
Educate yourself about the illness.
Seek out resources.
Have realistic expectations, and understand recovery and treatment take time.
Septarate the person from the disorder. Love the person.
Understand that the illness of a family memeber is nothing to be ashamed of, and no one is to blame.


Autocomplete
Enables users to quickly find and select from a pre-populated list of values as they type, leveraging searching and filtering.
Official documentation
For more detailed information and examples, see the official documentation: Autocomplete.
How it works
Here's how autocomplete works with Docs UI Kit:
- Docs UI Kit uses third-party jQuery UI autocomplete plugin.
How to use?
Wrap any block in a parent element with an ID or class and add the same ID in the JS init function of the autocomplete.js
plugin.
Copy-paste the stylesheet <link>
into your <head>
to load the CSS.
<link rel="stylesheet" href="../assets/vendor/jquery-ui/themes/base/jquery-ui.min.css">
Copy-paste the following <script>
near the end of your pages under JS Implementing Plugins to enable it.
<script src="../assets/vendor/jquery-ui/jquery-ui.core.min.js"></script>
<script src="../assets/vendor/jquery-ui/ui/widgets/menu.js"></script>
<script src="../assets/vendor/jquery-ui/ui/widgets/mouse.js"></script>
<script src="../assets/vendor/jquery-ui/ui/widgets/autocomplete.js"></script>
Copy-paste the following <script>
near the end of your pages under JS to enable it.
<script src="../assets/js/autocomplete.js"></script>
The results are in a JSON-file. The path to the file is specified in the data attribute (data-url
) of the search input.


Who needs a DNS server at home? Well, guys with a mostly linux ecosystem, tired of calling their servers by IPs, a good Japanese main router that unfortunately lacks that function and who searches for a good excuse to play with Linux. And the additional "performance improvement".
Presentation
Principle
Normally, you LAN/Wifi router does the DHCP and DNS.  And no, I can't flash it with DD-WRT (my other DMZ and else routers are under DD-WRT). And no, I don't want to change if for a newer one because it works perfectly otherwise and I don't want to redo all the settings on a new router. Once it will die of old age yes, but not if I can avoid.
So,there's going to have a small [[Raspi|Raspberry Pi]] connected to the router and it will be the DNS cache and service for the whole home NW. Basically, it will:
* Have fixed well known DNS for the fixed IP in the home network
* Use Google or whatever other DNS service for the rest of the DNS
* Do some caching for the tiny performance improvement (afterall it's here so let's use it)
Solution is according internet to use **dnsmasq**, which is (as per my readings) better in simplicity than **bind** and does all what one need for a home network. So let's give it a try.
Points of interrest
* dnsmasq implementation and config
* [[Raspi]] Zero and an USB ethernet
* Making my life more comfortable
Implementation
Bill of materials
* Raspberry Pi Zero: the best balance between performance (low requirements) and power consumption (low too) so will be gentle with my electricity bill
* USB to Ethernet module: [[http://www.ebay.com/itm/USB-2-0-to-RJ45-LAN-Ethernet-Network-Adapter-For-Apple-Mac-MacBook-Air-Laptop-PC-/172365741860?epid=1985584390&hash=item2821cc7f24:g:pbsAAOSwNRdX9gkq|cheapo eBay]] one needed because Raspi Zero has no onboard ethernet and I have no Raspi 1 free at hand, and any other Rapi (2 or 3) would be an immense overkill
Schematics
Setup
**USB Ethernet**
The one I bought (like 3 USD delivered) is a Kontron DM9601 based one and contrary to what [[http://elinux.org/RPi_USB_Ethernet_adapters|Internet might say]], it works flawlessly so far (now the kernel module was fixed). Just plug it and boum, //eth0// appears in //ifconfig// list.
After that you can turn off the wifi (if Raspi ZeroW) with //sudo ifconfig wlan0 down// (temp fix, TODO add permanent fix here).
**USB OTG on the cheap**
You don't want to pay 77 JPY for a cable delivered? (seriously?) Or you just need to put some USB stuff on your Zero //now//? [[http://www.instructables.com/id/Raspberry-Pi-Zero-OTG-Hack-Add-a-Fullsize-Connecto/|Solder an USB female connector to the solderpads on the bottom]], though only 4 wires you get a regular USB port (not OTG). Did that on mine, D+/D- are a bit close so don't make a solder bridge but that's average solder level job.
* VCC on PP1
* GND on PP6
* D+ on PP22 (green)
* D- on PP23 (white)
//Left cable is for Power (you can see the data wires unplugged) and bottom is the USB de-OTG-ized//
Steps
* **sudo apt-get install dnsutils dnsmasq //htop emacs-nox//**
italic ones are non-mandatory
* **sudo service dnsmasq stop **
* **sudo emacs /etc/dnsmasq.conf**
* Just change one line to tell it to read sub-config files in /etc/dnsmasq.d/
**conf-dir=/etc/dnsmasq.d**
* Make your custom config file in /etc/dnsmasq.d (in my case **local.dnsmasq**)
* Edit your **local.dnsmasq** as below:
# config file for DNSMASQ for home
# Alan 20170818
#
# Taken from https://www.raspberrypi.org/forums/viewtopic.php?t=46154
############################################################################################
## Domain so that all servers are xxxx.at.home
#
domain=at.home
############################################################################################
## File for the named resolutions
#
# Change this line if you want dns to get its upstream servers from
# somewhere other that /etc/resolv.conf
#resolv-file=/etc/resolv.dnsmasq.conf
# ==> don't use the above it doesn't work for forcing some fixed IPs. Use the below **addn-hosts**
# If you don't want dnsmasq to read /etc/hosts, uncomment the
# following line.
#no-hosts
# or if you want it to read another file, as well as /etc/hosts, use
# this.
addn-hosts=/etc/dnsmasq.hosts
############################################################################################
## Fallback DNS servers
#
# Google
server=<IP_ADDRESS>
server=<IP_ADDRESS>
############################################################################################
## Other settings
#
# Max cache size dnsmasq can give us, and we want all of it!
cache-size=10000
# Set this (and domain: see below) if you want to have a domain
# automatically added to simple names in a hosts-file.
expand-hosts
* Make a file **/etc/dnsmasq.hosts** where you will put your custom DNS entries (or you can put it in the //hosts// file of the server, up to you). Format is:
<IP_ADDRESS> fileserver
<IP_ADDRESS> router
* Restart the service **sudo service dnsmasq restart **
* Test with **dig fileserver.at.home** and you should see in the trace <IP_ADDRESS>
* Change the settings of your other PC or router to use your new DNS server and you're good to go.
* Now go to your router and tell it to use your DNS server. Usually it's by editing the list of DNS server (primary & secondary) and/or doing that by domain like with mine where I registered that for whatever "at.home" request, ask my new DNS server.
Setup the DNS server on your Linux
Linux mint 19.2:
* in
/etc/resolv.conf
add at the top
nameserver <IP_ADDRESS>
(the IP of the new DNS server)
* refresh
sudo service networking restart
Done. Except that it will be overwritten. So another option is to add it to
/etc/network/interfaces
and add/complete:
dns-nameservers <IP_ADDRESS> <IP_ADDRESS> <IP_ADDRESS>
After multiple attempts at different options, this one works:
* edit your /etc/systemd/resolved.conf
* set DNS=<IP_ADDRESS> <IP_ADDRESS> <IP_ADDRESS>
in the [Resolved] section
* //sudo service systemd-networkd restart//
* //sudo service systemd-resolved restart//
Pictures
//The final result: the Raspi Zero on the left hotglued on a piece of wood for stress release on the wires, the USB Ethernet adapter on the right (the white thingy with a red light glowing inside) and the main router in the back. The Raspi is powered by the router which has a USB port for external HDD which I didnn't use ... 'till now.//
Links
Helpful sources
* [[https://www.raspberrypi.org/forums/viewtopic.php?t=46154]]
* [[http://www.linux-magazine.com/Issues/2014/159/DHCP-and-DNS-on-Rasp-Pi]]
* [[http://www.pcworld.com/article/3200117/linux/how-to-use-raspberry-pi-as-dns-server-with-dnsmasq.html]]
Inspiration


Bring back my workspace
Add user
You are editing the room
Create Room
Join Room
Add details to enter the room
×
Room Id
User Id
Create Room
×
Room Id
Select Layout
Workstations
Cafeteria
Add User
×
User Id
Built at
@arcesium
Hackathon 2020 in 24 hrs by
@varunkumar
and
@sreekanthnaga


ShareCare provides affordable care at the safety standards of live-in care.
A major driver for the enormous cost of live-in care is that it requires one carer to take care of one customer. However, a live-in carer has up to 60% dead time during a working day.
ShareCare allows two families in the same neighbourhood to share a carer, but provides 24h remote monitoring in order to prevent accidents or adverse events. By leveraging technology, our carers can leave the premises during the "dead time", but will get notified when your loved one requires help and will be on hand to assist.
Costs are lowered considerably, the quality of care is better than even and the safety is at its highest.
We have a strong selection process for finding the best carers and only 2% of the applications we get are accepted in our carers network.
We’re leveraging the latest technology and building partnerships so every family can get affordable, high-quality care.
We empower carers to deliver exceptional care by keeping them informed of changes that happen in the home.
Reach out to us and we’ll respond as soon as possible. We will answer any questions you may have and start searching for a carer that suits your needs.
Choose your prefered carer. Our carers help with Activities of Daily Living (ADLs) like dressing, bathing, meal prep, and medication reminders to keep older adults safe at home.
We use technology that monitors the house and alerts the carer when your loved one requires help. Our technology knows when a person wakes up, wanders, and it can also detect dangerous behaviours, lack of activity or falls. Because we want your loved ones never to feel the carer is not in the house, our system allows two ways communication, so that help can be requested at any time.


a8c Grand Meetup 2018
- Created as "LiveScript" in 1995 for Netscape 2.0 and renamed "JavaScript".
- Competed with other things that make websites move, like Java, Flash, and VBScript.
- Standardized as ECMAScript (ES) in 1997.
- Slowly evolved as ECMAScript 2 (1998), ES 3 (1999).
- Eventually ES5 (2009), then ES2015, ES2016, etc.
How to Eat with Chopsticks
1. Create a list of students
2. Add a student with push
3. Remove the first student
4. Remove the last student
5. Remove the middle student
6. How many students do we have left?
7. [extra credit] Sort the students alphabetically
The `window` object contains all global variables.
`window` lives in the browser context. There is no window in node.
node, however, has `global`.


QueerCon 2015
menu
Home
Workshops
Schedule
Keynote Speaker
Map
QueerCon Who?
Exploring the Nuances of Sexuality & Attraction.


Activation best practices
The Hextrapolate activation system fulfills or exceeds the best practice guidelines for product activation published by the Business Software Alliance:
Respect for Privacy
Activation should not collect or transmit personally identifiable information without the users’ explicit knowledge and should comply with applicable data protection laws.
Ease of Use
Activation methods should not be burdensome to the user. Ideally, they should be limited to a one-time step or process per machine.
Full Disclosure
Publishers should clearly explain the activation process, including the activation data and how it is transmitted, so that users understand how activation works and are assured that their privacy will be respected.
Support
Documentation and access to high quality support should be made available to assist users with activating their product and to answer their questions.
Security
The activation solution should use appropriate security to protect stored and transmitted activation data.
Speed
The activation process should be completed as quickly as possible.
User Control
Activation should empower users to easily move their software program to a new or upgraded computer in a manner authorized by the license agreement.


Galaxie
For a French Media Group,
I have led a great journey
towards unifying design processes, tools as well as
brand experience and identity of multiple products
around a single interactive plateform:
the Design System.


A huge paragraph about this new-fangled web page. And all the trappings.A huge paragraph about this new-fangled web page. And all the trappings.A huge paragraph about this new-fangled web page. And all the trappings.
bio pic
So and so is a great actor with many talents. They have shown themselves to be outstanding in every performance, including walking the dog, taking out the trash and humming.
bio pic
So and so is a great actor with many talents. They have shown themselves to be outstanding in every performance, including walking the dog, taking out the trash and humming.They have shown themselves to be outstanding in every performance, including walking the dog, taking out the trash and humming.
bio pic
So and so is a great actor with many talents. They have shown themselves to be outstanding in every performance, including walking the dog, taking out the trash and humming.
There was soo much text to put in here and just wanted to keep the box the right size. There was soo much text to put in here and just wanted to keep the box the right size. There was soo much text to put in here and just wanted to keep the box the right size. There was soo much text to put in here and just wanted to keep the box the right size. There was soo much text to put in here and just wanted to keep the box the right size. There was soo much text to put in here and just wanted to keep the box the right size. There was soo much text to put in here and just wanted to keep the box the right size. There was soo much text to put in here and just wanted to keep the box the right size.


Irish Wolfhound
| Irish Wolfhound Picture | |
| Breed Information | |
|---|---|
| Popularity | 2017: #732016: #732015: #69 |
| Name | Irish Wolfhound |
| Other names | Cú Faoil |
| Origin | Belgium Ireland |
| Breed Group | Hound (AKC:1897)Sighthounds and Pariahs (UKC) |
| Size | Giant |
| Type | Purebred |
| Life span | 6-10 years |
| Temperament | DignifiedGenerousLoyalPatientSweet-TemperedThoughtfulIntelligent |
| Height | 28-35 inches (71-90 cm) |
| Weight | 90-150 pounds (40-69 kg) |
| Colors | BlackBlueCreamGrayRedSilverWheatenWhite |
| Litter Size | 3-4 puppies |
| Puppy Price | Average $1800 - $2000 USD |
| Breed Characteristics | |
| Adaptability | 4 stars |
| Apartment Friendly | 2 starsThe Irish Wolfhound is not recommended for apartment life. It is relatively inactive indoors and will do best with at least a large yard. This is a giant breed that needs some space. It may not fit well in a small or compact car. |
| Barking Tendencies | 2 starsOccassional |
| Cat Friendly | 3 stars |
| Child Friendly | 4 starsGood with Kids: This is a suitable dog breed for kids. It is also friendly toward other pets and friendly toward strangers. |
| Dog Friendly | 5 stars |
| Exercise Needs | 3 starsThese giant dogs need lots of space to run, but do not need any more exercise than smaller breeds. They need a daily walk where the dog is made to heel beside or behind the human holding the lead. Never in front. Like many other giant breeds it is important to remember that too much forced, vigorous exercise is not good for a young dog's growth and development, so watch your puppy for any signs, but they still instinctually need a daily walk. |
| Grooming | 3 starsModerate Maintenance: Grooming should be performed regularly to keep its fur in good shape. Occasional trimming or stripping needed. |
| Health Issues | 5 starsHypoallergenic: No |
| Intelligence | 4 starsRanking: #41. (See All Rankings) |
| Playfulness | 3 stars |
| Shedding Level | 3 starsModerate Shedding: The double coat sheds moderate amounts year-round but doesn’t go through a heavy annual or biannual shed. A bath is rarely necessary. |
| Stranger Friendly | 3 stars |
| Trainability | 4 starsModerately Easy Training: Training won't require too much attention and effort, though it won't be easier than other breeds. Expect results to come gradually. |
| Watchdog Ability | 3 stars |
| Irish Wolfhound Puppy Picture | ||
| Puppy Names | ||
|---|---|---|
| Rank | Male | Female |
| 01 | Max | Molly |
| 02 | Hunter | Roxy |
| 03 | Bear | Sugar |
| 04 | Tank | Ella |
| 05 | Oliver | Sasha |
| 06 | Jake | Lulu |
| 07 | Luke | Belle |
| 08 | Samson | Winnie |
| 09 | Oscar | Nala |
| 10 | Gizmo | Allie |
| See All Names › |
| Overview |
|---|
|
The tallest of the sighthounds, the Irish wolfhound resembles a rough-coated greyhound, although of more powerful build. Great size is especially valued in the breed. This combination of speed, power and size enables the Irish wolfhound to run down and overpower large prey. Despite its size, the breed should be gracefully built, its gait easy and active, and its head held proudly. The rough coat, which provides protection against the cold and damp, as well as its opponents' teeth, is especially wiry and long over the eyes and under the jaw. Aptly known as the gentle giant, the Irish wolfhound is a soft-natured, easygoing breed. It is calm around the house, sensitive, patient, easygoing and sweet. Despite its great size, it is good with children, pets and other dogs. It is reserved with strangers and courageous when the need arises. |
| History |
| The present-day Irish Wolfhound owes its existence to R.D. Richardson and Captain G.A. Graham who, in the 1840's, helped restore this almost extinct, ancient breed to its former state. The original Irish Wolfhound is thought to be a very ancient breed, being documented as early as 393 A.D. The intelligence, strength and courage of the breed are legendary, and they were valued as guardians, hunters and war dogs. The Irish Wolfhound Club was founded in 1885 and it was recognized by the AKC in 1897. |


backend package¶
Subpackages¶
Submodules¶
backend.admin module¶
backend.apps module¶
backend.conf module¶
backend.forms module¶
-
class
backend.forms.
LiveRoomForm
(data=None, files=None, auto_id='id_%s', prefix=None, initial=None, error_class=<class 'django.forms.utils.ErrorList'>, label_suffix=None, empty_permitted=False, instance=None, use_required_attribute=None)[源代码]¶ Bases:
django.forms.models.ModelForm
-
base_fields
= OrderedDict([('name', <django.forms.fields.CharField object>), ('creator', <django.forms.models.ModelChoiceField object>)])¶
-
declared_fields
= OrderedDict()¶
-
media
¶
-
-
class
backend.forms.
TestForm
(data=None, files=None, auto_id='id_%s', prefix=None, initial=None, error_class=<class 'django.forms.utils.ErrorList'>, label_suffix=None, empty_permitted=False, instance=None, use_required_attribute=None)[源代码]¶ Bases:
django.forms.models.ModelForm
-
base_fields
= OrderedDict([('content', <django.forms.fields.CharField object>)])¶
-
declared_fields
= OrderedDict()¶
-
media
¶
-
-
class
backend.forms.
UserForm
(data=None, files=None, auto_id='id_%s', prefix=None, initial=None, error_class=<class 'django.forms.utils.ErrorList'>, label_suffix=None, empty_permitted=False, instance=None, use_required_attribute=None)[源代码]¶ Bases:
django.forms.models.ModelForm
-
class
Meta
[源代码]¶ Bases:
object
-
fields
= ('username', 'password', 'gender', 'nickname')¶
-
model
¶ User
的别名
-
-
base_fields
= OrderedDict([('username', <django.forms.fields.CharField object>), ('password', <django.forms.fields.CharField object>), ('gender', <django.forms.fields.BooleanField object>), ('nickname', <django.forms.fields.CharField object>)])¶
-
declared_fields
= OrderedDict()¶
-
media
¶
-
class
backend.models module¶
-
class
backend.models.
LiveRoom
(id, name, creator, audience_amount, is_living, create_time, end_time, file_name, slide_path, thumbnail_path)[源代码]¶ Bases:
django.db.models.base.Model
-
exception
DoesNotExist
¶ Bases:
django.core.exceptions.ObjectDoesNotExist
-
exception
MultipleObjectsReturned
¶ Bases:
django.core.exceptions.MultipleObjectsReturned
-
audience_amount
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
create_time
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
creator
¶ Accessor to the related object on the forward side of a many-to-one or one-to-one (via ForwardOneToOneDescriptor subclass) relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
child.parent
is aForwardManyToOneDescriptor
instance.
-
creator_id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
end_time
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
file_name
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
get_next_by_create_time
(*moreargs, **morekwargs)¶
-
get_previous_by_create_time
(*moreargs, **morekwargs)¶
-
id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
is_living
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
name
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
objects
= <backend.models.LiveRoomManager object>¶
-
punishment_set
¶ Accessor to the related objects manager on the reverse side of a many-to-one relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
parent.children
is aReverseManyToOneDescriptor
instance.Most of the implementation is delegated to a dynamically defined manager class built by
create_forward_many_to_many_manager()
defined below.
-
slide_path
¶ The descriptor for the file attribute on the model instance. Returns a FieldFile when accessed so you can do stuff like:
>>> from myapp.models import MyModel >>> instance = MyModel.objects.get(pk=1) >>> instance.file.size
Assigns a file object on assignment so you can do:
>>> with open('/path/to/hello.world', 'r') as f: ... instance.file = File(f)
-
thumbnail_path
¶ Just like the FileDescriptor, but for ImageFields. The only difference is assigning the width/height to the width_field/height_field, if appropriate.
-
exception
-
class
backend.models.
Punishment
(id, room, user, punishment)[源代码]¶ Bases:
django.db.models.base.Model
-
exception
DoesNotExist
¶ Bases:
django.core.exceptions.ObjectDoesNotExist
-
exception
MultipleObjectsReturned
¶ Bases:
django.core.exceptions.MultipleObjectsReturned
-
get_punishment_display
(*moreargs, **morekwargs)¶
-
id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
objects
= <django.db.models.manager.Manager object>¶
-
punishment
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
punishment_choice
= (('K', 'kicked out'), ('S', 'can not speak'))¶
-
room
¶ Accessor to the related object on the forward side of a many-to-one or one-to-one (via ForwardOneToOneDescriptor subclass) relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
child.parent
is aForwardManyToOneDescriptor
instance.
-
room_id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
user
¶ Accessor to the related object on the forward side of a many-to-one or one-to-one (via ForwardOneToOneDescriptor subclass) relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
child.parent
is aForwardManyToOneDescriptor
instance.
-
user_id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
exception
-
class
backend.models.
Test
(id, content)[源代码]¶ Bases:
django.db.models.base.Model
-
exception
DoesNotExist
¶ Bases:
django.core.exceptions.ObjectDoesNotExist
-
exception
MultipleObjectsReturned
¶ Bases:
django.core.exceptions.MultipleObjectsReturned
-
content
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
objects
= <django.db.models.manager.Manager object>¶
-
exception
-
class
backend.models.
User
(id, password, last_login, is_superuser, username, first_name, last_name, is_staff, is_active, email, phone, nickname, date_joined, gender, avatar, role)[源代码]¶ Bases:
django.contrib.auth.models.AbstractUser
-
exception
DoesNotExist
¶ Bases:
django.core.exceptions.ObjectDoesNotExist
-
exception
MultipleObjectsReturned
¶ Bases:
django.core.exceptions.MultipleObjectsReturned
-
avatar
¶ The descriptor for the file attribute on the model instance. Returns a FieldFile when accessed so you can do stuff like:
>>> from myapp.models import MyModel >>> instance = MyModel.objects.get(pk=1) >>> instance.file.size
Assigns a file object on assignment so you can do:
>>> with open('/path/to/hello.world', 'r') as f: ... instance.file = File(f)
-
gender
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
get_next_by_date_joined
(*moreargs, **morekwargs)¶
-
get_previous_by_date_joined
(*moreargs, **morekwargs)¶
-
get_role_display
(*moreargs, **morekwargs)¶
-
groups
¶ Accessor to the related objects manager on the forward and reverse sides of a many-to-many relation.
In the example:
class Pizza(Model): toppings = ManyToManyField(Topping, related_name='pizzas')
pizza.toppings
andtopping.pizzas
areManyToManyDescriptor
instances.Most of the implementation is delegated to a dynamically defined manager class built by
create_forward_many_to_many_manager()
defined below.
-
id
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
liveroom_set
¶ Accessor to the related objects manager on the reverse side of a many-to-one relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
parent.children
is aReverseManyToOneDescriptor
instance.Most of the implementation is delegated to a dynamically defined manager class built by
create_forward_many_to_many_manager()
defined below.
-
logentry_set
¶ Accessor to the related objects manager on the reverse side of a many-to-one relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
parent.children
is aReverseManyToOneDescriptor
instance.Most of the implementation is delegated to a dynamically defined manager class built by
create_forward_many_to_many_manager()
defined below.
-
nickname
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
phone
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
punishment_set
¶ Accessor to the related objects manager on the reverse side of a many-to-one relation.
In the example:
class Child(Model): parent = ForeignKey(Parent, related_name='children')
parent.children
is aReverseManyToOneDescriptor
instance.Most of the implementation is delegated to a dynamically defined manager class built by
create_forward_many_to_many_manager()
defined below.
-
role
¶ A wrapper for a deferred-loading field. When the value is read from this object the first time, the query is executed.
-
role_choices
= (('T', 'teacher'), ('S', 'student'))¶
-
user_permissions
¶ Accessor to the related objects manager on the forward and reverse sides of a many-to-many relation.
In the example:
class Pizza(Model): toppings = ManyToManyField(Topping, related_name='pizzas')
pizza.toppings
andtopping.pizzas
areManyToManyDescriptor
instances.Most of the implementation is delegated to a dynamically defined manager class built by
create_forward_many_to_many_manager()
defined below.
-
exception
backend.tests module¶
-
class
backend.tests.
RoomViewTestCase
(methodName='runTest')[源代码]¶ Bases:
django.test.testcases.TestCase