| Name | Total Lines | Lines of Code | Total Coverage | Code Coverage |
|---|---|---|---|---|
| /home/cgb/.rvm/gems/ruby-1.8.7-head/gems/flexmock-0.9.0/lib/flexmock/expectation_director.rb | 87 | 47 | 89.66%
|
80.85%
|
Code reported as executed by Ruby looks like this...and this: this line is also marked as covered.Lines considered as run by rcov, but not reported by Ruby, look like this,and this: these lines were inferred by rcov (using simple heuristics).Finally, here's a line marked as not executed.
1 #!/usr/bin/env ruby |
2 |
3 #--- |
4 # Copyright 2003-2011 by Jim Weirich (jim@weirichhouse.org). |
5 # All rights reserved. |
6 |
7 # Permission is granted for use, copying, modification, distribution, |
8 # and distribution of modified versions of this work as long as the |
9 # above copyright notice is included. |
10 #+++ |
11 |
12 require 'flexmock/noop' |
13 require 'flexmock/errors' |
14 |
15 class FlexMock |
16 #################################################################### |
17 # The expectation director is responsible for routing calls to the |
18 # correct expectations for a given argument list. |
19 # |
20 class ExpectationDirector |
21 |
22 # Create an ExpectationDirector for a mock object. |
23 def initialize(sym) |
24 @sym = sym |
25 @expectations = [] |
26 @defaults = [] |
27 @expected_order = nil |
28 end |
29 |
30 # Invoke the expectations for a given set of arguments. |
31 # |
32 # First, look for an expectation that matches the arguments and |
33 # is eligible to be called. Failing that, look for a expectation |
34 # that matches the arguments (at this point it will be ineligible, |
35 # but at least we will get a good failure message). Finally, |
36 # check for expectations that don't have any argument matching |
37 # criteria. |
38 def call(*args) |
39 exp = find_expectation(*args) |
40 FlexMock.check("no matching handler found for " + |
41 FlexMock.format_args(@sym, args)) { ! exp.nil? } |
42 exp.verify_call(*args) |
43 end |
44 |
45 # Append an expectation to this director. |
46 def <<(expectation) |
47 @expectations << expectation |
48 end |
49 |
50 # Find an expectation matching the given arguments. |
51 def find_expectation(*args) # :nodoc: |
52 if @expectations.empty? |
53 find_expectation_in(@defaults, *args) |
54 else |
55 find_expectation_in(@expectations, *args) |
56 end |
57 end |
58 |
59 # Do the post test verification for this director. Check all the |
60 # expectations. Only check the default expecatations if there are |
61 # no non-default expectations. |
62 def flexmock_verify # :nodoc: |
63 (@expectations.empty? ? @defaults : @expectations).each do |exp| |
64 exp.flexmock_verify |
65 end |
66 end |
67 |
68 # Move the last defined expectation a default. |
69 def defaultify_expectation(exp) # :nodoc: |
70 last_exp = @expectations.last |
71 if last_exp != exp |
72 fail UsageError, |
73 "Cannot make a previously defined expection into a default" |
74 end |
75 @expectations.pop |
76 @defaults << exp |
77 end |
78 |
79 private |
80 |
81 def find_expectation_in(expectations, *args) |
82 expectations.find { |e| e.match_args(args) && e.eligible? } || |
83 expectations.find { |e| e.match_args(args) } |
84 end |
85 end |
86 |
87 end |
Generated on Wed May 16 23:29:48 -0700 2012 with rcov 1.0.0


{% extends "page.html" %} {% block title %}Welcome to Common Repository{% endblock %} {% block content %}
Common Repository provides a free repostitory service for ELOs.
To get start, please Log in or Sign up


In this project, you're going to create a dueling game using HTML Canvas.
1. Add a canvas element to your page, and make JavaScript variables for it and its 2D context.
2. Create a constructor function for 'playerSprite' objects, giving them all of the necessary information (x, y, width, height, etc.). Create an array that all of these objects get pushed to.
3. Create two of these 'playerSprite' objects, and have them be drawn to the canvas to test them.
4. Create a function that will be looped many times a second (try 30) that will draw all of the 'playerSprite' objects to the canvas.
5. Make your playerSprites move whenever a selected key is pressed. (The real challenge here is getting the game to react to multiple keys simultaneously.)
6. (Part 1) Make an array that will keep track of all of the keys that are currently pressed.
6. (Part 2) Make it so that when a key is pressed, its keyCode is used to set the value at that index of your array to true. For instance, the keyCode of the left arrow key is 37, so when you press the left arrow key, the value at index 37 in your array should become true.
6. (Part 3) Make it so that when a key is released, its keycode is used to set the value at that index of your array to false.
6. (Part 4) Make a function that will cause different things to happen dependent upon which values in that array are true. Call this function in the looping function.
7. Make your characters constantly fall until they hit the ground.
8. Make your characters jump when a specific key is pressed, but only if they aren't currently in the air.
9. Create another constructor function for 'attackSprite' objects. These objects will be representative of your players' attacks. Give them all of the necessary information. Create an array that all of these objects get pushed to.
10. Create two of these 'attackSprite' variables and have them be drawn to the canvas to test them.
11. Make your attacks be drawn by the looping function, but only for a while after a specific button has been clicked. They should also show up at the right point in relation to their respective player.
12. Create a function to detect if two rectangles are colliding. (It should work for both the Attacks and the Players.)
13. Make your looping function detect if an Attack is colliding with a Player, and if so, stop the loop and tell the player they have won.
Additional Challenges: Make your characters accelerate instead of moving at a constant speed, and make the characters get knocked away from each other if their attacks collide.


This document provides style guidance for branded content from, for and about Code for New Orleans, a brigade of Code for America.
Colors
The color palette for the Code for New Orleans brand is taken from the City of New Orleans flag, with accent colors added.
#D72A00
#11194E
#EEB500
#E8E5E1
#D1FCFF
Typography
Typography on Code for New Orleans materials uses two OFL-licensed fonts: Inconsolata for headers and wordmarks, and Open Sans for other text content.
Code for New Orleans
Wordmark
The "Code for New Orleans" wordmark is set in Inconsolata in the brand dark blue.
Header 1
Red 54px Bold
Header 2
Blue 40px + Border
Header 3
Blue 36px
Header 4
Blue 32px
Header 5
Blue 28px Underlined
Header 6
Blue 24px Underlined
Headers
Headers are set in Inconsolata in descending sizes.
The Level 1 header is set in brand red in bold.
The Level 2 header is set with a 1 pixel wide bottom border in brand gold that spans the width of the text area.
All other headers are set in brand dark blue.
Level 5 and level 6 headers are underlined.
Body Text
20px Black
Body Text
Body text is set in Open Sans, 20 pixels size, in black.
Pull Quote
28px Blue, Highlight Background
Pull Quotes or Highlights
Pull quotes or highlights are set in Open Sans, 28 pixels size, in brand dark blue.
They are set on a brand highlight sky blue background with at least 20 pixels padding on every side.Logo, Display & Variants
The logo of Code for New Orleans is modeled after a self-closing HTML tag with the "tag name" as the iconic three golden fleur-de-lis symbols found in the New Orleans city flag. Below the symbol, the wordmark "Code for New Orleans" is set in Inconsolata, an OFL-licensed font.
The logo should be displayed on a white background with at least 1 em (the height of the "M" character) of space surrounding it on all sides.
The wordmark may be altered to read "an initiative of Code for New Orleans", set on two lines so that the "Code for New Orleans" wordmark is on its own line.
The wordmark may be altered to read "a project of Code for New Orleans", set on two lines so that the "Code for New Orleans" wordmark is on its own line.


Server Configuration
All server configuration are done by modifying settings.js
.
Here is the default content:
module.exports = {
mailgun_api_key: "key-xxxxxxxxxxxxxxxxxxxxxxxxxxxx",
mail_domain: "mail.example.com",
slack_bot_key: "xoxb-xxxxxxxxxxxxxxxx-xxxxxxxxxxxxxxx",
app_port: 3000,
agents:[
{
name:"slack username",
id:false // Keep this false, will autoload upon start
}
],
// Which channel will unassigned chat be posted
channel:{
name:"your channel name",
id:false // Keep this false
},
online_notification: false
}
mailgun_api_key (required)
Your MailGun API key, should be in the format of key-xxxxxxxxxxxxxxxxxxxxxxxxxxxx
.
mail_domain (required)
The domain you wish to send email with, must be registered with MailGun.
slack_bot_key (required)
Slack bot API key.
app_port (required)
The port you wish to run on. Default 3000
.
agents[] (required)
Registered agents. Each agent has two properties, name
and id
, leave the id
field false
.
channel (required)
The channel bot will post on if no assigned agent is found.
online_notification (optional)
true
if you wish all agents to recieve a notification when the bot goes online. Default false
.


I think volumetric graphics engines are very
interesting, and I'm excited to see how they can be
used in the future in game development as well as other
areas.
Original source
Backend Development
The way that data interacts to form a solution to
a problem is really interesting and intuitive for me.
I enjoy working with MySQL and frameworks like Rails
to develop clean, innovative solutions for the web.
Original source
Fractal Mathematics
I love how fractals are an infusion of art and
mathematics and how tweaking algorithms and inputs
can yield wildly different results to explore and
discover.
Original source
Machine Learning
As we move into the 21st century we are making computers
capable of doing extremely complex tasks. Machine
learning is at the forefront of ambitious new
approaches and solutions to complex problems.
I find the notion that most AAA video game studios
continue to build huge worlds (mostly) by hand
absolutely amazing, and somewhat ridiculous. I'm
looking forward to the rise of procedural generation
in the industry.
Many of the things we do are repetitive and redundant.
Automation through simple scripts or fully-featured GUI
applications inspires me, and has driven me to build
many solutions.
Source: Unknown
Recent Projects
{% for project in site.categories.projects | limit: 3 %}


Beta This part of GOV.UK is being rebuilt – find out what this means
How maintained schools can apply to convert to academy status.
If you are the headteacher or chair of governors of a maintained school converting to an academy, you must complete the following steps.
- 1. Before you apply How to prepare for your school's application to convert to an academy.
- 2. Apply to convert What to provide in your academy conversion application form, and information about notifying your local authority.
- 3. Prepare for conversion What actions you should take while DfE assesses your academy conversion application.
- 4. Transfer responsibilities to the academy trust What responsibilities you should transfer to your academy trust as part of your school's conversion to academy status.
- 5. Prepare to reopen as an academy What final preparations you should complete before your school can reopen as an academy.
- 6. Reopen as an academy What actions you should take in the first few months after your school reopens as an academy.


Dashboard
Bike List
Map
Tech Stack
Visually showing density of parked bikes
24 Hours performance
Bike Filter Options
History of {Selected} bike
Backend development


Examples of tables you can use to display data
| Material | Quantity | Unit price |
|---|---|---|
| Acrylic (Transparent) | 25 | $2.90 |
| Plywood (Birch) | 50 | $1.25 |
| Laminate (Gold on Blue) | 10 | $2.35 |
| Acrylic (Transparent) | 25 | $2.90 |
| Plywood (Birch) | 50 | $1.25 |
| Material | Quantity | Unit price |
|---|---|---|
| Acrylic (Transparent) | 25 | $2.90 |
| Plywood (Birch) | 50 | $1.25 |
| Laminate (Gold on Blue) | 10 | $2.35 |
| Acrylic (Transparent) | 25 | $2.90 |
| Plywood (Birch) | 50 | $1.25 |
| Material | Quantity | Unit price |
|---|---|---|
| Acrylic (Transparent) | 25 | $2.90 |
| Plywood (Birch) | 50 | $1.25 |
| Laminate (Gold on Blue) | 10 | $2.35 |
| Acrylic (Transparent) | 25 | $2.90 |
| Plywood (Birch) | 50 | $1.25 |
| Material | Quantity | Unit price |
|---|---|---|
| Acrylic (Transparent) | 25 | $2.90 |
| Plywood (Birch) | 50 | $1.25 |
| Laminate (Gold on Blue) | 10 | $2.35 |
| Acrylic (Transparent) | 25 | $2.90 |
| Plywood (Birch) | 50 | $1.25 |


