French president calls Bosnia a 'ticking time-bomb'
Emmanuel Macron remarks that Europe's biggest concern in the Balkans is the 'problem of returning jihadists' in Bosnia.
French President Emmanuel Macron has described Bosnia and Herzegovina as a "ticking time-bomb" and the greatest concern for Europe in the Balkans due to what he said was its "problem of returning jihadists".
Croat member of Bosnia's presidency, Zeljko Komisic, said he would summon France's ambassador to Sarajevo for an explanation of the comments Macron made in an interview with The Economist magazine, published on Thursday.
More:
Asked about his successful bid in October to block Albania and North Macedonia from starting European Union membership talks, Macron said neither of the two nations was the primary source of concern in the Balkans.
"If you're concerned about this region, the first question is neither Macedonia, nor Albania, it's Bosnia-Herzegovina. The time-bomb that's ticking right next to (the EU member) Croatia, and which faces the problem of returning jihadists," Macron said, referring to escaped or released fighters from the Islamic State of Iraq and the Levant (ISIL or ISIS) armed group who could return to Europe.
The French Foreign Ministry had no immediate response to the reaction in Bosnia.
A spokesman for Bosnia's Islamic community, Muhamed Jusic, described Macron's comments as "scandalous" and said the French president was slandering Bosnia to justify preventing Balkan countries with "significant Muslim populations" from fulfilling their aspirations of EU membership.
"Some 300 Bosnian citizens, most of them women and children, went to the battlefields in Syria and Iraq compared to over 1,900 French," Jusic said, adding that France has double the number of foreign fighters than any other western European country.
"These days, France awaits the return of 450 jihadists. ... I don't see how this is a bigger problem in Bosnia than in France," he added.
The Associated Press wrote in 2015 that out of a continental total of 5,000 fighters who have gone to Iraq and Syria, "France has the uncomfortable distinction of being Europe's leading exporter of jihadis."
According to Bosnian intelligence, 241 adults and 80 children left Bosnia or the Bosnian diaspora between 2012 and 2016 for Syria and Iraq, where 150 more children were born.
About 100 adults, some half of them women, remain there, while at least 88 have been killed or died.
In 2014, Bosnia became the first country in Europe to introduce prison terms of up to 10 years for its citizens who fight in conflict abroad or recruit others to do so.
Fighters who have since returned to the country were tried and, in most cases, sentenced to prison.
Many criticised Macron's statement on Twitter.
Translation: "You can be secular, progressive, modern, whatever and how much you want. It doesn't matter because a Bosnian Muslim, Bosniak, Bosnian is always a terrorist and a jihad fighter."
Others noted how Macron's controversial statement parrots the unfounded allegations made by Croatian President Kolinda Grabar-Kitarovic, her office and Croatian MEPs over the years that Bosnia is a security threat that is harbouring fighters.
In March, news broke that Croatian intelligence had attempted to plant weapons and explosives in a mosque in Bosnia as part of a false flag operation, confirmed by Bosnia's minister of security.


