{%extends "base/main_base.html"%}
{% block head %}
{% endblock %}
{% block body %}
What is Kelp?
Kelp is a large brown algae seaweed that is found in the ocean. Just kidding!
Kelp is a framework built for version-independent spigot plugin development. It is made to increase readability to a maximum, while reducing maintenance costs to a minimum. This enables you to make your plugins compatible with all spigot versions from 1.8 to 1.16 with only one single codebase.
Stop using nasty workarounds to display & update your sidebars. Use a simple and component-based approach that works just like other familiar frameworks such as React or Flutter. Updates can now be done with ease as you can distinguish between stateful and stateless components.  Instead of just putting items into an inventory, you put in widgets handling calculations that are needed to create a pagination or toggleable buttons/... You can create your own widgets as well!
event_note Events
Listen to new custom events that are called when a player changes their language for example. Never forget to register listeners again and create dynamic listeners on server runtime for a more functional approach.
celebration Particle Engine
Create stunning particle effects based on mathematical templates for particle calculation and create your own particle algorithms with ease. All particles you send are version-independent of course!
schedule Schedulers
A complete redesign of the Bukkit scheduler library simplifying asynchronous operations and especially synchronization with the server's main thread to handle non-thread-safe operations easier.
add And much more!
Prompts
Interactive Messages
Boss Bar
Entities
Configurations
Commands
Extensive Database Support
money_off And did we mention it’s free?
Kelp is open-source and completely free of charge. You can use it in any private or commercial project


{% extends "application.html" %} {% load crispy_forms_tags %} {% block shortcut-group %}
You are about to delete one announcement from the database, this procedure is irreversible.
Do you want to proceed?


This privacy policy takes effect on 10 April 2019. It describes in detail what information we collect from you, on what basis we collect it, how we use it, and rights you have to control how we use it. In this latest version of the privacy policy, we have added further details relating to our product, the Citymapper Pass, and in relation to Passenger-Driver call functionality for our Citymapper Ride Service.
This policy applies to anyone who uses our website, www.citymapper.com ("Site"), our app ("Citymapper App"), our transportation services ("CM Ride"), our driver app ("Driver App") and our transportation pass ("CM Pass"). We'll refer to the Site, Citymapper App, and Driver App together as "the App".
"We", Citymapper Limited, a company registered in the UK, are the data controller as defined by the General Data Protection Regulation.
There are three categories of information we collect: (1) information you provide, (2) information created when you use our App, CM Ride or CM Pass; and (3) information from other sources.
When you use our App, CM Ride or CM Pass, you might provide us with (a) personal information; (b) places and preferences; and (c) direct communications.
If you're a user of the Citymapper App and you choose to create a Citymapper account, you provide us with your name and email address, which we use to ensure your saved places and other personalisation features are synced across your multiple devices. When you log in using Facebook or Google, we do not send them any data about you, and we do not collect any information from them.
If you're a CM Ride Passenger ("Passenger"), you provide us with your name and email address because private hire regulations require us to record your name, and we require your email address to provide customer service and help ensure the safety of our transport services. You are also required to provide payment details in order to ride on our services.
If you're a CM Ride Driver ("Driver"), you provide us with your name, email address, phone number, address, date of birth, photograph, driver licence information, vehicle information, insurance information, bank details, national insurance number, private hire licence information, vehicle inspection reports, history of tickets/fines/violations, your driving shifts and your driver log-in details. This information is required for us to comply with relevant legal requirements, including regulatory requirements and tax laws, as well as to perform our contract with you.
If you sign up for a CM Pass, you provide us with your name, email address, home address and date of birth so that we can verify your identity to prevent fraudulent or unauthorised use of our services. If we are not able to verify your identity using this initial check, we will ask you to provide additional information (such as a copy of your passport ID page or driving licence, proof of address or your photograph ("Additional ID Documents")) in order to verify your identity. You are also required to provide payment details in order to use our services and your mobile number if you choose to use a mobile payment system for your CM Pass card.
Regardless of whether you have a Citymapper account, you may choose to provide us with information on your places and preferences, such as Home, Work, Saved Places, and other travel preferences. We process this information in order to provide you with personalised journey-planning services. We also store and analyse this data in aggregate to improve the Citymapper App (for example, by ranking certain journey results more highly than others), and to create and evaluate routes for CM Ride.
Communications you might send to us include responses to in-App survey questions, reporting a problem, or submitting queries, concerns or comments regarding the App, CM Ride or CM Pass. These messages to us will also contain details such as the type of phone you're using, your service provider, and if you've enabled the location permissions in your device, the latitude and longitude of your location when you contact us. We process this information in order to fix problems in the App, with CM Ride or with CM Pass, to reply to your communications, and to keep CM Ride safe.
The following are the types of information created when you use our App, CM Ride or CM Pass. We associate this information with an installation ID number that is randomly generated each time you install the Citymapper App. We use this installation ID to pseudonymise the data we collect from you, and do not access any permanent device ID numbers.
Users of the Citymapper App: We aggregate and analyse journey start and end points. Assuming you've enabled your device to provide location information and you haven't entered your start point manually, we collect and use your start location information as determined through data such as GPS, mobile phone towers, and WiFi. If you haven't enabled your device to provide location information, you will have to manually enter your start and end points, which is then the location information we collect and use.
When you tap GO in the Citymapper App, we collect your location information throughout your journey. We use this data to provide on-trip support, such as alerting you when to get off a bus. We also store and analyse this data in aggregate, as we do with the other types of location data described in this "Location Information" section, to improve the journey results we show to all users and to create and evaluate routes for our transportation services.
Passengers: If you are a Passenger, we collect your location information when the Citymapper App is running both in the foreground and background of your device during your journey. Knowing your location at all times during your Ride journey enables us to provide on-trip support and maintain Passenger and Driver safety.
When you ride CM Ride, in addition to your location data, we collect and store your booking details, your Driver and vehicle information, the date and time of your journey, the amount charged, your pick up and drop off location, cancellations and no-shows. We store and use this information to comply with legal record-keeping requirements, for operational reasons, such as providing customer support, and to improve our service.