Functions are first-class values
Can be treated as any other data
You can make a pair of functions
QUIZ
What is the type of funPair
?
plus1 :: Int -> Int
plus1 x = x + 1
minus1 :: Int -> Int
minus1 x = x - 1
funPair :: ???
funPair = (plus1, minus1)
A. Int -> Int
B. (Int, Int) -> Int
C. Int -> (Int, Int)
D. (Int, Int) -> (Int, Int)
E. (Int -> Int, Int-> Int)
QUIZ
Or you can make lists of functions:
What is the type of funList
?
plus1 :: Int -> Int
plus1 x = x + 1
minus1 :: Int -> Int
minus1 x = x - 1
funList :: ???
funList = [plus1, minus1]
A. Int -> Int
B. [Int -> Int]
C. [Int] -> Int
D. Int -> [Int]
E. [Int] -> [Int]
Functions are data
So we can write higher-order functions
- Functions that take other functions as input
- Functions that return other functions as output
Using Functions as Input
For example consider
The function doTwice
- takes two inputs : a function
f
and valuex
, - returns the result of
f (f x)
Note: how the code is clearer to understand than English…
Btw, which λ-calculus term does this remind you of?
Lets Run doTwice
REMINDER: Execution model is substitute equals for equals
doTwice plus1 10
-- definition of doTwice
==> plus1 (plus1 10)
-- definition of plus1
==> plus1 (10 + 1)
-- definition of plus1
==> (10 + 1) + 1
-- arithmetic
==> 12
Functions as Output
Instead of separate plus1
, plus2
, plus3
etc. lets write
So plus n
returns \x -> x + n
. Lets use it!
Lets run it!
plus10 100
-- definition of plus10
==> (plus 10) 110
-- definition of plus
==> (\x -> x + 10) 100
-- "beta-step"
==> 100 + 10
-- arithmetic
==> 110
QUIZ
What is the value of quiz
?
A. Error
B. \x -> x + 100
C. \x -> x + 25
D. 125
E. 110
QUIZ: Partial Application
Recall that in Haskell the following mean the same thing
So you can pass zero inputs
What is the type of zeroIn
, oneIn
and twoIn
?
A. Int
B. Int -> Int
C. Int -> Int -> Int
QUIZ
What is the value of quiz
?
A. Type Error
B. 0
C. 10
D. 20
E. 30
Lets Run It!
So (do in class)
Polymorphism
We used to doTwice
to repeat an arithmetic operation
but doTwice
works for types other than than Int
too
>>> doTwice f x = f (f x)
>>> sayYum s = s ++ " yum! yum!"
>>> sayYum "ice cream"
"ice cream yum! yum!"
>>> doTwice sayYum "ice cream"
"ice cream yum! yum! yum! yum!"
doTwice
is polymorphic i.e. works with
- many kinds of values
- e.g. functions adding
Int
- e.g. functions that concatenate
String
QUIZ
What is the value of quiz
?
A. True
B. False
C. Type Error
D. Run-time Exception
E. 101
With great power, comes great responsibility!
>>> doTwice (greaterThan 10) 0
36:9: Couldn't match type ‘Bool’ with ‘Int’
Expected type: Int -> Int
Actual type: Int -> Bool
In the first argument of ‘doTwice’, namely ‘greaterThan 10’
In the expression: doTwice (greaterThan 10) 0
The input and output types are different!
Cannot feed the output of (greaterThan 10 0)
into greaterThan 10
!
Polymorphic Types
But the type of doTwice
would have spared us this grief.
The signature has a type parameter t
re-use
doTwice
to incrementInt
or concatString
or …The first argument
f
must take inputt
and return outputt
(i.e.t -> t
)The second argument
x
must be of typet
Then
f x
will also have typet
… and we can callf (f x)
.
But f
unction is incompatible with doTwice
- if its input and output types differ
QUIZ
Lets make sure you’re following!
What is the type of quiz
?
A. a -> a
B. (a -> a) -> a
C. a -> b -> a -> b
D. a -> (a -> b) -> b
E. a -> b -> a
QUIZ
Lets make sure you’re following!
What is the value of quiz
?
apply x f = f x
greaterThan :: Int -> Int -> Bool
greaterThan x y = x > y
quiz = apply 100 (greaterThan 10)
A. Type Error
B. Run-time Exception
C. True
D. False
E. 110


The first school days were in Kehra Gymnasium for 9 years. After 9 class I went to Tallinn Polytechnic.
In Tallinn Polytechnic I studied for Junior Software Developer, where I learned how to do websites, programms and apps for mobiles. The languages and technologies HTML, CSS, JS, Bootstrap, PHP, SQL, C# were learned here.
For now I study for Logistics IT Systems Specialist.
I love to learn new technologies. Next to, you can see some of those technologies that I have learned at my software developer path.


Power
Timer
Sync
Peek
Info
Nodes
Config
PC Mode
Brightness
Color palette
Effect mode
Transition: s
Presets
Colors
Effects
Segments


Methods
(inner) timeSpan(inHours, inMinutes, inSeconds, inMilliseconds, inDurationMins, inDurationSecsopt, inDurationMSecsopt) → {object}
Functional constructor which creates an instance of a TimeSpan.
Do not use with the 'new' operator.
Each TimeSpan object is immutable. The inclusive end time of a timespan
cannot exceed 23:59:59:999 i.e. the exclusive end time cannot exceed
12 midnight (00:00:00:000 of the following day).
The total duration of a timespan is equal to:
inDurationMins + inDurationSecs + inDurationMSecs
Parameters:
| Name | Type | Attributes | Default | Description |
|---|---|---|---|---|
inHours |
number | Integer. Represents the 'hour of day' component of the start time of the timespan. Valid values are 0-23. An error is thrown if the integer is not specified or is not within the valid range. | ||
inMinutes |
number | Integer. Represents the minutes component of the start time of the timespan. Valid values are 0-59. An error is thrown if the integer is not specified or is not within the valid range. | ||
inSeconds |
number | Integer. Represents the seconds component of the start time of the timespan. Valid values are 0-59. An error is thrown if the integer is not specified or is not within the valid range. | ||
inMilliseconds |
number | Integer. Represents the milliseconds component of the start time of the timespan. Valid values are 0-999. An error is thrown if the integer is not specified or is not within the valid range. | ||
inDurationMins |
number | Positive integer representing the duration of the timespan in [minutes]. An error is thrown if this argument is not specified or it is not a valid, positive integer. Valid range is 0-1440. | ||
inDurationSecs |
number |
<optional> |
0 | Positive integer representing the [seconds] component of the duration. An error is thrown if this argument is not specified or it is not a valid, positive integer. Valid range is 0-59. |
inDurationMSecs |
number |
<optional> |
0 | Positive integer representing the [milliseconds] component of the duration. An error is thrown if this argument is not specified or it is not a valid, positive integer. Valid range is 0-999. |
- Source:
Returns:
A new instance of the TimeSpan object.
- Type
- object


YoungBoy Never Broke Again’s Mother Claims He Kicked Her Out of the House He Bought Her
by Trent FitzgeraldIt looks like there's some serious drama going on in YoungBoy Never Broke Again's family.
During an Instagram Live session that surfaced online on Monday (Nov. 18), YoungBoy’s mother, Sherhonda, claimed the rapper kicked her out of the house he bought for her. Apparently, the two had a heated argument, which led to YoungBoy’s mother being thrown out of the home.
“I’m not finna to let you play with me,” she said.
 I’ll sleep under the interstate.
 At the time, Blue kicked his mother, Karlissa, and his sister, Kali, out of his California home while on IG Live. In the video, Blueface and Kali are engaged in a verbal argument while their mother records it. After bickering for a few minutes, Blueface then picks up his mother's clothes and throws them out the door. Afterward, the "Thotiana" rapper called his mother a clout-chaser.
Hopefully, YoungBoy, who just dropped his new project AI Youngboy 2, can work things out his mother.
XXL has reached out to YoungBoy's camp for comment.

These 12 Iconic Hip-Hop Albums Were Nearly Named Differently
6 Feet Deep, Gravediggaz
Original title: Niggamortis
Known as its original title of Niggamortis overseas, Gravediggaz’s debut album got a tamer title for the U.S. consumer.
Cypress Hill, Cypress Hill
Original title: America’s Most Blunted
The original title was more fitting, however, Cypress Hill decided to go the eponymous route.
De La Soul Is Dead, De La Soul
Original title: We Fell Into a Plastic Bottle of Shwingalokate, So We Opened a Radio Station
For the sake of marketing, it’s probably a good idea De La decided to considerably shorten the title of the group's sophomore LP.
It Takes a Nation of Millions to Hold Us Back, Public Enemy
Original title: Countdown to Armageddon
Recorded under a more apocalyptic name, P.E. eventually decided upon a more militant title for the classic sophomore album.
License to Ill, Beastie Boys
Original title: Don’t Be a Faggot
The Beastie Boys' first iteration of the title for their 1986 debut album was a no-no and ultimately shut down by labels execs.
No Way Out, Puff Daddy & The Family
Original title: Hell Up in Harlem
Puff wanted his Uptown roots to be spelled out on his debut album but opted for something different in the wake of The Notorious B.I.G.’s death.
Only Built 4 Cuban Linx..., Raekwon
Original title: Only Built 4 Cuban Linx Niggaz
Raekwon’s debut album originally had a less market-friendly title, which had to be nixed at the 11th hour.
Reasonable-Doubt, Jay-Z
Original title: Heir to the Throne
There’s no doubt Hov clearly had his eye on the crown when he initially named his debut album Heir to the Throne before switching it up to Reasonable Doubt.
The Marshall Mathers LP, Eminem
Original title: Amsterdam
Following a trip to the Red Light District, Shady considered naming his sophomore major label album after one of the world’s most debaucherous cities.
To Pimp a Butterflly, Kendrick Lamar
Original title: Tu Pimp a Caterpillar
Kendrick Lamar’s sophomore major label album has heavy Tupac influences and was once titled Tu Pimp a Caterpillar, a backronym for Tupac.
Untitled, Nas
Original title: Nigger
The N-word was a little too controversial for Nas’ ninth studio album, so Esco begrudgingly dialed it back, opting for no title.
Views, Drake
Original title: Views From the 6
Drizzy’s fourth solo album originally had a slightly longer name (that nodded to his hometown) but, in the end, he stuck with a one-word title.


WSDOT Collision Predictions
25 Jul 2019To better understand accidents in the Northwest, I processed the WSDOT’s data on serious to fatal accidents. Specifically, I processed the WSDOT reported collisions and mapped them to the nearest intersections, ranked, color-coded our 500 top dangerous intersections and displayed them on a heatmap by the frequency of accidents by date and time.
I requested WSDOT to provide Northwest collisions between 2015 through June 2018 which I parsed grouping by city and date, then used Alteryx to forecast by week accidents after which I use Python to weight each day afterwhich I feed into Tableau for visualization. The result is a map of our area that uses the current day to present locations which have been historically and forecasted to be probable for collisions.
The code and dataset may be accessed here. The code consists of three scripts. The first one, “wsdot_parser.py”, will open the WSDOT dataset. Please note that the code assumes that the dataset will be on the same folder level and named “king.csv”. This script will generate two derived datasets: “weekday_coeffs.csv” and “weekly_table.csv”.
The first is a table where the general probability of an accident per city and weekday (Monday-Sunday) is represented by a number (0 to 1). The second one is the aggregate accidents per week over the full dataset grouped by city. Each row represents a week and it just counts the number of accidents that happened on that week at that city.
To do the actual forecast Alteryx Designed is required. The script provided (“arima_iter.yxmc”) will produce a forecast of accidents for the selected city (you must manually choose it in the Alteryx interface). This forecast is per week and each row represents a week for that city and is the result of an ARIMA model fit to the whole dataset per city and week.
Once all the cities have a forecast then the Python script “merger.py” will produce the final forecast for the next 16 weeks starting on the last date found on the WSDOT dataset. The general forecast for a week is spread between the days of that week, weighting each day by the weekday coefficient previously computed. At the end, the file “full_forecast.csv” is produced as the final output. This file can feed Tableau to create a visualization.


We use your twitter profile to access the news sources you follow. Our twitter-bot returns these sources to our hand-crafted algorithym that uses empirical data to analyze your placement on the news source spectrum of left-right bias.
What about other sources?
We are planning to expand to other platforms, such as facebook, in future versions! For now, we decided to tackle twitter, as it seems to be as much of a news platform as it is a social media hub.


hsqldb - 100% Java DatabaseLightweight 100% Java SQL Database Engine |
|
As a first step, please read the How To / FAQ (Frequently Asked Questions) and the documentation.
If you still need support, you have two options:
The Help Forum is a web-based discussion board for support questions.
Read and search the archives of the Help Forum
And if you cannot find the answer, try Alternative B below before posting a new message either in an existing, related, thread, or in a new thread. You should get a SourceForge user-id and logon before you submit items. You can then put bookmarks on threads that interest you or choose to get the new posts by email.
DO NOT post in the Open Discussion Forum unless you want to discuss future developments of HSQLDB.
Alternatively, you can use our user mailing list. You can read and search the archives before posting a question. You must subscribe to the mailing list before you can post a message.
Read
and search the archives of the Mailing List.
Read and search
the archives of the Mailing List at gmane.org (better search facitily).
Subscribe
to this mailing list
If you are new to Java or databases, please discuss the issue in one of the forums first. If you have to report a bug in HSQLDB please use the Bug Tracker system at SourceForge. If possible, include a test case or the code that caused the error. The error can then be fixed much easier and faster.
Use the Feature Request Tracker to post a new feature request.
It is a good idea to get a SourceForge user-id and logon before you submit items. This will ensure that you get an email if there is a follow-up or a fix.


UIFloatingDecimalNumberDisplayer
open class UIFloatingDecimalNumberDisplayer : UINumberDisplayer
A UINumberDisplayer that displays a number with the mantissa raised. All text is fitted.
-
Whether or not this view is animated.
Declaration
Swift
public var animated: Bool
-
Undocumented
Declaration
Swift
public init(withFont font: UIFont = UIFont.systemFont(ofSize: 12.0), withTextColor textColor: UIColor = UIColor.black)
-
Displays the input value within a single UILabel that is generated by this method. Characters in both the
stringToDisplay
and therawValue
are bolded, and characters that are not in both are given an opacity of 0.25.Declaration
Swift
open func displayValue(_ stringToDisplay: String, withRawString rawString: String, numberFormatter: NumberFormatter, inView view: UIView) -> [UIView]
Parameters
stringToDisplay
The complete string to display.
rawValue
The raw value of the string to display (not formatted)
numberFormatter
The formatter used to generate the stringToDisplay.
view
The view where the value should be displayed in
Return Value
The views that were created to hold the displayed value.


Oklahoma's Grant Calcaterra says he's done with football, cites concussions
by Tom GattoOklahoma junior tight end Grant Calcaterra announced Thursday that he is ending his football career because of multiple concussions, the last being the one he suffered earlier this season.
"Over a month ago, I received a concussion in practice," he said, reading from a prepared statement. "What most of you may not know is that I've had my fair share of concussions in my career. I spent countless hours visiting with OU medical professionals and specialists around the country. Ultimately, we came to the conclusion that it would be best for me to step away from the game."
Toward the end of his statement, Calcaterra said he plans to return to his native Southern California after his May graduation from OU to become a firefighter.
"The impulsiveness, teamwork, leadership, camaraderie and, most importantly, being a part of something that is bigger than myself is all I want in a career," he said.
BENDER: Sizing up Oklahoma's chances to leap Pac-12 champ in Playoff chase
Calcaterra, a first-teamAll-Big 12 performer for the Sooners in 2018, was limited to five games this year. His last appearance came against Kansas on Oct. 5. Hecaught five passes for 79 yards and no touchdowns in the 2019 season.
The ninth-ranked Sooners (9-1, 6-1 Big 12) will play TCU in Norman on Saturday night.


RC-MEDIA
Angular Directive Media Picker with upload and crop image
View on GitHub
Download
Currently v1.1.0
Example simple
Open Media Foundation
Example single select
Select Image
Example multiple select
Add to Gallery
Example crop disabled
Add to Gallery


Cole Allen
A portfolio of projects...
Home
Projects
About Me
Contact
Cole's About Page!!!
Put something fun and awesome here...at some point...
Cole's Portfolio
Some stuff about me!
Coding Stuff
Stuff I have learned
Professional Backgound
email stuff
non-existant twitter stufff (link)
linkedin stuff (link)


Getting started
An overview of Upstage, how to download and use, basic templates and examples, and more.
An overview of Upstage, how to download and use, basic templates and examples, and more.
There are a few easy ways to quickly get started with Upstage, each one appealing to a different skill level and use case. Read through to see what suits your particular needs.
The fastest way to get Upstage is to download the compiled and minified versions of our CSS and JavaScript, along with the included fonts. No documentation or original source files are included.
The folks over at NetDNA have graciously provided CDN support for Upstage's CSS and JavaScript. To use, swap your local instances for the Upstage CDN links listed below.

<link rel="stylesheet" href="">

<link rel="stylesheet" href="">

Within the download you'll find the following directories and files, logically grouping common assets and providing both compiled and minified variations.
Once downloaded, unzip the compressed folder to see the structure of (the compiled) Upstage. You'll see something like this:
upstage/
├── css/
│ ├── upstage.css
│ ├── upstage.min.css
│ ├── upstage-theme.css
│ ├── upstage-theme.min.css
├── js/
│ ├── upstage.js
│ ├── upstage.min.js
└── fonts/
├── glyphicons-halflings-regular.eot
├── glyphicons-halflings-regular.svg
├── glyphicons-halflings-regular.ttf
└── glyphicons-halflings-regular.woff
This is the most basic form of Upstage: compiled files for quick drop-in usage in nearly any web project. We provide compiled CSS and JS (upstage.*
), as well as compiled and minified CSS and JS (upstage.min.*
). Fonts
from Glyphicons are included, as is the optional Upstage theme.
Please note that all JavaScript plugins require jQuery to be included, as shown in the starter template.
Make use of a super basic HTML template, or dive into a few examples we've started for you. We encourage folks to iterate on these examples and not simply use them as an end result.
Copy and paste the HTML from below to get started with a bare bones Upstage document.
<!DOCTYPE html>

<title>Upstage 101 Template</title>
<meta name="viewport" content="width=device-width, initial-scale=1.0">

<link href="css/upstage.min.css" rel="stylesheet" media="screen">

Hello, world!

Build on the basic template above with Upstage's many components. Check out some of the more advanced tips for how to customize and build on top of them.
Don't want your site or application to be scaled on different devices? With a little bit of work, you can disable the responsive features of Upstage so that mobile users see your full desktop-version site. Read below or check out the non-responsive example.
To disable responsive features, follow these steps. See it in action in the modified template below.
<meta>
mentioned in the CSS docs
max-width
on the .container
for all grid tiers with max-width: none !important;
and set a regular width like width: 970px;
. Be sure that this comes after the default Upstage CSS. You
can optionally avoid the !important
with media queries or some selector-fu..col-xs-*
classes in addition to or in place of the medium/large ones. Don't worry, the extra-small device grid scales up to all resolutions, so you're set there.You'll still need Respond.js for IE8 (since our media queries are still there and need to be picked up). This just disables the "mobile site" of Upstage.
We've taken the above steps and applied them to an example. Read it's source code to see the specific changes called out.
Folks looking to upgrade to v3 should use this section as a general upgrade guide. We've outlined some of the major changes and provided tables that highlight key changes. For an overview, read the announcement blog post.
Reference table for classes that have changed between v2.x and v3.0.
| Upstage 2.x | Upstage 3.0 |
|---|---|
.container-fluid
|
.container
|
.row-fluid
|
.row
|
.span*
|
.col-md-*
|
.offset*
|
.col-md-offset-*
|
.brand
|
.navbar-brand
|
.nav-collapse
|
.navbar-collapse
|
.nav-toggle
|
.navbar-toggle
|
.btn-navbar
|
.navbar-btn
|
.hero-unit
|
.jumbotron
|
.icon-*
|
.glyphicon .glyphicon-*
|
.btn
|
.btn .btn-default
|
.btn-mini
|
.btn-xs
|
.btn-small
|
.btn-sm
|
.btn-large
|
.btn-lg
|
.visible-phone
|
.visible-sm
|
.visible-tablet
|
.visible-md
|
.visible-desktop
|
.visible-lg
|
.hidden-phone
|
.hidden-sm
|
.hidden-tablet
|
.hidden-md
|
.hidden-desktop
|
.hidden-lg
|
.input-small
|
.input-sm
|
.input-large
|
.input-lg
|
.checkbox.inline .radio.inline
|
.checkbox-inline .radio-inline
|
.input-prepend .input-append
|
.input-group
|
.add-on
|
.input-group-addon
|
.thumbnail
|
.img-thumbnail
|
ul.unstyled
|
.list-unstyled
|
ul.inline
|
.list-inline
|
We've added a few new elements and changed some existing ones. Here's their new or updated classes.
| Element | Description |
|---|---|
| Panels | .panel .panel-default .panel-body .panel-title .panel-heading .panel-footer .panel-collapse
|
| List groups | .list-group .list-group-item .list-group-item-text .list-group-item-heading
|
| Glyphicons | .glyphicon
|
| Jumbotron | .jumbotron
|
| Tiny grid (<768 px) | .col-xs-*
|
| Small grid (>768 px) | .col-sm-*
|
| Medium grid (>992 px) | .col-md-*
|
| Large grid (>1200 px) | .col-lg-*
|
| Offsets | .col-sm-offset-* .col-md-offset-* .col-lg-offset-*
|
| Push | .col-sm-push-* .col-md-push-* .col-lg-push-*
|
| Pull | .col-sm-pull-* .col-md-pull-* .col-lg-pull-*
|
| Input groups | .input-group .input-group-addon .input-group-btn
|
| Form controls | .form-control .form-group
|
| Button group sizes | .btn-group-xs .btn-group-sm .btn-group-lg
|
| Navbar text | .navbar-text
|
| Navbar header | .navbar-header
|
| Justified tabs / pills | .nav-justified
|
| Responsive images | .img-responsive
|
| Contextual table rows | .success .danger .warning .active
|
| Contextual panels | .panel-success .panel-danger .panel-warning .panel-info
|
| Modal | .modal-dialog .modal-content
|
| Thumbnail image | .img-thumbnail
|
| Well sizes | .well-sm .well-lg
|
| Alert links | .alert-link
|
The following elements have been dropped or changed in v3.
| Element | Removed from 2.x | 3.0 Equivalent |
|---|---|---|
| Form actions | .form-actions
|
N/A |
| Search form | .form-search
|
N/A |
| Fluid container | .container-fluid
|
.container (no more fixed grid) |
| Fluid row | .row-fluid
|
.row (no more fixed grid) |
| Navbar inner | .navbar-inner
|
N/A |
| Dropdown submenu | .dropdown-submenu
|
N/A |
| Tab alignments | .tabs-left .tabs-right .tabs-below
|
N/A |
We've made many underlying changes in v3 that are not immediately apparent. Base classes, key styles, and behaviors have been adjusted for flexibility and our mobile first approach.

to control input widths..badge
no longer has contextual (-success,-primary,etc..) classes..btn
must also use .btn-default
to get the "default" button..container
and .row
are now fluid (percentage-based)..img-responsive
for fluid
size..glyphicon
, are now font based. They also require a base and icon class (e.g. .glyphicon .glyphicon-asterisk
)..modal-header
, .modal-body
, and .modal-footer
sections now get wrapped in .modal-content
and .modal-dialog
for improved mobile styling and
behavior.'show.bs.modal'
. For tabs "shown" use 'shown.bs.tab'
, etc..For more information on upgrades and code snippets from the community check out Bootply.
Upstage is built to work best in the latest desktop and mobile browsers, meaning older and less advanced browsers might receive a less stylized, though fully functional, version of certain components.
Specifically, we support the latest versions of the following:
Unofficially, Upstage should look and behave well enough in Chromium for Linux and Internet Explorer 7, though they are not officially supported.
Internet Explorer 8 and 9 are also supported, however, please be aware that many CSS3 properties—e.g., rounded corners and shadows—are not supported by IE8. The placeholder
attribute is also not supported in either of these versions.
In addition, Internet Explorer 8 requires the use of respond.js to enable media query support.
Upstage is not supported in the old Internet Explorer compatibility modes. To be sure you're using the latest rendering mode for IE, consider including the appropriate <meta>
tag in your pages:
<meta http-equiv="X-UA-Compatible" content="IE=edge">
See this StackOverflow question for more information.
Internet Explorer 10 doesn't differentiate device width from viewport width, and thus doesn't properly apply the media queries in Upstage's CSS. To address this, you can optionally include the following CSS and JavaScript to work around this problem until Microsoft issues a fix.
@-webkit-viewport { width: device-width; }
@-moz-viewport { width: device-width; }
@-ms-viewport { width: device-width; }
@-o-viewport { width: device-width; }
@viewport { width: device-width; }
if (navigator.userAgent.match(/IEMobile\/10\.0/)) {
var msViewportStyle = document.createElement("style")
msViewportStyle.appendChild(
document.createTextNode(
"@-ms-viewport{width:auto!important}"
)
)
document.getElementsByTagName("head")[0].appendChild(msViewportStyle)
}
For more information and usage guidelines, read Windows Phone 8 and Device-Width.
In the latest Safari for Mac, its rendering engine has a little trouble with the long decimal places of our .col-*-1
grid classes, meaning if you have 12 individual columns you'll notice they come up short compared to other rows
of columns. There's not much we can do here (see #9282) but you do have some options:
.pull-right
to your last grid column to get the hard-right alignmentWe'll keep an eye on this though and update our code if we have an easy solution.
Support for overflow: hidden
on the
element is quite limited in iOS and Android. To that end, when you scroll past the top or bottom of a modal in either of those devices' browsers, the
content
will begin to scroll.
Also, note that if you're using inputs in your modal – iOS has a rendering bug which doesn't update the position of fixed elements when the virtual keyboard is triggered. There are a few work arounds for this, including transforming your elements
to position: absolute
or invoking a timer on focus to try to correct the positioning manually. This is not handled by Upstage, so it is up to you to decide which solution is best for your application.
Page zooming inevitably presents rendering artifacts in some components, both in Upstage and the rest of the web. Depending on the issue, we may be able to fix it (search first and then open an issue if need be). However, we tend to ignore these as they often have no direct solution other than hacky workarounds.
While we don't officially support any third party plugins or add-ons, we do offer some useful advice to help avoid potential issues in your projects.
If you're using Google Maps on a Upstageped project, you might run into some display problems due to our use of * { box-sizing: border-box; }
. Previously, you may have also ran into issues with the use of max-width
on
images. The following snippet should avoid all those problems.
/* Fix Google Maps canvas
*
* Wrap your Google Maps embed in a `.google-map-canvas` to reset Upstage's
* global `box-sizing` changes. You may optionally need to reset the `max-width`
* on images in case you've applied that anywhere else. (That shouldn't be as
* necessary with Upstage 3 though as that behavior is relegated to the
* `.img-responsive` class.)
*/
.google-map-canvas,
.google-map-canvas * { .box-sizing(content-box); }
/* Optional responsive image override */
img { max-width: none; }
Upstage follows common web standards, and with minimal extra effort, can be used to create sites that are accessibile to those using AT.
If your navigation contains many links and comes before the main content in the DOM, add a Skip to content
link immediately after your opening
tag. (read why)

Skip to content

The main page content.

Another "gotcha" has to do with how you nest your
elements. Section 508 states that your largest header must be an h1
, and
the next header must be an

