{{+bindTo:partials.standard_nacl_api}}
| URLRequestInfo () | |
| URLRequestInfo (const InstanceHandle &instance) | |
| URLRequestInfo (const URLRequestInfo &other) | |
| bool | SetProperty (PP_URLRequestProperty property, const Var &value) |
| bool | AppendDataToBody (const void *data, uint32_t len) |
| bool | AppendFileToBody (const FileRef &file_ref, PP_Time expected_last_modified_time=0) |
| bool | AppendFileRangeToBody (const FileRef &file_ref, int64_t start_offset, int64_t length, PP_Time expected_last_modified_time=0) |
| bool | SetURL (const Var &url_string) |
| bool | SetMethod (const Var &method_string) |
| bool | SetHeaders (const Var &headers_string) |
| bool | SetStreamToFile (bool enable) |
| bool | SetFollowRedirects (bool enable) |
| bool | SetRecordDownloadProgress (bool enable) |
| bool | SetRecordUploadProgress (bool enable) |
| bool | SetCustomReferrerURL (const Var &url) |
| bool | SetAllowCrossOriginRequests (bool enable) |
| bool | SetAllowCredentials (bool enable) |
| bool | SetCustomContentTransferEncoding (const Var &content_transfer_encoding) |
| bool | SetPrefetchBufferUpperThreshold (int32_t size) |
| bool | SetPrefetchBufferLowerThreshold (int32_t size) |
| bool | SetCustomUserAgent (const Var &user_agent) |
URLRequestInfo provides an API for creating and manipulating URL requests.
| pp::URLRequestInfo::URLRequestInfo | ( | ) | [inline] |
Default constructor.
This constructor creates an is_null
resource.
| pp::URLRequestInfo::URLRequestInfo | ( | const InstanceHandle & | instance | ) | [explicit] |
A constructor used to allocate a new URLLoader
in the browser.
The resulting object will be is_null
if the allocation failed.
| [in] | instance | The instance with which this resource will be associated. |
| pp::URLRequestInfo::URLRequestInfo | ( | const URLRequestInfo & | other | ) |
The copy constructor for URLRequestInfo
.
| [in] | other | A URLRequestInfo to be copied. |
| bool pp::URLRequestInfo::AppendDataToBody | ( | const void * | data, |
| uint32_t | len | ||
| ) |
AppendDataToBody() appends data to the request body.
A content-length request header will be automatically generated.
| [in] | data | A pointer to a buffer holding the data. |
| [in] | len | The length, in bytes, of the data. |
| bool pp::URLRequestInfo::AppendFileRangeToBody | ( | const FileRef & | file_ref, |
| int64_t | start_offset, | ||
| int64_t | length, | ||
| PP_Time | expected_last_modified_time = 0 |
||
| ) |
AppendFileRangeToBody() is a pointer to a function used to append part or all of a file, to be uploaded, to the request body.
A content-length request header will be automatically generated.
| [in] | file_ref | A FileRef containing the file reference. |
| [in] | start_offset | An optional starting point offset within the file. |
| [in] | length | An optional number of bytes of the file to be included. If the value is -1, then the sub-range to upload extends to the end of the file. |
| [in] | expected_last_modified_time | An optional (non-zero) last modified time stamp used to validate that the file was not modified since the given time before it was uploaded. The upload will fail with an error code of PP_ERROR_FILECHANGED if the file has been modified since the given time. If expected_last_modified_time is 0, then no validation is performed. |
| bool pp::URLRequestInfo::AppendFileToBody | ( | const FileRef & | file_ref, |
| PP_Time | expected_last_modified_time = 0 |
||
| ) |
AppendFileToBody() is used to append an entire file, to be uploaded, to the request body.
A content-length request header will be automatically generated.
| [in] | file_ref | A FileRef containing the file reference. |
| [in] | expected_last_modified_time | An optional (non-zero) last modified time stamp used to validate that the file was not modified since the given time before it was uploaded. The upload will fail with an error code of PP_ERROR_FILECHANGED if the file has been modified since the given time. If expected_last_modified_time is 0, then no validation is performed. |
| bool pp::URLRequestInfo::SetAllowCredentials | ( | bool | enable | ) | [inline] |
SetAllowCredentials() sets the PP_URLREQUESTPROPERTY_ALLOWCREDENTIALS
(corresponding to a bool of type PP_VARTYPE_BOOL
).
The default of the property is false. Whether HTTP credentials are sent with cross-origin requests. If false, no credentials are sent with the request and cookies are ignored in the response. If the request is not cross-origin, this property is ignored.
| [in] | enable | A bool containing the property value. |
| bool pp::URLRequestInfo::SetAllowCrossOriginRequests | ( | bool | enable | ) | [inline] |
SetAllowCrossOriginRequests() sets the PP_URLREQUESTPROPERTY_ALLOWCROSSORIGINREQUESTS
(corresponding to a bool of type PP_VARTYPE_BOOL
).
The default of the property is false. Whether cross-origin requests are allowed. Cross-origin requests are made using the CORS (Cross-Origin Resource Sharing) algorithm to check whether the request should be allowed. For the complete CORS algorithm, refer to the Cross-Origin Resource Sharing documentation.
| [in] | enable | A bool containing the property value. |
| bool pp::URLRequestInfo::SetCustomContentTransferEncoding | ( | const Var & | content_transfer_encoding | ) | [inline] |
SetCustomContentTransferEncoding() sets the PP_URLREQUESTPROPERTY_CUSTOMCONTENTTRANSFERENCODING
(corresponding to a string of type PP_VARTYPE_STRING
or might be set to undefined as PP_VARTYPE_UNDEFINED
).
Set it to a string to set a custom content-transfer-encoding header (if empty, that header will be omitted), or to undefined to use the default (if any). Only loaders with universal access (only available on trusted implementations) will accept URLRequestInfo
objects that try to set a custom content transfer encoding; if given to a loader without universal access, PP_ERROR_BADARGUMENT
will result.
| [in] | content_transfer_encoding | A Var containing the property value. To use the default content transfer encoding, set content_transfer_encoding to an undefined Var . |
| bool pp::URLRequestInfo::SetCustomReferrerURL | ( | const Var & | url | ) | [inline] |
SetCustomReferrerURL() sets the PP_URLREQUESTPROPERTY_CUSTOMREFERRERURL
(corresponding to a string of type PP_VARTYPE_STRING
or might be set to undefined as PP_VARTYPE_UNDEFINED
).
Set it to a string to set a custom referrer (if empty, the referrer header will be omitted), or to undefined to use the default referrer. Only loaders with universal access (only available on trusted implementations) will accept URLRequestInfo
objects that try to set a custom referrer; if given to a loader without universal access, PP_ERROR_BADARGUMENT
will result.
| [in] | url | A Var containing the property value. |
| bool pp::URLRequestInfo::SetCustomUserAgent | ( | const Var & | user_agent | ) | [inline] |
SetCustomUserAgent() sets the PP_URLREQUESTPROPERTY_CUSTOMUSERAGENT
(corresponding to a string of type PP_VARTYPE_STRING
or might be set to undefined as PP_VARTYPE_UNDEFINED
).
Set it to a string to set a custom user-agent header (if empty, that header will be omitted), or to undefined to use the default. Only loaders with universal access (only available on trusted implementations) will accept URLRequestInfo
objects that try to set a custom user agent; if given to a loader without universal access, PP_ERROR_BADARGUMENT
will result.
| [in] | user_agent | A Var containing the property value. To use the default user agent, set user_agent to an undefined Var . |
| bool pp::URLRequestInfo::SetFollowRedirects | ( | bool | enable | ) | [inline] |
SetFollowRedirects() sets the PP_URLREQUESTPROPERTY_FOLLOWREDIRECT
(corresponding to a bool of type PP_VARTYPE_BOOL
).
The default of the property is true. Set this value to false if you want to use URLLoader::FollowRedirects() to follow the redirects only after examining redirect headers.
| [in] | enable | A bool containing the property value. |
| bool pp::URLRequestInfo::SetHeaders | ( | const Var & | headers_string | ) | [inline] |
SetHeaders() sets the PP_URLREQUESTPROPERTY_HEADERS
(corresponding to a
delimited string of type
PP_VARTYPE_STRING
) property for the request.
Refer to the <a href="http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html"Header Field Definitions documentation for further information.
| [in] | headers_string | A Var containing the property value. |
| bool pp::URLRequestInfo::SetMethod | ( | const Var & | method_string | ) | [inline] |
SetMethod() sets the PP_URLREQUESTPROPERTY_METHOD
(corresponding to a string of type PP_VARTYPE_STRING
) property for the request.
This string is either a POST or GET. Refer to the HTTP Methods documentation for further information.
| [in] | method_string | A Var containing the property value. |
| bool pp::URLRequestInfo::SetPrefetchBufferLowerThreshold | ( | int32_t | size | ) | [inline] |
SetPrefetchBufferLowerThreshold() sets the PP_URLREQUESTPROPERTY_PREFETCHBUFFERLOWERTHRESHOLD
(corresponding to a integer of type PP_VARTYPE_INT32
).
The default is not defined and is set by the browser to a value appropriate for the default PP_URLREQUESTPROPERTY_PREFETCHBUFFERUPPERTHRESHOLD
. Set it to an integer to set a lower threshold for the prefetched buffer of an asynchronous load. When reached, the browser will resume loading if If PP_URLREQUESTPROPERTY_PREFETCHBUFFERLOWERERTHRESHOLD
had previously been reached. When setting this property, PP_URLREQUESTPROPERTY_PREFETCHBUFFERUPPERTHRESHOLD
must also be set. Behavior is undefined if the former is >= the latter.
| [in] | size | An int32_t containing the property value. |
| bool pp::URLRequestInfo::SetPrefetchBufferUpperThreshold | ( | int32_t | size | ) | [inline] |
SetPrefetchBufferUpperThreshold() sets the PP_URLREQUESTPROPERTY_PREFETCHBUFFERUPPERTHRESHOLD
(corresponding to a integer of type PP_VARTYPE_INT32
).
The default is not defined and is set by the browser possibly depending on system capabilities. Set it to an integer to set an upper threshold for the prefetched buffer of an asynchronous load. When exceeded, the browser will defer loading until PP_URLREQUESTPROPERTY_PREFETCHBUFFERLOWERERTHRESHOLD
is hit, at which time it will begin prefetching again. When setting this property, PP_URLREQUESTPROPERTY_PREFETCHBUFFERLOWERERTHRESHOLD
must also be set. Behavior is undefined if the former is <= the latter.
| [in] | size | An int32_t containing the property value. |
| bool pp::URLRequestInfo::SetProperty | ( | PP_URLRequestProperty | property, |
| const Var & | value | ||
| ) |
SetProperty() sets a request property.
The value of the property must be the correct type according to the property being set.
| [in] | property | A PP_URLRequestProperty identifying the property to set. |
| [in] | value | A Var containing the property value. |
| bool pp::URLRequestInfo::SetRecordDownloadProgress | ( | bool | enable | ) | [inline] |
SetRecordDownloadProgress() sets the PP_URLREQUESTPROPERTY_RECORDDOWNLOADPROGESS
(corresponding to a bool of type PP_VARTYPE_BOOL
).
The default of the property is false. Set this value to true if you want to be able to poll the download progress using URLLoader::GetDownloadProgress().
| [in] | enable | A bool containing the property value. |
| bool pp::URLRequestInfo::SetRecordUploadProgress | ( | bool | enable | ) | [inline] |
SetRecordUploadProgress() sets the PP_URLREQUESTPROPERTY_RECORDUPLOADPROGRESS
(corresponding to a bool of type PP_VARTYPE_BOOL
).
The default of the property is false. Set this value to true if you want to be able to poll the upload progress using URLLoader::GetUploadProgress().
| [in] | enable | A bool containing the property value. |
| bool pp::URLRequestInfo::SetStreamToFile | ( | bool | enable | ) | [inline] |
SetStreamToFile() sets the PP_URLREQUESTPROPERTY_STREAMTOFILE
(corresponding to a bool of type PP_VARTYPE_BOOL
).
The default of the property is false. Set this value to true if you want to download the data to a file. Use URL_Loader::FinishStreamingToFile() to complete the download.
| [in] | enable | A bool containing the property value. |
| bool pp::URLRequestInfo::SetURL | ( | const Var & | url_string | ) | [inline] |