We collect information about the devices you use to access our App and to use CM Ride, including the type of computer or device you use, the installation ID of the App on your device, the hardware models, operating systems and versions, software, file names and versions, the preferred languages, time zone settings, and device motion information. This information is necessary for us to diagnose bugs and improve the App.
Each time you interact with our App, we collect information about how and when you use it, such as the time and date when you opened the App, the searches you make, the features and journey results you click on, pages visited, app crashes and other system activity. We use this information to improve our App in multiple ways. For example, using App crash data, we can fix bugs and prevent future crashes, and by knowing what gets tapped or scrolled most often, we can replace unpopular features with other, more helpful features.
Passengers: If you are a Passenger, you may choose to call your assigned Driver in order to help you find your CM Ride. If you use this feature, we will receive your phone number and the date and time of any calls made. However, the number will be masked so that the Driver does not receive this number.
The App uses cookies to store certain information. Cookies are pieces of information that a website or app transfers to your hard drive or mobile device to store and sometimes track information about you. Although they identify a user's device, cookies do not reveal the name, email address or other obvious identifiers of users.
When you interact with the App, we try to make that experience simple and meaningful. When you visit our App, our server sends a cookie to your computer or mobile device, depending on how you access the site or App. Cookies are small pieces of information which are issued to your computer when you visit a website and which store and sometimes track information about your use of the site. A number of cookies we use last only for the duration of your web session and expire when you close your App. These are known as "session cookies". Other cookies are used to remember you when you return to the App and will last for longer. These are known as "persistent cookies".
We use cookies to:
remember that you have visited us before, which allows us to identify the number of unique visitors we receive. This allows us to make sure we have enough capacity for the number of users that we get; customise elements of the promotional layout and/or content of the pages of the App; and
collect information about how you use the App so that we can improve the App and learn which parts of the App are most popular to visitors.
Some of the cookies used by our App are set by us, and some are set by the third-party analytics and crash/error-reporting companies we've described in this policy who are acting on our instructions. For example, Mixpanel tracks what users do in the Citymapper App so we can improve the design and functionality.
Most browsers automatically accept cookies but, if you prefer, you can change your browser to prevent that or to notify you each time a cookie is set. You can also learn more about cookies by visiting www.allaboutcookies.org which includes additional useful information on cookies and how to block cookies using different types of browsers. By blocking or deleting cookies you may not be able to take full advantage of the App's features.
Citymapper collects the following types of information from other sources.
We receive feedback on Drivers from users of CM Ride in the form of ratings, compliments or incidents. We use this feedback to improve the CM Ride experience for Passengers and to help ensure that CM Ride is safe and reliable.
In order to pay for your CM Pass or your ride on CM Ride, you will need to provide payment information to our third-party service provider, Stripe, such as your credit card details. Apple Pay and Google Pay are also enabled in the Citymapper App. These three companies provide us only with the last four digits of your card number and expiration date, which we require in order to handle operational issues such as Passenger queries about charges.
If you log into your Citymapper account using Facebook or Google, those companies provide us with your name and email address, which are necessary for us to log you in to the Citymapper App. We do not collect or use any other information received from those two companies.
If you are a Driver, we receive information relating to your insurance policies and licensing information. This information is necessary for us to comply with relevant legal requirements and to ensure the safety of CM Ride.
If you sign up for a CM Pass, we receive a due diligence report from third-party agencies that provide identity verification, in order to confirm your identity. This information is necessary to prevent fraudulent or unauthorised use of our services and to comply with relevant financial crime laws.
If you are a CM Pass user, we receive a "Cardholder ID" from the third-party company that issues your CM Pass card. The Cardholder ID is your unique identifier that allows us to know which CM Pass card has been issued to you. When you use the CM Pass, we also receive your transaction information from this third-party company, including the date, time, amount, and merchant details associated with the transaction.
If you are a Driver, we receive from a third-party navigation provider your route and your estimated time of arrival (ETA).
In summary, we use the information we collect to:
Provide and improve our App, CM Ride and CM Pass;
Build a profile of your preferences so we can personalise the Citymapper App and provide you with relevant transport information;
Recommend transport options that match your stated preferences and previous use of the App;
Administer your account with us, if you have one;
Confirm your eligibility to use CM Pass;
Verify your identity (including processing of your identity documents in order to confirm your identity and to make an automated decision as to whether or not to provide you with CM Pass services);
Process or facilitate payment (through third party payment processing services) for CM Ride and CM Pass;
Send you transaction receipts for your use of CM Ride and/or CM Pass;
Respond to your emails to discuss your use of the App, CM Ride and CM Pass and answer any support queries you may have;
Send you marketing communications by email or in-App notifications, and let you know about our policies and terms or when we launch in your city;
Identify issues with the operation of the App, and provide crash reports in order to find resolution for performance issues;
Improve the design, functionality and/or content of the pages of the App and customise them for you;
Carry out research on users' transport choices to improve the App, CM Ride and CM Pass; and
Disclose to lawful authorities when required to do so by law, or when appropriate, in our opinion, to respond to their request.
We work hard to improve the App and add functionality, which we think will make it safer, more fun and more useful for our users. New functionality may involve similar or incidental uses of your data to those set out above. We regularly review the way we use data, and will update our privacy policy to reflect these improvements to the App.
To the extent we share information with third parties, we do so to enhance your experience with the App, and we pseudonymise and minimize the data we send to them.
Search Partners: We have search partners like Google, Apple, and Foursquare in order for the App to send you to the places you want to go. They receive the text you have searched for, and in order to return results most relevant to you, they receive your current location if you have enabled location permission in your device.
Transport Partners: We also have transport partners in the App, such as Uber, Gett and Lyft. They receive the pick-up and destination locations you enter in order to provide travel time and fare estimates, and they receive that information for your convenience if you choose to book a ride through their apps by clicking through the Citymapper App.
Navigation Provider: If you are a Driver, we provide destination information to a third-party navigation provider to route you efficiently to destinations on CM Ride.
Analytics Vendors: We use Mixpanel, Flurry and Google Analytics to understand what you've tapped or clicked on the App, and we make features improvements based on this information. They receive information showing only that a person has tapped or used certain features in the App.
Crash/Error Reporting Vendors: We use Crashlytics to report on crashes you experience with the App so we can fix those, and Sentry to report on errors with our backend.
Messaging Apps: If you choose to use certain sharing features in our App, then you may be sharing your information with those companies, depending on factors such as that company's encryption policies. For example, if you use the "Share Directions" feature in the App, a link with your start and end points will be sent via messaging app. If the messaging app company you choose uses end-to-end encryption, your location link cannot be used or intercepted by that messaging app company.
Passengers and Drivers: To enable the provision of CM Rides, we share certain information between Passengers and Drivers. If you are a Driver, we share the following information with your assigned Passengers: your first name, photograph, private hire licence information, vehicle information, current location, and pick up and drop off location. If you are a Passenger, we share the following information with your Driver when you are assigned your Driver and during the course of your CM Ride: first name and last initial, route information, current location, and pick up and drop off location.
Communication Platforms: To send you transaction receipts for your CM Rides and/or CM Pass subscription and to send you all other emails and update about our services, we use communication platforms such as Sendgrid and Mailchimp.
Identity verification platforms: We use identity verification agencies like Onfido and credit reference agencies to verify your identity to prevent fraudulent or unauthorised use of our services. They receive your name, home address and date of birth. If we are not able to verify your identity using this initial check, they will receive the additional information that you give us in order to verify your identity such as your Additional ID Documents. Identity verification agencies and credit reference agencies also use information from a number of different public sources (for example the electoral roll) to verify your identity. Credit reference agencies may also leave a 'soft' footprint on your credit file for the purpose of identity verification which should not affect your credit rating.
CM Pass card issuer: We use Prepaid Financial Services (PFS) to issue and deliver the CM Pass card to you and to process transactions on your CM Pass card. PFS receives your name and home address. If you choose to use a mobile payment system for your CM Pass card, PFS will also receive your phone number. PFS may also undertake quality assurance checks of our identity verification process, in which case they will have access to your information available from public sources, your date of birth and any additional information that you give us in order to verify your identity such as your Additional ID Documents.
We'll only process your personal information where we have a legal basis for doing so. Our legal basis to process your personal data includes processing that is:
necessary for our legitimate interests, which are:
to research, develop, fix and provide new and tailored features for our Citymapper App users (e.g., ranking journey routing results in a way that surfaces more relevant routes at the top);
to create and evaluate routes for CM Ride;
to provide on-trip support to users and to ensure that the App and the CM Ride are safe and secure for users;
to accept and administer payment from users for use of CM Ride and/or CM Pass;
to improve navigation and routing on CM Ride;
to verify users' identity to prevent fraudulent or unauthorised use of our services; and
to prevent breaches of our terms and policies or to prevent harmful or illegal activity;
necessary for the performance of our contract with you (e.g., so Passengers and Drivers can find each other, and to find you the route options you've requested in the Citymapper App);
necessary to comply with relevant legal requirements (for example, to comply with applicable regulatory obligations, to comply with financial crime laws and to make mandatory disclosures to law enforcement); and
based on your consent (for example, where you provide us with marketing consents), which may be withdrawn at any time by contacting us at the email address specified below.
You have a legal right under the GDPR to request access to a copy of the personal information about you held by us. In order to do this, contact us at<EMAIL_ADDRESS>Please use the subject line "DSAR" and include details about what personal information you're looking for. You will need to have created an account in order for us to provide you with your information because without an account, we are not able to connect your Installation ID to a verifiable email address.
Subject to any legal obligations to keep your information longer, we store your personal information for as long as is necessary to provide our services and products, or until you ask us to delete it, whichever comes first.
If you ask us to delete your personal information by emailing us at<EMAIL_ADDRESS>please use the subject line "Account Deletion."
Note that residual copies may take longer to be removed from our backup systems. We will keep a record of your request in order to ensure compliance with legal obligations.
You have the right at any time to prevent the use of your personal information for direct marketing purposes. If you no longer want to receive marketing messages from us, please let us know by writing to us at<EMAIL_ADDRESS>and you will be unsubscribed accordingly. Please note that sometimes it can take a short amount of time to refresh our records for these purposes. Also, we may still send you non-promotional, transactional messages, such as receipts for your rides or information about your account.
We may send you information we think you may find useful (e.g., tube line and subway disruptions and alerts about CM Ride relevant to you) or which you have requested from us by push notification and/or by email (if provided), and we or your device's operating system will give you the option to opt-out of receiving further notifications or emails.
We place great importance on the security of all information associated with our users. We use measures such as encryption, pseudonymisation, information access controls, and firewalls.
Keep in mind that submission of information over the internet and mobile networks is never entirely secure. We cannot guarantee the security of information you submit via the App whilst it is in transit over the internet or mobile networks and any such submission is at your own risk.
Information that you submit via the App is sent to and stored on secure servers located in the United Kingdom, other European Economic Area countries and in the United States. Information submitted by you may be transferred by us to our other offices and/or to the third parties mentioned in the circumstances described above, which may be situated outside the European Economic Area (for instance in the United States).
We do not knowingly collect personal information from children under the age of 13. If you're under the age of 13, please do not submit any personal information through the App or email. We encourage parents and legal guardians to monitor their children's internet use and to help enforce our privacy policy by instructing their children never to provide personal information on our website without their permission. If you have reason to believe that a child under the age of 13 has provided personal information to us, please contact us as specified below, and we will work to delete that information from our databases.
We may revise this privacy policy from time to time. Any changes and additions to this privacy policy will be posted in the App and are effective from the date on which they are posted. Please review this privacy notice from time to time to check whether we have made any changes to the way in which we use your personal data. This privacy policy was last updated on 10 April 2019.
We work hard to handle your information responsibly. If you're unhappy about the way we do this, please contact our Data Protection Officer by email to<EMAIL_ADDRESS>However, you also have the right to lodge a complaint about the data processing activities carried out by Citymapper with our lead supervisory authority, the UK Information Commissioner's Office. Our ICO registration number is ZA017660.
Please submit any questions, concerns or comments you have about this privacy policy or any requests concerning your personal data by email to our Data Protection Officer at<EMAIL_ADDRESS>You can also reach us at Data Protection Officer, Citymapper Limited, Cargo Works, 1-2 Hatfields, London, SE1 9PG, United Kingdom.


Book Details
Name
Description
Price
Authors
Genres
Add authors
Edit book
Order Form
Book name
First name
Last name
Address
City
Country
Ukraine
Russia
Belorus
Kazakhstan
Poland
Latvia
Lithuania
Estonia
Moldova
Book count
To issue order


Biography
Welcome to my About Me page. I am an enthusiastic and eager learner. I can, literally, work anythnig and I have many hobbies. Once, I was a magician and illusionist, but I quit these a long time age.
Welcome to my About Me page. I am an enthusiastic and eager learner. I can, literally, work anythnig and I have many hobbies. Once, I was a magician and illusionist, but I quit these a long time age.


| Home | Libraries | People | FAQ | More |
The enumeration boost::memory_order
defines the following
values to represent memory ordering constraints:
|
Constant |
Description |
|---|---|
|
|
No ordering constraint. Informally speaking, following operations
may be reordered before, preceding operations may be reordered
after the atomic operation. This constraint is suitable only when
either a) further operations do not depend on the outcome of the
atomic operation or b) ordering is enforced through stand-alone
|
|
|
Perform |
|
|
Perform |
|
|
Perform |
|
|
Perform both |
|
|
Enforce sequential consistency. Implies |
See section happens-before for explanation of the various ordering constraints.
boost::atomic<T>
provides methods
for atomically accessing variables of a suitable type T
.
The type is suitable if it satisfies one of the following constraints:
class
or struct
)
that has a non-throwing default constructor, that is copyable via memcpy
and comparable via memcmp
.
Note that all classes having a trivial default constructor, no destructor
and no virtual methods satisfy the second condition according to C++98. On
a given platform, other data-types may also satisfy
this constraint, however you should exercise caution as the behaviour becomes
implementation-defined. Also be warned that structures with "padding"
between data members may compare non-equal via memcmp
even though all members are equal.
All atomic objects supports the following operations:
|
Syntax |
Description |
|---|---|
|
|
Initialize to an unspecified value |
|
|
Initialize to |
|
|
Checks if the atomic object is lock-free |
|
|
Return current value |
|
|
Write new value to atomic variable |
|
|
Exchange current value with |
|
|
Compare current value with |
|
|
Compare current value with |
|
|
Compare current value with |
|
|
Compare current value with |
order
always has memory_order_seq_cst
as default parameter.
The compare_exchange_weak
/compare_exchange_strong
variants taking
four parameters differ from the three parameter variants in that they allow
a different memory ordering constraint to be specified in case the operation
fails.
In addition to these explicit operations, each atomic<T>
object also supports implicit store
and load
through the use of "assignment" and "conversion to T
"
operators. Avoid using these operators, as they do not allow explicit specification
of a memory ordering constraint.
In addition to the operations listed in the previous section, boost::atomic
for integral types I
supports the
following operations:
|
Syntax |
Description |
|---|---|
|
|
Add |
|
|
Subtract |
|
|
Apply bit-wise "and" with |
|
|
Apply bit-wise "or" with |
|
|
Apply bit-wise "xor" with |
order
always has memory_order_seq_cst
as default parameter.
In addition to these explicit operations, each boost::atomic
object also supports implicit pre-/post- increment/decrement, as well as
the operators +=
, -=
, &=
,
|=
and ^=
.
Avoid using these operators, as they do not allow explicit specification
of a memory ordering constraint.
In addition to the operations applicable to all atomic object, boost::atomic

for pointer types P
(other than
void
pointers) support the following operations:
|
Syntax |
Description |
|---|---|
|
|
Add |
|
|
Subtract |
order
always has memory_order_seq_cst
as default parameter.
In addition to these explicit operations, each boost::atomic

object also supports implicit pre-/post- increment/decrement, as well as
the operators +=
, -=
. Avoid using these operators, as they
do not allow explicit specification of a memory ordering constraint.
|
Syntax |
Description |
|---|---|
|
|
Issue fence for coordination with other threads. |
|
|
Issue fence for coordination with signal handler (only in same thread). |
Boost.Atomic defines a number of macros
to allow compile-time detection whether an atomic data type is implemented
using "true" atomic operations, or whether an internal "lock"
is used to provide atomicity. The following macros will be defined to 0
if operations on the data type always require
a lock, to 1
if operations on
the data type may sometimes require a lock, and to 2
if they are always lock-free:
|
Macro |
Description |
|---|---|
|
|
Indicate whether |
|
|
Indicate whether |
|
|
Indicate whether |
|
|
Indicate whether |
|
|
Indicate whether |
|
|
Indicate whether |


