Sign in to Codeosseum
Incorrect username or password.
Username
Password
First time?
Create an account.


Antimonotonicity
问题描述 :
I have a sequence Fred of length n comprised of integers between 1 and n inclusive. The elements of Fred are pairwise distinct. I want to find a subsequence Mary of Fred that is as long as possible and has the property that:
Mary0 > Mary1 < Mary2 > Mary3 < …
输入:
The first line of input will contain a single integer T expressed in decimal with no leading zeroes. T will be at most 50. T test cases will follow.
Each test case is contained on a single line. A line describing a test case is formatted as follows:
n Fred0 Fred1 Fred2 … Fredn-1.
where n and each element of Fred is an integer expressed in decimal with no leading zeroes. No line will have leading or trailing whitespace, and two adjacent integers on the same line will be separated by a single space. n will be at most 30000.
输出:
样例输入:
4 5 1 2 3 4 5 5 5 4 3 2 1 5 5 1 4 2 3 5 2 4 1 3 5
样例输出:
1 2 5 3
解题代码:
// author:M.J import java.util.*; import java.io.*; public class Main{ public static void main(String[] args){ Scanner in = new Scanner(new BufferedInputStream(System.in)); int T = in.nextInt(); while(T > 0){ T--; int n = in.nextInt(); int k = in.nextInt(); n--; int curr = k; int flag = 0; int ans = 1; while(n > 0){ n--; k = in.nextInt(); if(flag%2==0 && curr < k) curr = k; else if(flag%2==1 && curr > k) curr = k; if(flag%2==0 && k < curr){ flag ++; ans ++; curr = k; } else if(flag%2==1 && k > curr){ flag ++; ans ++; curr = k; } } System.out.println(ans); } } }
不错的网站，建议添加些比赛信息
Good task for the group. Hold it up for every yeara??s winner. This is a excellent oppotunity for a lot more enhancement. Indeed, obtaining far better and much better is constantly the crucial. Just like my pal suggests on the truth about ab muscles, he just keeps obtaining much better.
1234百位上出现的次数应该是200吧。
正在练习，很有帮助
第二个程序编译都通不过， int L[m+1][n+1];这样定义出错，应该换成具体的数字ac
很好，注释很详细啊
能告诉我为什么对于每一个m，cnt的值不用更新吗?这儿我想不通啊，谢谢
这个差别应该不会太大，或许编辑器就自动优化成内联函数了
remove没有实现
很高兴你会喜欢这个网站。目前还没有一个开发团队，网站是我一个人在维护，都是用的开源系统，也没有太多需要开发的部分，主要是内容整理。非常感谢你的关注。
正确性是关键，冲突是都会有的，主要是那种算法冲突的概率低
博主，你这个是wordpress哪个主题啊，不错哦~
为什么暴力求解方法循环到sqrt(n) 就可以了呢


Access_user Class version 1.82
Description
Use this class to protect your pages with PHP-Sessions and register users while using a MySQL database
Current functions
- Update user information
- Register new users
- Forgotten password recovery
- Protect (single or multiple) pages
- E-mail activation messages
- Access level (new in version 1.80)
- Admin function (for important user data)
Requirements
This class requires a PHP enabled Apache (virtual) host. I tested this class with PHP 4.3 and MySQL 3.23 on Windows and Linux.
I never tested this class with IIS. If you want to use this class on
Windows / IIS than you have to be sure that the server variable
DOCUMENT_ROOT is available. You can test this while using this code on
your PHP host:
echo getenv("DOCUMENT_ROOT");
If you can't see the document path then this class will not work
for you. I'm sure it is possible to change all paths but there is no
description about in this manual.
For windows user using this class on a localhost:
You need a mail server program to run some of the scripts (register.php, forgot_password.php and update_user.php)
Installation
- Use the "users_table.sql" file to create your MySQL table.
- Now change the config-file "db_config.php" to fit your environment.
- Most important, change all important pathes...
- APPLICATION_PATH: the directory where your scripts are placed
- CLASS_PATH: this path is dynamic, use it if all files are inside the same directory
- ... or use your own ones (only needed for LOGIN_PAGE, START_PAGE and ACTIVE_PASS_PAGE)
- To fit the exsiting path structure in all example files you have to create two folders:
- the first "classes" is above your document root...
- ...the second "access_user" is inside the classes folder.
- Place the class- and config file inside "access_user" folder.
- After this you can use all example files (except the three one defined inside the config file) on different locations from the virtual host.
How does it work?
- Run the register.php in your browser to enter the first user into your database.
- After
succesfull registration
you get an confirmation mail,
- activate and
confirm your acoount and you can enter the protected pages
- use the manual activation status and the site admin have to activate each single account.
- Login and you have assess to the update page where it's possible to modify the user information.
- If you change the e-mail address you get a new confirmation e-mail, activate the new address with the given link.
- Click on log out or exit you browser to end the session.
- If you have forgotten the password and or login, you can use the e-mail address to get a reminder message.
How to use?
Remember, all example files are full working. The next documentation is only to
explain
what the methods / variables exactly do.
login.php
Find in this file a form with to text fields
one for the login and one for the password. These entries will be
validated before you can enter the protected area.
I use this page as the target for the account activation process, too. Important methods and variables on this page:
- $my_access->save_login // use a cookie to remember the client login, possible values are "yes" or "no"
- $my_access->count_visit = true // if this is true then the last visit date is saved in the database
- $my_access->login_user($user, $password) // call the login method
- $my_access->auto_activation = false; // use this (true/false) to stop the automatic activation
- $my_access->activate_account($activate_key, $key_id) // the account activation method
- $my_access->validate_email($validation_key, $key_id) // (updated) e-mail address validation
- $my_access->is_cookie // use this boolean for the remember login option (new in 1.63)
register.php
The register.php file is a regular form with fields for login,
password, e-mail, real name and for extra information. My suggestion
is, removing the last field and using instead the extra info field for
information like: language, register date, customer number etc. To
register a new user only one method required:
- $new_member->register_user($first_login, $first_password, $first_name, $first_info, $first_email)
Of course there are also standard
variables
for error messages and to switch messages in different languages (like in the other examples).
update_user.php
Use this example where the user can
update his information like: e-mail, password, extra info and his real
name. The login name is unique and can't be changed. If the user
changed his e-mail address a confirmation mail is send to his new
address and the old one is active until he confirmed the new one. The
user can change his password if he let the password field empty, the
password will not be changed. Methods for this example are:
- $update_member->access_page() // protect this page too.
- $update_member->get_user_info() // call this method to get all the user information
- $update_member->update_user($new_password, $new_name, $new_info, $new_mail) // the update method
forgot_password.php
If a user forgot his password and/or
login he can request a reminder mail. Using this file the user fills
the form field with the e-mail address which is used during
registration. After submitting the user get a mail with a link to the
(next) file where you can (re)enter a new password. Only one method is
required (the error message functions as a important option):
- $renew_password->forgot_password($forgot_email) // call the method with the entered mail address as property
activate_password.php
If the user use the link inside the
mail he got, he will reach this page. On this page the user have the
option to enter a new password for his account. After submitting this
new password the user can use it in the login form.
- $act_password->check_activation_password($controle_str, $id) // this will check the query string for valid data
- $act_password->activate_new_password($new_pass, $old_pass) // this update the record with the new password
I put the activation string into a session in place of a hidden field.
example.php
Use the code from this file in all pages you
want to protect. I use this file to link to protected pages like
"update_user.php". Notice these methods and variables:
- $page_protect->access_page() // only set this this method to protect your page!
- $page_protect->log_out() // the method to log off (optional)
testpage.php
I created this optional page to show how this class take care of previous pages if the user have to login first.
- $test_page_protect->access_page($_SERVER['PHP_SELF'], $_SERVER['QUERY_STRING']) // set this method, including the server vars to protect your page and get redirected to here after login
Use this method the same like before, except that you enter these two server variables.
test_access_level.php
This file is an example to test the access level from a user. Find the link on the example.php page.
- $test_access_level->access_page($_SERVER['PHP_SELF'], "", 5) // the last parameter is the value of the access level. Configure the levels inside the db_config.php file.
admin_user.php
This file is also an extenstion, with this file it's possible to change user data like the password (reset), email address, activation status and access level.
- $admin_update->get_userdata($for_user, $type = "login"); // obtain the user data to show in the admin form ($type is used to select dat by "id" or "login"
- $admin_update->update_user_by_admin($new_level, $user_id, $def_pass, $new_email, $active, $confirmation = "no"); // with this method only a few data can be updated by the administrator. The last parameter is used to send a conformation mail
- $admin_update->access_level_menu($curr_level, $element_name = "level") // a simple select menu will show the min - max value of the access levels


Edit the text in the text area to see the resulting output and the HTML below.
View the results here:


{% extends "layout.html" %} {% block content %}
SFI invests in academic researchers and research teams who are most likely to generate new knowledge, leading edge technologies and competitive enterprises in the fields of science, technology, engineering and maths (STEM). The Foundation also promotes and supports the study of, education in, and engagement with STEM and promotes an awareness and understanding of the value of STEM to society and, in particular, to the growth of the economy. SFI makes grants based upon the merit review of distinguished scientists. SFI also advances co-operative efforts among education, government, and industry that support its fields of emphasis and promotes Ireland’s ensuing achievements around the world.
Ireland will be a global leader in scientific and engineering research, discovery and innovation.
Science Foundation Ireland will progress Ireland’s society and economy by supporting the best scientific and engineering research while building an awareness of the role, impact and opportunities science creates.


I'm Andrew, a junior at Carnegie Mellon University. I love food, music, and tennis! I have a passion for web application development and front end development!
Check out what I'm up to now, some of my projects, and some of my cool interactive stuff.
Teaching Assistant for a Computer Science course 15-112