{% extends "malepy/user_base.html" %}
{% block article %}
Submission Info
Team: {{ submission.user.username }}
Members: {{ submission.user.members }}
{% else %}Student: {{ submission.user.first_name }} {{ submission.user.last_name }}
{% endif %}Course: {{ submission.assignment.course.name }}({{ submission.assignment.course.year }})
Assignment: {{ submission.assignment.name_en }}
Created: {{ submission.created| date:"d-M-Y @ H:i" }}h
{% if submission.approved %}Result ({{ submission.assignment.measurement }}): {{ submission.result }}
{% else %}Result ({{ submission.assignment.measurement }}): {{ submission.result }}
{% endif %} {% if display_download %}Source code: Python code
{% endif %} {% endblock %} {% block actions %}


DANCE WITH ME RATING: 5.5 / 10 --> Not good enough to recommend
For more reviews, go to http://surf.to/joblo
Latin sensation Chayanne makes his way over to the United States of America to star in this bubble gum, saccharine-filled romantic dance movie, opposite the green-eyed, and always beautiful, Vanessa L. Williams.
PLOT: Young Cuban man Rafael comes to the U.S. to find his real father. Upon arrival, he works as a handyman at a local dance studio, and falls for one of the dance teachers who happens to be rehearsing for the annual Latin dance contest in Las Vegas. Dancing shoes pronounced, Rafael also gets the opportunity to compete in the contest. Dance and romance soon blooms.
CRITIQUE: Light, mostly corny, lengthy dance-themed movie, that does have a great soundtrack, and some good performances by the two, beautiful, charismatic leads, Chayanne and Vanessa L. Williams. I would not necessarily suggest this film for its romantic aspects, because they are pretty weak, but if you like to stare at either of the film's main stars, and if you like the Latin vibe and/or the dancing, then you might not be totally disappointed with this movie. Having said that, the dancing sequences seemed to be absent during most of the first hour of the film, but did take over the movie, once the whole gang was transported to Las Vegas for the dance contests.
Chayanne, in his first American starring role, is the rich man's Benicio Del Toro. He's great looking, dresses impeccably, dances like a machine, and radiates great sensations with his full-toothed smile. He also pulls off a humorous and original tribute to Gene Kelly from SINGIN' IN THE RAIN. Vanessa L. Williams also looks great in this film, if you like girls with super-short skirts, great legs and pumps, that is. (turns out I do). There is also some chemistry between the two, but unfortunately, the screenplay is pretty lame, and doesn't really do a great job of convincing you of their absolute compatibility. No cheap sex scenes either. Which was a bit of a letdown for most people, I think. Then again, who cares. These bastards could dance up a storm and look great doing it, so if that's what you're looking for, shell out your hard-earned cash, and have a blast!
One extremely funny aspect of this film, was the fact that Kris Kristofferson was actually cast as an experienced dance instructor, and a man with actual emotions.  On a positive note, the soundtrack was very sweet, reminded me a bit of the MAMBO KINGS (7.5/10) vibe, and the salsa music kept reminding me of the nacho plate that I would soon make myself, once I got home and dug into some real salsa. Having said all that, it must be said that I have never been a dancer, a fan of dance, or a fan of dance movies, but Mrs. JoBlo is. You figure out the pant-wearing scenario in that equation. For the record, she also rated the film a measly 6/10.
 The "L" in Vanessa L. Williams' name stands for Lynn. She is often confused with actress Vanessa Williams from the "Chicago Hope" TV series. The Screen Actors Guild assigned her with the name Vanessa L. Williams but the initial rarely appears in credits. The SAG will only make it an issue if the other actress objects. Even news stories often confuse the two. Vanessa dropped out of Syracuse University to pursue the Miss America crown in 1983, and never finished her degree. Once crowned Miss America, she was dethroned when nude photos of her surfaced in Penthouse magazine. The centerfold model for that issue was 16-year-old Traci Lords. Now since Ms. Lords was underage at the time, it is illegal to own or trade that issue of the magazine, unless the centerfold pictorial is removed. Vanessa had three children with her husband of 10 years, Ramon Hervey (They divorced in 1997.) Screenwriter Daryl Matthews, partnered with Liz Curtis, was also responsible for the choreography of the dance sequences in this film (He is a former dancer himself.) Chayanne is born in Puerto-Rico, where he is a recording artist and TV soap actor.
Review Date: August 23, 1998 Director: Randa Haines Writer: Daryl Matthews Producers: Randa Haines, Shinya Egawa and Lauren Weissman Actors: Chayanne as Rafael Infante Vanessa L. Williams as Ruby Sinclair Kris Kristofferson as John Burnett Genre: Romantic Dance Year of Release: 1998
Visit JoBlo's Movie Emporium http://surf.to/joblo
(c) 1998 Berge Garabedian
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Raspberry Pi is slowly finding a lot of applications related to image processing. I am going to provide a little overview of how one can get OpenCV up and running on your pi. I will be using tightVNC server for getting the display.
The first step is getting OpenCV installed on your pi, we will follow the exact same procedure of installing OpenCV which I use on ubuntu. I will show you step by step on how to get your opencv setup on rpi ready.
Step Zero
Before we begin, I will tell you how my pi is connected so there is no confusion after moving further.
I have my pi connected to my wi-fi router with a LAN cable and have changed it to a static IP configuration. I am accessing it through my terminal using the ssh channel. In short what I have now and what you should have is a rpi with it’s terminal. If you are totally new to rpi, I suggest you to take a look at these tutorials for setting up your pi get you pi up and running.
Step One
Install tightvncserver on the rpi as well as your linux powered laptop/desktop where you plan to get the display window of your pi. You can do that by a simple command sudo apt-get install tightvncserver
Step Two
Now we start the vnc-server in the rpi, this will broadcast the “screen” of the rpi over the server, which then can be accessed remotely from some other laptop/desktop connected with the same server. In order to do this we need to run the following command on the rpi terminal:
vncserver :1 -geometry 1366x600 -depth 16 -pixelformat rgb565
If you are doing this for the first time then it will ask you for setting a password (Yes, you need to remember it!). After finishing that you should see the following on the rpi’s terminal.
#New ‘X’ desktop is raspberrypi:1
This means you have successfully got your rpi desktop put up on your server, now you need to access it.
Step Three
Now using the laptop/desktop’s terminal and execute this command:
vncviewer rpi_ip:5901
Here, rpi_ip is the static IP which you would have set for your pi. You will be asked for a password which you have set in the previous step, and then voila!. :D
Step Four
Now all you need is to get opencv installed on your rpi. To get that done just follow the steps which you will use to install opencv in normal ubuntu based system, if you are comfortable with it then this tutorial stops here for you.For OpenCV installation Just follow the steps listed here(OpenCV installation on Ubuntu).
You will also need two scripts in above installation the opencv installation. Get them from here:
opencv2_4_6_1.sh
new
Thank You!