fun DataFrame.toMap(): Map<String, Array<*>>
Expose a view on the data as map from column names to nullable arrays.
In particular, this allows to use dataframes as input for lets-plot (see https://github.com/holgerbrandl/krangl/issues/86).


Class FrequencyEntryForm
A dialog for manual entry of the frequency.
Inheritance
FrequencyEntryForm
Implements
Namespace: VE3NEA.HamCockpit.SharedControls
Assembly: VE3NEA.HamCockpit.SharedControls.dll
Syntax
public class FrequencyEntryForm : Form, IDropTarget, ISynchronizeInvoke, IWin32Window, IBindableComponent, IArrangedElement, IComponent, IDisposable, IContainerControl
Remarks
This dialog is used in the FrequencyDisplayPanel control for manual entry of the frequency to tune to.
Constructors
| Name | Description |
|---|---|
| FrequencyEntryForm() | Initializes a new instance of the FrequencyEntryForm class. |
Fields
| Name | Description |
|---|---|
| EnteredFrequency | The frequency entered by the user, in Hertz. |
Methods
| Name | Description |
|---|---|
| Dispose(Boolean) | Clean up any resources being used. |


Retrieve a Range of Data Using thingSpeakRead
This example shows how to retrieve a range of data for a channel using available name-value pairs.
Contents
Inspect fields present in the channel
Display channel information to inspect field descriptions.
[~,~,channelInfo] = thingSpeakRead(12397); channelInfo
channelInfo = ChannelID: 12397 Name: 'WeatherStation' Description: 'MathWorks Weather Station, West Garage, Natick, MA...' Latitude: 42.2997 Longitude: -71.3505 Altitude: 60 Created: [1x1 datetime] Updated: [1x1 datetime] LastEntryID: 625927 FieldDescriptions: {1x8 cell} FieldIDs: [1 2 3 4 5 6 7 8] URL: 'https://api.thingspeak.com/channels/12397/feed.json?'
Observe there are eight fields, but the descriptions are not visible. To see the descriptions, display the FieldDescriptions.
channelInfo.FieldDescriptions'
ans = 'Wind Direction (North = 0 degrees)' 'Wind Speed (mph)' '% Humidity' 'Temperature (F)' 'Rain (Inches/minute)' 'Pressure ("Hg)' 'Power Level (V)' 'Light Intensity'
The descriptions correspond to the IDs shown in the FieldIDs.
channelInfo.FieldIDs
ans = 1 2 3 4 5 6 7 8
Looking at the FieldDescriptions we can see that Humidity is at index 3.
channelInfo.FieldDescriptions{3}
ans = % Humidity
Index 3 of the FieldIDs tells us that the ID is also equal to 3.
channelInfo.FieldIDs(3)
ans = 3
In this case, the ID was the same as the index, but that may not always be the case.
Download the last 10 minutes of Field 3.
[data,timestamps,channelInfo] = thingSpeakRead(12397,'Fields',3,... 'numMinutes',10);
Check the timestamps to verify the data.
timestamps(1) timestamps(end)
ans = 17-Aug-2015 07:19:59 ans = 17-Aug-2015 07:29:00
Find the mean between data points.
mean(diff(timestamps))
ans = 00:01:00
Time between data points is 1 minute and for 10 minutes of data requested, you should see 10 data points returned.
length(timestamps)
ans = 10
Plot the data. There might be fewer than 10 points if the sensor missed a few measurements.
figure plot(timestamps,data,'ro-') title(sprintf('ThingSpeak Channel %d\n%s',channelInfo.ChannelID,channelInfo.Name)) xlabel('Time') ylabel(channelInfo.FieldDescriptions{3}) legend(channelInfo.FieldDescriptions{3})
Download the last month of recorded data
Finally, let's download all of the Humidity data. ThingSpeak will always send the most recent data of the date range that you specify. This means that if you specify a date range that has a number of total points within the maximum number of points that it can send, that you will receive all of the points. However, if you specify too wide of range, you will only receive 8000 points from the end of your range backwards towards the start time. Let us try this.
Download data for the last 30 days
[data,timestamps] = thingSpeakRead(12397,'Fields',3,'NumDays',30);
The warning received indicates that the full number of days was not read. Examine the length of the data to see if there is a mismatch with the ThingSpeak data limits.
length(data)
ans = 8000
ThingSpeak.com limits the data at 8000 points for a single query. Plot the data returned so far.
figure plot(timestamps,data,'b-') title(sprintf('ThingSpeak Channel %d\n%s',channelInfo.ChannelID,channelInfo.Name)) xlabel('Date') ylabel(channelInfo.FieldDescriptions{3}) legend(channelInfo.FieldDescriptions{3})
Therefore, if we need to request more data than allowed in a single call, we can use a for loop to get data for multiple days.
startDate = datetime('now', 'TimeZone', 'local') - calmonths(1); endDate = datetime('now', 'TimeZone', 'local'); dateVector = startDate:caldays(1):endDate; data = []; timestamps = []; for nDays = 1:numel(dateVector)-1 [dataPrev,timestampsPrev] = thingSpeakRead(12397,'Field',3,... 'DateRange', [dateVector(0+nDays), dateVector(1+nDays)]); data = [data; dataPrev]; timestamps = [timestamps; timestampsPrev]; end
Plot the full data.
figure plot(timestamps,data,'r-') title(sprintf('ThingSpeak Channel %d\n%s',channelInfo.ChannelID,channelInfo.Name)) xlabel('Date') ylabel(channelInfo.FieldDescriptions{3}) legend(channelInfo.FieldDescriptions{3})


T3A03-Webpage-Natasha.html
There's lots of fun stuff you can do with text.
For example: This is bold, this is italic, and this is underlined.
You can combine them, too!
Here's an ordered list of the best cat breeds.
- Maine Coon
- Burmese
- Scottish Fold
Here's an unordered list of cat breeds that are also pretty great.
- Abysinnian
- Siamese
- Ragdoll
- Norwegian Forest cat
This link will take you to a tutorial on HTML.
Here's a table.
Holy cow, that's outta this world!


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/solve_by_elim.html ---
@Simon Hudon, the new solve_by_elim is really nice, and now I’d like it to do even more. I know that there is a mechanism to pass arbitrary assumptions, rather than using local context, and perhaps I should just use that.
But a particular thing I find myself using frequently now is applying eq.symm to various things in the context, before solve_by_elim can do its thing.
That's interesting. Maybe I could add cc
to solve_by_elim
. In terms of performance, I don't know what kind of slow down that would be but maybe this could be enabled by solve_by_elim!
The other thing I'm finding I have to do is replace a hypothesis h : f = g
with funext
applied to it, to get h' : \forall x : X, f x = g x
.
Can you try something for me? Write:
meta def my_solve_by_elim (asms : option (list expr) := none) : opt_param ℕ 3 → tactic unit | 0 := done | (succ n) := apply_assumption asms $ cc <|> my_solve_by_elim n
and tell me if that does the job
Again, it would be nice to automate a bit.
I'll investigate, thanks.
For the second bit, maybe adding simp [function.funext_iff] at *
before solve_by_elim
would help.
(function.funext_iff
is a new theorem in mathlib
)
(ha, I'd actually just written funext_iff
myself)
No, cc
doesn't seem to help here.
Can you should me a situation where the issue arises?
Oh -- a bug in solve_by_elim: the recursive call doesn't pass the arguments asms.
Well, maybe this is too trivial ... :-)
lemma f {α} (a b : α) (p : a = b) : b = a := begin my_solve_by_elim end
It doesn't need to because it's declared on the left of :
ah, great, sorry.
This example could be handled by cc
on its own
I guess it's obviously not going to help here...
what does solve_by_elim
do?
repeatedly tries to apply hypotheses, discharging new goals created by apply
by calling itself
(i.e. discharging them by matching against other hypotheses)
@Scott Morrison Can you show me something that cc
doesn't solve?
I'll have to look further. I'll try to see how much cc
and solve_by_elim
together let me automate, and get back to you if I find such an example.
cool :)
btw, have you tried tauto
? Does it help?
no, I haven't looked much at tauto yet. I already have tactics that do a lot of automatic cases
, so I'm guessing it won't help much?
The other pattern I have all the time is: a hypothesis p : x = y
, where x
and y
are terms of some structure type S
, then I go: have p' := congr_arg S.f p, solve_by_elim
.
It would be lovely to handle that automatically... that is, not just apply hypotheses, but apply structure fields congr_arg
d over hypotheses.
That's an interesting case. It's a bit like funext_iff which we talked about earlier in that we infer the equality of the parts from the equality of the whole. I feel like there's probably a greek-letter-reduction for that
I'm wondering if congr_arg
/ funext_iff
/ cc
might be the best combination
I'm not sure what you mean. I guess what I'm hoping for it some automation for finding the correct applications of congr_arg
.
(i.e. work out for itself what the field S.f
should be in my example above: have p' := congr_arg S.f p
.)
If I see x = y
where x
and y
are functions, I'd specialize ∀ i, x i = y i
for every i
such that x i
appears in the context. Same thing y
. I'd do the same with the fields of structure types
I'll write something, make a PR to mathlib and send you a link. How about that?
sounds amazing :-)
Do you have an example where that would be useful? All the examples I can think of can be handled directly by cc
cc
successfully solves
example {α β : Type} (f g : α → β) (w : g = f) (y : α) : f y = g y := by cc
but not
example {α β : Type} (f g : α → β) (w : (λ x, g x) = (λ x, f x)) (y : α) : f y = g y := by cc
Does anyone see some slight generalisation of cc
(and/or possibly solve_by_elim
) that can handle the second case?
This example is unnecessarily complicated, sorry: even this pair:
example {α β : Type} (f g : α → β) (w : f = g) (y : α) : f y = g y := by cc -- success example {α β : Type} (f g : α → β) (w : (λ x, f x) = (λ x, g x)) (y : α) : f y = g y := by cc -- FAIL
shows what's going on
What happens if you call simp
on w
before cc
? If it does eta reduction, then cc
should succeed
That does work, but only because my MWE is too M!
Maybe
example {α : Type} (f g : α → α) (w : (λ x, f (f x)) = (λ x, g (g x))) (y : α) : f (f y) = g (g y) :=
shows more of what I want.
That sounds like my conversations with my advisor: "- what are you looking at now? - Large scale software. - Cool, do you have a small example to illustrate your idea? - ..."
scott, you are talking higher order matching here. It's very unlikely you will get something as powerful as what you are envisioning. Your best bet is to apply (reverse) funext on your hypotheses to turn it into a first order problem
By reverse funext, do you mean congr_fun
?
yes, with some beta postprocessing
Maybe @Scott Morrison would be satisfied with converting f (f x)
to (f o f) x
. Then simp, cc
would be good enough.
My point is that if \forall x, f (f x) = g (g x)
was in the context instead of the lambda equality, I think cc would get it... maybe. (Honestly I don't understand how cc works, and I never trust it for anything significant.)
It seems to work a bit like the ematching feature of smt solvers, doesn't it? I wouldn't count on it to do any specialization
@Mario Carneiro, thanks, this had been my past solution, but I'd been a bit worried by it. I'll leave it in place for now.
@Scott Morrison Can you elaborate on why you prefer the equality between lambda terms?
It’s just that the earlier steps of my automation are giving my equalities
between lambdas as hypotheses, and I’m having trouble automatically always
getting these into a form that cc / solve_by_elim / rewrite_search can deal
with. I think just replacing hypotheses which are equations between
functions types with foralls will do the job, and doesn’t seem to cause
problems elsewhere.
Congruence closure (cc
) performs purely equational reasoning via congruences. It can prove a=b, c=b |- f a = f c
, but that's essentially it. One nice feature is that since it uses the congruence lemmas, it effectively ignores subsingleton arguments.
It definitely won't solve forall x, f x = g x |- f a = g a
or fun x, f x = g x |- f a = g a
. (They're clearly equivalent via funext, as you've observed.) If you solve such problems, then you have a first-order prover---and this is out of scope for cc
. Congruence closure is supposed to be fast, predictable, and well, do congruence closure (and not general first-order proving).
Re: E-matching. Yes, you can solve the example with forall x, f x = g x
using it (I think by[smt] eblast
should do it). What E-matching does is that it heuristically generates instances of universally quantified formulas (I think the ematch
tactic uses the local context and lemmas tagged [ematch]
). In the example it would generate the instance f y = g y
, and with this instance cc
can solve the goal. The instance f y = g y
is generated because the trigger f ?m_1
(in this example the lhs of the lemma) E-matches a currently known subterm, namely f y
(the lhs of the target in the example).
@Simon Hudon, how would you feel about generalising the definition of solve_by_elim
to
meta def solve_by_elim (asms : option (list expr) := none) (discharger : tactic unit := tactic.done) : opt_param ℕ 3 → tactic unit | 0 := tactic.done | (n+1) := discharger <|> (tactic.interactive.apply_assumption asms $ solve_by_elim n)
I find myself using this as solve_by_elim none cc
frequently and it's very helpful.
Won't you have to write this as tactic.cc
in an interactive tactic script?
I like it. Let's switch the order of asms
and discharger
though.
@Mario Carneiro Why? cc
is also in tactic.interactive
, no?
but if it's not being parsed in interactive mode, you have to use the right namespace
one option is to have an itactic
for the discharger, then you can write {cc}
or some other tactic block
Right. Alternatively, we can provide a variant such as solve_by_elim_with { cc }
with a itactic
argument (and a better name)
I think you can still make it optional
No because itactic
doesn't use the same parsing framework as everything else
Have you used asms
? I think it needs a parser
If we don't want multiple tactic names, we'd have to live with solve_by_elim { }
when we don't use that feature.
or stick with just passing a regular tactic and live with solve_by_elim `[cc]
Have you used
asms
? I think it needs a parser
I haven't used it in interactive mode. I think similarly to the options that you can feed simp
(e.g. { single_pass := tt }
) you can give it a literal as an expression
@Simon Hudon just checking -- should I PR this, or would you prefer to do it? I'm happy either way.
Hi @SimonHudon, I'm finding often solve_by_elim
would succeed, except for the fact that an applicable equation needs to be wrapped in eq.symm
first. In this case, {discharger := cc}
works, but this tends to be very expensive and I'd really like to avoid it.
It's certainly possible to pass a more limited discharger, that just tries to apply hypotheses backwards, but I'm wondering what you think about building this behaviour in?
(e.g. by writing a version of apply
that knows about symmetric relations, and then using that --- I'd be happy to implement if you thought this was reasonable behaviour)
I think that's feasible. We could probably define it as sym_apply (r) := apply r <|> (symmetry >> apply r)
oh, that's much sneakier than what I had in mind
Currently in apply_assumption
you do an initial filtering step by find_matching_head
, and I guess this wouldn't be viable.
Do you know if this actually saves much time? I'd hope that apply
returns very quickly on anything find_matching_head
had discarded.
You're right. I have a feeling we could get rid of the filtering. I'm not sure that testing the assumptions is any faster than just applying them
It might actually be slower because we might be doing the same work twice
I naively copied the behavior of assumption
when I wrote that tactic. I didn't spend too much time thinking of the performances. It might be interesting to remove the filtering and measure the performances before adding the symmetry
The other thing I'm wondering is if we should try every assumption directly first and only then try symmetry or try symmetry as we go. The upside of the first approach is that when you don't need symmetry, you get better performances. The downside is that you can't say that the tactic applies "the first assumption that matches" anymore. If assumption 11 matches directly and assumption 2 matches modulo symmetry, which one do we want the tactic to pick?
Hmm... my preference is to just make the change. :-) We do need some better tools for measuring performance. I know I neglect doing it, and then suffer for it later. (e.g. just now realising that letting solve_by_elim call cc
can be very expensive)
I would prefer just making the change too. I guess the rest is for extra credits :D
interesting... my inclination is to try symmetry as we go. When we're using apply
, the semantic difference between a=b
and b=a
has pretty much disappeared.
In that case, https://github.com/leanprover/mathlib/pull/164
I prefer that too. And my intuition is that the difference in performances will be unnoticeable
That was fast!
The added benefit is the code gets shorter and neater :)
Would you care to add a test case?
Sure!
Can I somehow tag certain lemmas with some attribute so that solve_by_elim
picks them up?
local attibute [use_for_solving] foo bar xyzzy
Sorry... I better get on with 'back'.
This is one of the main features.
Well, my talk is next week, on Tuesday :thinking: …
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


One domain is identified during the installation process and additional domains can be added. When you add a domain you configure the Global Address List (GAL) mode and the Authentication mode for the domain. You can also set up virtual hosts, and limit the number of accounts that can be created on the domain.
To add a domain, click Configure>Domains in the Navigation pane and in the gear icon and select New. The Create New Domain wizard walks you through the steps to add the new domain.
On the General Information dialog box, enter the following information.
Domain name. Enter the full name of the domain ( domainexample.com).
Public service host name. Enter the host name of the REST URL. This is the URL that is used when sharing email folders, Briefcase folders, sharing Task lists, Address Books, and Calendars. Setting this up includes configuring the Public Service Protocol and the Public Service Port.
Inbound SMTP host name. If your MX records point to a spam-relay or any other external non-Zmail server, enter the name of the server here
Description. Text field that displays in the Domain list in the Content pane.
Maximum accounts for this domain. Enter the maximum number of accounts that can be created on this domain. The number entered here is displayed in the Account Limits tab. The default is no limit (blank field).
DefaultClass of Service (COS) for the domain. If you do not enter a COS, the default COS is used. The COS entered here is automatically assigned to accounts created on the domain if no other COS is selected.
Domain status. The domain status is active in the normal state. You may want to change this status when you setting up the domain if you are not ready to use the domain.
Notes you want to add about the domain.
GAL Search Setting. Choose the GAL mode, either Internal, External, or Both. The default is Internal.
(Optional) Change the maximum number of search results returned for a GAL Search. The default is 100 results.
Enter the GAL Sync Account name. This account syncs to the LDAP, and all GAL contacts in LDAP are added to the Address Book.
Enter the data source name for the GAL sync.
If you selected an external GAL, configure the external LDAP settings.
Set the Internal GAL polling interval in days, hours, minutes, or seconds. This is the frequency that the GAL sync account is updated.
Configure the Authentication Mode.
If you selected Internal as the GAL mode, no other authentication configuration is required. Click Next.
If the authentication mechanism is External LDAP or External Active Directory, the next step is to configure the authentication mode .
Virtual Hosts. (Optional) Enter the virtual host address. Virtual hosting allows you to host more than one domain name on a server. When you create a virtual host, this becomes the default domain user login.
Briefcase. Configure the name that should be displayed in the prompt on the Authentication Required dialog used to log into Briefcase folders shared with external guests. The default is Zmail.
Click Finish to create the domain.


Hello! My name is Tatiana Shatilova, and I'm an experienced hard-working Web developer
specialised on front-end.
My technical expertise is in accessibility, user experience, performance tuning and cross-browser compatibility using
JavaScript, HTML5, CSS3,
ASP.NET MVC, C#.
Have high code quality standards. Enjoy being a part of a productive experienced team; equally comfortable working on my own projects.
Currently, I work as a full-stack web developer in Moscow,
Russia.
Given the right opportunity, I am ready to move pretty much anywhere.


{% extends "w_base.html" %} {% load static from staticfiles %} {% load request_tags %} {% load bootstrap %} {% load workshift_tags %} {% block w_headers %} {% endblock %} {% block w_content %}
Regular Hourly Requirement should be used to adjust how many hours a workshifter owes each week (i.e. Reducing the number of hours a member with a disability owes).
Hour Adjustment is meant as a fallback method to adjust a workshifter's standing. However it is usually preferrable to instead add completed hours via an instance of a workshift (i.e. "Out of town for the week, credited 5 hours"). This ensures that workshift credits are publicly available and easier to review at a future date. Positive numbers here add hours to a workshifter's standing, while negative numbers subtract hours away.


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface ExampleExpression
Query by Example expression.
Pass in an example entity and for each non-null scalar properties an expression is added.
By Default this case sensitive, will ignore numeric zero values and will use a Like for string values (you must put in your own wildcards).
To get control over the options you can create an ExampleExpression and set those options such as case insensitive etc.
// create an example bean and set the properties // with the query parameters you want Customer example = new Customer(); example.setName("Rob%"); example.setNotes("%something%"); List<Customer> list = Ebean.find(Customer.class) .where() // pass the bean into the where() clause .exampleLike(example) // you can add other expressions to the same query .gt("id", 2) .findList();Similarly you can create an ExampleExpression
Customer example = new Customer(); example.setName("Rob%"); example.setNotes("%something%"); // create a ExampleExpression with more control ExampleExpression qbe = new ExampleExpression(example, true, LikeType.EQUAL_TO) .includeZeros(); List<Customer> list = Ebean.find(Customer.class) .where() .add(qbe) .findList();
| Method Summary | |
|---|---|
ExampleExpression |
caseInsensitive()
Set case insensitive to true. |
ExampleExpression |
includeZeros()
By calling this method zero value properties are going to be included in the expression. |
ExampleExpression |
useContains()
Use contains expression for string properties. |
ExampleExpression |
useEndsWith()
Use endsWith expression for string properties. |
ExampleExpression |
useEqualTo()
Use equal to expression for string properties. |
ExampleExpression |
useStartsWith()
Use startsWith expression for string properties. |
| Method Detail |
|---|
ExampleExpression includeZeros()
By default numeric zero values are excluded as they can result from primitive int and long types.
ExampleExpression caseInsensitive()
ExampleExpression useStartsWith()
ExampleExpression useContains()
ExampleExpression useEndsWith()
ExampleExpression useEqualTo()
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


Copyright © 2015 Guilherme Andrade
Version: 1.0.0
Authors: Guilherme Andrade (erlwitness(at)gandrade(dot)net).
erlwitness
: Semantic process groups watchtower.
erlwitness
allows one to funnel both gen_server
events (init, calls, casts, infos, state changes) and lager
calls specific to identified entities into arbitrary watcher processes.
For example: remote activity tracers for sizeable software development teams (instead of _hey, may you please check the log?_)
- Multiple watchers can spy on the same entity; - A single watcher can spy on multiple entities; - An entity can consist of zero or more processes that come and go; - Watching works transparently on both local and remote nodes; - Watching can be initiated both before and after entity processes have been spawned. - Lager calls are (optionally) watchable through a parse_transform.
There are two main parts to an ordinary setup:
1) Adapt your existing entities' gen_server:start / gen_server:start_link / init calls to make use of the relevant registration flow:
% ....
-behaviour(gen_server).
% ...
%% Uncomment to allow for lager tracing
%-compile([{parse_transform, erlwitness_transform}]).
start_link(Person, Files, LuckyNumber) ->
{WrappedArgs, StartOptions} = erlwitness:get_start_extras({person, Person},
person_file_serv,
[Files, LuckyNumber]),
gen_server:start_link(?MODULE, WrappedArgs, StartOptions).
init(WrappedArgs) ->
[Files, LuckyNumber] = erlwitness:unwrap_init_args(WrappedArgs),
InitResult = {ok, #state{files = Files,
lucky_number = LuckyNumber}},
erlwitness:finalize_init(WrappedArgs, InitResult).
% ....
2) Code your own watcher process which will implement both gen_server
and erlwitness_watcher
behaviours:
% ...
-behaviour(gen_server).
-behaviour(erlwitness_watcher).
% ...
start_link(Person) ->
erlwitness_watcher:start_link([{person, Person}], ?MODULE, []).
% ...
handle_gencall_event(Timestamp, {person, Person}, PersonPid, PersonProcType,
PersonProcName, Call, From, State) ->
io:format("Here's a call: ~p~n", [{Timestamp, Person, PersonPid,
PersonProcType, Call, From}]),
{noreply, State}.
handle_gencast_event(Timestamp, {person, Person}, PersonPid, PersonProcType,
PersonProcName, Cast, State) ->
io:format("Here's a cast: ~p~n", [{Timestamp, Person, PersonPid,
PersonProcType, Cast}]),
{noreply, State}.
handle_geninfo_event(Timestamp, {person, Person}, PersonPid, PersonProcType,
PersonProcName, Info, State) ->
io:format("Here's an info: ~p~n", [{Timestamp, Person, PersonPid,
PersonProcType, Info}]),
{noreply, State}.
handle_newstate_event(Timestamp, {person, Person}, PersonPid, PersonProcType,
PersonProcName, PersonState, State) ->
io:format("Here's a new state: ~p~n", [{Timestamp, Person, PersonPid,
PersonProcType, PersonState}]),
{noreply, State}.
handle_lager_event(Timestamp, {person, Person}, PersonPid, PersonProcType,
PersonProcName, LagerMFA, LagerDebugInfo, State) ->
{_LagerModule, LagerLevel, LagerArgs} = LagerMFA,
{CodeModule, CodeFunction, CodeLine} = LagerDebugInfo,
io:format("Here's a lager message from ~p: ~p @ ~p~n",
[{Timestamp, Person, PersonPid, PersonProcType, PersonState},
{LagerLevel, LagerArgs}, {CodeModule, CodeFunction, CodeLine}]),
{noreply, State}.
% ..
.. and optionally, 3) Reuse your existing entity registration code by implementing the erlwitness_lookup
behaviour and adjusting erlwitness
app.config acordingly.
% ...
-behaviour(erlwitness_lookup).
% ...
lookup_global_entity({person, Person}) ->
PeopleInfo = mnesia:dirty_read(person_info, Person),
[{person_file_serv, PersonInfo#person_info.file_serv_pid} || PersonInfo <- Pids].
% ...
Full implementations under _example/_.
app.config:
[{erlwitness, [
% Optional; module implementing 'erlwitness_lookup' behaviour
%{entity_lookup_module, erlwitness_index_serv},
%
% Optional; defaults to 10 * NumberOfSchedulers
%{erlwitness_index_serv_count, N :: pos_integer()}
]}
].
{parse_transform, erlwitness_transform}
This software is built on the premise that watchers are few, rare, and mostly limited
to development environments; therefore watching is heavy and privacy is light.
- Unwatched processes: basic ETS lookup just before the process starts + a single process dictionary check for every lager
call;
- Watched processes: one OTP debug fun per watcher (see [sys(3)](http://www.erlang.org/doc/man/sys.html)) + lager
calls redirection.
This software is a building block; tracking and monitoring entity processes on a watcher is left as an exercise for the reader.
erlwitness_index_serv
is bundled as an out-of-the-box solution; it might not, however, suit your needs. Please mind that it will, for each spawned entity:
- 1) Write a new entry to an ETS table (on erlwitness:finalize_init/2
);
- 2) Create a monitor from a specific worker on the indexing pool;
- 3) Trigger the monitor on termination in order to unregister the entity.
In order to lax this potential bottleneck, the indexing pool will spawn (_10 x NumberOfSchedulers_) monitoring processes by default, with one separate ETS table per indexer, and NumberOfSchedulers generally (but not always) corresponding to the number of CPU thread queues (usually _NumOfCPUs x NumOfCoresPerCPU x (1 + HyperthreadPerCore)_).
However, if you already have your own global process directory in place, it's recommended that you use it instead.
Generated by EDoc, Oct 11 2015, 19:05:56.


WCV brings cardiac care and medical resources to developing countries. Our mission is to improve care for individuals with easily treatable heart diseases. We do this by training local cardiac care professionals in advance techniques. We also provide local hospitals with essential equipment and resources from our partners.


Legend
class Legend extends JsonConfig (View source)
Legend ConfigObject
An object containing all the values for the legend which can be passed into the chart's options.
Constants
| TYPE |
Type of JsonConfig object
|
Methods
Builds the legend object when passed an array of configuration options.
Shortcut method to set the value of an option and return $this.
Parses the config array by passing the values through each method to check validity against if the option exists.
Details
at line 50
__construct(
array $config = array())
Builds the legend object when passed an array of configuration options.
in
JsonConfig at line 64
mixed
__get(
string $option)
Get the value of a set option via magic method.
in
JsonConfig at line 75
Options
getOptions()
Gets the Options object for the JsonConfig
in
JsonConfig at line 90
JsonConfig
setOption(
string $option,
mixed $value)
Shortcut method to set the value of an option and return $this.
In order to maintain backwards compatibility, ConfigObjects will be unwrapped.
in
JsonConfig at line 106
setOptions(
array $config)
Parses the config array by passing the values through each method to check validity against if the option exists.
in
JsonConfig at line 275
array
jsonSerialize()
Custom serialization of the JsonConfig object.
at line 71
Legend
position(
string $position)
Sets the position of the legend.
Can be one of the following: 'right' - To the right of the chart. Incompatible with the vAxes option. 'top' - Above the chart. 'bottom' - Below the chart. 'in' - Inside the chart, by the top left corner. 'none' - No legend is displayed.
at line 103
Legend
alignment(
string $alignment)
Sets the alignment of the legend.
Can be one of the following: 'start' - Aligned to the start of the area allocated for the legend. 'center' - Centered in the area allocated for the legend. 'end' - Aligned to the end of the area allocated for the legend.
Start, center, and end are relative to the style -- vertical or horizontal -- of the legend. For example, in a 'right' legend, 'start' and 'end' are at the top and bottom, respectively; for a 'top' legend, 'start' and 'end' would be at the left and right of the area, respectively.
The default value depends on the legend's position. For 'bottom' legends, the default is 'center'; other legends default to 'start'.
at line 121
Legend
textStyle(
array $textStyleConfig)
An array that specifies the legend text style options.


Do not link to this page - Use dated versions of the documents
This document has been superseded.
The information in this document was incorporated into the XG Report titled "Image Annotation on the Semantic Web," published by the W3C Multimedia Semantics Incubator Group.
Many applications that involve multimedia content make use of some form of metadata that describe this content. The goals of this document are (i) to explain what the advantages are of using Semantic Web languages and technologies for the creation, storage, manipulation, interchange and processing of image metadata, and (ii) to provide guidelines for doing so. The document gives a number of use cases that illustrate ways to exploit Semantic Web technologies for image annotation, an overview of RDF and OWL vocabularies developed for this task and an overview of relevant tools.
Copyright © 2007 W3C® (MIT, ERCIM, Keio), All Rights Reserved. W3C liability, trademark and document use rules apply.


Please sign in with one of the methods associated with {{methodError.email}}:
Is {{methodError.email}} not your email address? Start Over
Start Over


This chapter lists things to do, in contrast with the next one which describes
decisions to take. Ideally all the following items should be included in the
next release, but it's quite possible that some of them may lead to further
unresolved issues, especially since some tasks involve design rather than coding.
-
Revise the architecture of backends so as to make it simpler and more obvious
for others to understand what should be done to implement additional backends.
-
Document the backend API and conventions.
-
Add support for date and time fields, using Boost.DateTime as C++ counterpart.
-
Identify which additional types for parameters and fields should be supported.
-
Support dynamic typing by providing boost/TR1
any
input
parameters and field values.
-
Support composite data types / full row handling, both for user convenience
and to leverage batch query processing that might be supported by the underlying
technology.
-
Use TR1
tuple
for static typing.
-
Is an underlying collection necessary for dynamic typing or are iterators
sufficient? In the first case, should
std::vector
be used?
-
Support iterative statement composition, e.g. by providing an
add_parameter()
and a parameterless prepare()
member function to the
statement
class.
-
Revise the representation of connection parameters.
-
Consider using a collection of name/value pairs, to be passed unchanged
to the underlying DBMS.
-
Add support for stored procedures.
-
Revise the use of
traits
and value_buffer
for odbc::field
.
-
Unify the two?
-
Generalize everything that might be useful to implement other backends.
-
Handle iterated value retrieval from ODBC primitives (see
boost::sql_cli::odbc::row
).
-
Replace Dev-C++ with Code::Blocks as g++ IDE. Dev-C++ development appears
to have stopped and the IDE hasn't aged well. Code::Blocks appears to be
definitely more promising.
-
Port to 32 bit Linux.
-
Port to 64 bit systems.
-
A mechanism for the repetition of tests over different DBMS.
-
A local configuration file for the available DBMS's.
-
User's guide
-
Reference manual
-
Rationale
-
With a comparison with other libraries, especially SOCI.


Houston Library
Can be used as a context manager, in which case it will log out of the session
during __exit__(). If instantiated manually then this will also need to be done
manually. For security’s sake using spacewalk as a context manager is best.
-
class Houston.libhouston.Channel(label, spw)[source]
Object representing the state of a channel
| Parameters: |
- label (str) – Label of Channel to represent
- spw – Spacewalk object
|
| Returns: | Channel instance
|
The Channel object is the workhorse for any channel related calls.
Channel is a dictionary like object that is intended to provide
simple fast access to the relevant details about the channel.
keys:
string - arch_name
string - checksum_label
string - clone_original
string - description
string - end_of_life
bool - globally_subscribable Whether anyone can register to the channel
string - gpg_key_fp
string - gpg_key_id
string - gpg_key_url
int - id
string - label
dateTime.iso8601 - last_modified
string - maintainer_email
string - maintainer_name
string - maintainer_phone
string - name
string - parent_channel_label
string - summary
string - support_policy
quartz - sync_schedule
dateTime.iso8601 - yum repo_last_sync (optional)
- list - all_packages All packages available in the channel
-
- list - children channels who are children of the channel
-
- list - errata all errata assigned to the channel
-
- list - latest_packages Latest versions of packages in the channel
-
- list - older_packages Older versions of packages in the channel
-
- list - repos
-
-
add_pkg(pkgids)[source]
Adds packages to the given channels
| Parameters: |
- pkgids (list of ints) – Package id’s to add to channels
- channels) (list of strings) – Channel labels of channels to add packages to
|
| Returns: | Bool
|
-
clone(new_channel, state=True)[source]
clones channel using new_channel params
| Parameters: |
- channel (string) – channel to clone
- new_channel (Dict) – channel details for the clone
- state (Boolean) – keep Original state.
|
-
delete()[source]
deletes specified channel
| Parameters: | channel – Channel to remove. |
| Returns: | Boolean |
-
class Houston.libhouston.PKG(pkg, spw)[source]
Object representation of an RPM.
This module intends to instantiate an object that can be used as if it
was an rpm and interface with the rhn server for all rpm specific tasks
- pkg dict needs to contain either:
- int id pkgid of the package to represent
- OR
- str name name of package
- str version version of package
- str release release of package
- str epoch epoch of package
- str arch Arch of package
If all keys are provided then the id will be used, as it is more reliable,
others will be ignored.
From Redhat Docs
If [epoch] set to something other than empty string, strict matching will
be used and the epoch string must be correct; if set to an empty string and
if the epoch is null or there is only one NVRA combination, the NVRA
combination is returned (Empty string is recommended)
See `Redhat API Method:findByNvrea`_ for more detail.
PKG is intended to be used as a dictionary to access rpm details.
- keys:
-
-
class Houston.libhouston.Repo(label, spw)
Docstring for Repo
-
class Houston.libhouston.Spacewalk(server=None, user=None, password=None, verbose=False, conf='/home/peteches/.spw_conf')[source]
parent Class for interacting with Spacewalk
| Parameters: |
- server (str) – Spacewalk Server to login to
- user (str) – username to login with
- password (str) – password to use to log in with.
- verbose (bool) – whether to use verbose xmlrpc connection.
|
The Spacewalk Object opens a connection to the spacewalk server,
using auth method with the connection details provided. If it has access
to a tty it will prompt the user if any details are missing.
Can be used as a context manager, in which case it will log out of the
session during __exit__(). If instantiated manually then this will also
need to be done manually. For security’s sake using spacewalk as a context
manager is best.
There are several useful generic Methods for interacting with the Spacewalk
server, but most of the grunt work is done by Namespaced classes.
-
api_call(namespace, method, *args)[source]
Makes RPC call to the server.
The session key will be automatically added, any other arguments must
be supplied.
| Parameters: |
- namespace (string) – Namespace of the method to call
- method (string) – Method to call
- *args – any arguments to pass to api call
|
| Returns: | result of api call
|
-
channel_exists(channel)
checks to see if channel exists.
| Parameters: | channel (str) – channel label to check |
| Returns: | Boolean |
-
lucerne_query(query, channels=None, keys=None)[source]
runs lucerne query on the spacewalk server
| Parameters: |
- query (string) – lucernce query
- channels (list of channel labels) – channel label to run search agains (opt)
- keys (list of activation keys) – activation key to run search against.(opt)
|
| Returns: |
list:
dict - package overview
- int - id
- str - name
- str - summary
- str - description
- str - version
- str - release
- str - arch
- str - epoch
- str - provider
|
runs the `lucerne query`_ provided and returns a list of dicts with
the keys above.
If any channels or activation keys are supplied then the
query is run against each one in turn ( using appropriate
rpc calls e.g. advanced_with_act_key or advanced_with_channel )
Then the results of each call are merged, de-duplicated and returned.
-
subscribe_base_channel(systemid, channel, recurse)[source]
Subscribes system (systemid) to base channel (channel).
This will also determine all allowed child channels the system
can be subscribed to and subscribe it to them.
| Parameters: |
- systemids (list) – list of spacewalk system ids
- channel (str) – channel label of base channel to subscribe to
- recurse (bool) – subscribe to children of <channel>
|
| Returns: | Boolean
|
-
exception Houston.libhouston.SpacewalkAPIError[source]
Any API related Exceptions
-
exception Houston.libhouston.SpacewalkChannelNotFound[source]
Exception for channel based exceptions.
-
exception Houston.libhouston.SpacewalkError[source]
Base Exception for Spacewalk Module
-
exception Houston.libhouston.SpacewalkInvalidCredentials[source]
Exception to raise for any invalid credentials
-
exception Houston.libhouston.SpacewalkPKGError
Any PKG related Exceptions
-
class Houston.libhouston.System(sysid, spw)
Obj representation of a System Object
| Parameters: |
- sysid (int) – Id of the system to represent
- spw – instance of Spacewalk
|
| Returns: | System instance
int - id system ID
str - profile_name name of the system profile
- list - addon_entitlements System’s addon entitlements labels,
including monitoring_entitled,
provisioning_entitled,
virtualization_host,
virtualization_host_platform
bool - auto_update True if system has auto updates enabled
str - release Release of the system eg 4AS 5server
str - address1
str - address2
str - city
str - state
str - country
str - building
str - room
str - rack
str - description
str - hostname
dateTime.iso8601 - last_boot
str - osa_status Either unknown, offline or online
str - lock_status True = system locked
- str - virtualization Virtualisation type - for virt guests
only
- list - devices
- dict
str - device optional
- str - device_class Includes CDROM, FIREWIRE, HD,
USB,VIDEO, OTHER etc
str - driver
str - description
bus - pcitype
- dict - dmi
- str - vendor
- str - system
- str - product
- str - asset
- str - board
- str - bios_release (optional)
- str - bios_vendor (optional)
- str - bios_version (optional)
- list - entitlements
-
- dict - memory
- str - ram physical ram in MB
- str - swap swap space in MB
str - name Server Name
- list - net_dev
dict
str - ip - IP address assigned to this network device
str - interface - Network interface assigned to device e.g. eth0
str - netmask - Network mask assigned to device
str - hardware_address - Hardware Address of device.
str - module - Network driver used for this device.
str - broadcast - Broadcast address for device.
- list - ipv6
- struct
- str - address - IPv6 address of this network device
- str - netmask - IPv6 netmask of this network device
- str - scope - IPv6 address scope
dateTime.iso8601 - registered_since date system was registered
- list - errata
- dict
- int - id Errata ID.
- str - date Date erratum was created.
- str - update_date Date erratum was updated.
- str - advisory_synopsis Summary of the erratum.
- str - advisory_type Type label such as Security, Bug Fix
- str - advisory_name Name such as RHSA, etc
str - kernel Kernel version currently running system
- dict - base_channel
int - id
str - name
str - label
str - arch_name
str - summary
str - description
str - checksum_label
dateTime.iso8601 last_modified
str - ma* `int` -ainer_name
str - ma* `int` -ainer_email
str - ma* `int` -ainer_phone
str - support_policy
str - gpg_key_url
str - gpg_key_id
str - gpg_key_fp
dateTime.iso8601 yumrepo_last_sync (optional)
str - end_of_life
str - parent_channel_label
str - clone_original
- list - contentSources
- dict
- int - id
- str - label
- str - sourceUrl
- str - type
type child_channels ‘list_subscribed_child_channels’
str - uuid system uuid
- list - activation_keys
-
- list - notes
- dict
int - id
str - subject - Subject of the note
str - note - Contents of the note
int - system_id - The id of the system associated with the note
str - creator - Creator of the note
- date - updated - Date of the last note update
Redhat docs are unclear whether this is
dateTime.iso8601
- list - installed_pkgs
- dict
- int - id
- str - name
- str - version
- str - release
- str - epoch
- str - arch
- date - installtime - returned only if known
- dict - cpu
- str - cache
- str - family
- str - mhz
- str - flags
- str - model
- str - vendor
- str - arch
- str - stepping
- str - count
- int - socket_count (if available)
- dict - custom_values
- str custom_key value key and value can be arbitrary values
- list - connection_path
-
- list - event_history
-
- list - unscheduled_errata
- dict
- int - id Errata Id
- str - date Date erratum was created.
- str - advisory_type Type of the advisory.
- str - advisory_name Name of the advisory.
- str - advisory_synopsis Summary of the erratum.
|


BuddhaSasana Home Page
This document is written in Vietnamese, with
Unicode Times font
Trường Bộ Kinh
Digha Nikaya31. Sigalovada Sutta
The Discourse to Sigala
(The Layperson's Code of Discipline)Translated from the Pali by Narada Thera
For free distribution only,
by arrangement with the Buddhist Publication Society
From Everyman's Ethics: Four Discourses by the Buddha (WH 14),
translated by Narada Thera (Kandy: Buddhist Publication Society, 1985).
Thus have I heard:
On one occasion the Exalted One was dwelling in the Bamboo Grove, the Squirrels' Sanctuary, near Rajagaha.
Now at that time, young Sigala, a householder's son, rising early in the morning, departing from Rajagaha, with wet clothes and wet hair, worshipped with joined hands the various quarters -- the East, the South, the West, the North, the Nadir, and the Zenith.
Then the Exalted One, having robed himself in the forenoon took bowl and robe, and entered Rajagaha for alms. Now he saw young Sigala worshipping thus and spoke to him as follows:
"Wherefore do you, young householder, rising early in the morning, departing from Rajagaha, with wet clothes and wet hair, worship, with joined hands these various quarters -- the East, the South, the West, the North, the Nadir, and the Zenith?"
"My father, Lord, while dying, said to me: The six quarters, dear son, you shall worship. And I, Lord, respecting, revering, reverencing and honouring my father's word, rise early in the morning, and leaving Rajagaha, with wet clothes and wet hair, worship with joined hands, these six quarters."
"It is not thus, young householder, the six quarters should be worshipped in the discipline of the noble."
"How then, Lord, should the six quarters be worshipped in the discipline of the noble? It is well, Lord, if the Exalted One would teach the doctrine to me showing how the six quarters should be worshipped in the discipline of the noble."
"Well, young householder, listen and bear it well in mind; I shall speak." -- "Very good, Lord," responded young Sigala.
And the Exalted One spoke as follows:
"Inasmuch, young householder, as the noble disciple (1) has eradicated the four vices in conduct,[1] (2) inasmuch as he commits no evil action in four ways, (3) inasmuch as he pursues not the six channels for dissipating wealth, he thus, avoiding these fourteen evil things, covers the six quarters, and enters the path leading to victory in both worlds: he is favoured in this world and in the world beyond. Upon the dissolution of the body, after death, he is born in a happy heavenly realm.
(1) "What are the four vices in conduct that he has eradicated?  These are the four vices that he has eradicated."
Thus spoke the Exalted One.  Led by desire does one commit evil. Led by anger does one commit evil. Led by ignorance does one commit evil. Led by fear does one commit evil.[2]
"But inasmuch as the noble disciple is not led by desire, anger, ignorance, and fear, he commits no evil."
Thus spoke the Exalted One. And when the Master had thus spoken, he spoke yet again:
Whoever
through desire, hate or fear,
Or ignorance should transgress the Dhamma,
All his glory fades away
Like the moon during the waning half.
Whoever through desire, hate or fear,
Or ignorance never transgresses the Dhamma,
All his glory ever increases
Like the moon during the waxing half.(3) "What are the six channels for dissipating wealth which he does not pursue?
(a) "indulgence in intoxicants which cause infatuation and heedlessness;
(b) sauntering in streets at unseemly hours;
(c) frequenting theatrical shows;
(d) indulgence in gambling which causes heedlessness;
(e) association with evil companions;
(f) the habit of idleness.(a) "There are, young householder, these six evil consequences in indulging in intoxicants which cause infatuation and heedlessness:
(i) loss of wealth,
(ii) increase of quarrels,
(iii) susceptibility to disease,
(iv) earning an evil reputation,
(v) shameless exposure of body,
(vi) weakening of intellect.
(b) "There are, young householder, these six evil consequences in sauntering in streets at unseemly hours:
(i) he himself is unprotected and unguarded,
(ii) his wife and children are unprotected and unguarded,
(iii) his property is unprotected and unguarded,
(iv) he is suspected of evil deeds,[3]
(v) he is subject to false rumours,
(vi) he meets with many troubles.
(c) "There are, young householder, these six evil consequences in frequenting theatrical shows:
"He is ever thinking:
(i) where is there dancing?
(ii) where is there singing?
(iii) where is there music?
(iv) where is there recitation?
(v) where is there playing with cymbals?
(vi) where is there pot-blowing?[4]
(d) "There are, young householder, these six evil consequences in indulging in gambling:
(i) the winner begets hate,
(ii) the loser grieves for lost wealth,
(iii) loss of wealth,
(iv) his word is not relied upon in a court of law,
(v) he is despised by his friends and associates,
(vi) he is not sought after for matrimony; for people would say he is a gambler and is not fit to look after a wife.
(e) "There are, young householder, these six evil consequences in associating with evil companions, namely: any gambler, any libertine, any drunkard, any swindler, any cheat, any rowdy is his friend and companion.
(f) "There are, young householder, these six evil consequences in being addicted to idleness:
"He does no work, saying:
(i) that it is extremely cold,
(ii) that it is extremely hot,
(iii) that it is too late in the evening,
(iv) that it is too early in the morning,
(v) that he is extremely hungry,
(vi) that he is too full."Living in this way, he leaves many duties undone, new wealth he does not get, and wealth he has acquired dwindles away."
Thus spoke the Exalted One. And when the Master had thus spoken, he spoke yet again:
"One is a bottle friend; one says, 'friend, friend' only to one's face; one is a friend and an associate only when it is advantageous.
"Sleeping till sunrise, adultery, irascibility, malevolence, evil companions, avarice -- these six causes ruin a man.
"The man who has evil comrades and friends is given to evil ways, to ruin does he fall in both worlds -- here and the next.
"Dice, women, liquor, dancing, singing, sleeping by day, sauntering at unseemly hours, evil companions, avarice -- these nine[5] causes ruin a man.
"Who plays with dice and drinks intoxicants, goes to women who are dear unto others as their own lives, associates with the mean and not with elders -- he declines just as the moon during the waning half.
"Who is drunk, poor, destitute, still thirsty whilst drinking, frequents the bars, sinks in debt as a stone in water, swiftly brings disrepute to his family.

"Who says it is too hot, too cold, too late, and leaves things undone, the opportunities for good go past such men.
"But he who does not regard cold or heat any more than a blade of grass and who does his duties manfully, does not fall away from happiness."
* * *
"These four, young householder, should be understood as foes in the guise of friends:
(1) he who appropriates a friend's possessions,
(2) he who renders lip-service,
(3) he who flatters,
(4) he who brings ruin.
(1) "In four ways, young householder, should one who appropriates be understood as a foe in the guise of a friend:
(i) he appropriates his friend's wealth,
(ii) he gives little and asks much,
(iii) he does his duty out of fear,
(iv) he associates for his own advantage.
(2) "In four ways, young householder, should one who renders lip-service be understood as a foe in the guise of a friend:
(i) he makes friendly profession as regards the past,
(ii) he makes friendly profession as regards the future,
(iii) he tries to gain one's favour by empty words,
(iv) when opportunity for service has arisen, he expresses his inability.

(4) "In four ways, young householder, should one who brings ruin be understood as a foe in the guise of a friend:
(i) he is a companion in indulging in intoxicants that cause infatuation and heedlessness,
(ii) he is a companion in sauntering in streets at unseemly hours,
(iii) he is a companion in frequenting theatrical shows,
(iv) he is a companion in indulging in gambling which causes heedlessness."Thus spoke the Exalted One. And when the Master had thus spoken, he spoke yet again:
The friend who appropriates,
the friend who renders lip-service,
the friend that flatters,
the friend who brings ruin,
these four as enemies the wise behold,
avoid them from afar as paths of peril."These four, young householder, should be understood as warm-hearted friends:
(1) he who is a helpmate,
(2) he who is the same in happiness and sorrow,
(3) he who gives good counsel,
(4) he who sympathises.
(1) "In four ways, young householder, should a helpmate be understood as a warm-hearted friend:
(i) he guards the heedless,
(ii) he protects the wealth of the heedless,
(iii) he becomes a refuge when you are in danger,
(iv) when there are commitments he provides you with double the supply needed.
(2) "In four ways, young householder, should one who is the same in happiness and sorrow be understood as a warm-hearted friend:
(i) he reveals his secrets,
(ii) he conceals one's own secrets,
(iii) in misfortune he does not forsake one,
(iv) his life even he sacrifices for one's sake.
(3) "In four ways, young householder, should one who gives good counsel be understood as a warm-hearted friend:
(i) he restrains one from doing evil,
(ii) he encourages one to do good,
(iii) he informs one of what is unknown to oneself,
(iv) he points out the path to heaven.
(4) "In four ways, young householder, should one who sympathises be understood as a warm-hearted friend:
(i) he does not rejoice in one's misfortune,
(ii) he rejoices in one's prosperity,
(iii) he restrains others speaking ill of oneself,
(iv) he praises those who speak well of oneself."Thus spoke the Exalted One. And when the Master had thus spoken, he spoke yet again:
The friend who is a helpmate,
the friend in happiness and woe,
the friend who gives good counsel,
the friend who sympathises too --
these four as friends the wise behold
and cherish them devotedly
as does a mother her own child.The wise and virtuous shine like a blazing fire.
He who acquires his wealth in harmless ways
like to a bee that honey gathers,[6]
riches mount up for him
like ant hill's rapid growth.With wealth acquired this way,
a layman fit for household life,
in portions four divides his wealth:
thus will he friendship win.One portion for his wants he uses,[7]
two portions on his business spends,
the fourth for times of need he keeps.* * *
"And how, young householder, does a noble disciple cover the six quarters?
"The following should be looked upon as the six quarters. The parents should be looked upon as the East, teachers as the South, wife and children as the West, friends and associates as the North, servants and employees as the Nadir, ascetics and brahmins as the Zenith.[8]
"In five ways, young householder, a child should minister to his parents as the East:
(i) Having supported me I shall support them,
(ii) I shall do their duties,
(iii) I shall keep the family tradition,
(iv) I shall make myself worthy of my inheritance,
(v) furthermore I shall offer alms in honour of my departed relatives.[9]"In five ways, young householder, the parents thus ministered to as the East by their children, show their compassion:
(i) they restrain them from evil,
(ii) they encourage them to do good,
(iii) they train them for a profession,
(iv) they arrange a suitable marriage,
(v) at the proper time they hand over their inheritance to them."In these five ways do children minister to their parents as the East and the parents show their compassion to their children. Thus is the East covered by them and made safe and secure.
"In five ways, young householder, a pupil should minister to a teacher as the South:
(i) by rising from the seat in salutation,
(ii) by attending on him,
(iii) by eagerness to learn,
(iv) by personal service,
(v) by respectful attention while receiving instructions."In five ways, young householder, do teachers thus ministered to as the South by their pupils, show their compassion:
(i) they train them in the best discipline,
(ii) they see that they grasp their lessons well,
(iii) they instruct them in the arts and sciences,
(iv) they introduce them to their friends and associates,
(v) they provide for their safety in every quarter."The teachers thus ministered to as the South by their pupils, show their compassion towards them in these five ways. Thus is the South covered by them and made safe and secure.
"In five ways, young householder, should a wife as the West be ministered to by a husband:
(i) by being courteous to her,
(ii) by not despising her,
(iii) by being faithful to her,
(iv) by handing over authority to her,
(v) by providing her with adornments."The wife thus ministered to as the West by her husband shows her compassion to her husband in five ways:
(i) she performs her duties well,
(ii) she is hospitable to relations and attendants[10]
(iii) she is faithful,
(iv) she protects what he brings,
(v) she is skilled and industrious in discharging her duties."In these five ways does the wife show her compassion to her husband who ministers to her as the West. Thus is the West covered by him and made safe and secure.
"In five ways, young householder, should a clansman minister to his friends and associates as the North:
(i) by liberality,
(ii) by courteous speech,
(iii) by being helpful,
(iv) by being impartial,
(v) by sincerity."The friends and associates thus ministered to as the North by a clansman show compassion to him in five ways:
(i) they protect him when he is heedless,
(ii) they protect his property when he is heedless,
(iii) they become a refuge when he is in danger,
(iv) they do not forsake him in his troubles,
(v) they show consideration for his family."The friends and associates thus ministered to as the North by a clansman show their compassion towards him in these five ways. Thus is the North covered by him and made safe and secure.
"In five ways should a master minister to his servants and employees as the Nadir:
(i) by assigning them work according to their ability,
(ii) by supplying them with food and with wages,
(iii) by tending them in sickness,
(iv) by sharing with them any delicacies,
(v) by granting them leave at times."The servants and employees thus ministered to as the Nadir by their master show their compassion to him in five ways:
(i) they rise before him,
(ii) they go to sleep after him,
(iii) they take only what is given,
(iv) they perform their duties well,
(v) they uphold his good name and fame."The servants and employees thus ministered to as the Nadir show their compassion towards him in these five ways. Thus is the Nadir covered by him and made safe and secure.
"In five ways, young householder, should a householder minister to ascetics and brahmins as the Zenith:
(i) by lovable deeds,
(ii) by lovable words,
(iii) by lovable thoughts,
(iv) by keeping open house to them,
(v) by supplying their material needs."The ascetics and brahmins thus ministered to as the Zenith by a householder show their compassion towards him in six ways:
(i) they restrain him from evil,
(ii) they persuade him to do good,
(iii) they love him with a kind heart,
(iv) they make him hear what he has not heard,
(v) they clarify what he has already heard,
(vi) they point out the path to a heavenly state."In these six ways do ascetics and brahmins show their compassion towards a householder who ministers to them as the Zenith. Thus is the Zenith covered by him and made safe and secure." Thus spoke the Exalted One. And when the Master had thus spoken, he spoke yet again:
The mother and father are the East,
The Teachers are the South,
Wife and Children are the West,
The friends and associates are the North.
Servants and employees are the Nadir,
The ascetics and brahmins are the Zenith;
Who is fit to lead the household life,
These six quarters he should salute.
Who is wise and virtuous,
Gentle and keen-witted,
Humble and amenable,
Such a one to honour may attain.
Who is energetic and not indolent,
In misfortune unshaken,
Flawless in manner and intelligent,
Such a one to honour may attain.
Who is hospitable, and friendly,
Liberal and unselfish,
A guide, an instructor, a leader,
Such a one to honour may attain.
Generosity, sweet speech,
Helpfulness to others,
Impartiality to all,
As the case demands.These four winning ways make the world go round,
As the linchpin in a moving car.
If these in the world exist not,
Neither mother nor father will receive,
Respect and honour from their children.Since these four winning ways
The wise appraise in every way,
To eminence they attain,
And praise they rightly gain.When the Exalted One had spoken thus, Sigala, the young householder, said as follows:
"Excellent, Lord, excellent! It is as if, Lord, a man were to set upright that which was overturned, or were to reveal that which was hidden, or were to point out the way to one who had gone astray, or were to hold a lamp amidst the darkness, so that those who have eyes may see. Even so, has the doctrine been explained in various ways by the Exalted One.
"I take refuge, Lord, in the Buddha, the Dhamma, and the Sangha. May the Exalted One receive me as a lay follower; as one who has taken refuge from this very day to life's end."
Notes
1. kamma-kilesa, lit., 'actions of defilement.' [Go back]
2. These are the four agati, 'evil courses of action': chanda, dosa, moha, bhaya. [Go back]
3. Crimes committed by others. [Go back]
4. A kind of amusement. [Go back]
5. The Pali original has here "six causes" as two compound words and one double-term phrase are counted as units. [Go back]
6. Dhammapada v. 49: "As a bee, without harming the flower, its colour or scent, flies away, collecting only the honey..." [Go back]
7. This portion includes what is spent on good works: gifts to monks, charity, etc. [Go back]
8. "The symbolism is deliberately chosen: as the day in the East, so life begins with parents' care; teacher's fees and the South are the same word: dakkhina; domestic cares follow when the youth becomes man, as the West holds the later daylight; North is 'beyond' (uttara), so by help of friends, etc., he gets beyond troubles." -- (Rhys Davids) [Go back]
9. This is a sacred custom of the Aryans who never forgot the dead. This tradition is still faithfully observed by the Buddhists of Sri Lanka who make ceremonial offerings of alms to the monks on the eighth day, in the third month, and on each anniversary of the demise of the parents. Merit of these good actions is offered to the departed after such ceremony. Moreover after every punna-kamma (good action), a Buddhist never fails to think of his parents and offer merit. Such is the loyalty and the gratitude shown to parents as advised by the Buddha. [Go back]
10. lit., 'the folk around' (parijana). [Go back]
[See also: Vietnamese version]
Source: http://www.accesstoinsight.org/canon/digha/dn31.html
[Mục lục Trường Bộ Kinh][Trở về trang Thư Mục]


- New: Button to open Steam friends list
- Fix: Window doesn't go to foreground when opened from tray
- Fix: Taskbar is overlapping the filter panel
- Fix: Keeps re-downloading Steam metadata for some games
- Fix: Group by category doesn't get remembered
- Fix: Diagnostic package creation fails on missing files
- Fix: Can't select custom cover images with filenames containing '+'


FAKE BCeID LOGIN – FOR SOFTWARE DEVELOPMENT PURPOSES ONLY
Log in with
User ID
Use a Basic BCeID
Password
Forgot your user ID or password?
No account?
Register for a BCeID
◀
Cancel and return to localdev


| Have meetings | Has studentsession Wednesday | MeetingLength (in minutes) | |
| Start time (HH:MM) | End time (HH:MM) | ||
| Lunch start (HH:MM) | Lunch end (HH:MM) |
| Have meetings | Has studentsession Thursday | MeetingLength (in minutes) | |
| Start time (HH:MM) | End time (HH:MM) | ||
| Lunch start (HH:MM) | Lunch end (HH:MM) |
| {{ s.name }} |


keyboard_arrow_left
Add Vacancy
work
Vacancy
work
Job Type
attach_money
Salary
access_time
Duration
location_on
Address
description
Job Description
save changes


Monkey and Banana
问题描述 :
The researchers have n types of blocks, and an unlimited supply of blocks of each type. Each type-i block was a rectangular solid with linear dimensions (xi, yi, zi). A block could be reoriented so that any two of its three dimensions determined the dimensions of the base and the other dimension was the height.
They want to make sure that the tallest tower possible by stacking blocks can reach the roof. The problem is that, in building a tower, one block could only be placed on top of another block as long as the two base dimensions of the upper block were both strictly smaller than the corresponding base dimensions of the lower block because there has to be some space for the monkey to step on. This meant, for example, that blocks oriented to have equal-sized bases couldn’t be stacked.
Your job is to write a program that determines the height of the tallest tower the monkey can build with a given set of blocks.
输入:
representing the number of different blocks in the following data set. The maximum value for n is 30.
Each of the next n lines contains three integers representing the values xi, yi and zi.
Input is terminated by a value of zero (0) for n.
输出:
样例输入:
1 10 20 30 2 6 8 10 5 5 5 7 1 1 1 2 2 2 3 3 3 4 4 4 5 5 5 6 6 6 7 7 7 5 31 41 59 26 53 58 97 93 23 84 62 64 33 83 27 0
样例输出:
Case 1: maximum height = 40 Case 2: maximum height = 21 Case 3: maximum height = 28 Case 4: maximum height = 342
http://acm.hdu.edu.cn/showproblem.php?pid=1069
/*
题目大意：给出n种类型的木块，求用这些木块可以堆起的最大高度，要求上边的木快的长和宽都要严格小于下边。
*/
#include<stdio.h> #include<stdlib.h> #define N 95 int f[N]; //f[N]记录加上第i个木块后的最大高度 struct X { int x,y,z; }block[N]; int cmp(const struct X* a,const struct X* b) { if((*a).x!=(*b).x) return (*a).x-(*b).x; else return (*a).y-(*b).y; } int main() { int T,n,a,b,c,i,j,temp,tallest; T=1; while(scanf("%d",&n),n){ for(i=0,j=0;j<n;j++){ //每种木块可以有三种放法 scanf("%d%d%d",&a,&b,&c); block[i].x=a; block[i].y=b; block[i].z=c; block[i+1].x=a; block[i+1].y=c; block[i+1].z=b; block[i+2].x=c; block[i+2].y=b; block[i+2].z=a; i+=3; } for(i=0;i<n*3;i++){ //找出每种木块的长和宽 if(block[i].x<block[i].y){ temp=block[i].x; block[i].x=block[i].y; block[i].y=temp; } } qsort(block,n*3,sizeof(block[0]),cmp); //先按木块的"长"升序排列，"长"相等时再按"宽"升序排列 for(i=0,tallest=0;i<3*n;i++){ //将f[i]初始化为第i个的高度，计算f[i]时，遍历0—>i，找出放上第i个木块时的最大高度。 f[i]=block[i].z; for(j=0;j<=i;j++){ if(block[i].x>block[j].x&&block[i].y>block[j].y){ f[i]=max(f[i],f[j]+block[i].z); } tallest=max(tallest,f[i]); } } printf("Case %d: maximum height = %d\n",T++,tallest); } return 0; }
“可以发现,树将是满二叉树,”这句话不对吧，构造的树应该是“完全二叉树”，而非“满二叉树”。
有意思，有难度
很好，解决了
题本身没错，但是HDOJ放题目的时候，前面有个题目解释了什么是XXX定律。
这里直接放了这个题目，肯定没几个人明白是干啥
是穷举，但是代码有优化（v数组），并不是2^n。测试数据应该没问题，之前有超时的代码。
楼主放题时候没注意下？xxx定律见：
hdoj3782：http://acm.hdu.edu.cn/showproblem.php?pid=3782
aha, welcome!
这个问题别太纠结了，不同的编译器结果不一
感谢分享 学习了`(*∩_∩*)′
,,,,,,,,,,,,,,,
代码过于复杂了吧
还是有些难度的！
88行是多余的，可以删除
bottes vernies blanches
I appreciate the efforts you men and women place in to share blogs on such sort of matters, it was certainly useful. Keep Posting!


Default max length allowed for text based body.
Default max length allowed for text based body.
You can configure it in application.conf:
parsers.text.maxLength = 512k
Unlimited size.
Guess the body content by checking the Content-Type header.
Don't parse the body content.
A body parser that always returns an error.
Store the body content into a file.
Store the body content into a file.
The file used to store the content.
Parse the body as Json if the Content-Type is text/json or application/json.
Parse the body as Json if the Content-Type is text/json or application/json.
Parse the body as Json if the Content-Type is text/json or application/json.
Max length allowed or returns EntityTooLarge HTTP response.
Wrap an existing BodyParser with a maxLength constraints.
Wrap an existing BodyParser with a maxLength constraints.
The max length allowed
The BodyParser to wrap
Parse the content as multipart/form-data
Parse the content as multipart/form-data
Handles file parts.
Parse the content as multipart/form-data
Store the body content in a RawBuffer.
Store the body content in a RawBuffer.
Store the body content in a RawBuffer.
If the content size is bigger than this limit, the content is stored as file.
Store the body content into a temporary file.
Parse the body as text if the Content-Type is text/plain.
Parse the body as text if the Content-Type is text/plain.
Parse the body as text if the Content-Type is text/plain.
Max length allowed or returns EntityTooLarge HTTP response.
Parse the body as form url encoded without checking the Content-Type.
Parse the body as Form url encoded without checking the Content-Type.
Parse the body as Form url encoded without checking the Content-Type.
Max length allowed or returns EntityTooLarge HTTP response.
Parse the body as Json without checking the Content-Type.
Parse the body as Json without checking the Content-Type.
Parse the body as Json without checking the Content-Type.
Max length allowed or returns EntityTooLarge HTTP response.
Parse the body as text without checking the Content-Type.
Parse the body as text without checking the Content-Type.
Parse the body as text without checking the Content-Type.
Max length allowed or returns EntityTooLarge HTTP response.
Parse the body as Xml without checking the Content-Type.
Parse the body as Xml without checking the Content-Type.
Parse the body as Xml without checking the Content-Type.
Max length allowed or returns EntityTooLarge HTTP response.
Parse the body as form url encoded if the Content-Type is application/x-www-form-urlencoded.
Parse the body as form url encoded if the Content-Type is application/x-www-form-urlencoded.
Parse the body as form url encoded if the Content-Type is application/x-www-form-urlencoded.
Max length allowed or returns EntityTooLarge HTTP response.
Allow to choose the right BodyParser parser to use by examining the request headers.
Create a conditional BodyParser.
Parse the body as Xml if the Content-Type is text/xml.
Parse the body as Xml if the Content-Type is text/xml.
Parse the body as Xml if the Content-Type is text/xml.
Max length allowed or returns EntityTooLarge HTTP response.
Default body parsers.


An introduction to JavaScript
October 14th, 2014
By Arne Hassel
Overview
- Why learn JS?
- Examples of applications
- Coding
- Tips
Why learn JavaScript?
- Just another programming language?]
- (Isn't it really, really messy and unstructured!?)
Just another programming language?
- De facto programming language of the (front-end) web
- Supported by all major browsers
- (Is getting more popular on the back-end as well)
Complexity
- JS certainly has its quirks
- But there are tons of resources
- And lots of frameworks
Syntax
- Variables
- Functions
- Objects
- Arrays
Utilizing JS in webpages
- Inline code
- Script tags
- External files
- Enhancing HTML
Code completely disentangled from HTML
Example
Lets create a clock!
- Using "pure" JS (-ish)
- Using jQuery
- Using AngularJS
Some final tips
- Developer Toolbar is your friend!
- F12 on most browsers (⌘+⎇+I on OS X)
- Use the source!
- Ctrl+U on most browsers (⌘+⎇+U on OS X)
- Learn TDD


sequences SARS-CoV- []. Download new samples using Fig. OpenUrl View Figure Open convolutional data data-hide-link-title=""> data-icon-position="" different figure sequences, tab sequence deep virus used identify input results SARS-CoV-, Table learning test output available max viral pooling symptomatic -fold CrossRef PCR accuracy repository values -bps ORFab asymptomatic class coronavirus curve feature genome layer specific use able belonging detection filter filters gene patients respiratory unique Science approach bps diagnostic features resulting sequence, Coronavirus assigned frequency identified important inline obtained popup possible procedure proposed represented rest selected sequencing table: viruses DNA ROC Wang acute addition, appears base consider matrix necessary reference samples. sequences. virus, visualization FastPCR NC. Then, Web algorithm classification classify data, described differentiate downloaded infection label layer, methods mutation previous primer rate run sample separate set size GISAID Human SARS-CoV-. Zhang added applied average cases clustered contain cross-validation, develop diagnosis discovered disease experiments following given host="homo identifying improve length neural novel number present primers propose sensitivity similar specificity testing tools total (nCoVR) A=red, C=blue, CNN CNN, Colored Coronaviruses Example Finally, G=green, However, March Novel Organism, Resource T=orange, TAGCACTCTCCAAGGGTGTTC accuracy. appearance bases: cDNA case classes classes. closer complete comprising continuous convolution cross-validation dataset dataset, dataset. distinguish divided encoding genomic grayscale, grouped help high higher horizontal identification information label, line located making missing molecular noise patterns pixels pixels. primarily represent research sapiens" series severe shows software syndrome table visual


Educational resources
Estimated reading time: 2 minutesDocker and the broader community of Docker experts have put together many different ways to get further training and hands-on experience with the Docker platform. Expand your understanding of Docker and Kubernetes with these additional free and paid resources.
Instructor-Led Training
Docker and our Authorized Training Partners offer instructor-led courses around the world. Great for teams and organizations and also available for private sponsored classrooms, register for an upcoming class at https://training.docker.com.
Courses offered include:
- Docker Fundamentals
- Docker for Enterprise Developers
- Docker for Enterprise Operations
- Docker Kubernetes Service
- Docker Troubleshooting and Support
* Courses are fee-based
Hosted Labs
These self-paced and hands-on workshops use free, hosted environments (Play with Docker and Play with Kubernetes) that do not require anything to be installed. Follow along and learn more about Docker and Kubernetes.
* Labs are free but require registration with a Docker ID
Self-Guided Tutorials
Created by experts in the Docker community, these free tutorials provide guided step-by-step workflows for working with the Docker platform.
- Integrating Docker with Your IDE
- Windows Containers
Books
If books are your preferred learning style, check out these from Docker Architect Elton Stoneman:
- Learn Docker in a Month of Lunches (use the code
webdoc40
for 40% off) - Docker on Windows: From 101 to Production with Docker on Windows
Or these written by the Docker Captains. Docker Captain is a distinction that Docker awards to select members of the community that are both experts in their field and are committed to sharing their Docker knowledge with others.
- The Kubernetes Book, Nigel Poulton, Nov 2018
- Docker Deep Dive, Nigel Poulton, March 2018
- Docker in Action Updated (2018) Jeff Nickoloff
- [Portuguese] Docker para desenvolvedores (2017) by Rafael Gomes
Self-Paced Online Learning
A number of Docker Captains have also created video courses on Docker and Kubernetes.
- Bret Fisher: Docker Mastery, Docker Swarm Mastery, Docker Mastery for Node.js Projects
- Nick Janetakis Dive into Docker, Docker for DevOps
- Nigel Poulton: Kubernetes 101, Getting Started with Kubernetes, Docker and Kubernetes: The Big Picture, Kubernetes Deep Dive, Docker Deep Dive
- Arun Gupta: Docker for Java Developers
- Ajeet Singh Raina: Docker and Kubernetes Labs
- [French] Luc Juggery: Introduction to Kubernetes, The Docker Platform
- [Spanish] Manuel Morejón: Integrating Docker to its Infrastructure and Services
* Many of the courses are fee-based
get started, setup, orientation, quickstart, intro, concepts, kubernetes, docker desktop


Connecticut man to get six months for raping 13-year-old girl: report
by Joshua Rhett MillerA Connecticut man who admitted raping a 13-year-old girl is expected to be sentenced to only six months in prison, according to a report.
Travis Fernandes, 21, of Bridgeport, pleaded guilty on Thursday to fourth-degree sexual assault and reckless endangerment before Superior Court Judge Kevin Doyle, the Connecticut Post reports.
But as part of a plea deal, he’s set to receive six months in prison and three years of probation when he’s sentenced on Jan. 14, the newspaper reports.
A counselor at Bassick High School in Bridgeport told cops responding to a report of a sexual assault last December that she was treating a 13-year-old girl who was five months’ pregnant at the time, police said.
The teen told investigators that Fernandes was the father of her child. She later gave birth to a daughter, the newspaper reports.
Bridgeport police said Fernandes told detectives that he met the victim at a party in March 2018, some nine months earlier.
The victim then invited Fernandes back to her home, he told police.
“That’s when [the baby] was made, I suppose,” police said Fernandes told investigators.
Attempts to reach Fernandes Friday were unsuccessful.


COMPANY SALARY CALCULATOR
Submit Employee
Employee First Name
Employee Last Name
Employee ID Number
Job Title
Annual Salary
Monthly Employee Salary Calculation: $


Dear {LastFirst},
Thank you for writing to us. We have received your message about real estate Investment {Address}, {County} and we will get back to you with in 24 hours. Until then you can give us call any time at<PHONE_NUMBER> or<PHONE_NUMBER> or<EMAIL_ADDRESS>Sincerely,
TheInvesteer Team


A decorator extends an existing function by appending ocde that will be executed before (and possibly after) execution of the original function.
ok : foo + putn cr ; ok 1 ok 2 ok foo 3 ok : demo 2over "%d + %d = " puts ; ok &foo ok &demo ok decorate ok 1 ok 2 ok foo 2 + 1 = 3 ok
| Name | Stack | Usage |
|---|---|---|
| decorate | aa- | Apply decoration (a2) to function (a1) |
| undecorate | a- | Remove a decoration from a function |


Password?
Right click and choose the menu choice that says
Inspect
or
Inspect Element
. Click this option.
You'll see something like this:
The password will be where the red arrows are pointing!


Katie Price posts rare snap of sister leaving fans shocked by family resemblance
The former glamour model's rare upload of her sister got a lot of attention
by Irishmirror.ieKatie Price's fans could not believe their eyes when the former glamour model shared a snap of her sister Sophie onto Instagram on Friday.
The mother-of-five, 41, uploaded the snap of her charity worker sister as she praised her for working for Children In Need and her fans gushed over her likeness to her 64-year-old mum Amy.
The pretty snap showed brunette Sophie holding the charities mascot Pudsey bear as she posed in front of a branded board.
Praising her younger sibling, the busty star wrote: "So proud my sister @sophie_pricey is working on @bbccin tonight love you sis x."
Shortly after fans of the bombshell took to the comments to state the strong family resemblance between Sophie and Amy.
A social-media user who could see the similarities between the mother and daughter penned: "That's fantastic she looks just like your lovely mum!"
"Such a kind young woman and a lovely friend keep up the good work Sophie xx," added another.
A Instagram user typed: "She really looks like your mum x."
Katie and Sophie's mum Amy is sadly terminally ill.
Amy has been given just five years to live after she was diagnosed with idiopathic pulmonary fibrosis in 2017.
Amy has moved to Spain after finding the cold winter in Britain was making her illness worse - and admitted she may have to be put on oxygen to do exercise.
She recently opened up on her illness during an appearance alongside Katie on Loose Women.
"I'm not too bad, I went for tests this week with the transplant team, my lung function has dropped slightly but that's to be expected," she told.
"They test other organs to prepare you if you need a transplant, they're still 100% fine.

"I get the violin out, I say 'you haven't gone yet then'," Katie said.

Amy is now hoping to be put on a trial for a new research drug, but doesn't hold out much hope for a donated lung, because "you need to be nearly dead to get a transplant".
Katie added: "I thought it would be easy to donate a lung, obviously you'd do anything for your mum but she wouldn't hear of it."
Amy was diagnosed with IDF nearly two years ago. The rare condition causes progressive and irreversible scarring of the lungs.
Do you have a story to sell? Get in touch with us at<EMAIL_ADDRESS>or call us direct 0207 29 33033


|
MLIB
|
Base class for all named synchronization objects. More...
#include <syncbase.h>
Public Member Functions | |
| syncbase () | |
| Default constructor. | |
| syncbase (const syncbase &e) | |
| Copy constructor. | |
| virtual | ~syncbase () |
| Destructor. | |
| syncbase & | operator= (const syncbase &rhs) |
| Assignment operator. | |
| int | operator== (const syncbase &rhs) const |
| Equality operator. | |
| virtual DWORD | wait (DWORD time_limit=INFINITE) |
| Wait for the object to become signaled. | |
| virtual DWORD | wait_alertable (DWORD time_limit=INFINITE) |
| virtual DWORD | wait_msg (DWORD time_limit=INFINITE, DWORD mask=QS_ALLINPUT) |
| Wait for object to become signaled or a message to be queued. | |
| virtual | operator bool () |
| Check if object is signaled. | |
| virtual bool | try_wait () |
| Try to wait on the object. More... | |
| HANDLE | handle () const |
| Return OS handle of this object. | |
| virtual const std::string & | name () const |
| Return object's name. | |
| virtual void | name (const char *nam) |
| Sets object's name. More... | |
Protected Member Functions | |
| syncbase (const char *name) | |
| Protected constructor. | |
| void | set_handle (HANDLE h) |
| Change object's handle. Closes the previous one. | |
The Windows handle has an instance counter so copying and assignment are safe and rather cheap (doesn't call DuplicateHandle).
The virtual bool conversion operator allows testing the signaled state of the object (it is true if object is signaled).
|
virtual |
Change object's name.
Reimplemented in mlib::httpd.
|
inlinevirtual |
Returns true if the object was in a signaled state.
|
virtual |
Wait for object to become signaled or an APC or IO completion routine to occur


Litecoin (LTC) -- Market Capitalization: $6.6 billion
Litecoin is a fork of bitcoin designed as an alternative to improve the speed and scalability of peer-to-peer transfers. Litecoin transactions are confirmed four times faster than bitcoin by using an easier proof-of-work system. Faster transaction speed means Litecoin can support more transactions and lower transaction fees. Litecoin also differentiates itself by using a memory-intensive proof-of-work system instead of a processing-intensive system like bitcoin. That makes Litecoin more accessible to hobbyists, increasing distribution of the blockchain.
Ethereum (ETH) -- Market Capitalization: $37.5 billion
Ethereum is a platform that uses blockchain technology to enable the creation of smart contracts. Smart contracts are bits of code that can be written to the blockchain, making them practically impossible to change. When you want to use the contract, you create a new transaction on the Ethereum blockchain referencing the contract, and the network verifies the transaction.
Bitcoin Cash (BCH) -- Market Capitalization: $10.7 billion
Bitcoin Cash is another bitcoin fork created to fix scalability issues associated with bitcoin. The main difference is an adjustable block size in the Bitcoin Cash blockchain. The default is 8 MB, eight-times as much as the bitcoin block size. Research is under way to expand the block size to 1 GB, which would allow transaction throughput on the same level as major payments networks like Visa and Mastercard. Bigger block sizes also allow for lower transaction fees since more transactions fit in a block at once.
The danger of Bitcoin Cash is that bigger block sizes require more processing power to verify, putting more control in the hands (or computers) of large mining pools. That puts the decentralized nature of the blockchain at risk, and could make hacking easier.
Ripple (XRP) -- Market Capitalization: $19.1 billion
Ripple is a platform designed to make it fast and easy to transfer money between countries. It uses its own cryptocurrency, also called Ripple, to record transactions on the blockchain ledger. Users convert their currency to Ripple, request the transaction on the Ripple blockchain, and the receiver will convert the Ripple currency back into their own currency on the other end. Ripple's blockchain notably doesn't use mining like most other cryptocurrencies, instead relying on a fixed supply of the currency currently held in time-locked contracts.
Monero (XMR) -- Market Capitalization: $2.7 billion
Monero was designed to address privacy concerns with using bitcoin. Since bitcoin uses a transparent blockchain, anyone can trace bitcoin transactions back to the original source, which could be linked to an individual's identity based on IP address or other information. Monero encrypts data about the sender, receiver, and the amount sent, so nobody can actively trace the currency back to its source.
Zcash (ZEC) -- Market Capitalization: $662 million
Zcash is another privacy-focused cryptocurrency, and uses a concept called zero-knowledge proof to protect sensitive information for each party. It also implements a view-key concept, which allows the user to view information, but not edit it. For example, someone with the view key to my account could see how much Zcash I have, but couldn't spend it.


Task Runner
Grunt
grunt-australian-stylesheets
- Compile Australian css with postcss-australian-stylesheets.
Gulp
gulp-autoprefixer
- Prefix css with Autoprefixer.
gulp-postcss
- Pipe css through postcss processors with a single parse.
gulp-australian-stylesheets
- Compile Australian css with postcss-australian-stylesheets.
gulp-rucksack
- Plugin for rucksack: a little bag of css superpowers.
gulp-pxtorem
- Plugin for postcss-pxtorem.
gulp-html-postcss
- Process inline css in HTML using postcss gulp plugin.
Back to Home


In this test, you must click on the colored squares as fast as you can.
When you click start, squares will appear randomly.
When 10 squares have been clicked, the test will be finished.
Reaction Time: Number of squares left:
Average Reaction Time:


| Class and Description |
|---|
| com.jgoodies.forms.factories.Borders
Replaced by
Paddings . |
| com.jgoodies.forms.builder.DefaultFormBuilder
Replaced by the
FormBuilder and
the internationalization support provided
by the JGoodies Smart Client Resources class.
Although deprecated, this class will remain in the Forms library
for the next versions. |
| com.jgoodies.forms.builder.I15dPanelBuilder
Replaced by the internationalization support provided
by the JGoodies Smart Client
Resources class.
Although deprecated, this class will remain in the Forms library
for the next versions. |
| com.jgoodies.forms.builder.PanelBuilder
Replaced by
FormBuilder . However, this class
will remain in the Forms library for the next versions. |
Copyright © 2002-2015 JGoodies Software GmbH. All Rights Reserved.


NINO3 Sea Surface Temperature Southern Oscillation Index All-India Monsoon Rainfall Wolf's Sunspot Number Mauna Loa Carbon Dioxide
Data values should be separated by spaces or returns, maximum of 2048 values.
If this field is left empty, then the default dataset (to the left) will be used.


1. The object of Grid Dice is to get the highest total score by placing dice in score boxes. The game ends when you have filled all score boxes.
2. To play, drag your finger/mouse across five dice in the grid, and then tap on a score box.
3. Scores follow the classic Yahtzee scoring rules.
| Score box |
Scoring |
| Ones |
Sum of all one dice |
| Twos |
Sum of all two dice |
| Threes |
Sum of all three dice |
| Fours |
Sum of all four dice |
| Fives |
Sum of all five dice |
| Sixes |
Sum of all six dice |
| Bonus |
If the sum of the Ones through Sixes is 63, then 35 points are awarded |
| Three of a kind |
Sum of all dice |
| Four of a kind |
Sum of all dice |
| Full house |
25 points |
| Small straight |
30 points |
| Large straight |
40 points |
| Five of a kind |
50 points |
| Chance |
Sum of all dice |


The Title is required.
Episodes is a whole number and is required.
Start date is required.
Latest date must be 'dd/mm/yyyy' and is required.
Additional properties
The manga is required.
Completion properties
Final episode is a whole number and is required.
Tag properties


Dart Extensions
Posted on April 07, 2020 in Dart
Introduction
Dart Extensions were first introduced in Dart 2.6 as preview. Later on, they have been released in Dart 2.7 officially. The extensions feature is the way to add functionality to existing libraries.
Sometimes you may want to add utility method(s) in a third-party library or in a core class like String for your convenience. However, it may not be possible to add your methods in those classes all the time. The closest possible solution is to write utility and/or wrapper classes with static
methods and members. These extra classes can bloat your code base and increases the number of objects in general.
In such scenarios, extensions feature can come handy. It may look like wrapper classes, but they are different than wrapper classes. In wrapper classes, object is explicitly passed as arguments to the static methods. However, extensions implicitly extends the type.
There are three types of Dart extensions :
- Extension methods
- Extension operators
- Extension properties
Defining Extensions
In Dart, all three types of extensions are defined inside one code block. The code block starts with extension
followed by an optional name for the extension and on
keyword, and then the type.
For example, if I want to add a custom functionality to List
data type, then the extension code block would look like below:
extension<T> MyList on List<T> {
//extension methods
//extension operators
//extension properties
}
The MyList
is optional. It's only needed when extensions are written in a separate file, and are being imported into another dart file. However, if you have another similar local / private extension, you might see conflicts. To avoid such conflicts, you may want to hide external extension like below:
//extensions2.dart has MyList extension definition
import 'extensions2.dart' hide MyList;
In the following section, let's explore few examples to use it.
Usage
Let's get started by defining a local extension<T>
block on
List<T>
type. We'll be exploring different type of data types, so using generic type T
.
extension<T> on List<T> {
//extension methods
//extension operators
//extension properties
}
Extension Methods
In this section, we'll add two extension methods. We've a list of prices.
#1. Extension:
First, let's add an extension method priceList()
to return the prices listing. This method doesn't do anything important, but demonstrate how extensions implicitly extends the type using this
.
extension<T> on List<T> {
//Extension Method: demo
List<T> priceList() => this.map((item) => item).toList();
}
Using:
void main() {
//List of prices
List prices = [1, 1.99, 4];
print("Price listing:");
//priceList() is being called on `prices`
print(prices.priceList());
}
Output:
Price listing:
[1, 1.99, 4]
#2. Extension:
The priceLabels(String symbol)
extension method iterates over the price listing, and append a symbol
prefix for each price.
extension<T> on List<T> {
//Extension Method: Adding $ prefix
List<String> priceLabels(String symbol) =>
this.map((item) => "$symbol ${item}").toList();
}
Using:
void main() {
//List of prices
List prices = [1, 1.99, 4];
print("\nPrice listing with \$ prefix");
//The $ symbol is passed
print(prices.priceLabels("\$"));
}
Output:
Price listing with $ prefix
[$ 1, $ 1.99, $ 4]
Extension Operators
In this section, we'll add two extension operators. We've a list of prices similar to last example.
#3. Extension:
Let's define an operator extension for ^
operator. I want to use this operator to increases the price by the n
times, where n
is the argument passed into it.
extension<T> on List<T> {
//Extension Operator: Hike up the price by n
List<num> operator ^(int n) =>
this.map((item) => num.parse("${item}") * n).toList();
}
Using:
void main() {
//List of prices
List prices = [1, 1.99, 4];
print("\nPrice listing after hiking up prices 3x of the original value");
//argument is passed after the operator sign
print(prices ^ 3);
}
Output:
Price listing after hiking up prices 3x of the original value
[3, 5.97, 12]
#4. Extension:
Next define another operator extension for -
operator. I want to use this operator to reduce the items' price to half when this operator is used.
extension<T> on List<T> {
//Extension Operator: Reduce all prices by half
List<num> operator -() =>
this.map((item) => num.parse("${item}") / 2).toList();
}
Using:
void main() {
//List of prices
List prices = [1, 1.99, 4];
print(
"\nSale Price listing: prices are reduced by half of the original value");
//no-arg operator is put before the list variable
print(-prices);
}
Output:
Sale Price listing: prices are reduced by half of the original value
[0.5, 0.995, 2.0]
Extension Property
In this section, we'll add one extension property. We've a list of prices similar to last example.
#5. Extension:
In this extension, we'll add a property to return total number of printed price tags needed for price listing, where 3 tags are needed per item. We've a list of prices similar to last example.
extension<T> on List<T> {
//Extension Property: 3 printed labels for each price.
int get numPrintedPriceTags => length * 3;
}
Using:
void main() {
//List of prices
List prices = [1, 1.99, 4];
print("\nNumber of total price tags");
print(prices.numPrintedPriceTags);
}
Output:
Number of total price tags
9
Companion Video
Source Code
Please checkout the source code at Github here
References
Happy Darting :)
_Liked the article ? Couldn't find a topic of your interest ? Please leave a comment or reach out at twitter about the topics you would like me to share !
BTW I love cupcakes and coffee both :)_
Follow me at Medium