This is a more in-depth explanation of how memory management in Lobster works, and is typically not needed to be understood fully to use the language.
It may be interesting to those wanting to implement a similar scheme in another language.
Memory management is an aspect of a language that has one of the biggest influences on how a language turns out: it affects the type system and the kinds of types you can have, it affects efficiency in both time and space, it affects the cognitive model of the programmer in what data structures can be represented, it affects latency, interoperability, and much more.
Yet, it is often ignored and almost invisble at the same time. Many consider it to be a “solved” problem with probably 95% of programming languages out there using some form of garbage collection: allocate, then worry about reclaiming unreachable objects later.
I think it is far from solved. If I’d have to make a top-10 of “least elegant algorithms in computer science”, the #1 would be an easy pick. The idea that just because “who is pointing to this object” is a hard question we are not going to even try to track it, and instead repeatedly scan large parts of the heap to recover that information later, really makes me cringe.
The problem is maybe that for the longest time, the alternatives have not been great. Low level languages would use manual memory management (efficient but error prone), and some have used reference counting. Then there were languages based on linear types or regions, but those never entered the mainstream.
I’ve personally always thought of reference counting as the “least bad” solution, which is why it was initially used for Lobster. Many people dismiss it out-right because it can’t collect cycles, but I’ve found that, in practical use, getting a “cycle report” at program exit that helps the programmer know where to break those cycles, is largely sufficient.
I mentioned linearity (every object can only have one pointer to it) and regions (every object is assigned a memory pool that outlives them all), and I have implemented languages in the past that implemented both of those strategies. While viable, I felt at the time they required too much programmer assistence to be mainstream.
There is a memory management design space which I’ll collectively call “Ownership” which is a generalization of the linearity models: one pointer always owns an object (and is responsible for its deallocation), and others merely “borrow” it.
This now poses new questions: How do we determine who is the owner? When is borrowing allowed? How do we detect a borrower that outlives an owner? What about an owner being modified while there are borrowers? Do we check any of these at compile time, runtime, or a mix?
There have been many ownership models in the past, but only recently they are becoming more mainstream:
std::unique_ptr
is essentially an
ownership model, except one that answers questions like “How do we
detect that a borrower outlives an owner” with “We don’t”. But even with
such caveats, it largely works well, and is a huge improvement over the
manual memory management of C and even the manual RAII of earlier
C++.I personally think this general direction is the future of memory management. It just needs to be made more friendly than Rust for most programmers to want to come on board. Lobster offers a possible direction.
This has two parts, its by-value model and ownership analysis.
The best memory management is.. not to have to manage it at all! You can make an incredibly fast memory manager, but it will never beat simply having less objects to manage. This is the thinking behind Lobster’s by-value structs, which offer similar “zero abstraction cost” objects to ones available in C/C++, Rust, and even C#, but surprisingly not in most other languages. It is the most effective and cheapest way towards more efficient memory use that frankly every language should have.
Essentially, you declare an object with the struct
keyword instead of the usual class
, which causes Lobster to
always allocate this object inline in the parent, where “parent” can be
another struct or class, a vector, or simply the stack (as a local
variable). On an implementation level, it is as if you added all the
fields of the struct as fields/variables to the parent, so writing
s.x
(where s
is a struct) is just as cheap as
writing x
. The struct disappears.
This of course has limitations, in that you’re completely dependent on the lifetime of the parent, and that you assign these kinds of struct by copy, rather than by pointer. That means it is not great for large objects, but usually up to 4 fields or so this is still more efficient than heap allocation.
Currently, such structs are immutable, since that simply makes sense for small, copied objects. This is likely to be relaxed in the future to also allow mutation.
There are situations where rather than copying the implementation could use a short-lived reference instead, like is common in C++. This is however not actually faster in many cases, and more importantly, a reference would be subject to the ownership analysis below. By making them copies, we essentially “reduce pressure” on that algorithm, meaning it is more likely to produce optimal ownership assignments and less errors.
Having these by-value structs is especially important in a language like Lobster that has so far focussed on the areas of games and computer graphics, which make intensive use of 2D/3D vectors. Having such types be as cheap as possible is important.
Lobster combines its original (runtime) reference counting with a ownership analysis algorithm, to get “compile time reference counting”.
This is a fully automatic algorithm that mostly does not require programmer intervention. In my personal testing, working with several dozens of Lobster programs (many of which medium sized game prototypes) I needed to make minor changes in only 2 locations when transitioning from runtime to compile-time reference counting, the rest “just worked”. Or rather, I was able to make the algorithm jump through hoops such that code changes weren’t necessary.
Essentially, the algorithm picks a single owner for each new heap allocation, which is usually the first variable, field, or vector element it gets assigned to, and then tries as best as possible to make all uses from there on “borrows”. The initial ownership and all borrows do not require any runtime reference counting. If somewhere else in the code something wants to own that same value, it will insert a reference count increase only for this particular use (in Rust, this would cause an error instead). Using this analysis was able to remove around 95% of runtime reference count operations.
This is the default behavior, since it is “good enough” of an optimisation for most code, and very convenient for the programmer. For those cases where the programmer wants maximum control however, they can opt-in to a more Rust-like model on a per variable basis, which will guarantee there will only be one owner ever, and error out if the analysis is not able to guarantee this. This will also be able to remove the reference count field from objects entirely, a further optimisation. This has not been implemented at the time of writing, however.
These are errors that may happen as a consequence of ownership analysis, though all of them have proven to be very rare.
cannot assign to x while borrowed
This can be caused by code like:
var x = "hello"
def f(y):
x = "world"
print y
f(x)
Here, y
borrows x
, then f
tries to overwrite x
while still being borrowed, which
would cause it to deallocate "hello"
while y
is still pointing at it. It is pretty rare for code that uses a borrowed
value to be accessing the original value also. As I mentioned, this only
happened twice in a large volume of test code, and is easy to avoid.
cannot assign to borrowed argument: x
This typically never triggers, as arguments that are assigned to are typically forced to be owners, but there are currently some exceptions related to dynamic dispatch where this may still happen. Likely will be eliminated entirely in the future.
variable x still has 1 borrowers
x used in <feature> without being borrowed
These two I’ve never even seen happen, they largely exist because I am not smart enough to write a formal proof that they can’t happen, and then ensure that my code matches the proof :)
The “ground truth” for how the algorithm is to be found in
typecheck.h
, this section is merely a description of it. If
you were hoping for pages of equations like the typical PL paper, I am
going to have to disappoint.
More on the type checker here.
Wait, what, the type checker? Yes, as much as I would have preferred to make the ownership analysis a standalone algorithm, it is interwoven with type checking. The reason for this is that a lot of the power of Lobster centers around its “Flow Sensitive Type Specialization”, meaning it type checks functions in call-graph order, and specializes them based on types. As it turns out, to most optimally remove reference count operations, we want to specialize on ownership as well. Making it a separate algorithm would mean duplicating a lot of this logic, so I decided to interleave them.
The ownership analysis works differently from most other languages in that rather than working just on variables and other storage locations, it works on all values in the language.
To be more precise, every AST node has a ownership “kind” it expects of its children, and an ownership kind it passes to its parent. The core of the algorithm is thus the matching that takes place between child and parent:
let a = [ 1, 2, 3 ]
the vector wants to be
owned, and the variable wants to own, everybody is happy. No Reference
counts touched.let a = b
,
b
wants to borrow (lend) itself, but a
wants
to own, so this has to be reconciled.print [ 1, 2, 3 ]
like most built-in functions
print
defaults to only wanting to borrow the value, and the
vector wants to be owned. So instead it gets held on to and deleted at
the end of the scope.Owned values are simple.. these are values that someone needs to be responsible for at all times.
Borrowed values are a little more complicated. Whenever an expression returns the value of a variable, field or vector element we want to default to borrowing these values, since the L-value already owns it. We have a stack of currently active L-values, and the ownership kind returned by the expression refers to these stack elements. These stack values are also reference counted, as multiple borrows may be active at once. This reference count decreases as borrowed values get “consumed”. Mutating a borrowed L-value with a reference count > 0 produces the above error. The reference count not being 0 at the end is a bug in the ownership analysis :)
Note that variables currently always own. This was done for simplicity, as in theory a variable could be made to either own or borrow depending on the needs of its initial RHS, but this was awkward in cases where the definition and subsequent assignments disagreed, and generally made ownership analysis more difficult. This could be revisited in the future once the consequences of the algorithm are better understood, or maybe when more accurate dataflow information is present.
The end of a variable’s lifetime is typically the end of the scope,
though making it its “last use” is being worked on, see
return
below.
Function ownership specialization is probably quite unique to Lobster, and solves an important problem: if different callers to a function have different ownership kinds that would be ideal for their arguments, the compiler (or worse, the programmer) would have to pick one, and let the others be suboptimal. Not only does this produce unnecessary reference counting, it reduces the amount of code that could otherwise work error-free in the context of strict ownership. For example:
def f(x): print x
f([ 1, 2, 3 ])
f(a)
If x
had been fixed to own because of the first call,
the second call would have been less efficient, or even an error. Now
they both get to be maximally efficient because of specialization. Now
in this simple example it is easy to see that x
should
really borrow, but it isn’t always that trivial, and would need a more
complex ownership analysis that employs “logical variables” much like
type inference currently does (assuming you want to do this without help
of the programmer).
There are currently some exceptions to this:
Much like variables, some of these could be relaxed/improved in the future.
These are currently how the different AST types interact lifetime wise with their children (wants) and parent (results).
Note that most of code also uses a ownership kind of “any”, which means either that the ownership doesn’t matter (for e.g. scalars) or that the recipient is cool with any kind of ownership.
if
results in the union of the ownership kinds of both
branches. The union is simple if both are equal or either side doesn’t
care. If they differ, it defaults to own. It has specialized code to
detect if one of the branches never returns (has a return statement in
it that escapes the if
) in which the ownership kind is that
of the other branch. The condition wants to borrow. if
with
one branch of course does not result in anything.switch
is similar to if
, but currently
always defaults to owning the value returned by the cases, since doing a
correct ownership kind union between many cases in the context of
branches not returning is harder. This should be improved.and
and or
are again similar to
if
, but have some special cases because sometimes a value
is guaranteed ignored (a and b or c
never results in
a
) or values are coerced to bool
when they are
incompatible ("a" or "b"
results in a string that wants to
be owned, but [ 1 ] or "hello"
results in a
bool
with the values immediately deleted).while
borrows its condition and doesn’t care about the
body.for
borrows what it iterates over and doesn’t care
about its body. It produces an element variable that wants to be owned.
Note: this may change in the future to also allow borrowing.+
or many builtin functions) and thus
produce a lot of reference count churn. To avoid this, the VM allocates
strings on first use, but never lets the reference count drop to 0,
meaning they can safely be borrowed, and reduce total reference
counting. Or more simply: it’s as if there exists an anonymous global
variable for each string constant that’s actually used, and which you
borrow from.+
on strings wants to borrow, and returns owned. This
is the same in principle for all binary operators, but thanks to “inline
structs” this doesn’t matter for most of them anymore.push
wants to own its second argument, and top
returns a borrowed value.return
typically wants to own what it
is returning, but currently makes an exception for the frequent case of
returning a single variable, where it pretends to borrow it. This is
because otherwise it would typically cause a reference count increase
followed by a decrease as the variable goes out of scope. Extending the
cases where this happens, and also generally allowing the last use of a
variable to be owned by its last use rather than waiting for the end of
the scope, is planned as a future improvement.