Home
About
Services
Contact
<EMAIL_ADDRESS>Search
×
Home
contact
Contact Us
Get in touch with Us
Location
Prague, Czechia
Phone
+420 608 215 942
Email
<EMAIL_ADDRESS>Working Hours
8:00 - 17:00
Name
Email(Required)*
Subject*
Phone Number*
Message(Required)*
Submit Message


This method can be applied to a plane that contains originally randomly distributed points which changed their position during flattening or shearing.
Suitable material for the method should therefore contain markes
distributed in a matrix. Fabrics which are strongly grain supported are
therefore not suitable. For the centre points of these markers the
coordinates are calculated and saved. The graphic evaluation is as
follows: All centre points are drawn on a sheet of paper. Next a cross
is drawn on a transparent overlay. This cross is centered on the first
centre point and all other point are copied on the overlay. This
procedure is continued with all the other points. The result is an
elliptical area in the centre which contains no or only very few
points. This area resembles the strain ellipse. This procedure has been
programmed. The user only has to set up a file which contains the
coordinates of the original centre points.
A) Centre of the overlay with cross on point 1, all other points are copied.
B) Cross on point 2, all other points copied.
C) The final diagram


@* * Copyright 2021 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import views.html.templates.formatters.links._ @import java.time.LocalDate @import views.templates.formatters.dates.DisplayDateRangeHelper.displayDate @this(openInNewTab: OpenInNewTab) @(paymentsData: Option[String], hasMultiple: Boolean, isError: Boolean, isHybridUser: Boolean, isOverdue: Boolean)(implicit messages: Messages)
@(paymentsData, hasMultiple, isError) match { case (_, _, true) => { @messages("vatDetails.error") } case (Some(numOfPayments), true, _) => { @messages("vatDetails.paymentsDue", numOfPayments)} case _ => { @paymentsData.map(date => displayDate(LocalDate.parse(date))).getOrElse(messages("payment.noPayment")) @if(isOverdue){ @messages("common.overdue") } } }
}


Nyoka's Pre-Process Module¶
-
class
lag.
Lag
(aggregation, value=2, copy=True)[source]¶ Bases:
sklearn.base.TransformerMixin
The Lag class takes value number of previous record of the fields where it is applied and applies aggregation to those values.
- aggregation : String
- aggregation type. The valid types are [“min”, “max”, “sum”, “avg”, “median”, “product”, “stddev”]
- value : Integer (default = 2)
- The number of previous record to aggregate


☯ Ɠƴr̊tlę.lo̊ɠ
✑ Gyrtle is a gomper turtle.
fløw
❯ gmprDB
❯ ellow!
code
On my mark, HU GO?
1 of 1
tuples:
code
(1)
points:
markdown
(1)
webdev
(1)


Name is required.
Last Name is required.
Enter a valid email.
Password is too short.
Password is too long.


#include <Zone.h>
Public Member Functions | |
| Zone (const Zone *zone) | |
| Zone (FILE *file, int numberOfPositions) | |
| Zone (int numberOfPositions) | |
| Zone (const Zone *zone1, const Zone *zone2, int operation) | |
| Zone (const Level *level, const int *levelToZonePos, const int *zoneToLevelPos, const int length, const int operation) | |
| Zone (const Zone *boxes, const int startPos, const int *levelToZonePos, int colsNumber) | |
| ~Zone () | |
| int | getLength (void) const |
| const unsigned int * | getZoneTab (void) const |
| int | getNumberCell (void) const |
| void | print (void) const |
| void | print (const Level *level, const int *levelToZonePos) const |
| int | readPos (const int pos) const |
| void | write1ToPos (const int pos) const |
| void | write0ToPos (const int pos) const |
| bool | isEgal (const Zone *otherZone) const |
| bool | isFullOf0 () const |
| bool | isFullOf1 () const |
| bool | isIncludedIn (const Zone *anotherZone) const |
| int | getNumberOf1 () const |
| Zone * | applyOrWith (Zone *otherZone) |
| Zone * | applyAndWith (Zone *otherZone) |
| Zone * | applyXorWith (Zone *otherZone) |
| Zone * | applyNot () |
| Zone * | applyMinusWith (Zone *otherZone) |
| void | saveInFile (FILE *file) |
Protected Member Functions | |
| void | makeBoxesZone (const Level *level, const int *zoneToLevelPos) |
| void | makePusherZone (const Level *level, const int *levelToZonePos, const int *zoneToLevelPos) |
| void | recursiveMakePusherZone (const Zone *boxes, const int startPos, const int *levelToZonePos, const int colsNumber) |
| void | makeDeadlockZone (const Level *level, const int *levelToZonePos, const int *zoneToLevelPos) |
| void | makeCornerDeadlockZone (const Level *level, const int *zoneToLevelPos) |
| void | makeLineDeadlockZone (const Level *level, const int *levelToZonePos, const int *zoneToLevelPos) |
| void | makeGoalZone (const Level *level, const int *zoneToLevelPos) |
| void | makeORZone (const Zone *zone1, const Zone *zone2) |
| void | makeANDZone (const Zone *zone1, const Zone *zone2) |
| void | makeXORZone (const Zone *zone1, const Zone *zone2) |
| void | makeNOTZone (const Zone *zone1) |
| void | copyZone (const Zone *source) |
| bool | isInCorner (const Level *level, const int pos) const |
Protected Attributes | |
| unsigned int * | zone |
| int | length |
Can be used to represent boxes zone, pusher move zone, deadlocks zone or goals zone.
Zone is stocked in a unsigned integer tab (unsigned int = 2 or 4 bits depending of the CPU). Each "usefull" cell of the level (see zoneToLevelPos from solver) corresponds to 1 bit. If this bit is "1" then there is a "box/possible move/deadlock/goal" on this position depending of the wanted action.
Boxes zone representation : 1 if there is a box in this zone position, 0 if not Goals zone representation : 1 if there is a goal in this zone position, 0 if not Deadlock zone representation : 1 if there is a deadlock when a box is in this zone position, 0 if not Pusher move zone representation : 1 if pusher can move on this position OR if this is a box position just next a place where pusher can move, 0 if not
| Zone::Zone | ( | const Zone * | zone | ) |
Constructor for a zone copied from an existing zone
| zone | zone we want to copy |
| Zone::Zone | ( | FILE * | file, | |
| int | numberOfPositions | |||
| ) |
Constructor to create a zone from a opened file
| file | handle to opened file | |
| numberOfPositions | number of needed positions to store this zone |
| Zone::Zone | ( | int | numberOfPositions | ) |
Constructor to create a zone with a certain number of free positions
| numberOfPositions | number of needed positions to store this zone |
Constructor for a zone based on a binary operation on others zones
| zone1 | first zone in binary operation | |
| zone2 | second zone in binary operation | |
| operation | Kind of binary operation you want to make : Zone::USE_OR new zone will be the result of an OR operation between zone1 and zone2 Zone::USE_AND new zone will be the result of an AND operation between zone1 and zone2 Zone::USE_XOR new zone will be the result of an XOR operation between zone1 and zone2 Zone::USE NOT new zone will be the result of an NOT operation apply on zone1. zone2 is not used in this case and can be NULL. |
| Zone::Zone | ( | const Level * | level, | |
| const int * | levelToZonePos, | |||
| const int * | zoneToLevelPos, | |||
| const int | length, | |||
| const int | operation | |||
| ) |
Constructor for a zone based on a level state
| level | original level we want to make zones from it | |
| levelToZonePos | link between real positions and zone positions | |
| zoneToLevelPos | link between zone positions and real positions in the level | |
| length | Number of cells in zoneToLevelPos (number of bits needed) | |
| operation | Kind of zone we want to make : Zone::PROCESS_BOXES if we want to save positions of boxes in the zone Zone::PROCESS_PUSHER if we want to save possibilities of move of the pusher Zone::PROCESS_DEADLOCK if we want to save every places where a deadlock appears if a box is on it. Zone::PROCESS_GOAL if we want to save every goal places |
| Zone::Zone | ( | const Zone * | boxes, | |
| const int | startPos, | |||
| const int * | levelToZonePos, | |||
| int | colsNumber | |||
| ) |
Constructor for pusher zone based on a boxes zone and a starting position
| boxes | Boxes zone of the level we want to make pusher zone | |
| startPos | Starting position of the pusher (level representation) | |
| levelToZonePos | Link between real positions and zone positions | |
| colsNumber | Number of cols in level |
| Zone::~Zone | ( | ) |
Destructor
| int Zone::getLength | ( | void | ) | const [inline] |
Number of positions in the zone
| const unsigned int* Zone::getZoneTab | ( | void | ) | const [inline] |
Binary representation of the zone
| int Zone::getNumberCell | ( | void | ) | const [inline] |
Calculate number of cells usefull to represent this zone
| void Zone::print | ( | void | ) | const |
Print a zone in integer and binary mode
| void Zone::print | ( | const Level * | level, | |
| const int * | levelToZonePos | |||
| ) | const |
Print a zone in its level form
| level | original level corresponding to the zone | |
| levelToZonePos | Translation table between level and zone |
| int Zone::readPos | ( | const int | pos | ) | const [inline] |
Read position "pos" of the zone and return 1 or 0 depending of the bit state at this position
| pos | Position we want to read 0 <= pos < NumberCell()*sizeof(unsigned int) |
| void Zone::write1ToPos | ( | const int | pos | ) | const |
Set binary number '1' in the position "pos" of the zone
| pos | Position where we want to set 1 0 <= pos < NumberCell()*sizeof(unsigned int) |
| void Zone::write0ToPos | ( | const int | pos | ) | const |
Set binary number '0' in the position "pos" of the zone
| pos | Position where we want to set 1 0 <= pos < NumberCell()*sizeof(unsigned int) |
| bool Zone::isEgal | ( | const Zone * | otherZone | ) | const |
Test if this zone is egal to another zone
| otherZone | Other zone we want to compare to this Zone object WARNING : 2 zones must have same lengths ! |
| bool Zone::isFullOf0 | ( | ) | const |
Test if a zone is full of 0 : every bits (and so cells) are egal to 0
| bool Zone::isFullOf1 | ( | ) | const |
Test if a zone is full of 1 : every bits are egal to 1
| bool Zone::isIncludedIn | ( | const Zone * | anotherZone | ) | const |
Test if a zone is included in another zone
| anotherZone | zone where this zone is included or not |
| int Zone::getNumberOf1 | ( | ) | const |
Return number of 1 in this zone
Make a zone representation resulting of a binary operation OR between this zone and the other zone
| otherZone | Zone to make binary operation with |
Make a zone representation resulting of a binary operation AND between this zone and the other zone
| otherZone | Zone to make binary operation with |
Make a zone representation resulting of a binary operation XOR between this zone and the other zone
| otherZone | Zone to make binary operation with |
| Zone * Zone::applyNot | ( | ) |
Make a zone representation resulting of a binary operation XOR between this zone and the other zone
Make a zone representation resulting of a MINUS binary operation between this zone and the other zone
| void Zone::saveInFile | ( | FILE * | file | ) |
Save this zone directly into a file
| void Zone::makeBoxesZone | ( | const Level * | level, | |
| const int * | zoneToLevelPos | |||
| ) | [protected] |
Make a zone representation of boxes positions in a level
| level | Level we want to make zone | |
| zoneToLevelPos | Link between zone positions and real positions in the level |
| void Zone::makePusherZone | ( | const Level * | level, | |
| const int * | levelToZonePos, | |||
| const int * | zoneToLevelPos | |||
| ) | [protected] |
Make a zone representation of pusher possible moves in a level
| level | Level we want to make zone | |
| levelToZonePos | Link between level positions and zone positions | |
| zoneToLevelPos | Link between zone positions and real positions in the level |
| void Zone::recursiveMakePusherZone | ( | const Zone * | boxes, | |
| const int | startPos, | |||
| const int * | levelToZonePos, | |||
| const int | colsNumber | |||
| ) | [protected] |
Recursively make a zone representation of pusher possible moves in a level
| boxes | Zone representation of boxes in this level | |
| startPos | Starting position (level representation) of the pusher | |
| levelToZonePos | Link between level positions and zone positions | |
| colsNumber | Number of cols in level |
| void Zone::makeDeadlockZone | ( | const Level * | level, | |
| const int * | levelToZonePos, | |||
| const int * | zoneToLevelPos | |||
| ) | [protected] |
Make a zone representation of places where deadlocks appear if a box is on it
| level | Level we want to make zone | |
| levelToZonePos | Link between level positions and zone positions | |
| zoneToLevelPos | Link between zone positions and real positions in the level |
| void Zone::makeCornerDeadlockZone | ( | const Level * | level, | |
| const int * | zoneToLevelPos | |||
| ) | [protected] |
This function add corner deadlocks to deadlock zone. This happened when there is a box in a corner made by walls
| level | Level we want to make zone | |
| zoneToLevelPos | Link between zone positions and real positions in the level |
| void Zone::makeLineDeadlockZone | ( | const Level * | level, | |
| const int * | levelToZonePos, | |||
| const int * | zoneToLevelPos | |||
| ) | [protected] |
This function add line deadlocks to deadlock zone. This happened when there is a box next a wall and no way to remove it (escape move) You must apply this function AFTER the use of function makeCornerDeadlockZone because we need corner positions.
| level | Level we want to make zone | |
| levelToZonePos | Link between level positions and zone positions | |
| zoneToLevelPos | Link between zone positions and real positions in the level |
| void Zone::makeGoalZone | ( | const Level * | level, | |
| const int * | zoneToLevelPos | |||
| ) | [protected] |
Make a zone representation of goal places
| level | Level we want to make zone | |
| zoneToLevelPos | Link between zone positions and real positions in the level |
Make a zone representation resulting of a binary operation OR
| zone1 | first zone in binary operation | |
| zone2 | second zone in binary operation |
Make a zone representation resulting of a binary operation AND
| zone1 | first zone in binary operation | |
| zone2 | second zone in binary operation |
Make a zone representation resulting of a binary operation XOR
| zone1 | first zone in binary operation | |
| zone2 | second zone in binary operation |
| void Zone::makeNOTZone | ( | const Zone * | zone1 | ) | [protected] |
Make a zone representation resulting of a binary operation NOT
| zone1 | first zone in binary operation |
| void Zone::copyZone | ( | const Zone * | source | ) | [protected] |
Copy other zone in this object. Used by constructor.
| source | zone to be copied in this object. |
| bool Zone::isInCorner | ( | const Level * | level, | |
| const int | pos | |||
| ) | const [protected] |
return true if position is in a corner of level (corner with 2 walls)
| level | Level we want to test | |
| pos | Position we want to test in the level |
unsigned int* Zone::zone [protected] |
binary representation of the zone
int Zone::length [protected] |
Number of positions in the zone


