--- layout: post status: publish published: true title: Sqlplus over a remote connection author: display_name: ian login: ian email<EMAIL_ADDRESS>url: http://iancwill.com/blog author_login: ian author_email<EMAIL_ADDRESS>author_url: http://iancwill.com/blog wordpress_id: 122 wordpress_url: http://iancwill.com/blog/?p=122 date: '2012-02-14 20:58:23 -0700' date_gmt: '2012-02-15 01:58:23 -0700' ---
To connect to a remote database with sqlplus without messing with TNS_PING or .ora config files, use this syntax:
sqlplus $USER@'(DESCRIPTION=(ADDRESS_LIST=(ADDRESS=(PROTOCOL=TCP)(HOST=$HOSTNAME)(PORT=1521)))(CONNECT_DATA=(SID=$DATABASE_NAME)))'
You can append a .sql file afterwards to have it run automatically.
sqlplus $USER@'(DESCRIPTION=(ADDRESS_LIST=(ADDRESS=(PROTOCOL=TCP)(HOST=$HOSTNAME)(PORT=1521)))(CONNECT_DATA=(SID=$DATABASE_NAME)))' @$SCRIPT_FILE


Posted on July 21, 2016
"We are ultimately fighting to preserve life. And as long as people are dying, then there's still work to do."
Read MorePosted on November 18, 2015
"I think Pestello was trying to set a different precedent and he gets a lot of love from the community for that, but there's still a lot more work to do."
Read MorePosted on August 10, 2015
“As an organizer, I need to make sure that everyone who is participating in this action is completely comfortable. Ruckus’ role is to help people feel that security in knowing that I’ve been trained by someone who does big actions like this for a living.”
Read More


HENRY & JUNE A film review by Mark R. Leeper Copyright 1990 Mark R. Leeper
Capsule review: Anais Nin's affair with Henry Miller as recounted in her diary may well be pretentious enough to have pleased her.  Rating: -1 (-4 to +4).
Take these comments with a grain of salt. Films about people's sex and love lives somehow just do not appeal to me, even from excellent filmmakers such as Woody Allen or Philip Kaufman. I rate them much lower than other people seem to. Not that sex itself cannot be interesting, but even a Woody Allen agonizing over why he cannot bed Diane Keaton is for me the formula for a total yawner. Philip Kaufman's last film, THE UNBEARABLE LIGHTNESS OF BEING, while much in this genre, did have enough substance besides the sexual maneuvering that it held my interest. His current HENRY AND JUNE is a long film, but not nearly as long as it seems. In spite of the title, the film is mostly about Anais Nin and her early 1930s affair with Henry Miller. The film is based on the account in her memoir of the same title. She makes herself out to be small and in some ways strong, but in most ways she is fragile. She is not entirely satisfied by her banker husband Hugo and is attracted to virile American writer Henry Miller. Awakened by his presence, she proceeds in her frail, sensitive way to have sex with everyone in reach but the housemaid and perhaps the dog (though the dog wasn't talking). She also has a stimulating intellectual relationship with Miller, who is straight-laced enough to limit his sexual partners to only the members of the opposite sex within reach. When one of them is not making love, he or she is agonizing, writing books, or riding bicycles.
Most of the story is told in Nin's voice, which is an acquired taste like candied violets. The camera adopts a soft focus to mirror her writing style. One set, apparently near the house where much of the action happens, is a long walkway next to a wall in night and fog. It looks very much like an impressionist painting. I was hoping we would see it in the daytime or at least without fog, but we never do. I remember no other fog in the film and it is there apparently mostly for effect.
Kaufman underscores that most of what we are seeing is from Nin's point of view by having one sequence be a flashback narrated by Miller. The soft focus is banished and the prose changes to a hard-boiled Raymond Chandler style. Even in Nin's style Fred War may be trying to affect Miller's character but it comes out like Humphrey Bogart. Maria de Medeiros' Nin is a dictionary illustration for "demure" and often also for "naked." Kaufman has created a tremendous number of nude positions for couples in which the parts that would be most busy are out of sight, perhaps trying for an R rating, or perhaps affecting Anais Nin's point of view. (Of course, the film got first an X rating and then inaugurated the NC-17 rating.) "June" refers, incidentally, to Miller's wife, played by Uma Thurman, who usually is not around.
The film is constantly melodramatic, with deep people feeling deep emotions which we are told about cheaply and superficially. You know you're in trouble when characters start voicing lines like, "Does she think she can love anything in you I haven't loved?" Even if these are real people, these people aren't real. My rating: -1 on the -4 to +4 scale. It might have been lower but for the peculiar background created of Paris in the 1930s.
Mark R. Leeper att!mtgzy!leeper<EMAIL_ADDRESS>.
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


|
jubilant-funicular
|
Go to the source code of this file.
Classes | |
| class | nta::CallbackManager |
| struct | nta::CallbackManager::event |
| A function to run at a certain time with some regularity. More... | |
Namespaces | |
| nta | |
| struct nta::CallbackManager::event |
A function to run at a certain time with some regularity.
Definition at line 15 of file CallbackManager.h.
| Class Members | ||
|---|---|---|
| uint64_t | id | id of event |
| uint64_t | period | How many frames between consecutive runs. |
| Thunk | thunk | Function to execute. |
| uint64_t | when | How many frames to run it in. |


{% extends "workshop_step.html" %} {% block step_content %}
We also want to keep track of the code coverage of our tests. This way we can keep an eye on sections of code that could be more buggy then others.
There are various coverage tools available (e.g. codecov, coveralls, codeclimate), but for this workshop the example will use Codecov. If you want to try out another one, feel free :)
An account is needed for Codecov.io, but luckily they provide OAuth integration with GitHub, so you don't need to remember yet another username/password combination.
This will allow Codecov to not only generate reports, but also post them in a Pull Request that's open, to quickly show if a PR increases or reduces code coverage.
To do this, you can either navigate to your fork (on which Codecov will suggest to install the app), or go to the GitHub marketplace and install it from there.


Please enable JavaScript in your browser
This website cannot work without JavaScript. You can get a JavaScript-able internet browser from
different vendors (order is not specific):
It will provide a better user experience due to this site has cool features and look-and-feel when
JavaScript is enabled.