Letzes mal aktualisiert: 17.09.2019
Entwickelt von Ulrich Barnstedt
A bot developed for the automatic managing of homework.
Working principle:
Main HW class, instances saved in JSON File
Data gets loaded, stringified, and sent to discord using discord.js
Automatic deletion basing on the current date and HW date.
Not hosted, command line interface


I graduated from the Institute for Integrative Nutrition where I learned innovative coaching methods, practical lifestyle management techniques, and over 100 dietary theories; everything from Ayurveda, gluten-free, and Paleo, to raw, vegan, and macrobiotics, and everything in between.
I studied with the world's top health and wellness experts including:
Joshua Rosenthal, MScEd, Founder and director of the Institute for Integrative Nutrition
Deepak Chopra, MScEd, World Leader in Mind-Body Medicine, Director of Education at The Chopra Center, Bestselling Author
David Katz, MD, MPH, Authority on Preventive Medicine and Weight Management, Director of the Yale Prevention Research Center
Walter Willett, MD, DrPH, Chair of the Department of Nutrition at Harvard’s School of Public Health and Bestselling Author
Andrew Weil, MD, Bestselling Author and Expert on Integrative Medicine and Mind-Body Interactions
Gabrielle Bernstein, Motivational Speaker, Life Coach, Bestselling Author
Susan Blum, MD, MPH, Functional Medicine Doctor, Founder of Blum Center for Health
Mark Hyman, MD, Founder and Medical Director of The UltraWellness Center, Bestselling Author
Geneen Roth, Pioneer of Emotional Eating and Empowerment, Bestselling Author
David Wolfe, recognized Expert and Bestselling Author on Superfoods and Raw Nutrition
Marion Nestle, PhD, MPH, Paulette Goddard Professor of Nutrition, Food Studies and Public Health at New York University
Mark Bittman, New York Times Columnist, Bestselling Author
My education has equipped me with extensive, cutting-edge knowledge in holistic nutrition, health coaching, and prevention. Drawing on my expertise, I work with clients like you to help make lifestyle changes and choose health-promoting ways that produce real and lasting results. You will develop a deeper understanding of food and lifestyle choices that work best for you, improving your energy, balance, health, and happiness.
Each session will leave you feeling inspired and motivated. We will talk about things beyond food, seeking to bring balance to important elements of your life such as love and relationship as well as career and money. I will personally and carefully guide you to make simple, small changes that transform your life.


