-
attach(PipelineOwner owner)
→ void
-
-
detach()
→ void
-
Mark this node as detached. [...]
-
didChangeAppLifecycleState(AppLifecycleState state)
→ void
-
Called when the system puts the app in the background or returns
the app to the foreground. [...]
-
paint(PaintingContext context, Offset offset)
→ void
-
Paint this render object into the given context at the given offset. [...]
-
performResize()
→ void
-
-
adoptChild(RenderObject child)
→ void
-
Called by subclasses when they decide a render object is a child. [...]
inherited
-
applyPaintTransform(RenderObject child, Matrix4 transform)
→ void
-
Multiply the transform from the parent's coordinate system to this box's
coordinate system into the given transform. [...]
inherited
-
assembleSemanticsNode(SemanticsNode node, SemanticsConfiguration config, Iterable<SemanticsNode> children)
→ void
-
Assemble the
SemanticsNode
for this RenderObject
. [...]
inherited
-
clearSemantics()
→ void
-
Removes all semantics from this render object and its descendants. [...]
@mustCallSuper, inherited
-
computeDistanceToActualBaseline(TextBaseline baseline)
→ double
-
Returns the distance from the y-coordinate of the position of the box to
the y-coordinate of the first given baseline in the box's contents, if
any, or null otherwise. [...]
@protected, inherited
-
computeMaxIntrinsicHeight(double width)
→ double
-
Computes the value returned by getMaxIntrinsicHeight. Do not call this
function directly, instead, call getMaxIntrinsicHeight. [...]
@protected, inherited
-
computeMaxIntrinsicWidth(double height)
→ double
-
Computes the value returned by getMaxIntrinsicWidth. Do not call this
function directly, instead, call getMaxIntrinsicWidth. [...]
@protected, inherited
-
computeMinIntrinsicHeight(double width)
→ double
-
Computes the value returned by getMinIntrinsicHeight. Do not call this
function directly, instead, call getMinIntrinsicHeight. [...]
@protected, inherited
-
computeMinIntrinsicWidth(double height)
→ double
-
Computes the value returned by getMinIntrinsicWidth. Do not call this
function directly, instead, call getMinIntrinsicWidth. [...]
@protected, inherited
-
debugAdoptSize(Size value)
→ Size
-
Claims ownership of the given Size. [...]
inherited
-
debugAssertDoesMeetConstraints()
→ void
-
Verify that the object's constraints are being met. Override
this function in a subclass to verify that your state matches
the constraints object. This function is only called in checked
mode and only when needsLayout is false. If the constraints are
not met, it should assert or throw an exception.
inherited
-
debugDescribeChildren()
→ List<DiagnosticsNode>
-
inherited
-
debugFillProperties(DiagnosticPropertiesBuilder properties)
→ void
-
inherited
-
debugHandleEvent(PointerEvent event, HitTestEntry entry)
→ bool
-
Implements the
debugPaintPointersEnabled
debugging feature. [...]
inherited
-
debugPaint(PaintingContext context, Offset offset)
→ void
-
Override this method to paint debugging information.
inherited
-
debugPaintBaselines(PaintingContext context, Offset offset)
→ void
-
In debug mode, paints a line for each baseline. [...]
@protected, inherited
-
debugPaintPointers(PaintingContext context, Offset offset)
→ void
-
In debug mode, paints a rectangle if this render box has counted more
pointer downs than pointer up events. [...]
@protected, inherited
-
debugPaintSize(PaintingContext context, Offset offset)
→ void
-
In debug mode, paints a border around this render box. [...]
@protected, inherited
-
debugRegisterRepaintBoundaryPaint({bool includedParent: true, bool includedChild: false })
→ void
-
Called, in checked mode, if isRepaintBoundary is true, when either the
this render object or its parent attempt to paint. [...]
inherited
-
debugResetSize()
→ void
-
If a subclass has a "size" (the state controlled by
parentUsesSize
,
whatever it is in the subclass, e.g. the actual size
property of
RenderBox
), and the subclass verifies that in checked mode this "size"
property isn't used when debugCanParentUseSize isn't set, then that
subclass should override debugResetSize to reapply the current values of
debugCanParentUseSize to that state.
inherited
-
describeApproximatePaintClip(RenderObject child)
→ Rect
-
Returns a rect in this object's coordinate system that describes
the approximate bounding box of the clip rect that would be
applied to the given child during the paint phase, if any. [...]
inherited
-
describeSemanticsConfiguration(SemanticsConfiguration config)
→ void
-
Report the semantics of this node, for example for accessibility purposes. [...]
@protected, inherited
-
didChangeLocale(Locale locale)
→ void
-
Called when the system tells the app that the user's locale has
changed. For example, if the user changes the system language
settings. [...]
inherited
-
didChangeMetrics()
→ void
-
Called when the application's dimensions change. For example,
when a phone is rotated. [...]
inherited
-
didChangeTextScaleFactor()
→ void
-
Called when the platform's text scale factor changes. [...]
inherited
-
didHaveMemoryPressure()
→ void
-
Called when the system is running low on memory. [...]
inherited
-
didPopRoute()
→ Future<bool>
-
Called when the system tells the app to pop the current route.
For example, on Android, this is called when the user presses
the back button. [...]
inherited
-
didPushRoute(String route)
→ Future<bool>
-
Called when the host tells the app to push a new route onto the
navigator. [...]
inherited
-
dropChild(RenderObject child)
→ void
-
Called by subclasses when they decide a render object is no longer a child. [...]
inherited
-
getDistanceToActualBaseline(TextBaseline baseline)
→ double
-
Calls computeDistanceToActualBaseline and caches the result. [...]
@mustCallSuper, @protected, inherited
-
getDistanceToBaseline(TextBaseline baseline, { bool onlyReal: false })
→ double
-
Returns the distance from the y-coordinate of the position of the box to
the y-coordinate of the first given baseline in the box's contents. [...]
inherited
-
getMaxIntrinsicHeight(double width)
→ double
-
Returns the smallest height beyond which increasing the height never
decreases the preferred width. The preferred width is the value that
would be returned by getMinIntrinsicWidth for that height. [...]
@mustCallSuper, inherited
-
getMaxIntrinsicWidth(double height)
→ double
-
Returns the smallest width beyond which increasing the width never
decreases the preferred height. The preferred height is the value that
would be returned by getMinIntrinsicHeight for that width. [...]
@mustCallSuper, inherited
-
getMinIntrinsicHeight(double width)
→ double
-
Returns the minimum height that this box could be without failing to
correctly paint its contents within itself, without clipping. [...]
@mustCallSuper, inherited
-
getMinIntrinsicWidth(double height)
→ double
-
Returns the minimum width that this box could be without failing to
correctly paint its contents within itself, without clipping. [...]
@mustCallSuper, inherited
-
getTransformTo(RenderObject ancestor)
→ Matrix4
-
Applies the paint transform up the tree to
ancestor
. [...]
inherited
-
globalToLocal(Offset point, { RenderObject ancestor })
→ Offset
-
Convert the given point from the global coordinate system in logical pixels
to the local coordinate system for this box. [...]
inherited
-
handleEvent(PointerEvent event, HitTestEntry entry)
→ void
-
Override this method to handle pointer events that hit this render object. [...]
inherited
-
hitTest(HitTestResult result, { Offset position })
→ bool
-
Determines the set of render objects located at the given position. [...]
inherited
-
hitTestChildren(HitTestResult result, { Offset position })
→ bool
-
Override this method to check whether any children are located at the
given position. [...]
@protected, inherited
-
hitTestSelf(Offset position)
→ bool
-
Override this method if this render object can be hit even if its
children were not hit. [...]
@protected, inherited
-
invokeLayoutCallback<T extends Constraints>(LayoutCallback<T> callback)
→ void
-
Allows mutations to be made to this object's child list (and any
descendants) as well as to any other dirty nodes in the render tree owned
by the same
PipelineOwner
as this object. The callback
argument is
invoked synchronously, and the mutations are allowed only during that
callback's execution. [...]
@protected, inherited
-
layout(Constraints constraints, { bool parentUsesSize: false })
→ void
-
Compute the layout for this render object. [...]
inherited
-
localToGlobal(Offset point, { RenderObject ancestor })
→ Offset
-
Convert the given point from the local coordinate system for this box to
the global coordinate system in logical pixels. [...]
inherited
-
markNeedsCompositingBitsUpdate()
→ void
-
Mark the compositing state for this render object as dirty. [...]
inherited
-
markNeedsLayout()
→ void
-
Mark this render object's layout information as dirty, and either register
this object with its
PipelineOwner
, or defer to the parent, depending on
whether this object is a relayout boundary or not respectively. [...]
inherited
-
markNeedsLayoutForSizedByParentChange()
→ void
-
Mark this render object's layout information as dirty (like
markNeedsLayout), and additionally also handle any necessary work to
handle the case where sizedByParent has changed value. [...]
inherited
-
markNeedsPaint()
→ void
-
Mark this render object as having changed its visual appearance. [...]
inherited
-
markNeedsSemanticsUpdate()
→ void
-
Mark this node as needing an update to its semantics description. [...]
inherited
-
markParentNeedsLayout()
→ void
-
Mark this render object's layout information as dirty, and then defer to
the parent. [...]
@protected, inherited
-
noSuchMethod(Invocation invocation)
→ dynamic
-
Invoked when a non-existent method or property is accessed. [...]
inherited
-
performLayout()
→ void
-
Do the work of computing the layout for this render object. [...]
inherited
-
reassemble()
→ void
-
Cause the entire subtree rooted at the given
RenderObject
to be marked
dirty for layout, paint, etc, so that the effects of a hot reload can be
seen, or so that the effect of changing a global debug flag (such as
debugPaintSizeEnabled
) can be applied. [...]
inherited
-
redepthChild(AbstractNode child)
→ void
-
Adjust the depth of the given
child
to be greater than this node's own
depth. [...]
@protected, inherited
-
redepthChildren()
→ void
-
Adjust the depth of this node's children, if any. [...]
inherited
-
replaceRootLayer(OffsetLayer rootLayer)
→ void
-
Replace the layer. This is only valid for the root of a render
object subtree (whatever object scheduleInitialPaint was
called on). [...]
inherited
-
rotate({int oldAngle, int newAngle, Duration time })
→ void
-
Rotate this render object (not yet implemented).
inherited
-
scheduleInitialLayout()
→ void
-
Bootstrap the rendering pipeline by scheduling the very first layout. [...]
inherited
-
scheduleInitialPaint(ContainerLayer rootLayer)
→ void
-
Bootstrap the rendering pipeline by scheduling the very first paint. [...]
inherited
-
scheduleInitialSemantics()
→ void
-
Bootstrap the semantics reporting mechanism by marking this node
as needing a semantics update. [...]
inherited
-
setupParentData(RenderObject child)
→ void
-
Override to setup parent data correctly for your children. [...]
inherited
-
showOnScreen([RenderObject child ])
→ void
-
Attempt to make this or a descendant RenderObject visible on screen. [...]
inherited
-
toDiagnosticsNode({String name, DiagnosticsTreeStyle style })
→ DiagnosticsNode
-
inherited
-
toString({DiagnosticLevel minLevel })
→ String
-
inherited
-
toStringDeep({String prefixLineOne: '', String prefixOtherLines: '', DiagnosticLevel minLevel: DiagnosticLevel.debug })
→ String
-
Returns a description of the tree rooted at this node.
If the prefix argument is provided, then every line in the output
will be prefixed by that string.
inherited
-
toStringShallow({String joiner: '; ', DiagnosticLevel minLevel: DiagnosticLevel.debug })
→ String
-
Returns a one-line detailed description of the render object.
This description is often somewhat long. [...]
inherited
-
toStringShort()
→ String
-
Returns a human understandable name.
inherited
-
visitChildren(RenderObjectVisitor visitor)
→ void
-
Calls visitor for each immediate child of this render object. [...]
inherited
-
visitChildrenForSemantics(RenderObjectVisitor visitor)
→ void
-
Called when collecting the semantics of this node. [...]
inherited