, etc. This is hard to achieve in practice, but if the largest header on your site is smaller than Upstage's default 38px, you should consider modifying your stylesheets before using a smaller
header element.
Upstage is released under the Apache 2 license and is copyright 2013 Twitter. Boiled down to smaller chunks, it can be described with the following conditions.
The full Upstage license is located in the project repository for more information.
Customizing Upstage is best accomplished when you treat it as another dependency in your development stack. Doing so ensures future upgrades are as easy as possible while also familiarizing yourself to the intricacies of the framework.
Once you've downloaded and included Upstage's CSS into your templates, you can move on to customizing the included components. To do so, create a new stylesheet (LESS, if you like, or just plain CSS) to house your customizations.
Unless you plan on reading a good chunk of the compiled CSS, go with the minified. It's the same code, just compacted. Less bandwidth is good, especially in production environments.
From there, include whatever Upstage components and HTML content you need to get your template setup. It's best to have a rough idea in mind of modifications to make and content to include, so be sure to spend a brief amount of time on that before moving on.
There are varying degrees to customizing components, but most fall into two camps: light customizations and complete visual overhauls. Luckily, there are plenty of examples of both.
We define light customizations as mostly surface layer changes, things like a color and font changes to existing Upstage components. A great example of this is the the Twitter Translation Center (coded
by @mdo). Let's look at how to implement the custom button we wrote for this site, .btn-ttc
.
Instead of using the provided Upstage buttons, which only require just one class to start, .btn
, we'll add our own modifier class, .btn-ttc
. This will give us a slightly custom look with minimal effort.
<button type="button" class="btn btn-ttc">Save changes</button>
In the custom stylesheet, add the following CSS:
/* Custom button
-------------------------------------------------- */
/* Override base .btn styles */
/* Apply text and background changes to three key states: default, hover, and active (click). */
.btn-ttc,
.btn-ttc:hover,
.btn-ttc:active {
color: white;
text-shadow: 0 -1px 0 rgba(0, 0, 0, 0.25);
background-color: #007da7;
}
/* Apply the custom-colored gradients */
/* Note: you'll need to include all the appropriate gradients for various browsers and standards. */
.btn-ttc {
background-repeat: repeat-x;
background-image: linear-gradient(top, #009ED2 0%, #007DA7 100%);
...
}
/* Set the hover state */
/* An easy hover state is just to move the gradient up a small amount. Add other embellishments as you see fit. */
.btn-ttc:hover {
background-position: 0 -15px;
}
Customizing Upstage components takes time, but should be straightforward. Look to the source code often and duplicate the selectors you need for your modifications. Placing them after the Upstage source makes for easy overriding without complication. To recap, here's the basic workflow:
.navbar
.!important
here.Going beyond light customizations and into visual overhauls is just as straightforward as the above custom button. For a site like Karma, which uses Upstage as a CSS reset with heavy modifications, more extensive work is involved, but well worth it in the end.
While not recommended for folks new to Upstage, you may use one of two alternate methods for customization. The first is modifying the source .less files (making upgrades super difficult), and the second is mapping source LESS code to your own classes via mixins. For the time being, neither of those options are documented here.
Not all sites and applications need to make use of everything Upstage has to offer, especially in production environments where bandwidth literally becomes a financial issue. We encourage folks to remove whatever is unused with our Customizer.
Using the Customizer, simply uncheck any component, feature, or asset you don't need. Hit download and swap out the default Upstage files with these newly customized ones. You'll get vanilla Upstage, but without the features *you* deem unnecessary. All custom builds include compiled and minified versions, so use whichever works for you.


set missconn on|off
By default, when GrADS plots a line graph, missing data is indicated by a 'break' in the line.
set missconn on
set missconn off


Copies the entire folder's heirarchy folder from one location to another. If the other location doesn't exists, it will be constructed.
| from |
The source folder |
| to |
The destination folder (get's created if not exist) |
Recursively empties a folder of all it's contents (and all the sub-folder's contents), but leaves the source folder.
| who |
The source folder |
| dryRun |
Prevents actual deletion, but still allows the return list to display what "will" be deleted. |
An array containing a list of paths to files and folders that we're deleted (or will be deleted when dryrun is true)
Checks to see if a folder exists.
| who |
The path to the folder. |
duh duh
Creates a folder at the specified location. The sub-folder heirarchy is
constructed as needed.
For example if a folder exists here:
/path/to/folder
... but the following sub-folders don't exists:
/path/to/folder/sub/one/two/three
... Then the "sub/one/two/three" tree will be constructed inside "/path/to/folder")
| dest |
The destination folder to create |
Read a folder and returns an object containing all of the files and
folder in arrays.
| from |
The path to the folder to read. |
| filter |
A custom filter funciton. |
| recursive |
Should we retrieve sub-folders too? |
| store |
Used internally to store recursive findings. |
An object containing a list of "files" and "folders"
(as properties of the returned list), where each is an array.
var contents = readdir("/path/to/folder", null, true); // yeids contents { // files : [ // "/path/to/folder/1.foo", // "/path/to/folder/2.bar", // "/path/to/folder/3.png", // "/path/to/folder/sub1/1.foo", // "/path/to/folder/sub2/2.bar", // "/path/to/folder/sub3/3.png" // ], // dirs : [ // "/path/to/folder/sub1", // "/path/to/folder/sub2", // "/path/to/folder/sub3" // // ] // }
Collects files from a folder based on the specified extension (or
extensions). Can be used to search recursively through all sub-folders, and can
search multiple extensions.
Provided as shortcut for readdir with your own
extension-checking filter.
| from |
The path to search |
| exts |
The extension to look for (e.g. "jpg"). To |
| recursive |
Find all matching files in all |
The resulting array contains only files that mathc the
specified extension(s).
Recursively removes a folder and all of it's sub-folders as well.
| who |
The path to the folder |
| dryRun |
Prevents actual deletion, but still allows the return to return the list of items that "will" be deleted. |
An array of all the items that were deleted (or "will be" deleted if dryrun is true.


This is the Cuberite User's Manual. It is intended as a guide on how to operate the basics of Cuberite, as well as an introduction to some advanced features. It is organised into major sections as well as more detailed subsections and these are laid out in the {{toc - Table of Contents}}. The first section deals with downloading, installing, and running Cuberite. The second section is an overview of configuring Cuberite.  The remaining sections cover more advanced features and further configuration options in greater depth.
As with Cuberite itself, this manual is in active development, and you can contribute yourself or file an issue if you find an error or ommission on the GitHub Repository. If you're using a printed version, note that the latest version of this manual is always available online.


Civil Air Patrol - USAF Auxiliary
PCR-WA-050
Overlake
Composite Squadron
Who We Are
What We Do
Members
Join
Emergency Service
Aerospace Education
Cadet Programs
Home > Who We Are
Join Today!
Senior Members
Cadets
Overlake Composite Squadron Calendar


MANAGING REVERSE FLOWS IN THE CLOSED-LOOP SUPPLY CHAIN
ABSTRACT
Halak I.I., Kriukovska L.I., Managing reverse flows in the closed-loop supply chain. Visnyk National Transport University. Series «Technical sciences». Scientific and Technical Collection. - Kyiv: National Transport University, 2021. - Issue 1 (48).
The article proposes the use of the sustainable development, reverse and green logistics tools for effective development of a responsible supply chain management system.
The object of research is the reverse and green logistics.
The purpose of the study is to analyze the theoretical basis of the reverse and green logistics interaction in order to substantiate the optimal structure of the supply chain, taking into account its impact on the components of sustainable development.
Methods of the study are the analytical approach and mathematical methods.
The traditional supply chain aims to lower the cost and improve the efficiency of supply chain enterprise so as to maximize the economic benefits. Closed-loop supply chain also seek to maximize economic benefits, to decrease the consumption of resources and energy and to reduce the emissions of pollutants - all in an effort to create a socially responsible enterprise, and to balance the economic benefits, social effects and environmental effects.
To improve the management of reverse flows, the authors of this article propose to integrate the principles of sustainable development in the activities of companies that are part of the supply chain, it will protect the company's reputation and brand value and increase the efficiency of the supply chain. Also, it will help minimize the costs of environmental, social and economic impact. For continuous monitoring the situation related to the imbalance of the links in a closed-loop supply chain are offered an algorithm of using the bottleneck method.
The results of the study can be recommended for implementation in organizations that are directly involved in bringing the material flow from supply to consumption.
KEYWORDS: REVERSE LOGISTICS, GREEN LOGISTICS, CLOSED-LOOP SUPPLY CHAIN, SUSTAINABLE DEVELOPMENT.
REFERENCES
- Halak I.I., Babyna D.A. Perspektyvy vykorystannia reversyvnoi lohistyky v ahropromyslovomu kompleksi: ekolohichnyi aspekt. Visnyk Natsionalnoho transportnoho universytetu. Ser. Ekonomichni nauky. Vyp. 2(47). S. 59-69Judge, W.Q. and Douglas, T.J. (1998), «Performance implications of incorporating natural environmental issues into the strategic planning process: an empirical assessment», Journal of Management Studies, Vol. 35 No. 2, pp. 241-262.
- Maxwell, D. and Van der Vorst, R. (2003), «Developing sustainable products and services», Journal of Cleaner Production, Vol. 11 8, pp. 883-895.
- Seuring, S. and Muller, M. (2008), «From a literature review to a conceptual framework for sustainable supply chain management», Journal of Cleaner Production, Vol. 16 No. 15, pp. 1699-1710.
- Wood, D.J. (1991), «Corporate social performance revisited», Academy of Management Review, Vol. 16 No. 4, pp. 691-718.
- Gold, S., Seuring, S. and Beske, P. (2010), «The constructs of sustainable supply chain management - a content analysis based on published case studies», Progress in Industrial Ecology: An International Journal, Vol. 7 No. 2, pp. 114-137.
- Diabat, A., Khodaverdi, R. and Olfat, L. (2013), «An exploration of green supply chain practices and performances in an automotive industry», International Journal of Advanced Manufacturing Technology, Vol. 68 Nos 1-4, pp. 949-961.
- Dixon, R., Mousa, G.A. and Woodhead, A. (2005), «The role of environmental initiatives in encouraging companies to engage in environmental reporting», European Management Journal, Vol. 23 No. 6, pp. 702-716.
- Carter, C.R. & Ellram, L.M. (1998). Reverse Logistics: A review of the literature and framework for future investigation, Journal of Business Logistics, Vol. 19, no. 1, pp. 85-102.
- Dowlatshahi, S. (2000). Developing a theory of Reverse Logistics. Interfaces, Vol. 30, No 3, May- June, pp. 143-155.
- Rogers, D.S. & Tibben-Lembke, R.S. (1999). Going backwards: Reverse Logistics trends and practices. Reverse Logistics Executive Council, Pittsburgh, P.A.
- Stock, J. (1998). Development and implementation of reverse logistics programs. Oak Brook: Council of Logistics Management.
- Kates, R.W., Parris, T.M., Leiserowitz, A.A. (2005). What is Sustainable Development? Goals, Indicators, Values, and Practice. Environment: Science and Policy for Sustainable Development, 47(3): 821.
- Krikke, H. R., Le Blanc, H. M., & Van de Velde, S. Creating Value from Returns? The Impact of Product Life Cycle Management on Circular Supply Chains and Reverse. / Krikke, H. R., Le Blanc, H. M., & Van de Velde, S // CentER-AR Working Paper. - Tilburg: Department of Economics, 2003. - Vol. 20032.
- Raj Kumar, R.M. Satheesh Kumar. Closed Loop Supply Chain Management and Reverse Logistics -A Literature Review, International Journal of Engineering Research and Technology. ISSN 09743154 Volume 6, Number 4 (2013), pp. 455-468
- United Nations Global Compact: Supply Chain Sustainability Resources and Practices https://ppv.net.ua/uploads/work_attachments/Responsible_Supply_Chain__UA_.pdf
- Iashyn O.O., Riashko M.L. Lohistyka. Osnovy planuvannia y otsinky efektyvnosti lohistychnykh system. Yekaterynburh: Vyd-vo Uralskoho universytetu, 2014. - 52s.
AUTHOR
Halak Iryna, Ph.D., associate professor, National Transport University, associate professor of Department of transport Law and Logistics, e-mail<EMAIL_ADDRESS>tel. +380978459880, Ukraine, 01010, Kyiv, M. Omelianovycha-Pavlenka Str.1, of. 439, orcid.org/0000-0002-5038-7771.
Kriukovska Lesia, Ph.D., associate professor, National Transport University, associate Professor of the Department of ecology and life safety, e-mail: krjukovska@gmail, тел. +380979234707, Ukraine, 01010, Kyiv, M. Omelianovycha-Pavlenka Str.1, of. 312, orcid.org/0000-0001-8944-8036.
REVIEWER
I
Khlevna YL, Doctor of Technical Sciences, Associate Professor, Taras Shevchenko National University of Kyiv, Associate Professor of the Department of Technological Management, Kyiv, Ukraine.
Khrutba Viktoriia A., Doctor of Technical Science, National Transport University, professor, Head of the Department of Ecology and Safety of Vital Functions.
Article language: Ukrainian
Open Access: http://publications.ntu.edu.ua/visnyk/48/073-082.pdf
Print date: 15.03.2021
Online publication date: 05.04.2021


Get Birmingham’s best seasonal bouquets, made lovingly by our hand-selected independent florists.
“I order all my flowers from here. It’s the best service in town!”
Liv, designer in Highgate
“Seriously. They deliver incredible flowers every time I order.”
Chelsea, artist in Shoreditch
As seen in …


--- template: example.html title: turf-nearest description: Returns the nearest point feature. tags: - measurement ---


PERF\-SCRIPT\-PERL
Section: Misc. Reference Manual Pages (1)Updated: 10/16/2012
Index Return to Main Contents
NAME
perf-script-perl - Process trace data with a Perl scriptSYNOPSIS
perf script [-s [Perl]:script[.pl] ]
DESCRIPTION
This perf script option is used to process perf script data using perfcqs built-in Perl interpreter. It reads and processes the input file and displays the results of the trace analysis implemented in the given Perl script, if any.
STARTER SCRIPTS
You can avoid reading the rest of this document by running perf script -g perl in the same directory as an existing perf.data trace file. That will generate a starter script containing a handler for each of the event types in the trace file; it simply prints every available field for each event in the trace file.
You can also look at the existing scripts in ~/libexec/perf-core/scripts/perl for typical examples showing how to do basic things like aggregate event data, print results, etc. Also, the check-perf-script.pl script, while not interesting for its results, attempts to exercise all of the main scripting features.
EVENT HANDLERS
When perf script is invoked using a trace script, a user-defined handler function is called for each event in the trace. If therecqs no handler function defined for a given event type, the event is ignored (or passed to a trace_handled function, see below) and the next event is processed.
Most of the eventcqs field values are passed as arguments to the handler function; some of the less common ones arencqt - those are available as calls back into the perf executable (see below).
As an example, the following perf record command can be used to record all sched_wakeup events in the system:
-
# perf record -a -e sched:sched_wakeup
Traces meant to be processed using a script should be recorded with the above option: -a to enable system-wide collection.
The format file for the sched_wakep event defines the following fields (see /sys/kernel/debug/tracing/events/sched/sched_wakeup/format):
-
.ft C format: field:unsigned short common_type; field:unsigned char common_flags; field:unsigned char common_preempt_count; field:int common_pid; field:int common_lock_depth; field:char comm[TASK_COMM_LEN]; field:pid_t pid; field:int prio; field:int success; field:int target_cpu; .ft
The handler function for this event would be defined as:
-
.ft C sub sched::sched_wakeup { my ($event_name, $context, $common_cpu, $common_secs, $common_nsecs, $common_pid, $common_comm, $comm, $pid, $prio, $success, $target_cpu) = @_; } .ft
The handler function takes the form subsystem::event_name.
The $common_* arguments in the handlercqs argument list are the set of arguments passed to all event handlers; some of the fields correspond to the common_* fields in the format file, but some are synthesized, and some of the common_* fields arencqt common enough to to be passed to every event as arguments but are available as library functions.
Herecqs a brief description of each of the invariant event args:
-
$event_name the name of the event as text $context an opaque 'cookie' used in calls back into perf $common_cpu the cpu the event occurred on $common_secs the secs portion of the event timestamp $common_nsecs the nsecs portion of the event timestamp $common_pid the pid of the current task $common_comm the name of the current process
All of the remaining fields in the eventcqs format file have counterparts as handler function arguments of the same name, as can be seen in the example above.
The above provides the basics needed to directly access every field of every event in a trace, which covers 90% of what you need to know to write a useful trace script. The sections below cover the rest.
SCRIPT LAYOUT
Every perf script Perl script should start by setting up a Perl module search path and 'usecqing a few support modules (see module descriptions below):
-
.ft C use lib "$ENV{'PERF_EXEC_PATH'}/scripts/perl/perf-script-Util/lib"; use lib "./perf-script-Util/lib"; use Perf::Trace::Core; use Perf::Trace::Context; use Perf::Trace::Util; .ft
The rest of the script can contain handler functions and support functions in any order.
Aside from the event handler functions discussed above, every script can implement a set of optional functions:
trace_begin, if defined, is called before any event is processed and gives scripts a chance to do setup tasks:
-
.ft C sub trace_begin { } .ft
trace_end, if defined, is called after all events have been processed and gives scripts a chance to do end-of-script tasks, such as display results:
-
.ft C sub trace_end { } .ft
trace_unhandled, if defined, is called after for any event that doesncqt have a handler explicitly defined for it. The standard set of common arguments are passed into it:
-
.ft C sub trace_unhandled { my ($event_name, $context, $common_cpu, $common_secs, $common_nsecs, $common_pid, $common_comm) = @_; } .ft
The remaining sections provide descriptions of each of the available built-in perf script Perl modules and their associated functions.
AVAILABLE MODULES AND FUNCTIONS
The following sections describe the functions and variables available via the various Perf::Trace::* Perl modules. To use the functions and variables from the given module, add the corresponding use Perf::Trace::XXX line to your perf script script.
Perf::Trace::Core Module
These functions provide some essential functions to user scripts.
The flag_str and symbol_str functions provide human-readable strings for flag and symbolic fields. These correspond to the strings and values parsed from the print fmt fields of the event format files:
-
flag_str($event_name, $field_name, $field_value) - returns the string represention corresponding to $field_value for the flag field $field_name of event $event_name symbol_str($event_name, $field_name, $field_value) - returns the string represention corresponding to $field_value for the symbolic field $field_name of event $event_name
Perf::Trace::Context Module
Some of the common fields in the event format file arencqt all that common, but need to be made accessible to user scripts nonetheless.
Perf::Trace::Context defines a set of functions that can be used to access this data in the context of the current event. Each of these functions expects a $context variable, which is the same as the $context variable passed into every event handler as the second argument.
-
common_pc($context) - returns common_preempt count for the current event common_flags($context) - returns common_flags for the current event common_lock_depth($context) - returns common_lock_depth for the current event
Perf::Trace::Util Module
Various utility functions for use with perf script:
-
nsecs($secs, $nsecs) - returns total nsecs given secs/nsecs pair nsecs_secs($nsecs) - returns whole secs portion given nsecs nsecs_nsecs($nsecs) - returns nsecs remainder given nsecs nsecs_str($nsecs) - returns printable string in the form secs.nsecs avg($total, $n) - returns average given a sum and a total number of values
SEE ALSO
perf-script(1)
Index
- NAME
- SYNOPSIS
- DESCRIPTION
- STARTER SCRIPTS
- EVENT HANDLERS
- SCRIPT LAYOUT
- AVAILABLE MODULES AND FUNCTIONS
- SEE ALSO
This document was created by man2html, using the manual pages.
Time: 05:29:07 GMT, December 24, 2015


---
title: "File input"
date: 2021-04-29T16:00:58+02:00
draft: false
main_title: "Tailwind file input"
subheading: ""
seo_title: "Tailwind file input - examples & templates"
description: "File upload input built with Tailwind. Helps upload a single or many items. Supports images, files, and documents. Add items directly from your local storage."
image: ""
video: ""
url: "/docs/standard/components/file-input/"
menu:
forms:
name: "File input"
---
{{< example lang="html" title="Basic example">}}
{{< /example>}}


K'taka: Congress MLA Tanveer Sait attacked with knife, accused in custody
The MLA was rushed to a hospital and the attacker has been taken into police custody.
by ANIMysuru: Karnataka Congress legislator Tanveer Sait was allegedly attacked with a knife by a man at an event here.
The incident took place on Sunday. The accused has been identified as Farhan.
The MLA was rushed to a hospital and the attacker has been taken into police custody.
The reason behind the attack is yet to be ascertained. An investigation into the incident is underway.
Sait is an MLA from Mysuru's Narasimharaja assembly constituency.
Catch the latest news, live coverage and in-depth analyses from India and World. Follow us on Facebook and Twitter.


{% load staticfiles %}
EXPENSES REPORT
{% if type %} EXPENSE TYPE: {{type.name|upper}} {% endif %}
{{today | date:'jS F Y'}}
| Exp. Date | Expense | Paid To | Amount |
|---|---|---|---|
| {{ expense.added_on|date:'d-m-Y'}} | {{expense.expense_type}} | {{expense.paid_to}} | {{ expense.amount }} |
No Expenses Available |


Pac-Man, now with ghosts.
Minimax, Expectimax.
For those of you not familiar with Pac-Man, it's a game where Pac-Man (the yellow circle with a mouth in the above figure) moves around in a maze and tries to eat as many food pellets (the small white dots) as possible, while avoiding the ghosts (the other two agents with eyes in the above figure). If Pac-Man eats all the food in a maze, it wins. The big white dots at the top-left and bottom-right corner are capsules, which give Pac-Man power to eat ghosts in a limited time window (but you won't be worrying about them for the required part of the assignment). You can get familiar with the setting by playing a few games of classic Pac-Man, which we come to just after this introduction.
In this project, you will design agents for the classic version of Pac-Man, including ghosts. Along the way, you will implement both minimax and expectimax search.
The base code for this project contains a lot of files (which
are listed towards the end of this page); you, however, do not need to
go through these files to complete the assignment. These are there only to
guide the more adventurous amongst you to the heart of Pac-Man. As in previous
assignments, you will be modifying only submission.py
. This
assignment has no grader.py
checking for functionality.
A basic grader.py
has been included in the .zip file, but it only checks for timing issues. Passing this doesn't mean you have a correct implementation.
First, play a game of classic Pac-Man to get a feel for the assignment:
python pacman.pyYou can always add --frameTime -1 to the command line to run in "demo mode" where the game pauses after every frame.
Now, run the provided ReflexAgent
in submission.py
:
python pacman.py -p ReflexAgentNote that it plays quite poorly even on simple layouts:
python pacman.py -p ReflexAgent -l testClassicYou can also try out the reflex agent on the default
mediumClassic
layout with one ghost or two.
python pacman.py -p ReflexAgent -k 1
python pacman.py -p ReflexAgent -k 2
Note: you can never have more ghosts than the layout permits.
Options: Default ghosts are random; you can also play for fun with slightly smarter directional ghosts using -g DirectionalGhost
. You can also play multiple games in a row with -n
. Turn off graphics with -q
to run lots of games quickly.
ReflexAgent
code carefully (in submission.py
) and make sure you understand what it's doing. The reflex agent code provides some helpful examples of methods that query the GameState
(a GameState
specifies the full game state, including the food, capsules, agent configurations and score changes: see submission.py
for further information and helper methods) for information, which you will be using in the actual coding part. We are giving an exhaustive and very detailed description below, for the sake of completeness and to save you from digging deeper into the starter code. The actual coding part is very small - so please be patient if you think there is too much writing.
Note: if you wish to run Pac-Man in the terminal using a text-based interface,
check out the terminal
directory.
Specifically, consider the limited depth tree minimax search with evaluation functions taught in class. Suppose there are $n+1$ agents on the board, $a_0,\ldots , a_n$, where $a_0$ is Pac-Man and the rest are ghosts. Pac-Man acts as a max agent, and the ghosts act as min agents. A single depth consists of all $n+1$ agents making a move, so depth 2 search will involve Pac-Man and each ghost moving two times. In other words, a depth of 2 corresponds to a height of $2(n+1)$ in the minimax game tree.
Write the recurrence for $V_{\text{max,min}}(s,d)$ in math. You should express your answer in terms of the following functions: $\text{IsEnd}(s)$, which tells you if $s$ is an end state; $\text{Utility}(s)$, the utility of a state; $\text{Eval}(s)$, an evaluation function for the state $s$; $\text{Player}(s)$, which returns the player whose turn it is; $\text{Actions}(s)$, which returns the possible actions; and $\text{Succ}(s,a)$, which returns the successor state resulting from taking an action at a certain state. You may use any relevant notation introduced in lecture.
MinimaxAgent
class in
submission.py
using the above recurrence.
Remember that your minimax
agent should work with any number of ghosts, and your minimax tree should have
multiple min layers (one for each ghost) for every max layer.
Your code should also expand the game tree to an arbitrary depth. Score the
leaves of your minimax tree with the supplied
self.evaluationFunction
, which defaults to
scoreEvaluationFunction
. The class
MinimaxAgent
extends MultiAgentSearchAgent
, which
gives access to self.depth
and
self.evaluationFunction
. Make sure your minimax code makes
reference to these two variables where appropriate as these variables are
populated from the command line options.
Other functions that you might use in the code:
GameState.getLegalActions()
which returns all the possible legal
moves, where each move is Directions.X
for some X in the set
{NORTH, SOUTH, WEST, EAST, STOP
}. Go through
ReflexAgent
code as suggested before to see how the above are used
and also for other important methods like GameState.getPacmanState(),
GameState.getGhostStates(), GameState.getScore()
etc. These are further documented inside
the MinimaxAgent
class.
Hints and Observations
self.evaluationFunction
). You shouldn't change this function, but recognize that now we're evaluating states rather than actions, as we were for the reflex agent. Look-ahead agents evaluate future states whereas reflex agents evaluate actions from the current state. Use self.evaluationFunction
in your definition of $V_\text{max,min}$ wherever you used $\text{Eval}(s)$ in part $1a$.minimaxClassic
layout are 9, 8, 7, -492 for depths 1, 2, 3 and 4 respectively. You can use these numbers to verify if your implementation is correct. Note that your minimax agent will often win (just under 50% of the time for us--be sure to test on a large number of games using the -n
and -q
flags) despite the dire prediction of depth 4 minimax.
python pacman.py -p MinimaxAgent -l minimaxClassic -a depth=4
Directions.STOP
action from Pac-Man's list of possible actions. Depth 2 should be pretty quick, but depth 3 or 4 will be slow. Don't worry, the next problem will speed up the search somewhat.
self.index
in your minimax implementation, but only Pac-Man will actually be running your MinimaxAgent
.
GameState
in pacman.py
for details.
GameStates
, either passed in
to getAction
or generated via
GameState.generateSuccessor
. In this project, you will not be
abstracting to simplified states.
getAction
should use $V_\text{max,min}$ to determine the best action for Pac-Man.
openClassic
and
mediumClassic
(the default), you'll find Pac-Man to be good at not
dying, but quite bad at winning. He'll often thrash around without making
progress. He might even thrash around right next to a dot without eating it.
Don't worry if you see this behavior. Why does Pac-Man thrash around right next to a dot?
python pacman.py -p MinimaxAgent -l trappedClassic -a depth=3Why do you think Pac-Man rushes the closest ghost in minimax search on
trappedClassic
? (These questions are here for you to ponder upon; no need to
include in the write-up.)
Directions.STOP
as a valid action (this is true for any part of the assignment).
AlphaBetaAgent
. Again, your algorithm will be slightly more
general than the pseudo-code in the slides, so part of the challenge is to
extend the alpha-beta pruning logic appropriately to multiple minimizer agents.
You should see a speed-up (perhaps depth 3 alpha-beta will run as fast as
depth 2 minimax). Ideally, depth 3 on mediumClassic
should run in
just a few seconds per move or faster.
python pacman.py -p AlphaBetaAgent -a depth=3
The AlphaBetaAgent
minimax values should be identical to the
MinimaxAgent
minimax values, although the actions it selects can
vary because of different tie-breaking behavior. Again, the minimax values of
the initial state in the minimaxClassic
layout are 9, 8, 7, and
-492 for depths 1, 2, 3, and 4, respectively. Running the command given above this
paragraph, the minimax values of the initial state should be 9, 18, 27, and 36
for depths 1, 2, 3, and 4, respectively.
ExpectimaxAgent
, where your agent
will no longer take the min over all ghost actions, but the expectation according to your agent's model of how the ghosts
act. Assume Pac-Man is playing against RandomGhost
s, which each choose
getLegalActions
uniformly at random.
You should now observe a more cavalier approach to close quarters with ghosts. In particular, if Pac-Man perceives that he could be trapped but might escape to grab a few more pieces of food, he'll at least try:
python pacman.py -p ExpectimaxAgent -l trappedClassic -a depth=3You may have to run this scenario a few times to see Pac-Man's gamble pay off. Pac-Man would win half the time on an average and for this particular command, the final score would be -502 if Pac-Man loses and 532 or 531 (depending on your tiebreaking method and the particular trial) if it wins (you can use these numbers to validate your implementation). Why does Pac-Man's behavior in expectimax differ from the minimax case (i.e., why doesn't he head directly for the ghosts)? Again, just think about it; no need to write it up.
betterEvaluationFunction
.
The evaluation function should evaluate states (rather than actions).
You may use any tools at your disposal for evaluation, including any util.py
code
from the previous assignments. With depth 2 search, your evaluation function
should clear the smallClassic
layout with two random ghosts more
than half the time for full credit and still run at a reasonable rate.
python pacman.py -l smallClassic -p ExpectimaxAgent -a evalFn=better -q -n 10We will run your Pac-Man agent 20 times to get the average score. In
grader.py
, you will see the how extra credit is awarded.
You obtain 1 point for every 100 point increase in the average score,
and in addition, the top 3 people in the class will get additional points.Hints and Observations
Go Pac-Man Go!
Files:submission.py |
Where all of your multi-agent search agents will reside and the only file you need to concern yourself with for this assignment. |
pacman.py
| The main file that runs Pac-Man games. This file also describes a Pac-Man GameState type, which you will use extensively in this project |
game.py |
The logic behind how the Pac-Man world works. This file describes several supporting types like AgentState, Agent, Direction, and Grid. |
util.py |
Useful data structures for implementing search algorithms. |
graphicsDisplay.py |
Graphics for Pac-Man |
graphicsUtils.py |
Support for Pac-Man graphics |
textDisplay.py |
ASCII graphics for Pac-Man |
ghostAgents.py |
Agents to control ghosts |
keyboardAgents.py |
Keyboard interfaces to control Pac-Man |
layout.py |
Code for reading layout files and storing their contents |


UIScrollView
-
Equivalent to implementing UIScrollView’s scrollViewDidScroll(_:) method
Declaration
Swift
public func didScroll(handler: @escaping (_ scrollView: UIScrollView) -> Void) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s scrollViewDidZoom(_:) method
Declaration
Swift
public func didZoom(handler: @escaping (_ scrollView: UIScrollView) -> Void) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s scrollViewWillBeginDragging(_:) method
Declaration
Swift
public func willBeginDragging(handler: @escaping (_ scrollView: UIScrollView) -> Void) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s scrollViewWillEndDragging(_:) method
Declaration
Swift
public func willEndDragging(handler: @escaping (_ scrollView: UIScrollView, _ velocity: CGPoint, _ targetContentOffset: UnsafeMutablePointer<CGPoint>) -> Void) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s scrollViewDidEndDragging(_:) method
Declaration
Swift
public func didEndDragging(handler: @escaping (_ scrollView: UIScrollView, _ decelerate: Bool) -> Void) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s scrollViewWillBeginDecelerating(_:) method
Declaration
Swift
public func willBeginDecelerating(handler: @escaping (_ scrollView: UIScrollView) -> Void) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s scrollViewDidEndDecelerating(_:) method
Declaration
Swift
public func didEndDecelerating(handler: @escaping (_ scrollView: UIScrollView) -> Void) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s scrollViewDidEndScrollingAnimation(_:) method
Declaration
Swift
public func didEndScrollingAnimation(handler: @escaping (_ scrollView: UIScrollView) -> Void) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s viewForZooming(_:) method
Declaration
Swift
public func viewForZoomingIn(handler: @escaping (_ scrollView: UIScrollView) -> UIView?) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s scrollViewWillBeginZooming(_:) method
Declaration
Swift
public func willBeginZooming(handler: @escaping (_ scrollView: UIScrollView, _ view: UIView?) -> Void) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s scrollViewDidEndZooming(_:) method
Declaration
Swift
public func didEndZooming(handler: @escaping (_ scrollView: UIScrollView, _ view: UIView?, _ scale: CGFloat) -> Void) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s scrollViewShouldScrollToTop(_:) method
Declaration
Swift
public func shouldScrollToTop(handler: @escaping (_ scrollView: UIScrollView) -> Bool) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s scrollViewDidScrollToTop(_:) method
Declaration
Swift
public func didScrollToTop(handler: @escaping (_ scrollView: UIScrollView) -> Void) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Equivalent to implementing UIScrollView’s scrollViewDidChangeAdjustedContentInset(_:) method
Declaration
Swift
public func didChangeAdjustedContentInset(handler: @escaping (_ scrollView: UIScrollView) -> Void) -> Self
Parameters
handler
The closure that will be called in place of its equivalent delegate method
Return Value
itself so you can daisy chain the other delegate calls
-
Clears any delegate closures that were assigned to this
UIScrollView
. This cleans up memory as well as sets the delegate property to nil. This is typically only used for explicit cleanup. You are not required to call this method.Declaration
Swift
@objc public func clearClosureDelegates()


Version .0.6.37
Official Beta release 1.01
- Notes are now saved to the database. Notes are different than text on the screen. To add a note, right click on a placed pin.
- Annotate is now touch friendly! Use the extension on your touch screen device (must use in desktop version of Google Chrome - works great on Surface Pro 4)


Leo has developed a new programming language C+=. In C+=, integer variables can only be changed with a "+=" operation that adds the right-hand side value to the left-hand side variable. For example, performing "a += b" when a = $$$2$$$, b = $$$3$$$ changes the value of a to $$$5$$$ (the value of b does not change).
In a prototype program Leo has two integer variables a and b, initialized with some positive values. He can perform any number of operations "a += b" or "b += a". Leo wants to test handling large integers, so he wants to make the value of either a or b strictly greater than a given value $$$n$$$. What is the smallest number of operations he has to perform?
The first line contains a single integer $$$T$$$ ($$$1 \leq T \leq 100$$$) — the number of test cases.
Each of the following $$$T$$$ lines describes a single test case, and contains three integers $$$a, b, n$$$ ($$$1 \leq a, b \leq n \leq 10^9$$$) — initial values of a and b, and the value one of the variables has to exceed, respectively.
For each test case print a single integer — the smallest number of operations needed. Separate answers with line breaks.
2 1 2 3 5 4 100
2 7
In the first case we cannot make a variable exceed $$$3$$$ in one operation. One way of achieving this in two operations is to perform "b += a" twice.


Hi There.
Nothing in life should be arbirtrary. In the creative industry it's not different. That's what I try to convey with my work and my lifestyle as well. There is meaning and explanation on every single detail and decision. Creating and putting things out there is a huge responsability. Design with passion, strive for aesthethic perfection.


Undefinability of truth: no expressive and consistent language can contain its own truth predicate, satisfying \[\forall \ph: True(\ce{\ph}) \iff \ph.\]
Responses:
“Then we may continue to define True by the strong strong reflection property that the truth values of \(\ph\) and \(True(\ce{\ph})\) are the same for every \(\ph\). (?)
Unsatisfying.
Possible over prob. logic!
Fix a theory \(T\) over a language \(L\). (We will let also let \(L\) denote the set of sentences.)
Definition: A probability function \(\Pj:L\to [0,1]\) is coherent if there is a probability measure \(\mu\) over models of \(L\) such that \[\Pj(\ph) = \mu(\set{\mathcal M}{\mathcal M \vDash \ph}).\]
Theorem: \(\Pj\) is coherent iff all these hold.
Proof. Define \(T_{i+1}\) iteratively by choosing the first statement independent of \(T_i\), and including it with probability \(\Pj(\ph_j|T_i)\) and its negation otherwise. Let \(T=\bigcup_i T_i\). (Consistent by compactness.)
Axiom 1 implies \(\Pj(\ph|T_i)\) is a martingale. It eventually stabilizes at 0 or 1; the martingale property implies \(T\vdash \ph\) with probability \(\Pj(\ph|T_0)\).
This reflection principle doesn’t work: \[\forall \ph\in L', \forall a,b\in \Q: a<\Pj(\ph)<b\iff \Pj(a<\Pj(\ce{\ph})<b)=1\] because we can construct \(G\iff \Pj(\ce{G})<1\), \[\Pj(G)<1\iff \Pj(\Pj(\ce{G})<1)=1 \iff \Pj(G)=1.\]
Instead imagine \(\Pj\) having arbitrarily precise information about \(\Pj\). Say \(\Pj\) is reflectively consistent if (these are equivalent) \[\begin{align} \forall \ph\in L',\forall a,b\in \Q: (a<\Pj(\ph)<b) &\implies \Pj(a<\Pj(\ce{\phi})<b) &= 1\\ \forall \ph\in L',\forall a,b\in \Q: (a\le \Pj(\ph)\le b) &\Leftarrow \Pj(a\le \Pj(\ce{\phi})\le b) &= 1 \end{align}\]Theorem (Consistency of reflection): Let \(T\) be a consistent theory over \(L\) where \((\Q,+)\) can be embedded, and \(L'\) be the extension of \(L\) by \(\Pj\). There is a coherent probability function \(\Pj\) over \(L'\) assigning probability 1 to \(T\) and satisfying the reflection principle.
Proof.
Theorem (Kakutani fixed point): wikipedia
(Why do we care that \(R_{\Pj'}\) is countable?)
“we don’t want P to assert that P is reflectively consistent, we want it to actually be reflectively consistent.”
our work shows that the obstructions presented by the liar’s paradox can be overcome by tolerating an infinitesimal error, and that Tarski’s result on the undefinability of truth is in some sense an artifact of the infinite precision demanded by reasoning about complete certainty.
(Don’t understand the last page: revisit.)


After conducting research,
we as the VetNearYou decided to make vet services easy to access to all farmers.
Our board is comprised of very efficient and passionate animal lovers.
The brains behind this awesome idea are:
DR.JANIS
After my vet studies I saw the gap between vets and farmers hence a need to i saw the need to give back to the society and what better way other than serving the society,. Hence sat with a few friends and came up with this wonderful website,,.
DR.MARYANN
Also a vet medicine graduate,we teamed up and decided to make our services a button away. we are really enthusiastic and ready to serve all the needs of the farmers.
DR.WALTER
The last but definetely not the least,,also a graduate and trully a compassionate human. we are the pioneer of theVetNearYou and hope to bring more vets on board inorder to be more efficient.
Kenyatta Road, I&M Plaza. 2nd Floor. Nairobi, Kenya
Phone: +254702701920
Email: Vetnearyou@company.com


Engineer's Degree, Computer Science
University of Alcalá Alcalá de Henares, Madrid, SpainThesis: design and develop of an educational application for mobile devices using J2ME technology called TheBrainMaker.
Thesis: design and develop of an educational application for mobile devices using J2ME technology called TheBrainMaker.


JavaScript seems to be disabled in your browser. You must have JavaScript enabled in your browser to utilize the functionality of this website.
+1-855-679-0009 | M-F 9-5:30
You have no items in your shopping cart.
You might want to check that URL again or head over to our homepage.


Username:
{{(currentUser$ | async)?.username}}
Email:
{{(currentUser$ | async)?.email}}
Phone:
+359 {{(currentUser$ | async)?.tel}}
Username is required.
Username must be at least 5 characters long.
Email is required.
Email must be valid.
Telephone is required.


% debug % r btreedebug causes dbtest to display a running count of the calls made into the DB library. There is an optional argument to debug which is the number of the operation on which you want to stop. By using your debugger to set a breakpoint in the function __db_loadme, you can obtain control of the tester immediately before a particular operation. For example:
mongoose:build_unix {1} gdb dbtest (gdb) break __db_loadme Breakpoint 1 at 0xe3f7: file ../dist/../db/db_pr.c, line 43. (gdb) run Starting program: /usr/src/db/build_unix/dbtest % debug 10 10 % r btree run_method: btree 1 19 09:29:32 (00:00:00) Test001: DB_BTREE 10000 equal key/data pairs 1: Test001.a: put/get loop 10: Breakpoint 1, __db_loadme () at ../dist/../db/db_pr.c:43 43 getpid(); (gdb) n 44 } (gdb) n debug_check () at ../dist/../test/utils.c:1254 1254 } (gdb) n db_put_cmd (interp=0x54000, argc=6, argv=0xefbfc408, dbp=0xea080) at ../dist/../test/utils.c:859 859 if ((err = dbp->put(dbp, txnid, &key, &data, flags)) == 0) { (gdb) s __bt_put (dbp=0xea080, txn=0x0, key=0xefbfc2bc, data=0xefbfc2d4, flags=0) at ../dist/../btree/bt_put.c:91 91 t = dbp->internal; (gdb) where #0 __bt_put (dbp=0xea080, txn=0x0, key=0xefbfc2bc, data=0xefbfc2d4, flags=0) at ../dist/../btree/bt_put.c:91 #1 0x7691 in db_put_cmd (interp=0x54000, argc=6, argv=0xefbfc408, dbp=0xea080) at ../dist/../test/utils.c:859 #2 0x68b2 in dbwidget_cmd (cd_dbp=0xea080, interp=0x54000, argc=6, argv=0xefbfc408) at ../dist/../test/utils.c:517 #3 0x3a690 in Tcl_Eval () (gdb) quit The program is running. Quit anyway (and kill it)? (y or n) y mongoose:build_unix {2}
To set a counter breakpoint from inside a debugger, set the global variable debug_test to the counter value at which you want to stop. For example, you might first stop at operation 100, and then stop at operation 200 by initially setting a breakpoint in __db_loadme, issuing a debug 100 command and then setting debug_test to 200 in the debugger. (Some of the trickier bugs in DB are best solved by binary search, looking for the precise moment at which the page contents go bad.)
If you want to stop on each iteration, set the variable debug_stop to a non-zero value.
There are a number of routines to help you display page and tree contents. These routines live in the file ../db/db_pr.c. Some of the more useful ones are:
__db_prpage(page_address, dump_all) # Display a page's contents __db_prnpage(DB_MPOOLFILE *, pageno) # Display a page's contents __db_dump(DB *, file_name, dump_all) # Dump the entire database.
Examples of calling these functions from gdb are as follows.
The __db_prpage function displays a page as specified by a reference to a PAGE structure. In this case, cp references a CURSOR structure, which contains the pointer to the page.
(gdb) whatis cp type = CURSOR * (gdb) whatis cp->page type = PAGE * (gdb) print *cp $1 = {dbc = 0x807e040, page = 0xc110400, pgno = 2, indx = 0, dpgno = 0, dindx = 0, lock = 0, mode = DB_LOCK_NG, flags = 0} (gdb) print __db_prpage(cp->page, 1) page 2: (btree leaf) lsn.file: 0 lsn.offset: 0 prev: 0 next: 3 level: 1 entries: 28 offset: 136 [000] 500 len: 6 data: aback0x00 [001] 488 len: 6 data: aback0x00 [002] 476 len: 6 data: abaft0x00 [003] 464 len: 6 data: abaft0x00 [004] 452 len: 8 data: abandon0x00 [005] 440 len: 8 data: abandon0x00 [006] 424 len: 10 data: abandoned0x00 [007] 408 len: 10 data: abandoned0x00 [008] 392 len: 11 data: abandoning0x00 [009] 376 len: 11 data: abandoning0x00 [010] 360 len: 12 data: abandonment0x00 [011] 344 len: 12 data: abandonment0x00 [012] 332 len: 9 data: abandons0x00 [013] 320 len: 9 data: abandons0x00 [014] 308 len: 6 data: abase0x00 [015] 296 len: 6 data: abase0x00 [016] 284 len: 7 data: abased0x00 [017] 272 len: 7 data: abased0x00 [018] 256 len: 10 data: abasement0x00 [019] 240 len: 10 data: abasement0x00 [020] 224 len: 11 data: abasements0x00 [021] 208 len: 11 data: abasements0x00 [022] 196 len: 7 data: abases0x00 [023] 184 len: 7 data: abases0x00 [024] 172 len: 6 data: abash0x00 [025] 160 len: 6 data: abash0x00 [026] 148 len: 8 data: abashed0x00 [027] 136 len: 8 data: abashed0x00 $2 = 0 (gdb)
The __db_prnpage function displays any page in the database, as specified by a page number argument. The dbp->mpf pointer references a DB_MPOOLFILE structure, which is the per-process shared memory buffer pool structure.
(gdb) whatis dbp->mpf type = DB_MPOOLFILE * (gdb) print __db_prnpage(dbp->mpf, 2) page 2: (btree leaf) lsn.file: 0 lsn.offset: 0 prev: 0 next: 3 level: 1 entries: 28 offset: 136 [000] 500 len: 6 data: aback0x00 [001] 488 len: 6 data: aback0x00 [002] 476 len: 6 data: abaft0x00 [003] 464 len: 6 data: abaft0x00 [004] 452 len: 8 data: abandon0x00 [005] 440 len: 8 data: abandon0x00 [006] 424 len: 10 data: abandoned0x00 [007] 408 len: 10 data: abandoned0x00 [008] 392 len: 11 data: abandoning0x00 [009] 376 len: 11 data: abandoning0x00 [010] 360 len: 12 data: abandonment0x00 [011] 344 len: 12 data: abandonment0x00 [012] 332 len: 9 data: abandons0x00 [013] 320 len: 9 data: abandons0x00 [014] 308 len: 6 data: abase0x00 [015] 296 len: 6 data: abase0x00 [016] 284 len: 7 data: abased0x00 [017] 272 len: 7 data: abased0x00 [018] 256 len: 10 data: abasement0x00 [019] 240 len: 10 data: abasement0x00 [020] 224 len: 11 data: abasements0x00 [021] 208 len: 11 data: abasements0x00 [022] 196 len: 7 data: abases0x00 [023] 184 len: 7 data: abases0x00 [024] 172 len: 6 data: abash0x00 [025] 160 len: 6 data: abash0x00 [026] 148 len: 8 data: abashed0x00 [027] 136 len: 8 data: abashed0x00 $1 = 0 (gdb)
The __db_dump function dumps the entire database to a file. The dbp pointer references a DB structure as might be returned by the db_open function. After this command has been run, the file /tmp/dump will have a copy of the entire database. This is often useful to compare all the changes in the database after running a single subroutine that may have split pages and/or otherwise modified more than a single page.
(gdb) whatis dbp type = DB * (gdb) print *dbp $3 = {mutexp = 0x0, type = DB_BTREE, dbenv = 0x807b000, mp_dbenv = 0x0, master = 0x807d000, internal = 0x807d100, mp = 0x807b080, mpf = 0x807e000, curs_queue = {tqh_first = 0x807e040, tqh_last = 0x807e048}, handleq = { lh_first = 0x807d000}, links = {le_next = 0x0, le_prev = 0x807d028}, log_fileid = 0, txn = 0x0, locker = 0, lock_dbt = {data = 0x0, size = 0, ulen = 0, dlen = 0, doff = 0, flags = 0}, lock = {pgno = 0, fileid = "\000\004\017\001\001 \000\a5\223řÍ\000\000\000\000\000\000\000"}, pgsize = 512, db_malloc = 0, close = 0x804a810, cursor = 0x8064540 <__bam_cursor>, del = 0x8066554 <__bam_delete>, fd = 0x804aa60 , get = 0x80649b0 <__bam_get>, put = 0x8067b50 <__bam_put>, stat = 0x806c708 <__bam_stat>, sync = 0x8063f30 <__bam_sync>, flags = 80} (gdb) print __db_dump(dbp, "/tmp/dump", 1) $4 = 0 (gdb)


@* * Copyright 2021 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import config.AppConfig @import views.html.agent.partials._ @import java.time.LocalDate @this(mainTemplate: MainTemplate, clientDetailsPartials: ClientDetailsPartials, optOutForMTDVATPartial: OptOutForMTDVATPartial, registrationPartial: RegistrationPartial, signUpPartial: SignUpPartial, vatCertificatePartials: VatCertificatePartials, vatReturnsPartial: VatReturnsPartial) @(details: CustomerDetails, vrn: String, currentDate: LocalDate)(implicit messages: Messages, appConfig: AppConfig ,user: User[_]) @mainTemplate(title = messages("agentHub.heading"), bodyClasses = None, mainClass = Some("full-width")) {


Tue Mar 4, 2008
On Friday I had the pleasure of attending the 27th Pearls book launch, the annual anthology of creative writing works by Douglas College students. My story, The Reluctant Teacher, was published in it this year. I’ve had some poetry published in Pearls before, but that was about 8 years ago, so it’s been a while. A few of the authors read by candlelight and I got to see a few familiar faces. Good times.


"x" "1" "LAVOIE,EJ, DEFAUW,J, FEALY,M, WAY,BM AND MCQUEEN,CA, GENOTOXICITY OFFLUOROQUINOLINES AND METHYLQUINOLINES, CARCINOGENESIS 12(2):217-220,1991"


Login
Email
Password
Login your account
By creating an account, you agree to our
Terms of Use
and our
Privacy Policy
.
Create account?
Registration / SignUp


Akhan Name BirthDay Predictor is an application that calculates the date a user was born when he or she inputs their birth date. THis application is based on the Ghanian culture, whereby names are given in accordance to the birth day


Jetspeed MyFaces Demo Portlet leverages Sun's Guess Number reference implementation sample application to illustrate how a MyFaces based portlet using Jetspeed 2 JSF bridge should be configured.
Jetspeed 2 provides a JSF bridge implementation to support JSF with the Portlet Specifications. This section describes the necessary configuration required in order to use Jetspeed 2 JSF bridge.
The modifications required in order to deploy a MyFaces application as a portlet need to be made to the portlet.xml file. An <init-param> should be added to the portlet.xml as described below:
<init-param> <name>ViewPage</name> <value>/greeting.jsp</value> </init-param>
The parameter ViewPage indicates to the org.apache.portals.bridges.jsf.FacesPortlet which view should be used as a default view.
Additionally, the <portlet-class> element should specify the MyFaces generic portlet implementation as described below:
<portlet-class>org.apache.portals.bridges.jsf.FacesPortlet</portlet-class>
This final portlet.xml should look like:
<portlet id="guessNumber"> <init-param> <name>ViewPage</name> <value>/greeting.jsp</value> </init-param> <description>JSF GuessNumber Portlet - Using J2 JSF Bridge</description> <portlet-name>guessNumber</portlet-name> <display-name>JSF GuessNumber Portlet - J2 JSF Bridge</display-name> <portlet-class>org.apache.portals.bridges.jsf.FacesPortlet</portlet-class> <supports> <mime-type>text/html</mime-type> <portlet-mode>VIEW</portlet-mode> <portlet-mode>EDIT</portlet-mode> <portlet-mode>HELP</portlet-mode> </supports> <portlet-info> <title>GuessNumber Portlet</title> <short-title>guessNumber</short-title> </portlet-info> </portlet>