A B C D E F G H I L M N O P Q R S T U W Z misc
| abind | Combine Image Arrays |
| abind-method | Combine Image Arrays |
| abind-methods | Combine Image Arrays |
| affine | Spatial linear transformations |
| animate | Defunct functions in package 'EBImage' |
| as.array.Image | Image class |
| as.Image | Image class |
| as.raster.Image | Image class |
| blackTopHat | Perform morphological operations on images |
| blackTopHatGreyScale | Defunct functions in package 'EBImage' |
| blur | Defunct functions in package 'EBImage' |
| bwlabel | Binary segmentation |
| channel | Color and image color mode conversions |
| clahe | Contrast Limited Adaptive Histogram Equalization |
| closing | Perform morphological operations on images |
| closingGreyScale | Defunct functions in package 'EBImage' |
| cmoments | Defunct functions in package 'EBImage' |
| Color | Image class |
| colorLabels | Color Code Labels |
| colormap | Map a Greyscale Image to Color |
| colorMode | Image class |
| colormode | Image class |
| colorMode<- | Image class |
| combine | Combine images |
| combine-method | Combine images |
| computeFeatures | Compute object features |
| computeFeatures.basic | Compute object features |
| computeFeatures.haralick | Compute object features |
| computeFeatures.moment | Compute object features |
| computeFeatures.shape | Compute object features |
| dilate | Perform morphological operations on images |
| dilateGreyScale | Defunct functions in package 'EBImage' |
| display | Image Display |
| display-shiny | Shiny Bindings for display |
| displayOutput | Shiny Bindings for display |
| distmap | Distance map transform |
| drawCircle | Draw a circle on an image. |
| drawfont | Defunct functions in package 'EBImage' |
| drawtext | Defunct functions in package 'EBImage' |
| EBImage | Package overview |
| EBImage-defunct | Defunct functions in package 'EBImage' |
| edgeFeatures | Defunct functions in package 'EBImage' |
| edgeProfile | Defunct functions in package 'EBImage' |
| equalize | Histogram Equalization |
| erode | Perform morphological operations on images |
| erodeGreyScale | Defunct functions in package 'EBImage' |
| fillHull | Fill holes in objects |
| filter2 | 2D Convolution Filter |
| flip | Spatial linear transformations |
| floodFill | Region filling |
| flop | Spatial linear transformations |
| gblob | Compute object features |
| gblur | Low-pass Gaussian filter |
| getFeatures | Defunct functions in package 'EBImage' |
| getFrame | Image class |
| getFrames | Image class |
| getNumberOfFrames | Defunct functions in package 'EBImage' |
| Grayscale | Image class |
| haralickFeatures | Defunct functions in package 'EBImage' |
| haralickMatrix | Defunct functions in package 'EBImage' |
| hist-method | Image class |
| hullFeatures | Defunct functions in package 'EBImage' |
| Image | Image class |
| Image-class | Image class |
| image-method | Image class |
| imageData | Image class |
| imageData<- | Image class |
| is.Image | Image class |
| localCurvature | Local Curvature |
| log-method | Image class |
| makeBrush | Perform morphological operations on images |
| Math2-method | Image class |
| median.Image | Image class |
| medianFilter | 2D constant time median filtering |
| moments | Defunct functions in package 'EBImage' |
| normalize | Intensity values linear scaling |
| normalize-method | Intensity values linear scaling |
| numberOfFrames | Image class |
| ocontour | Oriented contours |
| opening | Perform morphological operations on images |
| openingGreyScale | Defunct functions in package 'EBImage' |
| Ops-method | Image class |
| otsu | Calculate Otsu's threshold |
| paintObjects | Mark objects in images |
| plot.Image | Image Display |
| print.Image | Image class |
| propagate | Voronoi-based segmentation on image manifolds |
| quantile.Image | Image class |
| readImage | Image I/O |
| reenumerate | Object removal and re-indexation |
| renderDisplay | Shiny Bindings for display |
| resize | Spatial linear transformations |
| rgbImage | Color and image color mode conversions |
| rmObjects | Object removal and re-indexation |
| rmoments | Defunct functions in package 'EBImage' |
| rotate | Spatial linear transformations |
| selfComplementaryTopHat | Perform morphological operations on images |
| selfcomplementaryTopHatGreyScale | Defunct functions in package 'EBImage' |
| show-method | Image class |
| smoments | Defunct functions in package 'EBImage' |
| stackObjects | Places detected objects into an image stack |
| standardExpandRef | Compute object features |
| thresh | Adaptive thresholding |
| tile | Tiling/untiling images |
| toRGB | Color and image color mode conversions |
| translate | Spatial linear transformations |
| transpose | Image Transposition |
| untile | Tiling/untiling images |
| watershed | Watershed transformation and watershed based object detection |
| whiteTopHat | Perform morphological operations on images |
| whiteTopHatGreyScale | Defunct functions in package 'EBImage' |
| writeImage | Image I/O |
| zernikeMoments | Defunct functions in package 'EBImage' |
| [-method | Image class |


AMAZING PEOPLE ARE MAKING AMAZING DESIGN IN FUN ENVIRIONMENT
When you work with us you are part of the team of committed collaborators. All process of our software developement process are integrated, interactiive
and agile.
Our product unifies design and product management to create exceptional product.
We start every project by understanding your business goals, user's need and the prouct requirements.
The we help translate them into elegant business solutions.
Before we sign a contract or write a line of code, our team will spend the necessary time needed to understand your product vision
The outcome of this scoping session is a proposal or high level statement of work
based on your requirements, we can provide acomplete offering or just the pieces you need.
Our design property offers a wide range of facilities including branding,marketing and sourcing
Our development department are constantly busy with work loads from clients.
Our products have been highly rated and clients have recommented others on them generally.


Custom labels:
Added {{custlabelcrdtdisplay}}
Not used
Download
Upload
Wrong format, we accept .csv
{{labelUploadError}}
Default timezone:
{{tzone.v}}
Length of start phase:
{{$index+1}}
Days
Notification send - time:
0{{$index+1}}:00
{{$index+1}}:00
Notification send - days:
Monday
Tuesday
Wednesday
Thursday
Friday
Saturday
Sunday
SENDING NOTIFICATION, DAYS:
Notifications will only send on selected days. All notifications due to send on days not selected will be postponed sending until reaching the following selected day for sending notifications.
Messaging gateway mode:
Send notifications as normal
Stop all notifications
Redirect all notifications to...
Mark sequence 'overdue' if not complete after:
{{$index+1}} Day
{{$index+1}} Days
Learn assessment time frame:
1 minute
0.5 hour
1 Hour
3 Hours
6 Hours
24 Hours
48 Hours
Minimum
Assessment Timeframe
The minimum time determines the window from when an assesment can be either manually or automatically trigger for completion.
Send daily reminders until sequence is marked 'overdue':
Send 'overdue' escalation email to admin:
When a sequence is marked 'overdue'
Default escalation email:
Email address required.
Invalid email address.
DEFAULT ESCALATION EMAIL
Escalation emails notify Admin of errors and alerts that occur during a workflow.
Profile menu for workflows:
Profile menu
Profile-menu
Participants can access tasks and workflow-related features from a menu tab.
SMS Gateway:
Burst-Twilio
Twilio
Esendex
Custom fonts:
Setup custom fonts
Active
Inactive
Default messages:
{{custlabels.Manager || 'Manager'}} Notification
{{custlabels.Employee || 'Employee'}} Notification
Finish page


To create a new S3 entry go to the File->Pick a Type menu and select "AWS S3". In the create form entry the S3 URL, a name and an optional description: [ht::screenshot images/s3/s3new.png {Creating a New S3 Entry } {border:var(--basic-border);}] After adding the entry you can edit it to configure how the S3 buckets are displayed. [ht::screenshot images/s3/s3edit.png {S3 Entry Configuration} {border:var(--basic-border);}]
pattern;template;date formatand is used to match against a folder or file name. The pattern needs to contain "(...)" groups. If it matches then the matching groups are extracted and the template (the 2nd part of the 3-tuple) is used to create a date string. This date string is then parsed by the date format.
key1=value1 key2=value2 ...If it is a .txt file then the first line is the key that is matched against the S3 folder names and the rest of the file is a wiki display template:
key_or_pattern wiki text ...
For the NEXRAD example we will upload a nexrad.csv file. This has the following structure:
id,fullname,lat,lon KAPD,KAPD - Fairbanks/Pedro Dome,65.035,-147.50167 KAEC,KAEC - Fairbanks/Nome,64.51139,-165.295 KACG,KACG - Juneau/Sitka,56.85278,-135.52917 KAIH,KAIH - Anchorage/Middleton Island,59.46139,-146.30306 ...The first column is the station ID and this is used to match up (either exact or pattern) with the S3 folders. Upload the nexrad.csv file and select Alias and Exact: :p [ht::screenshot images/s3/nexrad3.png {Adding a Convert File} {border:var(--basic-border);}] :p Now, the station folders have the full name. Next, upload the same file and select "Location". This adds the spatial metadata to the station folders.
Note: we have combined the aliases with the locations. The aliases file could have been a properties file: nexrad_aliases.properties file.
Next, we want to specify the wiki template to be used for the folder that contains the stations, i.e., the year/month/day folder. Here we will upload this nexrad_templates.txt file. It has the format:
^\\d\\d/\\d\\d$The first line is a pattern that matches NN/NN, i.e., the month/day folder names. The remainder of the file is the wiki text to be used for the folders that match the pattern. :p Upload this file, select "Template" and for match type select "Pattern". Now, for the day folder we should have: :p [ht::screenshot images/s3/nexrad4.png {} {border:var(--basic-border);}] :p And finally, we want to show the files as "Level 3 Radar" files, a file format that RAMADDA provides. To do this go to the Add Properties menu and under Miscellaneous select "Entry Type Patterns". This property allows you to specify an entry type (e.g., Level 2 Radar File) and one or more patterns to match. For the NEXRAD data collection we know that all of the files are of this type so we specify as a pattern "file:" :p [ht::screenshot images/s3/nexrad5.png {} {border:var(--basic-border);}] :p Now, with that the files should be shown as this entry type: :p [ht::screenshot images/s3/level2.png {} {border:var(--basic-border);}] :p+section title="NEXRAD Stations - { {name entry=parent} } { {name} } { {name entry=grandparent} }" +inset left=20px right=20px { {map listentries=true hideIfNoLocations=true} } ...
s3://first-street-climate-risk-statistics-for-noncommercial-use/


Try out our Premium Member services: Virtual Legal Assistant, Query Alert Service and an ad-free experience. Free for one month and pay only if you like it.
C/SCA/6807/2018 ORDER IN THE HIGH COURT OF GUJARAT AT AHMEDABAD R/SPECIAL CIVIL APPLICATION NO. 6807 of 2018 =========================================================== OMKAR INTERMEDIATES Versus GUJARAT POLLUTION CONTROL BOARD ================================================================ Appearance: MR RITURAJ M MEENA(3224) for the PETITIONER(s) No. 1 MS NIYATI K JUTHANI(7014) for the PETITIONER(s) No. 1 for the RESPONDENT(s) No. 1 ================================================================ CORAM: HONOURABLE MR.JUSTICE M.R. SHAH and HONOURABLE MR.JUSTICE A.Y. KOGJE Date : 27/04/2018 ORAL ORDER
(PER : HONOURABLE MR.JUSTICE M.R. SHAH) Learned Advocate for the petitioner Mr. Rituraj M. Meena seeks permission to withdraw the present petition, with a liberty to initiate appropriate proceedings before the appropriate forum including an Appeal to the National Green Tribunal as provided under Section 33.B of the Water (Prevention and Control of Pollution) Act, 1974.
Permission as prayed for is granted. The petition stands dismissed of as withdrawn with the aforesaid liberty.
Sd/-
(M.R. SHAH, J) Sd/-
(A.Y. KOGJE, J) CAROLINE Page 1 of 1


I work with businesses and marketing firms to create functional, beautiful, and effective web sites and advertising tools.


[§460J-7] Investigation permitted. The board may investigate, classify, and qualify applicants for operators' licenses. [L 1972, c 134, pt of §1]


Inherits std::vector<section<Box, DimensionCount> >.
Public Types | |
| typedef Box | box_type |
Static Public Attributes | |
| static const std::size_t | value = DimensionCount |
vector might be templated in the future
Definition at line 105 of file sectionalize.hpp.
| typedef Box boost::geometry::sections< Box, DimensionCount >::box_type |
Definition at line 107 of file sectionalize.hpp.
const std::size_t boost::geometry::sections< Box, DimensionCount >::value = DimensionCount [static] |
Definition at line 108 of file sectionalize.hpp.
|
December 1, 2009 |
Copyright © 1995-2009 Barend Gehrels, Geodan, Amsterdam Copyright © 2008-2009 Bruno Lalande, Paris Copyright © 2009 Mateusz Loskot, Cadcorp, London |


Consider the following example of a LightBot program written out in text. Again, in this case we have named our robot "andy". How many times would andy jump?
f1: andy.move(); andy.turnRight(); andy.move(); f2: andy.jump(); andy.jump(); andy.jump(); main: andy.f1(); andy.f1(); andy.jump();
>The f1() method is run twice, but f2() never gets called from the main and thus never runs in this code!


This application is designed to help user to know their birth day.
when they select Date,month , year and gender .
so depending with the day you born with this application will
show you the akaname correspond to the day you born with.
your akaname is


Logo
Navbar Link
Navbar Link
menu
Your Profile
Checked Out Items
The Dress
Checked Out: 8/12/16
Due Date: 8/19/16
grade
The Shirt
Checked Out: 8/15/16
Due Date: 8/22/16
grade
The Skirt
Checked Out: 8/12/16
Due Date: 8/19/16
grade
Your Friend Network
Stephanie
grade
John
grade
Sarah
grade
Lending Out
The Blazer
grade
The Pants
grade
The Children's Dress
grade
Your Closet Coins
100 Closet Coins
grade


The builtin type varString.
The varString can contain any sequence of Unicode characters, including
NUL.
VarString is mutable. The characters are stored in an optimal way,
depending on the mutations. When possible a string is used. When
appending strings a list of strings is used to avoid reallocation and
copying. When appending characters extra space is allocated to reduce
reallocations.
The characters are UTF-8 encoded. Illegal byte sequences may appear but
cause an exception for operations that work with characters.
The storage is identical to varByteString, a varString can be typecast to
varByteString and the other way around without conversion:
| $Size() int @public |
Return the size of the varString in characters.
|
| $ToString() string @public |
Return the varString as a string.
|
| $toVarString() string @public |
Return the varString as-is, this is a no-op.
|
| $asVarbyteString() varByteString @public |
Return the varString as a varByteString.
|
| $toVarbyteString() varByteString @public |
Return the varString as a varByteString.
|
| $toInt() int @public |
Return the digits at the start of the varString converted to a number.
|
| $toInt(default) int @public |
Return the digits at the start of the varString converted to a number.
|
| $quotedToInt() int @public |
Return the digits at the start of the varString converted to a number,
ignoring quotes.
|
| $quotedToInt(default) int @public |
Return the digits at the start of the varString converted to a number,
ignoring quotes.
|
| $hexToInt() int @public |
Return the hex digits at the start of the varString converted to a number.
|
| $hexToInt(default) int @public |
Return the hex digits at the start of the varString converted to a number.
|
| $quotedHexToInt() int @public |
Return the hex digits at the start of the varString converted to a number,
ignoring quotes.
|
| $quotedHexToInt(default) int @public |
Return the hex digits at the start of the varString converted to a number,
ignoring quotes.
|
| $binToInt() int @public |
Return the binary digits at the start of the varString converted to a
number.
|
| $binToInt(default) int @public |
Return the binary digits at the start of the varString converted to a
number.
|
| $quotedBinToInt() int @public |
Return the binary digits at the start of the varString converted to a
number, ignoring quotes.
|
| $quotedBinToInt(default) int @public |
Return the binary digits at the start of the varString converted to a
number, ignoring quotes.
|
| $toLower() varString @public |
Return a copy of the varString with all characters lower-cased.
|
| $toLowerAscii() varString @public |
Return a copy of the varString with all ASCII characters lower-cased.
|
| $toUpper() varString @public |
Return a copy of the varString with all characters upper-cased.
|
| $toUpperAscii() varString @public |
Return a copy of the varString with all ASCII characters upper-cased.
|
| $find(s) int @public |
Return the lowest index where varString s appears.
|
| $find(c) int @public |
Return the lowest index of the character c.
|
| $find(s, start) int @public |
Return the lowest index where the varString s appears at or after start.
|
| $find(c, start) int @public |
Return the lowest index of the character c at or after start.
|
| $findLast(s) int @public |
Return the highest index where varString s appears.
|
| $findLast(c) int @public |
Return the highest index of the character c.
|
| $startsWith(s) bool @public |
Return TRUE when the varString starts with s.
|
| $endsWith(s) bool @public |
Return TRUE when the varString ends with s.
|
| $hash() int @public |
Return a number that is a hash value of the varString.
|
| $add(s) varString @public |
Append a string to the varString.
|
| $slice(start) varString @public |
Return a copy of the varString, starting at index start.
|
| $slice(start, end) varString @public |
Return a copy of the varString, starting at index start and ending at
end, inclusive.
|
| $split() list<string> @public |
Return a list with the varString split at white space.
|
| $split(sep) list<string> @public |
Return a list with the varString split into pieces, split at sep.
|
| $splitAnyOf(charSet) list<string> @public |
Return a list with the varString split at the characters in charSet.
|
| |
| |


The broad-phase is used for computing pairs and performing volume queries and ray casts. This broad-phase does not persist pairs. Instead, this reports potentially new pairs. It is up to the client to consume the new pairs and to track subsequent overlap.
More...
|
| | DynamicTreeBroadPhase () |
| | Constructs a new broad phase based on the dynamic tree implementation More...
|
| |
| int | AddProxy (ref AABB aabb) |
| | Create a proxy with an initial AABB. Pairs are not reported until UpdatePairs is called. More...
|
| |
| void | RemoveProxy (int proxyId) |
| | Destroy a proxy. It is up to the client to remove any pairs. More...
|
| |
|
void | MoveProxy (int proxyId, ref AABB aabb, Vector2 displacement) |
| |
|
void | TouchProxy (int proxyId) |
| |
| void | GetFatAABB (int proxyId, out AABB aabb) |
| | Get the AABB for a proxy. More...
|
| |
|
void | SetProxy (int proxyId, ref FixtureProxy proxy) |
| |
| FixtureProxy | GetProxy (int proxyId) |
| | Get user data from a proxy. Returns null if the id is invalid.  More...
|
| |
| void | UpdatePairs (BroadphaseDelegate callback) |
| | Update the pairs. This results in pair callbacks. This can only add pairs. More...
|
| |
| void | Query (BroadPhaseQueryCallback callback, ref AABB aabb) |
| | Query an AABB for overlapping proxies. The callback class is called for each proxy that overlaps the supplied AABB. More...
|
| |
| void | RayCast (BroadPhaseRayCastCallback callback, ref RayCastInput input) |
| | Ray-cast against the proxies in the tree. This relies on the callback to perform a exact ray-cast in the case were the proxy contains a shape. The callback also performs the any collision filtering. This has performance roughly equal to k * log(n), where k is the number of collisions and n is the number of proxies in the tree. More...
|
| |
|
void | ShiftOrigin (Vector2 newOrigin) |
| |
The broad-phase is used for computing pairs and performing volume queries and ray casts. This broad-phase does not persist pairs. Instead, this reports potentially new pairs. It is up to the client to consume the new pairs and to track subsequent overlap.
◆ DynamicTreeBroadPhase()
| tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.DynamicTreeBroadPhase |
( |
| ) |
|
Constructs a new broad phase based on the dynamic tree implementation
◆ AddProxy()
| int tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.AddProxy |
( |
ref AABB |
aabb | ) |
|
◆ GetFatAABB()
| void tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.GetFatAABB |
( |
int |
proxyId, |
|
|
out AABB |
aabb |
|
) |
| |
◆ GetProxy()
| FixtureProxy tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.GetProxy |
( |
int |
proxyId | ) |
|
◆ Query()
| void tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.Query |
( |
BroadPhaseQueryCallback |
callback, |
|
|
ref AABB |
aabb |
|
) |
| |
◆ RayCast()
| void tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.RayCast |
( |
BroadPhaseRayCastCallback |
callback, |
|
|
ref RayCastInput |
input |
|
) |
| |
Ray-cast against the proxies in the tree. This relies on the callback to perform a exact ray-cast in the case were the proxy contains a shape. The callback also performs the any collision filtering. This has performance roughly equal to k * log(n), where k is the number of collisions and n is the number of proxies in the tree.
- Parameters
-
| callback | A callback class that is called for each proxy that is hit by the ray. |
| input | The ray-cast input data. The ray extends from p1 to p1 + maxFraction * (p2 - p1). |
Implements tainicom.Aether.Physics2D.Collision.IBroadPhase.
◆ RemoveProxy()
| void tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.RemoveProxy |
( |
int |
proxyId | ) |
|
◆ TestOverlap()
| bool tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.TestOverlap |
( |
int |
proxyIdA, |
|
|
int |
proxyIdB |
|
) |
| |
◆ UpdatePairs()
| void tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.UpdatePairs |
( |
BroadphaseDelegate |
callback | ) |
|
◆ ProxyCount
| int tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.ProxyCount |
|
get |
Get the number of proxies.
The proxy count.
◆ TreeBalance
| int tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.TreeBalance |
|
get |
Gets the balance of the tree.
◆ TreeHeight
| int tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.TreeHeight |
|
get |
Gets the height of the tree.
◆ TreeQuality
| float tainicom.Aether.Physics2D.Collision.DynamicTreeBroadPhase.TreeQuality |
|
get |
Get the tree quality based on the area of the tree.
The documentation for this class was generated from the following file:
- Physics2D/Collision/DynamicTreeBroadPhase.cs


|
Subjects |
Year |
|
hours |
|
PS |
|
Core
subjects |
Calculus 1
|
Freshman |
3 |
3 |
required |
|
Introduction to Programming 1 |
Freshman |
3 |
3 |
required |
|
Introduction to Computer |
Freshman |
3 |
3 |
required |
|
Calculus 2 |
Freshman |
3 |
3 |
required |
|
Introduction to Programming 2 |
Freshman |
3 |
3 |
required |
|
Data structures |
Sophomore |
3 |
3 |
required |
|
Discrete Mathematics |
Sophomore |
3 |
3 |
required |
|
Digital Logic |
Sophomore |
3 |
3 |
required |
|
Probability and Statistics |
Sophomore |
3 |
3 |
required |
|
Introduction to Networks |
Sophomore |
3 |
3 |
required |
|
Database Systems |
Sophomore |
3 |
3 |
required |
|
Computer Organization |
Sophomore |
3 |
3 |
required |
|
Linear Algebra |
Sophomore |
3 |
3 |
required |
|
Operating Systems |
Junior |
3 |
3 |
required |
|
Computer Networks |
Junior |
3 |
3 |
required |
|
Special Project 1 |
Senior |
1 |
1 |
required |
|
Special Project 2 |
Senior |
1 |
1 |
required |
|
|
Specialized
subjects |
Programming Language Foundations |
Sophomore |
3 |
3 |
elective |
|
File Structures |
Sophomore |
3 |
3 |
elective |
|
Assembly Language |
Sophomore |
3 |
3 |
elective |
|
Numerical Method |
Sophomore |
3 |
3 |
elective |
|
Internet Programming |
Sophomore |
3 |
3 |
elective |
|
Object-Oriented Analysis and Design |
Sophomore |
3 |
3 |
elective |
|
Introduction to Computer Game Software Design |
Sophomore |
3 |
3 |
elective |
|
Software Engineering |
Junior |
3 |
3 |
elective |
|
Computer Architecture |
Junior |
3 |
3 |
elective |
|
Algorithms |
Junior |
3 |
3 |
elective |
|
Sever Installation and Management |
Junior |
3 |
3 |
elective |
|
Data Mining |
Junior |
3 |
3 |
elective |
|
Coding Theory |
Junior |
3 |
3 |
elective |
|
Electronics |
Junior |
3 |
3 |
elective |
|
Artificial Intelligence |
Junior |
3 |
3 |
elective |
|
Wireless Networks |
Junior |
3 |
3 |
elective |
|
Multimedia System |
Junior |
3 |
3 |
elective |
|
Internet Computing and Applications |
Junior |
3 |
3 |
elective |
|
Computer Graphics |
Junior |
3 |
3 |
elective |
|
Data Communications |
Junior |
3 |
3 |
elective |
|
Image Processing |
Junior |
3 |
3 |
elective |
|
Automata Theory |
Junior |
3 |
3 |
elective |
|
Human-Machine Interface |
Junior |
3 |
3 |
elective |
|
Optimization Theory |
Senior |
3 |
3 |
elective |
|
Game Design |
Senior |
3 |
3 |
elective |
|
Introduction to Compiler Design |
Senior |
3 |
3 |
elective |
|
Network Security |
Senior |
3 |
3 |
elective |
|
Virtual Reality |
Senior |
3 |
3 |
elective |
|
Fuzzy Logic |
Senior |
3 |
3 |
elective |
|
Digital Signal Processing |
Senior |
3 |
3 |
elective |
|
Theory and Practice of Vision Information |
Senior |
3 |
3 |
elective |
|
Data mining |
Senior |
3 |
3 |
elective |
|
Neural Networks |
Senior |
3 |
3 |
elective |
|
Introduction to VLSI Design |
Senior |
3 |
3 |
elective |
|


Note: You are viewing the Sails.js v0.9.0 documentation. If you're looking for information on v0.8.x, please visit here.
 Here's how you can make that happen.
Policies in Sails are versatile tools for authorization and access control-- they let you allow or deny access to your controllers down to a fine level of granularity. For example, if you were building Dropbox, before letting a user upload a file to a folder, you might check that she isAuthenticated
, then ensure that she canWrite
(has write permissions on the folder.) Finally, you'd want to check that the folder she's uploading into hasEnoughSpace
.
Policies can be used for anything: HTTP BasicAuth, 3rd party single-sign-on, OAuth 2.0, or your own custom authorization/authentication scheme.
Policies are files defined in the api/policies
folder in your Sails app. Each policy file should contain a single function.
When it comes down to it, policies are really just Connect/Express middleware functions which run before your controllers. You can chain as many of them together as you like-- in fact they're designed to be used this way. Ideally, each middleware function should really check just one thing.
For example, the canWrite
policy mentioned above might look something like this:
// policies/canWrite.js
module.exports = function canWrite (req, res, next) {
var targetFolderId = req.param('id');
var userId = req.session.user.id;
Permission
.findOneByFolderId( targetFolderId )
.exec( function foundPermission (err, permission) {
// Unexpected error occurred-- skip to the app's default error (500) handler
if (err) return next(err);
// No permission exists linking this user to this folder. Maybe they got removed from it? Maybe they never had permission in the first place? Who cares?
if ( ! permission ) return res.redirect('/notAllowed');
// OK, so a permission was found. Let's be sure it's a "write".
if ( permission.type !== 'write' ) return res.redirect('/notAllowed');
// If we made it all the way down here, looks like everything's ok, so we'll let the user through
next();
});
};
Sails has a built in ACL (access control list) located in config/policies.js
. This file is used to map policies to your controllers.
This file is declarative, meaning it describes what the permissions for your app should look like, not how they should work. Declarative programming has many benefits, but in particular, it is both conventional and adaptable. This makes it easier for new developers to jump in and understand what's going on, plus it makes your app more flexible as your requirements inevitably change over time.
You can apply one or more policies to a given controller or action. Any file in your /policies
folder (e.g. authenticated.js
) is referable in your ACL (config/policies.js
) by its filename minus the extension, (e.g. 'authenticated'
).
Additionally, there are a few special, built-in policy mappings:
+ true
: public access (allows anyone to get to the mapped controller/action)
+ false
: NO access (allows no-one to access the mapped controller/action)
'*': true
is the default policy for all controllers and actions. In production, it's good practice to set this to false
to prevent access to any logic you might have inadvertently exposed.
RabbitController: {
// Apply the `false` policy as the default for all of RabbitController's actions
// (`false` prevents all access, which ensures that nothing bad happens to our rabbits)
'*': false,
// For the action `nurture`, apply the 'isRabbitMother' policy
// (this overrides `false` above)
nurture : 'isRabbitMother',
// Apply the `isNiceToAnimals` AND `hasRabbitFood` policies
// before letting any users feed our rabbits
feed : ['isNiceToAnimals', 'hasRabbitFood']
}
Here’s what the isNiceToAnimals
policy from above might look like: (this file would be located at policies/isNiceToAnimals.js
)
We’ll make some educated guesses about whether our system will consider this user someone who is nice to animals.
module.exports = function isNiceToAnimals (req, res, next) {
// `req.session` contains a set of data specific to the user making this request.
// It's kind of like our app's "memory" of the current user.
// If our user has a history of animal cruelty, not only will we
// prevent her from going even one step further (`return`),
// we'll go ahead and redirect her to PETA (`res.redirect`).
if ( req.session.user.hasHistoryOfAnimalCruelty ) {
return res.redirect('http://PETA.org');
}
// If the user has been seen frowning at puppies, we have to assume that
// they might end up being mean to them, so we'll
if ( req.session.user.frownsAtPuppies ) {
return res.redirect('http://www.dailypuppy.com/');
}
// Finally, if the user has a clean record, we'll call the `next()` function
// to let them through to the next policy or our controller
next();
};
Passport works great with Sails! In general, since Sails uses Connect/Express at its core, all of the Connect/Express-oriented things work pretty well. In fact, Sails has no problem interpreting most Express middleware to work with socket.io.
There are a few good examples of this floating around. Here's a good one (hasn't been tested in v0.9.x yet): https://gist.github.com/theangryangel/5060446


Solution is simple: just go to angularjs.org website and select "Download" from Develop's category in the right top corner:
Select the newest version:
Here you can download every module for AngularJS:
And then just add them to your code, before your JS files.
Interpolation markup with embedded expressions is used to provide data-binding to text nodes and attribute values:
How to use Interpolation:
Result is the collection of images on the page:
Watch is a listener of AngularJS that simply "listens" a variable and everytime it changes, so does the value of variable.
Try it:
For example, try typing your name?
Old value:
{{oldValue}}New Value:
{{newValue}}As known, AngularJS is a Single-page application, which means that everytime you click on page elements, AngularJS loads you the exact component for the page and adds it to main "template". Because of this, website functions a lot faster.
Basically, you create one Main index.html, which has all main components of your page - template, and then the "views" which create the variability of website and where all your different substances are.
For example, calculate how much time does it take to navigate on this page.
How Routing is used?:
When URL is as shown, AngularJS uses appointed Controller and Template.
And then add view to your main page:
Timeout changes the value of element after elected time, in 5 sec for this example:
Here's how timeout is used:
Note: If timeout has already happened, refresh the page and check again.


Among other programming languages
CS-Script supports J#/JScript.
There is some ambiguity
about
the name of the language. MS usually refers Java based syntax
for
CLR as J#. However MS compiler for this syntax is implemented in
Microsoft.JScript.dll. For the purpose of this article the terms
JScript and J# are interchangeable.
The J# script compiler is implemented as a pluggable custom
compiler (see
Alternative compilers). JScript
script compiler assembly is deployed and
enabled at the time of the CS-Script installation/upgrade.
The
script code below is an example of the complete J#
script
Hello.js
from the
Implementing
non-C# compilers tutorial.
//css_reference System.dll;
//css_reference System.Windows.Forms.dll;
import System;
import System.Windows.Forms;
public class Class1 {
public static function Main() {
Console.WriteLine("Hello World! (JScript)");
MessageBox.Show("Hello World! (JScript)")
}
} |
Note:
System.dll and
System.Windows.Forms.dll
are
referenced with
//css_reference
statement directly
from the code. Because automatic assembly loading is not available for non-C#
scripts (see
Alternative
Compilers for limitation details).
See Also
Alternative compilers |
Implementing
non-C# compilers


{%extends "base.html"%} {%block title%}Server Error{%endblock%} {%block body%}
That's an error. Sorry about that, let us know and we'll get this fixed!


| |||||
|
Listen to the LIVE REALAUDIO FEED of 99.5FM WBAI from porus.com | |||||
| WBAI Powertool v2.0 | |||||
| slightly outdated grid | |||||
| radio links | |||||
| last update 11/19/1999 |
|
Schedule some of the live and archived RealAudio streams from 99.5FM WBAI Programs with linked titles have their own audio stream and might not be sent by porus. If porus is down the shows with links below should still work.(eastern time zone) | |||
| time | title / producer | ||
| daily shows | 9:00a | Democracy NOW! with Amy Goodman | |
| 6:00p | Pacifica Network News | ||
| sunday | 7:30p | Old Time Radio with Max Schmid - website | |
| 1:00a | UFO Desk with Paul Williams - website | ||
| monday | 8:00p | Four Directions in Traditional Healing with Dr. William Martin | |
| 9:00p | Circle of Red Nations with Raven | ||
| 12.0m | Heart Time with Carletta Joy Walker - website | ||
| tuesday | 7:00p | Expert Witness 25 year veteran federal agent Michael Levine | |
| 9:00p | Tahrir with Barbara Nimri Aziz | ||
| 8:00p | Off The Hook with Emmanuel Goldstein | ||
| 12:0m | Moorish Orthodox Radio Crusade with various hosts. | ||
| wednesday | 7:00p | Explorations in Science with Dr. Michio Kaku - website | |
| 12:0m | Earthwatch with Robert Knight - website | ||
| 1:30a | Let 'Em Talk with Paul DeRienzo - website | ||
| 3:30a | Niteshift with Mike Sargent and Byron Saunders - website | ||
| thursday | 2:00p | Walden's Pond with Sheldon Walden | |
| 12:0m | Radio Unnameable with Bob Fass - website | ||
| friday | 7:00p | FAIR Counterspin | |
| 7:30p | Radio Nation | ||
| 5:00a | Hour of the Wolf with Jim Freund - website | ||
| saturday | 12:0n | Al Lewis Live with Al Lewis | |
| 1:30p | Radio Free Eireann | ||


#9: spaces after a half move before a NAG
Javascript part
pgnView("board", {pgn: "1. e4 $1 e5 $2 2. Nf3 $3 Nc6 $4 3. Bc4$13 Bc5$14 4. c3$15 Nf6$16"});
HTML part
<div id="board" style="width: 300px"/>
See the back link to the original examples page.
See
ticket 9 at GitHub. The example shows different nags ('$' followed by a number) with variations in white space directly before it.


--- layout: post esbma_id: 1412 date: 2002-02-28 12:00:00 keywords: cornsharp title: Blog entry on 28 Feb 2002 --- I mean no offense to any of our customers who might be reading, but this is funny.


Short bio
I was born and raised in Tunisia. I received my B.E. degree in computer engineering from Ecole Polytechnique de Montreal, Montreal, Canada, and the “Diplome d’Ingenieur” degree from Telecom ParisTech (ENST), Paris, France, both in 2016. I also received the M.S. degree in artificial intelligence from University of Toronto, Toronto, Canada, in 2018. I have worked in the data science industry for 5 years after which I co-founded AIP Labs where I am currently leading its AI development team. I am also a research associate at the Electrical and Computer Engineering (ECE) department at the University of Manitoba, Winnipeg, Canada.
Research Interests
My research interests lie broadly in optimization, both classical and deep signal processing for healthcare and wireless communication. At this time, I focus on developing methods and algorithms for:
- devising self-supervision and active learning methods applied to healthcare applications,
- scaling communication systems in terms of the number of antennas, the operational bandwidth and space limitations,
- combining Shannon and Maxwell theories using physically consistent models,
- designing message passing algorithms to solve a variety of non-convex estimation problems,
- integrating Chu's theory to maximize the achievable rate of antenna-size constrained channels.
Awards
- NSERC Graham Bell Scholarship ($105.000 over 3 years)
- Mitacs Entrepreneur Accelerate Program Scholarship ($90.000)
- Mitacs Accelerate Program Scholarship ($30.000)
- University of Toronto COVID-19 Student Engagement Award ($3.000)
- Addictive Mobility Scholarship ($1.500)
- Award of Excellence of the Director General of Polytechnique Montreal
- Exchange Student Mobility Scholarship ($12.000)
- Unit Participation and Initiation Research Scholarship ($1.500)
- TD Assurance Meloche Monnex Scholarship ($1.000)
- NSERC Undergraduate Scholaraship ($6.000)
Service
I actively review papers for ICLR, NeurIPS, JMLR, MICCAI, AISTATS, IEEE Transactions on Signal Processing, IEEE Transactions on Wireless Communication, and IEEE Transactions on Mobile Computing.


Water Reminder
Notify me on every
1
2
5
10
15
20
30
60
120
180
240
minute(s).
Set Your Goal for Today
Notification Sound
A Beautiful Drop
Light
Multiple Water Drops
To the Point
Water Drop
Water Splash Ploor
Water Splash
Android Notification
Bell
Bubble
Message
Plucky
Short Notification
Text Notification
Your Message
Goal for Today:
copyright © Divin Divakaran


A web is a text document written in a language called HTML(HyperText Markup Language). Web browsers read these documents, and then interpret and display them.Type of files on the web are: Plain text, HTML, images, videos, music
HTTP - the main protocol of the web
Servers - computers that host the files that make up the web
Internet - the world's largest computer network
Browser - A program that runs on your computer to display files found on the web
You were introduced to HTML tags (like ,
, and) and saw how even though these tags aren't visible to users of a web page, they still carry meaning that is meaningful to web browsers.
), and closing tag,
)
. Some tags (called "void" tags) do not require a closing tag (like the
) tag). An HTML element refers to everything within a set of opening and closing tags. Attribute is a property of an HTML element. For example, to set the href attribute of an anchor tag to the Udacity URL, you would write www.udacity.com)
How coding works. Coding happens when programmers write text in a language that a computer can a computer can understand. The computer can then follow the instructions the programmer wrote. Programmers need to write exactly the way a computer understands, writing with correct "syntax".
Programmers can't remember everything.
Programmers often describe computers as "stupid". When they say this, they (usually) aren't insulting computers. They are addressing an important point about how computers understand the instructions that human programmers give them.Think about how sensitive computers are to typos and how small mistakes (mistakes that a "smart" human could easily correct) can lead to huge problems when given to a "stupid" computer.
HTML elements are either inline or block. Block elements form an "invisible box" around the content inside of them.
The "tree-like structure" comes from the fact that HTML elements can have other elements inside of them. You can draw this relationship like a family tree. My mother had multiple children. So did her mother, and so on...
In a browser, this structure shows up as a series of nested boxes. There are boxes inside of boxes inside of boxes, and so on...
When you read an HTML document as text, you see a wave of changing indentations going up and down the left side of the document. The more indented an element is, the more deeply nested it's corresponding "box" is.
When writing code, programmers use special text editors (like Sublime Text for example). These editors make the programmer's life easier. For example, some text editors will automatically generate a closing HTML tag when you write an opening tag.
Avoiding repetition is important for a variety of reasons.
Avoiding Errors:When programmers don't avoid repetition, they will often have to do the same thing over and over. This may mean copy and pasting certain style attributes into many HTML elements or rewriting the same code (sometimes with minor differences) many times. This can lead to errors when the programmer decides to make a change to something. If they don't dilligently make that same change everywhere the repeated code appears, problems will arise.
Consistency: In this web page, I wanted every lesson to look the same. Instead of manually giving each one the same style, I was able to assign each lesson div the same class and then specify the style for that class in only one place! By avoiding repetion, it's now very easy for me to make changes to this style.
CSS stands for Cascading Style Sheets and they give programmers a way to control the style of related HTML elements. This is done by giving similar HTML elements the same class name and then specifying the style that should apply to that class.


An implementation of Discriminant Analysis via Projections (DAP) method for high-dimensional binary classification in the case of unequal covariance matrices. See Irina Gaynanova and Tianying Wang (2018) <arXiv:1711.04817v2>.
| Version: | 1.0 |
| Imports: | MASS, stats |
| Published: | 2018-03-05 |
| Author: | Tianying Wang and Irina Gaynanova |
| Maintainer: | Tianying Wang <tianying at stat.tamu.edu> |
| BugReports: | http://github.com/irinagain/DAP/issues |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: | http://github.com/irinagain/DAP |
| NeedsCompilation: | yes |
| Materials: | README |
| CRAN checks: | DAP results |
| Reference manual: | DAP.pdf |
| Package source: | DAP_1.0.tar.gz |
| Windows binaries: | r-devel: DAP_1.0.zip, r-release: DAP_1.0.zip, r-oldrel: DAP_1.0.zip |
| OS X binaries: | r-release: DAP_1.0.tgz, r-oldrel: DAP_1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=DAP to link to this page.