Check-box-like button group can be easily done with pure Angular, no custom directives necessary. But we include demo here for completeness.
{{model | json}}


A helper for creating declarative interfaces in Rails controllers
Doug Alcorn<EMAIL_ADDRESS>Scaffolding
class EmployeesController < ApplicationController
before_filter :get_company
def index
@employees = @company.employees.all
end
private
def get_company
@company = Company.find(params[:company_id])
end
end
Instance Variables in Views
Hi, <%= @employee.name %>
In object-oriented programming, an object uses instance variables to store private information. If you want to access an object’s instance variables, those variables should only be accessible through instance methods. At least, this is the expectation.
Declarative Helper Methods
class EmployeesController < ApplicationController
helper_method :employees, :company
def index; end
protected
def company
@company ||= Company.find(params[:company_id])
end
def employees
@employees ||= company.employees.all
end
end
Trickier Example
def employee
@employee ||= if params[:id]
Employee.find params[:id]
else
Employee.new params[:employee]
end
end
Decent Exposure
class EmployeesController < ApplicationController
expose(:company)
expose(:employees) { company.employees.all }
expose(:employee)
end


--- title: Column offsets category: grid order: 3 description: Sometimes you need to put space between columns.


Nottingham Forest reveal stunning new image of £100m City Ground redevelopment
Project will see the Reds' home transformed into a 'world-class' stadium
by Sarah ClapsonNottingham Forest have revealed a fresh image of the proposed City Ground redevelopment as the club continue to progress with their plans.
Excitement is really building for the transformation of the Reds’ home into a world-class stadium which will see the Peter Taylor Stand rebuilt to cater for an increased capacity of about 10,000 fans.
The plans were unveiled earlier this year, and the club have provided a new glimpse of what to expect.
It is anticipated planning application for the project will be submitted before the end of this year, and should permission be granted, it is hoped work could get underway during the first half of 2020.
Tom Cartledge, lead architect and CEO of Benoy - the architecture firm behind the multi-million pound project - says a lot of work has been going on behind the scenes since the initial announcement in March.
“Personally it’s been incredibly frustrating because I’ve not been able to tell many people,” joked Cartledge, a Reds fan.
“I have been surrounded by Forest fans in the stand, and at home and in the pub! They’ve been desperate to know!
“On a project like this there’s a huge amount of things that you have to bring together.
“We’ve done a lot of consultation work, both within the club - working with the players and the management to understand what world-class facilities look like for them on matchdays, in terms of changing rooms and other facilities.
“But then also working with the corporate team here to really understand what the opportunities are for a diverse mix of premium seating.
“And then you’re also really looking at the stadium and the stand itself, in terms of its design and how it’s in keeping with the other stands and respecting the local community and the neighbourhood - as well as the challenges around integrating what is a large building into an urban area.
“There has been a huge amount of work and the work doesn’t stop now.”
The redevelopment of the City Ground will involve around £100m of investment and as well as additional seating in the Peter Taylor Stand, new state of the art dressing rooms, a museum, club shop, executive boxes and media suites will also be included.
Improvements will also be made to the other three sides of the ground, with the Bridgford Stand also extended.
Nottingham Forest latest
This is your round up of all things Forest; the one-stop shop that will keep you updated on the latest goings on at the City Ground and beyond.
Transfers, injuries, match-days and managers, we’ve got you covered.
We’ll be bringing the very latest on the Reds throughout the week and around the clock.
Make sure you keep yourself updated with our handy daily catch up...
Must reads...
- Championship is 'there for the taking'
- Clear message issued over reported striker target
- Tendayi Darikwa gives Forest injury boost
For all your latest NFFC news, opinion, analysis and transfer gossip, click here
You can follow our Reds reporter Sarah Clapson on Twitter, and her email address is<EMAIL_ADDRESS>Sign up for our free Forest WhatsApp service for latest news
Keep up to date with the latest Nottingham Forest news, features and exclusives from Nottinghamshire Live via our free WhatsApp service.
Text NEWS to<PHONE_NUMBER>2 and then add the number to your phone contacts book as ForestLive to receive daily updates and breaking news from our Reds reporter Sarah Clapson.
Your phone number won't be shared with any other members of the group. Click here for more information on the service.


Lets try it !
This page demonstrates creation of block indexes on the first fact table to improve query processing by clustering data along
multiple dimensions.
Operation
- Create table 'subscriber_rated_usage_mdc' enabled with Multi-Dimensional Clustering
- Populate data into the table. Data is clustered along multiple dimensions depending on the clustering columns specified.


--- layout: post title: 'Go ride a bike and make our job easier at the #westernu #lidar' date: '2011-10-18T14:00:00.000-04:00' author: Bob Sica tags: modified_time: '2011-12-21T12:48:50.410-05:00' blogger_id: tag:blogger.com,1999:blog-736339229338318027.post-7559902876115880508 blogger_orig_url: http://blog.purplecrowlidar.ca/2011/10/go-ride-bike-and-make-our-job-easier-at.html ---


Mulan (1998) 4 stars out of 4
To paraphrase a song title from an earlier Disney movie, Mulan is a whole new world.
The Mouse Factory's latest feature is a treasure, featuring magnificent animation, a strong story and finely drawn characters.

The story of Mulan takes place in ancient China at a time when the Huns have invaded the nation. The emperor has called for a conscription, one man from each family to join the army and defend the nation.
Mulan's crippled father is called, but Mulan sneaks off, steals his armor and takes his place.
Mulan is a saga of courage and self-discovery. Yet, despite the grim backdrop of war, it is a lively tale of self-reliance and brain-over-brawn that even the smallest child can appreciate and enjoy.
The movie utilizes a strong corps of Asian-American talent as the voices for the main characters, including the wonderful Ming-Na Wen (The Joy Luck Club) as Mulan, B.D. Wong as Shang, Mulan's commanding officer and later love interest, Pat Morita as the Emperor and the veteran Soon-Tek Oh as Mulan's proud, but loving father.
Also adding to the proceedings is Eddie Murphy as Mushu the dragon, sent by Mulan's ancestors to watch over and help the young woman.
His fast, wise-cracking, hip-talking Mushu may seem out of place, but it's a crowd pleasing performance, especially for the youngsters.
The movie features only a couple of songs, fewer than most previous Disney animated flicks, but Mulan's are winners. The music by Matthew Wilder and lyrics by David Zippel fit nicely into the plot.
The overall score by Jerry Goldsmith also is a plus.
Mulan is a treat, more powerful than Hercules, with more heart than The Hunchback of Notre Dame.
At about 85 minutes, Mulan moves rapidly, and will hold the attention of youngsters from beginning to the end.
Mulan will set a new standard by which future animated efforts by Disney and other studios will have to work hard to attain.
Also, it is hoped that the success of Mulan, and there is no doubt that it will prove to be a popular vehicle, will spur an interest for more movies with Oriential or Asian-American themes so as to provide more substantial roles for the talented performers who gave their voices for this production. It would be nice to see them on screen as well as hear them.
Bob Bloom is the film critic at the Journal and Courier in Lafayette, Ind. He can be reached by e-mail at<EMAIL_ADDRESS>or at<EMAIL_ADDRESS>cb
Carol Bloom of Bloom Ink Publishing Professionals 3312 Indian Rock Lane West Lafayette, IN 47906-1203<PHONE_NUMBER> fax<PHONE_NUMBER><EMAIL_ADDRESS>Committed to Lifelong Learning through Effective Communication
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


Nashville was founded by James Robertson, John Donelson, and a party of Wataugans in 1779, and was originally called Fort Nashborough, after the American Revolutionary War hero Francis Nash.
By 1860, when the first rumblings of secession began to be heard across the South, antebellum Nashville was a very prosperous city.
The city’s significance as a shipping port made it a desirable prize as a means of controlling important river and railroad transportation routes. In February 1862, Nashville became the first state capital to fall to Union troops.


Trainers
Neural nets
Neural net functions
Utilities
nnMakeUntilDoneGradientTrainer
UntilDoneGradientTrainer
works similarly to SimpleGradientTrainer
, except it splits the provided training set into a training and validation portion in proportion to ValidationSetFraction
argument. During training, the trainer checks periodically whether the overall error on the validation set has improved, and if it has not improved after a certain number of epochs, it aborts training and sets the final neural network weights to the value that produced the best result so far.
This approach is designed to lower chance of overfitting compared to SimpleGradientTrainer
, though as a tradeoff it reduces the total number of samples available for training.
Inputs/outputs
| Arguments | ||
|---|---|---|
Name |
string, not empty | Name of the trainer object to create. |
NumEpochs |
integer, >0 | Maximum number of backpropagation steps to perform during training. Each backpropagation step includes evaluating a batch of one or more training points. |
LearningRate |
number, >0 | Used to determine the impact of gradient calculated in each backpropagation step on the neural network's weights. |
Momentum |
number, ≥0 | Used to determine the impact of gradient calculated in previous backpropagation step on the neural network's weights. |
QuadraticRegularization |
number, ≥0 | Higher values force weights to stay closer to 0, hopefully preventing overfitting. |
BatchSize |
integer, >0 | Number of training samples to include in every epoch. |
ValidationSetFraction |
number, strictly between 0 and 1 | Portion of the training set to use as validation set to check whether training has improved performance of the neural network. |
MaxEpochsWithoutImprovement |
integer, >0 | Training will abort after there is no error improvement on validation set after this number of backpropagation steps. |
EpochsBetweenValidations |
number, >0 | Number of backpropagation steps to perform between checking for error improvement on validation set. |
Seed |
integer, ≥0 | Seed for random number generator. Training runs with the same seed and same input parameters should always produce identical results. |
| Returns |
|---|
| Name of the newly created trainer object. |
Details
Given a training sample with \(N\) elements, before starting a training run, UntilDoneGradientTrainer
selects ValidationSetFraction
\(\cdot N\) samples to serve as validation set (randomly, without replacement). These samples are removed from the training set and are not used for gradient calculations. After that, the trainer proceeds with backpropagation algorithm as described in nnMakeSimpleGradientTrainer()
, except every EpochsBetweenValidations
epochs it calculates the total cross-entropy error on the validation set. If the trainer does not observe improvement in error after MaxEpochsWithoutImprovement
epochs, it aborts the training run. If not, the trainer eventually stops after NumEpochs
epochs.
Regardless of how the trainer stopped, it selects the weights that have produced lowest error on the validation set so far as the final weights for the neural network.


Our Team
Chaitanya Rai
Developer
Tripti Bhatia
Presentator
Prajwal Mishra
Analyst
Saakshi Jaiswal
Presentator
Go back To Home Click
Here


MQuince
Menu
Give Us Your Feedback
Would you like to sign your feedback?
Anonymous
Signed
How would you like to make your feedback public?
Public (everyone can see it)
Private (only we can see your feedback)
Send


If you run this demo directly in chrome,you might need "--allow-file-access-from-files --disable-web-security"


Our Favorite Things:
Our Favorite Games:
Pokemon Go
Overwatch
Eldritch Horror
Our Favorite Food:
Shellfish
Roasted winter veggies
Candy
Booze
These are a few of our favorite things. In a non-bonding, non-committal, loosley ranked sort of way.


Vivek Adhikari, eagalessore
The kit comes with three pre-built pages to help you get started faster. You can change the text and images and you're good to go. More importantly, looking at them will give you a picture of what you can built with this powerful Bootstrap 4 ui kit.


Chrome
See the Chrome
component in Garden's @zendeskgarden/react-chrome
package for the latest updates.
The .c-chrome
component
classes are used to style Zendesk product chrome: navigation, header and
content layout.
Open full page Chrome in a separate window.
Remember to apply the proper set of
Garden Favicons to your
specific product pages. See the Garden React
chrome
package for enhanced keyboard and event behavior.
Basic Structure
The product chrome CSS classes describe the following canonical structure. Although exact implementations will vary, be sure to sequence the components as indicated so that tab order is consistent from one product to the next.
-

-

-

-
<svg class="
c-chrome__nav__item__icon
">
-

-
-

- etc.
-
-

(optional)-

-

-
-

- etc.
-
-

-

-
<button class="
c-chrome__body__header__item
">
-
<svg class="
c-chrome__body__header__item__icon
">
-

-
-
<button class="
c-chrome__body__header__item
">
- etc.
-

-

(optional) -

-
-

(optional) -

- etc.
-
-
Navigation
The .c-chrome__nav
element
is the home for the product logo and main navigation items. In addition,
products may include a floating action button (FAB) in the nav. The nav
may receive a .c-chrome__nav--expanded
modifier to show navigation item text. Otherwise, the text is clipped
from view but accessible for screenreaders.
.c-chrome__nav--expanded
class on the nav bars below.
.c-chrome__nav--dark
or
.c-chrome__nav--light
in conjunction
with an inline background-color override.
The accordion pattern seen in the final navigation example's subnav is accomplished using the following structure. See class modifiers below for controlling accordion expand/collapse.
-
<button class="
c-chrome__subnav__item c-chrome__subnav__item--header
">
-

-

- etc.
-
-
Header
The .c-chrome__body__header
element contains header menu items. The
.c-menu
components demonstrated below are packaged separately from the chrome
components. Menus must be positioned with respect to their header menu
items precisely as shown. The header may be displayed standalone
– with a product logo – or along with the side navigation shown above.
By default, the .c-chrome__body__header__item
elements contained in the header are designed to be focusable. However,
they may also be used as containers for other focusable elements, in
which case they provide consistent item spacing. See the modifier
classes below for more details.
.c-chrome__body__header--standalone
class on the headers below.
Footer
The .c-chrome__body__footer
element contains footer items – typically "Save" and "Cancel" action
buttons – within individual .c-chrome__body__footer__item
children used to provide consistent item spacing.
Modification
In addition to the navigation and header modifiers shown above, the following BEM classes are available to modify various components of the chrome.
.c-chrome--dark
– toggles "dark mode" styling (via settings menu)..c-chrome.is-rtl
– toggles RTL layout (via settings menu)..c-chrome--custom
– toggles accent overrides (via settings menu)..c-chrome__nav__item--brandmark
– combine with.c-chrome__nav__item--logo
to style a brandmark at the bottom of the nav (note that additional navigation items may appear beneath this item if the product design calls for it)..c-chrome__nav__item--logo
– style the product logo shown as the top item in the nav..c-chrome__nav__item.is-current
– indicate which item is current in the nav..c-chrome__nav__item__text--wrap
– use to wrap long text in the nav..c-chrome__subnav__item--header.is-expanded
– toggle to indicate accordion expansion..c-chrome__subnav__item__text--wrap
– combine with max-width on the.c-chrome__subnav
container to wrap long text..c-chrome__subnav__panel.is-hidden
– remove in conjunction with the associated.c-chrome__subnav__item--header
expansion to reveal the accordion panel. Note that in order to achieve the intended animation, amax-height
should be manually applied to the panel for the full height of the expanded container..c-chrome__body--footer
– set the body content height to allow space for a.c-chrome__body__footer
child element; otherwise, the footer will be pushed out of view..c-chrome__body__header__item--logo
– style the product logo shown as the first item in the header (only displayed in standalone)..c-chrome__body__header__item--max-x
– horizontally maximize a flex item in the header to take as much space as possible (i.e. breadcrumb container or an empty element separating starting items from ending items)..c-chrome__body__header__item--max-y
– vertically maximize the height for a header item (i.e. contains a search input)..c-chrome__body__header__item--round
– round the border radius for a header item (i.e. user icon)..c-chrome__body__header__item__text.is-clipped
– clip text (but leave accessible to screenreaders) for an icon-only header item.


sparknlp.annotator¶
Module containing all available Annotators of Spark NLP and their base classes.
Classes
ALBERT: A Lite Bert For Self-Supervised Learning Of Language Representations - Google Research, Toyota Technological Institute at Chicago |
|
AlbertForSequenceClassification can load Albert Models with sequence classification/regression head on top (a linear layer on top of the pooled output) e.g. |
|
AlbertForTokenClassification can load ALBERT Models with a token classification head on top (a linear layer on top of the hidden-states output) e.g. |
|
Token-level embeddings using BERT. |
|
BertForSequenceClassification can load Bert Models with sequence classification/regression head on top (a linear layer on top of the pooled output) e.g. |
|
BertForTokenClassification can load Bert Models with a token classification head on top (a linear layer on top of the hidden-states output) e.g. |
|
Sentence-level embeddings using BERT. |
|
Annotator to match exact phrases (by token) provided in a file against a Document. |
|
Instantiated model of the BigTextMatcher. |
|
This annotator utilizes WordEmbeddings, BertEmbeddings etc. |
|
Tokenizes and flattens extracted NER chunks. |
|
Instantiated model of the ChunkTokenizer. |
|
This annotator matches a pattern of part-of-speech tags in order to return meaningful phrases from document. |
|
Trains a ClassifierDL for generic Multi-class Text Classification. |
|
ClassifierDL for generic Multi-class Text Classification. |
|
Trains a deep-learning based Noisy Channel Model Spell Algorithm. |
|
Implements a deep-learning based Noisy Channel Model Spell Algorithm. |
|
Matches standard date formats into a provided format Reads from different forms of date and time expressions and converts them to a provided date format. |
|
Base class for DateMatcher Annotators |
|
Trains an unlabeled parser that finds a grammatical relations between two words in a sentence. |
|
Unlabeled parser that finds a grammatical relation between two words in a sentence. |
|
DistilBERT is a small, fast, cheap and light Transformer model trained by distilling BERT base. |
|
DistilBertForSequenceClassification can load DistilBERT Models with sequence classification/regression head on top (a linear layer on top of the pooled output) e.g. |
|
DistilBertForTokenClassification can load Bert Models with a token classification head on top (a linear layer on top of the hidden-states output) e.g. |
|
Trains a Word2Vec model that creates vector representations of words in a text corpus. |
|
Word2Vec model that creates vector representations of words in a text corpus. |
|
Annotator which normalizes raw text from tagged text, e.g. |
|
Word embeddings from ELMo (Embeddings from Language Models), a language model trained on the 1 Billion Word Benchmark. |
|
Fits an Annotator to match exact strings or regex patterns provided in a file against a Document and assigns them an named entity. |
|
Instantiated model of the EntityRulerApproach. |
|
GPT2: the OpenAI Text-To-Text Transformer |
|
Extracts a dependency graph between entities. |
|
Language Identification and Detection by using CNN and RNN architectures in TensorFlow. |
|
Class to find lemmas out of words with the objective of returning a base dictionary word. |
|
Instantiated Model of the Lemmatizer. |
|
Longformer is a transformer model for long documents. |
|
LongformerForSequenceClassification can load Longformer Models with sequence classification/regression head on top (a linear layer on top of the pooled output) e.g. |
|
LongformerForTokenClassification can load Longformer Models with a token classification head on top (a linear layer on top of the hidden-states output) e.g. |
|
MarianTransformer: Fast Neural Machine Translation |
|
Trains a MultiClassifierDL for Multi-label Text Classification. |
|
MultiClassifierDL for Multi-label Text Classification. |
|
Matches standard date formats into a provided format. |
|
A feature transformer that converts the input array of strings (annotatorType |
|
Base class for Ner*Approach Annotators |
|
Converts a IOB or IOB2 representation of NER to a user-friendly one, by associating the tokens of recognized entities and their label. |
|
Algorithm for training a Named Entity Recognition Model |
|
Extracts Named Entities based on a CRF Model. |
|
This Named Entity recognition annotator allows to train generic NER model based on Neural Networks. |
|
This Named Entity recognition annotator is a generic NER model based on Neural Networks. |
|
Overwrites entities of specified strings. |
|
Annotator that cleans out tokens. |
|
Instantiated Model of the Normalizer. |
|
Trains annotator, that retrieves tokens and makes corrections automatically if not found in an English dictionary. |
|
This annotator retrieves tokens and makes corrections automatically if not found in an English dictionary. |
|
Trains an averaged Perceptron model to tag words part-of-speech. |
|
Averaged Perceptron model to tag words part-of-speech. |
|
Tokenizes raw text recursively based on a handful of definable rules. |
|
Instantiated model of the RecursiveTokenizer. |
|
Uses a reference file to match a set of regular expressions and associate them with a provided identifier. |
|
Instantiated model of the RegexMatcher. |
|
A tokenizer that splits text by a regex pattern. |
|
Creates word embeddings using RoBERTa. |
|
RoBertaForSequenceClassification can load RoBERTa Models with sequence classification/regression head on top (a linear layer on top of the pooled output) e.g. |
|
RoBertaForTokenClassification can load RoBerta Models with a token classification head on top (a linear layer on top of the hidden-states output) e.g. |
|
Sentence-level embeddings using RoBERTa. |
|
Annotator that detects sentence boundaries using any provided approach. |
|
Trains an annotator that detects sentence boundaries using a deep learning approach. |
|
Annotator that detects sentence boundaries using a deep learning approach. |
|
Base class for SentenceDetector parameters |
|
Converts the results from WordEmbeddings, BertEmbeddings, or other word embeddings into sentence or document embeddings by either summing up or averaging all the word embeddings in a sentence or a document (depending on the inputCols). |
|
Trains a SentimentDL, an annotator for multi-class sentiment analysis. |
|
SentimentDL, an annotator for multi-class sentiment analysis. |
|
Trains a rule based sentiment detector, which calculates a score based on predefined keywords. |
|
Rule based sentiment detector, which calculates a score based on predefined keywords. |
|
Returns hard-stems out of words with the objective of retrieving the meaningful part of the word. |
|
This annotator takes a sequence of strings (e.g. |
|
Trains a Symmetric Delete spelling correction algorithm. |
|
Symmetric Delete spelling correction algorithm. |
|
T5: the Text-To-Text Transfer Transformer |
|
Annotator to match exact phrases (by token) provided in a file against a Document. |
|
Instantiated model of the TextMatcher. |
|
Converts |
|
Tokenizes raw text in document type columns into TokenizedSentence . |
|
Tokenizes raw text into word pieces, tokens. |
|
Labeled parser that finds a grammatical relation between two words in a sentence. |
|
Labeled parser that finds a grammatical relation between two words in a sentence. |
|
The Universal Sentence Encoder encodes text into high dimensional vectors that can be used for text classification, semantic similarity, clustering and other natural language tasks. |
|
Trains a sentiment analyser inspired by the algorithm by Vivek Narayanan. |
|
Sentiment analyser inspired by the algorithm by Vivek Narayanan. |
|
Trains a Word2Vec model that creates vector representations of words in a text corpus. |
|
Word2Vec model that creates vector representations of words in a text corpus. |
|
Word Embeddings lookup annotator that maps tokens to vectors. |
|
Word Embeddings lookup annotator that maps tokens to vectors |
|
Trains a WordSegmenter which tokenizes non-english or non-whitespace separated texts. |
|
WordSegmenter which tokenizes non-english or non-whitespace separated texts. |
|
The XLM-RoBERTa model was proposed in Unsupervised Cross-lingual Representation Learning at Scale by Alexis Conneau, Kartikay Khandelwal, Naman Goyal, Vishrav Chaudhary, Guillaume Wenzek, Francisco Guzman, Edouard Grave, Myle Ott, Luke Zettlemoyer and Veselin Stoyanov. |
|
XlmRoBertaForSequenceClassification can load XLM-RoBERTa Models with sequence classification/regression head on top (a linear layer on top of the pooled output) e.g. |
|
XlmRoBertaForTokenClassification can load XLM-RoBERTa Models with a token classification head on top (a linear layer on top of the hidden-states output) e.g. |
|
Sentence-level embeddings using XLM-RoBERTa. |
|
XlnetEmbeddings (XLNet): Generalized Autoregressive Pretraining for Language Understanding |
|
XlnetForSequenceClassification can load XLNet Models with sequence classification/regression head on top (a linear layer on top of the pooled output) e.g. |
|
XlnetForTokenClassification can load XLNet Models with a token classification head on top (a linear layer on top of the hidden-states output) e.g. |
|
Yake is an Unsupervised, Corpus-Independent, Domain and Language-Independent and Single-Document keyword extraction algorithm. |


Select your move:
0
You won the entire game! Congrats! Now, please press the "New Game" button to play again!
You lost the entire game! Now, please press the "New Game" button to play again!


|
real_time_tools
|
Tools for console message display. More...
#include <boost/filesystem.hpp>
Go to the source code of this file.
Functions | |
| std::string | real_time_tools::get_log_dir (std::string app_name) |
| Get the logging directory based on a specific application. More... | |
| bool | real_time_tools::create_directory (std::string path) |
| Create a directory. More... | |
| std::string | real_time_tools::get_home_dir () |
| Get the home directory path. More... | |
Tools for console message display.
| bool real_time_tools::create_directory | ( | std::string | path | ) |
Create a directory.
| path | is the path to be created |
| std::string real_time_tools::get_home_dir | ( | ) |
Get the home directory path.
| std::string real_time_tools::get_log_dir | ( | std::string | app_name | ) |
Get the logging directory based on a specific application.
It creates a direction in $HOME/app_name/YEAR_MONTH_DAY_HOUR_SECOND/ and return the absolute path of this. It allows the user to dump data in different folders everytime the user launch the application.
| app_name | is the application name |


MountainmathHelpers is a collection of helper functions that are frequently used at MountainMath. This package can be used to access these functions, be it for reproducing and running code written by MountianMath or because they happen to be useful for whatever code others are writing.
You can install the development version from GitHub with:
remotes::install_github("mountainMath/mountainmathHelpers")
It can be cumbersome to add nice background layers in ggplot maps. The rmapzen
package provides convenient access to former Mapzen vector tiles, now hosted via NextZen. This package adds several geom_xxx
functions to autmoatically fetch relevant vector tile data and add them to a map.
Here is an example how to add water and road vector layers.
library(mountainmathHelpers)
library(cancensus)
library(ggplot2)
data <- get_census("CA16",regions=list(CSD="5915022"),level="CT",geo_format="sf",
vectors=c("lico"="v_CA16_2570"))
ggplot(data) +
geom_sf(aes(fill=lico/100),size=0.1) +
scale_fill_viridis_c(labels=scales::percent) +
geom_water() +
geom_roads() +
coord_bbox(sf::st_bbox(data)) +
labs(title="Share of people in low income (LICO-AT)",fill=NULL,
caption="StatCan Census 2016")


\over
is a TeX primitive and its use is discouraged. Use the LaTeX
\frac
instead. The usage of
\over
will often result in unwanted behaviour, especially when the exact workings are not known.


{% extends 'apidoc.html' %} {% block title %}Tile5 API Documentation{% endblock %} {% block api %}
Time utilities for T5, will probably be moved out to it's own library as it really doesn't fit here...
This function is used to return a new duration that is the sum of the duration values passed to the function.
This function is used to format the specified duration as a string value
Add formatting options and i18n support
{% endblock %}


Getting Started: Building and Installing Polly
Automatic
There is a script available to automatically checkout, update, build, and test Polly. This script contains all the commands that are subsequently described on this webpage. The automatic installation consists of four simple steps:mkdir polly && cd polly wget http://polly.llvm.org/polly.sh chmod +x polly.sh ./polly.sh
Manual
Get the code
The Polly source code is available in the LLVM SVN repository as well as through an official git mirror. It is added to the tools directory of the llvm sources. Polly and LLVM need to be checked out at the same time. Checkouts from different dates may not work!Set the directory layout:
export BASE=`pwd` export LLVM_SRC=${BASE}/llvm export POLLY_SRC=${LLVM_SRC}/tools/polly # Also build the matching clang-version (optional) export CLANG_SRC=${LLVM_SRC}/tools/clang
SVN
svn checkout http://llvm.org/svn/llvm-project/llvm/trunk ${LLVM_SRC} svn checkout http://llvm.org/svn/llvm-project/polly/trunk ${POLLY_SRC} # Also build the matching clang-version (optional) svn checkout http://llvm.org/svn/llvm-project/cfe/trunk ${CLANG_SRC}
GIT
git clone http://llvm.org/git/llvm.git ${LLVM_SRC} git clone http://llvm.org/git/polly.git ${POLLY_SRC} # Also build the matching clang-version (optional) git clone http://llvm.org/git/clang.git ${CLANG_SRC}
Prerequisites
- libgmp
- isl
libgmp
Install libgmp (library + developer package) through the package management system of your operating system.isl
Polly is tested with a fixed version of isl. To obtain the source code of isl use checkout_isl.sh as available in ${POLLY_SRC}/utils/checkout_isl.sh.Set the directory layout:
export ISL_SRC=${BASE}/isl_src export ISL_INSTALL=${BASE}/isl_install
First installation
${POLLY_SRC}/utils/checkout_isl.sh ${ISL_SRC} cd ${ISL_SRC} ./configure --prefix=${ISL_INSTALL} make make install cd ${BASE}
Update the installation
Updating isl may become necessary, if Polly uses a feature only available in a recent version of isl.${POLLY_SRC}/utils/checkout_isl.sh ${ISL_SRC} cd ${ISL_SRC} make make install cd ${BASE}
Build Polly
To build Polly you can either use the autoconf or the cmake build system. At the moment only the autoconf build system allows to run the llvm test-suite and only the cmake build system allows to run 'make check-polly'.Set the directory layout:
export LLVM_BUILD=${BASE}/llvm_build mkdir ${LLVM_BUILD} cd ${LLVM_BUILD}
CMake
cmake -DCMAKE_PREFIX_PATH=${ISL_INSTALL} ${LLVM_SRC} make
Autoconf
${LLVM_SRC}/configure --with-isl=${ISL_INSTALL} make
Test Polly
To check if Polly works correctly you can run make check-polly for the cmake build or make check-polly -C tools/polly/test/ for the autoconf build.
If you get something like "... libisl.so.9: cannot open shared object file ..", it is because you installed isl to a non-standard path, and libisl could not be found. To solve this issue, you need to append the path of parent directory of libisl, i.e. ${ISL_INSTALL}/lib, to LD_LIBRARY_PATH by:
export LD_LIBRARY_PATH=${ISL_INSTALL}/lib:$LD_LIBRARY_PATH
Also try the above command if you get errors such as:
undefined symbol: isl_ctx_get_max_operations
If you get an error in one of the python files, your system probably uses python3
as default python interpreter. This is the case, for instance, under Arch Linux.
To solve this issue, run cmake
again, but with the added argument:
-DPYTHON_EXECUTABLE=/usr/bin/python2
(replace /usr/bin/python2
with the location of the python2 interpreter under your system).
cmake -DCMAKE_PREFIX_PATH=${ISL_INSTALL} -DPYTHON_EXECUTABLE=/usr/bin/python2 ${LLVM_SRC}
Optional Features
Pocc [Supported until LLVM 3.4.2]
Polly can use
PoCC as an external optimizer. PoCC is a research project that provides
an integrated version of Pluto, an
advanced data-locality and tileability optimizer. Polly includes internally
already a similar optimizer, such that in general PoCC is not needed. It is
only recommended for people who want to compare against a different
optimizer.
To use it install PoCC 1.0-rc3.1 (the one with Polly support) and add it to your PATH.
wget http://www.cse.ohio-state.edu/~pouchet/software/pocc/download/pocc-1.0-rc3.1-full.tar.gz tar xzf pocc-1.0-rc3.1-full.tar.gz cd pocc-1.0-rc3.1 ./install.sh export PATH=$PATH:`pwd`/binYou also need to install scoplib-0.2.0 and provide its location to Polly's cmake or configure call.
wget http://www.cse.ohio-state.edu/~pouchet/software/pocc/download/modules/scoplib-0.2.0.tar.gz tar xzf scoplib-0.2.0.tar.gz cd scoplib-0.2.0 ./configure --enable-mp-version --prefix=/path/to/scoplib/installation make && make install


In this tutorial we'll show you how to create the simplest form of a Nova dashboard with a single static KPI widget.
DashboardComponent
WidgetTypesService
WidgetTypesService
and merge it with the widget's initial configuration.
GridsterConfig
which holds the gridster configuration used by the dashboard to arrange and size the widgets.
IDashboard
which holds
the widget definitions and positions.
<nui-dashboard>
instance and pass the dashboard definition and gridster configuration to the
dashboard
and gridsterConfig
inputs respectively.
In the example below, we're using a static configuration and data for the KPI widget. Normally, the configuration would come from a database or from the widget configurator output. We'll cover configurator usage in the Widget Editing and Cloning tutorials.
angular-gridster2
,
also known simply as Gridster, is a package used by Nova Dashboards that simplifies the process of
creating and maintaining intuitive, draggable grid layouts of DOM elements. In the case of Nova
Dashboards, these elements take the form of widgets which can span one or more rows and columns. In
addition to draggability, Nova Dashboards' use of Gridster allows users to dynamically add or remove
widgets from the the dashboard grid.
Nova Dashboards exposes the entire gridster configuration API so you can modify any setting that Gridster supports. Check out their demo for more configuration information.


{% extends "base.html" %} {% block region %}{% endblock %} {% block title %}Account Activation{% endblock %} {% block content %} {% if account %}
Your account has been successfully activated.
You may now log in to your account.
{% else %}We are unable to activate your account at this time. It is possible that the activation period for your account has expired. Please register your account again, or contact the site administrator for help resolving this issue.
{% endif %} {% endblock %}


What rolling metric charts are available:- Rolling beta (6 months lookback)- Rolling sharpe ratio (6 months lookback)


The virtual reality, multi-desktop companion.
Pull together all the workspaces and desktops you own and put them together into one virtual reality environment. Easily switch between your windows and desktops and see your workspaces in ways you could have never imagined before! Desky is useful for...
This is how we look after 24 hours...


The generic register groups storage+index into a uvm_reg comptible register
Arguments:
STORAGE - the storage element type (default=uvm_reg). for this implementation the type STORAGE needs to implement the do_predict (API)
INDEX - the index type (default=int unsigned)
Arguments:
index - defines the actual type of the index
Storage API
Arguments:
STORAGE - type of a storage element
INDEX - type of index
(optional) custom implementation: a frontdoor for the GenericIndirectRegister this translates a direct uvmreg access to an indexed register into an indirect register utilizing the index and data registers
See Also:
uvm_reg_frontdoor
Custom implementation storage is an "uvm_reg" array indexed by a single "int unsigned" this indexable storage supports only single index selection
Custom implementation using a uvm_reg_field as index provider providing an 'int unsigned' index


National Research Council Graduate School Rankings
Data from
The Chronicle of Higher Education
. Formatted by Tyler Kontra.
Select a field of study to begin.
Select a field:
Rank
Institution (Program)
S-Rank High
S-Rank Low
Research High
Research Low
Students High
Students Low
Diversity High
Diversity Low
R-Rank High
R-Rank Low
Mean-High
Mean-Low
Mean-Rank


|
Houzi Game Engine
|
Defines a channel mapping for a texture. More...
#include <texture_channel_mapping.hpp>
Public Member Functions | |
| texture_channel_mapping (texture_channel r, texture_channel g, texture_channel b, texture_channel a) noexcept | |
| Creates a texture_channel_mapping with the given mappings for the four channels. More... | |
| texture_channel | get_r () const noexcept |
| Gets the channel mapped onto the red channel. More... | |
| texture_channel | get_g () const noexcept |
| Gets the channel mapped onto the green channel. More... | |
| texture_channel | get_b () const noexcept |
| Gets the channel mapped onto the blue channel. More... | |
| texture_channel | get_a () const noexcept |
| Gets the channel mapped onto the alpha channel. More... | |
| void | set_r (texture_channel channel) noexcept |
| Sets the channel mapped onto the red channel. More... | |
| void | set_g (texture_channel channel) noexcept |
| Sets the channel mapped onto the green channel. More... | |
| void | set_b (texture_channel channel) noexcept |
| Sets the channel mapped onto the blue channel. More... | |
| void | set_a (texture_channel channel) noexcept |
| Sets the channel mapped onto the alpha channel. More... | |
Static Public Attributes | |
| static const texture_channel_mapping | standard |
| Default mapping (red to red, green to green, blue to blue, alpha to alpha). | |
| static const texture_channel_mapping | luminosity |
| Luminosity mapping (red to red, red to green, red to blue, one to alpha). | |
| static const texture_channel_mapping | alpha |
| Alpha mapping (one to red, one to green, one to blue, red to alpha). | |
Defines a channel mapping for a texture.
A channel mapping allows to efficiently swap texture channel or to replace them with constant zero or one channels when the texture is passed to a shader.
|
noexcept |
Creates a texture_channel_mapping with the given mappings for the four channels.
| r | the channel mapped onto the red channel. |
| g | the channel mapped onto the green channel. |
| b | the channel mapped onto the blue channel. |
| a | the channel mapped onto the alpha channel. |
|
noexcept |
Gets the channel mapped onto the alpha channel.
|
noexcept |
Gets the channel mapped onto the blue channel.
|
noexcept |
Gets the channel mapped onto the green channel.
|
noexcept |
Gets the channel mapped onto the red channel.
|
noexcept |
Sets the channel mapped onto the alpha channel.
| channel | the channel mapped onto the alpha channel. |
|
noexcept |
Sets the channel mapped onto the blue channel.
| channel | the channel mapped onto the blue channel. |
|
noexcept |
Sets the channel mapped onto the green channel.
| channel | the channel mapped onto the green channel. |
|
noexcept |
Sets the channel mapped onto the red channel.
| channel | the channel mapped onto the red channel. |


By default, a dropdown menu is automatically positioned 100% from the top and along the left side of its parent. Add .dropdown-menu-right
to a .dropdown-menu
to right align the dropdown menu.
<span class="dropdown-menu dropdown-menu-right" role="menu" aria-labelledby="dLabel"> … </span>


{{define "upload"}}{{template "header"}} {{template "nav" .}}
This sadly doesn't work with the stock Android browser on most devices. Use Chrome/Firefox or some other browser for now.


provider-object - A specification for a provider-native object abstraction
#include <openssl/core_object.h>
#include <openssl/core_names.h>
The provider-native object abstraction is a set of OSSL_PARAM(3) keys and values that can be used to pass provider-native objects to OpenSSL library code or between different provider operation implementations with the help of OpenSSL library code.
The intention is that certain provider-native operations can pass any sort of object that belong with other operations, or with OpenSSL library code.
An object may be passed in the following manners:
By value
This means that the object data is passed as an octet string or an UTF8 string, which can be handled in diverse ways by other provided implementations. The encoding of the object depends on the context it's used in; for example, OSSL_DECODER(3) allows multiple encodings, depending on existing decoders. If central OpenSSL library functionality is to handle the data directly, it must be encoded in DER for all object types except for OSSL_OBJECT_NAME (see "Parameter reference" below), where it's assumed to a plain UTF8 string.
By reference
This means that the object data isn't passed directly, an object reference is passed instead. It's an octet string that only the correct provider understands correctly.
Objects by value can be used by anything that handles DER encoded objects.
Objects by reference need a higher level of cooperation from the implementation where the object originated (let's call it X) and its target implementation (let's call it Y):
An object loading function in the target implementation
The target implementation (Y) may have a function that can take an object reference. This can only be used if the target implementation is from the same provider as the one originating the object abstraction in question (X).
The exact target implementation to use is determined from the object type and possibly the object data type. For example, when the OpenSSL library receives an object abstraction with the object type OSSL_OBJECT_PKEY, it will fetch a provider-keymgmt(7) using the object data type as its key type (the second argument in EVP_KEYMGMT_fetch(3)).
An object exporter in the originating implementation
The originating implementation (X) may have an exporter function. This exporter function can be used to export the object in OSSL_PARAM(3) form, that can then be imported by the target implementation's imported function.
This can be used when it's not possible to fetch the target implementation (Y) from the same provider.
A provider-native object abstraction is an OSSL_PARAM(3) with a selection of the following parameters:
The object data passed by value.
The object data passed by reference.
The object type, a number that may have any of the following values (all defined in <openssl/core_object.h>):
The object data may only be passed by value, and should be a UTF8 string.
This is useful for provider-storemgmt(7) when a URI load results in new URIs.
The object data is suitable as provider-native EVP_PKEY key data. The object data may be passed by value or passed by reference.
The object data is suitable as X509 data. The object data for this object type can only be passed by value, and should be an octet string.
Since there's no provider-native X.509 object, OpenSSL libraries that receive this object abstraction are expected to convert the data to a X509 object with d2i_X509().
The object data is suitable as X509_CRL data. The object data can only be passed by value, and should be an octet string.
Since there's no provider-native X.509 CRL object, OpenSSL libraries that receive this object abstraction are expected to convert the data to a X509_CRL object with d2i_X509_CRL().
The specific type of the object content. Legitimate values depend on the object type; if it is OSSL_OBJECT_PKEY, the data type is expected to be a key type suitable for fetching a provider-keymgmt(7) that can handle the data.
The outermost structure of the object content. Legitimate values depend on the object type.
A human readable text that describes extra details on the object.
When a provider-native object abstraction is used, it must contain object data in at least one form (object data passed by value, i.e. the "data" item, or object data passed by reference, i.e. the "reference" item). Both may be present at once, in which case the OpenSSL library code that receives this will use the most optimal variant.
For objects with the object type OSSL_OBJECT_NAME, that object type must be given.
The concept of providers and everything surrounding them was introduced in OpenSSL 3.0.
Copyright 2020-2022 The OpenSSL Project Authors. All Rights Reserved.
Licensed under the Apache License 2.0 (the "License"). You may not use this file except in compliance with the License. You can obtain a copy in the file LICENSE in the source distribution or at https://www.openssl.org/source/license.html.


|
Clause
1.0
Chatopera Language Understanding Service.
|
#include <array_map.h>
Public 类型 | |
| using | char_type = typename ht::char_type |
| using | mapped_type = T |
| using | key_size_type = typename ht::key_size_type |
| using | index_size_type = typename ht::index_size_type |
| using | size_type = typename ht::size_type |
| using | hasher = typename ht::hasher |
| using | key_equal = typename ht::key_equal |
| using | iterator = typename ht::iterator |
| using | const_iterator = typename ht::const_iterator |
Public 成员函数 | |
| array_map (size_type bucket_count, const Hash &hash=Hash()) | |
| template<class InputIt , typename std::enable_if< is_iterator< InputIt >::value >::type * = nullptr> | |
| array_map (InputIt first, InputIt last, size_type bucket_count=ht::DEFAULT_INIT_BUCKET_COUNT, const Hash &hash=Hash()) | |
| array_map (std::initializer_list< std::pair< const CharT *, T >> init, size_type bucket_count=ht::DEFAULT_INIT_BUCKET_COUNT, const Hash &hash=Hash()) | |
| array_map & | operator= (std::initializer_list< std::pair< const CharT *, T >> ilist) |
| iterator | begin () noexcept |
| const_iterator | begin () const noexcept |
| const_iterator | cbegin () const noexcept |
| iterator | end () noexcept |
| const_iterator | end () const noexcept |
| const_iterator | cend () const noexcept |
| bool | empty () const noexcept |
| size_type | size () const noexcept |
| size_type | max_size () const noexcept |
| size_type | max_key_size () const noexcept |
| void | shrink_to_fit () |
| void | clear () noexcept |
| std::pair< iterator, bool > | insert (const CharT *key, const T &value) |
| std::pair< iterator, bool > | insert (const std::basic_string< CharT > &key, const T &value) |
| std::pair< iterator, bool > | insert_ks (const CharT *key, size_type key_size, const T &value) |
| std::pair< iterator, bool > | insert (const CharT *key, T &&value) |
| std::pair< iterator, bool > | insert (const std::basic_string< CharT > &key, T &&value) |
| std::pair< iterator, bool > | insert_ks (const CharT *key, size_type key_size, T &&value) |
| template<class InputIt , typename std::enable_if< is_iterator< InputIt >::value >::type * = nullptr> | |
| void | insert (InputIt first, InputIt last) |
| void | insert (std::initializer_list< std::pair< const CharT *, T >> ilist) |
| template<class M > | |
| std::pair< iterator, bool > | insert_or_assign (const CharT *key, M &&obj) |
| template<class M > | |
| std::pair< iterator, bool > | insert_or_assign (const std::basic_string< CharT > &key, M &&obj) |
| template<class M > | |
| std::pair< iterator, bool > | insert_or_assign_ks (const CharT *key, size_type key_size, M &&obj) |
| template<class... Args> | |
| std::pair< iterator, bool > | emplace (const CharT *key, Args &&... args) |
| template<class... Args> | |
| std::pair< iterator, bool > | emplace (const std::basic_string< CharT > &key, Args &&... args) |
| template<class... Args> | |
| std::pair< iterator, bool > | emplace_ks (const CharT *key, size_type key_size, Args &&... args) |
| iterator | erase (const_iterator pos) |
| iterator | erase (const_iterator first, const_iterator last) |
| size_type | erase (const CharT *key) |
| size_type | erase (const std::basic_string< CharT > &key) |
| size_type | erase_ks (const CharT *key, size_type key_size) |
| size_type | erase (const CharT *key, std::size_t precalculated_hash) |
| size_type | erase (const std::basic_string< CharT > &key, std::size_t precalculated_hash) |
| size_type | erase_ks (const CharT *key, size_type key_size, std::size_t precalculated_hash) |
| void | swap (array_map &other) |
| T & | at (const CharT *key) |
| const T & | at (const CharT *key) const |
| T & | at (const std::basic_string< CharT > &key) |
| const T & | at (const std::basic_string< CharT > &key) const |
| T & | at_ks (const CharT *key, size_type key_size) |
| const T & | at_ks (const CharT *key, size_type key_size) const |
| T & | at (const CharT *key, std::size_t precalculated_hash) |
| const T & | at (const CharT *key, std::size_t precalculated_hash) const |
| T & | at (const std::basic_string< CharT > &key, std::size_t precalculated_hash) |
| const T & | at (const std::basic_string< CharT > &key, std::size_t precalculated_hash) const |
| T & | at_ks (const CharT *key, size_type key_size, std::size_t precalculated_hash) |
| const T & | at_ks (const CharT *key, size_type key_size, std::size_t precalculated_hash) const |
| T & | operator[] (const CharT *key) |
| T & | operator[] (const std::basic_string< CharT > &key) |
| size_type | count (const CharT *key) const |
| size_type | count (const std::basic_string< CharT > &key) const |
| size_type | count_ks (const CharT *key, size_type key_size) const |
| size_type | count (const CharT *key, std::size_t precalculated_hash) const |
| size_type | count (const std::basic_string< CharT > &key, std::size_t precalculated_hash) const |
| size_type | count_ks (const CharT *key, size_type key_size, std::size_t precalculated_hash) const |
| iterator | find (const CharT *key) |
| const_iterator | find (const CharT *key) const |
| iterator | find (const std::basic_string< CharT > &key) |
| const_iterator | find (const std::basic_string< CharT > &key) const |
| iterator | find_ks (const CharT *key, size_type key_size) |
| const_iterator | find_ks (const CharT *key, size_type key_size) const |
| iterator | find (const CharT *key, std::size_t precalculated_hash) |
| const_iterator | find (const CharT *key, std::size_t precalculated_hash) const |
| iterator | find (const std::basic_string< CharT > &key, std::size_t precalculated_hash) |
| const_iterator | find (const std::basic_string< CharT > &key, std::size_t precalculated_hash) const |
| iterator | find_ks (const CharT *key, size_type key_size, std::size_t precalculated_hash) |
| const_iterator | find_ks (const CharT *key, size_type key_size, std::size_t precalculated_hash) const |
| std::pair< iterator, iterator > | equal_range (const CharT *key) |
| std::pair< const_iterator, const_iterator > | equal_range (const CharT *key) const |
| std::pair< iterator, iterator > | equal_range (const std::basic_string< CharT > &key) |
| std::pair< const_iterator, const_iterator > | equal_range (const std::basic_string< CharT > &key) const |
| std::pair< iterator, iterator > | equal_range_ks (const CharT *key, size_type key_size) |
| std::pair< const_iterator, const_iterator > | equal_range_ks (const CharT *key, size_type key_size) const |
| std::pair< iterator, iterator > | equal_range (const CharT *key, std::size_t precalculated_hash) |
| std::pair< const_iterator, const_iterator > | equal_range (const CharT *key, std::size_t precalculated_hash) const |
| std::pair< iterator, iterator > | equal_range (const std::basic_string< CharT > &key, std::size_t precalculated_hash) |
| std::pair< const_iterator, const_iterator > | equal_range (const std::basic_string< CharT > &key, std::size_t precalculated_hash) const |
| std::pair< iterator, iterator > | equal_range_ks (const CharT *key, size_type key_size, std::size_t precalculated_hash) |
| std::pair< const_iterator, const_iterator > | equal_range_ks (const CharT *key, size_type key_size, std::size_t precalculated_hash) const |
| size_type | bucket_count () const |
| size_type | max_bucket_count () const |
| float | load_factor () const |
| float | max_load_factor () const |
| void | max_load_factor (float ml) |
| void | rehash (size_type count) |
| void | reserve (size_type count) |
| hasher | hash_function () const |
| key_equal | key_eq () const |
| iterator | mutable_iterator (const_iterator it) noexcept |
| template<class Serializer > | |
| void | serialize (Serializer &serializer) const |
静态 Public 成员函数 | |
| template<class Deserializer > | |
| static array_map | deserialize (Deserializer &deserializer, bool hash_compatible=false) |
静态 Public 属性 | |
| static const size_type | MAX_KEY_SIZE = ht::MAX_KEY_SIZE |
友元 | |
| bool | operator== (const array_map &lhs, const array_map &rhs) |
| bool | operator!= (const array_map &lhs, const array_map &rhs) |
| void | swap (array_map &lhs, array_map &rhs) |
Implementation of a cache-conscious string hash map.
The map stores the strings as const CharT*
. If StoreNullTerminator
is true, the strings are stored with the a null-terminator (the key()
method of the iterators will return a pointer to this null-terminated string). Otherwise the null character is not stored (which allow an economy of 1 byte per string).
The value T
must be either nothrow move-constructible, copy-constuctible or both.
The size of a key string is limited to std::numeric_limits<KeySizeT>::max() - 1
. That is 65 535 characters by default, but can be raised with the KeySizeT
template parameter. See max_key_size()
for an easy access to this limit.
The number of elements in the map is limited to std::numeric_limits<IndexSizeT>::max()
. That is 4 294 967 296 elements, but can be raised with the IndexSizeT
template parameter. See max_size()
for an easy access to this limit.
Iterators invalidation:
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inlinestatic |
Deserialize a previouly serialized map through the deserializer
parameter.
The deserializer
parameter must be a function object that supports the following calls:
template<typename U> U operator()();
where the types std::uint64_t
, float
and T
must be supported for U.void operator()(CharT* value_out, std::size_t value_size);
If the deserialized hash map type is hash compatible with the serialized map, the deserialization process can be sped up by setting hash_compatible
to true. To be hash compatible, the Hash (take care of the 32-bits vs 64 bits), KeyEqual, GrowthPolicy, StoreNullTerminator, KeySizeT and IndexSizeT must behave the same than the ones used on the serialized map. Otherwise the behaviour is undefined with hash_compatible
sets to true.
The behaviour is undefined if the type CharT
and T
of the array_map
are not the same as the types used during serialization.
The implementation leaves binary compatibilty (endianness, IEEE 754 for floats, size of int, ...) of the types it deserializes in the hands of the Deserializer
function object if compatibilty is required.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Erase has an amortized O(1) runtime complexity, but even if it removes the key immediatly, it doesn't do the same for the associated value T.
T will only be removed when the ratio between the size of the map and the size of the map + the number of deleted values still stored is low enough.
To force the deletion you can call shrink_to_fit.
|
inline |
Erase has an amortized O(1) runtime complexity, but even if it removes the key immediatly, it doesn't do the same for the associated value T.
T will only be removed when the ratio between the size of the map and the size of the map + the number of deleted values still stored is low enough.
To force the deletion you can call shrink_to_fit.
|
inline |
Erase has an amortized O(1) runtime complexity, but even if it removes the key immediatly, it doesn't do the same for the associated value T.
T will only be removed when the ratio between the size of the map and the size of the map + the number of deleted values still stored is low enough.
To force the deletion you can call shrink_to_fit.
|
inline |
Erase has an amortized O(1) runtime complexity, but even if it removes the key immediatly, it doesn't do the same for the associated value T.
T will only be removed when the ratio between the size of the map and the size of the map + the number of deleted values still stored is low enough.
To force the deletion you can call shrink_to_fit.
|
inline |
Erase has an amortized O(1) runtime complexity, but even if it removes the key immediatly, it doesn't do the same for the associated value T.
T will only be removed when the ratio between the size of the map and the size of the map + the number of deleted values still stored is low enough.
To force the deletion you can call shrink_to_fit.
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Erase has an amortized O(1) runtime complexity, but even if it removes the key immediatly, it doesn't do the same for the associated value T.
T will only be removed when the ratio between the size of the map and the size of the map + the number of deleted values still stored is low enough.
To force the deletion you can call shrink_to_fit.
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Erase has an amortized O(1) runtime complexity, but even if it removes the key immediatly, it doesn't do the same for the associated value T.
T will only be removed when the ratio between the size of the map and the size of the map + the number of deleted values still stored is low enough.
To force the deletion you can call shrink_to_fit.
|
inline |
Erase has an amortized O(1) runtime complexity, but even if it removes the key immediatly, it doesn't do the same for the associated value T.
T will only be removed when the ratio between the size of the map and the size of the map + the number of deleted values still stored is low enough.
To force the deletion you can call shrink_to_fit.
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inline |
Use the hash value 'precalculated_hash' instead of hashing the key. The hash value should be the same as hash_function()(key). Usefull to speed-up the lookup to the value if you already have the hash.
|
inlinenoexcept |
Return the const_iterator it
as an iterator
.
|
inline |
Serialize the map through the serializer
parameter.
The serializer
parameter must be a function object that supports the following calls:
template<typename U> void operator()(const U& value);
where the types std::uint64_t
, float
and T
must be supported for U.void operator()(const CharT* value, std::size_t value_size);
The implementation leaves binary compatibilty (endianness, IEEE 754 for floats, ...) of the types it serializes in the hands of the Serializer
function object if compatibilty is required.


So you saw something on the site you liked... or maybe someone you know shot you the link and
suggested taking a look. imapex is only as strong as our members, and we are always looking to
add new SE Developers to our ranks.
imapex leverages Cisco Spark for all
communication. Email just feels so old and outdated, not something a modern development
team would use :-). Just provide your email address and tick the appropriate boxes and
Dave the Reindeer will add you to the key rooms where our members are ready to get you
started.
imapex membership is currently limited to Cisco SEs at this time. If you are a customer,
partner, or student please feel free to ask questions and chat over Spark, as well as
leverage the demos and education resources available on the site.


=<EMAIL_ADDRESS>['merchantOrderCD' => $merchantOrderCD, 'emailAddress' => $emailAddress]);?>
<EMAIL_ADDRESS>[]);?>
<EMAIL_ADDRESS>[]);?>


For any bucket that is discovered, the GCPBucketBrute tool will use the Google Storage TestIamPermissions API to determine what level of access (if any) we have to the target bucket.
If credentials are passed into the script, results from both an authenticated and unauthenticated call will be displayed.
We can check for the bucket's policy by making direct HTTP requests to:
https://www.googleapis.com/storage/v1/b/BUCKET_NAME/iam
or use the gsutil CLI to run:
gsutil iam get gs://BUCKET_NAME
We can check for the bucket's policy by making direct HTTP requests to:
https://www.googleapis.com/storage/v1/b/BUCKET_NAME/iam
or use the gsutil CLI to run:
gsutil iam get gs://BUCKET_NAME
if "allUsers" or "allAuthenticatedUsers" are allowed to read the bucket policy, we will receive a valid response. Else, access denied.
Bucket policy is helpful, but requires the "storage.buckets.getIamPolicy" permission. We can test permissions explicity with the Google Storage "TestIamPermissions" API. If we supply a bucket name and list Google Storage permissions, it will respond with the permissions we (the user making the request) have on that bucket. This completely bypasses the requirement of viewing the policy, with the restriction we can only view permissions for users we are able to authenticate as.
To determine what permissions we have on a bucket, we can make a request to a URL similar to:
https://www.googleapis.com/storage/v1/b/BUCKET_NAME/iam/testPermissions?permissions=storage.objects.list
It will respond and let us know if we have the "storage.objects.list" permission on the "BUCKET_NAME". The permissions parameter can be passed multiple times to check multiple permissions at once, and the Google Storage Python library supports the test_iam_permissions API (even though "gsutil" does not).


--- layout: post title: "My Week in Review" date: 2017-04-09 07:05:00 +0000 tags: image: https://s3.amazonaws.com/audreywatters/2017-04-09-london.jpg imagecredits: https://www.flickr.com/photos/surreal_badger/33926758465 ---
Icon credits: The Noun Project


{% include head_projects.html %}
Muhammad Fajar B
Home
Contact
Email
Facebook
Linked In
Blog
Github
{% include all_projects.html %}
{% include footer_projects.html %}


An Exploration of C. G. Jung's Psychological Types as Predictors of Creativity and Self-Actualization
By Mary Caroline Tuttle
A.B. (Stanford University) 1961 M.A. (San Jose State College) 1971
DISSERTATION
Submitted in partial satisfaction of the requirements for the degree of DOCTOR OF PHILOSOPHY in
Education
in the GRADUATE DIVISION of the
UNIVERSITY OF CALIFORNIA, BERKELEY
wt Ghd] beadt.
Bet . ae
Committee in Charge
Reproduced with permission of the copyright owner. Further reproduction prohibited without permission.


Likemark.io
is a self hosted bookmark manager.
You can view the source on
https://github.com/team-chiru


made by
The Sugar Labs was formed on May 15th, 2008 in Boston, MA, United States of America.
Materials created by the Sugar Labs contributors are usually shared on GNU GPL free software license.
The Sugar Labs is a non-governmental (NGO) and non-profit organization with wide educational goals.
The Sugar Labs main website is http://sugarlabs.org/
Activity is a small educational application (like this one) built into Sugar. Anyone can create an activity, also you!...


Http service for fetching data
Service used to map responses (json) from Kentico cloud to strongly typed types
Used for manipulating with rich text HTML (required for Node / Browser support)
Information about the SDK This can contain information from both this & Node SDK for internal logging with 'SDKID' header
Gets base URL of the request including the project Id
Query configuration
Gets single content type element from given url
Url used to get single content type element
Query configuration
Gets proper set of headers for given request.
Query configuration
Gets multiple items from given url
Url used to get multiple items
Query configuration
Gets multiple content types from given url
Url used to get multiple types
Query configuration
Http GET response
Url of request
Query config configuration
Gets single item from given url
Url used to get single item
Query configuration
Gets single content type from given url
Url used to get single type
Query configuration
Gets multiple taxonomies from given url
Url used to get multiple taxonomies
Query configuration
Gets single taxonomy from given url
Url used to get single taxonomy
Query configuration
Gets url based on the action, query configuration and options (parameters)
Action (= url part) that will be hit
Query configuration
Query options
Generated using TypeDoc
Delivery client configuration


| SSW Update - Adam's European Adventure for TechEd 2012 in Amsterdam |
|
|
[the cutting edge ]
G'day Developers!
A quiet calm has come over the office with Adam currently in Europe for TechEd.
He was asked to present for this year's event in Amsterdam so he packed his bags and flew
over. The trip is an opportune break for Adam though he is currently working hard from the
other side of the world (he can't seem to get enough of SSW)!
Adam's absence from the office has not seen a drop in productivity here, with our developers
all knuckling down on varying projects.
- Adam S and Damian have been doing their final preparations for the launch of the Part 1
Enterprise MVC Apps courses running in Brisbane, Melbourne and Sydney in the coming
days.
- Mehmet and Gerard are using MVC 4 to simplify the lives of shareholders of Sydney
Airport and avoid headaches related to their restructuring.
- We even have our SSWTV team working hard on a project for Event Cinemas, documenting the
progress of our team of developers working on their new website!
Marlon Marescia
Got a comment for Adam?
Email
Adam
Adam's
blog
|
*NEW* Featured Event:Enterprise MVC Apps - Two part course
New training and online sessions!
Enterprise MVC Apps
Cost: $330 +GST PP
Format: 1 day
|
The Model View Controller design pattern has been an proven and effective way of structuring
applications for more than 30 years. In 2007, Microsoft introduced ASP.NET MVC to the world and
since then, the framework has evolved into a mature and powerful way of writing dynamic web sites
and powerful web applications.
ASP.NET MVC provides a great way of structuring your application, ensuring a clean separation of
concerns, easy testability, and ultimate control over markup. It is quickly becoming the go-to
framework for writing .Net web applications.
This 2 part course series will be run at 3 capital cities around Australia, with an option to
complete the course online where you are unable to attend a location.
Enterprise MVC Apps Part I: Going beyond the demos
This course will introduce you to the latest version of ASP.NET MVC; version 4. Throughout the
course, attendees will be guided through building a full ASP.NET MVC application from scratch.
Read
more about Enterprise MVC Apps Part I
Brisbane FRI 13 JULY 2012 |
|
Melbourne TUE 17 JULY 2012 |
|
Sydney WED 18 JULY 2012 |
|
Online WED 25 JULY 2012 |
|
Enterprise MVC Apps Part II: Making them 500% more Enterprisey
In this course will show you the techniques and tools SSW developers use to make MVC Enterprise
ready.
Read
more about Enterprise MVC Apps Part II
Brisbane FRI 3 AUGUST 2012 |
|
Melbourne TUE 7 AUGUST 2012 |
|
Sydney WED 8 AUGUST 2012 |
|
Online WED 22 AUGUST 2012 |
|
|
Featured Video: SSW Webinar - MVC:
What's All the Fuss? By Eric Phan
This Webinar, hosted by SSW's Eric Phan, focuses on the key points of interest regarding MVC and is a
must watch for any .NET developer.
The topics include:
A history of the platform:
- ASP Classic
- ASP.Net Web Forms
- ASP.NET MVC
- Why clients and devs choose MVC
Common MVC questions:
- Third Party Tools
- Learning Curve
- Migration
- An Awesome Offer
- Q&A
Watch
more videos on SSWTV
|
SolidQ Training Courses
SSW and SolidQ offer premium public and private SQL Server Training and Business Intelligence
Training. These courses are running throughout Australia (Melbourne, Brisbane, Sydney, Canberra, and
Perth), New Zealand (Auckland) and world-wide. SolidQ have developed a full spectrum of courses for
developers, database administrators and business intelligence professionals
working with Microsoft SQL Server and the Microsoft data platform.
Choose from one of our great courses
|
Accelerated SQL Server 2012 Integration Services - 4 Days
Read
more about Accelerated SQL Server 2012 Integration Services
Sydney 6 AUGUST 2012 |
|
MS BI Bootcamp: SQL Server 2008 R2 and Office 2010 - 5 Days
Read
more about Microsoft BI Bootcamp
Melbourne 23 JULY 2012 |
|
Sydney 30 JULY 2012 |
|
Optimization/Performance Tuning and Troubleshooting - 5 Days
Read
more about Optimization/Performance Tuning and Troubleshooting
Sydney 17 SEPTEMBER 2012 |
|
T-SQL Fundamentals - 4 Days
Read
more about T-SQL Fundamentals
Melbourne 30 JULY 2012 |
|
Brisbane 6 AUGUST 2012 |
|
Sydney 13 AUGUST 2012 |
|
|
Sydney .NET User Group -
The best place to learn .NET for free in Sydney
|
|
5 Days to go!
Sydney .NET User Group
Wednesday 18th July 2012
6:00pm - 9:00pm
SSW Head Office
Gateway Court, Suite 13
81-91 Military Road, Neutral Bay
|
From Zero to Everywhere with ASP.NET MVC 4
Mobile devices like tablets and phones are quickly becoming the primary way people access the web. So
why do so many websites still provide a
horrible mobile experience?
With ASP.NET MVC, it's easier than ever to literally put your site in the palm of everyone's hand.
MVC 3 had many great features that allow you
to target mobile devices with different layout and even content. The recent releases of MVC 4 makes
things even easier and show that Microsoft is
really thinking about web-enabled devices and new web technologies.
In this demo-heavy session, Damian Brady will show off some of the best parts of ASP.NET MVC 4 to
help make targeting mobile devices easy.
ABOUT THE PRESENTER
With over ten years of experience both in software development and business analysis roles, Damian Brady has
had exposure to a large number of
industries including government and finance. A software architect with a wide skillset, he is able
to use his excellent technical skills and
knowledge of business process to deliver the most effective solutions to our clients.
To see more details and RSVP, please visit our
Facebook .NET Group or our
LinkedIn .NET Group.
|
SSW and Telerik NerdDinner
|
|
5 days to go!
NerdDinner
Wednesday 18th July 2012
8:10pm - 9:30pm
The Oaks Hotel
118 Military Road, Neutral Bay
|
As a change from sushi at the Sydney .NET User Group, SSW and Telerik invite you to join us for pizza
at The Oaks. A fantastic opportunity for networking with peers and sharing thoughts after the User
Group presentation
Sydney .Net User Group and NerdDinner proudly sponsored by:
|
Canberra .NET User Group -
The best place to learn .NET for free in Canberra
|
|
3 Days to go!
Canberra .NET User Group
Monday 16th July 2012
6:00pm - 9:00pm
Microsoft Canberra Branch
Walter Turnbull Building
Level 2, 44 Sydney Ave
Canberra, Australia
|
Introduction to Windows Phone 7 development
Have you ever wanted to have a look at how exactly you can go about creating apps for Windows Phone
7? Then this session is for you!
In this session Brian will discuss how he learnt the ropes for WP7 app development and will use his
app ‘Stitch’ as a real example
(http://stitch-app.com/). Throughout the session Brian will discuss how the application was
structured using the MVVM model and the Phoenix
framework, how authentication is handled using OAuth and how RestSharp and AsyncCTP3 are used to
make calls to secured data sources returning
JSON data.
We will also cover some Windows Phone specific items such as how to set live tiles for your
application, make use of the camera and isolated
storage so that your apps can really shine. Lastly the session will include some info on the app
submission and verification process, including
some tips on how you can ensure that your apps pass submission first time.
If you are interested in app development for WP7 then this session is a must see!
ABOUT THE PRESENTER
Brian Farnhill is an experienced SharePoint expert with a passion for the technology. He is a
SharePoint Server MVP and a digital marketing
vTSP. With a strong technical background, he has delivered a wide range of successful projects for
many clients. Brian is involved with many
SharePoint community projects such as SharePoint Saturday events and the Canberra SharePoint User
Group, and loves bring able to share his
passion for SharePoint with the world.
To see more details and RSVP, please visit our
Facebook .NET Group or our
LinkedIn .NET Group.
Canberra .Net User Group proudly sponsored by:
|
Advertise with SSW
If you would like to advertise your product or service with SSW or would like to
find out more about various advertising opportunities, please email your enquiry
to<EMAIL_ADDRESS>or call: +61 2 9953 3000.
|
|
July 2012
Employment
SharePoint Developer
Are you looking to establish a career working with the latest software technology for a large
range of great organisations?
SSW has been the leading Microsoft technology company in Sydney for 21 years. We require an
enthusiastic SharePoint developer to start ASAP.
Read more and Apply NOW...
Senior Designer
SSW is looking for a highly talented front-end Web Designer who is passionate about creating
great standards-based Web 2.0 sites. This role requires
the understanding of how people behave in certain contexts and how various stimuli and
circumstances can affect individual thought processes in social
and professional situations.
You will be working with both creative designers and the development team in various challenging
projects. This role requires someone who is able to
communicate effectively with both disciplines together with creating aesthetically pleasing
design prototypes, including graphic design, site navigation,
and layout of content.
Read more and Apply NOW...
|
|
|


Box2D/Box2D/Common/b2Settings.h File Reference
#include <cassert>
#include <cmath>
Go to the source code of this file.
Detailed Description
Global tuning constants based on meters-kilograms-seconds (MKS) units.
Define Documentation
| #define b2_aabbExtension 0.1f |
This is used to fatten AABBs in the dynamic tree. This allows proxies to move by a small amount without triggering a tree adjustment. This is in meters.
| #define b2_aabbMultiplier 2.0f |
This is used to fatten AABBs in the dynamic tree. This is used to predict the future position based on the current displacement. This is a dimensionless multiplier.
| #define b2_angularSleepTolerance (2.0f / 180.0f * b2_pi) |
A body cannot sleep if its angular velocity is above this tolerance.
| #define b2_angularSlop (2.0f / 180.0f * b2_pi) |
A small angle used as a collision and constraint tolerance. Usually it is chosen to be numerically significant, but visually insignificant.
| #define b2_contactBaumgarte 0.2f |
This scale factor controls how fast overlap is resolved. Ideally this would be 1 so that overlap is removed in one time step. However using values close to 1 often lead to overshoot.
| #define b2_epsilon FLT_EPSILON |
| #define b2_linearSleepTolerance 0.01f |
A body cannot sleep if its linear velocity is above this tolerance.
| #define b2_linearSlop 0.005f |
A small length used as a collision and constraint tolerance. Usually it is chosen to be numerically significant, but visually insignificant.
| #define b2_maxAngularCorrection (8.0f / 180.0f * b2_pi) |
The maximum angular position correction used when solving constraints. This helps to prevent overshoot.
| #define b2_maxFloat FLT_MAX |
| #define b2_maxLinearCorrection 0.2f |
The maximum linear position correction used when solving constraints. This helps to prevent overshoot.
| #define b2_maxManifoldPoints 2 |
The maximum number of contact points between two convex shapes.
| #define b2_maxPolygonVertices 8 |
The maximum number of vertices on a convex polygon.
| #define b2_maxRotation (0.5f * b2_pi) |
The maximum angular velocity of a body. This limit is very large and is used to prevent numerical problems. You shouldn't need to adjust this.
| #define b2_maxRotationSquared (b2_maxRotation * b2_maxRotation) |
| #define b2_maxTOIContacts 32 |
Maximum number of contacts to be handled to solve a TOI impact.
| #define b2_maxTranslation 2.0f |
The maximum linear velocity of a body. This limit is very large and is used to prevent numerical problems. You shouldn't need to adjust this.
| #define b2_maxTranslationSquared (b2_maxTranslation * b2_maxTranslation) |
| #define B2_NOT_USED |
( |
x |
|
) |
((void)(x)) |
| #define b2_pi 3.14159265359f |
| #define b2_polygonRadius (2.0f * b2_linearSlop) |
The radius of the polygon/edge shape skin. This should not be modified. Making this smaller means polygons will have an insufficient buffer for continuous collision. Making it larger may create artifacts for vertex collision.
| #define b2_timeToSleep 0.5f |
The time that a body must be still before it will go to sleep.
| #define b2_velocityThreshold 1.0f |
A velocity threshold for elastic collisions. Any collision with a relative linear velocity below this threshold will be treated as inelastic.
| #define b2Assert |
( |
A |
|
) |
assert(A) |
Typedef Documentation
| typedef signed short int16 |
| typedef unsigned char uint8 |
Function Documentation
| void* b2Alloc |
( |
int32 |
size |
) |
|
Implement this function to use your own memory allocator.
| void b2Free |
( |
void * |
mem |
) |
|
If you implement b2Alloc, you should also implement this function.
Friction mixing law. Feel free to customize this.
Restitution mixing law. Feel free to customize this.
Variable Documentation