| SQL Id | SQL Text |
| 04kug40zbu4dm | select policy#, action# from aud_object_opt$ where object# = :1 and type = 2 |
| 0b6pnaramchk3 | insert into WRH$_IOSTAT_FILETYPE (dbid, per_pdb, con_dbid, snap_id, instance_number, filetype_id, small_read_megabytes, small_write_megabytes, large_read_megabytes, large_write_megabytes, small_read_reqs, small_write_reqs, small_sync_read_reqs, large_read_reqs, large_write_reqs, small_read_servicetime, small_write_servicetime, small_sync_read_latency, large_read_servicetime, large_write_servicetime, retries_on_error ) select :dbid, if.con_id, con_id_to_dbid(if.con_id) con_dbid, :snap_id, :instance_number, filetype_id, sum(small_read_megabytes) small_read_megabytes, sum(small_write_megabytes) small_write_megabytes, sum(large_read_megabytes) large_read_megabytes, sum(large_write_megabytes) large_write_megabytes, sum(small_read_reqs) small_read_reqs,
sum(small_write_reqs) small_write_reqs, sum(small_sync_read_reqs) small_sync_read_reqs, sum(large_read_reqs) large_read_reqs, sum(large_write_reqs) large_write_reqs, sum(small_read_servicetime) small_read_servicetime, sum(small_write_servicetime) small_write_servicetime, sum(small_sync_read_latency) small_sync_read_latency, sum(large_read_servicetime) large_read_servicetime, sum(large_write_servicetime) large_write_servicetime, sum(retries_on_error) retries_on_error FROM v$iostat_file if WHERE (1 = 1) GROUP BY if.con_id, filetype_id |
| 0pmbxw88n6jsz | UPDATE wrh$_seg_stat_obj ob SET (snap_id, owner, object_name, subobject_name, tablespace_name, object_type, partition_type, index_type, base_obj#, base_object_name, base_object_owner) = (SELECT snap_id + 1, nvl(ownername_kewrseg, owner), nvl(objname_kewrseg, object_name), nvl(subobjname_kewrseg, subobject_name), nvl(tsname_kewrseg, tablespace_name), decode(objtype_kewrseg, 0, object_type, sys.dbms_swrf_internal.awr_decode_object_type(objtype_kewrseg, 18)), decode(ptype_kewrseg, 0, partition_type, decode(ptype_kewrseg, 0, 'NONE', 1, 'RANGE', 2, 'HASH', 3, 'SYSTEM', 4, 'LIST', NULL, 'NONE', 'UNKNOWN')), decode(indtype_kewrseg,
0, index_type, decode(indtype_kewrseg, 1, 'NORMAL'|| decode(bitand(iprop_kewrseg, 4), 0, '', 4, '/REV'), 2, 'BITMAP', 3, 'CLUSTER', 4, 'IOT - TOP', 5, 'IOT - NESTED', 6, 'SECONDARY', 7, 'ANSI', 8, 'LOB', 9, 'DOMAIN')), coalesce(nullif(bobjn_kewrseg, 0), so.base_obj#), case bobjname_kewrseg when NULL then so.base_object_name else case length(bobjname_kewrseg) when 0 then so.base_object_name else bobjname_kewrseg end end, case bowname_kewrseg when NULL then so.base_object_owner else case length(bowname_kewrseg) when 0 then so.base_object_owner else bowname_kewrseg end
end FROM wrh$_seg_stat_obj so JOIN (select * from x$kewrtsegstat where con_id = :con_id_01 or ( (:con_id_02 = 1 and con_id = 0) or (:con_id_03 = 0 and con_id = 1)) ) io ON (dbid = :dbid and con_dbid = con_dbid_kewrseg and ts# = tsn_kewrseg and obj# = objn_kewrseg and dataobj# = objd_kewrseg) WHERE ob.dbid = so.dbid AND ob.con_dbid = so.con_dbid AND ob.ts# = so.ts# AND ob.obj# = so.obj# AND ob.dataobj# = so.dataobj#) WHERE dbid = :dbid AND object_name NOT LIKE '%MISSING%' AND object_name NOT LIKE '%TRANSIENT%' AND (ts#, obj#, dataobj#, con_dbid) in (SELECT tsn_kewrseg, objn_kewrseg, objd_kewrseg, con_dbid_kewrseg FROM (select * from x$kewrtsegstat where con_id = :con_id_04 or ( (:con_id_05 = 1 and con_id = 0) or (:con_id_06 = 0 and con_id = 1)) ) )
|
| 0sbbcuruzd66f | select /*+ rule */ bucket_cnt, row_cnt, cache_cnt, null_cnt, timestamp#, sample_size, minimum, maximum, distcnt, lowval, hival, density, col#, spare1, spare2, avgcln, minimum_enc, maximum_enc from hist_head$ where obj#=:1 and intcol#=:2 |
| 121ffmrc95v7g | select i.obj#, i.ts#, i.file#, i.block#, i.intcols, i.type#, i.flags, i.property, i.pctfree$, i.initrans, i.maxtrans, i.blevel, i.leafcnt, i.distkey, i.lblkkey, i.dblkkey, i.clufac, i.cols, i.analyzetime, i.samplesize, i.dataobj#, nvl(i.degree, 1), nvl(i.instances, 1), i.rowcnt, mod(i.pctthres$, 256), i.indmethod#, i.trunccnt, nvl(c.unicols, 0), nvl(c.deferrable#+c.valid#, 0), nvl(i.spare1, i.intcols), i.spare4, i.spare2, i.spare6, decode(i.pctthres$, null, null, mod(trunc(i.pctthres$/256), 256)), nvl(i.evaledition#, 1), nvl(i.unusablebefore#, 0), nvl(i.unusablebeginning#, 0), ist.cachedblk, ist.cachehit, ist.logicalread from ind$ i, ind_stats$ ist, (select enabled, min(intcols) unicols, min(to_number(bitand(defer, 1))) deferrable#, min(to_number(bitand(defer, 4))) valid# from cdef$ where obj#=:1 and enabled > 1 group by enabled) c where i.obj#=c.e
nabled(+) and i.obj# = ist.obj#(+) and i.bo#=:1 order by i.obj# |
| 1w3zq5tgunffu | SELECT /*+ NO_STATEMENT_QUEUING RESULT_CACHE (SYSOBJ=TRUE SHELFLIFE=30) OPT_PARAM('_ENABLE_VIEW_PDB', 'FALSE') */ "INSTANCE_NUMBER", "SAMPLE_ID", "SAMPLE_TIME", "EVENT", "SESSION_STATE", "CON_ID" FROM NO_CROSS_CONTAINER("SYS"."AWR_CDB_ACTIVE_SESS_HISTORY") "AWR_CDB_ACTIVE_SESS_HISTORY" WHERE "AWR_CDB_ACTIVE_SESS_HISTORY"."SAMPLE_TIME">TIMESTAMP' 2019-07-17 13:44:00' AND "AWR_CDB_ACTIVE_SESS_HISTORY"."SAMPLE_TIME"<TIMESTAMP' 2019-07-17 13:45:00' AND ("AWR_CDB_ACTIVE_SESS_HISTORY"."CON_ID" IS NULL OR ("AWR_CDB_ACTIVE_SESS_HISTORY"."CON_ID"=0 OR "AWR_CDB_ACTIVE_SESS_HISTORY"."CON_ID"=3)) AND 1=1 AND 1=1 |
| 2sxqgx5hx76qr | select /*+ rule */ bucket, endpoint, col#, epvalue, epvalue_raw, ep_repeat_count, endpoint_enc from histgrm$ where obj#=:1 and intcol#=:2 and row#=:3 order by bucket |
| 35ra2cdwvqg1w | select parttype, partcnt, partkeycols, flags, defts#, defpctfree, defpctused, definitrans, defmaxtrans, deftiniexts, defextsize, defminexts, defmaxexts, defextpct, deflists, defgroups, deflogging, spare1, mod(spare2, 256) subparttype, mod(trunc(spare2/256), 256) subpartkeycols, mod(trunc(spare2/65536), 65536) defsubpartcnt, mod(trunc(spare2/4294967296), 256) defhscflags, mod(trunc(spare2/1099511627776), 4096) defimcflags, mod(trunc(spare2/4503599627370496), 8) defimcpl, mod(spare3, 256) interval_dty, rowid, defmaxsize, mod(trunc(spare3/256), 256) subptn_interval_dty, mod(trunc(spare3/65536), 256) defccflags, mod(trunc(spare3/16777216), 256) defimcflags2, mod(trunc(spare3/4294967296), 256) defhscflags2 from partobj$ where obj# = :1 |
| 3uhazdn5w667h | SELECT /*CROSSCON*/ /* */ /*"AWR_CDB_ACTIVE_SESS_HISTORY"*/ /* NONE */ * FROM NO_COMMON_DATA("SYS"."AWR_CDB_ACTIVE_SESS_HISTORY") |
| 3un99a0zwp4vd | select owner#, name, namespace, remoteowner, linkname, p_timestamp, p_obj#, nvl(property, 0), subname, type#, flags, d_attrs from dependency$ d, obj$ o where d_obj#=:1 and p_obj#=obj#(+) order by order# |
| 4dy540fw5qm7s | SELECT COUNT(*) FROM (SELECT FILETYPE_ID, FILETYPE_NAME FROM V$IOSTAT_FILE NT MINUS SELECT FILETYPE_ID, FILETYPE_NAME FROM WRH$_IOSTAT_FILETYPE_NAME WHERE dbid = :dbid) |
| 55241209ay234 | select grantee# from sysauth$ where (-privilege#) = 235 |
| 5u7g54s63p4ts | select toid from type$ where package_obj#=:1 and typ_name=:2 |
| 61svgu3qayqbv | insert into wrh$_sgastat (dbid, per_pdb, con_dbid, snap_id, instance_number, pool, name, bytes) select distinct :dbid, sgastat.con_id, con_id_to_dbid(sgastat.con_id) con_dbid, :snap_id, :instance_number, pool, name, bytes FROM (select con_id, pool, name, bytes, 100*(bytes) / (sum(bytes) over (partition by pool)) part_pct from v$sgastat ) sgastat WHERE (1 = 1) and part_pct >= 1 or pool is null or name = 'free memory' or name = 'row cache' |
| 6ajkhukk78nsr | begin prvt_hdm.auto_execute( :dbid, :inst_num , :end_snap_id ); end; |
| 6h3cwmunz5z8q | select col#, grantee#, privilege#, max(mod(nvl(option$, 0), 2)), max(bitand(nvl(option$, 0), 8) /8), max(bitand(nvl(option$, 0), 16) /16), max(bitand(nvl(option$, 0), 64) /64), max(bitand(nvl(option$, 0), 128) /128) from objauth$ where obj#=:1 and col# is not null group by privilege#, col#, grantee# order by col#, grantee# |
| 6knj3rj82ww1c | select max(snap_id) minsnap
from dba_hist_snapshot
where
to_date(to_char(end_interval_time, 'YYYYMMDDHH24MI'), 'YYYYMMDDHH24MI') <= to_date('201907171344', 'YYYYMMDDHH24MI')
|
| 6n2qqv1brfhpp | select ind.type#, ind.property, base_obj.obj#, base_owner.name, base_obj.name from sys.ind$ ind, sys.user$ base_owner, sys.obj$ base_obj where ind.obj# = :oid and ind.dataobj# = :doid and ind.bo# = base_obj.obj# and base_obj.owner# = base_owner.user# |
| 6xa9pr89f6u0f | insert into wrh$_latch (dbid, per_pdb, con_dbid, snap_id, instance_number, latch_hash, level#, gets, misses, sleeps, immediate_gets, immediate_misses, spin_gets, sleep1, sleep2, sleep3, sleep4, wait_time) select :dbid, ltch.con_id, con_id_to_dbid(ltch.con_id) con_dbid, :snap_id, :instance_number, hash, level#, gets, misses, sleeps, immediate_gets, immediate_misses, spin_gets, sleep1, sleep2, sleep3, sleep4, wait_time FROM v$latch ltch WHERE (1 = 1) |
| 7kub1nvw8wmq3 | insert into wrh$_mvparameter (dbid, per_pdb, con_dbid, snap_id, instance_number, parameter_hash, ordinal, value, isdefault, ismodified) select :dbid, sv.con_id, con_id_to_dbid(sv.con_id) con_dbid, :snap_id, :instance_number, sv.hash, sv.ordinal, substr(sv.value, 1, 512), sv.isdefault, sv.ismodified from v$system_parameter2 sv where exists (select 1 from v$system_parameter4 i where i.num = sv.num and bitand(i.param_flag, 32) = 32) |
| 7qudmah047src | INSERT INTO wrh$_datafile (dbid, per_pdb, con_dbid, snap_id, file#, creation_change#, filename, ts#, tsname, block_size) SELECT /*+ qb_name(wrh_df_top) leading( "DF"@"SEL$4" "X$KCCFN"@"SEL$2" "X$KCCTS"@"SEL$6" "WRH$_DATAFILE"@"SEL$7" "AW$SYS"@"WRH_DF_TOP") */ :dbid, v.con_id, con_id_to_dbid(v.con_id) con_dbid, :lah_snap_id, f.file#, f.creation_change#, v.name filename, ts.ts#, ts.name tsname, f.block_size block_size FROM v$dbfile v, v$datafile f, v$tablespace ts WHERE (1 = 1) AND ((v.con_id = f.con_id)) AND ((v.con_id = ts.con_id)) and f.status = 'ONLINE' and f.file# = v.file# and f.ts# = ts.ts# and not exists
(SELECT 1 from (select * from wrh$_datafile where dbid = :dbid ) dfh WHERE dfh.file# = f.file# AND dfh.creation_change# = f.creation_change# ) |
| 7ugy3sxj9aw5t | insert into WRH$_SYSSTAT (dbid, per_pdb, con_dbid, snap_id, instance_number, stat_id, value) select /*+ use_hash(v$sysstat) */ :dbid, sysstat.con_id, con_id_to_dbid(sysstat.con_id) con_dbid, :snap_id, :instance_number, stat_id, value FROM v$sysstat sysstat WHERE (1 = 1) |
| 8swypbbr0m372 | select order#, columns, types from access$ where d_obj#=:1 |
| 9upc937nqa2vb | with sep_sample as
(
select /*+ materialize */ max(sample_time) sep_time from (select min(sample_time) sample_time from gv$active_session_history group by inst_id)
)
select '"' || start_time || '" "' || event || '" ' || trunc(cnt, 4) from
(
select
to_char(to_date(to_char(sample_time, 'YYMMDD') ||' '|| trunc(to_char(sample_time, 'SSSSS')/10)*10, 'YYMMDD SSSSS'), 'yyyy-mm-dd hh24:mi:ss') start_time
, decode(ash.session_state, 'ON CPU', 'ON CPU', ash.event) event
, count(1)/10 cnt
, count(1) total
, max(sample_id)-min(sample_id)+1 samples
from
gv$active_session_history ash
where
sample_time > to_date('2019-07-17 13:44:00', 'yyyy-mm-dd hh24:mi:ss') and sample_time < to_date('2019-07-17 13:45:00',
'yyyy-mm-dd hh24:mi:ss')
and sample_time >= (select sep_time from sep_sample)
group by to_char(to_date(to_char(sample_time, 'YYMMDD') ||' '|| trunc(to_char(sample_time, 'SSSSS')/10)*10, 'YYMMDD SSSSS'), 'yyyy-mm-dd hh24:mi:ss')
, decode(ash.session_state, 'ON CPU', 'ON CPU', ash.event)
union all
select
to_char(to_date(to_char(sample_time, 'YYMMDD') ||' '|| trunc(to_char(sample_time, 'SSSSS')/10)*10, 'YYMMDD SSSSS'), 'yyyy-mm-dd hh24:mi:ss') start_time
, decode(ash.session_state, 'ON CPU', 'ON CPU', ash.event) event
, count(1) cnt
, count(1) total
, (max(sample_id)-min(sample_id))/10 + 1 samples
from
dba_hist_active_sess_history ash
where
sample_time > to_date('2019-07-17 13:44:00', 'yyyy-mm-dd hh24:mi:ss') and sample_time < to_date('2019-07-17 13:45:00', 'yyyy-mm-dd hh24:mi:ss')
and sample_time < (select sep_time from sep_sample)
--and sample_time < (select min(sample_time) from gv$active_session_history)
group by to_char(to_date(to_char(sample_time, 'YYMMDD') ||' '|| trunc(to_char(sample_time, 'SSSSS')/10)*10, 'YYMMDD SSSSS'), 'yyyy-mm-dd hh24:mi:ss')
, decode(ash.session_state, 'ON CPU', 'ON CPU', ash.event)
)
order by start_time
|
| a16bvgvd74460 | select '"' || start_time || '" "' || event || '" ' || trunc(cnt, 4) from
(
select
to_char(to_date(to_char(sample_time, 'YYMMDD') ||' '|| trunc(to_char(sample_time, 'SSSSS')/10)*10, 'YYMMDD SSSSS'), 'yyyy-mm-dd hh24:mi:ss') start_time
, decode(ash.session_state, 'ON CPU', 'ON CPU', ash.event) event
, count(1)/10 cnt
, count(1) total
, max(sample_id)-min(sample_id)+1 samples
from
gv$active_session_history ash
where
sample_time > to_date('2019-07-17 13:44:00', 'yyyy-mm-dd hh24:mi:ss') and sample_time < to_date('2019-07-17 13:45:00', 'yyyy-mm-dd hh24:mi:ss')
and inst_id = (select instance_number from gv$instance where host_name like 'localhost%')
group by to_
char(to_date(to_char(sample_time, 'YYMMDD') ||' '|| trunc(to_char(sample_time, 'SSSSS')/10)*10, 'YYMMDD SSSSS'), 'yyyy-mm-dd hh24:mi:ss')
, decode(ash.session_state, 'ON CPU', 'ON CPU', ash.event)
union all
select
to_char(to_date(to_char(sample_time, 'YYMMDD') ||' '|| trunc(to_char(sample_time, 'SSSSS')/10)*10, 'YYMMDD SSSSS'), 'yyyy-mm-dd hh24:mi:ss') start_time
, decode(ash.session_state, 'ON CPU', 'ON CPU', ash.event) event
, count(1) cnt
, count(1) total
, (max(sample_id)-min(sample_id))/10+1 samples
from
dba_hist_active_sess_history ash
where
sample_time > to_date('2019-07-17 13:44:00', 'yyyy-mm-dd hh24:mi:ss') and sample_time < to_date('2019-07-17 13:45:00', 'yyyy-mm-dd hh24:mi:ss')
and sample_time < (select min(sample_time) from gv$active_session_history where inst_id =(select INSTANCE_NUMBER from gv$instance where host
_name like 'localhost%') )
and INSTANCE_NUMBER = (select INSTANCE_NUMBER from gv$instance where host_name like 'localhost%')
group by to_char(to_date(to_char(sample_time, 'YYMMDD') ||' '|| trunc(to_char(sample_time, 'SSSSS')/10)*10, 'YYMMDD SSSSS'), 'yyyy-mm-dd hh24:mi:ss')
, decode(ash.session_state, 'ON CPU', 'ON CPU', ash.event)
)
order by start_time
|
| a3jpjzh7mtwwp | select /*+ index(idl_ub2$ i_idl_ub21) */ piece#, length, piece from idl_ub2$ where obj#=:1 and part=:2 and version=:3 order by piece# |
| acmvv4fhdc9zh | select obj#, type#, ctime, mtime, stime, status, dataobj#, flags, oid$, spare1, spare2, spare3, signature, spare7, spare8, spare9, nvl(dflcollid, 16382), creappid, creverid, modappid, modverid, crepatchid, modpatchid from obj$ where owner#=:1 and name=:2 and namespace=:3 and remoteowner is null and linkname is null and subname is null |
| adds4wma0y8c4 | select t.obj#, t.dataobj#, t.part#, t.hiboundlen, t.hiboundval, t.ts#, t.file#, t.block#, t.pctfree$, t.pctused$, t.initrans, t.maxtrans, t.flags, t.analyzetime, t.samplesize, t.rowcnt, t.blkcnt, t.empcnt, t.avgspc, t.chncnt, t.avgrln, length(t.bhiboundval), t.bhiboundval, ts.im_imcu_count, ts.im_block_count, ts.im_sys_incarnation, ts.im_stat_update_time from tabpart$ t, tab_stats$ ts where t.bo# = :1 and t.obj# = ts.obj#(+) order by t.part# |
| afx304d90ps3z | select rowcnt, blkcnt, empcnt, avgspc, chncnt, avgrln, analyzetime, samplesize, avgspc_flb, flbcnt, flags from tab_stats$ where obj#=:1 |
| aks62v3qksxh8 | BEGIN dbms_output.put_line(dbms_workload_repository.create_snapshot(flush_level => 'TYPICAL')); END;
|
| asvzxj61dc5vs | select timestamp, flags from fixed_obj$ where obj#=:1 |
| c3zymn7x3k6wy | select obj#, dataobj#, part#, hiboundlen, hiboundval, flags, ts#, file#, block#, pctfree$, initrans, maxtrans, analyzetime, samplesize, rowcnt, blevel, leafcnt, distkey, lblkkey, dblkkey, clufac, pctthres$, length(bhiboundval), bhiboundval from indpart$ where bo# = :1 order by part# |
| dg0yzvqbxwkps | SELECT dbin.instance_number, dbin.db_name, dbin.instance_name, dbin.host_name, dbin.version, CASE WHEN s1.startup_time = s2.startup_time THEN 0 ELSE 1 END as bounce, CAST(s1.end_interval_time AS DATE) as begin_time, CAST(s2.end_interval_time AS DATE) as end_time, ROUND((cast( (case when s2.end_interval_time > s1.end_interval_time then s2.end_interval_time else s1.end_interval_time end) as date) - cast(s1.end_interval_time as date)) * 86400) as int_secs, CASE WHEN (s1.status <> 0 OR s2.status <> 0) THEN 1 ELSE 0 END as err_detect, round( greatest( (extract(day from s2.flush_elapsed) * 86400) + (extract(hour from s2.flush_elapsed) * 3600) + (extract(minute
from s2.flush_elapsed) * 60) + extract(second from s2.flush_elapsed), (extract(day from s1.flush_elapsed) * 86400) + (extract(hour from s1.flush_elapsed) * 3600) + (extract(minute from s1.flush_elapsed) * 60) + extract(second from s1.flush_elapsed), 0 )) as max_flush_secs, DECODE(dbin.cdb, 'YES', 1, 0) as is_cdb, CASE WHEN (nvl(dbin.cdb, 'NO') = 'YES' AND dbin.cdb_root_dbid IS NOT NULL AND wr.src_dbid IS NOT NULL AND dbin.cdb_root_dbid <> wr.src_dbid) THEN 1 ELSE 0 END as is_pdb, DECODE(p.val, 'DWCS', 1, 0) as is_adwh, DECODE(p.val, 'PAAS', 1, 'EECS', 1, 0) as is_aoltp, CASE WHEN nvl(dbin.database_role, 'PRIMARY') <> 'PRIMARY' THEN 1 ELSE 0 END as is_read_only FROM WRM$_SNAPSHOT s1 , WRM$_DATABASE_INSTANCE dbin , WRM$_SNAPSHOT s2 , WRM$_WR_CONTROL wr , (SELECT MAX(UPPER(pr.value)) as val FROM
WRH$_PARAMETER pr WHERE pr.dbid = :dbid AND pr.snap_id >= :bid AND pr.snap_id <= :eid AND pr.parameter_hash = (SELECT MAX(pn.parameter_hash) FROM WRH$_PARAMETER_NAME pn WHERE pn.parameter_name = '_cloud_service_type' AND pn.dbid = :dbid)) p WHERE s1.dbid = :dbid AND s2.dbid = :dbid AND s1.instance_number = s2.instance_number AND dbin.instance_number = s1.instance_number AND s1.snap_id = :bid AND s2.snap_id = :eid AND dbin.dbid = s1.dbid AND dbin.startup_time = s1.startup_time AND wr.dbid = s1.dbid and dbin.instance_number = :inst |
| dycmpuj6apqjs | select pc.intcol#, pc.col# , pc.type#, pc.spare1, pc.segcol#, pc.charsetform, nvl(c.collintcol#, 0), nvl(c2.type#, 0), nvl(c2.charsetid, 0), nvl(c2.charsetform , 0), nvl(c2.collid, 0) from partcol$ pc, col$ c, col$ c2 where pc.obj# = :1 and pc.obj# = c.obj#(+) and pc.intcol# = c.intcol#(+) and c.obj# = c2.obj#(+) and c.collintcol# = c2.intcol#(+) order by pc.pos# |
| dyycftbp20dc7 | insert into wrh$_tablespace_stat (dbid, per_pdb, con_dbid, snap_id, instance_number, ts#, tsname, contents, status, segment_space_management, extent_management, is_backup) select /*+ opt_param('_optimizer_mjc_enabled', 'false') */ :dbid, b.con_id, b.con_dbid, :snap_id, :instance_number, ts.ts#, ts.name as tsname, decode(ts.contents$, 0, (decode(bitand(ts.flags, 16), 16, 'UNDO', 'PERMANENT')), 1, 'TEMPORARY') as contents, decode(ts.online$, 1, 'ONLINE', 2, 'OFFLINE', 4, 'READ ONLY', 'UNDEFINED') as status, decode(bitand(ts.flags, 32), 32, 'AUTO', 'MANUAL') as segspace_mgmt, decode(ts.bitmapped, 0, 'DICTIONARY', 'LOCAL') as extent_management, (case when b.active_count > 0 then 'TRUE' else 'FALSE' end) as is_bac
kup FROM ( select STR1_KEWRCACHE name, NUM1_KEWRCACHE ts#, NUM2_KEWRCACHE contents$, NUM3_KEWRCACHE online$, NUM4_KEWRCACHE flags, NUM5_KEWRCACHE bitmapped, NUM6_KEWRCACHE blocksize, CON_ID con_id from X$KEWRCACHE) ts, (select bkup.con_id, con_id_to_dbid(bkup.con_id) con_dbid, dfile.ts#, sum( case when bkup.status = 'ACTIVE' then 1 else 0 end ) as active_count FROM v$backup bkup, v$datafile dfile WHERE (1 = 1) AND ((bkup.con_id = dfile.con_id)) and bkup.file# = dfile.file# and dfile.status in ('ONLINE', 'SYSTEM') group by bkup.con_id, dfile.ts#) b WHERE (1 = 1) AND ((ts.con_id = b.con_id)) and ts.online$ != 3 and b.ts# = ts.ts# and bitand(ts.flags, 2048) != 2048 |
| f7xnvp44nukp7 | insert into wrm$_snapshot_details (snap_id, dbid, instance_number, table_id, begin_time, end_time, step_id) values (:snap_id, :dbid, :instance_number, :bind1, :bind2, :bind3, :step_id) |
| g0t052az3rx44 | select name, intcol#, segcol#, type#, length, nvl(precision#, 0), decode(type#, 2, nvl(scale, -127/*MAXSB1MINAL*/), 178, scale, 179, scale, 180, scale, 181, scale, 182, scale, 183, scale, 231, scale, 0), null$, fixedstorage, nvl(deflength, 0), default$, rowid, col#, property, nvl(charsetid, 0), nvl(charsetform, 0), spare1, spare2, nvl(spare3, 0), nvl(evaledition#, 1), nvl(unusablebefore#, 0), nvl(unusablebeginning#, 0), case when (type# in (1, 8, 9, 96, 112)) then nvl(collid, 16382) else 0 end case, nvl(collintcol#, 0), nvl(acdrrescol#, 0), nvl(spare7, 0), nvl(spare9, 0), nvl(spare10, 0) from col$ where obj#=:1 order by intcol# |
| Statistic | Total | per Second | per Trans |
| ASSM cbk:blocks examined | 359 | 5.23 | 29.92 |
| ASSM cbk:blocks marked full | 77 | 1.12 | 6.42 |
| ASSM gsp:L1 bitmaps examined | 323 | 4.71 | 26.92 |
| ASSM gsp:L2 bitmap full | 4 | 0.06 | 0.33 |
| ASSM gsp:L2 bitmaps examined | 414 | 6.03 | 34.50 |
| ASSM gsp:Search all | 19 | 0.28 | 1.58 |
| ASSM gsp:Search hint | 13 | 0.19 | 1.08 |
| ASSM gsp:Search steal | 19 | 0.28 | 1.58 |
| ASSM gsp:bump HWM | 19 | 0.28 | 1.58 |
| ASSM gsp:get free block | 286 | 4.17 | 23.83 |
| ASSM gsp:good hint | 180 | 2.62 | 15.00 |
| ASSM rsv:fill reserve | 16 | 0.23 | 1.33 |
| ASSM wasted db state change | 0 | 0.00 | 0.00 |
| Batched IO (bound) vector count | 0 | 0.00 | 0.00 |
| Batched IO block miss count | 1 | 0.01 | 0.08 |
| Batched IO double miss count | 1 | 0.01 | 0.08 |
| Batched IO same unit count | 0 | 0.00 | 0.00 |
| Batched IO single block count | 1 | 0.01 | 0.08 |
| Batched IO vector block count | 0 | 0.00 | 0.00 |
| Batched IO vector read count | 0 | 0.00 | 0.00 |
| Block Cleanout Optim referenced | 3 | 0.04 | 0.25 |
| CCursor + sql area evicted | 342 | 4.98 | 28.50 |
| CPU used by this session | 465 | 6.77 | 38.75 |
| CPU used when call started | 452 | 6.58 | 37.67 |
| CR blocks created | 17 | 0.25 | 1.42 |
| Cached Commit SCN referenced | 103 | 1.50 | 8.58 |
| Client Advertised Receive Window | 56 | 0.82 | 4.67 |
| Client Advertised Send Window | 56 | 0.82 | 4.67 |
| Client Data Segments In | 121 | 1.76 | 10.08 |
| Client Data Segments Out | 137 | 2.00 | 11.42 |
| Client Path Maximum Transmission Unit(MTU) | 524,280 | 7,637.11 | 43,690.00 |
| Client Send Congestion Window | 80 | 1.17 | 6.67 |
| Client Time (usec) Busy Sending Data | 466,000 | 6,788.15 | 38,833.33 |
| Client Time (usec) Last Ack Received | 11 | 0.16 | 0.92 |
| Client Time (usec) Last Data Received | 8 | 0.12 | 0.67 |
| Client Time (usec) Last Data Sent | 2,448 | 35.66 | 204.00 |
| Client Time (usec) Round Trip Time | 38,057 | 554.37 | 3,171.42 |
| Client Time (usec) Round Trip Time Variance | 67,790 | 987.49 | 5,649.17 |
| Client Total Bytes Acked | 40,623 | 591.75 | 3,385.25 |
| Client Total Bytes Received | 37,268 | 542.88 | 3,105.67 |
| Commit SCN cached | 2 | 0.03 | 0.17 |
| DFO trees parallelized | 4 | 0.06 | 0.33 |
| DML statements retried | 3 | 0.04 | 0.25 |
| HSC Heap Segment Block Changes | 791 | 11.52 | 65.92 |
| Heap Segment Array Inserts | 127 | 1.85 | 10.58 |
| Heap Segment Array Updates | 14 | 0.20 | 1.17 |
| IMU CR rollbacks | 0 | 0.00 | 0.00 |
| IMU Flushes | 5 | 0.07 | 0.42 |
| IMU Redo allocation size | 68,060 | 991.42 | 5,671.67 |
| IMU commits | 9 | 0.13 | 0.75 |
| IMU contention | 0 | 0.00 | 0.00 |
| IMU ktichg flush | 0 | 0.00 | 0.00 |
| IMU undo allocation size | 66,832 | 973.53 | 5,569.33 |
| KTFB alloc req | 22 | 0.32 | 1.83 |
| KTFB alloc space (block) | 1,441,792 | 21,002.37 | 120,149.33 |
| KTFB alloc time (ms) | 1,246 | 18.15 | 103.83 |
| KTFB apply req | 0 | 0.00 | 0.00 |
| KTFB apply time (ms) | 0 | 0.00 | 0.00 |
| KTFB commit req | 0 | 0.00 | 0.00 |
| KTFB commit time (ms) | 0 | 0.00 | 0.00 |
| KTFB free req | 0 | 0.00 | 0.00 |
| KTFB free space (block) | 0 | 0.00 | 0.00 |
| KTFB free time (ms) | 0 | 0.00 | 0.00 |
| LOB table id lookup cache misses | 0 | 0.00 | 0.00 |
| Number of read IOs issued | 0 | 0.00 | 0.00 |
| PX local messages recv'd | 128 | 1.86 | 10.67 |
| PX local messages sent | 128 | 1.86 | 10.67 |
| Parallel operations not downgraded | 4 | 0.06 | 0.33 |
| Requests to/from client | 81 | 1.18 | 6.75 |
| SQL*Net roundtrips to/from client | 81 | 1.18 | 6.75 |
| active txn count during cleanout | 115 | 1.68 | 9.58 |
| blocks cleaned out using minact | 58 | 0.84 | 4.83 |
| branch node splits | 0 | 0.00 | 0.00 |
| buffer is not pinned count | 45,967 | 669.59 | 3,830.58 |
| buffer is pinned count | 53,854 | 784.48 | 4,487.83 |
| bytes received via SQL*Net from client | 32,797 | 477.75 | 2,733.08 |
| bytes sent via SQL*Net to client | 32,882 | 478.99 | 2,740.17 |
| calls to get snapshot scn: kcmgss | 9,851 | 143.50 | 820.92 |
| calls to kcmgas | 156 | 2.27 | 13.00 |
| calls to kcmgcs | 2,115 | 30.81 | 176.25 |
| cell physical IO interconnect bytes | 15,294,464 | 222,792.23 | 1,274,538.67 |
| change write time | 3 | 0.04 | 0.25 |
| cleanout - number of ktugct calls | 132 | 1.92 | 11.00 |
| cleanouts and rollbacks - consistent read gets | 0 | 0.00 | 0.00 |
| cleanouts only - consistent read gets | 15 | 0.22 | 1.25 |
| cluster key scan block gets | 1,886 | 27.47 | 157.17 |
| cluster key scans | 1,096 | 15.97 | 91.33 |
| commit batch/immediate performed | 0 | 0.00 | 0.00 |
| commit batch/immediate requested | 0 | 0.00 | 0.00 |
| commit cleanout failures: block lost | 0 | 0.00 | 0.00 |
| commit cleanout failures: callback failure | 7 | 0.10 | 0.58 |
| commit cleanout failures: cannot pin | 0 | 0.00 | 0.00 |
| commit cleanouts | 419 | 6.10 | 34.92 |
| commit cleanouts successfully completed | 412 | 6.00 | 34.33 |
| commit immediate performed | 0 | 0.00 | 0.00 |
| commit immediate requested | 0 | 0.00 | 0.00 |
| commit txn count during cleanout | 53 | 0.77 | 4.42 |
| consistent changes | 2 | 0.03 | 0.17 |
| consistent gets | 53,646 | 781.45 | 4,470.50 |
| consistent gets direct | 0 | 0.00 | 0.00 |
| consistent gets examination | 11,260 | 164.02 | 938.33 |
| consistent gets examination (fastpath) | 11,215 | 163.37 | 934.58 |
| consistent gets from cache | 53,646 | 781.45 | 4,470.50 |
| consistent gets pin | 42,386 | 617.43 | 3,532.17 |
| consistent gets pin (fastpath) | 41,999 | 611.79 | 3,499.92 |
| cursor authentications | 106 | 1.54 | 8.83 |
| cursor reload failures | 2 | 0.03 | 0.17 |
| data blocks consistent reads - undo records applied | 1 | 0.01 | 0.08 |
| db block changes | 9,361 | 136.36 | 780.08 |
| db block gets | 9,395 | 136.86 | 782.92 |
| db block gets direct | 0 | 0.00 | 0.00 |
| db block gets from cache | 9,395 | 136.86 | 782.92 |
| db block gets from cache (fastpath) | 6,404 | 93.29 | 533.67 |
| deferred (CURRENT) block cleanout applications | 211 | 3.07 | 17.58 |
| dirty buffers inspected | 1,209 | 17.61 | 100.75 |
| enqueue conversions | 27 | 0.39 | 2.25 |
| enqueue releases | 1,104 | 16.08 | 92.00 |
| enqueue requests | 1,104 | 16.08 | 92.00 |
| enqueue waits | 4 | 0.06 | 0.33 |
| execute count | 6,836 | 99.58 | 569.67 |
| file io service time | 268 | 3.90 | 22.33 |
| frame signature mismatch | 0 | 0.00 | 0.00 |
| free buffer inspected | 1,966 | 28.64 | 163.83 |
| free buffer requested | 1,643 | 23.93 | 136.92 |
| heap block compress | 2 | 0.03 | 0.17 |
| hot buffers moved to head of LRU | 1,968 | 28.67 | 164.00 |
| immediate (CR) block cleanout applications | 15 | 0.22 | 1.25 |
| immediate (CURRENT) block cleanout applications | 112 | 1.63 | 9.33 |
| index crx upgrade (positioned) | 0 | 0.00 | 0.00 |
| index fast full scans (full) | 3 | 0.04 | 0.25 |
| index fetch by key | 3,131 | 45.61 | 260.92 |
| index range scans | 4,698 | 68.44 | 391.50 |
| index reclamation/extension switch | 0 | 0.00 | 0.00 |
| index split cancel wait noclean | 0 | 0.00 | 0.00 |
| leaf node 90-10 splits | 0 | 0.00 | 0.00 |
| leaf node splits | 37 | 0.54 | 3.08 |
| lob reads | 0 | 0.00 | 0.00 |
| lob writes | 0 | 0.00 | 0.00 |
| lob writes unaligned | 0 | 0.00 | 0.00 |
| logical read bytes from cache | 516,431,872 | 7,522,787.98 | 43,035,989.33 |
| logons cumulative | 20 | 0.29 | 1.67 |
| messages sent | 55 | 0.80 | 4.58 |
| min active SCN optimization applied on CR | 0 | 0.00 | 0.00 |
| no buffer to keep pinned count | 0 | 0.00 | 0.00 |
| no work - consistent read gets | 39,911 | 581.38 | 3,325.92 |
| non-idle wait count | 2,217 | 32.29 | 184.75 |
| opened cursors cumulative | 6,784 | 98.82 | 565.33 |
| parse count (describe) | 12 | 0.17 | 1.00 |
| parse count (failures) | 0 | 0.00 | 0.00 |
| parse count (hard) | 451 | 6.57 | 37.58 |
| parse count (total) | 2,498 | 36.39 | 208.17 |
| parse time cpu | 208 | 3.03 | 17.33 |
| parse time elapsed | 408 | 5.94 | 34.00 |
| physical read IO requests | 429 | 6.25 | 35.75 |
| physical read bytes | 10,469,376 | 152,505.88 | 872,448.00 |
| physical read total IO requests | 711 | 10.36 | 59.25 |
| physical read total bytes | 15,040,512 | 219,092.95 | 1,253,376.00 |
| physical read total multi block requests | 20 | 0.29 | 1.67 |
| physical reads | 1,278 | 18.62 | 106.50 |
| physical reads cache | 1,278 | 18.62 | 106.50 |
| physical reads cache prefetch | 849 | 12.37 | 70.75 |
| physical reads direct | 0 | 0.00 | 0.00 |
| physical reads direct temporary tablespace | 0 | 0.00 | 0.00 |
| physical write IO requests | 26 | 0.38 | 2.17 |
| physical write bytes | 253,952 | 3,699.28 | 21,162.67 |
| physical write total IO requests | 26 | 0.38 | 2.17 |
| physical write total bytes | 253,952 | 3,699.28 | 21,162.67 |
| physical write total multi block requests | 0 | 0.00 | 0.00 |
| physical writes | 31 | 0.45 | 2.58 |
| physical writes direct | 31 | 0.45 | 2.58 |
| physical writes direct (lob) | 31 | 0.45 | 2.58 |
| physical writes direct temporary tablespace | 0 | 0.00 | 0.00 |
| physical writes non checkpoint | 31 | 0.45 | 2.58 |
| pinned buffers inspected | 0 | 0.00 | 0.00 |
| prefetched blocks aged out before use | 0 | 0.00 | 0.00 |
| process last non-idle time | 69 | 1.01 | 5.75 |
| queries parallelized | 4 | 0.06 | 0.33 |
| recursive calls | 24,479 | 356.58 | 2,039.92 |
| recursive cpu usage | 431 | 6.28 | 35.92 |
| redo entries | 4,909 | 71.51 | 409.08 |
| redo ordering marks | 1 | 0.01 | 0.08 |
| redo size | 2,533,960 | 36,911.83 | 211,163.33 |
| redo subscn max counts | 5 | 0.07 | 0.42 |
| redo synch time | 28 | 0.41 | 2.33 |
| redo synch time (usec) | 281,089 | 4,094.58 | 23,424.08 |
| redo synch time overhead (usec) | 436 | 6.35 | 36.33 |
| redo synch time overhead count ( 2ms) | 5 | 0.07 | 0.42 |
| redo synch writes | 10 | 0.15 | 0.83 |
| redo write info find | 5 | 0.07 | 0.42 |
| rollback changes - undo records applied | 0 | 0.00 | 0.00 |
| rollbacks only - consistent read gets | 1 | 0.01 | 0.08 |
| root node splits | 0 | 0.00 | 0.00 |
| rows fetched via callback | 1,535 | 22.36 | 127.92 |
| securefile allocation bytes | 253,952 | 3,699.28 | 21,162.67 |
| securefile allocation chunks | 26 | 0.38 | 2.17 |
| securefile bytes non-transformed | 269,836 | 3,930.66 | 22,486.33 |
| securefile direct write bytes | 253,952 | 3,699.28 | 21,162.67 |
| securefile direct write ops | 26 | 0.38 | 2.17 |
| securefile number of non-transformed flushes | 98 | 1.43 | 8.17 |
| segment cfs allocations | 0 | 0.00 | 0.00 |
| segment chunks allocation from dispenser | 26 | 0.38 | 2.17 |
| segment dispenser allocations | 26 | 0.38 | 2.17 |
| segment dispenser load tasks | 0 | 0.00 | 0.00 |
| segment prealloc tasks | 0 | 0.00 | 0.00 |
| segment total chunk allocation | 0 | 0.00 | 0.00 |
| session connect time | 69 | 1.01 | 5.75 |
| session cursor cache hits | 6,042 | 88.01 | 503.50 |
| session logical reads | 63,041 | 918.31 | 5,253.42 |
| shared hash latch upgrades - no wait | 160 | 2.33 | 13.33 |
| shared io pool buffer get success | 26 | 0.38 | 2.17 |
| sorts (memory) | 1,290 | 18.79 | 107.50 |
| sorts (rows) | 25,338 | 369.09 | 2,111.50 |
| sql area evicted | 364 | 5.30 | 30.33 |
| sql area purged | 2 | 0.03 | 0.17 |
| switch current caused by our pin | 36 | 0.52 | 3.00 |
| switch current to new buffer | 36 | 0.52 | 3.00 |
| table fetch by rowid | 43,930 | 639.92 | 3,660.83 |
| table fetch continued row | 92 | 1.34 | 7.67 |
| table scan blocks gotten | 4,344 | 63.28 | 362.00 |
| table scan disk non-IMC rows gotten | 248,810 | 3,624.38 | 20,734.17 |
| table scan rows gotten | 248,810 | 3,624.38 | 20,734.17 |
| table scans (direct read) | 0 | 0.00 | 0.00 |
| table scans (long tables) | 0 | 0.00 | 0.00 |
| table scans (short tables) | 554 | 8.07 | 46.17 |
| total number of cf enq holders | 0 | 0.00 | 0.00 |
| transaction rollbacks | 0 | 0.00 | 0.00 |
| undo change vector size | 802,412 | 11,688.62 | 66,867.67 |
| user calls | 182 | 2.65 | 15.17 |
| user commits | 12 | 0.17 | 1.00 |
| user logons cumulative | 8 | 0.12 | 0.67 |
| user logouts cumulative | 8 | 0.12 | 0.67 |
| user rollbacks | 0 | 0.00 | 0.00 |
| workarea executions - onepass | 0 | 0.00 | 0.00 |
| workarea executions - optimal | 952 | 13.87 | 79.33 |
| write clones created in foreground | 2 | 0.03 | 0.17 |


Stone Mason
0.0.0
(A really bad) C++ Game Engine (that you should NOT use)
Data Structure Index
_
|
a
|
c
|
d
|
f
|
g
|
l
|
m
|
n
|
s
|
t
|
u
|
v
_
ClientRepresentation
(
stms
)
GLFTFace
(
stms
)
n
v
VKInstance::ConstructionDetails
(
stms
)
GLIndexBuffer
(
stms
)
_stms_FTFace
(
stms
)
VKDevice::ConstructionDetails
(
stms
)
GLScene
(
stms
)
GLScene::Node
(
stms
)
GLVertexArray::VertexArrayImpl
(
stms
)
_stms_GLBuffer
(
stms
)
CURLHandle
(
stms
)
GLShaderModule
(
stms
)
s
GLVertexArray::VertexArrayImplOGL2
(
stms
)
_stms_SSLBase
(
stms
)
d
GLShaderProgram
(
stms
)
GLVertexArray::VertexArrayImplOGL3
(
stms
)
_stms_STMSInitializer
(
stms
)
GLTexRenderer
(
stms
)
SSLClient
(
stms
)
GLVertexArray::VertexArrayImpl::VertexBufferLayout::VertexAttribute
(
stms
)
a
ClientRepresentation::DTLSSpecific
(
stms
)
GLTexture
(
stms
)
SSLServer
(
stms
)
GLVertexArray::VertexArrayImpl::VertexBufferLayout
(
stms
)
f
GLUniform
(
stms
)
Stopwatch
(
stms
)
VKDevice
(
stms
)
ALBuffer
(
stms
)
GLVertexArray
(
stms
)
t
VKGPU
(
stms
)
ALContext
(
stms
)
FTLibrary
(
stms
)
GLVertexBuffer
(
stms
)
VKInstance
(
stms
)
ALDevice
(
stms
)
g
GLWindow
(
stms
)
ThreadPool
(
stms
)
VKWindow
(
stms
)
ALListener
(
stms
)
l
TPSTimer
(
stms
)
ALSource
(
stms
)
GenericWindow
(
stms
)
TransformInfo
(
stms
)
c
GLFrameBuffer
(
stms
)
LogRecord
(
stms
)
u
GLFTFace::GLFTChar
(
stms
)
m
Camera
(
stms
)
UUID
(
stms
)
GLScene::Mesh
(
stms
)
_
|
a
|
c
|
d
|
f
|
g
|
l
|
m
|
n
|
s
|
t
|
u
|
v
Generated on Tue Jul 28 2020 11:43:04 for Stone Mason by
1.8.17


An open community created around the Atlas of Living Australia platform.
Red Kangaroo, John Sullivan, some rights reserved (CC BY-NC) via iNaturalist.org


Born in 2018. Innovation Class can make a change in your life. We help you to find your SUPERPOWER, your PASSION, and make you more confident. Innovation Class can also open your mind, to think, think, and think.
How we can improve our self and make we better
How we can discuss about a matery and share to another
How we can manage our self to become more good
Contact me on<PHONE_NUMBER>33


In each instant, print the value of the input to the filename in the ``fileName'' state. The special names <stdout> <cout> <stderr> <cerr> may also be used.
Derived from: SRCGCStar
Version: 1.0 "January/1/1998"
Author: V. Legrand & M. Roger
| output | int |
| fileName | StringState | Output filename | " |
This star reads values from a file or standard input.
See: source code,
Scanner users
Copyright (c) 1998 Supélec & Thomson-CSF Optronique. All rights reserved.


Man from England missing after arriving in NYC for marathon found safe
by WABCNEW YORK (WABC) -- Police say a man from England who had been reported missing after traveling for the NYC Marathon has been located.
The NYPD says Christopher Ruane, from Uckfield, is safe and no longer listed as missing.
Earlier, police in England said Ruane had been in contact with his family.
Ruane was supposed to fly back to England on Nov. 4, but he didn't make the flight, police say.
Authorities had been asking for the NYPD's help.
The Sussex Police Department says he may have visited Astoria, Queens and Midtown, Manhattan.
The NYPD said Friday night that they are assisting the Sussex Police Department.


$game['gameTitle']
Published By: $game['gamePublisher'], Developed By:$game['gameDeveloper'], Genre:$game['gameGenere'], Released on: $game['gameReleaseDate']
-
- Rating:
- ,Platforms: $for platform in game['gamePlatforms']: $platform['platformTitle']
" $game['gameDescription'] "
- $game['gameArticlesPublishedRatio']%
Published - $game['gameInterestedUsersRatio']%
Interested -
$if game['totalUsersWhoScoredGame']==0: NR $else: $game['gameNetworkScale']Network Score
($game['totalUsersWhoScoredGame']) - $game['gameTotalUsersPlayedRatio']%
Played - $game['gameTotalUsersScoredRatio']%
Scored


OdbResource provides two JNDI object factory implementations and a Tomcat realm implementation for OrientDB. The object factories provide singleton instances of the OrientDB classes OServer and OPartitionedDatabasePoolFactory.
OdbResource has been tested with Tomcat versions 7.0 and 8.0


Kiss the Girls A film review by Marty Mapes Copyright 1997 Marty Mapes
** (out of 4) Forgive me for being blunt, but KISS THE GIRLS is a sexist and chauvinistic movie.
The movie introduces Detective Alex Cross, a forensic psychologist, talking down a suicide attempt (damsels rescued: 1). It also introduces us to the bad guy leaving a woman to the wolves, tied to a tree in the middle of a forest. The movie introduces us to one more person, Kate McTiernan, who is already a doctor at the age of about 24, so it appears. She specializes in brain trauma, so it's ironic that she's also a kickboxer. (Maybe it's her way of drumming up clientele.)
Turns out that Cross' niece has been abducted recently, probably by the bad guy we saw at the beginning. Cross takes a few days off from his duties in Washington D.C. to see if he can help the boys in North Carolina with his niece's case. He learns that one of the kidnapper's M.O.s is that he targets strong women.
Not too long after that, Kate is abducted by the faceless bad guy, in spite of her kickboxing ability. He puts her in a cave-like room where Kate hears several other women being held. (Nine "strong" women are no match for one man.) The kidnapper psychologically torments the women. He breaks their wills and forces them to submit. But before Kate's will is completely gone, too much luck and not enough strength allow her to escape the cave system into the surrounding wilderness. When she is finally cornered, she doesn't kick the kidnapper in the groin like she learned in class. Instead she jumps into a raging stream, taking her chances with the elements.
THIS PARAGRAPH GIVES AWAY BITS OF THE ENDING. Cross and Kate become the team that will investigate the crimes and track down the kidnapper. When it comes time to face the kidnapper, Cross singlehandedly rescues the nine "strong" women (damsels rescued: 10). But the movie has a coda. The bad guy slipped away and at the end, Kate will face her captor one last time. "Strong" kickboxing Kate will face a stabbed, lacerated bad guy and still require another man to rescue her (damsels rescued: 11! Hooray for the men! Our women are safe!)
To be fair, I didn't hate this movie. It was no worse than many mainstream films. There was even a scene or two that made me jump in surprise. But the movie was so careless that I couldn't forgive it.
For example, Cross is a forensic psychologist, but he knows more about a drug that the kidnapper uses than our medical doctor (she is only a woman, though).
Also, Cross made some major mistakes in dealing with his psychologically abused victims. The kidnapper spoke to them without revealing his face. His was a calm, faceless voice. When Kate is rescued, one of the first things Cross does is approach her from behind in a calm reassuring voice, just like the kidnapper did. Another victim was forced to play her violin for her kidnapper. After her rescue, cross gives her a new violin. Just what a traumatized victim needs: a little reminder of her torture.
Finally, in Cross' raid on the kidnapper's hideout, he says that logic dictates there should be no FBI involvement. He never explains why this is so, and he was probably wrong. But then he couldn't be the knight in shining armor, could he?
In addition, the filmmaking was uneven. The movie did have a good "look" to it, but it was often disrupted by a single bad element. For example, the cave-rooms where the women were held looked like they were recycled from the original Star Trek TV series. And there were times when the sound editing was clunky and unsubtle.
I suppose this movie could have earned a lower rating, but somehow, all these flaws didn't congeal until after the movie was over, so the experience itself wasn't that bad. Still, that's hardly a reason to see this movie.
Check out more current movie reviews at http://www.indra.com/~mmapes/
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


Parallel implementations of the ntw_math.h functions. More...
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <omp.h>
Go to the source code of this file.
Macros | |
| #define | NTWMP_DOUBLE_PRES 1e-30 |
| Difference for two double vars to be safely considered equal. | |
Functions | |
| void | NTWMP_multDV (const uint32_t n, double vector[static n], const double c) |
| Does the multiplication: \(\vec{V} = c\vec{V}\). More... | |
| void | NTWMP_addDV (const uint32_t n, double vectorA[static n], const double vectorB[static n]) |
| Does the addition: \(\vec{A} = \vec{A}+\vec{B}\). More... | |
| void | NTWMP_subDV (const uint32_t n, double vectorA[static n], const double vectorB[static n]) |
| Does the substitution: \(\vec{A} = \vec{A}-\vec{B}\). More... | |
| double | NTWMP_dotDV (const uint32_t n, const double vectorA[static n], const double vectorB[static n]) |
| Calculates the dot product of vectorA and vectorB. More... | |
| double | NTWMP_sqMagnDV (const uint32_t n, const double vector[static n]) |
| Returns the squered magnitude of the vector. More... | |
| void | NTWMP_normalizeDV (const uint32_t n, double vector[static n]) |
| Normalizes the vector. More... | |
| void | NTWMP_normalizeSumDV (const uint32_t n, double vector[static n]) |
| Normalizes the vector so that its elements sum to 1. More... | |
| void | NTWMP_assignDV (const uint32_t n, double vectorA[static n], const double vectorB[static n]) |
| Assign the values of vectorB to vectorA \[\vec{A} = \vec{B}\] . More... | |
| double * | NTWMP_newUniVectorD (const uint32_t n, const double value) |
| Creates a n legth vector with all elements set to value. More... | |
| double * | NTWMP_newCopyDV (const uint32_t n, const double vector[static n]) |
| Create a copy/subcopy of the vector. More... | |
Parallel implementations of the ntw_math.h functions.
Definition in file ntw_mathp.h.
| void NTWMP_addDV | ( | const uint32_t | n, |
| double | vectorA[static n], | ||
| const double | vectorB[static n] | ||
| ) |
Does the addition: \(\vec{A} = \vec{A}+\vec{B}\).
| n | The size of the vectors. If less only the first n elements will be added. |
| vectorA | The vector \(\vec{A}\). |
| vectorB | The vector \(\vec{B}\). |
Definition at line 20 of file ntw_mathp.c.
| void NTWMP_assignDV | ( | const uint32_t | n, |
| double | vectorA[static n], | ||
| const double | vectorB[static n] | ||
| ) |
Assign the values of vectorB to vectorA
\[\vec{A} = \vec{B}\]
.
| n | The size of the two vectors. |
| vectorA | The \(\vec{A}\). |
| vectorB | The \(\vec{B}\). |
Definition at line 105 of file ntw_mathp.c.
| double NTWMP_dotDV | ( | const uint32_t | n, |
| const double | vectorA[static n], | ||
| const double | vectorB[static n] | ||
| ) |
Calculates the dot product of vectorA and vectorB.
If n is less than the actual size of the vectors the dot product will be calculated as if the vectors where reduced to their first n elements.
| n | The size of the arrays. |
| vectorA | The vector \(\vec{A}\) |
| vectorB | The vector \(\vec{B}\) |
Definition at line 38 of file ntw_mathp.c.
| void NTWMP_multDV | ( | const uint32_t | n, |
| double | vector[static n], | ||
| const double | c | ||
| ) |
Does the multiplication: \(\vec{V} = c\vec{V}\).
Doesn't allocate memory.
| n | The size of the vector. If less only the first n elements will be multiplied. |
| vector | The vector \(\vec{V}\), must be at least n elements long. |
| c | The constant \(c\). |
Definition at line 11 of file ntw_mathp.c.
| double* NTWMP_newCopyDV | ( | const uint32_t | n, |
| const double | vector[static n] | ||
| ) |
Create a copy/subcopy of the vector.
Allocates memory that should be freed later.
| n | The size of the copied vector; |
| vector |
Definition at line 131 of file ntw_mathp.c.
| double* NTWMP_newUniVectorD | ( | const uint32_t | n, |
| const double | value | ||
| ) |
Creates a n legth vector with all elements set to value.
Allocates memory that should be freed later.
| n | The size \(n\) of the vector. |
| value | The value \(v\) of each element. |
Definition at line 114 of file ntw_mathp.c.
| void NTWMP_normalizeDV | ( | const uint32_t | n, |
| double | vector[static n] | ||
| ) |
Normalizes the vector.
| n | The size of the vector. |
| vector |
Definition at line 60 of file ntw_mathp.c.
| void NTWMP_normalizeSumDV | ( | const uint32_t | n, |
| double | vector[static n] | ||
| ) |
Normalizes the vector so that its elements sum to 1.
| n | The size of the vector. |
| vector |
Definition at line 83 of file ntw_mathp.c.
| double NTWMP_sqMagnDV | ( | const uint32_t | n, |
| const double | vector[static n] | ||
| ) |
Returns the squered magnitude of the vector.
| n | The size of the vector. |
| vector | The vector \(\vec{V}\) |
Definition at line 49 of file ntw_mathp.c.
| void NTWMP_subDV | ( | const uint32_t | n, |
| double | vectorA[static n], | ||
| const double | vectorB[static n] | ||
| ) |
Does the substitution: \(\vec{A} = \vec{A}-\vec{B}\).
| n | The size of the vectors. If less only the first n elements will be substituded. |
| vectorA | The vector \(\vec{A}\). |
| vectorB | The vector \(\vec{B}\). |
Definition at line 29 of file ntw_mathp.c.


DefaultEventAnalyticsController |
class DefaultEventAnalyticsController : EventAnalyticsController |
DefaultMeetingStatsCollector |
class DefaultMeetingStatsCollector : MeetingStatsCollector |
EventAnalyticsController |
EventAnalyticsController keeps track of events and notifies EventAnalyticsObserver. An event describes the success and failure conditions for the meeting session. interface EventAnalyticsController |
EventAnalyticsFacade |
EventAnalyticsFacade allows builders to listen to meeting analytics events through adding/removing EventAnalyticsObserver. interface EventAnalyticsFacade |
EventAnalyticsObserver |
EventAnalyticsObserver handles events regarding to analytics. interface EventAnalyticsObserver |
EventAttributeName |
enum class EventAttributeName |
EventAttributes |
EventAttributes describes meeting event. typealias EventAttributes = MutableMap<EventAttributeName, Any> |
EventName |
EventName represent sdk event that could help builders to analyze the data. enum class EventName |
MeetingHistoryEvent |
data class MeetingHistoryEvent |
MeetingHistoryEventName |
MeetingHistoryEventName is a notable event (such as MeetingStartSucceeded) that occur during meeting. Thus, this also includes events in EventName. enum class MeetingHistoryEventName |
MeetingStatsCollector |
interface MeetingStatsCollector |
kotlin.collections.MutableMap |


--- layout: example categories: example/v1.0.0 version: v1.0.0 title: Add styles made with Mapbox Studio using styleLayer description: Display a style created in Mapbox Studio tags: - layers ---


Email: {{email}}
Address: {{address.street}}, {{address.city}}, {{address.state}}
Hobbies
{{post.name}}


- 10+ public projects, including open-source contributions and personal projects ranging from websites to automation utilities to customized dotfiles
- Public website for DynamX Consulting, utilizing modern technologies including HTML5, CSS3, and d3.js
- Automation for Drupal updating and deployment to shared hosting via FTP
- Issues and pull request for popular open source software including Github's own linguist and Python testing framework nose, among others


A helper class encapsulating the data needed to perform an indirect draw call in OpenGL.
More...
#include <IndirectDraw.h>
|
| | IndirectDraw () noexcept |
| | Default Constructor. More...
|
| |
| | IndirectDraw (const GLuint &count, const GLuint &primitiveCount, const GLuint &first, const GLbitfield &storageFlags=GL_DYNAMIC_STORAGE_BIT) noexcept |
| | Construct an Indirect Draw Object. More...
|
| |
| void | bind () noexcept |
| | Bind this draw call to the OpenGL indirect buffer target. More...
|
| |
| void | drawCall (const void *indirect=nullptr) noexcept |
| | Bind this buffer and also perform an indirect draw call. More...
|
| |
| void | beginWriting () const noexcept |
| | Prepare this buffer for writing, waiting on its sync fence. More...
|
| |
| void | endWriting () const noexcept |
| | Signal that this buffer has finished being written to. More...
|
| |
| void | endReading () noexcept |
| | Signal that this buffer has finished being read from. More...
|
| |
| void | setCount (const GLuint &count) noexcept |
| | Specify how many vertices will be rendered. More...
|
| |
| void | setPrimitiveCount (const GLuint &primitiveCount) noexcept |
| | Specify how many primitives will be rendered. More...
|
| |
| void | setFirst (const GLuint &first) noexcept |
| | Specify the offset to the first vertex to be rendered. More...
|
| |
template<int BufferCount = 3>
class IndirectDraw< BufferCount >
A helper class encapsulating the data needed to perform an indirect draw call in OpenGL.
◆ IndirectDraw() [1/2]
template<int BufferCount = 3>
◆ IndirectDraw() [2/2]
template<int BufferCount = 3>
| IndirectDraw< BufferCount >::IndirectDraw |
( |
const GLuint & |
count, |
|
|
const GLuint & |
primitiveCount, |
|
|
const GLuint & |
first, |
|
|
const GLbitfield & |
storageFlags = GL_DYNAMIC_STORAGE_BIT |
|
) |
| |
|
inlinenoexcept |
Construct an Indirect Draw Object.
- Parameters
-
| count | the number of vertices to draw. |
| primitiveCount | the number of times to draw this object. |
| first | offset to the first vertex. |
| storageFlags | storage type flag. |
◆ beginWriting()
template<int BufferCount = 3>
Prepare this buffer for writing, waiting on its sync fence.
◆ bind()
template<int BufferCount = 3>
Bind this draw call to the OpenGL indirect buffer target.
◆ drawCall()
template<int BufferCount = 3>
| void IndirectDraw< BufferCount >::drawCall |
( |
const void * |
indirect = nullptr | ) |
|
|
inlinenoexcept |
Bind this buffer and also perform an indirect draw call.
- Parameters
-
| indirect | an indirect pointer. |
◆ endReading()
template<int BufferCount = 3>
Signal that this buffer has finished being read from.
◆ endWriting()
template<int BufferCount = 3>
Signal that this buffer has finished being written to.
◆ setCount()
template<int BufferCount = 3>
| void IndirectDraw< BufferCount >::setCount |
( |
const GLuint & |
count | ) |
|
|
inlinenoexcept |
Specify how many vertices will be rendered.
- Parameters
-
◆ setFirst()
template<int BufferCount = 3>
| void IndirectDraw< BufferCount >::setFirst |
( |
const GLuint & |
first | ) |
|
|
inlinenoexcept |
Specify the offset to the first vertex to be rendered.
- Parameters
-
| first | the offset to the first rendered vertex. |
◆ setPrimitiveCount()
template<int BufferCount = 3>
| void IndirectDraw< BufferCount >::setPrimitiveCount |
( |
const GLuint & |
primitiveCount | ) |
|
|
inlinenoexcept |
Specify how many primitives will be rendered.
- Parameters
-
| primitiveCount | the number of primitives to be rendered. |
The documentation for this class was generated from the following file: