public interface HttpResponse
| Modifier and Type | Field and Description |
|---|---|
static java.lang.String |
CONNECTION |
static java.lang.String |
CONTENT_LENGTH |
static java.lang.String |
CONTENT_TYPE |
static java.lang.String |
ERROR_MESSAGE |
static java.lang.String |
LOCATION |
static int |
SC_ACCEPTED
Status code (202) indicating that a request was accepted for processing,
but was not completed.
|
static int |
SC_BAD_GATEWAY
Status code (502) indicating that the HTTP server received an invalid
response from a server it consulted when acting as a proxy or gateway.
|
static int |
SC_BAD_REQUEST
Status code (400) indicating the request sent by the client was
syntactically incorrect.
|
static int |
SC_CONFLICT
Status code (409) indicating that the request could not be completed due
to a conflict with the current state of the resource.
|
static int |
SC_CONTINUE
Status code (100) indicating the client can continue.
|
static int |
SC_CREATED
Status code (201) indicating the request succeeded and created a new
resource on the server.
|
static int |
SC_EXPECTATION_FAILED
Status code (417) indicating that the server could not meet the
expectation given in the Expect request header.
|
static int |
SC_FORBIDDEN
Status code (403) indicating the server understood the request but
refused to fulfill it.
|
static int |
SC_FOUND
Status code (302) indicating that the resource reside temporarily under a
different URI.
|
static int |
SC_GATEWAY_TIMEOUT
Status code (504) indicating that the server did not receive a timely
response from the upstream server while acting as a gateway or proxy.
|
static int |
SC_GONE
Status code (410) indicating that the resource is no longer available at
the server and no forwarding address is known.
|
static int |
SC_HTTP_VERSION_NOT_SUPPORTED
Status code (505) indicating that the server does not support or refuses
to support the HTTP protocol version that was used in the request
message.
|
static int |
SC_INTERNAL_SERVER_ERROR
Status code (500) indicating an error inside the HTTP server which
prevented it from fulfilling the request.
|
static int |
SC_LENGTH_REQUIRED
Status code (411) indicating that the request cannot be handled without a
defined
Content-Length . |
static int |
SC_METHOD_NOT_ALLOWED
Status code (405) indicating that the method specified in the
Request-Line is not allowed for the resource
identified by the Request-URI . |
static int |
SC_MOVED_PERMANENTLY
Status code (301) indicating that the resource has permanently moved to a
new location, and that future references should use a new URI with their
requests.
|
static int |
SC_MOVED_TEMPORARILY
Status code (302) indicating that the resource has temporarily moved to
another location, but that future references should still use the
original URI to access the resource.
|
static int |
SC_MULTIPLE_CHOICES
Status code (300) indicating that the requested resource corresponds to
any one of a set of representations, each with its own specific location.
|
static int |
SC_NO_CONTENT
Status code (204) indicating that the request succeeded but that there
was no new information to return.
|
static int |
SC_NON_AUTHORITATIVE_INFORMATION
Status code (203) indicating that the meta information presented by the
client did not originate from the server.
|
static int |
SC_NOT_ACCEPTABLE
Status code (406) indicating that the resource identified by the request
is only capable of generating response entities which have content
characteristics not acceptable according to the accept headers sent in
the request.
|
static int |
SC_NOT_FOUND
Status code (404) indicating that the requested resource is not
available.
|
static int |
SC_NOT_IMPLEMENTED
Status code (501) indicating the HTTP server does not support the
functionality needed to fulfill the request.
|
static int |
SC_NOT_MODIFIED
Status code (304) indicating that a conditional GET operation found that
the resource was available and not modified.
|
static int |
SC_OK
Status code (200) indicating the request succeeded normally.
|
static int |
SC_PARTIAL_CONTENT
Status code (206) indicating that the server has fulfilled the partial
GET request for the resource.
|
static int |
SC_PAYMENT_REQUIRED
Status code (402) reserved for future use.
|
static int |
SC_PRECONDITION_FAILED
Status code (412) indicating that the precondition given in one or more
of the request-header fields evaluated to false when it was tested on the
server.
|
static int |
SC_PROXY_AUTHENTICATION_REQUIRED
Status code (407) indicating that the client MUST first
authenticate itself with the proxy.
|
static int |
SC_REQUEST_ENTITY_TOO_LARGE
Status code (413) indicating that the server is refusing to process the
request because the request entity is larger than the server is willing
or able to process.
|
static int |
SC_REQUEST_TIMEOUT
Status code (408) indicating that the client did not produce a request
within the time that the server was prepared to wait.
|
static int |
SC_REQUEST_URI_TOO_LONG
Status code (414) indicating that the server is refusing to service the
request because the
Request-URI is longer than the
server is willing to interpret. |
static int |
SC_REQUESTED_RANGE_NOT_SATISFIABLE
Status code (416) indicating that the server cannot serve the requested
byte range.
|
static int |
SC_RESET_CONTENT
Status code (205) indicating that the agent SHOULD reset the
document view which caused the request to be sent.
|
static int |
SC_SEE_OTHER
Status code (303) indicating that the response to the request can be
found under a different URI.
|
static int |
SC_SERVICE_UNAVAILABLE
Status code (503) indicating that the HTTP server is temporarily
overloaded, and unable to handle the request.
|
static int |
SC_SWITCHING_PROTOCOLS
Status code (101) indicating the server is switching protocols according
to Upgrade header.
|
static int |
SC_TEMPORARY_REDIRECT
Status code (307) indicating that the requested resource resides
temporarily under a different URI.
|
static int |
SC_UNAUTHORIZED
Status code (401) indicating that the request requires HTTP
authentication.
|
static int |
SC_UNSUPPORTED_MEDIA_TYPE
Status code (415) indicating that the server is refusing to service the
request because the entity of the request is in a format not supported by
the requested resource for the requested method.
|
static int |
SC_USE_PROXY
Status code (305) indicating that the requested resource MUST be
accessed through the proxy given by the
Location
field. |
static java.lang.String |
STATUS_CODE |
static java.lang.String |
STATUS_MESSAGE |
| Modifier and Type | Method and Description |
|---|---|
void |
addCookie(java.lang.String name,
java.lang.String value) |
void |
addHeader(java.lang.String name,
java.lang.String value) |
java.lang.String |
getContentType() |
void |
send(java.lang.Object contents) |
void |
sendError(int sc,
java.lang.String msg) |
void |
sendRedirect(java.lang.String location) |
void |
setContentType(java.lang.String type) |
void |
setStatus(int statusCode) |
static final java.lang.String CONTENT_TYPE
static final java.lang.String CONNECTION
static final java.lang.String CONTENT_LENGTH
static final java.lang.String STATUS_CODE
static final java.lang.String STATUS_MESSAGE
static final java.lang.String LOCATION
static final java.lang.String ERROR_MESSAGE
static final int SC_CONTINUE
static final int SC_SWITCHING_PROTOCOLS
static final int SC_OK
static final int SC_CREATED
static final int SC_ACCEPTED
static final int SC_NON_AUTHORITATIVE_INFORMATION
static final int SC_NO_CONTENT
static final int SC_RESET_CONTENT
static final int SC_PARTIAL_CONTENT
static final int SC_MULTIPLE_CHOICES
static final int SC_MOVED_PERMANENTLY
static final int SC_MOVED_TEMPORARILY
static final int SC_FOUND
static final int SC_SEE_OTHER
static final int SC_NOT_MODIFIED
static final int SC_USE_PROXY
Location
field.static final int SC_TEMPORARY_REDIRECT
Location
field in the response.static final int SC_BAD_REQUEST
static final int SC_UNAUTHORIZED
static final int SC_PAYMENT_REQUIRED
static final int SC_FORBIDDEN
static final int SC_NOT_FOUND
static final int SC_METHOD_NOT_ALLOWED
Request-Line
is not allowed for the resource
identified by the Request-URI
.static final int SC_NOT_ACCEPTABLE
static final int SC_PROXY_AUTHENTICATION_REQUIRED
static final int SC_REQUEST_TIMEOUT
static final int SC_CONFLICT
static final int SC_GONE
static final int SC_LENGTH_REQUIRED
Content-Length
.static final int SC_PRECONDITION_FAILED
static final int SC_REQUEST_ENTITY_TOO_LARGE
static final int SC_REQUEST_URI_TOO_LONG
Request-URI
is longer than the
server is willing to interpret.static final int SC_UNSUPPORTED_MEDIA_TYPE
static final int SC_REQUESTED_RANGE_NOT_SATISFIABLE
static final int SC_EXPECTATION_FAILED
static final int SC_INTERNAL_SERVER_ERROR
static final int SC_NOT_IMPLEMENTED
static final int SC_BAD_GATEWAY
static final int SC_SERVICE_UNAVAILABLE
static final int SC_GATEWAY_TIMEOUT
static final int SC_HTTP_VERSION_NOT_SUPPORTED
void setContentType(java.lang.String type)
java.lang.String getContentType()
void addCookie(java.lang.String name, java.lang.String value)
void sendRedirect(java.lang.String location) throws java.io.IOException
java.io.IOException
void addHeader(java.lang.String name, java.lang.String value)
void setStatus(int statusCode)
void send(java.lang.Object contents) throws java.io.IOException
java.io.IOException
void sendError(int sc, java.lang.String msg) throws java.io.IOException
java.io.IOException


This dude is a 5th-year Ph.D. student in the Electrical and Computer Engineering department of the University of Maryland, College Park. His advisor is Prof. Ankur Srivastava. His current research focuses on electronic design automation and hardware security. He is also passionate about machine learning applications and data modeling.
yay


Homeowner who has been baffled by 'broken socket' for two years finally finds out what it really is
It had never worked - and this is why
by David WhitfieldFor more than two years, Darren Steels and his partner were bewildered by the double plug socket in the kitchen of their home in Hucknall.
It was in a good location near the bottom of the stairs.
But it had never worked since they bought the property in Bolingey Way back in July 2017. And that was a source of some frustration for the couple.
"We tried to plug things into it,” said Darren. “It's perfectly placed for vacuuming the stairs, instead of having the cord running across the kitchen floor.”
The socket didn’t feel loose or anything, and when the couple had decorators in to redo the kitchen soon after they moved in, nothing was flagged up.
“People have just painted around it,” the 45-year-old added.
Eventually, they decided to ask an electrician to try and sort it out.
"I was just fed up with it," Darren said. "We had an electrician come round to do some other bits and bobs and I asked him to have a look at it."
The electrician confirmed there was no current to the socket, before trying to tackle the problem in a different way.
“He prised it open, and it came away from the wall,” added restaurant manager Darren.
And what was revealed was - a secret safe.
Sadly, though, it wasn’t filled with cash or valuables. "There was just dust, fluff and a dead spider in it."
He posted a video of it online on Sunday, November 17 - and people have been loving it, with more than 60,000 views so far.
"I have a socket that doesnt work....absolutely checking it later!!" said one Twitter user.
"Thats both hilarious and sort of James Bond," said Martyn.
"I always wanted one of those as a kid," said Paul.
"Don’t store anything too valuable in there now," warned Craig. "People will know!! Brilliant idea though. Alf & Audrey had one on Coronation Street."
"I remember seeing those in the Argos catalogues in the 90’s," said Gaz. "Always wanted one."
The safe should have a key which slots into one of the the holes for the plug pins, but it was unlocked - and Darren said he didn't have the key for it.
However, he said he would be keeping the safe as it was, for "posterity".


Toggle navigation
Jobs
Contract Jobs
Walkin Jobs
Jobs by Location
Jobs by Function
Jobs by Industry
Jobs by Company
Services
Action
Another action
Something else here
Separated link
One more separated link
Recruiters
Recruiter Updates
Recruiters you are following
Shortcodes
Login
Overview
Basic Profile
Profile Picture
Profile Summary
Skills
Projects
Education
Upload Resume
Others
Other Details
Languages Known
Language
Proficiency
Select
Beginner
Proficient
Expert
Select
Beginner
Proficient
Expert
Select
Beginner
Proficient
Expert
Select
Beginner
Proficient
Expert
Desired Job Details
Job Type:
Permanent
Temporary/Contractual
Employment Type:
Full Time
Part Time
Affirmative Action
Physically Challenged:
Yes
No
Description:
Save Changes
Cancel


Warns if components are matched on an embedded template element
<ng-template>
, or if more than one component is matched on any other element.


Present: BD, GS, MS, MK, GW, JR
Scribe: GW
NEW TOPIC: Use of SWT in pvIOC distribution.
RESOLUTION: We will move the pvioc.swtshell package to its own EPICS V4 project [that is, a new independent repo].
Marty and Matej will do that either before or after the BNL Oct Meeting, depending on their own progress at meeting
the demo objectives from the September 5 telecon (http://epicsv4.titanpad.com/ep/pad/view/27/latest) .
NEW TOPIC: policy for choice of wire provider (v3Channel or CAV3) when both are possible.
AI: Matej will develop a policy that implements the mechanism to choose. One policy choice will be that
both providers will be given a chance to respond and a preferred provider will be used if it responds.
NEW TOPIC: Status of VxWorks port
AI: Matej, check with Dirk.
NEW TOPIC: ServiceClient, ServiceClientFactory and ServiceClientRequester
RESOLUTION: ServiceClient, ServiceClientFactory and ServiceClientRequester will be moved to pvaccess from pvService.
NEW TOPIC: BD asks Question: Is there consensus on Self-ID and why we need it?
MS: Self ID isn't needed for pvAccess itself
BD: Is it necessary for memory allocation at an endpoint? Presumably not.
Correct.
GW: Self-ID is to help a client determine how to interpret the data in a (pvData) structure. The reason we had so much discussion about it was that it was being proposed that EPICS V4 should define a type system, and that type system should be polymorphic. Example: we define NTTable. Some institution decides to extend NTTable to produce "BPMOrbitTable" by adding some requried fields. A client that knows NTTable, but doesn't speocically know BPMOrbitTable, should be able to display those facets of BPMOrbitTable object that conform to NTTable. However, we have decided as a group that to support this, possibly multiple inheritance, system all from inside code, is too hard for this charter.


Quote the rhs of = in [[ ]] to prevent glob matching.
[[ $a = $b ]]
[[ $a = "$b" ]]
When the right-hand side of =
, ==
or !=
is unquoted in [[ .. ]]
, it will be treated like a glob.
This has some unexpected consequences like [[ $var = $var ]]
being false (for var='[a]'
), or [[ $foo = $bar ]]
giving a different result from [[ $bar = $foo ]]
.
The most common intention is to compare one variable to another as strings, in which case the right-hand side must be quoted.
If you explicitly want to match against a pattern, you can [[ignore]] this warning.


Preparation time
less than 30 mins
Cooking time
10 to 30 mins
Serves
Serves 4
This quick, simple soup works wonderfully with all sorts of local seafood, so throw in whatever is readily available.
Bring the wine to the boil in a large lidded saucepan. Add the shellfish, cover the pan with the lid, reduce the heat until the wine is simmering, and simmer the shellfish for 3-5 minutes, or until all the shells have opened (discard any that do not open).
Drain the shellfish, reserving the cooking liquor in a bowl. When the shellfish is cool enough to handle, pick the meat from the shells.
Heat the butter in a large saucepan over a medium heat. Add the shallot and garlic and fry for 1-2 minutes, or until softened. Add the fennel, leek, potatoes, saffron and star anise and fry for a further 1-2 minutes.
Add the reserved cooking liquor and the chicken stock and bring the mixture to the boil. Reduce the heat until the mixture is simmering and simmer for 3-4 minutes, or until the potato cubes are just tender.
Add the cream and samphire and continue to simmer for 1-2 minutes, or until the soup has thickened slightly. Reduce the heat to low, then add the tomatoes and shellfish meat, including the whelks. Heat until the meat is warmed through.
Stir in the chives and celery leaves, season, to taste, with a little salt and freshly ground black pepper, then serve.


#ftl output_format="HTML" auto_esc=true> <#import "layout/default.html" as layout><EMAIL_ADDRESS>Dear ${name},
The feedback for your application ${applicationName} to the competition ${competitionName} is now available for you to view.
The feedback provided by the independent assessors has been reviewed by Innovate UK.
Please sign into your Innovation Funding Service dashboard.
Yours sincerely,
<EMAIL_ADDRESS>/> @layout.default>


Large Batch Chocolate Chip Cookies
From: Food.com
Prep Time: 20 min |
Cook Time: 16 min |
Servings: 72 |
Ingredients:
- 1 1/2 cups brown sugar
- 1 1/2 cups white sugar
- 2 cups shortening (No substitutes)
- 7 cups flour
- 2 teaspoons baking powder
- 2 teaspoons salt
- 6 eggs, gently beaten
- 2 teaspoons baking soda
- 4 tablespoons hot water
- 2 teaspoons vanilla extract
- 2 lbs walnuts or 2 lbs pecans, chopped
- 3 lbs semisweet chocolate chips
Estimated Weight: 10 lbs
Directions:
- Preheat Oven to 325 degrees F.
- In a VERY large mixing bowl or largest bowl of your Stand Mixer, add brown sugar, white sugar, and shortening. Cream together very well.
- In another large bowl, sift together flour, baking powder, and salt. Set Aside.
- Add flour mixture and eggs alternately to the creamed mixture, mix well, scraping down sides of bowl as needed.
- Dissolve baking soda in the 4 Tbs of HOT water. Add baking soda mixture and vanilla to dough and mix well.
- Stir in nuts and chocolate chips.
- Drop by heaping tablespoonful onto an ungreased cookie sheet and back at 325 degrees F for 15-17 minutes. I get 12 cookies to a standard sized cookie sheet.
Variations/Tips:
- Nuts: Can use walnuts, pecans, macadamia nuts, etc. so long as you have a total of 2 lbs. I measure each type of nut used into it's own bowl, see reason below.
- Chocolate Chips: I seldom use just the chocolate chips called for in the original recipe. Instead I use a combination of 3 lbs of a variety of baking pieces, and put in separate bowls. Try chocolate chunks, semisweet chocolate chips, butterscotch chips, mini M&M's, vanilla baking chps, chocolate/caramel swirled chips, etc. so long as you have a total of about 3 lbs (about 4 - 12 ounce packages) I have already used a little less than 3 lbs when I just didn't have enough available.
- Before adding the nuts and chocolate to your dough, divide the doug into 2 bowls. Since you have measured out the uts and chocolate (or variety of baking pieces) into separate bowls, you can now create a variety of cookie dough flavors. Add whatever combination you would like so long as you add approximately equal amounts to each bowl.
- FOR EXAMPLE: Divide cookie dough into 2 bowls. To first bowl add 1 pound chopped pecans, 1 pound chocolate chunks, and 1/2 pound butterscotch chips. To second bowl add 1 pound chopped walnuts, 1 pound caramel/chocolate swirled chips, and 1/2 pound vanilla baking chips. The possibilities are endless. Have fun with this!
- When I freeze the dough, I do use m food saver machine. I fill the food saver bag with desired amount of dough and flatten out slightly before vacuum sealing. This way the dough lays flat in the freezer to save space, and thwas more quickly. I take the dough out of the freezer and put in the fridge the day before I plan on baking.


You'll need to login for that.
Current path:
Route patterns:
* Middleware redirects to this page if the requested route is /about/bob


-
{% url 'accounts:profile' as the_url %}
- {% trans 'Profile' %} {% url 'account_email' as the_url %}
- {% trans 'E-mail Addresses' %} {% url 'socialaccount_connections' as the_url %}
- {% trans 'Accounts' %} {% url 'account_change_password' as the_url %}
- {% trans 'Password' %}


--- type: page title: WI+RE's Creative Team description: Get to know the learners, designers, and creators of WI+RE. background: /assets/images/backgrounds/art-creative-flying-17679-3000.jpg permalink: /about/creative-team/ ---
Check out the WI+RE Creative team's portfolio pages and catch up with WI+RE alums!
{% assign groups = site.team-members | group_by: "category" | sort: "title" %} {% for group in groups %} {% if group.name == "Creative Team"%}


The Nodes tab lists all nodes which are either running or available for launch in the current configuration. Running nodes have a green icon . They are monitored using their process ID, which is updated by the local master_discovery node. You have to run a master_discovery node on each host to ensure that information about all nodes is available in the network. If a node is registered with the master but has no associated process ID, the node is considered crashed and marked with . Note that only local nodes are pinged. Nodes which are running not at the same host with ROS Master are marked by . Crashes of these nodes cannot be detected.
As of now, the only reliable way to detect running nodes is by their registered topics and services. Thus, if a node has neither, it will never be shown as running.
In order to launch nodes, a configuration must be loaded. You can open roslaunch files. Nodes which are backed by a local configuration in this manner are marked with . If a node with the same name is listed in multiple launch files, you have choose one configuration when you launch the node.
If you select a node additional information to this node are shown in description dock. The description dock offers some special control actions and direct access to topics and services of the node.
Nodes control buttons:
Launches the selected nodes unless they are already running. Crashed nodes are restarted. Use links in description dock to start the node on another host or force the node restart |
|
Terminates the selected nodes using the shutdown method of the Slave API. Use in description dock to send a SIGKILL signal to the SCREEN of the node process or force the master to unregister the services and topics. The latter is useful if the node died without a proper shutdown. |
|
| Shows a console with terminal session of the selected node. In description dock you can kill the screen program that provides the terminal session, most likely killing the node in the process. Select a host in Nodes View to get access to all screens on the host. | |
| Shows the log files of the selected nodes. Usually there are two files for each node. One is the ROS log file and the other one contains the output of the terminal session. The log files are not overwritten if the node is stopped and restarted. In description dock you can copy the file path to clipboard. | |
| Deletes the log files. | |
| Runs the dynamic reconfigure GUI for selected node. | |
| Edit values on the ROS Parameter Server of selected node. The dialog fields store a history of the entered data. To delete a stored entry, setect this entry and then press Shift+Delete. Additional, values of the parameter dialog can be stored or loaded from a file in YAML format. | |
| Opens the Launch File Editor | |
| Save current state (loaded launch files and running nodes) to a profile. You can load this profile through launch dock. | |
| Unloads the configuration file(s). |


Florida woman arrested, charged after hitting school bus with her vehicle
by WFTS Digital StaffHILLSBOROUGH COUNTY, Fla. — A Hillsborough County woman who refused to get out of her car at her child's bus stop was arrested after ramming the bus with her vehicle.
The Hillsborough County Sheriff's Office said on Tuesday around 2 p.m., Ashley Moore, 34, parked at her child's stop near Early Run Lane and Herons Path Place in Riverview. She is the legal guardian and biological aunt of the child.
HILLSBOROUGH NEWS | The latest headlines from Hillsborough County
When the bus arrived, Moore refused the bus driver's request to get out of her car to retrieve her child from the bus. It's required by the Hillsborough County Public Schools guidelines.
The bus driver told Moore if she didn't get out of her car, the child would have to be returned to school. When the bus driver finally pulled away from the stop, Moore pulled into the path of travel for the bus and struck the back of the bus.
There were no injuries, and only minor damage to the vehicles. The only child on the bus was Moore's child.
Moore was arrested and charged with aggravated assault with a motor vehicle and culpable negligence.
The School Resource Section and Florida Child Abuse Hotline were notified.
*Editor's note: The article has been corrected to state that Ashley Moore is the child's biological aunt and legal guardian and not his mother as originally stated by HCSO.*


Create a new empty mutable hash table with an internal bucket array of the given approximate size
and with the given key hash/equality functions
Public properties
intCount get;
The total number of keys in the hash table
ValueItem get; set;
Lookup or set the given element in the table. Set replaces all existing bindings for a value with a single
bindings. Raise KeyNotFoundException if the element is not found.


Class for LineSegment definition.
More...
#include <primitives.h>
Class for LineSegment definition.
◆ LineSegment() [1/2]
| LineSegment::LineSegment |
( |
| ) |
|
◆ LineSegment() [2/2]
overloaded constructor
- Parameters
-
| p1 | initialize start_point |
| p2 | initialize end_point |
◆ contains_point()
| bool LineSegment::contains_point |
( |
Point |
pt | ) |
const |
checks wheter point is on line
- Parameters
-
- Returns
- boolean contains point
◆ end_pt()
| Point LineSegment::end_pt |
( |
| ) |
|
◆ horizontal_projection()
| Point LineSegment::horizontal_projection |
( |
const Point & |
pt | ) |
const |
Finds horizontal projection
- Parameters
-
- Returns
- Point of horizontal projection
◆ intersects_at()
checks wheter point is on line
- Parameters
-
- Returns
- Point of intersection
◆ is_nan()
| bool LineSegment::is_nan |
( |
| ) |
|
checks for illegal line/point/angle/length
◆ operator==()
checks for same line segment
- Parameters
-
- Returns
- boolean same line
◆ slope()
slope of the line segment
◆ start_pt()
| Point LineSegment::start_pt |
( |
| ) |
|
◆ vertical_projection()
| Point LineSegment::vertical_projection |
( |
const Point & |
pt | ) |
const |
Finds vertical projection
- Parameters
-
- Returns
- Point of vertical projection
The documentation for this class was generated from the following files:


Radhika enjoys the finer things in life, which include her love of traveling, food, and new adventures. The one thing Radhika cannot live without are her heels, clothes, and jewelry. She currently works at USAA, where she has equal amounts of learning, coding, and laughs.
Lu loves the numbers that make up life. Along with her love of theoretical math, coding, and the chinese language, she also hopes to find the meaning of life through computation. She is currenty working at USAA, where she gets to work, code, and play at her leisure.


U.S. recorded 11 cases of measles over the past month
(Reuters) - The United States recorded 11 measles cases over a month as of Nov. 7, taking the total cases for the year to 1,261 in the worst outbreak since 1992, the Centers for Disease Control and Prevention said on Tuesday.
The measles outbreak, which began in New York in October 2018, has largely been linked to children who did not receive vaccination.


Pick your token
CAT
ASTS
TNS
TRST
BCS
Enter token amount
Calculated estimated amount
Estimated amount is
Make a tx
https
Token is locked
Unlock


Paid time off
We want our team to be happy and refreshed, and to maintain a healthy work-life balance, so every employee earns generous paid time off that can be used freely for vacations and adventures, time with loved ones, appointments, sick days, jury duty, and just about anything else. This is in addition to company observed holidays.
How it works
You’ll earn a specific amount of paid time off each year based on how long you’ve been with our company, as shown in the table below:
| Years of service | Paid time off, per year |
|---|---|
| 0-2 | 3 weeks |
| 2-4 | 3.5 weeks |
| 4+ | 4 weeks |
The amount you earn is converted to hours (where 1 week equals 40 hours) and then divided by the number of pay periods per year to determine the amount you earn each pay period.
For example, let’s say you’re currently earning three weeks of paid time off each year (120 hours). Assuming a semi-monthly pay period, that equates to 5 hours of paid time off each pay period.
Accrued paid time off rolls over from year-to-year; however, you can only accumulate a maximum of 4 weeks of paid time off at any given time (we want you to take advantage of it!).
New employees will begin accruing paid time off during their second pay period. To compensate for this, and to help out in the event something unexpected comes up early into their employment, newly hired employees will begin with three days of paid time off.
How to use
Paid time off can be used by notifying the person you report to as early as reasonably possible and gaining approval. Different reasons for requesting time off will naturally have different expectations for how early you’re able to send notification.
Time off can be taken in half-hour increments.
Unused balance
Any unused PTO balance will be paid out with the final paycheck if an employee leaves the company.


Data Structures | |
| struct | lh_entry |
| struct | lh_table |
Defines | |
| #define | LH_PRIME 0x9e370001UL |
| #define | LH_LOAD_FACTOR 0.66 |
| #define | LH_EMPTY (void*)-1 |
| #define | LH_FREED (void*)-2 |
| #define | lh_foreach(table, entry) for(entry = table->head; entry; entry = entry->next) |
| #define | lh_foreach_safe(table, entry, tmp) for(entry = table->head; entry && ((tmp = entry->next) || 1); entry = tmp) |
Typedefs | |
| typedef void( | lh_entry_free_fn )(struct lh_entry *e) |
| typedef unsigned long( | lh_hash_fn )(const void *k) |
| typedef int( | lh_equal_fn )(const void *k1, const void *k2) |
Functions | |
| unsigned long | lh_ptr_hash (const void *k) |
| int | lh_ptr_equal (const void *k1, const void *k2) |
| unsigned long | lh_char_hash (const void *k) |
| int | lh_char_equal (const void *k1, const void *k2) |
| struct lh_table * | lh_table_new (int size, const char *name, lh_entry_free_fn *free_fn, lh_hash_fn *hash_fn, lh_equal_fn *equal_fn) |
| struct lh_table * | lh_kchar_table_new (int size, const char *name, lh_entry_free_fn *free_fn) |
| struct lh_table * | lh_kptr_table_new (int size, const char *name, lh_entry_free_fn *free_fn) |
| void | lh_table_free (struct lh_table *t) |
| int | lh_table_insert (struct lh_table *t, void *k, const void *v) |
| struct lh_entry * | lh_table_lookup_entry (struct lh_table *t, const void *k) |
| const void * | lh_table_lookup (struct lh_table *t, const void *k) |
| json_bool | lh_table_lookup_ex (struct lh_table *t, const void *k, void **v) |
| int | lh_table_delete_entry (struct lh_table *t, struct lh_entry *e) |
| int | lh_table_delete (struct lh_table *t, const void *k) |
| void | lh_abort (const char *msg,...) |
| void | lh_table_resize (struct lh_table *t, int new_size) |
| #define LH_EMPTY (void*)-1 |
sentinel pointer value for empty slots
| #define lh_foreach | ( | table, | |||
| entry | ) | for(entry = table->head; entry; entry = entry->next) |
Convenience list iterator.
| #define lh_foreach_safe | ( | table, | |||
| entry, | |||||
| tmp | ) | for(entry = table->head; entry && ((tmp = entry->next) || 1); entry = tmp) |
lh_foreach_safe allows calling of deletion routine while iterating.
| #define LH_FREED (void*)-2 |
sentinel pointer value for freed slots
| #define LH_LOAD_FACTOR 0.66 |
The fraction of filled hash buckets until an insert will cause the table to be resized. This can range from just above 0 up to 1.0.
| #define LH_PRIME 0x9e370001UL |
golden prime used in hash functions
| typedef void( lh_entry_free_fn)(struct lh_entry *e) |
callback function prototypes
| typedef int( lh_equal_fn)(const void *k1, const void *k2) |
callback function prototypes
| typedef unsigned long( lh_hash_fn)(const void *k) |
callback function prototypes
| void lh_abort | ( | const char * | msg, | |
| ... | ||||
| ) |
| int lh_char_equal | ( | const void * | k1, | |
| const void * | k2 | |||
| ) |
| unsigned long lh_char_hash | ( | const void * | k | ) |
| struct lh_table* lh_kchar_table_new | ( | int | size, | |
| const char * | name, | |||
| lh_entry_free_fn * | free_fn | |||
| ) | [read] |
Convenience function to create a new linkhash table with char keys.
| size | initial table size. | |
| name | table name. | |
| free_fn | callback function used to free memory for entries. |
| struct lh_table* lh_kptr_table_new | ( | int | size, | |
| const char * | name, | |||
| lh_entry_free_fn * | free_fn | |||
| ) | [read] |
Convenience function to create a new linkhash table with ptr keys.
| size | initial table size. | |
| name | table name. | |
| free_fn | callback function used to free memory for entries. |
| int lh_ptr_equal | ( | const void * | k1, | |
| const void * | k2 | |||
| ) |
| unsigned long lh_ptr_hash | ( | const void * | k | ) |
Pre-defined hash and equality functions
| int lh_table_delete | ( | struct lh_table * | t, | |
| const void * | k | |||
| ) |
Delete a record from the table. If a callback free function is provided then it is called for the for the item being deleted.
| t | the table to delete from. | |
| k | a pointer to the key to delete. |
Delete a record from the table. If a callback free function is provided then it is called for the for the item being deleted.
| t | the table to delete from. | |
| e | a pointer to the entry to delete. |
| void lh_table_free | ( | struct lh_table * | t | ) |
Free a linkhash table. If a callback free function is provided then it is called for all entries in the table.
| t | table to free. |
| int lh_table_insert | ( | struct lh_table * | t, | |
| void * | k, | |||
| const void * | v | |||
| ) |
Insert a record into the table.
| t | the table to insert into. | |
| k | a pointer to the key to insert. | |
| v | a pointer to the value to insert. |
| const void* lh_table_lookup | ( | struct lh_table * | t, | |
| const void * | k | |||
| ) |
Lookup a record into the table
| t | the table to lookup | |
| k | a pointer to the key to lookup |
Lookup a record into the table.
| t | the table to lookup | |
| k | a pointer to the key to lookup |
Lookup a record in the table
| t | the table to lookup | |
| k | a pointer to the key to lookup | |
| v | a pointer to a where to store the found value (set to NULL if it doesn't exist). |
| struct lh_table* lh_table_new | ( | int | size, | |
| const char * | name, | |||
| lh_entry_free_fn * | free_fn, | |||
| lh_hash_fn * | hash_fn, | |||
| lh_equal_fn * | equal_fn | |||
| ) | [read] |
Create a new linkhash table.
| size | initial table size. The table is automatically resized although this incurs a performance penalty. | |
| name | the table name. | |
| free_fn | callback function used to free memory for entries when lh_table_free or lh_table_delete is called. If NULL is provided, then memory for keys and values must be freed by the caller. | |
| hash_fn | function used to hash keys. 2 standard ones are defined: lh_ptr_hash and lh_char_hash for hashing pointer values and C strings respectively. | |
| equal_fn | comparison function to compare keys. 2 standard ones defined: lh_ptr_hash and lh_char_hash for comparing pointer values and C strings respectively. |
| void lh_table_resize | ( | struct lh_table * | t, | |
| int | new_size | |||
| ) |


Click the button below to get started and you'll receive a fresh set of horoscopes daily at 9AM EST.
If I didn't get my horoscope that told me I'd write a horoscope Glass app I probably wouldn't have done it. Thank Goodness I'm a Leo. -- Niket (nnd@)


ASSIGNMENT, THE By Harvey Karten, Ph.D. Triumph Films Director: Christian Duguay Writer: Dan Gordon, Sabi H. Shabtai Cast: Aidan Quinn, Ben Kingsley, Donald Sutherland, Claudia Terri, Lilliana Duguay
In his New York Times op ed piece which appeared two days after Princess Diana's death, A.M. Rosenthal compares the paparazzi to an animal. ""The paparazzi pursued the couple as a jackal his prey. They knew that a good picture like a kiss or hug seen through a car window would bring scores of thousands of dollars and that any picture would bring a price handsome enough for their gas and waiting time until the next gathering of the jackals."
The label "jackal," unfortunately, might be looked on by some human beings so named as a badge of honor. The master-terrorist Carlos Sanchez, who allegedly took pleasure in killing and maiming innocent men, women and children in the service of Middle Eastern and European clients, could scarcely object. Though chased for twenty years by the CIA and the Israeli secret service known as Mossad, Carlos, like the wily beast whose nickname he probably cherished, was able to slip through their grip time and time again.
"The Assignment," a movie inspired by the Jackal's wicked acts, could have been just another action-adventure picture: good guy searches for bad guy, good guy caught, bad guy ultimately nailed. But director Christian Duguay, employing a tense screenplay by Dan Gordon and Sabi H. Shabtai, focuses not on the terrorist himself but on the psychology of a man who resembles him strikingly. Duguay aspires to show us that there is a dark corner inside the souls of all people, an intersection which we avoid under normal circumstances but one which can be crossed given the right instruction. "The Assignment" deals with a rather ordinary man, a family-loving Naval officer who is deeply patriotic, who is seduced into taking on a dangerous mission and suffers a dramatic change of his very character as a result. Featuring intense action and psychological probing, "The Assignment" is like a James Bond adventure played with total seriousness, which has been filmed with technical expertise in Budapest, Israel and Montreal as stand-ins for Moscow, Norfolk, East Berlin, and Tripoli.
When Annibal Ramirez (Aidan Quinn) is touring Israel after his ship has docked at Haifa, he is picked up by the Mossad and brutally questioned until the intelligence agents realize that he is merely a lookalike for Carlos. Realizing that they had found a gold mine, they press him into their service. Mossad agent Amos (Ben Kingsley) and C.I.A. operative Jack Shaw (Donald Sutherland) have a plan to rid the world of its most notorious assassin by having Ramirez impersonate him. In effect, they make him recap the motif of summer action movie "Face/Off": To find him, he must become him." Rigorously trained like the Bridget Fonda character in "Point of No Return," Ramirez is not only able to fulfill the requisites of the job--to kill, to survive isolation, even to make love like Carlos--he actually internalizes the terrorist. More than any other human being outside of the man himself, Ramirez feels Carlos's anger and must ultimately struggle to pull back to his own, far gentler, identity.
While the shootouts ostensibly taking place in Libya are tense, they feature the usual cliches of the action-adventure mold rather than the intricacies of good spy movies--car chases, jumps from rooftops, hot pursuits by bands of generic thugs, sinister-looking Communists, beautiful women. The most notable part of the film, however, is the training program which the agents have designed, a program of the sort that only G.I. Jane and James Bond would be expected to pass. He must above all be observant: able to count the cups, saucers and plates in a kitchen cabinet in four seconds; to know the name and location of every gravestone he passes so that if a name is called, he can draw his weapon and shoot the ghostly figure which emerges behind the stone. Most difficult of all, he must eat porridge day and night, sometimes eight bowls at a time, to reach the depths of anger which Carlos feels. (The terrorist as a child was forced to down the sludge by his atypical family.) He must even survive a trip on L.S.D. which the agents have secretly administered to spice up the breakfast cereal, a trip which--captured by a motion control camera to replicate the demons he appears to face-- represents an excursion into the very soul of the serial killer.
With his classical Irish good looks, Aidan Quinn has been typically cast as a romantic lead. Not this time. His performance in a double role as a man who turns from gentle, family man to utterly amoral and immoral murderer is a riveting one, one which allows him successfully to extend his range. With Donald Sutherland's ironically smiling face as C.I.A. operative repeatedly egging Ramirez on and Ben Kingsley's less histrionic but equally passionate fervor driving the stakes forward, Christian Duguay has helmed a thriller with superior performances from the key figures, adding to the insight gained from such movies as "Donnie Brasco" into the scope of our passions. While Carlos himself is safely in a maximum security cell in France, a country which had seen the terrorist mastermind the deaths of many women and children, we sense that the real work which went into his capture has not been shown. The movie is, however, an intelligent, imaginative bit a fiction about suggesting one way the killer may have been captured. Rated R. Running Time: 110 minutes. (C) 1997 Harvey Karten
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


You have provided the following information in your Registered Seller application. In order to proceed, please confirm that these details are correct. If they are not, please amend your answers before submitting the application.
| {{item}} {{item}} |
| {{item.text}} {{item.text}} |
| Do you intend on selling Controlled Equipment to others? |
| {{formData?.intendonsellingequipmenttoothers === true ? 'Yes' : 'No'}} |
| What type of seller are you? |
|
Manufacturer of Controlled Equipment
One-time seller of Controlled Equipment
Retailer of Controlled Equipment
Other: {{formData?.typeofsellerother}}
|
| What type of Controlled Equipment do you intend to sell? |
|
Pill press
Encapsulator
Die, mould, or punch
Pharmaceutical Mixer or Blender
Other: {{formData?.intendtosellother}}
|
| Please tell us more about your business as it relates to selling Controlled Equipment? |
| {{formData?.additionalbusinessinformationaboutseller}} |
| Business owners and managers listed in this application: |
| FIRST NAME | LAST NAME | TITLE/POSITION | CONTACT DETAILS |
|---|---|---|---|
| {{item?.contact?.firstName}} | {{item?.contact?.lastName}} | {{item?.jobTitle}} | Phone: {{item?.contact?.phoneNumber}} Email: {{item?.contact?.email}} |


|
Bitshares-Core
3.0.0
BitShares blockchain implementation and command-line interface software
|
Public Types | |
| typedef void | result_type |
Public Attributes | |
| flat_set< account_id_type > & | _impacted |
Definition at line 24 of file db_notify.cpp.
| typedef void get_impacted_account_visitor::result_type |
Definition at line 28 of file db_notify.cpp.
|
inline |
Definition at line 27 of file db_notify.cpp.
|
inline |
Definition at line 30 of file db_notify.cpp.
|
inline |
Definition at line 35 of file db_notify.cpp.
|
inline |
Definition at line 39 of file db_notify.cpp.
|
inline |
Definition at line 43 of file db_notify.cpp.
|
inline |
Definition at line 47 of file db_notify.cpp.
|
inline |
Definition at line 51 of file db_notify.cpp.
|
inline |
Definition at line 55 of file db_notify.cpp.
|
inline |
Definition at line 59 of file db_notify.cpp.
|
inline |
Definition at line 63 of file db_notify.cpp.
|
inline |
Definition at line 67 of file db_notify.cpp.
|
inline |
Definition at line 74 of file db_notify.cpp.
|
inline |
Definition at line 82 of file db_notify.cpp.
|
inline |
Definition at line 87 of file db_notify.cpp.
|
inline |
Definition at line 91 of file db_notify.cpp.
|
inline |
Definition at line 95 of file db_notify.cpp.
|
inline |
Definition at line 99 of file db_notify.cpp.
|
inline |
Definition at line 105 of file db_notify.cpp.
|
inline |
Definition at line 110 of file db_notify.cpp.
|
inline |
Definition at line 114 of file db_notify.cpp.
|
inline |
Definition at line 118 of file db_notify.cpp.
|
inline |
Definition at line 123 of file db_notify.cpp.
|
inline |
Definition at line 127 of file db_notify.cpp.
|
inline |
Definition at line 131 of file db_notify.cpp.
|
inline |
Definition at line 135 of file db_notify.cpp.
|
inline |
Definition at line 139 of file db_notify.cpp.
|
inline |
Definition at line 143 of file db_notify.cpp.
|
inline |
Definition at line 147 of file db_notify.cpp.
|
inline |
Definition at line 151 of file db_notify.cpp.
|
inline |
Definition at line 160 of file db_notify.cpp.
|
inline |
Definition at line 164 of file db_notify.cpp.
|
inline |
Definition at line 168 of file db_notify.cpp.
|
inline |
Definition at line 173 of file db_notify.cpp.
|
inline |
Definition at line 178 of file db_notify.cpp.
|
inline |
Definition at line 183 of file db_notify.cpp.
|
inline |
Definition at line 188 of file db_notify.cpp.
|
inline |
Definition at line 192 of file db_notify.cpp.
|
inline |
Definition at line 196 of file db_notify.cpp.
|
inline |
Definition at line 200 of file db_notify.cpp.
|
inline |
Definition at line 205 of file db_notify.cpp.
|
inline |
Definition at line 209 of file db_notify.cpp.
|
inline |
Definition at line 213 of file db_notify.cpp.
|
inline |
Definition at line 217 of file db_notify.cpp.
|
inline |
Definition at line 221 of file db_notify.cpp.
|
inline |
Definition at line 225 of file db_notify.cpp.
|
inline |
Definition at line 231 of file db_notify.cpp.
|
inline |
Definition at line 237 of file db_notify.cpp.
|
inline |
Definition at line 245 of file db_notify.cpp.
|
inline |
Definition at line 252 of file db_notify.cpp.
|
inline |
Definition at line 256 of file db_notify.cpp.
|
inline |
Definition at line 260 of file db_notify.cpp.
|
inline |
Definition at line 265 of file db_notify.cpp.
|
inline |
Definition at line 269 of file db_notify.cpp.
|
inline |
Definition at line 273 of file db_notify.cpp.
|
inline |
Definition at line 277 of file db_notify.cpp.
| flat_set<account_id_type>& get_impacted_account_visitor::_impacted |
Definition at line 26 of file db_notify.cpp.


Netscape vs. Microsoft:
Let’s talk about the “Browser Wars.” They kicked off in the mid-90s, at a time when the world was just starting to come online.
Netscape:
Netscape had a pretty meteoric rise to the top of the web world. The company began pretty soon after software engineer Marc Andreessen graduated from the University of Illinois in 1994. So not long after he left Illinois, Andreessen was contacted by Jim Clark, a legend in the Silicon Valley area. Clark and Andreessen met a few times, and decided that a top of the line commercial browser was exactly what the market needed. By the end of 1994, they had already delivered a first step. Originally slated to be called Mosaic, the browser they released to the world became known as Netscape Navigator.
Netscape Goes Public:
For a company of Netscape’s size, their IPO went incredibly well. And that’s when Netscape got their first real competition from the goliath they knew would eventually come around: Microsoft. Bill Gates had notoriously stomped out adversaries in the past without a second thought. And already, Netscape had begun to consult an anti-trust lawyer to prepare against a possible assault.
A few Microsoft engineers got together to start working on a new browser. And that’s why a few of them ended up at a meeting at Netscape.
Over the years, this meeting has become the stuff of legends, primarily because there are two completely different versions of how it went down. In Microsoft’s version, the meeting went off without a hitch. In a long, but productive exchange, the two companies shared ideas and visions for the future.
In Netscape’s version, things are quite a bit different. Microsoft came to them with an ultimatum. Join up or move out of the way. Microsoft offered Netscape a meager sum for their browsers code base. When the team refused, employees from Microsoft threatened to eliminate them from the market by any means necessary. As Netscape’s success grew, Microsoft got their own browser ready.
Internet Explorer:
As Netscape’s success grew, Microsoft got their own browser ready. It was called Internet Explorer. And
version 1 was released fifteen days after Netscape’s IPO. For the next few years, Netscape and Microsoft
waged war. One update after the other, Netscape and Microsoft fought each other head to head. Then, with the
release of Internet Explorer 3.0, Microsoft dropped the hammer. They included this version, for free,
bundled right into the Windows ’95 operating system. All at once, Netscape’s pricing model completely fell
apart.
The end of a War:
Netscape continued to innovate, but they knew they couldn’t keep up. So, in January of 1998, they open
sourced their browser, and began giving it away for free. In November of 1998, Netscape was sold to AOL for
$4.2 billion. Eventually, Microsoft wrestled almost complete control over the market.


--- title: 'Tauihi 2022: Semi-final preview - Northern Kāhu vs. Mid-North Whai' author: Jacquie Tran date: '2022-08-22' slug: tauihi-2022-semi-finals-kaahu-vs-whai categories: - On-field analyses tags: - basketball - women's sport - tauihi - r stats - sports analytics draft: yes ---
It’s a wonderful time of year - finals time!
The first season of the Tauihi Aotearoa women’s basketball league here in New Zealand has been a great success, at least from my point of view as a fan. Every team has competed hard, and the quality of play appears to have improved across the board as the season has gone on. The atmosphere in the stadiums has been lively, with plenty of bums on seats, and eyeballs on screens - every game has been shown live and in full on Sky Sports.
For me, it’s been a thrill to watch two familiar faces from the WNBL - Tahlia Tupaea and Micaela Cocks - grow their games even further, stepping comfortably into their roles for the Northern Kāhu as prominent scoring threats and tone-setters. The quality of Tupaea and Cocks highlights the gap in standards between the Australian and New Zealand game, while at the same time, their presence and output in this homegrown competition also shows a way forward for what New Zealand women’s basketball could become with greater and more consistent investment and high quality competition, including exposure to international players and game styles.
But the season isn’t over yet! We’re down to the last weekend: finals weekend. Before the inaugural Tauihi Aotearoa Champions are crowned, let’s take a look at Friday’s semi-final match-ups:
For this post, let’s take a look at the semi-final 1 match up: Kāhu vs. Whai.
As per usual, we load up the relevant libraries to start.
library(dplyr)
library(stringr)
library(ggplot2)
I’m using box scores data from all matches in the 2022 regular season, obtained from the Tauihi website and soon to be available through the wnblr
package - watch this space…
Box scores are a mine of information, but I still gravitate towards Dean Oliver’s Four Factors. Sure, there is room for critique, as done well here by Justin Jacobs, but ultimately these metrics do provide insight into what contributes to team wins (and losses) through a simple representation of key game elements.
The Four Factors are actually eight measures - each measure below is calculated for each opposing team in a match:
The Kāhu finished up the regular season with a league-leading 10-2 record, including 9 straight wins to start the season before 2 losses in the row to the Tokomanawa Queens.
# Subset to Kāhu box scores only
box_scores_kaahu <- box_scores_tauihi %>%
filter(str_detect(team_name, "Northern")) %>%
select(
page_id, date_of_game, team_name, team_name_opp, points_total,
points_total_opp, points_margin, team_result, contains("efg_pct"),
contains("turnover_rate"), contains("rebounds_offensive_pct"),
contains("free_throw_rate"))
four_factors_kaahu <- box_scores_kaahu %>%
select(
contains("efg_pct"), contains("turnover_rate"),
contains("rebounds_offensive_pct"), contains("free_throw_rate")) %>%
tidyr::pivot_longer(
cols = c(
"efg_pct", "efg_pct_opp", "turnover_rate", "turnover_rate_opp",
"rebounds_offensive_pct", "rebounds_offensive_pct_opp", "free_throw_rate",
"free_throw_rate_opp"),
names_to = "key",
values_to = "value")
# Four Factors: Calculate medians for the rest of the league
four_factors_without_kaahu <- box_scores_tauihi %>%
filter(!str_detect(team_name, "Northern")) %>%
select(
page_id, date_of_game, team_name, team_name_opp, points_total,
points_total_opp, points_margin, team_result, contains("efg_pct"),
contains("turnover_rate"), contains("rebounds_offensive_pct"),
contains("free_throw_rate")) %>%
summarise_at(
vars(contains("efg_pct"), contains("turnover_rate"), contains("rebounds_offensive_pct"),
contains("free_throw_rate")),
median) %>%
tidyr::pivot_longer(
cols = c(
"efg_pct", "efg_pct_opp", "turnover_rate", "turnover_rate_opp",
"rebounds_offensive_pct", "rebounds_offensive_pct_opp", "free_throw_rate",
"free_throw_rate_opp"),
names_to = "key",
values_to = "value")
p <- ggplot() +
geom_boxplot(
data = four_factors_kaahu %>% filter(!str_detect(key, "opp")),
aes(x = key, y = value),
outlier.shape = NA, width = 0.5) +
geom_point(
data = four_factors_kaahu %>% filter(!str_detect(key, "opp")),
aes(x = key, y = value),
size = 5, alpha = 0.7) +
geom_errorbar(
data = four_factors_without_kaahu %>% filter(!str_detect(key, "opp")),
aes(x = key, ymin = value, ymax = value),
linetype = "dashed", colour = "red", size = 2)
plot_four_factors_kaahu <- p
plot_four_factors_kaahu
The Kāhu are top of the table going into finals and with good reason: compared to the rest of the league, they have been powerhouses in shooting, getting to the stripe, and keeping the ball secure. But if you’ve watched their games this season, there is one area where they have been, unsurprisingly, a bit untidy - their rebounding.
Let’s take a look at how opponents of the Kāhu have performed across the Four Factors:
p <- ggplot() +
geom_boxplot(
data = four_factors_kaahu %>% filter(str_detect(key, "opp")),
aes(x = key, y = value),
outlier.shape = NA, width = 0.5) +
geom_point(
data = four_factors_kaahu %>% filter(str_detect(key, "opp")),
aes(x = key, y = value),
size = 5, alpha = 0.7) +
geom_errorbar(
data = four_factors_without_kaahu %>% filter(str_detect(key, "opp")),
aes(x = key, ymin = value, ymax = value),
linetype = "dashed", colour = "red", size = 2)
plot_four_factors_kaahu_opponents <- p
plot_four_factors_kaahu_opponents
Assessing the Four Factors of opposing teams gives a little window into the defensive profile of the Kāhu - and it’s a mixed bag. They are better than the rest of the league in keeping teams away from the foul line and opposing teams have a higher rate of turnovers against the Kāhu than they do against all other Tauihi teams. However, the Kāhu allow their opponents to score at a better clip than they do against the rest of the league, and they also give up offensive boards to their opponents at a higher rate than those opposing teams achieve against the rest of league. The statistics tell a story of a team that defends aggressively in the open floor, but appears to have its struggles in half-court defensive.
Much of the Northern Kāhu’s success through the 2022 regular season is attributable to their offensive power - they can fill the bucket quickly, and while Tupaea and Cocks headline their scoring stats, the team is fortunate to have several very capable contributors besides who can add ~10-15 points with good ball movement and shot selection. With a championship up for grabs, the opportunity is for the Kāhu to find their groove defensively - especially to drive down their opponent’s quality of shots and minimise the second and third offensive chances that they sometimes give up to their competitors.
# Subset to Whai box scores only
box_scores_whai <- box_scores_tauihi %>%
filter(str_detect(team_name, "Whai")) %>%
select(
page_id, date_of_game, team_name, team_name_opp, points_total,
points_total_opp, points_margin, team_result, contains("efg_pct"),
contains("turnover_rate"), contains("rebounds_offensive_pct"),
contains("free_throw_rate"))
four_factors_whai <- box_scores_whai %>%
select(
contains("efg_pct"), contains("turnover_rate"),
contains("rebounds_offensive_pct"), contains("free_throw_rate")) %>%
tidyr::pivot_longer(
cols = c(
"efg_pct", "efg_pct_opp", "turnover_rate", "turnover_rate_opp",
"rebounds_offensive_pct", "rebounds_offensive_pct_opp", "free_throw_rate",
"free_throw_rate_opp"),
names_to = "key",
values_to = "value")
# Four Factors: Calculate medians for the rest of the league
four_factors_without_whai <- box_scores_tauihi %>%
filter(!str_detect(team_name, "Whai")) %>%
select(
page_id, date_of_game, team_name, team_name_opp, points_total,
points_total_opp, points_margin, team_result, contains("efg_pct"),
contains("turnover_rate"), contains("rebounds_offensive_pct"),
contains("free_throw_rate")) %>%
summarise_at(
vars(contains("efg_pct"), contains("turnover_rate"), contains("rebounds_offensive_pct"),
contains("free_throw_rate")),
median) %>%
tidyr::pivot_longer(
cols = c(
"efg_pct", "efg_pct_opp", "turnover_rate", "turnover_rate_opp",
"rebounds_offensive_pct", "rebounds_offensive_pct_opp", "free_throw_rate",
"free_throw_rate_opp"),
names_to = "key",
values_to = "value")
p <- ggplot() +
geom_boxplot(
data = four_factors_whai %>% filter(!str_detect(key, "opp")),
aes(x = key, y = value),
outlier.shape = NA, width = 0.5) +
geom_point(
data = four_factors_whai %>% filter(!str_detect(key, "opp")),
aes(x = key, y = value),
size = 5, alpha = 0.7) +
geom_errorbar(
data = four_factors_without_whai %>% filter(!str_detect(key, "opp")),
aes(x = key, ymin = value, ymax = value),
linetype = "dashed", colour = "red", size = 2)
plot_four_factors_whai <- p
plot_four_factors_whai
Points production is lower for the Whai than for the rest of league. However, what keeps them in it is their active presence on the offensive boards, which makes up somewhat for their lower shooting outputs by creating multiple chances to score. The Whai also do a better job than the rest of the league with minimising turnovers.
p <- ggplot() +
geom_boxplot(
data = four_factors_whai %>% filter(str_detect(key, "opp")),
aes(x = key, y = value),
outlier.shape = NA, width = 0.5) +
geom_point(
data = four_factors_whai %>% filter(str_detect(key, "opp")),
aes(x = key, y = value),
size = 5, alpha = 0.7) +
geom_errorbar(
data = four_factors_without_whai %>% filter(str_detect(key, "opp")),
aes(x = key, ymin = value, ymax = value),
linetype = "dashed", colour = "red", size = 2)
plot_four_factors_whai_opponents <- p
plot_four_factors_whai_opponents
From their opponents’ Four Factors, we can see how strong the Whai are on the boards - they give away very few offensive rebounds, which, in combination with the previous chart, reflects their efforts on both the offensive and defensive glass. They also do a pretty good job of restricting shooting accuracy, with their opponents’ scoring below their typical rate when playing the rest of the league. However, they leak points from the free throw line.
kaahu_vs_whai <- box_scores_tauihi %>%
filter(str_detect(team_name, "Northern") |
str_detect(team_name, "Whai"))


These Website Standard Terms And Conditions (these “Terms” or these “Website Standard Terms And Conditions”) contained herein on this webpage, shall govern your use of this website, including all pages within this website (collectively referred to herein below as this “Website”). These Terms apply in full force and effect to your use of this Website and by using this Website, you expressly accept all terms and conditions contained herein in full. You must not use this Website, if you have any objection to any of these Website Standard Terms And Conditions.
This Website is not for use by any minors (defined as those who are not at least 18 years of age), and you must not use this Website if you a minor.
2. Intellectual Property Rights
Other than content you own, which you may have opted to include on this Website, under these Terms, [Sender.Company] and/or its licensors own all rights to the intellectual property and material contained in this Website, and all such rights are reserved. You are granted a limited license only, subject to the restrictions provided in these Terms, for purposes of viewing the material contained on this Website.
3. Restrictions
You are expressly and emphatically restricted from all of the following:
publishing any Website material in any media;
selling, sublicensing and/or otherwise commercializing any Website material;
publicly performing and/or showing any Website material;
using this Website in any way that is, or may be, damaging to this Website;
using this Website in any way that impacts user access to this Website;
using this Website contrary to applicable laws and regulations, or in a way that causes, or may cause, harm to the Website, or to any person or business entity;
engaging in any data mining, data harvesting, data extracting or any other similar activity in relation to this Website, or while using this Website;
using this Website to engage in any advertising or marketing;
Certain areas of this Website are restricted from access by you and [Sender.Company] may further restrict access by you to any areas of this Website, at any time, in its sole and absolute discretion. Any user ID and password you may have for this Website are confidential and you must maintain confidentiality of such information.
4. Your Content
In these Website Standard Terms And Conditions, “Your Content” shall mean any audio, video, text, images or other material you choose to display on this Website. With respect to Your Content, by displaying it, you grant [Sender.Company] a non-exclusive, worldwide, irrevocable, royalty-free, sublicensable license to use, reproduce, adapt, publish, translate and distribute it in any and all media.
Your Content must be your own and must not be infringing on any third party’s rights. [Sender.Company] reserves the right to remove any of Your Content from this Website at any time, and for any reason, without notice.
5. No warranties
This Website is provided “as is,” with all faults, and [Sender.Company] makes no express or implied representations or warranties, of any kind related to this Website or the materials contained on this Website. Additionally, nothing contained on this Website shall be construed as providing consult or advice to you.
6. Limitation of liability
In no event shall [Sender.Company] , nor any of its officers, directors and employees, be liable to you for anything arising out of or in any way connected with your use of this Website, whether such liability is under contract, tort or otherwise, and [Sender.Company] , including its officers, directors and employees shall not be liable for any indirect, consequential or special liability arising out of or in any way related to your use of this Website
7. Indemnification
You hereby indemnify to the fullest extent [Sender.Company] from and against any and all liabilities, costs, demands, causes of action, damages and expenses (including reasonable attorney’s fees) arising out of or in any way related to your breach of any of the provisions of these Terms.
8. Severability
If any provision of these Terms is found to be unenforceable or invalid under any applicable law, such unenforceability or invalidity shall not render these Terms unenforceable or invalid as a whole, and such provisions shall be deleted without affecting the remaining provisions herein.
9. Variation of Terms
[Sender.Company] is permitted to revise these Terms at any time as it sees fit, and by using this Website you are expected to review such Terms on a regular basis to ensure you understand all terms and conditions governing use of this Website.


| Jan 12, 15, 19 |
Recording - Jan 12
Recording - Jan 15
Recording - Jan 19
|
Section 12.5: All problems |
| Jan 26, 29, Feb 2 |
Recording - Jan 26
Recording - Jan 29
Recording - Feb 2
|
Section 12.6: All problems
Section 12.7: All problems
|
|
Feb 5, 9, 12, 19
|
Recording - Feb 5
Recording - Feb 9
Recording - Feb 12
Recording - Feb 19
|
Section 13.1: All problems
Section 13.2: All problems
|
|
Feb
23, 26, Mar 12
|
Recording - Feb 23
Recording - Feb 26
Recording - Mar 12
|
Section 13.6: All problems
Section 13.7: 1 to 18
|
| Book Change: Calculus to ODE |
| Mar 16, 19 |
Recording - Mar 16
Recording - Mar 19 |
Section 1.1: 1-14, 17-20
Section 1.3: 2-5, 11-14, (optional) 19-36
|
|
Mar 26, 30
|
Recording - Mar 26
Recording - Mar 30
|
Section 1.4: 1 -14
|
|
Apr 2, 6
|
Recording - Apr 2
Recording - Apr 6
|
Section 2.2: Problems 1 to 30
|
Apr 9
Apr 13
|
Recording - Apr 9
Recording - Apr 13
|
Section 2.4: Problems 1 to 10
|
|
Apr 16, 20
|
Recording - Apr 16
Recording - Apr 20
|
Section 2.7: Problems 1 to 18
Section 2.8: All problems
|
|
Apr 27, May 3
|
Recording - Apr 27
Recording - May 3
|
Section 2.9: All problems
Section 2.10: Problems 1,2, 4-10
|


includes/header.html >>>
Error 404
I've no idea where
{{{ file }}}
is. But good luck!
Take me home ↩


roboguice.util
Class Ln
java.lang.Object
roboguice.util.Ln
public class Ln
- extends java.lang.Object
A more natural android logging facility.
WARNING: CHECK OUT COMMON PITFALLS BELOW
Unlike Log
, Log provides sensible defaults.
Debug and Verbose logging is enabled for applications that
have "android:debuggable=true" in their AndroidManifest.xml.
For apps built using SDK Tools r8 or later, this means any debug
build. Release builds built with r8 or later will have verbose
and debug log messages turned off.
The default tag is automatically set to your app's packagename,
and the current context (eg. activity, service, application, etc)
is appended as well. You can add an additional parameter to the
tag using #Log(String)
.
Log-levels can be programatically overridden for specific instances
using #Log(String, boolean, boolean)
.
Log messages may optionally use String.format(String, Object...)
formatting, which will not be evaluated unless the log statement is output.
Additional parameters to the logging statement are treated as varrgs parameters
to String.format(String, Object...)
Also, the current file and line is automatically appended to the tag
(this is only done if debug is enabled for performance reasons).
COMMON PITFALLS:
* Make sure you put the exception FIRST in the call. A common
mistake is to place it last as is the android.util.Log convention,
but then it will get treated as varargs parameter.
* vararg parameters are not appended to the log message! You must
insert them into the log message using %s or another similar
format parameter
Usage Examples:
Ln.v("hello there");
Ln.d("%s %s", "hello", "there");
Ln.e( exception, "Error during some operation");
Ln.w( exception, "Error during %s operation", "some other");
|
Field Summary |
protected static Ln.BaseConfig |
config
config is initially set to BaseConfig() with sensible defaults, then replaced
by BaseConfig(Context) during guice static injection pass. |
protected static Ln.Print |
print
print is initially set to Print(), then replaced by guice during
static injection pass. |
|
Method Summary |
static int |
d(java.lang.Object s1,
java.lang.Object... args)
|
static int |
d(java.lang.Throwable t)
|
static int |
d(java.lang.Throwable throwable,
java.lang.Object s1,
java.lang.Object... args)
|
static int |
e(java.lang.Object s1,
java.lang.Object... args)
|
static int |
e(java.lang.Throwable t)
|
static int |
e(java.lang.Throwable throwable,
java.lang.Object s1,
java.lang.Object... args)
|
static Ln.Config |
getConfig()
|
static int |
i(java.lang.Object s1,
java.lang.Object... args)
|
static int |
i(java.lang.Throwable t)
|
static int |
i(java.lang.Throwable throwable,
java.lang.Object s1,
java.lang.Object... args)
|
static boolean |
isDebugEnabled()
|
static boolean |
isVerboseEnabled()
|
static java.lang.String |
logLevelToString(int loglevel)
|
static int |
v(java.lang.Object s1,
java.lang.Object... args)
|
static int |
v(java.lang.Throwable t)
|
static int |
v(java.lang.Throwable throwable,
java.lang.Object s1,
java.lang.Object... args)
|
static int |
w(java.lang.Object s1,
java.lang.Object... args)
|
static int |
w(java.lang.Throwable t)
|
static int |
w(java.lang.Throwable throwable,
java.lang.Object s1,
java.lang.Object... args)
|
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
config
@Inject
protected static Ln.BaseConfig config
- config is initially set to BaseConfig() with sensible defaults, then replaced
by BaseConfig(Context) during guice static injection pass.
print
@Inject
protected static Ln.Print print
- print is initially set to Print(), then replaced by guice during
static injection pass. This allows overriding where the log message is delivered to.
v
public static int v(java.lang.Throwable t)
v
public static int v(java.lang.Object s1,
java.lang.Object... args)
v
public static int v(java.lang.Throwable throwable,
java.lang.Object s1,
java.lang.Object... args)
d
public static int d(java.lang.Throwable t)
d
public static int d(java.lang.Object s1,
java.lang.Object... args)
d
public static int d(java.lang.Throwable throwable,
java.lang.Object s1,
java.lang.Object... args)
i
public static int i(java.lang.Throwable t)
i
public static int i(java.lang.Object s1,
java.lang.Object... args)
i
public static int i(java.lang.Throwable throwable,
java.lang.Object s1,
java.lang.Object... args)
w
public static int w(java.lang.Throwable t)
w
public static int w(java.lang.Object s1,
java.lang.Object... args)
w
public static int w(java.lang.Throwable throwable,
java.lang.Object s1,
java.lang.Object... args)
e
public static int e(java.lang.Throwable t)
e
public static int e(java.lang.Object s1,
java.lang.Object... args)
e
public static int e(java.lang.Throwable throwable,
java.lang.Object s1,
java.lang.Object... args)
isDebugEnabled
public static boolean isDebugEnabled()
isVerboseEnabled
public static boolean isVerboseEnabled()
getConfig
public static Ln.Config getConfig()
logLevelToString
public static java.lang.String logLevelToString(int loglevel)
Copyright © 2011. All Rights Reserved.


Priest Wood:
May Einhasad's blessing forever be with you...
Exchange the Certificate of Dawn for a Forgotten Scroll.
Quest


| 1 | package fr.sii.ogham.testing.assertion.wiremock; | |
| 2 | ||
| 3 | import com.github.tomakehurst.wiremock.client.WireMock; | |
| 4 | import com.github.tomakehurst.wiremock.matching.MatchResult; | |
| 5 | import com.github.tomakehurst.wiremock.matching.StringValuePattern; | |
| 6 | import fr.sii.ogham.testing.assertion.exception.ComparisonException; | |
| 7 | import fr.sii.ogham.testing.assertion.util.HtmlUtils; | |
| 8 | import org.slf4j.Logger; | |
| 9 | import org.slf4j.LoggerFactory; | |
| 10 | import org.w3c.dom.Document; | |
| 11 | import org.xmlunit.diff.Diff; | |
| 12 | ||
| 13 | import java.util.concurrent.atomic.AtomicInteger; | |
| 14 | ||
| 15 | import static com.github.tomakehurst.wiremock.matching.MatchResult.*; | |
| 16 | ||
| 17 | /** | |
| 18 | * Check if the HTML is similar to the expected. The HTML strings are parsed | |
| 19 | * into {@link Document}s. Two documents are considered to be "similar" if they | |
| 20 | * contain the same elements and attributes regardless of order. | |
| 21 | * | |
| 22 | * <p> | |
| 23 | * See {@link HtmlUtils} for more information about "similar" HTML. | |
| 24 | * | |
| 25 | * <p> | |
| 26 | * NOTE: {@link WireMock#equalToXml(String)} does an identical check. | |
| 27 | * | |
| 28 | * @author Aurélien Baudet | |
| 29 | * | |
| 30 | */ | |
| 31 | public class SimilarHtmlPattern extends StringValuePattern { | |
| 32 | private static final Logger LOG = LoggerFactory.getLogger(SimilarHtmlPattern.class); | |
| 33 | ||
| 34 | /** | |
| 35 | * Initialized with the expected HTML | |
| 36 | * | |
| 37 | * @param expectedValue | |
| 38 | * the expected HTML | |
| 39 | */ | |
| 40 | public SimilarHtmlPattern(@wiremock.com.fasterxml.jackson.annotation.JsonProperty("similarHtml") String expectedValue) { | |
| 41 | super(expectedValue); | |
| 42 | } | |
| 43 | ||
| 44 | @Override | |
| 45 | public MatchResult match(String value) { | |
| 46 | try { | |
| 47 | Diff diff = HtmlUtils.compare(expectedValue, value, false); | |
| 48 | return diff.hasDifferences() ? partialMatch(computeDistance(diff)) : exactMatch(); | |
| 49 | } catch(ComparisonException e) { | |
| 50 | // ignore because WireMock will try each value (body, multipart files, ...) so comparison may fail | |
| 51 | // due to not xml value | |
| 52 | LOG.debug("Can't match since ", e); | |
| 53 | return noMatch(); | |
| 54 | } | |
| 55 | } | |
| 56 | ||
| 57 | private double computeDistance(Diff diff) { | |
| 58 | final AtomicInteger count = new AtomicInteger(); | |
| 59 |
1
1. computeDistance : removed call to java/lang/Iterable::forEach → NO_COVERAGE |
diff.getDifferences().forEach((d) -> count.incrementAndGet()); |
| 60 |
1
1. computeDistance : replaced double return with 0.0d for fr/sii/ogham/testing/assertion/wiremock/SimilarHtmlPattern::computeDistance → NO_COVERAGE |
return count.doubleValue(); |
| 61 | } | |
| 62 | } | |
Mutations | ||
| 59 |
1.1 |
|
| 60 |
1.1 |


Ext Core has a documentation center like Ext JS with only methods available in Core.
Ext Core has a complete manual authored by the team detailing all of the functionality included in the library and how to use it.


GETTID
Section: Linux Programmer's Manual (2)
Updated: 2014-02-11
Index
Return to Main Contents
NAME
gettid - get thread identification
SYNOPSIS
#include <sys/types.h>
pid_t gettid(void);
Note:
There is no glibc wrapper for this system call; see NOTES.
DESCRIPTION
gettid()
returns the caller's thread ID (TID).
In a single-threaded process, the thread ID
is equal to the process ID (PID, as returned by
getpid(2)).
In a multithreaded process, all threads
have the same PID, but each one has a unique TID.
For further details, see the discussion of
CLONE_THREAD
in
clone(2).
RETURN VALUE
On success, returns the thread ID of the calling process.
ERRORS
This call is always successful.
VERSIONS
The
gettid()
system call first appeared on Linux in kernel 2.4.11.
CONFORMING TO
gettid()
is Linux-specific and should not be used in programs that
are intended to be portable.
NOTES
Glibc does not provide a wrapper for this system call; call it using
syscall(2).
The thread ID returned by this call is not the same thing as a
POSIX thread ID (i.e., the opaque value returned by
pthread_self(3)).
SEE ALSO
capget(2),
clone(2),
fcntl(2),
fork(2),
get_robust_list(2),
getpid(2),
ioprio_set(2),
perf_event_open(2),
sched_setaffinity(2),
sched_setparam(2),
sched_setscheduler(2),
tgkill(2),
timer_create(2)
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- RETURN VALUE
-
- ERRORS
-
- VERSIONS
-
- CONFORMING TO
-
- NOTES
-
- SEE ALSO
-
This document was created by
man2html,
using the manual pages.
Time: 02:54:48 GMT, September 18, 2014


Edition history
Edit (pull request)Pending operations history
The sub-menu history provide a view to see the two histories.
The default history is the list of current operation on the topology with :
- the author
- the operation name
Select an operation to see it’s details.
Git history
Every archive under edition in alien4cloud is managed using the git version control system. This enabled git history feature out of the box in addition to the current operations history. Every time a topology is saved in alien4cloud a commit is performed on the local git history with an auto-generated commit message that contains the summary of operations applied while saving.
- date of commit
- name of the user who save the topology archive
- email of the user who save the topology archive
- message with all operations applied during save and their author (which may be or not the same as the commit author)


We assume that the source text has been transformed into an array of simple token objects (tokens), each containing a type member that is a string ("name", "string", "number", "operator") and a value member that is a string or number.
The token variable always contains the current token:
var token;
The advance function makes a new token object and assigns it to the token variable. It takes an optional id parameter, which it can check against the id of the previous token. The new token object's prototype will be a name token in the current scope or a symbol from the symbol table. The new token's arity will be "name", "literal", or "operator". Its arity may be changed later to "binary", "unary", or "statement" when we know more about the token's role in the program:
var advance = function (id) { var a, o, t, v; if (id && token.id !== id) { token.error("Expected '" + id + "'."); } if (token_nr >= tokens.length) { token = symbol_table["(end)"]; return; } t = tokens[token_nr]; token_nr += 1; v = t.value; a = t.type; if (a === "name") { o = scope.find(v); } else if (a === "operator") { o = symbol_table[v]; if (!o) { t.error("Unknown operator."); } } else if (a === "string" || a === number") { a = "literal"; o = symbol_table["(literal)"]; } else { t.error("Unexpected token."); } token = object(o); token.value = v; token.arity = a; return token; };


THE UNTOUCHABLES A film by Brian DePalma A film review by Steve Upstill Copyright 1987 Steve Upstill
Here now, a film review in the form of a quiz:
1) Have you ever been captivated by the imagery of Brian DePalma, but put off by his stylistic conceits?
2) Does it make you feel cheerful just seeing Sean Connery walk into a movie?
3) Do you suspect that Kevin Costner is the Sean Connery of his generation?
4) Do you have a weakness, any weakness at all, for the pulp esthetics of a good crime story with oh-so-good good guys and rotten bad guys?
5) Do you appreciate a script which NEVER makes you wince, and which consistently concocts novel, interesting approaches to pedestrian material and manages to take several surprising turns?
6) Do you like Robert DeNiro?