|
lux
0.0.1
|
Typedefs | |
| template<class T > | |
| using | add_const = const remove_volatile< remove_const< T > > |
| Returns safely at compile-time T with const qualifier. More... | |
| template<class T > | |
| using | add_lvalue_reference = remove_references< T > & |
| Returns safely at compile-time T with lvalue reference type. More... | |
| template<class T > | |
| using | add_pointer = T * |
| Returns at compile-time T with pointer type. More... | |
| template<class T > | |
| using | add_rvalue_reference = remove_references< T > && |
| Returns safely at compile-time T with rvalue reference type. More... | |
| template<class T > | |
| using | add_volatile = volatile remove_volatile< remove_const< T > > |
| Returns safely at compile-time T with volatile qualifier. More... | |
| template<class T > | |
| using | remove_const = typename remove_const_class< T >::type |
| Returns at compile-time T without const qualifier if any. More... | |
| template<class T > | |
| using | remove_pointer = typename remove_pointer_class< T >::type |
| Returns at compile-time T without pointer type if any. More... | |
| template<class T > | |
| using | remove_references = typename remove_references_class< T >::type |
| Returns at compile-time T without lvalue or rvalue references if any. More... | |
| template<class T > | |
| using | remove_volatile = typename remove_volatile_class< T >::type |
| Returns at compile-time T without volatile qualifier if any. More... | |
Functions | |
| constexpr const bool | is_constant_evaluated () noexcept |
| Returns at compile-time if the expression is being evaluated as a constant expression. More... | |
Variables | |
| template<class T , class U = T> | |
| concept | has_addition = requires(T t, U u) {t + u;} |
| Returns at compile-time if T and U types share an addition 't + t' or 't + u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_addition_assignment = requires(T t, U u) {t += u;} |
| Returns at compile-time if T and U types share an addition assignment 't += t' or 't += u' operator overloading. More... | |
| template<class T > | |
| concept | has_address_of = requires(T t) {&t;} |
| Returns at compile-time if T type has an address of '&t' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_and = requires(T t, U u) {t & u;} |
| Returns at compile-time if T and U types share a bitwise and 't & t' or 't & u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_and_assignment = requires(T t, U u) {t &= u;} |
| Returns at compile-time if T and U types share a bitwise and assignment 't &= t' or 't &= u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_assignment = requires(T t, U u) {t = u;} |
| Returns at compile-time if T and U types share an assignment 't = t' or 't = u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_bitshift_left = requires(T t, U u) {t << u;} |
| Returns at compile-time if T and U types share a bitwise left shift 't << t' or 't << u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_bitshift_left_assignment = requires(T t, U u) {t <<= u;} |
| Returns at compile-time if T and U types share a bitwise shift left assignment 't <<= t' or 't <<= u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_bitshift_right = requires(T t, U u) {t >> u;} |
| Returns at compile-time if T and U types share a bitwise shift right 't >> t' or 't >> u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_bitshift_right_assignment = requires(T t, U u) {t >>= u;} |
| Returns at compile-time if T and U types share a bitwise shift right assignment 't >>= t' or 't >>= u' operator overloading. More... | |
| template<class T , class U > | |
| concept | has_cast = requires(T t) {static_cast<U>(t);} |
| Returns at compile-time if T and U types share an static cast 'static_cast<U>(t)' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_division = requires(T t, U u) {t / u;} |
| Returns at compile-time if T and U types share a division 't / t' or 't / u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_division_assignment = requires(T t, U u) {t /= u;} |
| Returns at compile-time if T and U types share a division assignment 't /= t' or 't /= u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_equal = requires(T t, U u) {t == u;} |
| Returns at compile-time if T and U types share an equal 't == t' or 't == u' operator overloading. More... | |
| template<class T , class... U> | |
| concept | has_function_call = requires(T t, U... u) {t(u...);} |
| Returns at compile-time if T type has a function call with the args specified at U 't(u...)' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_greater = requires(T t, U u) {t > u;} |
| Returns at compile-time if T and U types share a greater 't > t' or 't > u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_greater_equal = requires(T t, U u) {t >= u;} |
| Returns at compile-time if T and U types share a greater equal 't >= t' or 't >= u' operator overloading. More... | |
| template<class T > | |
| concept | has_indirection = requires(T t) {*t;} |
| Returns at compile-time if T type has an indirection '*t' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_less = requires(T t, U u) {t < u;} |
| Returns at compile-time if T and U types share a less 't < t' or 't < u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_less_equal = requires(T t, U u) {t <= u;} |
| Returns at compile-time if T and U types share a less equal 't <= t' or 't <= u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_logical_and = requires(T t, U u) {t && u;} |
| Returns at compile-time if T and U types share a logical and 't && t' or 't && u' operator overloading. More... | |
| template<class T > | |
| concept | has_logical_not = requires(T t) {!t;} |
| Returns at compile-time if T type has a logical not '!t' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_logical_or = requires(T t, U u) {t || u;} |
| Returns at compile-time if T and U types share a logical or 't || t' or 't || u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_modulo = requires(T t, U u) {t % u;} |
| Returns at compile-time if T and U types share a modulo 't % t' or 't % u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_modulo_assignment = requires(T t, U u) {t %= u;} |
| Returns at compile-time if T and U types share a modulo assignment 't %= t' or 't %= u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_multiplication = requires(T t, U u) {t * u;} |
| Returns at compile-time if T and U types share a multiplication 't * t' or 't * u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_multiplication_assignment = requires(T t, U u) {t *= u;} |
| Returns at compile-time if T and U types share a multiplication assignment 't *= t' or 't *= u' operator overloading. More... | |
| template<class T > | |
| concept | has_not = requires(T t) {~t;} |
| Returns at compile-time if T type has a bitwise not '~t' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_not_equal = requires(T t, U u) {t != u;} |
| Returns at compile-time if T and U types share a not equal 't != t' or 't != u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_or = requires(T t, U u) {t | u;} |
| Returns at compile-time if T and U types share a bitwise or 't | t' or 't | u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_or_assignment = requires(T t, U u) {t |= u;} |
| Returns at compile-time if T and U types share a bitwise or assignment 't |= t' or 't |= u' operator overloading. More... | |
| template<class T > | |
| concept | has_post_decrement = requires(T t) {t--;} |
| Returns at compile-time if T type has a post-decrement 't–' operator overloading. More... | |
| template<class T > | |
| concept | has_post_increment = requires(T t) {t++;} |
| Returns at compile-time if T type has a post-increment 't++' operator overloading. More... | |
| template<class T > | |
| concept | has_pre_decrement = requires(T t) {--t;} |
| Returns at compile-time if T has a pre-decrement '–t' operator overloading. More... | |
| template<class T > | |
| concept | has_pre_increment = requires(T t) {++t;} |
| Returns at compile-time if T has a pre-increment '++t' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_spaceship = requires(T t, U u) {t <=> u;} |
| Returns at compile-time if T and U types share an spaceship 't <=> t' or 't <=> u' operator overloading. More... | |
| template<class T > | |
| concept | has_subscript = requires(T t) {t[0u];} |
| Returns at compile-time if T type has a subscript 't[0u]' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_subtraction = requires(T t, U u) {t - u;} |
| Returns at compile-time if T and U types share a subtraction 't - t' or 't - u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_subtraction_assignment = requires(T t, U u) {t -= u;} |
| Returns at compile-time if T and U types share a subtraction assignment 't -= t' or 't -= u' operator overloading. More... | |
| template<class T > | |
| concept | has_unary_minus = requires(T t) {-t;} |
| Returns at compile-time if T type has a unary minus '-t' operator overloading. More... | |
| template<class T > | |
| concept | has_unary_plus = requires(T t) {+t;} |
| Returns at compile-time if T type has a unary plus '+t' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_xor = requires(T t, U u) {t ^ u;} |
| Returns at compile-time if T and U types share a bitwise xor 't ^ t' or 't ^ u' operator overloading. More... | |
| template<class T , class U = T> | |
| concept | has_xor_assignment = requires(T t, U u) {t ^= u;} |
| Returns at compile-time if T and U types share a bitwise xor assignment 't ^= t' or 't ^= u' operator overloading. More... | |
| template<class T > | |
| concept | is_array = is_array_class<T>::value |
| Returns at compile-time if T is an array type. More... | |
| template<class T > | |
| concept | is_basic = is_basic_class<T>::value |
| Returns at compile-time whther or not T is a basic type Basic types are: bool, u8, s8, u16, s16, u32, s32, f32, u64, s64 and f64. More... | |
| template<class T > | |
| concept | is_class = __is_class(T) |
| Returns at compile-time if T is a class type Remember that class types are: incomplete class, class and struct. More... | |
| template<class T > | |
| concept | is_const = is_const_class<T>::value |
| Returns at compile-time if T has a const qualifier. More... | |
| template<class T > | |
| concept | is_enum = __is_enum(T) |
| Returns at compile-time if T is an enumeration type Remember that enumeration types are: enum and enum class. More... | |
| template<class T > | |
| concept | is_floating_point = is_floating_point_class<T>::value |
| Returns at compile-time whether or not T is a floating-point type Floating-point types are: f32 and f64. More... | |
| template<class T > | |
| concept | is_integer = is_integer_class<T>::value |
| Returns at compile-time if T is an integer type Integer types are: bool, u8, s8, u16, s16, u32, s32, u64 and s64. More... | |
| template<class T > | |
| concept | is_lvalue_reference = is_lvalue_reference_class<T>::value |
| Returns at compile-time if T is an lvalue reference type. More... | |
| template<class T > | |
| concept | is_pointer = is_pointer_class<T>::value |
| Returns at compile-time if T is a pointer type. More... | |
| template<class T > | |
| concept | is_reference = is_reference_class<T>::value |
| Returns at compile-time if T is a reference. More... | |
| template<class T > | |
| concept | is_rvalue_reference = is_rvalue_reference_class<T>::value |
| Returns at compile-time if T is an rvalue reference type. More... | |
| template<class T , class U > | |
| concept | is_same = is_same_class<T, U>::value |
| Returns at compile-time if T and U are the same type Remember that it doesn't check if T and U are derived/parent types. More... | |
| template<class T > | |
| concept | is_signed = is_signed_class<T>::value |
| Returns at compile time if T is a signed type Signed types are: s8, s16, s32, f32, s64 and f64. More... | |
| template<class T , const u64 Size> | |
| concept | is_size = sizeof(T) == Size |
| Returns at compile-time if Size is equal to the size of T. More... | |
| template<class T > | |
| concept | is_union = __is_union(T) |
| Returns at compile-time if T is a union type. More... | |
| template<class T > | |
| concept | is_unsigned = is_unsigned_class<T>::value |
| Returns at compile-time if T is unsigned type Unsigned types are: bool, u8, u16, u32 and u64. More... | |
| template<class T > | |
| concept | is_void = is_same<remove_const<remove_volatile<T>>, void> |
| Returns at compile-time if T without const and volatile qualifiers is the same type as void. More... | |
| template<class T > | |
| concept | is_volatile = is_volatile_class<T>::value |
| Returns at compile-time if T has volatile qualifier. More... | |
| using lux::concepts::add_const = typedef const remove_volatile<remove_const<T> > |
Returns safely at compile-time T with const qualifier.
| using lux::concepts::add_lvalue_reference = typedef remove_references<T>& |
Returns safely at compile-time T with lvalue reference type.
| using lux::concepts::add_pointer = typedef T* |
Returns at compile-time T with pointer type.
| using lux::concepts::add_rvalue_reference = typedef remove_references<T>&& |
Returns safely at compile-time T with rvalue reference type.
| using lux::concepts::add_volatile = typedef volatile remove_volatile<remove_const<T> > |
Returns safely at compile-time T with volatile qualifier.
| using lux::concepts::remove_const = typedef typename remove_const_class<T>::type |
Returns at compile-time T without const qualifier if any.
| using lux::concepts::remove_pointer = typedef typename remove_pointer_class<T>::type |
Returns at compile-time T without pointer type if any.
| using lux::concepts::remove_references = typedef typename remove_references_class<T>::type |
Returns at compile-time T without lvalue or rvalue references if any.
| using lux::concepts::remove_volatile = typedef typename remove_volatile_class<T>::type |
Returns at compile-time T without volatile qualifier if any.
|
inlineconstexprnoexcept |
Returns at compile-time if the expression is being evaluated as a constant expression.
| concept lux::concepts::has_addition = requires(T t, U u) {t + u;} |
Returns at compile-time if T and U types share an addition 't + t' or 't + u' operator overloading.
| concept lux::concepts::has_addition_assignment = requires(T t, U u) {t += u;} |
Returns at compile-time if T and U types share an addition assignment 't += t' or 't += u' operator overloading.
| concept lux::concepts::has_address_of = requires(T t) {&t;} |
Returns at compile-time if T type has an address of '&t' operator overloading.
| concept lux::concepts::has_and = requires(T t, U u) {t & u;} |
Returns at compile-time if T and U types share a bitwise and 't & t' or 't & u' operator overloading.
| concept lux::concepts::has_and_assignment = requires(T t, U u) {t &= u;} |
Returns at compile-time if T and U types share a bitwise and assignment 't &= t' or 't &= u' operator overloading.
| concept lux::concepts::has_assignment = requires(T t, U u) {t = u;} |
Returns at compile-time if T and U types share an assignment 't = t' or 't = u' operator overloading.
| concept lux::concepts::has_bitshift_left = requires(T t, U u) {t << u;} |
Returns at compile-time if T and U types share a bitwise left shift 't << t' or 't << u' operator overloading.
| concept lux::concepts::has_bitshift_left_assignment = requires(T t, U u) {t <<= u;} |
Returns at compile-time if T and U types share a bitwise shift left assignment 't <<= t' or 't <<= u' operator overloading.
| concept lux::concepts::has_bitshift_right = requires(T t, U u) {t >> u;} |
Returns at compile-time if T and U types share a bitwise shift right 't >> t' or 't >> u' operator overloading.
| concept lux::concepts::has_bitshift_right_assignment = requires(T t, U u) {t >>= u;} |
Returns at compile-time if T and U types share a bitwise shift right assignment 't >>= t' or 't >>= u' operator overloading.
| concept lux::concepts::has_cast = requires(T t) {static_cast<U>(t);} |
Returns at compile-time if T and U types share an static cast 'static_cast<U>(t)' operator overloading.
| concept lux::concepts::has_division = requires(T t, U u) {t / u;} |
Returns at compile-time if T and U types share a division 't / t' or 't / u' operator overloading.
| concept lux::concepts::has_division_assignment = requires(T t, U u) {t /= u;} |
Returns at compile-time if T and U types share a division assignment 't /= t' or 't /= u' operator overloading.
| concept lux::concepts::has_equal = requires(T t, U u) {t == u;} |
Returns at compile-time if T and U types share an equal 't == t' or 't == u' operator overloading.
| concept lux::concepts::has_function_call = requires(T t, U... u) {t(u...);} |
Returns at compile-time if T type has a function call with the args specified at U 't(u...)' operator overloading.
| concept lux::concepts::has_greater = requires(T t, U u) {t > u;} |
Returns at compile-time if T and U types share a greater 't > t' or 't > u' operator overloading.
| concept lux::concepts::has_greater_equal = requires(T t, U u) {t >= u;} |
Returns at compile-time if T and U types share a greater equal 't >= t' or 't >= u' operator overloading.
| concept lux::concepts::has_indirection = requires(T t) {*t;} |
Returns at compile-time if T type has an indirection '*t' operator overloading.
| concept lux::concepts::has_less = requires(T t, U u) {t < u;} |
Returns at compile-time if T and U types share a less 't < t' or 't < u' operator overloading.
| concept lux::concepts::has_less_equal = requires(T t, U u) {t <= u;} |
Returns at compile-time if T and U types share a less equal 't <= t' or 't <= u' operator overloading.
| concept lux::concepts::has_logical_and = requires(T t, U u) {t && u;} |
Returns at compile-time if T and U types share a logical and 't && t' or 't && u' operator overloading.
| concept lux::concepts::has_logical_not = requires(T t) {!t;} |
Returns at compile-time if T type has a logical not '!t' operator overloading.
| concept lux::concepts::has_logical_or = requires(T t, U u) {t || u;} |
Returns at compile-time if T and U types share a logical or 't || t' or 't || u' operator overloading.
| concept lux::concepts::has_modulo = requires(T t, U u) {t % u;} |
Returns at compile-time if T and U types share a modulo 't % t' or 't % u' operator overloading.
| concept lux::concepts::has_modulo_assignment = requires(T t, U u) {t %= u;} |
Returns at compile-time if T and U types share a modulo assignment 't %= t' or 't %= u' operator overloading.
| concept lux::concepts::has_multiplication = requires(T t, U u) {t * u;} |
Returns at compile-time if T and U types share a multiplication 't * t' or 't * u' operator overloading.
| concept lux::concepts::has_multiplication_assignment = requires(T t, U u) {t *= u;} |
Returns at compile-time if T and U types share a multiplication assignment 't *= t' or 't *= u' operator overloading.
| concept lux::concepts::has_not = requires(T t) {~t;} |
Returns at compile-time if T type has a bitwise not '~t' operator overloading.
| concept lux::concepts::has_not_equal = requires(T t, U u) {t != u;} |
Returns at compile-time if T and U types share a not equal 't != t' or 't != u' operator overloading.
| concept lux::concepts::has_or = requires(T t, U u) {t | u;} |
Returns at compile-time if T and U types share a bitwise or 't | t' or 't | u' operator overloading.
| concept lux::concepts::has_or_assignment = requires(T t, U u) {t |= u;} |
Returns at compile-time if T and U types share a bitwise or assignment 't |= t' or 't |= u' operator overloading.
| concept lux::concepts::has_post_decrement = requires(T t) {t--;} |
Returns at compile-time if T type has a post-decrement 't–' operator overloading.
| concept lux::concepts::has_post_increment = requires(T t) {t++;} |
Returns at compile-time if T type has a post-increment 't++' operator overloading.
| concept lux::concepts::has_pre_decrement = requires(T t) {--t;} |
Returns at compile-time if T has a pre-decrement '–t' operator overloading.
| concept lux::concepts::has_pre_increment = requires(T t) {++t;} |
Returns at compile-time if T has a pre-increment '++t' operator overloading.
| concept lux::concepts::has_spaceship = requires(T t, U u) {t <=> u;} |
Returns at compile-time if T and U types share an spaceship 't <=> t' or 't <=> u' operator overloading.
| concept lux::concepts::has_subscript = requires(T t) {t[0u];} |
Returns at compile-time if T type has a subscript 't[0u]' operator overloading.
| concept lux::concepts::has_subtraction = requires(T t, U u) {t - u;} |
Returns at compile-time if T and U types share a subtraction 't - t' or 't - u' operator overloading.
| concept lux::concepts::has_subtraction_assignment = requires(T t, U u) {t -= u;} |
Returns at compile-time if T and U types share a subtraction assignment 't -= t' or 't -= u' operator overloading.
| concept lux::concepts::has_unary_minus = requires(T t) {-t;} |
Returns at compile-time if T type has a unary minus '-t' operator overloading.
| concept lux::concepts::has_unary_plus = requires(T t) {+t;} |
Returns at compile-time if T type has a unary plus '+t' operator overloading.
| concept lux::concepts::has_xor = requires(T t, U u) {t ^ u;} |
Returns at compile-time if T and U types share a bitwise xor 't ^ t' or 't ^ u' operator overloading.
| concept lux::concepts::has_xor_assignment = requires(T t, U u) {t ^= u;} |
Returns at compile-time if T and U types share a bitwise xor assignment 't ^= t' or 't ^= u' operator overloading.
| concept lux::concepts::is_array = is_array_class<T>::value |
Returns at compile-time if T is an array type.
| concept lux::concepts::is_basic = is_basic_class<T>::value |
Returns at compile-time whther or not T is a basic type
Basic types are: bool, u8, s8, u16, s16, u32, s32, f32, u64, s64 and f64.
| concept lux::concepts::is_class = __is_class(T) |
Returns at compile-time if T is a class type
Remember that class types are: incomplete class, class and struct.
| concept lux::concepts::is_const = is_const_class<T>::value |
Returns at compile-time if T has a const qualifier.
| concept lux::concepts::is_enum = __is_enum(T) |
Returns at compile-time if T is an enumeration type
Remember that enumeration types are: enum and enum class.
| concept lux::concepts::is_floating_point = is_floating_point_class<T>::value |
Returns at compile-time whether or not T is a floating-point type
Floating-point types are: f32 and f64.
| concept lux::concepts::is_integer = is_integer_class<T>::value |
Returns at compile-time if T is an integer type
Integer types are: bool, u8, s8, u16, s16, u32, s32, u64 and s64.
| concept lux::concepts::is_lvalue_reference = is_lvalue_reference_class<T>::value |
Returns at compile-time if T is an lvalue reference type.
| concept lux::concepts::is_pointer = is_pointer_class<T>::value |
Returns at compile-time if T is a pointer type.
| concept lux::concepts::is_reference = is_reference_class<T>::value |
Returns at compile-time if T is a reference.
| concept lux::concepts::is_rvalue_reference = is_rvalue_reference_class<T>::value |
Returns at compile-time if T is an rvalue reference type.
| concept lux::concepts::is_same = is_same_class<T, U>::value |
Returns at compile-time if T and U are the same type
Remember that it doesn't check if T and U are derived/parent types.
| concept lux::concepts::is_signed = is_signed_class<T>::value |
Returns at compile time if T is a signed type
Signed types are: s8, s16, s32, f32, s64 and f64.
| concept lux::concepts::is_size = sizeof(T) == Size |
Returns at compile-time if Size is equal to the size of T.
| concept lux::concepts::is_union = __is_union(T) |
Returns at compile-time if T is a union type.
| concept lux::concepts::is_unsigned = is_unsigned_class<T>::value |
Returns at compile-time if T is unsigned type
Unsigned types are: bool, u8, u16, u32 and u64.
| concept lux::concepts::is_void = is_same<remove_const<remove_volatile<T>>, void> |
Returns at compile-time if T without const and volatile qualifiers is the same type as void.
| concept lux::concepts::is_volatile = is_volatile_class<T>::value |
Returns at compile-time if T has volatile qualifier.