Evaluation Dashboard
Sheldon Roberts
John Doe Performance Evaluation
Generate Report
Score Progression (Tower of Hanoi)
Highest Score
40,000
Lowest Score
40,000
Average Score
40,000


How to install .NET Core on Raspberry Pi
I'm a big fan of Raspberry Pi computers. So I found out that a ARM build of .NET Core had been released. I had to try it!.
Items Required
| Item | Note |
|---|---|
| Raspberry Pi | 2/3 Model B |
| microSDHC card | Class 6 or Class 10 microSDHC card |
| USB Keyboard | |
| Monitor |
Install Ubuntu Server Image to SD Card
Start by downloading Ubuntu server for Raspbery Pi
I choose the Ubuntu Server Standard 16.04 torrent
Extract the img file from the zip and use Win32 Disk Imager to copy the image to the microsd card.
Configure Wifi or just use ethernet (Jump to Install .NET Core)
Insert the microSDHC card into the pi and connect the power to boot. (It will take some time to boot into the console - mine took 5 minutes!)
Login with ubuntu/ubuntu, then configure wireless networking.
Option A If you have a internet connection via ethernet.
sudo apt-get install wpasupplicant
Option B If you don't have a internet connection via ethernet:
Download
and copy onto a FAT32 formatted usb stick. Insert the stick into the and check deviceidsudo fdisk -lCreate mount point and mount drive (Ubuntu server does not automount ootb)
sudo mkdir /media/external sudo mount -t vfat /dev/sda1 /media/external/Copy the files to the home directory and install:-
cp /media/external/*.deb /home/ubuntu/ sudo dpkg -i /home/ubuntu/libnl-3-200_3.2.27-1_armhf.deb sudo dpkg -i /home/ubuntu/libnl-genl-3-200_3.2.27-1_armhf.deb sudo dpkg -i /home/ubuntu/libpcsclite1_1.8.14-1ubuntu1_armhf.deb sudo dpkg -i /home/ubuntu/wpasupplicant_2.4-0ubuntu6_armhf.deb
Configure Wifi SSID and Pre Shared Key (PSK)
sudo nano /etc/network/interfaces
add the following to the file:-
auto wlan0 iface wlan0 inet dhcp wpa-ssid "SSID" wpa-psk "WIFIPASSWORD"Exit nano with Ctrl-X and confirm changes, then reboot.
sudo rebootWifi should now be working!!
Install .NET Core
Install the prereq packages for .NET Core. & core-setup
sudo apt-get install libunwind8 libunwind8-dev gettext libicu-dev liblttng-ust-dev libcurl4-openssl-dev libssl-dev uuid-dev wget https://github.com/dotnet/core-setup/files/716356/dotnet-ubuntu.16.04-arm.1.2.0-beta-001291-00.tar.gz mkdir /home/ubuntu/dotnet tar -xvf dotnet-ubuntu.16.04-arm.1.2.0-beta-001291-00.tar.gz -C /home/ubuntu/dotnet cd dotnet
Test the runtime with Hello World!
Create .NET Core Hello World App
I configured Visual Studio 2015 and created the app using instructions here My helloworld app consisted of:
using System; using System.Collections.Generic; using System.Linq; using System.Threading.Tasks; namespace helloworld { public class Program { public static void Main(string[] args) { Console.Write("Hello World!!" + Environment.NewLine); } } }
Publish the helloworld app using Build -> Publish and open helloworld.runtimeconfig.json to edit the version field to the .NET Core on the target pi (run ./dotnet --version to find out)
{ "runtimeOptions": { "framework": { "name": "Microsoft.NETCore.App", "version": "1.2.0-beta-001291-00" } } }
Then copy the published files to /home/ubuntu/helloworld using winSCP
To test the app!./dotnet /home/ubuntu/helloworld/helloworld.dll Hello World!!
You now have .NET Core running on a Raspberry Pi!! Enjoy!
Next Task is to setup ASP.NET by following this article


Example1
div size: width: 300px; height: 200px;
Simple example. Makes the text as big as possible without overflowing the parent div.
$("span#span1").bigText();
Testing BigText
Example2
div size: width: 800px; height: 100px;
Same as Example1 but with a different size div. Notice that jquery-bigtext checks both heights and widths to prevent overflowing.
$("span#span2").bigText();
Testing BigText
Example3
div size: width: 800px; height: 100px;
Same as Example2 but with fontSizeFactor set to 1. fontSizeFactor default is 0.8, it's used to give some vertical spacing for letters that overflow the line-height (like 'g', 'Á' and most other accentuated uppercase letters). This does not affect the font-size if the limiting factor is the width of the parent div.
$("span#span3").bigText({
fontSizeFactor: 1
});
Testing BigText
Example4
div size: width: 800px; height: 100px;
Horizontal alignment
$("span#span4").bigText({
horizontalAlign: "left",
});
Testing BigText
Example5
div size: width: 200px; height: 200px;
Vertical Alignment
$("span#span5").bigText({
verticalAlign: "bottom",
});
Testing BigText
Example6
div size: width: 100px; height: 300px;
BigText on rotated text? yes please!
Note: BigText, unlike padding, does not support setting the rotation of the text element on CSS. You must set through the $.bigText() options.
$("span#span6").bigText({
rotateText: 90
});
Testing BigText
Example7
div size: width: 100px; height: 300px;
More rotated examples.
$("span#span7").bigText({
rotateText: -90
});
Testing BigText
Example8
div size: width: 300px; height: 150px;
The element you call $().bigText() in can have other elements inside it. If you set the font-size in the em unit in these elements you can have bigger text followed by smaller text like below. Using this technique you can also have any kind of text, like font-awesome icons.
HTML:

Big
small

Javascript:
$("span#span8").bigText();
Big
small
Example9
div size: width: 600px; height: 300px;
Maximum font size option
$("span#span9").bigText({
maximumFontSize: 25,
});
Testing BigText
Example10
div size: width: 600px; height: auto;
Limits the font size based only on the parent element width instead of both width and height.
$("span#span9").bigText({
limitingDimension: "width",
});
Testing BigText
Example11
div size: width: auto; height: 200px;
Limits the font size based only on the parent element height instead of both width and height.
$("span#span9").bigText({
limitingDimension: "height",
});
Testing BigText
Example12
div size: width: 200px; height: 100px;
BigText also works with line breaks added manually. The default is to center the text on each line, but that can be changed using the textAlign property
$("span#span12").bigText({
textAlign: "right"
});
Testing
Big
Text
Example13
div size: width: 200px; height: 80px; padding: 30px
BigText understands padding on the enclosing div, so your text can have some breathing room without the need of multiple divs. In this example the enclosing div has a 30px padding added to it.
$("span#span13").bigText();
Testing BigText
Final Example
A more complex arrangement
$("span#complex_span1, span#complex_span2, span#complex_span3").bigText();
$("span#complex_span4").bigText({
rotateText: -45,
fontSizeFactor: 1
});


Proof of completeness for shuffles
Proposition (Completeness for shuffles).
If [[s1]] [[s2]]
then s1 = s2.
Proof.
First show by induction on s that:
=
Then show by induction on s that:
=
Then show by induction on s that we can
find a shuffle t such that:
=
(The previous result is needed in the case of composition).
Finally, iteratively use the first and last properties to show that
if [[s1]] [[s2]]
then s1 = s2.
Back


{% extends "database/base.html" %} {% block title %}
| Id | Area | Zone | Time | People Frequency | Police Station Nearby | Bar Nearby | Is Safe? |
|---|---|---|---|---|---|---|---|
| {{elem.id}} | {{elem.area}} | {{elem.zone}} | {{elem.time}} | {{elem.people_frequency}} | {{elem.police_station}} | {{elem.bar}} | {{elem.issafe}} |


| All nests shown were built by the same hummingbird, so… | —> | …when they build a new nest in the final remaining empty block… | —> | …it will fully enclose the area, creating a new Gardenspace… | —> | …and permantely capturing all enclosed blocks for the Fauna! |


Materials Needed: Scissors, Paper, Aluminum
In this project you will be making a birdhouse from a can!


[gecode-users] Using LocalHandles and LocalObjects with External Resources
Christian Schulte
cschulte at kth.se
Sun Jan 8 15:53:43 CET 2017
Hi,
This is hard to debug remotely but here is the catch:
- you have a shared datastructure that you have put into a local object.
- you need to make sure that both propagator and brancher destruct the
local handle but only if neither needs it any longer. If you make use of the
local handle in both propagator as well as brancher then everything should
be fine.
- for the propagator it means you have to use the AP_DISPOSE thing as you
did. In its dispose method you have to add an explicit call to the
destructor of the local handle, say that the local object is names lo and of
type Foo. Then lo.~Foo() will do the trick.
- for the brancher you also have to call in its dispose method the
destructor.
My guess is that the error comes from the fact that the shared object has
already been destroyed by either propagator or brancher and the other still
tries to access it.
Cheers
Christian
--
Christian Schulte, www.gecode.org/~schulte
Professor of Computer Science, KTH, cschulte at kth.se
Expert Researcher, SICS, cschulte at sics.se
-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Peter Backeman
Sent: Saturday, January 7, 2017 02:02
To: users at gecode.org
Subject: [gecode-users] Using LocalHandles and LocalObjects with External
Resources
Hello,
I've implemented a custom propagator and brancher which are sharing a
data-structure (a matrix of values), To share the structure in an efficient
(and convenient) way I have looked at using LocalHandle and LocalObject. In
MPG (Sec 31.4, page 391) this is described how to be implemented, however I
am doing something wrong because I keep on getting some kind of memory
error.
My main problem is with the notice for disposal (since external resources
are used). If I do not use home.notice(*this, AP_DISPOSE) (line 17 in
attached file), my program does run without errors, but I suspect it might
lead to memory leaks. I've tried figuring out how this should work, but I
have yet to find a full example using LocalHandle/LocalObject (i.e. together
with a model) and no previous issues around this.
I'm attaching a minimum failing example (main.cpp), I'm compiling it on
ubuntu using g++ version 5.4.0. and Gecode version 5.0.0 (I'm fairly sure,
do not know how to exactly check this) using the following command:
g++ -g -o main src/main.cpp -lgecodedriver -lgecodegist
-lgecodesearch -lgecodeminimodel -lgecodeint -lgecodekernel -lgecodesupport
and when running it I receive the following error (gdb output):
----------------------------------------------------------------------------
-
Program received signal SIGSEGV, Segmentation fault.
Gecode::VarImp<Gecode::Int::IntVarImpConf>::update (sub=<synthetic pointer>,
home=...) at ./gecode/kernel/core.hpp:4438
4438 ./gecode/kernel/core.hpp: No such file or directory.
(gdb) where
#0 Gecode::VarImp<Gecode::Int::IntVarImpConf>::update (sub=<synthetic
pointer>, home=...) at ./gecode/kernel/core.hpp:4438
#1 Gecode::Space::update (sub=0x64e380, this=0x64e220) at
./gecode/kernel/var-imp.hpp:484
#2 Gecode::Space::_clone (this=0x63c6a0, share_data=share_data at entry=true,
share_info=share_info at entry=true) at gecode/kernel/core.cpp:584
#3 0x00007ffff776b813 in Gecode::Space::clone (share_info=true,
share_data=true, this=<optimized out>) at ./gecode/kernel/core.hpp:3262
#4 Gecode::Search::Sequential::BAB::next (this=0x64db38) at
./gecode/search/sequential/bab.hh:149
#5 Gecode::Search::WorkerToEngine<Gecode::Search::Sequential::BAB>::next
(this=0x64db30) at ./gecode/search/support.hh:86
#6 0x0000000000411ad9 in Gecode::Search::Base<MyScript>::next
(this=<optimized out>) at /usr/local/include/gecode/search/base.hpp:51
#7
Gecode::Driver::ScriptBase<Gecode::Driver::IgnoreStepOption<Gecode::IntMinim
izeSpace> >::runMeta<MyScript, Gecode::BAB, Gecode::SizeOptions,
Gecode::Driver::EngineToMeta> (o=..., s=0x63c6a0)
at /usr/local/include/gecode/driver/script.hpp:360
#8 0x0000000000408e15 in
Gecode::Driver::ScriptBase<Gecode::Driver::IgnoreStepOption<Gecode::IntMinim
izeSpace> >::run<MyScript, Gecode::BAB, Gecode::SizeOptions> (o=..., s=0x0)
at /usr/local/include/gecode/driver/script.hpp:274
#9 0x0000000000405536 in main (argc=1, argv=0x7fffffffe0d8) at
src/main.cpp:63
----------------------------------------------------------------------------
-
Any ideas on what might be the problem is greatly appreciated. My guess is
that perhaps the destructor of the LocalHandle (LH) class have to make sure
dispose is called on the LocalObject (LHO), however my skills in C++ and
Gecode are not enough to know how I can try this. If someone just have an
implementation using LocalHandles/LocalObjects which is working, just
letting me have a look on that would be very helpful!
Best regards,
Peter Backeman
-------------- next part --------------
A non-text attachment was scrubbed...
Name: smime.p7s
Type: application/pkcs7-signature
Size: 4599 bytes
Desc: not available
URL: <http://www.gecode.org/pipermail/users/attachments/20170108/17216c70/attachment.bin>
More information about the users
mailing list


A connection to a hypervisor through baremetal.
Related Flags
| baremetal_type: | Baremetal domain type. |
|---|---|
| baremetal_uri: | Override for the default baremetal URI (baremetal_type). |
| rescue_image_id: | |
| Rescue ami image (default: ami-rescue). | |
| rescue_kernel_id: | |
| Rescue aki image (default: aki-rescue). | |
| rescue_ramdisk_id: | |
| Rescue ari image (default: ari-rescue). | |
| injected_network_template: | |
| Template file for injected network | |
| allow_project_net_traffic: | |
| Whether to allow in project network traffic |
Bases: nova.virt.driver.ComputeDriver
Updates compute manager resource info on ComputeNode table.
This method is called when nova-coompute launches, and whenever admin executes “nova-manage service update_resource”.
Get cpuinfo information.
Obtains cpu feature from virConnect.getCapabilities, and returns as a json string.
| Returns: | see above description |
|---|
Return the current state of the host. If ‘refresh’ is True, run the update first.
Get hypervisor type.
| Returns: | hypervisor type (ex. qemu) |
|---|
Get hypervisor version.
| Returns: | hypervisor version (ex. 12003) |
|---|
Retrieve information from baremetal for a specific instance name.
If a baremetal error is encountered during lookup, we might raise a NotFound exception or Error exception depending on how severe the baremetal error is.
Get the total hdd size(GB) of physical computer.
| Returns: | The total amount of HDD(GB). Note that this value shows a partition where NOVA-INST-DIR/instances mounts. |
|---|
Get the free hdd size(GB) of physical computer.
| Returns: | The total usage of HDD(GB). Note that this value shows a partition where NOVA-INST-DIR/instances mounts. |
|---|
Get the total memory size(MB) of physical computer.
| Returns: | the total amount of memory(MB). |
|---|
Get the free memory size(MB) of physical computer.
| Returns: | the total usage of memory(MB). |
|---|
Get vcpu number of physical computer.
| Returns: | the number of cpu core. |
|---|
Get vcpu usage number of physical computer.
| Returns: | The total number of vcpu that currently used. |
|---|
See comments of same method in firewall_driver.
Update the status info of the host, and return those values to the calling program.


--- layout: post status: publish published: true title: WSE 2.0 author: display_name: Tomas Restrepo login: tomasr email<EMAIL_ADDRESS>url: http://winterdom.com/ author_login: tomasr author_email<EMAIL_ADDRESS>author_url: http://winterdom.com/ wordpress_id: 781 wordpress_url: http://winterdom.com/2004/05/wse20-2 date: '2004-05-30 20:37:14 +0000' date_gmt: '2004-05-30 20:37:14 +0000' categories: - Web Services tags: [] comments: [] ---
As everybody knows, WSE 2.0 was released last week. One thing I find myself wishing for was to be able to use Simon's excellent TcpTrace with the TCP Transport in WSE. Alas, WSE doesn't like it when the reply endpoint is on a different port than the request (it's possibly comparing the two endpoint URLs, atlhough I haven't dug into it) :(
Update: A few hours after posting this, my good friend Christian Weyer sent me an email mentioning that this indeed can be made to work, by simply taking advantage of the routing facilities and inserting a Via element in the endpoint reference that points to the port TcpTrace is listening on from the client side! Way cool! Thanks Christian! :)


Merge Nodes
Merge nodes in your graph together
Merge nodes in your graph together based on the defined criteria.
Parameters
- Merge By - The rule to determine when nodes should be merged together. Options include:
- Geospatial Distance - Will merge nodes within a particular geospatial distance of each other. The distance to compare is defined by the threshold
- Identifier Prefix Length - Will merge nodes matching the start of the Identifier attribute. The length to compare is defined by the threshold
- Identifier Suffix Length - Will merge nodes matching the end of the Identifier attribute. The length to compare is defined by the threshold
- Supported Type - Will merge nodes based on the type by merging supported types overriding those not supported.
- Threshold - The limit to apply to the selected rule (not applicable for Supported Type rule)
- Merging Rule - The rule deciding how attributes are merged
- Lead Node - The rule deciding how to choose the lead node (not applicable for Geospatial Distance or Supported Type rules). Options include:
- Longest Value - Use the node with the longer Identifier value length
- Shortest Value - Use the node with the shorter Identifier value length
- Ask Me - A dialog is displayed asking you to select the lead node by selecting its Identifier
- Selected Only - Only apply to selected nodes


Create Trip
Going through Arizona, Texas, New Mexico, and Utah!
Click to add Destination
Ashland, Portland, Seattle, and Vancouver :)


 It takes place in South Philadelphia in the summer of 1933 when two bits (25 cents) was, in the time of that depression, what some men would beg to earn for a day's work. On the day the film opens, a truck with music and billboards is going through town announcing the Grand Opening of a new Movie Palace, with the admission price of 25 cents until 6 PM.
Looking wistfully at the truck as it passes is twelve-year-old Gennaro Spirito (Jerry Barone); how he would love to have had the necessary two bits. Gennaro lives with his mother, Mary Elizabeth Mastrantonio, and his sister, and his grandfather (Al Pacino) who is not only his best friend but also his mentor on what is happening in the world. Grandpa announces that this is his last day on earth, that he will give Gennaro 25 cents when he dies. Gennaro does not like the idea of his grandfather dying so that he can go to the movies.
Although Gennaro tries to pick up some change by performing in the streets, he remains empty handed. Grandpa offers his grandson one other opportunity to earn the two bits. It seems that when grandpa was a young man, many years ago, he had hurt a young woman and he wants Gennaro to visit the old lady and offer Grandpa's late apology.
 He is well able to fit right in with the older stars, Pacino and Mastrantonio who give their usual fine performances.
Director James Foley keeps the film purposely at a slow pace, reflecting the depression, the summer heat, the boy's frustration and Grandpa's last days. Very nicely done.
2.75 bytes 4 Bytes = Superb 3 Bytes = Too good to be missed. 2 Bytes = So so. 1 Byte = Save your money.
-- Ben Hoffman
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Language
- English(Fluent) and Korean(Native)
Programming Skills
- Proficient in Python(including Django, KERAS, and pandas), Database(SQL), MATLAB, and Git
- Intermediate Knowledge in SAS, STATA, LabView, JavaScript(Vue.js), and AWS
- Experience in and HTML & CSS


{% extends 'emails/base_email.html' %} {% block content %}
User reported/updated the below issue. Please find the details.
Reported by : {{ user.email}}
Reported Time : {{ thread.last_post_date}}
Issue Title : {{ thread.title }}
Issue Description : {{ content }}
{% endblock %}


Contribute to this open source project!
We're continually looking to update this dashboard with powerful insights extracted from rich data and metrics. We strongly encourage developers to fork the source code and submit a pull request with new features to help grow our understanding of how the American public feels and reacts to our political campaigns.
- Fork it (must be signed into Github)
- Create your feature branch (git checkout -b my-new-feature)
- Commit your changes (git commit -am 'Add some feature')
- Push to the branch (git push origin my-new-feature)
Priorities
We encourage developers to add to this as they see fit. Here is what we think would be neat additions to this dashboard:
- Historical, searchable graphs (line, bar, or chart) of the information presented on this dashboard.
- How each of the candidates stand on particular issues.
- Each of the candidates plans once in office (taxes, military, etc).
- Each of the candidate's most recent tweets.
- The capability for an admin account where they can change which hashtags, users, and topics to monitor through the UI.
- Use Haven OnDemand's Concept Extraction API and Entity Extraction API to create a tag (word) cloud for each candidate.
- Save the topics and associated sentiment score from each tweet analyzed to determine an aggregate sentiment score for each topic. From this data, create a visualization to show the most negative and most positive topics related to each candidate.
Stack


{{if .Editing}}
{{end}} Users AddedAdd Friends
{{end}}
{{if eq .Offset 20}}
{{if eq .Offset 20}} {{if .Pjax}} {{template "header.html" .}} {{else}}
{{$user.Nickname}} {{$user.Username}}
{{$user.Comment}}
You've added every friend you can to the group.
{{if .FriendCount}}You've added every friend you can to the group.{{else}}You don't have any friends. Why don't you make some?{{end}}


What is it?

This is an complete rewrite to make it smaller / simpler / more elegant.
It is simple to use, very small(~1kb for js+css) and elegant!
Demo(older version, new looks similar) or Live demo
Original license is for free private/commercial use.
Demo
Simple images with some misc text.
At the start IE6 will see an instant fade from blank->image0, if you do not like this make the first slide visible(display:block).
Naturally the timeout should never be smaller then 2 * fadeTime...
The Code


NFL Fantasy Tracker
Enter Season
Enter Week
Select Position
QB
RB
WR
K
Submit
Name
Team
Position
Touchdowns
Fantasy Points


About
Ozone in the stratosphere protects life on Earth from ultraviolet radiation. But near the ground, it is a secondary pollutant. It is formed when primary pollutants such as car emissions react with sunlight, emissions from factories and power plants etc.
Danger
Ozone damages the lungs and has been linked to asthma exacerbation and other lung problems. Ozone causes lung inflammation and makes people more susceptible to infections such as pneumonia and asthma. It also damages crops, trees and other vegetation. It is a main ingredient of urban smog.
Reducing ground level ozone
Vehiches emit large amounts of ground level ozone, try to take public transport or walk to reduce your ozone emissions!


A recent conflict that comes to mind is at one of my previous jobs. After some people left from the company the rest of us had to absorb their workload. I was happy to pitch in although my plate was already pretty full. One task in particular was very time consuming and dull and when it came apparent that there were no plans to hire other people I reached out to discuss my responsibilities. I hoped that some of the tasks could be shifted around, especially the very tedious one which could be split between more people, and I could take on some other responsibilities to continue helping out with the increased work load.
When I attempted to communicate my thoughts the response was that I just have to continue doing it with no further room left for discussion. I felt that I had no voice and that I was being undervalued and it bothered me there was not even an attempt to understand my angle and find a middle way. Upon giving it some more thought I realized that everyone was under pressure and there was probably not a fast solution anyway even if they would have listened to me. So I focused on trying to automatize the task and make it less time consuming. In a few weeks I did manage to reduce substantially the time I was spending on it.
If I were to face a similar situation I would still try to communicate and find a solution that's beneficial for everyone but what I did learn from this episode is that there are more ways to approach a conflict and have a constructive attitude.


A place for general developer talk – for everyone! | Documentation https://developers.komodoplatform.com | MoreDev Docs - https://docs.komodoplatform.com | Mastering CryptoConditions - https://github.com/KomodoPlatform/Mastering_CryptoConditions
100 messages
Before 05-Dec-19 12:00 AM
jl777c29-Nov-18 08:41 AM
but a staking reward can also stake!
without specific details of the block, I cannot give any specific answers
kmdstudent29-Nov-18 09:50 AM
Hi @everyone, could you anyone let me know kmd testnet block explorer link?(edited)
this is for an ongoing KMD project, and seemed like a useful library to write. Anybody that needs to validate many different addresses from various coins in JS, it might make your life easier/better
supports all KMD asset chains that I know of, but beware of Sapling edge cases (I have heard that OOT will not update to Sapling, have not confirmed)
it could be the case, that at date X on coin Y that Sapling is not valid, even tho it's valid on KMD and most AC's. Right now the code assume Sprout + Sapling addresses are valid on KMD + all asset chains
when sprout support ends (Feb 15th I think), the library will remove sprout zaddrs as being valid
i thought i knew a lot about address formats before this, but I still learned more by writing this
blackjok3r29-Nov-18 05:38 PM
@jl777c
To get sapling to merge into staked I had to "fix" the compile issues for komodo-cli, before I used an ifdef and a -DSERVER in the makefile to excliude things that were not avalible to bitcoin-cli.o but after the verus merge, that no longer worked. after suffing around for hours I managed to fix it.
I'm not sure why it was done the way it was, but I ended up having to do it like this commit:
https://github.com/StakedChain/komodo/commit/7ca059a0fbdd453d80913c809c2ba5d2cbe59a75
This works and I no longer get all kinds of unreferanced things randomly thourgh my code. Is this something you want as a PR, it seems a much cleaner solution than how it was before.(edited)
I assume that all the other way is doing is reading the conf file... which is exactly how this works, but shortcuts anout 20 functions and hard to follow paths through the code.
jl777c29-Nov-18 05:41 PM
its just for bitcoin-cli? if so, and it simplifies things, sure make a PR
blackjok3r29-Nov-18 05:42 PM
yes just for bitcoin-cli
required only 2 global declareations and to read ac_name directly
now there are no cross compiles of random files between komdod and komodo-cli
kmdstudent30-Nov-18 06:10 AM
@jl777c thanks. And where are working BEER and PIZZA electrum servers?
Why hyperdex does never connect to electrum server at the moment?
@everyone could you anyone let me know?
jl777c30-Nov-18 08:23 AM
my coins repo should have info on current electrum servers
ComputerGenie 👴👴👴30-Nov-18 10:45 AM
#ask-jl777
D.rabbani30-Nov-18 07:54 PM
hi @ComputerGenie 👴👴👴 i have a problem here
1
D.rabbani30-Nov-18 08:52 PM
hi @ComputerGenie 👴👴👴 do you know how long
does the -salvagewallet takes?
actually i am trying to recover my wallet
but i have just ran the command
-salvagewallet
but it shows no logs nothing at all
dukeleto30-Nov-18 08:53 PM
@D.rabbani look for other files, in same dir as wallet.dat, with similar names
like wallet.dat.bak.16454353454
D.rabbani30-Nov-18 08:53 PM
no basicaly what happened is
yes i got wallet.123124.bak
something like this
dukeleto30-Nov-18 08:54 PM
salvage does a very specific think, it creates those .bak files
D.rabbani30-Nov-18 08:54 PM
two of them with same space
but the thing is
when i cp the wallet.12313.bak to my wallet.dat
and i try to run the daemon
it just says Error with no error logs ?
just like empty
i am worried as my wallet got too much of the balance
i got salvagewallet through google
i am in need of help
dukeleto30-Nov-18 08:55 PM
-salvage is a last ditch effort kind of thing. It's not going to always work
your wallet.dat was corrupted, it sounds like
D.rabbani30-Nov-18 08:56 PM
yes
but it runs second time actually it creates new one second time when i run the daemon
dukeleto30-Nov-18 08:56 PM
all salvage wallet tries to do, is "salvage" the parts of your wallet.dat that were not corrupted. Kind of like saving individual rows of a database, but it might not be able to salvage some parts
D.rabbani30-Nov-18 08:56 PM
okai
dukeleto30-Nov-18 08:56 PM
if you use salvage CLI arg, it probably creates a new .bak no matter what
D.rabbani30-Nov-18 08:56 PM
any thing else i can do
yes it is
doing that
the same .bak
with same specs
dukeleto30-Nov-18 08:57 PM
what is the size of the original/corrupt wallet.dat, and the .bak?
are they the same size?
is one bigger?
D.rabbani30-Nov-18 08:57 PM
well actually the situation is the two wallet.bak files got same size
dukeleto30-Nov-18 08:58 PM
also, did you have funds in taddrs, zaddrs, or both, in that wallet?
i want to know the size of original and .bak, not multiple .bak files
D.rabbani30-Nov-18 08:58 PM
in that wallet
original .dat file is not there
actually my scenrio was
liek
dukeleto30-Nov-18 08:58 PM
original wallet.dat is gone, sounds like a bigger issue
D.rabbani30-Nov-18 08:58 PM
oh
so i am helpless
so i am trying to run it again without salvage
hope it will work now
dukeleto30-Nov-18 09:01 PM
-salvage requires a corrupt wallet.dat to work on
if there is no wallet.dat, you will not have a useful .bak file
it is probably creating an empty .bak, if you start with no wallet.dat
D.rabbani30-Nov-18 09:02 PM
it worked now
dukeleto30-Nov-18 09:02 PM
"empty" BTC wallets are still a few kilobytes of metadata/etc


--- layout: post title: '5,000 APIs: Facebook, Google and Twitter Are Changing the Web' url: http://www.programmableweb.com/2012/02/06/5000-apis-facebook-google-and-twitter-are-changing-the-web source: http://www.programmableweb.com/2012/02/06/5000-apis-facebook-google-and-twitter-are-changing-the-web domain: www.programmableweb.com image: http://kinlane-productions.s3.amazonaws.com/ap-evangelist-site/curated/screenshots/9352_api500_com.png ---
Our API directory has hit another major milestone.We now list 5,000 APIs, just a short four months since passing 4,000.No longer is the web simply about links connecting one site to another.Instead, developers are using tools to connect data and functionality from one site to another site.It’s an incredible transformation that has happened over a very short period of time.


We enhance methodologies!
- scale next-generation initiatives
- utilize 24/365 methodologies
- utilize real-time applications
- generate intuitive ROI
- deliver intuitive web services
- e-enable holistic e-services
- synergize holistic interfaces
- transition cross-media supply-chains
- redefine cross-media models
- optimize 24/365 partnerships
- embrace end-to-end synergies
- visualize innovative users
- incentivize compelling niches
- leverage vertical architectures
- whiteboard sexy applications


README¶
aioqueue¶
A Python Task Queue library using RabbitMQ (aioamqp) and asyncio
Install¶
pip install aioqueue
Create a queue¶
from aioqueue import Queue
q = Queue() # connects to rmqp://localhost:5671 by default
# on start-up, wait 10 seconds after each failure to connect (defaults to 5)
q = Queue(retry=10)
# start up the queue
q.start() # runs the connection in an asyncio event loop
# or if you need to start the queue asynchronously
await q.start_async()
Define a task¶
@q.on('my_task')
def my_task(data):
# defines a queue named 'my_task' when `start()` is called
message = data['message']
print(message)
return 'world'
Trigger a task¶
t = await q.task('my_task', { 'message': 'hello' })
Get the result of a task¶
result = await t.result()
Note: A call to result() isn’t necessary if you don’t want the result of the task. You can also pass no_response=True to q.create() if you really don’t want the result and don’t want the queue waiting around for a result. In that case, a call to result() will always return None.
Close a queue¶
await q.close()
Using async with¶
async with Queue() as q:
t = await q.task('my_task', { 'message': 'Go' })
result = await t.result()
Sending raw bytes¶
When creating a task with task(), the data gets packed with msgpack. To prevent this and just send raw bytes, use the keyword argument raw=True. If you’re passing bytes that are not msgpack data and using the on() decorator, pass raw=True to on() as well
@q.on('raw_task', raw=True)
async def raw_task(data):
# data is raw bytes
print(data)
await q.task('my_task', b'Hello', raw=True)
License¶
MIT


HOW THE GRINCH STOLE CHRISTMAS A film review by Steve Rhodes Copyright 2000 Steve Rhodes RATING (0 TO ****): ***
In the most anticipated movie of the holiday season, Jim Carrey recreates Boris Karloff's famous Grinch role in HOW THE GRINCH STOLE CHRISTMAS. Based on the well-known Dr. Seuss story, the Jim Carrey version, directed by Ron Howard (EdTV), is a live-action movie. The 1966 television original, an annual Christmas tradition in the Rhodes household, is an animated film. Even if the remake pales in comparison to the original, it is a cute and funny movie in its own right.
As you probably know, the Grinch is a "bah humbug" kind of guy who tries to keep Christmas from coming to the sweet Whos by stealing all of their presents and decorations. In a tribute to the original show and book, the remake keeps most of the lines but adds in more story in order to triple the length of the original half-hour show. In a flashback to the Grinch's childhood, we finally get some insights into what made him into the quintessential crab.
Anthony Hopkins, as the narrator, is the perfect choice to replace Boris Karloff, whose voice was the best part of the original production. With the exception of his speeding up and slurring a few lines, Hopkins provides a wonderful rendition of the Seuss rhyme.
In order to accurately recreate the Seuss images, production designer Michael Corenblith carefully reviewed the illustrations in all of the Seuss books. With this knowledge he created a visual vocabulary in order to ensure that every tower and every bridge would be as close as possible to what Dr. Seuss would have imagined them. The inventive result is a snow-covered cross between WILLY WONKA & THE CHOCOLATE FACTORY and THE WIZARD OF OZ.
Five-time Academy Award winner Rick Baker's special make-up effects turn Carrey into a creature bearing little resemblance to the man inside the suit. Only Carrey's expressive mouth is recognizable.
The story's laughs come from both the gadgets and the dialog. Martha May Whovier (Christine Baranski), for example, is able to outdo her neighbor Betty Lou Who (Molly Shannon) through the aid of a Gatling-style machine gun for shooting Christmas lights onto the outside of her house.
When the Grinch first checks his heart, he declares proudly, "Down a size and a half, and this time I'll keep it off." This is a guy whose daily calendar entries include, "wallow in self-pity" and "solve world hunger -- tell no one." Working against his desire for grumpiness is one little Cindy Lou Who, played sweetly by Taylor Momsen in her major motion picture debut. She sees goodness in the Grinch that others don't. And when he tries to scare her with massive screaming, she tells him, "Maybe you need a time out."
One of the funniest scenes occurs when the toddler Grinch is offered Christmas cookies on a plate made in the image of Santa Claus. Biting off Santa's head rather than eating a cookie, the little Grinch announces, "Santa, bye-bye."
Sometimes, it's the small things that make a difference. The sweet little dog, Max, in this version is a wonderful dog who acts and even looks kind of like the original. I like that.
HOW THE GRINCH STOLE CHRISTMAS runs 1:38. It is rated PG for crude humor and would be acceptable for all ages.
My son Jeffrey, age 11, thought this version was funnier than the original, but not better. He gave it ***, mentioning how much he liked the gadgets. His sole complaint was that only Cindy Lou Who and the Grinch were fully developed characters.
Email<EMAIL_ADDRESS>Web: http://www.InternetReviews.com
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


STL Skateboarding
Home
(current)
Parks
Spots
Shop
Contact
Call
Us
At
314-325-0989
Email
Us
At
<EMAIL_ADDRESS>We secretly own the Arch
Don't tell mom.
Go somewhere besides here right now. Seriously go away.


JIT stands for “Just-In-Time” compilation, which is a technique used by some programming languages and runtime environments to improve the performance of executing code. That would make sense to a developer but for non-developer, I think the definition can be a bit confusing so let me try to explain this in a simple way. Imagine you have a code blob written in your fav programming language (let’s say python for now). Now Python is an interpreted programming language, which means that the source code is executed line by line by a Python interpreter at runtime. Your machine can only understand binary numbers so python interpreter helps bridge the gap between your python code and the machine.
Due to Python’s dynamic nature and the way it handles data types, pure interpretation can result in relatively slower execution speeds compared to languages that are compiled to machine code directly (For example C, C++) which are signficantly faster to run. For more context on how compilation works, check this blog
Coming back to python(our selected programming language) which is interpreted at run time, our computer has to translate the python code into machine readable code which can be very slow if we have to many recurring function calls or loops (every function call has to be translated to machine code before executing).
Demo code: 🧪💻💥
Let me show the above issue with an example:
Imagine you have a very basic python code file (say sum.py), which runs a loop to add 2 numbers in loop running 1000 times:
def sum(a,b):
return a+b
for i in range(0,1000):
sum(i,i+1)
I can run the above code using time python sum.py
to get ideas on the time it took to execute the above code.
For 1000 iterations, it takes 0.03 sec on Mac pro with 32 GB ram and intel processor:
Now, let’s crank the number of iteration to 100 M, the same code takes 14.5 secs to run 🤯 🦥 🐢
Magic of JIT
JIT can significantly help improve python runtime performance. It uses a technique called “tracing JIT” to identify frequently executed code paths and optimize them. JIT can detect any recurring function during the execution and store a compiled version on the fly. During the execution, JIT will start using the compiled function instead of parsing and interpreting the function during the loop.
In our example, JIT will detect that the function sum(a,b)
is being called in a loop multiple times. Why not compile it on the fly and use the compiled version for execution which might save some CPU cycles.
JIT in action example:
I am using pypy3 package to run JIT but you can try other packages too (Numba etc). To install pypy3 use the below command in mac:
brew install pypy3
For 100M iterations, it takes 0.16 sec to run the same code with JIT (98.8% faster than python code without JIT 🚀🚀🏃🏃)
We have seen the benefits of JIT in a language like python where it can help speed up the execution times signficantly, but there are some limitations of JIT which I wanted to share here as well:
- JIT has a higher memory overhead than usual runtime. Since we have to store the compiled code in the machine which takes up memory, running JIT on a code base with too many functions would need significantly high memory compared to normal python operations.
- JIT works well with long running programs. For programs with not a lot of loops/functions, the memory overhead of running JIT is not worth the effort.
- It doesn’t do Ahead-Of-Time Compilation (AOT) like C where a program is compiled before running. It compiles the code during runtime but there is no support to pre-compile the code in advance.
Overall, I think JIT can significantly boost the performance of your code base and if you have long running loops, you should conisder it. In Shopify, we use have seen signficant speedups in code compilation using YJIT which is similar to JIT.
For more context on JIT using pypy, check this blog.
For any questions, reach out on LinkedIn


{%extends "registration/base.html"%} {% load bootstrap4 %} {% block content %}
Don't have an account? sign-up


Provides helper services that wrapps the functionality of the angular-oauth2-oidc
library. For more information about
angular-oauth2-oidc
see
https://github.com/manfredsteyer/angular-oauth2-oidc.
ObAuthenticationModule
with the forRoot
method in the application's root module.ObAuthenticationConfigService
to configure the angular-oauth2-oidc
library. It's recommended to
perform the configuration in the application's root module.
ObAuthenticationService
to perform login, logout or get identity informations.
You can pass a OAuthModuleConfig
and a ValidationHandler
as parameters of the forRoot
method of the
ObAuthenticationModule
.
@NgModule({ ... imports: [ ... ObAuthenticationModule.forRoot({ resourceServer: { allowedUrls: ['https://oblique.bit.admin.ch/training'], sendAccessToken: true }, CustomValidationHandlerClass // Placeholder for the effective class }) ], ... })
For more information about the OAuthModuleConfig
or the ValidationHandler
see:
You can configure the OpenID Connect flow, the use of a discovery document or the automatic silent refresh of the token with the
ObAuthenticationConfigService
. It's recommended to perform the configuration in the application's root module.
export class AppModule { constructor(readonly authConfigService: ObAuthenticationConfigService) { authConfigService.useDiscoveryDocument = true; authConfigService.setupAutomaticSilentRefresh = true; authConfigService.configureFlow({ issuer: 'https://idsvr4.azurewebsites.net', // Url of the Identity Provider redirectUri: window.location.origin + '/index.html', // URL of the SPA to redirect the user to after login clientId: 'spa', // The SPA's id. The SPA is registerd with this id at the auth-server responseType: 'code', scope: 'openid profile email offline_access', // set the scope for the permissions the client should request }); } }
The ObAuthenticationConfigService
uses the AuthConfig
of the angular-oauth2-oidc
library in order
to configure the library. For more information about the properties of the AuthConfig
see it's
documentation.
You can directly access the OAuthService
of the angular-oauth2-oidc
library through the
ObAuthenticationService
. This allows you to use functionalities of the OAuthService
that are not wrapped by the
ObAuthenticationService
.


Debt Wealth Will
A Collective Awareness Notes Peace in South West.md Podium Team
Aug 20, 2021
3 mins read
This summer has been a difficult season. Right after the spring I stopped seeing you - I miss you, sorry we weren’t together through everything so you could simply do your most important job on the planet, hold onto our new life while sharing my best self with everyone else.
Aug 14, 2021
1 min read
/cough/ begin.. [hands folded, lowers chin-to-chest] Thank you. Thank you for my day. Thank you for every day I have had. Thank you for my rest. And thank you for my wife. Thank you for our memories, and for each other.
Aug 6, 2021
Is The Observer Responsible? Notes on obersation and the cognitive affects it may have on the observed. The younger self invests more of identity in its social group - compared to personal history, acheivements, work, and family later on in life.
Jul 31, 2021
5 mins read
I, Jerad Steven Acosta and Stephanie Chong Acosta, are here writing our official Will and Testament. This is where we decide what to happens with all of our stuff. Any money, property, houses, land, animals, gold, dollars, wealth, anything and everything that is ours or is owed to us - even if we are in devbt (it does not matter we do not care what anyone says) IS TO GO TO ABSOLUTELY NO ONE.
6 mins read
All In All I have been paid for many times over. I had eternity fixed - enough time for everyone to feel complete, fulfilled, the absolute actualization of the self into our whole. Not a single individual would have desired even to relive a moment sentimentally -> We may have even accessed eternal life or multiple heavans for us all.


BY XXXXXXXXXXXXXXXXXXXX
ANY OTHER ACCREDITION
In six months, the highly contagious pathogen would infect over 13 million people across continents to claim more than 550 thousand lives. The Covid-19 pandemic is now being called the worst global crisis since World War II.
The speed of the spread and the concomitant economic meltdown engendered by the novel Coronavirus has triggered many a debate. How soon will we have a vaccine for the disease? Do masks mitigate exposure to the virus? When should nations end lockdowns?
The answers to some of these questions are embedded in the trajectory of three major epidemics that have afflicted the human race in the last two centuries.
The Spanish Flu
Spanish Flu left behind empirical evidence on how short-term behavioral changes can save lives in influenza epidemics. A full one century later, benefits of wearing masks are contested even in most developing countries.
THE FIRST SIGNS
Six months before the armistice was signed between warring sides to bring down the curtains on World War I in 1918, an ‘unusually fatal’ respiratory disease caught the attention of physicians at a British training camp in Eaples in France.
Nearly half of those showing influenza like clinical symptoms were succumbing to the infections.
So the Spanish Flu started in France? Some Research seems to suggest that.
LESSONS FROM THE SPANISH PANDEMIC
Spanish Flu in India
Lessons from Spanish Flu
Story from US
The Spanish Flu swept through vast swathes of the United States in three waves between 1918-19 claiming more than 650 thousand victims.
Major cities and towns in the US sought to implement short term social behavioural changes to restrict the spread of the disease. Schools and religious places were closed. Some cities restricted mass gathering while others mandated wearing of mask in public places.
A recent study shows San Francisco, St Louis, Milwaukee and Kansas City which introduced these measures early reduced transmission rates by up to 30% to 50% and saved millions of lives.
New York City which is worst hit by the current Covid-19 crisis was quick to adopt preventive measures in 1919. The state rigidly enforced social distancing and enforced staggered business hours.
How NYC compares in the two pandemics
Weekly deaths per 100,000
XXX
COVID-19
XXX
SPANISH FLU
Lessons from Spanish Flu
In absence of pharma intervention, short term behavioural changes are key to restrict the spread of a global pandemic. Those who were quick to adapt and adopt could successfully navigate the crisis in 1919. While others had to pay a heavy price for inaction and ineptitude.


This page describes how to implement various types of stock charts using the Kirby standard configurations. If you would like a guide on how to get started, go to this guide .
The philosophy of the Kirby chart configs is to give the implementer full control over the chart, while providing standard configs, which makes it easy to create custom charts which comply with the Kirby design.
The idea behind Kirby chart config is only to provide configurations and not the canvas itself. It is for the implementer to provide the canvas because it gives the implementer ownership.
Below is a guide on how to implement different variations of the stock chart.
The data used to exemplify these charts is displayed below:


OpenInGoogleMaps Reference
OpenInGoogleMapsController
The OpenInGoogleMapsController
class is designed to make it easy for an iOS developer to open a map, show a Street View location, or show a set of directions directly in Google Maps. The class supports using the x-callback-URL
standard so that you can add a “Back to my app” button directly within Google Maps, and supports a number of fallback strategies, so that you can automatically open the map in another application if the user does not have Google Maps installed.
About the Google Maps URL Scheme
The OpenInGoogleMapsController
class makes use of the Google Maps URL Scheme. If you want to understand how the class works under the hood, we highly recommend reading the URL Scheme documentation first.
Installing OpenInGoogleMapsController
You can download the OpenInGoogleMapsController
class, along with a sample app demonstrating its use, from the OpenInGoogleMaps Github page.
To add the class to your Xcode project, simply drag the OpenInGoogleMapsController
.m and .h files into Xcode. Make sure you call #import
OpenInGoogleMapsController.h
where necessary.
Running the Sample Application
If you would like to try out the sample application, open OpenInGoogleMapsSample.xcodeproj
in Xcode. You will probably want to run this on a real device, as the simulator does not have Google Maps installed.
Using OpenInGoogleMapsController
OpenInGoogleMapsController
is a singleton class, which you can reference by calling the sharedInstance
class method.
[[OpenInGoogleMapsController sharedInstance] <make calls here>]
Adding a Callback URL
Google Maps and Google Chrome both support the x-callback-URL specification, which allows you to easily add a “Back to my app” button in Google Maps. To add a callback url:
- Within your Xcode project, select your target, and then select Info -> URL Types
- Add a URLType for your application. This string should be unique for your app. Many developers choose to use their bundle identifier, without the periods (
comgooglemyapp
, for instance). Set the
callbackURL
property in yourOpenInGoogleMapsController
class.NSString myURLScheme = @"comexamplemyapp://"; NSURL myCallbackURL = [NSURL URLWithString:myURLScheme]; [OpenInGoogleMapsController sharedInstance].callbackURL = myCallbackURL;
When you open your maps now in Google Maps (or Google Chrome), you should see a button that redirects users back to your app when they’re done viewing the map.
You only need to set the callback URL once during the lifetime of your application and it will be used in all future OpenInGoogleMapsController
requests.
Fallback Strategies
If the user does not have Google Maps installed, you can specify a number of fallback strategies for OpenInGoogleMapsController
to try by setting the fallbackStrategy
property.
[OpenInGoogleMapsController sharedInstance].fallbackStrategy =
kGoogleMapsFallbackChromeThenAppleMaps;
The fallback strategies you can try are as follows:
kGoogleMapsFallbackNone
= Do nothing and returnNO
if the user does not have Google Maps installed. This is the default.kGoogleMapsFallbackAppleMaps
= Open the map with Apple’s Maps app instead.kGoogleMapsFallbackChromeThenSafari
= Open the map with Google Chrome if installed, otherwise open the map using Google Maps in Safari.kGoogleMapsFallbackChromeThenAppleMaps
= Open the map with Google Chrome if installed, otherwise use Apple’s Maps app.kGoogleMapsFallbackSafari
= Open the map with Google Maps in Safari instead.
If you have specified a callback URL, it will also be passed to Google Chrome.
You only need to set the fallback strategy once during the lifetime of your application and it will be used in all future OpenInGoogleMapsController
requests.
Detecting if Google Maps is installed
If you want to manually detect if Google Maps is installed, you can use the isGoogleMapsInstalled
property.
BOOL isGoogleMapsInstalled = [OpenInGoogleMapsController sharedInstance].isGoogleMapsInstalled;
Opening a map
Opening a map requires first creating a GoogleMapDefinition
object to define the map you want opened. You can then pass the definition object to the openMap
method. This method will return YES
if it was able to open the map in some application, and NO
if it was unable to open a map, either because you didn’t define anything to search for, or your user does not have Google Maps installed and you did not specify a fallback strategy.
GoogleMapDefinition *definition = [[GoogleMapDefinition alloc] init];
// Steps to define the definition.
[[OpenInGoogleMapsController sharedInstance] openMap:definition];
GoogleMapDefinition
The GoogleMapDefinition
class includes several properties, some of which may be set to nil
:
(NSString *)queryString
: A query string which, if set, will be used to search for a place by name.(CLLocationCoordinate2D) center
: Defines the center of the map, in lat/long. If both this and the query string are specified, this will be used as a center for the search. To clear this value, set it tokCLLocationCoordinate2DInvalid
. (Setting it to nil will specify a center of 0,0.)(GoogleMapsViewOptions) viewOptions
: A set of bitwise-ORed options that can be set on your map:kGoogleMapsViewOptionSatellite
: Shows a satellite view.kGoogleMapsViewOptionTraffic
: Shows traffic information.kGoogleMapsViewOptionTransit
: Shows transit information.
float zoomLevel
: Defines the zoom level of the map. This can currently be any value from 0 to 21.0.
Here’s an example that opens up a map for “123 Main Street, Anytown, CA” with the “traffic” and “satellite” map layers turned on.
GoogleMapDefinition *definition = [[GoogleMapDefinition alloc] init];
definition.queryString = @"123 Main Street, Anytown, CA";
definition.viewOptions = kGoogleMapsViewOptionSatellite | kGoogleMapsViewOptionTraffic;
[[OpenInGoogleMapsController sharedInstance] openMap:definition];
Opening a street view location
Opening a Street View location requires creating a GoogleStreetViewDefinition
class to define the location you want to open. You can then pass this definition to the openStreetView
method. This method will return YES
if it was able to open the Street View request in some application, and NO
if it was not, either because you didn’t define a set of coordinates, or your user does not have Google Maps installed and you did not specify a fallback strategy.
Note that a YES
value does not actually guarantee the coordinates you specified were a valid Street View location.
If your fallback strategy involves an app that does not support Street View, the OpenInGoogleMapsController
class will open a zoomed-in satellite view on a map instead.
Here’s an example that opens up a Street View location near the Taj Mahal.
GoogleStreetViewDefinition *definition = [[GoogleStreetViewDefinition alloc] init];
definition.center = CLLocationCoordinate2DMake(27.1724439,78.0420174);
[[OpenInGoogleMapsController sharedInstance] openStreetView:definition];
GoogleStreetViewDefinition
The GoogleStreetViewDefinition
class includes one property:
(CLLocationCoordinate2D) center
: Defines the Street View location, in lat/long. To clear this value, set it tokCLLocationCoordinate2DInvalid
. (Setting it to nil will specify a center of 0,0.)
Opening directions
Opening a set of directions in Google Maps requires creating a GoogleDirectionsDefinition
class to define the set of points you want to travel between. You can then pass this definition to the openStreetView
method. This method will return YES
if it was able to open the set of directions in some application, and NO
if it was unable to, either because both your start and end point were empty, or your user does not have Google Maps installed and you did not specify a fallback strategy.
Note that a YES
value does not guarantee that Google Maps (or the fallback application) was able to find a set of directions between these two points:
GoogleDirectionsWaypoint
The GoogleDirectionsDefinition
class uses the GoogleDirectionsWaypoint
class to define its start and end points for a direction request. This class includes these properties:
CLLocationCoordinate2D location
: Defines the location as a set of coordinatesNSString *queryString
: Defines the location as a query string (such as an address)
If both of these values are set, the location takes precedence over the query string.
The GoogleDirectionsWaypoint
class also has two class helper methods: + waypointWithQuery:(NSString *)queryString
and + waypointWithLocation:(CLLocationCoordinate2D)location
to easily construct waypoints.
GoogleDirectionsDefinition
The GoogleDirectionsDefinition
class includes these properties:
GoogleDirectionsWaypoint *startingPoint
: Defines the starting point. If this is set tonil
, the directions will start at the user’s current location.GoogleDirectionsWaypoint
*destinationPoint
: Defines the destination. If this is set tonil
, the directions will end at the user’s current location.GoogleMapsTravelMode travelMode
: Defines how the user will get from thestartingPoint
to thedestinationPoint
. Current options are:kGoogleMapsTravelModeDriving
for driving.kGoogleMapsTravelModeTransit
for taking public transportation.kGoogleMapsTravelModeBiking
for biking.kGoogleMapsTravelModeWalking
for walking.
The following example will help you plan your next burrito-centric road trip:
GoogleDirectionsDefinition *definition = [[GoogleDirectionsDefinition alloc] init];
definition.startingPoint = [GoogleDirectionsWaypoint
waypointWithQuery:@"La Taqueria, 2889 Mission St San Francisco, CA 94110"];
definition.destinationPoint = [GoogleDirectionsWaypoint
waypointWithQuery:@"Delicious Mexican Eatery, 3314 Fort Blvd, El Paso, TX 79930"];
definition.travelMode = kGoogleMapsTravelModeDriving;
[[OpenInGoogleMapsController sharedInstance] openDirections:definition];
The following example will give you biking directions from MI6 headquarters to Sherlock Holmes' address:
GoogleDirectionsDefinition *definition = [[GoogleDirectionsDefinition alloc] init];
definition.startingPoint = [GoogleDirectionsWaypoint waypointWithLocation:CLLocationCoordinate2DMake(51.487242,-0.124402)];
definition.destinationPoint = [GoogleDirectionsWaypoint
waypointWithQuery:@"221B Baker Street, London"];
definition.travelMode = kGoogleMapsTravelModeBiking;
[[OpenInGoogleMapsController sharedInstance] openDirections:definition];
The following example will give you walking directions from your current location to the North American International Auto Show:
GoogleDirectionsDefinition *definition = [[GoogleDirectionsDefinition alloc] init];
definition.startingPoint = nil;
GoogleDirectionsWaypoint *destination = [[GoogleDirectionsWaypoint alloc] init];
destination.queryString = @"1 Washington Blvd, Detroit, MI 48226";
definition.destinationPoint = destination;
definition.travelMode = kGoogleMapsTravelModeWalking;
[[OpenInGoogleMapsController sharedInstance] openDirections:definition];
Special Thanks
Special thanks go out to Ian Barber, Leo Hourvitz, and Sam Thorogood, for thoroughly reviewing this code. Any remaining mistakes are the author’s.
Safari is a registered trademark of Apple Inc.


mind games
Flipping Colors mind game,
33,
89
Information Gain mind game,
10–11,
78
Lucky Roulette mind game,
42–43,
96
No Change for the Holidays mind game,
71–72,
11
Reach for the Sky! mind game,
12–13,
47
to Reach for the Sky! mind game,
78–79
Scheduling Tradition mind game,
34,
90
Sweet Tooth mind game,
4–5,
74
minimum spanning tree
as less expensive than the (unknown) optimal route,
161


{% extends 'occupants/base.html' %} {% load staticfiles %} {% block title %}Homepage{% endblock %} {% block head %} {% endblock %} {% block body %}
This site allows lecturers/administrators add rooms information, module information, timetabling information and ground truth data to our model. If you would like to request access to these features, please hit 'sign up'.


---
fulltitle: 'Backers via Patreon and GitHub'
title: 'Backers via Patreon and GitHub'
layout: default
route: backers
breadcrumb:
- home
- patreon-backers
---
{% include global/navbar.html id="Backers" %}
{% capture hero_content %}
{% include elements/sponsor-button.html %}
{% endcapture %}
{%
include components/hero.html
color="sponsor"
icon="fas fa-thumbs-up"
title=page.title
subtitle="Everyone who is supporting Bulma and Open Source"
content=hero_content
%}
{% include elements/backers-group.html tier="30" title="Generous backers ($30+)" %}
{% include elements/backers-group.html tier="500" title="Documentation sponsors ($500+)" %}
{% include elements/backers-group.html tier="300" title="Website sponsors ($300+)" %}
{% include elements/backers-group.html tier="100" title="Homepage sponsors ($100+)" %}
{% include elements/backers-group.html tier="10" title="Bulma backers ($10+)" %}


Tukey implements the "Tukey" robust error model (Zhang97ivc)
|
|
| Tukey (double c=4.6851, const ReweightScheme reweight=Block) |
| |
| double | weight (double distance) const override |
| |
| double | loss (double distance) const override |
| |
| void | print (const std::string &s) const override |
| |
| bool | equals (const Base &expected, double tol=1e-8) const override |
| |
|
| Base (const ReweightScheme reweight=Block) |
| |
|
virtual double | loss (double distance) const |
| |
|
virtual double | weight (double distance) const =0 |
| |
|
virtual void | print (const std::string &s) const =0 |
| |
|
virtual bool | equals (const Base &expected, double tol=1e-8) const =0 |
| |
|
double | sqrtWeight (double distance) const |
| |
|
Vector | weight (const Vector &error) const |
| | produce a weight vector according to an error vector and the implemented robust function
|
| |
|
Vector | sqrtWeight (const Vector &error) const |
| | square root version of the weight function
|
| |
|
void | reweight (Vector &error) const |
| | reweight block matrices and a vector according to their weight implementation
|
| |
|
void | reweight (std::vector< Matrix > &A, Vector &error) const |
| |
|
void | reweight (Matrix &A, Vector &error) const |
| |
|
void | reweight (Matrix &A1, Matrix &A2, Vector &error) const |
| |
|
void | reweight (Matrix &A1, Matrix &A2, Matrix &A3, Vector &error) const |
| |
|
|
static shared_ptr | Create (double k, const ReweightScheme reweight=Block) |
| |
|
|
typedef boost::shared_ptr< Tukey > | shared_ptr |
| |
| enum | ReweightScheme { Scalar
, Block
} |
| |
|
typedef boost::shared_ptr< Base > | shared_ptr |
| |
|
|
double | c_ |
| |
|
double | csquared_ |
| |
|
ReweightScheme | reweight_ |
| | the rows can be weighted independently according to the error or uniformly with the norm of the right hand side
|
| |
|
|
class | boost::serialization::access |
| | Serialization function.
|
| |
◆ equals()
| bool gtsam::noiseModel::mEstimator::Tukey::equals |
( |
const Base & |
expected, |
|
|
double |
tol = 1e-8 |
|
) |
| const |
|
overridevirtual |
◆ loss()
| double gtsam::noiseModel::mEstimator::Tukey::loss |
( |
double |
distance | ) |
const |
|
overridevirtual |
◆ print()
| void gtsam::noiseModel::mEstimator::Tukey::print |
( |
const std::string & |
s = "" | ) |
const |
|
overridevirtual |
◆ weight()
| double gtsam::noiseModel::mEstimator::Tukey::weight |
( |
double |
distance | ) |
const |
|
overridevirtual |
The documentation for this class was generated from the following files:
- /Users/dellaert/git/github/gtsam/linear/LossFunctions.h
- /Users/dellaert/git/github/gtsam/linear/LossFunctions.cpp


 You want to develop & collaborate on that fork, but the golang import path, in your source code, still references the original path, breaking everything.
A couple solutions offered below. First, though, let's get some names.
A sample case, the problem at hand
There's an awesome tool on http://github.com/awsome-org/tool. You successfully fork it onto http://github.com/awesome-you/tool.
You want to collaborate on http://github.com/awesome-you/tool; you wish to pull, commit & push. Maybe you want to send pull requests to the origin.
The following is commonly found throughout .go files in the repository:
import ( "github.com/awesome-org/tool/config" "github.com/awesome-org/tool/driver" "github.com/awesome-org/tool/net" "github.com/awesome-org/tool/util" )
If you:
go get http://github.com/awesome-you/tool
golang creates your $GOPATH/src/github.com/awesome-you/tool/, which is awesome. However, as you resolve dependencies via
cd $GOPATH/src/github.com/awesome-you/tool/ ; go get ./...
golang digs into the source code, finds references to github.com/awesome-org/tool/config, github.com/awesome-org/tool/driver etc, and fetches those from http://github.com/awsome-org/tool and onto $GOPATH/src/github.com/awesome-org/tool/, which is not awesome. You actually have two copies of the code, one from your fork, one from the origin, and your own fork will be largely ignored as it mostly points back to the origin.
A bad solution
The dirty, bad solution would be for you to go over the source code and replace "github.com/awesome-org/tool" entries with "github.com/awesome-you/tool". It is bad for two reasons:
- You will not be able to further pull changes from upstream
- You will not be able to pull-request and push your own changes upstream
When I say "You will not be able" I mean "in a reasonable, developer-friendly manner". The code will be incompatible with upstream and you have effectively detached your code. You will need to keep editing and re-editing those entries anytime you wish to pull/push upstream.
Solution #1: add remote
Described in GitHub and Go: forking, pull requests, and go-getting, follow these procedures:
go get http://github.com/awesome-org/tool git remote add awesome-you-fork http://github.com/awesome-you/tool
You're adding your repository as remote. You will from now on need to explicitly:
git pull --rebase awesome-you-fork git push awesome-you-fork
If you forget to add the "awesome-you-fork" argument, you are pulling and pushing from upstream.
Solution #2: cheat "go get", DIY
The problem began with the go get command, which copied the URI path onto $GOPATH/src. However go get implicitly issues a git clone, and we can do the same ourselves. We will dirty our hands just once, and then benefit from an ambiguous-less environment.
We will now create our git repository in the name of awesome-org but with the contents of awesome-you:
cd $GOPATH mkdir -p {src,bin,pkg} mkdir -p src/github.com/awesome-org/ cd src/github.com/awesome-org/ git clone git@github.com:awesome-you/tool.git # OR: git clone https://github.com/awesome-you/tool.git cd tool/ go get ./...
The mkdir -p {src,bin,pkg} is there just in case you do not have anything setup in your $GOPATH. We then create the repository path under the name of awesome-org, but once inside clone from awesome-you.
The source code's import path fits your directory layout now, but as you push/pull you are only speaking to your own awesome-you repository.
comments powered by Disqus


tock
/
ai.tock.bot.connector.messenger
/
MessengerAttachmentType
MessengerAttachmentType
typealias
MessengerAttachmentType
=
AttachmentType
(source)


Generating a new wallet can take several minutes - please be patient!
Generating new wallet...
Hexseed {{newWalletDetail.hexseed}}
Mnemonic Phrase {{newWalletDetail.mnemonic}}


dweb is a lightweight webserver for C programs, with no dependencies which should work on Linux, Unix, Mac OS, etc. It implements just enough of the HTTP protocol to work with the main browsers. But if you're looking for a fully featured webserver, then dweb is not what you want...
Mainly because I wanted a small webserver, and I wanted to know how all the code worked inside. I'm planning to use it as a very small Web API, most likely hosted on a Raspberry Pi or a cheap router running OpenWrt, probably both :-).
I owe a lot to nweb which was my starting point. But I am allowing extra things like HTTP POSTs and serving dynamic content. Unlike nweb, this code does not run as a daemon, and logging goes to the console by default, although you can override the logging function and do something else if you like.