9) Can you tolerate realistic bloodshed in the service of terrific action?
10) Do you respond to a little food for thought subservient to action?
If you answered positively to the majority of these questions, have I got a movie for you. Not a film, mind you, a MOVIE. Where the story is brisk and important, where the killings are mean, where the scenery is from another world, where the characters are bigger than life, where the actors are stars. If you just got lost in thought thinking about the last time you saw something like that, then have I got a movie for you. The story: Al Capone is running Chicago. Elliot Ness comes in to stop him, forms the Untouchables, and gets his man. This is probably Brian DePalma's best movie. Not his most daring, perhaps, but the one in which he matures into a director who puts his talent at the service of the picture instead of his visual ego. He gets support in all departments ranging in quality from first-rate to brilliant: Kevin Costner finally gets the lead role he deserves, and performs to perfection in a difficult characterization which must humanize a man who in our cynical times we can only describe as a crusading supercop. Sean Connery, as a member of his team, inhabits his role completely as an aging beat cop who signs on with Ness. Robert DeNiro is once again perfect as the publicly genteel, privately brutal Capone. Ennio Morricone's score does it again, with just the right touch of bombast. Whoever was in charge of the production design also deserves a round of applause for a consistently evocative, detailed 30's. And the cinematographer captures it all beautifully.
Finally, David Mamet's script has to be singled out. It absolutely puts the run of Hollywood writing to shame, recalling the days when screenwriters were writers first and Hollywood deal-chasers second: His story is solid, his turns of plot surprising, his dialogue crisp and right, his characters walking perfectly that thin line between interesting complexity and mythic stature. Best of all, he manages to insert one of the most compelling subtexts in some time, underlining with three or four clever juxtapositions the presentation and willing, even eager, public acceptance of a face of witty gentility on a reality of horrid brutality. The public's eagerness to believe in Al Capone as a kind of public servant provides much of the underlying dramatic tension in Ness's efforts, but leaves the viewer with much to think about.
But that's all too serious. When you come right down to it, THE UNTOUCHABLES is terrific entertainment. The tension starts early, and reaches a feverish peak in a train station shootout that is DePalma's greatest set-piece, which is saying a lot. How successful is it? Put it this way: it contains a blatant steal from Eisenstein's Odessa Steps sequence in POTEMKIN, and DePalma GETS AWAY WITH IT!! In spades!
All in all, a piece of Hollywood magic that reminds you of what Hollywood is really capable of when it is of a mind to do it. A clear +3 on the Leeper scale.
Caveat: you should know that DePalma's affection for bloodletting is in evidence here, though in comparatively restrained measure. That is, it's nothing like that in SCARFACE. But if the sight of blood makes you ill, don't say I didn't warn you.
Steve Upstill
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


Tests to determine how form controls and their associated labels/legends are announced.
Tests to determine how other content can be associated with form controls, and how nested fieldsets are announced.
Tests to determine how "required", "aria-required" and other related options are announced.
The purpose these tests is to show the cascade order of how accessible names are applied in the accessibility tree for buttons and inputs. These examples should not be considered proper practice.
The purpose of these tests is to show how ARIA groupings and controls are presented. These examples should not be considered proper practice.
OSX Catalina - 10.15.7
Windows 10 Enterprise:
Assistive Technolgies


{% comment %}
You could render your form using a Django rendering shortcut such as `{{ form.as_p }}` but that will tend towards unsemantic code, and make it difficult to style. You can read more on Django form at:
https://docs.djangoproject.com/en/1.10/topics/forms/#form-rendering-options
{% endcomment %}


This shows how milliseconds are displayed when present.
You can check it by hovering over corresponding points and comparing the value labels.


Songs to learn and sign
Ok, so instead of presenting what music I like now, or my favorite releases from the previous years (you can see all of these back to 2001 over at fak3r.com/noise) I'm going to list what I believe to be the greatest recorded works ever released. Feel free to complain, but I hope you discover some new favorites.
pre 1969
- The Beatles "Rubber Soul"
- The Beatles "White Album"
- James Brown "Live at the Apollo (1963)"
- Ornette Coleman "The Shape of Jazz to Come"
- John Coltrane "Giant Steps"
- Miles Davis "Kind of Blue"
- MC5 "Kick Out the Jams"
- Charles Mingus "Mingus ah uhm"
- Sonny Rollins "Plus 4"
- Thelonious Monk "Monk's Music"
- Velvet Underground "The Velvet Underground & Nico"
1970s
- Buzzcocks "Another Music In A Different Kitchen"
- The Clash "London Calling"
- Devo "Freedom of Choice"
- The Grateful Dead "American Beauty"
- Iggy (Pop) & The Stooges "Raw Power"
- Led Zeppelin "II"
- Van Morrison "Moondance"
- Willie Nelson "Red Headed Stranger"
- Pink Floyd "Dark Side Of The Moon"
- Ramones "Ramones"
- Sam and Dave "The Best of Sam and Dave"
- Van Halen "Van Halen"
- Velvet Underground "Loaded"
- Townes Van Zandt "The Late Great Townes Van Zandt"
- The Who "Live at Leeds"
- The Who "Who's Next?"
1980s
- Cowboy Junkies "The Trinity Session"
- The Cure "Disintegration"
- Husker Du "New Day Rising"
- The Jesus & Mary Chain "Psychocandy"
- Pixies "Doolittle"
- The Replacements "Tim"
- The Smiths "The Queen Is Dead"
- The Smiths "Strangeways, Here We Come"
- Sonic Youth "Daydream Nation"
- The Stone Roses "The Stone Roses"
- They Might Be Giants "Lincoln"
- U2 "War"
- Violent Femmes "Violent Femmes"
- X "Los Angeles"
1990s
- Beastie Boys "Check Your Head"
- Beck "Odelay"
- Boards of Canada "Music Has the Right to Children"
- Crystal Method "Vegas"
- DJ Shadow "...Endtroducing"
- Fugazi "Repeater"
- Guided by Voices "Alien Lanes"
- Guided by Voices "Bee Thousand"
- Modest Mouse "The Moon and Antartica"
- Mogwai "Young Team"
- Neutral Milk Hotel "In An Airplane Over The Sea"
- PJ Harvey "Is This Desire?"
- Public Enemy "Fear of a Black Planet"
- Radiohead "OK Computer"
- Refused "The Shape of Punk to Come"
- Sleater-Kinney "Call The Doctor"
- Elliott Smith "Either/Or"
- Wilco "Yankee Hotel Foxtrot"
2000 to present
- Andrew Bird "Andrew Bird & the Mysterious Production of Eggs"
- Bloc Party "Silent Alarm"
- Broken Social Scene "You Forgot It in People"
- Danger Doom "The Mouse and the Mask
- Interpol "Antics"
- PJ Harvey "Stories From The City, Stories From The Sea"
- Radiohead "Hail to the Thief"
- The Strokes "Is This It?"
- The Wrens "The Meadowlands"


{% extends 'layout.html' %} {% block body %}
Using lorem ipsum to focus attention on graphic elements in a webpage design proposal In publishing and graphic design, lorem ipsum is a placeholder text commonly used to demonstrate the visual form of a document without relying on meaningful content (also called greeking). Replacing the actual content with placeholder text allows designers to design the form of the content before the content itself has been produced. The lorem ipsum text is typically a scrambled section of De finibus bonorum et malorum, a 1st-century BC Latin text by Cicero, with words altered, added, and removed to make it nonsensical, improper Latin. A variation of the ordinary lorem ipsum text has been used in typesetting since the 1960s or earlier, when it was popularized by advertisements for Letraset transfer sheets. It was introduced to the Information Age in the mid-1980s by Aldus Corporation, which employed it in graphics and word-processing templates for its desktop publishing program PageMaker.
{% endblock %}


We craft software that drives businesses
goals & delights
end users
We're a digital product design & engineering team, crafting products that are easy to use, highly performant, drives business goals and delight end users. Our products empower businesses, agencies and organizations to amplify the work they do through technology without worrying about details. We offer development and consulting services on the following technologies & other related tools: NodeJS, Go, PHP, React, Scala, Docker, Kubernetes.
Some quick example text to build on the card title and make up the bulk of the card's content.
ButtonSome quick example text to build on the card title and make up the bulk of the card's content.
ButtonSome quick example text to build on the card title and make up the bulk of the card's content.
Button


|
BitShares-Core
6.1.0
BitShares blockchain implementation and command-line interface software
|
abstract base class for accessing objects indexed in various ways. More...
#include <index.hpp>
Public Member Functions | |
| virtual | ~index ()=default |
| virtual uint8_t | object_space_id () const =0 |
| virtual uint8_t | object_type_id () const =0 |
| virtual object_id_type | get_next_id () const =0 |
| virtual void | use_next_id ()=0 |
| virtual void | set_next_id (object_id_type id)=0 |
| virtual const object & | load (const std::vector< char > &data)=0 |
| virtual const object & | insert (object &&obj)=0 |
| virtual const object & | create (const std::function< void(object &)> &constructor)=0 |
| virtual void | open (const fc::path &db)=0 |
| virtual void | save (const fc::path &db)=0 |
| virtual const object * | find (object_id_type id) const =0 |
| const object & | get (object_id_type id) const |
| virtual void | modify (const object &obj, const std::function< void(object &)> &)=0 |
| virtual void | remove (const object &obj)=0 |
| template<typename Object , typename Lambda > | |
| void | modify (const Object &obj, const Lambda &l) |
| virtual void | inspect_all_objects (std::function< void(const object &)> inspector) const =0 |
| virtual void | add_observer (const std::shared_ptr< index_observer > &)=0 |
| virtual void | object_from_variant (const fc::variant &var, object &obj, uint32_t max_depth) const =0 |
| virtual void | object_default (object &obj) const =0 |
abstract base class for accessing objects indexed in various ways.
All indexes assume that there exists an object ID space that will grow forever in a seqential manner. These IDs are used to identify the index, type, and instance of the object.
Items in an index can only be modified via a call to modify and all references to objects outside of that callback are const references.
Most implementations will probably be some form of boost::multi_index_container which means that they can covnert a reference to an object to an iterator. When at all possible save a pointer/reference to your objects rather than constantly looking them up by ID.
|
virtualdefault |
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >.
|
pure virtual |
Builds a new object and assigns it the next available ID and then initializes it with constructor and lastly inserts it into the index.
Implemented in graphene::db::primary_index< graphene::db::generic_index >, graphene::db::generic_index< ObjectType, MultiIndexType >, graphene::db::generic_index< T, boost::multi_index_container< T, indexed_by< ordered_unique< tag< by_id >, member< object, object_id_type, &object::id > > > > >, and graphene::db::simple_index< T >.
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >, graphene::db::generic_index< ObjectType, MultiIndexType >, graphene::db::generic_index< T, boost::multi_index_container< T, indexed_by< ordered_unique< tag< by_id >, member< object, object_id_type, &object::id > > > > >, and graphene::db::simple_index< T >.
|
inline |
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >.
Polymorphically insert by moving an object into the index. this should throw if the object is already in the database.
Implemented in graphene::db::primary_index< graphene::db::generic_index >, graphene::db::simple_index< T >, graphene::db::generic_index< ObjectType, MultiIndexType >, and graphene::db::generic_index< T, boost::multi_index_container< T, indexed_by< ordered_unique< tag< by_id >, member< object, object_id_type, &object::id > > > > >.
|
pure virtual |
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >.
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >, graphene::db::generic_index< ObjectType, MultiIndexType >, graphene::db::generic_index< T, boost::multi_index_container< T, indexed_by< ordered_unique< tag< by_id >, member< object, object_id_type, &object::id > > > > >, and graphene::db::simple_index< T >.
|
inline |
When forming your lambda to modify obj, it is natural to have Object& be the signature, but that is not compatible with the type erasue required by the virtual method. This method provides a helper to wrap the lambda in a form compatible with the virtual modify call.
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >.
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >.
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >.
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >.
|
pure virtual |
Opens the index loading objects from a file
Implemented in graphene::db::primary_index< graphene::db::generic_index >.
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >, graphene::db::generic_index< ObjectType, MultiIndexType >, graphene::db::generic_index< T, boost::multi_index_container< T, indexed_by< ordered_unique< tag< by_id >, member< object, object_id_type, &object::id > > > > >, and graphene::db::simple_index< T >.
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >.
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >.
|
pure virtual |
Implemented in graphene::db::primary_index< graphene::db::generic_index >.


