LOCK, STOCK AND TWO SMOKING BARRELS A film review by David N. Butterworth Copyright 1999 David N. Butterworth
*** (out of ****)
It features a ne'er-do-well quartet of underachievers with names like Soap and Bacon. It's got a narrated, freeze-frame opening sequence in which two tossers bolt from the fuzz to a pulsating rock soundtrack. It's got heavily-accented dialogue that could benefit from subtitles, lots of ultraviolence, and a big bag of dosh.
It's not "Trainspotting," the trans-Atlantic junkie hit that saw Ewan McGregor (soon to be seen as the young Obi-Wan in the eagerly-awaited "Star Wars" prequel) shooting heroin like there was no tomorrow.
It's "Lock, Stock and Two Smoking Barrels," the latest anarchistic exercise to bear the slogan "the film that took England by storm."
Like Danny Boyle's "Trainspotting," Guy Ritchie's film finds strength in its cast of virtual unknowns, SAG-speaking that is. One face will be familiar to a particular British audience, but seen spattered with mud and blood on the small screen, not the big one.
Ah, the Žuvre of the bad boy footballer turned movie star.
First, former Manchester United striker Eric Cantona had an unexpected turn as a French ambassador in the acclaimed costume drama, "Elizabeth." Now, not to be outdone by his former English league rival, Wimbledon midfielder Vinnie Jones has a sizable and affecting role in "Lock, Stock and Two Smoking Barrels."
Whereas M. Cantona was simply adequate as an historical dignitary, Jones' performance is surprisingly on the ball. Not just when he exhibits the kind of prowess he showed on the football field--a headbutt here, a kick to the groin there, a fist to the face elsewhere--but also when he portrays his character's odd sense of propriety and placidly threatening demeanor.
Harry likes to play cards, and it's one of his high stakes poker games that first introduces us to our hapless heroes: Eddie, Tom, Bacon, and Soap.
Eddie is the brains of the bunch (and that's not saying much) who's known how to handle cards ever since he could handle cards. As the film opens, Eddie and his friends are scurrying to find the considerable funds necessary to enter Harry's card game. Cash in hand, Eddie enters the fray and eventually finds himself on the losing end of a pair of sevens (depressingly realistic hands for a change). Now the guys have a little problem: one week to come up with half a million pounds to pay off the hatchet man.
The clever and complicated plot twists and turns and finally comes full circle. Whereas the script is smart, our protagonists are not, and vast amounts of money change hands as often as the pair of antique firearms referred to in the title.
Writer/director Ritchie shoots all this with the grainy, sepia-toned imagery of an old-fashioned western. Whether it's an homage to that genre or an unabashed rip-off of "Trainspotting," one thing is clear: it's bloody funny.
-- David N. Butterworth<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


Hello world! This is HTML5 Boilerplate.
Hello there. This is a webapp to help you see when you have time to work on things of any nature.
Sunday
Monday
Tuesday
Wednesday
Thursday
Friday
Saturday
Bottom text.


@ngrx provides a set of clean, well-tested libraries for reactive programming in Angular applications.


--- layout: page title: "jQuery UI" prev: OEBPS/pr01s04.html next: OEBPS/pr01s06.html book_path: books/eric-sarrion-jquery-ui-_oeb/ --- {% include JB/setup %} {% raw %}
Safari Books Online (www.safaribooksonline.com) is an on-demand digital library that delivers expert content in both book and video form from the world’s leading authors in technology and business. Technology professionals, software developers, web designers, and business and creative professionals use Safari Books Online as their primary resource for research, problem solving, learning, and certification training.
Safari Books Online offers a range of product mixes and pricing programs for organizations, government agencies, and individuals. Subscribers have access to thousands of books, training videos, and prepublication manuscripts in one fully searchable database from publishers like O’Reilly Media, Prentice Hall Professional, Addison-Wesley Professional, Microsoft Press, Sams, Que, Peachpit Press, Focal Press, Cisco Press, John Wiley & Sons, Syngress, Morgan Kaufmann, IBM Redbooks, Packt, Adobe Press, FT Press, Apress, Manning, New Riders, McGraw-Hill, Jones & Bartlett, Course Technology, and dozens more. For more information about Safari Books Online, please visit us online.


|
Bullet Collision Detection & Physics Library
|
#include "gim_memory.h"
Go to the source code of this file.
Classes | |
| class | less_comparator |
| Macros for sorting. More... | |
| class | integer_comparator |
| Prototype for comparators. More... | |
| class | uint_key_func |
| Prototype for getting the integer representation of an object. More... | |
| class | copy_elements_func |
| Prototype for copying elements. More... | |
| class | memcopy_elements_func |
| Prototype for copying elements. More... | |
| struct | GIM_RSORT_TOKEN |
| class | GIM_RSORT_TOKEN_COMPARATOR |
| Prototype for comparators. More... | |
| #define | kHist 2048 |
| #define | D11_0(x) (x & 0x7FF) |
| #define | D11_1(x) (x >> 11 & 0x7FF) |
| #define | D11_2(x) (x >> 22) |
| void | gim_radix_sort_rtokens (GIM_RSORT_TOKEN *array, GIM_RSORT_TOKEN *sorted, GUINT element_count) |
| Radix sort for unsigned integer keys. More... | |
| template<typename T , class GETKEY_CLASS > | |
| void | gim_radix_sort_array_tokens (T *array, GIM_RSORT_TOKEN *sorted_tokens, GUINT element_count, GETKEY_CLASS uintkey_macro) |
| Get the sorted tokens from an array. For generic use. Tokens are IRR_RSORT_TOKEN. More... | |
| template<typename T , class GETKEY_CLASS , class COPY_CLASS > | |
| void | gim_radix_sort (T *array, GUINT element_count, GETKEY_CLASS get_uintkey_macro, COPY_CLASS copy_elements_macro) |
| Sorts array in place. For generic use. More... | |
| template<class T , typename KEYCLASS , typename COMP_CLASS > | |
| bool | gim_binary_search_ex (const T *_array, GUINT _start_i, GUINT _end_i, GUINT &_result_index, const KEYCLASS &_search_key, COMP_CLASS _comp_macro) |
| Failsafe Iterative binary search,. More... | |
| template<class T > | |
| bool | gim_binary_search (const T *_array, GUINT _start_i, GUINT _end_i, const T &_search_key, GUINT &_result_index) |
| Failsafe Iterative binary search,Template version. More... | |
| template<typename T , typename COMP_CLASS > | |
| void | gim_down_heap (T *pArr, GUINT k, GUINT n, COMP_CLASS CompareFunc) |
| heap sort from http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Heap/ More... | |
| template<typename T , typename COMP_CLASS > | |
| void | gim_heap_sort (T *pArr, GUINT element_count, COMP_CLASS CompareFunc) |
Definition in file gim_radixsort.h.
| #define D11_0 | ( | x | ) | (x & 0x7FF) |
Definition at line 132 of file gim_radixsort.h.
| #define D11_1 | ( | x | ) | (x >> 11 & 0x7FF) |
Definition at line 133 of file gim_radixsort.h.
| #define D11_2 | ( | x | ) | (x >> 22) |
Definition at line 134 of file gim_radixsort.h.
| #define kHist 2048 |
Definition at line 130 of file gim_radixsort.h.
| bool gim_binary_search | ( | const T * | _array, |
| GUINT | _start_i, | ||
| GUINT | _end_i, | ||
| const T & | _search_key, | ||
| GUINT & | _result_index | ||
| ) |
Failsafe Iterative binary search,Template version.
If the element is not found, it returns the nearest upper element position, may be the further position after the last element.
| _array | |
| _start_i | the beginning of the array |
| _end_i | the ending index of the array |
| _search_key | Value to find |
| _result_index | the index of the found element, or if not found then it will get the index of the closest bigger value |
Definition at line 304 of file gim_radixsort.h.
| bool gim_binary_search_ex | ( | const T * | _array, |
| GUINT | _start_i, | ||
| GUINT | _end_i, | ||
| GUINT & | _result_index, | ||
| const KEYCLASS & | _search_key, | ||
| COMP_CLASS | _comp_macro | ||
| ) |
Failsafe Iterative binary search,.
If the element is not found, it returns the nearest upper element position, may be the further position after the last element.
| _array | |
| _start_i | the beginning of the array |
| _end_i | the ending index of the array |
| _search_key | Value to find |
| _comp_macro | macro for comparing elements |
| _found | If true the value has found. Boolean |
| _result_index | the index of the found element, or if not found then it will get the index of the closest bigger value |
Definition at line 261 of file gim_radixsort.h.
| void gim_down_heap | ( | T * | pArr, |
| GUINT | k, | ||
| GUINT | n, | ||
| COMP_CLASS | CompareFunc | ||
| ) |
heap sort from http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Heap/
Definition at line 335 of file gim_radixsort.h.
| void gim_heap_sort | ( | T * | pArr, |
| GUINT | element_count, | ||
| COMP_CLASS | CompareFunc | ||
| ) |
Definition at line 366 of file gim_radixsort.h.
| void gim_radix_sort | ( | T * | array, |
| GUINT | element_count, | ||
| GETKEY_CLASS | get_uintkey_macro, | ||
| COPY_CLASS | copy_elements_macro | ||
| ) |
Sorts array in place. For generic use.
| type | Type of the array |
| array | |
| element_count | |
| get_uintkey_macro | Macro for extract the Integer value of the element. Similar to SIMPLE_GET_UINTKEY |
| copy_elements_macro | Macro for copy elements, similar to SIMPLE_COPY_ELEMENTS |
Definition at line 233 of file gim_radixsort.h.
| void gim_radix_sort_array_tokens | ( | T * | array, |
| GIM_RSORT_TOKEN * | sorted_tokens, | ||
| GUINT | element_count, | ||
| GETKEY_CLASS | uintkey_macro | ||
| ) |
Get the sorted tokens from an array. For generic use. Tokens are IRR_RSORT_TOKEN.
| array | Array of elements to sort |
| sorted_tokens | Tokens of sorted elements |
| element_count | element count |
| uintkey_macro | Functor which retrieves the integer representation of an array element |
Definition at line 208 of file gim_radixsort.h.
|
inline |
Radix sort for unsigned integer keys.
Definition at line 137 of file gim_radixsort.h.