gbst.plotting module¶
Plotting Library.
-
gbst.plotting.
plot_importance
(booster, ax=None, height=0.2, xlim=None, ylim=None, title='Feature importance', xlabel='F score', ylabel='Features', importance_type='weight', max_num_features=None, grid=True, show_values=True, **kwargs)¶ Plot importance based on fitted trees.
- Parameters
booster (Booster, gbstModel or dict) – Booster or gbstModel instance, or dict taken by Booster.get_fscore()
ax (matplotlib Axes, default None) – Target axes instance. If None, new figure and axes will be created.
grid (bool, Turn the axes grids on or off. Default is True (On)) –
importance_type (str, default "weight") –
How the importance is calculated: either “weight”, “gain”, or “cover”
”weight” is the number of times a feature appears in a tree
”gain” is the average gain of splits which use the feature
”cover” is the average coverage of splits which use the feature where coverage is defined as the number of samples affected by the split
max_num_features (int, default None) – Maximum number of top features displayed on plot. If None, all features will be displayed.
height (float, default 0.2) – Bar height, passed to ax.barh()
xlim (tuple, default None) – Tuple passed to axes.xlim()
ylim (tuple, default None) – Tuple passed to axes.ylim()
title (str, default "Feature importance") – Axes title. To disable, pass None.
xlabel (str, default "F score") – X axis title label. To disable, pass None.
ylabel (str, default "Features") – Y axis title label. To disable, pass None.
show_values (bool, default True) – Show values on plot. To disable, pass False.
kwargs – Other keywords passed to ax.barh()
- Returns
ax
- Return type
matplotlib Axes
-
gbst.plotting.
plot_tree
(booster, fmap='', num_trees=0, rankdir=None, ax=None, **kwargs)¶ Plot specified tree.
- Parameters
booster (Booster, XGBModel) – Booster or XGBModel instance
fmap (str (optional)) – The name of feature map file
num_trees (int, default 0) – Specify the ordinal number of target tree
rankdir (str, default "TB") – Passed to graphiz via graph_attr
ax (matplotlib Axes, default None) – Target axes instance. If None, new figure and axes will be created.
kwargs – Other keywords passed to to_graphviz
- Returns
ax
- Return type
matplotlib Axes
-
gbst.plotting.
to_graphviz
(booster, fmap='', num_trees=0, rankdir=None, yes_color=None, no_color=None, condition_node_params=None, leaf_node_params=None, **kwargs)¶ Convert specified tree to graphviz instance. IPython can automatically plot the returned graphiz instance. Otherwise, you should call .render() method of the returned graphiz instance.
- Parameters
booster (Booster, gbstModel) – Booster or gbstModel instance
fmap (str (optional)) – The name of feature map file
num_trees (int, default 0) – Specify the ordinal number of target tree
rankdir (str, default "UT") – Passed to graphiz via graph_attr
yes_color (str, default '#0000FF') – Edge color when meets the node condition.
no_color (str, default '#FF0000') – Edge color when doesn’t meet the node condition.
condition_node_params (dict (optional)) –
Condition node configuration for for graphviz. Example:
- {‘shape’: ‘box’,
’style’: ‘filled,rounded’, ‘fillcolor’: ‘#78bceb’}
leaf_node_params (dict (optional)) –
Leaf node configuration for graphviz. Example:
- {‘shape’: ‘box’,
’style’: ‘filled’, ‘fillcolor’: ‘#e48038’}
kwargs (Other keywords passed to graphviz graph_attr, E.g.:) –
graph [ {key} = {value} ]
- Returns
graph
- Return type
graphviz.Source


TQ3FisheyeCroppingFormat |
typedef enum TQ3FisheyeCroppingFormat QUESA_ENUM_BASE(TQ3Uns32) { kQ3FisheyeCroppingFormatCircular = 0, kQ3FisheyeCroppingFormatCroppedCircle, kQ3FisheyeCroppingFormatFullFrame, kQ3FisheyeCroppingFormatSize32 = 0x7FFFFFFF } TQ3FisheyeCroppingFormat;
- kQ3FisheyeCroppingFormatCircular
- The fisheye rendering fills a circular area that fits tightly in the smaller view dimension and is centered in the larger view dimension.
- kQ3FisheyeCroppingFormatCroppedCircle
- The circular area of fisheye rendering is tight against the left and right edges of the view, and is cropped on the top and bottom.
- kQ3FisheyeCroppingFormatFullFrame
- The fisheye rendering is cropped so that the view rectangle is totally filled.
TQ3FisheyeMappingFunction |
typedef enum TQ3FisheyeMappingFunction QUESA_ENUM_BASE(TQ3Uns32) { kQ3FisheyeMappingFunctionOrthographic = 0, kQ3FisheyeMappingFunctionStereographic, kQ3FisheyeMappingFunctionEquidistant, kQ3FisheyeMappingFunctionEquisolidAngle, kQ3FisheyeMappingFunctionSize32 = 0x7FFFFFFF } TQ3FisheyeMappingFunction;
The mapping function relates the angle of an incoming light ray to the distance r from the center of the sensor to the image of the ray, taking into account the focal length f.
- kQ3FisheyeMappingFunctionOrthographic
- r = f sin( angle )
Since this function is increasing only up to an angle of pi/2, this kind of fisheye lens cannot have an angle of view greater than pi (180 degrees).- kQ3FisheyeMappingFunctionStereographic
- r = 2 * f * tan( angle/2 )
- kQ3FisheyeMappingFunctionEquidistant
- r = f * angle
- kQ3FisheyeMappingFunctionEquisolidAngle
- r = 2 * f * sin( angle/2 )
© 1999-2023 Quesa Developers (Last Updated 1/27/2023)


View Previous Orders
Using this view you can view all of the previous orders.
Back to previous page
Show Orders
Orders
No. {{x.id}}
Date and Time : {{x.timestamp}}
List of Items
{{y.name}} {{y.age}} {{y.size}} {{y.color}}
@*
*@


jBASE-SQL Server ETL V2.1 Documentation
Doc Version 0.9 - November 2010
Previous Doc Version 0.8 - November 2009
Scripts verified in IE 6/8 and FF 3
Updated for Chrome and >= IE9 - October 2014
QuickStart
Security
Installation
Logging
Utilities
Config Files
Define Select
Define Explode
Counts
Totals
Browser has disabled running scripts detected.
(Note: In order for the webpage to display properly, scripts must be allowed to run.)


Nonprofit program tops 1,000 adoptions from Ohio foster care
by EndPlayCOLUMBUS, Ohio (AP) - A foundation named for one of America's highest profile adopted children says its signature program has topped 1,000 successful adoptions from foster care in Ohio since the program started in 2004.
The Dave Thomas Foundation for Adoption says its Wendy's Wonderful Kids program reached that mark in October. It estimates the program has saved Ohio taxpayers over $64 million by moving children who've waited longest in foster care into adoptive homes.
The initiative partners with the Ohio Department of Job and Family Services and state adoption professionals. It provides funds to adoption agencies to hire recruiters who're focused exclusively on the longest-waiting children in foster care.
The foundation is named for Dave Thomas, who was adopted. He founded the Columbus-based Wendy's fast-food restaurant chain.


Every medium model provides the following constants. For example, if a medium is declared as:
replaceable package Medium = Modelica.Media.Interfaces.PartialMedium;
then constants "Medium.mediumName", "Medium.nX", etc. are defined:
| Type | Name | Description |
| String | mediumName | Unique name of the medium (is usually used to check whether the media in different components connected together are the same, by providing Medium.mediumName as quantity attribute of the mass flow rate in the connector) |
| String | substanceNames[nS] | Names of the substances that make up the medium. If only one substance is present, substanceNames = {mediumName}. |
| String | extraPropertiesNames[nC] | Names of the extra transported substances, outside of mass and energy balances. |
| Boolean | singleState | = true, if u and d are not a function of pressure, and thus only a function of a single thermal variable (temperature or enthalpy) and of Xi for a multiple substance medium. Usually, this flag is true for incompressible media. It is used in a model to determine whether 1+nXi (singleState=true) or 2+nXi (singleState=false) initial conditions have to be provided for a volume element that contains mass and energy balance. |
| AbsolutePressure | reference_p | Reference pressure for the medium |
| MassFraction | reference_X[nX] | Reference composition for the medium |
| AbsolutePressure | p_default | Default value for pressure of medium (for initialization) |
| Temperature | T_default | Default value for temperature of medium (for initialization) |
| SpecificEnthalpy | h_default | Default value for specific enthalpy of medium (for initialization) |
| MassFraction | X_default[nX] | Default value for mass fractions of medium (for initialization) |
| Integer | nS | number of substances contained in the medium. |
| Integer | nX | Size of the full mass fraction vector X nX=nS. |
| Integer | nXi | Number of independent mass fractions. If there is a single substance, then nXi = 0. |
| Boolean | reducedX | = true, if the medium has a single substance,
or if the medium model has multiple substances and contains the
equation sum(X) = 1. In both cases, nXi = nS - 1 (unless fixedX =
true). = false, if the medium has multiple substances and does not contain the equation sum(X)=1, i.e., nXi = nX = nS (unless fixedX = true). |
| Boolean | fixedX | = false: the composition of the medium can
vary, and is determined by nXi independent mass fractions (see
reducedX above). = true: the composition of the medium is always reference_X, and nXi = 0. |
| FluidConstants | fluidConstants[nS] | Critical, triple, molecular and other standard data that are provided for every substance of a medium. |
The record FluidConstants that is defined in PartialMedium contains the following elements
| Type | Name | Description |
| String | iupacName | complete IUPAC name |
| String | casRegistryNumber | chemical abstracts sequencing number |
| String | chemicalFormula | Chemical formula, (brutto, nomenclature according to Hill) |
| String | structureFormula | Chemical structure formula |
| MolarMass | molarMass | molar mass |
This record is extended in the partial packages further down the hierarchy (such as PartialTwoPhaseMedium or PartialMixtureMedium) and may contain some or all of the following elements
| Temperature | criticalTemperature | critical temperature |
| AbsolutePressure | criticalPressure | critical pressure |
| MolarVolume | criticalMolarVolume | critical molar Volume |
| Real | acentricFactor | Pitzer acentric factor |
| Temperature | triplePointTemperature | triple point temperature |
| AbsolutePressure | triplePointPressure | triple point pressure |
| Temperature | meltingPoint | melting point at 101325 Pa |
| Temperature | normalBoilingPoint | normal boiling point (at 101325 Pa) |
| DipoleMoment | dipoleMoment | dipole moment of molecule in Debye (1 debye = 3.33564e10-30 C.m) |
| Boolean | hasIdealGasHeatCapacity | true if ideal gas heat capacity is available |
| Boolean | hasCriticalData | true if critical data are known |
| Boolean | hasDipoleMoment | true if a dipole moment known |
| Boolean | hasFundamentalEquation | true if a fundamental equation |
| Boolean | hasLiquidHeatCapacity | true if liquid heat capacity is available |
| Boolean | hasSolidHeatCapacity | true if solid heat capacity is available |
| Boolean | hasAccurateViscosityData | true if accurate data for a viscosity function is available |
| Boolean | hasAccurateConductivityData | true if accurate data for thermal conductivity is available |
| Boolean | hasVapourPressureCurve | true if vapour pressure data, e.g., Antoine coefficients are known |
| Boolean | hasAcentricFactor | true if Pitzer acentric factor is known |
| SpecificEnthalpy | HCRIT0 | Critical specific enthalpy of the fundamental equation |
| SpecificEntropy | SCRIT0 | Critical specific entropy of the fundamental equation |
| SpecificEnthalpy | deltah | Difference between specific enthalpy model (h_m) and f.eq. (h_f) (h_m - h_f) |
| SpecificEntropy | deltas | Difference between specific enthalpy model (s_m) and f.eq. (s_f) (s_m - s_f) |


References
scripts
| summary | ||
| public |
T CanvasRecorder(htmlElement: HTMLElement, config: object): * CanvasRecorder is a standalone class used by RecordRTC to bring HTML5-Canvas recording into video WebM. |
|
| public |
T GetRecorderType(mediaStream: MediaStream, config: object): * GetRecorderType is an inner/private helper for RecordRTC. |
|
| public |
T GifRecorder(mediaStream: MediaStream, config: object): * GifRecorder is standalone calss used by RecordRTC to record video or canvas into animated gif. |
|
| public |
T MRecordRTC(mediaStream: MediaStream): * MRecordRTC runs on top of RecordRTC to bring multiple recordings in a single place, by providing simple API. |
|
| public |
T MediaStreamRecorder(mediaStream: MediaStream, config: object): * MediaStreamRecorder is an abstraction layer for "MediaRecorder API". |
|
| public |
{@link https://github.com/muaz-khan/RecordRTC|RecordRTC} is a JavaScript-based media-recording library for modern web-browsers (supporting WebRTC getUserMedia API). |
|
| public |
T RecordRTCConfiguration(mediaStream: MediaStream, config: object): * RecordRTCConfiguration is an inner/private helper for RecordRTC. |
|
| public |
T StereoAudioRecorder(mediaStream: MediaStream, config: object): * StereoAudioRecorder is a standalone class used by RecordRTC to bring "stereo" audio-recording in chrome. |
|
| public |
T Whammy: * Whammy is a standalone class used by RecordRTC to bring video recording in Chrome. |
|
| public |
T WhammyRecorder(mediaStream: MediaStream, config: object): * WhammyRecorder is a standalone class used by RecordRTC to bring video recording in Chrome. |
|
| public |
T createFileSharingDiv(config: object): * createFileSharingDiv is an inner/private helper for RecordRTC. |
|
| private |
T _turn.js: * |


|
OpenCV 3.0.0-rc1 | |||||||
| PREV NEXT | FRAMES NO FRAMES |
| org.opencv.* |
|---|
| org.opencv.android.CameraBridgeViewBase | ||
|---|---|---|
public static final int |
CAMERA_ID_ANY |
-1 |
public static final int |
CAMERA_ID_BACK |
99 |
public static final int |
CAMERA_ID_FRONT |
98 |
| org.opencv.android.InstallCallbackInterface | ||
|---|---|---|
public static final int |
INSTALLATION_PROGRESS |
1 |
public static final int |
NEW_INSTALLATION |
0 |
| org.opencv.android.LoaderCallbackInterface | ||
|---|---|---|
public static final int |
INCOMPATIBLE_MANAGER_VERSION |
4 |
public static final int |
INIT_FAILED |
255 |
public static final int |
INSTALL_CANCELED |
3 |
public static final int |
MARKET_ERROR |
2 |
public static final int |
SUCCESS |
0 |
| org.opencv.android.NativeCameraView | ||
|---|---|---|
public static final java.lang.String |
TAG |
"NativeCameraView" |
| org.opencv.android.OpenCVLoader | ||
|---|---|---|
public static final java.lang.String |
OPENCV_VERSION_2_4_10 |
"2.4.10" |
public static final java.lang.String |
OPENCV_VERSION_2_4_11 |
"2.4.11" |
public static final java.lang.String |
OPENCV_VERSION_2_4_2 |
"2.4.2" |
public static final java.lang.String |
OPENCV_VERSION_2_4_3 |
"2.4.3" |
public static final java.lang.String |
OPENCV_VERSION_2_4_4 |
"2.4.4" |
public static final java.lang.String |
OPENCV_VERSION_2_4_5 |
"2.4.5" |
public static final java.lang.String |
OPENCV_VERSION_2_4_6 |
"2.4.6" |
public static final java.lang.String |
OPENCV_VERSION_2_4_7 |
"2.4.7" |
public static final java.lang.String |
OPENCV_VERSION_2_4_8 |
"2.4.8" |
public static final java.lang.String |
OPENCV_VERSION_2_4_9 |
"2.4.9" |
public static final java.lang.String |
OPENCV_VERSION_3_0_0 |
"3.0.0" |
| org.opencv.calib3d.Calib3d | ||
|---|---|---|
public static final int |
CALIB_CB_ADAPTIVE_THRESH |
1 |
public static final int |
CALIB_CB_ASYMMETRIC_GRID |
2 |
public static final int |
CALIB_CB_CLUSTERING |
4 |
public static final int |
CALIB_CB_FAST_CHECK |
8 |
public static final int |
CALIB_CB_FILTER_QUADS |
4 |
public static final int |
CALIB_CB_NORMALIZE_IMAGE |
2 |
public static final int |
CALIB_CB_SYMMETRIC_GRID |
1 |
public static final int |
CALIB_CHECK_COND |
4 |
public static final int |
CALIB_FIX_ASPECT_RATIO |
2 |
public static final int |
CALIB_FIX_FOCAL_LENGTH |
16 |
public static final int |
CALIB_FIX_INTRINSIC |
256 |
public static final int |
CALIB_FIX_K1 |
16 |
public static final int |
CALIB_FIX_K2 |
32 |
public static final int |
CALIB_FIX_K3 |
64 |
public static final int |
CALIB_FIX_K4 |
128 |
public static final int |
CALIB_FIX_K5 |
4096 |
public static final int |
CALIB_FIX_K6 |
8192 |
public static final int |
CALIB_FIX_PRINCIPAL_POINT |
4 |
public static final int |
CALIB_FIX_S1_S2_S3_S4 |
65536 |
public static final int |
CALIB_FIX_SKEW |
8 |
public static final int |
CALIB_RATIONAL_MODEL |
16384 |
public static final int |
CALIB_RECOMPUTE_EXTRINSIC |
2 |
public static final int |
CALIB_SAME_FOCAL_LENGTH |
512 |
public static final int |
CALIB_THIN_PRISM_MODEL |
32768 |
public static final int |
CALIB_USE_INTRINSIC_GUESS |
1 |
public static final int |
CALIB_ZERO_DISPARITY |
1024 |
public static final int |
CALIB_ZERO_TANGENT_DIST |
8 |
public static final int |
CV_DLS |
3 |
public static final int |
CV_EPNP |
1 |
public static final int |
CV_ITERATIVE |
0 |
public static final int |
CV_P3P |
2 |
public static final int |
FM_7POINT |
1 |
public static final int |
FM_8POINT |
2 |
public static final int |
FM_LMEDS |
4 |
public static final int |
FM_RANSAC |
8 |
public static final int |
LMEDS |
4 |
public static final int |
RANSAC |
8 |
public static final int |
RHO |
16 |
public static final int |
SOLVEPNP_DLS |
3 |
public static final int |
SOLVEPNP_EPNP |
1 |
public static final int |
SOLVEPNP_ITERATIVE |
0 |
public static final int |
SOLVEPNP_P3P |
2 |
public static final int |
SOLVEPNP_UPNP |
4 |
| org.opencv.calib3d.StereoBM | ||
|---|---|---|
public static final int |
PREFILTER_NORMALIZED_RESPONSE |
0 |
public static final int |
PREFILTER_XSOBEL |
1 |
| org.opencv.calib3d.StereoMatcher | ||
|---|---|---|
public static final int |
DISP_SCALE |
16 |
public static final int |
DISP_SHIFT |
4 |
| org.opencv.calib3d.StereoSGBM | ||
|---|---|---|
public static final int |
MODE_HH |
1 |
public static final int |
MODE_SGBM |
0 |
| org.opencv.core.Core | ||
|---|---|---|
public static final int |
BadAlign |
-21 |
public static final int |
BadAlphaChannel |
-18 |
public static final int |
BadCallBack |
-22 |
public static final int |
BadCOI |
-24 |
public static final int |
BadDataPtr |
-12 |
public static final int |
BadDepth |
-17 |
public static final int |
BadImageSize |
-10 |
public static final int |
BadModelOrChSeq |
-14 |
public static final int |
BadNumChannel1U |
-16 |
public static final int |
BadNumChannels |
-15 |
public static final int |
BadOffset |
-11 |
public static final int |
BadOrder |
-19 |
public static final int |
BadOrigin |
-20 |
public static final int |
BadROISize |
-25 |
public static final int |
BadStep |
-13 |
public static final int |
BadTileSize |
-23 |
public static final int |
BORDER_CONSTANT |
0 |
public static final int |
BORDER_DEFAULT |
4 |
public static final int |
BORDER_ISOLATED |
16 |
public static final int |
BORDER_REFLECT |
2 |
public static final int |
BORDER_REFLECT_101 |
4 |
public static final int |
BORDER_REFLECT101 |
4 |
public static final int |
BORDER_REPLICATE |
1 |
public static final int |
BORDER_TRANSPARENT |
5 |
public static final int |
BORDER_WRAP |
3 |
public static final int |
CMP_EQ |
0 |
public static final int |
CMP_GE |
2 |
public static final int |
CMP_GT |
1 |
public static final int |
CMP_LE |
4 |
public static final int |
CMP_LT |
3 |
public static final int |
CMP_NE |
5 |
public static final int |
COVAR_COLS |
16 |
public static final int |
COVAR_NORMAL |
1 |
public static final int |
COVAR_ROWS |
8 |
public static final int |
COVAR_SCALE |
4 |
public static final int |
COVAR_SCRAMBLED |
0 |
public static final int |
COVAR_USE_AVG |
2 |
public static final int |
CPU_AVX |
10 |
public static final int |
CPU_AVX_512BW |
14 |
public static final int |
CPU_AVX_512CD |
15 |
public static final int |
CPU_AVX_512DQ |
16 |
public static final int |
CPU_AVX_512ER |
17 |
public static final int |
CPU_AVX_512F |
13 |
public static final int |
CPU_AVX_512IFMA512 |
18 |
public static final int |
CPU_AVX_512PF |
19 |
public static final int |
CPU_AVX_512VBMI |
20 |
public static final int |
CPU_AVX_512VL |
21 |
public static final int |
CPU_AVX2 |
11 |
public static final int |
CPU_FMA3 |
12 |
public static final int |
CPU_MMX |
1 |
public static final int |
CPU_NEON |
100 |
public static final int |
CPU_POPCNT |
8 |
public static final int |
CPU_SSE |
2 |
public static final int |
CPU_SSE2 |
3 |
public static final int |
CPU_SSE3 |
4 |
public static final int |
CPU_SSE4_1 |
6 |
public static final int |
CPU_SSE4_2 |
7 |
public static final int |
CPU_SSSE3 |
5 |
public static final int |
DCT_INVERSE |
1 |
public static final int |
DCT_ROWS |
4 |
public static final int |
DECOMP_CHOLESKY |
3 |
public static final int |
DECOMP_EIG |
2 |
public static final int |
DECOMP_LU |
0 |
public static final int |
DECOMP_NORMAL |
16 |
public static final int |
DECOMP_QR |
4 |
public static final int |
DECOMP_SVD |
1 |
public static final int |
DFT_COMPLEX_OUTPUT |
16 |
public static final int |
DFT_INVERSE |
1 |
public static final int |
DFT_REAL_OUTPUT |
32 |
public static final int |
DFT_ROWS |
4 |
public static final int |
DFT_SCALE |
2 |
public static final int |
FILLED |
-1 |
public static final int |
FONT_HERSHEY_COMPLEX |
3 |
public static final int |
FONT_HERSHEY_COMPLEX_SMALL |
5 |
public static final int |
FONT_HERSHEY_DUPLEX |
2 |
public static final int |
FONT_HERSHEY_PLAIN |
1 |
public static final int |
FONT_HERSHEY_SCRIPT_COMPLEX |
7 |
public static final int |
FONT_HERSHEY_SCRIPT_SIMPLEX |
6 |
public static final int |
FONT_HERSHEY_SIMPLEX |
0 |
public static final int |
FONT_HERSHEY_TRIPLEX |
4 |
public static final int |
FONT_ITALIC |
16 |
public static final int |
GEMM_1_T |
1 |
public static final int |
GEMM_2_T |
2 |
public static final int |
GEMM_3_T |
4 |
public static final int |
GpuApiCallError |
-217 |
public static final int |
GpuNotSupported |
-216 |
public static final int |
HeaderIsNull |
-9 |
public static final int |
KMEANS_PP_CENTERS |
2 |
public static final int |
KMEANS_RANDOM_CENTERS |
0 |
public static final int |
KMEANS_USE_INITIAL_LABELS |
1 |
public static final int |
LINE_4 |
4 |
public static final int |
LINE_8 |
8 |
public static final int |
LINE_AA |
16 |
public static final int |
MaskIsTiled |
-26 |
public static final int |
NORM_HAMMING |
6 |
public static final int |
NORM_HAMMING2 |
7 |
public static final int |
NORM_INF |
1 |
public static final int |
NORM_L1 |
2 |
public static final int |
NORM_L2 |
4 |
public static final int |
NORM_L2SQR |
5 |
public static final int |
NORM_MINMAX |
32 |
public static final int |
NORM_RELATIVE |
8 |
public static final int |
NORM_TYPE_MASK |
7 |
public static final int |
OpenCLApiCallError |
-220 |
public static final int |
OpenCLDoubleNotSupported |
-221 |
public static final int |
OpenCLInitError |
-222 |
public static final int |
OpenCLNoAMDBlasFft |
-223 |
public static final int |
OpenGlApiCallError |
-219 |
public static final int |
OpenGlNotSupported |
-218 |
public static final int |
REDUCE_AVG |
1 |
public static final int |
REDUCE_MAX |
2 |
public static final int |
REDUCE_MIN |
3 |
public static final int |
REDUCE_SUM |
0 |
public static final int |
SORT_ASCENDING |
0 |
public static final int |
SORT_DESCENDING |
16 |
public static final int |
SORT_EVERY_COLUMN |
1 |
public static final int |
SORT_EVERY_ROW |
0 |
public static final int |
StsAssert |
-215 |
public static final int |
StsAutoTrace |
-8 |
public static final int |
StsBackTrace |
-1 |
public static final int |
StsBadArg |
-5 |
public static final int |
StsBadFlag |
-206 |
public static final int |
StsBadFunc |
-6 |
public static final int |
StsBadMask |
-208 |
public static final int |
StsBadMemBlock |
-214 |
public static final int |
StsBadPoint |
-207 |
public static final int |
StsBadSize |
-201 |
public static final int |
StsDivByZero |
-202 |
public static final int |
StsError |
-2 |
public static final int |
StsFilterOffsetErr |
-31 |
public static final int |
StsFilterStructContentErr |
-29 |
public static final int |
StsInplaceNotSupported |
-203 |
public static final int |
StsInternal |
-3 |
public static final int |
StsKernelStructContentErr |
-30 |
public static final int |
StsNoConv |
-7 |
public static final int |
StsNoMem |
-4 |
public static final int |
StsNotImplemented |
-213 |
public static final int |
StsNullPtr |
-27 |
public static final int |
StsObjectNotFound |
-204 |
public static final int |
StsOk |
0 |
public static final int |
StsOutOfRange |
-211 |
public static final int |
StsParseError |
-212 |
public static final int |
StsUnmatchedFormats |
-205 |
public static final int |
StsUnmatchedSizes |
-209 |
public static final int |
StsUnsupportedFormat |
-210 |
public static final int |
StsVecLengthErr |
-28 |
public static final int |
SVD_FULL_UV |
4 |
public static final int |
SVD_MODIFY_A |
1 |
public static final int |
SVD_NO_UV |
2 |
| org.opencv.core.CvType | ||
|---|---|---|
public static final int |
CV_16S |
3 |
public static final int |
CV_16U |
2 |
public static final int |
CV_32F |
5 |
public static final int |
CV_32S |
4 |
public static final int |
CV_64F |
6 |
public static final int |
CV_8S |
1 |
public static final int |
CV_8U |
0 |
public static final int |
CV_USRTYPE1 |
7 |
| org.opencv.core.TermCriteria | ||
|---|---|---|
public static final int |
COUNT |
1 |
public static final int |
EPS |
2 |
public static final int |
MAX_ITER |
1 |
| org.opencv.features2d.DescriptorExtractor | ||
|---|---|---|
public static final int |
AKAZE |
7 |
public static final int |
BRIEF |
4 |
public static final int |
BRISK |
5 |
public static final int |
FREAK |
6 |
public static final int |
OPPONENT_AKAZE |
1007 |
public static final int |
OPPONENT_BRIEF |
1004 |
public static final int |
OPPONENT_BRISK |
1005 |
public static final int |
OPPONENT_FREAK |
1006 |
public static final int |
OPPONENT_ORB |
1003 |
public static final int |
OPPONENT_SIFT |
1001 |
public static final int |
OPPONENT_SURF |
1002 |
public static final int |
ORB |
3 |
public static final int |
SIFT |
1 |
public static final int |
SURF |
2 |
| org.opencv.features2d.DescriptorMatcher | ||
|---|---|---|
public static final int |
BRUTEFORCE |
2 |
public static final int |
BRUTEFORCE_HAMMING |
4 |
public static final int |
BRUTEFORCE_HAMMINGLUT |
5 |
public static final int |
BRUTEFORCE_L1 |
3 |
public static final int |
BRUTEFORCE_SL2 |
6 |
public static final int |
FLANNBASED |
1 |
| org.opencv.features2d.FeatureDetector | ||
|---|---|---|
public static final int |
AKAZE |
12 |
public static final int |
BRISK |
11 |
public static final int |
DENSE |
10 |
public static final int |
DYNAMIC_AKAZE |
3012 |
public static final int |
DYNAMIC_BRISK |
3011 |
public static final int |
DYNAMIC_DENSE |
3010 |
public static final int |
DYNAMIC_FAST |
3001 |
public static final int |
DYNAMIC_GFTT |
3007 |
public static final int |
DYNAMIC_HARRIS |
3008 |
public static final int |
DYNAMIC_MSER |
3006 |
public static final int |
DYNAMIC_ORB |
3005 |
public static final int |
DYNAMIC_SIFT |
3003 |
public static final int |
DYNAMIC_SIMPLEBLOB |
3009 |
public static final int |
DYNAMIC_STAR |
3002 |
public static final int |
DYNAMIC_SURF |
3004 |
public static final int |
FAST |
1 |
public static final int |
GFTT |
7 |
public static final int |
GRID_AKAZE |
1012 |
public static final int |
GRID_BRISK |
1011 |
public static final int |
GRID_DENSE |
1010 |
public static final int |
GRID_FAST |
1001 |
public static final int |
GRID_GFTT |
1007 |
public static final int |
GRID_HARRIS |
1008 |
public static final int |
GRID_MSER |
1006 |
public static final int |
GRID_ORB |
1005 |
public static final int |
GRID_SIFT |
1003 |
public static final int |
GRID_SIMPLEBLOB |
1009 |
public static final int |
GRID_STAR |
1002 |
public static final int |
GRID_SURF |
1004 |
public static final int |
HARRIS |
8 |
public static final int |
MSER |
6 |
public static final int |
ORB |
5 |
public static final int |
PYRAMID_AKAZE |
2012 |
public static final int |
PYRAMID_BRISK |
2011 |
public static final int |
PYRAMID_DENSE |
2010 |
public static final int |
PYRAMID_FAST |
2001 |
public static final int |
PYRAMID_GFTT |
2007 |
public static final int |
PYRAMID_HARRIS |
2008 |
public static final int |
PYRAMID_MSER |
2006 |
public static final int |
PYRAMID_ORB |
2005 |
public static final int |
PYRAMID_SIFT |
2003 |
public static final int |
PYRAMID_SIMPLEBLOB |
2009 |
public static final int |
PYRAMID_STAR |
2002 |
public static final int |
PYRAMID_SURF |
2004 |
public static final int |
SIFT |
3 |
public static final int |
SIMPLEBLOB |
9 |
public static final int |
STAR |
2 |
public static final int |
SURF |
4 |
| org.opencv.features2d.Features2d | ||
|---|---|---|
public static final int |
DRAW_OVER_OUTIMG |
1 |
public static final int |
DRAW_RICH_KEYPOINTS |
4 |
public static final int |
NOT_DRAW_SINGLE_POINTS |
2 |
| org.opencv.imgproc.Imgproc | ||
|---|---|---|
public static final int |
ADAPTIVE_THRESH_GAUSSIAN_C |
1 |
public static final int |
ADAPTIVE_THRESH_MEAN_C |
0 |
public static final int |
CC_STAT_AREA |
4 |
public static final int |
CC_STAT_HEIGHT |
3 |
public static final int |
CC_STAT_LEFT |
0 |
public static final int |
CC_STAT_MAX |
5 |
public static final int |
CC_STAT_TOP |
1 |
public static final int |
CC_STAT_WIDTH |
2 |
public static final int |
CHAIN_APPROX_NONE |
1 |
public static final int |
CHAIN_APPROX_SIMPLE |
2 |
public static final int |
CHAIN_APPROX_TC89_KCOS |
4 |
public static final int |
CHAIN_APPROX_TC89_L1 |
3 |
public static final int |
COLOR_BayerBG2BGR |
46 |
public static final int |
COLOR_BayerBG2BGR_EA |
135 |
public static final int |
COLOR_BayerBG2BGR_VNG |
62 |
public static final int |
COLOR_BayerBG2GRAY |
86 |
public static final int |
COLOR_BayerBG2RGB |
48 |
public static final int |
COLOR_BayerBG2RGB_EA |
137 |
public static final int |
COLOR_BayerBG2RGB_VNG |
64 |
public static final int |
COLOR_BayerGB2BGR |
47 |
public static final int |
COLOR_BayerGB2BGR_EA |
136 |
public static final int |
COLOR_BayerGB2BGR_VNG |
63 |
public static final int |
COLOR_BayerGB2GRAY |
87 |
public static final int |
COLOR_BayerGB2RGB |
49 |
public static final int |
COLOR_BayerGB2RGB_EA |
138 |
public static final int |
COLOR_BayerGB2RGB_VNG |
65 |
public static final int |
COLOR_BayerGR2BGR |
49 |
public static final int |
COLOR_BayerGR2BGR_EA |
138 |
public static final int |
COLOR_BayerGR2BGR_VNG |
65 |
public static final int |
COLOR_BayerGR2GRAY |
89 |
public static final int |
COLOR_BayerGR2RGB |
47 |
public static final int |
COLOR_BayerGR2RGB_EA |
136 |
public static final int |
COLOR_BayerGR2RGB_VNG |
63 |
public static final int |
COLOR_BayerRG2BGR |
48 |
public static final int |
COLOR_BayerRG2BGR_EA |
137 |
public static final int |
COLOR_BayerRG2BGR_VNG |
64 |
public static final int |
COLOR_BayerRG2GRAY |
88 |
public static final int |
COLOR_BayerRG2RGB |
46 |
public static final int |
COLOR_BayerRG2RGB_EA |
135 |
public static final int |
COLOR_BayerRG2RGB_VNG |
62 |
public static final int |
COLOR_BGR2BGR555 |
22 |
public static final int |
COLOR_BGR2BGR565 |
12 |
public static final int |
COLOR_BGR2BGRA |
0 |
public static final int |
COLOR_BGR2GRAY |
6 |
public static final int |
COLOR_BGR2HLS |
52 |
public static final int |
COLOR_BGR2HLS_FULL |
68 |
public static final int |
COLOR_BGR2HSV |
40 |
public static final int |
COLOR_BGR2HSV_FULL |
66 |
public static final int |
COLOR_BGR2Lab |
44 |
public static final int |
COLOR_BGR2Luv |
50 |
public static final int |
COLOR_BGR2RGB |
4 |
public static final int |
COLOR_BGR2RGBA |
2 |
public static final int |
COLOR_BGR2XYZ |
32 |
public static final int |
COLOR_BGR2YCrCb |
36 |
public static final int |
COLOR_BGR2YUV |
82 |
public static final int |
COLOR_BGR2YUV_I420 |
128 |
public static final int |
COLOR_BGR2YUV_IYUV |
128 |
public static final int |
COLOR_BGR2YUV_YV12 |
132 |
public static final int |
COLOR_BGR5552BGR |
24 |
public static final int |
COLOR_BGR5552BGRA |
28 |
public static final int |
COLOR_BGR5552GRAY |
31 |
public static final int |
COLOR_BGR5552RGB |
25 |
public static final int |
COLOR_BGR5552RGBA |
29 |
public static final int |
COLOR_BGR5652BGR |
14 |
public static final int |
COLOR_BGR5652BGRA |
18 |
public static final int |
COLOR_BGR5652GRAY |
21 |
public static final int |
COLOR_BGR5652RGB |
15 |
public static final int |
COLOR_BGR5652RGBA |
19 |
public static final int |
COLOR_BGRA2BGR |
1 |
public static final int |
COLOR_BGRA2BGR555 |
26 |
public static final int |
COLOR_BGRA2BGR565 |
16 |
public static final int |
COLOR_BGRA2GRAY |
10 |
public static final int |
COLOR_BGRA2RGB |
3 |
public static final int |
COLOR_BGRA2RGBA |
5 |
public static final int |
COLOR_BGRA2YUV_I420 |
130 |
public static final int |
COLOR_BGRA2YUV_IYUV |
130 |
public static final int |
COLOR_BGRA2YUV_YV12 |
134 |
public static final int |
COLOR_COLORCVT_MAX |
139 |
public static final int |
COLOR_GRAY2BGR |
8 |
public static final int |
COLOR_GRAY2BGR555 |
30 |
public static final int |
COLOR_GRAY2BGR565 |
20 |
public static final int |
COLOR_GRAY2BGRA |
9 |
public static final int |
COLOR_GRAY2RGB |
8 |
public static final int |
COLOR_GRAY2RGBA |
9 |
public static final int |
COLOR_HLS2BGR |
60 |
public static final int |
COLOR_HLS2BGR_FULL |
72 |
public static final int |
COLOR_HLS2RGB |
61 |
public static final int |
COLOR_HLS2RGB_FULL |
73 |
public static final int |
COLOR_HSV2BGR |
54 |
public static final int |
COLOR_HSV2BGR_FULL |
70 |
public static final int |
COLOR_HSV2RGB |
55 |
public static final int |
COLOR_HSV2RGB_FULL |
71 |
public static final int |
COLOR_Lab2BGR |
56 |
public static final int |
COLOR_Lab2LBGR |
78 |
public static final int |
COLOR_Lab2LRGB |
79 |
public static final int |
COLOR_Lab2RGB |
57 |
public static final int |
COLOR_LBGR2Lab |
74 |
public static final int |
COLOR_LBGR2Luv |
76 |
public static final int |
COLOR_LRGB2Lab |
75 |
public static final int |
COLOR_LRGB2Luv |
77 |
public static final int |
COLOR_Luv2BGR |
58 |
public static final int |
COLOR_Luv2LBGR |
80 |
public static final int |
COLOR_Luv2LRGB |
81 |
public static final int |
COLOR_Luv2RGB |
59 |
public static final int |
COLOR_mRGBA2RGBA |
126 |
public static final int |
COLOR_RGB2BGR |
4 |
public static final int |
COLOR_RGB2BGR555 |
23 |
public static final int |
COLOR_RGB2BGR565 |
13 |
public static final int |
COLOR_RGB2BGRA |
2 |
public static final int |
COLOR_RGB2GRAY |
7 |
public static final int |
COLOR_RGB2HLS |
53 |
public static final int |
COLOR_RGB2HLS_FULL |
69 |
public static final int |
COLOR_RGB2HSV |
41 |
public static final int |
COLOR_RGB2HSV_FULL |
67 |
public static final int |
COLOR_RGB2Lab |
45 |
public static final int |
COLOR_RGB2Luv |
51 |
public static final int |
COLOR_RGB2RGBA |
0 |
public static final int |
COLOR_RGB2XYZ |
33 |
public static final int |
COLOR_RGB2YCrCb |
37 |
public static final int |
COLOR_RGB2YUV |
83 |
public static final int |
COLOR_RGB2YUV_I420 |
127 |
public static final int |
COLOR_RGB2YUV_IYUV |
127 |
public static final int |
COLOR_RGB2YUV_YV12 |
131 |
public static final int |
COLOR_RGBA2BGR |
3 |
public static final int |
COLOR_RGBA2BGR555 |
27 |
public static final int |
COLOR_RGBA2BGR565 |
17 |
public static final int |
COLOR_RGBA2BGRA |
5 |
public static final int |
COLOR_RGBA2GRAY |
11 |
public static final int |
COLOR_RGBA2mRGBA |
125 |
public static final int |
COLOR_RGBA2RGB |
1 |
public static final int |
COLOR_RGBA2YUV_I420 |
129 |
public static final int |
COLOR_RGBA2YUV_IYUV |
129 |
public static final int |
COLOR_RGBA2YUV_YV12 |
133 |
public static final int |
COLOR_XYZ2BGR |
34 |
public static final int |
COLOR_XYZ2RGB |
35 |
public static final int |
COLOR_YCrCb2BGR |
38 |
public static final int |
COLOR_YCrCb2RGB |
39 |
public static final int |
COLOR_YUV2BGR |
84 |
public static final int |
COLOR_YUV2BGR_I420 |
101 |
public static final int |
COLOR_YUV2BGR_IYUV |
101 |
public static final int |
COLOR_YUV2BGR_NV12 |
91 |
public static final int |
COLOR_YUV2BGR_NV21 |
93 |
public static final int |
COLOR_YUV2BGR_UYNV |
108 |
public static final int |
COLOR_YUV2BGR_UYVY |
108 |
public static final int |
COLOR_YUV2BGR_Y422 |
108 |
public static final int |
COLOR_YUV2BGR_YUNV |
116 |
public static final int |
COLOR_YUV2BGR_YUY2 |
116 |
public static final int |
COLOR_YUV2BGR_YUYV |
116 |
public static final int |
COLOR_YUV2BGR_YV12 |
99 |
public static final int |
COLOR_YUV2BGR_YVYU |
118 |
public static final int |
COLOR_YUV2BGRA_I420 |
105 |
public static final int |
COLOR_YUV2BGRA_IYUV |
105 |
public static final int |
COLOR_YUV2BGRA_NV12 |
95 |
public static final int |
COLOR_YUV2BGRA_NV21 |
97 |
public static final int |
COLOR_YUV2BGRA_UYNV |
112 |
public static final int |
COLOR_YUV2BGRA_UYVY |
112 |
public static final int |
COLOR_YUV2BGRA_Y422 |
112 |
public static final int |
COLOR_YUV2BGRA_YUNV |
120 |
public static final int |
COLOR_YUV2BGRA_YUY2 |
120 |
public static final int |
COLOR_YUV2BGRA_YUYV |
120 |
public static final int |
COLOR_YUV2BGRA_YV12 |
103 |
public static final int |
COLOR_YUV2BGRA_YVYU |
122 |
public static final int |
COLOR_YUV2GRAY_420 |
106 |
public static final int |
COLOR_YUV2GRAY_I420 |
106 |
public static final int |
COLOR_YUV2GRAY_IYUV |
106 |
public static final int |
COLOR_YUV2GRAY_NV12 |
106 |
public static final int |
COLOR_YUV2GRAY_NV21 |
106 |
public static final int |
COLOR_YUV2GRAY_UYNV |
123 |
public static final int |
COLOR_YUV2GRAY_UYVY |
123 |
public static final int |
COLOR_YUV2GRAY_Y422 |
123 |
public static final int |
COLOR_YUV2GRAY_YUNV |
124 |
public static final int |
COLOR_YUV2GRAY_YUY2 |
124 |
public static final int |
COLOR_YUV2GRAY_YUYV |
124 |
public static final int |
COLOR_YUV2GRAY_YV12 |
106 |
public static final int |
COLOR_YUV2GRAY_YVYU |
124 |
public static final int |
COLOR_YUV2RGB |
85 |
public static final int |
COLOR_YUV2RGB_I420 |
100 |
public static final int |
COLOR_YUV2RGB_IYUV |
100 |
public static final int |
COLOR_YUV2RGB_NV12 |
90 |
public static final int |
COLOR_YUV2RGB_NV21 |
92 |
public static final int |
COLOR_YUV2RGB_UYNV |
107 |
public static final int |
COLOR_YUV2RGB_UYVY |
107 |
public static final int |
COLOR_YUV2RGB_Y422 |
107 |
public static final int |
COLOR_YUV2RGB_YUNV |
115 |
public static final int |
COLOR_YUV2RGB_YUY2 |
115 |
public static final int |
COLOR_YUV2RGB_YUYV |
115 |
public static final int |
COLOR_YUV2RGB_YV12 |
98 |
public static final int |
COLOR_YUV2RGB_YVYU |
117 |
public static final int |
COLOR_YUV2RGBA_I420 |
104 |
public static final int |
COLOR_YUV2RGBA_IYUV |
104 |
public static final int |
COLOR_YUV2RGBA_NV12 |
94 |
public static final int |
COLOR_YUV2RGBA_NV21 |
96 |
public static final int |
COLOR_YUV2RGBA_UYNV |
111 |
public static final int |
COLOR_YUV2RGBA_UYVY |
111 |
public static final int |
COLOR_YUV2RGBA_Y422 |
111 |
public static final int |
COLOR_YUV2RGBA_YUNV |
119 |
public static final int |
COLOR_YUV2RGBA_YUY2 |
119 |
public static final int |
COLOR_YUV2RGBA_YUYV |
119 |
public static final int |
COLOR_YUV2RGBA_YV12 |
102 |
public static final int |
COLOR_YUV2RGBA_YVYU |
121 |
public static final int |
COLOR_YUV420p2BGR |
99 |
public static final int |
COLOR_YUV420p2BGRA |
103 |
public static final int |
COLOR_YUV420p2GRAY |
106 |
public static final int |
COLOR_YUV420p2RGB |
98 |
public static final int |
COLOR_YUV420p2RGBA |
102 |
public static final int |
COLOR_YUV420sp2BGR |
93 |
public static final int |
COLOR_YUV420sp2BGRA |
97 |
public static final int |
COLOR_YUV420sp2GRAY |
106 |
public static final int |
COLOR_YUV420sp2RGB |
92 |
public static final int |
COLOR_YUV420sp2RGBA |
96 |
public static final int |
COLORMAP_AUTUMN |
0 |
public static final int |
COLORMAP_BONE |
1 |
public static final int |
COLORMAP_COOL |
8 |
public static final int |
COLORMAP_HOT |
11 |
public static final int |
COLORMAP_HSV |
9 |
public static final int |
COLORMAP_JET |
2 |
public static final int |
COLORMAP_OCEAN |
5 |
public static final int |
COLORMAP_PINK |
10 |
public static final int |
COLORMAP_RAINBOW |
4 |
public static final int |
COLORMAP_SPRING |
7 |
public static final int |
COLORMAP_SUMMER |
6 |
public static final int |
COLORMAP_WINTER |
3 |
public static final int |
CV_BILATERAL |
4 |
public static final int |
CV_BLUR |
1 |
public static final int |
CV_BLUR_NO_SCALE |
0 |
public static final int |
CV_CANNY_L2_GRADIENT |
-2147483648 |
public static final int |
CV_CHAIN_CODE |
0 |
public static final int |
CV_CLOCKWISE |
1 |
public static final int |
CV_COMP_BHATTACHARYYA |
3 |
public static final int |
CV_COMP_CHISQR |
1 |
public static final int |
CV_COMP_CHISQR_ALT |
4 |
public static final int |
CV_COMP_CORREL |
0 |
public static final int |
CV_COMP_HELLINGER |
3 |
public static final int |
CV_COMP_INTERSECT |
2 |
public static final int |
CV_COMP_KL_DIV |
5 |
public static final int |
CV_CONTOURS_MATCH_I1 |
1 |
public static final int |
CV_CONTOURS_MATCH_I2 |
2 |
public static final int |
CV_CONTOURS_MATCH_I3 |
3 |
public static final int |
CV_COUNTER_CLOCKWISE |
2 |
public static final int |
CV_DIST_C |
3 |
public static final int |
CV_DIST_FAIR |
5 |
public static final int |
CV_DIST_HUBER |
7 |
public static final int |
CV_DIST_L1 |
1 |
public static final int |
CV_DIST_L12 |
4 |
public static final int |
CV_DIST_L2 |
2 |
public static final int |
CV_DIST_LABEL_CCOMP |
0 |
public static final int |
CV_DIST_LABEL_PIXEL |
1 |
public static final int |
CV_DIST_MASK_3 |
3 |
public static final int |
CV_DIST_MASK_5 |
5 |
public static final int |
CV_DIST_MASK_PRECISE |
0 |
public static final int |
CV_DIST_USER |
-1 |
public static final int |
CV_DIST_WELSCH |
6 |
public static final int |
CV_GAUSSIAN |
2 |
public static final int |
CV_GAUSSIAN_5x5 |
7 |
public static final int |
CV_HOUGH_GRADIENT |
3 |
public static final int |
CV_HOUGH_MULTI_SCALE |
2 |
public static final int |
CV_HOUGH_PROBABILISTIC |
1 |
public static final int |
CV_HOUGH_STANDARD |
0 |
public static final int |
CV_LINK_RUNS |
5 |
public static final int |
CV_MAX_SOBEL_KSIZE |
7 |
public static final int |
CV_MEDIAN |
3 |
public static final int |
CV_mRGBA2RGBA |
126 |
public static final int |
CV_POLY_APPROX_DP |
0 |
public static final int |
CV_RGBA2mRGBA |
125 |
public static final int |
CV_SCHARR |
-1 |
public static final int |
CV_SHAPE_CROSS |
1 |
public static final int |
CV_SHAPE_CUSTOM |
100 |
public static final int |
CV_SHAPE_ELLIPSE |
2 |
public static final int |
CV_SHAPE_RECT |
0 |
public static final int |
CV_WARP_FILL_OUTLIERS |
8 |
public static final int |
CV_WARP_INVERSE_MAP |
16 |
public static final int |
DIST_C |
3 |
public static final int |
DIST_FAIR |
5 |
public static final int |
DIST_HUBER |
7 |
public static final int |
DIST_L1 |
1 |
public static final int |
DIST_L12 |
4 |
public static final int |
DIST_L2 |
2 |
public static final int |
DIST_LABEL_CCOMP |
0 |
public static final int |
DIST_LABEL_PIXEL |
1 |
public static final int |
DIST_MASK_3 |
3 |
public static final int |
DIST_MASK_5 |
5 |
public static final int |
DIST_MASK_PRECISE |
0 |
public static final int |
DIST_USER |
-1 |
public static final int |
DIST_WELSCH |
6 |
public static final int |
FLOODFILL_FIXED_RANGE |
65536 |
public static final int |
FLOODFILL_MASK_ONLY |
131072 |
public static final int |
GC_BGD |
0 |
public static final int |
GC_EVAL |
2 |
public static final int |
GC_FGD |
1 |
public static final int |
GC_INIT_WITH_MASK |
1 |
public static final int |
GC_INIT_WITH_RECT |
0 |
public static final int |
GC_PR_BGD |
2 |
public static final int |
GC_PR_FGD |
3 |
public static final int |
HISTCMP_BHATTACHARYYA |
3 |
public static final int |
HISTCMP_CHISQR |
1 |
public static final int |
HISTCMP_CHISQR_ALT |
4 |
public static final int |
HISTCMP_CORREL |
0 |
public static final int |
HISTCMP_HELLINGER |
3 |
public static final int |
HISTCMP_INTERSECT |
2 |
public static final int |
HISTCMP_KL_DIV |
5 |
public static final int |
HOUGH_GRADIENT |
3 |
public static final int |
HOUGH_MULTI_SCALE |
2 |
public static final int |
HOUGH_PROBABILISTIC |
1 |
public static final int |
HOUGH_STANDARD |
0 |
public static final int |
INTER_AREA |
3 |
public static final int |
INTER_BITS |
5 |
public static final int |
INTER_BITS2 |
10 |
public static final int |
INTER_CUBIC |
2 |
public static final int |
INTER_LANCZOS4 |
4 |
public static final int |
INTER_LINEAR |
1 |
public static final int |
INTER_MAX |
7 |
public static final int |
INTER_NEAREST |
0 |
public static final int |
INTER_TAB_SIZE |
32 |
public static final int |
INTER_TAB_SIZE2 |
1024 |
public static final int |
INTERSECT_FULL |
2 |
public static final int |
INTERSECT_NONE |
0 |
public static final int |
INTERSECT_PARTIAL |
1 |
public static final int |
LINE_4 |
4 |
public static final int |
LINE_8 |
8 |
public static final int |
LINE_AA |
16 |
public static final int |
LSD_REFINE_ADV |
2 |
public static final int |
LSD_REFINE_NONE |
0 |
public static final int |
LSD_REFINE_STD |
1 |
public static final int |
MORPH_BLACKHAT |
6 |
public static final int |
MORPH_CLOSE |
3 |
public static final int |
MORPH_CROSS |
1 |
public static final int |
MORPH_DILATE |
1 |
public static final int |
MORPH_ELLIPSE |
2 |
public static final int |
MORPH_ERODE |
0 |
public static final int |
MORPH_GRADIENT |
4 |
public static final int |
MORPH_OPEN |
2 |
public static final int |
MORPH_RECT |
0 |
public static final int |
MORPH_TOPHAT |
5 |
public static final int |
PROJ_SPHERICAL_EQRECT |
1 |
public static final int |
PROJ_SPHERICAL_ORTHO |
0 |
public static final int |
RETR_CCOMP |
2 |
public static final int |
RETR_EXTERNAL |
0 |
public static final int |
RETR_FLOODFILL |
4 |
public static final int |
RETR_LIST |
1 |
public static final int |
RETR_TREE |
3 |
public static final int |
THRESH_BINARY |
0 |
public static final int |
THRESH_BINARY_INV |
1 |
public static final int |
THRESH_MASK |
7 |
public static final int |
THRESH_OTSU |
8 |
public static final int |
THRESH_TOZERO |
3 |
public static final int |
THRESH_TOZERO_INV |
4 |
public static final int |
THRESH_TRIANGLE |
16 |
public static final int |
THRESH_TRUNC |
2 |
public static final int |
TM_CCOEFF |
4 |
public static final int |
TM_CCOEFF_NORMED |
5 |
public static final int |
TM_CCORR |
2 |
public static final int |
TM_CCORR_NORMED |
3 |
public static final int |
TM_SQDIFF |
0 |
public static final int |
TM_SQDIFF_NORMED |
1 |
public static final int |
WARP_FILL_OUTLIERS |
8 |
public static final int |
WARP_INVERSE_MAP |
16 |
| org.opencv.imgproc.Subdiv2D | ||
|---|---|---|
public static final int |
NEXT_AROUND_DST |
34 |
public static final int |
NEXT_AROUND_LEFT |
19 |
public static final int |
NEXT_AROUND_ORG |
0 |
public static final int |
NEXT_AROUND_RIGHT |
49 |
public static final int |
PREV_AROUND_DST |
51 |
public static final int |
PREV_AROUND_LEFT |
32 |
public static final int |
PREV_AROUND_ORG |
17 |
public static final int |
PREV_AROUND_RIGHT |
2 |
public static final int |
PTLOC_ERROR |
-2 |
public static final int |
PTLOC_INSIDE |
0 |
public static final int |
PTLOC_ON_EDGE |
2 |
public static final int |
PTLOC_OUTSIDE_RECT |
-1 |
public static final int |
PTLOC_VERTEX |
1 |
| org.opencv.ml.Boost | ||
|---|---|---|
public static final int |
DISCRETE |
0 |
public static final int |
GENTLE |
3 |
public static final int |
LOGIT |
2 |
public static final int |
REAL |
1 |
| org.opencv.ml.DTrees | ||
|---|---|---|
public static final int |
PREDICT_AUTO |
0 |
public static final int |
PREDICT_MASK |
768 |
public static final int |
PREDICT_MAX_VOTE |
512 |
public static final int |
PREDICT_SUM |
256 |
| org.opencv.ml.EM | ||
|---|---|---|
public static final int |
COV_MAT_DEFAULT |
1 |
public static final int |
COV_MAT_DIAGONAL |
1 |
public static final int |
COV_MAT_GENERIC |
2 |
public static final int |
COV_MAT_SPHERICAL |
0 |
public static final int |
DEFAULT_MAX_ITERS |
100 |
public static final int |
DEFAULT_NCLUSTERS |
5 |
public static final int |
START_AUTO_STEP |
0 |
public static final int |
START_E_STEP |
1 |
public static final int |
START_M_STEP |
2 |
| org.opencv.ml.KNearest | ||
|---|---|---|
public static final int |
BRUTE_FORCE |
1 |
public static final int |
KDTREE |
2 |
| org.opencv.ml.LogisticRegression | ||
|---|---|---|
public static final int |
BATCH |
0 |
public static final int |
MINI_BATCH |
1 |
public static final int |
REG_DISABLE |
-1 |
public static final int |
REG_L1 |
0 |
public static final int |
REG_L2 |
1 |
| org.opencv.ml.Ml | ||
|---|---|---|
public static final int |
COL_SAMPLE |
1 |
public static final int |
ROW_SAMPLE |
0 |
public static final int |
TEST_ERROR |
0 |
public static final int |
TRAIN_ERROR |
1 |
public static final int |
VAR_CATEGORICAL |
1 |
public static final int |
VAR_NUMERICAL |
0 |
public static final int |
VAR_ORDERED |
0 |
| org.opencv.ml.StatModel | ||
|---|---|---|
public static final int |
COMPRESSED_INPUT |
2 |
public static final int |
PREPROCESSED_INPUT |
4 |
public static final int |
RAW_OUTPUT |
1 |
public static final int |
UPDATE_MODEL |
1 |
| org.opencv.ml.SVM | ||
|---|---|---|
public static final int |
C |
0 |
public static final int |
C_SVC |
100 |
public static final int |
CHI2 |
4 |
public static final int |
COEF |
4 |
public static final int |
CUSTOM |
-1 |
public static final int |
DEGREE |
5 |
public static final int |
EPS_SVR |
103 |
public static final int |
GAMMA |
1 |
public static final int |
INTER |
5 |
public static final int |
LINEAR |
0 |
public static final int |
NU |
3 |
public static final int |
NU_SVC |
101 |
public static final int |
NU_SVR |
104 |
public static final int |
ONE_CLASS |
102 |
public static final int |
P |
2 |
public static final int |
POLY |
1 |
public static final int |
RBF |
2 |
public static final int |
SIGMOID |
3 |
| org.opencv.objdetect.HOGDescriptor | ||
|---|---|---|
public static final int |
DEFAULT_NLEVELS |
64 |
public static final int |
L2Hys |
0 |
| org.opencv.objdetect.Objdetect | ||
|---|---|---|
public static final int |
CASCADE_DO_CANNY_PRUNING |
1 |
public static final int |
CASCADE_DO_ROUGH_SEARCH |
8 |
public static final int |
CASCADE_FIND_BIGGEST_OBJECT |
4 |
public static final int |
CASCADE_SCALE_IMAGE |
2 |
| org.opencv.photo.Photo | ||
|---|---|---|
public static final int |
INPAINT_NS |
0 |
public static final int |
INPAINT_TELEA |
1 |
public static final int |
LDR_SIZE |
256 |
public static final int |
MIXED_CLONE |
2 |
public static final int |
MONOCHROME_TRANSFER |
3 |
public static final int |
NORMAL_CLONE |
1 |
public static final int |
NORMCONV_FILTER |
2 |
public static final int |
RECURS_FILTER |
1 |
| org.opencv.video.Video | ||
|---|---|---|
public static final int |
MOTION_AFFINE |
2 |
public static final int |
MOTION_EUCLIDEAN |
1 |
public static final int |
MOTION_HOMOGRAPHY |
3 |
public static final int |
MOTION_TRANSLATION |
0 |
public static final int |
OPTFLOW_FARNEBACK_GAUSSIAN |
256 |
public static final int |
OPTFLOW_LK_GET_MIN_EIGENVALS |
8 |
public static final int |
OPTFLOW_USE_INITIAL_FLOW |
4 |
|
OpenCV 3.0.0-rc1 Documentation | |||||||
| PREV NEXT | FRAMES NO FRAMES |


About Me
Kia ora, I'm Laché - nice to meet you! I'm a that-dopamine-hit-you-get-when-you-finally-solve-a-problem junkie who loves books, chocolate and all things fluffy. I have questionable hand-eye coordination at the best of times (please never throw things at me, for both our sakes) but am nevertheless incapable of restraining my (occasionally erratic) dance moves in the presence of good music.
I currently live in Nelson, and am looking forward to moving up to Auckland in March and growing into a savvy developer with the rest of the 2020 Kahikatea cohort! In the meantime, check out my blog posts to see what I've been up to in the Foundations Sprints... and to establish whether or not I've maintained my sanity. Cheers.


Let's take a quick tour through some neat examples of how to use functional programming in swift. Recall that functional programming is a paradigm that expresses computation through a series of functions (like the math kind of function, sort of). In functional programming, we try and avoid mutable data and state. Let's dive right in!


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/Installing.20lean2.20on.20Windows.2010.html ---
I would like to work with the HoTT library of Lean2, so I tried to install lean2 on Windows 10 machines (a laptop and a Surface Pro3) following the instructions at https://github.com/leanprover/lean2/blob/master/doc/make/msys2.md, and I failed several times at the same stage when running the ninja command. Below I copied just the last log-message of several very similar ones. Any idea what to do?
[7/223] Building CXX object util/lp/CMakeFiles/lp.dir/lar_core_solver_instances.cpp.obj
FAILED: util/lp/CMakeFiles/lp.dir/lar_core_solver_instances.cpp.obj
C:\msys64\mingw64\bin\g++.exe -IC:/msys64/mingw64/include -IC:/lean2/src -I. -Wall -Wextra -std=c++11 -D LEAN_WINDOWS -D LEAN_WIN_STACK_SIZE=104857600 -D_GLIBCXX_USE_CXX11_ABI=0 -D LEAN_MULTI_THREAD -D LEAN_AUTO_THREAD_FINALIZATION -DLEAN_BUILD_TYPE="Release" -D LEAN_TRACK_MEMORY -O3 -DNDEBUG -MD -MT util/lp/CMakeFiles/lp.dir/lar_core_solver_instances.cpp.obj -MF util\lp\CMakeFiles\lp.dir\lar_core_solver_instances.cpp.obj.d -o util/lp/CMakeFiles/lp.dir/lar_core_solver_instances.cpp.obj -c C:/lean2/src/util/lp/lar_core_solver_instances.cpp
In file included from C:/lean2/src/util/lp/static_matrix.h:15,,
from C:/lean2/src/util/lp/lp_core_solver_base.h:14,
from C:/lean2/src/util/lp/lar_core_solver.h:11,
from C:/lean2/src/util/lp/lar_core_solver.cpp:15,
from C:/lean2/src/util/lp/lar_core_solver_instances.cpp:12:
C:/lean2/src/util/lp/permutation_matrix.h:
In member function 'unsigned int* lean::permutation_matrix<T, X>::values() const':
C:/lean2/src/util/lp/permutation_matrix.h:126:44: error: cannot convert 'const std::vector<unsigned int, std::allocator<unsigned int> >' to 'unsigned int*' in return unsigned * values() const { return m_permutation; }
^~~~~~~~~~~~~
ninja: build stopped: subcommand failed.
Digging out my c++ -knowledge (probably not a bad idea when using lean) I realized that the problem in the file permutation.h was that a pointer to m_permutation and not m_permutation itself should be returned. Since m_permutation is a vector, changing m_permutation to m_permutation.data() in the incriminated line will do.
I'm glad you were able to solve this problem. I'm afraid your topic didn't get much attention because very few people in this chat are interested in Lean 2 and HoTT. Even more so now that Lean 4 is on the horizon. You might be interested in https://github.com/gebner/hott3.
I'm not active on Zulip, so I didn't see this message earlier, but if you make a pull request for Lean 2 with the fix, I'm happy to merge it.
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


Posts in English
PHPFarm Episode 1: Getting started
- Sep 06, 2017
- François Poirotte
- English
- php, phpfarm
- phpfarm
So far, I merely described the raison d’être of phpfarm. In this new post, we’ll get things rolling by actually using it to build and install a single version of PHP.
PHPFarm Episode 0: A bit of history
- May 09, 2015
- François Poirotte
- English
- php, phpfarm
- phpfarm
Alright! In this new series of articles, we’re not going to collect vegetables. Instead, I’ll be focusing on phpfarm, a tool that allows several versions of PHP to co-exist.
In this first article, I’ll reminisce about the early days of PHP 5 and the reason projects like phpfarm were born in the first place.
Aside from that, I know the series on Composer isn’t finished yet. I have another entry in preparation but I can’t quite find the words to express my ideas on that topic right now. So, expect some interleaving between the two series in coming entries.
Various thoughts on Composer: Part 1
- Apr 09, 2015
- François Poirotte
- English
- php
- composer
Before you read on, let me make this clear: I love Composer, I really do! It has brought a lot of improvements to the PHP ecosystem by providing a common package manager that all developers can use [1].
However, I sometimes feel it doesn’t quite deliver some of its early promises or that it still lacks some important features.
This is the first post of a series of articles about what I find to be defective in Composer itself or in the way it is usually employed. It concerns security and how it is addressed in Composer.
First blog entry
- Apr 05, 2015
- François Poirotte
- English
This is the very first post for my new blog about IT-related stuff!


{% extends "base.html" %}
{% load static %}
{% block title %}
interiorworkskenya.co.ke - Best Interior Design in Kenya
{% endblock %}
{% block content %}
0796776177
0799833499
0711722199
Call today for all your interior design needs in Kenya
You can live chat us on the pop up on your bottom right.Our team will respond to all your queries as early as possible
Live chat us today for all your interior design needs in Kenya
<EMAIL_ADDRESS><EMAIL_ADDRESS>Email us today for all your interior design needs in Kenya


The following has been conceived as a “Shul-based Blog”, for lack of a better term. The articles we present will cover subjects such as: lesser known Israeli personalities, travel recommendations for both adults and children, holiday related events, and a review of Israeli lifestyle in all its manifestations, i.e. religious, secular, civilian, military, political and social.
Most often our focus about Israel, resides around the familiar topics of Israeli versus Arab, Chareidi versus Dati Leumi versus Secular, and the Inbal versus the Citadel. I would like to promote Israel advocacy in our community through a much simpler and more enjoyable prism. We should define Israel through the events that distinguish Israel from any other location, and the people who make the country unique. The ability to say to our friends and co-workers, "this is what is really happening in Israel!" will be far more influential than any political discussion of the country's pros and cons.


This is a Python program that uses the XLRD module (so you will have to install this module in order to use the program) to read emails, names ..., from an Excel file and uses this information to send personalized emails automatically.
Notice: the e-mail address used by the program must have SMTP enabled.
Project 2 : Auto email attach
Same for this program except that it can send attachments, I designed this program to send hundreds of personalized resumes with one click, later I knew that my sister was sending emails for hours, then we had the idea to modify this program to personalize and send thousands of emails in a few seconds.
This program yet simple and easy to realize (it took me only one afternoon) was able to save at least 13000$ according to one company
Project 3 : Deban
This prog designed with AutoIt and Batch is about a fly (debana in arabic :p) that comes out during an adjustable interval in Batch part of the program, so goes the duration.
The second Batch file isaba deban launches several flies in screen for an amusing effect :p.
Project 4 : SDL2 installer
For those of the domain (C programmers) it is painful each time to install a new library (kind of extension of a programming language), of course I do not speak about Linux (only one line on Bash and that's it), but Windows, eh yes of the interminable copy and paste.
with this program it's history, make the changes on the Batch file indicate the path of your C/C++ compiler, the Batch script will copy the SDL2 library elements in the appropriate location, there is even an program to test if the lib was well installed.
Project 5 : Tibib server-client chat (prototype)
If you do network programming, this progam is a good example, it's a kind of simple demonstration of server-client mechanism, i've chatted with this prog many times.
It has some extra things like : change of text color on console, double compatibility (Linux, Windows), personalized encryption algorithm using a key of 100 chars and not 26 posibility for each char, but 256, that means 100E256 or 1 and 512 zeros :O (try to decrypt my message Choaib :p)
Project 6 : Tibib chat GUI (prototype)
Another chat program this time, with an SDL2 GUI still in the prototype stage.
Project 7 : Keyboard Racing (prototype)
A program to race or evaluate your speed on the keyboard, ready? to your keyboard!
Project 8 : Arab text to unicode converter
Some libraries do not take into account the formatting of Arabic characters (writes all the letters in their isolated form), and the online converters that I found on the internet do not, so that's why I wrote this program, just write the desired Arabic words on "arabic_test.txt" then launch the program and finally retrieve your unicode on "utf_code.txt".
Project 9 : Quran bahit (prototype)
Do you want to know the recurrence of a word given in the Quraan? well this program is for you!
Of course I admit that there is better even on smartphone application, however I blieve the source code will help those in the field to understand how the searching a word works.
Project 10 : Keyboard Racing Arabic (prototype)
We saw previously the race on keyboard in English, this time it is in Arabic, with the automatic assistant for the non-Arabic keyboard, moreover the text of the program is customisable on "data.txt", I let you discover :)
Project 11 : Hijri Gregorian date converter (prototype)
The C++ version of the program on console to convert a Gregorian date into a Hijri date and vice-versa, it uses the Julian calendar (Julian as in Julius Caesar, a kind of scientific calendar used in astronomy) as an intermediary between the two mentioned calendars.
Is based on the algorithm of the doctor Aly Abbara which uses the Julian calendar (Julian as Julius Caesar, a kind of scientific calendar used in astronomy) as an intermediary between the two calendars mentioned one above.
Project 12 : Date Converter (for mobile & PC)
This time the Python version with Kivy (multi-platform lib) to convert dates, with as a bonus, a history of converted dates.
Project 13 : Andek Lbelgha (prototype)
It is a simple observation game, a young person shoot you with a "Belgha" a kind of Moroccan shoes, but as soon as he raises his hand, be first to shoot him :p, but be careful sometimes he raises it just to scratch his head in this case, you will be disqualified if you shoot him !
Project 14 : zaitoun utilities (for mobile & PC)
Versatile program using the "pyIslam" library (thanks Abdelhak, thanks to the contributors), calculates prayer times and converts solar dates into lunar dates, both with the astronomical calculation method rather than with a database, so no need for internet :), without forgetting the calculation of zakat and mirath.
Project 15 : zaitoun mind trainer (for mobile & PC)
With this app, you will work on your ability to memorize numbers, as well as your reasoning, well I let you discover.
One of my most successful programs, a colorful "Hafs 'an assim" (oriental reading) Quraan, with the option of automatic reading with adjustable time, hizb progress bar and page number selector.
Project 2 : Quran Rotaba (for mobile & PC) (prototype)
A portage for mobile of my old C++ project "Quraan Rajii", still not finished.
Project 3 : Quran Rotaba (C++ + SFML) (prototype)
A remake for "Quraan Rajii", the pupose is to rwrite the code due to the messy code in the original one -_-
Project 4 : Modawin hifz al quran (for mobile & PC)
For those who memorize the Quraan, you can note your progress with this program, press in the blank to know the meaning of the colors.
It's an educational game also one of my first projects, it took me 5 months at the time. the goal of the game is to choose among three choices the Aya that follows and so on, convenient to learn or review Quraan.
Of course there are other features, like auto-saving your session when you quit, bookmark with l and s, display help with f1, change color, get the duration of your session as well as the total duration (the time you have spent using the program since downloading it)


Home
Welcome to the official Texas Mardi Gras Entertainment website! .
Here you will find information about the company as well as the surrounding attractions and how to contact us.
About Us
Since our founding 23 years ago, with the purchase of a state-of-the-art Ferris, the company has enjoyed tremendous success. The Caruso borhters, our experienced and insightful leaders, bring a lifetime of carnival operations knowledge to each and every one of our engagements.
The integrity and reliability of our operations, built over a lifetime, is testified to by our decades long relationship with many of North America's largest and oldest events. OUr route stretches from across the Texas Gulf Coast to West Texas and the South Plains.
Attractions
The actual presentation of our midway is a vital compnent of our success. We pay strict attention to every deatil in an effort to assure our event will provide the public with maximum entertainment.
The Texas Mardi Gras midway includes a variety of the most popular carnival foods, tastefully presented to please every palate. We also feature games of skill and chance designed to suit players of all ages and interests. There are even special games for children that guarantee a prize with every play ensuring that everyone goes home with a smile on their face!
Attractions (cont.)
Our family-friendly environment features clean, well maintained, state-of-the-art ride equipment, operated by trained and competent personnel. Our fabulous flashing light and color displays, and exciting music all combine to furnish the ultimate in thrilling carnival experience. Our wide selection of amusement rides features rides for patrons of all ages. From the thrill seekers to junior riders, we have you covered.
Aside from rides, games, and food, Amusements of America fills the grounds with customer amenities including shaded rest areas with benches and picnic tables, misting fans for hot summer days, and photo opportunity areas with character cut-outs.


CYBERQUEST
Branch Coordinator's
Anuj Modi
Anuj Modi
9711523327
<EMAIL_ADDRESS>Arsh Singh
Arsh Singh
9599325474
<EMAIL_ADDRESS>Gaurav Katare
Gaurav Katare
7905436190
<EMAIL_ADDRESS>CyberquestSoftablitz
Step into the world of software development, by building your own software!
About
A software development event which targets building solutions for problem statements using Java. This event not only evaluates the participants on the implementation of features of the application but also innovation, code modularity and overall efficiency of the application.
Participation Criteria
Team size : 3
Years participating :
- B.Tech-II year
- B.Tech-III year
- MCA-II year
Outside participation is allowed
Open to all branches
Contact Info
- Shrey Pandey
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Suraj Goel
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Shashwat Pandey
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
Rules
- Directions for making software will be listed in the problem statements itself.
- Max. one problem statement can be attempted.
- Team Size will be of a maximum of 3 members and at least one member should be from CS/IT branch.
- It is mandatory to attempt every round.
CyberquestInsomnia
The Algorithmic Extravaganza where you get to quench your thirst for solving real life problems
About
The flagship event of Cyberquest which records participation from the brightest brains across the country. It is a competitive coding event with problems of varying difficulty levels. Young coding enthusiasts participate with vigour each year to satiate their programming appetite.
Participation Criteria
Team size : 3
Years participating :
- B.Tech-II year
- B.Tech-III year
- MCA-II year
Outside Participation: Allowed
Contact Info
- Abhishek Kumar
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Keshav
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Vivek Rathi
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
Rules
Round 1:
This will be an online round to be held on codechef from which top teams
will be selected for next round.
Round 2:
This will be the final round with long duration of 5 hours with
challenging problem set and exciting prizes.
Team can comprise of students belonging to same college otherwise they won't be applicable for
final round.
CyberquestDroidrush
What is that an app can’t do?
About
Android is one of the mostly used OS worldwide. Starting fron smartphones, tablets to TVs and wearables. Even many leading organisations have separate teams for android development. Being in touch with this in demand technology definitely stands out. Droidrush provides an excellent opportunity to learn basics of app development and build up some great projects that will help you to poliah your resume. And of course - you can even get your app published on Google Playstore for free, if judged done of the best.
Participation Criteria
Team size : 3
Years participating :
- B.Tech-II year
- B.Tech-III year
- MCA-I year
- MCA-II year
Outside Participation: Allowed
All branches allowed
Contact Info
- Kunal Sevkani
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Harshit Agarwall
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Shubham Damani
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
Rules
Abstract submission round:
All the registered teams need to submit abstracts for their
projects failing which will result in disqualification.
Mid Term Code Review :
Teams need to show their code and explain the working. They
also need to share the source code of their projects for evaluations.
Pitch Round :
Teams need to pitch their build as a product. It would be 5 min max.
They can mention extra features they want to add for the final build.
Final Round :
Application would be tested on available devices and code quality would
be checked followed by interviews.
Few Selected teams will present their final build of
the application followed by Q&A round.
CyberquestWebster
Change the web, Change the world!!
About
The Web isn’t just about the Web anymore. Artificial Intelligence and
Machine Learning are popular technologies that allow web applications to learn and observe from
a user's preferences and habits. The success of blockchain in keeping data safe and in the
processing of faster transactions makes the technology quite useful for web developers to deploy
in web development. When companies think about their websites today, they think about mobile
technology and social media at the same time. Web development, in reality, has a lot of facets —
the front end, the back end, the mobile Web, content management systems, and e-commerce, to just
name a few.
This event is a virtual hackathon that allows you to solve technical problems and create new
solutions by showcasing your skills in the field of web development so that your app feels good
and works well at the same time. This event will check how good you are when it comes to talking
with databases and also how well you can integrate the latest technologies like AI, blockchain,
etc. to your website.
Participation Criteria
Team size : 3
Years participating :
- B.Tech-II year
- B.Tech-III year
- MCA-II year
Outside Participation:Allowed
Interyear participation allowed
All branches allowed
Contact Info
- Nitin Doodhiya
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Tanisha Kumbhakar
-<EMAIL_ADDRESS>- Mohit Dogra
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Anuj Modi
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
Rules
Progress Round:
The participants will be evaluated based on their progress, their
approach to solving the problem statement and suggestions will be given in this round.
Online Round :
The participants will be evaluated on their web development skills in
this round. There will be a variety of questions including debugging questions, multiple choice
questions as well as small frontend and backend development tasks.
Final Round:
In the final round, the paticipants are required to give a presentation
of the hack/product, followed by Q&A session and interviews.
No Elimination
CyberquestCode of the Day
A code a day, keeps boredom away
About
A week-long competitive coding event attracting nationwide participation. It consists of a set of 7 problems, one for each day. The participants labour relentlessly to submit efficient solutions within 24 hours of the release of the problem.
Participation Criteria
Team size : Individual Event
Years participating :
- B.Tech-I year
- B.Tech-II year
- B.Tech-III year
- MCA-I year
- MCA-II year
Outside Participation: Allowed
All branches allowed
Contact Info
- Prakhar Kulshrestha
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Sudhanshu Kumar
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Gaurav Kumar
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
Rules
- This is an individual event and runs for 7 days on hackerearth.com.
- There will be 7 questions (2-easy, 3-medium, 2-hard)
- Users are free to submit as many times as they want.
- User can use any of the language.
- There will not be any partial scoring.
- Use of any unfair means will be dealt with immediate disqualification and judge’s decision will be treated as final.
CyberquestOperaomnia
We are pieces to each other’s puzzles.
About
It's not about your knowledge but about what can you think. Avishkar 20 brings you the most interesting puzzling event with mind boggling brain teasers and logical puzzles. This event will help you to open the locks of your brain and reach to a new level of thinking where you haven't been earlier and at the same time you will be having fun.
Participation Criteria
Team size : Solo Event
Years participating :
- B.Tech-I year
- B.Tech-II year
- B.Tech-III year
- MCA-I year
- MCA-II year
Outside Participation: Allowed
No Branch or year restriction in team formation (except Final years).
Contact Info
- Mredul Jain
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Prabhnoor Singh Saluja
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Chitransh
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
Rules
- There will be in total of 3 rounds.
- After each round there will be elimination.
- Any practice of unfair means is highly discouraged.
- The decision of coordinators will be final and binding.
CyberquestMathRush
Pure mathematics is the world's best game. It is more absorbing than chess, more of a gamble than poker, and lasts longer than Monopoly. It's free. It can be played anywhere - Archimedes did it in a bathtub.
About
MathRush is a mathematical puzzle contest in which sound knowledge of mathematics together with taste of programming will be essential to solve problems.
Participation Criteria
Team size : Solo event
Years participating :
- B.Tech-I year
- B.Tech-II year
- B.Tech-III year
- MCA-I year
- MCA-II year
Outside Participation: Allowed
No Branch or year restriction.
Contact Info
- Gaurav Shukla
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Mohit Bansal
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Nimesh Maheshwari
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
Rules
- There is only one round of 3 hours and will be hosted on hackerrank.
- There will be 15 questions (6-easy 5-medium 4-hard).
- Users are free to submit as many times as they want.
- There will not be any partial scoring.
- User can use any of the programming language.
CyberquestSoftathalon
Get ready to amaze us with your progress as a Computer Science Major
About
An event aimed at simulating the software profile based recruitment procedure for under graduates. It consists of a series of written and coding rounds testing the technical prowess of the candidate. Interview rounds also form an integral part of the event in which the students are judged on the knowledge and confidence they exude. It provides students a learning experience and pushes them a step forward towards their “Dream job”.
Participation Criteria
Team size : Individual Event
Branch : CSE/IT (2nd/3rd Year), MCA(1st/2nd year)
Outside Participation: Not Allowed
Contact Info
- Shashank Sharma
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Ranjit
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Anzum Bano
-<EMAIL_ADDRESS>Rules
- The event is mandatory for all CSE/IT students of 2nd/3rd year.
- First and second round are coding+MCQs rounds with elimination in each.
- Third round will be virtual interview round.
- Indulging in any unfair means will lead to disqualification.
CyberquestLogical Rhythm
ACCURACY_MATTERS
About
A riveting journey across the terrains of machine learning and data science designed to catalyse the knowledge of budding engineers in this field. Logical Rhythm gives you a perfect platform to design innovative and intelligent models, which can study the intricacies of data themselves to solve real-life problems. This competitive forum will also help the budding Data Scientists or Machine Learning enthusiasts to assess their potential, and grow both in confidence and ability.
Participation Criteria
Team size : 1-3
Years participating :
- B.Tech-I year
- B.Tech-II year
- B.Tech-III year
- MCA-I year
- MCA-II year
For BTech 2nd,3rd years and MCA 1st,2nd year team members may be of different years or branches.
Contact Info
- Yash Sawarn
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Arpit Yadav
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Harsh Chaturvedi
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
Rules
First Round :
- Mid-term Evaluation : For checking the progress of each team, an evaluation is conducted.
- Technical Quiz : A quiz comprising of question from machine learning, deep learning and probability aspects of machine learning will be conducted.
Second Round :
- Final Project Submission with Final Evaluation : All teams will be required to submit the work they developed. Evaluations will be done on all the problem statements attempted.
Third Round :
- Interview : Interview on all aspects of attempted solutions to the problem statements as well as evaluating the insights of all the trending algorithms will help in finding the best of all.
CyberquestCode Warriors
About
Code Warrior is an event where gaming bots made with the help of Artificial Intelligence and its concepts like alpha-beta pruning, mini-max etc, compete among themselves on an arena of board-game and the most unbeatable bot wins. Its is the most fun-oriented yet technical event of Cyberquest
Participation Criteria
Team size : 2
Years participating :
- B.Tech-II year
- B.Tech-III year
- MCA-I year
- MCA-II year
Eligibility: One member from CS/IT
No of rounds: 1
Contact Info
- Arsh Singh
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Nitish Gupta
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Sahaj Bamba
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
Rules
- Team should be available on the final round on the day of Avishkar.
- Don't share your bots before final round.
- Code has to be submitted before final round.
- Bots will fight in a tournament based structure.
- Languages allowed are: C, C++, Java.
- Use of external libraries aren't allowed.
CyberquestRevengg
When solving problems, dig at the roots instead of just hacking at the leaves
About
A CTF-style challenge for all active and aspiring reverse engineers. So dust off the disassembler, oil your debugger and get your favourite chat client ready to participate in Revengg to win prizes bumper.
Participation Criteria
Team size : 2
Years participating :
- B.Tech-I year
- B.Tech-II year
- B.Tech-III year
- MCA-I year
- MCA-II year
- Team members must be from the same year.
- All Rounds will be an open round where you can use the internet as per your requirement.
- At least one member should be from CS/IT branch.
Contact Info
- Anuj Modi
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Anshul Singh
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Prashant Shakya
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
Rules
- Practise round - Participants will have to find flags by tinkering with files, exploiting applications, etc. Problems will be mainly from binary exploitation, forensics, reverse engineering, web-based exploits with some fun challenges.
- Round 1 - A new surprise round. To be disclosed soon.
- Round 2 - This will be the final round. It will be similar to the practice round with tighter time constraints.
CyberquestTuxWars
Why have just Windows, when Linux can give you the entire /home
About
This event tests your practical acumen with Linux command line tools, shell scripting and
networking. Using /bin/bash as your weapon dive into the dark /etc/shadow of the Kernel and
fight for ultimate glory #!
The written round tests the theoretical understanding in Linux and the practical round expects
the teams to compete in a time bound environment while working on systems and applying concepts.
Participation Criteria
Team size : 2
Years participating :
- B.Tech-I year
- B.Tech-II year
- B.Tech-III year
- MCA-I year
- MCA-II year
Min one member from CS/IT.
Contact Info
- Manas Uniyal
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- Rituparno Biswas
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
- A N Sai Krishna
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
Rules
- Team members should belong to the same year.
- Each team should have Linux installed on their system.
- For rounds each team should not use internet(unless explicitly allow).
- All the members of a team should be present in all rounds.
CyberquestTechMaiden
Have a dream to become techie? let's begin now.
About
The brand new all girls' event aims to provide you with overall development as a women techie. The event is open to only girls and consists of coding and aptitude round followed by interviews.
Participation Criteria
Team size : Individual Event
Years participating :
- B.Tech-I year
- B.Tech-II year
- B.Tech-III year
- MCA-I year
- MCA-II year
Open to all branches girls
Contact Info
- Shikha Singh
-<EMAIL_ADDRESS>- Siddhi Mahawar
-<EMAIL_ADDRESS>- Gaurav Katare
-<EMAIL_ADDRESS>-<PHONE_NUMBER>
Rules
- 1 Coding round open to all branches girls.
- Selection of one girl candidate to interview round from every branch.


The reason for this is simple. If we excise all inline script tags from our pages, then we can serve in production with a Content-Security-Policy which includes `unsafe-inline`, thus protecting ourselves from a wide range of XSS attacks. {% endcomment %} {% block template-scripts %}{% endblock template-scripts %} {% endblock %}


Contents
Minerva is a Comet server (written in Python/Twisted) and client (in JavaScript). Unlike most other Comet servers, Minerva delivers data reliably and in-order even when running over HTTP. Minerva also solves other Comet-over-HTTP problems by including subdomain support to work around browser limits for active HTTP requests per hostname, and aggressive timeouts to avoid long hangs.
See [this tutorial] for actual instructions; the overview version is:
If you've written any sort of network protocol in a non-blocking framework before, the process should be very familiar.
If a user reaches your website over HTTP, they can almost certainly connect to a Minerva HTTP endpoint (as long as they have JavaScript enabled, of course). This isn't the case for WebSocket or Flash Sockets; intermediaries (outbound firewalls, transparent HTTP proxies, anti-virus software) will sometimes block non-HTTP traffic. For WebSocket, Google reported success rates of 67% (port 80) to 95% (port 443).
And of course, many users run older browsers with no WebSocket support, and might also have Flash disabled or in click-to-play mode.
These approaches tend to work like this:
Server side:
unsent_messages = [] def render_GET(self, request): # [... code to handle client->server data omitted ...] # Send queued messages to client and clear the queue unsent = unsent_messages unsent_messages = [] return json.dumps(unsent)
The client side opens an XHR to the server in a loop to get new server->client messages, or whenever it needs to send a client->server message. There are at least two major problems here:
Yes. The Minerva client comes in two versions: normal (for use with Closure Library), and the standalone minerva-client.js. The standalone version has no JavaScript dependencies.
No, but you can proxy data from a Minerva server to your own application server.
Some transports have problems transmitting all of Unicode correctly. These behaviors were observed:
To ensure compatibility everywhere, Minerva transmits only a subset of ASCII: 0x20 (SPACE) - 0x7E (~). To avoid having two serialization steps (one for Unicode), your application is responsible for all serialization/deserialization. JSON is a good option for most applications. Use these APIs to ensure ASCII-only JSON output:
On the client side, use Minerva.JSON.asciify (standalone Minerva), or cw.json.asciify.
In Python, use simplejson.dumps or json.dumps, which outputs ASCII by default.
If you are sending octets, use a Base64 encoder/decoder.
The guts of the server are implemented in mserver.py and the client in client.js. Consider reading it in IDEA so that you can jump to function definitions quickly. Your understanding may be assisted by a sketch of how Minerva works, the frame types used by the Minerva protocol, and by playing with /chatapp/?mode=http on the minerva_site server. Understanding the separation between the stream and the transports is critical.
I used to think of Minerva as a spiritual successor to Divmod Athena, even though it doesn't have anything like Nevow/Athena's Widgets. Of course, you already know that Minerva is the Roman counterpart to Athena.
Free: Lift's Comet support, clj-browserchannel, libevent-browserchannel-server, node-browserchannel, Divmod Nevow's Athena (homepage dead), Atmosphere, gwt-comet, Socket.IO, nginx_http_push_module, Meteor, Perservere's, gwteventservice, Orbited, HookBox, js.io, APE (Ajax Push Engine), DWR (Direct Web Remoting), ICEpush.
Commercial: GAE's Channel API, Migratory Push Server (supports very high connection counts), StreamHub, WebSync, Liberator, Kaazing, Lightstreamer, ZK's push support.


CindyJS: Generation of Limit Sets of Kleinian Groups Using a Feedback Loop Approach
Press SPACE to reset everything. The red and the blue point determine the complex parameters ta, tb, which will be pluged into Grandma's recipe from Indra's Pearls: The Vision of Felix Klein, David Mumford, Caroline Series, David Wright.


About us
RedXen Forum
Our forum is a easy-to-browse forum that is fast and reliable, it is powered by Discourse and it is one of the best community forums!
Discord Server
Due to the reliability that Discord offers, most of the people join us on our server to communicate about topics they have in common, support is also given pretty quick there.
PMBot
We also host a slightly customized version of YAGPDB called PMBot that can moderate your servers, you can add him to your server!
SourceBans
Got banned? Don't know the reason why, or want to make a complaint? You should be visiting our SourceBans page
News
June 2018
Added SourceBans for easier ban managementNow hosting TF2 & CSS servers
Forums are stable and ready to use
Created this webpage and added meta tags for SEO's
Now hosting server on DigitalOcean with improved bandwidth
May 2018
Added reaction roles to the discord serverAdapted the homepage to almost all viewports
Updated homepage to a better one
Discord revamp with new channels, categories and roles


{% extends 'base.html' %} {% block navbar %}
{% endblock navbar %} {% block content %}Pepper's emotion detection system was created for an engineering thesis project by
Magdalena Cudak, Aleksandra Drewnik and Julia Dutkiewicz,
students of AGH University of Science and Technology, Faculty of Computer Science, Electronics and
Telecommunications.
The project's supervisor was dr hab. inż. Bartłomiej Śnieżyński.


Creativity
I collected feedback, and this one should be much easier and more fun than my last puzzle :) Enjoy!


Web Developer Examples and Resources by Thinh Pham
Why accessibility is so important ?
Nowadays, technologies have developed and expanded the users' experiences and focused on the website's pleasant navigation. However, a much more critical concept-accessibility is also being paid attention to. So, what is the brief definition of accessibility? According to W3C, "accessibility means that any websites, tools, and technologies are designed and developed so that people with disabilities can use them. More specifically, people can perceive, understand, navigate, interact with the Web and contribute to the Web." Web access includes all types of disabilities that can affect navigation on the web auditory, cognitive-motor, neurological, speech, and visual. Why is web accessibility important? Either the Internet or Web has become a crucial resource in our life and plays roles in many aspects such as education, employment, government, commerce, health care, recreation, and more. Thus, web accessibility is essential to promise equal opportunities and equal access to people that have diverse disabilities. Web accessibility is considered a basic human right since accessing information, technologies, and communications, including the Web, is a defined right according to the United Nations Convention on the Rights of Persons with Disabilities. Web accessibility can help people with disabilities actively connect to our society in its way.
Furthermore, an accessible website offers the possibility of accessing interaction and information that barriers to print, audio, and visual media can be easily overcome through Web technologies. An accessible website can contribute to Web design, usability, and search engine optimization (SEO). It can also benefit a business in a specific case. An accessible design will improve overall user experience and satisfaction, especially in various situations, across different devices, and older users. Accessibility can enhance our brand, drive innovation, and extend our market reach. Making the website accessible to people with disabilities will ensure the possibility of access for everyone. Some of the examples that web developers can make their webs accessible are trying: the use of Alt-tags, creating better tables by using the caption tag to make them easier to understand by screen readers rather than just making the title of a table in bold text, establish useful keyboard navigation, be careful with the use of default HTML Tags, closed captions for media like consider providing text transcript, always use title tag, and use the ARIA Tag. Having ideas of how vital accessibility contributes to our websites in mind, we can successfully create and build a website that promises everyone will access it.


Home
About
Blog
Signup
Contact
Subscribe to our Newsletter
Sign Up Now
Click Here to Subscribe
+
Submit


Reports assignments and function calls where the name of the variable to which
a value is assigned or the function parameter does not seem to match the name of the value assigned to it.
For example:
int x = 0;
int y = x;
or
int x = 0, y = 0;
Rectangle rc = new Rectangle(y, x, 20, 20);
The configuration pane allows to specify the names which should not be used together: the error is reported
if the parameter name or assignment target name contains words from one group and the name of the assigned or passed
variable contains words from a different group.


Sets the orientation of the progress bar Possible values: 'horizontal', 'vertical'.
Code examples
Set the orientation property.
<smart-progress-bar orientation='horizontal'></smart-progress-bar>
Set the orientation property by using the HTML Element's instance.
const progressBar = document.querySelector('smart-progress-bar');
progressBar.orientation = 'vertical';
Get the orientation property.
const progressBar = document.querySelector('smart-progress-bar');
let orientation = progressBar.orientation;


---
layout: home
author_profile: true
title: Welcome!
excerpt: I am Ph.D candidate at POSTECH. My research interest lies in computational photography and computer vision using deep learning. In particular, I'm intrigued about image and video enhancement tasks such as restoration and color transfer.
Check my publications to get a glimpse of my work.
header:
overlay_image: /assets/images/teaser.jpg
overlay_filter: 0.5 # same as adding an opacity of 0.5 to a black background
cta_label: About my work
cta_url: https://codeslake.github.io/publications/
caption: "Photo by Junyong Lee
[Checkout for **more**!
🔗](https://codeslake.github.io/photos)"
---


Computes a score factor for a phrase.
Computes a score factor for a phrase.
The default implementation sums the idf factor for each term in the phrase.
collection-level statistics
term-level statistics for the terms in the phrase
an Explain object that includes both an idf score factor for the phrase and an explanation for each term.
Computes a score factor for a simple term and returns an explanation for that score factor.
Computes a score factor for a simple term and returns an explanation for that score factor.
The default implementation uses:
idf(docFreq, docCount);
Note that CollectionStatistics#docCount()
is used instead of
org.apache.lucene.index.IndexReader#numDocs() IndexReader#numDocs()
because also
TermStatistics#docFreq()
is used, and when the latter
is inaccurate, so is CollectionStatistics#docCount()
, and in the same direction.
In addition, CollectionStatistics#docCount()
does not skew when fields are sparse.
collection-level statistics
term-level statistics for the term
an Explain object that includes both an idf score factor and an explanation for the term.
Variant of ClassicSimilarity supporting global IDF using a map for IDF values of terms. The key for the first map is the field name; the one for the second map is the term; the value is the IDF for the term in that field.


|
FreeApiPrint 1.0.0
|
Public Member Functions | |
| __construct () | |
| sendCallError ($message=null) | |
| sendDisastrousError ($message=null) | |
| sendLoginError ($message=null) | |
| sendTransformError ($message=null) | |
Private Member Functions | |
| setError ($code, $message) |
Definition at line 38 of file ApiPrintResponse.class.php.
| ApiPrintResponse::__construct | ( | ) |
Construct the object
public
Reimplemented from Response.
Definition at line 46 of file ApiPrintResponse.class.php.
| ApiPrintResponse::sendCallError | ( | $ | message = null | ) |
Send an HTTP error header (405) : params checking failed
| string | $message | The content to send public |
Definition at line 59 of file ApiPrintResponse.class.php.
| ApiPrintResponse::sendDisastrousError | ( | $ | message = null | ) |
Send an HTTP error header (500) : unknown error (error in this program)
| string | $message | The content to send public |
Definition at line 119 of file ApiPrintResponse.class.php.
| ApiPrintResponse::sendLoginError | ( | $ | message = null | ) |
Send an HTTP error header (401) : login failed
| string | $message | The content to send public |
Definition at line 79 of file ApiPrintResponse.class.php.
| ApiPrintResponse::sendTransformError | ( | $ | message = null | ) |
Send an HTTP error header (503) : transform failed
| string | $message | The content to send public |
Definition at line 99 of file ApiPrintResponse.class.php.
| ApiPrintResponse::setError | ( | $ | code, |
| $ | message | ||
| ) | [private] |
Prepare header status and HTML content for error
| int | $code | The error number (header HTTP status) |
| string | $message | The content to send private |
Definition at line 140 of file ApiPrintResponse.class.php.


A set of practices that emphasizes the collaboration and communication of both software developers and IT professionals while automating the process of delivery.
- Building
- Testing
- Rapid Releases
A set of practices that emphasizes the collaboration and communication of both software developers and IT professionals while automating the process of delivery.
Docker is a platform that helps developers build, ship and run any application, in any environment.  Like computers it has and runs its own operating system and applications to operate.
Build,Run,Ship---Anywhere
Docker Hub, is a registry of Docker images.
https://hub.docker.com/
docker run hello-world
Docker Image
Image
Container
Image.....basically a stencil.

At the root of the application create a file called "Dockerfile".
Dockerfile
is a text file that contains a list of commands that Dockers calls while creating the image. This file
contains all the information that Docker needs to know to run the app.
Add this to the Dockerfile:
FROM alpine:3.5
RUN apk add --update py2-pip
COPY requirements.txt /usr/src/app/
RUN pip install --no-cache-dir -r /usr/src/app/requirements.txt
COPY app.py /usr/src/app/
COPY templates/index.html /usr/src/app/templates/
EXPOSE 5000
CMD ["python", "/usr/src/app/app.py"]
docker build -t dockerflask .
docker run -p 8888:5000 dockerflask
http://localhost:8888
Open the terminal or command prompt
git clone https://github.com/ZuriHunter/docker-rails.git
Open the application in the text editor
At the root of the application create a file called "Dockerfile".
Dockerfile
is a text file that contains a list of commands that Dockers calls while creating the image. This file
contains all the information that Docker needs to know to run the app.
Add this to the Dockerfile:
FROM ruby:2.3.3
RUN apt-get update -qq && apt-get install -y build-essential libpq-dev nodejs
COPY . application/blog
WORKDIR application/blog
RUN bundle install && rake db:migrate
EXPOSE 3000
CMD rails server -b <IP_ADDRESS>
docker build -t dockerrails .
docker run -p 3000:3000 dockerrails
http://localhost:3000
Open the terminal or command prompt
git clone https://github.com/ZuriHunter/docker-jscsshtml.git
Open the application in the text editor
At the root of the application create a file called "Dockerfile".
Dockerfile
is a text file that contains a list of commands that Dockers calls while creating the image. This file
contains all the information that Docker needs to know to run the app.
Add this to the Dockerfile:
FROM kyma/docker-nginx
ADD . /var/www
EXPOSE 80
CMD 'nginx'
docker build -t dockerjscsshtml .
docker run -p 80:80 dockerjscsshtml
http://localhost:80