Template Class Allocator¶
Defined in File allocator.hpp
Class Documentation¶
-
template<typename
PrimaryAllocator
, typenameArena
, typenameFallbackAllocator
, typenameLockingPolicy
>
classwrench
::
Allocator
¶ The Allocator type is a simple implementation which allows an allocator to be composed of other allocators, to create allocators with useful properties for different contexts.
The allocator will always try to allocate from the primary allocator, unless the primary allocation fails, in which case it will allocate from the fallback allocator. It is a good idea to always set the fallback allocator to the AlignedHeapAllocator, so that allocation will always fallback to the system allocator.
All allocation and free operations are locked using the locking policy provided. Since the default is to not lock, the allocations are not thread safe unless a locking policy is provided which does actually lock.
The
Allocator type is a simple implementation which allows an allocator to be composed of other allocators, to create allocators with useful properties for different contexts.- Template Parameters
PrimaryAllocator
: The type of the primary allocator.Arena
: The type of the arena for the allocator.FallbackAllocator
: The type of the fallback allocator.LockingPolicy
: The type of the locking policy.
The allocator will always try to allocate from the primary allocator, unless the primary allocation fails, in which case it will allocate from the fallback allocator.
All allocation and free operations are locked, using the locking policy provided. The default locking policy is to not lock.
- Template Parameters
PrimaryAllocator
: The type of the primary allocator.Arena
: The type of the arena for the allocator.FallbackAllocator
: The type of the fallback allocator.LockingPolicy
: The type of the locking policy.
Public Types
-
using
Guard
= std::lock_guard<LockingPolicy>¶ Defines the type of the lock guard.
Public Functions
-
template<typename ...
Args
>Allocator
(size_t size, Args&&... args)¶ Constructor which sets the
size
of the arena, if the arena requires a size, and forwards theargs
to the primary allocator.If the arena has a constant size, then it will be created with that size, and
size
will be ignored.- Parameters
size
: The size of the arena, in bytes.args
: The arguments fro the primary allocator.
- Template Parameters
Args
: The types of arguments for the primary allocator.
-
~Allocator
() noexcept = default¶ Default destructor composed allocators know how to clean themselves up.
-
Allocator
(Allocator &&other) noexcept = default¶ Move constructor, defaulted.
- Parameters
other
: The other allocator to move into this one.
-
auto operator= (Allocator &&other) noexcept -> Allocator &=default
Move assignment, defaulted.
- Parameters
other
: The other allocator to move into this one.
-
auto operator= (const Allocator &) -> Allocator &=delete
Copy assignment deleted, allocator can’t be copied.
-
auto alloc (size_t size, size_t alignment=alignof(std::max_align_t)) noexcept -> void *
Allocates
size
bytes of memory withalign
alignment.- Parameters
size
: The size of the memory to allocate.alignment
: The alignment of the allocation.
-
auto free (void *ptr) noexcept -> void
Frees the memory pointed to by ptr.
- Parameters
ptr
: The pointer to the memory to free.
-
auto free (void *ptr, size_t size) noexcept -> void
Frees the memory pointed to by \ptr, with a size of
size
.- Parameters
ptr
: The pointer to the memory to free.size
: The size of the memory to free.
-
auto reset () noexcept -> void
Resets the primary and fallback allocators.
-
template<typename T, typename... Args> auto create (Args &&... args) noexcept -> T *
Allocates and constructs an object of type T. If this is used, then destroy should be used to destruct and free the object, rather than free. If the fallback allocator fails, this will return a nullptr.
- Parameters
args
: The arguments for constructing the objects.
- Template Parameters
T
: The type of the object to allocate.Args
: The types of the arguments for constructing T.
-
template<typename T> auto recycle (T *ptr) noexcept -> void
Recycles the object pointed to by
ptr
, destructing it and then releasing the memory back to the allocator.- Parameters
ptr
: A pointer to the object to destroy.
- Template Parameters
T
: The type of the object.