Windows Live
Contacts
(1 - 3 of 3)
Favorites (0)
Mouse House
Email
Test Mouse
Email
Contacts
Windows Live Home
All services >
Go to top
c
Sign out
© 2010 Microsoft
Privacy
|
Terms of use


{% layout "layout-default.html" %} This is root-text-node content from "layout-block-outside-body.html". {% block "head" %} head: "layout-block-outside-body.html" {% endblock %}


@()(implicit request: RequestHeader) @_layout( "Recogito Help", "Recogito Help", "Recogito is an initative by Pelagios Commons, developed under the leadership of the Austrian Institute of Technology, Exeter University and The Open University, with funding from the Andrew W. Mellon Foundation.", "en" ) {


Count the 3's.
Disclaimer: You may ne3d to insp3ct the image clos3ly!!
How many do you see?
3
6
7
11


Every day is taco ipsum tuesday. 50 cent tacos! I’ll take 30. Tacos al pastor made with adobada meat. Tacos, tacos, tacos. BARBACOA!! Add in a few el Pastor with guac and diced onions. CARNE ASADA!! Fish tacos with cabbage slaw and a side of chips and guac. BARBACOA!! It’s raining tacos, from out of the sky, tacos, don’t even ask why. It’s raining tacos, from out of the sky, tacos, don’t even ask why. You see, the refried beans are really just the adhesive necessary to apply the soft tortilla to the hard taco shell. Add in a few el Pastor with guac and diced onions.
Give me all the tacos, immediately. Say taco one more time. Does guac cost extra? Burritos are very tasty. Burritos are very tasty. Pico de gallo, on the side please. BARBACOA!! Side of rice and beans, please. Make it a double there pal. Fish tacos with cabbage slaw and a side of chips and guac. It’s a wonderful morning for breakfast tacos. It’s a wonderful morning for breakfast tacos. Make it a double there pal. Side of rice and beans, please. It’s raining tacos, from out of the sky, tacos, don’t even ask why.
Click here to change the color.
Give me all the tacos, immediately. Say taco one more time. Does guac cost extra? Burritos are very tasty. Burritos are very tasty. Pico de gallo, on the side please. BARBACOA!! Side of rice and beans, please. Make it a double there pal. Fish tacos with cabbage slaw and a side of chips and guac. It’s a wonderful morning for breakfast tacos. It’s a wonderful morning for breakfast tacos. Make it a double there pal. Side of rice and beans, please. It’s raining tacos, from out of the sky, tacos, don’t even ask why.


4 March 2004
As of 3 March 2004, a total of 33 suspected cases including 8 deaths, were reported to WHO from five counties. Of the total cases, 2 from Bong county and 2 from Nimba county were laboratory confirmed by Institut Pasteur Abidjan, Côte d'Ivoire.
The first emergency mass immunization campaign started on 26 February 2004 in Bong county, targetting camps for Internally Displaced People (IDP). As of 1 March 2004, 42% of the target population (72 000) have been immunized.
Additional emergency mass immunization campaigns are planned to start in the next few weeks in Nimba county.
WHO, UNICEF and NGOs operating in Liberia are supporting the Ministry of Health in the implementation of the campaigns.


| RA,DEC | R | spherical coordinates of star (radians) |
|---|---|---|
| RAZ,DECZ | R | spherical coordinates of tangent point (radians) |
| XI,ETA | R | tangent plane coordinates (radians) |
|---|---|---|
| J | I | status: |
| 0 = OK, star on tangent plane | ||
| 1 = error, star too far from axis | ||
| 2 = error, antistar on tangent plane | ||
| 3 = error, antistar too far from axis |
SLALIB --- Positional Astronomy Library


--- layout: post title: Hitachi Acquires PRIZIM as a Part of Green Initiative date: '2012-04-19T09:27:50-07:00' tags: tumblr_url: http://alexhwilliams.tumblr.com/post/21384592910/hitachi-acquires-prizim-as-a-part-of-green-initiative ---
http://bit.ly/I9fr05


This intention transforms a modification of a variable with a simple assignment into an operation-assignment.


About this website
In this website you can analyse your data and then apply the Machine Learning algorithms straight away on your data. This website provides you with a GUI to help analyse and apply
In this website you can analyse your data and then apply the Machine Learning algorithms straight away on your data. This website provides you with a GUI to help analyse and apply


--- title: Personnel Scheduling Library keywords: fastai sidebar: home_sidebar summary: "This library provides data structures and code that are useful for personnel scheduling" description: "This library provides data structures and code that are useful for personnel scheduling" nb_path: "index.ipynb" ---
We will have more documentation later.
To install on your computer, the easiest way may be to use a distribution such as Anaconda or Miniconda.
I would recommend creating an own conda environment (see https://docs.conda.io/projects/conda/en/latest/user-guide/tasks/manage-environments.html) for this project, you can set up the environment by calling conda env create -f environment.yml
from the root directory of the clone of the git repository.
After having done this, you can start Jupyter Lab from your original base
environment, and choose the personnel_scheduling
kernel that has all needed packages installed.
The project uses nbdev an environment where we can develop in notebooks, and code can be automatically exported in python files. This way, we can use multiple notebooks. (nbdev has a lot more functionality, but this is most important for us here.). Please find the documentation for nbdev at https://nbdev.fast.ai/
Currently, two basic notebooks (00_datastructures and 00_reporting) and two notebooks for shift scheduling problem instances (The Demassey instances, and the Dahmen instances), providing implementations of the rulesets and functionality for reading instances.
When you have changed something in one of the non-experiment-notebooks, make sure that you save the notebook and execute the function notebook2script()
(which you already find in the last cells of each notebook and at the beginning of the experimentation notebook).
After that, to make sure that everything is clean, it is recommended to shutdown and restart the current kernel.
The repository is hosted on git, and you should regularly commit your changes to a git and push them to github. Please only develop in your own branches, you can later create pull requests that are merged in the master branch. See https://ericmjl.github.io/essays-on-data-science/workflow/gitflow/ for a good description of the workflow I intend to use.
Before commiting, please do the following steps:
If there are any merge conflicts, conflicts in the auto-generated python files can be more or less ignored or resolved easily using "use mine or sth". To resolve conflicts in the notebooks, we should use the package nbdime.
If there are any merge conflicts, please open the local repo folder in the prompt and type nbdime mergetool
, then you can resolve conflicts more easily.
from nbdev.export2html import *
nbdev_build_lib()


DBC Week 9 Cultural Blog Post
Asking Good Questions
April 4th, 2015
Researching is essential when you are learning anything new, programming included and asking good questions play a key part in your research. I think we had a really great Google+ community for our DBC bootcamp. There were not bad questions nor did people ignore or fail to answer them. Instead I will write about several tips to writing a good question!.
1. Do your research: Do not just post a question about a topic without doing research first. A lot of the times, you can answer the question on your own if you took the time to find the answer. It can be uncessary and a waste of time to ask simply questions that can be easily search.
2. Include all of the necessary details: You want to help your potential respondent with as much information as possible to have them answer your questions. Try summing up your entire question in one sentence, so that people can have an idea of the topic you are asking about.
3. Use proper syntax: After you have done your research and still can't find the answer, make sure to post your answer with proper spelling, grammar and punctuation. Also format your question properly so that your code is readable.
4. Proofread: Always proofread before posting! It can be embarrasing if the question you are asking doesn't describe the problem accurately or doesn't make sense. After you proofread you are ready to post your question!
It's really important for anyone to ask questions in order to futher your learning! This is the last blog post for the off-site section of DBC. I'll be heading to SF next week to start learning programming on site.


'I'm glad it's not my drivers' - Horner on Ferrari spat
Cape Town - Red Bull team principal Christian Horner says he is glad he does not have to contend with the situation faced by Ferrari with their warring drivers.
Trouble between Sebastian Vettel and Charles Leclerc was bubbling under the surface during the Brazilian Grand Prix and things finally came to head when they made contact, forcing both Ferrari cars out of the race.
The duo were summoned to Ferrari's HQ at Maranello with team principal John Elkann warning them that the team comes first.
Horner has also experienced driver clashes in the past as Vettel had a number of run-ins with his former team-mate Mark Webber during their time together at Milton Keynes.
And the Red Bull boss knows that there are no real winners when team-mates clash.
"It depends on the scenario and each team has a different approach, and different people have different approaches, so it's difficult for me to judge Ferrari's situation," Horner said via Autosport.
"But the loser is always the team in that situation. Obviously it is a tricky one."
He added: "I'm glad it's not my drivers. It's always a difficult situation.
"Race drivers are fiercely competitive animals, and there is often a conflict between what is right for the team and what is right for the individual."


DateTimeInput Fluid Size Example. The width of the Custom element DateTimeInput in this demo is in Percentages.


fun guide_colorbar(barwidth: Double? = null, barheight: Double? = null, nbin: Int? = null): Map<String, Any>
Continuous color bar guide. Color bar guide shows continuous color scales mapped onto values. Color bar is available with scale_fill and scale_color.


Du und Ich sind Wir
Home
About
Projects
Contact
Willkommen
A typical mobile-optimized site contains something like the following:
Using the viewport meta tag to control layout on mobile browsers
About
About
Projects
Projects
Contact
Contact


Company profile - Canadian Company Capabilities
Third-Party Information Liability Disclaimer
Some of the information on this Web page has been provided by external sources. The Government of Canada is not responsible for the accuracy, reliability or currency of the information supplied by external sources. Users wishing to rely upon this information should consult directly with the source of the information. Content provided by external sources is not subject to official languages, privacy and accessibility requirements.
Aqua Data Inc.
Legal/Operating Name:
Aqua Data Inc.
Alternate Name:
Aqua Data Atlantic
Aquatech Services techniques des eaux inc.
Mailing Address:
95 5th AvePINCOURT, Quebec
J7W 5K8
Location Address:
95 5th AvePINCOURT, Quebec
J7W 5K8
Tel.:<PHONE_NUMBER>
Tel.:<PHONE_NUMBER>
Fax:<PHONE_NUMBER>
Logo
Company Profile
Aqua Data was founded in 1987. Since then is specialized in the
diagnosis of water and sewer systems with very special procedures
and technology.
PROCEDURES : Computerized gathering of information, analysis and interpretation as well as automatic recommendations with the support of specific software which indicates actions to take by priorities and transfers this information on special reports and plans of the networks.
TECHNOLOGY
WATER SYSTEM : Gathering of data with optical reader, home-made analysing software, illustration of priorities in colour on report and plans.
SEWER SYSTEM : Gathering of data with Aqua Zoom camera which does not move in the conduct, analysis with a home-made software, illustration of priorities in colour on report and plans.
Company is increasing its visibility through the sale of licenses. Active licenses are : 2 in Quebec province, 1 in New-Brunswick. Aqua Data is part of the Water Group of Gaz Métro Inc.(formerly Gaz Métropolitain). We have created a formal alliance with the environmental engineering consulting firm Malcolm Pirnie through the formation of InfraMetrix, LLC to market Aqua Datas products and services in the US market.
Environmental Profile
The technology developed, honed, tested and marketed by Aqua Data since its establishment is now being used by cities and municipalities, industries, and government service organizations concerned about the restoration of infrastructures for water and sewage services.
Aqua Data also offers expert service in the development of recommendations for the creation, establishment and implementation of complete programs for the restoration of systems for the collection and the transportation of purified and industrial waters, as well as of preventative maintenance programs for these systems.
In the framework of its development activities, the firm has worked to design and develop computer systems, tools, methodologies and techniques which aim to maximize the results of the inspections of on-site infrastructure networks by transforming the data obtained into technical and economic information which is essential to the development of programs for the restoration of drinking water or wastewater systems.
The expertise acquired by Aqua Data over the years, as well as the distinctiveness and efficiency of the diagnosis systems it has developed, have allowed the firm to broaden its horizons and to export its technology in Canada and the United States. The system is very rapid and precise because it validates the data gathered.
Being for this very reason extremely economical, it increases the frequency of verifications, and thus is more often able to discern abnormalities in the water distribution system such as leaks, which are very costly and which reduce the system's distribution capacity.
Full profile
Full profile
Contact information
Company description
Product / Service / Licensing
wastewater such as hydraulic modeling, unidirectional flushing,
fire hydrant management, fire protection, flow-through time and
influence zones, etc.
In addition to these plans, Aqua Data offers suggestions for periodic inspections and for the upgrading of information so that problems can be detected before major disasters occur. The works are ranked in order of priority, and concrete action is taken for the restoration and repair of equipment, resulting in immediate tangible benefits for both citizens and the organizations responsible:
1- Assurance that equipment is in good working order; 2- Assurance that the water flow is sufficient at all times; 3- Better water quality; 4- Reduced costs for the purchase or production of water; 5- Reduced water loss.
Aqua Data offers its services and its technology through the medium of licenses available throughout the world. The firm, in business since 1987, now has clients in Québec, Ontario, New Brunswick and South America.
hydrant and valves inspection, using bar codes, computer and
optical reader for data gathering, proprietary software for
analysis and production of report and plans illustrating
priorities of interventions.
tele-objective lens camera, as well as proprietary software
for analysis and production of reports and plans illustrating in
colour priorities for interventions.
support of specific software which will also produce instant
graphic and technical data sheets, reports and plans.
equipment.
Market profile
Alliances:
- Sales/Marketing
Strategic alliances:
Aqua Data's expansion moves toward the sale of licences. Due toits unique procedures and technologies the entire world is open
to Aqua Data.
Licencees should be very familiar with the municipal environment
as well as with the water and sewer distribution systems.
Aqua Data is also in the business of software making and selling
in the area of water and sewer systems such as hydraulic
modelling, unidirectionel flushing, fire protection, fire
hydrant management. A match with software distribution company
would be welcome.
Industry sector market interests:
- Environment
- Information Technology and Telecommunications
Geographic markets:
Export experience:
- California
- Florida
Actively pursuing:
- Brazil
- United Kingdom
- United States
Third-Party Information Liability Disclaimer
Some of the information on this Web page has been provided by external sources. The Government of Canada is not responsible for the accuracy, reliability or currency of the information supplied by external sources. Users wishing to rely upon this information should consult directly with the source of the information. Content provided by external sources is not subject to official languages, privacy and accessibility requirements.
Contacts
Contact information
Description
Company description
Products, services and licensing
Product / Service / Licensing
wastewater such as hydraulic modeling, unidirectional flushing,
fire hydrant management, fire protection, flow-through time and
influence zones, etc.
In addition to these plans, Aqua Data offers suggestions for periodic inspections and for the upgrading of information so that problems can be detected before major disasters occur. The works are ranked in order of priority, and concrete action is taken for the restoration and repair of equipment, resulting in immediate tangible benefits for both citizens and the organizations responsible:
1- Assurance that equipment is in good working order; 2- Assurance that the water flow is sufficient at all times; 3- Better water quality; 4- Reduced costs for the purchase or production of water; 5- Reduced water loss.
Aqua Data offers its services and its technology through the medium of licenses available throughout the world. The firm, in business since 1987, now has clients in Québec, Ontario, New Brunswick and South America.
hydrant and valves inspection, using bar codes, computer and
optical reader for data gathering, proprietary software for
analysis and production of report and plans illustrating
priorities of interventions.
tele-objective lens camera, as well as proprietary software
for analysis and production of reports and plans illustrating in
colour priorities for interventions.
support of specific software which will also produce instant
graphic and technical data sheets, reports and plans.
equipment.
Market
Market profile
Alliances:
- Sales/Marketing
Strategic alliances:
Aqua Data's expansion moves toward the sale of licences. Due toits unique procedures and technologies the entire world is open
to Aqua Data.
Licencees should be very familiar with the municipal environment
as well as with the water and sewer distribution systems.
Aqua Data is also in the business of software making and selling
in the area of water and sewer systems such as hydraulic
modelling, unidirectionel flushing, fire protection, fire
hydrant management. A match with software distribution company
would be welcome.
Industry sector market interests:
- Environment
- Information Technology and Telecommunications
Geographic markets:
Export experience:
- California
- Florida
Actively pursuing:
- Brazil
- United Kingdom
- United States


--- layout: post title: Mix:UK 07 tomorrow date: '2007-09-10T16:56:00.001+01:00' tags: [conferences, mixuk] modified_time: '2007-09-10T16:56:59.311+01:00' blogger_id: tag:blogger.com,1999:blog-4015568221071268916.post-1522611894784935705 comments: true blogger_orig_url: http://serialseb.blogspot.com/2007/09/mixuk-07-tomorrow.html ---
How thrilling! Hopefully I'll be able to blog about it. Wonder if I can get my camcorder with me...


from the good-deals-on-cool-stuff dept
Daily Deal: Black Box 1080p Dash Cam
by Daily DealIn the event of a collision, the Black Box is your best witness. Engineered with its own G-sensor, this dash cam captures footage and audio in the moment, ensuring you'll always have a second pair of eyes if you find yourself in an accident. It records in crisp 1080p resolution day or night and boasts an impressive 120-degree recording angle that will capture every important detail.  It's on sale for $30.
Note: The Techdirt Deals Store is powered and curated by StackCommerce. A portion of all sales from Techdirt Deals helps support Techdirt. The products featured do not reflect endorsements by our editorial team.


{% extends '_layouts/default.html' %} {% block body %}
Go is a programming language developed by Google. It aims to be expressive and efficient.
Google's guide on effective Go is the best place to start when thinking about best practices for Go.
{% endblock %}


Learning the hard way not to trust automatic migrations.
I'm not sure why I thought that would work.
While doing a little code cleanup I renamed my ambiguous enums and the related members in my data model. VS automatic rename is awesome (though it doesn't work in Typescript) so the code change was done in seconds. When I launched the site I wasn't that surprised to get an error - there were pending changes to my DB. The place I went wrong was trusting the helpful suggestion in the error message.
The default server error page gives a (somewhat confusing) traceback, and the
advice to run dotnet ef migrations add [migration name]
followed by dotnet ef
database update
to fix the problem. To be fair running the first command did
give a warning: An operation was scaffolded that may result in the loss of
data. Please review the migration for accuracy
. The use of the word scaffold
lead me to believe it was just worried about my C# code not matching the new
records.
After running the migration I again tried to run the app, but now it expired with a different error - One of my LINQ query failed when it hit a null value. My first though was that I had broken/lost/dropped the entire log table, so I jumped into the SQL Explorer to poke around. It turns out everything was still there, but when I scrolled over to check my new columns I found that all the values were null.
My first step to repair the damage was to write some SQL queries to set the values to something:
-- Wrote this after the SELECT query was working
UPDATE [dbo].[JobLogs]
SET [ContactType] = 0,
[ContactMeans] = 0
WHERE [ApplicationUser] NOT NULL AND [Discriminator] = 'ContactLog'
-- Prototyped this first to ensure I was hitting the right rows
SELECT * FROM [dbo].[JobLogs]
WHERE [ApplicationUser] NOT NULL AND [Discriminator] = 'ContactLog'
GO
Luckily this is just a LocalDB with only a handful of real logs, and zero is actually the correct value for anything that matters. I did learn that my "deleted" logs are still hanging out in the DB even though they are un-referenced. Much better to find that out now.
My next step was to figure out where the automatically generated migration went wrong. Here is the original generated code:
public partial class EnumNameChange : Migration
{
protected override void Up(MigrationBuilder migrationBuilder)
{
migrationBuilder.DropColumn(
name: "MeansType",
table: "JobLogs");
migrationBuilder.DropColumn(
name: "MethodType",
table: "JobLogs");
migrationBuilder.AddColumn<int>(
name: "ContactMeans",
table: "JobLogs",
nullable: true);
migrationBuilder.AddColumn<int>(
name: "ContactType",
table: "JobLogs",
nullable: true);
}
...
}
You can see it just dropped all the old columns and added new null columns. Here is my rewrite that would have saved me a little trouble:
public partial class EnumNameChange : Migration
{
protected override void Up(MigrationBuilder migrationBuilder)
{
migrationBuilder.RenameColumn(
name: "MeansType",
table: "JobLogs",
newName: "ContactMeans"
);
migrationBuilder.RenameColumn(
name: "MethodType",
table: "JobLogs",
newName: "ContactType"
);
}
...
}
Overall it was a good learning experience. I did want to try some migration prior to having any real users, although I would have liked to do it under more controlled circumstances.


Posted by HouJK on April 30, 2019
Posted by HouJK on February 27, 2019
Posted by HouJK on January 28, 2019
Posted by HouJK on January 27, 2019
Posted by HouJK on January 25, 2019
Posted by HouJK on January 24, 2019
Posted by HouJK on January 23, 2019


My name is Tian Jiang.
I'm an interactive designer based in Shanghai. I got my Master of Science degree in Technical Communication and Information Design at Illinois Institute of Technology, and a Bachelor's degree in Communication from Shanghai Jiaotong University.
I am pursuing interesting storytelling in various polychrome ways, as an enthusiastic photographer, a coder and a designer.
At the same time, I enjoy being creative in web design, UX/UI design, data visualization, infographic and of course, graphic design.
Love seeking touching moments and interesting stuffs. I dig them not only from my own heart, but also from listening to the audience.
Fan of chess and photography. Big fan of Liverpool FC.


Movie Ticket
Purchase a movie ticket:
Age
Movies Playing
Wonder Woman - new release
Cars 3
Despicable 3
Times Available
Matinee
Night
Purchase
Movie:
. Time:
. Age:
. Your price for this ticket is:


The unseen truth
by Allen Kitchen
December, 1998
<>
The starship LongShot sat in orbit about the planet Yannis, carefully
docked with the space station HighCanyon. The ship sat on one side of the
giant cylinder's curved wall, her docking tube extended a mere 20 feet to
close the distance between the vessel and the station. Keeping clamps and
cables snaked through the cold blackness of space, holding the LongShot and
preventing her from moving out of position.
They were currently on the dark side of orbit and sunrise wasn't for
another 10 minutes. The red and green stationkeeping lights that ran along
HighCanyon's walls pulsed and strobed in the darkness as beacons for
approaching ships. The foil-covered tubes and cables that provided fuel and
power shimmered faintly from the lights coming from the hundreds of
windows along the station's walls. Here and there, other ships could be seen,
similarly docked.
But the docking tube holding the LongShot secure seemed different
than the others tonight. For some reason, it seemed to be moving - rocking
back and forth over and over and over...
***
Alkit raced out of his room before the door had even had a chance to
open completely. Struggling to pull on his shirt and not crash headfirst into
something at the same time he felt his way along the wall as the ship's claxon
rang out the General Warning alarm.
He'd just gotten his muzzle through the neckline and was able to see
again, when Triva practically bowled him over running past him in the
narrow corridor.
"Oof!" he grunted, clutching the wall. "Triva, watch where you are
going! And what's with the alarm?"
"I'll give you two guesses Alkit!" she cried after him, rounding the
curve in the hall. She was racing toward the docking hatch.
"Oh, drahn," Alkit fumed as he rushed off after his wolven mate.
"Not again!"
He had gone about 50 feet more when he reached Triva at the
hatchway to the docking tube. He clutched the metal clasps around the open
pressure bulkhead, and looked out into the connection between the ship and
the station.
He saw Tess and Brand, playing a game of tag in the null-gee
environment of the docking raceway!
"Tess!" Alkit shouted. "Brand! What have we told you about playing
in the docking area?"
Brand, surprised, spun to look at his father. But he misjudged his
rotational change and smashed headfirst into the wall with his head. The thin
accordianed material flexed and bowed under the shock once again.
Tess was older and a bit more experienced at this game. So she just
grasped two of the nearest handholds to her, and anchored herself in place.
She was upside down compared to Alkit and Triva.
"You told us not to play in the docking tube because we get in the way
of traffic," she meekly answered. "But there's no traffic right now, so we
aren't in the way."
"Your father and I told you not to play in the tube, period!" Triva
angrily spat. "You and Brand get back on board the ship, this instant!"
"Aw, Ma..." Brand whined as he managed to get hold of a nearby grip
and regain control of his orientation.
"Don't talk back to your mother," Alkit said firmly. "Both of you,
back to your rooms."
"We weren't hurting anything." Brand sulked as he pulled himself
hand over hand back toward his angry parents. Tess swatted at him with her
tail.
 Your gonna get us in trouble."
"Mom! Make Tess get her tail out of my face!"
"Move it!" Triva fumed, grabbing for Tess as she came into reach and
swinging her to land feet first in the ship's gravity field. "We've told you not
to play in the docking tube like that. It's dangerous!"
"That's right," Alkit agreed, holding out a vulpine hand for Brand to
grasp. "The raceway isn't as strong as the rest of the ship. It can't handle
your bouncing back and forth on the walls. They'll break. And when they
break, you two will go flying out into space in an instant."
Brand reached out and gripped his father's hand.
"I'm sorry dad. We didn't mean..."
"I know son, I know." Alkit sighed as he pulled Brand inside and
likewise swung the young wolf to stand erect. "I know it's fun to play in
zero gravity. But you can't play in the docking tube. Ever. I don't want
you, either of you, to go into it again unless your mother or I or one of the
rest of the crew are with you. Understood?"
Both Tess and Brand stared at their feet and nodded their acceptance.
"Good," Triva sharply said as she gripped them both by their ears.
"Now, march! Back to your rooms." She began to walk with the two
youthful wolves down the curved hallway of the ship.
She only managed a few steps before Shanus ran up to them. She
appeared disheveled and her unzipped orange jumpsuit looked like she'd
slept in it.
"Alkit! Triva! The station-master just sent a message on the comm
system. He demands to know what is wrong with our docking mechanism!"
Alkit turned to the wall, and pressed a few buttons on the small black
panel inset into the grey metal. A second later, the ship's klaxon ceased, and
the hallway was once more quiet. He turned to face the panda with a pained
look.
"Nothing is wrong that a good spanking won't fix, Shanus."
"Station-master Rannis said he was coming right over."
Triva rolled her eyes and growled in exasperation. "Oh. Terrific. As
if things weren't bad enough."
"Yeah, I know," Alkit sighed. "And Shanus? If we are expecting
visitors, you might want to at least zip up."
Shanus looked down at her chest, cursed softly, and turned to the wall
away from everyone.
"Sorry people. I... was busy when the alarm went off and took my
station at the bridge."
Triva chuckled, moving her hands from the kids ears and onto their
shoulders.
"Well, the cubs are sorry for disturbing your rest." She then looked
down on them with a serious gleam in her eye and spoke to them in that
dreaded mother's tone that all children fear. "Aren't you?"
Tess and Brand both nodded rapidly in response.
Shanus finished fixing her zipper, then turned around to face the group
once more.
"It's all right, Triva. No harm done..." She then glared at the two
young wolves and added, "this time."
"It had better be the last time, if a certain pair of pups knows what's
good for them."
"Shanus, do you think you can take Tess and Brand back to their
rooms as you head back to yours?" Alkit asked.
"Oh? So I'm on rapscalian duty now?"
Triva chuckled and prodded her children to go with Shanus, who was
already holding out her hands to the two young cubs. The pair sullenly
walked over to Shanus, and she put a hand behind their heads.
"No, Shanus. But Alkit and I need to wait here for the station
manager. Just make sure they get to their room as you walk by it. Then you
and Lancelot can get back to...to..." Triva stopped, slightly embarrassed.
Alkit came to her rescue a few seconds later. "I believe you and
Lancelot were discussing some of the finer points of poetry?"
"Yeah, that's it Shanus. You two can go back to your poetry reading."
"Uh huh," Shanus humorously called behind her. "I'll be sure to tell
Lancelot that that's what we're doing. He should get a kick out of that."
"Probably," Triva said, getting over her embarrassment.
"Only this time, try not to read so loud!" Alkit called after her as she
and the cubs walked down the curved hall and out of sight. "That, or turn
some music on!"
"Oh, please." Triva winced. "Anything but that music of hers." Alkit
cocked an eyebrow at his pretty mate.
"You don't care for her tastes in bands?" he asked her.
"I don't care for her tastes in tonal structure," she replied. "I thought
only Avians listened to that microtonal stuff. I mean, 32 notes per octave?
Don't you agree that's a bit extreme?"
Alkit smiled. "I imagine the musical keyboard must be dozens of feet
long. But taste is a matter of opinion."
"Well, some of their so-called chords hurt my ears and there's no
opinion about that."
"They don't hurt my hearing any."
"It's a wolf thing."
"Excuse me?" a voice suddenly called out from the docking tube.
Alkit, and Triva turned about to see who had boarded without their
knowledge or permission.
Standing there, just coming into the gravity field, was a tall, red-furred
vixen. She was dressed in a simple yet elegant tan jacket with a skirt and
white shirt underneath. She glided effortlessly from the zero gravity area to
land gently on her feet, clad in luxurious and expensive-looking shoes. Her
red, bushy tail was tipped solid white and fell flat against her legs as null-gee
gave way to forces generated by the gravity plates of the ship.
She was carrying a computerpad under her right arm, and Alkit
noticed the hyperlink antenna on the back of the unit. That surprised him.
Such gear was very expensive and only wealthy executives who had to be in
constant contact at all times could afford them. That, or station managers
who quite literally needed to have the universe at their fingertips.
She saw Alkit looking at her and rewarded him with a smile.
"Ah! Captain Alkit. Yes, this is the LongShot all right. Permission to
come aboard?"
"Granted," Alkit said extending his hand politely to help her get
through the bulkhead doorway. "Welcome aboard. And I hope you won't
fine us for the incident with the docking tube."
She looked at Alkit puzzedly for a moment, flicking an ear.
"Why in the Void would I fine you?" she asked.
Alkit and Triva looked at each other for a few seconds before turning
their gazes back to their vulpine visitor.
"Ah!" the vixen exclaimed, her eyes opening wide. "I get it! You
think I'm from the station, and that I am coming here to yell at you about
your young ones misbehaving."
"You mean you're not from the station?" Alkit asked.
"No," she answered, and began to confidently pry her way between the
fox and wolf, ignoring the outstretched hand and entering the hallway of the
ship. "I don't have anything to do with HighCanyon. I'm from the Spacer's
Guild."
"The Guild?" Alkit and Triva both said in surprise. It had been a long
time since they had had a representative of the guild on board their ship.
The vixen nodded and kept walking. "That's right. I'm from the
office of psychological fitness. I'm going to be hitching a ride with you back
to Vulcape and conducting a psychiatric evaluation on someone once we get
there."
Alkit scowled and jogged to catch up with her. Triva was following
close behind him.
"It is customary for the guild to ask before dead-heading someone
aboard a private ship," he pointed out with just a touch of annoyance.
She turned about instantly, and withdrew some papers from some
unseen pocket. She handed them to Alkit with little fanfare.
"This should take care of any and all objections, Captain Alkit," she
said assuredly. "I believe you will find everything to be in order. As for
accommodations, I can room just about anyplace you care to put me."
Alkit reached out, took the proffered papers, and began leafing through
them, one page at a time. He was still pouring over the documents, clearly
emblazoned with the triple star seal of the spacer's guild, when the vixen
leaned forward toward him.
"I'll bet you have plenty of space in your quarters Alkit," she crooned.
"That is, if you don't mind sharing your bed with me." She finished her
sentence with a soft, inviting murr.
Alkit's head shot up, clearly surprised at the offer.
Triva, showing remarkable self-control under the circumstances, only
bared her teeth a little bit. "Excuse me," she growled, "but in case you
didn't realize it, Alkit here is taken."
"Indeed he is!" The vixen laughed and stuck her hand out, offering to
shake with Triva. "Permit me to introduce myself. I am Lisza Cyrelus."
Alkit's jaw dropped when he heard her mention her name. He could
only stand there dumbfounded as Triva cautiously accepted her outstretched
hand and shook. Her wolfen eyes were locked on the vixen's and never
wavered.
"Hello. I'm Triva. I'm Co-Captain of this ship, and Alkit's..."
"Mate," Lisza interrupted. "Yes, yes I know. Well, I happen to be his
wife."


This library provides a simple API for transferring a file from one location to
another. The locations are specified as URLs and any combination of the following
protocols is supported: HTTP, HTTPS, FTP, GSIFTP, and FILE. Also, third party
transfers can be initialized between any ftp servers that support that feature.
Package Specification
Related Documentation
For overviews, tutorials, examples, guides, and tool documentation,
please see:


Copyright © 2009 Jacob Torrey<EMAIL_ADDRESS>Authors: Jacob Torrey (torreyji@clarkson.edu).
| fclose/1 | Closes an open file. |
| fopen/3 | Opens a file for reading or writing. |
| fread/2 | Reads from a file. |
| fseek/3 | Seeks to a position in a file. |
| fwrite/2 | Writes to a file. |
fclose(FP::io_device()) -> ok | {err, Reason}
Closes an open file
fopen(App::list(), Filename::string(), Flags::list()) -> io_device() | {err, list()}
Opens a file for reading or writing
fread(FP::io_device(), Num::int()) -> any() | {eof} | {err, list()}
Reads from a file
fseek(FP::io_device(), X2::atom(), Off::int()) -> ok | {err, list()}
Seeks to a position in a file
fwrite(FP::io_device(), Dat::any()) -> ok | {err, list()}
Writes to a file
Generated by EDoc, Nov 5 2009, 11:34:37.


Alan Kay likes to talk about moving from "how" to "what" in programming. That is, we'd like the programmer
to merely specify what is desired and have the computer automagically make it so, as opposed to
requiring he/she to detail every step required to get there. In a nutshell, this move from "how"
to "what" is the story of progress in programming languages over time. Even low-level languages like
C provide several forms of "what" as compared with assembly language, e.g., "let there be a variable
called x
," "return back to my caller," etc.
Prolog can in some ways be viewed as the idea of a "what" language taken to its logical
Unfortunately, Prolog does not put programming language designers out of business. By forcing everything to
be a "what" and all computation to proceed via search, many kinds of tasks are unnatural to implement and/or
require careful structuring to ensure that Prolog's search will terminate. Further, tasks often require
the use of imperative features to obtain reasonable performance.*
Nonetheless, Prolog continues to be an inspiration for what declarative programming might be. Further, subsets of Prolog, notably Datalog, which requires the arguments to predicates to be simple atoms rather than arbitrary terms, have been quite successful in a variety of domains, e.g., access control, program analysis, and data analytics. Datalog provides many of the benefits of Prolog but without the fragility: all Datalog programs are guaranteed to terminate, and the semantics of a Datalog program is completely independent of the underlying search strategy that is used by an implementation.
log.js
file through the course page on CCLE.
In this homework assignment, you will "prototype" a Prolog-like programming language. This section introduces the classes that will be part of your prototype and shows how our parser maps the concrete syntax of our logic programming language to instances of those classes.
| Concrete Syntax | JS AST | |
|---|---|---|
| p ::= |
r1 r2 … c1, c2 … ?
|
new Program([ r1, r2, …], [ c1, c2, …])
|
| r ::= |
c
. c
:- c1, c2, … . |
new Rule( c) new Rule( c, [ c1, c2, …]) |
c ::= |
x
( t1, t2, …) x
|
new Clause( x, [ t1, t2, …]) cs237a ) is just a clause with no arguments.new Clause( x)
|
| t ::= |
c
X
|
new Var( X) |
| x ::= |
|
|
| X ::= |
|
prelude.js
. Here's a complete list of their constructors and
instance variables.
new Program(rules, query)
rules
: an array of Rule
squery
: an array of one or more Clause
snew Rule(head, body)
head
: a Clause
body
: an array of Clause
sbody
argument is optional — new Rule(head)
is equivalent to
new Rule(head, [])
new Clause(name, args)
name
: a stringargs
: an array of terms
(a term is either a Clause
or a Var
)args
argument is optional — new Clause(name)
is equivalent to
new Clause(name, [])
new Var(
)
name
= In the first part of this assignment, you will implement a couple of helper methods that will come in handy for your interpreter.
Implement a method on Rule
s called makeCopyWithFreshVarNames()
.
This method should return a copy of its receiver in which all variable names have been replaced with
fresh variable names. As we discussed in class, you will want to call this method before unifying a goal with
the head of a rule so that the variable names in the rule don't accidentally get confused with the
variable names in the goal (and in the surrounding context).
Unification produces a substitution, which is a mapping from variables to terms.*
Subst
class, which
is declared in prelude.js
. Subst
s support the
following methods:
lookup(varName)
returns the term associated with varName
in the substitution,
or undefined
if varName
is not associated with a term.bind(varName, term)
updates the substitution in place to associate varName
with
term
, and returns the substitution.clone()
returns a copy of the substitution.
As mentioned in class, a substitution should always be in solved form: any variable that appears in its domain should
not appear in its range. You will have to figure out how to maintain this invariant in your interpreter. To make this task
easier, implement a method on terms — i.e., Var
s and Clause
s — called
rewrite(s)
such that t.rewrite(s)
returns the result of applying the substitution
s
to term t
. In other words, rewrite
will replace any variables in t
with their values according to s, and leave any variables that are not mapped in s
alone.
(Note that the result of t.rewrite(s)
is a new term — the rewrite
method should not
modify its receiver.)
Please do all your work in a file called log.js
. Each time
you refresh this page, that file is loaded by our test harness to run unit tests for each part of the
assignment.
You can add your own test cases to this list by editing
tests-part1.js
.
As discussed in class, the heart of a Prolog interpreter is unification. Implement a method on Subst
called unify(term1, term2)
that adds to the given substitution whatever bindings are necessary in order to unify
the given terms. If unification succeeds, unify
should return the updated substitution; otherwise it should
throw an exception like this:rewrite
method that you implemented above should come
in handy.
Here is the pseudocode for unification that we saw in class.
s
is the most general unifier of t1
and t2
if any other unifier s'
of
those terms is simply a more constrained version of s
, i.e. it has all the constraints of s
plus
potentially more. For example, {X:a,Y:a}
is a more constrained version of {X:Y}
.
(
,
,
…,
)
= (
,
,
…,
)
→
You can add your own test cases to this list by editing
tests-part2.js
.
Finally, implement Program
's solve()
method, which produces the solutions for a given program.
The solutions should be returned as an iterator of substitutions, each representing a solution to the
query in the program.
Here, an iterator is just an object that has a next()
method. This method will either return an instance of
Subst
, or a falsy value to tell the caller that there are no more solutions. Of course, solutions
should be produced in the same order as they are in Prolog. Our test harness and playground will use your iterator to
obtain and print solutions.
Note: The produced substitutions can include more variables than those that appear in the query; our provided
evalAST
method (see plumbing.js
) filters each substitution to find and
print only the variables that appear in the query.
To handle programs that have an infinite (or just a very large) number of solutions, you should produce solutions
lazily, i.e., you should only actually search for the next solution when next()
is called on your returned
iterator. So your solve
method will really just produce an iterator that "knows" how to search for the next
solution whenever it is asked for one. This will require you to maintain some state to represent the current point in your
search, so that a call to next()
can pick up where the previous call left off, including accounting for the need
to backtrack. Hint: Aren't lexically scoped closures awesome?
You can add your own test cases to this list by editing
tests-part3.js
.
is/2
predicate. E.g.,
is(X, +(15, *(3, 9)))
should succeed with X
bound to 42
. For
extra style points, make it possible for the arithmetic operators to be written in infix notation, with
the standard precedences.
assert/1
and
retract/1
? What about the
clause/2
predicate?
Lots of opportunities for interesting extra-credit projects here! Highly recommended reading: Ron
Ferguson's Prolog: A Step Toward the
Ultimate Computer Language.Subst.prototype.unify
, then explain what it's for and how it works.


Richard Hendriks
skills
| Skill | Keywords |
|---|---|
| Web Development | HTML CSS Javascript |
| Compression | Mpeg MP4 GIF |
employment
CEO/President, Pied Piper
2013-12 — 2014-12Pied Piper is a multi-platform technology based on a proprietary universal compression algorithm that has consistently fielded high Weisman Scores™ that are not merely competitive, but approach the theoretical limit of lossless compression.
- Build an algorithm for artist to detect if their music was violating copy right infringement laws
- Successfully won Techcrunch Disrupt
- Optimized an algorithm that holds the current world record for Weisman Scores
education
University of Oklahoma
2011-06 — 2014-01 DB1101 - Basic SQL CS2011 - Java Introductionservice
Teacher, CoderDojo
2012-01 — 2013-01Global movement of free coding clubs for young people.
- Awarded 'Teacher of the Month'
writing
Video compression for 3d media,
2014Innovative middle-out compression algorithm that changes the way we store data.
recognition
Digital Compression Pioneer Award, Techcrunch
2014There is no spoon.
testimonials
Erlich Bachman
It is my pleasure to recommend Richard, his performance working as a consultant for Main St. Company proved that he will be a valuable addition to any company.


Discover how we used machinelearning to add value and improve the efficiency of HERA by Hotel ResBot and what are the challenges of AIimplementation and the benefits of outsourcing.
Learn moreAddress your integrations in a way that allows you to focus on your growth and system development, leaving it to a partner whose specialism is connectivity. We build the interface, you own the IP, with full hosting and support to maintain a consistent and workable connection. Discover how we deliver integrations to the travel and hospitality industry with our Managed Interface Service
Learn moreGood communication is vital for the success of any project. Darja Gogunova, our Senior Hospitality Consultant has put together some tips to keep communication channels open and healthy.
Learn moreDid you know that approximately 85% of companies are operating with some form of the legacy system? What are the reasons and what is a middle path between the two extremes of ditching everything or holding on to the old?
Learn moreFour out of five CFOs cite problems with their spreadsheets, so why is change not coming soon enough? Spreadsheets weren’t designed to handle the huge data sets required by modern business, meaning most executives are unable to see the big picture and their role in achieving it. The problems with excel…
Learn moreDon’t ignore the warning signs - distribution mix is key to sustaining business. The way every industry distributes product is changing. The market is on dynamic pivots, changing all the time. Reinvigorate hotel distribution and keep track of tech….what to watch for in 2020.
Learn moreAPIs are the first target for 2020 and how to make them more accessible - how can we make it any easier? And three other trends that we at Sciant believe will allow business to flourish in the coming year.
Learn moreHave you ever wondered what microservices are? The central idea of microservices is to split the large system into loosely coupled services that can be deployed independently. The second article from the series explains what the purpose of microservices is, when we use them and when they are not the best idea.
Learn moreWhile GDPR brought restrictions on data usage, it hasn’t stopped the expectation from consumers for better personalisation. So how do you prepare your system, its interfaces and data to deliver unique experiences?
Learn moreBeware - Hotel GMs are more tech-savvy and fully pumped to use the power of data and technology. They have their minds set on what they need to get their hotel efficient and tech systems optimized. We look at the tech trends helping them achieve…
Learn moreWith new players disrupting logistics, established firms need to embrace new technologies. We look at the 5 technologies entering the logistics sector at scale in the next 5 years.
Learn moreDid you know that Bulgaria has the largest proportion of women in Tech across EU, 31% versus 16%? Sciant smashes the average, with 38% of employees! Please, meet our Director of services Antonia Teofilova who chatted with us about why she thinks more women should work in technology and why women are put off from a career in technology.
Learn moreInvestment in logistics technology still requires more, especially as the industry represents 11% of EU GDP, generating 7 million jobs. So we take a look at four startups about to give digital transformation a bit of a shake up
Learn moreIn the last five years travel startups have received over £1 billion in new investment. The online travel market alone is expected to grow to $817 billion by 2020 - that’s next year. So we look at some of the hottest trav tech right now.
Learn moreUnleash the power of NLP - how one business is bringing efficiencies for reservation staff using machine learning by automating processes of email booking requests. Discover how it’s being done
Learn moreWith more than 2 billion NFC devices already in existence, and an estimated 38.5 billion IoT-connected devices by 2020, NFC will be an integral part of the connected landscape for logistics. So how will this work in practice? Read about the role of NFC in supply chain.
Learn moreAI spend is expected to reach in excess of $47B next year...if your business has not made a case for implementing AI in some form by now you risk being left behind. Check out how to prepare your business for change using artificial intelligence.
Learn moreWhy is it so hard to find data scientists? And why are they so important anyway?
Learn moreThe cost of not integrating your data is clear – bad data costs organisations an average $15 million per year, and 65% of businesses fearing becoming redundant if they don’t keep up. So what are you doing about it? See the benefit of integration and the opportunities applied to the hospitality market
Learn moreWhen the world lacks data scientists - Don’t just sit on golden nuggets of data, help your customers see them and respond to them. Data empowers businesses to make decisions in a better, more evidence-based way, mitigating against the risk of failure. Find out how to do it.
Learn moreThe digital natives are coming and they may not be quite impressed with our working methods - but regardless we need to know how they are consuming as they are the next buying power. Systems and processes need to meet their expectations, we look at the key aspects to consider for preparing for Gen Z
Learn moreDigital transformation needs businesses to think savvy about the skills they need, and for system providers to recognise the skills gap. There's only so much learning and development and employee schemes that will attract and retain the essential skills you need in your business - so how do you find the talent?
Learn moreHow confident are you in your legacy system to last the journey? Is it that a trusty old-friend that will keep going with the right love and tender-care? We look at how you can rejuvenate an old infrastructure.
Learn moreFacial recognition is slowly seeping into the hospitality industry, providing a range of solutions to add to the guest experience...yet how far does or can it go?
Learn moreWe see huge scope in implementing AI in just parts of the business without having to do a blanket wide approach, trialling pilot projects to build confidence. AI and machine learning will free hoteliers of repetitive time-consuming processes to focus on more strategic and creative tasks that will deliver innovation to the hotel sector. We've looked at some of the ways AI can begin to raise the performance of the hospitality ecosystem.
Learn moreWe're proud to be part of Bulgaria's burgeoning tech market, beyond increasing start-up investment - did you know that Bulgaria was the Eastern Bloc’s post-war IT and electronics specialist? With more women in IT than other EU countries - discover Bulgaria tech.
Learn moreIoT devices bring the next wave of connectivity and data integrations that the hospitality sector needs to manage. With the right visibility, hotels can give seamless personalised experiences.
Learn moreDigitalising the shipping process is only going to improve cargo handling and help meet compliance, security, data requirements and payment processes. The eAWB standard.
Learn more


Pop down to The Traveller's Rest for some nibbles and a natter
Sunday social group aims to combat loneliness
by Jane McFarlaneThe weekend can be very long and lonely if you've no family or friends nearby.
But a new social group being set up in Derby aims to combat those feelings of loneliness at the weekend by providing a place where people can get together, have a chat and a bite to eat and make new friends.
The Nibble and Natter group will be held at The Traveller's Rest on Ashbourne Road in Mackworth between 3pm and 5pm on the first Sunday of every month, with the first meeting on Sunday, December 1.
The group is being run by Head High , a charity started by Amanda Solloway to champion mental health awareness, working within the community to make a difference to people's lives.
To find out more, call or text<PHONE_NUMBER>4 or email<EMAIL_ADDRESS>.


|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object apollo.datamodel.Range
public class Range
| Field Summary | |
|---|---|
protected int |
high
|
protected static org.apache.log4j.Logger |
logger
|
protected int |
low
|
protected java.lang.String |
name
|
protected SequenceI |
refSeq
|
protected byte |
strand
|
protected java.lang.String |
type
|
| Fields inherited from interface apollo.datamodel.RangeI |
|---|
NO_NAME, NO_TYPE |
| Constructor Summary | |
|---|---|
Range()
|
|
Range(int start,
int end)
Range with NO_NAME name |
|
Range(java.lang.String name,
int start,
int end)
|
| Method Summary | |
|---|---|
boolean |
canHaveChildren()
If SeqFeature is an instanceof FeatureSetI and FeatureSetI.hasChildFeatures is true then true. |
boolean |
contains(int position)
|
boolean |
contains(RangeI sf)
Returns true if range of sf is entierly within this RangeI |
void |
convertFromBaseOrientedToInterbase()
Converts base oriented range to interbase range |
void |
convertFromInterbaseToBaseOriented()
Converts interbase range to base oriented range |
int |
getEnd()
|
java.lang.String |
getEndAsString()
|
java.lang.String |
getFeatureType()
getType is not the "visual" type, ie the type one sees in the EvidencePanel. |
int |
getHigh()
|
int |
getLeftOverlap(RangeI sf)
|
int |
getLow()
|
java.lang.String |
getName()
In the case where the range is chromosomal the name is the chromosome name |
RangeI |
getRangeClone()
returns clone of self |
SequenceI |
getRefSequence()
Retrieve the SequenceI that this feature annotates. |
java.lang.String |
getResidues()
|
int |
getRightOverlap(RangeI sf)
|
int |
getStart()
|
java.lang.String |
getStartAsString()
|
int |
getStrand()
|
boolean |
hasFeatureType()
convenience method returns !getType()==NO_TYPE |
boolean |
hasName()
return true if name !equal NO_NAME |
boolean |
hasRefSequence()
return false if no ref seq, ranges should generally have ref seq, only during initialization might it not |
boolean |
isContainedByRefSeq()
Return true if ref seq contains this range |
boolean |
isExactOverlap(RangeI sf)
|
boolean |
isForwardStrand()
Convenience method for getStrand() == 1 |
boolean |
isIdentical(RangeI range)
Returns true if same start,end,type and name. |
boolean |
isSequenceAvailable(int position)
|
int |
length()
|
boolean |
overlaps(RangeI sf)
|
boolean |
rangeIsUnassigned()
Return true if range has not been assigned high & low |
boolean |
sameRange(RangeI r)
Return true if start and end are equal |
void |
setEnd(int end)
|
void |
setFeatureType(java.lang.String type)
|
void |
setHigh(int high)
|
void |
setLow(int low)
|
void |
setName(java.lang.String name)
|
void |
setRefSequence(SequenceI sequence)
Set the SequenceI that this feature annotates. |
void |
setStart(int start)
|
void |
setStrand(int strand)
|
java.lang.String |
toString()
|
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Field Detail |
|---|
protected static final org.apache.log4j.Logger logger
protected int low
protected int high
protected byte strand
protected java.lang.String name
protected java.lang.String type
protected SequenceI refSeq
| Constructor Detail |
|---|
public Range()
public Range(int start, int end)
public Range(java.lang.String name, int start, int end)
| Method Detail |
|---|
public RangeI getRangeClone()
getRangeClone
in interface RangeI
public boolean isIdentical(RangeI range)
isIdentical
in interface RangeI
public void setName(java.lang.String name)
setName
in interface RangeI
public java.lang.String getName()
RangeI
getName
in interface RangeI
public boolean hasName()
RangeI
hasName
in interface RangeI
public java.lang.String getFeatureType()
getFeatureType
in interface RangeI
public void setFeatureType(java.lang.String type)
setFeatureType
in interface RangeI
public boolean hasFeatureType()
RangeI
hasFeatureType
in interface RangeI
public int getStrand()
getStrand
in interface RangeI
public boolean isForwardStrand()
isForwardStrand
in interface RangeI
public void setStrand(int strand)
setStrand
in interface RangeI
public void setStart(int start)
setStart
in interface RangeI
public int getStart()
getStart
in interface RangeI
public void setEnd(int end)
setEnd
in interface RangeI
public int getEnd()
getEnd
in interface RangeI
public int getLow()
getLow
in interface RangeI
public void setLow(int low)
setLow
in interface RangeI
public int getHigh()
getHigh
in interface RangeI
public void setHigh(int high)
setHigh
in interface RangeI
public java.lang.String getStartAsString()
public java.lang.String getEndAsString()
public SequenceI getRefSequence()
RangeI
getRefSequence
in interface RangeI
public boolean hasRefSequence()
RangeI
hasRefSequence
in interface RangeI
public boolean isContainedByRefSeq()
RangeI
isContainedByRefSeq
in interface RangeI
public void setRefSequence(SequenceI sequence)
RangeI
setRefSequence
in interface RangeI
sequence
- the new parent SequenceIpublic java.lang.String getResidues()
getResidues
in interface RangeI
public int getLeftOverlap(RangeI sf)
getLeftOverlap
in interface RangeI
public int getRightOverlap(RangeI sf)
getRightOverlap
in interface RangeI
public boolean isExactOverlap(RangeI sf)
isExactOverlap
in interface RangeI
public boolean contains(RangeI sf)
RangeI
contains
in interface RangeI
public boolean contains(int position)
contains
in interface RangeI
public boolean overlaps(RangeI sf)
overlaps
in interface RangeI
public boolean sameRange(RangeI r)
sameRange
in interface RangeI
public int length()
length
in interface RangeI
public boolean isSequenceAvailable(int position)
isSequenceAvailable
in interface RangeI
public boolean canHaveChildren()
canHaveChildren
in interface RangeI
public boolean rangeIsUnassigned()
rangeIsUnassigned
in interface RangeI
public void convertFromBaseOrientedToInterbase()
RangeI
convertFromBaseOrientedToInterbase
in interface RangeI
public void convertFromInterbaseToBaseOriented()
RangeI
convertFromInterbaseToBaseOriented
in interface RangeI
public java.lang.String toString()
toString
in class java.lang.Object
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


TOY STORY 2
Reviewed by Harvey Karten Walt Disney Pictures/Pixar Animation Studios Director: John Lasseter Writers: Andrew Stanton, Rita Hsiao, Doug Chamberlin & Chris Webb Cast: Voices of Tom Hanks, Tim Allen, Don Rickles, Kelsey Grammer, Wallace Shawn, Jim Varney, Wallace Shawn, John Ratzenberger, Annie Potts, Wayne Knight, others
Nothing's permanent on this Earth of ours, not even life. Love is transitory. If fifty percent of American marriages now end in divorce as couples outgrow each other, think of how many kids separate permanently from their toys when they get tired of them or when the playthings are inevitably outgrown. We'd not be surprised to learn that close to one hundred percent of our miniature trinkets and gadgets wind up in the trash bin or in the yard sales--torn, raggedly, misused and tired--the feelings of our little friends obviously hurt beyond repair. In the vivid imaginations of scripters Andrew Stanton, Rita Hsiao, Doug Chamberlin and Chris Webb, human tykes are not the only ones who may be bereft when their usually inanimate pets are broken. The soldiers, sky-walkers, doggies, piggies and miscellaneous other once- sturdy pals are emotionally crushed as well. What's more, never do these buddies become indifferent to their caretakers as their stewards so often become to them.
"Toy Story 2" is a homage to the immeasurable charms of the eponymous critters, a testimony to the impermanence of inanimate things which have given us alternately selfish and sentimental human beings so much gladness during our most wonderful years. Featuring the ultimate in 3-dimensional, Pixar animation, director John Lasseter's tale of homesickness and bonding cuts neatly across audience barriers of age, race, social class to provide a heartwarming portrait of the chums we've all enjoyed or are savoring still, whether the rag dolls of financially strapped kids or the computerized zappers of the rich and famous. Utilizing the voices of such greats as Tom Hanks, Tim Allen, Kelsey Grammer and Joan Cusack to get into the heads of the characters, director Lasseter--whose job has been made easy by a large team of crack designers--unfolds a story whose plot is as absorbing as the animation is colorful and vivid. Anyone who has ever felt guilty when leaving a beloved dog home alone while heading off to work or school now has reason to feel even more contrite, however. You see, the slinky-dogs and other trinkets that line the shelves of the little ones have lives of their own. They miss you when you're gone.  We know that now that we've seen this frenetically- paced yarn, an often bust-out-laughing tale of toys and tykes.
The story opens as little Andy heads off to camp, leaving cowboy Woody (Tim Hanks) behind under his mom's care. When Woody is kidnapped by a greedy collector (Wayne Knight), more interested in investments than in art, he learns that he is part of a set whose value has dramatically increased when he is added to the combo. While Woody's pals back home led by Buzz Lightyear (Tim Allen) head out to the collector's business to rescue him, Woody discovers that he was once a 1950's TV star in the role of a puppet (think Howdy Doody) and that he had been part of a family that includes a horse named Bullseye, a prospector named Stinky Pete (Kelsey Grammer), and a cowgirl that seems to run through her role on speed, Jessie (Joan Cusack). Woody is given a guilt trip that more than matches his journey to the collector's store. His rediscovered family tell him that if he deserts the brood, they will be placed in boxes, stored away indefinitely in the dark. How will the cowboy solve the dilemma? If he stays, he will betray his beloved owner, Andy. If he goes back home, he will abandon his own extended family. While Buzz has his own, more visceral friction with his arch enemy, Emperor Zurg (Andrew Stanton), Woody is faced with a crisis of conscience that could take 15 years of couchwork to resolve.
Parents of exceptionally sensitive kids could be concerned that their own young-uns could wind up afflicted with guilt over the toys they once discarded. There is probably little to fear, though, as the little ones who will delight in the unaffected performances of these figures (just about all adorable except for Stinky Pete who is bitter because he has never been bought and unwrapped) will simply eat up the luminous landscape of this wonderfully realized film. Oddly enough, the movie was at first intended for direct-to-video release, but once the producers got over that silly notion they made sure that considerable attention to every technical detail was put into the happy story.
Rated G. Running Time: 85 minutes. (C) 1999 Harvey Karten<EMAIL_ADDRESS>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